Global Index

A

B

C

D

E

F

G

H

I

J

K

L

M

N

O

P

Q

R

S

T

U

V

W

X

Y

Z

_

other

(46433 entries)

Notation Index

A

B

C

D

E

F

G

H

I

J

K

L

M

N

O

P

Q

R

S

T

U

V

W

X

Y

Z

_

other

(334 entries)

Binder Index

A

B

C

D

E

F

G

H

I

J

K

L

M

N

O

P

Q

R

S

T

U

V

W

X

Y

Z

_

other

(33591 entries)

Module Index

A

B

C

D

E

F

G

H

I

J

K

L

M

N

O

P

Q

R

S

T

U

V

W

X

Y

Z

_

other

(44 entries)

Variable Index

A

B

C

D

E

F

G

H

I

J

K

L

M

N

O

P

Q

R

S

T

U

V

W

X

Y

Z

_

other

(1429 entries)

Library Index

A

B

C

D

E

F

G

H

I

J

K

L

M

N

O

P

Q

R

S

T

U

V

W

X

Y

Z

_

other

(389 entries)

Lemma Index

A

B

C

D

E

F

G

H

I

J

K

L

M

N

O

P

Q

R

S

T

U

V

W

X

Y

Z

_

other

(5088 entries)

Constructor Index

A

B

C

D

E

F

G

H

I

J

K

L

M

N

O

P

Q

R

S

T

U

V

W

X

Y

Z

_

other

(444 entries)

Inductive Index

A

B

C

D

E

F

G

H

I

J

K

L

M

N

O

P

Q

R

S

T

U

V

W

X

Y

Z

_

other

(168 entries)

Projection Index

A

B

C

D

E

F

G

H

I

J

K

L

M

N

O

P

Q

R

S

T

U

V

W

X

Y

Z

_

other

(150 entries)

Section Index

A

B

C

D

E

F

G

H

I

J

K

L

M

N

O

P

Q

R

S

T

U

V

W

X

Y

Z

_

other

(522 entries)

Instance Index

A

B

C

D

E

F

G

H

I

J

K

L

M

N

O

P

Q

R

S

T

U

V

W

X

Y

Z

_

other

(838 entries)

Abbreviation Index

A

B

C

D

E

F

G

H

I

J

K

L

M

N

O

P

Q

R

S

T

U

V

W

X

Y

Z

_

other

(241 entries)

Definition Index

A

B

C

D

E

F

G

H

I

J

K

L

M

N

O

P

Q

R

S

T

U

V

W

X

Y

Z

_

other

(3148 entries)

Record Index

A

B

C

D

E

F

G

H

I

J

K

L

M

N

O

P

Q

R

S

T

U

V

W

X

Y

Z

_

other

(47 entries)

---

Global Index

A

aa:57 [binder, in Undecidability.Shared.Libs.DLW.Utils.php]
aa:79 [binder, in Undecidability.Shared.Libs.DLW.Utils.php]
abbreviate [definition, in Undecidability.TM.Hoare.HoareTacticsView]
abstractDefs [section, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
abstractDefs.fixCoversHead [section, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
abstractDefs.fixCoversHead.p [variable, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
abstractDefs.X [variable, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
AbstractHeapMachine [library]
AbstractHeapMachineDef [library]
AbstractSubstMachine [library]
AbstractTimeHierarchyTheorem [library]
Acceptability [library]
Acc_chains [lemma, in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
Acc_irrelevance [lemma, in Undecidability.Shared.Libs.DLW.Wf.acc_irr]
Acc_irrelevance.Hf [variable, in Undecidability.Shared.Libs.DLW.Wf.acc_irr]
Acc_irrelevance.f [variable, in Undecidability.Shared.Libs.DLW.Wf.acc_irr]
Acc_irrelevance.P [variable, in Undecidability.Shared.Libs.DLW.Wf.acc_irr]
Acc_eq_total [lemma, in Undecidability.Shared.Libs.DLW.Wf.acc_irr]
Acc_eq [inductive, in Undecidability.Shared.Libs.DLW.Wf.acc_irr]
Acc_irrelevance.R [variable, in Undecidability.Shared.Libs.DLW.Wf.acc_irr]
Acc_irrelevance.X [variable, in Undecidability.Shared.Libs.DLW.Wf.acc_irr]
Acc_irrelevance [section, in Undecidability.Shared.Libs.DLW.Wf.acc_irr]
acc_conj_correct [lemma, in Undecidability.L.Computability.Acceptability]
acc_conj [definition, in Undecidability.L.Computability.Acceptability]
acc_irr [library]
acc':14 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_string]
acc':8 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_string]
acc:11 [binder, in Undecidability.L.TM.TapeFuns]
acc:12 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_string]
acc:124 [binder, in Complexity.Libs.CookPrelim.PolyBounds]
acc:126 [binder, in Complexity.Libs.CookPrelim.PolyBounds]
acc:129 [binder, in Complexity.Libs.CookPrelim.PolyBounds]
acc:16 [binder, in Complexity.L.TM.TMflatten]
acc:17 [binder, in Undecidability.L.TM.TapeFuns]
acc:19 [binder, in Undecidability.L.TM.TapeFuns]
acc:20 [binder, in Undecidability.L.Datatypes.List.List_fold]
acc:218 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
acc:22 [binder, in Complexity.L.TM.TMflatten]
acc:220 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
acc:228 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
acc:234 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
acc:26 [binder, in Complexity.L.TM.TMflatten]
acc:26 [binder, in Undecidability.L.Datatypes.List.List_fold]
acc:3097 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
acc:34 [binder, in Undecidability.L.Datatypes.List.List_fold]
acc:39 [binder, in Undecidability.L.Datatypes.List.List_fold]
acc:55 [binder, in Undecidability.L.Datatypes.List.List_basics]
acc:55 [binder, in Complexity.Libs.CookPrelim.PolyBounds]
acc:58 [binder, in Complexity.NP.SAT.SAT_inNP]
acc:6 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_string]
acc:60 [binder, in Undecidability.L.Datatypes.List.List_basics]
acc:61 [binder, in Complexity.NP.SAT.SAT_inNP]
acc:62 [binder, in Undecidability.L.Datatypes.List.List_basics]
acc:7 [binder, in Undecidability.L.TM.TapeFuns]
ackermann [definition, in Undecidability.L.Functions.Ackermann]
Ackermann [library]
Ack_pos [lemma, in Undecidability.L.Functions.Ackermann]
ACom [inductive, in Undecidability.TM.L.Alphabets]
ACom_eqb_spec [lemma, in Complexity.L.TM.CompCode]
ACom_eqb [definition, in Complexity.L.TM.CompCode]
ACom_inhab [instance, in Undecidability.TM.L.Alphabets]
ACom_finType [instance, in Undecidability.TM.L.Alphabets]
ACom_eq_dec [instance, in Undecidability.TM.L.Alphabets]
ACom2Com [definition, in Undecidability.TM.L.Alphabets]
actions:262 [binder, in Undecidability.TM.Util.TM_facts]
actions:45 [binder, in Complexity.L.TM.TMflatFun]
actions:52 [binder, in Undecidability.TM.Util.TM_facts]
actions:8 [binder, in Undecidability.L.TM.TMinL.TMinL_extract]
acts:119 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
acts:127 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
acts:133 [binder, in Undecidability.TM.Univ.LowLevel]
acts:135 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
acts:142 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
acts:146 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
acts:150 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
acts:150 [binder, in Undecidability.TM.Univ.LowLevel]
acts:159 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
acts:169 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
acts:18 [binder, in Undecidability.TM.Combinators.Mirror]
acts:197 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
acts:204 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
acts:211 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
acts:219 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
acts:226 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
acts:234 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
acts:242 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
acts:275 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
acts:38 [binder, in Undecidability.TM.Univ.Univ]
acts:39 [binder, in Complexity.L.TM.TMflatFun]
acts:4 [binder, in Undecidability.TM.Combinators.Mirror]
acts:492 [binder, in Undecidability.TM.Single.StepTM]
acts:498 [binder, in Undecidability.TM.Single.StepTM]
act:102 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
act:107 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
act:107 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
act:112 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
act:112 [binder, in Undecidability.TM.Lifting.LiftTapes]
act:115 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
act:116 [binder, in Undecidability.TM.Lifting.LiftTapes]
act:129 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
act:13 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TM_single]
act:130 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
act:142 [binder, in Undecidability.TM.Univ.LowLevel]
act:16 [binder, in Undecidability.TM.Combinators.Mirror]
act:162 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
act:172 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
act:194 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
act:2 [binder, in Undecidability.TM.Hoare.HoareStdLib]
act:25 [binder, in Undecidability.TM.Univ.Univ]
act:258 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
act:293 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
act:297 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
act:47 [binder, in Undecidability.TM.Lifting.LiftAlphabet]
act:472 [binder, in Undecidability.TM.Single.StepTM]
act:50 [binder, in Undecidability.TM.Lifting.LiftAlphabet]
act:656 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
act:660 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
act:68 [binder, in Complexity.L.TM.TMflatten]
act:9 [binder, in Undecidability.TM.Combinators.Mirror]
act:90 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
act:96 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
ac:7 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TM_single]
Add [definition, in Undecidability.TM.Code.NatTM]
Add [definition, in Undecidability.TM.Hoare.HoareMult]
Add [definition, in Undecidability.TM.Code.BinNumbers.PosAddTM]
Add [definition, in Undecidability.TM.Hoare.HoareExamples]
addC [definition, in Complexity.L.Functions.BinNumsAdd]
addC_ext_eq [lemma, in Complexity.L.Functions.BinNumsAdd]
addTR [definition, in Undecidability.TM.Code.BinNumbers.PosAddTM]
addTR_correct [lemma, in Undecidability.TM.Code.BinNumbers.PosAddTM]
addTR_rec_correct [lemma, in Undecidability.TM.Code.BinNumbers.PosAddTM]
addTR_rec' [definition, in Undecidability.TM.Code.BinNumbers.PosAddTM]
addTR_rec_carry [definition, in Undecidability.TM.Code.BinNumbers.PosAddTM]
addTR_rec [definition, in Undecidability.TM.Code.BinNumbers.PosAddTM]
add_le_mono [instance, in Undecidability.TM.Util.ArithPrelim]
Add_Terminates [lemma, in Undecidability.TM.Code.NatTM]
Add_T [definition, in Undecidability.TM.Code.NatTM]
Add_steps [definition, in Undecidability.TM.Code.NatTM]
Add_Main_Terminates [lemma, in Undecidability.TM.Code.NatTM]
Add_Main_T [definition, in Undecidability.TM.Code.NatTM]
Add_Main_steps [definition, in Undecidability.TM.Code.NatTM]
Add_Loop_Terminates [lemma, in Undecidability.TM.Code.NatTM]
Add_Loop_steps [definition, in Undecidability.TM.Code.NatTM]
Add_Computes [lemma, in Undecidability.TM.Code.NatTM]
Add_Rel [definition, in Undecidability.TM.Code.NatTM]
Add_space3 [definition, in Undecidability.TM.Code.NatTM]
Add_space2 [definition, in Undecidability.TM.Code.NatTM]
Add_Main_Realise [lemma, in Undecidability.TM.Code.NatTM]
Add_Main_Rel [definition, in Undecidability.TM.Code.NatTM]
Add_Loop_Realise [lemma, in Undecidability.TM.Code.NatTM]
Add_Loop_Rel [definition, in Undecidability.TM.Code.NatTM]
Add_Step_Sem [lemma, in Undecidability.TM.Code.NatTM]
Add_Step_Rel [definition, in Undecidability.TM.Code.NatTM]
Add_Main [definition, in Undecidability.TM.Code.NatTM]
Add_Loop [definition, in Undecidability.TM.Code.NatTM]
Add_Step [definition, in Undecidability.TM.Code.NatTM]
Add_N_Realise [lemma, in Undecidability.TM.Code.BinNumbers.NTM]
Add_N_Rel [definition, in Undecidability.TM.Code.BinNumbers.NTM]
Add_N [definition, in Undecidability.TM.Code.BinNumbers.NTM]
add_lt_lt [instance, in Complexity.Libs.CookPrelim.PolyBounds]
add_lt_lt [instance, in Complexity.Complexity.UpToCPoly]
Add_SpecT_space [lemma, in Undecidability.TM.Hoare.HoareMult]
Add_space [definition, in Undecidability.TM.Hoare.HoareMult]
Add_steps [definition, in Undecidability.TM.Hoare.HoareMult]
Add_Loop_SpecT_size [lemma, in Undecidability.TM.Hoare.HoareMult]
Add_Loop_size [definition, in Undecidability.TM.Hoare.HoareMult]
Add_Loop_steps [definition, in Undecidability.TM.Hoare.HoareMult]
Add_Loop [definition, in Undecidability.TM.Hoare.HoareMult]
Add_Step_SpecT_space [lemma, in Undecidability.TM.Hoare.HoareMult]
Add_Step_size [definition, in Undecidability.TM.Hoare.HoareMult]
Add_Step_steps [definition, in Undecidability.TM.Hoare.HoareMult]
Add_Step [definition, in Undecidability.TM.Hoare.HoareMult]
add_time [definition, in Undecidability.L.Datatypes.LNat]
Add_onto_Realise [lemma, in Undecidability.TM.Code.BinNumbers.PosAddTM]
Add_onto_Rel [definition, in Undecidability.TM.Code.BinNumbers.PosAddTM]
Add_onto [definition, in Undecidability.TM.Code.BinNumbers.PosAddTM]
Add_Realise [lemma, in Undecidability.TM.Code.BinNumbers.PosAddTM]
Add_Rel [definition, in Undecidability.TM.Code.BinNumbers.PosAddTM]
Add_Loop_Realise [lemma, in Undecidability.TM.Code.BinNumbers.PosAddTM]
Add_Loop [definition, in Undecidability.TM.Code.BinNumbers.PosAddTM]
Add_Loop_Rel [definition, in Undecidability.TM.Code.BinNumbers.PosAddTM]
Add_Step_Realise [lemma, in Undecidability.TM.Code.BinNumbers.PosAddTM]
Add_Step [definition, in Undecidability.TM.Code.BinNumbers.PosAddTM]
Add_Step_Rel [definition, in Undecidability.TM.Code.BinNumbers.PosAddTM]
Add_BaseCase_Realise [lemma, in Undecidability.TM.Code.BinNumbers.PosAddTM]
Add_BaseCase [definition, in Undecidability.TM.Code.BinNumbers.PosAddTM]
Add_BaseCase_Rel [definition, in Undecidability.TM.Code.BinNumbers.PosAddTM]
add_baseCase [definition, in Undecidability.TM.Code.BinNumbers.PosAddTM]
Add_SpecT_space [lemma, in Undecidability.TM.Hoare.HoareExamples]
Add_space [definition, in Undecidability.TM.Hoare.HoareExamples]
Add_SpecT [lemma, in Undecidability.TM.Hoare.HoareExamples]
Add_steps [definition, in Undecidability.TM.Hoare.HoareExamples]
Add_Loop_SpecT_size [lemma, in Undecidability.TM.Hoare.HoareExamples]
Add_Loop_size [definition, in Undecidability.TM.Hoare.HoareExamples]
Add_Loop_SpecT [lemma, in Undecidability.TM.Hoare.HoareExamples]
Add_Loop_steps [definition, in Undecidability.TM.Hoare.HoareExamples]
Add_Step_SpecT_space [lemma, in Undecidability.TM.Hoare.HoareExamples]
Add_Step_size [definition, in Undecidability.TM.Hoare.HoareExamples]
Add_Step_SpecT [lemma, in Undecidability.TM.Hoare.HoareExamples]
Add_Step_steps [definition, in Undecidability.TM.Hoare.HoareExamples]
Add_Loop_Spec [lemma, in Undecidability.TM.Hoare.HoareExamples]
Add_Loop [definition, in Undecidability.TM.Hoare.HoareExamples]
Add_Step_Spec [lemma, in Undecidability.TM.Hoare.HoareExamples]
Add_Step_Post [definition, in Undecidability.TM.Hoare.HoareExamples]
Add_Step [definition, in Undecidability.TM.Hoare.HoareExamples]
Add' [definition, in Undecidability.TM.Code.BinNumbers.PosAddTM]
Add'_N_Realise [lemma, in Undecidability.TM.Code.BinNumbers.NTM]
Add'_N_Rel [definition, in Undecidability.TM.Code.BinNumbers.NTM]
Add'_N [definition, in Undecidability.TM.Code.BinNumbers.NTM]
Add'_Realise [lemma, in Undecidability.TM.Code.BinNumbers.PosAddTM]
Add'_Rel [definition, in Undecidability.TM.Code.BinNumbers.PosAddTM]
adress_size [lemma, in Complexity.L.AbstractMachines.AbstractHeapMachine]
Afin:3143 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Aflat:3147 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
agreement_prelude [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
agreement_sim [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
agreement_transition [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
agreement_halt [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
agreement_nonhalt [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
agreement_trans_unfold_env [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
agreement_tape [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
agreement_mti [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
agreement_mtl [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
agreement_mtr [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
akk:13 [binder, in Complexity.L.AbstractMachines.FunctionalDefinitions]
akk:20 [binder, in Complexity.L.AbstractMachines.FunctionalDefinitions]
akk:27 [binder, in Complexity.L.AbstractMachines.FunctionalDefinitions]
akk:44 [binder, in Complexity.L.AbstractMachines.FunctionalDefinitions]
akk:6 [binder, in Complexity.L.AbstractMachines.FunctionalDefinitions]
allArgs [definition, in Complexity.L.TM.TMflatten]
allenv:3120 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
allEnv:3174 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
allEnv:3192 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
allEnv:380 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
allEnv:383 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
allFinCards [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
allFinSimCards [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
allFlatCards [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
allFlatCards_size_poly [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
allFlatCards_size_bound [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
allFlatCards_ofFlatType [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
allFlatCards_length_poly [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
allFlatCards_length [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
allFlatCards_poly [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
allFlatCards_time_bound [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
allFlatCards_time [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
allFlatSimCards [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
allnVecs [definition, in Complexity.L.TM.TMflatten]
allPairsOfEdges_decb_poly [lemma, in Complexity.NP.Clique.FlatClique]
allPairsOfEdges_decb_time_bound [lemma, in Complexity.NP.Clique.FlatClique]
allPairsOfEdges_decb_time [definition, in Complexity.NP.Clique.FlatClique]
allPairsOfEdges_decb_step_time [definition, in Complexity.NP.Clique.FlatClique]
allPairsOfEdges_decb_step [definition, in Complexity.NP.Clique.FlatClique]
allPairsOfEdges_decb_iff [lemma, in Complexity.NP.Clique.FlatClique]
allPairsOfEdges_decb [definition, in Complexity.NP.Clique.FlatClique]
allPositions [definition, in Complexity.NP.Clique.kSAT_to_FlatClique]
allPositions_poly [lemma, in Complexity.NP.Clique.kSAT_to_FlatClique]
allPositions_time_bound [lemma, in Complexity.NP.Clique.kSAT_to_FlatClique]
allPositions_time [definition, in Complexity.NP.Clique.kSAT_to_FlatClique]
allPositions_sound [lemma, in Complexity.NP.Clique.kSAT_to_FlatClique]
allRules [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
allSameEntry [definition, in Complexity.L.TM.TMunflatten]
allSameEntry_poly [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
allSameEntry_time_bound [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
allSameEntry_time [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
allSameEntry_step_time [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
allSameEntry_step [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
allSameEntry_time_le [lemma, in Complexity.L.TM.TMflatComp]
allSameEntry_time [definition, in Complexity.L.TM.TMflatComp]
allSameEntry_helper [definition, in Complexity.L.TM.TMflatComp]
allSameEntry_spec [lemma, in Complexity.L.TM.TMunflatten]
allSub [lemma, in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
alltrue [definition, in Undecidability.TM.L.CompilerBoolFuns.Compiler_nat_facts]
all_vec_correct2 [lemma, in Undecidability.TM.Compound.TMTac]
all_vec_correct [lemma, in Undecidability.TM.Compound.TMTac]
all_vec [definition, in Undecidability.TM.Compound.TMTac]
all_Fin [definition, in Undecidability.Shared.Libs.PSL.FiniteTypes.Arbitrary]
Alphabet [abbreviation, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
AlphabetLifting [section, in Undecidability.TM.Hoare.HoareRegister]
AlphabetLifting' [section, in Undecidability.TM.Hoare.HoareRegister]
AlphabetLifting'.n [variable, in Undecidability.TM.Hoare.HoareRegister]
AlphabetLifting'.retr [variable, in Undecidability.TM.Hoare.HoareRegister]
AlphabetLifting'.sig [variable, in Undecidability.TM.Hoare.HoareRegister]
AlphabetLifting'.tau [variable, in Undecidability.TM.Hoare.HoareRegister]
AlphabetLifting.n [variable, in Undecidability.TM.Hoare.HoareRegister]
AlphabetLifting.retr [variable, in Undecidability.TM.Hoare.HoareRegister]
AlphabetLifting.sig [variable, in Undecidability.TM.Hoare.HoareRegister]
AlphabetLifting.tau [variable, in Undecidability.TM.Hoare.HoareRegister]
Alphabets [library]
alpha:11 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
alpha:14 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
alpha:15 [binder, in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisStep]
alpha:17 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
alpha:18 [binder, in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisStep]
alpha:2 [binder, in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisUnfoldClos]
alpha:2 [binder, in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisStep]
alpha:3 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
alpha:4 [binder, in Complexity.L.AbstractMachines.Computable.Lookup]
alpha:4 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachine]
alpha:7 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
alpha:8 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
alpha:97 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachine]
Analysis [section, in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisStep]
Analysis [section, in Complexity.L.AbstractMachines.AbstractHeapMachine]
Analysis.empty_H__init [variable, in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisStep]
Analysis.H [variable, in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisStep]
Analysis.H [variable, in Complexity.L.AbstractMachines.AbstractHeapMachine]
Analysis.H__init [variable, in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisStep]
Analysis.i [variable, in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisStep]
Analysis.i [variable, in Complexity.L.AbstractMachines.AbstractHeapMachine]
Analysis.P0 [variable, in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisStep]
Analysis.R [variable, in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisStep]
Analysis.R [variable, in Complexity.L.AbstractMachines.AbstractHeapMachine]
Analysis.s0 [variable, in Complexity.L.AbstractMachines.AbstractHeapMachine]
Analysis.T [variable, in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisStep]
Analysis.T [variable, in Complexity.L.AbstractMachines.AbstractHeapMachine]
Analysis.V [variable, in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisStep]
Analysis.V [variable, in Complexity.L.AbstractMachines.AbstractHeapMachine]
and_dec [instance, in Undecidability.Shared.Libs.PSL.EqDec]
and_dec [instance, in Undecidability.Shared.Dec]
and_compat [lemma, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
app [constructor, in Undecidability.L.L]
App [definition, in Undecidability.L.Complexity.GenericNary]
App [definition, in Undecidability.TM.Code.List.App]
App [library]
appAT [constructor, in Undecidability.TM.L.Alphabets]
appCross [definition, in Undecidability.L.Computability.Enum]
appCross_dupfree [lemma, in Undecidability.L.Computability.Enum]
appCross_app [lemma, in Undecidability.L.Computability.Enum]
appCross_correct [lemma, in Undecidability.L.Computability.Enum]
Append [section, in Undecidability.TM.Code.List.App]
appendNil [lemma, in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
append_bit_removeLSB [lemma, in Undecidability.TM.Code.BinNumbers.PosDefinitions]
append_bits_bit [lemma, in Undecidability.TM.Code.BinNumbers.PosDefinitions]
append_bits [definition, in Undecidability.TM.Code.BinNumbers.PosDefinitions]
append_bit [definition, in Undecidability.TM.Code.BinNumbers.PosDefinitions]
Append.cX [variable, in Undecidability.TM.Code.List.App]
Append.defX [variable, in Undecidability.TM.Code.List.App]
Append.sigX [variable, in Undecidability.TM.Code.List.App]
Append.stop [variable, in Undecidability.TM.Code.List.App]
Append.X [variable, in Undecidability.TM.Code.List.App]
apply_encs_to [definition, in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
apply_to_equiv' [lemma, in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
apply_to_cons [lemma, in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
apply_to [definition, in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
apply_sizeFun [definition, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
Apprec:54 [binder, in Undecidability.L.Complexity.GenericNary]
Apprec:58 [binder, in Undecidability.L.Complexity.GenericNary]
appSize [definition, in Undecidability.TM.Hoare.HoareRegister]
appT [constructor, in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
appT [constructor, in Undecidability.L.AbstractMachines.FlatPro.ProgramsDef]
App_nice.cX [variable, in Complexity.TM.PrettyBounds.BaseCode]
App_nice.X [variable, in Complexity.TM.PrettyBounds.BaseCode]
App_nice.sigX [variable, in Complexity.TM.PrettyBounds.BaseCode]
App_nice [section, in Complexity.TM.PrettyBounds.BaseCode]
app_closed [lemma, in Undecidability.L.Util.L_facts]
app_converges [lemma, in Undecidability.L.Computability.Seval]
app_comm_cons' [lemma, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
app_equi_proper [instance, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
app_incl_proper [instance, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
app_singleton_inv_nil [lemma, in Undecidability.TM.Code.BinNumbers.EncodeBinNumbers]
app_singleton_inv [lemma, in Undecidability.TM.Code.BinNumbers.EncodeBinNumbers]
app_cons_neq [lemma, in Undecidability.TM.Code.CompareValue]
app_eq_proper [lemma, in Undecidability.L.Tactics.Lbeta_nonrefl]
App_Com_Terminates [lemma, in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
App_Com_T [definition, in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
App_Com_steps [definition, in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
App_Com_Realise [lemma, in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
App_Com_Rel [definition, in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
App_Com_size [definition, in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
App_Com [definition, in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
App_ACom_Terminates [lemma, in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
App_ACom_T [definition, in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
App_ACom_steps [definition, in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
App_ACom_Realise [lemma, in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
App_ACom_Rel [definition, in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
App_ACom_size [definition, in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
App_ACom [definition, in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
app_fold5 [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
App_Const_simpl [lemma, in Undecidability.L.Complexity.GenericNary]
App_eqn_3 [lemma, in Undecidability.L.Complexity.GenericNary]
App_eqn_2 [lemma, in Undecidability.L.Complexity.GenericNary]
App_eqn_1 [lemma, in Undecidability.L.Complexity.GenericNary]
app_seperate [lemma, in Undecidability.TM.Code.Code]
app_equi_proper [instance, in Undecidability.Shared.ListAutomation]
app_incl_proper [instance, in Undecidability.Shared.ListAutomation]
app_incl_R [lemma, in Undecidability.Shared.ListAutomation]
app_incl_l [lemma, in Undecidability.Shared.ListAutomation]
APP_right_Spec [lemma, in Undecidability.TM.L.CompilerBoolFuns.Compiler]
APP_right [definition, in Undecidability.TM.L.CompilerBoolFuns.Compiler]
APP_right [section, in Undecidability.TM.L.CompilerBoolFuns.Compiler]
App_nice.cX [variable, in Undecidability.TM.Code.List.App]
App_nice.X [variable, in Undecidability.TM.Code.List.App]
App_nice.sigX [variable, in Undecidability.TM.Code.List.App]
App_nice [section, in Undecidability.TM.Code.List.App]
App_SpecT [lemma, in Undecidability.TM.Code.List.App]
App_Terminates [lemma, in Undecidability.TM.Code.List.App]
App_T [definition, in Undecidability.TM.Code.List.App]
App_steps [definition, in Undecidability.TM.Code.List.App]
App_Realise [lemma, in Undecidability.TM.Code.List.App]
App_Rel [definition, in Undecidability.TM.Code.List.App]
App_size [definition, in Undecidability.TM.Code.List.App]
app_or_nil [lemma, in Undecidability.TM.Code.List.App]
app_singleton [lemma, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
app_length_split [lemma, in Complexity.Libs.CookPrelim.MorePrelim]
app_eq_length [lemma, in Complexity.Libs.CookPrelim.MorePrelim]
App' [definition, in Undecidability.TM.Code.List.App]
App'_steps_nice [lemma, in Complexity.TM.PrettyBounds.BaseCode]
App'_steps_nice [lemma, in Undecidability.TM.Code.List.App]
App'_SpecT [lemma, in Undecidability.TM.Code.List.App]
App'_sizeV [definition, in Undecidability.TM.Code.List.App]
App'_Terminates [lemma, in Undecidability.TM.Code.List.App]
App'_T [definition, in Undecidability.TM.Code.List.App]
App'_steps [definition, in Undecidability.TM.Code.List.App]
App'_Realise [lemma, in Undecidability.TM.Code.List.App]
App'_Rel [definition, in Undecidability.TM.Code.List.App]
App'_size [definition, in Undecidability.TM.Code.List.App]
Arbitrary [library]
arem [definition, in Undecidability.Shared.Libs.DLW.Utils.gcd]
args:100 [binder, in Undecidability.L.Tactics.Extract]
args:132 [binder, in Undecidability.L.Tactics.Extract]
args:137 [binder, in Undecidability.L.Tactics.Extract]
args:23 [binder, in Undecidability.L.Tactics.GenEncode]
args:39 [binder, in Undecidability.L.Tactics.GenEncode]
argument_types [definition, in Undecidability.L.Tactics.Extract]
ArithPrelim [library]
ARS [library]
ARSNotations [module, in Undecidability.L.Prelim.ARS]
_ =2 _ [notation, in Undecidability.L.Prelim.ARS]
_ <=2 _ [notation, in Undecidability.L.Prelim.ARS]
_ =1 _ [notation, in Undecidability.L.Prelim.ARS]
_ <=1 _ [notation, in Undecidability.L.Prelim.ARS]
asPointwise [lemma, in Undecidability.TM.Hoare.HoareLogic]
Assert [definition, in Undecidability.TM.Hoare.HoareLogic]
assgn [abbreviation, in Complexity.NP.SAT.SharedSAT]
assgn_varsIn_restrict [lemma, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
assgn_varsIn_monotonic [lemma, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
assgn_varsIn_app [lemma, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
assgn_varsIn [definition, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
assignment_small_size [lemma, in Complexity.NP.SAT.SAT_inNP]
assignment_small [definition, in Complexity.NP.SAT.SAT_inNP]
atBit [definition, in Undecidability.TM.Code.BinNumbers.PosPointers]
atBit_ext [lemma, in Undecidability.TM.Code.BinNumbers.PosPointers]
atBit_moveLeft_atHSB [lemma, in Undecidability.TM.Code.BinNumbers.PosPointers]
atBit_moveLeft_cons [lemma, in Undecidability.TM.Code.BinNumbers.PosPointers]
atBit_moveRight [lemma, in Undecidability.TM.Code.BinNumbers.PosPointers]
atBit_moveRight_cons [lemma, in Undecidability.TM.Code.BinNumbers.PosPointers]
atBit_writeMove_movedToLeft [lemma, in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
atCons [definition, in Undecidability.TM.Single.StepTM]
atCons_current [definition, in Undecidability.TM.Single.StepTM]
atCons_current_rightof [definition, in Undecidability.TM.Single.StepTM]
atCons_current_midtape [definition, in Undecidability.TM.Single.StepTM]
atCons_current_leftof [definition, in Undecidability.TM.Single.StepTM]
atCons_current_niltape [definition, in Undecidability.TM.Single.StepTM]
atHSB [definition, in Undecidability.TM.Code.BinNumbers.PosPointers]
atHSB_ext [lemma, in Undecidability.TM.Code.BinNumbers.PosPointers]
atHSB_moveLeft_contains [lemma, in Undecidability.TM.Code.BinNumbers.PosPointers]
atLSB [definition, in Undecidability.TM.Code.BinNumbers.PosPointers]
atLSB_ext [lemma, in Undecidability.TM.Code.BinNumbers.PosPointers]
atLSB_moveRight_contains_rev [lemma, in Undecidability.TM.Code.BinNumbers.PosPointers]
atNil [definition, in Undecidability.TM.Single.StepTM]
atStart [definition, in Undecidability.TM.Single.StepTM]
atStart_contains [lemma, in Undecidability.TM.Single.StepTM]
aT:5 [binder, in Undecidability.L.Datatypes.List.List_enc]
AT:7 [binder, in Undecidability.L.Datatypes.List.List_enc]
aT:72 [binder, in Complexity.NP.TM.LM_to_mTM]
AT:74 [binder, in Complexity.NP.TM.LM_to_mTM]
AutoIndTac [library]
aux [abbreviation, in Undecidability.TM.L.CompilerBoolFuns.Compiler]
aux [abbreviation, in Undecidability.TM.L.CompilerBoolFuns.Compiler]
auxk [abbreviation, in Undecidability.TM.L.CompilerBoolFuns.Compiler]
auxm [abbreviation, in Undecidability.TM.L.CompilerBoolFuns.Compiler]
A_int:67 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
A_j:111 [binder, in Undecidability.L.Tactics.Extract]
A_j:8 [binder, in Undecidability.L.Tactics.GenEncode]
a':105 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
A':111 [binder, in Undecidability.Shared.Libs.PSL.Retracts]
a':112 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
a':118 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
a':125 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
A':126 [binder, in Undecidability.Shared.Libs.PSL.Retracts]
a':131 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
a':138 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
a':138 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
a':139 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
a':139 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
a':140 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
a':144 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
A':144 [binder, in Undecidability.Shared.Libs.PSL.Retracts]
a':152 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
a':155 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
a':169 [binder, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
a':203 [binder, in Undecidability.L.Tactics.Extract]
a':207 [binder, in Undecidability.L.Tactics.Extract]
a':23 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachine]
a':230 [binder, in Undecidability.L.Tactics.Extract]
A':26 [binder, in Undecidability.L.Tactics.Extract]
A':2664 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
A':2683 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a':2685 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
A':2704 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a':2707 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a':31 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachine]
a':34 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.FiniteFunction]
a':365 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
a':3653 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a':3667 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a':3674 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a':40 [binder, in Undecidability.TM.Util.Prelim]
a':41 [binder, in Undecidability.L.Functions.FinTypeLookup]
a':44 [binder, in Undecidability.TM.Util.Prelim]
a':52 [binder, in Undecidability.L.Functions.FinTypeLookup]
a':58 [binder, in Complexity.L.TM.TMunflatten]
a':6 [binder, in Complexity.NP.SAT.SharedSAT]
a':77 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
a':9 [binder, in Complexity.NP.SAT.SharedSAT]
A':90 [binder, in Undecidability.Shared.Libs.PSL.Retracts]
a':90 [binder, in Complexity.L.TM.TMunflatten]
a':91 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
A':99 [binder, in Undecidability.Shared.Libs.PSL.Retracts]
a':99 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
A0:6 [binder, in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
A1p [lemma, in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
a1:107 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
a1:15 [binder, in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
A1:20 [binder, in Undecidability.Shared.Libs.PSL.Lists.Dupfree]
a1:21 [binder, in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
A1:21 [binder, in Undecidability.Shared.Libs.PSL.Lists.Dupfree]
A1:26 [binder, in Complexity.Libs.Pigeonhole]
A1:29 [binder, in Complexity.Libs.Pigeonhole]
a1:3 [binder, in Undecidability.TM.Code.CasePair]
A1:3 [binder, in Complexity.NP.SAT.CookLevin.Reductions.CC_to_BinaryCC]
a1:3 [binder, in Undecidability.TM.Code.List.App]
a1:30 [binder, in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
a1:36 [binder, in Complexity.Complexity.SpaceBoundsTime]
A1:38 [binder, in Complexity.Complexity.SpaceBoundsTime]
a1:39 [binder, in Complexity.NP.SAT.SAT]
A1:4 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
A1:40 [binder, in Undecidability.Shared.Libs.PSL.Lists.Dupfree]
a1:42 [binder, in Complexity.NP.SAT.SAT]
a1:45 [binder, in Complexity.NP.SAT.SAT]
a1:53 [binder, in Undecidability.TM.Util.Prelim]
a1:57 [binder, in Undecidability.TM.Util.Prelim]
A1:7 [binder, in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
A1:7 [binder, in Undecidability.Shared.Libs.DLW.Wf.acc_irr]
a1:79 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
a1:99 [binder, in Undecidability.TM.Lifting.LiftTapes]
A2p [lemma, in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
a2:100 [binder, in Undecidability.TM.Lifting.LiftTapes]
a2:108 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
a2:16 [binder, in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
a2:22 [binder, in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
A2:22 [binder, in Undecidability.Shared.Libs.PSL.Lists.Dupfree]
A2:27 [binder, in Complexity.Libs.Pigeonhole]
A2:31 [binder, in Complexity.Libs.Pigeonhole]
a2:31 [binder, in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
a2:37 [binder, in Complexity.Complexity.SpaceBoundsTime]
A2:39 [binder, in Complexity.Complexity.SpaceBoundsTime]
a2:4 [binder, in Undecidability.TM.Code.CasePair]
a2:4 [binder, in Undecidability.TM.Code.List.App]
a2:40 [binder, in Complexity.NP.SAT.SAT]
A2:41 [binder, in Undecidability.Shared.Libs.PSL.Lists.Dupfree]
a2:43 [binder, in Complexity.NP.SAT.SAT]
a2:46 [binder, in Complexity.NP.SAT.SAT]
a2:54 [binder, in Undecidability.TM.Util.Prelim]
a2:60 [binder, in Undecidability.TM.Util.Prelim]
A2:8 [binder, in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
A2:8 [binder, in Undecidability.Shared.Libs.DLW.Wf.acc_irr]
a2:80 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
A3p [lemma, in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
A3:32 [binder, in Complexity.Libs.Pigeonhole]
A3:42 [binder, in Undecidability.Shared.Libs.PSL.Lists.Dupfree]
a3:55 [binder, in Undecidability.TM.Util.Prelim]
a3:58 [binder, in Undecidability.TM.Util.Prelim]
A4p [lemma, in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
a:1 [binder, in Undecidability.TM.Code.BinNumbers.PosMultTM]
A:1 [binder, in Complexity.L.Datatypes.LDepPair]
A:1 [binder, in Undecidability.L.Computability.Enum]
a:1 [binder, in Complexity.NP.SAT.SharedSAT]
a:1 [binder, in Undecidability.TM.PrettyBounds.SizeBounds]
A:1 [binder, in Complexity.L.AbstractMachines.Computable.Shared]
A:1 [binder, in Complexity.TM.Single.EncodeTapesInvariants]
A:1 [binder, in Undecidability.L.Prelim.MoreBase]
A:1 [binder, in Complexity.L.TM.CompCode]
A:1 [binder, in Undecidability.L.Datatypes.List.List_extra]
A:1 [binder, in Complexity.L.TM.TMunflatten]
a:1 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
a:1 [binder, in Complexity.Libs.CookPrelim.Tactics]
A:1 [binder, in Undecidability.TM.Hoare.HoareTacticsView]
A:1 [binder, in Undecidability.L.Functions.EnumInt]
a:1 [binder, in Undecidability.TM.Hoare.HoareMult]
A:1 [binder, in Undecidability.L.Computability.Synthetic]
a:1 [binder, in Complexity.NP.SAT.SAT]
A:1 [binder, in Undecidability.TM.Code.CasePair]
a:1 [binder, in Undecidability.TM.Code.BinNumbers.PosAddTM]
A:1 [binder, in Undecidability.TM.Code.List.App]
A:1 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.FiniteFunction]
A:10 [binder, in Undecidability.Shared.Libs.PSL.Lists.Removal]
A:10 [binder, in Undecidability.L.Complexity.UpToCNary]
A:10 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
a:10 [binder, in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisUnfoldClos]
A:10 [binder, in Undecidability.Shared.Libs.PSL.Lists.Position]
A:10 [binder, in Undecidability.Shared.Libs.PSL.Inhabited]
a:10 [binder, in Complexity.L.AbstractMachines.UnfoldHeap]
A:10 [binder, in Undecidability.L.Datatypes.List.List_nat]
a:10 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachine]
A:10 [binder, in Undecidability.Shared.Libs.PSL.Lists.Cardinality]
a:10 [binder, in Undecidability.TM.Hoare.HoareMult]
A:10 [binder, in Undecidability.L.Prelim.MoreList]
a:100 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
a:1006 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
a:1009 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
A:101 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
a:101 [binder, in Complexity.Libs.CookPrelim.PolyBounds]
a:101 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
a:101 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:1019 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
a:102 [binder, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
a:102 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
a:102 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachine]
a:102 [binder, in Undecidability.TM.L.HeapInterpreter.LookupTM]
a:103 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
A:103 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
a:104 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
a:104 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
a:104 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
a:1042 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
a:1044 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
a:105 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
A:105 [binder, in Complexity.L.TM.CompCode]
a:106 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
a:106 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
a:106 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.CC]
a:1067 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
A:107 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
A:107 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
a:107 [binder, in Undecidability.TM.L.HeapInterpreter.LookupTM]
a:1082 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:109 [binder, in Undecidability.L.Tactics.Extract]
a:109 [binder, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
a:109 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
A:109 [binder, in Complexity.L.TM.CompCode]
a:109 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
a:1090 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:1098 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
A:11 [binder, in Complexity.Libs.Pigeonhole]
A:11 [binder, in Undecidability.TM.Compound.TMTac]
A:11 [binder, in Undecidability.Shared.FilterFacts]
a:11 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
A:11 [binder, in Undecidability.Shared.Libs.PSL.Lists.Removal]
a:11 [binder, in Undecidability.TM.Code.BinNumbers.PosMultTM]
A:11 [binder, in Complexity.NP.L.CanEnumTerm]
A:11 [binder, in Undecidability.L.Tactics.LClos]
A:11 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
A:11 [binder, in Undecidability.Shared.Libs.PSL.Lists.Filter]
A:11 [binder, in Undecidability.Shared.Libs.PSL.Inhabited]
A:11 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.VectorFin]
A:11 [binder, in Complexity.L.TM.TMflatComp]
A:11 [binder, in Undecidability.L.Datatypes.List.List_extra]
A:11 [binder, in Undecidability.L.Functions.EnumInt]
A:11 [binder, in Undecidability.Shared.Libs.PSL.Lists.Cardinality]
A:11 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.Cardinality]
A:11 [binder, in Undecidability.TM.Code.List.App]
A:11 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.FiniteFunction]
a:11 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
A:110 [binder, in Undecidability.Shared.Libs.PSL.Retracts]
a:110 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
a:111 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
a:111 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
a:111 [binder, in Undecidability.TM.L.HeapInterpreter.LookupTM]
a:111 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
A:112 [binder, in Undecidability.L.Tactics.Extract]
A:112 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
a:112 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
a:1127 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:1129 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:113 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
a:1131 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:1136 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
A:114 [binder, in Undecidability.L.Tactics.LClos]
a:114 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
a:114 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.CC]
a:1144 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:115 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
a:1152 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:116 [binder, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
a:116 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
A:116 [binder, in Undecidability.L.Tactics.LClos]
a:116 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
a:116 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
a:116 [binder, in Undecidability.TM.L.HeapInterpreter.LookupTM]
a:117 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
a:117 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
a:118 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.CC]
A:118 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
a:1181 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:1183 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:1185 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:119 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
a:119 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
a:119 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
a:1190 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:1198 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:12 [binder, in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
A:12 [binder, in Undecidability.Shared.Libs.PSL.FCI]
A:12 [binder, in Undecidability.TM.Compound.TMTac]
A:12 [binder, in Undecidability.L.Datatypes.LOptions]
A:12 [binder, in Complexity.L.AbstractMachines.FlatPro.Computable.Decompile]
A:12 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
A:12 [binder, in Undecidability.Shared.Libs.PSL.Lists.Position]
a:12 [binder, in Undecidability.TM.Util.Prelim]
A:12 [binder, in Undecidability.Shared.Libs.PSL.Inhabited]
a:12 [binder, in Complexity.NP.SAT.FSAT.FSAT]
A:12 [binder, in Undecidability.Shared.Libs.PSL.Lists.Power]
a:12 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
A:12 [binder, in Undecidability.Shared.Libs.PSL.Lists.Dupfree]
A:120 [binder, in Undecidability.L.Tactics.LClos]
a:120 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
a:120 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
a:1206 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:121 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
a:121 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
a:122 [binder, in Complexity.TM.PrettyBounds.UnivBounds]
a:122 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
A:122 [binder, in Undecidability.L.Tactics.LClos]
a:122 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
a:122 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
A:123 [binder, in Undecidability.L.Tactics.Extract]
a:123 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
a:123 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
a:123 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
a:1235 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:1237 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:1239 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:124 [binder, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
A:124 [binder, in Undecidability.L.Tactics.LClos]
a:124 [binder, in Complexity.NP.SAT.SAT_inNP]
a:124 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
A:125 [binder, in Undecidability.Shared.Libs.PSL.Retracts]
A:125 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
a:125 [binder, in Undecidability.TM.Hoare.HoareExamples]
A:126 [binder, in Undecidability.L.Tactics.LClos]
a:126 [binder, in Complexity.NP.Clique.kSAT_to_Clique]
a:127 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
A:127 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
a:127 [binder, in Complexity.NP.SAT.SAT_inNP]
a:127 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
A:127 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
a:128 [binder, in Undecidability.L.Tactics.LClos]
a:128 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
a:128 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
A:129 [binder, in Undecidability.L.Tactics.LClos]
a:129 [binder, in Undecidability.TM.Hoare.HoareExamples]
a:13 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
A:13 [binder, in Undecidability.Shared.Libs.PSL.Lists.Removal]
a:13 [binder, in Undecidability.TM.Code.NatTM]
a:13 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
a:13 [binder, in Complexity.NP.SAT.FSAT.FSAT]
A:13 [binder, in Undecidability.L.Datatypes.List.List_eqb]
A:13 [binder, in Undecidability.L.Tactics.ComputableTactics]
a:13 [binder, in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
A:13 [binder, in Undecidability.L.Complexity.GenericNary]
A:13 [binder, in Undecidability.Shared.Libs.PSL.Lists.Cardinality]
a:13 [binder, in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
A:13 [binder, in Undecidability.L.Tactics.Computable]
A:13 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.CompoundFinTypes]
a:13 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
A:13 [binder, in Undecidability.L.Prelim.MoreList]
a:130 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
A:130 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
A:130 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
a:131 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
a:131 [binder, in Undecidability.TM.Hoare.HoareExamples]
a:131 [binder, in Complexity.NP.Clique.kSAT_to_FlatClique]
a:132 [binder, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
A:132 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
a:132 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
A:133 [binder, in Undecidability.L.Tactics.LClos]
a:133 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.CC]
a:134 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
A:134 [binder, in Complexity.L.TM.CompCode]
a:134 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
a:134 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachine]
a:134 [binder, in Undecidability.TM.Hoare.HoareExamples]
a:135 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
A:135 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
a:135 [binder, in Complexity.NP.SAT.SAT_inNP]
a:135 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
a:135 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
A:136 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
a:136 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachine]
a:136 [binder, in Complexity.NP.Clique.kSAT_to_Clique]
a:137 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
a:137 [binder, in Complexity.Libs.CookPrelim.PolyBounds]
a:137 [binder, in Undecidability.TM.Hoare.HoareExamples]
a:137 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
a:138 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
a:138 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
A:138 [binder, in Complexity.L.TM.CompCode]
a:138 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
a:138 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachine]
a:138 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
a:139 [binder, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
a:139 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
a:139 [binder, in Complexity.NP.SAT.SAT_inNP]
A:14 [binder, in Complexity.Libs.Pigeonhole]
A:14 [binder, in Undecidability.Shared.Libs.PSL.FCI]
A:14 [binder, in Undecidability.Shared.FilterFacts]
A:14 [binder, in Undecidability.L.Complexity.UpToCNary]
A:14 [binder, in Complexity.NP.L.CanEnumTerm]
a:14 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
a:14 [binder, in Undecidability.TM.Combinators.Switch]
A:14 [binder, in Undecidability.Shared.Libs.PSL.Lists.Filter]
a:14 [binder, in Undecidability.L.Datatypes.List.List_in]
a:14 [binder, in Undecidability.TM.Hoare.HoareMult]
A:14 [binder, in Undecidability.Shared.ListAutomation]
a:14 [binder, in Complexity.NP.SAT.SAT]
a:14 [binder, in Undecidability.TM.Code.BinNumbers.PosAddTM]
a:14 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.FiniteFunction]
A:14 [binder, in Undecidability.L.Prelim.MoreList]
A:140 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
A:140 [binder, in Undecidability.TM.Compound.Compare]
a:140 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
a:140 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
a:141 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
a:141 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachine]
a:141 [binder, in Undecidability.TM.Hoare.HoareExamples]
a:141 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
A:142 [binder, in Undecidability.L.Tactics.Extract]
A:142 [binder, in Complexity.TM.PrettyBounds.UnivBounds]
a:142 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
a:142 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
A:143 [binder, in Undecidability.Shared.Libs.PSL.Retracts]
a:143 [binder, in Undecidability.L.Tactics.Extract]
a:143 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
a:143 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachine]
a:144 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
a:144 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
a:144 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
a:144 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
a:145 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
a:145 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachine]
a:145 [binder, in Undecidability.TM.Hoare.HoareExamples]
A:146 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
a:146 [binder, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
a:146 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
a:147 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
a:148 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
a:148 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
a:148 [binder, in Undecidability.Shared.Libs.DLW.Utils.php]
a:148 [binder, in Undecidability.TM.Hoare.HoareExamples]
a:149 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
a:149 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
a:149 [binder, in Complexity.Libs.CookPrelim.PolyBounds]
a:15 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
A:15 [binder, in Complexity.L.AbstractMachines.FlatPro.Computable.Decompile]
A:15 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
a:15 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
a:15 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
a:15 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.VectorFin]
a:15 [binder, in Complexity.NP.SAT.SAT_inNP]
a:15 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
A:15 [binder, in Undecidability.Shared.Libs.PSL.Lists.Power]
a:15 [binder, in Undecidability.TM.Combinators.StateWhile]
A:15 [binder, in Undecidability.L.Complexity.GenericNary]
A:15 [binder, in Undecidability.Shared.Libs.PSL.Lists.Cardinality]
a:15 [binder, in Undecidability.L.Functions.FinTypeLookup]
A:15 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.Cardinality]
a:150 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
a:150 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
A:151 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
A:151 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachine]
a:152 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
a:152 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
a:152 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
a:152 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
a:152 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
a:152 [binder, in Undecidability.TM.Hoare.HoareExamples]
A:153 [binder, in Undecidability.L.Tactics.Extract]
a:153 [binder, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
A:154 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
a:154 [binder, in Undecidability.L.Tactics.Extract]
a:154 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
a:154 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
a:154 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
a:155 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
a:155 [binder, in Complexity.L.TM.TMunflatten]
A:155 [binder, in Undecidability.TM.Code.Code]
a:155 [binder, in Undecidability.TM.Hoare.HoareExamples]
a:156 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
a:156 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
a:157 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
a:157 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
A:157 [binder, in Undecidability.TM.Code.Code]
a:157 [binder, in Undecidability.TM.Hoare.HoareExamples]
a:158 [binder, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
a:158 [binder, in Undecidability.Shared.Libs.DLW.Utils.php]
A:159 [binder, in Undecidability.L.Tactics.Extract]
a:159 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
a:159 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
A:16 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
A:16 [binder, in Undecidability.Shared.Libs.PSL.Lists.Removal]
A:16 [binder, in Undecidability.L.Datatypes.LOptions]
a:16 [binder, in Complexity.L.AbstractMachines.UnfoldTailRec]
a:16 [binder, in Undecidability.TM.Combinators.Switch]
a:16 [binder, in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
A:16 [binder, in Undecidability.Shared.Libs.PSL.Lists.Position]
a:16 [binder, in Undecidability.TM.Util.Prelim]
A:16 [binder, in Undecidability.Shared.Libs.PSL.Inhabited]
a:16 [binder, in Complexity.NP.SAT.FSAT.FSAT]
a:16 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachine]
A:16 [binder, in Undecidability.Shared.ListAutomation]
A:16 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.FiniteFunction]
A:16 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.CompoundFinTypes]
A:16 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
a:160 [binder, in Undecidability.L.Tactics.Extract]
a:160 [binder, in Undecidability.TM.Hoare.HoareExamples]
a:161 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
a:161 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
a:162 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
a:162 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
a:162 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
A:164 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
a:164 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
a:164 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
a:165 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
a:165 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
a:166 [binder, in Undecidability.TM.Hoare.HoareExamples]
a:167 [binder, in Complexity.L.TM.TMunflatten]
a:167 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
a:168 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
a:168 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
a:168 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
a:169 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
a:169 [binder, in Complexity.L.TM.TMunflatten]
a:169 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
a:169 [binder, in Undecidability.TM.Hoare.HoareExamples]
a:17 [binder, in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
A:17 [binder, in Undecidability.Shared.Libs.PSL.FCI]
A:17 [binder, in Undecidability.L.Tactics.LClos]
A:17 [binder, in Complexity.TM.Single.EncodeTapesInvariants]
A:17 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.VectorFin]
A:17 [binder, in Undecidability.L.Datatypes.List.List_nat]
a:17 [binder, in Undecidability.L.AbstractMachines.FlatPro.UnfoldClos]
a:17 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
a:17 [binder, in Complexity.L.TM.TMflatten]
A:17 [binder, in Undecidability.Shared.Libs.PSL.Lists.Dupfree]
a:17 [binder, in Undecidability.TM.L.HeapInterpreter.LookupTM]
A:170 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
a:171 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
a:171 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
a:172 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
a:172 [binder, in Undecidability.TM.Hoare.HoareExamples]
a:173 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
a:174 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
a:175 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
a:175 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
A:175 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
A:176 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
a:176 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
a:176 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
a:176 [binder, in Undecidability.TM.Hoare.HoareExamples]
A:177 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
A:177 [binder, in Undecidability.TM.Hoare.HoareLogic]
a:178 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
a:178 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
a:178 [binder, in Complexity.L.TM.TMunflatten]
a:179 [binder, in Complexity.L.TM.TMunflatten]
A:18 [binder, in Undecidability.Shared.FilterFacts]
a:18 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
A:18 [binder, in Undecidability.L.Complexity.UpToCNary]
A:18 [binder, in Complexity.NP.L.CanEnumTerm]
a:18 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
a:18 [binder, in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisUnfoldClos]
a:18 [binder, in Undecidability.L.Tactics.LClos]
A:18 [binder, in Undecidability.Shared.Libs.PSL.Lists.Filter]
a:18 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
A:18 [binder, in Undecidability.Shared.Libs.PSL.Inhabited]
A:18 [binder, in Complexity.L.TM.CompCode]
a:18 [binder, in Complexity.L.AbstractMachines.UnfoldHeap]
a:18 [binder, in Complexity.Complexity.UpToCPoly]
a:18 [binder, in Complexity.NP.SAT.FSAT.FSAT]
a:18 [binder, in Undecidability.L.Datatypes.List.List_in]
A:18 [binder, in Undecidability.Shared.Libs.PSL.Lists.Cardinality]
a:180 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
a:180 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
a:180 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
a:180 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
a:180 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
a:180 [binder, in Undecidability.TM.Hoare.HoareExamples]
A:180 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
a:181 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
a:181 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
a:183 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
a:183 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
a:183 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
a:183 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
a:183 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
a:183 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
a:183 [binder, in Undecidability.TM.Hoare.HoareExamples]
a:184 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
a:185 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
a:185 [binder, in Complexity.L.TM.TMunflatten]
a:186 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
A:186 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
a:186 [binder, in Undecidability.TM.Hoare.HoareExamples]
A:186 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
a:187 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
a:187 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
a:187 [binder, in Complexity.L.TM.TMunflatten]
a:187 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
a:189 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
a:189 [binder, in Undecidability.TM.Hoare.HoareExamples]
A:19 [binder, in Complexity.Libs.Pigeonhole]
A:19 [binder, in Undecidability.Shared.Libs.PSL.Lists.Removal]
a:19 [binder, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
a:19 [binder, in Undecidability.L.Tactics.LClos]
a:19 [binder, in Undecidability.TM.Util.Prelim]
a:19 [binder, in Complexity.TM.Single.EncodeTapesInvariants]
a:19 [binder, in Undecidability.Shared.Libs.DLW.Utils.crt]
a:19 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
A:19 [binder, in Undecidability.Shared.Libs.PSL.Lists.Power]
A:19 [binder, in Undecidability.Shared.Libs.PSL.Lists.Dupfree]
a:19 [binder, in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
A:19 [binder, in Undecidability.Shared.Libs.PSL.Lists.Cardinality]
a:19 [binder, in Undecidability.TM.Hoare.HoareMult]
a:19 [binder, in Undecidability.TM.Code.BinNumbers.PosAddTM]
a:19 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.FiniteFunction]
a:190 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
A:190 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
A:191 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
a:192 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
a:192 [binder, in Complexity.L.TM.TMunflatten]
a:192 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
a:192 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
a:193 [binder, in Undecidability.TM.Hoare.HoareExamples]
a:194 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
a:194 [binder, in Complexity.L.TM.TMunflatten]
a:194 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
a:196 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
A:196 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
A:196 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
a:197 [binder, in Undecidability.TM.Hoare.HoareExamples]
A:198 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
a:198 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
a:199 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
A:2 [binder, in Undecidability.Shared.Libs.PSL.Lists.Removal]
a:2 [binder, in Complexity.L.TM.TMflatEnc]
A:2 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
A:2 [binder, in Undecidability.L.Datatypes.List.List_nat]
A:2 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
A:2 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
A:2 [binder, in Undecidability.Shared.Libs.PSL.Lists.Cardinality]
a:2 [binder, in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
A:2 [binder, in Complexity.NP.SAT.CookLevin.Reductions.CC_to_BinaryCC]
a:2 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.DepPairs]
A:20 [binder, in Complexity.Libs.Pigeonhole]
a:20 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
a:20 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds_Loop]
A:20 [binder, in Undecidability.L.Computability.Enum]
a:20 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
A:20 [binder, in Undecidability.L.Tactics.LClos]
a:20 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
A:20 [binder, in Undecidability.Shared.Libs.PSL.Lists.Position]
A:20 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
a:20 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
a:20 [binder, in Complexity.NP.SAT.SAT_inNP]
a:20 [binder, in Complexity.NP.SAT.FSAT.FSAT]
a:20 [binder, in Undecidability.L.Datatypes.List.List_in]
A:20 [binder, in Undecidability.Shared.Libs.PSL.Lists.Cardinality]
A:20 [binder, in Undecidability.Shared.ListAutomation]
a:20 [binder, in Complexity.NP.SAT.SAT]
a:20 [binder, in Undecidability.TM.L.HeapInterpreter.LookupTM]
A:20 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
a:200 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
a:200 [binder, in Undecidability.TM.Hoare.HoareExamples]
a:202 [binder, in Undecidability.L.Tactics.Extract]
a:202 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
a:202 [binder, in Undecidability.TM.Hoare.HoareExamples]
a:203 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
A:203 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
a:204 [binder, in Undecidability.TM.Util.TM_facts]
a:206 [binder, in Undecidability.L.Tactics.Extract]
a:206 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
A:206 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
a:206 [binder, in Undecidability.TM.Hoare.HoareExamples]
a:208 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
a:209 [binder, in Complexity.L.TM.TMflatComp]
A:21 [binder, in Complexity.Libs.Pigeonhole]
A:21 [binder, in Undecidability.Shared.FilterFacts]
a:21 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
A:21 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
a:21 [binder, in Undecidability.L.Tactics.LClos]
A:21 [binder, in Undecidability.Shared.Libs.PSL.Lists.Filter]
a:21 [binder, in Undecidability.TM.Util.Prelim]
a:21 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
A:21 [binder, in Undecidability.Shared.Libs.PSL.Inhabited]
A:21 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.VectorFin]
a:21 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_upto]
A:21 [binder, in Undecidability.Shared.Libs.PSL.Lists.Power]
A:21 [binder, in Undecidability.TM.Code.ChangeAlphabet]
a:21 [binder, in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
a:21 [binder, in Undecidability.L.Tactics.Computable]
A:210 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
a:210 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
a:211 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
a:211 [binder, in Undecidability.TM.Hoare.HoareExamples]
a:212 [binder, in Complexity.L.TM.TMflatComp]
A:212 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
A:214 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
a:215 [binder, in Undecidability.TM.Hoare.HoareExamples]
A:216 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
A:22 [binder, in Complexity.Libs.Pigeonhole]
A:22 [binder, in Undecidability.Shared.Libs.PSL.FCI]
a:22 [binder, in Undecidability.L.Datatypes.LOptions]
A:22 [binder, in Undecidability.L.Tactics.Extract]
A:22 [binder, in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
A:22 [binder, in Undecidability.L.Tactics.LClos]
A:22 [binder, in Undecidability.Shared.Libs.PSL.Lists.Position]
A:22 [binder, in Complexity.L.TM.CompCode]
a:22 [binder, in Complexity.NP.SAT.SAT_inNP]
a:22 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachine]
a:22 [binder, in Undecidability.L.Datatypes.LNat]
A:22 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.FiniteFunction]
a:220 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
a:220 [binder, in Undecidability.TM.Hoare.HoareExamples]
A:222 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
A:222 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
a:2223 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:2232 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:224 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
a:2241 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:225 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
a:225 [binder, in Undecidability.TM.Hoare.HoareExamples]
a:2250 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:2259 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:2268 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
A:227 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
A:227 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
a:2277 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:2286 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:229 [binder, in Undecidability.L.Tactics.Extract]
a:229 [binder, in Undecidability.TM.Hoare.HoareExamples]
a:2295 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
A:23 [binder, in Complexity.Libs.Pigeonhole]
a:23 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
a:23 [binder, in Undecidability.TM.Code.BinNumbers.PosMultTM]
a:23 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
A:23 [binder, in Undecidability.L.Datatypes.LSum]
a:23 [binder, in Undecidability.L.Tactics.LClos]
a:23 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
a:23 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
a:23 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.VectorFin]
a:23 [binder, in Complexity.L.AbstractMachines.UnfoldHeap]
a:23 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_upto]
a:23 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
a:23 [binder, in Complexity.NP.SAT.FSAT.FSAT]
A:23 [binder, in Undecidability.Shared.Libs.PSL.Lists.Power]
a:23 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
A:23 [binder, in Undecidability.Shared.Libs.PSL.Lists.Cardinality]
a:23 [binder, in Undecidability.TM.Hoare.HoareMult]
a:23 [binder, in Undecidability.TM.Util.TM_facts]
a:23 [binder, in Complexity.NP.SAT.SAT]
a:23 [binder, in Undecidability.TM.L.HeapInterpreter.LookupTM]
a:231 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
a:232 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
A:233 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
a:233 [binder, in Undecidability.TM.Hoare.HoareExamples]
a:235 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
A:235 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
A:236 [binder, in Undecidability.L.Tactics.Extract]
a:236 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
a:237 [binder, in Undecidability.L.Tactics.Extract]
a:237 [binder, in Undecidability.TM.Hoare.HoareExamples]
a:2376 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:2384 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
A:239 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
a:2392 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
A:24 [binder, in Undecidability.Shared.Libs.PSL.FCI]
A:24 [binder, in Undecidability.Shared.FilterFacts]
a:24 [binder, in Undecidability.Shared.Libs.PSL.Retracts]
A:24 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
a:24 [binder, in Undecidability.L.Tactics.LClos]
A:24 [binder, in Undecidability.Shared.Libs.PSL.Lists.Filter]
A:24 [binder, in Undecidability.Shared.Libs.PSL.Inhabited]
A:24 [binder, in Undecidability.L.Tactics.ComputableDemo]
A:24 [binder, in Complexity.Complexity.SpaceBoundsTime]
A:24 [binder, in Undecidability.Shared.Libs.PSL.Lists.Dupfree]
a:24 [binder, in Undecidability.Shared.ListAutomation]
a:24 [binder, in Undecidability.L.Datatypes.LNat]
A:240 [binder, in Undecidability.L.Tactics.Extract]
a:2400 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:2408 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:241 [binder, in Undecidability.L.Tactics.Extract]
a:2416 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
A:242 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
a:242 [binder, in Undecidability.TM.Hoare.HoareExamples]
a:2424 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:243 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
a:2432 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
A:244 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
a:2440 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:247 [binder, in Undecidability.TM.Hoare.HoareExamples]
A:248 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
a:248 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
a:248 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
A:249 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
A:25 [binder, in Complexity.Libs.Pigeonhole]
A:25 [binder, in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
a:25 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
A:25 [binder, in Undecidability.Shared.Libs.PSL.Lists.Removal]
a:25 [binder, in Complexity.L.AbstractMachines.UnfoldTailRec]
a:25 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
a:25 [binder, in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisUnfoldClos]
a:25 [binder, in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
A:25 [binder, in Undecidability.L.Tactics.LClos]
a:25 [binder, in Undecidability.TM.Util.Prelim]
a:25 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_upto]
a:25 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
A:25 [binder, in Undecidability.L.Datatypes.List.List_eqb]
A:25 [binder, in Undecidability.Shared.Libs.PSL.Lists.Dupfree]
A:25 [binder, in Undecidability.Shared.Libs.PSL.Lists.Cardinality]
A:25 [binder, in Undecidability.Shared.ListAutomation]
a:25 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.FiniteFunction]
a:25 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
a:251 [binder, in Undecidability.TM.Hoare.HoareExamples]
a:252 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
A:253 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
a:254 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
a:2540 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:255 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
a:255 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
a:255 [binder, in Undecidability.TM.Hoare.HoareExamples]
a:257 [binder, in Undecidability.TM.Hoare.HoareExamples]
a:259 [binder, in Undecidability.TM.Hoare.HoareExamples]
a:26 [binder, in Undecidability.TM.Code.BinNumbers.PosMultTM]
a:26 [binder, in Undecidability.L.Tactics.LClos]
A:26 [binder, in Undecidability.Shared.Libs.PSL.Lists.Position]
a:26 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
A:26 [binder, in Undecidability.L.Datatypes.List.List_extra]
a:26 [binder, in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisStep]
A:26 [binder, in Undecidability.Shared.Libs.PSL.Lists.Power]
a:26 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
A:26 [binder, in Undecidability.Shared.Libs.PSL.Lists.Dupfree]
a:26 [binder, in Complexity.NP.SAT.SAT]
a:26 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
A:261 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
a:263 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
A:265 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
a:265 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
A:2657 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:267 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
A:2676 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:2678 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:268 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
a:2691 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
A:2698 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:27 [binder, in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
A:27 [binder, in Undecidability.L.Datatypes.LSum]
A:27 [binder, in Undecidability.L.Tactics.LClos]
A:27 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
a:27 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
a:27 [binder, in Complexity.Libs.CookPrelim.PolyBounds]
a:27 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_upto]
a:270 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
A:2701 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
A:2702 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:2705 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:271 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
a:272 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
a:273 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
a:278 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
A:28 [binder, in Complexity.Libs.Pigeonhole]
a:28 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
A:28 [binder, in Undecidability.Shared.FilterFacts]
A:28 [binder, in Undecidability.Shared.Libs.PSL.Lists.Removal]
a:28 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
A:28 [binder, in Undecidability.Shared.Libs.PSL.Lists.Filter]
a:28 [binder, in Undecidability.Shared.Libs.DLW.Utils.crt]
A:28 [binder, in Undecidability.L.Tactics.ComputableDemo]
A:28 [binder, in Undecidability.L.Datatypes.List.List_nat]
a:28 [binder, in Complexity.NP.SAT.SAT_inNP]
a:28 [binder, in Undecidability.L.TM.TapeFuns]
a:28 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_upto]
a:28 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
a:28 [binder, in Undecidability.L.Functions.EqBool]
A:28 [binder, in Undecidability.Shared.Libs.PSL.Lists.Power]
A:28 [binder, in Undecidability.Shared.Libs.PSL.Lists.Cardinality]
a:28 [binder, in Undecidability.TM.Hoare.HoareMult]
a:28 [binder, in Undecidability.Shared.ListAutomation]
A:28 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.FiniteFunction]
a:281 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
a:29 [binder, in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
A:29 [binder, in Undecidability.Shared.Libs.PSL.FCI]
a:29 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
a:29 [binder, in Complexity.L.AbstractMachines.UnfoldHeap]
a:29 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_upto]
a:29 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
a:29 [binder, in Undecidability.TM.TM]
A:29 [binder, in Undecidability.Shared.Libs.PSL.Lists.Dupfree]
A:29 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
A:29 [binder, in Undecidability.Shared.ListAutomation]
a:29 [binder, in Undecidability.TM.Util.TM_facts]
a:29 [binder, in Complexity.NP.SAT.SAT]
a:29 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
A:3 [binder, in Undecidability.L.Datatypes.List.List_basics]
A:3 [binder, in Complexity.L.AbstractMachines.FlatPro.Computable.Decompile]
A:3 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
a:3 [binder, in Complexity.NP.SAT.SharedSAT]
A:3 [binder, in Complexity.L.AbstractMachines.Computable.Shared]
A:3 [binder, in Undecidability.Shared.Libs.PSL.Lists.Position]
a:3 [binder, in Undecidability.TM.Combinators.Mirror]
a:3 [binder, in Undecidability.Shared.Libs.DLW.Utils.interval]
a:3 [binder, in Undecidability.L.Prelim.MoreBase]
a:3 [binder, in Complexity.NP.SAT.FSAT.FSAT]
a:3 [binder, in Undecidability.TM.L.Alphabets]
a:3 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TM_single]
A:3 [binder, in Complexity.L.TM.TMflatten]
A:3 [binder, in Undecidability.L.Functions.EnumInt]
a:3 [binder, in Undecidability.L.Datatypes.List.List_in]
a:3 [binder, in Undecidability.L.Computability.Synthetic]
A:3 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.Cardinality]
A:3 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.CompoundFinTypes]
A:30 [binder, in Undecidability.Shared.Libs.PSL.Lists.Removal]
a:30 [binder, in Undecidability.Shared.Libs.PSL.Retracts]
a:30 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
A:30 [binder, in Undecidability.L.Datatypes.List.List_extra]
a:30 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_upto]
a:30 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
A:30 [binder, in Undecidability.L.Datatypes.List.List_eqb]
A:30 [binder, in Undecidability.Shared.Libs.PSL.Lists.Power]
a:30 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachine]
A:30 [binder, in Undecidability.Shared.Libs.PSL.Lists.Dupfree]
a:3029 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:3034 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:3048 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:308 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
a:31 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
a:31 [binder, in Complexity.L.AbstractMachines.UnfoldTailRec]
A:31 [binder, in Undecidability.L.Tactics.GenEncode]
A:31 [binder, in Complexity.L.TM.CompCode]
a:31 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_upto]
a:31 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
A:31 [binder, in Undecidability.Shared.Libs.PSL.Lists.Dupfree]
A:31 [binder, in Undecidability.L.Tactics.Reflection]
A:31 [binder, in Undecidability.Shared.ListAutomation]
a:31 [binder, in Undecidability.TM.Univ.Univ]
a:31 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.FiniteFunction]
a:3133 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:314 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
A:3199 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:32 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
A:32 [binder, in Undecidability.Shared.FilterFacts]
A:32 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
A:32 [binder, in Undecidability.Shared.Libs.PSL.Lists.Filter]
a:32 [binder, in Complexity.NP.SAT.SAT_inNP]
A:32 [binder, in Undecidability.L.TM.TapeFuns]
A:32 [binder, in Undecidability.L.AbstractMachines.FlatPro.Programs]
a:32 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
A:32 [binder, in Undecidability.L.Functions.FinTypeLookup]
a:32 [binder, in Complexity.NP.SAT.SAT]
a:3202 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
A:3207 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:3221 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:3227 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:3279 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:3289 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:3299 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
A:33 [binder, in Complexity.Libs.Pigeonhole]
a:33 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
A:33 [binder, in Undecidability.Shared.Libs.PSL.Lists.Removal]
a:33 [binder, in Undecidability.Shared.Libs.DLW.Utils.crt]
A:33 [binder, in Undecidability.L.Datatypes.List.List_nat]
A:33 [binder, in Undecidability.Shared.Libs.PSL.Lists.Power]
A:33 [binder, in Undecidability.Shared.Libs.PSL.Lists.Dupfree]
a:33 [binder, in Undecidability.L.Datatypes.List.List_in]
a:33 [binder, in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
a:33 [binder, in Undecidability.TM.Hoare.HoareMult]
A:33 [binder, in Undecidability.Shared.ListAutomation]
a:33 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
a:33 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
a:330 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:3311 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:3321 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:333 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
a:3331 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
A:334 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:3343 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:3353 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:3363 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
A:338 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
A:34 [binder, in Undecidability.Shared.Libs.PSL.FCI]
a:34 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
A:34 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
A:34 [binder, in Undecidability.Synthetic.Infinite]
a:34 [binder, in Undecidability.TM.L.HeapInterpreter.LookupTM]
a:34 [binder, in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
A:342 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:349 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:35 [binder, in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
a:35 [binder, in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisUnfoldClos]
A:35 [binder, in Complexity.L.TM.CompCode]
A:35 [binder, in Undecidability.L.Tactics.ComputableDemo]
a:35 [binder, in Complexity.L.AbstractMachines.UnfoldHeap]
A:35 [binder, in Undecidability.L.Datatypes.LVector]
a:35 [binder, in Complexity.NP.SAT.SAT_inNP]
A:35 [binder, in Undecidability.L.Datatypes.List.List_eqb]
A:35 [binder, in Complexity.Complexity.SpaceBoundsTime]
A:35 [binder, in Undecidability.Shared.Libs.PSL.Lists.Dupfree]
a:35 [binder, in Complexity.NP.SAT.SAT]
a:353 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
a:356 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
a:357 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
A:36 [binder, in Complexity.Libs.Pigeonhole]
a:36 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
A:36 [binder, in Undecidability.Shared.FilterFacts]
A:36 [binder, in Undecidability.L.Tactics.LClos]
A:36 [binder, in Undecidability.Shared.Libs.PSL.Lists.Filter]
a:36 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
a:36 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachine]
A:36 [binder, in Undecidability.Shared.Libs.PSL.Lists.Dupfree]
A:36 [binder, in Undecidability.Shared.ListAutomation]
a:36 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
a:36 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
a:363 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
a:3644 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:3647 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:3652 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:3655 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:367 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:3670 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:3673 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:368 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
a:3688 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
A:3689 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
A:3691 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:3692 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
A:37 [binder, in Complexity.Libs.Pigeonhole]
a:37 [binder, in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
a:37 [binder, in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
A:37 [binder, in Undecidability.Shared.Libs.PSL.FCI]
A:37 [binder, in Undecidability.Shared.Libs.PSL.Lists.Removal]
a:37 [binder, in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisUnfoldClos]
a:37 [binder, in Undecidability.TM.Util.VectorPrelim]
A:37 [binder, in Complexity.L.TM.CompCode]
a:37 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
A:37 [binder, in Undecidability.Shared.Libs.PSL.Lists.Power]
A:37 [binder, in Undecidability.Shared.Libs.PSL.Lists.Dupfree]
a:37 [binder, in Undecidability.L.Datatypes.List.List_in]
A:37 [binder, in Undecidability.Shared.Dec]
a:37 [binder, in Undecidability.TM.Hoare.HoareMult]
a:37 [binder, in Undecidability.L.Functions.FinTypeLookup]
A:3700 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:3701 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:372 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
a:377 [binder, in Undecidability.TM.Single.StepTM]
a:377 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
A:38 [binder, in Complexity.Libs.Pigeonhole]
A:38 [binder, in Undecidability.Shared.Libs.PSL.Lists.Removal]
a:38 [binder, in Complexity.NP.SAT.SAT_inNP]
a:38 [binder, in Undecidability.L.TM.TapeFuns]
a:38 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
A:38 [binder, in Undecidability.Shared.Libs.PSL.Lists.Dupfree]
A:38 [binder, in Undecidability.L.Tactics.Reflection]
A:38 [binder, in Undecidability.Synthetic.Infinite]
a:38 [binder, in Complexity.NP.SAT.SAT]
a:38 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
a:384 [binder, in Undecidability.TM.Single.StepTM]
a:386 [binder, in Undecidability.TM.Single.StepTM]
a:388 [binder, in Undecidability.TM.Single.StepTM]
A:39 [binder, in Complexity.Libs.Pigeonhole]
A:39 [binder, in Undecidability.Shared.Libs.PSL.FCI]
a:39 [binder, in Undecidability.L.Tactics.LClos]
a:39 [binder, in Undecidability.TM.Util.Prelim]
a:39 [binder, in Complexity.Libs.UniformHomomorphisms]
a:39 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachine]
a:39 [binder, in Undecidability.Shared.Libs.PSL.Lists.Dupfree]
A:39 [binder, in Undecidability.Shared.ListAutomation]
a:39 [binder, in Undecidability.TM.L.HeapInterpreter.LookupTM]
a:39 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
a:392 [binder, in Undecidability.TM.Single.StepTM]
a:394 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
A:394 [binder, in Undecidability.TM.Util.TM_facts]
a:395 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
a:399 [binder, in Undecidability.TM.Single.StepTM]
a:4 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
A:4 [binder, in Undecidability.Shared.FilterFacts]
A:4 [binder, in Complexity.NP.L.CanEnumTerm]
A:4 [binder, in Undecidability.Shared.Libs.PSL.Lists.Filter]
a:4 [binder, in Undecidability.TM.Util.Prelim]
A:4 [binder, in Undecidability.Shared.Libs.PSL.Inhabited]
a:4 [binder, in Complexity.L.AbstractMachines.UnfoldHeap]
a:4 [binder, in Complexity.Libs.CookPrelim.PolyBounds]
a:4 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
a:4 [binder, in Complexity.Libs.CookPrelim.Tactics]
A:4 [binder, in Complexity.TM.Compound.MoveToSymbol_niceSpec]
A:4 [binder, in Undecidability.Synthetic.ListEnumerabilityFacts]
a:4 [binder, in Undecidability.L.Datatypes.List.List_enc]
a:4 [binder, in Undecidability.TM.Hoare.HoareMult]
a:4 [binder, in Complexity.NP.SAT.SAT]
a:4 [binder, in Undecidability.TM.Code.BinNumbers.PosAddTM]
A:40 [binder, in Undecidability.Shared.Libs.PSL.FCI]
A:40 [binder, in Undecidability.L.Tactics.LClos]
a:40 [binder, in Complexity.NP.SAT.SAT_inNP]
a:40 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
a:40 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
A:40 [binder, in Undecidability.Shared.Libs.PSL.Lists.Power]
A:40 [binder, in Undecidability.TM.Code.Code]
a:40 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.CC]
a:401 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:402 [binder, in Undecidability.TM.Util.TM_facts]
a:406 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
a:41 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
a:41 [binder, in Undecidability.TM.Code.BinNumbers.PosMultTM]
a:41 [binder, in Undecidability.Shared.Libs.PSL.Retracts]
A:41 [binder, in Undecidability.L.Tactics.Extract]
a:41 [binder, in Complexity.L.AbstractMachines.UnfoldTailRec]
a:41 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
A:41 [binder, in Undecidability.Shared.Libs.PSL.Lists.Filter]
A:41 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
A:41 [binder, in Complexity.L.TM.CompCode]
a:41 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
a:41 [binder, in Complexity.NP.SAT.SAT_inNP]
A:41 [binder, in Undecidability.L.AbstractMachines.FlatPro.Programs]
A:41 [binder, in Undecidability.L.Datatypes.List.List_eqb]
a:41 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
a:41 [binder, in Undecidability.L.Datatypes.List.List_in]
a:41 [binder, in Undecidability.TM.Hoare.HoareMult]
A:41 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.FiniteFunction]
a:410 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:416 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
a:419 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:42 [binder, in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
A:42 [binder, in Undecidability.Shared.Libs.PSL.Lists.Removal]
A:42 [binder, in Undecidability.L.Computability.Enum]
A:42 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
a:42 [binder, in Undecidability.TM.Util.Prelim]
a:42 [binder, in Undecidability.Shared.Libs.DLW.Utils.crt]
a:42 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
a:42 [binder, in Complexity.NP.Clique.kSAT_to_Clique]
A:42 [binder, in Undecidability.Shared.ListAutomation]
A:42 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
A:43 [binder, in Complexity.Libs.Pigeonhole]
a:43 [binder, in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
a:43 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
a:43 [binder, in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisUnfoldClos]
a:43 [binder, in Undecidability.TM.Code.NatTM]
a:43 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
a:43 [binder, in Complexity.NP.SAT.SAT_inNP]
A:43 [binder, in Undecidability.Shared.Libs.PSL.Lists.Power]
A:43 [binder, in Complexity.Complexity.SpaceBoundsTime]
A:43 [binder, in Complexity.L.AbstractMachines.FunctionalDefinitions]
a:435 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:438 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
a:44 [binder, in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
a:44 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
a:44 [binder, in Undecidability.TM.Code.BinNumbers.PosMultTM]
A:44 [binder, in Undecidability.L.Tactics.Extract]
A:44 [binder, in Undecidability.L.Computability.Enum]
A:44 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
a:44 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
a:44 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
A:44 [binder, in Undecidability.L.Datatypes.List.List_eqb]
a:44 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachine]
a:44 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
A:44 [binder, in Undecidability.L.Functions.FinTypeLookup]
A:44 [binder, in Undecidability.Shared.ListAutomation]
a:44 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.CC]
a:44 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.FiniteFunction]
a:440 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
a:443 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
A:45 [binder, in Undecidability.Shared.Libs.PSL.Lists.Removal]
a:45 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
A:45 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
a:45 [binder, in Complexity.NP.SAT.SAT_inNP]
a:45 [binder, in Complexity.Libs.CookPrelim.PolyBounds]
a:45 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
a:45 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
a:45 [binder, in Undecidability.TM.Hoare.HoareMult]
a:453 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
A:46 [binder, in Complexity.Libs.Pigeonhole]
a:46 [binder, in Undecidability.Shared.Libs.DLW.Utils.prime]
a:46 [binder, in Undecidability.Shared.Libs.PSL.Retracts]
A:46 [binder, in Undecidability.L.Tactics.LClos]
a:46 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
a:46 [binder, in Undecidability.L.Datatypes.LVector]
a:46 [binder, in Undecidability.Shared.Libs.DLW.Utils.list_bool]
a:46 [binder, in Undecidability.TM.Univ.LowLevel]
a:46 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
A:46 [binder, in Undecidability.L.AbstractMachines.FlatPro.Programs]
A:46 [binder, in Undecidability.TM.Code.Code]
a:463 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:467 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
a:47 [binder, in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
A:47 [binder, in Undecidability.Shared.Libs.PSL.Lists.Removal]
A:47 [binder, in Undecidability.L.Computability.Enum]
A:47 [binder, in Undecidability.Shared.Libs.PSL.EqDec]
A:47 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
A:47 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
a:47 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
a:47 [binder, in Undecidability.L.Datatypes.List.List_eqb]
A:47 [binder, in Undecidability.Shared.Libs.PSL.Lists.Power]
a:47 [binder, in Undecidability.TM.L.HeapInterpreter.LookupTM]
a:47 [binder, in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
a:47 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.CC]
a:48 [binder, in Complexity.NP.SAT.SAT_inNP]
a:48 [binder, in Complexity.Complexity.UpToCPoly]
a:48 [binder, in Complexity.L.TM.TMunflatten]
A:48 [binder, in Undecidability.Shared.Libs.PSL.Lists.Power]
a:480 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:488 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
A:49 [binder, in Complexity.Libs.Pigeonhole]
a:49 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
A:49 [binder, in Undecidability.Shared.Libs.PSL.Lists.Removal]
a:49 [binder, in Undecidability.TM.Util.Prelim]
a:49 [binder, in Undecidability.Shared.Libs.DLW.Utils.crt]
a:49 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
A:49 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.Arbitrary]
a:49 [binder, in Undecidability.L.Functions.FinTypeLookup]
A:49 [binder, in Undecidability.Shared.ListAutomation]
A:49 [binder, in Complexity.L.AbstractMachines.FunctionalDefinitions]
a:49 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
a:498 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
A:5 [binder, in Complexity.Libs.Pigeonhole]
a:5 [binder, in Complexity.NP.SAT.SharedSAT]
a:5 [binder, in Undecidability.TM.Code.NatTM]
A:5 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
A:5 [binder, in Complexity.L.TM.CompCode]
A:5 [binder, in Complexity.L.TM.TMunflatten]
A:5 [binder, in Undecidability.L.Datatypes.List.List_eqb]
A:5 [binder, in Undecidability.Shared.Libs.PSL.Lists.Power]
a:5 [binder, in Complexity.L.TM.TMflatten]
A:5 [binder, in Undecidability.Shared.Libs.PSL.Lists.Dupfree]
a:5 [binder, in Undecidability.TM.L.HeapInterpreter.LookupTM]
A:5 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.FiniteFunction]
a:5 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.CompoundFinTypes]
A:50 [binder, in Undecidability.Shared.Libs.PSL.Lists.Removal]
a:50 [binder, in Undecidability.Shared.Libs.PSL.Retracts]
A:50 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
a:50 [binder, in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisUnfoldClos]
a:50 [binder, in Undecidability.Shared.Libs.DLW.Utils.list_bool]
A:50 [binder, in Undecidability.L.Datatypes.List.List_eqb]
A:50 [binder, in Undecidability.Shared.Libs.PSL.Lists.Power]
A:50 [binder, in Complexity.Complexity.SpaceBoundsTime]
a:50 [binder, in Undecidability.TM.Hoare.HoareMult]
a:50 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.CC]
a:508 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:51 [binder, in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
A:51 [binder, in Undecidability.L.Tactics.Extract]
A:51 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
a:51 [binder, in Undecidability.L.Datatypes.LVector]
a:51 [binder, in Complexity.TM.Single.DecodeTapes]
A:51 [binder, in Undecidability.Synthetic.Infinite]
A:51 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.FiniteFunction]
A:52 [binder, in Complexity.Libs.Pigeonhole]
A:52 [binder, in Undecidability.L.Tactics.Extract]
a:52 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
A:52 [binder, in Complexity.TM.PrettyBounds.BaseCodeSpace]
a:52 [binder, in Complexity.NP.SAT.SAT_inNP]
a:52 [binder, in Complexity.TM.Single.DecodeTapes]
A:52 [binder, in Undecidability.L.Tactics.Reflection]
a:52 [binder, in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
a:525 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:53 [binder, in Undecidability.L.Tactics.Extract]
A:53 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
a:53 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
a:53 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
a:53 [binder, in Undecidability.Shared.Libs.DLW.Utils.list_bool]
a:53 [binder, in Complexity.TM.Single.DecodeTapes]
a:532 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
A:54 [binder, in Complexity.Libs.Pigeonhole]
A:54 [binder, in Undecidability.L.Computability.Enum]
a:54 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
a:54 [binder, in Complexity.NP.SAT.SAT_inNP]
a:54 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
a:54 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.FiniteFunction]
a:541 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:55 [binder, in Undecidability.Shared.Libs.PSL.Retracts]
a:55 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
a:55 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
a:55 [binder, in Undecidability.L.Tactics.Reflection]
a:55 [binder, in Undecidability.TM.Hoare.HoareMult]
A:55 [binder, in Undecidability.L.Functions.FinTypeLookup]
A:55 [binder, in Undecidability.TM.Util.TM_facts]
a:550 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
A:56 [binder, in Complexity.Libs.Pigeonhole]
A:56 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
A:56 [binder, in Undecidability.L.Tactics.GenEncode]
A:56 [binder, in Undecidability.L.Tactics.LClos]
A:56 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
a:56 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
A:56 [binder, in Undecidability.L.Tactics.Reflection]
A:56 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.FiniteFunction]
a:56 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
a:566 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
A:57 [binder, in Complexity.Libs.Pigeonhole]
a:57 [binder, in Undecidability.Shared.Libs.PSL.Retracts]
a:57 [binder, in Undecidability.L.Tactics.LClos]
A:57 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
A:57 [binder, in Complexity.L.TM.CompCode]
a:57 [binder, in Undecidability.TM.Univ.LowLevel]
A:57 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.Arbitrary]
a:57 [binder, in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
a:57 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.CC]
a:574 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:58 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
a:58 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
a:58 [binder, in Undecidability.TM.L.HeapInterpreter.LookupTM]
a:58 [binder, in Undecidability.TM.Univ.Univ]
a:584 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
A:59 [binder, in Complexity.Libs.Pigeonhole]
A:59 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
A:59 [binder, in Undecidability.L.Tactics.GenEncode]
A:59 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
a:59 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
a:59 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
a:59 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachine]
a:59 [binder, in Complexity.NP.Clique.kSAT_to_Clique]
a:59 [binder, in Undecidability.TM.Hoare.HoareMult]
a:59 [binder, in Undecidability.Shared.Libs.DLW.Code.subcode]
A:59 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler]
a:594 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
A:6 [binder, in Undecidability.Shared.Libs.PSL.FCI]
A:6 [binder, in Undecidability.Shared.FilterFacts]
A:6 [binder, in Undecidability.Shared.Libs.PSL.Lists.Removal]
A:6 [binder, in Undecidability.L.Complexity.UpToCNary]
a:6 [binder, in Undecidability.L.Tactics.GenEncode]
A:6 [binder, in Undecidability.Shared.Libs.PSL.Lists.Filter]
a:6 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
a:6 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
a:6 [binder, in Complexity.Libs.CookPrelim.Tactics]
a:6 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
A:6 [binder, in Undecidability.L.Datatypes.List.List_enc]
A:6 [binder, in Undecidability.Shared.Libs.PSL.Lists.Cardinality]
A:6 [binder, in Undecidability.L.Functions.FinTypeLookup]
A:6 [binder, in Undecidability.Shared.ListAutomation]
a:6 [binder, in Complexity.NP.SAT.SAT]
a:6 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.DepPairs]
a:60 [binder, in Undecidability.TM.L.CompilerBoolFuns.NaryApp]
A:60 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
A:60 [binder, in Undecidability.L.Tactics.LClos]
A:60 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
a:60 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
a:60 [binder, in Undecidability.L.Datatypes.LVector]
A:60 [binder, in Complexity.Complexity.SpaceBoundsTime]
A:60 [binder, in Undecidability.Synthetic.Infinite]
a:60 [binder, in Undecidability.L.Functions.FinTypeLookup]
a:60 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
a:61 [binder, in Undecidability.L.Tactics.LClos]
A:61 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
A:61 [binder, in Complexity.L.TM.CompCode]
a:61 [binder, in Complexity.TM.PrettyBounds.BaseCodeSpace]
A:61 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.Arbitrary]
A:61 [binder, in Undecidability.Synthetic.Infinite]
A:61 [binder, in Undecidability.TM.Util.TM_facts]
a:61 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.CC]
a:611 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:618 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
A:62 [binder, in Undecidability.L.Tactics.LClos]
a:62 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
a:62 [binder, in Undecidability.L.Datatypes.LVector]
A:62 [binder, in Undecidability.L.Tactics.Reflection]
A:62 [binder, in Undecidability.Synthetic.Infinite]
a:628 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:63 [binder, in Undecidability.Shared.Libs.PSL.Retracts]
a:63 [binder, in Undecidability.L.Tactics.LClos]
A:63 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
a:63 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
A:63 [binder, in Complexity.TM.PrettyBounds.BaseCodeSpace]
a:63 [binder, in Complexity.NP.Clique.kSAT_to_Clique]
a:63 [binder, in Undecidability.TM.Hoare.HoareMult]
a:63 [binder, in Undecidability.TM.L.HeapInterpreter.LookupTM]
a:63 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.FiniteFunction]
a:638 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
A:64 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
a:64 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
a:64 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
a:64 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
a:646 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
A:65 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
a:65 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
A:65 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.Arbitrary]
a:65 [binder, in Undecidability.TM.Hoare.HoareMult]
a:654 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:66 [binder, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
A:66 [binder, in Undecidability.L.Tactics.LClos]
A:66 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
a:66 [binder, in Undecidability.TM.Util.Prelim]
a:66 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
a:66 [binder, in Complexity.Complexity.UpToCPoly]
a:66 [binder, in Complexity.L.TM.TMunflatten]
a:66 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.CC]
a:661 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:665 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
a:67 [binder, in Undecidability.L.Tactics.Extract]
a:67 [binder, in Complexity.L.TM.TMunflatten]
a:671 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
A:68 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
a:68 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
A:68 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
a:68 [binder, in Complexity.Libs.CookPrelim.PolyBounds]
a:68 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.CC]
a:68 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
a:681 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:69 [binder, in Undecidability.TM.Util.Prelim]
a:69 [binder, in Complexity.L.TM.TMflatComp]
a:69 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
a:69 [binder, in Undecidability.TM.L.HeapInterpreter.LookupTM]
a:697 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
A:7 [binder, in Complexity.Libs.Pigeonhole]
A:7 [binder, in Undecidability.L.Tactics.LClos]
A:7 [binder, in Undecidability.Shared.Libs.PSL.Lists.Position]
a:7 [binder, in Undecidability.Shared.Libs.DLW.Utils.interval]
A:7 [binder, in Undecidability.Shared.Libs.PSL.Inhabited]
A:7 [binder, in Undecidability.L.Datatypes.List.List_extra]
a:7 [binder, in Complexity.NP.SAT.FSAT.FSAT]
A:7 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.Arbitrary]
A:7 [binder, in Undecidability.Shared.ListAutomation]
a:7 [binder, in Undecidability.TM.Univ.Univ]
A:7 [binder, in Undecidability.L.Prelim.MoreList]
a:70 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
A:70 [binder, in Complexity.NP.L.CanEnumTerm]
A:70 [binder, in Undecidability.L.Tactics.GenEncode]
a:70 [binder, in Complexity.Libs.CookPrelim.PolyBounds]
a:704 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:71 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
a:71 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
a:71 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
a:71 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
a:71 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.CC]
a:71 [binder, in Complexity.NP.TM.LM_to_mTM]
a:71 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
a:714 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
A:72 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
A:72 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
a:72 [binder, in Undecidability.TM.Util.Prelim]
A:72 [binder, in Complexity.L.TM.TMflatComp]
A:72 [binder, in Undecidability.L.Tactics.Reflection]
A:72 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
a:724 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
A:73 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
A:73 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
a:73 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachine]
a:73 [binder, in Undecidability.L.Tactics.Reflection]
a:73 [binder, in Undecidability.TM.L.HeapInterpreter.LookupTM]
a:73 [binder, in Undecidability.Shared.Libs.DLW.Code.subcode]
A:73 [binder, in Complexity.NP.TM.LM_to_mTM]
a:73 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
A:74 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
a:74 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
a:74 [binder, in Complexity.L.TM.TMunflatten]
a:74 [binder, in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
a:740 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:749 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:75 [binder, in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
a:75 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
A:75 [binder, in Complexity.NP.L.CanEnumTerm]
a:75 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
a:758 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
A:76 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
a:76 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
A:76 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
A:76 [binder, in Complexity.L.TM.TMflatComp]
a:76 [binder, in Complexity.Libs.CookPrelim.PolyBounds]
A:76 [binder, in Undecidability.L.Tactics.Reflection]
a:76 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.CC]
a:76 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
a:77 [binder, in Complexity.TM.PrettyBounds.BaseCode]
a:77 [binder, in Undecidability.TM.Univ.LowLevel]
a:77 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
a:77 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
a:77 [binder, in Undecidability.L.Tactics.Reflection]
A:78 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
a:78 [binder, in Complexity.L.TM.TMflatComp]
a:78 [binder, in Complexity.Libs.CookPrelim.PolyBounds]
A:78 [binder, in Undecidability.L.Tactics.Reflection]
a:78 [binder, in Undecidability.Shared.Libs.DLW.Code.subcode]
a:788 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:79 [binder, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
a:79 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
a:79 [binder, in Undecidability.L.Tactics.Reflection]
a:79 [binder, in Undecidability.TM.L.HeapInterpreter.LookupTM]
a:79 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.CC]
a:791 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:794 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
A:8 [binder, in Complexity.Libs.Pigeonhole]
A:8 [binder, in Undecidability.Shared.FilterFacts]
a:8 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
a:8 [binder, in Undecidability.TM.Code.BinNumbers.PosMultTM]
A:8 [binder, in Undecidability.L.Computability.Enum]
a:8 [binder, in Complexity.NP.SAT.SharedSAT]
A:8 [binder, in Undecidability.Shared.Libs.PSL.Lists.Filter]
a:8 [binder, in Undecidability.L.AbstractMachines.FlatPro.UnfoldClos]
a:8 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
A:8 [binder, in Undecidability.Shared.Libs.PSL.Lists.Dupfree]
A:8 [binder, in Undecidability.L.Complexity.GenericNary]
A:8 [binder, in Undecidability.Shared.Libs.PSL.Lists.Cardinality]
a:8 [binder, in Complexity.NP.SAT.SAT]
a:8 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.FiniteFunction]
A:80 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
A:80 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
a:80 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
a:80 [binder, in Complexity.Complexity.UpToCPoly]
a:80 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:800 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:809 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
A:81 [binder, in Undecidability.L.Datatypes.LVector]
a:81 [binder, in Undecidability.TM.Univ.LowLevel]
a:818 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
A:82 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
A:82 [binder, in Complexity.L.TM.CompCode]
a:82 [binder, in Undecidability.TM.Univ.LowLevel]
a:82 [binder, in Complexity.Complexity.UpToCPoly]
a:82 [binder, in Undecidability.Shared.Libs.DLW.Code.subcode]
A:83 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
a:83 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
a:83 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
A:83 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
a:83 [binder, in Undecidability.TM.Univ.LowLevel]
A:83 [binder, in Complexity.L.TM.TMunflatten]
a:83 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
A:84 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
a:84 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
a:84 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
a:84 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
a:84 [binder, in Undecidability.TM.L.HeapInterpreter.LookupTM]
a:84 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
a:848 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
A:85 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
a:85 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
A:85 [binder, in Undecidability.L.Tactics.Reflection]
a:851 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:854 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:86 [binder, in Undecidability.Shared.Libs.PSL.Retracts]
a:86 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
a:86 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
A:86 [binder, in Complexity.L.TM.CompCode]
a:86 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
a:86 [binder, in Undecidability.Shared.Libs.DLW.Utils.php]
a:86 [binder, in Complexity.L.TM.TMunflatten]
A:86 [binder, in Undecidability.L.Tactics.Reflection]
a:860 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
a:860 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:869 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
A:87 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
a:87 [binder, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
a:87 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
A:87 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
a:87 [binder, in Complexity.Complexity.UpToCPoly]
a:87 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.CC]
a:87 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
a:878 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
A:88 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
A:88 [binder, in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
a:88 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
a:88 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
a:88 [binder, in Undecidability.TM.Univ.LowLevel]
a:88 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:88 [binder, in Complexity.NP.Clique.kSAT_to_Clique]
a:88 [binder, in Undecidability.TM.L.HeapInterpreter.LookupTM]
A:89 [binder, in Undecidability.Shared.Libs.PSL.Retracts]
a:89 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
A:89 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
a:89 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.CC]
a:89 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
a:89 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
A:9 [binder, in Complexity.Libs.Pigeonhole]
a:9 [binder, in Undecidability.L.Datatypes.LProd]
A:9 [binder, in Undecidability.Shared.Libs.PSL.FCI]
A:9 [binder, in Complexity.NP.L.CanEnumTerm]
A:9 [binder, in Undecidability.L.Tactics.GenEncode]
A:9 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
a:9 [binder, in Undecidability.TM.Util.Prelim]
a:9 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
A:9 [binder, in Undecidability.Shared.Libs.PSL.Lists.Power]
A:9 [binder, in Undecidability.Shared.Libs.PSL.Lists.Dupfree]
A:9 [binder, in Undecidability.Synthetic.ListEnumerabilityFacts]
A:9 [binder, in Undecidability.Synthetic.Infinite]
a:9 [binder, in Undecidability.Shared.ListAutomation]
A:9 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.Cardinality]
a:9 [binder, in Undecidability.TM.Univ.Univ]
a:90 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
A:90 [binder, in Undecidability.L.Tactics.LClos]
a:90 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
a:90 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
a:90 [binder, in Undecidability.TM.Compound.Compare]
a:908 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:91 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
a:91 [binder, in Complexity.NP.SAT.SAT_inNP]
a:91 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
a:91 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
a:91 [binder, in Undecidability.L.Tactics.Reflection]
a:911 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:914 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:92 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
A:92 [binder, in Undecidability.L.Tactics.LClos]
A:92 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
a:92 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
a:92 [binder, in Undecidability.TM.L.HeapInterpreter.LookupTM]
a:93 [binder, in Complexity.NP.SAT.SAT_inNP]
a:94 [binder, in Undecidability.Shared.Libs.DLW.Utils.php]
a:95 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
a:95 [binder, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
a:95 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
A:95 [binder, in Undecidability.L.Tactics.LClos]
a:95 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
a:95 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
A:95 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
a:95 [binder, in Complexity.NP.SAT.SAT_inNP]
a:95 [binder, in Undecidability.TM.Compound.Compare]
a:95 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.CC]
a:96 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:96 [binder, in Undecidability.TM.Lifting.LiftTapes]
a:96 [binder, in Undecidability.TM.L.HeapInterpreter.LookupTM]
a:96 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
a:964 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
a:97 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
a:97 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
a:97 [binder, in Complexity.NP.SAT.SAT_inNP]
a:975 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
A:98 [binder, in Undecidability.Shared.Libs.PSL.Retracts]
A:98 [binder, in Complexity.TM.PrettyBounds.UnivBounds]
a:98 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
a:98 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
A:98 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
a:98 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
a:98 [binder, in Undecidability.TM.Compound.Compare]
a:98 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
a:99 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
a:99 [binder, in Complexity.Complexity.UpToCPoly]
a:99 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]

B

bar_min [inductive, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
Base [library]
BaseCode [library]
BaseCodeSpace [library]
BaseLists [library]
base_p_uniq [lemma, in Undecidability.Shared.Libs.DLW.Utils.prime]
base_p_spec [lemma, in Undecidability.Shared.Libs.DLW.Utils.prime]
base_p [definition, in Undecidability.Shared.Libs.DLW.Utils.prime]
base_decomp.base_p.base_p_full [variable, in Undecidability.Shared.Libs.DLW.Utils.prime]
base_decomp.base_p.Hp [variable, in Undecidability.Shared.Libs.DLW.Utils.prime]
base_decomp.base_p.p [variable, in Undecidability.Shared.Libs.DLW.Utils.prime]
base_decomp.base_p [section, in Undecidability.Shared.Libs.DLW.Utils.prime]
base_decomp [section, in Undecidability.Shared.Libs.DLW.Utils.prime]
Basic [library]
BasicDefinitions [library]
BasicFinTypes [library]
bas:231 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
bbbC [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
bbdC [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
bbiC [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
bb:58 [binder, in Undecidability.Shared.Libs.DLW.Utils.php]
bb:80 [binder, in Undecidability.Shared.Libs.DLW.Utils.php]
benchTerm [definition, in Undecidability.L.Tactics.Reflection]
beta_red [lemma, in Undecidability.TM.L.CompilerBoolFuns.NaryApp]
beta:100 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachine]
beta:108 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachine]
beta:12 [binder, in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisUnfoldClos]
beta:27 [binder, in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisStep]
beta:5 [binder, in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisUnfoldClos]
beta:5 [binder, in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisStep]
bezout [section, in Undecidability.Shared.Libs.DLW.Utils.gcd]
bezout_generalized [definition, in Undecidability.Shared.Libs.DLW.Utils.gcd]
bezout_generalized_lt [definition, in Undecidability.Shared.Libs.DLW.Utils.gcd]
bezout_sc [lemma, in Undecidability.Shared.Libs.DLW.Utils.gcd]
bezout_nc [lemma, in Undecidability.Shared.Libs.DLW.Utils.gcd]
bezout_rel_prime [definition, in Undecidability.Shared.Libs.DLW.Utils.gcd]
bezout_rel_prime_lt [definition, in Undecidability.Shared.Libs.DLW.Utils.gcd]
bezout.bezout_generalized [section, in Undecidability.Shared.Libs.DLW.Utils.gcd]
bezout.bezout_rel_prime [section, in Undecidability.Shared.Libs.DLW.Utils.gcd]
bezout.gcd_lcm.lcm_full [variable, in Undecidability.Shared.Libs.DLW.Utils.gcd]
bezout.gcd_lcm.gcd_full [variable, in Undecidability.Shared.Libs.DLW.Utils.gcd]
bezout.gcd_lcm [section, in Undecidability.Shared.Libs.DLW.Utils.gcd]
_ div _ [notation, in Undecidability.Shared.Libs.DLW.Utils.gcd]
Bfin:3144 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Bflat:3148 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
bibC [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
bifC [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
bijection [inductive, in Undecidability.Shared.Libs.DLW.Utils.sorting]
Bijection [section, in Undecidability.Shared.Libs.PSL.Bijection]
Bijection [library]
Bijection.X [variable, in Undecidability.Shared.Libs.PSL.Bijection]
Bijection.Y [variable, in Undecidability.Shared.Libs.PSL.Bijection]
bijective [definition, in Undecidability.Shared.Libs.PSL.Bijection]
bij_t [definition, in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
BinaryCC [record, in Complexity.NP.SAT.CookLevin.Subproblems.BinaryCC]
BinaryCC [library]
BinaryCCLang [definition, in Complexity.NP.SAT.CookLevin.Subproblems.BinaryCC]
BinaryCC_to_FSAT [lemma, in Complexity.NP.SAT.CookLevin]
BinaryCC_enc_size [lemma, in Complexity.NP.SAT.CookLevin.Subproblems.BinaryCC]
BinaryCC_wellformed [definition, in Complexity.NP.SAT.CookLevin.Subproblems.BinaryCC]
BinaryCC_instances_equivalent [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
BinaryCC_instances_wf_equivalent [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
BinaryCC_to_FSAT_poly [lemma, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
BinaryCC_wf_dec_poly [lemma, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
BinaryCC_wf_dec_time_bound [lemma, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
BinaryCC_wf_dec_time [definition, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
BinaryCC_to_FSAT [lemma, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
BinaryCC_wf_dec_correct [lemma, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
BinaryCC_wf_dec [definition, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
BinaryCC_to_FSAT [library]
binary_le_sum_powers_inv [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
binary_le_sum_powers [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
binary_le_power_inv [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
binary_power_split [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
binary_le_mult_power2_inv [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
binary_le_joins_inv' [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
binary_le_joins_inv [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
binary_le_join_inv [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
binary_le_nat_meet [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
binary_le_trans [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
binary_le_eq_lb_mask [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
binary_le_lb_mask [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
binary_le_zero [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
binary_le_zero_inv [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
binary_le_le [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
binary_le_refl [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
binary_le_inv [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
binary_le [inductive, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
BinNums [library]
BinNumsAdd [library]
BinNumsCompare [library]
BinNumsSub [library]
binomial [definition, in Undecidability.Shared.Libs.DLW.Utils.binomial]
binomial [section, in Undecidability.Shared.Libs.DLW.Utils.binomial]
binomial [library]
binomial_pascal [lemma, in Undecidability.Shared.Libs.DLW.Utils.binomial]
binomial_0n [lemma, in Undecidability.Shared.Libs.DLW.Utils.binomial]
binomial_spec [lemma, in Undecidability.Shared.Libs.DLW.Utils.binomial]
binomial_sym [lemma, in Undecidability.Shared.Libs.DLW.Utils.binomial]
binomial_le [lemma, in Undecidability.Shared.Libs.DLW.Utils.binomial]
binomial_thm [lemma, in Undecidability.Shared.Libs.DLW.Utils.binomial]
binomial_nn [lemma, in Undecidability.Shared.Libs.DLW.Utils.binomial]
binomial_gt [lemma, in Undecidability.Shared.Libs.DLW.Utils.binomial]
binomial_n1 [lemma, in Undecidability.Shared.Libs.DLW.Utils.binomial]
binomial_SS [lemma, in Undecidability.Shared.Libs.DLW.Utils.binomial]
binomial_n0 [lemma, in Undecidability.Shared.Libs.DLW.Utils.binomial]
binomial_lt_power [lemma, in Undecidability.Shared.Libs.DLW.Utils.sums]
binomial_le_power [lemma, in Undecidability.Shared.Libs.DLW.Utils.sums]
binomial_Newton [lemma, in Undecidability.Shared.Libs.DLW.Utils.sums]
∑ [notation, in Undecidability.Shared.Libs.DLW.Utils.sums]
binomial_Newton.distr_r [variable, in Undecidability.Shared.Libs.DLW.Utils.sums]
binomial_Newton.distr_l [variable, in Undecidability.Shared.Libs.DLW.Utils.sums]
binomial_Newton.M_times [variable, in Undecidability.Shared.Libs.DLW.Utils.sums]
binomial_Newton.sum_cancel [variable, in Undecidability.Shared.Libs.DLW.Utils.sums]
binomial_Newton.sum_comm [variable, in Undecidability.Shared.Libs.DLW.Utils.sums]
binomial_Newton.M_sum [variable, in Undecidability.Shared.Libs.DLW.Utils.sums]
_ ⊗ _ [notation, in Undecidability.Shared.Libs.DLW.Utils.sums]
_ ⊕ _ [notation, in Undecidability.Shared.Libs.DLW.Utils.sums]
binomial_Newton.one [variable, in Undecidability.Shared.Libs.DLW.Utils.sums]
binomial_Newton.zero [variable, in Undecidability.Shared.Libs.DLW.Utils.sums]
binomial_Newton.times [variable, in Undecidability.Shared.Libs.DLW.Utils.sums]
binomial_Newton.sum [variable, in Undecidability.Shared.Libs.DLW.Utils.sums]
binomial_Newton.X [variable, in Undecidability.Shared.Libs.DLW.Utils.sums]
binomial_Newton [section, in Undecidability.Shared.Libs.DLW.Utils.sums]
binomial.fact_neq_0 [variable, in Undecidability.Shared.Libs.DLW.Utils.binomial]
_ <d _ [notation, in Undecidability.Shared.Libs.DLW.Utils.binomial]
bin_add_eq_0x0 [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
bin_add_eq_00x [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
bin_add [abbreviation, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
bisC [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
bitsx:15 [binder, in Undecidability.TM.Code.BinNumbers.PosShiftTM]
bitsx:22 [binder, in Undecidability.TM.Code.BinNumbers.PosMultTM]
bitsx:31 [binder, in Undecidability.TM.Code.BinNumbers.PosShiftTM]
bitsx:40 [binder, in Undecidability.TM.Code.BinNumbers.PosMultTM]
bitsx:71 [binder, in Undecidability.TM.Code.BinNumbers.PosShiftTM]
bitsx:87 [binder, in Undecidability.TM.Code.BinNumbers.PosShiftTM]
bits_to_pos_to_bits [lemma, in Undecidability.TM.Code.BinNumbers.PosDefinitions]
bits_to_pos_to_bits' [lemma, in Undecidability.TM.Code.BinNumbers.PosDefinitions]
bits_to_pos_cons [lemma, in Undecidability.TM.Code.BinNumbers.PosDefinitions]
bits_to_pos'_cons [lemma, in Undecidability.TM.Code.BinNumbers.PosDefinitions]
bits_to_pos [definition, in Undecidability.TM.Code.BinNumbers.PosDefinitions]
bits_to_pos' [definition, in Undecidability.TM.Code.BinNumbers.PosDefinitions]
bits0:17 [binder, in Undecidability.TM.Code.BinNumbers.PosCompareTM]
bits0:43 [binder, in Undecidability.TM.Code.BinNumbers.PosPointers]
bits0:52 [binder, in Undecidability.TM.Code.BinNumbers.PosAddTM]
bits0:53 [binder, in Undecidability.TM.Code.BinNumbers.PosCompareTM]
bits0:59 [binder, in Undecidability.TM.Code.BinNumbers.PosCompareTM]
bits0:8 [binder, in Undecidability.TM.Code.BinNumbers.PosCompareTM]
bits0:85 [binder, in Undecidability.TM.Code.BinNumbers.PosAddTM]
bits1:11 [binder, in Undecidability.TM.Code.BinNumbers.PosCompareTM]
bits1:22 [binder, in Undecidability.TM.Code.BinNumbers.PosCompareTM]
bits1:23 [binder, in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
bits1:32 [binder, in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
bits1:38 [binder, in Undecidability.TM.Code.BinNumbers.PosDefinitions]
bits1:46 [binder, in Undecidability.TM.Code.BinNumbers.PosPointers]
bits1:55 [binder, in Undecidability.TM.Code.BinNumbers.PosAddTM]
bits1:56 [binder, in Undecidability.TM.Code.BinNumbers.PosCompareTM]
bits1:59 [binder, in Undecidability.TM.Code.BinNumbers.PosAddTM]
bits1:64 [binder, in Undecidability.TM.Code.BinNumbers.PosCompareTM]
bits1:88 [binder, in Undecidability.TM.Code.BinNumbers.PosAddTM]
bits1:92 [binder, in Undecidability.TM.Code.BinNumbers.PosAddTM]
bits2:26 [binder, in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
bits2:39 [binder, in Undecidability.TM.Code.BinNumbers.PosDefinitions]
bits2:39 [binder, in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
bits:10 [binder, in Undecidability.TM.Code.BinNumbers.PosDefinitions]
bits:13 [binder, in Undecidability.TM.Code.BinNumbers.PosIncrementTM]
bits:14 [binder, in Undecidability.TM.Code.BinNumbers.PosIncrementTM]
bits:15 [binder, in Undecidability.TM.Code.BinNumbers.PosDefinitions]
bits:17 [binder, in Undecidability.TM.Code.BinNumbers.PosDefinitions]
bits:18 [binder, in Undecidability.TM.Code.BinNumbers.PosDefinitions]
bits:20 [binder, in Undecidability.TM.Code.BinNumbers.PosIncrementTM]
bits:21 [binder, in Undecidability.TM.Code.BinNumbers.PosDefinitions]
bits:23 [binder, in Undecidability.TM.Code.BinNumbers.PosDefinitions]
bits:25 [binder, in Undecidability.TM.Code.BinNumbers.PosDefinitions]
bits:26 [binder, in Undecidability.TM.Code.BinNumbers.PosDefinitions]
bits:27 [binder, in Undecidability.TM.Code.BinNumbers.PosDefinitions]
bits:28 [binder, in Undecidability.TM.Code.BinNumbers.PosAddTM]
bits:30 [binder, in Undecidability.TM.Code.BinNumbers.PosAddTM]
bits:34 [binder, in Undecidability.TM.Code.BinNumbers.PosDefinitions]
bits:35 [binder, in Undecidability.TM.Code.BinNumbers.PosDefinitions]
bits:36 [binder, in Undecidability.TM.Code.BinNumbers.PosDefinitions]
bits:40 [binder, in Undecidability.TM.Code.BinNumbers.PosAddTM]
bits:53 [binder, in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
bits:7 [binder, in Undecidability.TM.Code.BinNumbers.PosIncrementTM]
bits:74 [binder, in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
bits:80 [binder, in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
bits:87 [binder, in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
bits:9 [binder, in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
bitToSigPos [definition, in Undecidability.TM.Code.BinNumbers.PosDefinitions]
bitToSigPos' [definition, in Undecidability.TM.Code.BinNumbers.PosDefinitions]
bit:1 [binder, in Undecidability.TM.Code.BinNumbers.PosShiftTM]
bit:22 [binder, in Undecidability.TM.Code.BinNumbers.PosDefinitions]
bit:24 [binder, in Undecidability.TM.Code.BinNumbers.PosDefinitions]
bit:7 [binder, in Undecidability.TM.Code.BinNumbers.PosShiftTM]
bit:8 [binder, in Undecidability.TM.Code.BinNumbers.PosShiftTM]
bla [section, in Undecidability.TM.Code.List.Concat_Repeat]
bla [section, in Undecidability.L.Complexity.UpToCNary]
bla [section, in Undecidability.L.Complexity.UpToC]
blank [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
body:107 [binder, in Undecidability.L.Tactics.Extract]
body:23 [binder, in Undecidability.L.Complexity.GenericNary]
body:27 [binder, in Undecidability.L.Complexity.GenericNary]
body:30 [binder, in Undecidability.L.Tactics.GenEncode]
body:30 [binder, in Undecidability.L.Complexity.GenericNary]
body:35 [binder, in Undecidability.L.Complexity.GenericNary]
body:38 [binder, in Undecidability.L.Complexity.GenericNary]
body:43 [binder, in Undecidability.L.Complexity.GenericNary]
body:76 [binder, in Undecidability.L.Complexity.GenericNary]
BookKeepingForRead [section, in Undecidability.TM.Single.StepTM]
BookKeepingForRead.sig [variable, in Undecidability.TM.Single.StepTM]
BoollistEnc [library]
BoollistToEnc [module, in Undecidability.TM.L.Transcode.Boollist_to_Enc]
BoollistToEnc.M [definition, in Undecidability.TM.L.Transcode.Boollist_to_Enc]
BoollistToEnc.M [section, in Undecidability.TM.L.Transcode.Boollist_to_Enc]
BoollistToEnc.M__loop [definition, in Undecidability.TM.L.Transcode.Boollist_to_Enc]
BoollistToEnc.M__step [definition, in Undecidability.TM.L.Transcode.Boollist_to_Enc]
BoollistToEnc.M.sig [variable, in Undecidability.TM.L.Transcode.Boollist_to_Enc]
BoollistToEnc.Realise [lemma, in Undecidability.TM.L.Transcode.Boollist_to_Enc]
BoollistToEnc.Realise__loop [lemma, in Undecidability.TM.L.Transcode.Boollist_to_Enc]
BoollistToEnc.Realise__step [lemma, in Undecidability.TM.L.Transcode.Boollist_to_Enc]
BoollistToEnc.Rel [definition, in Undecidability.TM.L.Transcode.Boollist_to_Enc]
BoollistToEnc.Rel__loop [definition, in Undecidability.TM.L.Transcode.Boollist_to_Enc]
BoollistToEnc.Rel__step [definition, in Undecidability.TM.L.Transcode.Boollist_to_Enc]
BoollistToEnc.retr__bool [instance, in Undecidability.TM.L.Transcode.Boollist_to_Enc]
BoollistToEnc.retr__nat [instance, in Undecidability.TM.L.Transcode.Boollist_to_Enc]
BoollistToEnc.SpecT [lemma, in Undecidability.TM.L.Transcode.Boollist_to_Enc]
BoollistToEnc.Ter [definition, in Undecidability.TM.L.Transcode.Boollist_to_Enc]
BoollistToEnc.Terminates [definition, in Undecidability.TM.L.Transcode.Boollist_to_Enc]
BoollistToEnc.Terminates__loop [definition, in Undecidability.TM.L.Transcode.Boollist_to_Enc]
BoollistToEnc.Terminates__step [definition, in Undecidability.TM.L.Transcode.Boollist_to_Enc]
BoollistToEnc.Ter' [definition, in Undecidability.TM.L.Transcode.Boollist_to_Enc]
BoollistToEnc._Terminates [lemma, in Undecidability.TM.L.Transcode.Boollist_to_Enc]
BoollistToEnc._Terminates__loop [lemma, in Undecidability.TM.L.Transcode.Boollist_to_Enc]
BoollistToEnc._Terminates__step [lemma, in Undecidability.TM.L.Transcode.Boollist_to_Enc]
boollist_enum.boollists_enum_term [lemma, in Complexity.NP.L.CanEnumTerm]
boollist_enum.boollist_term_size [lemma, in Complexity.NP.L.CanEnumTerm]
boollist_enum.pro_to_boollist_size [lemma, in Complexity.NP.L.CanEnumTerm]
boollist_enum.boollist_term_inv [lemma, in Complexity.NP.L.CanEnumTerm]
boollist_enum.boollist_term_inv' [lemma, in Complexity.NP.L.CanEnumTerm]
boollist_enum.pro_to_boollist [definition, in Complexity.NP.L.CanEnumTerm]
boollist_enum.term_boollist_term [instance, in Complexity.NP.L.CanEnumTerm]
boollist_enum._term_boollist_term [lemma, in Complexity.NP.L.CanEnumTerm]
boollist_enum [module, in Complexity.NP.L.CanEnumTerm]
boollist_size [lemma, in Undecidability.TM.L.Transcode.BoollistEnc]
Boollist_to_Enc [library]
Boollist2encBoolsTM [module, in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
Boollist2encBoolsTM.Fix [section, in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
Boollist2encBoolsTM.Fix.b [variable, in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
Boollist2encBoolsTM.Fix.retr_list [variable, in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
Boollist2encBoolsTM.Fix.s [variable, in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
Boollist2encBoolsTM.Fix.Σ [variable, in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
Boollist2encBoolsTM.loop_SpecT [lemma, in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
Boollist2encBoolsTM.M [definition, in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
Boollist2encBoolsTM.M__loop [definition, in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
Boollist2encBoolsTM.M__step [definition, in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
Boollist2encBoolsTM.Realise [lemma, in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
Boollist2encBoolsTM.retr_bool [instance, in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
Boollist2encBoolsTM.SpecT [lemma, in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
bool_nat [lemma, in Undecidability.Shared.Libs.PSL.Prelim]
bool_Prop_false' [lemma, in Undecidability.Shared.Libs.PSL.Prelim]
bool_Prop_true' [lemma, in Undecidability.Shared.Libs.PSL.Prelim]
bool_Prop_false [lemma, in Undecidability.Shared.Libs.PSL.Prelim]
bool_Prop_true [lemma, in Undecidability.Shared.Libs.PSL.Prelim]
bool_eq_dec [instance, in Undecidability.Shared.Libs.PSL.EqDec]
bool_dec [instance, in Undecidability.Shared.Libs.PSL.EqDec]
bool_add_with_rem [definition, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
bool_enum [definition, in Undecidability.Synthetic.EnumerabilityFacts]
bool_enum_ok [lemma, in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicFinTypes]
bool_eq_dec [instance, in Undecidability.Shared.Dec]
bool_encode_prefixInjective [lemma, in Complexity.TM.Code.DecodeBool]
bool_encode_injective [lemma, in Complexity.TM.Code.DecodeBool]
bool_decode [definition, in Undecidability.L.Functions.Decoding]
bool_enc_inv_correct [lemma, in Undecidability.L.Computability.Computability]
bool_enc_inv [definition, in Undecidability.L.Computability.Computability]
bool_enc [instance, in Undecidability.L.Functions.Encoding]
bool_nat [library]
bool_list [library]
bool2nat [definition, in Undecidability.Shared.Libs.PSL.Prelim]
bool2nat [definition, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
bool2nat2bool [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
bool2optunit [definition, in Undecidability.TM.L.HeapInterpreter.StepTM]
bound [inductive, in Undecidability.L.Util.L_facts]
boundary [inductive, in Undecidability.TM.Code.CodeTM]
boundary_eqb_spec [lemma, in Complexity.L.TM.CompCode]
boundary_eqb [definition, in Complexity.L.TM.CompCode]
boundary_fin [instance, in Undecidability.TM.Code.CodeTM]
boundary_eq [instance, in Undecidability.TM.Code.CodeTM]
boundb [definition, in Undecidability.L.Functions.Proc]
boundb_spec [lemma, in Undecidability.L.Functions.Proc]
bounded_injective [inductive, in Undecidability.Shared.Libs.DLW.Utils.sorting]
bounded_permut [inductive, in Undecidability.Shared.Libs.DLW.Utils.sorting]
bounded_min_d [lemma, in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
bounded_min.Q [variable, in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
bounded_min.P [variable, in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
bounded_min [section, in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
bounded_choose_d [lemma, in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
bounded_choose_d.Q [variable, in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
bounded_choose_d.P [variable, in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
bounded_choose_d [section, in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
bounded_search_ni [lemma, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
bounded_min [lemma, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
bounded_search [lemma, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
bounded_search [section, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
bounded_quantification [library]
boundHeap [definition, in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisUnfoldClos]
boundL:22 [binder, in Undecidability.L.Functions.LoopSum]
boundL:32 [binder, in Undecidability.L.Functions.UnboundIteration]
boundR:23 [binder, in Undecidability.L.Functions.LoopSum]
boundR:33 [binder, in Undecidability.L.Functions.UnboundIteration]
bounds__rSP [projection, in Complexity.Complexity.Definitions]
boundVar [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
bound_dec [instance, in Undecidability.L.Util.L_facts]
bound_closed [lemma, in Undecidability.L.Util.L_facts]
bound_gt [lemma, in Undecidability.L.Util.L_facts]
bound_ge [lemma, in Undecidability.L.Util.L_facts]
bound_closed_k [lemma, in Undecidability.L.Util.L_facts]
bound_unfolds_id [lemma, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
bound_unfolds_id [lemma, in Complexity.L.AbstractMachines.AbstractHeapMachine]
bound_card [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
bound_CardP [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
bound_Alphabet [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
bound_preludeSig' [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
bound_Gamma [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
bound_States [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
bound_tapeSigma [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
bound_polSigma [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
bound_stateSigma [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
bound_polarity [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
bpr:103 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
bpr:106 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
bpr:110 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
bpr:115 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
bpr:119 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
bpr:120 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
bpr:127 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
bpr:133 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
bpr:139 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
bpr:144 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
bpr:150 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
bpr:155 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
bpr:157 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
bpr:160 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
bpr:162 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
bpr:165 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
bpr:167 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
bpr:168 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
bpr:172 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
bpr:173 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
bpr:175 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
bpr:176 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
bpr:183 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
bpr:189 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
bpr:195 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
bpr:200 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
bpr:206 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
bpr:211 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
bpr:215 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
bpr:219 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
bpr:224 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
bpr:228 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
bpr:231 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
bpr:234 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
bpr:237 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
bpr:239 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
bpr:241 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
bpr:243 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
bpr:246 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
bpr:248 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
bpr:251 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
bpr:255 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
bpr:256 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
bpr:258 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
bpr:259 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
bpr:262 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
bpr:265 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
bpr:268 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
bpr:272 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
bpr:273 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
bpr:83 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
bpr:84 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
bpr:85 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
bpr:86 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
bs:10 [binder, in Complexity.NP.L.CanEnumTerm]
bs:10 [binder, in Complexity.NP.TM.M_LM2TM]
bs:102 [binder, in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
bs:106 [binder, in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
bs:11 [binder, in Complexity.NP.TM.M_LM2TM]
bs:110 [binder, in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
bs:113 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
bs:119 [binder, in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
bs:12 [binder, in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
bs:124 [binder, in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
bs:128 [binder, in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
bs:13 [binder, in Undecidability.TM.L.Transcode.Boollist_to_Enc]
bs:13 [binder, in Complexity.NP.L.CanEnumTerm]
bs:13 [binder, in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
bs:13 [binder, in Undecidability.TM.L.Transcode.Enc_to_Boollist]
bs:136 [binder, in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
bs:138 [binder, in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
bs:139 [binder, in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
bs:14 [binder, in Undecidability.TM.L.Transcode.Enc_to_Boollist]
bs:140 [binder, in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
bs:15 [binder, in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
bs:16 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
bs:17 [binder, in Complexity.NP.L.CanEnumTerm]
bs:19 [binder, in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
bs:19 [binder, in Undecidability.TM.L.Transcode.Enc_to_Boollist]
bs:2 [binder, in Undecidability.TM.L.Transcode.BoollistEnc]
bs:20 [binder, in Undecidability.TM.L.Transcode.Boollist_to_Enc]
bs:21 [binder, in Complexity.NP.TM.M_LM2TM]
bs:21 [binder, in Undecidability.TM.L.Transcode.Enc_to_Boollist]
bs:22 [binder, in Complexity.NP.TM.M_LM2TM]
bs:22 [binder, in Complexity.TM.Single.DecodeTape]
bs:24 [binder, in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
bs:24 [binder, in Complexity.NP.TM.M_LM2TM]
bs:24 [binder, in Undecidability.TM.L.Transcode.Enc_to_Boollist]
bs:25 [binder, in Complexity.NP.TM.M_LM2TM]
bs:25 [binder, in Undecidability.TM.L.Transcode.Enc_to_Boollist]
bs:26 [binder, in Complexity.TM.Code.DecodeList]
bs:26 [binder, in Complexity.TM.Single.DecodeTape]
bs:26 [binder, in Complexity.NP.TM.LM_to_mTM]
bs:27 [binder, in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
bs:27 [binder, in Complexity.TM.Single.DecodeTape]
bs:27 [binder, in Undecidability.TM.L.Transcode.Enc_to_Boollist]
bs:3 [binder, in Complexity.NP.L.CanEnumTerm]
bs:3 [binder, in Undecidability.TM.L.Transcode.BoollistEnc]
bs:30 [binder, in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
bs:30 [binder, in Undecidability.TM.L.Transcode.Enc_to_Boollist]
bs:31 [binder, in Complexity.TM.Single.DecodeTape]
bs:32 [binder, in Undecidability.TM.L.Transcode.Boollist_to_Enc]
bs:32 [binder, in Complexity.NP.TM.LM_to_mTM]
bs:33 [binder, in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
bs:33 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
bs:33 [binder, in Complexity.TM.Single.DecodeTape]
bs:33 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler]
bs:34 [binder, in Undecidability.TM.L.Transcode.Enc_to_Boollist]
bs:36 [binder, in Complexity.TM.Single.DecodeTape]
bs:37 [binder, in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
bs:38 [binder, in Undecidability.TM.L.Transcode.Enc_to_Boollist]
bs:39 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
bs:39 [binder, in Complexity.TM.Single.DecodeTape]
bs:40 [binder, in Complexity.NP.TM.LM_to_mTM]
bs:41 [binder, in Undecidability.TM.L.Transcode.Boollist_to_Enc]
bs:41 [binder, in Complexity.TM.Single.DecodeTape]
bs:41 [binder, in Undecidability.TM.L.Transcode.Enc_to_Boollist]
bs:42 [binder, in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
bs:44 [binder, in Undecidability.TM.L.Transcode.Boollist_to_Enc]
bs:44 [binder, in Undecidability.TM.L.Transcode.Enc_to_Boollist]
bs:45 [binder, in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
bs:46 [binder, in Undecidability.TM.L.Transcode.Boollist_to_Enc]
bs:47 [binder, in Undecidability.TM.L.Transcode.Enc_to_Boollist]
bs:48 [binder, in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
bs:5 [binder, in Undecidability.TM.L.Transcode.Enc_to_Boollist]
bs:51 [binder, in Undecidability.TM.L.Transcode.Enc_to_Boollist]
bs:53 [binder, in Complexity.L.AbstractMachines.FlatPro.Computable.Compile]
bs:54 [binder, in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
bs:54 [binder, in Complexity.L.AbstractMachines.FlatPro.Computable.Compile]
bs:55 [binder, in Undecidability.TM.L.Transcode.Enc_to_Boollist]
bs:56 [binder, in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
bs:56 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler]
bs:57 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler]
bs:58 [binder, in Undecidability.TM.L.Transcode.Enc_to_Boollist]
bs:588 [binder, in Complexity.NP.TM.LM_to_mTM]
bs:592 [binder, in Complexity.NP.TM.LM_to_mTM]
bs:6 [binder, in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
bs:6 [binder, in Undecidability.TM.L.Transcode.BoollistEnc]
bs:60 [binder, in Complexity.NP.L.CanEnumTerm]
bs:60 [binder, in Undecidability.TM.L.Transcode.Enc_to_Boollist]
bs:62 [binder, in Complexity.NP.L.CanEnumTerm]
bs:62 [binder, in Undecidability.TM.L.Transcode.Enc_to_Boollist]
bs:63 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
bs:64 [binder, in Complexity.TM.Single.DecodeTape]
bs:65 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler]
bs:66 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler]
bs:68 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
bs:69 [binder, in Complexity.NP.L.CanEnumTerm]
bs:69 [binder, in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
bs:69 [binder, in Complexity.TM.Single.DecodeTape]
bs:7 [binder, in Undecidability.TM.L.Transcode.Boollist_to_Enc]
bs:7 [binder, in Undecidability.TM.L.Transcode.Enc_to_Boollist]
bs:7 [binder, in Undecidability.TM.L.Transcode.BoollistEnc]
bs:71 [binder, in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
bs:72 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler]
bs:74 [binder, in Complexity.NP.L.CanEnumTerm]
bs:76 [binder, in Complexity.NP.L.CanEnumTerm]
bs:76 [binder, in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
bs:77 [binder, in Complexity.NP.L.CanEnumTerm]
bs:77 [binder, in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
bs:8 [binder, in Complexity.NP.L.CanEnumTerm]
bs:8 [binder, in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
bs:80 [binder, in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
bs:84 [binder, in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
bs:92 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler]
bs:93 [binder, in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
bs:98 [binder, in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
bs:98 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler]
bx:14 [binder, in Undecidability.TM.Code.BinNumbers.PosShiftTM]
bx:21 [binder, in Undecidability.TM.Code.BinNumbers.PosMultTM]
bx:30 [binder, in Undecidability.TM.Code.BinNumbers.PosShiftTM]
bx:39 [binder, in Undecidability.TM.Code.BinNumbers.PosMultTM]
bx:70 [binder, in Undecidability.TM.Code.BinNumbers.PosShiftTM]
bx:86 [binder, in Undecidability.TM.Code.BinNumbers.PosShiftTM]
B_int:68 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
b__R:7 [binder, in Complexity.TM.Single.EncodeTapesInvariants]
b__L:6 [binder, in Complexity.TM.Single.EncodeTapesInvariants]
B':101 [binder, in Undecidability.Shared.Libs.PSL.Retracts]
B':113 [binder, in Undecidability.Shared.Libs.PSL.Retracts]
B':128 [binder, in Undecidability.Shared.Libs.PSL.Retracts]
b':14 [binder, in Undecidability.TM.Util.Prelim]
B':146 [binder, in Undecidability.Shared.Libs.PSL.Retracts]
b':15 [binder, in Undecidability.TM.Code.BinNumbers.PosPointers]
b':157 [binder, in Complexity.L.TM.TMunflatten]
b':180 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
b':189 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
b':21 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.FiniteFunction]
B':2665 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
B':2684 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b':2686 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b':27 [binder, in Complexity.TM.Single.EncodeTapesInvariants]
b':2708 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b':28 [binder, in Undecidability.TM.Code.BinNumbers.PosPointers]
b':3650 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b':38 [binder, in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
b':40 [binder, in Undecidability.L.Functions.FinTypeLookup]
b':43 [binder, in Undecidability.TM.Util.Prelim]
b':48 [binder, in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
b':66 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
B':70 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
b':75 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
b':79 [binder, in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
b':83 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
b':86 [binder, in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
b':89 [binder, in Complexity.L.TM.TMunflatten]
B':92 [binder, in Undecidability.Shared.Libs.PSL.Retracts]
b0:16 [binder, in Undecidability.TM.Code.BinNumbers.PosCompareTM]
b0:42 [binder, in Undecidability.TM.Code.BinNumbers.PosPointers]
b0:49 [binder, in Undecidability.TM.Code.BinNumbers.PosPointers]
b0:51 [binder, in Undecidability.TM.Code.BinNumbers.PosAddTM]
b0:52 [binder, in Undecidability.TM.Code.BinNumbers.PosCompareTM]
b0:58 [binder, in Undecidability.TM.Code.BinNumbers.PosCompareTM]
b0:7 [binder, in Undecidability.TM.Code.BinNumbers.PosCompareTM]
b0:84 [binder, in Undecidability.TM.Code.BinNumbers.PosAddTM]
b1:10 [binder, in Undecidability.TM.Code.BinNumbers.PosCompareTM]
b1:11 [binder, in Complexity.TM.Code.DecodeList]
b1:11 [binder, in Undecidability.Synthetic.DecidabilityFacts]
b1:12 [binder, in Complexity.NP.SAT.SAT]
b1:14 [binder, in Complexity.NP.Clique.kSAT_to_FlatClique]
b1:15 [binder, in Complexity.NP.Clique.kSAT_to_Clique]
b1:17 [binder, in Complexity.TM.Single.DecodeTapes]
b1:18 [binder, in Complexity.NP.SAT.SAT]
b1:21 [binder, in Undecidability.TM.Code.BinNumbers.PosCompareTM]
b1:22 [binder, in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
b1:31 [binder, in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
b1:34 [binder, in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
b1:35 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.FiniteFunction]
b1:42 [binder, in Undecidability.L.Functions.FinTypeLookup]
b1:45 [binder, in Undecidability.TM.Code.BinNumbers.PosPointers]
b1:5 [binder, in Undecidability.TM.Code.CasePair]
b1:5 [binder, in Undecidability.TM.Code.List.App]
b1:51 [binder, in Undecidability.TM.Code.BinNumbers.PosPointers]
b1:53 [binder, in Undecidability.L.Functions.FinTypeLookup]
b1:54 [binder, in Undecidability.TM.Code.BinNumbers.PosAddTM]
b1:55 [binder, in Undecidability.TM.Code.BinNumbers.PosCompareTM]
b1:58 [binder, in Undecidability.TM.Code.BinNumbers.PosAddTM]
b1:59 [binder, in Complexity.L.TM.TMunflatten]
b1:63 [binder, in Undecidability.TM.Code.BinNumbers.PosCompareTM]
b1:7 [binder, in Undecidability.Synthetic.DecidabilityFacts]
b1:70 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
b1:87 [binder, in Undecidability.TM.Code.BinNumbers.PosAddTM]
b1:91 [binder, in Complexity.L.TM.TMunflatten]
b1:91 [binder, in Undecidability.TM.Code.BinNumbers.PosAddTM]
b2:12 [binder, in Undecidability.Synthetic.DecidabilityFacts]
b2:13 [binder, in Complexity.NP.SAT.SAT]
b2:16 [binder, in Complexity.NP.Clique.kSAT_to_FlatClique]
b2:17 [binder, in Complexity.NP.Clique.kSAT_to_Clique]
b2:19 [binder, in Complexity.NP.SAT.SAT]
b2:25 [binder, in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
b2:36 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.FiniteFunction]
b2:38 [binder, in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
b2:43 [binder, in Undecidability.L.Functions.FinTypeLookup]
b2:54 [binder, in Undecidability.L.Functions.FinTypeLookup]
b2:6 [binder, in Undecidability.TM.Code.CasePair]
b2:6 [binder, in Undecidability.TM.Code.List.App]
b2:60 [binder, in Complexity.L.TM.TMunflatten]
b2:71 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
b2:8 [binder, in Undecidability.Synthetic.DecidabilityFacts]
b2:92 [binder, in Complexity.L.TM.TMunflatten]
b:1 [binder, in Undecidability.L.Datatypes.LBool]
b:1 [binder, in Undecidability.TM.L.Transcode.BoollistEnc]
b:10 [binder, in Undecidability.L.Datatypes.LProd]
B:10 [binder, in Undecidability.Shared.Libs.PSL.FCI]
b:10 [binder, in Undecidability.Shared.Libs.PSL.Prelim]
B:10 [binder, in Undecidability.Shared.Libs.PSL.Lists.Dupfree]
B:100 [binder, in Undecidability.Shared.Libs.PSL.Retracts]
b:100 [binder, in Complexity.Complexity.UpToCPoly]
b:1007 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
b:101 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
b:101 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
b:1010 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
b:1019 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
B:102 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
b:102 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
b:102 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
b:1020 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
b:1021 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:1023 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:1028 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:103 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
b:103 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
b:1036 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
B:104 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
b:1043 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
b:1044 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:1045 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
b:105 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
b:106 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
B:106 [binder, in Complexity.L.TM.CompCode]
b:1068 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
b:107 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.CC]
b:1073 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:1075 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:1077 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
B:108 [binder, in Undecidability.L.Tactics.Extract]
B:108 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
b:108 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
b:109 [binder, in Complexity.TM.Single.DecodeTape]
B:11 [binder, in Undecidability.L.Complexity.UpToCNary]
b:11 [binder, in Undecidability.Shared.Libs.PSL.Prelim]
b:11 [binder, in Undecidability.TM.Combinators.If]
b:11 [binder, in Undecidability.TM.Code.NatSub]
b:11 [binder, in Undecidability.TM.Hoare.HoareMult]
b:11 [binder, in Complexity.NP.SAT.SAT]
b:11 [binder, in Undecidability.TM.L.HeapInterpreter.LookupTM]
B:11 [binder, in Undecidability.L.Prelim.MoreList]
B:110 [binder, in Complexity.L.TM.CompCode]
b:110 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
B:112 [binder, in Undecidability.Shared.Libs.PSL.Retracts]
b:112 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
b:113 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
b:115 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
b:115 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.CC]
b:117 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
b:119 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.CC]
B:12 [binder, in Complexity.Libs.Pigeonhole]
b:12 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
B:12 [binder, in Undecidability.L.Computability.Enum]
b:12 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
B:12 [binder, in Complexity.L.TM.TMflatComp]
b:12 [binder, in Complexity.L.Functions.BinNumsSub]
b:12 [binder, in Undecidability.TM.Combinators.If]
b:12 [binder, in Complexity.TM.Single.DecodeTapes]
B:12 [binder, in Undecidability.L.TM.TMEncoding]
b:12 [binder, in Undecidability.TM.Code.Code]
B:12 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.Cardinality]
B:12 [binder, in Undecidability.TM.Code.List.App]
B:12 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.FiniteFunction]
b:120 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
b:120 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
b:122 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
b:122 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
b:123 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
b:123 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
b:124 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
b:124 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
b:124 [binder, in Undecidability.TM.Hoare.HoareExamples]
b:124 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
b:126 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
B:127 [binder, in Undecidability.Shared.Libs.PSL.Retracts]
b:128 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
b:128 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
B:13 [binder, in Complexity.Libs.Pigeonhole]
B:13 [binder, in Undecidability.L.Datatypes.LOptions]
b:13 [binder, in Undecidability.TM.Code.BinNumbers.PosDefinitions]
b:13 [binder, in Undecidability.TM.Util.Prelim]
b:13 [binder, in Undecidability.L.Computability.Por]
b:130 [binder, in Undecidability.TM.Hoare.HoareExamples]
B:131 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
b:132 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
b:132 [binder, in Undecidability.TM.Hoare.HoareExamples]
b:132 [binder, in Complexity.NP.Clique.kSAT_to_FlatClique]
B:133 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
b:133 [binder, in Undecidability.TM.Hoare.HoareExamples]
b:133 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
b:134 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.CC]
B:135 [binder, in Complexity.L.TM.CompCode]
b:136 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
b:136 [binder, in Undecidability.TM.Hoare.HoareExamples]
b:138 [binder, in Complexity.Libs.CookPrelim.PolyBounds]
B:139 [binder, in Complexity.L.TM.CompCode]
b:139 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
b:139 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachine]
b:139 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
B:14 [binder, in Undecidability.Shared.Libs.PSL.Lists.Removal]
b:14 [binder, in Undecidability.Shared.Libs.PSL.Prelim]
b:14 [binder, in Undecidability.TM.Code.NatTM]
B:14 [binder, in Undecidability.Shared.Libs.PSL.Lists.Position]
b:14 [binder, in Undecidability.TM.Code.BinNumbers.PosPointers]
b:14 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
B:14 [binder, in Undecidability.L.Tactics.ComputableTactics]
B:14 [binder, in Undecidability.Shared.Libs.PSL.Lists.Cardinality]
b:14 [binder, in Undecidability.L.Functions.FinTypeLookup]
b:140 [binder, in Undecidability.TM.Hoare.HoareExamples]
b:141 [binder, in Complexity.TM.PrettyBounds.UnivBounds]
B:141 [binder, in Undecidability.TM.Compound.Compare]
b:141 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
B:143 [binder, in Complexity.TM.PrettyBounds.UnivBounds]
b:143 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
b:144 [binder, in Undecidability.TM.Hoare.HoareExamples]
b:144 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
B:145 [binder, in Undecidability.Shared.Libs.PSL.Retracts]
b:145 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
b:145 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
b:146 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachine]
b:147 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
b:147 [binder, in Undecidability.TM.Hoare.HoareExamples]
b:148 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
b:149 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
B:15 [binder, in Undecidability.Shared.FilterFacts]
B:15 [binder, in Undecidability.L.Complexity.UpToCNary]
b:15 [binder, in Undecidability.Shared.Libs.PSL.Prelim]
b:15 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
B:15 [binder, in Undecidability.Shared.Libs.PSL.Lists.Filter]
b:15 [binder, in Undecidability.Synthetic.DecidabilityFacts]
b:15 [binder, in Undecidability.L.Datatypes.List.List_in]
b:15 [binder, in Undecidability.TM.Hoare.HoareMult]
b:15 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.FiniteFunction]
B:15 [binder, in Undecidability.L.Prelim.MoreList]
b:150 [binder, in Complexity.Libs.CookPrelim.PolyBounds]
b:150 [binder, in Undecidability.Shared.Libs.DLW.Utils.php]
b:151 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
b:151 [binder, in Undecidability.TM.Hoare.HoareExamples]
b:153 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
b:153 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
b:153 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
B:155 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
b:155 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
b:156 [binder, in Complexity.L.TM.TMunflatten]
b:156 [binder, in Undecidability.TM.Hoare.HoareExamples]
b:157 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
b:157 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
b:158 [binder, in Undecidability.TM.Hoare.HoareExamples]
b:16 [binder, in Complexity.L.AbstractMachines.Computable.UnivDecTime]
b:16 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
B:16 [binder, in Undecidability.Shared.Libs.PSL.Lists.Cardinality]
B:16 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.Cardinality]
b:16 [binder, in Undecidability.L.Computability.Por]
B:16 [binder, in Undecidability.L.Prelim.MoreList]
b:160 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
b:160 [binder, in Undecidability.Shared.Libs.DLW.Utils.php]
b:160 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
b:161 [binder, in Undecidability.TM.Hoare.HoareExamples]
b:163 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
b:163 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
b:163 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
B:165 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
b:165 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
b:165 [binder, in Undecidability.TM.Hoare.HoareExamples]
b:166 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
b:166 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
b:167 [binder, in Undecidability.TM.Hoare.HoareExamples]
b:168 [binder, in Undecidability.TM.Hoare.HoareExamples]
b:169 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
b:169 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
B:17 [binder, in Undecidability.Shared.Libs.PSL.Lists.Removal]
B:17 [binder, in Undecidability.L.Datatypes.LOptions]
b:17 [binder, in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
b:17 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
b:17 [binder, in Undecidability.TM.Util.Prelim]
B:17 [binder, in Undecidability.Shared.Libs.PSL.Inhabited]
b:17 [binder, in Undecidability.L.Functions.EqBool]
B:17 [binder, in Undecidability.L.TM.TMEncoding]
B:17 [binder, in Undecidability.Shared.ListAutomation]
B:17 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.Cardinality]
b:17 [binder, in Complexity.NP.SAT.SAT]
B:17 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.FiniteFunction]
B:17 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
b:170 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
B:171 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
b:171 [binder, in Undecidability.TM.Hoare.HoareExamples]
b:172 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
b:174 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
b:175 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
b:175 [binder, in Undecidability.TM.Hoare.HoareExamples]
b:176 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
B:176 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
B:177 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
b:177 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
B:178 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
b:179 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
b:179 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
b:179 [binder, in Undecidability.TM.Hoare.HoareExamples]
B:18 [binder, in Complexity.TM.Single.EncodeTapesInvariants]
b:18 [binder, in Undecidability.TM.Code.NatSub]
b:18 [binder, in Undecidability.TM.Hoare.HoareMult]
b:18 [binder, in Complexity.NP.Clique.kSAT_to_FlatClique]
b:18 [binder, in Complexity.L.Functions.BinNumsAdd]
b:181 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
b:181 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
B:181 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
b:182 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
b:182 [binder, in Undecidability.TM.Hoare.HoareExamples]
b:184 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
b:185 [binder, in Undecidability.TM.Hoare.HoareExamples]
b:186 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
B:187 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
B:187 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
b:188 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
b:188 [binder, in Undecidability.TM.Hoare.HoareExamples]
B:19 [binder, in Undecidability.L.Complexity.UpToCNary]
b:19 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
b:19 [binder, in Undecidability.TM.Code.BinNumbers.PosIncrementTM]
B:19 [binder, in Undecidability.Shared.Libs.PSL.Inhabited]
B:19 [binder, in Complexity.L.TM.CompCode]
b:19 [binder, in Undecidability.TM.Code.BinNumbers.PosPointers]
b:19 [binder, in Undecidability.L.Datatypes.List.List_in]
b:19 [binder, in Complexity.L.Functions.BinNumsAdd]
b:190 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
B:191 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
b:192 [binder, in Undecidability.TM.Hoare.HoareExamples]
b:193 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
b:193 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
b:193 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
b:196 [binder, in Undecidability.TM.Hoare.HoareExamples]
B:197 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
b:197 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
B:197 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
B:199 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
b:199 [binder, in Undecidability.TM.Hoare.HoareExamples]
b:2 [binder, in Undecidability.TM.Code.BinNumbers.PosDefinitions]
b:2 [binder, in Undecidability.L.Datatypes.LBool]
B:2 [binder, in Undecidability.L.Computability.Enum]
B:2 [binder, in Complexity.L.TM.CompCode]
b:2 [binder, in Complexity.Libs.CookPrelim.Tactics]
B:2 [binder, in Undecidability.L.Functions.EnumInt]
b:2 [binder, in Undecidability.TM.Hoare.HoareMult]
B:2 [binder, in Undecidability.TM.Code.CasePair]
B:2 [binder, in Undecidability.TM.Code.List.App]
B:2 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.FiniteFunction]
B:20 [binder, in Undecidability.Shared.Libs.PSL.Lists.Removal]
B:20 [binder, in Undecidability.Shared.Libs.PSL.Inhabited]
b:20 [binder, in Complexity.TM.Single.EncodeTapesInvariants]
b:20 [binder, in Undecidability.Shared.Libs.DLW.Utils.crt]
b:20 [binder, in Complexity.L.Functions.BinNumsSub]
b:20 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
B:20 [binder, in Undecidability.L.TM.TMEncoding]
b:20 [binder, in Undecidability.L.Computability.Computability]
b:20 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.FiniteFunction]
b:200 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
b:201 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
b:203 [binder, in Undecidability.TM.Hoare.HoareExamples]
b:204 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
B:207 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
b:207 [binder, in Undecidability.TM.Hoare.HoareExamples]
B:21 [binder, in Undecidability.L.Computability.Enum]
b:21 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
b:21 [binder, in Undecidability.L.Datatypes.List.List_in]
B:21 [binder, in Undecidability.Shared.Libs.PSL.Lists.Cardinality]
B:21 [binder, in Undecidability.Shared.ListAutomation]
b:21 [binder, in Complexity.NP.SAT.SAT]
B:21 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
b:210 [binder, in Undecidability.TM.Hoare.HoareExamples]
b:211 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
b:214 [binder, in Undecidability.TM.Hoare.HoareExamples]
b:214 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
B:215 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
b:219 [binder, in Undecidability.TM.Hoare.HoareExamples]
b:22 [binder, in Undecidability.TM.Util.Prelim]
b:22 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
B:22 [binder, in Undecidability.Shared.Libs.PSL.Inhabited]
B:22 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.VectorFin]
b:22 [binder, in Undecidability.TM.Combinators.If]
B:22 [binder, in Undecidability.TM.Code.ChangeAlphabet]
b:22 [binder, in Undecidability.TM.Hoare.HoareMult]
b:221 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
b:2224 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
B:223 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
b:2233 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:224 [binder, in Undecidability.TM.Hoare.HoareExamples]
b:2242 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:225 [binder, in Undecidability.TM.Hoare.HoareCombinators]
b:2251 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:2260 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:2269 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:2278 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
B:228 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
b:228 [binder, in Undecidability.TM.Hoare.HoareExamples]
b:2287 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:2296 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:23 [binder, in Undecidability.L.Datatypes.LOptions]
b:23 [binder, in Undecidability.Shared.Libs.PSL.Retracts]
b:23 [binder, in Complexity.TM.Single.EncodeTapesInvariants]
B:23 [binder, in Complexity.L.TM.CompCode]
B:23 [binder, in Undecidability.L.TM.TMEncoding]
b:23 [binder, in Undecidability.L.Datatypes.LNat]
B:23 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.FiniteFunction]
b:2304 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:2312 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:232 [binder, in Undecidability.TM.Hoare.HoareExamples]
b:2320 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:2328 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:233 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
b:2336 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
B:234 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
b:2344 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:2352 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:236 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
B:236 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
b:236 [binder, in Undecidability.TM.Hoare.HoareExamples]
b:2360 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:2368 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
B:24 [binder, in Undecidability.L.Datatypes.LSum]
b:24 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
b:24 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.VectorFin]
b:24 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
B:24 [binder, in Undecidability.Shared.Libs.PSL.Lists.Cardinality]
b:241 [binder, in Undecidability.TM.Hoare.HoareExamples]
b:244 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
B:245 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
b:246 [binder, in Undecidability.TM.Hoare.HoareExamples]
b:247 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
B:249 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
b:249 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
B:25 [binder, in Undecidability.Shared.Libs.PSL.Inhabited]
B:25 [binder, in Undecidability.L.Tactics.ComputableDemo]
b:25 [binder, in Undecidability.L.Datatypes.LNat]
b:250 [binder, in Undecidability.TM.Hoare.HoareExamples]
b:251 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
b:255 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
b:256 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
b:256 [binder, in Undecidability.TM.Hoare.HoareExamples]
b:258 [binder, in Undecidability.TM.Hoare.HoareExamples]
b:26 [binder, in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
b:26 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
b:26 [binder, in Undecidability.TM.Util.Prelim]
b:26 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
b:26 [binder, in Undecidability.TM.Code.NatSub]
B:26 [binder, in Undecidability.L.Datatypes.List.List_eqb]
b:26 [binder, in Complexity.TM.Single.DecodeTapes]
B:26 [binder, in Undecidability.Shared.Libs.PSL.Lists.Cardinality]
B:26 [binder, in Undecidability.Shared.ListAutomation]
b:260 [binder, in Undecidability.TM.Hoare.HoareExamples]
B:262 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
b:262 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
b:264 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
B:2658 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
B:266 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
b:266 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
B:2677 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:2679 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:269 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
b:2692 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
B:2699 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:27 [binder, in Undecidability.TM.Code.BinNumbers.PosPointers]
B:27 [binder, in Undecidability.L.Datatypes.List.List_extra]
b:27 [binder, in Undecidability.TM.Hoare.HoareMult]
b:27 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
b:2700 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
B:2703 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:2706 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:273 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
b:28 [binder, in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
b:28 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
B:28 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
B:28 [binder, in Undecidability.L.Datatypes.LSum]
B:28 [binder, in Undecidability.L.TM.TMEncoding]
b:282 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
b:29 [binder, in Undecidability.Shared.Libs.DLW.Utils.crt]
B:29 [binder, in Undecidability.L.Tactics.ComputableDemo]
b:29 [binder, in Complexity.NP.SAT.SAT_inNP]
b:29 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
b:29 [binder, in Undecidability.L.Functions.EqBool]
B:29 [binder, in Undecidability.Shared.Libs.PSL.Lists.Cardinality]
B:29 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.FiniteFunction]
b:3 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
b:3 [binder, in Undecidability.TM.Code.BinNumbers.PosDefinitions]
b:3 [binder, in Complexity.L.TM.TMflatEnc]
B:3 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
b:3 [binder, in Undecidability.TM.Compound.CopySymbols]
B:3 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
b:3 [binder, in Undecidability.TM.Code.NatSub]
b:3 [binder, in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
b:30 [binder, in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
b:30 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
b:30 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
b:30 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
B:30 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
b:3030 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:3035 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:3049 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
B:31 [binder, in Undecidability.Shared.Libs.PSL.Lists.Removal]
b:31 [binder, in Undecidability.Shared.Libs.PSL.EqDec]
B:31 [binder, in Undecidability.L.Datatypes.List.List_extra]
b:31 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
B:31 [binder, in Undecidability.L.Datatypes.List.List_eqb]
B:31 [binder, in Undecidability.Shared.Libs.PSL.Lists.Power]
b:31 [binder, in Undecidability.TM.Code.BinNumbers.PosAddTM]
b:3134 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:32 [binder, in Undecidability.TM.Code.BinNumbers.PosDefinitions]
B:32 [binder, in Complexity.L.TM.CompCode]
b:32 [binder, in Undecidability.TM.Combinators.If]
b:32 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
B:32 [binder, in Undecidability.Shared.Libs.PSL.Lists.Dupfree]
b:32 [binder, in Undecidability.TM.Hoare.HoareMult]
b:32 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.FiniteFunction]
B:3200 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:3203 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
B:3208 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:3222 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:323 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
b:3280 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:3290 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:33 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
b:33 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
B:33 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
b:33 [binder, in Complexity.NP.SAT.SAT_inNP]
b:33 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
B:33 [binder, in Undecidability.L.TM.TMEncoding]
B:33 [binder, in Undecidability.L.Functions.FinTypeLookup]
b:3300 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:3312 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:332 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:3322 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:3332 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:3344 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
B:335 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:3354 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:3364 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
B:339 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
B:34 [binder, in Undecidability.Shared.Libs.PSL.Lists.Removal]
b:34 [binder, in Undecidability.Shared.Libs.DLW.Utils.crt]
B:34 [binder, in Undecidability.Shared.Libs.PSL.Lists.Power]
B:34 [binder, in Undecidability.Shared.Libs.PSL.Lists.Dupfree]
b:34 [binder, in Undecidability.L.Datatypes.List.List_in]
b:34 [binder, in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
B:34 [binder, in Undecidability.Shared.ListAutomation]
b:34 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
b:35 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
B:35 [binder, in Undecidability.Synthetic.Infinite]
b:35 [binder, in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
b:35 [binder, in Undecidability.TM.Code.BinNumbers.PosAddTM]
b:350 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:354 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
b:358 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:36 [binder, in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
b:36 [binder, in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisUnfoldClos]
B:36 [binder, in Complexity.L.TM.CompCode]
B:36 [binder, in Undecidability.L.Tactics.ComputableDemo]
B:36 [binder, in Undecidability.L.Datatypes.LVector]
B:36 [binder, in Undecidability.L.Datatypes.List.List_eqb]
b:36 [binder, in Undecidability.TM.Hoare.HoareMult]
b:364 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
b:3645 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:3648 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:368 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:369 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
B:37 [binder, in Undecidability.Shared.ListAutomation]
b:373 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
b:378 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:38 [binder, in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
B:38 [binder, in Undecidability.L.Tactics.Extract]
b:38 [binder, in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisUnfoldClos]
B:38 [binder, in Complexity.L.TM.CompCode]
b:38 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
b:38 [binder, in Undecidability.TM.Code.BinNumbers.PosPointers]
B:38 [binder, in Undecidability.Shared.Libs.PSL.Lists.Power]
b:38 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
b:38 [binder, in Undecidability.L.Datatypes.List.List_in]
b:38 [binder, in Undecidability.L.Functions.FinTypeLookup]
b:39 [binder, in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
B:39 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
b:39 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
B:395 [binder, in Undecidability.TM.Util.TM_facts]
b:398 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
B:4 [binder, in Undecidability.L.Datatypes.List.List_basics]
b:4 [binder, in Undecidability.TM.Code.BinNumbers.PosDefinitions]
b:4 [binder, in Undecidability.L.Datatypes.LBool]
B:4 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
b:4 [binder, in Undecidability.TM.Compound.MoveToSymbol]
b:4 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_nat_facts]
b:4 [binder, in Undecidability.Shared.Libs.DLW.Utils.interval]
b:4 [binder, in Undecidability.L.Computability.Decidability]
b:4 [binder, in Undecidability.Synthetic.Definitions]
B:4 [binder, in Complexity.L.TM.TMflatten]
b:4 [binder, in Undecidability.L.Datatypes.List.List_in]
b:4 [binder, in Undecidability.Shared.Dec]
b:4 [binder, in Undecidability.L.Computability.MuRec]
b:4 [binder, in Undecidability.TM.L.Transcode.Enc_to_Boollist]
B:4 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.CompoundFinTypes]
b:40 [binder, in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
b:40 [binder, in Undecidability.TM.Code.List.Concat_Repeat]
b:40 [binder, in Undecidability.Shared.Libs.PSL.Retracts]
b:40 [binder, in Undecidability.TM.Code.NatTM]
b:40 [binder, in Undecidability.TM.Code.NatSub]
b:40 [binder, in Undecidability.TM.Hoare.HoareMult]
B:40 [binder, in Undecidability.Shared.ListAutomation]
b:403 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
b:403 [binder, in Undecidability.TM.Util.TM_facts]
b:41 [binder, in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
b:41 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
B:41 [binder, in Undecidability.Shared.Libs.PSL.Lists.Power]
b:41 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.CC]
b:42 [binder, in Undecidability.Shared.Libs.PSL.Retracts]
B:42 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
B:42 [binder, in Complexity.L.TM.CompCode]
b:42 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
B:42 [binder, in Undecidability.L.Datatypes.List.List_eqb]
b:42 [binder, in Undecidability.L.Datatypes.List.List_in]
b:42 [binder, in Undecidability.TM.Code.BinNumbers.PosAddTM]
B:42 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.FiniteFunction]
b:43 [binder, in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
B:43 [binder, in Undecidability.L.Computability.Enum]
B:43 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
b:43 [binder, in Undecidability.Shared.Libs.DLW.Utils.crt]
b:43 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
B:43 [binder, in Undecidability.Shared.ListAutomation]
b:436 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:44 [binder, in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
b:44 [binder, in Undecidability.TM.Code.BinNumbers.PosDefinitions]
b:44 [binder, in Undecidability.TM.Code.NatTM]
b:44 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
b:44 [binder, in Undecidability.TM.Hoare.HoareMult]
b:44 [binder, in Undecidability.TM.Code.BinNumbers.PosAddTM]
b:444 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:45 [binder, in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
b:45 [binder, in Undecidability.Shared.Libs.PSL.Retracts]
b:45 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
B:45 [binder, in Undecidability.L.Datatypes.List.List_eqb]
B:45 [binder, in Undecidability.L.Functions.FinTypeLookup]
B:45 [binder, in Undecidability.Shared.ListAutomation]
b:45 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.CC]
b:454 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:46 [binder, in Undecidability.TM.Code.List.Concat_Repeat]
B:46 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
b:46 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
b:46 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
b:46 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.FiniteFunction]
b:464 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:47 [binder, in Undecidability.Shared.Libs.DLW.Utils.prime]
b:47 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
b:47 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
b:47 [binder, in Undecidability.Shared.Libs.DLW.Utils.list_bool]
b:47 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
B:47 [binder, in Undecidability.L.AbstractMachines.FlatPro.Programs]
b:48 [binder, in Undecidability.TM.Code.BinNumbers.PosDefinitions]
B:48 [binder, in Undecidability.L.Computability.Enum]
b:48 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
b:48 [binder, in Undecidability.TM.Code.NatSub]
b:48 [binder, in Undecidability.L.Datatypes.List.List_eqb]
b:48 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.CC]
b:481 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:489 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:49 [binder, in Undecidability.Shared.Libs.PSL.Retracts]
b:49 [binder, in Complexity.TM.Single.DecodeTapes]
b:49 [binder, in Undecidability.TM.Hoare.HoareMult]
b:499 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
B:5 [binder, in Undecidability.L.Tactics.GenEncode]
B:5 [binder, in Undecidability.Shared.Libs.PSL.Inhabited]
b:5 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
b:5 [binder, in Undecidability.Synthetic.DecidabilityFacts]
b:5 [binder, in Undecidability.TM.Hoare.HoareMult]
b:5 [binder, in Undecidability.TM.L.Transcode.BoollistEnc]
b:50 [binder, in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
b:50 [binder, in Undecidability.TM.Code.BinNumbers.PosDefinitions]
b:50 [binder, in Undecidability.Shared.Libs.DLW.Utils.crt]
b:50 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
b:50 [binder, in Undecidability.L.Functions.FinTypeLookup]
B:50 [binder, in Undecidability.Shared.ListAutomation]
b:50 [binder, in Complexity.NP.SAT.SAT]
b:50 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
b:509 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
B:51 [binder, in Undecidability.Shared.Libs.PSL.Lists.Removal]
b:51 [binder, in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisUnfoldClos]
b:51 [binder, in Undecidability.Shared.Libs.DLW.Utils.list_bool]
B:51 [binder, in Undecidability.L.Datatypes.List.List_eqb]
B:51 [binder, in Undecidability.Shared.Libs.PSL.Lists.Power]
b:51 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.CC]
b:52 [binder, in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
B:52 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
b:52 [binder, in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
B:52 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.FiniteFunction]
B:53 [binder, in Complexity.TM.PrettyBounds.BaseCodeSpace]
b:53 [binder, in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
b:54 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
b:54 [binder, in Undecidability.Shared.Libs.DLW.Utils.list_bool]
b:54 [binder, in Undecidability.TM.Hoare.HoareMult]
b:55 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
B:55 [binder, in Undecidability.L.Computability.Enum]
b:56 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
B:56 [binder, in Undecidability.L.Functions.FinTypeLookup]
B:56 [binder, in Undecidability.TM.Util.TM_facts]
b:567 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
B:57 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
b:57 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
b:57 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
b:575 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:58 [binder, in Complexity.L.AbstractMachines.UnfoldTailRec]
B:58 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
B:58 [binder, in Complexity.L.TM.CompCode]
b:58 [binder, in Undecidability.TM.Hoare.HoareMult]
b:58 [binder, in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
b:58 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.CC]
B:58 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.FiniteFunction]
b:585 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:59 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
b:59 [binder, in Complexity.NP.TM.M_multi2mono]
b:595 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:6 [binder, in Undecidability.TM.Code.BinNumbers.PosIncrementTM]
b:6 [binder, in Undecidability.TM.Code.NatTM]
B:6 [binder, in Complexity.L.TM.CompCode]
b:6 [binder, in Complexity.L.TM.TMflatten]
B:6 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.FiniteFunction]
b:6 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.CompoundFinTypes]
B:60 [binder, in Complexity.Libs.Pigeonhole]
b:60 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
b:60 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
b:61 [binder, in Complexity.L.AbstractMachines.UnfoldTailRec]
B:61 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
b:61 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
b:61 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
b:61 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
b:612 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:619 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:62 [binder, in Undecidability.TM.Code.BinNumbers.PosDefinitions]
B:62 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
B:62 [binder, in Complexity.L.TM.CompCode]
b:62 [binder, in Complexity.TM.PrettyBounds.BaseCodeSpace]
b:62 [binder, in Undecidability.L.Functions.FinTypeLookup]
B:62 [binder, in Undecidability.TM.Util.TM_facts]
b:62 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.CC]
b:629 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:639 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:64 [binder, in Complexity.TM.Code.Decode]
B:64 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
b:64 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
b:64 [binder, in Undecidability.TM.Hoare.HoareMult]
b:65 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
b:65 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
b:655 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
B:66 [binder, in Undecidability.L.Tactics.Extract]
b:66 [binder, in Undecidability.TM.Hoare.HoareMult]
b:662 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:67 [binder, in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
B:67 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
b:67 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
b:67 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.CC]
b:672 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:68 [binder, in Undecidability.L.Tactics.Extract]
b:682 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:69 [binder, in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
b:69 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
B:69 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
b:69 [binder, in Complexity.Libs.CookPrelim.PolyBounds]
b:69 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.CC]
b:69 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
b:698 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
B:7 [binder, in Undecidability.L.Complexity.UpToCNary]
b:7 [binder, in Undecidability.Shared.Libs.PSL.Prelim]
b:7 [binder, in Complexity.NP.SAT.SAT_inNP]
b:7 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
b:7 [binder, in Undecidability.TM.Combinators.If]
b:7 [binder, in Complexity.Libs.CookPrelim.Tactics]
b:7 [binder, in Undecidability.L.Computability.MuRec]
b:705 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:71 [binder, in Undecidability.TM.Code.BinNumbers.PosDefinitions]
B:71 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
b:71 [binder, in Complexity.Libs.CookPrelim.PolyBounds]
b:715 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:72 [binder, in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
B:72 [binder, in Undecidability.L.Computability.Enum]
b:72 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.CC]
b:725 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:73 [binder, in Complexity.TM.Single.DecodeTape]
b:73 [binder, in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
B:73 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
b:74 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
b:74 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
b:741 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
B:75 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
b:75 [binder, in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
b:750 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:759 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:76 [binder, in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
b:77 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
B:77 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
b:77 [binder, in Complexity.Libs.CookPrelim.PolyBounds]
b:77 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.CC]
b:78 [binder, in Complexity.TM.PrettyBounds.BaseCode]
b:78 [binder, in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
b:789 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
B:79 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
b:79 [binder, in Complexity.Libs.CookPrelim.PolyBounds]
b:792 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:795 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:8 [binder, in Undecidability.TM.L.Transcode.Boollist_to_Enc]
b:8 [binder, in Undecidability.Shared.Libs.PSL.Prelim]
b:8 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
b:8 [binder, in Undecidability.TM.Code.BinNumbers.PosDefinitions]
b:8 [binder, in Undecidability.Shared.Libs.DLW.Utils.interval]
B:8 [binder, in Undecidability.Shared.Libs.PSL.Inhabited]
b:8 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachine]
b:8 [binder, in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
b:80 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.CC]
b:801 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:81 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
b:81 [binder, in Complexity.Complexity.UpToCPoly]
b:81 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:81 [binder, in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
b:810 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:819 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:82 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
B:82 [binder, in Undecidability.L.Datatypes.LVector]
b:82 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
B:83 [binder, in Complexity.L.TM.CompCode]
b:83 [binder, in Complexity.Complexity.UpToCPoly]
B:84 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
B:84 [binder, in Complexity.L.TM.TMunflatten]
b:84 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
b:849 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
B:85 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
b:85 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
b:852 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:855 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:86 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
b:861 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
b:861 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:87 [binder, in Undecidability.Shared.Libs.PSL.Retracts]
B:87 [binder, in Complexity.L.TM.CompCode]
b:87 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
b:87 [binder, in Complexity.L.TM.TMunflatten]
b:87 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
B:87 [binder, in Undecidability.L.Tactics.Reflection]
b:870 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:879 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:88 [binder, in Complexity.Complexity.UpToCPoly]
b:88 [binder, in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
b:88 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.CC]
b:89 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:89 [binder, in Complexity.NP.Clique.kSAT_to_Clique]
b:89 [binder, in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
B:9 [binder, in Undecidability.Shared.FilterFacts]
b:9 [binder, in Undecidability.Shared.Libs.PSL.Prelim]
B:9 [binder, in Undecidability.Shared.Libs.PSL.Lists.Filter]
b:9 [binder, in Undecidability.TM.Code.CaseBool]
b:9 [binder, in Undecidability.L.Tactics.ComputableDemo]
b:9 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
b:9 [binder, in Undecidability.TM.Hoare.HoareMult]
b:90 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
B:90 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
b:90 [binder, in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
b:90 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.CC]
b:90 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
b:90 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
b:909 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
B:91 [binder, in Undecidability.Shared.Libs.PSL.Retracts]
b:91 [binder, in Undecidability.TM.Compound.Compare]
b:91 [binder, in Complexity.TM.Single.DecodeTape]
b:912 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:915 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:92 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
b:920 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:928 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
B:93 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
b:93 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
b:936 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:95 [binder, in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
B:96 [binder, in Undecidability.L.Tactics.LClos]
b:96 [binder, in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
b:96 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.CC]
b:965 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
b:965 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:967 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:969 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:97 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
b:97 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
b:974 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:976 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
b:982 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:99 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
b:99 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
B:99 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
b:99 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
b:99 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
b:99 [binder, in Complexity.TM.PrettyBounds.PrettyBounds]
b:990 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]

C

c [definition, in Undecidability.L.Computability.Enum]
C [definition, in Undecidability.L.Computability.Enum]
C [constructor, in Undecidability.L.Computability.Synthetic]
callTime [definition, in Undecidability.L.Tactics.ComputableTime]
callTime2 [definition, in Undecidability.L.Tactics.ComputableTime]
CanEnumTerm [library]
canEnumTerms [record, in Complexity.NP.L.CanEnumTerm_def]
canEnumTerms_compPoly [lemma, in Complexity.NP.L.CanEnumTerm_def]
CanEnumTerm_def [library]
canonicalHom [definition, in Complexity.Libs.UniformHomomorphisms]
canonicalHom_is_unique [lemma, in Complexity.Libs.UniformHomomorphisms]
canonicalHom_is_homomorphism [lemma, in Complexity.Libs.UniformHomomorphisms]
canonical_uniform_homo [lemma, in Complexity.Libs.UniformHomomorphisms]
Canonical_TerminatesIn [lemma, in Undecidability.TM.Util.TM_facts]
Canonical_T [definition, in Undecidability.TM.Util.TM_facts]
Canonical_Realise [lemma, in Undecidability.TM.Util.TM_facts]
Canonical_Rel [definition, in Undecidability.TM.Util.TM_facts]
card [definition, in Complexity.Libs.Pigeonhole]
card [abbreviation, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
card [abbreviation, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
card [definition, in Undecidability.Shared.Libs.PSL.Lists.Cardinality]
cardEl1 [projection, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
cardEl2 [projection, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
cardEl3 [projection, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
Cardinality [section, in Undecidability.Shared.Libs.PSL.Lists.Cardinality]
Cardinality [definition, in Undecidability.Shared.Libs.PSL.FiniteTypes.Cardinality]
Cardinality [library]
Cardinality [library]
Cardinality.X [variable, in Undecidability.Shared.Libs.PSL.Lists.Cardinality]
cardPred [definition, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
cardPred_subs [definition, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
cardp:25 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
cardp:7 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
cards [abbreviation, in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
cards [projection, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
cards [projection, in Complexity.NP.SAT.CookLevin.Subproblems.BinaryCC]
cards [abbreviation, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
cards [projection, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
cards [abbreviation, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
cards [abbreviation, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
cards [abbreviation, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
cards [projection, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
cards [abbreviation, in Complexity.NP.SAT.CookLevin.Reductions.CC_to_BinaryCC]
cards [projection, in Complexity.NP.SAT.CookLevin.Subproblems.CC]
cardsFin:62 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
cardsFin:98 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
cardsFlat:63 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
cardsFlat:99 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
cards_list_ind_coversHead_agree [lemma, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
cards_list_ind_agree [definition, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
cards1:107 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
cards2:108 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
cards:103 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
cards:375 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
cards:378 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
cards:388 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
cards:393 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
cards:40 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
cards:453 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
cards:467 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
cards:474 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
cards:482 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
cards:554 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
cards:64 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
cards:69 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
cards:76 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
cards:83 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
card_incl [lemma, in Complexity.Libs.Pigeonhole]
card_rem_eq [lemma, in Complexity.Libs.Pigeonhole]
card_nel_eq [lemma, in Complexity.Libs.Pigeonhole]
card_el_eq [lemma, in Complexity.Libs.Pigeonhole]
card_length [lemma, in Complexity.Libs.Pigeonhole]
card_length_leq [lemma, in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
card_equi_proper [instance, in Undecidability.Shared.Libs.PSL.Lists.Cardinality]
card_or [lemma, in Undecidability.Shared.Libs.PSL.Lists.Cardinality]
card_lt [lemma, in Undecidability.Shared.Libs.PSL.Lists.Cardinality]
card_equi [lemma, in Undecidability.Shared.Libs.PSL.Lists.Cardinality]
card_ex [lemma, in Undecidability.Shared.Libs.PSL.Lists.Cardinality]
card_0 [lemma, in Undecidability.Shared.Libs.PSL.Lists.Cardinality]
card_cons_rem [lemma, in Undecidability.Shared.Libs.PSL.Lists.Cardinality]
card_eq [lemma, in Undecidability.Shared.Libs.PSL.Lists.Cardinality]
card_le [lemma, in Undecidability.Shared.Libs.PSL.Lists.Cardinality]
card_not_in_rem [lemma, in Undecidability.Shared.Libs.PSL.Lists.Cardinality]
card_in_rem [lemma, in Undecidability.Shared.Libs.PSL.Lists.Cardinality]
card_cons' [lemma, in Undecidability.Shared.Libs.PSL.Lists.Cardinality]
card_cons [lemma, in Undecidability.Shared.Libs.PSL.Lists.Cardinality]
card':3600 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
card':60 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
card:10 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.BinaryCC]
card:100 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
card:102 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
card:104 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
card:105 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
card:106 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
card:121 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
card:13 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
card:13 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
card:132 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.CC]
card:14 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.CC]
card:15 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
card:157 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
card:162 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
card:164 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
card:166 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
card:18 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.CC]
card:192 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
card:196 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
card:200 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
card:205 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
card:21 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
card:21 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.CC]
card:23 [binder, in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
card:24 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.CC]
card:25 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
card:26 [binder, in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
card:29 [binder, in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
card:3184 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
card:3194 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
card:33 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
card:34 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
card:340 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
card:343 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
card:346 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
card:351 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
card:355 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
card:358 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
card:361 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
card:366 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
card:372 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
card:39 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
card:39 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.CC]
card:42 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.CC]
card:44 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
card:46 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
card:46 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.CC]
card:48 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
card:49 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
card:49 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.CC]
card:5 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
card:5 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
card:50 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
card:52 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
card:55 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
card:57 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
card:57 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
card:59 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
card:65 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.CC]
card:68 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
card:7 [binder, in Complexity.NP.SAT.CookLevin.Reductions.TCC_to_CC]
card:70 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
card:78 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.CC]
card:8 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
card:83 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.CC]
card:87 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
card:9 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
card:9 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
card:90 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
card:92 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
card:93 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.CC]
card:97 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
card:97 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
carry:13 [binder, in Undecidability.TM.Code.BinNumbers.PosAddTM]
carry:32 [binder, in Undecidability.TM.Code.BinNumbers.PosAddTM]
carry:34 [binder, in Undecidability.TM.Code.BinNumbers.PosAddTM]
carry:41 [binder, in Undecidability.TM.Code.BinNumbers.PosAddTM]
carry:43 [binder, in Undecidability.TM.Code.BinNumbers.PosAddTM]
carry:45 [binder, in Undecidability.TM.Code.BinNumbers.PosAddTM]
carry:62 [binder, in Undecidability.TM.Code.BinNumbers.PosAddTM]
carry:68 [binder, in Undecidability.TM.Code.BinNumbers.PosAddTM]
carry:79 [binder, in Undecidability.TM.Code.BinNumbers.PosAddTM]
carry:95 [binder, in Undecidability.TM.Code.BinNumbers.PosAddTM]
CaseBool [definition, in Undecidability.TM.Code.CaseBool]
CaseBool [section, in Undecidability.TM.Code.CaseBool]
CaseBool [library]
CaseBool_SpecT_size [lemma, in Undecidability.TM.Code.CaseBool]
CaseBool_size [definition, in Undecidability.TM.Code.CaseBool]
CaseBool_Sem [lemma, in Undecidability.TM.Code.CaseBool]
CaseBool_steps [definition, in Undecidability.TM.Code.CaseBool]
CaseBool_Rel [definition, in Undecidability.TM.Code.CaseBool]
CaseChar [definition, in Undecidability.TM.Basic.Mono]
CaseChar [section, in Undecidability.TM.Basic.Mono]
CaseChar_Sem [definition, in Undecidability.TM.Basic.Mono]
CaseChar_Rel [definition, in Undecidability.TM.Basic.Mono]
CaseChar_TM [definition, in Undecidability.TM.Basic.Mono]
CaseChar_SpecTReg [lemma, in Undecidability.TM.Hoare.HoareStdLib]
CaseChar.f [variable, in Undecidability.TM.Basic.Mono]
CaseChar.F [variable, in Undecidability.TM.Basic.Mono]
CaseChar.sig [variable, in Undecidability.TM.Basic.Mono]
CaseChar2 [definition, in Undecidability.TM.Basic.Duo]
CaseChar2 [section, in Undecidability.TM.Basic.Duo]
CaseChar2_Sem [definition, in Undecidability.TM.Basic.Duo]
CaseChar2_Rel [definition, in Undecidability.TM.Basic.Duo]
CaseChar2_TM [definition, in Undecidability.TM.Basic.Duo]
CaseChar2.f [variable, in Undecidability.TM.Basic.Duo]
CaseChar2.F [variable, in Undecidability.TM.Basic.Duo]
CaseChar2.sig [variable, in Undecidability.TM.Basic.Duo]
CaseCom [definition, in Undecidability.TM.L.CaseCom]
CaseCom [library]
CaseCom_SpecT_size [lemma, in Undecidability.TM.L.CaseCom]
CaseCom_Sem [lemma, in Undecidability.TM.L.CaseCom]
CaseCom_steps [definition, in Undecidability.TM.L.CaseCom]
CaseCom_Rel [definition, in Undecidability.TM.L.CaseCom]
CaseCom_size [definition, in Undecidability.TM.L.CaseCom]
CaseFin [section, in Undecidability.TM.Code.CaseFin]
CaseFin [definition, in Undecidability.TM.Code.CaseFin]
CaseFin [section, in Undecidability.TM.Code.CaseFin]
CaseFin [library]
CaseFin_SpecT_size [lemma, in Undecidability.TM.Code.CaseFin]
CaseFin_size [definition, in Undecidability.TM.Code.CaseFin]
CaseFin_Sem [lemma, in Undecidability.TM.Code.CaseFin]
CaseFin_steps [definition, in Undecidability.TM.Code.CaseFin]
CaseFin_Rel [definition, in Undecidability.TM.Code.CaseFin]
CaseFin.defSig [variable, in Undecidability.TM.Code.CaseFin]
CaseFin.defSig [variable, in Undecidability.TM.Code.CaseFin]
CaseFin.sig [variable, in Undecidability.TM.Code.CaseFin]
CaseFin.sig [variable, in Undecidability.TM.Code.CaseFin]
CaseList [section, in Undecidability.TM.Code.CaseList]
CaseList [definition, in Undecidability.TM.Code.CaseList]
CaseList [section, in Undecidability.TM.Code.CaseList]
CaseList [library]
CaseList_steps_cons_nice [lemma, in Complexity.TM.PrettyBounds.BaseCode]
CaseList_steps_nil_nice [lemma, in Complexity.TM.PrettyBounds.BaseCode]
CaseList_steps_nice [lemma, in Complexity.TM.PrettyBounds.BaseCode]
CaseList_nice [section, in Complexity.TM.PrettyBounds.BaseCode]
CaseList_size1_CasePair_size0_Reset_size_nice [lemma, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
CaseList_SpecT_size [lemma, in Undecidability.TM.Code.CaseList]
CaseList_size [definition, in Undecidability.TM.Code.CaseList]
CaseList_Terminates [lemma, in Undecidability.TM.Code.CaseList]
CaseList_steps [definition, in Undecidability.TM.Code.CaseList]
CaseList_steps_nil [definition, in Undecidability.TM.Code.CaseList]
CaseList_steps_cons [definition, in Undecidability.TM.Code.CaseList]
CaseList_Realise [lemma, in Undecidability.TM.Code.CaseList]
CaseList_Rel [definition, in Undecidability.TM.Code.CaseList]
CaseList_size1 [definition, in Undecidability.TM.Code.CaseList]
CaseList_size0 [definition, in Undecidability.TM.Code.CaseList]
CaseList_size1_Reset_nice [lemma, in Complexity.TM.PrettyBounds.BaseCodeSpace]
CaseList_size0_Reset_nice [lemma, in Complexity.TM.PrettyBounds.BaseCodeSpace]
CaseList_size1_nice' [lemma, in Complexity.TM.PrettyBounds.BaseCodeSpace]
CaseList_size1_nice [lemma, in Complexity.TM.PrettyBounds.BaseCodeSpace]
CaseList_size0_nice [lemma, in Complexity.TM.PrettyBounds.BaseCodeSpace]
CaseList_nice.cX [variable, in Complexity.TM.PrettyBounds.BaseCodeSpace]
CaseList_nice.X [variable, in Complexity.TM.PrettyBounds.BaseCodeSpace]
CaseList_nice.sigX [variable, in Complexity.TM.PrettyBounds.BaseCodeSpace]
CaseList_nice [section, in Complexity.TM.PrettyBounds.BaseCodeSpace]
CaseList.codX [variable, in Undecidability.TM.Code.CaseList]
CaseList.cX [variable, in Undecidability.TM.Code.CaseList]
CaseList.sigX [variable, in Undecidability.TM.Code.CaseList]
CaseList.sigX [variable, in Undecidability.TM.Code.CaseList]
CaseList.X [variable, in Undecidability.TM.Code.CaseList]
CaseList.X [variable, in Undecidability.TM.Code.CaseList]
CaseN [definition, in Undecidability.TM.Code.BinNumbers.NTM]
CaseNat [definition, in Undecidability.TM.Code.CaseNat]
CaseNat [section, in Undecidability.TM.Code.CaseNat]
CaseNat [library]
CaseNat_steps_nice [lemma, in Complexity.TM.PrettyBounds.BaseCode]
CaseNat_steps_nice [section, in Complexity.TM.PrettyBounds.BaseCode]
CaseNat_SpecT_size [lemma, in Undecidability.TM.Code.CaseNat]
CaseNat_size [definition, in Undecidability.TM.Code.CaseNat]
CaseNat_Sem [lemma, in Undecidability.TM.Code.CaseNat]
CaseNat_steps [definition, in Undecidability.TM.Code.CaseNat]
CaseNat_Rel [definition, in Undecidability.TM.Code.CaseNat]
CaseNat_size_nice [lemma, in Complexity.TM.PrettyBounds.BaseCodeSpace]
CaseNat_Spec [lemma, in Undecidability.TM.Hoare.HoareExamples]
CaseNat_SpecT [lemma, in Undecidability.TM.Hoare.HoareExamples]
CaseNat_SpecT_size [lemma, in Undecidability.TM.Hoare.HoareExamples]
CaseNat_size [definition, in Undecidability.TM.Hoare.HoareExamples]
CaseNat.NatConstructor [section, in Undecidability.TM.Code.CaseNat]
CaseN_Sem [lemma, in Undecidability.TM.Code.BinNumbers.NTM]
CaseN_steps [definition, in Undecidability.TM.Code.BinNumbers.NTM]
CaseN_Rel [definition, in Undecidability.TM.Code.BinNumbers.NTM]
CaseOption [definition, in Undecidability.TM.Code.CaseSum]
CaseOption [section, in Undecidability.TM.Code.CaseSum]
CaseOption_steps_nice [lemma, in Complexity.TM.PrettyBounds.BaseCode]
CaseOption_SpecT_size [lemma, in Undecidability.TM.Code.CaseSum]
CaseOption_size [definition, in Undecidability.TM.Code.CaseSum]
CaseOption_Sem [lemma, in Undecidability.TM.Code.CaseSum]
CaseOption_steps [definition, in Undecidability.TM.Code.CaseSum]
CaseOption_Rel [definition, in Undecidability.TM.Code.CaseSum]
CaseOption_size_None [definition, in Undecidability.TM.Code.CaseSum]
CaseOption_size_Some [definition, in Undecidability.TM.Code.CaseSum]
CaseOption.codX [variable, in Undecidability.TM.Code.CaseSum]
CaseOption.sig [variable, in Undecidability.TM.Code.CaseSum]
CaseOption.sigX [variable, in Undecidability.TM.Code.CaseSum]
CaseOption.tau [variable, in Undecidability.TM.Code.CaseSum]
CaseOption.X [variable, in Undecidability.TM.Code.CaseSum]
CaseOpton [section, in Undecidability.TM.Code.CaseSum]
CaseOpton.codX [variable, in Undecidability.TM.Code.CaseSum]
CaseOpton.sigX [variable, in Undecidability.TM.Code.CaseSum]
CaseOpton.X [variable, in Undecidability.TM.Code.CaseSum]
CasePair [section, in Undecidability.TM.Code.CasePair]
CasePair [definition, in Undecidability.TM.Code.CasePair]
CasePair [section, in Undecidability.TM.Code.CasePair]
CasePair [library]
CasePair_steps_nice [lemma, in Complexity.TM.PrettyBounds.BaseCode]
CasePair_steps_nice [section, in Complexity.TM.PrettyBounds.BaseCode]
CasePair_size0_Reset_nice [lemma, in Complexity.TM.PrettyBounds.BaseCodeSpace]
CasePair_size1_Reset_nice [lemma, in Complexity.TM.PrettyBounds.BaseCodeSpace]
CasePair_size1_nice' [lemma, in Complexity.TM.PrettyBounds.BaseCodeSpace]
CasePair_size1_nice [lemma, in Complexity.TM.PrettyBounds.BaseCodeSpace]
CasePair_size0_nice [lemma, in Complexity.TM.PrettyBounds.BaseCodeSpace]
CasePair_size_nice.cY [variable, in Complexity.TM.PrettyBounds.BaseCodeSpace]
CasePair_size_nice.cX [variable, in Complexity.TM.PrettyBounds.BaseCodeSpace]
CasePair_size_nice.Y [variable, in Complexity.TM.PrettyBounds.BaseCodeSpace]
CasePair_size_nice.X [variable, in Complexity.TM.PrettyBounds.BaseCodeSpace]
CasePair_size_nice.sigY [variable, in Complexity.TM.PrettyBounds.BaseCodeSpace]
CasePair_size_nice.sigX [variable, in Complexity.TM.PrettyBounds.BaseCodeSpace]
CasePair_size_nice [section, in Complexity.TM.PrettyBounds.BaseCodeSpace]
CasePair_SpecT_size [lemma, in Undecidability.TM.Code.CasePair]
CasePair_size [definition, in Undecidability.TM.Code.CasePair]
CasePair_Terminates [lemma, in Undecidability.TM.Code.CasePair]
CasePair_T [definition, in Undecidability.TM.Code.CasePair]
CasePair_steps [definition, in Undecidability.TM.Code.CasePair]
CasePair_Realise [lemma, in Undecidability.TM.Code.CasePair]
CasePair_Rel [definition, in Undecidability.TM.Code.CasePair]
CasePair_size1 [definition, in Undecidability.TM.Code.CasePair]
CasePair_size0 [definition, in Undecidability.TM.Code.CasePair]
CasePair.codX [variable, in Undecidability.TM.Code.CasePair]
CasePair.codY [variable, in Undecidability.TM.Code.CasePair]
CasePair.cX [variable, in Undecidability.TM.Code.CasePair]
CasePair.cY [variable, in Undecidability.TM.Code.CasePair]
CasePair.sigX [variable, in Undecidability.TM.Code.CasePair]
CasePair.sigX [variable, in Undecidability.TM.Code.CasePair]
CasePair.sigY [variable, in Undecidability.TM.Code.CasePair]
CasePair.sigY [variable, in Undecidability.TM.Code.CasePair]
CasePair.X [variable, in Undecidability.TM.Code.CasePair]
CasePair.X [variable, in Undecidability.TM.Code.CasePair]
CasePair.Y [variable, in Undecidability.TM.Code.CasePair]
CasePair.Y [variable, in Undecidability.TM.Code.CasePair]
CaseSum [section, in Undecidability.TM.Code.CaseSum]
CaseSum [definition, in Undecidability.TM.Code.CaseSum]
CaseSum [section, in Undecidability.TM.Code.CaseSum]
CaseSum [library]
CaseSum_steps_nice [lemma, in Complexity.TM.PrettyBounds.BaseCode]
CaseSum_steps_nice [section, in Complexity.TM.PrettyBounds.BaseCode]
CaseSum_SpecT_size [lemma, in Undecidability.TM.Code.CaseSum]
CaseSum_Sem [lemma, in Undecidability.TM.Code.CaseSum]
CaseSum_steps [definition, in Undecidability.TM.Code.CaseSum]
CaseSum_Rel [definition, in Undecidability.TM.Code.CaseSum]
CaseSum.codX [variable, in Undecidability.TM.Code.CaseSum]
CaseSum.codX [variable, in Undecidability.TM.Code.CaseSum]
CaseSum.codY [variable, in Undecidability.TM.Code.CaseSum]
CaseSum.codY [variable, in Undecidability.TM.Code.CaseSum]
CaseSum.sigX [variable, in Undecidability.TM.Code.CaseSum]
CaseSum.sigX [variable, in Undecidability.TM.Code.CaseSum]
CaseSum.sigY [variable, in Undecidability.TM.Code.CaseSum]
CaseSum.sigY [variable, in Undecidability.TM.Code.CaseSum]
CaseSum.SumConstr [section, in Undecidability.TM.Code.CaseSum]
CaseSum.X [variable, in Undecidability.TM.Code.CaseSum]
CaseSum.X [variable, in Undecidability.TM.Code.CaseSum]
CaseSum.Y [variable, in Undecidability.TM.Code.CaseSum]
CaseSum.Y [variable, in Undecidability.TM.Code.CaseSum]
caseS' [definition, in Undecidability.Shared.Libs.DLW.Vec.vec]
cases:17 [binder, in Undecidability.L.Tactics.GenEncode]
cases:94 [binder, in Undecidability.L.Tactics.Extract]
cases:94 [binder, in Undecidability.L.Complexity.UpToC]
cases:99 [binder, in Undecidability.L.Complexity.UpToCNary]
case0 [definition, in Undecidability.Shared.Libs.DLW.Vec.vec]
cast_registeredAs_TimeComplexity [lemma, in Undecidability.L.Tactics.ComputableTime]
cast_computableTime [lemma, in Undecidability.L.Tactics.ComputableTactics]
cast_computable [lemma, in Undecidability.L.Tactics.ComputableTactics]
cast_registeredAs [lemma, in Undecidability.L.Tactics.Computable]
cast:138 [binder, in Undecidability.L.Tactics.Computable]
cast:142 [binder, in Undecidability.L.Tactics.Computable]
cast:144 [binder, in Undecidability.L.Tactics.Computable]
cast:151 [binder, in Undecidability.L.Tactics.Computable]
cast:166 [binder, in Undecidability.L.Tactics.ComputableTime]
cast:44 [binder, in Undecidability.L.Tactics.ComputableTactics]
cast:48 [binder, in Undecidability.L.Tactics.ComputableTactics]
cA:57 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.FiniteFunction]
cB:59 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.FiniteFunction]
CC [record, in Complexity.NP.SAT.CookLevin.Subproblems.CC]
CC [library]
CCCard [record, in Complexity.NP.SAT.CookLevin.Subproblems.CC]
CCCards_poly [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatTCC_to_FlatCC]
CCCard_ofFlatType_dec_poly [lemma, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
CCCard_ofFlatType_dec_time_bound [lemma, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
CCCard_ofFlatType_dec_time [definition, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
CCCard_of_size_dec_time_bound [lemma, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
CCCard_of_size_dec_time [definition, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
CCCard_of_size.X [variable, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
CCCard_of_size [section, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
CCCard_enc_size [lemma, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
CCCard_ofFlatType_dec_correct [lemma, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
CCCard_ofFlatType_dec [definition, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
CCCard_ofFlatType [definition, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
CCCard_of_size_dec_correct [lemma, in Complexity.NP.SAT.CookLevin.Subproblems.CC]
CCCard_of_size_dec [definition, in Complexity.NP.SAT.CookLevin.Subproblems.CC]
CCCard_of_size [definition, in Complexity.NP.SAT.CookLevin.Subproblems.CC]
cChoice [definition, in Undecidability.L.Computability.Seval]
cChoice [definition, in Undecidability.L.Computability.Computability]
CCLang [definition, in Complexity.NP.SAT.CookLevin.Subproblems.CC]
CC_homomorphism_inst_iff [lemma, in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
CC_homomorphism_iff [lemma, in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
CC_instance [definition, in Complexity.NP.SAT.CookLevin.Reductions.TCC_to_CC]
CC_cards [definition, in Complexity.NP.SAT.CookLevin.Reductions.TCC_to_CC]
CC_cards_size [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatTCC_to_FlatCC]
CC_cards_time_bound [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatTCC_to_FlatCC]
CC_cards_time [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatTCC_to_FlatCC]
CC_to_BinaryCC [lemma, in Complexity.NP.SAT.CookLevin.Reductions.CC_to_BinaryCC]
CC_homomorphism_wf [lemma, in Complexity.NP.SAT.CookLevin.Reductions.CC_to_BinaryCC]
CC_wf_dec_correct [lemma, in Complexity.NP.SAT.CookLevin.Subproblems.CC]
CC_wf_dec [definition, in Complexity.NP.SAT.CookLevin.Subproblems.CC]
CC_wellformed [definition, in Complexity.NP.SAT.CookLevin.Subproblems.CC]
CC_homomorphisms [library]
CC_to_BinaryCC [library]
cc:59 [binder, in Undecidability.Shared.Libs.DLW.Utils.php]
cc:81 [binder, in Undecidability.Shared.Libs.DLW.Utils.php]
cert:12 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.SingleTMGenNP]
cert:27 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.SingleTMGenNP]
cert:2785 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
cert:2786 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
cert:2787 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
cert:2792 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
cert:2794 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
cert:29 [binder, in Complexity.NP.TM.TMGenNP_fixed_mTM]
cfg:14 [binder, in Undecidability.L.TM.TMinL.TMinL_extract]
cfg:21 [binder, in Undecidability.L.TM.TMinL]
cfind [lemma, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
Cfin:3145 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Cflat:3149 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
chain [inductive, in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
chain_list_app_inv [lemma, in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
chain_list_cons_inv [lemma, in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
chain_list_nil_inv [lemma, in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
chain_list_inv [lemma, in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
chain_list_app [lemma, in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
chain_list_chain [lemma, in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
chain_chain_list [lemma, in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
chain_list [inductive, in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
chain_snoc_inv [lemma, in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
chain_plus_inv [lemma, in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
chain_snoc [lemma, in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
chain_plus [lemma, in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
chain_inv_S [lemma, in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
chain_inv_0 [lemma, in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
chain_bounded [lemma, in Undecidability.Shared.Libs.DLW.Wf.wf_finite]
chain_list_incl [lemma, in Undecidability.Shared.Libs.DLW.Wf.wf_finite]
chain_irrefl [lemma, in Undecidability.Shared.Libs.DLW.Wf.wf_finite]
chain_trans [lemma, in Undecidability.Shared.Libs.DLW.Wf.wf_finite]
cHalt [definition, in Undecidability.L.TM.TMinL.TMinL_extract]
ChangeAlphabet [definition, in Undecidability.TM.Code.ChangeAlphabet]
ChangeAlphabet [section, in Undecidability.TM.Code.ChangeAlphabet]
ChangeAlphabet [library]
ChangeAlphabet_SpecT_space_pre [lemma, in Undecidability.TM.Hoare.HoareRegister]
ChangeAlphabet_Spec_space_pre [lemma, in Undecidability.TM.Hoare.HoareRegister]
ChangeAlphabet_SpecT_space_pre_post [lemma, in Undecidability.TM.Hoare.HoareRegister]
ChangeAlphabet_Spec_space_pre_post [lemma, in Undecidability.TM.Hoare.HoareRegister]
ChangeAlphabet_SpecT_pre [lemma, in Undecidability.TM.Hoare.HoareRegister]
ChangeAlphabet_Spec_pre [lemma, in Undecidability.TM.Hoare.HoareRegister]
ChangeAlphabet_SpecT_pre_post [lemma, in Undecidability.TM.Hoare.HoareRegister]
ChangeAlphabet_Spec_pre_post [lemma, in Undecidability.TM.Hoare.HoareRegister]
ChangeAlphabet_SpecT [lemma, in Undecidability.TM.Hoare.HoareRegister]
ChangeAlphabet_Spec [lemma, in Undecidability.TM.Hoare.HoareRegister]
ChangeAlphabet_Spec_ex [lemma, in Undecidability.TM.Hoare.HoareRegister]
ChangeAlphabet.F [variable, in Undecidability.TM.Code.ChangeAlphabet]
ChangeAlphabet.n [variable, in Undecidability.TM.Code.ChangeAlphabet]
ChangeAlphabet.pM [variable, in Undecidability.TM.Code.ChangeAlphabet]
ChangeAlphabet.retr [variable, in Undecidability.TM.Code.ChangeAlphabet]
ChangeAlphabet.sig [variable, in Undecidability.TM.Code.ChangeAlphabet]
ChangeAlphabet.tau [variable, in Undecidability.TM.Code.ChangeAlphabet]
changeResType [definition, in Undecidability.L.Tactics.Computable]
changeResType_TimeComplexity [definition, in Undecidability.L.Tactics.ComputableTime]
CheckEncodesBool [module, in Complexity.TM.Code.DecodeBool]
CheckEncodesBoolList [module, in Complexity.TM.Code.DecodeList]
CheckEncodesBoolList.checkEncodesBoolList [section, in Complexity.TM.Code.DecodeList]
CheckEncodesBoolList.checkEncodesBoolList.I__X [variable, in Complexity.TM.Code.DecodeList]
CheckEncodesBoolList.checkEncodesBoolList.Rel__X [variable, in Complexity.TM.Code.DecodeList]
CheckEncodesBoolList.checkEncodesBoolList.Rel' [variable, in Complexity.TM.Code.DecodeList]
CheckEncodesBoolList.checkEncodesBoolList2 [section, in Complexity.TM.Code.DecodeList]
CheckEncodesBoolList.cX [abbreviation, in Complexity.TM.Code.DecodeList]
CheckEncodesBoolList.M [definition, in Complexity.TM.Code.DecodeList]
CheckEncodesBoolList.M__X [abbreviation, in Complexity.TM.Code.DecodeList]
CheckEncodesBoolList.M' [definition, in Complexity.TM.Code.DecodeList]
CheckEncodesBoolList.M'__step [definition, in Complexity.TM.Code.DecodeList]
CheckEncodesBoolList.Realises__X [abbreviation, in Complexity.TM.Code.DecodeList]
CheckEncodesBoolList.Realises'__step [lemma, in Complexity.TM.Code.DecodeList]
CheckEncodesBoolList.Realise' [lemma, in Complexity.TM.Code.DecodeList]
CheckEncodesBoolList.R'__step [definition, in Complexity.TM.Code.DecodeList]
CheckEncodesBoolList.sigX [abbreviation, in Complexity.TM.Code.DecodeList]
CheckEncodesBoolList.SpecT [lemma, in Complexity.TM.Code.DecodeList]
CheckEncodesBoolList.Terminates' [lemma, in Complexity.TM.Code.DecodeList]
CheckEncodesBoolList.Terminates'__step [lemma, in Complexity.TM.Code.DecodeList]
CheckEncodesBoolList.X [abbreviation, in Complexity.TM.Code.DecodeList]
CheckEncodesBool.checkEncodesBool [section, in Complexity.TM.Code.DecodeBool]
CheckEncodesBool.checkEncodesBool.Rel [variable, in Complexity.TM.Code.DecodeBool]
CheckEncodesBool.M [definition, in Complexity.TM.Code.DecodeBool]
CheckEncodesBool.RealisesIn [lemma, in Complexity.TM.Code.DecodeBool]
CheckEncodesBool.RealisesIn' [lemma, in Complexity.TM.Code.DecodeBool]
CheckEncodesTape [module, in Complexity.TM.Single.DecodeTape]
CheckEncodesTapes [module, in Complexity.TM.Single.DecodeTapes]
CheckEncodesTapes.checkEncodesTapes [section, in Complexity.TM.Single.DecodeTapes]
CheckEncodesTapes.checkEncodesTapes.I__X [variable, in Complexity.TM.Single.DecodeTapes]
CheckEncodesTapes.checkEncodesTapes.Rel [variable, in Complexity.TM.Single.DecodeTapes]
CheckEncodesTapes.iter_transitive [lemma, in Complexity.TM.Single.DecodeTapes]
CheckEncodesTapes.length_right_tape_move_right [lemma, in Complexity.TM.Single.DecodeTapes]
CheckEncodesTapes.M [definition, in Complexity.TM.Single.DecodeTapes]
CheckEncodesTapes.Realise [lemma, in Complexity.TM.Single.DecodeTapes]
CheckEncodesTapes.Realises_intern [lemma, in Complexity.TM.Single.DecodeTapes]
CheckEncodesTapes.R_syntactic__spec [lemma, in Complexity.TM.Single.DecodeTapes]
CheckEncodesTapes.R_syntactic [definition, in Complexity.TM.Single.DecodeTapes]
CheckEncodesTapes.Ter [definition, in Complexity.TM.Single.DecodeTapes]
CheckEncodesTapes.Terminates [lemma, in Complexity.TM.Single.DecodeTapes]
CheckEncodesTape.checkEncodesTape [section, in Complexity.TM.Single.DecodeTape]
CheckEncodesTape.checkEncodesTape.Rel [variable, in Complexity.TM.Single.DecodeTape]
CheckEncodesTape.f [definition, in Complexity.TM.Single.DecodeTape]
CheckEncodesTape.f_spec [lemma, in Complexity.TM.Single.DecodeTape]
CheckEncodesTape.f__step [definition, in Complexity.TM.Single.DecodeTape]
CheckEncodesTape.f'_spec [lemma, in Complexity.TM.Single.DecodeTape]
CheckEncodesTape.M [definition, in Complexity.TM.Single.DecodeTape]
CheckEncodesTape.M__step [definition, in Complexity.TM.Single.DecodeTape]
CheckEncodesTape.M' [definition, in Complexity.TM.Single.DecodeTape]
CheckEncodesTape.Realise [lemma, in Complexity.TM.Single.DecodeTape]
CheckEncodesTape.Realises_intern [lemma, in Complexity.TM.Single.DecodeTape]
CheckEncodesTape.Realises__step [lemma, in Complexity.TM.Single.DecodeTape]
CheckEncodesTape.sig__M [abbreviation, in Complexity.TM.Single.DecodeTape]
CheckEncodesTape.Ter [definition, in Complexity.TM.Single.DecodeTape]
CheckEncodesTape.Terminates [lemma, in Complexity.TM.Single.DecodeTape]
CheckEncodesTape.Terminates__step [lemma, in Complexity.TM.Single.DecodeTape]
checkFor:1 [binder, in Complexity.L.AbstractMachines.Computable.EvalForTimeBool]
checkFor:7 [binder, in Complexity.L.AbstractMachines.Computable.EvalForTimeBool]
CheckTapeContains [module, in Complexity.TM.Code.Decode]
CheckTapeContains.fixx [section, in Complexity.TM.Code.Decode]
CheckTapeContains.fixx.M_checkX [variable, in Complexity.TM.Code.Decode]
CheckTapeContains.fixx.Rel [variable, in Complexity.TM.Code.Decode]
CheckTapeContains.M [definition, in Complexity.TM.Code.Decode]
CheckTapeContains.Realise [lemma, in Complexity.TM.Code.Decode]
CheckTapeContains.Terminates [lemma, in Complexity.TM.Code.Decode]
church_rosser [definition, in Undecidability.L.Prelim.ARS]
church_rosser [lemma, in Undecidability.L.Util.L_facts]
ci':65 [binder, in Complexity.NP.Clique.kSAT_to_Clique]
ci1:111 [binder, in Complexity.NP.Clique.kSAT_to_Clique]
ci1:26 [binder, in Complexity.NP.Clique.kSAT_to_Clique]
ci1:30 [binder, in Complexity.NP.Clique.kSAT_to_FlatClique]
ci1:34 [binder, in Complexity.NP.Clique.kSAT_to_FlatClique]
ci2:112 [binder, in Complexity.NP.Clique.kSAT_to_Clique]
ci2:28 [binder, in Complexity.NP.Clique.kSAT_to_Clique]
ci2:28 [binder, in Complexity.NP.Clique.kSAT_to_FlatClique]
ci2:36 [binder, in Complexity.NP.Clique.kSAT_to_FlatClique]
ci:10 [binder, in Complexity.NP.Clique.kSAT_to_FlatClique]
ci:106 [binder, in Complexity.NP.Clique.kSAT_to_Clique]
ci:117 [binder, in Complexity.NP.Clique.kSAT_to_Clique]
ci:122 [binder, in Complexity.NP.Clique.kSAT_to_Clique]
ci:38 [binder, in Complexity.NP.Clique.kSAT_to_FlatClique]
ci:4 [binder, in Complexity.NP.Clique.kSAT_to_FlatClique]
ci:47 [binder, in Complexity.NP.Clique.kSAT_to_Clique]
ci:57 [binder, in Complexity.NP.Clique.kSAT_to_Clique]
ci:61 [binder, in Complexity.NP.Clique.kSAT_to_Clique]
ci:64 [binder, in Complexity.NP.Clique.kSAT_to_Clique]
ci:7 [binder, in Complexity.NP.Clique.kSAT_to_FlatClique]
ci:78 [binder, in Complexity.NP.Clique.kSAT_to_FlatClique]
ci:85 [binder, in Complexity.NP.Clique.kSAT_to_Clique]
ci:88 [binder, in Complexity.NP.Clique.kSAT_to_FlatClique]
ci:91 [binder, in Complexity.NP.Clique.kSAT_to_FlatClique]
ci:95 [binder, in Complexity.NP.Clique.kSAT_to_FlatClique]
ci:98 [binder, in Complexity.NP.Clique.kSAT_to_FlatClique]
class [projection, in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
classical [definition, in Undecidability.L.Prelim.ARS]
class:11 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
clause [abbreviation, in Complexity.NP.SAT.SAT]
clauseGetLiteral [definition, in Complexity.NP.Clique.kSAT_to_Clique]
clausesOf [definition, in Complexity.NP.Clique.kSAT_to_Clique]
clause_length_decb_time [definition, in Complexity.NP.SAT.kSAT]
clause_length_decb [definition, in Complexity.NP.SAT.kSAT]
clause_size_total_enc_bound [lemma, in Complexity.NP.SAT.SAT_inNP]
clause_size_enc_bound [lemma, in Complexity.NP.SAT.SAT_inNP]
clause_maxVar_size_enc_bound [lemma, in Complexity.NP.SAT.SAT_inNP]
clause_enc_size_bound [lemma, in Complexity.NP.SAT.SAT_inNP]
clause_varsIn_bound [lemma, in Complexity.NP.SAT.SAT_inNP]
clause_maxVar_varsIn [lemma, in Complexity.NP.SAT.SAT_inNP]
clause_maxVar [definition, in Complexity.NP.SAT.SAT_inNP]
clause_varsIn [definition, in Complexity.NP.SAT.SAT]
clause_sat_rep3 [lemma, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
Clique [definition, in Complexity.NP.Clique.Clique]
Clique [library]
Clique_complete [lemma, in Complexity.NP.SAT.CookLevin]
clique_unflatten [lemma, in Complexity.NP.Clique.FlatClique]
clique_flatten [lemma, in Complexity.NP.Clique.FlatClique]
clique_flat_agree [lemma, in Complexity.NP.Clique.FlatClique]
clique_vertex_for_all_clauses [lemma, in Complexity.NP.Clique.kSAT_to_Clique]
clos [abbreviation, in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
closed [definition, in Undecidability.L.Util.L_facts]
closedb [definition, in Undecidability.L.Functions.Proc]
closedb_spec [lemma, in Undecidability.L.Functions.Proc]
ClosedLAdmissible [library]
closed_dcl_x [lemma, in Undecidability.L.Util.L_facts]
closed_star [lemma, in Undecidability.L.Util.L_facts]
closed_step [lemma, in Undecidability.L.Util.L_facts]
closed_subst [lemma, in Undecidability.L.Util.L_facts]
closed_dec [instance, in Undecidability.L.Util.L_facts]
closed_app [lemma, in Undecidability.L.Util.L_facts]
closed_dcl [lemma, in Undecidability.L.Util.L_facts]
closed_k_bound [lemma, in Undecidability.L.Util.L_facts]
closed_compiler_helper [lemma, in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
closT [constructor, in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
clos_notation.clos [abbreviation, in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
clos_notation [module, in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
clR [lemma, in Undecidability.L.Tactics.Lbeta_nonrefl]
clR' [lemma, in Undecidability.L.Tactics.Lbeta_nonrefl]
cls:15 [binder, in Undecidability.Shared.Libs.DLW.Utils.quotient]
cl:56 [binder, in Complexity.NP.SAT.SAT]
cl:87 [binder, in Complexity.NP.Clique.kSAT_to_Clique]
cmp_sub [definition, in Undecidability.Shared.Libs.DLW.Utils.gcd]
cnf [abbreviation, in Complexity.NP.SAT.SAT]
cnfGetClause [definition, in Complexity.NP.Clique.kSAT_to_Clique]
cnfGetLiteral [definition, in Complexity.NP.Clique.kSAT_to_Clique]
cnfGetLiteral_size [lemma, in Complexity.NP.Clique.kSAT_to_FlatClique]
cnfGetLiteral_poly [lemma, in Complexity.NP.Clique.kSAT_to_FlatClique]
cnfGetLiteral_time_bound [lemma, in Complexity.NP.Clique.kSAT_to_FlatClique]
cnfGetLiteral_time [definition, in Complexity.NP.Clique.kSAT_to_FlatClique]
cnf_size_total_enc_bound [lemma, in Complexity.NP.SAT.SAT_inNP]
cnf_maxVar_size_enc_bound [lemma, in Complexity.NP.SAT.SAT_inNP]
cnf_size_enc_bound [lemma, in Complexity.NP.SAT.SAT_inNP]
cnf_enc_size_bound [lemma, in Complexity.NP.SAT.SAT_inNP]
cnf_varsIn_bound [lemma, in Complexity.NP.SAT.SAT_inNP]
cnf_maxVar_varsIn [lemma, in Complexity.NP.SAT.SAT_inNP]
cnf_maxVar_app [lemma, in Complexity.NP.SAT.SAT_inNP]
cnf_maxVar [definition, in Complexity.NP.SAT.SAT_inNP]
cnf_varsIn_monotonic [lemma, in Complexity.NP.SAT.SAT]
cnf_varsIn_app [lemma, in Complexity.NP.SAT.SAT]
cnf_varsIn [definition, in Complexity.NP.SAT.SAT]
cnf_sat_rep3 [lemma, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
cnst [definition, in Undecidability.L.Tactics.ComputableTime]
cnst_conc [definition, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
cnst_prem [definition, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
cnst_cardEl3 [definition, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
cnst_cardEl2 [definition, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
cnst_cardEl1 [definition, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
cnst_conc [definition, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
cnst_prem [definition, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
cn:55 [binder, in Complexity.NP.SAT.SAT]
codable [record, in Undecidability.TM.Code.Code]
code [definition, in Undecidability.Shared.Libs.DLW.Code.subcode]
code [abbreviation, in Undecidability.Shared.Libs.DLW.Code.sss]
Code [library]
CodeTM [library]
code_length [definition, in Undecidability.Shared.Libs.DLW.Code.subcode]
code_end [definition, in Undecidability.Shared.Libs.DLW.Code.subcode]
code_start [definition, in Undecidability.Shared.Libs.DLW.Code.subcode]
code:49 [binder, in Undecidability.TM.Code.ChangeAlphabet]
Combinators [library]
combinedLength [definition, in Complexity.NP.SAT.FSAT.FormulaEncoding]
combinedStart [definition, in Complexity.NP.SAT.FSAT.FormulaEncoding]
combP [abbreviation, in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
combP [definition, in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
combSigma [abbreviation, in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
combSigma [abbreviation, in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
comb_proc_red [lemma, in Undecidability.L.Util.L_facts]
comp [section, in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
Comp [inductive, in Undecidability.L.Tactics.LClos]
comp [definition, in Undecidability.Shared.Libs.DLW.Code.compiler]
CompApp [constructor, in Undecidability.L.Tactics.LClos]
CompAppCount [definition, in Undecidability.L.Tactics.LClos_Eval]
Compare [definition, in Undecidability.TM.Code.BinNumbers.PosCompareTM]
Compare [definition, in Undecidability.TM.Compound.Compare]
Compare [section, in Undecidability.TM.Compound.Compare]
Compare [library]
CompareLists [section, in Undecidability.TM.Compound.Compare]
CompareLists.X [variable, in Undecidability.TM.Compound.Compare]
CompareValue [library]
CompareValues [section, in Undecidability.TM.Code.CompareValue]
CompareValues [definition, in Undecidability.TM.Code.CompareValue]
CompareValues [section, in Undecidability.TM.Code.CompareValue]
CompareValues_steps_nice [lemma, in Complexity.TM.PrettyBounds.BaseCode]
CompareValues_nice [section, in Complexity.TM.PrettyBounds.BaseCode]
CompareValues_TerminatesIn [lemma, in Undecidability.TM.Code.CompareValue]
CompareValues_T [definition, in Undecidability.TM.Code.CompareValue]
CompareValues_steps [definition, in Undecidability.TM.Code.CompareValue]
CompareValues_Realise [lemma, in Undecidability.TM.Code.CompareValue]
CompareValues_Rel [definition, in Undecidability.TM.Code.CompareValue]
CompareValues.cX [variable, in Undecidability.TM.Code.CompareValue]
CompareValues.cX [variable, in Undecidability.TM.Code.CompareValue]
CompareValues.cX_injective [variable, in Undecidability.TM.Code.CompareValue]
CompareValues.HInj [variable, in Undecidability.TM.Code.CompareValue]
CompareValues.sigX [variable, in Undecidability.TM.Code.CompareValue]
CompareValues.sigX [variable, in Undecidability.TM.Code.CompareValue]
CompareValues.X [variable, in Undecidability.TM.Code.CompareValue]
CompareValues.X [variable, in Undecidability.TM.Code.CompareValue]
CompareValue_Spec [lemma, in Undecidability.TM.Code.CompareValue]
CompareValue_Spec_size [lemma, in Undecidability.TM.Code.CompareValue]
CompareValue_SpecT [lemma, in Undecidability.TM.Code.CompareValue]
CompareValue_SpecT_size [lemma, in Undecidability.TM.Code.CompareValue]
Compare_Realise [lemma, in Undecidability.TM.Code.BinNumbers.PosCompareTM]
Compare_Rel [definition, in Undecidability.TM.Code.BinNumbers.PosCompareTM]
Compare_Loop_Realise [lemma, in Undecidability.TM.Code.BinNumbers.PosCompareTM]
Compare_Loop_Rel [definition, in Undecidability.TM.Code.BinNumbers.PosCompareTM]
Compare_Loop [definition, in Undecidability.TM.Code.BinNumbers.PosCompareTM]
Compare_Step_Realise [lemma, in Undecidability.TM.Code.BinNumbers.PosCompareTM]
Compare_Step [definition, in Undecidability.TM.Code.BinNumbers.PosCompareTM]
Compare_Step_Rel [definition, in Undecidability.TM.Code.BinNumbers.PosCompareTM]
Compare_Move_steps_midtape2 [lemma, in Undecidability.TM.Compound.Compare]
Compare_Move_steps_midtape1 [lemma, in Undecidability.TM.Compound.Compare]
Compare_steps_correct_midtape [lemma, in Undecidability.TM.Compound.Compare]
Compare_steps_correct [lemma, in Undecidability.TM.Compound.Compare]
Compare_correct_long_midtape [lemma, in Undecidability.TM.Compound.Compare]
Compare_correct_short_midtape [lemma, in Undecidability.TM.Compound.Compare]
Compare_correct_short [lemma, in Undecidability.TM.Compound.Compare]
Compare_correct_swap [lemma, in Undecidability.TM.Compound.Compare]
Compare_correct_neq_midtape [lemma, in Undecidability.TM.Compound.Compare]
Compare_correct_neq [lemma, in Undecidability.TM.Compound.Compare]
Compare_correct_eq_midtape [lemma, in Undecidability.TM.Compound.Compare]
Compare_correct_eq [lemma, in Undecidability.TM.Compound.Compare]
Compare_fun_lemmas.stop [variable, in Undecidability.TM.Compound.Compare]
Compare_fun_lemmas.X [variable, in Undecidability.TM.Compound.Compare]
Compare_fun_lemmas [section, in Undecidability.TM.Compound.Compare]
compare_lists [lemma, in Undecidability.TM.Compound.Compare]
Compare_TerminatesIn [lemma, in Undecidability.TM.Compound.Compare]
Compare_steps_ge [lemma, in Undecidability.TM.Compound.Compare]
Compare_T [definition, in Undecidability.TM.Compound.Compare]
Compare_Realise [lemma, in Undecidability.TM.Compound.Compare]
Compare_Rel [definition, in Undecidability.TM.Compound.Compare]
Compare_fun_measure [definition, in Undecidability.TM.Compound.Compare]
Compare_Step_Sem [lemma, in Undecidability.TM.Compound.Compare]
Compare_Step_Rel [definition, in Undecidability.TM.Compound.Compare]
Compare_Step [definition, in Undecidability.TM.Compound.Compare]
Compare.sig [variable, in Undecidability.TM.Compound.Compare]
Compare.stop [variable, in Undecidability.TM.Compound.Compare]
ComparisonTimeBoundDerivation [library]
comparison_inhabited [instance, in Undecidability.TM.Code.BinNumbers.PosCompareTM]
comparison_finC [instance, in Undecidability.TM.Code.BinNumbers.PosCompareTM]
comparison_eq_dec [instance, in Undecidability.TM.Code.BinNumbers.PosCompareTM]
CompBeta [definition, in Undecidability.L.Tactics.LClos_Eval]
CompBeta_sound [lemma, in Undecidability.L.Tactics.LClos_Eval]
CompBeta_validComp [lemma, in Undecidability.L.Tactics.LClos_Eval]
CompClos [constructor, in Undecidability.L.Tactics.LClos]
CompCode [library]
compile [definition, in Undecidability.L.AbstractMachines.FlatPro.ProgramsDef]
Compile [library]
compiler [definition, in Undecidability.Shared.Libs.DLW.Code.compiler]
compiler [library]
Compiler [library]
compiler_complete' [lemma, in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
compiler_complete [lemma, in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
compiler_complete_step [lemma, in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
compiler_sound [lemma, in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
compiler_subcode [lemma, in Undecidability.Shared.Libs.DLW.Code.compiler]
compiler_length [lemma, in Undecidability.Shared.Libs.DLW.Code.compiler]
compiler_correct [lemma, in Undecidability.TM.L.CompilerBoolFuns.Compiler]
Compiler_facts [library]
Compiler_spec [library]
compiler_correction [library]
Compiler_nat_facts [library]
compileTR_correct [lemma, in Complexity.L.AbstractMachines.FlatPro.Computable.Compile]
compileTR' [definition, in Complexity.L.AbstractMachines.FlatPro.Computable.Compile]
compileTR'_fuel_leq_size [lemma, in Complexity.L.AbstractMachines.FlatPro.Computable.Compile]
compileTR'_correct [lemma, in Complexity.L.AbstractMachines.FlatPro.Computable.Compile]
compileTR'_fuel [definition, in Complexity.L.AbstractMachines.FlatPro.Computable.Compile]
compile_enc_size [lemma, in Complexity.L.AbstractMachines.FlatPro.Computable.Compile]
compile_inj_retT [lemma, in Undecidability.L.AbstractMachines.FlatPro.Programs]
compile_neq_nil [lemma, in Undecidability.L.AbstractMachines.FlatPro.Programs]
compile_inj [lemma, in Undecidability.L.AbstractMachines.FlatPro.Programs]
compIn__decInTime [projection, in Complexity.Complexity.Definitions]
complement [definition, in Undecidability.L.Computability.Decidability]
complement [definition, in Undecidability.Synthetic.Definitions]
completeness [lemma, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
completeness [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
completenessInformative' [lemma, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
completenessTime [lemma, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
completenessTimeInformative [lemma, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
completeness' [lemma, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
complete_induction [lemma, in Undecidability.Shared.Libs.PSL.Numbers]
complete__toTerm [projection, in Complexity.NP.L.CanEnumTerm_def]
complete__decInTime [lemma, in Complexity.Complexity.Definitions]
complete__pCR [projection, in Complexity.Complexity.NP]
composed_permutation_S [lemma, in Undecidability.Shared.Libs.DLW.Utils.sorting]
composed_permutation_extends [lemma, in Undecidability.Shared.Libs.DLW.Utils.sorting]
composed_permutation_ext [lemma, in Undecidability.Shared.Libs.DLW.Utils.sorting]
composed_permutation [inductive, in Undecidability.Shared.Libs.DLW.Utils.sorting]
ComposeRetract [instance, in Undecidability.Shared.Libs.PSL.Retracts]
ComposeRetracts [section, in Undecidability.Shared.Libs.PSL.Retracts]
ComposeRetracts.A [variable, in Undecidability.Shared.Libs.PSL.Retracts]
ComposeRetracts.B [variable, in Undecidability.Shared.Libs.PSL.Retracts]
ComposeRetracts.C [variable, in Undecidability.Shared.Libs.PSL.Retracts]
Composition [section, in Undecidability.TM.Combinators.SequentialComposition]
Composition.F1 [variable, in Undecidability.TM.Combinators.SequentialComposition]
Composition.F2 [variable, in Undecidability.TM.Combinators.SequentialComposition]
Composition.n [variable, in Undecidability.TM.Combinators.SequentialComposition]
Composition.pM1 [variable, in Undecidability.TM.Combinators.SequentialComposition]
Composition.pM2 [variable, in Undecidability.TM.Combinators.SequentialComposition]
Composition.sig [variable, in Undecidability.TM.Combinators.SequentialComposition]
CompoundFinTypes [library]
compressAssignment [definition, in Complexity.NP.SAT.SAT_inNP]
compressAssignment_cnf_equiv [lemma, in Complexity.NP.SAT.SAT_inNP]
compressAssignment_var_eq [lemma, in Complexity.NP.SAT.SAT_inNP]
compressAssignment_small [lemma, in Complexity.NP.SAT.SAT_inNP]
CompSeval [definition, in Undecidability.L.Tactics.LClos_Eval]
CompSeval_sound [lemma, in Undecidability.L.Tactics.LClos_Eval]
CompSeval_sound' [lemma, in Undecidability.L.Tactics.LClos_Eval]
CompSeval_validComp [lemma, in Undecidability.L.Tactics.LClos_Eval]
compSizeFun [definition, in Undecidability.TM.Code.CodeTM]
Computability [library]
computable [record, in Undecidability.L.Tactics.Computable]
Computable [library]
ComputableDemo [library]
computableExt [lemma, in Undecidability.L.Tactics.Computable]
ComputableTactics [library]
computableTime [record, in Undecidability.L.Tactics.ComputableTime]
ComputableTime [library]
computableTimeExt [lemma, in Undecidability.L.Tactics.ComputableTime]
computableTime_timeLeq [lemma, in Undecidability.L.Tactics.ComputableTime]
computableTime_computable [lemma, in Undecidability.L.Tactics.ComputableTime]
computableTime:33 [binder, in Undecidability.L.Tactics.ComputableTime]
computes [definition, in Undecidability.L.Tactics.Computable]
computesExp [definition, in Undecidability.L.Tactics.Computable]
computesExpStart [lemma, in Undecidability.L.Tactics.Computable]
computesExpStep [lemma, in Undecidability.L.Tactics.Computable]
computesExt [lemma, in Undecidability.L.Tactics.Computable]
computesProc [lemma, in Undecidability.L.Tactics.Computable]
computesRel [definition, in Undecidability.L.Prelim.ARS]
computesTime [definition, in Undecidability.L.Tactics.ComputableTime]
computesTimeExp [definition, in Undecidability.L.Tactics.ComputableTime]
computesTimeExpStart [lemma, in Undecidability.L.Tactics.ComputableTime]
computesTimeExpStep [lemma, in Undecidability.L.Tactics.ComputableTime]
computesTimeExt [lemma, in Undecidability.L.Tactics.ComputableTime]
computesTimeIf [definition, in Undecidability.L.Tactics.ComputableTime]
computesTimeIfStart [lemma, in Undecidability.L.Tactics.ComputableTime]
computesTimeProc [lemma, in Undecidability.L.Tactics.ComputableTime]
computesTimeTyArr_helper [lemma, in Undecidability.L.Tactics.ComputableTime]
computesTimeTyB [lemma, in Undecidability.L.Tactics.ComputableTime]
computesTime_timeLeq [lemma, in Undecidability.L.Tactics.ComputableTime]
computesTime_computes_intern [lemma, in Undecidability.L.Tactics.ComputableTime]
computesTime_evalLe [lemma, in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
computesTyArr [lemma, in Undecidability.L.Tactics.Computable]
computesTyB [lemma, in Undecidability.L.Tactics.Computable]
CompVar [constructor, in Undecidability.L.Tactics.LClos]
comp__toTerm [projection, in Complexity.NP.L.CanEnumTerm_def]
comp_enc_lin [projection, in Complexity.Complexity.EncodableP]
comp_t__E [definition, in Complexity.HierarchyTheorem.TimeHierarchyTheorem]
Comp_ind_deep [definition, in Undecidability.L.Tactics.LClos]
Comp_ind_deep' [definition, in Undecidability.L.Tactics.LClos]
comp_length [lemma, in Undecidability.Shared.Libs.DLW.Code.compiler]
comp_app [lemma, in Undecidability.Shared.Libs.DLW.Code.compiler]
comp_eqb [projection, in Undecidability.L.Functions.EqBool]
comp__polyTC [projection, in Complexity.Complexity.Definitions]
comp_enc_lin [projection, in Undecidability.L.Complexity.LinDecode.LTD_def]
comp.correctness [section, in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
comp.correctness.HPQ [variable, in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
comp.correctness.linker [variable, in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
comp.correctness.P [variable, in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
comp.correctness.Q [variable, in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
comp.cP [variable, in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
comp.err [variable, in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
comp.Hicomp [variable, in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
comp.Hilen [variable, in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
comp.icomp [variable, in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
comp.ilen [variable, in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
comp.iP [variable, in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
comp.iQ [variable, in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
comp.P [variable, in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
comp.P_eq [variable, in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
comp.simul [variable, in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
comp.state_Y [variable, in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
comp.state_X [variable, in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
comp.step_Y_fun [variable, in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
comp.step_X_tot [variable, in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
comp.step_Y [variable, in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
comp.step_X [variable, in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
comp.X [variable, in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
comp.Y [variable, in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
_ ⋈ _ [notation, in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
_ /Y/ _ ↓ [notation, in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
_ /Y/ _ ~~> _ [notation, in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
_ /Y/ _ ->> _ [notation, in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
_ /Y/ _ -+> _ [notation, in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
_ /Y/ _ -[ _ ]-> _ [notation, in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
_ /Y/ _ -1> _ [notation, in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
_ /X/ _ ↓ [notation, in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
_ /X/ _ ~~> _ [notation, in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
_ /X/ _ ->> _ [notation, in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
_ /X/ _ -+> _ [notation, in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
_ /X/ _ -[ _ ]-> _ [notation, in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
_ /X/ _ -1> _ [notation, in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
Com_to_sum [definition, in Undecidability.TM.L.Alphabets]
com:1 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
conc [projection, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
conc [projection, in Complexity.NP.SAT.CookLevin.Subproblems.CC]
concat [section, in Undecidability.L.Datatypes.List.List_basics]
ConcatRepeat [module, in Undecidability.TM.Code.List.Concat_Repeat]
ConcatRepeat.concatRepeat [section, in Undecidability.TM.Code.List.Concat_Repeat]
ConcatRepeat.concatRepeat.cX [variable, in Undecidability.TM.Code.List.Concat_Repeat]
ConcatRepeat.concatRepeat.retr1 [variable, in Undecidability.TM.Code.List.Concat_Repeat]
ConcatRepeat.concatRepeat.retr2 [variable, in Undecidability.TM.Code.List.Concat_Repeat]
ConcatRepeat.concatRepeat.sig [variable, in Undecidability.TM.Code.List.Concat_Repeat]
ConcatRepeat.concatRepeat.sigX [variable, in Undecidability.TM.Code.List.Concat_Repeat]
ConcatRepeat.concatRepeat.X [variable, in Undecidability.TM.Code.List.Concat_Repeat]
ConcatRepeat.M [definition, in Undecidability.TM.Code.List.Concat_Repeat]
ConcatRepeat.M__step [definition, in Undecidability.TM.Code.List.Concat_Repeat]
ConcatRepeat.Realise [lemma, in Undecidability.TM.Code.List.Concat_Repeat]
ConcatRepeat.Realise__step [lemma, in Undecidability.TM.Code.List.Concat_Repeat]
ConcatRepeat.Rel [definition, in Undecidability.TM.Code.List.Concat_Repeat]
ConcatRepeat.Rel__step [definition, in Undecidability.TM.Code.List.Concat_Repeat]
ConcatRepeat.Ter [definition, in Undecidability.TM.Code.List.Concat_Repeat]
ConcatRepeat.Terminates [definition, in Undecidability.TM.Code.List.Concat_Repeat]
ConcatRepeat.Terminates__step [definition, in Undecidability.TM.Code.List.Concat_Repeat]
ConcatRepeat.Ter__step [definition, in Undecidability.TM.Code.List.Concat_Repeat]
ConcatRepeat._Terminates [lemma, in Undecidability.TM.Code.List.Concat_Repeat]
ConcatRepeat._Terminates__step [lemma, in Undecidability.TM.Code.List.Concat_Repeat]
concat_repeat_repeat [lemma, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
concat_poly [lemma, in Complexity.Libs.CookPrelim.PolyBounds]
concat_time_bound [lemma, in Complexity.Libs.CookPrelim.PolyBounds]
concat_time_exp [lemma, in Complexity.Libs.CookPrelim.PolyBounds]
concat_time [definition, in Complexity.Libs.CookPrelim.PolyBounds]
concat_fixX [section, in Complexity.Libs.CookPrelim.PolyBounds]
concat_eq_inv_borderL [lemma, in Complexity.NP.TM.M_multi2mono]
Concat_Repeat [library]
configState [definition, in Complexity.NP.SAT.CookLevin.Subproblems.TM_single]
confluence [lemma, in Undecidability.L.Util.L_facts]
confluent [definition, in Undecidability.L.Prelim.ARS]
confluent_CR [lemma, in Undecidability.L.Prelim.ARS]
conf:293 [binder, in Undecidability.TM.Util.TM_facts]
conj [definition, in Undecidability.L.Computability.Decidability]
cons [section, in Complexity.NP.TM.LM_to_mTM]
ConsClos [definition, in Undecidability.TM.L.HeapInterpreter.StepTM]
ConsClos_Terminates [lemma, in Undecidability.TM.L.HeapInterpreter.StepTM]
ConsClos_T [definition, in Undecidability.TM.L.HeapInterpreter.StepTM]
ConsClos_steps [definition, in Undecidability.TM.L.HeapInterpreter.StepTM]
ConsClos_Realise [lemma, in Undecidability.TM.L.HeapInterpreter.StepTM]
ConsClos_Rel [definition, in Undecidability.TM.L.HeapInterpreter.StepTM]
ConsClos_size [definition, in Undecidability.TM.L.HeapInterpreter.StepTM]
Consequence [lemma, in Undecidability.TM.Hoare.HoareLogic]
ConsequenceT [lemma, in Undecidability.TM.Hoare.HoareLogic]
ConsequenceT_pre [lemma, in Undecidability.TM.Hoare.HoareLogic]
ConsequenceT_post [lemma, in Undecidability.TM.Hoare.HoareLogic]
Consequence_post [lemma, in Undecidability.TM.Hoare.HoareLogic]
Consequence_pre [lemma, in Undecidability.TM.Hoare.HoareLogic]
Const [definition, in Undecidability.L.Complexity.GenericNary]
constructive_dep_choice [lemma, in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
constructive_choice' [lemma, in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
constructive_choice [lemma, in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
Constr_None_steps_nice [lemma, in Complexity.TM.PrettyBounds.BaseCode]
Constr_Some_steps_nice [lemma, in Complexity.TM.PrettyBounds.BaseCode]
Constr_inr_steps_nice [lemma, in Complexity.TM.PrettyBounds.BaseCode]
Constr_inl_steps_nice [lemma, in Complexity.TM.PrettyBounds.BaseCode]
Constr_pair_steps_nice [lemma, in Complexity.TM.PrettyBounds.BaseCode]
Constr_S_steps_nice [lemma, in Complexity.TM.PrettyBounds.BaseCode]
Constr_O_steps_nice [lemma, in Complexity.TM.PrettyBounds.BaseCode]
Constr_cons_steps_nice [lemma, in Complexity.TM.PrettyBounds.BaseCode]
Constr_nil_steps_nice [lemma, in Complexity.TM.PrettyBounds.BaseCode]
Constr_nil_SpecT_size [lemma, in Undecidability.TM.Code.CaseList]
Constr_cons_SpecT_size [lemma, in Undecidability.TM.Code.CaseList]
Constr_cons_sizefun [definition, in Undecidability.TM.Code.CaseList]
Constr_cons_Terminates [lemma, in Undecidability.TM.Code.CaseList]
Constr_cons_steps [definition, in Undecidability.TM.Code.CaseList]
Constr_cons_Realise [lemma, in Undecidability.TM.Code.CaseList]
Constr_cons_Rel [definition, in Undecidability.TM.Code.CaseList]
Constr_cons_size [definition, in Undecidability.TM.Code.CaseList]
Constr_cons [definition, in Undecidability.TM.Code.CaseList]
Constr_nil_Sem [lemma, in Undecidability.TM.Code.CaseList]
Constr_nil_steps [definition, in Undecidability.TM.Code.CaseList]
Constr_nil_Rel [definition, in Undecidability.TM.Code.CaseList]
Constr_nil [definition, in Undecidability.TM.Code.CaseList]
Constr_S_SpecT_size [lemma, in Undecidability.TM.Code.CaseNat]
Constr_O_SpecT_size [lemma, in Undecidability.TM.Code.CaseNat]
Constr_O_Sem [lemma, in Undecidability.TM.Code.CaseNat]
Constr_O_steps [definition, in Undecidability.TM.Code.CaseNat]
Constr_O [definition, in Undecidability.TM.Code.CaseNat]
Constr_O_size [definition, in Undecidability.TM.Code.CaseNat]
Constr_S_Sem [lemma, in Undecidability.TM.Code.CaseNat]
Constr_S_steps [definition, in Undecidability.TM.Code.CaseNat]
Constr_S [definition, in Undecidability.TM.Code.CaseNat]
Constr_Npos_Sem [definition, in Undecidability.TM.Code.BinNumbers.NTM]
Constr_Npos_Rel [definition, in Undecidability.TM.Code.BinNumbers.NTM]
Constr_Npos [definition, in Undecidability.TM.Code.BinNumbers.NTM]
Constr_N0_Sem [lemma, in Undecidability.TM.Code.BinNumbers.NTM]
Constr_N0_steps [definition, in Undecidability.TM.Code.BinNumbers.NTM]
Constr_N0_Rel [definition, in Undecidability.TM.Code.BinNumbers.NTM]
Constr_N0 [definition, in Undecidability.TM.Code.BinNumbers.NTM]
Constr_pair_size_nice [lemma, in Complexity.TM.PrettyBounds.BaseCodeSpace]
Constr_cons_size_nice [lemma, in Complexity.TM.PrettyBounds.BaseCodeSpace]
Constr_S_size_nice [lemma, in Complexity.TM.PrettyBounds.BaseCodeSpace]
Constr_None_SpecT_size [lemma, in Undecidability.TM.Code.CaseSum]
Constr_Some_SpecT_size [lemma, in Undecidability.TM.Code.CaseSum]
Constr_inr_SpecT_size [lemma, in Undecidability.TM.Code.CaseSum]
Constr_inl_SpecT_size [lemma, in Undecidability.TM.Code.CaseSum]
Constr_None_Sem [lemma, in Undecidability.TM.Code.CaseSum]
Constr_None_steps [definition, in Undecidability.TM.Code.CaseSum]
Constr_None [definition, in Undecidability.TM.Code.CaseSum]
Constr_None_Rel [definition, in Undecidability.TM.Code.CaseSum]
Constr_Some_Sem [lemma, in Undecidability.TM.Code.CaseSum]
Constr_Some_steps [definition, in Undecidability.TM.Code.CaseSum]
Constr_Some [definition, in Undecidability.TM.Code.CaseSum]
Constr_Some_Rel [definition, in Undecidability.TM.Code.CaseSum]
Constr_inr_Sem [lemma, in Undecidability.TM.Code.CaseSum]
Constr_inr_steps [definition, in Undecidability.TM.Code.CaseSum]
Constr_inl_Sem [lemma, in Undecidability.TM.Code.CaseSum]
Constr_inl_steps [definition, in Undecidability.TM.Code.CaseSum]
Constr_inr [definition, in Undecidability.TM.Code.CaseSum]
Constr_inl [definition, in Undecidability.TM.Code.CaseSum]
Constr_inr_Rel [definition, in Undecidability.TM.Code.CaseSum]
Constr_inl_Rel [definition, in Undecidability.TM.Code.CaseSum]
Constr_varT_SpecT_size [lemma, in Undecidability.TM.L.CaseCom]
Constr_varT_Sem [lemma, in Undecidability.TM.L.CaseCom]
Constr_varT_steps [definition, in Undecidability.TM.L.CaseCom]
Constr_varT_Rel [definition, in Undecidability.TM.L.CaseCom]
Constr_varT [definition, in Undecidability.TM.L.CaseCom]
Constr_ACom_Sem [lemma, in Undecidability.TM.L.CaseCom]
Constr_ACom_steps [definition, in Undecidability.TM.L.CaseCom]
Constr_ACom_Rel [definition, in Undecidability.TM.L.CaseCom]
Constr_ACom [definition, in Undecidability.TM.L.CaseCom]
Constr_pair_SpecT_size [lemma, in Undecidability.TM.Code.CasePair]
Constr_pair_sizefun [definition, in Undecidability.TM.Code.CasePair]
Constr_pair_Terminates [lemma, in Undecidability.TM.Code.CasePair]
Constr_pair_T [definition, in Undecidability.TM.Code.CasePair]
Constr_pair_steps [definition, in Undecidability.TM.Code.CasePair]
Constr_pair_Realise [lemma, in Undecidability.TM.Code.CasePair]
Constr_pair [definition, in Undecidability.TM.Code.CasePair]
Constr_pair_Rel [definition, in Undecidability.TM.Code.CasePair]
Constr_pair_size [definition, in Undecidability.TM.Code.CasePair]
Constr_S_Spec_con [lemma, in Undecidability.TM.Hoare.HoareExamples]
Constr_S_Spec [lemma, in Undecidability.TM.Hoare.HoareExamples]
Constr_S_SpecT [lemma, in Undecidability.TM.Hoare.HoareExamples]
Constr_S_SpecT_size [lemma, in Undecidability.TM.Hoare.HoareExamples]
Constr_O_Spec [lemma, in Undecidability.TM.Hoare.HoareExamples]
Constr_O_SpecT [lemma, in Undecidability.TM.Hoare.HoareExamples]
Constr_O_SpecT_size [lemma, in Undecidability.TM.Hoare.HoareExamples]
Constr_S_Spec_pure [lemma, in Undecidability.TM.Hoare.HoareExamples]
Constr_S_SpecT_pure [lemma, in Undecidability.TM.Hoare.HoareExamples]
Constr_O_Spec_pure [lemma, in Undecidability.TM.Hoare.HoareExamples]
Constr_O_SpecT_pure [lemma, in Undecidability.TM.Hoare.HoareExamples]
const_at [lemma, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
Const_eqn_2 [lemma, in Undecidability.L.Complexity.GenericNary]
Const_eqn_1 [lemma, in Undecidability.L.Complexity.GenericNary]
Const' [definition, in Undecidability.L.Complexity.GenericNary]
cons_incll [lemma, in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
Cons_constant.SpecT [lemma, in Undecidability.TM.Code.List.Cons_constant]
Cons_constant.Terminates [lemma, in Undecidability.TM.Code.List.Cons_constant]
Cons_constant.time [definition, in Undecidability.TM.Code.List.Cons_constant]
Cons_constant.Realise [lemma, in Undecidability.TM.Code.List.Cons_constant]
Cons_constant.Rel [definition, in Undecidability.TM.Code.List.Cons_constant]
Cons_constant.M [definition, in Undecidability.TM.Code.List.Cons_constant]
Cons_constant.Fix.c [variable, in Undecidability.TM.Code.List.Cons_constant]
Cons_constant.Fix [section, in Undecidability.TM.Code.List.Cons_constant]
Cons_constant [module, in Undecidability.TM.Code.List.Cons_constant]
cons_equi_proper [instance, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
cons_incl_proper [instance, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
cons_injective [lemma, in Undecidability.TM.Code.Code]
cons_equi_proper [instance, in Undecidability.Shared.ListAutomation]
cons_incl_proper [instance, in Undecidability.Shared.ListAutomation]
cons_incl [lemma, in Undecidability.Shared.ListAutomation]
Cons_constant [library]
Contains [constructor, in Undecidability.TM.Hoare.HoareRegister]
ContainsEncoding [module, in Complexity.TM.Code.Decode]
ContainsEncoding.containsEncoding [section, in Complexity.TM.Code.Decode]
ContainsEncoding.functional_true [lemma, in Complexity.TM.Code.Decode]
ContainsEncoding.legacy_iff [lemma, in Complexity.TM.Code.Decode]
ContainsEncoding.Rel [definition, in Complexity.TM.Code.Decode]
ContainsEncoding.Rel_legacy [definition, in Complexity.TM.Code.Decode]
containsHaltingState [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
containsState [definition, in Undecidability.TM.Univ.LowLevel]
containsState_size_containsState [lemma, in Undecidability.TM.Univ.LowLevel]
containsState_size [definition, in Undecidability.TM.Univ.LowLevel]
containsState_size_hasSize [lemma, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
containsTrans [definition, in Undecidability.TM.Univ.LowLevel]
containsTrans_size_containsTrans [lemma, in Undecidability.TM.Univ.LowLevel]
containsTrans_size [definition, in Undecidability.TM.Univ.LowLevel]
containsTrans_size_hasSize [lemma, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
containsWorkingTape [definition, in Undecidability.TM.Univ.LowLevel]
ContainsWorkingTape [definition, in Undecidability.TM.Univ.Univ]
containsWorkingTape_doAct [lemma, in Undecidability.TM.Univ.LowLevel]
containsWorkingTape_current [lemma, in Undecidability.TM.Univ.LowLevel]
containsWorkingTape_iff [lemma, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
contains_tapes [definition, in Undecidability.TM.Single.StepTM]
contains_moveRight_atHSB [lemma, in Undecidability.TM.Code.BinNumbers.PosPointers]
contains_rev_moveLeft_atLSB [lemma, in Undecidability.TM.Code.BinNumbers.PosPointers]
contains_conf_MU'_contains_conf_MU'_size [lemma, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
contains_conf_MU_size0_nice [lemma, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
contains_conf_MU_size_eq [lemma, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
contains_conf_MU_size_exact_size [definition, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
contains_conf_MU_size_contains_conf_MU [lemma, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
contains_conf_MU'_size_contains_conf_MU' [lemma, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
contains_conf_MU_size [definition, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
contains_conf_MU [definition, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
contains_conf_MU'_size [definition, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
contains_conf_MU' [definition, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
contains_conf_U_size [definition, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
contains_conf_U [definition, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
contains_conf_U'_size [definition, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
contains_conf_U' [definition, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
contains_conf_Univ_size_contains_conf_Univ [lemma, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
contains_conf_Univ_size [definition, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
contains_conf_Univ [definition, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
contains_tapes_iff [lemma, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
contains_tapes_injective [lemma, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
Contains_size [constructor, in Undecidability.TM.Hoare.HoareRegister]
contains_tapes_inj [lemma, in Complexity.NP.TM.M_multi2mono]
contains_translate_eq [lemma, in Undecidability.TM.Code.ChangeAlphabet]
contains_size_translate_eq [lemma, in Undecidability.TM.Code.ChangeAlphabet]
contains_translate_tau [lemma, in Undecidability.TM.Code.ChangeAlphabet]
contains_size_translate_tau [lemma, in Undecidability.TM.Code.ChangeAlphabet]
contains_translate_tau2 [lemma, in Undecidability.TM.Code.ChangeAlphabet]
contains_size_translate_tau2 [lemma, in Undecidability.TM.Code.ChangeAlphabet]
contains_translate_tau1 [lemma, in Undecidability.TM.Code.ChangeAlphabet]
contains_size_translate_tau1 [lemma, in Undecidability.TM.Code.ChangeAlphabet]
contains_translate_sig [lemma, in Undecidability.TM.Code.ChangeAlphabet]
contains_size_translate_sig [lemma, in Undecidability.TM.Code.ChangeAlphabet]
contradiction_dec_bipredicate [lemma, in Complexity.NP.Clique.kSAT_to_Clique]
converges [definition, in Undecidability.L.Util.L_facts]
converges_proper [instance, in Undecidability.L.Util.L_facts]
converges_equiv [lemma, in Undecidability.L.Util.L_facts]
convert [definition, in Undecidability.L.Util.L_facts]
conv_output.retr_list [variable, in Undecidability.TM.L.CompilerBoolFuns.Compiler]
conv_output.retr_pro [variable, in Undecidability.TM.L.CompilerBoolFuns.Compiler]
conv_output.b [variable, in Undecidability.TM.L.CompilerBoolFuns.Compiler]
conv_output.s [variable, in Undecidability.TM.L.CompilerBoolFuns.Compiler]
conv_output.Σ [variable, in Undecidability.TM.L.CompilerBoolFuns.Compiler]
conv_output [section, in Undecidability.TM.L.CompilerBoolFuns.Compiler]
CookLevin [lemma, in Complexity.NP.SAT.CookLevin]
CookLevin [library]
CookLevin0 [lemma, in Complexity.NP.SAT.CookLevin]
Copy [section, in Undecidability.TM.Code.Copy]
Copy [section, in Undecidability.TM.Compound.Multi]
Copy [library]
CopyChar [definition, in Undecidability.TM.Compound.Multi]
CopyChar_Sem [lemma, in Undecidability.TM.Compound.Multi]
CopyChar_Rel [definition, in Undecidability.TM.Compound.Multi]
CopySymbols [definition, in Undecidability.TM.Compound.CopySymbols]
CopySymbols [section, in Undecidability.TM.Compound.CopySymbols]
CopySymbols [library]
CopySymbols_L_Terminates [lemma, in Undecidability.TM.Compound.CopySymbols]
CopySymbols_steps_mirror [lemma, in Undecidability.TM.Compound.CopySymbols]
CopySymbols_L_Realise [lemma, in Undecidability.TM.Compound.CopySymbols]
CopySymbols_L_Rel [definition, in Undecidability.TM.Compound.CopySymbols]
CopySymbols_mirror' [lemma, in Undecidability.TM.Compound.CopySymbols]
CopySymbols_mirror [lemma, in Undecidability.TM.Compound.CopySymbols]
CopySymbols_L [definition, in Undecidability.TM.Compound.CopySymbols]
CopySymbols_Terminates [lemma, in Undecidability.TM.Compound.CopySymbols]
CopySymbols_Realise [lemma, in Undecidability.TM.Compound.CopySymbols]
CopySymbols_true [lemma, in Undecidability.TM.Compound.CopySymbols]
CopySymbols_false [lemma, in Undecidability.TM.Compound.CopySymbols]
CopySymbols_Rel [definition, in Undecidability.TM.Compound.CopySymbols]
CopySymbols_Step_Sem [lemma, in Undecidability.TM.Compound.CopySymbols]
CopySymbols_Step_Rel [definition, in Undecidability.TM.Compound.CopySymbols]
CopySymbols_Step [definition, in Undecidability.TM.Compound.CopySymbols]
CopySymbols_L_steps_moveleft [lemma, in Undecidability.TM.Code.Copy]
CopySymbols_L_steps_midtape [lemma, in Undecidability.TM.Code.Copy]
CopySymbols_L_steps_local [lemma, in Undecidability.TM.Code.Copy]
CopySymbols_steps_moveright [lemma, in Undecidability.TM.Code.Copy]
CopySymbols_steps_midtape [lemma, in Undecidability.TM.Code.Copy]
CopySymbols_steps_local [lemma, in Undecidability.TM.Code.Copy]
CopySymbols_L_correct_moveleft [lemma, in Undecidability.TM.Code.Copy]
CopySymbols_L_correct_midtape [lemma, in Undecidability.TM.Code.Copy]
CopySymbols_L_correct [lemma, in Undecidability.TM.Code.Copy]
CopySymbols_correct_moveright [lemma, in Undecidability.TM.Code.Copy]
CopySymbols_correct_midtape [lemma, in Undecidability.TM.Code.Copy]
CopySymbols_correct [lemma, in Undecidability.TM.Code.Copy]
CopySymbols.f [variable, in Undecidability.TM.Compound.CopySymbols]
CopySymbols.sig [variable, in Undecidability.TM.Compound.CopySymbols]
CopyValue [definition, in Undecidability.TM.Code.Copy]
CopyValue [section, in Undecidability.TM.Code.Copy]
CopyValue_steps_nice [lemma, in Complexity.TM.PrettyBounds.BaseCode]
CopyValue_size_nice' [lemma, in Complexity.TM.PrettyBounds.BaseCodeSpace]
CopyValue_size_nice [lemma, in Complexity.TM.PrettyBounds.BaseCodeSpace]
CopyValue_Spec [lemma, in Undecidability.TM.Code.Copy]
CopyValue_Spec_size [lemma, in Undecidability.TM.Code.Copy]
CopyValue_SpecT [lemma, in Undecidability.TM.Code.Copy]
CopyValue_SpecT_size [lemma, in Undecidability.TM.Code.Copy]
CopyValue_sizefun [definition, in Undecidability.TM.Code.Copy]
CopyValue_Terminates [lemma, in Undecidability.TM.Code.Copy]
CopyValue_steps [definition, in Undecidability.TM.Code.Copy]
CopyValue_Realise [lemma, in Undecidability.TM.Code.Copy]
CopyValue_Rel [definition, in Undecidability.TM.Code.Copy]
CopyValue_size [definition, in Undecidability.TM.Code.Copy]
CopyValue_SpecT [lemma, in Undecidability.TM.Hoare.HoareExamples]
CopyValue_SpecT_size [lemma, in Undecidability.TM.Hoare.HoareExamples]
CopyValue_sizefun [definition, in Undecidability.TM.Hoare.HoareExamples]
CopyValue.cX [variable, in Undecidability.TM.Code.Copy]
CopyValue.I [variable, in Undecidability.TM.Code.Copy]
CopyValue.sig [variable, in Undecidability.TM.Code.Copy]
CopyValue.sigX [variable, in Undecidability.TM.Code.Copy]
CopyValue.X [variable, in Undecidability.TM.Code.Copy]
Copy_very_nice [section, in Complexity.TM.PrettyBounds.BaseCode]
Copy_size_nice.cY [variable, in Complexity.TM.PrettyBounds.BaseCodeSpace]
Copy_size_nice.Y [variable, in Complexity.TM.PrettyBounds.BaseCodeSpace]
Copy_size_nice.sigY [variable, in Complexity.TM.PrettyBounds.BaseCodeSpace]
Copy_size_nice.cX [variable, in Complexity.TM.PrettyBounds.BaseCodeSpace]
Copy_size_nice.X [variable, in Complexity.TM.PrettyBounds.BaseCodeSpace]
Copy_size_nice.sigX [variable, in Complexity.TM.PrettyBounds.BaseCodeSpace]
Copy_size_nice [section, in Complexity.TM.PrettyBounds.BaseCodeSpace]
Copy.f [variable, in Undecidability.TM.Code.Copy]
Copy.f [variable, in Undecidability.TM.Compound.Multi]
Copy.sig [variable, in Undecidability.TM.Code.Copy]
Copy.sig [variable, in Undecidability.TM.Compound.Multi]
Copy.stop [variable, in Undecidability.TM.Code.Copy]
correctSpace [lemma, in Complexity.L.AbstractMachines.AbstractSubstMachine]
correctSpace' [lemma, in Complexity.L.AbstractMachines.AbstractSubstMachine]
correctTime [lemma, in Complexity.L.AbstractMachines.AbstractSubstMachine]
correctTime [lemma, in Complexity.L.AbstractMachines.AbstractHeapMachine]
correctTime' [lemma, in Complexity.L.AbstractMachines.AbstractSubstMachine]
correctTime' [lemma, in Complexity.L.AbstractMachines.AbstractHeapMachine]
correct__UpToC [projection, in Undecidability.L.Complexity.UpToC]
correct__leUpToC [projection, in Undecidability.L.Complexity.UpToC]
correct__decInTime [projection, in Complexity.Complexity.Definitions]
count [definition, in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
count [definition, in Undecidability.Shared.Libs.PSL.Vectors.VectorDupfree]
Count [section, in Undecidability.Shared.Libs.PSL.Vectors.VectorDupfree]
countApp [lemma, in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
countDupfree [lemma, in Undecidability.Shared.Libs.PSL.Vectors.VectorDupfree]
countIn [lemma, in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
countMap [lemma, in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
countMapZero [lemma, in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
countMap_zero [lemma, in Undecidability.TM.Code.Code]
countMap_injective [lemma, in Undecidability.TM.Code.Code]
countSplit [lemma, in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
countZero [lemma, in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
count_in_equiv [lemma, in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
count_replace [lemma, in Undecidability.Shared.Libs.PSL.Vectors.VectorDupfree]
Count.X [variable, in Undecidability.Shared.Libs.PSL.Vectors.VectorDupfree]
count0_notIn' [lemma, in Undecidability.Shared.Libs.PSL.Vectors.VectorDupfree]
count0_notIn [lemma, in Undecidability.Shared.Libs.PSL.Vectors.VectorDupfree]
coversAt [definition, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
coversAt [definition, in Complexity.NP.SAT.CookLevin.Subproblems.CC]
coversAt_coversHeadInd_rem_at_end [lemma, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
coversAt_coversHeadInd_add_at_end [lemma, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
coversAt_HeadList_add_at_end [lemma, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
coversAt_step [lemma, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
coversAt_head [lemma, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
coversAt_step [lemma, in Complexity.NP.SAT.CookLevin.Subproblems.CC]
coversAt_head [lemma, in Complexity.NP.SAT.CookLevin.Subproblems.CC]
coversHead [definition, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
coversHead [definition, in Complexity.NP.SAT.CookLevin.Subproblems.CC]
coversHeadAbstract [definition, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
coversHeadInd [inductive, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
coversHeadInd_congruent [lemma, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
coversHeadInd_monotonous [lemma, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
coversHeadInd_append_invariant [lemma, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
coversHeadInd_rem_tail [lemma, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
coversHeadInd_tail_invariant [lemma, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
coversHeadInd_single [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
coversHeadList [definition, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
coversHeadList_flat_agree [lemma, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
coversHeadList_subset [lemma, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
coversHead_homomorphism2 [lemma, in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
coversHead_homomorphism_iff [lemma, in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
coversHead_indC [constructor, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
coversHead_card_inv [lemma, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
coversHead_length_inv [lemma, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
coversHead_flat_agree [lemma, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
coversHead_length_inv [lemma, in Complexity.NP.SAT.CookLevin.Subproblems.CC]
covHeadSim [abbreviation, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
covHeadSim_unique_left [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
covHeadSim_halt [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
covHeadSim_trans [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
covHeadSim_tape_polarityRev [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
covHeadSim_tape [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
covHeadTape [abbreviation, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
covHeadTrans_tape' [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
covHead_tape_sim [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
CPow [inductive, in Undecidability.L.Tactics.LClos]
CPowApp [constructor, in Undecidability.L.Tactics.LClos]
CPowAppL [constructor, in Undecidability.L.Tactics.LClos]
CPowAppR [constructor, in Undecidability.L.Tactics.LClos]
CPowRefl [constructor, in Undecidability.L.Tactics.LClos]
CPowTrans [constructor, in Undecidability.L.Tactics.LClos]
CPowVal [constructor, in Undecidability.L.Tactics.LClos]
CPowVar [constructor, in Undecidability.L.Tactics.LClos]
CPow_trans [lemma, in Undecidability.L.Tactics.LClos]
CPow_congR [lemma, in Undecidability.L.Tactics.LClos]
CPow_congL [lemma, in Undecidability.L.Tactics.LClos]
CPow'_App_properR [instance, in Undecidability.L.Tactics.LClos]
cQ [abbreviation, in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
CRT [lemma, in Undecidability.Shared.Libs.DLW.Utils.crt]
crt [library]
CRT_informative [lemma, in Undecidability.Shared.Libs.DLW.Utils.crt]
CRT_bin_informative [lemma, in Undecidability.Shared.Libs.DLW.Utils.crt]
cstate [projection, in Undecidability.TM.Util.TM_facts]
cst:84 [binder, in Undecidability.L.Complexity.GenericNary]
cs:14 [binder, in Undecidability.TM.Code.List.Concat_Repeat]
cs:21 [binder, in Undecidability.TM.Code.List.Concat_Repeat]
cs:27 [binder, in Undecidability.TM.Code.List.Concat_Repeat]
cs:469 [binder, in Undecidability.TM.Single.StepTM]
cs:55 [binder, in Undecidability.TM.Code.List.Concat_Repeat]
ctapes [projection, in Undecidability.TM.Util.TM_facts]
ctr_types:131 [binder, in Undecidability.L.Tactics.Extract]
ctr_types:38 [binder, in Undecidability.L.Tactics.GenEncode]
Ctx:127 [binder, in Undecidability.TM.Hoare.HoareRegister]
Ctx:465 [binder, in Undecidability.TM.Hoare.HoareRegister]
cumul [abbreviation, in Undecidability.Synthetic.ListEnumerabilityFacts]
cumulative [definition, in Undecidability.Synthetic.ListEnumerabilityFacts]
cumul_spec [lemma, in Undecidability.Synthetic.ListEnumerabilityFacts]
cumul_spec__T [lemma, in Undecidability.Synthetic.ListEnumerabilityFacts]
cumul_In [lemma, in Undecidability.Synthetic.ListEnumerabilityFacts]
cum_ge' [lemma, in Undecidability.Synthetic.ListEnumerabilityFacts]
cum_ge [lemma, in Undecidability.Synthetic.ListEnumerabilityFacts]
curr [definition, in Undecidability.TM.SBTM]
current [definition, in Undecidability.TM.TM]
current_chars_surjectTapes [lemma, in Undecidability.TM.Lifting.LiftAlphabet]
current_chars_mirror_tapes [lemma, in Undecidability.TM.Combinators.Mirror]
current_charsFlat_eq [lemma, in Complexity.L.TM.TMflatFun]
current_chars_select [lemma, in Undecidability.TM.Lifting.LiftTapes]
current_chars [definition, in Undecidability.TM.Util.TM_facts]
curSize:11 [binder, in Complexity.L.AbstractMachines.FunctionalDefinitions]
curSize:21 [binder, in Complexity.L.AbstractMachines.FunctionalDefinitions]
curSize:28 [binder, in Complexity.L.AbstractMachines.FunctionalDefinitions]
curSize:30 [binder, in Complexity.L.AbstractMachines.FunctionalDefinitions]
curSize:35 [binder, in Complexity.L.AbstractMachines.FunctionalDefinitions]
curSize:61 [binder, in Complexity.L.AbstractMachines.FunctionalDefinitions]
curSize:7 [binder, in Complexity.L.AbstractMachines.FunctionalDefinitions]
Custom [constructor, in Undecidability.TM.Hoare.HoareRegister]
cX:10 [binder, in Undecidability.TM.Hoare.HoareRegister]
cX:102 [binder, in Undecidability.TM.Code.List.Nth]
cX:106 [binder, in Complexity.TM.PrettyBounds.BaseCode]
cX:106 [binder, in Undecidability.TM.Code.Copy]
cX:107 [binder, in Undecidability.TM.Code.List.Nth]
cX:11 [binder, in Complexity.TM.PrettyBounds.BaseCode]
cX:11 [binder, in Undecidability.TM.Code.WriteValue]
cX:112 [binder, in Complexity.TM.PrettyBounds.BaseCode]
cX:112 [binder, in Undecidability.TM.Code.Copy]
cX:117 [binder, in Complexity.TM.PrettyBounds.BaseCode]
cX:118 [binder, in Undecidability.TM.Code.Copy]
cX:12 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds_Loop]
cX:12 [binder, in Undecidability.TM.Code.List.Cons_constant]
cX:122 [binder, in Complexity.TM.PrettyBounds.BaseCode]
cX:126 [binder, in Undecidability.TM.Univ.LookupAssociativeListTM]
cX:132 [binder, in Complexity.TM.PrettyBounds.BaseCode]
cX:132 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
cX:137 [binder, in Undecidability.TM.Code.Copy]
cX:138 [binder, in Complexity.TM.PrettyBounds.BaseCode]
cX:14 [binder, in Complexity.TM.PrettyBounds.UnivBounds]
cX:146 [binder, in Undecidability.TM.Code.Copy]
cX:147 [binder, in Undecidability.TM.Univ.LookupAssociativeListTM]
cX:15 [binder, in Undecidability.TM.Hoare.HoareExamples]
cX:16 [binder, in Undecidability.TM.Univ.LookupAssociativeListTM]
cX:161 [binder, in Undecidability.TM.Code.Copy]
cX:166 [binder, in Undecidability.TM.Code.Copy]
cX:17 [binder, in Complexity.TM.PrettyBounds.BaseCode]
cX:17 [binder, in Undecidability.TM.PrettyBounds.SizeBounds]
cX:17 [binder, in Undecidability.TM.Hoare.HoareRegister]
cX:179 [binder, in Undecidability.TM.Code.Copy]
cX:18 [binder, in Complexity.NP.TM.LM_to_mTM]
cX:19 [binder, in Undecidability.TM.Code.List.Nth]
cX:19 [binder, in Undecidability.TM.Code.WriteValue]
cX:201 [binder, in Undecidability.TM.Code.Copy]
cX:21 [binder, in Undecidability.TM.Code.CasePair]
cX:21 [binder, in Undecidability.TM.Hoare.HoareExamples]
cX:211 [binder, in Undecidability.TM.Code.Copy]
cX:218 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
cX:218 [binder, in Undecidability.TM.Code.Copy]
cX:223 [binder, in Undecidability.TM.Code.Copy]
cX:230 [binder, in Undecidability.TM.Code.Copy]
cX:236 [binder, in Undecidability.TM.Code.Copy]
cX:24 [binder, in Complexity.TM.PrettyBounds.BaseCode]
cX:24 [binder, in Undecidability.TM.Code.List.Length]
cX:243 [binder, in Undecidability.TM.Code.Copy]
cX:246 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
cX:249 [binder, in Undecidability.TM.Code.Copy]
cX:25 [binder, in Complexity.TM.PrettyBounds.UnivBounds]
cX:25 [binder, in Undecidability.TM.Univ.LookupAssociativeListTM]
cX:256 [binder, in Undecidability.TM.Code.Copy]
cX:26 [binder, in Undecidability.TM.Code.CasePair]
cX:262 [binder, in Undecidability.TM.Code.Copy]
cX:269 [binder, in Undecidability.TM.Code.Copy]
cX:275 [binder, in Undecidability.TM.Code.Copy]
cX:28 [binder, in Undecidability.TM.Code.CaseList]
cX:28 [binder, in Undecidability.TM.Hoare.HoareExamples]
cX:28 [binder, in Undecidability.TM.Code.List.App]
cX:282 [binder, in Undecidability.TM.Code.Copy]
cX:288 [binder, in Undecidability.TM.Code.Copy]
cX:29 [binder, in Undecidability.TM.Code.WriteValue]
cX:295 [binder, in Undecidability.TM.Code.Copy]
cX:3 [binder, in Complexity.TM.PrettyBounds.UnivBounds]
cX:3 [binder, in Undecidability.TM.Code.List.Cons_constant]
cX:3 [binder, in Complexity.TM.Code.DecodeList]
cX:3 [binder, in Undecidability.TM.Hoare.HoareExamples]
cX:301 [binder, in Undecidability.TM.Code.Copy]
cX:308 [binder, in Undecidability.TM.Code.Copy]
cX:314 [binder, in Undecidability.TM.Code.Copy]
cX:321 [binder, in Undecidability.TM.Code.Copy]
cX:328 [binder, in Undecidability.TM.Code.Copy]
cX:33 [binder, in Undecidability.TM.Code.CaseList]
cX:33 [binder, in Undecidability.TM.Code.List.Length]
cX:33 [binder, in Undecidability.TM.Code.CompareValue]
cX:337 [binder, in Undecidability.TM.Code.Copy]
cX:34 [binder, in Complexity.TM.PrettyBounds.BaseCode]
cX:34 [binder, in Undecidability.TM.Hoare.HoareExamples]
cX:349 [binder, in Undecidability.TM.Code.Copy]
cX:35 [binder, in Complexity.TM.PrettyBounds.UnivBounds]
cX:35 [binder, in Undecidability.TM.Univ.LookupAssociativeListTM]
cX:36 [binder, in Undecidability.TM.Code.CasePair]
cX:360 [binder, in Undecidability.TM.Code.Copy]
cX:372 [binder, in Undecidability.TM.Code.Copy]
cX:38 [binder, in Undecidability.TM.Code.List.Nth]
cX:381 [binder, in Undecidability.TM.Code.Copy]
cX:389 [binder, in Undecidability.TM.Code.Copy]
cX:39 [binder, in Complexity.TM.PrettyBounds.BaseCode]
cX:39 [binder, in Undecidability.TM.Code.List.App]
cX:396 [binder, in Undecidability.TM.Code.Copy]
cX:4 [binder, in Complexity.TM.PrettyBounds.BaseCode]
cX:4 [binder, in Undecidability.TM.Code.WriteValue]
cX:404 [binder, in Undecidability.TM.Code.Copy]
cX:41 [binder, in Undecidability.TM.Hoare.HoareExamples]
cX:43 [binder, in Undecidability.TM.Code.CasePair]
cX:44 [binder, in Complexity.TM.PrettyBounds.BaseCode]
cX:44 [binder, in Undecidability.TM.Univ.LookupAssociativeListTM]
cX:45 [binder, in Complexity.TM.PrettyBounds.UnivBounds]
cX:46 [binder, in Undecidability.TM.Code.List.Nth]
cX:46 [binder, in Undecidability.TM.Code.List.Length]
cX:49 [binder, in Complexity.TM.PrettyBounds.BaseCode]
cX:50 [binder, in Undecidability.TM.Hoare.HoareExamples]
cX:54 [binder, in Complexity.TM.PrettyBounds.UnivBounds]
cX:54 [binder, in Undecidability.TM.Code.CasePair]
cX:54 [binder, in Complexity.NP.TM.LM_to_mTM]
cX:56 [binder, in Undecidability.TM.Code.List.Length]
cX:561 [binder, in Complexity.NP.TM.LM_to_mTM]
cX:58 [binder, in Complexity.TM.PrettyBounds.BaseCode]
cX:58 [binder, in Undecidability.TM.Univ.LookupAssociativeListTM]
cX:59 [binder, in Undecidability.TM.Code.CaseList]
cX:6 [binder, in Undecidability.TM.Hoare.HoareRegister]
cX:60 [binder, in Complexity.TM.Code.Decode]
cX:61 [binder, in Undecidability.TM.Code.CasePair]
cX:62 [binder, in Undecidability.TM.Hoare.HoareExamples]
cX:63 [binder, in Undecidability.TM.Code.CaseList]
cX:64 [binder, in Complexity.TM.PrettyBounds.UnivBounds]
cX:67 [binder, in Undecidability.TM.Code.List.Length]
cX:68 [binder, in Undecidability.TM.Univ.LookupAssociativeListTM]
cX:69 [binder, in Complexity.TM.PrettyBounds.BaseCodeSpace]
cX:7 [binder, in Complexity.TM.PrettyBounds.UnivBounds]
cX:7 [binder, in Undecidability.TM.Code.Code]
cX:70 [binder, in Undecidability.TM.Code.CasePair]
cX:73 [binder, in Complexity.TM.PrettyBounds.UnivBounds]
cX:73 [binder, in Undecidability.TM.Hoare.HoareExamples]
cX:75 [binder, in Complexity.TM.PrettyBounds.BaseCodeSpace]
cX:8 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds_Loop]
cX:8 [binder, in Undecidability.TM.Hoare.HoareExamples]
cX:80 [binder, in Complexity.TM.PrettyBounds.BaseCodeSpace]
cX:82 [binder, in Complexity.TM.PrettyBounds.UnivBounds]
cX:84 [binder, in Undecidability.TM.Code.CaseList]
cX:87 [binder, in Complexity.TM.PrettyBounds.BaseCodeSpace]
cX:9 [binder, in Undecidability.TM.Code.List.Nth]
cX:9 [binder, in Undecidability.TM.Code.List.Length]
cX:91 [binder, in Complexity.TM.PrettyBounds.UnivBounds]
cX:95 [binder, in Undecidability.TM.Code.CaseList]
cX:98 [binder, in Undecidability.TM.Code.Copy]
cY:107 [binder, in Complexity.TM.PrettyBounds.BaseCode]
cY:127 [binder, in Undecidability.TM.Univ.LookupAssociativeListTM]
cY:148 [binder, in Undecidability.TM.Univ.LookupAssociativeListTM]
cY:15 [binder, in Complexity.TM.PrettyBounds.UnivBounds]
cY:167 [binder, in Undecidability.TM.Code.Copy]
cY:17 [binder, in Undecidability.TM.Univ.LookupAssociativeListTM]
cY:180 [binder, in Undecidability.TM.Code.Copy]
cY:26 [binder, in Complexity.TM.PrettyBounds.UnivBounds]
cY:26 [binder, in Undecidability.TM.Univ.LookupAssociativeListTM]
cY:329 [binder, in Undecidability.TM.Code.Copy]
cY:338 [binder, in Undecidability.TM.Code.Copy]
cY:350 [binder, in Undecidability.TM.Code.Copy]
cY:36 [binder, in Complexity.TM.PrettyBounds.UnivBounds]
cY:36 [binder, in Undecidability.TM.Univ.LookupAssociativeListTM]
cY:361 [binder, in Undecidability.TM.Code.Copy]
cY:373 [binder, in Undecidability.TM.Code.Copy]
cY:42 [binder, in Undecidability.TM.Hoare.HoareExamples]
cY:45 [binder, in Undecidability.TM.Univ.LookupAssociativeListTM]
cY:46 [binder, in Complexity.TM.PrettyBounds.UnivBounds]
cY:51 [binder, in Undecidability.TM.Hoare.HoareExamples]
cY:52 [binder, in Complexity.TM.PrettyBounds.BaseCode]
cY:55 [binder, in Complexity.TM.PrettyBounds.UnivBounds]
cY:59 [binder, in Undecidability.TM.Univ.LookupAssociativeListTM]
cY:63 [binder, in Complexity.TM.PrettyBounds.BaseCode]
cY:63 [binder, in Undecidability.TM.Hoare.HoareExamples]
cY:65 [binder, in Complexity.TM.PrettyBounds.UnivBounds]
cY:69 [binder, in Undecidability.TM.Univ.LookupAssociativeListTM]
cY:74 [binder, in Complexity.TM.PrettyBounds.UnivBounds]
cY:74 [binder, in Undecidability.TM.Hoare.HoareExamples]
cY:83 [binder, in Complexity.TM.PrettyBounds.UnivBounds]
cY:88 [binder, in Complexity.TM.PrettyBounds.BaseCodeSpace]
cY:92 [binder, in Complexity.TM.PrettyBounds.UnivBounds]
c__reduction [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__isValidFlatTM [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__isValidFlatTrans [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__isBoundTransTable [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__isBoundTrans [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__fstOptBound [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__optBound [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__ltb [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__isInjFinfuncTable [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__allSameEntry [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__allSameEntryStep [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__implb [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__reductionWf [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__finalSubstrings [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__flatFinalSubstringsStep [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__flatHaltingStates [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__isHalting [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__filter [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__nth [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__flatInitialString [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__flatInrflatNsig [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__zPflat [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__zflat [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__kflat [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__repEl [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__flatPreludeCards [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__flatBaseEnvPrelude [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__makePreludeCardsFlat [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__flatStateCards [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__generateCardsForFlat2 [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__generateCardsForFlat1 [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__generateCardsForFlatStep [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__makeHaltFlat [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__generateCardsForFlatNonHalt [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__genSome [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__genNone [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__optGenerateCardsForFlatNonHalt [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__fOpt [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__flatBaseEnvNone [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__flatBaseEnv [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__makeNoneStayFlat [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__makeNoneLeftFlat [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__makeNoneRightFlat [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__makeNoneBaseFlat2 [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__makeNoneBaseFlat1 [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__makeSomeStayFlat [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__makeSomeLeftFlat [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__makeSomeRightFlat [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__makeSomeBaseFlat2 [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__makeSomeBaseFlat1 [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__flatTapeCards [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__flatMTLCards [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__flatMTICards [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__flatMTRCards [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__transEnvAddSM [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__transEnvAddS [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__envAddSSigma [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__envAddState [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__makeCardsFlat [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__makeCards' [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__makeCardsPFlatStep [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__filterSome [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__makeAllEvalEnvFlat2 [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__makeAllEvalEnvFlat1 [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__prodLists2 [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__prodLists1 [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__tupToEvalEnv [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__mkVarEnvB2 [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__mkVarEnvB1 [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__mkVarEnv [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__it [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__mkVarEnvStep [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__listProd2 [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__listProd1 [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__generateCard [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__generateAlphabetFlat [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__generatePreludeSigPFlat [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__flatNsig [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__generateGammaFlat [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__generateStatesFlat [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__generateTapeSigmaFlat [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__generatePolSigmaFlat [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__generateStateSigmaFlat [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__optionMap [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__generatePolarityFlat [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__flattenPolarity [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__flatAlphabet [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__flatPreludeSig' [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__flatGamma [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__flatStates [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__flatTapeSigma [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__flatPolSigma [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__flatStateSigma [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__flatAlphabetS [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__flatPreludeSigPS [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__flatGammaS [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__flatTapeSigmaS [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__flatPolSigmaS [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__stateEnv [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__stateSigmaEnv [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__sigmaEnv [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__polarityEnv [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__inv:46 [binder, in Complexity.Complexity.ONotation]
c__encodeListAt [definition, in Complexity.NP.SAT.FSAT.FormulaEncoding]
c__encodeLiteral [definition, in Complexity.NP.SAT.FSAT.FormulaEncoding]
c__tabulateFormula [definition, in Complexity.NP.SAT.FSAT.FormulaEncoding]
c__tabulateStep [definition, in Complexity.NP.SAT.FSAT.FormulaEncoding]
c__listOr [definition, in Complexity.NP.SAT.FSAT.FormulaEncoding]
c__listAnd [definition, in Complexity.NP.SAT.FSAT.FormulaEncoding]
c__regP [projection, in Complexity.Complexity.EncodableP]
c__rev [definition, in Undecidability.L.Datatypes.List.List_basics]
c__map [definition, in Undecidability.L.Datatypes.List.List_basics]
c__app [definition, in Undecidability.L.Datatypes.List.List_basics]
c__sizeBool [definition, in Undecidability.L.Datatypes.LBool]
c__sizeFlatTCC [definition, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
c__steps [definition, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
c__final [definition, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
c__cards [definition, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
c__init [definition, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
c__Sigma [definition, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
c__sizeTCCCard [definition, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
c__TCCCardPToList [definition, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
c__sizeTCCCardP [definition, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
c_surj [lemma, in Undecidability.L.Computability.Enum]
c_c_inv [lemma, in Undecidability.L.Computability.Enum]
c_inv [definition, in Undecidability.L.Computability.Enum]
C_longenough [lemma, in Undecidability.L.Computability.Enum]
C_exhaustive [lemma, in Undecidability.L.Computability.Enum]
C_ge [lemma, in Undecidability.L.Computability.Enum]
C_S [lemma, in Undecidability.L.Computability.Enum]
c__encTM [definition, in Complexity.L.TM.TMflatEnc]
c__kCNFDecbBound2 [definition, in Complexity.NP.SAT.kSAT]
c__kCNFDecbBound1 [definition, in Complexity.NP.SAT.kSAT]
c__kCNFDecb [definition, in Complexity.NP.SAT.kSAT]
c__clauseLengthDecb [definition, in Complexity.NP.SAT.kSAT]
c__listsizeNil [definition, in Undecidability.L.Datatypes.Lists]
c__listsizeCons [definition, in Undecidability.L.Datatypes.Lists]
c__listOfFlatTypeDecBound [definition, in Complexity.Libs.CookPrelim.FlatFinTypes]
c__listOfFlatTypeDec [definition, in Complexity.Libs.CookPrelim.FlatFinTypes]
c__ofFlatTypeDecBound [definition, in Complexity.Libs.CookPrelim.FlatFinTypes]
c__ofFlatTypeDec [definition, in Complexity.Libs.CookPrelim.FlatFinTypes]
c__flatPair [definition, in Complexity.Libs.CookPrelim.FlatFinTypes]
c__leUpToC [projection, in Undecidability.L.Complexity.UpToC]
c__steps [definition, in Complexity.NP.SAT.CookLevin.Subproblems.BinaryCC]
c__final [definition, in Complexity.NP.SAT.CookLevin.Subproblems.BinaryCC]
c__cards [definition, in Complexity.NP.SAT.CookLevin.Subproblems.BinaryCC]
c__init [definition, in Complexity.NP.SAT.CookLevin.Subproblems.BinaryCC]
c__width [definition, in Complexity.NP.SAT.CookLevin.Subproblems.BinaryCC]
c__offset [definition, in Complexity.NP.SAT.CookLevin.Subproblems.BinaryCC]
c__length [definition, in Undecidability.L.Datatypes.List.List_nat]
c__ntherror [definition, in Undecidability.L.Datatypes.List.List_nat]
c__eqbBool [definition, in Complexity.NP.SAT.SAT_inNP]
c__cnfSize1 [definition, in Complexity.NP.SAT.SAT_inNP]
c__clauseSize1 [definition, in Complexity.NP.SAT.SAT_inNP]
c__prodLists2 [definition, in Undecidability.L.Datatypes.List.List_extra]
c__prodLists1 [definition, in Undecidability.L.Datatypes.List.List_extra]
c__seq [definition, in Undecidability.L.Datatypes.List.List_extra]
c__termsize [definition, in Undecidability.L.Datatypes.LTerm]
c__moduloBound [definition, in Complexity.Libs.CookPrelim.PolyBounds]
c__concat [definition, in Complexity.Libs.CookPrelim.PolyBounds]
c__reduction [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
c__hBinaryCCSize2 [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
c__hBinaryCCSize [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
c__hBinaryCC2 [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
c__hBinaryCC [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
c__hfinalSize [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
c__hfinalBound [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
c__hfinal [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
c__hcardsSize2 [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
c__hcardsSize1 [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
c__hcardsBound [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
c__hcards [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
c__hcardSize2 [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
c__hcardSize1 [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
c__hcard [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
c__hflatSize [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
c__hNatSize [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
c__hflat [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
c__hNatBound [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
c__hNat [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
c__repEl [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
c__repEl2 [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
c__compileTR' [definition, in Complexity.L.AbstractMachines.FlatPro.Computable.Compile]
c__size [definition, in Complexity.L.AbstractMachines.FlatPro.Computable.Compile]
c__sizeInputIndex [definition, in Complexity.NP.SAT.CookLevin.Reductions.TMGenNP_fixed_singleTapeTM_to_FlatFunSingleTMGenNP]
c__reduction [definition, in Complexity.NP.SAT.CookLevin.Reductions.TMGenNP_fixed_singleTapeTM_to_FlatFunSingleTMGenNP]
c_of [abbreviation, in Complexity.Complexity.UpToCPoly]
c__eqbComp [projection, in Undecidability.L.Functions.EqBool]
c__formulaMaxVarBound1 [definition, in Complexity.NP.SAT.FSAT.FSAT]
c__formulaMaxVar [definition, in Complexity.NP.SAT.FSAT.FSAT]
c__formulaBound2 [definition, in Complexity.NP.SAT.FSAT.FSAT]
c__formulaBound1 [definition, in Complexity.NP.SAT.FSAT.FSAT]
c_M:386 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
c_M:265 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
c__fgraphWfDecb [definition, in Complexity.NP.Clique.FlatClique]
c__fedgesWfDecb [definition, in Complexity.NP.Clique.FlatClique]
c__fedgeWfDecb [definition, in Complexity.NP.Clique.FlatClique]
c__fedgesSymmetricDecb [definition, in Complexity.NP.Clique.FlatClique]
c__fedgesSymmetricDecbStep [definition, in Complexity.NP.Clique.FlatClique]
c__isfKCliqueDecb [definition, in Complexity.NP.Clique.FlatClique]
c__isfCliqueDecb [definition, in Complexity.NP.Clique.FlatClique]
c__allPairsOfEdgesDecbBound2 [definition, in Complexity.NP.Clique.FlatClique]
c__allPairsOfEdgesDecbBound1 [definition, in Complexity.NP.Clique.FlatClique]
c__allPairsOfEdgesDecb [definition, in Complexity.NP.Clique.FlatClique]
c__allPairsOfEdgesDecbStep [definition, in Complexity.NP.Clique.FlatClique]
c__fedgesEdgeInDecb [definition, in Complexity.NP.Clique.FlatClique]
c__reduction [definition, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
c__BinaryCCWfDecBound [definition, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
c__BinaryCCWfDec [definition, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
c__encodeTableau [definition, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
c__encodeFinalConstraint [definition, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
c__encodeFinalConstraintStep [definition, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
c__encodeSubstringInLine [definition, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
c__encodeSubstringInLine' [definition, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
c__encodeCardsInAllLines [definition, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
c__encodeCardsInLine [definition, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
c__encodeCardsInLineP [definition, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
c__encodeCardsAt [definition, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
c__encodeCardAt [definition, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
c__isValidFlatteningDecBound [definition, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
c__isValidFlatteningDec [definition, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
c__CCCardOfFlatTypeDecBound [definition, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
c__CCCardOfFlatTypeDec [definition, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
c__FlatCCWfDecBound [definition, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
c__FlatCCWfDec [definition, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
c__prcardOfSizeDecBound [definition, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
c__prcardOfSizeDec [definition, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
c__steps [definition, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
c__final [definition, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
c__cards [definition, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
c__init [definition, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
c__width [definition, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
c__offset [definition, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
c__Sigma [definition, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
c__sizeCCCard [definition, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
C_nondec_correct [lemma, in Undecidability.L.Functions.EnumInt]
C_nondec [definition, in Undecidability.L.Functions.EnumInt]
c__dupfreeb [definition, in Undecidability.L.Datatypes.List.List_in]
c__list_incl_decb [definition, in Undecidability.L.Datatypes.List.List_in]
c__listInDecb [definition, in Undecidability.L.Datatypes.List.List_in]
c__trans [definition, in Undecidability.L.TM.TMinL.TMinL_extract]
c__FCC_instance [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatTCC_to_FlatCC]
c__CCCardsBound [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatTCC_to_FlatCC]
c__CCCards [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatTCC_to_FlatCC]
c__TCCCardToCCCardSize [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatTCC_to_FlatCC]
c__TCCCardToCCCard [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatTCC_to_FlatCC]
c__fold_right [definition, in Undecidability.L.Datatypes.List.List_fold]
c__fold_left2 [definition, in Undecidability.L.Datatypes.List.List_fold]
c__fold_left [definition, in Undecidability.L.Datatypes.List.List_fold]
c__forallb [definition, in Undecidability.L.Datatypes.List.List_fold]
c__powBound [definition, in Complexity.Complexity.Definitions]
c__natsizeS [definition, in Undecidability.L.Datatypes.LNat]
c__natsizeO [definition, in Undecidability.L.Datatypes.LNat]
c__modulo [definition, in Undecidability.L.Datatypes.LNat]
c__divmod [definition, in Undecidability.L.Datatypes.LNat]
c__pow2 [definition, in Undecidability.L.Datatypes.LNat]
c__pow1 [definition, in Undecidability.L.Datatypes.LNat]
c__max2 [definition, in Undecidability.L.Datatypes.LNat]
c__max1 [definition, in Undecidability.L.Datatypes.LNat]
c__min2 [definition, in Undecidability.L.Datatypes.LNat]
c__min1 [definition, in Undecidability.L.Datatypes.LNat]
c__ltb [definition, in Undecidability.L.Datatypes.LNat]
c__leb2 [definition, in Undecidability.L.Datatypes.LNat]
c__leb [definition, in Undecidability.L.Datatypes.LNat]
c__sub [definition, in Undecidability.L.Datatypes.LNat]
c__sub1 [definition, in Undecidability.L.Datatypes.LNat]
c__mult [definition, in Undecidability.L.Datatypes.LNat]
c__mult1 [definition, in Undecidability.L.Datatypes.LNat]
c__add1 [definition, in Undecidability.L.Datatypes.LNat]
c__add [definition, in Undecidability.L.Datatypes.LNat]
c__linDec [projection, in Undecidability.L.Complexity.LinDecode.LTD_def]
c__reduction [definition, in Complexity.NP.Clique.kSAT_to_FlatClique]
c__Gflat [definition, in Complexity.NP.Clique.kSAT_to_FlatClique]
c__makeEdges [definition, in Complexity.NP.Clique.kSAT_to_FlatClique]
c__makeEdge [definition, in Complexity.NP.Clique.kSAT_to_FlatClique]
c__cnfGetLiteral [definition, in Complexity.NP.Clique.kSAT_to_FlatClique]
c__toVertex [definition, in Complexity.NP.Clique.kSAT_to_FlatClique]
c__optLiteralsConflictDecb [definition, in Complexity.NP.Clique.kSAT_to_FlatClique]
c__literalsConflictDecb [definition, in Complexity.NP.Clique.kSAT_to_FlatClique]
c__allPositions [definition, in Complexity.NP.Clique.kSAT_to_FlatClique]
c__reduction [definition, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
c__tseytin [definition, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
c__tseytinPBound1 [definition, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
c__tseytinP2 [definition, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
c__tseytinP1 [definition, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
c__tseytinTrue [definition, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
c__tseytinEquiv [definition, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
c__tseytinNot [definition, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
c__tseytinOr [definition, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
c__tseytinAnd [definition, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
c__eliminateOR [definition, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
c__redFSize [definition, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
c__tseytinSize [definition, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
c__eliminateOrSize [definition, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
c':101 [binder, in Complexity.TM.Single.DecodeTape]
C':103 [binder, in Undecidability.Shared.Libs.PSL.Retracts]
c':105 [binder, in Complexity.TM.Single.DecodeTape]
c':108 [binder, in Complexity.TM.PrettyBounds.PrettyBounds]
C':115 [binder, in Undecidability.Shared.Libs.PSL.Retracts]
C':130 [binder, in Undecidability.Shared.Libs.PSL.Retracts]
C':148 [binder, in Undecidability.Shared.Libs.PSL.Retracts]
c':16 [binder, in Complexity.NP.L.GenNP]
C':19 [binder, in Undecidability.L.Functions.EnumInt]
c':20 [binder, in Complexity.NP.L.LMGenNP]
c':25 [binder, in Undecidability.L.AbstractMachines.FlatPro.Programs]
c':26 [binder, in Complexity.TM.PrettyBounds.PrettyBounds]
c':2666 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
c':2687 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
c':30 [binder, in Complexity.TM.PrettyBounds.PrettyBounds]
c':4 [binder, in Complexity.NP.SAT.CookLevin.Reductions.TMGenNP_fixed_singleTapeTM_to_FlatFunSingleTMGenNP]
c':47 [binder, in Complexity.TM.PrettyBounds.PrettyBounds]
c':483 [binder, in Undecidability.TM.Single.StepTM]
c':55 [binder, in Complexity.L.TM.TMflatFun]
c':63 [binder, in Complexity.L.TM.TMflat]
c':65 [binder, in Complexity.L.TM.TMflatFun]
c':68 [binder, in Undecidability.L.Complexity.UpToC]
c':69 [binder, in Complexity.L.TM.TMflat]
c':70 [binder, in Undecidability.L.Complexity.UpToCNary]
c':82 [binder, in Complexity.L.TM.TMflatComp]
c':83 [binder, in Complexity.L.TM.TMflatFun]
C':94 [binder, in Undecidability.Shared.Libs.PSL.Retracts]
c0:11 [binder, in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisStep]
c0:2 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
c0:20 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
c0:23 [binder, in Complexity.L.AbstractMachines.AbstractSubstMachine]
c0:32 [binder, in Complexity.L.TM.TMflatComp]
c0:33 [binder, in Complexity.L.TM.TMflatComp]
c0:40 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.SingleTMGenNP]
c0:82 [binder, in Complexity.L.TM.TMflatFun]
c1 [definition, in Complexity.L.AbstractMachines.FlatPro.Computable.Compile]
c1:100 [binder, in Complexity.TM.PrettyBounds.PrettyBounds]
c1:11 [binder, in Undecidability.L.TM.TMinL.TMinL_extract]
c1:11 [binder, in Complexity.TM.PrettyBounds.PrettyBounds]
c1:117 [binder, in Undecidability.TM.Lifting.LiftTapes]
c1:118 [binder, in Undecidability.TM.Lifting.LiftTapes]
c1:12 [binder, in Undecidability.TM.Combinators.Mirror]
c1:12 [binder, in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisStep]
c1:121 [binder, in Undecidability.TM.Lifting.LiftTapes]
c1:124 [binder, in Undecidability.TM.Lifting.LiftTapes]
c1:132 [binder, in Undecidability.TM.Lifting.LiftTapes]
c1:15 [binder, in Undecidability.TM.Combinators.While]
c1:15 [binder, in Complexity.TM.PrettyBounds.PrettyBounds]
c1:175 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
c1:184 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
c1:19 [binder, in Complexity.TM.PrettyBounds.PrettyBounds]
c1:190 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
c1:193 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
c1:21 [binder, in Undecidability.TM.Combinators.While]
c1:21 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
c1:21 [binder, in Undecidability.TM.Combinators.Mirror]
c1:24 [binder, in Undecidability.TM.Combinators.Mirror]
c1:25 [binder, in Undecidability.TM.Combinators.While]
C1:27 [binder, in Complexity.NP.SAT.SAT]
c1:3 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
c1:30 [binder, in Undecidability.TM.Combinators.While]
c1:34 [binder, in Undecidability.TM.Combinators.While]
c1:34 [binder, in Undecidability.TM.Combinators.StateWhile]
c1:36 [binder, in Undecidability.TM.Combinators.Switch]
c1:3614 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
c1:39 [binder, in Undecidability.TM.Combinators.StateWhile]
c1:47 [binder, in Undecidability.TM.Combinators.Switch]
c1:5 [binder, in Undecidability.TM.Compound.Compare]
c1:54 [binder, in Undecidability.TM.Lifting.LiftAlphabet]
c1:56 [binder, in Complexity.TM.PrettyBounds.PrettyBounds]
c1:58 [binder, in Undecidability.TM.Combinators.StateWhile]
c1:6 [binder, in Complexity.TM.PrettyBounds.PrettyBounds]
c1:63 [binder, in Complexity.NP.SAT.SAT]
c1:65 [binder, in Complexity.TM.PrettyBounds.PrettyBounds]
c1:67 [binder, in Undecidability.TM.Combinators.StateWhile]
c1:7 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
C1:72 [binder, in Complexity.NP.SAT.SAT]
c1:73 [binder, in Undecidability.TM.Combinators.StateWhile]
c1:74 [binder, in Complexity.TM.PrettyBounds.PrettyBounds]
c1:81 [binder, in Complexity.TM.PrettyBounds.PrettyBounds]
c1:91 [binder, in Complexity.TM.PrettyBounds.PrettyBounds]
c1:99 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
c2 [definition, in Complexity.L.AbstractMachines.FlatPro.Computable.Compile]
c2':134 [binder, in Undecidability.TM.Lifting.LiftTapes]
c2':42 [binder, in Undecidability.TM.Combinators.Switch]
C27 [lemma, in Undecidability.L.Computability.Scott]
C27_proc [lemma, in Undecidability.L.Computability.Scott]
c2:100 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
c2:101 [binder, in Complexity.TM.PrettyBounds.PrettyBounds]
c2:119 [binder, in Undecidability.TM.Lifting.LiftTapes]
c2:12 [binder, in Undecidability.L.TM.TMinL.TMinL_extract]
c2:12 [binder, in Complexity.TM.PrettyBounds.PrettyBounds]
c2:122 [binder, in Undecidability.TM.Lifting.LiftTapes]
c2:125 [binder, in Undecidability.TM.Lifting.LiftTapes]
c2:13 [binder, in Undecidability.TM.Combinators.Mirror]
c2:13 [binder, in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisStep]
c2:133 [binder, in Undecidability.TM.Lifting.LiftTapes]
c2:16 [binder, in Complexity.TM.PrettyBounds.PrettyBounds]
c2:176 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
c2:185 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
c2:19 [binder, in Undecidability.TM.Combinators.While]
c2:194 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
c2:20 [binder, in Complexity.TM.PrettyBounds.PrettyBounds]
c2:22 [binder, in Undecidability.TM.Combinators.While]
c2:22 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
c2:22 [binder, in Undecidability.TM.Combinators.Mirror]
c2:25 [binder, in Undecidability.TM.Combinators.Mirror]
c2:26 [binder, in Undecidability.TM.Combinators.While]
C2:28 [binder, in Complexity.NP.SAT.SAT]
c2:31 [binder, in Undecidability.TM.Combinators.While]
c2:35 [binder, in Undecidability.TM.Combinators.While]
c2:35 [binder, in Undecidability.TM.Combinators.StateWhile]
c2:3615 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
c2:37 [binder, in Undecidability.TM.Combinators.Switch]
c2:39 [binder, in Undecidability.TM.Combinators.Switch]
c2:4 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
c2:48 [binder, in Undecidability.TM.Combinators.StateWhile]
c2:49 [binder, in Undecidability.TM.Combinators.Switch]
c2:54 [binder, in Undecidability.TM.Combinators.StateWhile]
c2:55 [binder, in Undecidability.TM.Lifting.LiftAlphabet]
c2:57 [binder, in Complexity.TM.PrettyBounds.PrettyBounds]
c2:6 [binder, in Undecidability.TM.Compound.Compare]
c2:60 [binder, in Undecidability.TM.Combinators.StateWhile]
c2:64 [binder, in Complexity.NP.SAT.SAT]
c2:66 [binder, in Complexity.TM.PrettyBounds.PrettyBounds]
c2:68 [binder, in Undecidability.TM.Combinators.StateWhile]
c2:7 [binder, in Complexity.TM.PrettyBounds.PrettyBounds]
C2:73 [binder, in Complexity.NP.SAT.SAT]
c2:74 [binder, in Undecidability.TM.Combinators.StateWhile]
c2:75 [binder, in Complexity.TM.PrettyBounds.PrettyBounds]
c2:8 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
c2:82 [binder, in Complexity.TM.PrettyBounds.PrettyBounds]
c2:92 [binder, in Complexity.TM.PrettyBounds.PrettyBounds]
c3:16 [binder, in Undecidability.TM.Combinators.While]
c3:195 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
c3:32 [binder, in Undecidability.TM.Combinators.While]
c3:49 [binder, in Undecidability.TM.Combinators.StateWhile]
c3:5 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
c3:55 [binder, in Undecidability.TM.Combinators.StateWhile]
c3:59 [binder, in Undecidability.TM.Combinators.StateWhile]
c3:69 [binder, in Undecidability.TM.Combinators.StateWhile]
c3:9 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
c4:10 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
c:1 [binder, in Complexity.TM.PrettyBounds.BaseCode]
c:1 [binder, in Complexity.L.TM.TMflatComp]
c:1 [binder, in Complexity.L.Functions.BinNumsSub]
c:1 [binder, in Complexity.L.AbstractMachines.AbstractSubstMachine]
c:1 [binder, in Complexity.TM.PrettyBounds.PrettyBounds]
c:1 [binder, in Complexity.L.Functions.BinNumsAdd]
c:10 [binder, in Complexity.Complexity.ONotation]
c:10 [binder, in Complexity.NP.L.GenNP_is_hard]
c:10 [binder, in Undecidability.TM.Combinators.Mirror]
c:10 [binder, in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisStep]
c:10 [binder, in Undecidability.TM.Combinators.StateWhile]
c:10 [binder, in Undecidability.L.Complexity.GenericNary]
c:10 [binder, in Undecidability.L.TM.TMinL.TMinL_extract]
c:100 [binder, in Complexity.TM.PrettyBounds.BaseCode]
c:100 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c:101 [binder, in Undecidability.TM.Hoare.HoareMult]
c:101 [binder, in Undecidability.TM.Code.BinNumbers.PosAddTM]
c:102 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
C:102 [binder, in Undecidability.Shared.Libs.PSL.Retracts]
c:102 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_base]
c:102 [binder, in Complexity.Complexity.PolyTimeComputable]
c:103 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_base]
c:104 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
c:105 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
C:105 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
c:106 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachine]
c:107 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
c:107 [binder, in Undecidability.TM.Hoare.HoareMult]
c:107 [binder, in Complexity.TM.PrettyBounds.PrettyBounds]
c:108 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c:108 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
C:108 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.CC]
c:109 [binder, in Complexity.TM.PrettyBounds.PrettyBounds]
c:11 [binder, in Undecidability.TM.Combinators.While]
c:11 [binder, in Undecidability.TM.Combinators.Mirror]
c:11 [binder, in Complexity.NP.L.GenNPBool]
c:11 [binder, in Undecidability.L.Datatypes.List.List_fold]
c:110 [binder, in Undecidability.TM.Code.NatTM]
c:112 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c:113 [binder, in Undecidability.TM.Lifting.LiftTapes]
c:113 [binder, in Undecidability.TM.Hoare.HoareMult]
c:114 [binder, in Complexity.TM.PrettyBounds.BaseCode]
C:114 [binder, in Undecidability.Shared.Libs.PSL.Retracts]
c:115 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
c:116 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
c:116 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c:116 [binder, in Undecidability.TM.Code.NatTM]
c:118 [binder, in Complexity.TM.PrettyBounds.UnivBounds]
C:118 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
c:118 [binder, in Undecidability.TM.Hoare.HoareMult]
c:119 [binder, in Complexity.TM.PrettyBounds.BaseCode]
c:119 [binder, in Complexity.TM.PrettyBounds.UnivBounds]
c:119 [binder, in Undecidability.TM.Code.NatTM]
c:12 [binder, in Undecidability.TM.Combinators.While]
c:12 [binder, in Complexity.TM.Code.DecodeList]
C:12 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.BinaryCC]
c:12 [binder, in Complexity.Complexity.ONotationIsAppropriate]
c:12 [binder, in Complexity.L.TM.TMflatten]
c:12 [binder, in Undecidability.TM.Compound.Shift]
c:120 [binder, in Complexity.TM.PrettyBounds.UnivBounds]
c:121 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
C:121 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
c:121 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
c:123 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
c:123 [binder, in Undecidability.TM.Hoare.HoareMult]
c:124 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
c:124 [binder, in Complexity.TM.PrettyBounds.BaseCode]
c:124 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c:124 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
c:124 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
C:124 [binder, in Complexity.NP.Clique.kSAT_to_Clique]
c:125 [binder, in Complexity.TM.PrettyBounds.BaseCode]
C:125 [binder, in Complexity.NP.SAT.SAT_inNP]
C:125 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
c:125 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
c:126 [binder, in Complexity.TM.PrettyBounds.BaseCode]
c:126 [binder, in Undecidability.TM.Code.NatTM]
c:127 [binder, in Complexity.TM.PrettyBounds.BaseCode]
c:127 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
c:128 [binder, in Complexity.TM.PrettyBounds.BaseCode]
c:128 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
C:128 [binder, in Complexity.NP.SAT.SAT_inNP]
c:128 [binder, in Undecidability.TM.Lifting.LiftTapes]
c:128 [binder, in Undecidability.TM.Hoare.HoareMult]
c:129 [binder, in Complexity.TM.PrettyBounds.BaseCode]
C:129 [binder, in Undecidability.Shared.Libs.PSL.Retracts]
c:129 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
c:129 [binder, in Undecidability.TM.Lifting.LiftTapes]
c:13 [binder, in Undecidability.TM.Combinators.While]
c:13 [binder, in Complexity.TM.PrettyBounds.BaseCode]
c:13 [binder, in Complexity.NP.L.GenNP_is_hard]
c:13 [binder, in Undecidability.TM.Code.List.Cons_constant]
c:13 [binder, in Complexity.NP.L.GenNPBool]
C:13 [binder, in Complexity.L.TM.TMflatComp]
C:13 [binder, in Complexity.NP.SAT.SAT_inNP]
c:13 [binder, in Complexity.L.TM.TMflatten]
c:13 [binder, in Complexity.TM.Compound.MoveToSymbol_niceSpec]
C:13 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.Cardinality]
c:13 [binder, in Complexity.NP.L.GenNP]
c:130 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
C:130 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
c:131 [binder, in Complexity.TM.PrettyBounds.UnivBounds]
c:131 [binder, in Complexity.NP.SAT.SAT_inNP]
c:132 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
c:133 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
C:133 [binder, in Undecidability.L.Tactics.Extract]
c:134 [binder, in Complexity.TM.PrettyBounds.UnivBounds]
c:134 [binder, in Undecidability.TM.Hoare.HoareMult]
c:135 [binder, in Complexity.TM.PrettyBounds.BaseCode]
C:136 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
c:137 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
C:137 [binder, in Complexity.NP.SAT.SAT_inNP]
c:138 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c:14 [binder, in Complexity.TM.PrettyBounds.BaseCode]
c:14 [binder, in Complexity.Complexity.ONotation]
c:14 [binder, in Complexity.NP.L.GenNP_is_hard]
c:14 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds_Loop]
c:14 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TM_single]
c:14 [binder, in Undecidability.L.TM.TMEncoding]
c:14 [binder, in Undecidability.L.Complexity.GenericNary]
c:14 [binder, in Complexity.Complexity.Monotonic]
c:14 [binder, in Undecidability.TM.Compound.Shift]
c:140 [binder, in Complexity.TM.PrettyBounds.UnivBounds]
c:140 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
c:140 [binder, in Undecidability.TM.Hoare.HoareMult]
c:142 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c:142 [binder, in Complexity.Complexity.PolyTimeComputable]
c:143 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
c:143 [binder, in Undecidability.TM.Compound.MoveToSymbol]
c:145 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c:145 [binder, in Undecidability.TM.Hoare.HoareMult]
c:146 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
c:146 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
C:147 [binder, in Undecidability.Shared.Libs.PSL.Retracts]
c:149 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c:15 [binder, in Complexity.NP.L.GenNP_is_hard]
C:15 [binder, in Complexity.NP.SAT.kSAT]
C:15 [binder, in Undecidability.L.Tactics.ComputableTactics]
c:150 [binder, in Complexity.TM.PrettyBounds.UnivBounds]
c:152 [binder, in Undecidability.Shared.Libs.DLW.Utils.php]
c:154 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c:155 [binder, in Complexity.TM.PrettyBounds.UnivBounds]
c:158 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
c:159 [binder, in Complexity.TM.PrettyBounds.UnivBounds]
c:16 [binder, in Complexity.NP.L.GenNP_is_hard]
c:16 [binder, in Undecidability.L.AbstractMachines.FlatPro.Programs]
C:16 [binder, in Complexity.NP.SAT.SAT]
c:160 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
c:161 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c:161 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
c:162 [binder, in Undecidability.Shared.Libs.DLW.Utils.php]
c:163 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
c:164 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c:164 [binder, in Complexity.TM.PrettyBounds.UnivBounds]
c:164 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
c:166 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
c:167 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c:167 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
c:167 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
c:169 [binder, in Complexity.TM.PrettyBounds.UnivBounds]
C:17 [binder, in Complexity.NP.SAT.SAT_inNP]
c:17 [binder, in Complexity.NP.L.LMGenNP]
c:17 [binder, in Complexity.Complexity.ONotationIsAppropriate]
c:17 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TM_single]
c:17 [binder, in Complexity.NP.L.GenNP]
c:170 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
c:170 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
c:170 [binder, in Undecidability.Shared.Libs.DLW.Vec.pos]
c:173 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
c:174 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
c:175 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c:179 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
C:179 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
c:18 [binder, in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
c:18 [binder, in Complexity.Complexity.ONotation]
c:18 [binder, in Undecidability.L.Datatypes.List.List_basics]
c:18 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds_Loop]
c:18 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
c:18 [binder, in Complexity.L.AbstractMachines.AbstractSubstMachine]
c:18 [binder, in Undecidability.L.Complexity.GenericNary]
C:18 [binder, in Undecidability.Shared.ListAutomation]
C:18 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.Cardinality]
C:18 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
c:180 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
c:180 [binder, in Undecidability.TM.Compound.MoveToSymbol]
c:183 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c:183 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
C:184 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
c:185 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
C:187 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
C:188 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
c:19 [binder, in Complexity.TM.PrettyBounds.BaseCode]
c:19 [binder, in Undecidability.TM.Combinators.Mirror]
C:19 [binder, in Complexity.L.AbstractMachines.AbstractSubstMachine]
c:190 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
c:191 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
C:192 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
c:193 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
c:194 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
C:196 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
c:198 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
C:198 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
c:2 [binder, in Complexity.NP.L.LMGenNP]
C:2 [binder, in Complexity.L.AbstractMachines.AbstractSubstMachine]
c:20 [binder, in Complexity.TM.PrettyBounds.BaseCode]
c:20 [binder, in Complexity.TM.PrettyBounds.UnivBounds]
c:202 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
c:205 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
C:209 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
c:21 [binder, in Complexity.TM.PrettyBounds.BaseCode]
C:21 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
c:21 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
C:21 [binder, in Complexity.NP.SAT.kSAT]
c:21 [binder, in Complexity.TM.Single.DecodeTapes]
c:210 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
c:216 [binder, in Undecidability.TM.Single.StepTM]
c:216 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
c:22 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds_Loop]
c:22 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
c:22 [binder, in Undecidability.TM.Combinators.Switch]
c:22 [binder, in Complexity.L.TM.TMflatComp]
c:22 [binder, in Complexity.NP.L.LMGenNP]
c:22 [binder, in Complexity.TM.Single.DecodeTapes]
c:22 [binder, in Undecidability.TM.Combinators.StateWhile]
C:22 [binder, in Undecidability.Shared.ListAutomation]
c:22 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.CC]
c:221 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
C:23 [binder, in Complexity.NP.SAT.kSAT]
C:23 [binder, in Undecidability.Shared.Libs.PSL.Inhabited]
c:23 [binder, in Complexity.NP.L.GenNPBool]
c:23 [binder, in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisStep]
c:23 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TM_single]
C:23 [binder, in Undecidability.TM.Code.ChangeAlphabet]
c:231 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
c:232 [binder, in Complexity.L.TM.TMunflatten]
c:239 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
c:24 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds_Loop]
c:24 [binder, in Undecidability.TM.Combinators.Switch]
C:24 [binder, in Complexity.L.AbstractMachines.AbstractSubstMachine]
c:24 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TM_single]
c:24 [binder, in Undecidability.TM.Combinators.StateWhile]
C:24 [binder, in Complexity.NP.SAT.SAT]
c:25 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TM_single]
c:25 [binder, in Complexity.TM.PrettyBounds.PrettyBounds]
c:250 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
C:250 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
c:259 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
c:26 [binder, in Undecidability.TM.Combinators.Switch]
C:26 [binder, in Complexity.NP.SAT.kSAT]
C:26 [binder, in Undecidability.Shared.Libs.PSL.Inhabited]
c:26 [binder, in Complexity.L.TM.TMflatComp]
C:26 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
c:26 [binder, in Undecidability.TM.Combinators.StateWhile]
c:26 [binder, in Undecidability.TM.Code.BinNumbers.PosAddTM]
c:260 [binder, in Undecidability.TM.Util.TM_facts]
c:262 [binder, in Undecidability.TM.Hoare.HoareExamples]
c:265 [binder, in Undecidability.TM.Util.TM_facts]
c:2659 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
c:268 [binder, in Undecidability.TM.Single.StepTM]
c:2680 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
c:269 [binder, in Undecidability.TM.Hoare.HoareExamples]
c:2693 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
c:27 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
c:27 [binder, in Undecidability.TM.Code.BinNumbers.PosAddTM]
c:273 [binder, in Undecidability.TM.Hoare.HoareExamples]
c:273 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
c:276 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
c:276 [binder, in Undecidability.TM.Hoare.HoareExamples]
c:2782 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
c:2783 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
c:28 [binder, in Undecidability.TM.Combinators.Switch]
c:28 [binder, in Complexity.TM.Single.EncodeTapesInvariants]
c:28 [binder, in Complexity.NP.L.GenNPBool]
c:28 [binder, in Complexity.L.TM.TMflatComp]
c:280 [binder, in Undecidability.TM.Hoare.HoareExamples]
c:281 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
c:282 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
c:285 [binder, in Undecidability.TM.Hoare.HoareExamples]
c:286 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
c:29 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
c:29 [binder, in Undecidability.TM.Combinators.Switch]
c:29 [binder, in Undecidability.TM.Combinators.StateWhile]
c:29 [binder, in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
c:29 [binder, in Undecidability.TM.Code.BinNumbers.PosAddTM]
c:29 [binder, in Complexity.TM.PrettyBounds.PrettyBounds]
c:290 [binder, in Undecidability.TM.Hoare.HoareExamples]
c:291 [binder, in Undecidability.TM.Hoare.HoareExamples]
c:292 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
c:2935 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
c:2937 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
c:2939 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
c:2941 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
c:2943 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
c:2945 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
c:2947 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
c:2949 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
c:295 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
c:295 [binder, in Undecidability.TM.Hoare.HoareExamples]
c:2958 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
c:2961 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
c:2964 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
c:2967 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
c:2972 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
c:2975 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
c:298 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
c:2980 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
c:2983 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
c:2987 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
c:2997 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
c:3 [binder, in Complexity.Complexity.ONotation]
c:3 [binder, in Complexity.L.TM.TMflatComp]
C:3 [binder, in Complexity.NP.SAT.SAT_inNP]
c:3 [binder, in Complexity.Complexity.ONotationIsAppropriate]
c:3 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.SingleTMGenNP]
C:3 [binder, in Complexity.NP.Clique.kSAT_to_Clique]
c:30 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds_Loop]
c:30 [binder, in Complexity.TM.PrettyBounds.UnivBounds]
c:30 [binder, in Undecidability.TM.Combinators.Switch]
c:30 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
c:30 [binder, in Complexity.L.TM.TMflatComp]
c:30 [binder, in Undecidability.L.Prelim.MoreList]
c:300 [binder, in Undecidability.TM.Hoare.HoareExamples]
c:3000 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
c:3003 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
c:3008 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
c:3011 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
c:3016 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
c:3019 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
c:3023 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
c:303 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
c:3033 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
c:305 [binder, in Undecidability.TM.Hoare.HoareExamples]
c:3050 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
c:3059 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
c:3065 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
c:3068 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
c:309 [binder, in Undecidability.TM.Hoare.HoareExamples]
c:31 [binder, in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
c:31 [binder, in Complexity.TM.PrettyBounds.BaseCode]
c:31 [binder, in Undecidability.TM.Combinators.Switch]
C:31 [binder, in Complexity.NP.SAT.SAT]
c:313 [binder, in Undecidability.TM.Hoare.HoareExamples]
c:3135 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
c:317 [binder, in Undecidability.TM.Hoare.HoareExamples]
c:32 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
c:32 [binder, in Complexity.NP.L.GenNPBool]
c:32 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
c:322 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
c:322 [binder, in Undecidability.TM.Hoare.HoareExamples]
c:324 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
c:327 [binder, in Undecidability.TM.Hoare.HoareExamples]
c:33 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
c:33 [binder, in Undecidability.Shared.Libs.PSL.Retracts]
c:33 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
c:331 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
c:331 [binder, in Undecidability.TM.Hoare.HoareExamples]
c:337 [binder, in Undecidability.TM.Hoare.HoareExamples]
c:338 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
c:34 [binder, in Undecidability.TM.TM]
c:34 [binder, in Undecidability.L.Prelim.MoreList]
c:342 [binder, in Undecidability.TM.Hoare.HoareExamples]
c:345 [binder, in Undecidability.TM.Hoare.HoareExamples]
c:35 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
C:35 [binder, in Undecidability.Shared.Libs.PSL.Lists.Removal]
c:35 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
c:35 [binder, in Complexity.L.TM.TMflatComp]
c:35 [binder, in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
c:350 [binder, in Undecidability.TM.Hoare.HoareExamples]
c:356 [binder, in Undecidability.TM.Hoare.HoareExamples]
c:36 [binder, in Complexity.TM.PrettyBounds.BaseCode]
c:36 [binder, in Complexity.Complexity.ONotation]
c:36 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
c:36 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
c:362 [binder, in Undecidability.TM.Hoare.HoareExamples]
c:367 [binder, in Undecidability.TM.Hoare.HoareExamples]
c:37 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds_Loop]
C:37 [binder, in Undecidability.L.Datatypes.LVector]
c:37 [binder, in Complexity.NP.L.GenNPBool]
c:37 [binder, in Undecidability.Shared.Libs.PSL.Vectors.VectorDupfree]
c:37 [binder, in Complexity.TM.PrettyBounds.PrettyBounds]
c:372 [binder, in Undecidability.TM.Hoare.HoareExamples]
c:377 [binder, in Undecidability.TM.Hoare.HoareExamples]
c:38 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
c:38 [binder, in Undecidability.L.Complexity.UpToC]
c:383 [binder, in Undecidability.TM.Hoare.HoareExamples]
c:389 [binder, in Undecidability.TM.Hoare.HoareExamples]
c:39 [binder, in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
c:39 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
c:39 [binder, in Undecidability.L.Prelim.MoreList]
c:392 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
c:394 [binder, in Undecidability.TM.Hoare.HoareExamples]
c:395 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
C:396 [binder, in Undecidability.TM.Util.TM_facts]
c:4 [binder, in Complexity.NP.SAT.CookLevin]
c:4 [binder, in Complexity.NP.L.GenNP_is_hard]
c:4 [binder, in Complexity.L.TM.TMflatEnc]
c:4 [binder, in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisUnfoldClos]
c:4 [binder, in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisStep]
c:4 [binder, in Undecidability.L.TM.TMinL.TMinL_extract]
c:4 [binder, in Complexity.Complexity.Monotonic]
c:4 [binder, in Complexity.TM.PrettyBounds.PrettyBounds]
c:40 [binder, in Undecidability.L.Complexity.UpToCNary]
c:40 [binder, in Complexity.TM.PrettyBounds.UnivBounds]
C:40 [binder, in Undecidability.L.Tactics.GenEncode]
c:40 [binder, in Complexity.TM.PrettyBounds.PrettyBounds]
c:400 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
c:405 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
c:409 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
c:41 [binder, in Complexity.TM.PrettyBounds.BaseCode]
c:41 [binder, in Complexity.TM.Single.EncodeTapesInvariants]
c:41 [binder, in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
c:41 [binder, in Undecidability.TM.Code.BinNumbers.PosShiftTM]
c:416 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
c:42 [binder, in Complexity.Complexity.ONotation]
c:42 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
c:42 [binder, in Undecidability.TM.Combinators.StateWhile]
c:43 [binder, in Undecidability.L.Tactics.LClos]
c:43 [binder, in Undecidability.L.Complexity.UpToC]
c:43 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TM_single]
c:43 [binder, in Undecidability.TM.SBTM]
c:43 [binder, in Complexity.L.TM.TMflatFun]
c:43 [binder, in Complexity.TM.PrettyBounds.PrettyBounds]
c:43 [binder, in Undecidability.L.Prelim.MoreList]
c:433 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
c:435 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
c:44 [binder, in Undecidability.TM.Combinators.StateWhile]
C:44 [binder, in Complexity.NP.SAT.SAT]
c:45 [binder, in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
c:45 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_quotient]
c:45 [binder, in Undecidability.L.Complexity.UpToCNary]
C:45 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
c:45 [binder, in Complexity.L.TM.TMflatComp]
c:45 [binder, in Complexity.NP.SAT.FSAT.FSAT]
c:458 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
c:46 [binder, in Complexity.TM.PrettyBounds.BaseCode]
C:46 [binder, in Undecidability.Shared.ListAutomation]
c:46 [binder, in Complexity.TM.PrettyBounds.PrettyBounds]
c:466 [binder, in Undecidability.TM.Single.StepTM]
c:47 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
c:47 [binder, in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
C:47 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
c:47 [binder, in Complexity.L.AbstractMachines.FlatPro.Computable.Compile]
c:48 [binder, in Undecidability.Shared.Libs.DLW.Utils.prime]
c:48 [binder, in Undecidability.TM.Lifting.LiftAlphabet]
c:48 [binder, in Undecidability.L.Complexity.UpToC]
c:482 [binder, in Undecidability.TM.Single.StepTM]
c:49 [binder, in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
c:49 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
c:49 [binder, in Complexity.L.AbstractMachines.FlatPro.Computable.Compile]
C:5 [binder, in Complexity.NP.SAT.kSAT]
c:5 [binder, in Complexity.NP.L.GenNPBool]
c:5 [binder, in Undecidability.L.TM.TMinL.TMinL_extract]
C:5 [binder, in Complexity.NP.SAT.SAT]
c:50 [binder, in Undecidability.L.Complexity.UpToCNary]
c:50 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_upto]
c:51 [binder, in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
c:51 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_upto]
c:51 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
c:51 [binder, in Complexity.TM.PrettyBounds.PrettyBounds]
c:52 [binder, in Undecidability.TM.Compound.Shift]
c:52 [binder, in Complexity.NP.SAT.SAT]
c:53 [binder, in Undecidability.TM.Lifting.LiftAlphabet]
C:53 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
c:54 [binder, in Complexity.Complexity.ONotation]
C:54 [binder, in Complexity.TM.PrettyBounds.BaseCodeSpace]
c:54 [binder, in Complexity.L.TM.TMflatFun]
C:54 [binder, in Complexity.NP.Clique.kSAT_to_Clique]
c:54 [binder, in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
c:55 [binder, in Complexity.TM.PrettyBounds.BaseCode]
C:55 [binder, in Complexity.NP.SAT.SAT_inNP]
c:56 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
c:56 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
c:568 [binder, in Complexity.NP.TM.LM_to_mTM]
c:57 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_base]
c:57 [binder, in Complexity.L.TM.TMflatFun]
c:58 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
c:58 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
c:58 [binder, in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
c:58 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
c:58 [binder, in Complexity.NP.SAT.SAT]
c:59 [binder, in Complexity.TM.PrettyBounds.UnivBounds]
c:59 [binder, in Undecidability.L.Tactics.Reflection]
c:6 [binder, in Complexity.NP.L.GenNP_is_hard]
c:6 [binder, in Complexity.TM.Code.DecodeBool]
c:6 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
c:6 [binder, in Undecidability.L.TM.TMinL.TMinL_extract]
c:60 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
C:60 [binder, in Complexity.NP.SAT.SAT_inNP]
c:60 [binder, in Complexity.TM.Single.DecodeTape]
c:61 [binder, in Undecidability.TM.Code.NatTM]
c:61 [binder, in Undecidability.TM.Univ.LowLevel]
c:61 [binder, in Complexity.TM.Single.DecodeTape]
c:61 [binder, in Complexity.NP.SAT.SAT]
c:62 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
c:62 [binder, in Undecidability.L.Complexity.UpToC]
c:62 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_base]
c:62 [binder, in Complexity.TM.Single.DecodeTape]
c:63 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
C:63 [binder, in Undecidability.TM.Util.TM_facts]
c:64 [binder, in Undecidability.L.Complexity.UpToCNary]
c:64 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
C:64 [binder, in Complexity.NP.SAT.SAT_inNP]
c:64 [binder, in Complexity.L.TM.TMflatFun]
c:64 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
c:65 [binder, in Complexity.Complexity.ONotation]
c:66 [binder, in Complexity.Libs.CookPrelim.PolyBounds]
c:66 [binder, in Complexity.NP.TM.M_multi2mono]
c:67 [binder, in Undecidability.L.Complexity.UpToC]
c:68 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
c:68 [binder, in Complexity.TM.PrettyBounds.UnivBounds]
C:68 [binder, in Complexity.NP.SAT.SAT_inNP]
c:68 [binder, in Undecidability.TM.Univ.LowLevel]
c:68 [binder, in Complexity.L.TM.TMflat]
c:68 [binder, in Complexity.NP.SAT.SAT]
c:69 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
c:69 [binder, in Undecidability.L.Complexity.UpToCNary]
c:7 [binder, in Complexity.TM.PrettyBounds.BaseCode]
c:7 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_quotient]
c:7 [binder, in Complexity.NP.L.GenNPBool]
c:7 [binder, in Complexity.NP.L.GenNP]
c:70 [binder, in Complexity.TM.Code.Decode]
c:70 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
c:70 [binder, in Complexity.NP.TM.M_multi2mono]
c:70 [binder, in Undecidability.TM.Hoare.HoareMult]
C:70 [binder, in Complexity.NP.SAT.SAT]
c:71 [binder, in Complexity.TM.PrettyBounds.BaseCode]
c:71 [binder, in Complexity.TM.Code.Decode]
c:71 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
c:72 [binder, in Undecidability.L.Functions.FinTypeLookup]
c:73 [binder, in Complexity.TM.PrettyBounds.BaseCode]
c:73 [binder, in Undecidability.TM.Code.NatTM]
c:73 [binder, in Undecidability.L.Functions.FinTypeLookup]
c:74 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
c:74 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
C:74 [binder, in Complexity.NP.SAT.SAT_inNP]
c:74 [binder, in Undecidability.TM.Hoare.HoareMult]
c:74 [binder, in Undecidability.L.Functions.FinTypeLookup]
c:76 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c:76 [binder, in Complexity.NP.SAT.SAT_inNP]
c:76 [binder, in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
c:77 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
c:77 [binder, in Complexity.TM.PrettyBounds.UnivBounds]
c:77 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
c:77 [binder, in Complexity.NP.SAT.SAT_inNP]
c:78 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
C:78 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
c:78 [binder, in Complexity.NP.SAT.SAT_inNP]
c:78 [binder, in Complexity.Complexity.UpToCPoly]
c:78 [binder, in Complexity.L.TM.TMflatFun]
c:78 [binder, in Undecidability.TM.Hoare.HoareMult]
c:79 [binder, in Complexity.TM.PrettyBounds.BaseCode]
c:79 [binder, in Complexity.NP.SAT.SAT_inNP]
c:8 [binder, in Complexity.TM.PrettyBounds.BaseCode]
c:8 [binder, in Complexity.NP.L.GenNP_is_hard]
C:8 [binder, in Complexity.NP.SAT.kSAT]
c:8 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.BinaryCC]
C:8 [binder, in Complexity.NP.SAT.SAT_inNP]
c:8 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.SingleTMGenNP]
C:8 [binder, in Complexity.NP.Clique.kSAT_to_Clique]
c:80 [binder, in Complexity.TM.PrettyBounds.BaseCode]
c:80 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
c:80 [binder, in Undecidability.TM.Code.NatTM]
c:80 [binder, in Complexity.NP.SAT.SAT_inNP]
c:80 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_base]
c:80 [binder, in Undecidability.L.Complexity.GenericNary]
c:81 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c:81 [binder, in Undecidability.TM.Code.BinNumbers.PosCompareTM]
c:81 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
c:81 [binder, in Complexity.L.TM.TMflatComp]
c:81 [binder, in Complexity.NP.SAT.SAT_inNP]
c:82 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_base]
c:83 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
c:83 [binder, in Complexity.TM.PrettyBounds.BaseCode]
c:83 [binder, in Undecidability.TM.Hoare.HoareMult]
c:84 [binder, in Complexity.L.TM.TMflatComp]
c:85 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
C:85 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
c:86 [binder, in Complexity.TM.PrettyBounds.UnivBounds]
c:86 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
c:87 [binder, in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
c:88 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
c:88 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
c:88 [binder, in Undecidability.TM.Hoare.HoareMult]
c:89 [binder, in Complexity.TM.PrettyBounds.BaseCode]
c:89 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c:89 [binder, in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
c:9 [binder, in Complexity.TM.PrettyBounds.UnivBounds]
c:9 [binder, in Undecidability.L.Prelim.MoreBase]
c:9 [binder, in Complexity.NP.L.GenNPBool]
c:9 [binder, in Complexity.NP.L.LMGenNP]
c:9 [binder, in Complexity.NP.SAT.CookLevin.Reductions.TMGenNP_fixed_singleTapeTM_to_FlatFunSingleTMGenNP]
c:9 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TM_single]
c:9 [binder, in Undecidability.L.TM.TMinL.TMinL_extract]
c:9 [binder, in Undecidability.TM.Compound.Shift]
C:9 [binder, in Complexity.NP.SAT.SAT]
c:90 [binder, in Complexity.TM.PrettyBounds.BaseCode]
c:90 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
c:90 [binder, in Complexity.NP.Clique.kSAT_to_Clique]
c:91 [binder, in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
c:92 [binder, in Complexity.TM.Single.DecodeTape]
c:93 [binder, in Complexity.TM.PrettyBounds.BaseCode]
C:93 [binder, in Undecidability.Shared.Libs.PSL.Retracts]
c:93 [binder, in Undecidability.TM.Hoare.HoareMult]
c:94 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
c:95 [binder, in Complexity.TM.PrettyBounds.BaseCode]
c:95 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c:96 [binder, in Undecidability.TM.Hoare.HoareMult]

D

dbbC [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
dclApp [constructor, in Undecidability.L.Util.L_facts]
dcllam [constructor, in Undecidability.L.Util.L_facts]
dclvar [constructor, in Undecidability.L.Util.L_facts]
Dec [definition, in Undecidability.Shared.Libs.PSL.EqDec]
dec [definition, in Undecidability.Shared.Libs.PSL.EqDec]
dec [abbreviation, in Undecidability.Shared.Libs.DLW.Utils.quotient]
Dec [definition, in Undecidability.Shared.Dec]
dec [definition, in Undecidability.Shared.Dec]
Dec [library]
Decb [abbreviation, in Undecidability.Shared.Libs.PSL.EqDec]
decibable_PER_fp_quotient [lemma, in Undecidability.Shared.Libs.DLW.Utils.fin_quotient]
Decidability [library]
DecidabilityFacts [library]
decidable [definition, in Undecidability.Synthetic.Definitions]
decidable_EQUIV_fin_quotient [lemma, in Undecidability.Shared.Libs.DLW.Utils.fin_quotient]
decidable_complement_semi_decidable [lemma, in Undecidability.Synthetic.SemiDecidabilityFacts]
decidable_semi_decidable [lemma, in Undecidability.Synthetic.SemiDecidabilityFacts]
decidable_sinc [lemma, in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
decidable_sinc.f_P [variable, in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
decidable_sinc.f_select [variable, in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
decidable_sinc.f_sinc [variable, in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
decidable_sinc.f [variable, in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
decidable_sinc.next [variable, in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
decidable_sinc.Pdec [variable, in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
decidable_sinc.Punb [variable, in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
decidable_sinc.P [variable, in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
decidable_sinc [section, in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
decidable_iff [lemma, in Undecidability.Synthetic.DecidabilityFacts]
decider [definition, in Undecidability.Synthetic.Definitions]
decides [definition, in Undecidability.L.Computability.Decidability]
decInTime [record, in Complexity.Complexity.Definitions]
decInTime_equiv [lemma, in Complexity.Complexity.Definitions]
decInTime_intro [constructor, in Complexity.Complexity.Definitions]
deClos [definition, in Undecidability.L.Tactics.LClos]
deClos_correct [lemma, in Undecidability.L.Tactics.LClos]
deClos_validEnv [lemma, in Undecidability.L.Tactics.LClos]
deClos_valComp [lemma, in Undecidability.L.Tactics.LClos]
decodable [record, in Undecidability.L.Functions.Decoding]
decode [projection, in Undecidability.L.Functions.Decoding]
Decode [library]
DecodeBool [library]
DecodeList [library]
DecodeTape [library]
DecodeTapes [library]
decode_tape [instance, in Complexity.L.TM.TapeDecode]
decode_unit [instance, in Undecidability.L.Functions.Decoding]
decode_bool [instance, in Undecidability.L.Functions.Decoding]
decode_option [instance, in Undecidability.L.Functions.Decoding]
decode_sum [instance, in Undecidability.L.Functions.Decoding]
decode_prod [instance, in Undecidability.L.Functions.Decoding]
decode_list [instance, in Undecidability.L.Functions.Decoding]
decode_term [instance, in Undecidability.L.Functions.Decoding]
decode_nat [instance, in Undecidability.L.Functions.Decoding]
decode_correct2 [projection, in Undecidability.L.Functions.Decoding]
decode_correct [projection, in Undecidability.L.Functions.Decoding]
Decoding [library]
decompile [definition, in Undecidability.L.AbstractMachines.FlatPro.Programs]
Decompile [library]
decompile_resSize [lemma, in Undecidability.L.AbstractMachines.FlatPro.Programs]
decompile_correct [lemma, in Undecidability.L.AbstractMachines.FlatPro.Programs]
decompile_correct' [lemma, in Undecidability.L.AbstractMachines.FlatPro.Programs]
decP:340 [binder, in Undecidability.TM.Hoare.HoareRegister]
decX:113 [binder, in Undecidability.TM.Code.Code]
decX:138 [binder, in Undecidability.TM.Code.Code]
decX:168 [binder, in Undecidability.TM.Code.Code]
decX:68 [binder, in Undecidability.TM.Code.Code]
decY:114 [binder, in Undecidability.TM.Code.Code]
decY:69 [binder, in Undecidability.TM.Code.Code]
dec_transfer [lemma, in Undecidability.Shared.Libs.PSL.EqDec]
dec_DM_impl [lemma, in Undecidability.Shared.Libs.PSL.EqDec]
dec_DM_and [lemma, in Undecidability.Shared.Libs.PSL.EqDec]
dec_DN [lemma, in Undecidability.Shared.Libs.PSL.EqDec]
Dec_false' [lemma, in Undecidability.Shared.Libs.PSL.EqDec]
Dec_true' [lemma, in Undecidability.Shared.Libs.PSL.EqDec]
Dec_false [lemma, in Undecidability.Shared.Libs.PSL.EqDec]
Dec_true [lemma, in Undecidability.Shared.Libs.PSL.EqDec]
Dec_auto_not [lemma, in Undecidability.Shared.Libs.PSL.EqDec]
Dec_auto [lemma, in Undecidability.Shared.Libs.PSL.EqDec]
Dec_reflect_eq [lemma, in Undecidability.Shared.Libs.PSL.EqDec]
Dec_reflect [lemma, in Undecidability.Shared.Libs.PSL.EqDec]
dec_count_enum' [lemma, in Undecidability.Synthetic.EnumerabilityFacts]
dec_count_enum [lemma, in Undecidability.Synthetic.EnumerabilityFacts]
dec_reflect_remove [lemma, in Undecidability.L.Functions.EqBool]
dec_ex_fin [instance, in Undecidability.TM.Hoare.HoareRegister]
dec_ldec [lemma, in Undecidability.L.Computability.Decidability]
dec_acc [lemma, in Undecidability.L.Computability.Acceptability]
dec_lacc [lemma, in Undecidability.L.Computability.Acceptability]
dec_disj [lemma, in Undecidability.Synthetic.DecidabilityFacts]
dec_conj [lemma, in Undecidability.Synthetic.DecidabilityFacts]
dec_compl [lemma, in Undecidability.Synthetic.DecidabilityFacts]
dec_decidable' [lemma, in Undecidability.Synthetic.DecidabilityFacts]
dec_transfer [lemma, in Undecidability.Shared.Dec]
dec_DM_impl [lemma, in Undecidability.Shared.Dec]
dec_DM_and [lemma, in Undecidability.Shared.Dec]
dec_DN [lemma, in Undecidability.Shared.Dec]
Dec_false [lemma, in Undecidability.Shared.Dec]
Dec_true [lemma, in Undecidability.Shared.Dec]
Dec_auto [lemma, in Undecidability.Shared.Dec]
Dec_reflect [lemma, in Undecidability.Shared.Dec]
dec_P [lemma, in Undecidability.L.Computability.MuRec]
dec_enc [lemma, in Undecidability.L.Datatypes.LNat]
dec_red [lemma, in Undecidability.Synthetic.ReducibilityFacts]
dec2bool [definition, in Undecidability.Shared.Libs.PSL.EqDec]
dec2bool [definition, in Undecidability.Shared.Dec]
dedup [definition, in Complexity.NP.SAT.SAT_inNP]
def [definition, in Complexity.L.TM.TMunflatten]
default [projection, in Undecidability.Shared.Libs.PSL.Inhabited]
defExPTCC [section, in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
defExPTCC.finalCondition [variable, in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
defExPTCC.initCond [variable, in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
defExPTCC.l [variable, in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
defExPTCC.p [variable, in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
defExPTCC.Sigma [variable, in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
defExPTCC.t [variable, in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
defFin [definition, in Complexity.L.TM.TMunflatten]
Definitions [library]
Definitions [library]
def':120 [binder, in Undecidability.L.Tactics.Extract]
def':147 [binder, in Undecidability.L.Tactics.Extract]
def2:151 [binder, in Undecidability.L.Tactics.Extract]
def:100 [binder, in Undecidability.TM.Util.Prelim]
def:121 [binder, in Undecidability.L.Tactics.Extract]
def:152 [binder, in Undecidability.L.Tactics.Extract]
def:158 [binder, in Undecidability.L.Tactics.Extract]
def:26 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.FiniteFunction]
def:33 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.FiniteFunction]
def:332 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
def:39 [binder, in Undecidability.L.Functions.FinTypeLookup]
def:45 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.FiniteFunction]
def:51 [binder, in Complexity.NP.Clique.kSAT_to_Clique]
def:51 [binder, in Undecidability.L.Functions.FinTypeLookup]
def:55 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.FiniteFunction]
def:61 [binder, in Undecidability.L.Functions.FinTypeLookup]
def:64 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.FiniteFunction]
def:85 [binder, in Undecidability.TM.Lifting.LiftTapes]
def:88 [binder, in Complexity.L.TM.TMunflatten]
def:89 [binder, in Undecidability.TM.Lifting.LiftTapes]
delim [inductive, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
delimC [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
delimC_reprEl [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
delim_finTypeC [instance, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
delim_eqTypeC [instance, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
demo [section, in Undecidability.L.Tactics.ComputableDemo]
demo.PaperExample [section, in Undecidability.L.Tactics.ComputableDemo]
denoteComp [definition, in Undecidability.L.Tactics.Reflection]
denoteTerm [definition, in Undecidability.L.Tactics.Reflection]
denoteTerm_correct [lemma, in Undecidability.L.Tactics.Reflection]
DepPairs [library]
depth [definition, in Complexity.L.AbstractMachines.UnfoldHeap]
destruct_vector_cons [lemma, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
destruct_vector_nil [lemma, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
destruct_tapes1 [lemma, in Undecidability.TM.Single.StepTM]
destruct_vector1 [lemma, in Undecidability.TM.PrettyBounds.SizeBounds]
devil:215 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
devil:226 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
Dfin:3146 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Dflat:3150 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
diamond [definition, in Undecidability.L.Prelim.ARS]
diamond_to_confluent [lemma, in Undecidability.L.Prelim.ARS]
diamond_to_semi_confluent [lemma, in Undecidability.L.Prelim.ARS]
dir:2010 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
dir:2042 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
dir:2074 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
discrete [definition, in Undecidability.Synthetic.DecidabilityFacts]
discrete_list [lemma, in Undecidability.Synthetic.DecidabilityFacts]
discrete_option [lemma, in Undecidability.Synthetic.DecidabilityFacts]
discrete_sum [lemma, in Undecidability.Synthetic.DecidabilityFacts]
discrete_prod [lemma, in Undecidability.Synthetic.DecidabilityFacts]
discrete_nat_nat [lemma, in Undecidability.Synthetic.DecidabilityFacts]
discrete_nat [lemma, in Undecidability.Synthetic.DecidabilityFacts]
discrete_bool [lemma, in Undecidability.Synthetic.DecidabilityFacts]
discrete_iff [lemma, in Undecidability.Synthetic.DecidabilityFacts]
disj [definition, in Undecidability.L.Computability.Decidability]
disjoint [definition, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
disjoint_symm [lemma, in Undecidability.L.Computability.Enum]
disjoint_app [lemma, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
disjoint_cons [lemma, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
disjoint_nil' [lemma, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
disjoint_nil [lemma, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
disjoint_incl [lemma, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
disjoint_symm [lemma, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
disjoint_forall [lemma, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
disjoint_concat [lemma, in Undecidability.Shared.Libs.PSL.FiniteTypes.Cardinality]
div [definition, in Undecidability.Shared.Libs.DLW.Utils.gcd]
Diverge [definition, in Undecidability.TM.Compound.Multi]
Diverge [section, in Undecidability.TM.Compound.Multi]
Diverge_Realise [lemma, in Undecidability.TM.Compound.Multi]
Diverge_Rel [definition, in Undecidability.TM.Compound.Multi]
Diverge.n [variable, in Undecidability.TM.Compound.Multi]
Diverge.sig [variable, in Undecidability.TM.Compound.Multi]
divides [section, in Undecidability.Shared.Libs.DLW.Utils.gcd]
divides [definition, in Undecidability.Shared.Libs.DLW.Utils.gcd]
divides_bool_spec' [lemma, in Undecidability.Shared.Libs.DLW.Utils.prime]
divides_bool_spec [lemma, in Undecidability.Shared.Libs.DLW.Utils.prime]
divides_bool [definition, in Undecidability.Shared.Libs.DLW.Utils.prime]
divides_fact [lemma, in Undecidability.Shared.Libs.DLW.Utils.binomial]
divides_fact_S [lemma, in Undecidability.Shared.Libs.DLW.Utils.binomial]
divides_n_fact_n [lemma, in Undecidability.Shared.Libs.DLW.Utils.binomial]
divides_rem_congr [lemma, in Undecidability.Shared.Libs.DLW.Utils.gcd]
divides_rem_rem [lemma, in Undecidability.Shared.Libs.DLW.Utils.gcd]
divides_dec [lemma, in Undecidability.Shared.Libs.DLW.Utils.gcd]
divides_rem_eq [lemma, in Undecidability.Shared.Libs.DLW.Utils.gcd]
divides_div [lemma, in Undecidability.Shared.Libs.DLW.Utils.gcd]
divides_is_gcd [lemma, in Undecidability.Shared.Libs.DLW.Utils.gcd]
divides_mult_inv_l [lemma, in Undecidability.Shared.Libs.DLW.Utils.gcd]
divides_fact [lemma, in Undecidability.Shared.Libs.DLW.Utils.gcd]
divides_mult_inv [lemma, in Undecidability.Shared.Libs.DLW.Utils.gcd]
divides_le [lemma, in Undecidability.Shared.Libs.DLW.Utils.gcd]
divides_plus_inv [lemma, in Undecidability.Shared.Libs.DLW.Utils.gcd]
divides_plus [lemma, in Undecidability.Shared.Libs.DLW.Utils.gcd]
divides_minus [lemma, in Undecidability.Shared.Libs.DLW.Utils.gcd]
divides_mult_compat [lemma, in Undecidability.Shared.Libs.DLW.Utils.gcd]
divides_mult_r [lemma, in Undecidability.Shared.Libs.DLW.Utils.gcd]
divides_mult [lemma, in Undecidability.Shared.Libs.DLW.Utils.gcd]
divides_2_inv [lemma, in Undecidability.Shared.Libs.DLW.Utils.gcd]
divides_1_inv [lemma, in Undecidability.Shared.Libs.DLW.Utils.gcd]
divides_1 [lemma, in Undecidability.Shared.Libs.DLW.Utils.gcd]
divides_0_inv [lemma, in Undecidability.Shared.Libs.DLW.Utils.gcd]
divides_0 [lemma, in Undecidability.Shared.Libs.DLW.Utils.gcd]
divides_trans [lemma, in Undecidability.Shared.Libs.DLW.Utils.gcd]
divides_anti [lemma, in Undecidability.Shared.Libs.DLW.Utils.gcd]
divides_refl [lemma, in Undecidability.Shared.Libs.DLW.Utils.gcd]
_ div _ [notation, in Undecidability.Shared.Libs.DLW.Utils.gcd]
division [section, in Undecidability.Shared.Libs.DLW.Utils.gcd]
division_by_even [lemma, in Undecidability.Shared.Libs.DLW.Utils.gcd]
divmod_time [definition, in Undecidability.L.Datatypes.LNat]
div_2_bool2nat [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
div_2_fix_2 [lemma, in Undecidability.Shared.Libs.DLW.Utils.gcd]
div_2_fix_1 [lemma, in Undecidability.Shared.Libs.DLW.Utils.gcd]
div_2_fix_0 [lemma, in Undecidability.Shared.Libs.DLW.Utils.gcd]
div_by_p_lt [lemma, in Undecidability.Shared.Libs.DLW.Utils.gcd]
div_ge_1 [lemma, in Undecidability.Shared.Libs.DLW.Utils.gcd]
div_of_0 [lemma, in Undecidability.Shared.Libs.DLW.Utils.gcd]
div_eq_0 [lemma, in Undecidability.Shared.Libs.DLW.Utils.gcd]
div_prop [lemma, in Undecidability.Shared.Libs.DLW.Utils.gcd]
div_rem_uniq [lemma, in Undecidability.Shared.Libs.DLW.Utils.gcd]
div_rem_spec2 [lemma, in Undecidability.Shared.Libs.DLW.Utils.gcd]
div_rem_spec1 [lemma, in Undecidability.Shared.Libs.DLW.Utils.gcd]
div_full [lemma, in Undecidability.Shared.Libs.DLW.Utils.gcd]
div2 [definition, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
div2_2p0 [definition, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
div2_2p1 [definition, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
div2_spec [lemma, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
DM_exists [lemma, in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
DM_notAll [lemma, in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
DM_exists [lemma, in Undecidability.Shared.Libs.PSL.Prelim]
DM_or [lemma, in Undecidability.Shared.Libs.PSL.Prelim]
DoAct [definition, in Undecidability.TM.Basic.Mono]
DoAct [section, in Undecidability.TM.Basic.Mono]
doAct [definition, in Undecidability.TM.Util.TM_facts]
DoAction [definition, in Undecidability.TM.Single.StepTM]
DoAction [definition, in Undecidability.TM.Univ.LowLevel]
DoActions [definition, in Undecidability.TM.Single.StepTM]
DoActions_steps_nice [lemma, in Complexity.TM.PrettyBounds.M2MBounds]
DoActions_Loop_steps_cons_nice [lemma, in Complexity.TM.PrettyBounds.M2MBounds]
DoActions_Loop_steps_cons_asym_bounded [lemma, in Complexity.TM.PrettyBounds.M2MBounds]
DoActions_Loop_steps_cons_asym_bounded' [lemma, in Complexity.TM.PrettyBounds.M2MBounds]
DoActions_Loop_steps_cons_asym_monotone [lemma, in Complexity.TM.PrettyBounds.M2MBounds]
DoActions_Loop_steps_cons_asym_bounded'' [lemma, in Complexity.TM.PrettyBounds.M2MBounds]
DoActions_Loop_steps_cons_asym2_bounded [lemma, in Complexity.TM.PrettyBounds.M2MBounds]
DoActions_Loop_steps_cons_nice'' [lemma, in Complexity.TM.PrettyBounds.M2MBounds]
DoActions_Loop_steps_cons_asym2 [definition, in Complexity.TM.PrettyBounds.M2MBounds]
DoActions_Loop_steps_cons_asym [definition, in Complexity.TM.PrettyBounds.M2MBounds]
DoActions_Step_steps_cons_nice [lemma, in Complexity.TM.PrettyBounds.M2MBounds]
DoActions_Step_steps_cons_nice' [lemma, in Complexity.TM.PrettyBounds.M2MBounds]
DoActions_Step_steps_cons_nice'' [lemma, in Complexity.TM.PrettyBounds.M2MBounds]
DoActions_Terminates [lemma, in Undecidability.TM.Single.StepTM]
DoActions_T [definition, in Undecidability.TM.Single.StepTM]
DoActions_steps [definition, in Undecidability.TM.Single.StepTM]
DoActions_Realise [lemma, in Undecidability.TM.Single.StepTM]
DoActions_Rel [definition, in Undecidability.TM.Single.StepTM]
DoActions_Loop_Terminates [lemma, in Undecidability.TM.Single.StepTM]
DoActions_Loop_T [definition, in Undecidability.TM.Single.StepTM]
DoActions_Loop_steps_cons [definition, in Undecidability.TM.Single.StepTM]
DoActions_Loop_steps_nil [definition, in Undecidability.TM.Single.StepTM]
DoActions_Loop_Realise [lemma, in Undecidability.TM.Single.StepTM]
DoActions_Loop_Rel [definition, in Undecidability.TM.Single.StepTM]
DoActions_Loop [definition, in Undecidability.TM.Single.StepTM]
DoActions_Step_Terminates [lemma, in Undecidability.TM.Single.StepTM]
DoActions_Step_T [definition, in Undecidability.TM.Single.StepTM]
DoActions_Step_steps_nil [definition, in Undecidability.TM.Single.StepTM]
DoActions_Step_steps_cons [definition, in Undecidability.TM.Single.StepTM]
DoActions_Step_Realise [lemma, in Undecidability.TM.Single.StepTM]
DoActions_Step [definition, in Undecidability.TM.Single.StepTM]
DoActions_Step_Rel [definition, in Undecidability.TM.Single.StepTM]
DoAction_steps_nice [lemma, in Complexity.TM.PrettyBounds.M2MBounds]
DoAction_steps_nice' [lemma, in Complexity.TM.PrettyBounds.M2MBounds]
DoAction_Terminates [lemma, in Undecidability.TM.Single.StepTM]
DoAction_T [definition, in Undecidability.TM.Single.StepTM]
DoAction_steps [definition, in Undecidability.TM.Single.StepTM]
DoAction_Realise [lemma, in Undecidability.TM.Single.StepTM]
DoAction_Rel [definition, in Undecidability.TM.Single.StepTM]
DoAction_size [definition, in Undecidability.TM.Univ.LowLevel]
DoAction_Sem [lemma, in Undecidability.TM.Univ.LowLevel]
DoAction_Rel [definition, in Undecidability.TM.Univ.LowLevel]
DoAction' [definition, in Undecidability.TM.Univ.LowLevel]
DoAction'_Sem [lemma, in Undecidability.TM.Univ.LowLevel]
DoAction'_steps [definition, in Undecidability.TM.Univ.LowLevel]
DoAction'_Rel [definition, in Undecidability.TM.Univ.LowLevel]
DoAction'_SpecT_space [lemma, in Undecidability.TM.Univ.Univ]
DoAction'_size [definition, in Undecidability.TM.Univ.Univ]
doAct_size'' [lemma, in Complexity.TM.PrettyBounds.M2MBounds]
doAct_size' [lemma, in Complexity.TM.PrettyBounds.M2MBounds]
doAct_size [lemma, in Complexity.TM.PrettyBounds.M2MBounds]
doAct_surject [lemma, in Undecidability.TM.Lifting.LiftAlphabet]
doAct_mirror_multi [lemma, in Undecidability.TM.Combinators.Mirror]
doAct_mirror [lemma, in Undecidability.TM.Combinators.Mirror]
DoAct_Derived.D [variable, in Undecidability.TM.Basic.Mono]
DoAct_Derived.c [variable, in Undecidability.TM.Basic.Mono]
DoAct_Derived.sig [variable, in Undecidability.TM.Basic.Mono]
DoAct_Derived [section, in Undecidability.TM.Basic.Mono]
DoAct_Sem [lemma, in Undecidability.TM.Basic.Mono]
DoAct_Rel [definition, in Undecidability.TM.Basic.Mono]
DoAct_TM [definition, in Undecidability.TM.Basic.Mono]
doAct_validFlatTape_Some [lemma, in Complexity.L.TM.TMflatComp]
doAct_validFlatTape_None [lemma, in Complexity.L.TM.TMflatComp]
doAct_map [lemma, in Undecidability.TM.Univ.LowLevel]
doAct_multiFlat [lemma, in Complexity.L.TM.TMflatFun]
doAct_select [lemma, in Undecidability.TM.Lifting.LiftTapes]
doAct_nop [lemma, in Undecidability.TM.Util.TM_facts]
doAct_multi [definition, in Undecidability.TM.Util.TM_facts]
DoAct_SpecTReg [lemma, in Undecidability.TM.Hoare.HoareStdLib]
DoAct.act [variable, in Undecidability.TM.Basic.Mono]
DoAct.c [variable, in Undecidability.TM.Basic.Mono]
DoAct.sig [variable, in Undecidability.TM.Basic.Mono]
doesHaltIn [definition, in Undecidability.L.Functions.Eval]
Domain_of_goal_domain [projection, in Undecidability.L.Complexity.GenericNary]
Domain_of_goal_domain_ty [projection, in Undecidability.L.Complexity.GenericNary]
Domain_of_goal [record, in Undecidability.L.Complexity.GenericNary]
Domain_goal_hint [inductive, in Undecidability.L.Complexity.GenericNary]
domain:1 [binder, in Undecidability.TM.Code.List.Concat_Repeat]
domain:1 [binder, in Undecidability.L.Complexity.GenericNary]
domain:19 [binder, in Undecidability.L.Complexity.GenericNary]
domain:24 [binder, in Undecidability.L.Complexity.UpToCNary]
domain:29 [binder, in Undecidability.L.Complexity.UpToCNary]
domain:34 [binder, in Undecidability.L.Complexity.UpToCNary]
domain:39 [binder, in Undecidability.L.Complexity.UpToCNary]
domain:44 [binder, in Undecidability.L.Complexity.UpToCNary]
domain:48 [binder, in Undecidability.L.Complexity.GenericNary]
domain:49 [binder, in Undecidability.L.Complexity.UpToCNary]
domain:5 [binder, in Undecidability.L.Complexity.GenericNary]
domain:52 [binder, in Undecidability.L.Complexity.UpToCNary]
domain:56 [binder, in Undecidability.L.Complexity.UpToCNary]
domain:63 [binder, in Undecidability.L.Complexity.UpToCNary]
domain:68 [binder, in Undecidability.L.Complexity.UpToCNary]
domain:74 [binder, in Undecidability.L.Complexity.GenericNary]
domain:78 [binder, in Undecidability.L.Complexity.GenericNary]
domain:79 [binder, in Complexity.Complexity.PolyTimeComputable]
domain:82 [binder, in Undecidability.L.Complexity.GenericNary]
domain:85 [binder, in Undecidability.L.Complexity.GenericNary]
domain:9 [binder, in Undecidability.L.Complexity.GenericNary]
domain:95 [binder, in Undecidability.L.Complexity.UpToCNary]
dominatedWith [definition, in Complexity.TM.PrettyBounds.PrettyBounds]
dominatedWith_match_move [lemma, in Complexity.TM.PrettyBounds.M2MBounds]
dominatedWith_match_tape [lemma, in Complexity.TM.PrettyBounds.M2MBounds]
dominatedWith_add_split [lemma, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds_Loop]
dominatedWith_match_Tok [lemma, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
dominatedWith_cube [lemma, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
dominatedWith_mult3 [lemma, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
dominatedWith_quad [lemma, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
dominatedWith_mult [lemma, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
dominatedWith_S''' [lemma, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
dominatedWith_add' [lemma, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
dominatedWith_refl [lemma, in Complexity.TM.PrettyBounds.PrettyBounds]
dominatedWith_mono_c [lemma, in Complexity.TM.PrettyBounds.PrettyBounds]
dominatedWith_match_bool [lemma, in Complexity.TM.PrettyBounds.PrettyBounds]
dominatedWith_match_sumbool [lemma, in Complexity.TM.PrettyBounds.PrettyBounds]
dominatedWith_match_option [lemma, in Complexity.TM.PrettyBounds.PrettyBounds]
dominatedWith_match_nat [lemma, in Complexity.TM.PrettyBounds.PrettyBounds]
dominatedWith_match_list [lemma, in Complexity.TM.PrettyBounds.PrettyBounds]
dominatedWith_match_list' [lemma, in Complexity.TM.PrettyBounds.PrettyBounds]
dominatedWith_leq_Proper [instance, in Complexity.TM.PrettyBounds.PrettyBounds]
dominatedWith_trans [lemma, in Complexity.TM.PrettyBounds.PrettyBounds]
dominatedWith_S'' [lemma, in Complexity.TM.PrettyBounds.PrettyBounds]
dominatedWith_S' [lemma, in Complexity.TM.PrettyBounds.PrettyBounds]
dominatedWith_S [lemma, in Complexity.TM.PrettyBounds.PrettyBounds]
dominatedWith_solve [lemma, in Complexity.TM.PrettyBounds.PrettyBounds]
dominatedWith_const [lemma, in Complexity.TM.PrettyBounds.PrettyBounds]
dominatedWith_mult_r [lemma, in Complexity.TM.PrettyBounds.PrettyBounds]
dominatedWith_mult_l [lemma, in Complexity.TM.PrettyBounds.PrettyBounds]
dominatedWith_mult [lemma, in Complexity.TM.PrettyBounds.PrettyBounds]
dominatedWith_add_r [lemma, in Complexity.TM.PrettyBounds.PrettyBounds]
dominatedWith_add_l [lemma, in Complexity.TM.PrettyBounds.PrettyBounds]
dominatedWith_add [lemma, in Complexity.TM.PrettyBounds.PrettyBounds]
DoMove [definition, in Undecidability.TM.Single.StepTM]
DoMove_Sem [lemma, in Undecidability.TM.Single.StepTM]
DoMove_steps [definition, in Undecidability.TM.Single.StepTM]
DoMove_Rel [definition, in Undecidability.TM.Single.StepTM]
doSplit:173 [binder, in Undecidability.L.Tactics.Extract]
double_sum_powers_ortho [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
Downlift [definition, in Undecidability.TM.Hoare.HoareRegister]
Downlift_withSpace [lemma, in Undecidability.TM.Hoare.HoareRegister]
DoWrite [definition, in Undecidability.TM.Single.StepTM]
DoWrite_steps_nice [lemma, in Complexity.TM.PrettyBounds.M2MBounds]
DoWrite_steps_nice' [lemma, in Complexity.TM.PrettyBounds.M2MBounds]
DoWrite_Terminates [lemma, in Undecidability.TM.Single.StepTM]
DoWrite_T [definition, in Undecidability.TM.Single.StepTM]
DoWrite_steps [definition, in Undecidability.TM.Single.StepTM]
DoWrite_Realise [lemma, in Undecidability.TM.Single.StepTM]
DoWrite_Rel [definition, in Undecidability.TM.Single.StepTM]
dst:626 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
dst:632 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
ds:17 [binder, in Undecidability.L.Complexity.GenericNary]
ds:41 [binder, in Undecidability.L.Complexity.GenericNary]
ds:70 [binder, in Undecidability.L.Complexity.GenericNary]
dummy [definition, in Undecidability.Synthetic.Infinite]
dummy_sizes [definition, in Undecidability.TM.Hoare.HoareRegister]
dummy_size [definition, in Undecidability.TM.Hoare.HoareRegister]
Duo [library]
duoton_incl [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Dupfree [section, in Undecidability.Shared.Libs.PSL.Lists.Dupfree]
dupfree [inductive, in Undecidability.Shared.Libs.PSL.Lists.Dupfree]
dupfree [inductive, in Undecidability.Shared.Libs.PSL.Vectors.VectorDupfree]
Dupfree [library]
dupfreeb [definition, in Undecidability.L.Datatypes.List.List_in]
dupfreeb_poly [lemma, in Complexity.Libs.CookPrelim.PolyBounds]
dupfreeb_time_bound [lemma, in Complexity.Libs.CookPrelim.PolyBounds]
dupfreeb_time [definition, in Undecidability.L.Datatypes.List.List_in]
dupfreeb_iff [lemma, in Undecidability.L.Datatypes.List.List_in]
dupfreeb_correct [lemma, in Undecidability.L.Datatypes.List.List_in]
dupfreeC [constructor, in Undecidability.Shared.Libs.PSL.Lists.Dupfree]
dupfreeCount [lemma, in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
dupfreeN [constructor, in Undecidability.Shared.Libs.PSL.Lists.Dupfree]
dupfreeVC [constructor, in Undecidability.Shared.Libs.PSL.Vectors.VectorDupfree]
dupfreeVN [constructor, in Undecidability.Shared.Libs.PSL.Vectors.VectorDupfree]
dupfree_not_rep [lemma, in Complexity.Libs.Pigeonhole]
dupfree_T [lemma, in Undecidability.L.Computability.Enum]
dupfree_elAt [lemma, in Undecidability.Shared.Libs.PSL.Lists.Position]
dupfree_dedup [lemma, in Complexity.NP.SAT.SAT_inNP]
dupfree_in_power [lemma, in Undecidability.Shared.Libs.PSL.Lists.Power]
dupfree_power [lemma, in Undecidability.Shared.Libs.PSL.Lists.Power]
dupfree_Nodup [lemma, in Undecidability.Shared.Libs.PSL.Lists.Dupfree]
dupfree_undup [lemma, in Undecidability.Shared.Libs.PSL.Lists.Dupfree]
dupfree_card [lemma, in Undecidability.Shared.Libs.PSL.Lists.Dupfree]
dupfree_dec [lemma, in Undecidability.Shared.Libs.PSL.Lists.Dupfree]
dupfree_concat [lemma, in Undecidability.Shared.Libs.PSL.Lists.Dupfree]
dupfree_filter [lemma, in Undecidability.Shared.Libs.PSL.Lists.Dupfree]
dupfree_map [lemma, in Undecidability.Shared.Libs.PSL.Lists.Dupfree]
dupfree_app [lemma, in Undecidability.Shared.Libs.PSL.Lists.Dupfree]
dupfree_cons [lemma, in Undecidability.Shared.Libs.PSL.Lists.Dupfree]
dupfree_dec_time [section, in Undecidability.L.Datatypes.List.List_in]
dupfree_dec.eqbX_correct [variable, in Undecidability.L.Datatypes.List.List_in]
dupfree_dec.eqbX [variable, in Undecidability.L.Datatypes.List.List_in]
dupfree_dec.X [variable, in Undecidability.L.Datatypes.List.List_in]
dupfree_dec [section, in Undecidability.L.Datatypes.List.List_in]
dupfree_nth_injective [lemma, in Undecidability.Shared.Libs.PSL.Vectors.VectorDupfree]
dupfree_map_injective [lemma, in Undecidability.Shared.Libs.PSL.Vectors.VectorDupfree]
dupfree_tabulate_injective [lemma, in Undecidability.Shared.Libs.PSL.Vectors.VectorDupfree]
dupfree_replace [lemma, in Undecidability.Shared.Libs.PSL.Vectors.VectorDupfree]
dupfree_cons [lemma, in Undecidability.Shared.Libs.PSL.Vectors.VectorDupfree]
dupfree_concat [lemma, in Undecidability.Shared.Libs.PSL.FiniteTypes.Cardinality]
dupfree_length [lemma, in Undecidability.Shared.Libs.PSL.FiniteTypes.Cardinality]
dupfree_elements [lemma, in Undecidability.Shared.Libs.PSL.FiniteTypes.Cardinality]
dupfree_countOne [lemma, in Undecidability.Shared.Libs.PSL.FiniteTypes.Cardinality]
dupfree_map_getPosition [lemma, in Complexity.Libs.CookPrelim.MorePrelim]
dupfree_nthe [lemma, in Complexity.Libs.CookPrelim.MorePrelim]
Dupfree.X [variable, in Undecidability.Shared.Libs.PSL.Lists.Dupfree]
D':105 [binder, in Undecidability.Shared.Libs.PSL.Retracts]
D':117 [binder, in Undecidability.Shared.Libs.PSL.Retracts]
D':132 [binder, in Undecidability.Shared.Libs.PSL.Retracts]
D':150 [binder, in Undecidability.Shared.Libs.PSL.Retracts]
d':2667 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
d':2688 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
d':3 [binder, in Complexity.TM.Compound.MoveToSymbol_niceSpec]
d':40 [binder, in Undecidability.L.Complexity.GenericNary]
d':69 [binder, in Undecidability.L.Complexity.GenericNary]
d1:178 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
d1:182 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
d1:297 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
d2:180 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
d2:184 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
d2:299 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
d:10 [binder, in Undecidability.Shared.Libs.PSL.EqDec]
d:10 [binder, in Undecidability.Shared.Dec]
d:100 [binder, in Complexity.L.TM.TMunflatten]
D:104 [binder, in Undecidability.Shared.Libs.PSL.Retracts]
D:110 [binder, in Undecidability.TM.Util.TM_facts]
D:112 [binder, in Undecidability.TM.Util.TM_facts]
D:116 [binder, in Undecidability.Shared.Libs.PSL.Retracts]
D:12 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.Arbitrary]
d:124 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
d:13 [binder, in Undecidability.Shared.Libs.PSL.EqDec]
D:131 [binder, in Undecidability.Shared.Libs.PSL.Retracts]
D:133 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
d:14 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
D:149 [binder, in Undecidability.Shared.Libs.PSL.Retracts]
d:15 [binder, in Undecidability.Shared.Libs.PSL.EqDec]
d:16 [binder, in Undecidability.L.Tactics.GenEncode]
d:16 [binder, in Undecidability.L.Datatypes.List.List_nat]
d:16 [binder, in Undecidability.L.Functions.EqBool]
d:16 [binder, in Undecidability.L.Complexity.GenericNary]
D:17 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.Arbitrary]
d:18 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
D:180 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
D:189 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
D:19 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
D:199 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
d:2 [binder, in Complexity.TM.Compound.MoveToSymbol_niceSpec]
d:20 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_string]
d:20 [binder, in Complexity.L.TM.TMunflatten]
d:20 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
D:204 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
d:21 [binder, in Undecidability.Shared.Libs.PSL.EqDec]
d:21 [binder, in Undecidability.L.Functions.FinTypeLookup]
d:22 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
d:23 [binder, in Undecidability.Shared.Libs.PSL.EqDec]
D:24 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.Arbitrary]
d:2660 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
d:2681 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
d:2694 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
d:27 [binder, in Undecidability.L.Functions.EqBool]
d:3 [binder, in Undecidability.Shared.Libs.PSL.EqDec]
d:3 [binder, in Undecidability.Shared.Dec]
D:30 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.Arbitrary]
d:3036 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
d:3051 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
d:31 [binder, in Undecidability.L.Functions.FinTypeLookup]
d:3136 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
d:32 [binder, in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
d:328 [binder, in Undecidability.TM.Single.StepTM]
d:33 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
d:333 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
d:335 [binder, in Undecidability.TM.Single.StepTM]
d:338 [binder, in Undecidability.TM.Single.StepTM]
d:34 [binder, in Complexity.L.TM.TMunflatten]
d:340 [binder, in Undecidability.TM.Single.StepTM]
d:344 [binder, in Undecidability.TM.Single.StepTM]
d:350 [binder, in Undecidability.TM.Single.StepTM]
d:352 [binder, in Undecidability.TM.Single.StepTM]
D:36 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
d:36 [binder, in Undecidability.L.Complexity.GenericNary]
d:368 [binder, in Undecidability.TM.Single.StepTM]
d:37 [binder, in Complexity.L.TM.TMunflatten]
D:37 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.Arbitrary]
d:374 [binder, in Undecidability.TM.Single.StepTM]
d:376 [binder, in Undecidability.TM.Single.StepTM]
D:38 [binder, in Undecidability.TM.Util.TM_facts]
d:383 [binder, in Undecidability.TM.Single.StepTM]
d:385 [binder, in Undecidability.TM.Single.StepTM]
d:387 [binder, in Undecidability.TM.Single.StepTM]
d:39 [binder, in Undecidability.L.Complexity.GenericNary]
d:391 [binder, in Undecidability.TM.Single.StepTM]
d:398 [binder, in Undecidability.TM.Single.StepTM]
d:40 [binder, in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
d:40 [binder, in Complexity.L.TM.TMunflatten]
d:414 [binder, in Undecidability.TM.Single.StepTM]
D:42 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.Arbitrary]
D:45 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
d:46 [binder, in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
d:5 [binder, in Undecidability.Shared.Libs.PSL.EqDec]
d:5 [binder, in Complexity.L.TM.TMflatEnc]
d:5 [binder, in Undecidability.Synthetic.Infinite]
d:50 [binder, in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
d:51 [binder, in Undecidability.TM.Lifting.LiftAlphabet]
d:51 [binder, in Complexity.Complexity.SpaceBoundsTime]
D:52 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.Arbitrary]
d:52 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
D:53 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
D:55 [binder, in Complexity.TM.PrettyBounds.BaseCodeSpace]
d:59 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
d:6 [binder, in Undecidability.Shared.Dec]
d:64 [binder, in Undecidability.L.Complexity.GenericNary]
d:65 [binder, in Undecidability.L.Tactics.GenEncode]
d:68 [binder, in Undecidability.L.Complexity.GenericNary]
d:69 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
d:7 [binder, in Undecidability.Shared.Libs.PSL.EqDec]
d:7 [binder, in Undecidability.L.Functions.FinTypeLookup]
d:71 [binder, in Undecidability.L.Tactics.GenEncode]
d:71 [binder, in Undecidability.L.Functions.FinTypeLookup]
d:75 [binder, in Undecidability.L.Tactics.GenEncode]
d:79 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
d:8 [binder, in Undecidability.Shared.Dec]
d:85 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
d:887 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
d:90 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
d:91 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
d:96 [binder, in Complexity.TM.PrettyBounds.M2MBounds]

E

E [definition, in Complexity.HierarchyTheorem.TimeHierarchyTheorem]
E [abbreviation, in Complexity.NP.Clique.Clique]
E [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
E [projection, in Complexity.NP.Clique.UGraph]
ecl [inductive, in Undecidability.L.Prelim.ARS]
eclC [constructor, in Undecidability.L.Prelim.ARS]
eclR [constructor, in Undecidability.L.Prelim.ARS]
eclS [constructor, in Undecidability.L.Prelim.ARS]
ecl_Equivalence [instance, in Undecidability.L.Prelim.ARS]
ecl_sym [lemma, in Undecidability.L.Prelim.ARS]
ecl_trans [lemma, in Undecidability.L.Prelim.ARS]
Ecnf [definition, in Complexity.NP.Clique.kSAT_to_Clique]
Ecnf_dec [lemma, in Complexity.NP.Clique.kSAT_to_Clique]
Ecnf_symm [lemma, in Complexity.NP.Clique.kSAT_to_Clique]
ecovHeadSim [abbreviation, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
effectiveMove:2025 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
effectiveMove:2057 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
effectiveMove:2087 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
ehaltCenter [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
ehaltLeft [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
ehaltRight [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
ehaltRules [inductive, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
elAt [definition, in Undecidability.Shared.Libs.PSL.Lists.Position]
elAt_el [lemma, in Undecidability.Shared.Libs.PSL.Lists.Position]
elAt_app [lemma, in Undecidability.Shared.Libs.PSL.Lists.Position]
elem [definition, in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
elem_spec [lemma, in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
ele:110 [binder, in Complexity.Libs.CookPrelim.PolyBounds]
ele:127 [binder, in Complexity.Libs.CookPrelim.PolyBounds]
ele:130 [binder, in Complexity.Libs.CookPrelim.PolyBounds]
eliminateOR [definition, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
eliminateOR_enc_size_bound [lemma, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
eliminateOR_poly [lemma, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
eliminateOR_time_bound [lemma, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
eliminateOR_time [definition, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
eliminateOR_maxVar_eq [lemma, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
eliminateOR_varsIn [lemma, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
eliminateOR_size [lemma, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
eliminateOR_FSAT_equiv [lemma, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
eliminateOR_eval [lemma, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
elm:5 [binder, in Undecidability.L.Datatypes.List.List_fold]
el_elAt [lemma, in Undecidability.Shared.Libs.PSL.Lists.Position]
el_pos [lemma, in Undecidability.Shared.Libs.PSL.Lists.Position]
el_T [definition, in Undecidability.Synthetic.ListEnumerabilityFacts]
el_dec [instance, in Undecidability.Synthetic.Infinite]
embed [definition, in Undecidability.Shared.embed_nat]
EmbedNatNotations [module, in Undecidability.Shared.embed_nat]
⟨ _ , _ ⟩ [notation, in Undecidability.Shared.embed_nat]
embedP [lemma, in Undecidability.Shared.embed_nat]
embedState [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
embed_nat [library]
Empty_set_eq_dec [instance, in Undecidability.Shared.Libs.PSL.EqDec]
Empty_set_enum_ok [lemma, in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicFinTypes]
Empty_set_eq_dec [instance, in Undecidability.Shared.Dec]
enc [projection, in Undecidability.L.Tactics.Extract]
encBoolsL [definition, in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
encBoolsListTM [definition, in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
encBoolsL_inj [lemma, in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
encBoolsTM [definition, in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
encBoolsTM_inj [lemma, in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
EncBoolsTM_boolList [library]
encBoolsTM2boollist [module, in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
encBoolsTM2boollist.Fix [section, in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
encBoolsTM2boollist.Fix.b [variable, in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
encBoolsTM2boollist.Fix.retr_list [variable, in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
encBoolsTM2boollist.Fix.s [variable, in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
encBoolsTM2boollist.Fix.Σ [variable, in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
encBoolsTM2boollist.loop_SpecT [lemma, in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
encBoolsTM2boollist.M [definition, in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
encBoolsTM2boollist.M__loop [definition, in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
encBoolsTM2boollist.M__step [definition, in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
encBoolsTM2boollist.Realise [lemma, in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
encBoolsTM2boollist.retr_bool [instance, in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
encBoolsTM2boollist.SpecT [lemma, in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
encBools_nat_TM [lemma, in Undecidability.TM.L.CompilerBoolFuns.Compiler_nat_facts]
encInj [record, in Undecidability.L.Tactics.Computable]
encInj [inductive, in Undecidability.L.Tactics.Computable]
encInj_prod_enc [instance, in Undecidability.L.Datatypes.LProd]
encInj_option_enc [instance, in Undecidability.L.Datatypes.LOptions]
encInj_sum_enc [instance, in Undecidability.L.Datatypes.LSum]
encInj_tape_enc [instance, in Undecidability.L.TM.TMEncoding]
encInj_list_enc [instance, in Undecidability.L.Datatypes.List.List_enc]
encNatL [definition, in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
encNatTM [definition, in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
encn:47 [binder, in Undecidability.L.Tactics.GenEncode]
encodable [record, in Undecidability.L.Tactics.Extract]
encodableP [record, in Complexity.Complexity.EncodableP]
EncodableP [library]
encodable_sig [instance, in Complexity.L.Datatypes.LDepPair]
encodable_finType [definition, in Undecidability.L.Datatypes.LFinType]
encodable_mk_mconfig [instance, in Undecidability.L.TM.TMEncoding]
encodable_mconfig [instance, in Undecidability.L.TM.TMEncoding]
encode [projection, in Undecidability.TM.Code.Code]
EncodeBinNumbers [library]
encodeCardAt [definition, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
encodeCardAt_size [lemma, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
encodeCardAt_varsIn [lemma, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
encodeCardAt_poly [lemma, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
encodeCardAt_time_bound [lemma, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
encodeCardAt_time [definition, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
encodeCardAt_encodesPredicate [lemma, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
encodeCardsAt [definition, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
encodeCardsAt_size [lemma, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
encodeCardsAt_varsIn [lemma, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
encodeCardsAt_poly [lemma, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
encodeCardsAt_time_bound [lemma, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
encodeCardsAt_time [definition, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
encodeCardsAt_encodesPredicate [lemma, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
encodeCardsInAllLines [definition, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
encodeCardsInAllLines_size [lemma, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
encodeCardsInAllLines_varsIn [lemma, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
encodeCardsInAllLines_poly [lemma, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
encodeCardsInAllLines_time_bound [lemma, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
encodeCardsInAllLines_time [definition, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
encodeCardsInAllLines_encodesPredicate [lemma, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
encodeCardsInLine [definition, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
encodeCardsInLineP_size [lemma, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
encodeCardsInLineP_varsIn [lemma, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
encodeCardsInLineP_poly [lemma, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
encodeCardsInLineP_time_bound [lemma, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
encodeCardsInLineP_time_bound1 [lemma, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
encodeCardsInLineP_time [definition, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
encodeCardsInLineP_encodesPredicate [lemma, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
encodeCardsInLineP_stepindex_monotone [lemma, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
encodeCardsInLineP_stepindex_monotone' [lemma, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
encodeCardsInLineP1_poly [lemma, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
encodeCardsInLine_size [lemma, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
encodeCardsInLine_varsIn [lemma, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
encodeCardsInLine_poly [lemma, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
encodeCardsInLine_time_bound [lemma, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
encodeCardsInLine_time [definition, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
encodeCardsInLine_encodesPredicate [lemma, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
encodeCardsInLine' [definition, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
encodeFinalConstraint [definition, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
encodeFinalConstraint_size [lemma, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
encodeFinalConstraint_varsIn [lemma, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
encodeFinalConstraint_poly [lemma, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
encodeFinalConstraint_time_bound [lemma, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
encodeFinalConstraint_time [definition, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
encodeFinalConstraint_step_time [definition, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
encodeFinalConstraint_step [definition, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
encodeFinalConstraint_encodesPredicate' [lemma, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
encodeFinalConstraint_encodesPredicate [lemma, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
encodeFinalConstraint' [definition, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
encodeListAt [definition, in Complexity.NP.SAT.FSAT.FormulaEncoding]
encodeListAt_size [lemma, in Complexity.NP.SAT.FSAT.FormulaEncoding]
encodeListAt_varsIn [lemma, in Complexity.NP.SAT.FSAT.FormulaEncoding]
encodeListAt_poly [lemma, in Complexity.NP.SAT.FSAT.FormulaEncoding]
encodeListAt_time_bound [lemma, in Complexity.NP.SAT.FSAT.FormulaEncoding]
encodeListAt_time [definition, in Complexity.NP.SAT.FSAT.FormulaEncoding]
encodeListAt_encodesPredicate [lemma, in Complexity.NP.SAT.FSAT.FormulaEncoding]
encodeList_size_nil [lemma, in Complexity.TM.PrettyBounds.BaseCode]
encodeList_size_cons [lemma, in Complexity.TM.PrettyBounds.BaseCode]
encodeList_size_app_eq [lemma, in Complexity.TM.PrettyBounds.BaseCode]
encodeList_size_app [lemma, in Complexity.TM.PrettyBounds.BaseCode]
encodeList_size_eq.sigX [variable, in Complexity.TM.PrettyBounds.BaseCode]
encodeList_size_eq.X [variable, in Complexity.TM.PrettyBounds.BaseCode]
encodeList_size_eq [section, in Complexity.TM.PrettyBounds.BaseCode]
encodeLiteral [definition, in Complexity.NP.SAT.FSAT.FormulaEncoding]
encodeLiteral_varsIn [lemma, in Complexity.NP.SAT.FSAT.FormulaEncoding]
encodeLiteral_size [lemma, in Complexity.NP.SAT.FSAT.FormulaEncoding]
encodeLiteral_encodesPredicate [lemma, in Complexity.NP.SAT.FSAT.FormulaEncoding]
encodeLiteral_correct [lemma, in Complexity.NP.SAT.FSAT.FormulaEncoding]
encodesPredicateAt [definition, in Complexity.NP.SAT.FSAT.FormulaEncoding]
encodesPredicateAt_extensional [lemma, in Complexity.NP.SAT.FSAT.FormulaEncoding]
encodesPredicate_listAnd_map [lemma, in Complexity.NP.SAT.FSAT.FormulaEncoding]
encodesPredicate_listOr_map [lemma, in Complexity.NP.SAT.FSAT.FormulaEncoding]
encodesPredicate_listAnd_tabulate [lemma, in Complexity.NP.SAT.FSAT.FormulaEncoding]
encodesPredicate_listOr_tabulate [lemma, in Complexity.NP.SAT.FSAT.FormulaEncoding]
encodesPredicate_or [lemma, in Complexity.NP.SAT.FSAT.FormulaEncoding]
encodesPredicate_and [lemma, in Complexity.NP.SAT.FSAT.FormulaEncoding]
encodeSubstringInLine [definition, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
encodeSubstringInLineP_size [lemma, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
encodeSubstringInLineP_varsIn [lemma, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
encodeSubstringInLineP_poly [lemma, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
encodeSubstringInLineP_time_bound [lemma, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
encodeSubstringInLineP_poly1 [lemma, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
encodeSubstringInLineP_time_bound1 [lemma, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
encodeSubstringInLineP_time [definition, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
encodeSubstringInLineP_encodesPredicate [lemma, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
encodeSubstringInLineP_stepindex_monotone [lemma, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
encodeSubstringInLineP_stepindex_monotone' [lemma, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
encodeSubstringInLine_size [lemma, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
encodeSubstringInLine_varsIn [lemma, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
encodeSubstringInLine_time [definition, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
encodeSubstringInLine_encodesPredicate [lemma, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
encodeSubstringInLine' [definition, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
encodeTableau [definition, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
encodeTableau_enc_size [lemma, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
encodeTableau_size [lemma, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
encodeTableau_varsIn [lemma, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
encodeTableau_poly [lemma, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
encodeTableau_time_bound [lemma, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
encodeTableau_time [definition, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
encodeTableau_encodesPredicate [lemma, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
EncodeTapes [library]
EncodeTapesInvariants [library]
Encode_list_hasSize_ge_length [lemma, in Complexity.TM.PrettyBounds.M2MBounds]
Encode_tapes_size_fold [lemma, in Complexity.TM.PrettyBounds.M2MBounds]
Encode_tapes_hasSize [lemma, in Complexity.TM.PrettyBounds.M2MBounds]
Encode_tape_hasSize [definition, in Complexity.TM.PrettyBounds.M2MBounds]
Encode_list_hasSize_el [lemma, in Complexity.TM.PrettyBounds.BaseCode]
Encode_option_hasSize_ge1 [lemma, in Complexity.TM.PrettyBounds.BaseCode]
Encode_nat_hasSize_ge1 [lemma, in Complexity.TM.PrettyBounds.BaseCode]
Encode_pair_hasSize_ge1 [lemma, in Complexity.TM.PrettyBounds.BaseCode]
Encode_graph_hasSize_ge2 [lemma, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
Encode_list_hasSize_ge2 [lemma, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
Encode_graph_y_hasSize [lemma, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
Encode_graph_x_hasSize [lemma, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
Encode_state_hasSize [lemma, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
Encode_action_hasSize [lemma, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
encode_pushHSB [lemma, in Undecidability.TM.Code.BinNumbers.PosDefinitions]
Encode_positive_eq_pos_to_bits [lemma, in Undecidability.TM.Code.BinNumbers.PosDefinitions]
encode_bits_to_pos [lemma, in Undecidability.TM.Code.BinNumbers.PosDefinitions]
encode_bits_to_pos' [lemma, in Undecidability.TM.Code.BinNumbers.PosDefinitions]
encode_append_bits [lemma, in Undecidability.TM.Code.BinNumbers.PosDefinitions]
Encode_positive_app_xIO [lemma, in Undecidability.TM.Code.BinNumbers.PosDefinitions]
Encode_positive_app_xO [lemma, in Undecidability.TM.Code.BinNumbers.PosDefinitions]
Encode_positive_app_xI [lemma, in Undecidability.TM.Code.BinNumbers.PosDefinitions]
encode_arguments [definition, in Undecidability.L.Tactics.Extract]
Encode_list_hasSize_ge_length [lemma, in Complexity.TM.PrettyBounds.UnivBounds]
Encode_list_hasSize_gt_length [lemma, in Complexity.TM.PrettyBounds.UnivBounds]
encode_arguments [definition, in Undecidability.L.Tactics.GenEncode]
Encode_Heap_hasSize_ge1 [lemma, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
Encode_HEntr_hasSize_ge1 [lemma, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
Encode_Clos_hasSize_ge1 [lemma, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
Encode_Clos_hasSize' [lemma, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
Encode_Clos_hasSize [lemma, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
Encode_Heap_hasSize_ge_length [lemma, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
Encode_Pro_hasSize_ge_length [lemma, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
Encode_Pro_hasSize_ge1 [lemma, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
Encode_Com_hasSize_ge1 [lemma, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
Encode_N_hasSize [lemma, in Undecidability.TM.Code.BinNumbers.EncodeBinNumbers]
Encode_N_size [definition, in Undecidability.TM.Code.BinNumbers.EncodeBinNumbers]
Encode_N [instance, in Undecidability.TM.Code.BinNumbers.EncodeBinNumbers]
Encode_positive_startsWith_xH [lemma, in Undecidability.TM.Code.BinNumbers.EncodeBinNumbers]
Encode_positive_injective [lemma, in Undecidability.TM.Code.BinNumbers.EncodeBinNumbers]
Encode_positive_eq_nil [lemma, in Undecidability.TM.Code.BinNumbers.EncodeBinNumbers]
Encode_positive_hasSize [lemma, in Undecidability.TM.Code.BinNumbers.EncodeBinNumbers]
Encode_positive [instance, in Undecidability.TM.Code.BinNumbers.EncodeBinNumbers]
encode_pos [definition, in Undecidability.TM.Code.BinNumbers.EncodeBinNumbers]
encode_tape_invariants_partial [lemma, in Complexity.TM.Single.EncodeTapesInvariants]
encode_tape_invariants [lemma, in Complexity.TM.Single.EncodeTapesInvariants]
Encode_graph [instance, in Undecidability.TM.Univ.LowLevel]
Encode_action [instance, in Undecidability.TM.Univ.LowLevel]
Encode_optSigM [instance, in Undecidability.TM.Univ.LowLevel]
Encode_tapes_hasSize_le_sizeOfmTapes [lemma, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
Encode_tapes_hasSize [lemma, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
Encode_tape_hasSize_le [lemma, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
Encode_tape_hasSize [lemma, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
Encode_tape_size [definition, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
Encode_Heap [instance, in Undecidability.TM.L.Alphabets]
Encode_HEntr [instance, in Undecidability.TM.L.Alphabets]
Encode_HEntr' [instance, in Undecidability.TM.L.Alphabets]
Encode_HClos [instance, in Undecidability.TM.L.Alphabets]
Encode_Prog [instance, in Undecidability.TM.L.Alphabets]
Encode_Com_hasSize [lemma, in Undecidability.TM.L.Alphabets]
Encode_Com_size [definition, in Undecidability.TM.L.Alphabets]
Encode_Com [instance, in Undecidability.TM.L.Alphabets]
Encode_ACom [instance, in Undecidability.TM.L.Alphabets]
Encode_nat_injective [lemma, in Undecidability.TM.Code.Code]
Encode_nat_eq_nil [lemma, in Undecidability.TM.Code.Code]
Encode_nat_hasSize [lemma, in Undecidability.TM.Code.Code]
Encode_nat [instance, in Undecidability.TM.Code.Code]
Encode_nat [section, in Undecidability.TM.Code.Code]
Encode_list_injective [lemma, in Undecidability.TM.Code.Code]
encode_list_injective [lemma, in Undecidability.TM.Code.Code]
encode_list_eq_nil [lemma, in Undecidability.TM.Code.Code]
Encode_list_hasSize_app [lemma, in Undecidability.TM.Code.Code]
Encode_list_hasSize_ge1 [lemma, in Undecidability.TM.Code.Code]
Encode_list_hasSize_skipn [lemma, in Undecidability.TM.Code.Code]
Encode_list_hasSize [lemma, in Undecidability.TM.Code.Code]
Encode_list_size [definition, in Undecidability.TM.Code.Code]
Encode_list_remove [lemma, in Undecidability.TM.Code.Code]
encode_list_remove [lemma, in Undecidability.TM.Code.Code]
Encode_list_neq_nil [lemma, in Undecidability.TM.Code.Code]
encode_list_neq_nil [lemma, in Undecidability.TM.Code.Code]
Encode_list_app [lemma, in Undecidability.TM.Code.Code]
encode_list_app [lemma, in Undecidability.TM.Code.Code]
Encode_list [instance, in Undecidability.TM.Code.Code]
encode_list_concat [lemma, in Undecidability.TM.Code.Code]
encode_list [definition, in Undecidability.TM.Code.Code]
Encode_list.cX [variable, in Undecidability.TM.Code.Code]
Encode_list.X [variable, in Undecidability.TM.Code.Code]
Encode_list.sigX [variable, in Undecidability.TM.Code.Code]
Encode_list [section, in Undecidability.TM.Code.Code]
Encode_option_injective [lemma, in Undecidability.TM.Code.Code]
Encode_option_hasSize [lemma, in Undecidability.TM.Code.Code]
Encode_option_size [definition, in Undecidability.TM.Code.Code]
Encode_option [instance, in Undecidability.TM.Code.Code]
Encode_option.cX [variable, in Undecidability.TM.Code.Code]
Encode_option.X [variable, in Undecidability.TM.Code.Code]
Encode_option.sigX [variable, in Undecidability.TM.Code.Code]
Encode_option [section, in Undecidability.TM.Code.Code]
Encode_pair_injective [lemma, in Undecidability.TM.Code.Code]
Encode_pair_hasSize [lemma, in Undecidability.TM.Code.Code]
Encode_pair_size [definition, in Undecidability.TM.Code.Code]
Encode_pair [instance, in Undecidability.TM.Code.Code]
Encode_pair.cY [variable, in Undecidability.TM.Code.Code]
Encode_pair.cX [variable, in Undecidability.TM.Code.Code]
Encode_pair.Y [variable, in Undecidability.TM.Code.Code]
Encode_pair.X [variable, in Undecidability.TM.Code.Code]
Encode_pair.sigY [variable, in Undecidability.TM.Code.Code]
Encode_pair.sigX [variable, in Undecidability.TM.Code.Code]
Encode_pair [section, in Undecidability.TM.Code.Code]
Encode_sum_injective [lemma, in Undecidability.TM.Code.Code]
Encode_sum_hasSize [lemma, in Undecidability.TM.Code.Code]
Encode_sum_size [definition, in Undecidability.TM.Code.Code]
Encode_sum [instance, in Undecidability.TM.Code.Code]
Encode_sum.cY [variable, in Undecidability.TM.Code.Code]
Encode_sum.cX [variable, in Undecidability.TM.Code.Code]
Encode_sum.sigY [variable, in Undecidability.TM.Code.Code]
Encode_sum.sigX [variable, in Undecidability.TM.Code.Code]
Encode_sum.Y [variable, in Undecidability.TM.Code.Code]
Encode_sum.X [variable, in Undecidability.TM.Code.Code]
Encode_sum [section, in Undecidability.TM.Code.Code]
Encode_map_comp [lemma, in Undecidability.TM.Code.Code]
Encode_map_id [lemma, in Undecidability.TM.Code.Code]
Encode_map_comp.I2 [variable, in Undecidability.TM.Code.Code]
Encode_map_comp.I1 [variable, in Undecidability.TM.Code.Code]
Encode_map_comp.cX [variable, in Undecidability.TM.Code.Code]
Encode_map_comp.sig3 [variable, in Undecidability.TM.Code.Code]
Encode_map_comp.sig2 [variable, in Undecidability.TM.Code.Code]
Encode_map_comp.sig1 [variable, in Undecidability.TM.Code.Code]
Encode_map_comp.X [variable, in Undecidability.TM.Code.Code]
Encode_map_comp [section, in Undecidability.TM.Code.Code]
Encode_map_injective [lemma, in Undecidability.TM.Code.Code]
Encode_map_hasSize [lemma, in Undecidability.TM.Code.Code]
Encode_map [definition, in Undecidability.TM.Code.Code]
Encode_map.inj [variable, in Undecidability.TM.Code.Code]
Encode_map.cX [variable, in Undecidability.TM.Code.Code]
Encode_map.tau [variable, in Undecidability.TM.Code.Code]
Encode_map.sig [variable, in Undecidability.TM.Code.Code]
Encode_map.X [variable, in Undecidability.TM.Code.Code]
Encode_map [section, in Undecidability.TM.Code.Code]
Encode_Finite_injective [lemma, in Undecidability.TM.Code.Code]
Encode_Finite_hasSize [lemma, in Undecidability.TM.Code.Code]
Encode_Finite [instance, in Undecidability.TM.Code.Code]
Encode_Finite.sig [variable, in Undecidability.TM.Code.Code]
Encode_Finite [section, in Undecidability.TM.Code.Code]
Encode_Fin_injective [lemma, in Undecidability.TM.Code.Code]
Encode_Fin_hasSize [lemma, in Undecidability.TM.Code.Code]
Encode_Fin [instance, in Undecidability.TM.Code.Code]
Encode_bool_injective [lemma, in Undecidability.TM.Code.Code]
Encode_bool_hasSize [lemma, in Undecidability.TM.Code.Code]
Encode_bool [instance, in Undecidability.TM.Code.Code]
Encode_unit_injective [lemma, in Undecidability.TM.Code.Code]
Encode_unit_hasSize [lemma, in Undecidability.TM.Code.Code]
Encode_unit [instance, in Undecidability.TM.Code.Code]
Encode_positive_tl_bits [lemma, in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
Encode_tapes [instance, in Undecidability.TM.Single.EncodeTapes]
encode_tapes [definition, in Undecidability.TM.Single.EncodeTapes]
Encode_tape [instance, in Undecidability.TM.Single.EncodeTapes]
encode_tape [definition, in Undecidability.TM.Single.EncodeTapes]
Encode_positive_is_xH [lemma, in Undecidability.TM.Code.BinNumbers.PosShiftTM]
encode:11 [binder, in Complexity.TM.Code.Decode]
encode:3 [binder, in Complexity.TM.Code.Decode]
Encoding [library]
encodings [section, in Complexity.NP.SAT.FSAT.FormulaEncoding]
encTape [section, in Complexity.L.TM.CompCode]
EncToBoollist [module, in Undecidability.TM.L.Transcode.Enc_to_Boollist]
EncToBoollist.M [definition, in Undecidability.TM.L.Transcode.Enc_to_Boollist]
EncToBoollist.M [section, in Undecidability.TM.L.Transcode.Enc_to_Boollist]
EncToBoollist.M__loop [definition, in Undecidability.TM.L.Transcode.Enc_to_Boollist]
EncToBoollist.M__step [definition, in Undecidability.TM.L.Transcode.Enc_to_Boollist]
EncToBoollist.M.sig [variable, in Undecidability.TM.L.Transcode.Enc_to_Boollist]
EncToBoollist.retr__bool [instance, in Undecidability.TM.L.Transcode.Enc_to_Boollist]
EncToBoollist.retr__nat [instance, in Undecidability.TM.L.Transcode.Enc_to_Boollist]
EncToBoollist.SpecT [lemma, in Undecidability.TM.L.Transcode.Enc_to_Boollist]
EncToBoollist.SpecT__loop [lemma, in Undecidability.TM.L.Transcode.Enc_to_Boollist]
EncToBoollist.SpecT__step [lemma, in Undecidability.TM.L.Transcode.Enc_to_Boollist]
enc_sig_exist_eq [lemma, in Complexity.L.Datatypes.LDepPair]
enc_sig_eq [lemma, in Complexity.L.Datatypes.LDepPair]
enc_vector_eq [lemma, in Undecidability.L.Datatypes.LVector]
enc_finType_eq [lemma, in Undecidability.L.Datatypes.LFinType]
enc_extinj [lemma, in Undecidability.L.Computability.Computability]
enc_bool_perElem_size [lemma, in Undecidability.TM.L.Transcode.BoollistEnc]
enc_boollist_helper [lemma, in Undecidability.TM.L.Transcode.BoollistEnc]
enc_bool_explicit [lemma, in Undecidability.TM.L.Transcode.BoollistEnc]
enc_bool_closing [definition, in Undecidability.TM.L.Transcode.BoollistEnc]
enc_bool_nil [definition, in Undecidability.TM.L.Transcode.BoollistEnc]
enc_bool_perElem [definition, in Undecidability.TM.L.Transcode.BoollistEnc]
Enc_to_Boollist [library]
EndTheorem1 [lemma, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
EndTheorem2 [lemma, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
EnoughSpace [constructor, in Complexity.L.AbstractMachines.FunctionalDefinitions]
Entails [inductive, in Undecidability.TM.Hoare.HoareLogic]
EntailsE [lemma, in Undecidability.TM.Hoare.HoareLogic]
EntailsI [constructor, in Undecidability.TM.Hoare.HoareLogic]
Entails_PO [instance, in Undecidability.TM.Hoare.HoareLogic]
Entails_iff [lemma, in Undecidability.TM.Hoare.HoareLogic]
enum [projection, in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
Enum [library]
EnumerabilityFacts [library]
enumerable [definition, in Undecidability.Synthetic.Definitions]
enumerable_enumerable_T [lemma, in Undecidability.Synthetic.EnumerabilityFacts]
enumerable__T [definition, in Undecidability.Synthetic.EnumerabilityFacts]
enumerable_semi_decidable [lemma, in Undecidability.Synthetic.EnumerabilityFacts]
enumerable_conj [lemma, in Undecidability.Synthetic.MoreEnumerabilityFacts]
enumerable_disj [lemma, in Undecidability.Synthetic.MoreEnumerabilityFacts]
enumerable_enum [lemma, in Undecidability.Synthetic.MoreEnumerabilityFacts]
enumerable_enum [lemma, in Undecidability.Synthetic.ListEnumerabilityFacts]
enumerable_conj [lemma, in Undecidability.Synthetic.ListEnumerabilityFacts]
enumerable_list [lemma, in Undecidability.Synthetic.ListEnumerabilityFacts]
enumerable__T_list_enumerable [lemma, in Undecidability.Synthetic.ListEnumerabilityFacts]
enumerable_list_enumerable [lemma, in Undecidability.Synthetic.ListEnumerabilityFacts]
enumerable_red [lemma, in Undecidability.Synthetic.ReducibilityFacts]
enumerates [abbreviation, in Undecidability.L.Computability.Synthetic]
enumerator [definition, in Undecidability.Synthetic.Definitions]
enumerator_enumerable [lemma, in Undecidability.Synthetic.EnumerabilityFacts]
enumerator__T_option [lemma, in Undecidability.Synthetic.EnumerabilityFacts]
enumerator__T_prod [lemma, in Undecidability.Synthetic.EnumerabilityFacts]
enumerator__T_bool [lemma, in Undecidability.Synthetic.EnumerabilityFacts]
enumerator__T_unit [lemma, in Undecidability.Synthetic.EnumerabilityFacts]
enumerator__T_nat [lemma, in Undecidability.Synthetic.EnumerabilityFacts]
enumerator__T [abbreviation, in Undecidability.Synthetic.EnumerabilityFacts]
enumerator__T' [definition, in Undecidability.Synthetic.EnumerabilityFacts]
enumerator__T_of_list [instance, in Undecidability.Synthetic.ListEnumerabilityFacts]
enumerator__T_to_list [instance, in Undecidability.Synthetic.ListEnumerabilityFacts]
enumerator__T_list [lemma, in Undecidability.Synthetic.ListEnumerabilityFacts]
enumerator_list_enumerator.e [variable, in Undecidability.Synthetic.ListEnumerabilityFacts]
enumerator_list_enumerator.T [variable, in Undecidability.Synthetic.ListEnumerabilityFacts]
enumerator_list_enumerator.X [variable, in Undecidability.Synthetic.ListEnumerabilityFacts]
enumerator_list_enumerator [section, in Undecidability.Synthetic.ListEnumerabilityFacts]
enumerator_to_list_enumerator [lemma, in Undecidability.Synthetic.ListEnumerabilityFacts]
enumerator_list_enumerator.T [variable, in Undecidability.Synthetic.ListEnumerabilityFacts]
enumerator_list_enumerator.e [variable, in Undecidability.Synthetic.ListEnumerabilityFacts]
enumerator_list_enumerator.p [variable, in Undecidability.Synthetic.ListEnumerabilityFacts]
enumerator_list_enumerator.X [variable, in Undecidability.Synthetic.ListEnumerabilityFacts]
enumerator_list_enumerator [section, in Undecidability.Synthetic.ListEnumerabilityFacts]
EnumInt [library]
enum_ok [projection, in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
enum_quotient [lemma, in Undecidability.Shared.Libs.DLW.Utils.quotient]
enum_quotient_rec [lemma, in Undecidability.Shared.Libs.DLW.Utils.quotient]
enum_ok_fromList [lemma, in Undecidability.Shared.Libs.PSL.FiniteTypes.Arbitrary]
enum_enumT [lemma, in Undecidability.Synthetic.ListEnumerabilityFacts]
enum_red [lemma, in Undecidability.Synthetic.ReducibilityFacts]
enum_red.d [variable, in Undecidability.Synthetic.ReducibilityFacts]
enum_red.x0 [variable, in Undecidability.Synthetic.ReducibilityFacts]
enum_red.qe [variable, in Undecidability.Synthetic.ReducibilityFacts]
enum_red.Lq [variable, in Undecidability.Synthetic.ReducibilityFacts]
enum_red.Hf [variable, in Undecidability.Synthetic.ReducibilityFacts]
enum_red.f [variable, in Undecidability.Synthetic.ReducibilityFacts]
enum_red.q [variable, in Undecidability.Synthetic.ReducibilityFacts]
enum_red.p [variable, in Undecidability.Synthetic.ReducibilityFacts]
enum_red.Y [variable, in Undecidability.Synthetic.ReducibilityFacts]
enum_red.X [variable, in Undecidability.Synthetic.ReducibilityFacts]
enum_red [section, in Undecidability.Synthetic.ReducibilityFacts]
envAddSSigma [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
envAddSSigma_envBounded [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
envAddSSigma_isFlatEnvOf [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
envAddState [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
envAddState_envBounded [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
envAddState_isFlatEnvOf [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
envBounded [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
envConst_bound [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
envFinList:3138 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
envFinList:3210 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
envFin:3032 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
envFin:3067 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
envFin:3079 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
envFin:3140 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
envFin:3141 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
envFlatList:3137 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
envFlatList:3209 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
envFlat:3031 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
envFlat:3066 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
envFlat:3078 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
envFlat:3139 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
envFlat:3142 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
envList:3260 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
envList:3265 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
envList:3268 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
envList:3599 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
envList:3633 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
envOfFlatTypes [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
envs:350 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
envs:354 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
envs:364 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
envs:371 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
envs:374 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
envs:377 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
envs:387 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
envs:392 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
envs:395 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
envs:464 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
envs:472 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
envs:479 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
envs:483 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
envs:500 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
envs:521 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
envs:542 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
envs:561 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
envs:567 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
envs:572 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
envs:576 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
envs:587 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
envs:600 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
envs:613 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
envs:707 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
envs:710 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
envs:714 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
envs:768 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
envs:771 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
envs:775 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
env:104 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
env:107 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
env:107 [binder, in Complexity.Libs.CookPrelim.PolyBounds]
env:109 [binder, in Complexity.Libs.CookPrelim.PolyBounds]
env:111 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
env:115 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
env:119 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
env:123 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
env:125 [binder, in Complexity.Libs.CookPrelim.PolyBounds]
env:127 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
env:128 [binder, in Complexity.Libs.CookPrelim.PolyBounds]
env:131 [binder, in Complexity.Libs.CookPrelim.PolyBounds]
env:132 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
env:137 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
env:139 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
env:144 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
env:148 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
env:152 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
env:156 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
env:160 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
env:163 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
env:166 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
env:170 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
env:174 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
env:178 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
env:182 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
env:185 [binder, in Undecidability.L.Tactics.Extract]
env:186 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
env:191 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
env:195 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
env:199 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
env:203 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
env:210 [binder, in Undecidability.L.Tactics.Extract]
env:2930 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
env:2957 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
env:2960 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
env:2963 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
env:2966 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
env:2971 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
env:2974 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
env:2979 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
env:2982 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
env:2986 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
env:2996 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
env:2999 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
env:3002 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
env:3007 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
env:3010 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
env:3015 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
env:3018 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
env:3022 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
env:3045 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
env:3058 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
env:306 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
env:3064 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
env:3075 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
env:3167 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
env:3185 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
env:3195 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
env:3243 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
env:3245 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
env:3248 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
env:3253 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
env:341 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
env:344 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
env:347 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
env:352 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
env:3603 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
env:3605 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
env:399 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
env:401 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
env:405 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
env:407 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
env:412 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
env:414 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
env:422 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
env:424 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
env:49 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
env:51 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
env:52 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
env:55 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
env:59 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
env:62 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
env:77 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
env:80 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
env:84 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
env:88 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
env:94 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
env:99 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
eproc_equiv [lemma, in Undecidability.L.Computability.Seval]
ep_quotient.Hrc [variable, in Undecidability.Shared.Libs.DLW.Utils.quotient]
ep_quotient.Hcr [variable, in Undecidability.Shared.Libs.DLW.Utils.quotient]
ep_quotient.Hrpr [variable, in Undecidability.Shared.Libs.DLW.Utils.quotient]
ep_quotient.rpr [variable, in Undecidability.Shared.Libs.DLW.Utils.quotient]
ep_quotient.P_to_X [variable, in Undecidability.Shared.Libs.DLW.Utils.quotient]
ep_quotient.cls [variable, in Undecidability.Shared.Libs.DLW.Utils.quotient]
ep_quotient.is_min_repr_P [variable, in Undecidability.Shared.Libs.DLW.Utils.quotient]
ep_quotient.Y_discrete [variable, in Undecidability.Shared.Libs.DLW.Utils.quotient]
ep_quotient.pi1_inj [variable, in Undecidability.Shared.Libs.DLW.Utils.quotient]
ep_quotient.Y [variable, in Undecidability.Shared.Libs.DLW.Utils.quotient]
ep_quotient.P_spec [variable, in Undecidability.Shared.Libs.DLW.Utils.quotient]
ep_quotient.P [variable, in Undecidability.Shared.Libs.DLW.Utils.quotient]
ep_quotient.is_min_repr_dec [variable, in Undecidability.Shared.Libs.DLW.Utils.quotient]
ep_quotient.find_min_repr [variable, in Undecidability.Shared.Libs.DLW.Utils.quotient]
ep_quotient.is_min_repr_involutive [variable, in Undecidability.Shared.Libs.DLW.Utils.quotient]
ep_quotient.is_min_repr_inj [variable, in Undecidability.Shared.Libs.DLW.Utils.quotient]
ep_quotient.is_min_repr [variable, in Undecidability.Shared.Libs.DLW.Utils.quotient]
ep_quotient.is_repr_exists [variable, in Undecidability.Shared.Libs.DLW.Utils.quotient]
ep_quotient.is_repr_dec [variable, in Undecidability.Shared.Libs.DLW.Utils.quotient]
ep_quotient.is_repr_trans [variable, in Undecidability.Shared.Libs.DLW.Utils.quotient]
ep_quotient.is_repr [variable, in Undecidability.Shared.Libs.DLW.Utils.quotient]
_ ≈ _ [notation, in Undecidability.Shared.Libs.DLW.Utils.quotient]
ep_quotient.HT1 [variable, in Undecidability.Shared.Libs.DLW.Utils.quotient]
ep_quotient.T [variable, in Undecidability.Shared.Libs.DLW.Utils.quotient]
ep_quotient.HR2 [variable, in Undecidability.Shared.Libs.DLW.Utils.quotient]
ep_quotient.HR1 [variable, in Undecidability.Shared.Libs.DLW.Utils.quotient]
ep_quotient.Hf [variable, in Undecidability.Shared.Libs.DLW.Utils.quotient]
ep_quotient.f [variable, in Undecidability.Shared.Libs.DLW.Utils.quotient]
ep_quotient.R [variable, in Undecidability.Shared.Libs.DLW.Utils.quotient]
ep_quotient.X [variable, in Undecidability.Shared.Libs.DLW.Utils.quotient]
ep_quotient [section, in Undecidability.Shared.Libs.DLW.Utils.quotient]
eqApp [lemma, in Undecidability.L.Util.L_facts]
eqb [definition, in Undecidability.L.Functions.EqBool]
eqbA:34 [binder, in Undecidability.L.Functions.FinTypeLookup]
eqbA:46 [binder, in Undecidability.L.Functions.FinTypeLookup]
eqbA:57 [binder, in Undecidability.L.Functions.FinTypeLookup]
eqbBool_inst [instance, in Undecidability.L.Functions.EqBool]
eqbBoundary [instance, in Complexity.L.TM.CompCode]
eqbClass [record, in Undecidability.L.Functions.EqBool]
eqbClass [inductive, in Undecidability.L.Functions.EqBool]
eqbCompT [record, in Undecidability.L.Functions.EqBool]
eqbCompT:53 [binder, in Undecidability.L.Functions.EqBool]
eqbComp_Prod [instance, in Undecidability.L.Datatypes.LProd]
eqbComp_inp [instance, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
eqbComp_Option [instance, in Undecidability.L.Datatypes.LOptions]
eqbComp_sum [instance, in Undecidability.L.Datatypes.LSum]
eqbComp_sigTape [instance, in Complexity.L.TM.CompCode]
eqbComp_sigSum [instance, in Complexity.L.TM.CompCode]
eqbComp_sigOption [instance, in Complexity.L.TM.CompCode]
eqbComp_sigPair [instance, in Complexity.L.TM.CompCode]
eqbComp_ACom [instance, in Complexity.L.TM.CompCode]
eqbComp_sigNat [instance, in Complexity.L.TM.CompCode]
eqbComp_sigList [instance, in Complexity.L.TM.CompCode]
eqbComp_boundary [instance, in Complexity.L.TM.CompCode]
eqbComp_List [instance, in Undecidability.L.Datatypes.LVector]
eqbComp_bool [instance, in Undecidability.L.Functions.EqBool]
eqbComp_List [instance, in Undecidability.L.Datatypes.List.List_eqb]
eqbComp_bool [instance, in Undecidability.L.TM.TMEncoding]
eqbComp_nat [instance, in Undecidability.L.Datatypes.LNat]
eqbComp_nat [instance, in Undecidability.L.Functions.Equality]
eqbFinType [instance, in Undecidability.L.Datatypes.LFinType]
eqbFinType_inst [instance, in Undecidability.L.Datatypes.LFinType]
eqbList [instance, in Undecidability.L.Datatypes.List.List_eqb]
eqbNat_inst [instance, in Undecidability.L.Datatypes.LNat]
EqBool [library]
eqBool_inp_eqb [instance, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
eqbOption [instance, in Undecidability.L.Datatypes.LOptions]
eqbProd [instance, in Undecidability.L.Datatypes.LProd]
eqbSigList [instance, in Complexity.L.TM.CompCode]
eqbSigNat [instance, in Complexity.L.TM.CompCode]
eqbSigPair [instance, in Complexity.L.TM.CompCode]
eqbSigTape [instance, in Complexity.L.TM.CompCode]
eqbSum [instance, in Undecidability.L.Datatypes.LSum]
eqbTerm [instance, in Undecidability.L.Functions.Equality]
eqbTime_le_r [lemma, in Undecidability.L.Functions.EqBool]
eqbTime_le_l [lemma, in Undecidability.L.Functions.EqBool]
eqbT:21 [binder, in Undecidability.L.Datatypes.LOptions]
eqbT:34 [binder, in Undecidability.L.Datatypes.List.List_eqb]
eqbT:40 [binder, in Undecidability.L.Datatypes.List.List_eqb]
eqbT:43 [binder, in Undecidability.L.Datatypes.List.List_eqb]
eqbT:49 [binder, in Undecidability.L.Datatypes.List.List_eqb]
eqbT:80 [binder, in Undecidability.L.Datatypes.LVector]
eqbVector [instance, in Undecidability.L.Datatypes.LVector]
eqbX:103 [binder, in Complexity.L.TM.TMflatComp]
eqbX:115 [binder, in Complexity.L.TM.TMunflatten]
eqbX:127 [binder, in Complexity.L.TM.TMunflatten]
eqbX:136 [binder, in Complexity.L.TM.TMunflatten]
eqbX:143 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
eqbX:150 [binder, in Complexity.L.TM.TMunflatten]
eqbX:24 [binder, in Undecidability.L.Datatypes.List.List_in]
eqbX:3 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
eqbX:3 [binder, in Undecidability.L.Functions.FinTypeLookup]
eqbX:51 [binder, in Undecidability.L.Datatypes.List.List_in]
eqbX:67 [binder, in Undecidability.L.Functions.FinTypeLookup]
eqbX:77 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
eqbX:84 [binder, in Complexity.NP.SAT.SAT_inNP]
eqbx:91 [binder, in Undecidability.L.Datatypes.LVector]
eqbY:104 [binder, in Complexity.L.TM.TMflatComp]
eqbY:116 [binder, in Complexity.L.TM.TMunflatten]
eqbY:128 [binder, in Complexity.L.TM.TMunflatten]
eqbY:137 [binder, in Complexity.L.TM.TMunflatten]
eqbY:151 [binder, in Complexity.L.TM.TMunflatten]
eqb_time_bound_r [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
eqb_sigSum [instance, in Complexity.L.TM.CompCode]
eqb_sigOption [instance, in Complexity.L.TM.CompCode]
eqb_ACom [instance, in Complexity.L.TM.CompCode]
eqb_spec [lemma, in Undecidability.L.Functions.EqBool]
eqb_false_iff [lemma, in Complexity.Libs.CookPrelim.Tactics]
eqb_move [instance, in Undecidability.L.TM.TMEncoding]
eqB:12 [binder, in Undecidability.L.Complexity.UpToCNary]
eqb:134 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
eqB:16 [binder, in Undecidability.L.Complexity.UpToCNary]
eqb:2 [binder, in Undecidability.L.Functions.EqBool]
eqB:20 [binder, in Undecidability.L.Complexity.UpToCNary]
eqb:20 [binder, in Undecidability.L.Datatypes.LOptions]
eqb:21 [binder, in Undecidability.L.Complexity.UpToCNary]
eqb:23 [binder, in Undecidability.L.Functions.EqBool]
eqb:26 [binder, in Undecidability.L.Datatypes.List.List_nat]
eqb:3 [binder, in Undecidability.L.Datatypes.List.List_eqb]
eqb:32 [binder, in Undecidability.L.Functions.EqBool]
eqb:44 [binder, in Undecidability.L.Functions.EqBool]
eqb:51 [binder, in Undecidability.L.Functions.EqBool]
eqb:79 [binder, in Undecidability.L.Datatypes.LVector]
eqB:8 [binder, in Undecidability.L.Complexity.UpToCNary]
eqb:8 [binder, in Undecidability.L.Functions.EqBool]
eqdec [definition, in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
EqDec [library]
eqDec_remove [lemma, in Undecidability.L.Functions.EqBool]
eqdec:17 [binder, in Complexity.Libs.Pigeonhole]
eqdec:31 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
eqRef [constructor, in Undecidability.L.Util.L_facts]
eqrel [definition, in Undecidability.TM.Util.Relations]
eqrel_eq [instance, in Undecidability.TM.Util.Relations]
eqrel_pre [instance, in Undecidability.TM.Util.Relations]
eqStarT [lemma, in Undecidability.L.Util.L_facts]
eqStep [constructor, in Undecidability.L.Util.L_facts]
eqSym [constructor, in Undecidability.L.Util.L_facts]
eqTrans [constructor, in Undecidability.L.Util.L_facts]
eqType [record, in Undecidability.Shared.Libs.PSL.EqDec]
EqType [constructor, in Undecidability.Shared.Libs.PSL.EqDec]
eqType [record, in Undecidability.Shared.Dec]
EqType [constructor, in Undecidability.Shared.Dec]
eqType_CS [definition, in Undecidability.Shared.Libs.PSL.EqDec]
eqType_dec [projection, in Undecidability.Shared.Libs.PSL.EqDec]
eqType_X [projection, in Undecidability.Shared.Libs.PSL.EqDec]
eqType_CS [definition, in Undecidability.Shared.Dec]
eqType_dec [projection, in Undecidability.Shared.Dec]
eqType_X [projection, in Undecidability.Shared.Dec]
eqType_depPair [instance, in Undecidability.Shared.Libs.PSL.FiniteTypes.DepPairs]
eqT:15 [binder, in Undecidability.L.Datatypes.List.List_eqb]
Equality [library]
equal_upto [abbreviation, in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
equal_lb_mask_equiv [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
equal_equiv [lemma, in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
Equi [section, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
equi [definition, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
equi [definition, in Undecidability.Shared.ListAutomation]
equiv [inductive, in Undecidability.L.Util.L_facts]
Equivalence_property_exists [lemma, in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
Equivalence_property_all [lemma, in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
equiv_many_app_L [lemma, in Undecidability.TM.L.CompilerBoolFuns.NaryApp]
equiv_eval_proper [instance, in Undecidability.L.Util.L_facts]
equiv_app_proper [instance, in Undecidability.L.Util.L_facts]
equiv_lambda [lemma, in Undecidability.L.Util.L_facts]
equiv_ecl [lemma, in Undecidability.L.Util.L_facts]
equiv_Equivalence [instance, in Undecidability.L.Util.L_facts]
equiv_eva [lemma, in Undecidability.L.Computability.Seval]
equiv_fold_left [lemma, in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
equiv_R [lemma, in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
equiv_eval_equiv [lemma, in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
equi_rotate [lemma, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
equi_shift [lemma, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
equi_swap [lemma, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
equi_dup [lemma, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
equi_push [lemma, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
equi_Equivalence [instance, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
equi_Equivalence [instance, in Undecidability.Shared.ListAutomation]
Equi.X [variable, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
eq_ref [lemma, in Undecidability.L.Prelim.ARS]
eq_nth_iff' [lemma, in Undecidability.TM.Compound.TMTac]
eq_nth_iff' [lemma, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
eq_inductive [definition, in Undecidability.L.Tactics.Extract]
eq_leUpToC_subrelation [instance, in Undecidability.L.Complexity.UpToC]
eq__start:46 [binder, in Complexity.L.TM.TMflat]
eq__states:44 [binder, in Complexity.L.TM.TMflat]
eq__sig:43 [binder, in Complexity.L.TM.TMflat]
eq__tapes:42 [binder, in Complexity.L.TM.TMflat]
Eq_in_equivalence [instance, in Undecidability.TM.Util.Relations]
Eq_in [definition, in Undecidability.TM.Util.Relations]
eq_term_dec [lemma, in Undecidability.L.Computability.Computability]
Eq_ldec [lemma, in Undecidability.L.Computability.Scott]
eq:14 [binder, in Undecidability.L.Datatypes.List.List_eqb]
err:84 [binder, in Undecidability.L.Tactics.Extract]
err:88 [binder, in Undecidability.L.Tactics.Extract]
esimRules [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
esim_sim_agree [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
eSize [definition, in Undecidability.L.Computability.Enum]
estateRules [inductive, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
es:161 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
es:170 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
Eta [lemma, in Undecidability.L.Util.L_facts]
etransHaltC [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
etransNoneLeft [inductive, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
etransNoneLeftCenterC [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
etransNoneLeftLeftC [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
etransNoneLeftRightC [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
etransNoneNoneLeft [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
etransNoneNoneRight [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
etransNoneNoneStay [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
etransNoneRight [inductive, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
etransNoneRightCenterC [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
etransNoneRightLeftC [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
etransNoneRightRightC [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
etransNoneStay [inductive, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
etransNoneStayCenterC [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
etransNoneStayLeftC [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
etransNoneStayRightC [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
etransNonHaltC [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
etransRules [inductive, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
etransSomeLeft [inductive, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
etransSomeLeftCenterC [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
etransSomeLeftLeftC [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
etransSomeLeftRightC [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
etransSomeNoneLeft [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
etransSomeNoneRight [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
etransSomeNoneStay [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
etransSomeRight [inductive, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
etransSomeRightCenterC [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
etransSomeRightLeftC [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
etransSomeRightRightC [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
etransSomeStay [inductive, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
etransSomeStayCenterC [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
etransSomeStayLeftC [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
etransSomeStayRightC [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
etransXSomeLeft [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
etransXSomeRight [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
etransXSomeStay [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
euclid [definition, in Undecidability.Shared.Libs.DLW.Utils.gcd]
Euclid [section, in Undecidability.Shared.Libs.DLW.Utils.gcd]
euclid_2 [lemma, in Undecidability.Shared.Libs.DLW.Utils.gcd]
euclid_2_div [lemma, in Undecidability.Shared.Libs.DLW.Utils.gcd]
eva [definition, in Undecidability.L.Computability.Seval]
Eval [definition, in Undecidability.L.Functions.Eval]
eval [definition, in Undecidability.L.Util.L_facts]
eval [inductive, in Undecidability.L.L]
eval [inductive, in Undecidability.TM.TM]
eval [inductive, in Undecidability.TM.SBTM]
Eval [library]
Eval [library]
evalClause [definition, in Complexity.NP.SAT.SAT]
evalClause_poly [lemma, in Complexity.NP.SAT.SAT_inNP]
evalClause_time [definition, in Complexity.NP.SAT.SAT_inNP]
evalClause_assgn_equiv [lemma, in Complexity.NP.SAT.SAT]
evalClause_app [lemma, in Complexity.NP.SAT.SAT]
evalClause_literal_iff [lemma, in Complexity.NP.SAT.SAT]
evalClause_step_inv [lemma, in Complexity.NP.SAT.SAT]
evalCnf [definition, in Complexity.NP.SAT.SAT]
evalCnf_poly [lemma, in Complexity.NP.SAT.SAT_inNP]
evalCnf_time [definition, in Complexity.NP.SAT.SAT_inNP]
evalCnf_assgn_equiv [lemma, in Complexity.NP.SAT.SAT]
evalCnf_app_iff [lemma, in Complexity.NP.SAT.SAT]
evalCnf_clause_iff [lemma, in Complexity.NP.SAT.SAT]
evalCnf_step_inv [lemma, in Complexity.NP.SAT.SAT]
evalEnv [record, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
evalEnvFin [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
evalEnvFlat [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
evalevaluates_evaluatesIn [lemma, in Undecidability.L.Prelim.ARS]
evalFormula [definition, in Complexity.NP.SAT.FSAT.FSAT]
evalFormula_prim_iff [lemma, in Complexity.NP.SAT.FSAT.FSAT]
evalFormula_not_iff [lemma, in Complexity.NP.SAT.FSAT.FSAT]
evalFormula_or_iff [lemma, in Complexity.NP.SAT.FSAT.FSAT]
evalFormula_and_iff' [lemma, in Complexity.NP.SAT.FSAT.FSAT]
evalFormula_and_iff [lemma, in Complexity.NP.SAT.FSAT.FSAT]
evalForTime [definition, in Complexity.L.AbstractMachines.Computable.EvalForTime]
EvalForTime [library]
evalForTimeBool [definition, in Complexity.L.AbstractMachines.Computable.EvalForTimeBool]
EvalForTimeBool [library]
evalForTimeBool__comp [instance, in Complexity.L.AbstractMachines.Computable.EvalForTimeBool]
evalForTimeBool_spec [lemma, in Complexity.L.AbstractMachines.Computable.EvalForTimeBool]
evalForTime_spec [lemma, in Complexity.L.AbstractMachines.Computable.EvalForTime]
evalForTime_comp [instance, in Complexity.L.AbstractMachines.Computable.EvalForTime]
evalForTime__step [definition, in Complexity.L.AbstractMachines.Computable.EvalForTime]
evalIn [definition, in Undecidability.L.Util.L_facts]
evalIn_unique [lemma, in Undecidability.L.Util.L_facts]
evalIn_trans [lemma, in Undecidability.L.Util.L_facts]
evalIn_mono [lemma, in Undecidability.L.Util.L_facts]
evalIn_eval_subrelation [instance, in Undecidability.L.Util.L_facts]
evalIn_evalLe_subrelation [instance, in Undecidability.L.Util.L_facts]
evalIn_evalLe [lemma, in Undecidability.L.Util.L_facts]
evalIn_refl [lemma, in Undecidability.L.Tactics.Lbeta]
EvalL [module, in Undecidability.TM.L.Eval]
evalLe [definition, in Undecidability.L.Util.L_facts]
evalLe_trans_rev [lemma, in Undecidability.L.Util.L_facts]
evalLe_trans [lemma, in Undecidability.L.Util.L_facts]
evalLe_redLe_subrelation [instance, in Undecidability.L.Util.L_facts]
evalLe_evalIn [lemma, in Undecidability.L.Util.L_facts]
evalLe_eval_subrelation [instance, in Undecidability.L.Util.L_facts]
evalLiteral [definition, in Complexity.NP.SAT.SAT]
evalLiteral_time [definition, in Complexity.NP.SAT.SAT_inNP]
evalLiteral_true_no_conflict [lemma, in Complexity.NP.Clique.kSAT_to_Clique]
evalLiteral_assgn_equiv [lemma, in Complexity.NP.SAT.SAT]
evalLiteral_var_iff [lemma, in Complexity.NP.SAT.SAT]
EvalL.Fix [section, in Undecidability.TM.L.Eval]
EvalL.Fix.Σ [variable, in Undecidability.TM.L.Eval]
EvalL.M [definition, in Undecidability.TM.L.Eval]
EvalL.retr_heap [instance, in Undecidability.TM.L.Eval]
EvalL.retr_nat_clos_ad [instance, in Undecidability.TM.L.Eval]
EvalL.retr_nat_clos_ad' [instance, in Undecidability.TM.L.Eval]
EvalL.retr_pro_intrp [instance, in Undecidability.TM.L.Eval]
EvalL.retr_clos_intrp [instance, in Undecidability.TM.L.Eval]
EvalL.retr_closs_intrp [instance, in Undecidability.TM.L.Eval]
EvalL.retr_interpreter [definition, in Undecidability.TM.L.Eval]
EvalL.retr_unfolder [definition, in Undecidability.TM.L.Eval]
EvalL.Spec [lemma, in Undecidability.TM.L.Eval]
EvalL.SpecT [lemma, in Undecidability.TM.L.Eval]
EvalL.steps [definition, in Undecidability.TM.L.Eval]
EvalL.Σintern [definition, in Undecidability.TM.L.Eval]
evalTime [definition, in Undecidability.L.Tactics.ComputableTime]
evalTime:25 [binder, in Undecidability.L.Tactics.ComputableTime]
evalTime:32 [binder, in Undecidability.L.Tactics.ComputableTime]
evalTime:42 [binder, in Undecidability.L.Tactics.ComputableTime]
evaluates [definition, in Undecidability.L.Prelim.ARS]
evaluatesIn [definition, in Undecidability.L.Prelim.ARS]
evalVar [definition, in Complexity.NP.SAT.SharedSAT]
evalVar [abbreviation, in Complexity.NP.SAT.SAT]
evalVar_assgn_equiv [lemma, in Complexity.NP.SAT.SharedSAT]
evalVar_monotonic [lemma, in Complexity.NP.SAT.SharedSAT]
evalVar_in_iff [lemma, in Complexity.NP.SAT.SharedSAT]
evalVar_time [definition, in Complexity.NP.SAT.SAT_inNP]
evalVar_not_assgn_varsIn_false [lemma, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
Eval_converges [lemma, in Undecidability.L.Functions.Eval]
eval_converges [lemma, in Undecidability.L.Functions.Eval]
Eval_eval [lemma, in Undecidability.L.Functions.Eval]
eval_Eval [lemma, in Undecidability.L.Functions.Eval]
Eval_correct [lemma, in Undecidability.L.Functions.Eval]
eval_iff [lemma, in Undecidability.L.Util.L_facts]
eval_evalIn [lemma, in Undecidability.L.Util.L_facts]
eval_star_subrelation [instance, in Undecidability.L.Util.L_facts]
eval_unique [lemma, in Undecidability.L.Util.L_facts]
eval_rect [lemma, in Undecidability.L.Computability.Seval]
eval_seval [lemma, in Undecidability.L.Computability.Seval]
eval_step [lemma, in Undecidability.L.Computability.Seval]
eval_converges [lemma, in Undecidability.L.Computability.Seval]
eval_app [constructor, in Undecidability.L.L]
eval_abs [constructor, in Undecidability.L.L]
eval_step [constructor, in Undecidability.TM.TM]
eval_halt [constructor, in Undecidability.TM.TM]
eval_step [constructor, in Undecidability.TM.SBTM]
eval_halt [constructor, in Undecidability.TM.SBTM]
eval_refl [lemma, in Undecidability.L.Tactics.Lbeta]
eval_helper [lemma, in Undecidability.L.Tactics.Lbeta]
eva_Sn_n [lemma, in Undecidability.L.Computability.Seval]
eva_n_Sn [lemma, in Undecidability.L.Computability.Seval]
eva_equiv [lemma, in Undecidability.L.Computability.Seval]
eva_seval_iff [lemma, in Undecidability.L.Computability.Seval]
eva_seval [lemma, in Undecidability.L.Computability.Seval]
eva_lam [lemma, in Undecidability.L.Computability.Seval]
execFlatTM [definition, in Complexity.L.TM.TMflatFun]
execFlatTM_time [definition, in Complexity.L.TM.TMflatComp]
execFlatTM_isValidFlatTapes [lemma, in Complexity.NP.SAT.CookLevin.Reductions.TMGenNP_fixed_singleTapeTM_to_FlatFunSingleTMGenNP]
execFlatTM_correct [lemma, in Complexity.L.TM.TMflatFun]
execFlat_poly [lemma, in Complexity.L.TM.TMflatComp]
execTM [definition, in Undecidability.TM.Util.TM_facts]
execTM_p [definition, in Undecidability.TM.Util.TM_facts]
execution [definition, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
exh_size [definition, in Undecidability.L.Computability.Enum]
existsb_time [definition, in Complexity.NP.SAT.SAT_inNP]
exists_dec_fin_t [lemma, in Undecidability.Shared.Libs.DLW.Utils.fin_dec]
exists_equiv [lemma, in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
exists_equiv.HPQ [variable, in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
exists_equiv.Q [variable, in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
exists_equiv.P [variable, in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
exists_equiv.X [variable, in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
exists_equiv [section, in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
exists_assignment [lemma, in Complexity.NP.Clique.kSAT_to_Clique]
exists_clique [lemma, in Complexity.NP.Clique.kSAT_to_Clique]
exists_clique' [lemma, in Complexity.NP.Clique.kSAT_to_Clique]
expand [definition, in Undecidability.Shared.Libs.DLW.Utils.prime]
expandDenote [lemma, in Undecidability.L.Tactics.Reflection]
expand_0 [lemma, in Undecidability.Shared.Libs.DLW.Utils.prime]
expand_app [lemma, in Undecidability.Shared.Libs.DLW.Utils.prime]
expAssgn_to_assgn_inv [lemma, in Complexity.NP.SAT.FSAT.FormulaEncoding]
expAssgn_to_assgn [lemma, in Complexity.NP.SAT.FSAT.FormulaEncoding]
explicitAssignment [definition, in Complexity.NP.SAT.FSAT.FormulaEncoding]
explicitAssignment_app [lemma, in Complexity.NP.SAT.FSAT.FormulaEncoding]
explicitAssignment_nth [lemma, in Complexity.NP.SAT.FSAT.FormulaEncoding]
explicitAssignment_length [lemma, in Complexity.NP.SAT.FSAT.FormulaEncoding]
explicit_bounds.sat_NP [lemma, in Complexity.L.ComparisonTimeBoundDerivation]
explicit_bounds.sat_verifierb_poly [lemma, in Complexity.L.ComparisonTimeBoundDerivation]
explicit_bounds.sat_verifierb_time_bound [lemma, in Complexity.L.ComparisonTimeBoundDerivation]
explicit_bounds.poly__satVerifierb [definition, in Complexity.L.ComparisonTimeBoundDerivation]
explicit_bounds.term_sat_verifierb [instance, in Complexity.L.ComparisonTimeBoundDerivation]
explicit_bounds.sat_verifierb_time [definition, in Complexity.L.ComparisonTimeBoundDerivation]
explicit_bounds.c__satVerifierb [definition, in Complexity.L.ComparisonTimeBoundDerivation]
explicit_bounds.evalCnf_poly [lemma, in Complexity.L.ComparisonTimeBoundDerivation]
explicit_bounds.evalCnf_time_bound [lemma, in Complexity.L.ComparisonTimeBoundDerivation]
explicit_bounds.poly__evalCnf [definition, in Complexity.L.ComparisonTimeBoundDerivation]
explicit_bounds.forallb_time_explicit [lemma, in Complexity.L.ComparisonTimeBoundDerivation]
explicit_bounds.term_evalCnf [instance, in Complexity.L.ComparisonTimeBoundDerivation]
explicit_bounds.evalCnf_time [definition, in Complexity.L.ComparisonTimeBoundDerivation]
explicit_bounds.c__evalCnf [definition, in Complexity.L.ComparisonTimeBoundDerivation]
explicit_bounds.evalClause_poly [lemma, in Complexity.L.ComparisonTimeBoundDerivation]
explicit_bounds.evalClause_time_bound [lemma, in Complexity.L.ComparisonTimeBoundDerivation]
explicit_bounds.poly__evalClause [definition, in Complexity.L.ComparisonTimeBoundDerivation]
explicit_bounds.existsb_time_explicit [lemma, in Complexity.L.ComparisonTimeBoundDerivation]
explicit_bounds.term_evalClause [instance, in Complexity.L.ComparisonTimeBoundDerivation]
explicit_bounds.evalClause_time [definition, in Complexity.L.ComparisonTimeBoundDerivation]
explicit_bounds.c__evalClause [definition, in Complexity.L.ComparisonTimeBoundDerivation]
explicit_bounds.term_forallb [instance, in Complexity.L.ComparisonTimeBoundDerivation]
explicit_bounds.forallb_time [definition, in Complexity.L.ComparisonTimeBoundDerivation]
explicit_bounds.c__forallb [definition, in Complexity.L.ComparisonTimeBoundDerivation]
explicit_bounds.term_existsb [instance, in Complexity.L.ComparisonTimeBoundDerivation]
explicit_bounds.existsb_time [definition, in Complexity.L.ComparisonTimeBoundDerivation]
explicit_bounds.c__existsb [definition, in Complexity.L.ComparisonTimeBoundDerivation]
explicit_bounds.explicit_bounds.fixX [section, in Complexity.L.ComparisonTimeBoundDerivation]
explicit_bounds.evalLiteral_poly [lemma, in Complexity.L.ComparisonTimeBoundDerivation]
explicit_bounds.evalLiteral_time_bound [lemma, in Complexity.L.ComparisonTimeBoundDerivation]
explicit_bounds.poly__evalLiteral [definition, in Complexity.L.ComparisonTimeBoundDerivation]
explicit_bounds.term_evalLiteral [instance, in Complexity.L.ComparisonTimeBoundDerivation]
explicit_bounds.evalLiteral_time [definition, in Complexity.L.ComparisonTimeBoundDerivation]
explicit_bounds.c__evalLiteral [definition, in Complexity.L.ComparisonTimeBoundDerivation]
explicit_bounds.evalVar_poly [lemma, in Complexity.L.ComparisonTimeBoundDerivation]
explicit_bounds.evalVar_time_bound [lemma, in Complexity.L.ComparisonTimeBoundDerivation]
explicit_bounds.poly__evalVar [definition, in Complexity.L.ComparisonTimeBoundDerivation]
explicit_bounds.term_evalVar [instance, in Complexity.L.ComparisonTimeBoundDerivation]
explicit_bounds.evalVar_time [definition, in Complexity.L.ComparisonTimeBoundDerivation]
explicit_bounds.c__evalVar [definition, in Complexity.L.ComparisonTimeBoundDerivation]
explicit_bounds.ntodo [abbreviation, in Complexity.L.ComparisonTimeBoundDerivation]
explicit_bounds.TODO [definition, in Complexity.L.ComparisonTimeBoundDerivation]
explicit_bounds.term_list_in_decb [instance, in Complexity.L.ComparisonTimeBoundDerivation]
explicit_bounds.list_in_decb_time [definition, in Complexity.L.ComparisonTimeBoundDerivation]
explicit_bounds.c__listInDecb [definition, in Complexity.L.ComparisonTimeBoundDerivation]
explicit_bounds.explicit_bounds.fixXeq.X [variable, in Complexity.L.ComparisonTimeBoundDerivation]
explicit_bounds.explicit_bounds.fixXeq [section, in Complexity.L.ComparisonTimeBoundDerivation]
explicit_bounds.explicit_bounds [section, in Complexity.L.ComparisonTimeBoundDerivation]
explicit_bounds [module, in Complexity.L.ComparisonTimeBoundDerivation]
expo [abbreviation, in Undecidability.Shared.Libs.DLW.Utils.sums]
ExPTCC [definition, in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
ext [projection, in Undecidability.L.Tactics.Computable]
extApp [lemma, in Undecidability.L.Tactics.Computable]
extApp' [instance, in Undecidability.L.Tactics.Computable]
extCorrect [projection, in Undecidability.L.Tactics.Computable]
extended [definition, in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
extended [definition, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
extended_PO [instance, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
extended_PO [instance, in Complexity.L.AbstractMachines.AbstractHeapMachine]
extEq [definition, in Undecidability.L.Tactics.Computable]
extEq_refl [instance, in Undecidability.L.Tactics.Computable]
extract [definition, in Undecidability.L.Tactics.Extract]
Extract [library]
extractCaseEtaExpand:219 [binder, in Undecidability.L.Tactics.Extract]
extracted [record, in Undecidability.L.Tactics.Extract]
extracted [inductive, in Undecidability.L.Tactics.Extract]
extraction [section, in Complexity.NP.SAT.SAT_inNP]
extraction.fixXeq [section, in Complexity.NP.SAT.SAT_inNP]
extraction.fixXeq.X [variable, in Complexity.NP.SAT.SAT_inNP]
extractRes [definition, in Complexity.L.AbstractMachines.Computable.EvalForTime]
extract_constr [definition, in Undecidability.L.Tactics.Extract]
extT [projection, in Undecidability.L.Tactics.ComputableTime]
extTApp [lemma, in Undecidability.L.Tactics.ComputableTime]
extTApp' [instance, in Undecidability.L.Tactics.ComputableTime]
extTCorrect [projection, in Undecidability.L.Tactics.ComputableTime]
extT_rel_helper [lemma, in Undecidability.L.Tactics.Lrewrite]
extT_is_enc [lemma, in Undecidability.L.Tactics.ComputableTime]
ext_rel_helper [lemma, in Undecidability.L.Tactics.Lrewrite]
ext_is_enc [lemma, in Undecidability.L.Tactics.Computable]
E__spec [lemma, in Complexity.HierarchyTheorem.TimeHierarchyTheorem]
E_alphabet [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
E_cover_sym_rem_rev [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
E_cover_sym_rem [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
E_cover_sym_rev [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
E_cover_sym [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
E_cover_blank_rev [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
E_cover_blank [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
E_polarityFlip [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
E_length [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
E_symm [projection, in Complexity.NP.Clique.UGraph]
E_dec [projection, in Complexity.NP.Clique.UGraph]
E':119 [binder, in Undecidability.Shared.Libs.PSL.Retracts]
E':134 [binder, in Undecidability.Shared.Libs.PSL.Retracts]
E':152 [binder, in Undecidability.Shared.Libs.PSL.Retracts]
e':2668 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
e':2689 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
E':43 [binder, in Undecidability.L.Tactics.GenEncode]
e':73 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
e':9 [binder, in Undecidability.TM.L.HeapInterpreter.LookupTM]
e1:139 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
e1:3037 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
e1:3081 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
e1:34 [binder, in Complexity.NP.Clique.FlatUGraph]
e1:36 [binder, in Complexity.NP.Clique.FlatUGraph]
e2:3038 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
e2:3082 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
e2:35 [binder, in Complexity.NP.Clique.FlatUGraph]
e2:37 [binder, in Complexity.NP.Clique.FlatUGraph]
E:1 [binder, in Complexity.NP.Clique.FlatUGraph]
E:100 [binder, in Complexity.TM.PrettyBounds.UnivBounds]
e:100 [binder, in Complexity.NP.Clique.FlatClique]
E:103 [binder, in Complexity.NP.Clique.FlatClique]
e:104 [binder, in Complexity.NP.Clique.FlatClique]
E:105 [binder, in Complexity.NP.Clique.FlatClique]
E:106 [binder, in Complexity.NP.Clique.FlatClique]
E:107 [binder, in Complexity.NP.Clique.FlatClique]
E:108 [binder, in Complexity.NP.Clique.FlatClique]
e:11 [binder, in Undecidability.Shared.Libs.PSL.EqDec]
E:11 [binder, in Undecidability.L.Tactics.GenEncode]
E:110 [binder, in Complexity.NP.Clique.FlatClique]
e:113 [binder, in Complexity.NP.Clique.FlatClique]
E:114 [binder, in Undecidability.L.Tactics.Extract]
E:115 [binder, in Complexity.NP.Clique.FlatClique]
e:116 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
E:117 [binder, in Complexity.NP.Clique.FlatClique]
E:118 [binder, in Undecidability.Shared.Libs.PSL.Retracts]
E:12 [binder, in Complexity.NP.Clique.FlatUGraph]
E:120 [binder, in Complexity.NP.Clique.FlatClique]
e:121 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
E:123 [binder, in Complexity.NP.Clique.FlatClique]
e:13 [binder, in Complexity.NP.Clique.FlatUGraph]
E:133 [binder, in Undecidability.Shared.Libs.PSL.Retracts]
e:14 [binder, in Undecidability.TM.L.HeapInterpreter.LookupTM]
e:143 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
e:149 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
e:15 [binder, in Complexity.NP.Clique.FlatUGraph]
E:15 [binder, in Complexity.NP.Clique.FlatClique]
E:151 [binder, in Undecidability.Shared.Libs.PSL.Retracts]
e:16 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
e:162 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
e:165 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
e:166 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
e:169 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
e:171 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
e:174 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
e:174 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
e:175 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
E:19 [binder, in Complexity.NP.Clique.FlatUGraph]
e:19 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
e:19 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
e:2 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
e:20 [binder, in Complexity.NP.Clique.FlatUGraph]
E:200 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
E:22 [binder, in Complexity.NP.Clique.FlatClique]
e:22 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
e:228 [binder, in Complexity.L.TM.TMflatComp]
e:238 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
e:24 [binder, in Complexity.NP.Clique.FlatUGraph]
E:24 [binder, in Complexity.NP.Clique.FlatClique]
e:242 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
e:250 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
e:2547 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
e:2661 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
e:2682 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
e:2695 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
e:2789 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
E:28 [binder, in Complexity.NP.Clique.FlatUGraph]
e:28 [binder, in Undecidability.L.Datatypes.List.List_in]
e:2959 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
e:303 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
e:3052 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
e:307 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
E:31 [binder, in Complexity.NP.Clique.FlatUGraph]
e:312 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
e:312 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
e:318 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
e:319 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
e:33 [binder, in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
e:34 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
e:346 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
e:36 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
e:367 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
e:376 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
E:38 [binder, in Complexity.NP.Clique.FlatUGraph]
e:39 [binder, in Complexity.NP.Clique.FlatUGraph]
e:390 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
e:397 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
e:4 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
E:4 [binder, in Complexity.NP.Clique.FlatClique]
e:40 [binder, in Undecidability.Shared.Libs.PSL.Lists.Position]
e:41 [binder, in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
e:41 [binder, in Complexity.NP.Clique.FlatUGraph]
E:42 [binder, in Undecidability.Shared.Libs.PSL.Lists.Position]
E:42 [binder, in Complexity.NP.Clique.FlatUGraph]
e:424 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
e:43 [binder, in Undecidability.Shared.Libs.PSL.Retracts]
E:44 [binder, in Undecidability.L.Tactics.GenEncode]
E:44 [binder, in Complexity.NP.Clique.FlatUGraph]
e:447 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
E:46 [binder, in Complexity.NP.Clique.FlatClique]
e:465 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
e:465 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
e:47 [binder, in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
e:47 [binder, in Complexity.NP.Clique.FlatClique]
E:48 [binder, in Complexity.NP.Clique.FlatClique]
e:489 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
e:49 [binder, in Complexity.NP.Clique.FlatClique]
e:5 [binder, in Complexity.NP.Clique.FlatUGraph]
E:50 [binder, in Complexity.NP.Clique.FlatClique]
E:53 [binder, in Complexity.NP.Clique.FlatUGraph]
E:53 [binder, in Complexity.NP.Clique.FlatClique]
E:56 [binder, in Complexity.NP.Clique.FlatClique]
e:562 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
E:58 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
e:580 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
e:6 [binder, in Complexity.L.TM.TMflatEnc]
e:60 [binder, in Undecidability.L.Tactics.GenEncode]
E:60 [binder, in Complexity.NP.Clique.FlatClique]
E:63 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
E:64 [binder, in Complexity.NP.Clique.FlatClique]
E:66 [binder, in Complexity.NP.Clique.FlatClique]
e:69 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
e:7 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
E:70 [binder, in Complexity.NP.Clique.FlatClique]
e:716 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
E:73 [binder, in Complexity.NP.Clique.FlatUGraph]
E:75 [binder, in Complexity.NP.Clique.FlatClique]
e:76 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
e:777 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
e:78 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
E:79 [binder, in Complexity.NP.Clique.FlatClique]
E:8 [binder, in Complexity.NP.Clique.FlatUGraph]
e:800 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
e:83 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
e:84 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
e:84 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
e:85 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
e:87 [binder, in Complexity.Libs.CookPrelim.PolyBounds]
e:9 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
e:9 [binder, in Complexity.NP.Clique.FlatUGraph]
e:90 [binder, in Complexity.NP.SAT.SAT_inNP]
E:95 [binder, in Complexity.NP.Clique.FlatClique]
e:96 [binder, in Complexity.NP.Clique.FlatClique]
E:99 [binder, in Complexity.NP.Clique.FlatClique]
e:99 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachine]

F

F [definition, in Undecidability.Synthetic.Infinite]
f [definition, in Undecidability.Synthetic.Infinite]
f [projection, in Complexity.Complexity.NP]
fact [definition, in Undecidability.Shared.Libs.DLW.Utils.binomial]
factorial [section, in Undecidability.Shared.Libs.DLW.Utils.binomial]
fact_gt_0 [lemma, in Undecidability.Shared.Libs.DLW.Utils.binomial]
fact_S [lemma, in Undecidability.Shared.Libs.DLW.Utils.binomial]
fact_0 [lemma, in Undecidability.Shared.Libs.DLW.Utils.binomial]
fAlphabet [abbreviation, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
fAlphabet [abbreviation, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
False_eq_dec [instance, in Undecidability.Shared.Libs.PSL.EqDec]
False_dec [instance, in Undecidability.Shared.Libs.PSL.EqDec]
False_enum_ok [lemma, in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicFinTypes]
False_eq_dec [instance, in Undecidability.Shared.Dec]
False_dec [instance, in Undecidability.Shared.Dec]
Fand [constructor, in Complexity.NP.SAT.FSAT.FSAT]
fbbC [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
fcards:110 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
fcards:70 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
fcards:77 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
fcards:84 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
FCC_instance_time [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatTCC_to_FlatCC]
FCC_instance [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatTCC_to_FlatCC]
FCI [module, in Undecidability.Shared.Libs.PSL.FCI]
FCI [library]
FCI.C [definition, in Undecidability.Shared.Libs.PSL.FCI]
FCI.closure [lemma, in Undecidability.Shared.Libs.PSL.FCI]
FCI.F [definition, in Undecidability.Shared.Libs.PSL.FCI]
FCI.FCI [section, in Undecidability.Shared.Libs.PSL.FCI]
FCI.FCI.R [variable, in Undecidability.Shared.Libs.PSL.FCI]
FCI.FCI.sigma [variable, in Undecidability.Shared.Libs.PSL.FCI]
FCI.FCI.X [variable, in Undecidability.Shared.Libs.PSL.FCI]
FCI.fip_dec [lemma, in Undecidability.Shared.Libs.PSL.FCI]
FCI.fp [lemma, in Undecidability.Shared.Libs.PSL.FCI]
FCI.incl [lemma, in Undecidability.Shared.Libs.PSL.FCI]
FCI.ind [lemma, in Undecidability.Shared.Libs.PSL.FCI]
FCI.it_incl [lemma, in Undecidability.Shared.Libs.PSL.FCI]
FCI.pick [lemma, in Undecidability.Shared.Libs.PSL.FCI]
fedge [abbreviation, in Complexity.NP.Clique.FlatUGraph]
fedges_wf_decb_iff [lemma, in Complexity.NP.Clique.FlatUGraph]
fedges_symmetric_decb_iff [lemma, in Complexity.NP.Clique.FlatUGraph]
fedges_edge_in_decb_iff [lemma, in Complexity.NP.Clique.FlatUGraph]
fedges_wf_decb [definition, in Complexity.NP.Clique.FlatUGraph]
fedges_symmetric_decb [definition, in Complexity.NP.Clique.FlatUGraph]
fedges_edge_in_decb [definition, in Complexity.NP.Clique.FlatUGraph]
fedges_wf [definition, in Complexity.NP.Clique.FlatUGraph]
fedges_symmetric [definition, in Complexity.NP.Clique.FlatUGraph]
fedges_wf_decb_poly [lemma, in Complexity.NP.Clique.FlatClique]
fedges_wf_decb_time_bound [lemma, in Complexity.NP.Clique.FlatClique]
fedges_wf_decb_time [definition, in Complexity.NP.Clique.FlatClique]
fedges_symmetric_decb_poly [lemma, in Complexity.NP.Clique.FlatClique]
fedges_symmetric_decb_time_bound [lemma, in Complexity.NP.Clique.FlatClique]
fedges_symmetric_decb_time [definition, in Complexity.NP.Clique.FlatClique]
fedges_symmetric_decb_step_time [definition, in Complexity.NP.Clique.FlatClique]
fedges_symmetric_decb_step [definition, in Complexity.NP.Clique.FlatClique]
fedges_edge_in_decb_time [definition, in Complexity.NP.Clique.FlatClique]
fedge_wf_decb_iff [lemma, in Complexity.NP.Clique.FlatUGraph]
fedge_eqb_iff [lemma, in Complexity.NP.Clique.FlatUGraph]
fedge_eqb_spec [lemma, in Complexity.NP.Clique.FlatUGraph]
fedge_wf_decb [definition, in Complexity.NP.Clique.FlatUGraph]
fedge_eqb [definition, in Complexity.NP.Clique.FlatUGraph]
fedge_wf [definition, in Complexity.NP.Clique.FlatUGraph]
fedge_wf_decb_time [definition, in Complexity.NP.Clique.FlatClique]
fExt:68 [binder, in Undecidability.L.Tactics.Computable]
fExt:72 [binder, in Undecidability.L.Tactics.Computable]
fExt:80 [binder, in Undecidability.L.Tactics.Computable]
fExt:89 [binder, in Undecidability.L.Tactics.Computable]
fE:70 [binder, in Complexity.NP.Clique.FlatUGraph]
Ffalse [abbreviation, in Complexity.NP.SAT.FSAT.FormulaEncoding]
Ffalse [abbreviation, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
ffbC [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
fffC [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
ffsC [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
FG [lemma, in Undecidability.Synthetic.Infinite]
fGamma [abbreviation, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
fGamma [abbreviation, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
FGamma [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
fgraph [abbreviation, in Complexity.NP.Clique.FlatUGraph]
fgraph_wf_decb_iff [lemma, in Complexity.NP.Clique.FlatUGraph]
fgraph_wf_decb [definition, in Complexity.NP.Clique.FlatUGraph]
fgraph_edge_in_decb [definition, in Complexity.NP.Clique.FlatUGraph]
fgraph_wf [definition, in Complexity.NP.Clique.FlatUGraph]
fgraph_wf_decb_poly [lemma, in Complexity.NP.Clique.FlatClique]
fgraph_wf_decb_time_bound [lemma, in Complexity.NP.Clique.FlatClique]
fgraph_wf_decb_time [definition, in Complexity.NP.Clique.FlatClique]
fg:3706 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
fill [definition, in Undecidability.TM.Lifting.LiftTapes]
Fill [section, in Undecidability.TM.Lifting.LiftTapes]
fill_default_not_index [lemma, in Undecidability.TM.Lifting.LiftTapes]
fill_default [definition, in Undecidability.TM.Lifting.LiftTapes]
fill_not_index [lemma, in Undecidability.TM.Lifting.LiftTapes]
fill_correct_nth [lemma, in Undecidability.TM.Lifting.LiftTapes]
Fill.m [variable, in Undecidability.TM.Lifting.LiftTapes]
Fill.n [variable, in Undecidability.TM.Lifting.LiftTapes]
Fill.Test [section, in Undecidability.TM.Lifting.LiftTapes]
Fill.Test.a [variable, in Undecidability.TM.Lifting.LiftTapes]
Fill.Test.b [variable, in Undecidability.TM.Lifting.LiftTapes]
Fill.Test.x [variable, in Undecidability.TM.Lifting.LiftTapes]
Fill.Test.y [variable, in Undecidability.TM.Lifting.LiftTapes]
Fill.Test.z [variable, in Undecidability.TM.Lifting.LiftTapes]
Fill.X [variable, in Undecidability.TM.Lifting.LiftTapes]
Filter [section, in Undecidability.Shared.FilterFacts]
Filter [section, in Undecidability.Shared.Libs.PSL.Lists.Filter]
Filter [library]
FilterFacts [library]
filterSome [definition, in Complexity.Libs.CookPrelim.MorePrelim]
filterSome_length [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
filterSome_poly [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
filterSome_time_bound [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
filterSome_time [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
filter_length [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
filter_comm [lemma, in Undecidability.Shared.FilterFacts]
filter_and [lemma, in Undecidability.Shared.FilterFacts]
filter_pq_eq [lemma, in Undecidability.Shared.FilterFacts]
filter_pq_mono [lemma, in Undecidability.Shared.FilterFacts]
filter_fst' [lemma, in Undecidability.Shared.FilterFacts]
filter_fst [lemma, in Undecidability.Shared.FilterFacts]
filter_app [lemma, in Undecidability.Shared.FilterFacts]
filter_id [lemma, in Undecidability.Shared.FilterFacts]
filter_mono [lemma, in Undecidability.Shared.FilterFacts]
filter_incl [lemma, in Undecidability.Shared.FilterFacts]
filter_map [lemma, in Undecidability.Shared.Libs.PSL.Lists.Filter]
filter_comm [lemma, in Undecidability.Shared.Libs.PSL.Lists.Filter]
filter_and [lemma, in Undecidability.Shared.Libs.PSL.Lists.Filter]
filter_pq_eq [lemma, in Undecidability.Shared.Libs.PSL.Lists.Filter]
filter_pq_mono [lemma, in Undecidability.Shared.Libs.PSL.Lists.Filter]
filter_fst' [lemma, in Undecidability.Shared.Libs.PSL.Lists.Filter]
filter_fst [lemma, in Undecidability.Shared.Libs.PSL.Lists.Filter]
filter_app [lemma, in Undecidability.Shared.Libs.PSL.Lists.Filter]
filter_id [lemma, in Undecidability.Shared.Libs.PSL.Lists.Filter]
filter_mono [lemma, in Undecidability.Shared.Libs.PSL.Lists.Filter]
filter_incl [lemma, in Undecidability.Shared.Libs.PSL.Lists.Filter]
filter_rev [lemma, in Complexity.TM.Single.EncodeTapesInvariants]
Filter.X [variable, in Undecidability.Shared.FilterFacts]
Filter.X [variable, in Undecidability.Shared.Libs.PSL.Lists.Filter]
_ <<= _ [notation, in Undecidability.Shared.FilterFacts]
_ el _ [notation, in Undecidability.Shared.FilterFacts]
Fin [section, in Undecidability.TM.Single.StepTM]
fin [definition, in Undecidability.Shared.Libs.DLW.Utils.fin_base]
Fin [library]
final [abbreviation, in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
final [projection, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
final [projection, in Complexity.NP.SAT.CookLevin.Subproblems.BinaryCC]
final [abbreviation, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
final [projection, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
final [abbreviation, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
final [abbreviation, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
final [abbreviation, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
final [projection, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
final [abbreviation, in Complexity.NP.SAT.CookLevin.Reductions.CC_to_BinaryCC]
final [projection, in Complexity.NP.SAT.CookLevin.Subproblems.CC]
finalCondition [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
finalRes:26 [binder, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
finalRes:72 [binder, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
finalSubstrings [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
finalSubstrings_correct [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
final_agree [lemma, in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
final_agree [lemma, in Complexity.NP.SAT.CookLevin.Reductions.TCC_to_CC]
final_flat_agree [lemma, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
final_flat_agree [lemma, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
final:102 [binder, in Undecidability.TM.Univ.LowLevel]
final:11 [binder, in Undecidability.TM.Univ.Univ]
final:123 [binder, in Undecidability.TM.Univ.LowLevel]
final:227 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
final:34 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.CC]
final:63 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
final:75 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
final:87 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
final:91 [binder, in Undecidability.TM.Univ.LowLevel]
final:92 [binder, in Undecidability.TM.Univ.LowLevel]
final:98 [binder, in Undecidability.TM.Univ.LowLevel]
fincards:125 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
find_max_fun [definition, in Undecidability.Shared.Libs.DLW.Utils.sorting]
find_pow2_prop [lemma, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
find_pow2_geq [lemma, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
find_pow2 [definition, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
finenv:3216 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
finEnv:3668 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
finEnv:3671 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
finEnv:3680 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
finE:56 [binder, in Complexity.NP.Clique.FlatUGraph]
finE:76 [binder, in Complexity.NP.Clique.FlatUGraph]
finFun [section, in Undecidability.L.Functions.FinTypeLookup]
finfunc_conv [lemma, in Undecidability.Shared.Libs.PSL.FiniteTypes.FiniteFunction]
finfunc_correct [lemma, in Undecidability.Shared.Libs.PSL.FiniteTypes.FiniteFunction]
finfunc_sound_cor [lemma, in Undecidability.Shared.Libs.PSL.FiniteTypes.FiniteFunction]
finfunc_sound [lemma, in Undecidability.Shared.Libs.PSL.FiniteTypes.FiniteFunction]
finfunc_comp [lemma, in Undecidability.Shared.Libs.PSL.FiniteTypes.FiniteFunction]
finfunc_table [definition, in Undecidability.Shared.Libs.PSL.FiniteTypes.FiniteFunction]
finFun_computableTime_const [lemma, in Undecidability.L.Functions.FinTypeLookup]
finhBinaryCC [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
finite [definition, in Undecidability.Shared.Libs.DLW.Utils.fin_base]
finite [section, in Undecidability.Shared.Libs.DLW.Utils.fin_base]
finite [library]
FiniteFunction [library]
FiniteTypes [library]
finite_weak_dec [lemma, in Undecidability.Shared.Libs.DLW.Utils.fin_dec]
finite_n [lemma, in Undecidability.Shared.FinTypeEquiv]
finite_t_discrete_bij_t_pos [lemma, in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
finite_t_pos_equiv [lemma, in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
finite_t_surj_t [lemma, in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
finite_t_weak_dec_rels [lemma, in Undecidability.Shared.Libs.DLW.Utils.fin_upto]
finite_t_weak_dec_powerset [lemma, in Undecidability.Shared.Libs.DLW.Utils.fin_upto]
finite_t_weak_dec_powerset.pset_fin_t [variable, in Undecidability.Shared.Libs.DLW.Utils.fin_upto]
finite_t_weak_dec_powerset.wdec [variable, in Undecidability.Shared.Libs.DLW.Utils.fin_upto]
finite_t_weak_dec_powerset.X [variable, in Undecidability.Shared.Libs.DLW.Utils.fin_upto]
finite_t_weak_dec_powerset [section, in Undecidability.Shared.Libs.DLW.Utils.fin_upto]
finite_t_fin_upto [lemma, in Undecidability.Shared.Libs.DLW.Utils.fin_upto]
finite_t_upto [definition, in Undecidability.Shared.Libs.DLW.Utils.fin_upto]
finite_t_upto.R [variable, in Undecidability.Shared.Libs.DLW.Utils.fin_upto]
finite_t_upto.X [variable, in Undecidability.Shared.Libs.DLW.Utils.fin_upto]
finite_t_upto [section, in Undecidability.Shared.Libs.DLW.Utils.fin_upto]
finite_pigeon_hole [lemma, in Undecidability.Shared.Libs.DLW.Utils.php]
finite_php_dup [lemma, in Undecidability.Shared.Libs.DLW.Utils.php]
finite_t_sig_bool [lemma, in Undecidability.Shared.Libs.DLW.Utils.fin_base]
finite_t_fin_t_dec [lemma, in Undecidability.Shared.Libs.DLW.Utils.fin_base]
finite_t_vec [lemma, in Undecidability.Shared.Libs.DLW.Utils.fin_base]
finite_t_pos [lemma, in Undecidability.Shared.Libs.DLW.Utils.fin_base]
finite_t_option [lemma, in Undecidability.Shared.Libs.DLW.Utils.fin_base]
finite_t_list [lemma, in Undecidability.Shared.Libs.DLW.Utils.fin_base]
finite_t_bool [lemma, in Undecidability.Shared.Libs.DLW.Utils.fin_base]
finite_unit [lemma, in Undecidability.Shared.Libs.DLW.Utils.fin_base]
finite_t_unit [lemma, in Undecidability.Shared.Libs.DLW.Utils.fin_base]
finite_sum [lemma, in Undecidability.Shared.Libs.DLW.Utils.fin_base]
finite_t_sum [lemma, in Undecidability.Shared.Libs.DLW.Utils.fin_base]
finite_prod [lemma, in Undecidability.Shared.Libs.DLW.Utils.fin_base]
finite_t_prod [lemma, in Undecidability.Shared.Libs.DLW.Utils.fin_base]
finite_t_map [lemma, in Undecidability.Shared.Libs.DLW.Utils.fin_base]
finite_fin_eq [lemma, in Undecidability.Shared.Libs.DLW.Utils.fin_base]
finite_t_fin_t_eq [lemma, in Undecidability.Shared.Libs.DLW.Utils.fin_base]
finite_t_finite [lemma, in Undecidability.Shared.Libs.DLW.Utils.fin_base]
finite_t [definition, in Undecidability.Shared.Libs.DLW.Utils.fin_base]
finite_t_dec_choice [definition, in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
finite_t_dec_choose_one [lemma, in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
finite_t_dec_choose_one.Pdec [variable, in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
finite_t_dec_choose_one.HQ [variable, in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
finite_t_dec_choose_one.HX [variable, in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
finite_t_dec_choose_one.Q [variable, in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
finite_t_dec_choose_one.P [variable, in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
finite_t_dec_choose_one.X [variable, in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
finite_t_dec_choose_one [section, in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
finite_discrete_choice [lemma, in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
finite_discrete_choice.X_discrete [variable, in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
finite_discrete_choice.R [variable, in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
finite_discrete_choice.Y [variable, in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
finite_discrete_choice.X [variable, in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
finite_discrete_choice [section, in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
finite.filter [section, in Undecidability.Shared.Libs.DLW.Utils.fin_base]
finite.filter.P [variable, in Undecidability.Shared.Libs.DLW.Utils.fin_base]
finite.filter.Pdec [variable, in Undecidability.Shared.Libs.DLW.Utils.fin_base]
finite.filter.X [variable, in Undecidability.Shared.Libs.DLW.Utils.fin_base]
finL:3676 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
finMax [definition, in Undecidability.TM.Single.StepTM]
finMax_val [lemma, in Undecidability.TM.Single.StepTM]
finMax_ext [lemma, in Undecidability.TM.Single.StepTM]
finMax' [definition, in Undecidability.TM.Single.StepTM]
finMin [definition, in Undecidability.TM.Single.StepTM]
finMin_opt_Some_val [lemma, in Undecidability.TM.Single.StepTM]
finMin_opt_Some [lemma, in Undecidability.TM.Single.StepTM]
finMin_opt_None [lemma, in Undecidability.TM.Single.StepTM]
finMin_opt [definition, in Undecidability.TM.Single.StepTM]
finMin_val [lemma, in Undecidability.TM.Single.StepTM]
finMin_ext [lemma, in Undecidability.TM.Single.StepTM]
finMin_O [lemma, in Undecidability.TM.Single.StepTM]
finMTICards [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
finMTLCards [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
finMTRCards [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
FinNotation [library]
finPreludeCards [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
finp:2858 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
finp:2861 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
finp:2868 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
finp:2872 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
finp:2877 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
finp:2882 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
finp:2890 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
finp:2895 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
FinR [definition, in Undecidability.TM.Util.Prelim]
finRepr [definition, in Complexity.Libs.CookPrelim.FlatFinTypes]
finReprEl [definition, in Complexity.Libs.CookPrelim.FlatFinTypes]
finReprElInl [lemma, in Complexity.Libs.CookPrelim.FlatFinTypes]
finReprElInr [lemma, in Complexity.Libs.CookPrelim.FlatFinTypes]
finReprElNone [lemma, in Complexity.Libs.CookPrelim.FlatFinTypes]
finReprElPair [lemma, in Complexity.Libs.CookPrelim.FlatFinTypes]
finReprElP_exists [lemma, in Complexity.Libs.CookPrelim.FlatFinTypes]
finReprElP_finReprEl [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
finReprElSome [lemma, in Complexity.Libs.CookPrelim.FlatFinTypes]
finReprEl_ofFlatType [lemma, in Complexity.Libs.CookPrelim.FlatFinTypes]
finReprEl_finReprEl' [lemma, in Complexity.Libs.CookPrelim.FlatFinTypes]
finReprEl' [definition, in Complexity.Libs.CookPrelim.FlatFinTypes]
finReprOption [lemma, in Complexity.Libs.CookPrelim.FlatFinTypes]
finReprProd [lemma, in Complexity.Libs.CookPrelim.FlatFinTypes]
finReprSum [lemma, in Complexity.Libs.CookPrelim.FlatFinTypes]
finRepr_exists_list [lemma, in Complexity.Libs.CookPrelim.FlatFinTypes]
finRepr_exists [lemma, in Complexity.Libs.CookPrelim.FlatFinTypes]
finStateCards [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
finStr':101 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
finStr':65 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
finStr:100 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
finStr:64 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
finSucc [definition, in Undecidability.TM.Single.StepTM]
finSucc_correct [lemma, in Undecidability.TM.Single.StepTM]
finSucc_opt_None' [lemma, in Undecidability.TM.Single.StepTM]
finSucc_opt_None [lemma, in Undecidability.TM.Single.StepTM]
finSucc_opt_Some' [lemma, in Undecidability.TM.Single.StepTM]
finSucc_opt_Some [lemma, in Undecidability.TM.Single.StepTM]
finSucc_opt [definition, in Undecidability.TM.Single.StepTM]
finSucc_help' [lemma, in Undecidability.TM.Single.StepTM]
finSucc_help [lemma, in Undecidability.TM.Single.StepTM]
finSucc' [definition, in Undecidability.TM.Single.StepTM]
finTapeCards [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
finType [record, in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
FinType [constructor, in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
finTypeC [record, in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
FinTypeC [constructor, in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
finTypeC_Prod [instance, in Undecidability.Shared.Libs.PSL.FiniteTypes.VectorFin]
finTypeC_False [instance, in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicFinTypes]
finTypeC_True [instance, in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicFinTypes]
finTypeC_unit [instance, in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicFinTypes]
finTypeC_bool [instance, in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicFinTypes]
finTypeC_Empty_set [instance, in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicFinTypes]
finTypeC_sum [instance, in Undecidability.Shared.Libs.PSL.FiniteTypes.CompoundFinTypes]
finTypeC_Option [instance, in Undecidability.Shared.Libs.PSL.FiniteTypes.CompoundFinTypes]
finTypeC_Prod [instance, in Undecidability.Shared.Libs.PSL.FiniteTypes.CompoundFinTypes]
FinTypeEquiv [library]
FinTypeForallExists [library]
FinTypeLookup [library]
FinTypes [library]
finType_cc [definition, in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
finType_exists_dec [instance, in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
finType_forall_dec [instance, in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
finType_CS [definition, in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
fintype_forall_exists [lemma, in Undecidability.Shared.FinTypeForallExists]
finType_eqb [section, in Undecidability.L.Datatypes.LFinType]
finType_eqb_reflect [lemma, in Undecidability.L.Datatypes.LFinType]
finType_eqb [definition, in Undecidability.L.Datatypes.LFinType]
finType_enum_list_finReprEl [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
finType_depPair [instance, in Undecidability.Shared.Libs.PSL.FiniteTypes.DepPairs]
fInt:103 [binder, in Undecidability.L.Tactics.ComputableTime]
fInt:109 [binder, in Undecidability.L.Tactics.ComputableTime]
fInt:117 [binder, in Undecidability.L.Tactics.ComputableTime]
fInt:122 [binder, in Undecidability.L.Tactics.ComputableTime]
fInt:133 [binder, in Undecidability.L.Tactics.ComputableTime]
fInt:15 [binder, in Undecidability.L.Tactics.ComputableTime]
fInt:27 [binder, in Undecidability.L.Tactics.Computable]
fInt:50 [binder, in Undecidability.L.Tactics.ComputableTime]
fInt:93 [binder, in Undecidability.L.Tactics.ComputableTime]
finV:49 [binder, in Complexity.NP.Clique.FlatUGraph]
finV:50 [binder, in Complexity.NP.Clique.FlatUGraph]
finV:55 [binder, in Complexity.NP.Clique.FlatUGraph]
finV:75 [binder, in Complexity.NP.Clique.FlatUGraph]
fin_quotient [record, in Undecidability.Shared.Libs.DLW.Utils.fin_quotient]
fin_weak_dec [lemma, in Undecidability.Shared.Libs.DLW.Utils.fin_dec]
Fin_eq_dec [instance, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
fin_is_2 [lemma, in Undecidability.TM.Single.StepTM]
fin_is_1 [lemma, in Undecidability.TM.Single.StepTM]
fin_is_0 [lemma, in Undecidability.TM.Single.StepTM]
fin_to_nat_S [lemma, in Undecidability.TM.Single.StepTM]
fin_to_nat_O [lemma, in Undecidability.TM.Single.StepTM]
fin_to_nat_lt [lemma, in Undecidability.TM.Single.StepTM]
fin_to_nat [definition, in Undecidability.TM.Single.StepTM]
Fin_cardinality [lemma, in Undecidability.Shared.Libs.PSL.FiniteTypes.VectorFin]
Fin_finTypeC [instance, in Undecidability.Shared.Libs.PSL.FiniteTypes.VectorFin]
Fin_initVect_nth [definition, in Undecidability.Shared.Libs.PSL.FiniteTypes.VectorFin]
Fin_initVect_full [lemma, in Undecidability.Shared.Libs.PSL.FiniteTypes.VectorFin]
Fin_initVect_dupfree [lemma, in Undecidability.Shared.Libs.PSL.FiniteTypes.VectorFin]
Fin_initVect [definition, in Undecidability.Shared.Libs.PSL.FiniteTypes.VectorFin]
Fin_eqb_L_R [lemma, in Undecidability.Shared.Libs.PSL.Vectors.Fin]
Fin_eqb_R_L [lemma, in Undecidability.Shared.Libs.PSL.Vectors.Fin]
Fin_eqb_L_L [lemma, in Undecidability.Shared.Libs.PSL.Vectors.Fin]
Fin_eqb_R_R [lemma, in Undecidability.Shared.Libs.PSL.Vectors.Fin]
Fin_R_fillive [lemma, in Undecidability.Shared.Libs.PSL.Vectors.Fin]
Fin_L_fillive [lemma, in Undecidability.Shared.Libs.PSL.Vectors.Fin]
fin_destruct_add [lemma, in Undecidability.Shared.Libs.PSL.Vectors.Fin]
fin_destruct_O [lemma, in Undecidability.Shared.Libs.PSL.Vectors.Fin]
fin_destruct_S [lemma, in Undecidability.Shared.Libs.PSL.Vectors.Fin]
fin_t_upto [definition, in Undecidability.Shared.Libs.DLW.Utils.fin_upto]
fin_t_dec [lemma, in Undecidability.Shared.Libs.DLW.Utils.fin_base]
fin_t_vec [lemma, in Undecidability.Shared.Libs.DLW.Utils.fin_base]
fin_t_length [lemma, in Undecidability.Shared.Libs.DLW.Utils.fin_base]
fin_t_sum [lemma, in Undecidability.Shared.Libs.DLW.Utils.fin_base]
fin_t_prod [lemma, in Undecidability.Shared.Libs.DLW.Utils.fin_base]
fin_t_equiv [lemma, in Undecidability.Shared.Libs.DLW.Utils.fin_base]
fin_t_finite_t [lemma, in Undecidability.Shared.Libs.DLW.Utils.fin_base]
fin_t_map [lemma, in Undecidability.Shared.Libs.DLW.Utils.fin_base]
fin_t_fin [lemma, in Undecidability.Shared.Libs.DLW.Utils.fin_base]
fin_t [definition, in Undecidability.Shared.Libs.DLW.Utils.fin_base]
Fin_eq_dec [instance, in Undecidability.Shared.Libs.PSL.FiniteTypes.Arbitrary]
fin_flat_cards_agree [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
fin_flat_preludeCards_agree [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
fin_flat_stateCards_agree [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
fin_flat_haltCards_agree [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
fin_flat_nonhaltCards_agree [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
fin_flat_tapeCards_agree [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
fin_agreement [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
fin_baseEnvPrelude [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
fin_baseEnvHalt [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
fin_baseEnvNone [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
fin_baseEnv [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
fin_t_dec_choose_one [lemma, in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
Fin_cardinality' [lemma, in Complexity.NP.Clique.kSAT_to_Clique]
fin_reif_nat [lemma, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
fin_reif [lemma, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
fin_reif.R [variable, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
fin_reif.X [variable, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
fin_reif [section, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
fin_dec [library]
fin_quotient [library]
fin_choice [library]
fin_base [library]
fin_bij [library]
fin_upto [library]
fin':79 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
fin':82 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
fin1:3641 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
fin2:3642 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
fin:103 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
fin:78 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
fin:81 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
fin:98 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
fip [inductive, in Undecidability.Shared.Libs.PSL.FCI]
Fip [section, in Undecidability.Shared.Libs.PSL.FCI]
fip_dec [lemma, in Undecidability.Shared.Libs.PSL.FCI]
fip_it_closed [lemma, in Undecidability.Shared.Libs.PSL.FCI]
fip_it_sound [lemma, in Undecidability.Shared.Libs.PSL.FCI]
fip_it [definition, in Undecidability.Shared.Libs.PSL.FCI]
fip_least [lemma, in Undecidability.Shared.Libs.PSL.FCI]
fip_closed [definition, in Undecidability.Shared.Libs.PSL.FCI]
fip_monotone [definition, in Undecidability.Shared.Libs.PSL.FCI]
fip_intro [constructor, in Undecidability.Shared.Libs.PSL.FCI]
Fip.R [variable, in Undecidability.Shared.Libs.PSL.FCI]
Fip.sigma [variable, in Undecidability.Shared.Libs.PSL.FCI]
Fip.X [variable, in Undecidability.Shared.Libs.PSL.FCI]
FirstFixedPoint [lemma, in Undecidability.L.Computability.Fixpoints]
firstn_add [lemma, in Complexity.Libs.CookPrelim.MorePrelim]
firstn_all_inv [lemma, in Complexity.Libs.CookPrelim.MorePrelim]
firstn_skipn_rev [lemma, in Complexity.Libs.CookPrelim.MorePrelim]
first_which_ni [lemma, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
first_which_ni.HP [variable, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
first_which_ni.P [variable, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
first_which_ni [section, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
first_which [lemma, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
first_non_zero [lemma, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
fixedTM_to_FlatSingleTMGenNP [lemma, in Complexity.NP.SAT.CookLevin]
fixed:1115 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
fixed:1122 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
fixed:802 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
fixed:804 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
fixed:807 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
fixed:810 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
fixed:813 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
fixed:817 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
fixed:820 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
fixed:823 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
fixed:827 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
fixed:837 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
fixed:841 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
fixed:854 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
fixed:858 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
fixed:876 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
fixed:881 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
fixed:949 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
fixed:953 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
fixed:958 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
fixed:963 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
fixEqBoolT [section, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
fixEqBoolT.eqbX [variable, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
fixEqBoolT.X [variable, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
fixEqBoolT.Y [variable, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
fixFCCInstance [section, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
fixFCCInstance.fpr [variable, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
fixfilterSome [section, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
fixfilterSome.X [variable, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
fixGraph [section, in Complexity.NP.Clique.Clique]
fixGraph [section, in Complexity.NP.Clique.FlatClique]
fixGraph.g [variable, in Complexity.NP.Clique.Clique]
fixGraph.G [variable, in Complexity.NP.Clique.FlatClique]
fixGraph.UG [variable, in Complexity.NP.Clique.FlatClique]
fixH [section, in Undecidability.L.AbstractMachines.FlatPro.UnfoldClos]
fixH.H [variable, in Undecidability.L.AbstractMachines.FlatPro.UnfoldClos]
FixInit [section, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds_Loop]
FixInit.empty_H__init [variable, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds_Loop]
FixInit.H__init [variable, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds_Loop]
fixInstance [section, in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
fixInstance [section, in Complexity.NP.SAT.CookLevin.Reductions.TCC_to_CC]
fixInstance [section, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
fixInstance [section, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
fixInstance [section, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
fixInstance [section, in Complexity.NP.SAT.CookLevin.Reductions.CC_to_BinaryCC]
fixInstance [section, in Complexity.NP.SAT.CookLevin.Subproblems.CC]
fixInstanceA [section, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
fixInstanceA.fpr [variable, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
fixInstanceA.isFlattening [variable, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
fixInstanceA.pr [variable, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
fixInstance.bpr [variable, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
fixInstance.c [variable, in Complexity.NP.SAT.CookLevin.Subproblems.CC]
fixInstance.cards [variable, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
fixInstance.Fcards [variable, in Complexity.NP.SAT.CookLevin.Reductions.TCC_to_CC]
fixInstance.Ffinal [variable, in Complexity.NP.SAT.CookLevin.Reductions.TCC_to_CC]
fixInstance.final [variable, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
fixInstance.Finit [variable, in Complexity.NP.SAT.CookLevin.Reductions.TCC_to_CC]
fixInstance.fpr [variable, in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
fixInstance.fpr [variable, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
fixInstance.FSigma [variable, in Complexity.NP.SAT.CookLevin.Reductions.TCC_to_CC]
fixInstance.Fsteps [variable, in Complexity.NP.SAT.CookLevin.Reductions.TCC_to_CC]
fixInstance.h' [variable, in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
fixInstance.init [variable, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
fixInstance.k [variable, in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
fixInstance.pr [variable, in Complexity.NP.SAT.CookLevin.Reductions.CC_to_BinaryCC]
fixInstance.Sigma [variable, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
fixInstance.steps [variable, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
fixInstance.Y [variable, in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
_ ⇝ _ [notation, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
fixIsInjFinfuncTable [section, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
fixIsInjFinfuncTable.eqbX [variable, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
fixIsInjFinfuncTable.eqbY [variable, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
fixIsInjFinfuncTable.X [variable, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
fixIsInjFinfuncTable.Y [variable, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
fixIt [section, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
fixIt.X [variable, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
fixListProd [section, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
fixListProd.X [variable, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
Fixpoints [library]
fixPrelude [section, in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
fixPrelude.A0 [variable, in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
fixPrelude.A1 [variable, in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
fixPrelude.A2 [variable, in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
fixPrelude.A3 [variable, in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
fixPrelude.A4 [variable, in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
fixPrelude.A5 [variable, in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
fixPrelude.ESigma [variable, in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
fixPrelude.eSigma' [variable, in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
fixPrelude.finalCondition [variable, in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
fixPrelude.FSigma [variable, in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
fixPrelude.FSigma' [variable, in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
fixPrelude.initCond [variable, in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
fixPrelude.initialString [variable, in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
fixPrelude.l [variable, in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
fixPrelude.p [variable, in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
fixPrelude.p' [variable, in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
fixPrelude.Sigma [variable, in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
fixPrelude.Sigma' [variable, in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
fixPrelude.t [variable, in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
fixPrelude.t' [variable, in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
fixprodLists [section, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
fixprodLists [section, in Undecidability.L.Datatypes.List.List_extra]
fixprodLists.X [variable, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
fixprodLists.X [variable, in Undecidability.L.Datatypes.List.List_extra]
fixprodLists.Y [variable, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
fixprodLists.Y [variable, in Undecidability.L.Datatypes.List.List_extra]
fixPTCCInstance [section, in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
fixPTCCInstance.A0 [variable, in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
fixPTCCInstance.A1 [variable, in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
fixPTCCInstance.A2 [variable, in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
fixPTCCInstance.A3 [variable, in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
fixPTCCInstance.A4 [variable, in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
fixPTCCInstance.ESigma [variable, in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
fixPTCCInstance.eSigma' [variable, in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
fixPTCCInstance.finalCondition [variable, in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
fixPTCCInstance.fixInitial [section, in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
fixPTCCInstance.fixInitial.initialString [variable, in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
fixPTCCInstance.FSigma [variable, in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
fixPTCCInstance.FSigma' [variable, in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
fixPTCCInstance.initCond [variable, in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
fixPTCCInstance.initialPred [variable, in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
fixPTCCInstance.l [variable, in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
fixPTCCInstance.p [variable, in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
fixPTCCInstance.p' [variable, in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
fixPTCCInstance.Sigma [variable, in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
fixPTCCInstance.Sigma' [variable, in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
fixPTCCInstance.t [variable, in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
fixPTCCInstance.t' [variable, in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
fixRulePred [section, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
fixRulePred.p [variable, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
fixRulePred.X [variable, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
fixSAT [section, in Complexity.NP.Clique.kSAT_to_Clique]
fixSAT [section, in Complexity.NP.Clique.kSAT_to_FlatClique]
fixSAT.Clique_implies_SAT.L [variable, in Complexity.NP.Clique.kSAT_to_Clique]
fixSAT.Clique_implies_SAT [section, in Complexity.NP.Clique.kSAT_to_Clique]
fixSAT.Hkcnf [variable, in Complexity.NP.Clique.kSAT_to_Clique]
fixSAT.Hkgt [variable, in Complexity.NP.Clique.kSAT_to_Clique]
fixSAT.k [variable, in Complexity.NP.Clique.kSAT_to_Clique]
fixSAT.k [variable, in Complexity.NP.Clique.kSAT_to_FlatClique]
fixSAT.N [variable, in Complexity.NP.Clique.kSAT_to_Clique]
fixSAT.N [variable, in Complexity.NP.Clique.kSAT_to_FlatClique]
fixSAT.SAT_implies_Clique.a__sat [variable, in Complexity.NP.Clique.kSAT_to_Clique]
fixSAT.SAT_implies_Clique [section, in Complexity.NP.Clique.kSAT_to_Clique]
fixSig [section, in Complexity.L.TM.TMflatten]
fixSig.fsig [variable, in Complexity.L.TM.TMflatten]
fixSig.fstates [variable, in Complexity.L.TM.TMflatten]
fixSig.ftrans [variable, in Complexity.L.TM.TMflatten]
fixSig.n [variable, in Complexity.L.TM.TMflatten]
fixTM [section, in Complexity.NP.SAT.CookLevin.Reductions.TMGenNP_fixed_singleTapeTM_to_FlatFunSingleTMGenNP]
fixTM [section, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
fixTM.fixAbstractTypes [section, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
fixTM.fixAbstractTypes.M [variable, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
fixTM.fixAbstractTypes.W [variable, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
fixTM.fixAbstractTypes.X [variable, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
fixTM.fixAbstractTypes.Y [variable, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
fixTM.fixAbstractTypes.Z [variable, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
fixTM.fixedInput [variable, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
fixTM.fixEnv [section, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
fixTM.flatFixedInput [variable, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
fixTM.flatTM [variable, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
fixTM.fTM [variable, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
fixTM.index__comp [variable, in Complexity.NP.SAT.CookLevin.Reductions.TMGenNP_fixed_singleTapeTM_to_FlatFunSingleTMGenNP]
fixTM.k' [variable, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
fixTM.listDestructLength [section, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
fixTM.M [variable, in Complexity.NP.SAT.CookLevin.Reductions.TMGenNP_fixed_singleTapeTM_to_FlatFunSingleTMGenNP]
fixTM.reg__sig [variable, in Complexity.NP.SAT.CookLevin.Reductions.TMGenNP_fixed_singleTapeTM_to_FlatFunSingleTMGenNP]
fixTM.sig [variable, in Complexity.NP.SAT.CookLevin.Reductions.TMGenNP_fixed_singleTapeTM_to_FlatFunSingleTMGenNP]
fixTM.t [variable, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
_ ⇝{ _ } _ (cc_scope) [notation, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
_ ≃c _ (cc_scope) [notation, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
_ ≃c ( _ , _ , _ ) (cc_scope) [notation, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
|_| (cc_scope) [notation, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
↑ _ (polscope) [notation, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
↓ _ (polscope) [notation, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
∘ _ (polscope) [notation, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
_ $ _ [notation, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
_ ⇝( _ ) _ [notation, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
_ ▷(≤ _ ) _ [notation, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
_ ▷( _ ) _ [notation, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
_ ≻( _ ) _ [notation, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
_ ⇝ _ [notation, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
_ ≻ _ [notation, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
_ ≃t( _ , _ ) _ [notation, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
_ ≃t( _ ) _ [notation, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
_ ≃t _ [notation, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
! _ [notation, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
# [notation, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
% _ [notation, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
~ _ [notation, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
fixTM.Σ [variable, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
fixValid [section, in Complexity.NP.SAT.CookLevin.Subproblems.CC]
fixValid.l [variable, in Complexity.NP.SAT.CookLevin.Subproblems.CC]
fixValid.offset [variable, in Complexity.NP.SAT.CookLevin.Subproblems.CC]
fixValid.width [variable, in Complexity.NP.SAT.CookLevin.Subproblems.CC]
fixValid.X [variable, in Complexity.NP.SAT.CookLevin.Subproblems.CC]
FixX [section, in Undecidability.L.Prelim.ARS]
fixX [section, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
fixX [section, in Complexity.NP.SAT.SAT_inNP]
fixX [section, in Complexity.NP.L.LMGenNP]
fixX [section, in Complexity.Libs.UniformHomomorphisms]
fixX [section, in Complexity.Libs.CookPrelim.PolyBounds]
fixX [section, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
fixX [section, in Complexity.NP.SAT.CookLevin.Reductions.FlatTCC_to_FlatCC]
fixX [section, in Complexity.NP.SAT.CookLevin.Subproblems.CC]
fixXEq [section, in Complexity.Libs.CookPrelim.PolyBounds]
fixXrepEl [section, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
fixXrepEl.X [variable, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
fixXY [section, in Complexity.Libs.CookPrelim.PolyBounds]
fixX.A0 [variable, in Complexity.NP.SAT.CookLevin.Subproblems.CC]
fixX.A1 [variable, in Complexity.NP.SAT.CookLevin.Subproblems.CC]
fixX.cards [variable, in Complexity.NP.SAT.CookLevin.Subproblems.CC]
fixX.eqbX [variable, in Complexity.NP.SAT.SAT_inNP]
fixX.h [variable, in Complexity.Libs.UniformHomomorphisms]
fixX.offset [variable, in Complexity.NP.SAT.CookLevin.Subproblems.CC]
fixX.width [variable, in Complexity.NP.SAT.CookLevin.Subproblems.CC]
FixX.X [variable, in Undecidability.L.Prelim.ARS]
fixX.X [variable, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
fixX.X [variable, in Complexity.NP.SAT.SAT_inNP]
fixX.X [variable, in Complexity.Libs.UniformHomomorphisms]
fixX.X [variable, in Complexity.NP.SAT.CookLevin.Reductions.FlatTCC_to_FlatCC]
fixX.X [variable, in Complexity.NP.SAT.CookLevin.Subproblems.CC]
fixX.Y [variable, in Complexity.Libs.UniformHomomorphisms]
fixX.Y [variable, in Complexity.Libs.CookPrelim.PolyBounds]
Fix_XY.Y [variable, in Undecidability.L.Datatypes.LProd]
Fix_XY.X [variable, in Undecidability.L.Datatypes.LProd]
Fix_XY [section, in Undecidability.L.Datatypes.LProd]
fix_optReturn.X [variable, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
fix_optReturn [section, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
fix_option_map.B [variable, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
fix_option_map.A [variable, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
fix_option_map [section, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
Fix_X.X [variable, in Undecidability.L.Datatypes.List.List_basics]
Fix_X [section, in Undecidability.L.Datatypes.List.List_basics]
Fix_X.X [variable, in Undecidability.L.Datatypes.LOptions]
Fix_X [section, in Undecidability.L.Datatypes.LOptions]
fix_X.X [variable, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
fix_X [section, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
Fix_XY.intY [variable, in Undecidability.L.Datatypes.LSum]
Fix_XY.intX [variable, in Undecidability.L.Datatypes.LSum]
Fix_XY.Y [variable, in Undecidability.L.Datatypes.LSum]
Fix_XY.X [variable, in Undecidability.L.Datatypes.LSum]
Fix_XY [section, in Undecidability.L.Datatypes.LSum]
Fix_X.X [variable, in Undecidability.Shared.Libs.PSL.Lists.Position]
Fix_X [section, in Undecidability.Shared.Libs.PSL.Lists.Position]
Fix_X.X_eqb_spec [variable, in Undecidability.L.Datatypes.List.List_nat]
Fix_X.X_eqb [variable, in Undecidability.L.Datatypes.List.List_nat]
Fix_X [section, in Undecidability.L.Datatypes.List.List_nat]
Fix_Sig.InitTape.I [variable, in Undecidability.TM.Code.CodeTM]
Fix_Sig.InitTape.cX [variable, in Undecidability.TM.Code.CodeTM]
Fix_Sig.InitTape.X [variable, in Undecidability.TM.Code.CodeTM]
Fix_Sig.InitTape.sigX [variable, in Undecidability.TM.Code.CodeTM]
Fix_Sig.InitTape [section, in Undecidability.TM.Code.CodeTM]
Fix_Sig.Encodes_Ext.I2 [variable, in Undecidability.TM.Code.CodeTM]
Fix_Sig.Encodes_Ext.I1 [variable, in Undecidability.TM.Code.CodeTM]
Fix_Sig.Encodes_Ext.cY [variable, in Undecidability.TM.Code.CodeTM]
Fix_Sig.Encodes_Ext.cX [variable, in Undecidability.TM.Code.CodeTM]
Fix_Sig.Encodes_Ext.sigY [variable, in Undecidability.TM.Code.CodeTM]
Fix_Sig.Encodes_Ext.sigX [variable, in Undecidability.TM.Code.CodeTM]
Fix_Sig.Encodes_Ext.Y [variable, in Undecidability.TM.Code.CodeTM]
Fix_Sig.Encodes_Ext.X [variable, in Undecidability.TM.Code.CodeTM]
Fix_Sig.Encodes_Ext [section, in Undecidability.TM.Code.CodeTM]
_ ≃( ; _ ) _ [notation, in Undecidability.TM.Code.CodeTM]
_ ≂( _ ; _ ) _ [notation, in Undecidability.TM.Code.CodeTM]
_ ≂ _ [notation, in Undecidability.TM.Code.CodeTM]
_ ≂( _ ) _ [notation, in Undecidability.TM.Code.CodeTM]
_ ≃( ; _ ) _ [notation, in Undecidability.TM.Code.CodeTM]
_ ≃( _ ; _ ) _ [notation, in Undecidability.TM.Code.CodeTM]
_ ≃ _ [notation, in Undecidability.TM.Code.CodeTM]
_ ≃( _ ) _ [notation, in Undecidability.TM.Code.CodeTM]
Fix_Sig.Tape_Contains.I [variable, in Undecidability.TM.Code.CodeTM]
Fix_Sig.Tape_Contains.cX [variable, in Undecidability.TM.Code.CodeTM]
Fix_Sig.Tape_Contains.X [variable, in Undecidability.TM.Code.CodeTM]
Fix_Sig.Tape_Contains.sigX [variable, in Undecidability.TM.Code.CodeTM]
Fix_Sig.Tape_Contains [section, in Undecidability.TM.Code.CodeTM]
_ ^+ (type_scope) [notation, in Undecidability.TM.Code.CodeTM]
Fix_Sig.sig [variable, in Undecidability.TM.Code.CodeTM]
Fix_Sig [section, in Undecidability.TM.Code.CodeTM]
fix_sig.reg_tapes [section, in Undecidability.L.TM.TapeFuns]
fix_sig.sig [variable, in Undecidability.L.TM.TapeFuns]
fix_sig [section, in Undecidability.L.TM.TapeFuns]
Fix_Alphabet.n [variable, in Undecidability.TM.TM]
Fix_Alphabet.Σ [variable, in Undecidability.TM.TM]
Fix_Alphabet [section, in Undecidability.TM.TM]
Fix_Sigma.Σ [variable, in Undecidability.TM.TM]
Fix_Sigma [section, in Undecidability.TM.TM]
Fix_X.X_eqb_spec [variable, in Undecidability.L.Datatypes.List.List_eqb]
Fix_X.X_eqb [variable, in Undecidability.L.Datatypes.List.List_eqb]
Fix_X.X [variable, in Undecidability.L.Datatypes.List.List_eqb]
Fix_X [section, in Undecidability.L.Datatypes.List.List_eqb]
V _ [notation, in Undecidability.TM.Util.Relations]
Fix_X2.n [variable, in Undecidability.TM.Util.Relations]
Fix_X2.Z [variable, in Undecidability.TM.Util.Relations]
Fix_X2.Y [variable, in Undecidability.TM.Util.Relations]
Fix_X2.X [variable, in Undecidability.TM.Util.Relations]
Fix_X2 [section, in Undecidability.TM.Util.Relations]
fix_X.X [variable, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
fix_X [section, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
fix_sig.sig [variable, in Undecidability.L.TM.TMEncoding]
fix_sig [section, in Undecidability.L.TM.TMEncoding]
Fix_X.X [variable, in Undecidability.L.Datatypes.List.List_enc]
Fix_X [section, in Undecidability.L.Datatypes.List.List_enc]
Fix_Sigma.sig [variable, in Undecidability.TM.Util.TM_facts]
Fix_Sigma [section, in Undecidability.TM.Util.TM_facts]
flatAlphabet [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
flatAlphabet_poly [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
flatAlphabet_time_bound [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
flatAlphabet_time [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
flatAlphabet_bound [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
flatcardp:24 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
flatcards:39 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
flatcards:63 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
flatcard:32 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
flatcard:43 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
flatcard:47 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
flatcard:56 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
flatcard:67 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
flatcard:71 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
FlatCC [record, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
FlatCC [library]
FlatCCLang [definition, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
FlatCC_to_BinaryCC [lemma, in Complexity.NP.SAT.CookLevin]
FlatCC_to_BinaryCC_poly [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
FlatCC_to_BinaryCC [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
FlatCC_wf_dec_poly [lemma, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
FlatCC_wf_dec_time_bound [lemma, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
FlatCC_wf_dec_time [definition, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
FlatCC_enc_size [lemma, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
FlatCC_wf_dec_correct [lemma, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
FlatCC_wf_dec [definition, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
FlatCC_wellformed [definition, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
FlatCC_to_BinaryCC [library]
FlatClique [definition, in Complexity.NP.Clique.FlatClique]
FlatClique [library]
FlatClique_in_NP [lemma, in Complexity.NP.Clique.FlatClique]
FlatClique_implies_SAT [lemma, in Complexity.NP.Clique.kSAT_to_FlatClique]
flatDelim [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
flatDelimC [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
flatenv:3217 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
flatEnv:3669 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
flatEnv:3672 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
flatEnv:3679 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
flatfinal:74 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
FlatFinTypes [library]
flatFixedInput_compat:2992 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
flatFixedInput:845 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
flatFixedInput:849 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
FlatFunSingleTMGenNP [definition, in Complexity.NP.SAT.CookLevin.Subproblems.SingleTMGenNP]
FlatFunSingleTMGenNP_FlatSingleTMGenNP_equiv [lemma, in Complexity.NP.SAT.CookLevin.Subproblems.SingleTMGenNP]
flatGamma [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
flatGamma_poly [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
flatGamma_time_bound [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
flatGamma_time [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
flatGamma_bound [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
flatHalt [abbreviation, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
flatInl [definition, in Complexity.Libs.CookPrelim.FlatFinTypes]
flatInr [definition, in Complexity.Libs.CookPrelim.FlatFinTypes]
flatInr_flatNsig_time [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
flatInr_flatNsig [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
flatL:3675 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
flatM [definition, in Complexity.NP.SAT.CookLevin.Reductions.TMGenNP_fixed_singleTapeTM_to_FlatFunSingleTMGenNP]
flatMTICards [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
flatMTICards_poly [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
flatMTICards_time_bound [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
flatMTICards_time [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
flatMTLCards [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
flatMTLCards_poly [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
flatMTLCards_time_bound [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
flatMTLCards_time [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
flatMTRCards [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
flatMTRCards_poly [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
flatMTRCards_time_bound [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
flatMTRCards_time [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
flatNblank [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
flatNdelimC [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
flatNinit [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
flatNone [definition, in Complexity.Libs.CookPrelim.FlatFinTypes]
flatNsig [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
flatNstar [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
flatOption [definition, in Complexity.Libs.CookPrelim.FlatFinTypes]
flatPair [definition, in Complexity.Libs.CookPrelim.FlatFinTypes]
flatPair_time [definition, in Complexity.Libs.CookPrelim.FlatFinTypes]
flatPolarity [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
flatPolSigma [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
flatPolSigma_poly [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
flatPolSigma_time_bound [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
flatPolSigma_time [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
flatPolSigma_bound [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
flatPreludeCards [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
flatPreludeCards_ofFlatType [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
flatPreludeCards_length [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
flatPreludeCards_poly [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
flatPreludeCards_time_bound [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
flatPreludeCards_time [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
flatPreludeSigP_bound [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
flatPreludeSig' [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
flatProd [definition, in Complexity.Libs.CookPrelim.FlatFinTypes]
flatSigma [abbreviation, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
FlatSingleTMGenNP [definition, in Complexity.NP.SAT.CookLevin.Subproblems.SingleTMGenNP]
FlatSingleTMGenNP_to_3SAT [lemma, in Complexity.NP.SAT.CookLevin]
FlatSingleTMGenNP_to_FlatTCC [lemma, in Complexity.NP.SAT.CookLevin]
FlatSingleTMGenNP_to_FlatTCCLang_poly [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
FlatSingleTMGenNP_to_FlatTCC [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
FlatSingleTMGenNP_to_FlatTCC [library]
flatSome [definition, in Complexity.Libs.CookPrelim.FlatFinTypes]
flatStart [abbreviation, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
flatStateCards [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
flatStateCards_ofFlatType [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
flatStateCards_length [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
flatStateCards_poly [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
flatStateCards_time_bound [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
flatStateCards_time [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
flatStates [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
flatstates [abbreviation, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
flatStateSigma [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
flatStateSigma_bound [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
flatStates_poly [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
flatStates_time_bound [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
flatStates_time [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
flatStates_bound [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
flatStr':103 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
flatStr':67 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
flatStr:102 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
flatStr:66 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
flatSum [definition, in Complexity.Libs.CookPrelim.FlatFinTypes]
flatTapeCards [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
flatTapeCards_ofFlatType [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
flatTapeCards_length_poly [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
flatTapeCards_length [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
flatTapeCards_poly [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
flatTapeCards_time_bound [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
flatTapeCards_time [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
flatTapeSigma [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
flatTapeSigma_time [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
flatTapeSigma_bound [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
FlatTCC [record, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
FlatTCC [library]
FlatTCCLang [definition, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
FlatTCC_to_FlatCC [lemma, in Complexity.NP.SAT.CookLevin]
FlatTCC_enc_size [lemma, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
FlatTCC_wellformed [definition, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
FlatTCC_to_FlatCC_poly [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatTCC_to_FlatCC]
FlatTCC_to_FlatCC [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatTCC_to_FlatCC]
FlatTCC_to_FlatCC [library]
flattenConfig [definition, in Complexity.L.TM.TMflatten]
flattenConfig_isFlatteningConfigOf [lemma, in Complexity.L.TM.TMflatten]
flattenHalt [definition, in Complexity.L.TM.TMflatten]
flattenHalt_isFlatteningHaltOf [lemma, in Complexity.L.TM.TMflatten]
flattenHalt' [definition, in Complexity.L.TM.TMflatten]
flattenHalt'' [definition, in Complexity.L.TM.TMflatten]
flattenHalt''_correct [lemma, in Complexity.L.TM.TMflatten]
flattenHalt''_length [lemma, in Complexity.L.TM.TMflatten]
flatteningTapeIsValid [lemma, in Complexity.L.TM.TMunflatten]
flattenPolarity [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
flattenPolarity_reprEl [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
flattenPreludeSigP_reprEl [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
flattenPreludeSig' [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
flattenTapes [definition, in Complexity.L.TM.TMflatten]
flattenTapes_isFlatteningTapesOf [lemma, in Complexity.L.TM.TMflatten]
flattenTM [definition, in Complexity.L.TM.TMflatten]
flattenTM_isFlatteningTMOf [lemma, in Complexity.L.TM.TMflatten]
flattenTrans [definition, in Complexity.L.TM.TMflatten]
flattenTrans_isFlatteningTransOf [lemma, in Complexity.L.TM.TMflatten]
flatTM [record, in Complexity.L.TM.TMflat]
flatTM_TM_compat:2990 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
flatTM:675 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
flatTM:681 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
flatTM:743 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
flatTM:745 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
flatTM:844 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
flatTM:848 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
flatTrans [abbreviation, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
flatTrans_bound [projection, in Complexity.L.TM.TMunflatten]
flatTrans_inj [projection, in Complexity.L.TM.TMunflatten]
FlatUGraph [library]
flat_finalSubstrings_size_poly [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
flat_finalSubstrings_size_bound [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
flat_finalSubstrings_el_bound [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
flat_finalSubstrings_length [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
flat_finalSubstrings_poly [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
flat_finalSubstrings_time_bound [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
flat_finalSubstrings_time [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
flat_finalSubstrings_step_poly [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
flat_finalSubstrings_step_time_bound [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
flat_finalSubstrings_step_time [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
flat_finalSubstrings_step [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
flat_haltingStates_ofFlatType [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
flat_haltingStates_length [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
flat_haltingStates_poly [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
flat_haltingStates_time_bound [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
flat_haltingStates_time [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
flat_initial_string_size_poly [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
flat_initial_string_size_bound [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
flat_initial_string_ofFlatType [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
flat_initial_string_length [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
flat_initial_string_poly [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
flat_initial_string_time_bound [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
flat_initial_string_time [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
flat_baseEnvPrelude_length [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
flat_baseEnvHalt_length [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
flat_baseEnvNone_length [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
flat_baseEnv_length [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
flat_map_single [lemma, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
flat_map_flat_map [lemma, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
flat_map_app_inv [lemma, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
flat_map_app [lemma, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
flat_map.f [variable, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
flat_map.Y [variable, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
flat_map.X [variable, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
flat_map [section, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
flat_final [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
flat_finalSubstrings [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
flat_haltingStates [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
flat_initial [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
flat_initial_string [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
flat_baseEnvPrelude [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
flat_baseEnvHalt [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
flat_baseEnvNone [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
flat_baseEnv [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
flat_graph [lemma, in Complexity.NP.Clique.kSAT_to_FlatClique]
flat_edges [lemma, in Complexity.NP.Clique.kSAT_to_FlatClique]
flat1:3639 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
flat2:3640 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
flat:104 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
flat:99 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
fmap_reifer_bound [lemma, in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
fmap_reifier_default [lemma, in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
fmap_bound [lemma, in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
fmap_reifier_t_default [definition, in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
fmap_reifier_t [definition, in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
fmmap_reifer_bound [lemma, in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
fmmap_bound [lemma, in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
fnblank [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
fndelimC [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Fneg [constructor, in Complexity.NP.SAT.FSAT.FSAT]
fninit [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
fNonZero:43 [binder, in Complexity.Complexity.ONotationIsAppropriate]
fnsigVar [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
fnstar [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
focus [library]
foldl_time [section, in Undecidability.L.Datatypes.List.List_fold]
foldr_time [section, in Undecidability.L.Datatypes.List.List_fold]
fold_left_vector_to_list [lemma, in Undecidability.TM.Util.VectorPrelim]
fold_opt [definition, in Undecidability.TM.Util.Prelim]
fold_right_time_bound_env [lemma, in Complexity.Libs.CookPrelim.PolyBounds]
fold_right_and' [instance, in Undecidability.TM.Hoare.HoareRegister]
fold_right_and [instance, in Undecidability.TM.Hoare.HoareRegister]
fold_right_iff [instance, in Undecidability.TM.Hoare.HoareRegister]
fold_right_impl' [instance, in Undecidability.TM.Hoare.HoareRegister]
fold_right_time [definition, in Undecidability.L.Datatypes.List.List_fold]
fold_left_time [definition, in Undecidability.L.Datatypes.List.List_fold]
fOpt [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
For [constructor, in Complexity.NP.SAT.FSAT.FSAT]
forallb [section, in Undecidability.L.Datatypes.List.List_fold]
forallb_time [definition, in Complexity.NP.SAT.SAT_inNP]
forallb_time_bound_env [lemma, in Complexity.Libs.CookPrelim.PolyBounds]
forallb_time_const [lemma, in Undecidability.L.Datatypes.List.List_fold]
forallb_time_eq [lemma, in Undecidability.L.Datatypes.List.List_fold]
forallb_time [definition, in Undecidability.L.Datatypes.List.List_fold]
forallb' [definition, in Undecidability.TM.L.CompilerBoolFuns.Compiler_nat_facts]
forallb'' [definition, in Undecidability.TM.L.CompilerBoolFuns.Compiler_nat_facts]
forallb.X [variable, in Undecidability.L.Datatypes.List.List_fold]
Forall_filter [lemma, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
Forall_impl [lemma, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
Forall_forall_map [lemma, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
Forall_map [lemma, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
Forall_rev [lemma, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
Forall_cons_inv [lemma, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
Forall_app [lemma, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
forall_proc_help [lemma, in Undecidability.TM.L.CompilerBoolFuns.Compiler_nat_facts]
Forall_Forall2 [lemma, in Complexity.TM.PrettyBounds.BaseCodeSpace]
Forall_elim [lemma, in Complexity.L.TM.TMflatComp]
Forall_zipWith [lemma, in Complexity.L.TM.TMflatComp]
Forall_reif_t [lemma, in Undecidability.Shared.Libs.DLW.Utils.fin_base]
forall_bound_equiv [lemma, in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
forall_equiv.HPQ [variable, in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
forall_equiv.Q [variable, in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
forall_equiv.P [variable, in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
forall_equiv.A [variable, in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
forall_equiv.X [variable, in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
forall_equiv [section, in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
Forall2_vec_list [lemma, in Undecidability.Shared.Libs.DLW.Vec.vec]
Forall2_Forall [lemma, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
Forall2_map_both [lemma, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
Forall2_map_right [lemma, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
Forall2_map_left [lemma, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
Forall2_cons_inv_r [lemma, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
Forall2_cons_inv_l [lemma, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
Forall2_app_inv_r [lemma, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
Forall2_app_inv_l [lemma, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
Forall2_cons_inv [lemma, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
Forall2_nil_inv_r [lemma, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
Forall2_nil_inv_l [lemma, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
Forall2_mono [lemma, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
Forall2_map [lemma, in Complexity.TM.PrettyBounds.BaseCodeSpace]
Forall2_app_inv_r [lemma, in Undecidability.Shared.Libs.DLW.Utils.php]
Forall2_right_Forall [lemma, in Undecidability.Shared.Libs.DLW.Utils.php]
Forall2_impl [lemma, in Undecidability.Shared.Libs.DLW.Utils.php]
Forall2_length [lemma, in Undecidability.Shared.Libs.DLW.Utils.php]
Forall2_conj [lemma, in Undecidability.Shared.Libs.DLW.Utils.php]
Forall2_refl [instance, in Undecidability.TM.Hoare.HoareRegister]
formula [inductive, in Complexity.NP.SAT.FSAT.FSAT]
FormulaEncoding [library]
formula_varsIn_monotonic [lemma, in Complexity.NP.SAT.FSAT.FormulaEncoding]
formula_maxVar_poly [lemma, in Complexity.NP.SAT.FSAT.FSAT]
formula_maxVar_time_bound [lemma, in Complexity.NP.SAT.FSAT.FSAT]
formula_maxVar_time [definition, in Complexity.NP.SAT.FSAT.FSAT]
formula_total_size_enc_bound [lemma, in Complexity.NP.SAT.FSAT.FSAT]
formula_maxVar_enc_bound [lemma, in Complexity.NP.SAT.FSAT.FSAT]
formula_size_enc_bound [lemma, in Complexity.NP.SAT.FSAT.FSAT]
formula_enc_size_bound [lemma, in Complexity.NP.SAT.FSAT.FSAT]
formula_enc_size [lemma, in Complexity.NP.SAT.FSAT.FSAT]
formula_size [definition, in Complexity.NP.SAT.FSAT.FSAT]
formula_varsIn_bound [lemma, in Complexity.NP.SAT.FSAT.FSAT]
formula_maxVar_varsIn [lemma, in Complexity.NP.SAT.FSAT.FSAT]
formula_maxVar [definition, in Complexity.NP.SAT.FSAT.FSAT]
formula_varsIn [definition, in Complexity.NP.SAT.FSAT.FSAT]
formula_repr [definition, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
FP [definition, in Undecidability.Shared.Libs.PSL.Numbers]
fp [definition, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
fpolarity [inductive, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Fpolarity [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
fpolSigma [abbreviation, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
fpolSigma [abbreviation, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
fpq_Some [projection, in Undecidability.Shared.Libs.DLW.Utils.fin_quotient]
fpq_None [projection, in Undecidability.Shared.Libs.DLW.Utils.fin_quotient]
fpq_eq [projection, in Undecidability.Shared.Libs.DLW.Utils.fin_quotient]
fpq_repr [projection, in Undecidability.Shared.Libs.DLW.Utils.fin_quotient]
fpq_class [projection, in Undecidability.Shared.Libs.DLW.Utils.fin_quotient]
fpq_size [projection, in Undecidability.Shared.Libs.DLW.Utils.fin_quotient]
fpreludeSig' [inductive, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
fpr:122 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
fpr:13 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
fpr:138 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
fpr:14 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.BinaryCC]
fpr:14 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
fpr:140 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
fpr:158 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
fpr:168 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
fpr:170 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
fpr:18 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatTCC_to_FlatCC]
fpr:180 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
fpr:185 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
fpr:19 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
fpr:19 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatTCC_to_FlatCC]
fpr:23 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
fpr:270 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
fpr:33 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
fpr:36 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
fpr:43 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
fpr:45 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
fpr:47 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
fpr:49 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
fpr:49 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
fpr:51 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
fpr:51 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
fpr:52 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
fpr:53 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
fpr:54 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
fpr:54 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
fpr:56 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
fpr:58 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
fpr:60 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
fpr:62 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
fpr:63 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
fpr:64 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
fpr:66 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
fpr:68 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
fpr:69 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
fpr:70 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
fpr:71 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
fpr:73 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
fpr:76 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
fpr:77 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
fpr:78 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
fpr:80 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
fpr:82 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
fpr:84 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
fpr:95 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
fp_quotient.Some_inj [variable, in Undecidability.Shared.Libs.DLW.Utils.fin_quotient]
fp_quotient.dec [variable, in Undecidability.Shared.Libs.DLW.Utils.fin_quotient]
fp_quotient.per [variable, in Undecidability.Shared.Libs.DLW.Utils.fin_quotient]
fp_quotient [record, in Undecidability.Shared.Libs.DLW.Utils.fin_quotient]
fp_quotient.X [variable, in Undecidability.Shared.Libs.DLW.Utils.fin_quotient]
fp_quotient [section, in Undecidability.Shared.Libs.DLW.Utils.fin_quotient]
fp_nice [lemma, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
fp_nice4 [lemma, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
fp_nice3 [lemma, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
fp_nice2 [lemma, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
fp_nice1 [lemma, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
fp_eq [lemma, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
fq_equiv [projection, in Undecidability.Shared.Libs.DLW.Utils.fin_quotient]
fq_surj [projection, in Undecidability.Shared.Libs.DLW.Utils.fin_quotient]
fq_repr [projection, in Undecidability.Shared.Libs.DLW.Utils.fin_quotient]
fq_class [projection, in Undecidability.Shared.Libs.DLW.Utils.fin_quotient]
fq_size [projection, in Undecidability.Shared.Libs.DLW.Utils.fin_quotient]
Frame [definition, in Undecidability.TM.Hoare.HoareRegister]
Frame_withSpace [lemma, in Undecidability.TM.Hoare.HoareRegister]
fromListC [instance, in Undecidability.Shared.Libs.PSL.FiniteTypes.Arbitrary]
FSAT [definition, in Complexity.NP.SAT.FSAT.FSAT]
FSAT [library]
FSAT_to_3SAT [lemma, in Complexity.NP.SAT.CookLevin]
FSAT_to_SAT [lemma, in Complexity.NP.SAT.CookLevin]
FSAT_to_3SAT_poly [lemma, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
FSAT_to_SAT_poly [lemma, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
FSAT_to_3SAT [lemma, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
FSAT_to_SAT [lemma, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
FSAT_to_SAT [library]
fsbC [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
fssBC [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
fssSC [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
fStates [abbreviation, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
fStates [abbreviation, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
fstateSigma [inductive, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
FstateSigma [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
fst_optBound_time [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
fst_optBound [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
fs1:113 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
fs1:121 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
fs1:128 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
fs1:73 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
fs1:79 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
fs1:87 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
fs2:114 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
fs2:122 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
fs2:129 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
fs2:74 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
fs2:80 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
fs2:88 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
fs:115 [binder, in Undecidability.TM.Hoare.HoareRegister]
fs:128 [binder, in Undecidability.TM.Hoare.HoareRegister]
fs:136 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
fs:157 [binder, in Undecidability.TM.Hoare.HoareRegister]
fs:180 [binder, in Undecidability.TM.Hoare.HoareRegister]
fs:94 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
ftapeSigma [abbreviation, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
ftapeSigma [abbreviation, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
fTime:16 [binder, in Undecidability.L.Tactics.ComputableTime]
ftpr:1 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatTCC_to_FlatCC]
ftpr:100 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
ftpr:19 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
ftpr:2 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatTCC_to_FlatCC]
ftpr:20 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
ftpr:96 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
ftpr:98 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
Ftrue [constructor, in Complexity.NP.SAT.FSAT.FSAT]
fT':192 [binder, in Undecidability.L.Tactics.ComputableTime]
fT':197 [binder, in Undecidability.L.Tactics.ComputableTime]
fT:100 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
fT:105 [binder, in Undecidability.L.Tactics.ComputableTime]
fT:105 [binder, in Complexity.Libs.CookPrelim.PolyBounds]
fT:107 [binder, in Complexity.NP.SAT.SAT_inNP]
fT:111 [binder, in Undecidability.L.Tactics.ComputableTime]
fT:112 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
fT:118 [binder, in Undecidability.L.Tactics.ComputableTime]
fT:119 [binder, in Complexity.NP.SAT.SAT_inNP]
fT:123 [binder, in Undecidability.L.Tactics.ComputableTime]
fT:13 [binder, in Undecidability.L.Functions.LoopSum]
fT:134 [binder, in Undecidability.L.Tactics.ComputableTime]
fT:14 [binder, in Undecidability.L.Datatypes.List.List_basics]
fT:14 [binder, in Complexity.Complexity.Definitions]
fT:144 [binder, in Undecidability.L.Tactics.ComputableTime]
fT:149 [binder, in Undecidability.L.Tactics.ComputableTime]
fT:154 [binder, in Undecidability.L.Tactics.ComputableTime]
fT:157 [binder, in Undecidability.L.Tactics.ComputableTime]
fT:158 [binder, in Undecidability.L.Tactics.ComputableTime]
fT:165 [binder, in Undecidability.L.Tactics.ComputableTime]
fT:166 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
fT:17 [binder, in Undecidability.L.Datatypes.LVector]
fT:17 [binder, in Complexity.L.TM.TMflatComp]
fT:171 [binder, in Undecidability.L.Tactics.ComputableTime]
fT:175 [binder, in Undecidability.L.Tactics.ComputableTime]
fT:178 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
fT:191 [binder, in Undecidability.L.Tactics.ComputableTime]
fT:196 [binder, in Undecidability.L.Tactics.ComputableTime]
fT:20 [binder, in Undecidability.L.Functions.LoopSum]
fT:20 [binder, in Complexity.Complexity.Definitions]
fT:226 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
fT:232 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
fT:24 [binder, in Undecidability.L.Datatypes.List.List_fold]
fT:25 [binder, in Undecidability.L.TM.TapeFuns]
fT:27 [binder, in Complexity.Complexity.Definitions]
fT:3 [binder, in Undecidability.L.Tactics.ComputableDemo]
fT:3 [binder, in Undecidability.L.Datatypes.List.List_fold]
fT:30 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
fT:33 [binder, in Undecidability.L.Tactics.ComputableDemo]
fT:35 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
fT:35 [binder, in Undecidability.L.TM.TapeFuns]
fT:37 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
fT:38 [binder, in Undecidability.L.Datatypes.List.List_fold]
fT:4 [binder, in Undecidability.L.Tactics.ComputableTactics]
fT:4 [binder, in Complexity.Complexity.Definitions]
fT:40 [binder, in Undecidability.L.Tactics.ComputableDemo]
fT:42 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
fT:46 [binder, in Undecidability.L.Tactics.ComputableTime]
fT:47 [binder, in Undecidability.L.Tactics.ComputableDemo]
fT:49 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
fT:51 [binder, in Undecidability.L.Tactics.ComputableTime]
fT:55 [binder, in Undecidability.L.Tactics.ComputableTime]
fT:59 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
fT:6 [binder, in Undecidability.L.Datatypes.List.List_basics]
fT:6 [binder, in Undecidability.L.Functions.LoopSum]
fT:6 [binder, in Complexity.L.TM.TMflatComp]
fT:69 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
fT:69 [binder, in Undecidability.L.Tactics.ComputableTime]
fT:69 [binder, in Undecidability.L.Datatypes.LVector]
fT:7 [binder, in Undecidability.L.Datatypes.List.List_fold]
fT:73 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
fT:79 [binder, in Undecidability.L.Tactics.ComputableTime]
fT:95 [binder, in Undecidability.L.Tactics.ComputableTime]
FUEL [abbreviation, in Undecidability.L.Tactics.Extract]
fuel':34 [binder, in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisUnfoldClos]
fuel':39 [binder, in Complexity.L.AbstractMachines.UnfoldTailRec]
fuel':49 [binder, in Complexity.L.AbstractMachines.Computable.EvalForTime]
fuel:10 [binder, in Complexity.HierarchyTheorem.TimeHierarchyTheorem]
fuel:10 [binder, in Complexity.L.AbstractMachines.Computable.EvalForTimeBool]
fuel:14 [binder, in Complexity.HierarchyTheorem.TimeHierarchyTheorem]
fuel:15 [binder, in Undecidability.L.AbstractMachines.FlatPro.UnfoldClos]
fuel:16 [binder, in Complexity.HierarchyTheorem.TimeHierarchyTheorem]
fuel:187 [binder, in Undecidability.L.Tactics.Extract]
fuel:2 [binder, in Complexity.L.AbstractMachines.Computable.EvalForTimeBool]
fuel:2 [binder, in Complexity.L.AbstractMachines.UnfoldHeap]
fuel:20 [binder, in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
fuel:21 [binder, in Complexity.L.AbstractMachines.Computable.EvalForTime]
fuel:22 [binder, in Complexity.L.AbstractMachines.UnfoldTailRec]
fuel:23 [binder, in Complexity.L.AbstractMachines.Computable.EvalForTime]
fuel:24 [binder, in Undecidability.L.Functions.UnboundIteration]
fuel:25 [binder, in Complexity.L.AbstractMachines.Computable.EvalForTime]
fuel:33 [binder, in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisUnfoldClos]
fuel:33 [binder, in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
fuel:37 [binder, in Complexity.L.AbstractMachines.UnfoldTailRec]
fuel:37 [binder, in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
fuel:39 [binder, in Complexity.L.AbstractMachines.Computable.EvalForTime]
fuel:39 [binder, in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
fuel:41 [binder, in Complexity.L.AbstractMachines.Computable.EvalForTime]
fuel:44 [binder, in Complexity.L.AbstractMachines.Computable.EvalForTime]
fuel:44 [binder, in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
fuel:45 [binder, in Complexity.L.AbstractMachines.UnfoldTailRec]
fuel:48 [binder, in Complexity.L.AbstractMachines.Computable.EvalForTime]
fuel:49 [binder, in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisUnfoldClos]
fuel:49 [binder, in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
fuel:50 [binder, in Complexity.L.AbstractMachines.Computable.EvalForTime]
fuel:6 [binder, in Complexity.L.AbstractMachines.Computable.EvalForTimeBool]
fuel:61 [binder, in Complexity.L.AbstractMachines.Computable.EvalForTime]
fuel:7 [binder, in Complexity.L.AbstractMachines.Computable.EvalForTime]
fuel:72 [binder, in Undecidability.L.Tactics.Extract]
fuel:8 [binder, in Complexity.HierarchyTheorem.TimeHierarchyTheorem]
fuel:9 [binder, in Complexity.L.AbstractMachines.Computable.EvalForTime]
fuel:9 [binder, in Complexity.L.AbstractMachines.Computable.EvalForTimeBool]
fullAdder [definition, in Undecidability.TM.Code.BinNumbers.PosAddTM]
fullInput [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
funcomp [definition, in Undecidability.TM.Util.Prelim]
functional [definition, in Undecidability.L.Prelim.ARS]
functional [definition, in Undecidability.TM.Util.Relations]
FunctionalDefinitions [library]
functional_uc [lemma, in Undecidability.L.Prelim.ARS]
funTable [definition, in Undecidability.L.Functions.FinTypeLookup]
funTable [section, in Undecidability.L.Functions.FinTypeLookup]
funTable.eqbX [variable, in Undecidability.L.Functions.FinTypeLookup]
funTable.f [variable, in Undecidability.L.Functions.FinTypeLookup]
funTable.X [variable, in Undecidability.L.Functions.FinTypeLookup]
funTable.Y [variable, in Undecidability.L.Functions.FinTypeLookup]
Fun' [definition, in Undecidability.L.Complexity.GenericNary]
Fun'_simpl [lemma, in Undecidability.L.Complexity.GenericNary]
Fun'_eqn_3 [lemma, in Undecidability.L.Complexity.GenericNary]
Fun'_eqn_2 [lemma, in Undecidability.L.Complexity.GenericNary]
Fun'_eqn_1 [lemma, in Undecidability.L.Complexity.GenericNary]
fun2vec [definition, in Undecidability.Shared.Libs.DLW.Vec.vec]
fun2vec [section, in Undecidability.Shared.Libs.DLW.Vec.vec]
fun2vec_vec2fun [lemma, in Undecidability.Shared.Libs.DLW.Vec.vec]
fun2vec_lift [lemma, in Undecidability.Shared.Libs.DLW.Vec.vec]
fun2vec_id [lemma, in Undecidability.Shared.Libs.DLW.Vec.vec]
fun2vec.X [variable, in Undecidability.Shared.Libs.DLW.Vec.vec]
Fvar [constructor, in Complexity.NP.SAT.FSAT.FSAT]
fvertex [abbreviation, in Complexity.NP.Clique.FlatUGraph]
fV:69 [binder, in Complexity.NP.Clique.FlatUGraph]
fyTime:20 [binder, in Undecidability.L.Tactics.ComputableTime]
f__toTerm [projection, in Complexity.NP.L.CanEnumTerm_def]
f__c:52 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
f__c:51 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
f__UpToC [projection, in Undecidability.L.Complexity.UpToC]
f__size:122 [binder, in Complexity.Libs.CookPrelim.PolyBounds]
f__arg:121 [binder, in Complexity.Libs.CookPrelim.PolyBounds]
f__bound:106 [binder, in Complexity.Libs.CookPrelim.PolyBounds]
f_map [definition, in Undecidability.L.Functions.EnumInt]
f_filter [definition, in Undecidability.L.Functions.EnumInt]
F_sur [lemma, in Undecidability.Synthetic.Infinite]
F_inj [lemma, in Undecidability.Synthetic.Infinite]
F_inj' [lemma, in Undecidability.Synthetic.Infinite]
F_lt [lemma, in Undecidability.Synthetic.Infinite]
F_el [lemma, in Undecidability.Synthetic.Infinite]
F_nel [lemma, in Undecidability.Synthetic.Infinite]
f_sur [lemma, in Undecidability.Synthetic.Infinite]
f__decInTime [projection, in Complexity.Complexity.Definitions]
f__step:431 [binder, in Undecidability.TM.Hoare.HoareCombinators]
f__loop:430 [binder, in Undecidability.TM.Hoare.HoareCombinators]
f__correct [projection, in Complexity.Complexity.NP]
f__comp [projection, in Complexity.Complexity.NP]
F' [definition, in Undecidability.L.Computability.Synthetic]
F'' [definition, in Undecidability.L.Computability.Synthetic]
f':1 [binder, in Undecidability.TM.Code.ProgrammingTools]
f':112 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
f':115 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
f':117 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
f':12 [binder, in Complexity.Complexity.Subtypes]
f':12 [binder, in Complexity.L.TM.TMflat]
F':136 [binder, in Undecidability.Shared.Libs.PSL.Retracts]
f':143 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
f':152 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
F':154 [binder, in Undecidability.Shared.Libs.PSL.Retracts]
f':154 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
f':158 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
f':184 [binder, in Undecidability.L.Tactics.ComputableTime]
f':19 [binder, in Complexity.Complexity.ONotation]
f':2 [binder, in Undecidability.TM.Code.ProgrammingTools]
f':21 [binder, in Complexity.Complexity.ONotation]
f':21 [binder, in Undecidability.L.Functions.UnboundIteration]
f':2669 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
f':27 [binder, in Complexity.HierarchyTheorem.TimeHierarchyTheorem]
f':31 [binder, in Complexity.L.TM.TMflat]
f':33 [binder, in Complexity.Complexity.Definitions]
f':38 [binder, in Complexity.Complexity.Definitions]
f':44 [binder, in Complexity.Complexity.Definitions]
f':70 [binder, in Undecidability.L.Complexity.UpToC]
f':72 [binder, in Undecidability.L.Complexity.UpToCNary]
f':81 [binder, in Complexity.Complexity.Definitions]
f':98 [binder, in Undecidability.L.Tactics.Computable]
f0:24 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
f0:25 [binder, in Undecidability.TM.Combinators.Switch]
f0:5 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
f0:52 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
f0:7 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
f0:82 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
F1 [definition, in Undecidability.L.Computability.Synthetic]
f1:10 [binder, in Complexity.NP.SAT.FSAT.FSAT]
f1:10 [binder, in Complexity.Complexity.Monotonic]
F1:10 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.CompoundFinTypes]
f1:100 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
F1:101 [binder, in Undecidability.TM.Hoare.HoareCombinators]
f1:109 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
f1:11 [binder, in Complexity.Complexity.ONotation]
f1:116 [binder, in Undecidability.TM.Code.CodeTM]
F1:116 [binder, in Undecidability.TM.Hoare.HoareCombinators]
F1:12 [binder, in Undecidability.TM.Hoare.HoareCombinators]
f1:122 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.CC]
F1:125 [binder, in Undecidability.TM.Hoare.HoareCombinators]
f1:125 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.CC]
f1:13 [binder, in Undecidability.L.Prelim.MoreBase]
f1:13 [binder, in Complexity.Complexity.Monotonic]
f1:132 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
F1:135 [binder, in Undecidability.TM.Hoare.HoareCombinators]
f1:14 [binder, in Complexity.NP.SAT.FSAT.FSAT]
f1:142 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
F1:144 [binder, in Undecidability.TM.Hoare.HoareCombinators]
f1:15 [binder, in Complexity.Complexity.ONotation]
F1:163 [binder, in Undecidability.TM.Hoare.HoareCombinators]
f1:17 [binder, in Complexity.Complexity.Monotonic]
F1:176 [binder, in Undecidability.TM.Hoare.HoareCombinators]
F1:23 [binder, in Undecidability.TM.Hoare.HoareCombinators]
f1:24 [binder, in Complexity.Complexity.ONotation]
f1:24 [binder, in Undecidability.L.Complexity.UpToC]
f1:25 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
F1:256 [binder, in Undecidability.TM.Hoare.HoareCombinators]
f1:26 [binder, in Undecidability.L.Complexity.UpToCNary]
F1:266 [binder, in Undecidability.TM.Hoare.HoareCombinators]
f1:27 [binder, in Complexity.NP.SAT.FSAT.FSAT]
f1:27 [binder, in Complexity.Complexity.PolyTimeComputable]
F1:279 [binder, in Undecidability.TM.Hoare.HoareCombinators]
f1:28 [binder, in Undecidability.TM.L.CompilerBoolFuns.NaryApp]
f1:28 [binder, in Undecidability.Shared.Libs.PSL.Retracts]
F1:28 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.VectorFin]
f1:29 [binder, in Undecidability.L.Complexity.UpToC]
f1:29 [binder, in Complexity.NP.SAT.FSAT.FSAT]
F1:295 [binder, in Undecidability.TM.Hoare.HoareCombinators]
f1:30 [binder, in Complexity.Complexity.ONotation]
f1:31 [binder, in Undecidability.L.Complexity.UpToCNary]
f1:31 [binder, in Complexity.NP.SAT.FSAT.FSAT]
f1:33 [binder, in Complexity.NP.SAT.FSAT.FSAT]
F1:33 [binder, in Undecidability.TM.Hoare.HoareCombinators]
f1:34 [binder, in Undecidability.L.Complexity.UpToC]
f1:36 [binder, in Undecidability.L.Complexity.UpToCNary]
f1:36 [binder, in Undecidability.Synthetic.EnumerabilityFacts]
f1:3677 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
f1:4 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
f1:40 [binder, in Complexity.Complexity.PolyTimeComputable]
f1:42 [binder, in Complexity.NP.Clique.kSAT_to_FlatClique]
f1:45 [binder, in Undecidability.Synthetic.EnumerabilityFacts]
F1:45 [binder, in Undecidability.TM.Hoare.HoareCombinators]
f1:47 [binder, in Complexity.Libs.CookPrelim.PolyBounds]
f1:5 [binder, in Complexity.Complexity.Monotonic]
f1:53 [binder, in Complexity.NP.SAT.FSAT.FSAT]
F1:55 [binder, in Undecidability.L.Complexity.UpToC]
f1:55 [binder, in Complexity.NP.SAT.FSAT.FSAT]
f1:550 [binder, in Complexity.NP.TM.LM_to_mTM]
f1:56 [binder, in Complexity.Complexity.ONotation]
F1:56 [binder, in Undecidability.TM.Hoare.HoareCombinators]
F1:57 [binder, in Undecidability.L.Complexity.UpToCNary]
f1:57 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
f1:57 [binder, in Undecidability.L.Complexity.UpToC]
f1:59 [binder, in Complexity.Complexity.ONotation]
f1:59 [binder, in Undecidability.L.Complexity.UpToCNary]
f1:6 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
f1:6 [binder, in Complexity.Complexity.ONotation]
f1:61 [binder, in Complexity.Libs.CookPrelim.PolyBounds]
F1:67 [binder, in Undecidability.TM.Hoare.HoareCombinators]
f1:68 [binder, in Undecidability.Shared.Libs.PSL.Retracts]
f1:68 [binder, in Complexity.Complexity.UpToCPoly]
f1:69 [binder, in Complexity.Complexity.ONotation]
f1:73 [binder, in Complexity.Complexity.UpToCPoly]
F1:77 [binder, in Undecidability.TM.Hoare.HoareCombinators]
f1:79 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
f1:8 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
f1:8 [binder, in Complexity.NP.SAT.FSAT.FSAT]
f1:86 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
f1:87 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
f1:87 [binder, in Undecidability.TM.PrettyBounds.MaxList]
F1:89 [binder, in Undecidability.TM.Hoare.HoareCombinators]
f1:93 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
f2:101 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
F2:102 [binder, in Undecidability.TM.Hoare.HoareCombinators]
f2:11 [binder, in Complexity.NP.SAT.FSAT.FSAT]
f2:11 [binder, in Complexity.Complexity.Monotonic]
F2:11 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.CompoundFinTypes]
f2:110 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
f2:117 [binder, in Undecidability.TM.Code.CodeTM]
F2:117 [binder, in Undecidability.TM.Hoare.HoareCombinators]
f2:123 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.CC]
F2:126 [binder, in Undecidability.TM.Hoare.HoareCombinators]
f2:126 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.CC]
F2:13 [binder, in Undecidability.TM.Hoare.HoareCombinators]
f2:133 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
F2:136 [binder, in Undecidability.TM.Hoare.HoareCombinators]
f2:14 [binder, in Undecidability.L.Prelim.MoreBase]
f2:143 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
F2:145 [binder, in Undecidability.TM.Hoare.HoareCombinators]
f2:15 [binder, in Complexity.NP.SAT.FSAT.FSAT]
F2:164 [binder, in Undecidability.TM.Hoare.HoareCombinators]
F2:177 [binder, in Undecidability.TM.Hoare.HoareCombinators]
f2:18 [binder, in Complexity.Complexity.Monotonic]
F2:24 [binder, in Undecidability.TM.Hoare.HoareCombinators]
f2:25 [binder, in Complexity.Complexity.ONotation]
f2:25 [binder, in Undecidability.L.Complexity.UpToC]
F2:257 [binder, in Undecidability.TM.Hoare.HoareCombinators]
f2:26 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
F2:267 [binder, in Undecidability.TM.Hoare.HoareCombinators]
f2:27 [binder, in Undecidability.L.Complexity.UpToCNary]
f2:28 [binder, in Complexity.NP.SAT.FSAT.FSAT]
f2:28 [binder, in Complexity.Complexity.PolyTimeComputable]
F2:280 [binder, in Undecidability.TM.Hoare.HoareCombinators]
f2:29 [binder, in Undecidability.TM.L.CompilerBoolFuns.NaryApp]
f2:29 [binder, in Undecidability.Shared.Libs.PSL.Retracts]
F2:29 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.VectorFin]
F2:296 [binder, in Undecidability.TM.Hoare.HoareCombinators]
f2:30 [binder, in Undecidability.L.Complexity.UpToC]
f2:30 [binder, in Complexity.NP.SAT.FSAT.FSAT]
f2:31 [binder, in Complexity.Complexity.ONotation]
f2:32 [binder, in Undecidability.L.Complexity.UpToCNary]
f2:32 [binder, in Complexity.NP.SAT.FSAT.FSAT]
f2:34 [binder, in Complexity.NP.SAT.FSAT.FSAT]
F2:34 [binder, in Undecidability.TM.Hoare.HoareCombinators]
f2:35 [binder, in Undecidability.L.Complexity.UpToC]
f2:3678 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
f2:37 [binder, in Undecidability.L.Complexity.UpToCNary]
f2:37 [binder, in Undecidability.Synthetic.EnumerabilityFacts]
f2:41 [binder, in Complexity.Complexity.PolyTimeComputable]
f2:43 [binder, in Complexity.NP.Clique.kSAT_to_FlatClique]
f2:46 [binder, in Undecidability.Synthetic.EnumerabilityFacts]
F2:46 [binder, in Undecidability.TM.Hoare.HoareCombinators]
f2:48 [binder, in Complexity.Libs.CookPrelim.PolyBounds]
f2:5 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
f2:54 [binder, in Complexity.NP.SAT.FSAT.FSAT]
f2:551 [binder, in Complexity.NP.TM.LM_to_mTM]
F2:56 [binder, in Undecidability.L.Complexity.UpToC]
f2:56 [binder, in Complexity.NP.SAT.FSAT.FSAT]
f2:57 [binder, in Complexity.Complexity.ONotation]
F2:57 [binder, in Undecidability.TM.Hoare.HoareCombinators]
F2:58 [binder, in Undecidability.L.Complexity.UpToCNary]
f2:58 [binder, in Undecidability.L.Complexity.UpToC]
f2:6 [binder, in Complexity.Complexity.Monotonic]
f2:60 [binder, in Complexity.Complexity.ONotation]
f2:60 [binder, in Undecidability.L.Complexity.UpToCNary]
f2:62 [binder, in Complexity.Libs.CookPrelim.PolyBounds]
f2:64 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
F2:68 [binder, in Undecidability.TM.Hoare.HoareCombinators]
f2:69 [binder, in Undecidability.Shared.Libs.PSL.Retracts]
f2:69 [binder, in Complexity.Complexity.UpToCPoly]
f2:7 [binder, in Complexity.Complexity.ONotation]
f2:70 [binder, in Complexity.Complexity.ONotation]
f2:74 [binder, in Complexity.Complexity.UpToCPoly]
F2:78 [binder, in Undecidability.TM.Hoare.HoareCombinators]
f2:80 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
f2:87 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
f2:88 [binder, in Undecidability.TM.PrettyBounds.MaxList]
f2:9 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
f2:9 [binder, in Complexity.NP.SAT.FSAT.FSAT]
F2:90 [binder, in Undecidability.TM.Hoare.HoareCombinators]
f2:94 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
f2:94 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
f3:10 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
f:1 [binder, in Complexity.Complexity.ONotation]
F:1 [binder, in Undecidability.Shared.FinTypeForallExists]
f:1 [binder, in Complexity.Complexity.ONotationIsAppropriate]
F:1 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.Cardinality]
f:1 [binder, in Complexity.Complexity.Monotonic]
f:1 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler]
F:1 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.DepPairs]
f:10 [binder, in Undecidability.Synthetic.EnumerabilityFacts]
f:10 [binder, in Undecidability.L.Prelim.LoopSum]
f:10 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.DepPairs]
f:10 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
f:100 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
f:100 [binder, in Undecidability.L.Complexity.UpToCNary]
f:100 [binder, in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
F:101 [binder, in Undecidability.L.Complexity.UpToCNary]
f:101 [binder, in Complexity.NP.TM.LM_to_mTM]
f:102 [binder, in Undecidability.L.Tactics.ComputableTime]
f:102 [binder, in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
f:102 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
f:104 [binder, in Undecidability.Shared.Libs.DLW.Utils.sorting]
f:104 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
f:104 [binder, in Undecidability.TM.Util.Relations]
f:105 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
f:105 [binder, in Undecidability.TM.Util.Prelim]
F:105 [binder, in Undecidability.TM.Hoare.HoareRegister]
f:105 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
f:106 [binder, in Complexity.NP.SAT.SAT_inNP]
f:106 [binder, in Undecidability.TM.Code.Code]
f:107 [binder, in Undecidability.Shared.Libs.DLW.Utils.sorting]
f:107 [binder, in Complexity.L.TM.TMunflatten]
f:108 [binder, in Undecidability.TM.Single.StepTM]
f:108 [binder, in Undecidability.L.Tactics.ComputableTime]
f:108 [binder, in Complexity.NP.TM.LM_to_mTM]
f:109 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
f:1098 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
F:11 [binder, in Undecidability.Shared.FinTypeForallExists]
f:11 [binder, in Complexity.L.TM.TMflat]
f:11 [binder, in Undecidability.L.Functions.EqBool]
f:11 [binder, in Undecidability.Shared.Libs.PSL.Bijection]
f:11 [binder, in Complexity.Complexity.SpaceBoundsTime]
f:11 [binder, in Undecidability.L.Computability.Synthetic]
f:11 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
f:110 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
f:110 [binder, in Undecidability.TM.Code.Code]
F:110 [binder, in Undecidability.TM.Hoare.HoareLogic]
f:1102 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
f:111 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
f:111 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
f:111 [binder, in Undecidability.Shared.Libs.DLW.Utils.sorting]
f:113 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
f:113 [binder, in Complexity.NP.TM.LM_to_mTM]
f:114 [binder, in Undecidability.L.Tactics.ComputableTime]
f:114 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
f:114 [binder, in Complexity.Complexity.PolyTimeComputable]
f:114 [binder, in Undecidability.L.Tactics.Computable]
f:115 [binder, in Complexity.L.TM.CompCode]
f:116 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
f:118 [binder, in Complexity.NP.SAT.SAT_inNP]
f:118 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
F:12 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
f:12 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
f:12 [binder, in Undecidability.L.Functions.LoopSum]
f:12 [binder, in Complexity.TM.Code.Decode]
f:12 [binder, in Undecidability.Synthetic.Definitions]
f:12 [binder, in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
f:12 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.DepPairs]
f:12 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
F:120 [binder, in Undecidability.TM.Hoare.HoareRegister]
f:120 [binder, in Undecidability.TM.Util.Relations]
F:120 [binder, in Undecidability.TM.Hoare.HoareLogic]
f:121 [binder, in Undecidability.L.Tactics.ComputableTime]
f:121 [binder, in Undecidability.TM.Code.CodeTM]
f:121 [binder, in Complexity.L.TM.TMunflatten]
f:121 [binder, in Undecidability.L.Tactics.Computable]
f:123 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
f:123 [binder, in Complexity.Complexity.PolyTimeComputable]
f:124 [binder, in Undecidability.Shared.Libs.DLW.Utils.sorting]
f:124 [binder, in Undecidability.TM.Util.Relations]
f:126 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
f:128 [binder, in Undecidability.L.Tactics.Extract]
f:128 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
f:129 [binder, in Undecidability.L.Tactics.ComputableTime]
f:129 [binder, in Undecidability.Synthetic.ListEnumerabilityFacts]
f:13 [binder, in Undecidability.L.Tactics.Extract]
f:13 [binder, in Complexity.L.Functions.IterupN]
f:13 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.SingleTMGenNP]
f:13 [binder, in Undecidability.Shared.Libs.PSL.Lists.Dupfree]
f:13 [binder, in Undecidability.Synthetic.Infinite]
f:13 [binder, in Undecidability.TM.Code.List.App]
f:13 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.FiniteFunction]
f:13 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
f:130 [binder, in Complexity.NP.SAT.SAT_inNP]
f:130 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
f:131 [binder, in Complexity.L.TM.TMunflatten]
F:131 [binder, in Undecidability.TM.Hoare.HoareLogic]
f:132 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
f:132 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
F:132 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
f:132 [binder, in Undecidability.Synthetic.ListEnumerabilityFacts]
f:132 [binder, in Complexity.Complexity.PolyTimeComputable]
f:133 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
F:135 [binder, in Undecidability.Shared.Libs.PSL.Retracts]
f:135 [binder, in Undecidability.Synthetic.ListEnumerabilityFacts]
f:137 [binder, in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
f:139 [binder, in Undecidability.L.Tactics.Computable]
f:14 [binder, in Undecidability.L.Tactics.ComputableTime]
f:14 [binder, in Undecidability.TM.Util.VectorPrelim]
f:14 [binder, in Undecidability.Synthetic.EnumerabilityFacts]
f:14 [binder, in Complexity.Complexity.Subtypes]
F:14 [binder, in Undecidability.L.Complexity.UpToC]
f:14 [binder, in Complexity.Complexity.ONotationIsAppropriate]
f:14 [binder, in Undecidability.Shared.Libs.PSL.Bijection]
f:14 [binder, in Undecidability.Synthetic.Definitions]
f:14 [binder, in Complexity.L.TM.TMflatten]
f:14 [binder, in Undecidability.Synthetic.InformativeDefinitions]
f:14 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
F:14 [binder, in Undecidability.TM.Hoare.HoareLogic]
f:140 [binder, in Undecidability.Synthetic.ListEnumerabilityFacts]
F:140 [binder, in Undecidability.TM.Hoare.HoareLogic]
f:141 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
f:141 [binder, in Complexity.Complexity.PolyTimeComputable]
f:142 [binder, in Complexity.L.TM.CompCode]
f:142 [binder, in Complexity.L.TM.TMunflatten]
f:144 [binder, in Complexity.TM.PrettyBounds.UnivBounds]
f:144 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
f:145 [binder, in Undecidability.L.Tactics.Computable]
f:15 [binder, in Undecidability.L.Datatypes.LProd]
f:15 [binder, in Undecidability.TM.Hoare.HoareStdLib]
f:15 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.DepPairs]
f:150 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
F:151 [binder, in Undecidability.TM.Hoare.HoareRegister]
f:152 [binder, in Undecidability.L.Tactics.Computable]
F:153 [binder, in Undecidability.Shared.Libs.PSL.Retracts]
f:153 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
f:154 [binder, in Complexity.L.TM.TMunflatten]
f:155 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
f:155 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
f:156 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
f:156 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
f:157 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
f:158 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
f:159 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
f:16 [binder, in Undecidability.L.TM.TMinL]
f:16 [binder, in Undecidability.L.Datatypes.LVector]
f:16 [binder, in Undecidability.Shared.Libs.PSL.Bijection]
f:16 [binder, in Undecidability.L.Computability.Synthetic]
F:16 [binder, in Undecidability.L.Datatypes.List.List_fold]
f:16 [binder, in Complexity.Complexity.PolyTimeComputable]
f:161 [binder, in Complexity.L.TM.TMunflatten]
f:163 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
f:165 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
f:166 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
f:166 [binder, in Complexity.L.TM.TMflatComp]
f:167 [binder, in Undecidability.L.Tactics.ComputableTime]
f:169 [binder, in Complexity.L.TM.TMflatComp]
f:17 [binder, in Undecidability.L.Util.L_facts]
f:17 [binder, in Undecidability.TM.Combinators.Switch]
f:17 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
f:17 [binder, in Complexity.NP.SAT.FSAT.FSAT]
f:17 [binder, in Undecidability.L.Tactics.Lbeta_nonrefl]
f:17 [binder, in Undecidability.Synthetic.Infinite]
f:17 [binder, in Undecidability.L.Datatypes.List.List_fold]
f:17 [binder, in Undecidability.L.Prelim.MoreList]
F:170 [binder, in Undecidability.TM.Hoare.HoareLogic]
f:171 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
f:171 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
f:172 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
f:172 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
f:172 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
f:172 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
f:173 [binder, in Complexity.L.TM.TMunflatten]
F:173 [binder, in Undecidability.TM.Hoare.HoareRegister]
f:175 [binder, in Complexity.L.TM.TMflatComp]
f:177 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
f:178 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
f:178 [binder, in Complexity.L.TM.TMflatComp]
f:18 [binder, in Undecidability.Shared.Libs.PSL.Numbers]
f:18 [binder, in Complexity.L.Functions.IterupN]
f:18 [binder, in Complexity.L.TM.TMflatten]
f:18 [binder, in Complexity.TM.Compound.MoveToSymbol_niceSpec]
f:18 [binder, in Undecidability.TM.Hoare.HoareCombinators]
f:18 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.FiniteFunction]
f:18 [binder, in Complexity.NP.TM.TMGenNP_fixed_mTM]
f:180 [binder, in Undecidability.TM.Hoare.HoareLogic]
f:181 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
f:183 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
f:183 [binder, in Undecidability.L.Tactics.ComputableTime]
f:184 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
f:184 [binder, in Complexity.L.TM.TMflatComp]
F:185 [binder, in Undecidability.TM.Hoare.HoareLogic]
f:186 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
f:187 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
F:188 [binder, in Undecidability.TM.Hoare.HoareLogic]
F:188 [binder, in Undecidability.TM.Hoare.HoareCombinators]
f:189 [binder, in Undecidability.L.Prelim.ARS]
f:189 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
f:189 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
f:19 [binder, in Undecidability.L.Functions.LoopSum]
F:19 [binder, in Undecidability.L.Complexity.UpToC]
f:19 [binder, in Complexity.Complexity.ONotationIsAppropriate]
F:19 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
f:19 [binder, in Undecidability.Shared.Libs.PSL.Bijection]
f:19 [binder, in Undecidability.Synthetic.DecidabilityFacts]
f:19 [binder, in Undecidability.Shared.Libs.PSL.Vectors.VectorDupfree]
f:19 [binder, in Undecidability.L.Tactics.Computable]
F:19 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.CompoundFinTypes]
f:190 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
f:192 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
f:194 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
f:195 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
f:195 [binder, in Undecidability.TM.Util.TM_facts]
F:195 [binder, in Undecidability.TM.Hoare.HoareLogic]
f:196 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
F:197 [binder, in Undecidability.TM.Hoare.HoareCombinators]
f:198 [binder, in Complexity.L.TM.TMunflatten]
f:199 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
f:2 [binder, in Undecidability.TM.Code.List.Concat_Repeat]
f:2 [binder, in Undecidability.L.Complexity.UpToCNary]
F:2 [binder, in Undecidability.TM.Hoare.HoareLegacy]
f:2 [binder, in Complexity.TM.Single.EncodeTapesInvariants]
f:2 [binder, in Undecidability.L.Tactics.ComputableDemo]
f:2 [binder, in Undecidability.L.Complexity.UpToC]
f:2 [binder, in Complexity.L.TM.TMflatComp]
F:2 [binder, in Complexity.NP.TM.M_multi2mono]
f:2 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
f:20 [binder, in Undecidability.L.Tactics.ComputableDemo]
f:20 [binder, in Undecidability.L.Complexity.UpToC]
f:20 [binder, in Undecidability.Synthetic.Definitions]
f:20 [binder, in Undecidability.TM.Code.Code]
f:20 [binder, in Undecidability.L.Computability.Synthetic]
f:20 [binder, in Undecidability.TM.L.Transcode.Enc_to_Boollist]
f:20 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler]
f:200 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
f:201 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
f:201 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
F:201 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
f:201 [binder, in Undecidability.TM.Util.TM_facts]
f:202 [binder, in Complexity.L.TM.TMunflatten]
F:203 [binder, in Undecidability.TM.Hoare.HoareLogic]
f:205 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
f:207 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
f:207 [binder, in Complexity.L.TM.TMflatComp]
f:208 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
f:208 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
F:21 [binder, in Undecidability.Shared.FinTypeEquiv]
f:21 [binder, in Undecidability.TM.Code.CodeTM]
f:21 [binder, in Complexity.NP.SAT.FSAT.FSAT]
f:21 [binder, in Undecidability.Shared.Libs.PSL.Bijection]
f:210 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
f:210 [binder, in Undecidability.TM.Util.TM_facts]
f:212 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
f:212 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
f:213 [binder, in Complexity.L.TM.TMunflatten]
F:213 [binder, in Undecidability.TM.Hoare.HoareCombinators]
f:213 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
f:214 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
F:214 [binder, in Undecidability.TM.Hoare.HoareLogic]
f:215 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
f:216 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
F:217 [binder, in Undecidability.TM.Hoare.HoareLogic]
f:219 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
f:22 [binder, in Undecidability.L.Prelim.LoopSum]
f:22 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
f:22 [binder, in Complexity.L.TM.TMunflatten]
f:22 [binder, in Complexity.NP.SAT.FSAT.FSAT]
f:22 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_base]
f:22 [binder, in Undecidability.Shared.Libs.PSL.Bijection]
f:22 [binder, in Undecidability.Synthetic.Definitions]
f:22 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
F:22 [binder, in Undecidability.TM.Hoare.HoareLogic]
f:22 [binder, in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
f:222 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
f:224 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
f:225 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
f:225 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
f:225 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
F:226 [binder, in Undecidability.TM.Hoare.HoareLogic]
f:228 [binder, in Undecidability.L.Prelim.ARS]
f:228 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
f:229 [binder, in Complexity.L.TM.TMflatComp]
f:23 [binder, in Undecidability.L.Datatypes.LProd]
f:23 [binder, in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
f:23 [binder, in Undecidability.TM.Combinators.Switch]
f:23 [binder, in Undecidability.Shared.FinTypeEquiv]
f:23 [binder, in Complexity.L.Functions.IterupN]
F:23 [binder, in Undecidability.L.Complexity.UpToC]
f:23 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
f:23 [binder, in Undecidability.TM.Combinators.If]
f:23 [binder, in Complexity.TM.Compound.MoveToSymbol_niceSpec]
f:23 [binder, in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
f:23 [binder, in Undecidability.L.Datatypes.List.List_fold]
f:231 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
f:231 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
f:231 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
F:231 [binder, in Undecidability.TM.Hoare.HoareCombinators]
F:232 [binder, in Undecidability.TM.Hoare.HoareRegister]
f:233 [binder, in Complexity.L.TM.TMflatComp]
F:235 [binder, in Undecidability.TM.Hoare.HoareLogic]
f:236 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
f:237 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
f:237 [binder, in Complexity.L.TM.TMflatComp]
f:238 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
f:24 [binder, in Undecidability.L.TM.TapeFuns]
f:24 [binder, in Undecidability.TM.Code.ChangeAlphabet]
f:24 [binder, in Undecidability.Synthetic.ListEnumerabilityFacts]
f:24 [binder, in Undecidability.L.Prelim.MoreList]
f:240 [binder, in Complexity.L.TM.TMflatComp]
f:242 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
F:244 [binder, in Undecidability.TM.Hoare.HoareCombinators]
F:245 [binder, in Undecidability.TM.Hoare.HoareLogic]
f:245 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
f:246 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
f:248 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
F:248 [binder, in Undecidability.TM.Hoare.HoareRegister]
f:248 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
F:25 [binder, in Undecidability.L.Complexity.UpToCNary]
f:25 [binder, in Complexity.L.TM.TMflatComp]
f:25 [binder, in Undecidability.TM.Code.CodeTM]
f:25 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
f:25 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
f:25 [binder, in Undecidability.Shared.Libs.PSL.Vectors.VectorDupfree]
f:25 [binder, in Undecidability.L.Complexity.GenericNary]
f:25 [binder, in Complexity.Complexity.NP]
F:250 [binder, in Undecidability.TM.Util.TM_facts]
F:252 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
F:256 [binder, in Undecidability.TM.Hoare.HoareLogic]
f:257 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
f:259 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
f:259 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
f:26 [binder, in Undecidability.L.Datatypes.LOptions]
F:26 [binder, in Complexity.L.Functions.IterupN]
f:26 [binder, in Complexity.L.TM.CompCode]
f:26 [binder, in Undecidability.L.Tactics.Computable]
F:260 [binder, in Undecidability.TM.Hoare.HoareRegister]
F:261 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
f:261 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
f:264 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
f:264 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
f:265 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
F:266 [binder, in Undecidability.TM.Hoare.HoareLogic]
f:2662 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
f:267 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
f:27 [binder, in Undecidability.TM.Combinators.Combinators]
f:27 [binder, in Undecidability.TM.Combinators.While]
f:27 [binder, in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
f:27 [binder, in Undecidability.TM.Combinators.Switch]
f:27 [binder, in Complexity.Complexity.Subtypes]
f:27 [binder, in Complexity.L.TM.TMflatComp]
F:272 [binder, in Undecidability.TM.Util.TM_facts]
f:274 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
F:275 [binder, in Undecidability.TM.Hoare.HoareRegister]
F:275 [binder, in Undecidability.TM.Util.TM_facts]
F:277 [binder, in Undecidability.TM.Hoare.HoareLogic]
f:2793 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
f:2795 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
F:28 [binder, in Undecidability.L.Complexity.UpToC]
f:28 [binder, in Complexity.Libs.UniformHomomorphisms]
f:28 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
f:28 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.SingleTMGenNP]
f:28 [binder, in Undecidability.Synthetic.Definitions]
f:28 [binder, in Undecidability.Synthetic.ListEnumerabilityFacts]
F:28 [binder, in Undecidability.TM.Hoare.HoareLogic]
F:282 [binder, in Undecidability.TM.Util.TM_facts]
f:283 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
F:284 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
F:284 [binder, in Undecidability.TM.Hoare.HoareLogic]
f:286 [binder, in Complexity.L.TM.TMflatComp]
F:288 [binder, in Undecidability.TM.Hoare.HoareRegister]
f:29 [binder, in Undecidability.TM.Util.VectorPrelim]
f:29 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_base]
f:29 [binder, in Undecidability.L.Computability.Decidability]
f:29 [binder, in Undecidability.L.Complexity.GenericNary]
f:29 [binder, in Undecidability.L.Prelim.MoreList]
f:290 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
F:291 [binder, in Undecidability.TM.Hoare.HoareLogic]
f:293 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
f:294 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
f:295 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
f:296 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
f:298 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
F:299 [binder, in Undecidability.TM.Hoare.HoareLogic]
F:3 [binder, in Undecidability.TM.Code.List.Concat_Repeat]
f:3 [binder, in Undecidability.Shared.Libs.PSL.Retracts]
f:3 [binder, in Undecidability.Shared.Libs.DLW.Utils.quotient]
f:3 [binder, in Undecidability.Shared.Libs.PSL.Bijection]
f:3 [binder, in Undecidability.Synthetic.InformativeDefinitions]
f:3 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.FiniteFunction]
f:3 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.DepPairs]
f:30 [binder, in Undecidability.TM.Combinators.Combinators]
F:30 [binder, in Undecidability.L.Complexity.UpToCNary]
f:30 [binder, in Complexity.L.Functions.IterupN]
f:30 [binder, in Complexity.L.TM.TMunflatten]
f:30 [binder, in Complexity.L.TM.TMflat]
f:30 [binder, in Undecidability.Synthetic.ListEnumerabilityFacts]
f:30 [binder, in Undecidability.TM.Hoare.HoareCombinators]
f:303 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
f:304 [binder, in Undecidability.TM.Hoare.HoareCombinators]
F:305 [binder, in Undecidability.TM.Util.TM_facts]
f:3053 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
f:306 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
F:307 [binder, in Undecidability.TM.Hoare.HoareLogic]
f:308 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
f:31 [binder, in Undecidability.L.Prelim.LoopSum]
F:31 [binder, in Complexity.L.Functions.IterupN]
f:31 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
f:31 [binder, in Undecidability.Synthetic.Definitions]
f:31 [binder, in Complexity.L.TM.TMflatFun]
f:31 [binder, in Undecidability.L.Datatypes.List.List_fold]
f:311 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
F:312 [binder, in Undecidability.TM.Util.TM_facts]
F:312 [binder, in Undecidability.TM.Hoare.HoareCombinators]
f:313 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
F:316 [binder, in Undecidability.TM.Hoare.HoareLogic]
f:316 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
f:318 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
F:319 [binder, in Undecidability.TM.Util.TM_facts]
f:319 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
f:32 [binder, in Undecidability.L.Tactics.ComputableDemo]
f:32 [binder, in Complexity.NP.TM.TMGenNP]
f:32 [binder, in Complexity.Complexity.Definitions]
f:32 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler]
F:323 [binder, in Undecidability.TM.Hoare.HoareRegister]
F:323 [binder, in Undecidability.TM.Hoare.HoareCombinators]
f:323 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
F:324 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
f:324 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
f:325 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
F:325 [binder, in Undecidability.TM.Util.TM_facts]
F:327 [binder, in Undecidability.TM.Hoare.HoareLogic]
f:327 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
f:328 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
f:33 [binder, in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
f:33 [binder, in Undecidability.L.Datatypes.LSum]
F:33 [binder, in Undecidability.L.Complexity.UpToC]
f:33 [binder, in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
f:330 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
f:331 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
F:331 [binder, in Undecidability.TM.Util.TM_facts]
f:331 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
F:333 [binder, in Undecidability.TM.Hoare.HoareRegister]
f:333 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
f:334 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
f:335 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
f:336 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
F:338 [binder, in Undecidability.TM.Util.TM_facts]
f:339 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
F:339 [binder, in Undecidability.TM.Hoare.HoareLogic]
f:34 [binder, in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
f:34 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
f:34 [binder, in Undecidability.L.TM.TapeFuns]
f:34 [binder, in Undecidability.Shared.Libs.DLW.Utils.sorting]
f:34 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
f:34 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
F:340 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
F:343 [binder, in Undecidability.TM.Util.TM_facts]
f:345 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
f:345 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
f:349 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
F:35 [binder, in Undecidability.L.Complexity.UpToCNary]
f:35 [binder, in Undecidability.TM.Lifting.LiftAlphabet]
f:35 [binder, in Undecidability.TM.Util.VectorPrelim]
f:35 [binder, in Complexity.L.Functions.IterupN]
f:35 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
f:35 [binder, in Complexity.NP.SAT.FSAT.FSAT]
f:35 [binder, in Undecidability.TM.Combinators.If]
f:35 [binder, in Complexity.TM.Single.DecodeTapes]
F:350 [binder, in Undecidability.TM.Hoare.HoareLogic]
f:350 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
F:351 [binder, in Undecidability.TM.Util.TM_facts]
f:352 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
f:352 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
f:353 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
f:354 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
f:355 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
f:356 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
f:357 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
f:358 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
f:359 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
f:359 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
f:36 [binder, in Undecidability.TM.Combinators.While]
f:36 [binder, in Undecidability.L.Prelim.LoopSum]
f:36 [binder, in Complexity.Complexity.Subtypes]
f:36 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
f:36 [binder, in Complexity.Complexity.ONotationIsAppropriate]
f:3601 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
f:361 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
F:363 [binder, in Undecidability.TM.Hoare.HoareLogic]
F:364 [binder, in Undecidability.TM.Hoare.HoareRegister]
F:364 [binder, in Undecidability.TM.Hoare.HoareCombinators]
f:366 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
f:37 [binder, in Undecidability.TM.Univ.LowLevel]
f:37 [binder, in Complexity.NP.SAT.FSAT.FSAT]
f:37 [binder, in Complexity.L.TM.TMflatten]
f:37 [binder, in Undecidability.L.Datatypes.List.List_fold]
f:37 [binder, in Complexity.Complexity.Definitions]
F:371 [binder, in Undecidability.TM.Hoare.HoareLogic]
f:3710 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
f:374 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
f:375 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
F:375 [binder, in Undecidability.TM.Util.TM_facts]
F:378 [binder, in Undecidability.TM.Hoare.HoareRegister]
f:379 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
F:379 [binder, in Undecidability.TM.Hoare.HoareLogic]
f:38 [binder, in Complexity.L.TM.TMflatten]
F:381 [binder, in Undecidability.TM.Hoare.HoareCombinators]
f:383 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
f:385 [binder, in Undecidability.TM.Hoare.HoareCombinators]
f:387 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
F:388 [binder, in Undecidability.TM.Util.TM_facts]
F:388 [binder, in Undecidability.TM.Hoare.HoareLogic]
f:39 [binder, in Complexity.Complexity.ONotation]
f:39 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
f:39 [binder, in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
f:39 [binder, in Undecidability.L.Tactics.ComputableDemo]
f:39 [binder, in Undecidability.L.Complexity.UpToC]
f:39 [binder, in Undecidability.Shared.Libs.DLW.Utils.sorting]
f:39 [binder, in Complexity.Complexity.ONotationIsAppropriate]
f:39 [binder, in Complexity.NP.SAT.FSAT.FSAT]
f:39 [binder, in Undecidability.Synthetic.Definitions]
F:39 [binder, in Undecidability.TM.Util.Relations]
f:39 [binder, in Complexity.Complexity.Definitions]
F:393 [binder, in Undecidability.TM.Hoare.HoareRegister]
f:395 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
f:397 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
f:397 [binder, in Undecidability.TM.Util.TM_facts]
F:397 [binder, in Undecidability.TM.Hoare.HoareLogic]
f:4 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
f:4 [binder, in Undecidability.L.Prelim.LoopSum]
f:4 [binder, in Complexity.NP.SAT.FSAT.FSAT]
f:4 [binder, in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
f:4 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.DepPairs]
f:40 [binder, in Undecidability.Shared.Libs.PSL.Lists.Filter]
f:40 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
F:40 [binder, in Undecidability.L.Complexity.UpToC]
F:40 [binder, in Undecidability.TM.Hoare.HoareLogic]
f:40 [binder, in Undecidability.TM.Hoare.HoareCombinators]
F:41 [binder, in Undecidability.L.Complexity.UpToCNary]
f:41 [binder, in Undecidability.L.Tactics.ComputableTime]
f:41 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
f:41 [binder, in Undecidability.Shared.Libs.DLW.Utils.crt]
f:41 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
f:41 [binder, in Undecidability.TM.Code.Code]
f:41 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
f:411 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
F:411 [binder, in Undecidability.TM.Hoare.HoareRegister]
f:412 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
f:415 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
f:42 [binder, in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
f:42 [binder, in Undecidability.L.Complexity.UpToCNary]
f:42 [binder, in Complexity.NP.TM.TMGenNP]
f:42 [binder, in Complexity.L.TM.TMflatComp]
f:42 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
f:42 [binder, in Complexity.NP.SAT.FSAT.FSAT]
f:42 [binder, in Complexity.L.AbstractMachines.FunctionalDefinitions]
f:421 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
f:423 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
F:426 [binder, in Undecidability.TM.Hoare.HoareCombinators]
f:43 [binder, in Undecidability.L.Datatypes.List.List_basics]
f:43 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.SingleTMGenNP]
f:43 [binder, in Undecidability.TM.Util.Relations]
f:43 [binder, in Complexity.Complexity.Definitions]
f:431 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
f:44 [binder, in Complexity.Complexity.ONotation]
f:44 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
f:44 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
f:44 [binder, in Undecidability.L.Complexity.UpToC]
f:44 [binder, in Complexity.L.TM.TMflatComp]
f:44 [binder, in Complexity.NP.SAT.FSAT.FSAT]
f:44 [binder, in Undecidability.TM.Util.Relations]
F:445 [binder, in Undecidability.TM.Hoare.HoareCombinators]
f:446 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
f:449 [binder, in Undecidability.TM.Hoare.HoareCombinators]
f:45 [binder, in Undecidability.TM.L.Transcode.Boollist_to_Enc]
F:45 [binder, in Undecidability.L.Complexity.UpToC]
f:45 [binder, in Undecidability.Shared.Libs.DLW.Utils.sorting]
f:45 [binder, in Undecidability.TM.Univ.LowLevel]
f:45 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
f:454 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
f:459 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
F:46 [binder, in Undecidability.L.Complexity.UpToCNary]
f:46 [binder, in Undecidability.L.Tactics.ComputableDemo]
f:46 [binder, in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
f:46 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
F:462 [binder, in Undecidability.TM.Hoare.HoareRegister]
f:464 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
f:47 [binder, in Undecidability.L.Complexity.UpToCNary]
f:47 [binder, in Complexity.NP.SAT.FSAT.FSAT]
F:47 [binder, in Undecidability.TM.Util.Relations]
f:471 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
F:477 [binder, in Undecidability.TM.Hoare.HoareRegister]
f:48 [binder, in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
f:48 [binder, in Undecidability.L.Datatypes.List.List_basics]
f:48 [binder, in Undecidability.Synthetic.EnumerabilityFacts]
f:48 [binder, in Complexity.Complexity.Subtypes]
f:48 [binder, in Undecidability.Shared.Libs.DLW.Utils.crt]
f:48 [binder, in Undecidability.TM.Code.Code]
f:48 [binder, in Complexity.Complexity.Definitions]
f:48 [binder, in Complexity.L.AbstractMachines.FunctionalDefinitions]
f:48 [binder, in Undecidability.L.Tactics.Computable]
F:485 [binder, in Undecidability.TM.Hoare.HoareRegister]
f:49 [binder, in Complexity.Complexity.ONotation]
f:49 [binder, in Undecidability.L.Tactics.ComputableTime]
F:49 [binder, in Undecidability.L.Complexity.UpToC]
F:49 [binder, in Undecidability.TM.Hoare.HoareLogic]
F:494 [binder, in Undecidability.TM.Hoare.HoareRegister]
f:5 [binder, in Undecidability.L.TM.TMinL]
f:5 [binder, in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
f:5 [binder, in Undecidability.L.Functions.LoopSum]
f:5 [binder, in Complexity.L.Functions.IterupN]
f:5 [binder, in Undecidability.Shared.Libs.DLW.Code.compiler]
f:5 [binder, in Undecidability.TM.Univ.LowLevel]
f:5 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
f:5 [binder, in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
F:5 [binder, in Undecidability.TM.Hoare.HoareLogic]
F:5 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.DepPairs]
f:50 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
f:50 [binder, in Complexity.NP.SAT.FSAT.FSAT]
f:50 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
F:505 [binder, in Undecidability.TM.Hoare.HoareRegister]
f:51 [binder, in Complexity.Complexity.ONotation]
F:51 [binder, in Undecidability.L.Complexity.UpToCNary]
f:51 [binder, in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
F:51 [binder, in Undecidability.L.Complexity.UpToC]
f:51 [binder, in Complexity.L.TM.TMflatComp]
f:51 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
f:51 [binder, in Undecidability.TM.Util.Relations]
F:517 [binder, in Undecidability.TM.Hoare.HoareRegister]
f:52 [binder, in Undecidability.TM.Combinators.Switch]
f:52 [binder, in Undecidability.Synthetic.EnumerabilityFacts]
f:52 [binder, in Undecidability.L.Complexity.UpToC]
f:52 [binder, in Undecidability.L.Datatypes.List.List_eqb]
f:52 [binder, in Undecidability.TM.Util.Relations]
f:52 [binder, in Undecidability.L.Complexity.GenericNary]
F:526 [binder, in Undecidability.TM.Hoare.HoareRegister]
F:53 [binder, in Undecidability.L.Complexity.UpToCNary]
f:53 [binder, in Undecidability.TM.Combinators.Switch]
f:53 [binder, in Complexity.Complexity.Definitions]
f:53 [binder, in Undecidability.TM.Hoare.HoareCombinators]
f:53 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.FiniteFunction]
f:53 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
F:536 [binder, in Undecidability.TM.Hoare.HoareRegister]
f:54 [binder, in Undecidability.L.Complexity.UpToCNary]
f:54 [binder, in Undecidability.Synthetic.EnumerabilityFacts]
f:54 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
f:54 [binder, in Complexity.TM.PrettyBounds.PrettyBounds]
F:549 [binder, in Undecidability.TM.Hoare.HoareRegister]
f:55 [binder, in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
f:55 [binder, in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
f:55 [binder, in Undecidability.L.Datatypes.List.List_eqb]
f:55 [binder, in Complexity.Complexity.PolyTimeComputable]
f:55 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
f:56 [binder, in Undecidability.Shared.Libs.PSL.Retracts]
f:56 [binder, in Complexity.TM.PrettyBounds.BaseCodeSpace]
f:56 [binder, in Complexity.L.TM.TMunflatten]
f:56 [binder, in Undecidability.L.Complexity.GenericNary]
F:56 [binder, in Undecidability.TM.Hoare.HoareLogic]
f:56 [binder, in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
f:56 [binder, in Undecidability.L.Tactics.Computable]
F:563 [binder, in Undecidability.TM.Hoare.HoareRegister]
f:57 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
f:57 [binder, in Complexity.NP.SAT.FSAT.FSAT]
f:57 [binder, in Undecidability.TM.Util.TM_facts]
F:574 [binder, in Undecidability.TM.Hoare.HoareRegister]
f:58 [binder, in Complexity.L.TM.TMflatComp]
f:58 [binder, in Complexity.NP.SAT.FSAT.FSAT]
f:58 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
f:58 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
f:58 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
f:58 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
f:59 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
f:59 [binder, in Complexity.NP.SAT.FSAT.FSAT]
f:59 [binder, in Undecidability.L.Complexity.GenericNary]
f:59 [binder, in Complexity.Complexity.Definitions]
f:59 [binder, in Complexity.NP.TM.LM_to_mTM]
f:59 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
f:6 [binder, in Undecidability.Shared.Libs.PSL.Numbers]
f:6 [binder, in Undecidability.Shared.Libs.PSL.Bijection]
f:6 [binder, in Undecidability.Synthetic.InformativeDefinitions]
f:6 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
f:6 [binder, in Undecidability.L.Datatypes.List.List_fold]
f:6 [binder, in Undecidability.TM.L.Transcode.Enc_to_Boollist]
f:6 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
f:6 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
f:60 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
f:60 [binder, in Complexity.NP.SAT.FSAT.FSAT]
f:60 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.FiniteFunction]
f:61 [binder, in Complexity.Complexity.Subtypes]
f:61 [binder, in Complexity.NP.SAT.FSAT.FSAT]
f:61 [binder, in Undecidability.TM.Code.Code]
f:61 [binder, in Undecidability.TM.L.Transcode.Enc_to_Boollist]
f:61 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
f:62 [binder, in Undecidability.Shared.Libs.PSL.Retracts]
f:62 [binder, in Complexity.NP.SAT.FSAT.FSAT]
f:62 [binder, in Undecidability.L.Complexity.GenericNary]
f:62 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
f:63 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
f:63 [binder, in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
f:63 [binder, in Undecidability.TM.Combinators.Switch]
f:63 [binder, in Undecidability.L.Complexity.UpToC]
f:63 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
F:63 [binder, in Undecidability.TM.Hoare.HoareLogic]
f:64 [binder, in Complexity.Complexity.ONotation]
F:64 [binder, in Undecidability.L.Complexity.UpToC]
f:64 [binder, in Undecidability.TM.Util.TM_facts]
f:64 [binder, in Complexity.Complexity.PolyTimeComputable]
f:65 [binder, in Undecidability.L.Complexity.UpToCNary]
f:65 [binder, in Undecidability.TM.Util.Prelim]
f:65 [binder, in Undecidability.Shared.Libs.DLW.Utils.sorting]
f:65 [binder, in Complexity.NP.SAT.FSAT.FSAT]
f:65 [binder, in Undecidability.TM.Code.Code]
F:66 [binder, in Undecidability.L.Complexity.UpToCNary]
f:66 [binder, in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
f:66 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
f:66 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
f:66 [binder, in Undecidability.L.Complexity.GenericNary]
f:66 [binder, in Undecidability.L.Tactics.Computable]
f:67 [binder, in Complexity.Complexity.ONotation]
f:67 [binder, in Undecidability.L.Tactics.ComputableTime]
f:67 [binder, in Complexity.L.TM.CompCode]
f:67 [binder, in Complexity.NP.SAT.FSAT.FSAT]
f:67 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
f:67 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
f:68 [binder, in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
f:68 [binder, in Undecidability.TM.Util.Prelim]
f:68 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
f:69 [binder, in Undecidability.L.Complexity.UpToC]
f:69 [binder, in Undecidability.Shared.Libs.DLW.Utils.sorting]
f:7 [binder, in Undecidability.L.Datatypes.LProd]
f:7 [binder, in Complexity.L.TM.TMflatEnc]
f:7 [binder, in Undecidability.TM.Combinators.Switch]
f:7 [binder, in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
f:7 [binder, in Complexity.Complexity.ONotationIsAppropriate]
f:7 [binder, in Undecidability.Synthetic.Definitions]
f:7 [binder, in Complexity.Complexity.PolyTimeComputable]
F:7 [binder, in Undecidability.TM.Hoare.HoareStdLib]
f:7 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.FiniteFunction]
f:7 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.DepPairs]
f:7 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
f:70 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
f:70 [binder, in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
f:70 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
f:70 [binder, in Undecidability.L.Functions.FinTypeLookup]
f:70 [binder, in Complexity.Complexity.Definitions]
F:70 [binder, in Undecidability.TM.Hoare.HoareLogic]
f:70 [binder, in Undecidability.TM.PrettyBounds.MaxList]
f:71 [binder, in Undecidability.L.Complexity.UpToCNary]
f:71 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
f:71 [binder, in Undecidability.TM.Util.Prelim]
f:71 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
f:71 [binder, in Undecidability.L.Tactics.Computable]
f:72 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
f:72 [binder, in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
f:72 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
f:72 [binder, in Undecidability.L.Complexity.GenericNary]
f:73 [binder, in Undecidability.TM.Combinators.Switch]
f:73 [binder, in Undecidability.Shared.Libs.DLW.Utils.sorting]
f:73 [binder, in Complexity.Complexity.PolyTimeComputable]
f:74 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
f:74 [binder, in Undecidability.TM.Util.Prelim]
f:74 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
F:75 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
f:75 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
f:75 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
F:75 [binder, in Undecidability.TM.Hoare.HoareLogic]
f:76 [binder, in Undecidability.L.Complexity.UpToC]
f:76 [binder, in Undecidability.Shared.Libs.DLW.Utils.sorting]
F:77 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
f:77 [binder, in Undecidability.L.Tactics.ComputableTime]
f:77 [binder, in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
F:77 [binder, in Undecidability.L.Complexity.UpToC]
f:77 [binder, in Complexity.Complexity.PolyTimeComputable]
f:78 [binder, in Undecidability.TM.Combinators.Switch]
f:78 [binder, in Undecidability.TM.Util.Prelim]
f:78 [binder, in Undecidability.L.Tactics.Computable]
f:79 [binder, in Undecidability.TM.Combinators.Switch]
f:79 [binder, in Undecidability.Shared.Libs.DLW.Utils.sorting]
f:8 [binder, in Undecidability.L.Util.L_facts]
f:8 [binder, in Undecidability.TM.Combinators.Switch]
f:8 [binder, in Complexity.NP.TM.TMGenNP]
f:8 [binder, in Complexity.Complexity.UpToCPoly]
F:8 [binder, in Undecidability.L.Datatypes.LFinType]
f:8 [binder, in Undecidability.TM.Code.NatSub]
f:8 [binder, in Complexity.TM.Compound.MoveToSymbol_niceSpec]
f:8 [binder, in Complexity.Complexity.Monotonic]
f:8 [binder, in Complexity.Complexity.NP]
f:8 [binder, in Undecidability.TM.Hoare.HoareStdLib]
f:8 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.DepPairs]
f:8 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
f:80 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
f:80 [binder, in Complexity.Complexity.Definitions]
f:81 [binder, in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
f:81 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
F:81 [binder, in Undecidability.TM.Hoare.HoareLogic]
F:82 [binder, in Undecidability.L.Complexity.UpToC]
f:82 [binder, in Undecidability.Shared.Libs.DLW.Utils.sorting]
f:83 [binder, in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
f:83 [binder, in Complexity.Complexity.PolyTimeComputable]
f:84 [binder, in Undecidability.TM.Single.StepTM]
f:85 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
f:86 [binder, in Undecidability.TM.Util.Prelim]
F:86 [binder, in Undecidability.TM.Hoare.HoareLogic]
f:86 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
f:868 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
f:87 [binder, in Undecidability.L.Complexity.GenericNary]
f:88 [binder, in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
f:88 [binder, in Undecidability.L.Complexity.UpToC]
f:88 [binder, in Undecidability.Shared.Libs.DLW.Utils.sorting]
f:88 [binder, in Undecidability.L.Tactics.Reflection]
f:88 [binder, in Undecidability.L.Tactics.Computable]
f:88 [binder, in Complexity.NP.TM.LM_to_mTM]
f:89 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
f:89 [binder, in Undecidability.TM.Code.Code]
f:89 [binder, in Complexity.Complexity.NP]
f:892 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
f:897 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
f:9 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
f:9 [binder, in Undecidability.Shared.Libs.PSL.Bijection]
f:9 [binder, in Undecidability.Synthetic.InformativeDefinitions]
f:9 [binder, in Complexity.L.TM.TMflatFun]
f:9 [binder, in Undecidability.L.Datatypes.List.List_fold]
f:90 [binder, in Undecidability.L.Tactics.Extract]
f:90 [binder, in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
f:90 [binder, in Complexity.L.TM.CompCode]
f:90 [binder, in Undecidability.Shared.Libs.DLW.Utils.php]
f:90 [binder, in Complexity.Complexity.Definitions]
F:91 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
f:92 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
f:92 [binder, in Undecidability.L.Tactics.ComputableTime]
f:93 [binder, in Undecidability.TM.Single.StepTM]
f:94 [binder, in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
f:95 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
f:95 [binder, in Undecidability.L.Complexity.UpToC]
f:95 [binder, in Undecidability.Shared.Libs.DLW.Utils.sorting]
f:96 [binder, in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
F:96 [binder, in Undecidability.L.Complexity.UpToC]
f:96 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
f:96 [binder, in Complexity.Complexity.Definitions]
F:96 [binder, in Undecidability.TM.Hoare.HoareLogic]
F:97 [binder, in Undecidability.TM.Hoare.HoareRegister]
f:97 [binder, in Undecidability.L.Tactics.Computable]
f:98 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
f:98 [binder, in Complexity.Libs.CookPrelim.PolyBounds]
f:99 [binder, in Undecidability.TM.Single.StepTM]
f:99 [binder, in Undecidability.TM.Util.Prelim]
f:99 [binder, in Complexity.L.ComparisonTimeBoundDerivation]

G

g [definition, in Undecidability.L.Computability.Enum]
G [definition, in Undecidability.Synthetic.Infinite]
Gamma [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
gamma:194 [binder, in Undecidability.TM.Util.TM_facts]
garb [definition, in Undecidability.TM.L.CompilerBoolFuns.Compiler]
gcd [definition, in Undecidability.Shared.Libs.DLW.Utils.gcd]
gcd [library]
gcd_spec [lemma, in Undecidability.Shared.Libs.DLW.Utils.gcd]
_ div _ [notation, in Undecidability.Shared.Libs.DLW.Utils.gcd]
gcd_lcm [section, in Undecidability.Shared.Libs.DLW.Utils.gcd]
Gcnf [definition, in Complexity.NP.Clique.kSAT_to_Clique]
gen [lemma, in Undecidability.Synthetic.Infinite]
GenEncode [library]
generateAlphabetFin [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
generateAlphabetFin_canonical [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
generateAlphabetFlat [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
generateAlphabetFlat_ofFlatType [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
generateAlphabetFlat_poly [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
generateAlphabetFlat_time_bound [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
generateAlphabetFlat_time [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
generateAlphabetFlat_canonical [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
generateAlphabet_reprEl [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
generateCanonical [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
generateCard [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
generateCardFlat [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
generateCardFlat_ofFlatType [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
generateCardsForFin [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
generateCardsForFinHalt [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
generateCardsForFinNonHalt [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
generateCardsForFlat [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
generateCardsForFlatHalt [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
generateCardsForFlatHalt_ofFlatType [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
generateCardsForFlatHalt_length [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
generateCardsForFlatHalt_poly [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
generateCardsForFlatHalt_time_bound [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
generateCardsForFlatHalt_time [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
generateCardsForFlatNonHalt [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
generateCardsForFlatNonHalt_ofFlatType [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
generateCardsForFlatNonHalt_length_poly [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
generateCardsForFlatNonHalt_length [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
generateCardsForFlatNonHalt_poly [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
generateCardsForFlatNonHalt_time_bound [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
generateCardsForFlatNonHalt_time [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
generateCardsForFlat_length_poly [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
generateCardsForFlat_length [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
generateCardsForFlat_poly [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
generateCardsForFlat_time_bound [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
generateCardsForFlat_time [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
generateCardsForFlat_step [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
generateCard_poly [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
generateCard_time_bound [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
generateCard_time [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
generateCard_isFlatCardOf [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
generateCard_Some [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
generateGammaFin [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
generateGammaFlat [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
generateGammaFlat_ofFlatType [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
generateGammaFlat_poly [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
generateGammaFlat_time_bound [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
generateGammaFlat_time [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
generatePolarityFin [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
generatePolarityFlat [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
generatePolarityFlat_ofFlatType [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
generatePolarityFlat_poly [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
generatePolarityFlat_time_bound [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
generatePolarityFlat_time [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
generatePolarityVar [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
generatePolSigmaFin [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
generatePolSigmaFlat [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
generatePolSigmaFlat_ofFlatType [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
generatePolSigmaFlat_poly [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
generatePolSigmaFlat_time_bound [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
generatePolSigmaFlat_time [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
generatePreludeSigPFin [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
generatePreludeSigPFlat [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
generatePreludeSigPFlat_poly [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
generatePreludeSigPFlat_time_bound [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
generatePreludeSigPFlat_time [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
generatePreludeSigP_ofFlatType [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
generateSigVar [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
generateStatesFin [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
generateStatesFlat [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
generateStatesFlat_ofFlatType [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
generateStatesFlat_poly [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
generateStatesFlat_time_bound [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
generateStatesFlat_time [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
generateStateSigmaFin [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
generateStateSigmaFlat [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
generateStateSigmaFlat_ofFlatType [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
generateStateSigmaFlat_poly [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
generateStateSigmaFlat_time_bound [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
generateStateSigmaFlat_time [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
generateStateSigmaVar [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
generateStateVar [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
generateTapeSigmaFin [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
generateTapeSigmaFlat [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
generateTapeSigmaFlat_ofFlatType [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
generateTapeSigmaFlat_poly [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
generateTapeSigmaFlat_time_bound [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
generateTapeSigmaFlat_time [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
generate:2956 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
generate:3164 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
generate:3173 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
generate:3181 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
generate:3191 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
generating [definition, in Undecidability.Synthetic.Infinite]
GenericNary [library]
GenNP [definition, in Complexity.NP.L.GenNP]
GenNP [section, in Complexity.NP.L.GenNP]
GenNP [library]
GenNPBool [definition, in Complexity.NP.L.GenNPBool]
GenNPBool [library]
GenNPBool_complete [lemma, in Complexity.NP.L.GenNPBool]
GenNP_to_3SAT [lemma, in Complexity.NP.SAT.CookLevin]
GenNP_to_SingleTMGenNP [lemma, in Complexity.NP.SAT.CookLevin]
GenNP_to_LMGenNP [lemma, in Complexity.NP.SAT.CookLevin]
GenNP_to_TMGenNP [lemma, in Complexity.NP.TM.IntermediateProblems]
GenNP_to_LMGenNP [lemma, in Complexity.NP.TM.L_to_LM]
GenNP_is_hard [library]
GenNP' [definition, in Complexity.NP.L.GenNP]
genTrans [definition, in Complexity.L.TM.TMflatten]
gen_compiler_correction [lemma, in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
gen_compiler_terminates [lemma, in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
gen_compiler_output [lemma, in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
gen_compiler_complete [lemma, in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
gen_compiler_sound [lemma, in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
gen_linker_out [lemma, in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
gen_compiler [definition, in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
gen_linker [definition, in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
gen_constructor [definition, in Undecidability.L.Tactics.Extract]
gen_list_spec [lemma, in Undecidability.TM.L.CompilerBoolFuns.Compiler_nat_facts]
gen_list [definition, in Undecidability.TM.L.CompilerBoolFuns.Compiler_nat_facts]
gen_le_f [lemma, in Undecidability.Synthetic.Infinite]
gen_spec [lemma, in Undecidability.Synthetic.Infinite]
gen' [definition, in Undecidability.Synthetic.Infinite]
get [definition, in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
getat [definition, in Undecidability.Shared.FinTypeEquiv]
getatIn [lemma, in Undecidability.Shared.FinTypeEquiv]
getPosition [definition, in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
getPosition_nth [lemma, in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
getPosition_correct [lemma, in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
getPosition_prodLists [lemma, in Complexity.Libs.CookPrelim.MorePrelim]
getPosition_app2 [lemma, in Complexity.Libs.CookPrelim.MorePrelim]
getPosition_app1 [lemma, in Complexity.Libs.CookPrelim.MorePrelim]
getPosition_map [lemma, in Complexity.Libs.CookPrelim.MorePrelim]
get_current [lemma, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
get_current [lemma, in Complexity.L.AbstractMachines.AbstractHeapMachine]
GF [lemma, in Undecidability.Synthetic.Infinite]
Gflat [definition, in Complexity.NP.Clique.kSAT_to_FlatClique]
Gflat_size_poly [lemma, in Complexity.NP.Clique.kSAT_to_FlatClique]
Gflat_size_bound [lemma, in Complexity.NP.Clique.kSAT_to_FlatClique]
Gflat_poly [lemma, in Complexity.NP.Clique.kSAT_to_FlatClique]
Gflat_time_bound [lemma, in Complexity.NP.Clique.kSAT_to_FlatClique]
Gflat_time [definition, in Complexity.NP.Clique.kSAT_to_FlatClique]
gNonZero:11 [binder, in Complexity.Complexity.ONotationIsAppropriate]
godel_beta_fun_inv_triples [lemma, in Undecidability.Shared.Libs.DLW.Utils.crt]
godel_beta_fun_inv [lemma, in Undecidability.Shared.Libs.DLW.Utils.crt]
godel_beta_inv [lemma, in Undecidability.Shared.Libs.DLW.Utils.crt]
godel_beta [definition, in Undecidability.Shared.Libs.DLW.Utils.crt]
Godel_beta [section, in Undecidability.Shared.Libs.DLW.Utils.crt]
GoToCurrent [definition, in Undecidability.TM.Single.StepTM]
GoToCurrent_steps_nice [lemma, in Complexity.TM.PrettyBounds.M2MBounds]
GoToCurrent_steps'_nice [lemma, in Complexity.TM.PrettyBounds.M2MBounds]
GoToCurrent_Terminates [lemma, in Undecidability.TM.Single.StepTM]
GoToCurrent_T [definition, in Undecidability.TM.Single.StepTM]
GoToCurrent_steps [definition, in Undecidability.TM.Single.StepTM]
GoToCurrent_steps' [definition, in Undecidability.TM.Single.StepTM]
GoToCurrent_Realise [lemma, in Undecidability.TM.Single.StepTM]
GoToCurrent_Rel [definition, in Undecidability.TM.Single.StepTM]
GoToHSB [definition, in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
GoToHSB_Realise [lemma, in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
GoToHSB_Rel [definition, in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
GoToLSB [definition, in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
GoToLSB_start_Realise [lemma, in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
GoToLSB_start_Rel [definition, in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
GoToLSB_start [definition, in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
GoToLSB_Realise [lemma, in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
GoToLSB_Rel [definition, in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
GoToNext [definition, in Undecidability.TM.Single.StepTM]
GoToNext_steps_nice [lemma, in Complexity.TM.PrettyBounds.M2MBounds]
GoToNext_steps'_nice [lemma, in Complexity.TM.PrettyBounds.M2MBounds]
GoToNext_Terminates [lemma, in Undecidability.TM.Single.StepTM]
GoToNext_T [definition, in Undecidability.TM.Single.StepTM]
GoToNext_steps [definition, in Undecidability.TM.Single.StepTM]
GoToNext_steps' [definition, in Undecidability.TM.Single.StepTM]
GoToNext_Realise [lemma, in Undecidability.TM.Single.StepTM]
GoToNext_Rel [definition, in Undecidability.TM.Single.StepTM]
Graph [section, in Undecidability.TM.Univ.LowLevel]
graph_of_TM_In'' [lemma, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
graph_of_TM_not_nil [lemma, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
graph_of_fun_not_empty [lemma, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
graph_of_TM_In' [lemma, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
graph_of_TM_In [lemma, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
graph_of_TM [definition, in Undecidability.TM.Univ.LowLevel]
graph_function [definition, in Undecidability.TM.Univ.LowLevel]
graph_of_fun_lookup [lemma, in Undecidability.TM.Univ.LowLevel]
graph_of_fun_In' [lemma, in Undecidability.TM.Univ.LowLevel]
graph_of_fun_In [lemma, in Undecidability.TM.Univ.LowLevel]
graph_of_fun_functional [lemma, in Undecidability.TM.Univ.LowLevel]
graph_of_fun [definition, in Undecidability.TM.Univ.LowLevel]
graph_of_fun_ext [lemma, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
Graph.A [variable, in Undecidability.TM.Univ.LowLevel]
Graph.B [variable, in Undecidability.TM.Univ.LowLevel]
Graph.f [variable, in Undecidability.TM.Univ.LowLevel]
greatest_tape [definition, in Complexity.TM.PrettyBounds.M2MBounds]
gT:28 [binder, in Undecidability.L.Datatypes.LVector]
gT:42 [binder, in Undecidability.L.Datatypes.LVector]
g_T [lemma, in Undecidability.L.Computability.Enum]
g_g_inv [lemma, in Undecidability.L.Computability.Enum]
g_inv_g [lemma, in Undecidability.L.Computability.Enum]
g_inv [definition, in Undecidability.L.Computability.Enum]
g_nlb_fun [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
g_nlb [inductive, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
g_nondec_correct [lemma, in Undecidability.L.Functions.EnumInt]
g_nondec [definition, in Undecidability.L.Functions.EnumInt]
G':156 [binder, in Undecidability.Shared.Libs.PSL.Retracts]
g':2670 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
G0:32 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.CC]
g1:26 [binder, in Complexity.Complexity.ONotation]
g1:27 [binder, in Undecidability.Shared.Libs.DLW.Utils.interval]
g1:31 [binder, in Undecidability.Shared.Libs.PSL.Retracts]
g1:32 [binder, in Complexity.Complexity.ONotation]
g1:38 [binder, in Undecidability.Shared.Libs.DLW.Utils.interval]
g1:72 [binder, in Undecidability.Shared.Libs.PSL.Retracts]
g2:27 [binder, in Complexity.Complexity.ONotation]
g2:29 [binder, in Undecidability.Shared.Libs.DLW.Utils.interval]
g2:32 [binder, in Undecidability.Shared.Libs.PSL.Retracts]
g2:33 [binder, in Complexity.Complexity.ONotation]
g2:40 [binder, in Undecidability.Shared.Libs.DLW.Utils.interval]
g2:73 [binder, in Undecidability.Shared.Libs.PSL.Retracts]
G:1 [binder, in Complexity.NP.Clique.FlatClique]
G:10 [binder, in Complexity.NP.Clique.FlatUGraph]
g:10 [binder, in Undecidability.Shared.Libs.PSL.Bijection]
g:10 [binder, in Undecidability.TM.L.HeapInterpreter.LookupTM]
g:101 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
g:103 [binder, in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
g:103 [binder, in Undecidability.Shared.Libs.DLW.Utils.sorting]
g:108 [binder, in Undecidability.Shared.Libs.DLW.Utils.sorting]
G:11 [binder, in Complexity.NP.Clique.FlatClique]
g:11 [binder, in Undecidability.L.Computability.Computability]
g:112 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
g:112 [binder, in Undecidability.Shared.Libs.DLW.Utils.sorting]
g:115 [binder, in Undecidability.Shared.Libs.DLW.Utils.sorting]
g:115 [binder, in Complexity.Complexity.PolyTimeComputable]
g:116 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
g:116 [binder, in Complexity.L.TM.CompCode]
g:12 [binder, in Complexity.Complexity.ONotation]
G:121 [binder, in Complexity.NP.Clique.FlatClique]
G:124 [binder, in Complexity.NP.Clique.FlatClique]
g:124 [binder, in Complexity.Complexity.PolyTimeComputable]
g:125 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
g:125 [binder, in Undecidability.Shared.Libs.DLW.Utils.sorting]
G:126 [binder, in Complexity.NP.Clique.FlatClique]
G:128 [binder, in Complexity.NP.Clique.FlatClique]
g:13 [binder, in Complexity.L.AbstractMachines.Computable.EvalForTime]
g:130 [binder, in Undecidability.Shared.Libs.DLW.Utils.sorting]
g:131 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
G:132 [binder, in Complexity.NP.Clique.FlatClique]
g:133 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
g:133 [binder, in Complexity.Complexity.PolyTimeComputable]
G:138 [binder, in Complexity.NP.Clique.FlatClique]
G:14 [binder, in Complexity.NP.Clique.FlatUGraph]
g:140 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
G:142 [binder, in Complexity.NP.Clique.FlatClique]
g:147 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachine]
g:149 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
g:15 [binder, in Complexity.Complexity.ONotationIsAppropriate]
g:15 [binder, in Undecidability.Shared.Libs.PSL.Bijection]
g:153 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
G:155 [binder, in Undecidability.Shared.Libs.PSL.Retracts]
g:158 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
g:16 [binder, in Undecidability.L.Datatypes.LProd]
g:16 [binder, in Complexity.Complexity.ONotation]
g:16 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds_Loop]
g:16 [binder, in Complexity.NP.Clique.Clique]
g:16 [binder, in Undecidability.TM.Hoare.HoareStdLib]
g:162 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
g:165 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
g:166 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
g:168 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
g:169 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
g:17 [binder, in Complexity.Complexity.PolyTimeComputable]
g:170 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
g:174 [binder, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
g:176 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
g:176 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
g:180 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
g:181 [binder, in Undecidability.TM.Hoare.HoareLogic]
g:181 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
g:187 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
g:187 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
G:19 [binder, in Complexity.NP.Clique.FlatClique]
g:19 [binder, in Complexity.TM.Compound.MoveToSymbol_niceSpec]
g:191 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
g:192 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
g:193 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
g:194 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
g:195 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
g:196 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
g:196 [binder, in Undecidability.TM.Util.TM_facts]
g:197 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
g:2 [binder, in Complexity.Complexity.ONotation]
g:2 [binder, in Complexity.Complexity.ONotationIsAppropriate]
g:20 [binder, in Complexity.Complexity.ONotationIsAppropriate]
g:20 [binder, in Undecidability.Shared.Libs.PSL.Bijection]
g:202 [binder, in Undecidability.TM.Util.TM_facts]
g:202 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
g:206 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
g:210 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
g:216 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
g:22 [binder, in Complexity.Complexity.ONotation]
g:227 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
g:23 [binder, in Undecidability.Shared.Libs.PSL.Bijection]
g:234 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
g:237 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
g:24 [binder, in Undecidability.L.Datatypes.LProd]
g:24 [binder, in Undecidability.Shared.FinTypeEquiv]
g:24 [binder, in Complexity.TM.Compound.MoveToSymbol_niceSpec]
g:240 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
g:243 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
g:249 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
g:25 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachine]
g:25 [binder, in Undecidability.TM.Code.ChangeAlphabet]
g:25 [binder, in Undecidability.L.Prelim.MoreList]
g:251 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
g:261 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
g:2663 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
g:27 [binder, in Undecidability.Shared.Libs.DLW.Utils.sorting]
g:28 [binder, in Complexity.HierarchyTheorem.TimeHierarchyTheorem]
g:28 [binder, in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
g:284 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
G:29 [binder, in Complexity.NP.Clique.FlatUGraph]
G:29 [binder, in Complexity.NP.Clique.FlatClique]
g:29 [binder, in Complexity.Complexity.PolyTimeComputable]
g:3 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
g:3 [binder, in Undecidability.L.Complexity.UpToCNary]
g:3 [binder, in Undecidability.L.Complexity.UpToC]
g:30 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
g:30 [binder, in Undecidability.Shared.Libs.DLW.Utils.interval]
G:32 [binder, in Complexity.NP.Clique.FlatClique]
g:32 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachine]
g:34 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
g:34 [binder, in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
g:34 [binder, in Undecidability.L.Datatypes.LSum]
g:34 [binder, in Complexity.TM.Single.DecodeTapes]
g:340 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
G:35 [binder, in Complexity.NP.Clique.FlatClique]
g:369 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
g:37 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
g:38 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
g:38 [binder, in Undecidability.TM.Univ.LowLevel]
g:386 [binder, in Undecidability.TM.Hoare.HoareCombinators]
g:398 [binder, in Undecidability.TM.Util.TM_facts]
g:4 [binder, in Undecidability.Shared.Libs.PSL.Retracts]
g:4 [binder, in Undecidability.Shared.Libs.PSL.Bijection]
g:40 [binder, in Complexity.Complexity.ONotation]
g:40 [binder, in Complexity.Complexity.ONotationIsAppropriate]
g:40 [binder, in Complexity.Complexity.Definitions]
g:41 [binder, in Undecidability.Shared.Libs.DLW.Utils.interval]
g:41 [binder, in Undecidability.L.Datatypes.LVector]
g:41 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachine]
g:42 [binder, in Complexity.Complexity.PolyTimeComputable]
g:427 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
g:432 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
g:44 [binder, in Undecidability.Shared.Libs.DLW.Utils.sorting]
g:449 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
g:45 [binder, in Complexity.Complexity.ONotation]
g:45 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
G:45 [binder, in Complexity.NP.Clique.FlatUGraph]
g:450 [binder, in Undecidability.TM.Hoare.HoareCombinators]
g:46 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
g:50 [binder, in Complexity.Complexity.ONotation]
g:50 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachine]
g:51 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
g:51 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
g:51 [binder, in Undecidability.Shared.Libs.DLW.Utils.sorting]
g:54 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
g:54 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachine]
g:55 [binder, in Complexity.L.AbstractMachines.Computable.EvalForTime]
g:55 [binder, in Complexity.TM.PrettyBounds.PrettyBounds]
g:56 [binder, in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
g:56 [binder, in Complexity.Complexity.PolyTimeComputable]
g:56 [binder, in Undecidability.TM.L.HeapInterpreter.LookupTM]
g:57 [binder, in Complexity.TM.PrettyBounds.BaseCodeSpace]
g:58 [binder, in Undecidability.Shared.Libs.PSL.Retracts]
g:59 [binder, in Undecidability.Shared.Libs.DLW.Utils.sorting]
g:6 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
g:6 [binder, in Undecidability.TM.Univ.LowLevel]
g:60 [binder, in Complexity.NP.TM.LM_to_mTM]
g:63 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachine]
g:64 [binder, in Undecidability.Shared.Libs.PSL.Retracts]
g:64 [binder, in Complexity.TM.PrettyBounds.PrettyBounds]
g:65 [binder, in Complexity.Complexity.PolyTimeComputable]
g:66 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
g:67 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
g:67 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
g:67 [binder, in Complexity.NP.Clique.FlatUGraph]
g:68 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
g:68 [binder, in Complexity.L.TM.CompCode]
g:69 [binder, in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
g:69 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachine]
g:7 [binder, in Undecidability.Shared.Libs.PSL.Bijection]
g:70 [binder, in Undecidability.Shared.Libs.DLW.Utils.sorting]
g:71 [binder, in Complexity.NP.Clique.FlatUGraph]
G:72 [binder, in Complexity.NP.Clique.FlatUGraph]
g:73 [binder, in Complexity.TM.PrettyBounds.PrettyBounds]
g:76 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
G:76 [binder, in Complexity.NP.Clique.FlatClique]
g:8 [binder, in Undecidability.L.Datatypes.LProd]
g:8 [binder, in Complexity.Complexity.ONotation]
g:8 [binder, in Complexity.Complexity.ONotationIsAppropriate]
G:8 [binder, in Complexity.NP.Clique.FlatClique]
g:8 [binder, in Complexity.Complexity.PolyTimeComputable]
g:80 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
G:80 [binder, in Complexity.NP.Clique.FlatClique]
g:81 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
g:81 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachine]
g:82 [binder, in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
G:83 [binder, in Undecidability.L.Complexity.UpToC]
g:83 [binder, in Undecidability.Shared.Libs.DLW.Utils.sorting]
G:83 [binder, in Complexity.NP.Clique.FlatClique]
g:83 [binder, in Complexity.TM.PrettyBounds.PrettyBounds]
g:85 [binder, in Undecidability.TM.Util.Prelim]
g:86 [binder, in Undecidability.Shared.Libs.DLW.Utils.sorting]
G:86 [binder, in Complexity.NP.Clique.FlatClique]
g:86 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
G:88 [binder, in Undecidability.L.Complexity.GenericNary]
G:89 [binder, in Complexity.NP.Clique.FlatClique]
g:89 [binder, in Undecidability.L.Tactics.Reflection]
g:89 [binder, in Complexity.NP.TM.LM_to_mTM]
g:9 [binder, in Complexity.TM.Compound.MoveToSymbol_niceSpec]
g:9 [binder, in Undecidability.TM.L.Eval]
g:90 [binder, in Undecidability.TM.Code.Code]
g:91 [binder, in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
g:92 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
g:92 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachine]
G:93 [binder, in Complexity.NP.Clique.FlatClique]
g:95 [binder, in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
g:96 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]

H

h [definition, in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
h [definition, in Complexity.NP.SAT.CookLevin.Reductions.CC_to_BinaryCC]
ha [constructor, in Undecidability.L.Util.L_facts]
HAdd [definition, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
halftape [abbreviation, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Halt [definition, in Undecidability.L.TM.TMinL]
halt [projection, in Complexity.L.TM.TMflat]
halt [projection, in Undecidability.TM.TM]
halt [abbreviation, in Complexity.NP.SAT.CookLevin.Subproblems.TM_single]
halt [abbreviation, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
haltCenter [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
haltConf [definition, in Undecidability.TM.Util.TM_facts]
haltConfFlat [definition, in Complexity.L.TM.TMflatFun]
haltConfFlat_time_le [lemma, in Complexity.L.TM.TMflatComp]
haltConfFlat_time [definition, in Complexity.L.TM.TMflatComp]
HaltingProblem [lemma, in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
haltingStates [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
halting_inversion [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
HaltL [definition, in Undecidability.L.L]
haltLeft [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
HaltMTM [definition, in Undecidability.TM.TM]
haltRight [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
haltRules [inductive, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
haltRules_statesym [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
haltRules_statesym3 [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
haltRules_statesym2 [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
haltRules_statesym1 [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
halts [definition, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
HaltSBTM [definition, in Undecidability.TM.SBTM]
HaltSBTMu [definition, in Undecidability.TM.SBTM]
haltsim [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
HaltsOrDiverges_mTM_fixed [definition, in Complexity.NP.TM.TMGenNP_fixed_mTM]
HaltsTM [definition, in Undecidability.TM.TM]
halts_k [definition, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
haltTime [definition, in Undecidability.L.TM.TMinL.TMinL_extract]
HaltTM [definition, in Undecidability.TM.TM]
halt_comp [lemma, in Undecidability.TM.Combinators.While]
halt_state_steps_k [lemma, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
halt_state_steps [lemma, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
halt_state_dec [instance, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
halt_state_is_halt_state [lemma, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
halt_state [definition, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
Halt_red [lemma, in Undecidability.L.TM.TMinL]
halt_conf_liftL [lemma, in Undecidability.TM.Combinators.Switch]
halt_liftL [definition, in Undecidability.TM.Combinators.Switch]
halt_comp' [lemma, in Undecidability.TM.Combinators.StateWhile]
halt_comp [lemma, in Undecidability.TM.Combinators.StateWhile]
Halt' [definition, in Undecidability.L.TM.TMinL]
halt':98 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
halt:119 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
halt:121 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
halt:92 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
halt:95 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
hasSpace [definition, in Undecidability.L.Complexity.ResourceMeasures]
hasSpaceBeta [lemma, in Undecidability.L.Complexity.ResourceMeasures]
hasSpaceVal [lemma, in Undecidability.L.Complexity.ResourceMeasures]
hasSpace_step [lemma, in Undecidability.L.Complexity.ResourceMeasures]
hasSpace_iff [lemma, in Undecidability.L.Complexity.ResourceMeasures]
hasTime [definition, in Undecidability.L.Complexity.ResourceMeasures]
haveSeenMark:19 [binder, in Complexity.TM.Single.DecodeTape]
haveSeenMark:24 [binder, in Complexity.TM.Single.DecodeTape]
haveSeenSymbol:18 [binder, in Complexity.TM.Single.DecodeTape]
haveSeenSymbol:25 [binder, in Complexity.TM.Single.DecodeTape]
hBinaryCC [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
hBinaryCC [definition, in Complexity.NP.SAT.CookLevin.Reductions.CC_to_BinaryCC]
hBinaryCC_size_bound [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
hBinaryCC_poly [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
hBinaryCC_time_bound [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
hBinaryCC_time [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
hcard [definition, in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
hcard [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
hcards [definition, in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
hcards [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
hcards [abbreviation, in Complexity.NP.SAT.CookLevin.Reductions.CC_to_BinaryCC]
hcards_size_bound [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
hcards_poly [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
hcards_time_bound [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
hcards_time [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
HCards:55 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
HCards:92 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
hcard_size_bound [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
hcard_poly [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
hcard_time_bound [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
hcard_time [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
hCC [definition, in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
hCC_wf [lemma, in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
Hclique:75 [binder, in Complexity.NP.Clique.kSAT_to_Clique]
HClos [definition, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
Hcl:15 [binder, in Undecidability.TM.L.Eval]
Hcl:7 [binder, in Undecidability.TM.L.Eval]
Hcmp:59 [binder, in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
Hcomplete:48 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
Hcomplete:72 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
Hcomplete:83 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
Hconc:37 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
Hconc:61 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
hd [definition, in Undecidability.L.Tactics.Extract]
Hdec:25 [binder, in Undecidability.L.Functions.Decoding]
HDec:51 [binder, in Undecidability.TM.Single.StepTM]
HDec:54 [binder, in Undecidability.TM.Single.StepTM]
Hdec:65 [binder, in Undecidability.L.Functions.Decoding]
Hdec:8 [binder, in Complexity.L.TM.TapeDecode]
hd_rev [lemma, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
hd_app [lemma, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
hd_map [lemma, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
hd:64 [binder, in Complexity.NP.TM.M_multi2mono]
hd:68 [binder, in Complexity.NP.TM.M_multi2mono]
head_of_const [definition, in Undecidability.L.Tactics.Extract]
Heap [definition, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
heapEntry [inductive, in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
heapEntryC [constructor, in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
HeapMachine [section, in Complexity.L.AbstractMachines.FunctionalDefinitions]
HeapMachine [library]
heapStep [definition, in Complexity.L.AbstractMachines.FunctionalDefinitions]
heapStep_timeBound_mono [lemma, in Complexity.L.AbstractMachines.Computable.HeapMachine]
heapStep_timeBound_mono' [lemma, in Complexity.L.AbstractMachines.Computable.HeapMachine]
heapStep_timeBound_le [lemma, in Complexity.L.AbstractMachines.Computable.HeapMachine]
heapStep_timeBound [definition, in Complexity.L.AbstractMachines.Computable.HeapMachine]
heapStep_time [definition, in Complexity.L.AbstractMachines.Computable.HeapMachine]
heapStep_sound [lemma, in Complexity.L.AbstractMachines.FunctionalDefinitions]
heap_greatest_address2_bound [lemma, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds_Loop]
Helem1:28 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
Helem2:29 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
Helem3:30 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
helper [lemma, in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
helper [lemma, in Undecidability.TM.L.CompilerBoolFuns.Compiler]
helperF [lemma, in Complexity.L.AbstractMachines.AbstractSubstMachine]
helperF' [lemma, in Complexity.L.AbstractMachines.AbstractSubstMachine]
helper_lemma_without_name4 [lemma, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
helper_lemma_without_name3' [lemma, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
helper_lemma_without_name3 [lemma, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
helper2 [lemma, in Complexity.L.AbstractMachines.AbstractSubstMachine]
HEntr [definition, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
HeqbComp:84 [binder, in Complexity.Libs.CookPrelim.PolyBounds]
hfinal [definition, in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
hfinal [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
hfinal [abbreviation, in Complexity.NP.SAT.CookLevin.Reductions.CC_to_BinaryCC]
hfinal_size_bound [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
hfinal_poly [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
hfinal_time_bound [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
hfinal_time [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
HFinal:56 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
HFinal:93 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
hflat [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
hflat_size_bound [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
hflat_length [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
hflat_poly [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
hflat_time_bound [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
hflat_time [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
Hfx:38 [binder, in Complexity.Complexity.Subtypes]
Hfx:64 [binder, in Complexity.Complexity.Subtypes]
Hf:50 [binder, in Undecidability.L.Tactics.Computable]
Hf:58 [binder, in Undecidability.L.Tactics.Computable]
Hf:63 [binder, in Undecidability.L.Tactics.Computable]
Hf:71 [binder, in Undecidability.L.Tactics.ComputableTime]
Hf:81 [binder, in Undecidability.L.Tactics.ComputableTime]
Hf:87 [binder, in Undecidability.L.Tactics.ComputableTime]
hinit [definition, in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
hinit [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
hinit [abbreviation, in Complexity.NP.SAT.CookLevin.Reductions.CC_to_BinaryCC]
Hinitial:65 [binder, in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
HInit:54 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
HInit:91 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
Hi:18 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
Hi:29 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
Hi:32 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
Hi:7 [binder, in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
Hj:15 [binder, in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
Hj:18 [binder, in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
Hkcnf:3 [binder, in Complexity.NP.Clique.kSAT_to_FlatClique]
Hkgt:48 [binder, in Complexity.NP.Clique.kSAT_to_FlatClique]
hl [constructor, in Undecidability.L.Util.L_facts]
HLastStep:139 [binder, in Undecidability.TM.Combinators.StateWhile]
HLastStep:144 [binder, in Undecidability.TM.Combinators.StateWhile]
HLastStep:76 [binder, in Undecidability.TM.Combinators.While]
HLastStep:80 [binder, in Undecidability.TM.Combinators.While]
Hm:163 [binder, in Undecidability.Shared.Libs.DLW.Vec.pos]
hNat [definition, in Complexity.NP.SAT.CookLevin.Reductions.CC_to_BinaryCC]
hNat_size_bound [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
hNat_poly [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
hNat_time_bound [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
hNat_time [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
hNat_length [lemma, in Complexity.NP.SAT.CookLevin.Reductions.CC_to_BinaryCC]
Hn:202 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
Hn:205 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
Hoare [library]
HoareCombinators [library]
HoareExamples [library]
HoareLegacy [library]
HoareLogic [library]
HoareMult [library]
HoareRegister [library]
HoareStdLib [library]
HoareTactics [library]
HoareTacticsView [library]
hoas [section, in Undecidability.L.Functions.Eval]
hoas [inductive, in Undecidability.L.Util.L_facts]
hoas [section, in Undecidability.L.Computability.Por]
λ _ .. _ , _ [notation, in Undecidability.L.Util.L_facts]
[ L_HOAS _ ] [notation, in Undecidability.L.Util.L_facts]
!! _ [notation, in Undecidability.L.Util.L_facts]
HOAS_Notations [module, in Undecidability.L.Util.L_facts]
hoffset [definition, in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
hoffset [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
hoffset [abbreviation, in Complexity.NP.SAT.CookLevin.Reductions.CC_to_BinaryCC]
HOffset:89 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
homomorphism [definition, in Complexity.Libs.UniformHomomorphisms]
homo_concat [lemma, in Complexity.Libs.UniformHomomorphisms]
homo_cons [lemma, in Complexity.Libs.UniformHomomorphisms]
homo_nil [lemma, in Complexity.Libs.UniformHomomorphisms]
HPQ:8 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_dec]
Hprem:36 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
Hprem:60 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
hP_length [lemma, in Complexity.NP.SAT.CookLevin.Reductions.CC_to_BinaryCC]
hP_injective [lemma, in Complexity.NP.SAT.CookLevin.Reductions.CC_to_BinaryCC]
hP_inv1 [lemma, in Complexity.NP.SAT.CookLevin.Reductions.CC_to_BinaryCC]
HP:115 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
HP:181 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
HQ:6 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_dec]
Hreg:7 [binder, in Complexity.L.TM.TapeDecode]
HR':9 [binder, in Complexity.NP.TM.LM_to_mTM]
HR:100 [binder, in Undecidability.L.Computability.Seval]
HR:113 [binder, in Undecidability.L.Computability.Seval]
Hr:13 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_nat_facts]
HR:16 [binder, in Undecidability.TM.L.Eval]
Hr:18 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_nat_facts]
Hr:58 [binder, in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
Hr:7 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_nat_facts]
HR:8 [binder, in Undecidability.TM.L.Eval]
HR:99 [binder, in Undecidability.L.Complexity.ResourceMeasures]
HSigma:53 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
HSigma:88 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
Hsound:45 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
Hsound:69 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
Hsound:80 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
HStar:138 [binder, in Undecidability.TM.Combinators.StateWhile]
HStar:75 [binder, in Undecidability.TM.Combinators.While]
hsteps [definition, in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
hsteps [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
hsteps [abbreviation, in Complexity.NP.SAT.CookLevin.Reductions.CC_to_BinaryCC]
Hsteps:57 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
HSteps:94 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
hs_num:125 [binder, in Undecidability.L.Tactics.Extract]
hs_num:95 [binder, in Undecidability.L.Tactics.Extract]
hs_num:33 [binder, in Undecidability.L.Tactics.GenEncode]
hs_num:18 [binder, in Undecidability.L.Tactics.GenEncode]
hs2:46 [binder, in Undecidability.L.Tactics.Extract]
HS:107 [binder, in Undecidability.L.Computability.Seval]
HS:119 [binder, in Undecidability.L.Computability.Seval]
hs:45 [binder, in Undecidability.L.Tactics.Extract]
hter [constructor, in Undecidability.L.Util.L_facts]
HT':11 [binder, in Complexity.NP.TM.LM_to_mTM]
HT:156 [binder, in Undecidability.TM.Combinators.StateWhile]
Ht:64 [binder, in Complexity.L.TM.TMflat]
HT:89 [binder, in Undecidability.TM.Combinators.While]
hv [constructor, in Undecidability.L.Util.L_facts]
hwidth [definition, in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
hwidth [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
hwidth [abbreviation, in Complexity.NP.SAT.CookLevin.Reductions.CC_to_BinaryCC]
HWidth:90 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
HXeq:83 [binder, in Complexity.Libs.CookPrelim.PolyBounds]
HX:113 [binder, in Complexity.L.TM.CompCode]
HX:114 [binder, in Complexity.L.TM.TMflatComp]
Hx:12 [binder, in Undecidability.L.Datatypes.List.List_basics]
Hx:12 [binder, in Undecidability.L.Datatypes.List.List_nat]
HX:127 [binder, in Complexity.L.TM.TMflatComp]
Hx:138 [binder, in Complexity.L.TM.TMunflatten]
HX:140 [binder, in Complexity.L.TM.TMflatComp]
HX:141 [binder, in Complexity.L.TM.CompCode]
Hx:152 [binder, in Complexity.L.TM.TMunflatten]
HX:156 [binder, in Complexity.L.TM.TMflatComp]
Hx:16 [binder, in Complexity.Complexity.Subtypes]
HX:187 [binder, in Complexity.L.TM.TMflatComp]
HX:19 [binder, in Undecidability.L.Datatypes.LOptions]
Hx:193 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
HX:199 [binder, in Complexity.L.TM.TMflatComp]
Hx:216 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
Hx:225 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
Hx:24 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
Hx:25 [binder, in Undecidability.L.Datatypes.List.List_basics]
HX:25 [binder, in Complexity.L.TM.CompCode]
Hx:27 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
Hx:29 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
HX:31 [binder, in Undecidability.L.Datatypes.LSum]
HX:33 [binder, in Undecidability.L.Datatypes.List.List_eqb]
Hx:36 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
Hx:44 [binder, in Undecidability.L.Tactics.ComputableDemo]
Hx:5 [binder, in Undecidability.L.Datatypes.List.List_nat]
Hx:51 [binder, in Undecidability.L.Tactics.Computable]
Hx:54 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
Hx:59 [binder, in Undecidability.L.Tactics.Computable]
Hx:6 [binder, in Complexity.L.Datatypes.LDepPair]
Hx:60 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
Hx:63 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
HX:65 [binder, in Complexity.L.TM.CompCode]
Hx:65 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
Hx:72 [binder, in Undecidability.L.Tactics.ComputableTime]
HX:73 [binder, in Undecidability.L.Computability.Synthetic]
Hx:82 [binder, in Undecidability.L.Tactics.ComputableTime]
HX:89 [binder, in Complexity.L.TM.CompCode]
Hx:90 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_base]
Hx:93 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_base]
Hx:970 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
Hx:983 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
HY:114 [binder, in Complexity.L.TM.CompCode]
HY:115 [binder, in Complexity.L.TM.TMflatComp]
HY:128 [binder, in Complexity.L.TM.TMflatComp]
Hy:13 [binder, in Undecidability.L.Datatypes.List.List_basics]
Hy:139 [binder, in Complexity.L.TM.TMunflatten]
HY:141 [binder, in Complexity.L.TM.TMflatComp]
Hy:153 [binder, in Complexity.L.TM.TMunflatten]
HY:157 [binder, in Complexity.L.TM.TMflatComp]
HY:188 [binder, in Complexity.L.TM.TMflatComp]
HY:200 [binder, in Complexity.L.TM.TMflatComp]
Hy:21 [binder, in Undecidability.Shared.Libs.DLW.Wf.acc_irr]
Hy:26 [binder, in Undecidability.L.Datatypes.List.List_basics]
HY:32 [binder, in Undecidability.L.Datatypes.LSum]
Hy:45 [binder, in Undecidability.L.Tactics.ComputableDemo]
HY:66 [binder, in Complexity.L.TM.CompCode]
HY:74 [binder, in Undecidability.L.Computability.Synthetic]
Hy:984 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
Hz:218 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
Hz:220 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
Hz:69 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
Hz:71 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
h_app_inv [lemma, in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
h_app_inv1 [lemma, in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
h_multiplier [lemma, in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
h_injective [lemma, in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
h_unifHom [lemma, in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
H__neq:141 [binder, in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
H__neq:135 [binder, in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
H__neq:68 [binder, in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
h_length_multiply [lemma, in Complexity.Libs.UniformHomomorphisms]
h_nil_inv [lemma, in Complexity.Libs.UniformHomomorphisms]
h_length_inv' [lemma, in Complexity.Libs.UniformHomomorphisms]
h_length_inv [lemma, in Complexity.Libs.UniformHomomorphisms]
h_nil_cons [lemma, in Complexity.Libs.UniformHomomorphisms]
h_unifHom:32 [binder, in Complexity.Libs.UniformHomomorphisms]
H_sat:41 [binder, in Complexity.NP.Clique.kSAT_to_Clique]
h_multiplier_sp [lemma, in Complexity.NP.SAT.CookLevin.Reductions.CC_to_BinaryCC]
h' [definition, in Complexity.NP.SAT.CookLevin.Reductions.CC_to_BinaryCC]
h'':16 [binder, in Complexity.Libs.UniformHomomorphisms]
H':10 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
H':103 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
H':112 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
h':12 [binder, in Complexity.Libs.UniformHomomorphisms]
H':124 [binder, in Complexity.L.TM.CompCode]
H':128 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
H':13 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
H':14 [binder, in Complexity.L.AbstractMachines.Computable.Unfolding]
h':14 [binder, in Complexity.Libs.UniformHomomorphisms]
H':146 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
H':15 [binder, in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
h':15 [binder, in Complexity.Libs.UniformHomomorphisms]
H':151 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
H':157 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
H':171 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
H':189 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
H':193 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
H':2 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
H':20 [binder, in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
H':202 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
H':21 [binder, in Complexity.L.AbstractMachines.Computable.Unfolding]
H':211 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
H':211 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
H':216 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
H':220 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
H':228 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
h':245 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
h':247 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
h':249 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
h':2602 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
h':2607 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
h':2612 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
h':285 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
h':292 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
H':3 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachine]
h':300 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
h':308 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
h':315 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
H':32 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
h':322 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
H':38 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
H':38 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachine]
H':41 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
H':41 [binder, in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
H':42 [binder, in Undecidability.L.Datatypes.LSum]
H':43 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachine]
H':46 [binder, in Undecidability.L.Functions.EqBool]
H':46 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
H':49 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachine]
H':5 [binder, in Complexity.NP.TM.LM_to_mTM]
H':53 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachine]
H':6 [binder, in Undecidability.L.Datatypes.LProd]
H':6 [binder, in Undecidability.L.Datatypes.LSum]
H':6 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachine]
H':63 [binder, in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
H':65 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachine]
H':68 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
H':69 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
H':7 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
H':70 [binder, in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
H':75 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
H':76 [binder, in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
H':76 [binder, in Complexity.L.TM.CompCode]
H':79 [binder, in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
H':82 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachine]
H':84 [binder, in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
H':93 [binder, in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
H0:10 [binder, in Complexity.Complexity.EncodableP]
H0:10 [binder, in Undecidability.L.Datatypes.LSum]
H0:10 [binder, in Complexity.Complexity.Subtypes]
H0:10 [binder, in Undecidability.L.Functions.FinTypeLookup]
H0:101 [binder, in Complexity.Complexity.PolyTimeComputable]
H0:106 [binder, in Complexity.L.TM.TMflatComp]
H0:107 [binder, in Complexity.NP.TM.LM_to_mTM]
H0:11 [binder, in Undecidability.L.Functions.Encoding]
H0:112 [binder, in Complexity.NP.TM.LM_to_mTM]
H0:117 [binder, in Complexity.Libs.CookPrelim.PolyBounds]
H0:118 [binder, in Complexity.L.TM.CompCode]
H0:118 [binder, in Complexity.L.TM.TMflatComp]
H0:118 [binder, in Complexity.L.TM.TMunflatten]
H0:130 [binder, in Complexity.L.TM.TMunflatten]
H0:131 [binder, in Complexity.L.TM.TMflatComp]
H0:14 [binder, in Undecidability.L.Datatypes.LVector]
H0:14 [binder, in Complexity.Complexity.PolyTimeComputable]
H0:141 [binder, in Complexity.Complexity.NP]
H0:144 [binder, in Complexity.L.TM.TMflatComp]
H0:15 [binder, in Complexity.Complexity.EncodableP]
H0:15 [binder, in Complexity.L.TM.TMflatComp]
H0:160 [binder, in Complexity.L.TM.TMflatComp]
H0:18 [binder, in Complexity.Complexity.EncodableP]
H0:18 [binder, in Undecidability.L.Functions.LoopSum]
H0:19 [binder, in Undecidability.L.Functions.Decoding]
H0:191 [binder, in Complexity.L.TM.TMflatComp]
H0:203 [binder, in Complexity.L.TM.TMflatComp]
H0:24 [binder, in Complexity.Complexity.PolyTimeComputable]
H0:26 [binder, in Undecidability.L.Datatypes.LProd]
H0:26 [binder, in Undecidability.L.Datatypes.LVector]
h0:286 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
H0:29 [binder, in Undecidability.L.Datatypes.LProd]
h0:293 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
H0:3 [binder, in Complexity.L.TM.TapeDecode]
H0:3 [binder, in Undecidability.L.Complexity.LinDecode.LTD_def]
H0:30 [binder, in Undecidability.L.Datatypes.List.List_fold]
h0:301 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
h0:309 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
h0:316 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
h0:323 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
H0:33 [binder, in Undecidability.L.Functions.Decoding]
H0:36 [binder, in Undecidability.L.Datatypes.LSum]
H0:37 [binder, in Complexity.Complexity.PolyTimeComputable]
H0:39 [binder, in Undecidability.L.Datatypes.LVector]
H0:39 [binder, in Complexity.Complexity.NP]
H0:4 [binder, in Undecidability.L.Functions.LoopSum]
H0:4 [binder, in Undecidability.L.Functions.UnboundIteration]
H0:4 [binder, in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
H0:41 [binder, in Undecidability.L.Functions.Decoding]
H0:47 [binder, in Undecidability.L.Functions.Decoding]
H0:5 [binder, in Complexity.Complexity.PolyTimeComputable]
H0:53 [binder, in Complexity.Complexity.PolyTimeComputable]
H0:53 [binder, in Complexity.NP.TM.LM_to_mTM]
H0:549 [binder, in Complexity.NP.TM.LM_to_mTM]
H0:55 [binder, in Undecidability.L.Functions.Decoding]
H0:559 [binder, in Complexity.NP.TM.LM_to_mTM]
H0:58 [binder, in Complexity.Complexity.Definitions]
H0:582 [binder, in Complexity.NP.TM.LM_to_mTM]
H0:59 [binder, in Undecidability.L.Datatypes.List.List_eqb]
H0:60 [binder, in Undecidability.L.Functions.Decoding]
H0:62 [binder, in Complexity.Complexity.PolyTimeComputable]
H0:67 [binder, in Undecidability.L.Datatypes.LVector]
H0:69 [binder, in Undecidability.L.Functions.FinTypeLookup]
H0:69 [binder, in Complexity.Complexity.Definitions]
H0:70 [binder, in Complexity.L.TM.CompCode]
H0:75 [binder, in Complexity.Complexity.NP]
H0:89 [binder, in Undecidability.L.Complexity.ResourceMeasures]
H0:89 [binder, in Complexity.Complexity.Definitions]
H0:89 [binder, in Complexity.Complexity.PolyTimeComputable]
H0:95 [binder, in Complexity.Complexity.Definitions]
H0:95 [binder, in Complexity.Complexity.PolyTimeComputable]
H0:980 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
H1:101 [binder, in Complexity.Complexity.Definitions]
H1:11 [binder, in Undecidability.L.Functions.FinTypeLookup]
H1:11 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
H1:118 [binder, in Complexity.Libs.CookPrelim.PolyBounds]
H1:12 [binder, in Undecidability.Shared.Libs.DLW.Wf.acc_irr]
H1:12 [binder, in Complexity.L.TM.TapeDecode]
H1:13 [binder, in Complexity.Complexity.LinTimeDecodable]
H1:136 [binder, in Complexity.Complexity.NP]
H1:15 [binder, in Complexity.Complexity.PolyTimeComputable]
H1:16 [binder, in Complexity.L.TM.TMflatComp]
H1:16 [binder, in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
h1:162 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
h1:177 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
H1:18 [binder, in Undecidability.Shared.Libs.DLW.Wf.acc_irr]
h1:182 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
H1:23 [binder, in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
H1:24 [binder, in Undecidability.Shared.Libs.DLW.Wf.acc_irr]
H1:25 [binder, in Undecidability.TM.Single.StepTM]
H1:25 [binder, in Complexity.Complexity.PolyTimeComputable]
H1:27 [binder, in Undecidability.L.Datatypes.LVector]
H1:3 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
H1:37 [binder, in Undecidability.TM.Single.StepTM]
H1:38 [binder, in Complexity.Complexity.PolyTimeComputable]
H1:39 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_base]
H1:4 [binder, in Undecidability.L.Complexity.LinDecode.LTDlist]
H1:40 [binder, in Undecidability.L.Datatypes.LVector]
H1:40 [binder, in Complexity.Complexity.NP]
H1:44 [binder, in Undecidability.TM.Single.EncodeTapes]
H1:49 [binder, in Undecidability.TM.Single.EncodeTapes]
H1:5 [binder, in Complexity.Complexity.LinTimeDecodable]
H1:54 [binder, in Complexity.Complexity.PolyTimeComputable]
H1:55 [binder, in Undecidability.TM.Single.EncodeTapes]
H1:560 [binder, in Complexity.NP.TM.LM_to_mTM]
H1:6 [binder, in Complexity.Complexity.PolyTimeComputable]
H1:63 [binder, in Complexity.Complexity.PolyTimeComputable]
H1:68 [binder, in Undecidability.L.Datatypes.LVector]
H1:7 [binder, in Undecidability.L.Functions.UnboundIteration]
H1:80 [binder, in Undecidability.TM.Single.StepTM]
H1:87 [binder, in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
H1:974 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
H1:98 [binder, in Undecidability.L.Datatypes.LVector]
H2:12 [binder, in Complexity.Complexity.EncodableP]
H2:12 [binder, in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
H2:12 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
H2:121 [binder, in Complexity.L.TM.TMflatComp]
H2:13 [binder, in Undecidability.Shared.Libs.DLW.Wf.acc_irr]
H2:134 [binder, in Complexity.L.TM.TMflatComp]
H2:147 [binder, in Complexity.L.TM.TMflatComp]
H2:163 [binder, in Complexity.L.TM.TMflatComp]
h2:163 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
h2:178 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
H2:18 [binder, in Undecidability.L.Functions.FinTypeLookup]
h2:183 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
H2:19 [binder, in Undecidability.Shared.Libs.DLW.Wf.acc_irr]
H2:194 [binder, in Complexity.L.TM.TMflatComp]
H2:20 [binder, in Undecidability.L.Functions.UnboundIteration]
H2:206 [binder, in Complexity.L.TM.TMflatComp]
h2:245 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
H2:25 [binder, in Undecidability.Shared.Libs.DLW.Wf.acc_irr]
H2:26 [binder, in Undecidability.TM.Single.StepTM]
H2:26 [binder, in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
H2:26 [binder, in Complexity.Complexity.PolyTimeComputable]
H2:32 [binder, in Undecidability.L.Datatypes.LProd]
H2:35 [binder, in Undecidability.L.Functions.Decoding]
H2:38 [binder, in Undecidability.TM.Single.StepTM]
H2:39 [binder, in Complexity.Complexity.PolyTimeComputable]
H2:4 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
H2:40 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_base]
H2:43 [binder, in Undecidability.L.Functions.Decoding]
H2:49 [binder, in Undecidability.L.Functions.Decoding]
H2:50 [binder, in Undecidability.TM.Single.EncodeTapes]
H2:56 [binder, in Undecidability.TM.Single.EncodeTapes]
H2:57 [binder, in Undecidability.L.Functions.Decoding]
H2:81 [binder, in Undecidability.TM.Single.StepTM]
H2:988 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
H3:25 [binder, in Undecidability.L.Functions.UnboundIteration]
H4:16 [binder, in Complexity.Complexity.LinTimeDecodable]
H4:8 [binder, in Complexity.Complexity.LinTimeDecodable]
H4:992 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
H:1 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
H:1 [binder, in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisUnfoldClos]
H:1 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
H:1 [binder, in Complexity.L.AbstractMachines.Computable.UnivDecTime]
H:1 [binder, in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisStep]
H:1 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachine]
H:10 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
H:10 [binder, in Complexity.L.TM.CompCode]
H:10 [binder, in Undecidability.Shared.Libs.DLW.Wf.acc_irr]
h:10 [binder, in Complexity.Libs.UniformHomomorphisms]
H:10 [binder, in Complexity.Libs.CookPrelim.PolyBounds]
H:10 [binder, in Undecidability.L.Functions.Encoding]
H:100 [binder, in Complexity.NP.SAT.SAT_inNP]
H:100 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
H:100 [binder, in Complexity.Complexity.PolyTimeComputable]
H:100 [binder, in Complexity.NP.TM.LM_to_mTM]
H:101 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachine]
h:101 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
H:103 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
H:104 [binder, in Complexity.NP.SAT.SAT_inNP]
H:105 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
H:105 [binder, in Complexity.L.TM.TMflatComp]
H:105 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
H:105 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachine]
H:106 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
H:106 [binder, in Complexity.Complexity.PolyTimeComputable]
H:106 [binder, in Complexity.NP.TM.LM_to_mTM]
h:107 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
H:107 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
H:108 [binder, in Undecidability.L.Computability.Synthetic]
H:109 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
H:109 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
H:11 [binder, in Undecidability.TM.L.Eval]
H:11 [binder, in Complexity.L.AbstractMachines.Computable.HeapMachine]
H:110 [binder, in Complexity.NP.SAT.SAT_inNP]
H:111 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
h:111 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
H:111 [binder, in Undecidability.L.Computability.Synthetic]
H:111 [binder, in Complexity.NP.TM.LM_to_mTM]
H:112 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
H:112 [binder, in Complexity.NP.SAT.SAT_inNP]
H:113 [binder, in Complexity.Complexity.PolyTimeComputable]
H:113 [binder, in Undecidability.L.Tactics.Computable]
H:115 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
H:115 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
H:115 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
H:115 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
h:115 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
H:115 [binder, in Undecidability.TM.L.HeapInterpreter.LookupTM]
H:116 [binder, in Complexity.NP.SAT.SAT_inNP]
H:116 [binder, in Complexity.Libs.CookPrelim.PolyBounds]
h:116 [binder, in Undecidability.Shared.Libs.DLW.Utils.sorting]
H:117 [binder, in Complexity.L.TM.CompCode]
H:117 [binder, in Complexity.L.TM.TMunflatten]
H:118 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
H:12 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
H:12 [binder, in Complexity.L.AbstractMachines.Computable.EvalForTime]
H:12 [binder, in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
H:12 [binder, in Undecidability.L.Datatypes.List.List_extra]
H:12 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachine]
H:12 [binder, in Undecidability.Shared.Dec]
H:12 [binder, in Undecidability.Shared.ListAutomation]
H:120 [binder, in Undecidability.L.Tactics.Computable]
H:121 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
H:121 [binder, in Complexity.L.TM.CompCode]
H:122 [binder, in Complexity.NP.SAT.SAT_inNP]
H:122 [binder, in Complexity.Complexity.PolyTimeComputable]
H:123 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
H:124 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
h:125 [binder, in Undecidability.TM.Compound.Shift]
H:126 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
H:126 [binder, in Complexity.L.TM.CompCode]
h:126 [binder, in Undecidability.Shared.Libs.DLW.Utils.sorting]
H:127 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
H:127 [binder, in Undecidability.Shared.Libs.DLW.Vec.pos]
h:128 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
H:129 [binder, in Complexity.L.TM.TMunflatten]
H:129 [binder, in Undecidability.Shared.Libs.DLW.Vec.pos]
H:13 [binder, in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisUnfoldClos]
H:13 [binder, in Undecidability.Shared.FinTypeEquiv]
H:13 [binder, in Undecidability.L.Datatypes.LVector]
H:13 [binder, in Complexity.Libs.CookPrelim.PolyBounds]
H:13 [binder, in Complexity.Complexity.PolyTimeComputable]
H:130 [binder, in Undecidability.Synthetic.ListEnumerabilityFacts]
h:131 [binder, in Undecidability.Shared.Libs.DLW.Utils.sorting]
H:131 [binder, in Complexity.Complexity.PolyTimeComputable]
H:132 [binder, in Complexity.Complexity.NP]
H:133 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
H:133 [binder, in Undecidability.Shared.Libs.DLW.Vec.pos]
H:134 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
H:134 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
H:135 [binder, in Undecidability.Shared.Libs.DLW.Vec.pos]
H:138 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
H:14 [binder, in Complexity.L.AbstractMachines.Computable.EvalForTime]
H:14 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
H:14 [binder, in Complexity.NP.L.CanEnumTerm_def]
H:14 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
H:14 [binder, in Complexity.L.TM.TMflatComp]
H:14 [binder, in Undecidability.Shared.Dec]
H:14 [binder, in Undecidability.L.Computability.Synthetic]
H:140 [binder, in Complexity.Complexity.PolyTimeComputable]
H:140 [binder, in Complexity.Complexity.NP]
H:141 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
H:142 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
H:143 [binder, in Complexity.L.TM.CompCode]
H:143 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
H:143 [binder, in Undecidability.Synthetic.ListEnumerabilityFacts]
H:143 [binder, in Undecidability.Shared.Libs.DLW.Vec.pos]
H:144 [binder, in Complexity.Libs.CookPrelim.PolyBounds]
H:145 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
H:145 [binder, in Complexity.Complexity.NP]
H:146 [binder, in Complexity.L.TM.CompCode]
H:146 [binder, in Undecidability.Shared.Libs.DLW.Vec.pos]
H:148 [binder, in Complexity.L.TM.CompCode]
H:148 [binder, in Complexity.Libs.CookPrelim.PolyBounds]
H:15 [binder, in Complexity.L.AbstractMachines.UnfoldTailRec]
H:15 [binder, in Undecidability.L.Datatypes.List.List_fold]
H:15 [binder, in Undecidability.Shared.Libs.DLW.Vec.pos]
H:150 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
H:150 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
H:152 [binder, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
H:155 [binder, in Complexity.Complexity.NP]
H:156 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
H:156 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
H:157 [binder, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
H:159 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
H:16 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
H:16 [binder, in Undecidability.L.Datatypes.Lists]
H:16 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
H:16 [binder, in Complexity.Complexity.UpToCPoly]
H:16 [binder, in Undecidability.L.Datatypes.LFinType]
H:16 [binder, in Undecidability.TM.L.HeapInterpreter.LookupTM]
H:160 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
H:163 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
H:164 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
H:166 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
H:167 [binder, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
H:168 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
H:169 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
H:17 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds_Loop]
H:17 [binder, in Undecidability.L.Functions.LoopSum]
H:17 [binder, in Undecidability.Shared.Libs.PSL.EqDec]
H:17 [binder, in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
H:17 [binder, in Complexity.Libs.CookPrelim.PolyBounds]
H:17 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachine]
H:17 [binder, in Undecidability.L.Functions.Encoding]
H:170 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
H:171 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
H:173 [binder, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
H:175 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
H:176 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
H:177 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
H:18 [binder, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
H:18 [binder, in Undecidability.L.Datatypes.List.List_nat]
H:18 [binder, in Undecidability.L.Functions.EqBool]
H:18 [binder, in Undecidability.L.Tactics.Lbeta_nonrefl]
H:18 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachine]
H:18 [binder, in Undecidability.L.TM.TMEncoding]
H:18 [binder, in Undecidability.L.Computability.Synthetic]
H:181 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
H:182 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
H:182 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
H:186 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
H:186 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
H:186 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
H:189 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
H:19 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
H:19 [binder, in Undecidability.Shared.Libs.PSL.EqDec]
H:19 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
h:19 [binder, in Complexity.Libs.UniformHomomorphisms]
H:19 [binder, in Complexity.L.AbstractMachines.Computable.HeapMachine]
H:19 [binder, in Undecidability.TM.L.HeapInterpreter.LookupTM]
H:192 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
H:193 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
H:194 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
H:195 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
H:198 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
H:2 [binder, in Complexity.Complexity.EncodableP]
H:2 [binder, in Complexity.L.AbstractMachines.Computable.Unfolding]
H:2 [binder, in Undecidability.L.Datatypes.Lists]
H:2 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
H:2 [binder, in Undecidability.L.Prelim.MoreBase]
H:2 [binder, in Undecidability.L.Datatypes.LVector]
H:2 [binder, in Complexity.Libs.CookPrelim.PolyBounds]
H:2 [binder, in Undecidability.L.Datatypes.List.List_fold]
H:2 [binder, in Undecidability.L.Functions.Decoding]
H:20 [binder, in Undecidability.TM.Util.VectorPrelim]
H:20 [binder, in Complexity.Complexity.UpToCPoly]
H:20 [binder, in Undecidability.L.Datatypes.LFinType]
H:20 [binder, in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
H:201 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
H:202 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
H:203 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
H:205 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
H:205 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
H:208 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
H:209 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
H:21 [binder, in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisUnfoldClos]
H:21 [binder, in Complexity.Libs.CookPrelim.PolyBounds]
H:21 [binder, in Undecidability.L.TM.TMEncoding]
H:210 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
H:211 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
H:212 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
H:214 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
H:219 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
H:22 [binder, in Undecidability.TM.L.HeapInterpreter.LookupTM]
h:220 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
H:222 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
H:224 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
H:225 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
H:226 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
H:229 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
H:23 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
h:23 [binder, in Complexity.Libs.UniformHomomorphisms]
H:23 [binder, in Undecidability.L.TM.TapeFuns]
H:23 [binder, in Undecidability.L.Datatypes.List.List_in]
H:23 [binder, in Complexity.Complexity.PolyTimeComputable]
H:23 [binder, in Complexity.Complexity.NP]
H:23 [binder, in Undecidability.L.Functions.Encoding]
H:234 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
H:235 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
H:238 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
h:239 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
H:24 [binder, in Complexity.L.AbstractMachines.UnfoldTailRec]
H:24 [binder, in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
H:24 [binder, in Complexity.Complexity.UpToCPoly]
H:24 [binder, in Undecidability.L.Functions.EqBool]
H:24 [binder, in Undecidability.L.TM.TMEncoding]
H:24 [binder, in Undecidability.L.Computability.Synthetic]
H:24 [binder, in Undecidability.L.Functions.Decoding]
H:241 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
H:241 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
H:242 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
h:244 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
h:246 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
H:247 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
h:248 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
H:25 [binder, in Undecidability.L.Datatypes.LProd]
h:25 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
H:25 [binder, in Complexity.L.Functions.IterupN]
H:25 [binder, in Undecidability.L.Datatypes.LVector]
H:25 [binder, in Complexity.Libs.CookPrelim.PolyBounds]
H:253 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
h:2546 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
H:26 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
h:26 [binder, in Complexity.Libs.UniformHomomorphisms]
H:26 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachine]
h:2601 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
h:2606 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
h:2611 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
h:262 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
H:27 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
H:27 [binder, in Undecidability.L.Datatypes.LOptions]
H:27 [binder, in Complexity.L.TM.CompCode]
H:27 [binder, in Complexity.NP.SAT.SAT_inNP]
H:27 [binder, in Complexity.Complexity.UpToCPoly]
H:27 [binder, in Complexity.Complexity.NP]
H:28 [binder, in Undecidability.L.Datatypes.List.List_basics]
H:28 [binder, in Undecidability.TM.Single.StepTM]
H:28 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds_Loop]
h:28 [binder, in Undecidability.Shared.Libs.DLW.Utils.sorting]
h:282 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
h:289 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
H:29 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
H:29 [binder, in Undecidability.TM.L.Eval]
H:29 [binder, in Undecidability.L.TM.TMEncoding]
H:29 [binder, in Undecidability.L.Computability.Synthetic]
H:29 [binder, in Undecidability.L.Functions.FinTypeLookup]
H:29 [binder, in Undecidability.L.Datatypes.List.List_fold]
h:297 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
H:3 [binder, in Undecidability.L.Datatypes.LOptions]
H:3 [binder, in Undecidability.L.Functions.LoopSum]
h:3 [binder, in Complexity.Libs.UniformHomomorphisms]
H:3 [binder, in Complexity.L.AbstractMachines.Computable.Lookup]
H:3 [binder, in Undecidability.L.Functions.UnboundIteration]
H:3 [binder, in Undecidability.L.Datatypes.List.List_enc]
H:3 [binder, in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
H:3 [binder, in Complexity.L.AbstractMachines.Computable.HeapMachine]
H:3 [binder, in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
H:30 [binder, in Undecidability.L.Datatypes.LOptions]
H:30 [binder, in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
H:30 [binder, in Complexity.L.TM.CompCode]
h:305 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
h:3092 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
H:31 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
H:31 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
H:31 [binder, in Undecidability.TM.Single.StepTM]
H:31 [binder, in Complexity.Libs.CookPrelim.PolyBounds]
H:31 [binder, in Complexity.Complexity.UpToCPoly]
h:312 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
h:319 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
H:32 [binder, in Undecidability.L.Datatypes.List.List_basics]
H:32 [binder, in Complexity.L.AbstractMachines.UnfoldHeap]
H:32 [binder, in Undecidability.L.Datatypes.List.List_nat]
h:3223 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
H:33 [binder, in Undecidability.TM.Single.StepTM]
H:33 [binder, in Undecidability.L.TM.TapeFuns]
H:33 [binder, in Undecidability.L.Functions.EqBool]
H:33 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachine]
H:33 [binder, in Undecidability.TM.L.HeapInterpreter.LookupTM]
H:34 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds_Loop]
H:34 [binder, in Complexity.L.AbstractMachines.UnfoldTailRec]
H:34 [binder, in Complexity.Libs.CookPrelim.PolyBounds]
H:34 [binder, in Complexity.Complexity.UpToCPoly]
H:34 [binder, in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
H:34 [binder, in Undecidability.L.TM.TMEncoding]
H:34 [binder, in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
H:35 [binder, in Undecidability.L.Tactics.Lrewrite]
H:35 [binder, in Undecidability.TM.Single.StepTM]
H:35 [binder, in Undecidability.L.Datatypes.LOptions]
H:35 [binder, in Undecidability.L.Datatypes.LSum]
H:35 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_nat_facts]
H:35 [binder, in Undecidability.TM.L.Eval]
H:35 [binder, in Undecidability.L.Functions.FinTypeLookup]
H:36 [binder, in Complexity.Libs.CookPrelim.PolyBounds]
H:36 [binder, in Complexity.Complexity.PolyTimeComputable]
H:37 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
H:37 [binder, in Undecidability.L.Datatypes.LOptions]
H:37 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachine]
H:37 [binder, in Undecidability.L.TM.TMEncoding]
H:37 [binder, in Undecidability.L.Tactics.Computable]
H:38 [binder, in Undecidability.L.Datatypes.LVector]
H:38 [binder, in Complexity.Complexity.UpToCPoly]
H:38 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
H:38 [binder, in Undecidability.TM.L.HeapInterpreter.LookupTM]
H:38 [binder, in Complexity.Complexity.NP]
H:39 [binder, in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisUnfoldClos]
H:39 [binder, in Undecidability.L.Datatypes.LSum]
H:39 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
H:39 [binder, in Complexity.Libs.CookPrelim.PolyBounds]
H:39 [binder, in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
H:39 [binder, in Complexity.NP.Clique.FlatClique]
h:39 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
H:4 [binder, in Undecidability.L.Functions.FinTypeLookup]
H:4 [binder, in Complexity.Complexity.PolyTimeComputable]
H:4 [binder, in Undecidability.TM.L.HeapInterpreter.LookupTM]
H:40 [binder, in Undecidability.TM.Single.StepTM]
H:40 [binder, in Undecidability.L.TM.TMEncoding]
H:41 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
H:41 [binder, in Complexity.Complexity.ONotation]
H:41 [binder, in Undecidability.L.Tactics.Lrewrite]
h:42 [binder, in Complexity.Libs.UniformHomomorphisms]
H:42 [binder, in Complexity.Libs.CookPrelim.PolyBounds]
H:42 [binder, in Complexity.Complexity.UpToCPoly]
H:42 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachine]
h:428 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
H:43 [binder, in Complexity.L.AbstractMachines.UnfoldTailRec]
H:43 [binder, in Undecidability.L.Tactics.ComputableTactics]
H:43 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
H:43 [binder, in Undecidability.L.Tactics.Computable]
H:44 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
H:45 [binder, in Undecidability.L.Functions.EqBool]
H:45 [binder, in Complexity.NP.TM.LM_to_mTM]
h:455 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
h:457 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
H:46 [binder, in Complexity.Complexity.UpToCPoly]
H:46 [binder, in Undecidability.TM.SBTM]
H:46 [binder, in Undecidability.TM.L.HeapInterpreter.LookupTM]
H:47 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
H:47 [binder, in Undecidability.TM.Single.StepTM]
H:47 [binder, in Complexity.L.AbstractMachines.UnfoldTailRec]
H:47 [binder, in Undecidability.L.Tactics.ComputableTactics]
H:47 [binder, in Undecidability.L.Functions.FinTypeLookup]
H:48 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
H:48 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
H:48 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachine]
H:49 [binder, in Complexity.TM.Code.Decode]
H:49 [binder, in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
H:49 [binder, in Complexity.Complexity.Definitions]
H:5 [binder, in Undecidability.L.Datatypes.LProd]
H:5 [binder, in Undecidability.L.Datatypes.LSum]
H:5 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
H:5 [binder, in Undecidability.L.Datatypes.LVector]
h:5 [binder, in Complexity.Libs.CookPrelim.Tactics]
H:5 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachine]
H:5 [binder, in Undecidability.L.Computability.Computability]
H:50 [binder, in Complexity.Complexity.Subtypes]
H:50 [binder, in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
h:50 [binder, in Complexity.L.TM.TMflatten]
H:50 [binder, in Undecidability.L.Datatypes.List.List_in]
H:52 [binder, in Complexity.Libs.CookPrelim.PolyBounds]
H:52 [binder, in Complexity.Complexity.UpToCPoly]
H:52 [binder, in Undecidability.L.Functions.EqBool]
H:52 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachine]
H:52 [binder, in Complexity.Complexity.PolyTimeComputable]
H:52 [binder, in Complexity.NP.TM.LM_to_mTM]
H:53 [binder, in Complexity.L.AbstractMachines.UnfoldTailRec]
H:53 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
H:54 [binder, in Undecidability.L.Datatypes.List.List_basics]
H:54 [binder, in Complexity.Complexity.Definitions]
H:548 [binder, in Complexity.NP.TM.LM_to_mTM]
H:55 [binder, in Complexity.Complexity.UpToCPoly]
h:55 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
H:558 [binder, in Complexity.NP.TM.LM_to_mTM]
H:56 [binder, in Complexity.L.AbstractMachines.Computable.EvalForTime]
H:56 [binder, in Complexity.L.AbstractMachines.UnfoldTailRec]
H:56 [binder, in Undecidability.L.Tactics.ComputableTime]
H:56 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
H:56 [binder, in Undecidability.L.Datatypes.List.List_eqb]
H:57 [binder, in Undecidability.TM.Single.StepTM]
H:57 [binder, in Complexity.Complexity.UpToCPoly]
H:57 [binder, in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
H:57 [binder, in Complexity.Complexity.Definitions]
H:57 [binder, in Undecidability.TM.L.HeapInterpreter.LookupTM]
H:58 [binder, in Undecidability.L.Functions.FinTypeLookup]
H:581 [binder, in Complexity.NP.TM.LM_to_mTM]
H:59 [binder, in Complexity.L.AbstractMachines.UnfoldTailRec]
H:59 [binder, in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
H:59 [binder, in Complexity.Complexity.NP]
H:6 [binder, in Complexity.L.AbstractMachines.UnfoldTailRec]
H:6 [binder, in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisUnfoldClos]
H:6 [binder, in Undecidability.L.Datatypes.Lists]
h:6 [binder, in Complexity.Libs.UniformHomomorphisms]
H:6 [binder, in Complexity.Libs.CookPrelim.PolyBounds]
H:6 [binder, in Undecidability.Synthetic.Infinite]
H:6 [binder, in Complexity.Complexity.NP]
H:60 [binder, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
H:60 [binder, in Complexity.Complexity.UpToCPoly]
H:60 [binder, in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
H:61 [binder, in Complexity.Complexity.PolyTimeComputable]
H:62 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
H:62 [binder, in Undecidability.L.Tactics.ComputableTime]
H:62 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachine]
H:62 [binder, in Complexity.L.AbstractMachines.FunctionalDefinitions]
H:62 [binder, in Undecidability.TM.L.HeapInterpreter.LookupTM]
H:62 [binder, in Complexity.Complexity.NP]
H:62 [binder, in Undecidability.TM.Single.EncodeTapes]
H:63 [binder, in Complexity.Complexity.Subtypes]
H:63 [binder, in Complexity.Complexity.UpToCPoly]
H:64 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
H:64 [binder, in Undecidability.L.Functions.Decoding]
H:65 [binder, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
h:65 [binder, in Undecidability.TM.Compound.Shift]
H:66 [binder, in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
H:66 [binder, in Undecidability.L.Datatypes.LVector]
h:66 [binder, in Undecidability.Shared.Libs.DLW.Utils.sorting]
H:67 [binder, in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
H:68 [binder, in Undecidability.L.Computability.Synthetic]
H:68 [binder, in Undecidability.L.Functions.FinTypeLookup]
H:68 [binder, in Complexity.Complexity.Definitions]
H:69 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
H:69 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
H:69 [binder, in Complexity.L.TM.CompCode]
h:7 [binder, in Complexity.Libs.UniformHomomorphisms]
H:7 [binder, in Complexity.Complexity.UpToCPoly]
H:70 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
H:70 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachine]
H:71 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
H:73 [binder, in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
H:73 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
H:73 [binder, in Complexity.L.TM.CompCode]
H:74 [binder, in Complexity.Complexity.NP]
H:75 [binder, in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
H:76 [binder, in Undecidability.L.Datatypes.LVector]
H:76 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
H:76 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachine]
H:77 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
H:78 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
h:79 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
H:798 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
H:8 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
H:8 [binder, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
H:8 [binder, in Undecidability.Shared.FinTypeEquiv]
H:80 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
H:81 [binder, in Complexity.Libs.CookPrelim.PolyBounds]
H:81 [binder, in Undecidability.L.Computability.Synthetic]
H:82 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
H:83 [binder, in Complexity.NP.SAT.SAT_inNP]
H:84 [binder, in Undecidability.L.Complexity.UpToC]
H:85 [binder, in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
H:85 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
H:85 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
H:86 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
H:87 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
h:87 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
H:88 [binder, in Complexity.Complexity.Definitions]
H:88 [binder, in Complexity.Complexity.PolyTimeComputable]
H:883 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
H:89 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
H:89 [binder, in Complexity.L.TM.TMflatComp]
H:9 [binder, in Undecidability.L.Datatypes.LSum]
H:9 [binder, in Complexity.L.AbstractMachines.Computable.Unfolding]
H:9 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
H:9 [binder, in Complexity.Complexity.Subtypes]
H:9 [binder, in Undecidability.L.Datatypes.LVector]
H:9 [binder, in Undecidability.L.Datatypes.List.List_nat]
H:9 [binder, in Undecidability.L.Functions.EqBool]
H:9 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachine]
H:9 [binder, in Undecidability.L.TM.TMEncoding]
H:9 [binder, in Undecidability.L.Computability.Synthetic]
H:9 [binder, in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
H:90 [binder, in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
H:91 [binder, in Complexity.L.TM.CompCode]
H:91 [binder, in Undecidability.L.Computability.Synthetic]
H:91 [binder, in Complexity.Complexity.Definitions]
H:92 [binder, in Undecidability.L.Datatypes.LVector]
H:93 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
H:93 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
H:93 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachine]
H:93 [binder, in Undecidability.L.Computability.Synthetic]
H:94 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
H:94 [binder, in Complexity.L.TM.CompCode]
H:94 [binder, in Complexity.Libs.CookPrelim.PolyBounds]
H:94 [binder, in Complexity.Complexity.UpToCPoly]
H:94 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
H:94 [binder, in Complexity.Complexity.Definitions]
H:94 [binder, in Complexity.Complexity.PolyTimeComputable]
h:94 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
H:95 [binder, in Undecidability.L.Datatypes.LVector]
H:95 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
H:96 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachine]
H:96 [binder, in Undecidability.L.Computability.Synthetic]
H:968 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
H:97 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
H:97 [binder, in Complexity.Complexity.Definitions]
h:97 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
H:979 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
H:98 [binder, in Complexity.Complexity.UpToCPoly]
H:98 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
H:99 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
H:99 [binder, in Complexity.L.TM.TMflatComp]

I

I [definition, in Undecidability.L.Util.L_facts]
ibbC [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
iconf:124 [binder, in Undecidability.TM.Combinators.StateWhile]
iconf:319 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
iconf:325 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
iconf:59 [binder, in Undecidability.TM.Lifting.LiftAlphabet]
Id [definition, in Undecidability.TM.Combinators.Combinators]
Id [section, in Undecidability.TM.Combinators.Combinators]
idbool [definition, in Undecidability.TM.L.CompilerBoolFuns.Compiler_nat_facts]
identityBBD [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
identityC [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
identityCard_revp [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
identityDBB [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
identityRules [inductive, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
identityTapeC [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Id.F [variable, in Undecidability.TM.Combinators.Combinators]
Id.n [variable, in Undecidability.TM.Combinators.Combinators]
Id.pM [variable, in Undecidability.TM.Combinators.Combinators]
Id.sig [variable, in Undecidability.TM.Combinators.Combinators]
If [definition, in Undecidability.TM.Combinators.If]
If [section, in Undecidability.TM.Combinators.If]
If [library]
ifbC [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
iffC [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
iff_dec [instance, in Undecidability.Shared.Libs.PSL.EqDec]
iff_dec [instance, in Undecidability.Shared.Dec]
ifsC [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
If_RealiseIn [lemma, in Undecidability.TM.Combinators.If]
If_TerminatesIn' [lemma, in Undecidability.TM.Combinators.If]
If_TerminatesIn [lemma, in Undecidability.TM.Combinators.If]
If_Realise [lemma, in Undecidability.TM.Combinators.If]
If_SpecT_weak' [lemma, in Undecidability.TM.Hoare.HoareCombinators]
If_SpecT_weak [lemma, in Undecidability.TM.Hoare.HoareCombinators]
If_SpecTReg [lemma, in Undecidability.TM.Hoare.HoareCombinators]
If_SpecT [lemma, in Undecidability.TM.Hoare.HoareCombinators]
If_Spec [lemma, in Undecidability.TM.Hoare.HoareCombinators]
If.F [variable, in Undecidability.TM.Combinators.If]
If.n [variable, in Undecidability.TM.Combinators.If]
If.pM1 [variable, in Undecidability.TM.Combinators.If]
If.pM2 [variable, in Undecidability.TM.Combinators.If]
If.pM3 [variable, in Undecidability.TM.Combinators.If]
If.sig [variable, in Undecidability.TM.Combinators.If]
If:30 [binder, in Undecidability.L.Computability.Decidability]
ignoreParam [definition, in Undecidability.TM.Util.Relations]
IHApp:34 [binder, in Undecidability.L.Tactics.LClos]
IHApp:50 [binder, in Undecidability.L.Tactics.Reflection]
IHApp:54 [binder, in Undecidability.L.Tactics.LClos]
IHApp:70 [binder, in Undecidability.L.Tactics.Reflection]
IHClos:37 [binder, in Undecidability.L.Tactics.LClos]
IHClos:53 [binder, in Undecidability.L.Tactics.Reflection]
IHClos:58 [binder, in Undecidability.L.Tactics.LClos]
IHClos:74 [binder, in Undecidability.L.Tactics.Reflection]
IHCons:41 [binder, in Undecidability.L.Tactics.LClos]
IHCons:57 [binder, in Undecidability.L.Tactics.Reflection]
IHNil:38 [binder, in Undecidability.L.Tactics.LClos]
IHNil:54 [binder, in Undecidability.L.Tactics.Reflection]
IHn:4 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.Arbitrary]
IHVar:31 [binder, in Undecidability.L.Tactics.LClos]
IHVar:47 [binder, in Undecidability.L.Tactics.Reflection]
IHVar:51 [binder, in Undecidability.L.Tactics.LClos]
IHVar:67 [binder, in Undecidability.L.Tactics.Reflection]
ii:174 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
ii:194 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
ii:197 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
ii:204 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
ii:32 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
implList [definition, in Undecidability.TM.Hoare.HoareRegister]
implListE [lemma, in Undecidability.TM.Hoare.HoareRegister]
implListI [lemma, in Undecidability.TM.Hoare.HoareRegister]
implList_iff [lemma, in Undecidability.TM.Hoare.HoareRegister]
impl_dec [instance, in Undecidability.Shared.Libs.PSL.EqDec]
impl_dec [instance, in Undecidability.Shared.Dec]
inb [definition, in Undecidability.L.Datatypes.List.List_eqb]
inb_spec [lemma, in Undecidability.L.Datatypes.List.List_eqb]
incl [section, in Undecidability.Shared.Libs.DLW.Utils.php]
inclp [definition, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
Inclusion [section, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
Inclusion [section, in Undecidability.Shared.ListAutomation]
Inclusion.X [variable, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
Inclusion.X [variable, in Undecidability.Shared.ListAutomation]
incl_equi_proper [instance, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
incl_preorder [instance, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
incl_app_left [lemma, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
incl_lrcons [lemma, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
incl_rcons [lemma, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
incl_sing [lemma, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
incl_lcons [lemma, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
incl_shift [lemma, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
incl_nil_eq [lemma, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
incl_map [lemma, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
incl_nil [lemma, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
incl_left_right_php [lemma, in Undecidability.Shared.Libs.DLW.Utils.php]
incl_right_cons_incl_or_lhd_or_perm [lemma, in Undecidability.Shared.Libs.DLW.Utils.php]
incl_left_right_cons [lemma, in Undecidability.Shared.Libs.DLW.Utils.php]
incl_right_cons_choose [lemma, in Undecidability.Shared.Libs.DLW.Utils.php]
incl_cons_rinv [lemma, in Undecidability.Shared.Libs.DLW.Utils.php]
incl_app_rinv [lemma, in Undecidability.Shared.Libs.DLW.Utils.php]
incl_cons_linv [lemma, in Undecidability.Shared.Libs.DLW.Utils.php]
incl_equi_proper [instance, in Undecidability.Shared.ListAutomation]
incl_preorder [instance, in Undecidability.Shared.ListAutomation]
incl_app_left [lemma, in Undecidability.Shared.ListAutomation]
incl_lrcons [lemma, in Undecidability.Shared.ListAutomation]
incl_rcons [lemma, in Undecidability.Shared.ListAutomation]
incl_lcons [lemma, in Undecidability.Shared.ListAutomation]
incl_shift [lemma, in Undecidability.Shared.ListAutomation]
incl_nil_eq [lemma, in Undecidability.Shared.ListAutomation]
incl_sing [lemma, in Undecidability.Shared.ListAutomation]
incl_nil [lemma, in Undecidability.Shared.ListAutomation]
incl_seteq [lemma, in Undecidability.Shared.Libs.DLW.Utils.seteq]
incl_cntr [lemma, in Undecidability.Shared.Libs.DLW.Utils.seteq]
incl_swap [lemma, in Undecidability.Shared.Libs.DLW.Utils.seteq]
incl_cons_mono [lemma, in Undecidability.Shared.Libs.DLW.Utils.seteq]
incl.X [variable, in Undecidability.Shared.Libs.DLW.Utils.php]
InCount [lemma, in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
Increment [definition, in Undecidability.TM.Code.BinNumbers.PosIncrementTM]
IncrementTwice [definition, in Undecidability.TM.Hoare.HoareExamples]
IncrementTwice_SpecT [lemma, in Undecidability.TM.Hoare.HoareExamples]
IncrementTwice_Spec [lemma, in Undecidability.TM.Hoare.HoareExamples]
IncrementTwice_SpecT_pure [lemma, in Undecidability.TM.Hoare.HoareExamples]
IncrementTwice_Spec_pure [lemma, in Undecidability.TM.Hoare.HoareExamples]
IncrementTwice_steps [definition, in Undecidability.TM.Hoare.HoareExamples]
Increment_Realise [lemma, in Undecidability.TM.Code.BinNumbers.PosIncrementTM]
Increment_Rel [definition, in Undecidability.TM.Code.BinNumbers.PosIncrementTM]
Increment_Loop_Realise [lemma, in Undecidability.TM.Code.BinNumbers.PosIncrementTM]
Increment_Loop [definition, in Undecidability.TM.Code.BinNumbers.PosIncrementTM]
Increment_Loop_Rel [definition, in Undecidability.TM.Code.BinNumbers.PosIncrementTM]
Increment_Step_Realise [lemma, in Undecidability.TM.Code.BinNumbers.PosIncrementTM]
Increment_Step [definition, in Undecidability.TM.Code.BinNumbers.PosIncrementTM]
Increment_Step_Rel [definition, in Undecidability.TM.Code.BinNumbers.PosIncrementTM]
Increment_N_Realise [lemma, in Undecidability.TM.Code.BinNumbers.NTM]
Increment_N_Rel [definition, in Undecidability.TM.Code.BinNumbers.NTM]
Increment_N [definition, in Undecidability.TM.Code.BinNumbers.NTM]
Incr2 [definition, in Undecidability.TM.Hoare.HoareExamples]
Incr2_SpecT [lemma, in Undecidability.TM.Hoare.HoareExamples]
Incr2_Spec [lemma, in Undecidability.TM.Hoare.HoareExamples]
Incr2_steps [definition, in Undecidability.TM.Hoare.HoareExamples]
Incr3 [definition, in Undecidability.TM.Hoare.HoareExamples]
Incr3_SpecT [lemma, in Undecidability.TM.Hoare.HoareExamples]
Incr3_Spec [lemma, in Undecidability.TM.Hoare.HoareExamples]
Incr3_steps [definition, in Undecidability.TM.Hoare.HoareExamples]
indcards:229 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
index [definition, in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
index__comp:5 [binder, in Complexity.NP.SAT.CookLevin]
index_leq [lemma, in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
index_le [lemma, in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
index_nth [lemma, in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
index_const_Time [definition, in Complexity.NP.SAT.CookLevin.Reductions.TMGenNP_fixed_singleTapeTM_to_FlatFunSingleTMGenNP]
index_nth_elem_fint [lemma, in Complexity.L.TM.TMunflatten]
index_nth_elem [lemma, in Complexity.L.TM.TMunflatten]
index_pair [lemma, in Complexity.NP.Clique.kSAT_to_FlatClique]
index':27 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
index1:51 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
index2:52 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
index:22 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
index:26 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
index:47 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
indKClique [inductive, in Complexity.NP.Clique.Clique]
indKCliqueNil [constructor, in Complexity.NP.Clique.Clique]
indKCliqueS [constructor, in Complexity.NP.Clique.Clique]
indKClique_iff [lemma, in Complexity.NP.Clique.Clique]
ind:43 [binder, in Undecidability.L.Tactics.Extract]
ind:49 [binder, in Undecidability.L.Tactics.Extract]
Inf [section, in Undecidability.Synthetic.Infinite]
inferHead [definition, in Undecidability.L.Tactics.Extract]
inferHead' [definition, in Undecidability.L.Tactics.Extract]
infinite [definition, in Undecidability.Synthetic.Infinite]
Infinite [library]
InformativeDefinitions [library]
InformativeReducibilityFacts [library]
informative_evalIn [lemma, in Undecidability.L.Computability.Seval]
informative_seval2 [lemma, in Undecidability.L.Computability.Seval]
informative_seval [lemma, in Undecidability.L.Computability.Seval]
informative_eval2 [lemma, in Undecidability.L.Computability.Seval]
informative_eval [lemma, in Undecidability.L.Computability.Seval]
Informative_Chinese_Remainder_theorems.Binary.Huv [variable, in Undecidability.Shared.Libs.DLW.Utils.crt]
Informative_Chinese_Remainder_theorems.Binary.Hv [variable, in Undecidability.Shared.Libs.DLW.Utils.crt]
Informative_Chinese_Remainder_theorems.Binary.Hu [variable, in Undecidability.Shared.Libs.DLW.Utils.crt]
Informative_Chinese_Remainder_theorems.Binary.b [variable, in Undecidability.Shared.Libs.DLW.Utils.crt]
Informative_Chinese_Remainder_theorems.Binary.a [variable, in Undecidability.Shared.Libs.DLW.Utils.crt]
Informative_Chinese_Remainder_theorems.Binary.v [variable, in Undecidability.Shared.Libs.DLW.Utils.crt]
Informative_Chinese_Remainder_theorems.Binary.u [variable, in Undecidability.Shared.Libs.DLW.Utils.crt]
Informative_Chinese_Remainder_theorems.Binary [section, in Undecidability.Shared.Libs.DLW.Utils.crt]
Informative_Chinese_Remainder_theorems [section, in Undecidability.Shared.Libs.DLW.Utils.crt]
inf_reduces [definition, in Undecidability.Synthetic.InformativeDefinitions]
inf_semi_decidable [definition, in Undecidability.Synthetic.InformativeDefinitions]
inf_enumerable [definition, in Undecidability.Synthetic.InformativeDefinitions]
inf_decidable [definition, in Undecidability.Synthetic.InformativeDefinitions]
inf_to_enumerator [instance, in Undecidability.Synthetic.ListEnumerabilityFacts]
inf_list_enumerable__T [definition, in Undecidability.Synthetic.ListEnumerabilityFacts]
Inf.f' [variable, in Undecidability.Synthetic.Infinite]
Inf.Gen [section, in Undecidability.Synthetic.Infinite]
Inf.Gen.f [variable, in Undecidability.Synthetic.Infinite]
Inf.Gen.Hf [variable, in Undecidability.Synthetic.Infinite]
Inf.Hf' [variable, in Undecidability.Synthetic.Infinite]
Inf.Hg [variable, in Undecidability.Synthetic.Infinite]
Inf.HX [variable, in Undecidability.Synthetic.Infinite]
Inf.X [variable, in Undecidability.Synthetic.Infinite]
inF:313 [binder, in Undecidability.TM.Hoare.HoareCombinators]
inF:324 [binder, in Undecidability.TM.Hoare.HoareCombinators]
inF:365 [binder, in Undecidability.TM.Hoare.HoareCombinators]
inF:382 [binder, in Undecidability.TM.Hoare.HoareCombinators]
inF:427 [binder, in Undecidability.TM.Hoare.HoareCombinators]
inF:446 [binder, in Undecidability.TM.Hoare.HoareCombinators]
Inhabited [library]
inhabitedC [record, in Undecidability.Shared.Libs.PSL.Inhabited]
inhabited_arrow_prod [instance, in Undecidability.Shared.Libs.PSL.Inhabited]
inhabited_arrow_sum [instance, in Undecidability.Shared.Libs.PSL.Inhabited]
inhabited_arrow_empty [instance, in Undecidability.Shared.Libs.PSL.Inhabited]
inhabited_arrow [instance, in Undecidability.Shared.Libs.PSL.Inhabited]
inhabited_prod [instance, in Undecidability.Shared.Libs.PSL.Inhabited]
inhabited_nat [instance, in Undecidability.Shared.Libs.PSL.Inhabited]
inhabited_fin [instance, in Undecidability.Shared.Libs.PSL.Inhabited]
inhabited_vector [instance, in Undecidability.Shared.Libs.PSL.Inhabited]
inhabited_list [instance, in Undecidability.Shared.Libs.PSL.Inhabited]
inhabited_bool [instance, in Undecidability.Shared.Libs.PSL.Inhabited]
inhabited_option [instance, in Undecidability.Shared.Libs.PSL.Inhabited]
inhabited_inr [instance, in Undecidability.Shared.Libs.PSL.Inhabited]
inhabited_inl [instance, in Undecidability.Shared.Libs.PSL.Inhabited]
inhabited_True [instance, in Undecidability.Shared.Libs.PSL.Inhabited]
inhabited_unit [instance, in Undecidability.Shared.Libs.PSL.Inhabited]
inhabited_pTM_lab [lemma, in Undecidability.TM.Util.TM_facts]
inhabited_TM_Q [instance, in Undecidability.TM.Util.TM_facts]
inhabited_move [instance, in Undecidability.TM.Util.TM_facts]
inhX:356 [binder, in Undecidability.TM.Hoare.HoareLogic]
inh_A:14 [binder, in Undecidability.Shared.Libs.PSL.Inhabited]
inh_B:9 [binder, in Undecidability.Shared.Libs.PSL.Inhabited]
inh_a:6 [binder, in Undecidability.Shared.Libs.PSL.Inhabited]
init [abbreviation, in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
init [definition, in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
init [projection, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
init [definition, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
init [projection, in Complexity.NP.SAT.CookLevin.Subproblems.BinaryCC]
init [abbreviation, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
init [projection, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
init [definition, in Complexity.L.AbstractMachines.AbstractSubstMachine]
init [abbreviation, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
init [abbreviation, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
init [abbreviation, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
init [projection, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
init [abbreviation, in Complexity.NP.SAT.CookLevin.Reductions.CC_to_BinaryCC]
init [projection, in Complexity.NP.SAT.CookLevin.Subproblems.CC]
initc [definition, in Undecidability.TM.Util.TM_facts]
initFlat_correct [lemma, in Complexity.L.TM.TMflatFun]
initialString [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
initialString_validPreludeInitial [lemma, in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
initialString_eq [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
initialString_reprConfig [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
initLMGen [definition, in Complexity.NP.L.LMGenNP]
initRight [definition, in Undecidability.TM.Code.CodeTM]
initRight_isVoid [lemma, in Undecidability.TM.Code.CodeTM]
initRight_isVoid_size [lemma, in Undecidability.TM.Code.CodeTM]
initRight_sizeOfTape [lemma, in Complexity.NP.TM.LM_to_mTM]
initTapes [definition, in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
initTapes_MU_correct_size [lemma, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
initTapes_MU_correct [lemma, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
initTapes_MU [definition, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
initTapes_U_correct_size [lemma, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
initTapes_U_correct [lemma, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
initTapes_U [definition, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
initTape_isFlatteningConfigOf [lemma, in Complexity.NP.SAT.CookLevin.Subproblems.SingleTMGenNP]
initTape_mapTape_index [lemma, in Complexity.NP.SAT.CookLevin.Subproblems.SingleTMGenNP]
initTape_singleTapeTM [definition, in Complexity.NP.TM.TMGenNP_fixed_mTM]
InitUniv [section, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
InitUniv.retr_sigTape_sig [variable, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
InitUniv.retr_sigGraph_sig [variable, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
InitUniv.sig [variable, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
InitUniv.sigM [variable, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
initValue [definition, in Undecidability.TM.Code.CodeTM]
initValue_contains [lemma, in Undecidability.TM.Code.CodeTM]
initValue_contains_size [lemma, in Undecidability.TM.Code.CodeTM]
initValue_sizeOfTape [lemma, in Complexity.NP.TM.LM_to_mTM]
init__evalForTime [definition, in Complexity.L.AbstractMachines.Computable.EvalForTime]
init__R:26 [binder, in Complexity.TM.Single.EncodeTapesInvariants]
init:115 [binder, in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
init:117 [binder, in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
init:121 [binder, in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
init:122 [binder, in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
init:50 [binder, in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
init:53 [binder, in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
init:58 [binder, in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
init:60 [binder, in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
init:64 [binder, in Undecidability.TM.Lifting.LiftTapes]
init:76 [binder, in Undecidability.TM.Lifting.LiftTapes]
init:81 [binder, in Undecidability.TM.Lifting.LiftTapes]
injective [definition, in Undecidability.Shared.Libs.PSL.Bijection]
injective [definition, in Undecidability.Synthetic.Infinite]
injective [abbreviation, in Complexity.Libs.CookPrelim.MorePrelim]
injective_index [lemma, in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
injective_composed_permutation [lemma, in Undecidability.Shared.Libs.DLW.Utils.sorting]
injectSizeFun [definition, in Undecidability.TM.Code.CodeTM]
InjectSurject [section, in Undecidability.TM.Lifting.LiftAlphabet]
InjectSurject.def [variable, in Undecidability.TM.Lifting.LiftAlphabet]
InjectSurject.inj [variable, in Undecidability.TM.Lifting.LiftAlphabet]
InjectSurject.sig [variable, in Undecidability.TM.Lifting.LiftAlphabet]
InjectSurject.tau [variable, in Undecidability.TM.Lifting.LiftAlphabet]
injectSymbols [definition, in Undecidability.TM.Code.ChangeAlphabet]
injectTape [definition, in Undecidability.TM.Lifting.LiftAlphabet]
InjectTape [section, in Undecidability.TM.Lifting.LiftAlphabet]
injectTape [abbreviation, in Undecidability.TM.Code.ChangeAlphabet]
injectTapes [definition, in Undecidability.TM.Lifting.LiftAlphabet]
InjectTape.f [variable, in Undecidability.TM.Lifting.LiftAlphabet]
InjectTape.sig [variable, in Undecidability.TM.Lifting.LiftAlphabet]
InjectTape.tau [variable, in Undecidability.TM.Lifting.LiftAlphabet]
inject_surject [lemma, in Undecidability.TM.Code.ChangeAlphabet]
inj_enc [projection, in Undecidability.L.Tactics.Computable]
inj_enc [constructor, in Undecidability.L.Tactics.Computable]
inl_ofFlatType [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
inl_injective [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
inNP [record, in Complexity.Complexity.NP]
inNP_TMgenericNPCompleteProblem [lemma, in Complexity.NP.TM.TMGenNP]
inNP_GenNPBool [lemma, in Complexity.NP.L.GenNPBool]
inNP_kSAT [lemma, in Complexity.NP.SAT.kSAT_to_SAT]
inNP_intro [lemma, in Complexity.Complexity.NP]
inNP_introSpec [constructor, in Complexity.Complexity.NP]
ino [definition, in Complexity.Complexity.ONotation]
inO [definition, in Complexity.Complexity.ONotation]
inOPoly [definition, in Complexity.Complexity.ONotation]
inOPoly_pointwise_eq [instance, in Complexity.Complexity.ONotation]
inOPoly_pointwise_leq [instance, in Complexity.Complexity.ONotation]
inOPoly_comp [lemma, in Complexity.Complexity.ONotation]
inOPoly_S [lemma, in Complexity.Complexity.ONotation]
inOPoly_pow [lemma, in Complexity.Complexity.ONotation]
inOPoly_mul [lemma, in Complexity.Complexity.ONotation]
inOPoly_add [lemma, in Complexity.Complexity.ONotation]
inOPoly_x [lemma, in Complexity.Complexity.ONotation]
inOPoly_c [lemma, in Complexity.Complexity.ONotation]
inOPoly_computable [lemma, in Complexity.Complexity.Definitions]
inO_inOPoly_trans [instance, in Complexity.Complexity.ONotation]
ino_inO_incl [lemma, in Complexity.Complexity.ONotation]
inO__bound [lemma, in Complexity.Complexity.ONotation]
inO_comp_l [lemma, in Complexity.Complexity.ONotation]
inO_mul_l [lemma, in Complexity.Complexity.ONotation]
inO_leq [lemma, in Complexity.Complexity.ONotation]
inO_c [lemma, in Complexity.Complexity.ONotation]
inO_mul_c_r [lemma, in Complexity.Complexity.ONotation]
inO_mul_c_l [lemma, in Complexity.Complexity.ONotation]
inO_add_l [lemma, in Complexity.Complexity.ONotation]
inO_pointwise_eq [instance, in Complexity.Complexity.ONotation]
inO_pointwise_leq [instance, in Complexity.Complexity.ONotation]
inO_PreOrder [instance, in Complexity.Complexity.ONotation]
inO_size_nat [lemma, in Complexity.HierarchyTheorem.TimeHierarchyTheorem]
inO_time_t__E [definition, in Complexity.HierarchyTheorem.TimeHierarchyTheorem]
inO_equiv_pointwise2 [lemma, in Complexity.Complexity.ONotationIsAppropriate]
inO_equiv_pointwise [lemma, in Complexity.Complexity.ONotationIsAppropriate]
inO_bound_reverse [lemma, in Complexity.Complexity.ONotationIsAppropriate]
inP [definition, in Complexity.Complexity.NP]
input:309 [binder, in Undecidability.TM.Util.TM_facts]
input:50 [binder, in Complexity.NP.SAT.SAT_inNP]
inp_eqb [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
inp:7 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.SingleTMGenNP]
inr_ofFlatType [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
inr_injective [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
insertCast [definition, in Undecidability.L.Tactics.Computable]
insertKnownSymbol [definition, in Undecidability.TM.Single.StepTM]
insertKnownSymbols [definition, in Undecidability.TM.Single.StepTM]
insertKnownSymbols_correct_cons [lemma, in Undecidability.TM.Single.StepTM]
insertKnownSymbols_correct [lemma, in Undecidability.TM.Single.StepTM]
insertKnownSymbol_correct [lemma, in Undecidability.TM.Single.StepTM]
insert_params [definition, in Undecidability.L.Tactics.Extract]
inSize__toTerm [projection, in Complexity.NP.L.CanEnumTerm_def]
instruction_compiler_sound [definition, in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
inst:37 [binder, in Undecidability.L.Tactics.Lrewrite]
inst:44 [binder, in Undecidability.L.Tactics.Lrewrite]
int [section, in Undecidability.L.Datatypes.LOptions]
int [section, in Undecidability.L.Datatypes.LSum]
int [section, in Complexity.L.TM.CompCode]
int [section, in Complexity.L.TM.CompCode]
int [section, in Complexity.L.TM.CompCode]
int [section, in Complexity.L.TM.CompCode]
int [section, in Complexity.L.TM.CompCode]
int [section, in Undecidability.L.Datatypes.List.List_eqb]
IntermediateProblems [library]
Intern [module, in Undecidability.L.Tactics.ComputableTactics]
Interpreter_SpecT [lemma, in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
Interpreter_Spec [lemma, in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
Interpreter_Spec_space [lemma, in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
intersect [definition, in Complexity.NP.SAT.SAT_inNP]
interval [definition, in Undecidability.Shared.Libs.DLW.Utils.interval]
interval [section, in Undecidability.Shared.Libs.DLW.Utils.interval]
interval [library]
interval_union_right [lemma, in Undecidability.Shared.Libs.DLW.Utils.interval]
interval_union_left [lemma, in Undecidability.Shared.Libs.DLW.Utils.interval]
interval_union [definition, in Undecidability.Shared.Libs.DLW.Utils.interval]
interval_disjoint [definition, in Undecidability.Shared.Libs.DLW.Utils.interval]
interval_dec [lemma, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
inTimeo [definition, in Complexity.Complexity.Definitions]
inTimeO [definition, in Complexity.Complexity.Definitions]
inTimePoly [definition, in Complexity.Complexity.NP]
inTimePoly_compTime [lemma, in Complexity.Complexity.NP]
inTime_mono [lemma, in Complexity.Complexity.Definitions]
intX:2 [binder, in Undecidability.L.Datatypes.List.List_basics]
intX:2 [binder, in Undecidability.L.Datatypes.LOptions]
intX:2 [binder, in Undecidability.L.Datatypes.List.List_eqb]
intX:2 [binder, in Undecidability.L.Datatypes.List.List_enc]
intX:207 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
intX:21 [binder, in Undecidability.L.Datatypes.List.List_nat]
intX:224 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
intX:3 [binder, in Undecidability.L.Datatypes.LProd]
intX:328 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
intX:37 [binder, in Undecidability.L.Datatypes.List.List_basics]
intX:91 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
intY:4 [binder, in Undecidability.L.Datatypes.LProd]
int_ext [projection, in Undecidability.L.Tactics.Extract]
int_ext [constructor, in Undecidability.L.Tactics.Extract]
int.X [variable, in Undecidability.L.Datatypes.LOptions]
int.X [variable, in Undecidability.L.Datatypes.LSum]
int.X [variable, in Complexity.L.TM.CompCode]
int.X [variable, in Complexity.L.TM.CompCode]
int.X [variable, in Complexity.L.TM.CompCode]
int.X [variable, in Complexity.L.TM.CompCode]
int.X [variable, in Complexity.L.TM.CompCode]
int.Y [variable, in Undecidability.L.Datatypes.LSum]
int.Y [variable, in Complexity.L.TM.CompCode]
int.Y [variable, in Complexity.L.TM.CompCode]
inverse [definition, in Undecidability.Shared.Libs.PSL.Bijection]
inverse_bijective [lemma, in Undecidability.Shared.Libs.PSL.Bijection]
invert_symbols_1_marked [lemma, in Complexity.TM.Single.EncodeTapesInvariants]
invert_symbols_0_marked [lemma, in Complexity.TM.Single.EncodeTapesInvariants]
involution [definition, in Complexity.Libs.CookPrelim.MorePrelim]
involution_invert_eqn2 [lemma, in Complexity.Libs.CookPrelim.MorePrelim]
involution_invert_eqn [lemma, in Complexity.Libs.CookPrelim.MorePrelim]
INV:433 [binder, in Undecidability.TM.Hoare.HoareCombinators]
in_repEl_iff [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
In_replace' [lemma, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
In_replace [lemma, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
in_tabulate [lemma, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
In_nth.n [variable, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
In_nth.A [variable, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
In_nth [section, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
In_dec [instance, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
in_dec_correct [lemma, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
in_dec [definition, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
In_Dec.X_dec [variable, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
In_Dec.X [variable, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
In_Dec [section, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
In_cons [lemma, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
In_nil [lemma, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
in_vec_dec_inv [lemma, in Undecidability.Shared.Libs.DLW.Vec.vec]
in_vec_inv [lemma, in Undecidability.Shared.Libs.DLW.Vec.vec]
in_vec_pos [lemma, in Undecidability.Shared.Libs.DLW.Vec.vec]
in_vec_list [lemma, in Undecidability.Shared.Libs.DLW.Vec.vec]
in_vec [definition, in Undecidability.Shared.Libs.DLW.Vec.vec]
in_filter_iff [lemma, in Undecidability.Shared.FilterFacts]
in_tabulate_formula_iff [lemma, in Complexity.NP.SAT.FSAT.FormulaEncoding]
in_tabulate_step_iff [lemma, in Complexity.NP.SAT.FSAT.FormulaEncoding]
in_rem_iff [lemma, in Undecidability.Shared.Libs.PSL.Lists.Removal]
in_O_t__E [lemma, in Complexity.HierarchyTheorem.TimeHierarchyTheorem]
In_list_assoc [lemma, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
in_prefix_1 [lemma, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
in_prefix_0 [lemma, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
In_list_in_map_inv [lemma, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
In_list_in_map [lemma, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
in_concat_iff [lemma, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
In_perm [lemma, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
In_list_repeat [lemma, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
in_list_injective_1 [lemma, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
in_list_injective_0 [lemma, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
In_In_t [lemma, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
In_t_In [lemma, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
In_t [definition, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
In_t.X [variable, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
In_t [section, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
in_chain_list_1 [constructor, in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
in_chain_list_0 [constructor, in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
in_chain_1 [constructor, in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
in_chain_0 [constructor, in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
in_gnlb_2 [constructor, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
in_gnlb_1 [constructor, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
in_gnlb_0 [constructor, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
in_ble_1 [constructor, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
in_ble_0 [constructor, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
in_concat_iff [lemma, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
in_equi_proper [instance, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
in_incl_proper [instance, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
in_cons_neq [lemma, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
in_sing [lemma, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
in_filter_iff [lemma, in Undecidability.Shared.Libs.PSL.Lists.Filter]
in_out_interval_dec [lemma, in Undecidability.Shared.Libs.DLW.Utils.interval]
in_out_interval [lemma, in Undecidability.Shared.Libs.DLW.Utils.interval]
in_interval [definition, in Undecidability.Shared.Libs.DLW.Utils.interval]
in_lb_ortho_2 [constructor, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
in_lb_ortho_1 [constructor, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
in_lb_ortho_0 [constructor, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
in_lb_mask_2 [constructor, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
in_lb_mask_1 [constructor, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
in_lb_mask_0 [constructor, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
in_Acc_eq [constructor, in Undecidability.Shared.Libs.DLW.Wf.acc_irr]
in_repeat_iff [lemma, in Complexity.L.TM.TMflatComp]
in_dedup_iff [lemma, in Complexity.NP.SAT.SAT_inNP]
in_intersect_iff [lemma, in Complexity.NP.SAT.SAT_inNP]
in_tb [constructor, in Undecidability.Shared.Libs.DLW.Utils.sorting]
in_bij [constructor, in Undecidability.Shared.Libs.DLW.Utils.sorting]
in_bounded_inj [constructor, in Undecidability.Shared.Libs.DLW.Utils.sorting]
in_cp_1 [constructor, in Undecidability.Shared.Libs.DLW.Utils.sorting]
in_cp_0 [constructor, in Undecidability.Shared.Libs.DLW.Utils.sorting]
in_nat_perm [constructor, in Undecidability.Shared.Libs.DLW.Utils.sorting]
in_lbs_1 [constructor, in Undecidability.Shared.Libs.DLW.Utils.list_bool]
in_lbs_0 [constructor, in Undecidability.Shared.Libs.DLW.Utils.list_bool]
in_list_hd1 [constructor, in Undecidability.Shared.Libs.DLW.Utils.php]
in_list_hd0 [constructor, in Undecidability.Shared.Libs.DLW.Utils.php]
in_undup_iff [lemma, in Undecidability.Shared.Libs.PSL.FiniteTypes.Arbitrary]
in_allnVecs [lemma, in Complexity.L.TM.TMflatten]
in_mkArgList_iff [lemma, in Complexity.L.TM.TMflatten]
in_vec_prod_iff [lemma, in Complexity.L.TM.TMflatten]
in_flattenHalt'_iff [lemma, in Complexity.L.TM.TMflatten]
in_prodLists_iff [lemma, in Complexity.L.TM.TMflatten]
In_extend [lemma, in Complexity.L.AbstractMachines.AbstractHeapMachine]
in_encode_retract [lemma, in Undecidability.TM.Code.ChangeAlphabet]
In_cumul [lemma, in Undecidability.Synthetic.ListEnumerabilityFacts]
in_finalSubstrings_iff [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
in_flat_haltingStates_iff [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
in_makeCards_iff [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
in_makeCardsP_iff [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
in_makeAllEvalEnv_iff [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
in_mkVarEnv_iff [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
in_list_prod_iff [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
in_toAssignment_iff [lemma, in Complexity.NP.Clique.kSAT_to_Clique]
in_equi_proper [instance, in Undecidability.Shared.ListAutomation]
in_incl_proper [instance, in Undecidability.Shared.ListAutomation]
in_concat_iff [lemma, in Undecidability.Shared.ListAutomation]
in_bar_min_1 [constructor, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
in_bar_min_0 [constructor, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
in_nat_sorted_3 [lemma, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
in_nat_sorted_2 [lemma, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
in_nat_sorted_1 [lemma, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
in_nat_sorted_0 [lemma, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
in_code_subcode [lemma, in Undecidability.Shared.Libs.DLW.Code.subcode]
in_out_code_dec [lemma, in Undecidability.Shared.Libs.DLW.Code.subcode]
in_out_code [lemma, in Undecidability.Shared.Libs.DLW.Code.subcode]
in_code [definition, in Undecidability.Shared.Libs.DLW.Code.subcode]
in_sss_steps_S [constructor, in Undecidability.Shared.Libs.DLW.Code.sss]
in_sss_steps_0 [constructor, in Undecidability.Shared.Libs.DLW.Code.sss]
in_sss_step [lemma, in Undecidability.Shared.Libs.DLW.Code.sss]
in_makeEdges_iff [lemma, in Complexity.NP.Clique.kSAT_to_FlatClique]
in_allPositions_iff [lemma, in Complexity.NP.Clique.kSAT_to_FlatClique]
in_concat_map_iff [lemma, in Complexity.Libs.CookPrelim.MorePrelim]
In_explicit [lemma, in Complexity.Libs.CookPrelim.MorePrelim]
in_filter_iff [lemma, in Complexity.Libs.CookPrelim.MorePrelim]
in_filterSome_iff [lemma, in Complexity.Libs.CookPrelim.MorePrelim]
in_prodLists_iff [lemma, in Complexity.Libs.CookPrelim.MorePrelim]
in_remove_iff [lemma, in Complexity.Libs.CookPrelim.MorePrelim]
ireduces_dependent [lemma, in Undecidability.Synthetic.InformativeReducibilityFacts]
ireduces_reduces [lemma, in Undecidability.Synthetic.InformativeReducibilityFacts]
ireduces_transitive [lemma, in Undecidability.Synthetic.InformativeReducibilityFacts]
ireduces_reflexive [lemma, in Undecidability.Synthetic.InformativeReducibilityFacts]
isbC [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
isBorder:55 [binder, in Complexity.NP.TM.M_multi2mono]
isBoundEntry [definition, in Complexity.L.TM.TMflatComp]
isBoundRead [definition, in Complexity.L.TM.TMflatComp]
isBoundTrans [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
isBoundTransTable [definition, in Complexity.L.TM.TMunflatten]
isBoundTransTable_poly [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
isBoundTransTable_time_bound [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
isBoundTransTable_time [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
isBoundTransTable_spec [lemma, in Complexity.L.TM.TMunflatten]
isBoundTransTable' [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
isBoundTrans_poly [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
isBoundTrans_time_bound [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
isBoundTrans_time [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
isBoundWrite [definition, in Complexity.L.TM.TMflatComp]
isCard [definition, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
isClique [definition, in Complexity.NP.Clique.Clique]
isClique_clausesOf_dupfree [lemma, in Complexity.NP.Clique.kSAT_to_Clique]
IsCons [definition, in Undecidability.TM.Single.StepTM]
IsCons_Sem [lemma, in Undecidability.TM.Single.StepTM]
IsCons_steps [definition, in Undecidability.TM.Single.StepTM]
IsCons_Rel [definition, in Undecidability.TM.Single.StepTM]
isfClique [definition, in Complexity.NP.Clique.FlatClique]
isfClique_decb_poly [lemma, in Complexity.NP.Clique.FlatClique]
isfClique_decb_time_bound [lemma, in Complexity.NP.Clique.FlatClique]
isfClique_decb_time [definition, in Complexity.NP.Clique.FlatClique]
isfClique_decb_iff [lemma, in Complexity.NP.Clique.FlatClique]
isfClique_decb [definition, in Complexity.NP.Clique.FlatClique]
IsFinal [definition, in Undecidability.TM.Univ.LowLevel]
IsFinal_Readcurrent_size_nice [lemma, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
IsFinal_size_nice [lemma, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
IsFinal_Terminates [lemma, in Undecidability.TM.Univ.LowLevel]
IsFinal_T [definition, in Undecidability.TM.Univ.LowLevel]
IsFinal_steps [definition, in Undecidability.TM.Univ.LowLevel]
IsFinal_Realise [lemma, in Undecidability.TM.Univ.LowLevel]
IsFinal_Rel [definition, in Undecidability.TM.Univ.LowLevel]
IsFinal_size [definition, in Undecidability.TM.Univ.LowLevel]
IsFinal_SpecT_space [lemma, in Undecidability.TM.Univ.Univ]
IsFinal_size' [definition, in Undecidability.TM.Univ.Univ]
isfKClique [definition, in Complexity.NP.Clique.FlatClique]
isfKClique_decb_poly [lemma, in Complexity.NP.Clique.FlatClique]
isfKClique_decb_time_bound [lemma, in Complexity.NP.Clique.FlatClique]
isfKClique_decb_time [definition, in Complexity.NP.Clique.FlatClique]
isfKClique_decb_iff [lemma, in Complexity.NP.Clique.FlatClique]
isfKClique_decb [definition, in Complexity.NP.Clique.FlatClique]
isFlatCardsOf [inductive, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
isFlatCardsOf_hom_agree [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
isFlatCCCardOf [inductive, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
isFlatCCCardOf_hom_agree [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
isFlatCCOf [inductive, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
isFlatCCOf_equivalence [lemma, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
isFlatCCOf_wf_equivalent [lemma, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
isFlatCCOf_isValidFlattening [lemma, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
isFlatEdgesOf [inductive, in Complexity.NP.Clique.FlatUGraph]
isFlatEdgesOf_fedges_wf [lemma, in Complexity.NP.Clique.FlatUGraph]
isFlatEnvOf [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
isFlatEnvOf_bound_card_transfer [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
isFlatEnvOf_bound_Alphabet_transfer [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
isFlatFinalOf [inductive, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
isFlatFinalOf_hom_agree [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
isFlatGraphOf [definition, in Complexity.NP.Clique.FlatUGraph]
isFlatGraphOf_wf [lemma, in Complexity.NP.Clique.FlatUGraph]
isFlatListOf [definition, in Complexity.Libs.CookPrelim.FlatFinTypes]
isFlatListOf_list_finReprEl' [lemma, in Complexity.Libs.CookPrelim.FlatFinTypes]
isFlatListOf_list_ofFlatType [lemma, in Complexity.Libs.CookPrelim.FlatFinTypes]
isFlatListOf_incl2 [lemma, in Complexity.Libs.CookPrelim.FlatFinTypes]
isFlatListOf_incl1 [lemma, in Complexity.Libs.CookPrelim.FlatFinTypes]
isFlatListOf_Some1 [lemma, in Complexity.Libs.CookPrelim.FlatFinTypes]
isFlatListOf_injective [lemma, in Complexity.Libs.CookPrelim.FlatFinTypes]
isFlatListOf_functional [lemma, in Complexity.Libs.CookPrelim.FlatFinTypes]
isFlatListOf_app [lemma, in Complexity.Libs.CookPrelim.FlatFinTypes]
isFlatListOf_cons [lemma, in Complexity.Libs.CookPrelim.FlatFinTypes]
isFlatListOf_hom_agree [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
isFlatListOf_app_inv [lemma, in Complexity.NP.SAT.CookLevin.Subproblems.SingleTMGenNP]
isFlatListOf_rev [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
isFlatListOf_single [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
isFlatListOf_list_finReprEl [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
isFlatTCardsOf [inductive, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
isFlatTCardsOf_concat [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
isFlatTCCCardOf [inductive, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
isFlatTCCCardOf_map_index [lemma, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
isFlatTCCCardPOf [inductive, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
isFlatTCCOf [inductive, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
isFlatTCCOf_equivalence [lemma, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
isFlatTCCOf_wf_equivalent [lemma, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
isFlatTCCOf_isValidFlattening [lemma, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
isFlatteningConfigOf [inductive, in Complexity.L.TM.TMflat]
isFlatteningConfigOf_iff [lemma, in Complexity.L.TM.TMflat]
isFlatteningHaltOf [inductive, in Complexity.L.TM.TMflat]
isFlatteningTapesOf [inductive, in Complexity.L.TM.TMflat]
isFlatteningTapesOf_iff [lemma, in Complexity.L.TM.TMflat]
isFlatteningTMOf [inductive, in Complexity.L.TM.TMflat]
isFlatteningTransOf [inductive, in Complexity.L.TM.TMflat]
isFlatteningTransOf_eq [lemma, in Complexity.L.TM.TMflatFun]
isFlatteningTrans_validFlatTrans [lemma, in Complexity.L.TM.TMunflatten]
isFlattening_is_valid [lemma, in Complexity.L.TM.TMunflatten]
isFlatVertexOf [definition, in Complexity.NP.Clique.FlatUGraph]
isFlatVerticesOf [definition, in Complexity.NP.Clique.FlatUGraph]
isfVertex [definition, in Complexity.NP.Clique.FlatUGraph]
isfVertex_decb_iff [lemma, in Complexity.NP.Clique.FlatUGraph]
isfVertex_decb [definition, in Complexity.NP.Clique.FlatUGraph]
isHalting [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
isHalting_time [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
isInjFinfuncTable [definition, in Complexity.L.TM.TMunflatten]
isInjFinfuncTable_poly [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
isInjFinfuncTable_time_bound [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
isInjFinfuncTable_time [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
isInjFinfuncTable_time [definition, in Complexity.L.TM.TMflatComp]
isInjFinfuncTable_spec [lemma, in Complexity.L.TM.TMunflatten]
isKClique [definition, in Complexity.NP.Clique.Clique]
isLeftBlank [definition, in Undecidability.TM.Single.EncodeTapes]
isMarked [definition, in Undecidability.TM.Single.EncodeTapes]
isMarked' [definition, in Undecidability.TM.Single.StepTM]
IsNil [definition, in Undecidability.TM.Code.CaseList]
isNilBlank [definition, in Undecidability.TM.Single.EncodeTapes]
isNilCons [definition, in Undecidability.TM.Single.StepTM]
IsNil_Sem [lemma, in Undecidability.TM.Code.CaseList]
IsNil_steps [definition, in Undecidability.TM.Code.CaseList]
IsNil_Rel [definition, in Undecidability.TM.Code.CaseList]
IsOne [definition, in Undecidability.TM.Code.BinNumbers.PosShiftTM]
IsOne_Sem [lemma, in Undecidability.TM.Code.BinNumbers.PosShiftTM]
IsOne_steps [definition, in Undecidability.TM.Code.BinNumbers.PosShiftTM]
IsOne_Rel [definition, in Undecidability.TM.Code.BinNumbers.PosShiftTM]
isOrigString [definition, in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
isPoly [record, in Complexity.Complexity.UpToCPoly]
isPreludeString [definition, in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
isP__mono [projection, in Complexity.Complexity.UpToCPoly]
isP__inOPoly [projection, in Complexity.Complexity.UpToCPoly]
isP__bounds [projection, in Complexity.Complexity.UpToCPoly]
isP__poly [projection, in Complexity.Complexity.UpToCPoly]
isReturnMarker [definition, in Undecidability.TM.Single.StepTM]
isRule [definition, in Complexity.NP.SAT.CookLevin.Subproblems.CC]
isRule_length [lemma, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
isRule_length [lemma, in Complexity.NP.SAT.CookLevin.Subproblems.CC]
issBC [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
isSome [definition, in Undecidability.L.Datatypes.LOptions]
isSpecStateSym [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
issSC [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
isStart [definition, in Undecidability.TM.Single.StepTM]
isStart [definition, in Undecidability.TM.Code.Copy]
isStateSym [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
isStateSym_isSpecStateSym [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
isStop [definition, in Undecidability.TM.Code.Copy]
isSymbol [definition, in Undecidability.TM.Single.EncodeTapes]
isUnflattableTape [lemma, in Complexity.L.TM.TMunflatten]
isUnflattableTapes [lemma, in Complexity.L.TM.TMunflatten]
isValidCert [definition, in Complexity.NP.SAT.CookLevin.Subproblems.SingleTMGenNP]
isValidCert_sizeOfTape [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
isValidFlatAct [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
isValidFlatCards [definition, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
isValidFlatCards [definition, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
isValidFlatCards_app [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
isValidFlatFinal [definition, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
isValidFlatFinal [definition, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
isValidFlatInitial [definition, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
isValidFlatInitial [definition, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
isValidFlatStateSig [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
isValidFlatTape [definition, in Complexity.L.TM.TMunflatten]
isValidFlatTapes [definition, in Complexity.L.TM.TMunflatten]
isValidFlatTapes_time [definition, in Complexity.L.TM.TMflatComp]
isValidFlatTape_time_le [lemma, in Complexity.L.TM.TMflatComp]
isValidFlatTape_time [definition, in Complexity.L.TM.TMflatComp]
isValidFlatTape_spec [lemma, in Complexity.L.TM.TMunflatten]
isValidFlattening [definition, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
isValidFlattening [definition, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
isValidFlatteningDec_poly [lemma, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
isValidFlattening_dec_time_bound [lemma, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
isValidFlattening_dec_time [definition, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
isValidFlattening_dec_correct [lemma, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
isValidFlattening_dec [definition, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
isValidFlatTM [definition, in Complexity.L.TM.TMunflatten]
isValidFlatTM_poly [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
isValidFlatTM_time_bound [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
isValidFlatTM_time [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
isValidFlatTM_time [definition, in Complexity.L.TM.TMflatComp]
isValidFlatTM_spec [lemma, in Complexity.L.TM.TMunflatten]
isValidFlatTrans [definition, in Complexity.L.TM.TMunflatten]
isValidFlatTrans_poly [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
isValidFlatTrans_time_bound [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
isValidFlatTrans_time [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
isValidFlatTrans_spec [lemma, in Complexity.L.TM.TMunflatten]
isValidInitialString [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
isValidInput [definition, in Complexity.NP.SAT.CookLevin.Subproblems.SingleTMGenNP]
isVoid [definition, in Undecidability.TM.Code.CodeTM]
isVoid [section, in Undecidability.TM.Code.CodeTM]
isVoidBlank [definition, in Undecidability.TM.Single.EncodeTapes]
isVoid_size_sizeOfTape [lemma, in Undecidability.TM.Code.CodeTM]
isVoid_isVoid_size [lemma, in Undecidability.TM.Code.CodeTM]
isVoid_size_left [lemma, in Undecidability.TM.Code.CodeTM]
isVoid_size_right [lemma, in Undecidability.TM.Code.CodeTM]
isVoid_right [lemma, in Undecidability.TM.Code.CodeTM]
isVoid_size_monotone [lemma, in Undecidability.TM.Code.CodeTM]
isVoid_size_isVoid [lemma, in Undecidability.TM.Code.CodeTM]
isVoid_size [definition, in Undecidability.TM.Code.CodeTM]
isVoid_size_hasSize [lemma, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
isxH [definition, in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
isxH' [definition, in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
is_halt_state_correct [lemma, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
is_halt_state_halt [lemma, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
is_halt_state [definition, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
is_rel_prime_expo [lemma, in Undecidability.Shared.Libs.DLW.Utils.prime]
is_rel_prime_mult [lemma, in Undecidability.Shared.Libs.DLW.Utils.prime]
is_true [definition, in Undecidability.Shared.Dec]
is_seq [definition, in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
is_digit_fun [lemma, in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
is_digit [definition, in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
is_computable [inductive, in Undecidability.L.Computability.Synthetic]
is_gcd_rem [lemma, in Undecidability.Shared.Libs.DLW.Utils.gcd]
is_lcm_moduplus [lemma, in Undecidability.Shared.Libs.DLW.Utils.gcd]
is_lcm_plus [lemma, in Undecidability.Shared.Libs.DLW.Utils.gcd]
is_lcm_modulus [lemma, in Undecidability.Shared.Libs.DLW.Utils.gcd]
is_lcm_minus [lemma, in Undecidability.Shared.Libs.DLW.Utils.gcd]
is_gcd_mult_lcm [lemma, in Undecidability.Shared.Libs.DLW.Utils.gcd]
is_gcd_lcm_mult [lemma, in Undecidability.Shared.Libs.DLW.Utils.gcd]
is_lcm_mult [lemma, in Undecidability.Shared.Libs.DLW.Utils.gcd]
is_gcd_rel_prime [lemma, in Undecidability.Shared.Libs.DLW.Utils.gcd]
is_gcd_0 [lemma, in Undecidability.Shared.Libs.DLW.Utils.gcd]
is_rel_prime_lcm [lemma, in Undecidability.Shared.Libs.DLW.Utils.gcd]
is_rel_prime_div_r [lemma, in Undecidability.Shared.Libs.DLW.Utils.gcd]
is_rel_prime_div [lemma, in Undecidability.Shared.Libs.DLW.Utils.gcd]
is_lcm_fun [lemma, in Undecidability.Shared.Libs.DLW.Utils.gcd]
is_lcm_sym [lemma, in Undecidability.Shared.Libs.DLW.Utils.gcd]
is_lcm_0r [lemma, in Undecidability.Shared.Libs.DLW.Utils.gcd]
is_lcm_0l [lemma, in Undecidability.Shared.Libs.DLW.Utils.gcd]
is_gcd_fun [lemma, in Undecidability.Shared.Libs.DLW.Utils.gcd]
is_gcd_refl [lemma, in Undecidability.Shared.Libs.DLW.Utils.gcd]
is_gcd_div [lemma, in Undecidability.Shared.Libs.DLW.Utils.gcd]
is_gcd_mult [lemma, in Undecidability.Shared.Libs.DLW.Utils.gcd]
is_gcd_plus [lemma, in Undecidability.Shared.Libs.DLW.Utils.gcd]
is_gcd_moduplus [lemma, in Undecidability.Shared.Libs.DLW.Utils.gcd]
is_gcd_minus [lemma, in Undecidability.Shared.Libs.DLW.Utils.gcd]
is_gcd_modulus [lemma, in Undecidability.Shared.Libs.DLW.Utils.gcd]
is_gcd_1r [lemma, in Undecidability.Shared.Libs.DLW.Utils.gcd]
is_gcd_1l [lemma, in Undecidability.Shared.Libs.DLW.Utils.gcd]
is_gcd_0r [lemma, in Undecidability.Shared.Libs.DLW.Utils.gcd]
is_gcd_0l [lemma, in Undecidability.Shared.Libs.DLW.Utils.gcd]
is_gcd_sym [lemma, in Undecidability.Shared.Libs.DLW.Utils.gcd]
is_lcm [definition, in Undecidability.Shared.Libs.DLW.Utils.gcd]
is_gcd [definition, in Undecidability.Shared.Libs.DLW.Utils.gcd]
it [definition, in Undecidability.Shared.Libs.PSL.Numbers]
iter [definition, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
iter [section, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
Iteration [section, in Undecidability.Shared.Libs.PSL.Numbers]
Iteration.f [variable, in Undecidability.Shared.Libs.PSL.Numbers]
Iteration.X [variable, in Undecidability.Shared.Libs.PSL.Numbers]
iterT:40 [binder, in Undecidability.L.Functions.UnboundIteration]
iterT:46 [binder, in Undecidability.L.Functions.UnboundIteration]
iterupN [definition, in Complexity.L.Functions.IterupN]
IterupN [library]
iterupN_lt [lemma, in Complexity.L.Functions.IterupN]
iterupN_geq [lemma, in Complexity.L.Functions.IterupN]
iterupN_eq [lemma, in Complexity.L.Functions.IterupN]
iter_S [lemma, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
iter_swap [lemma, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
iter_plus [lemma, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
iter_list_bool_next_nil [lemma, in Undecidability.Shared.Libs.DLW.Utils.list_bool]
iter.f [variable, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
iter.X [variable, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
it_fp [lemma, in Undecidability.Shared.Libs.PSL.Numbers]
it_ind [lemma, in Undecidability.Shared.Libs.PSL.Numbers]
it_time [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
it_i [definition, in Undecidability.L.Tactics.Extract]
it_i' [definition, in Undecidability.L.Tactics.Extract]
it_i.f [variable, in Undecidability.L.Tactics.Extract]
it_i.X [variable, in Undecidability.L.Tactics.Extract]
it_i [section, in Undecidability.L.Tactics.Extract]
I_proc [lemma, in Undecidability.L.Tactics.Lsimpl]
I_x' [instance, in Undecidability.TM.Code.ChangeAlphabet]
I_neq_Omega [lemma, in Undecidability.L.Computability.Scott]
i':14 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Fin]
i':15 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Fin]
i':190 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
i':200 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
i':209 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
i':27 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Fin]
i':3 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Fin]
i':31 [binder, in Complexity.L.AbstractMachines.Computable.EvalForTime]
i':31 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Fin]
i':35 [binder, in Complexity.L.AbstractMachines.Computable.EvalForTime]
i':35 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Fin]
i':39 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Fin]
i':50 [binder, in Undecidability.L.Tactics.Lrewrite]
i':58 [binder, in Complexity.L.AbstractMachines.Computable.EvalForTime]
i':59 [binder, in Complexity.L.AbstractMachines.Computable.EvalForTime]
i':63 [binder, in Undecidability.TM.Single.StepTM]
i':66 [binder, in Undecidability.TM.Single.StepTM]
i':77 [binder, in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
i1:15 [binder, in Undecidability.TM.Combinators.SequentialComposition]
i1:18 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Fin]
i1:19 [binder, in Undecidability.TM.Combinators.If]
i1:22 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Fin]
i1:24 [binder, in Undecidability.TM.Combinators.SequentialComposition]
i1:25 [binder, in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
i1:26 [binder, in Undecidability.Shared.Libs.DLW.Utils.interval]
i1:30 [binder, in Undecidability.TM.Combinators.If]
I1:339 [binder, in Undecidability.TM.Code.Copy]
I1:351 [binder, in Undecidability.TM.Code.Copy]
I1:362 [binder, in Undecidability.TM.Code.Copy]
i1:37 [binder, in Undecidability.Shared.Libs.DLW.Utils.interval]
I1:374 [binder, in Undecidability.TM.Code.Copy]
i1:38 [binder, in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
I1:382 [binder, in Undecidability.TM.Code.Copy]
i1:386 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
I1:390 [binder, in Undecidability.TM.Code.Copy]
I1:397 [binder, in Undecidability.TM.Code.Copy]
I1:405 [binder, in Undecidability.TM.Code.Copy]
i1:43 [binder, in Undecidability.TM.Single.StepTM]
i1:51 [binder, in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
I1:52 [binder, in Undecidability.TM.Hoare.HoareExamples]
i1:54 [binder, in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
i1:59 [binder, in Undecidability.TM.Combinators.Switch]
i1:63 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
I1:64 [binder, in Undecidability.TM.Hoare.HoareExamples]
i1:66 [binder, in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
i1:69 [binder, in Undecidability.TM.Combinators.Switch]
i1:72 [binder, in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
I1:75 [binder, in Undecidability.TM.Hoare.HoareExamples]
i1:77 [binder, in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
i1:81 [binder, in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
i1:85 [binder, in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
i1:91 [binder, in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
i2:16 [binder, in Undecidability.TM.Combinators.SequentialComposition]
i2:19 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Fin]
i2:20 [binder, in Undecidability.TM.Combinators.If]
i2:23 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Fin]
i2:27 [binder, in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
i2:27 [binder, in Undecidability.TM.Combinators.SequentialComposition]
i2:28 [binder, in Undecidability.Shared.Libs.DLW.Utils.interval]
i2:34 [binder, in Undecidability.TM.Combinators.If]
I2:340 [binder, in Undecidability.TM.Code.Copy]
I2:352 [binder, in Undecidability.TM.Code.Copy]
I2:363 [binder, in Undecidability.TM.Code.Copy]
I2:375 [binder, in Undecidability.TM.Code.Copy]
I2:383 [binder, in Undecidability.TM.Code.Copy]
i2:388 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
i2:39 [binder, in Undecidability.Shared.Libs.DLW.Utils.interval]
I2:391 [binder, in Undecidability.TM.Code.Copy]
I2:398 [binder, in Undecidability.TM.Code.Copy]
i2:40 [binder, in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
I2:406 [binder, in Undecidability.TM.Code.Copy]
i2:44 [binder, in Undecidability.TM.Single.StepTM]
I2:53 [binder, in Undecidability.TM.Hoare.HoareExamples]
i2:58 [binder, in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
i2:60 [binder, in Undecidability.TM.Combinators.Switch]
i2:65 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
I2:65 [binder, in Undecidability.TM.Hoare.HoareExamples]
i2:68 [binder, in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
i2:72 [binder, in Undecidability.TM.Combinators.Switch]
I2:76 [binder, in Undecidability.TM.Hoare.HoareExamples]
i2:79 [binder, in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
i2:83 [binder, in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
i2:88 [binder, in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
i2:96 [binder, in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
i3:33 [binder, in Undecidability.TM.Combinators.If]
i:1 [binder, in Undecidability.TM.Compound.TMTac]
i:1 [binder, in Undecidability.Shared.Libs.DLW.Utils.interval]
i:10 [binder, in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
i:10 [binder, in Complexity.L.Functions.IterupN]
i:10 [binder, in Undecidability.Shared.Libs.DLW.Utils.sorting]
i:10 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.SingleTMGenNP]
i:10 [binder, in Undecidability.L.Tactics.Lbeta]
i:100 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
i:101 [binder, in Undecidability.Shared.Libs.DLW.Utils.sorting]
i:101 [binder, in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
i:103 [binder, in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
i:104 [binder, in Undecidability.TM.Single.StepTM]
i:104 [binder, in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
i:105 [binder, in Undecidability.Shared.Libs.DLW.Utils.sorting]
i:105 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
i:105 [binder, in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
i:105 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
i:106 [binder, in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
i:107 [binder, in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
i:108 [binder, in Undecidability.L.Tactics.LClos]
i:108 [binder, in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
i:108 [binder, in Complexity.NP.Clique.kSAT_to_Clique]
i:109 [binder, in Undecidability.Shared.Libs.DLW.Utils.sorting]
i:109 [binder, in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
i:11 [binder, in Undecidability.TM.Single.StepTM]
i:11 [binder, in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
i:11 [binder, in Undecidability.Shared.Libs.PSL.Lists.Position]
i:110 [binder, in Undecidability.L.Tactics.Extract]
i:111 [binder, in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
i:113 [binder, in Undecidability.Shared.Libs.DLW.Utils.sorting]
i:113 [binder, in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
i:113 [binder, in Undecidability.Shared.Libs.DLW.Vec.pos]
i:116 [binder, in Undecidability.L.Tactics.ComputableTime]
i:117 [binder, in Undecidability.TM.Hoare.HoareRegister]
i:118 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
i:118 [binder, in Undecidability.TM.Code.CodeTM]
i:119 [binder, in Undecidability.Shared.Libs.DLW.Utils.sorting]
i:12 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
i:12 [binder, in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
i:12 [binder, in Undecidability.Shared.Libs.DLW.Utils.interval]
i:12 [binder, in Undecidability.Shared.Libs.DLW.Utils.sorting]
I:12 [binder, in Undecidability.TM.Code.WriteValue]
i:12 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
i:120 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
i:120 [binder, in Undecidability.Shared.Libs.DLW.Utils.sorting]
i:120 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
i:121 [binder, in Undecidability.Shared.Libs.DLW.Utils.sorting]
I:122 [binder, in Undecidability.TM.Code.CodeTM]
i:122 [binder, in Undecidability.Shared.Libs.DLW.Utils.sorting]
i:123 [binder, in Undecidability.TM.Code.NatTM]
i:123 [binder, in Undecidability.TM.Util.Relations]
i:123 [binder, in Undecidability.TM.Lifting.LiftTapes]
i:124 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
i:125 [binder, in Undecidability.TM.Single.StepTM]
i:127 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
i:127 [binder, in Undecidability.Shared.Libs.DLW.Utils.sorting]
i:127 [binder, in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
i:127 [binder, in Undecidability.TM.Lifting.LiftTapes]
i:128 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
i:128 [binder, in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
i:129 [binder, in Undecidability.TM.Single.StepTM]
i:129 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
I:13 [binder, in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
i:13 [binder, in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
i:13 [binder, in Undecidability.Shared.Libs.PSL.Lists.Position]
i:13 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Fin]
i:13 [binder, in Complexity.L.TM.TMunflatten]
i:130 [binder, in Undecidability.L.Tactics.Extract]
i:130 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
i:133 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
i:133 [binder, in Undecidability.TM.Code.NatTM]
i:133 [binder, in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
i:135 [binder, in Undecidability.TM.Single.StepTM]
i:135 [binder, in Undecidability.Shared.Libs.DLW.Utils.sorting]
i:136 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
i:137 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
i:137 [binder, in Undecidability.Shared.Libs.DLW.Vec.pos]
i:139 [binder, in Undecidability.L.Tactics.Extract]
i:14 [binder, in Undecidability.TM.Single.StepTM]
i:14 [binder, in Undecidability.Shared.Libs.DLW.Code.compiler]
i:14 [binder, in Complexity.NP.TM.M_LM2TM]
i:14 [binder, in Complexity.Complexity.SpaceBoundsTime]
i:14 [binder, in Undecidability.TM.Code.Code]
i:14 [binder, in Undecidability.TM.Combinators.SequentialComposition]
i:140 [binder, in Undecidability.TM.Single.StepTM]
i:140 [binder, in Undecidability.TM.Code.NatTM]
i:142 [binder, in Undecidability.Shared.Libs.DLW.Vec.pos]
i:143 [binder, in Undecidability.L.Util.L_facts]
i:143 [binder, in Undecidability.TM.Lifting.LiftTapes]
i:144 [binder, in Undecidability.TM.Lifting.LiftTapes]
i:145 [binder, in Undecidability.L.Util.L_facts]
i:145 [binder, in Undecidability.L.Tactics.Extract]
i:145 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
i:145 [binder, in Undecidability.TM.Lifting.LiftTapes]
i:147 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
i:148 [binder, in Undecidability.TM.Lifting.LiftTapes]
i:15 [binder, in Complexity.L.AbstractMachines.Computable.EvalForTime]
i:15 [binder, in Complexity.L.Functions.IterupN]
i:15 [binder, in Complexity.NP.Clique.Clique]
i:15 [binder, in Complexity.Complexity.SpaceBoundsTime]
i:15 [binder, in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
i:151 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
i:151 [binder, in Undecidability.L.Util.L_facts]
i:153 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
i:154 [binder, in Undecidability.TM.Lifting.LiftTapes]
i:156 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
i:156 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
i:156 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
i:156 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
i:157 [binder, in Undecidability.L.Util.L_facts]
i:159 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
i:159 [binder, in Undecidability.TM.Lifting.LiftTapes]
i:16 [binder, in Undecidability.TM.Single.StepTM]
i:16 [binder, in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
i:16 [binder, in Undecidability.Shared.FinTypeEquiv]
i:16 [binder, in Undecidability.Shared.Libs.DLW.Utils.interval]
i:16 [binder, in Undecidability.Shared.Libs.PSL.Vectors.VectorDupfree]
i:16 [binder, in Undecidability.TM.Code.Code]
i:16 [binder, in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
i:16 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler]
I:16 [binder, in Undecidability.TM.Hoare.HoareExamples]
i:160 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
i:160 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
i:160 [binder, in Undecidability.TM.Lifting.LiftTapes]
i:161 [binder, in Undecidability.L.Util.L_facts]
i:163 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
i:164 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
i:164 [binder, in Undecidability.TM.Lifting.LiftTapes]
i:165 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
i:165 [binder, in Undecidability.TM.Lifting.LiftTapes]
i:166 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
i:166 [binder, in Undecidability.TM.Lifting.LiftTapes]
i:167 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
i:167 [binder, in Undecidability.TM.Lifting.LiftTapes]
i:168 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
i:168 [binder, in Undecidability.TM.Lifting.LiftTapes]
i:169 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
i:169 [binder, in Undecidability.TM.Lifting.LiftTapes]
I:17 [binder, in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
i:17 [binder, in Undecidability.L.Tactics.Lrewrite]
i:17 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
i:17 [binder, in Undecidability.TM.Lifting.LiftTapes]
I:17 [binder, in Complexity.TM.Single.DecodeTape]
i:17 [binder, in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
i:17 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
i:17 [binder, in Undecidability.Shared.Libs.DLW.Code.subcode]
i:170 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
i:170 [binder, in Undecidability.L.Util.L_facts]
i:170 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
i:170 [binder, in Undecidability.TM.Lifting.LiftTapes]
i:171 [binder, in Undecidability.L.Util.L_facts]
i:171 [binder, in Undecidability.TM.Lifting.LiftTapes]
i:171 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
i:172 [binder, in Undecidability.L.Util.L_facts]
i:173 [binder, in Undecidability.L.Util.L_facts]
i:174 [binder, in Undecidability.L.Util.L_facts]
i:174 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
i:174 [binder, in Undecidability.TM.Lifting.LiftTapes]
i:175 [binder, in Undecidability.TM.Lifting.LiftTapes]
i:176 [binder, in Undecidability.TM.Univ.Univ]
i:177 [binder, in Undecidability.TM.Univ.Univ]
i:179 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
i:18 [binder, in Undecidability.TM.Single.StepTM]
i:18 [binder, in Undecidability.Shared.Libs.DLW.Utils.interval]
i:18 [binder, in Undecidability.TM.Combinators.If]
i:18 [binder, in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
i:18 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
i:181 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
i:186 [binder, in Undecidability.L.Util.L_facts]
i:186 [binder, in Undecidability.TM.Univ.Univ]
i:189 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
i:19 [binder, in Complexity.L.AbstractMachines.Computable.UnivDecTime]
i:19 [binder, in Undecidability.Shared.Libs.DLW.Code.compiler]
i:19 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
i:19 [binder, in Undecidability.Shared.Libs.DLW.Code.subcode]
i:19 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler]
I:19 [binder, in Complexity.NP.TM.LM_to_mTM]
i:19 [binder, in Undecidability.L.Prelim.MoreList]
i:191 [binder, in Undecidability.L.Util.L_facts]
i:193 [binder, in Undecidability.TM.Hoare.HoareRegister]
i:194 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
i:196 [binder, in Undecidability.L.Util.L_facts]
i:198 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
i:199 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
i:2 [binder, in Undecidability.TM.Compound.TMTac]
i:2 [binder, in Complexity.L.Functions.IterupN]
i:2 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.VectorFin]
i:2 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Fin]
i:20 [binder, in Undecidability.TM.Single.StepTM]
i:20 [binder, in Undecidability.Shared.FinTypeEquiv]
i:20 [binder, in Undecidability.Shared.Libs.DLW.Utils.interval]
i:20 [binder, in Complexity.L.Functions.IterupN]
I:20 [binder, in Undecidability.TM.Code.WriteValue]
i:20 [binder, in Complexity.NP.TM.M_LM2TM]
i:20 [binder, in Complexity.NP.TM.M_multi2mono]
i:20 [binder, in Undecidability.L.Prelim.MoreList]
i:202 [binder, in Undecidability.L.Util.L_facts]
i:202 [binder, in Undecidability.TM.Hoare.HoareRegister]
i:205 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
i:205 [binder, in Undecidability.L.Tactics.Extract]
i:208 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
i:209 [binder, in Undecidability.L.Tactics.Extract]
i:209 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
i:21 [binder, in Undecidability.TM.Lifting.LiftAlphabet]
i:21 [binder, in Undecidability.L.Prelim.MoreList]
i:210 [binder, in Undecidability.TM.Hoare.HoareRegister]
i:212 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
i:213 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
i:215 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
i:215 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
i:216 [binder, in Undecidability.L.Tactics.Extract]
i:216 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
i:216 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
i:217 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
i:218 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
i:22 [binder, in Undecidability.L.Tactics.GenEncode]
i:22 [binder, in Complexity.L.AbstractMachines.Computable.UnivDecTime]
i:22 [binder, in Complexity.NP.TM.M_multi2mono]
I:22 [binder, in Undecidability.TM.Hoare.HoareExamples]
i:22 [binder, in Undecidability.L.Prelim.MoreList]
i:220 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
i:220 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
i:220 [binder, in Undecidability.TM.Hoare.HoareRegister]
i:221 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
i:221 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
i:222 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
i:222 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
i:222 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
i:223 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
i:223 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
i:224 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
I:224 [binder, in Undecidability.TM.Code.Copy]
i:226 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
i:226 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
i:227 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
i:227 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
i:228 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
i:228 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
i:229 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
i:23 [binder, in Undecidability.Shared.Libs.DLW.Utils.interval]
i:23 [binder, in Undecidability.Shared.Libs.DLW.Code.compiler]
i:23 [binder, in Undecidability.Shared.Libs.DLW.Utils.crt]
i:23 [binder, in Complexity.NP.TM.M_multi2mono]
i:23 [binder, in Undecidability.TM.Combinators.SequentialComposition]
i:23 [binder, in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
i:23 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
i:230 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
i:231 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
I:231 [binder, in Undecidability.TM.Code.Copy]
i:232 [binder, in Undecidability.L.Tactics.Extract]
i:233 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
i:235 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
i:235 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
I:235 [binder, in Undecidability.TM.Hoare.HoareRegister]
i:237 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
I:237 [binder, in Undecidability.TM.Code.Copy]
i:238 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
i:238 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
i:239 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
I:24 [binder, in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
i:24 [binder, in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
i:24 [binder, in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
i:24 [binder, in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
i:24 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
i:240 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
i:241 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
i:242 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
i:244 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
i:244 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
I:244 [binder, in Undecidability.TM.Code.Copy]
i:248 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
i:25 [binder, in Undecidability.TM.L.CompilerBoolFuns.NaryApp]
i:25 [binder, in Undecidability.L.Tactics.Lrewrite]
i:25 [binder, in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
i:25 [binder, in Undecidability.Shared.FinTypeEquiv]
i:25 [binder, in Complexity.L.AbstractMachines.Computable.UnivDecTime]
i:25 [binder, in Undecidability.TM.Lifting.LiftTapes]
i:25 [binder, in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
i:25 [binder, in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
i:25 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
i:250 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
I:250 [binder, in Undecidability.TM.Code.Copy]
i:251 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
I:251 [binder, in Undecidability.TM.Hoare.HoareRegister]
I:257 [binder, in Undecidability.TM.Code.Copy]
i:26 [binder, in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
i:26 [binder, in Undecidability.Shared.Libs.DLW.Utils.crt]
i:26 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Fin]
i:26 [binder, in Complexity.NP.TM.M_LM2TM]
i:26 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
i:26 [binder, in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
i:263 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
I:263 [binder, in Undecidability.TM.Hoare.HoareRegister]
I:263 [binder, in Undecidability.TM.Code.Copy]
i:264 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
i:265 [binder, in Undecidability.TM.Single.StepTM]
i:265 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
i:27 [binder, in Undecidability.TM.Compound.TMTac]
i:27 [binder, in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
i:27 [binder, in Complexity.L.Functions.IterupN]
i:27 [binder, in Undecidability.Shared.Libs.DLW.Code.compiler]
i:27 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
i:27 [binder, in Complexity.NP.TM.M_LM2TM]
i:27 [binder, in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
i:27 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
i:27 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
I:270 [binder, in Undecidability.TM.Code.Copy]
i:271 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
i:272 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
i:273 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
i:275 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
I:276 [binder, in Undecidability.TM.Code.Copy]
i:277 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
I:278 [binder, in Undecidability.TM.Hoare.HoareRegister]
i:279 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
i:28 [binder, in Complexity.L.AbstractMachines.Computable.EvalForTime]
i:28 [binder, in Undecidability.TM.Compound.TMTac]
i:28 [binder, in Complexity.L.AbstractMachines.Computable.UnivDecTime]
i:28 [binder, in Undecidability.TM.Hoare.HoareRegister]
i:28 [binder, in Complexity.NP.TM.M_LM2TM]
i:28 [binder, in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
I:283 [binder, in Undecidability.TM.Code.Copy]
i:283 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
i:285 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
i:2850 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
i:2854 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
i:286 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
i:2863 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
i:287 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
i:2874 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
i:2884 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
I:289 [binder, in Undecidability.TM.Code.Copy]
i:2897 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
i:29 [binder, in Undecidability.TM.Compound.TMTac]
i:29 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds_Loop]
i:29 [binder, in Undecidability.TM.Combinators.If]
i:29 [binder, in Complexity.NP.TM.M_LM2TM]
I:29 [binder, in Undecidability.TM.Hoare.HoareExamples]
i:290 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
I:291 [binder, in Undecidability.TM.Hoare.HoareRegister]
I:296 [binder, in Undecidability.TM.Code.Copy]
i:3 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
i:3 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
i:30 [binder, in Undecidability.TM.L.CompilerBoolFuns.NaryApp]
i:30 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Fin]
i:30 [binder, in Complexity.NP.TM.M_LM2TM]
i:30 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
I:302 [binder, in Undecidability.TM.Code.Copy]
I:307 [binder, in Undecidability.TM.Hoare.HoareRegister]
i:308 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
I:309 [binder, in Undecidability.TM.Code.Copy]
i:31 [binder, in Complexity.L.AbstractMachines.Computable.UnivDecTime]
i:31 [binder, in Complexity.L.TM.TMunflatten]
i:31 [binder, in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
i:313 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
I:314 [binder, in Undecidability.TM.Hoare.HoareRegister]
i:315 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
I:315 [binder, in Undecidability.TM.Code.Copy]
i:32 [binder, in Undecidability.L.Prelim.LoopSum]
i:32 [binder, in Complexity.L.Functions.IterupN]
i:32 [binder, in Undecidability.Shared.Libs.DLW.Code.compiler]
i:32 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
i:320 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
i:321 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
I:321 [binder, in Undecidability.TM.Hoare.HoareRegister]
I:322 [binder, in Undecidability.TM.Code.Copy]
i:326 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
i:33 [binder, in Undecidability.TM.Hoare.HoareRegister]
I:331 [binder, in Undecidability.TM.Hoare.HoareRegister]
i:332 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
i:335 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
i:336 [binder, in Undecidability.TM.Util.TM_facts]
i:339 [binder, in Undecidability.TM.Hoare.HoareRegister]
i:34 [binder, in Complexity.L.AbstractMachines.Computable.EvalForTime]
i:34 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Fin]
i:34 [binder, in Undecidability.TM.Lifting.LiftTapes]
i:341 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
i:341 [binder, in Undecidability.TM.Hoare.HoareRegister]
i:342 [binder, in Undecidability.TM.Hoare.HoareRegister]
i:343 [binder, in Undecidability.TM.Hoare.HoareRegister]
i:347 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
I:349 [binder, in Undecidability.TM.Hoare.HoareRegister]
i:35 [binder, in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
i:35 [binder, in Undecidability.Shared.Libs.PSL.Lists.Position]
i:35 [binder, in Undecidability.Shared.Libs.DLW.Utils.sorting]
I:35 [binder, in Undecidability.TM.Hoare.HoareExamples]
i:352 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
i:355 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
I:356 [binder, in Undecidability.TM.Hoare.HoareRegister]
I:36 [binder, in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
i:36 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds_Loop]
i:36 [binder, in Undecidability.Shared.Libs.DLW.Code.compiler]
i:36 [binder, in Complexity.L.TM.TMunflatten]
i:36 [binder, in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
i:36 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
i:362 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
i:366 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
I:367 [binder, in Undecidability.TM.Hoare.HoareRegister]
i:37 [binder, in Undecidability.L.Tactics.Extract]
i:37 [binder, in Undecidability.L.Tactics.GenEncode]
i:37 [binder, in Undecidability.Shared.Libs.DLW.Utils.sorting]
i:37 [binder, in Undecidability.TM.Hoare.HoareRegister]
i:37 [binder, in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
i:37 [binder, in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
i:37 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
i:37 [binder, in Undecidability.Shared.Libs.DLW.Code.subcode]
i:370 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
i:372 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
i:377 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
i:377 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
i:379 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
i:38 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Fin]
i:38 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
i:38 [binder, in Complexity.L.TM.TMunflatten]
i:38 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
I:38 [binder, in Undecidability.TM.Lifting.LiftTapes]
i:38 [binder, in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
i:38 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
i:381 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
I:381 [binder, in Undecidability.TM.Hoare.HoareRegister]
i:383 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
i:385 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
i:39 [binder, in Undecidability.Shared.Libs.PSL.Lists.Position]
i:39 [binder, in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
i:39 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
i:391 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
i:392 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
i:392 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
i:393 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
i:396 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
I:396 [binder, in Undecidability.TM.Hoare.HoareRegister]
i:398 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
i:399 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
i:4 [binder, in Complexity.L.AbstractMachines.Computable.EvalForTime]
i:4 [binder, in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
i:4 [binder, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
i:4 [binder, in Undecidability.Shared.embed_nat]
i:4 [binder, in Complexity.Complexity.SpaceBoundsTime]
I:4 [binder, in Undecidability.TM.Lifting.LiftTapes]
i:4 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
i:40 [binder, in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
i:40 [binder, in Undecidability.Shared.Libs.DLW.Code.subcode]
i:400 [binder, in Undecidability.TM.Single.StepTM]
i:404 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
i:406 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
i:408 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
i:41 [binder, in Undecidability.TM.Single.StepTM]
i:41 [binder, in Undecidability.TM.Lifting.LiftTapes]
i:41 [binder, in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
i:411 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
i:412 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
i:413 [binder, in Undecidability.TM.Single.StepTM]
I:414 [binder, in Undecidability.TM.Hoare.HoareRegister]
i:415 [binder, in Undecidability.TM.Single.StepTM]
i:416 [binder, in Undecidability.TM.Single.StepTM]
i:417 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
i:418 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
i:419 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
i:42 [binder, in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
i:42 [binder, in Undecidability.TM.Code.NatTM]
i:42 [binder, in Undecidability.Shared.Libs.DLW.Utils.sorting]
i:42 [binder, in Undecidability.TM.Hoare.HoareRegister]
i:42 [binder, in Undecidability.TM.Lifting.LiftTapes]
i:420 [binder, in Undecidability.TM.Single.StepTM]
i:420 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
i:427 [binder, in Undecidability.TM.Single.StepTM]
i:428 [binder, in Undecidability.TM.Single.StepTM]
i:429 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
i:43 [binder, in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
i:43 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
i:43 [binder, in Undecidability.L.Functions.UnboundIteration]
i:43 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
i:43 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.CC]
i:430 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
i:431 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
i:432 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
i:434 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
i:436 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
i:437 [binder, in Undecidability.TM.Single.StepTM]
i:437 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
i:438 [binder, in Undecidability.TM.Single.StepTM]
i:439 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
i:44 [binder, in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
i:44 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
i:44 [binder, in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
i:441 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
i:442 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
i:443 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
i:444 [binder, in Undecidability.TM.Single.StepTM]
i:444 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
I:449 [binder, in Undecidability.TM.Hoare.HoareRegister]
i:45 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
i:45 [binder, in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
i:450 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
i:451 [binder, in Undecidability.TM.Single.StepTM]
i:451 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
i:453 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
i:454 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
I:455 [binder, in Undecidability.TM.Hoare.HoareRegister]
i:456 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
i:458 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
i:459 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
i:46 [binder, in Undecidability.TM.Single.StepTM]
i:46 [binder, in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
i:46 [binder, in Undecidability.Shared.Libs.DLW.Utils.sorting]
i:46 [binder, in Complexity.NP.Clique.kSAT_to_Clique]
i:46 [binder, in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
i:460 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
i:461 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
i:463 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
i:468 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
i:469 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
i:47 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
i:47 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
i:47 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
i:47 [binder, in Undecidability.TM.Hoare.HoareRegister]
i:470 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
i:471 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
i:473 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
i:48 [binder, in Undecidability.TM.Util.VectorPrelim]
i:48 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
i:48 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
I:48 [binder, in Undecidability.TM.Lifting.LiftTapes]
i:48 [binder, in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
i:49 [binder, in Undecidability.L.Tactics.Lrewrite]
i:49 [binder, in Undecidability.Shared.Libs.DLW.Utils.sorting]
i:49 [binder, in Undecidability.TM.Lifting.LiftTapes]
i:49 [binder, in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
i:5 [binder, in Undecidability.L.Tactics.Extract]
I:5 [binder, in Complexity.TM.Code.DecodeList]
i:5 [binder, in Undecidability.Shared.Libs.DLW.Utils.interval]
I:5 [binder, in Undecidability.TM.Code.WriteValue]
I:5 [binder, in Complexity.TM.Code.DecodeBool]
i:5 [binder, in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
i:5 [binder, in Undecidability.Shared.Libs.DLW.Code.subcode]
i:5 [binder, in Undecidability.Shared.Libs.DLW.Vec.pos]
i:5 [binder, in Undecidability.TM.Code.ProgrammingTools]
i:50 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
i:50 [binder, in Undecidability.TM.Single.StepTM]
i:50 [binder, in Undecidability.L.Tactics.Extract]
i:50 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
i:50 [binder, in Undecidability.L.Functions.UnboundIteration]
i:50 [binder, in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
i:50 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
i:52 [binder, in Undecidability.TM.Util.VectorPrelim]
i:52 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
i:52 [binder, in Complexity.NP.Clique.kSAT_to_Clique]
i:53 [binder, in Complexity.L.AbstractMachines.Computable.EvalForTime]
i:53 [binder, in Undecidability.TM.Single.StepTM]
I:53 [binder, in Undecidability.TM.Lifting.LiftTapes]
i:54 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
i:54 [binder, in Undecidability.Shared.Libs.PSL.Vectors.VectorDupfree]
i:54 [binder, in Undecidability.TM.Lifting.LiftTapes]
i:54 [binder, in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
i:54 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.CC]
i:55 [binder, in Undecidability.L.Tactics.Lrewrite]
i:55 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
i:55 [binder, in Complexity.NP.Clique.kSAT_to_Clique]
i:55 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
i:56 [binder, in Undecidability.TM.Single.StepTM]
i:56 [binder, in Undecidability.Shared.Libs.DLW.Utils.sorting]
i:57 [binder, in Undecidability.Shared.Libs.DLW.Code.subcode]
i:58 [binder, in Undecidability.TM.Combinators.Switch]
i:58 [binder, in Undecidability.Shared.Libs.PSL.Vectors.VectorDupfree]
I:58 [binder, in Undecidability.TM.Lifting.LiftTapes]
i:58 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler]
i:59 [binder, in Undecidability.TM.Single.StepTM]
i:59 [binder, in Undecidability.TM.Lifting.LiftTapes]
i:59 [binder, in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
i:59 [binder, in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
i:6 [binder, in Undecidability.L.Tactics.Lrewrite]
i:6 [binder, in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
i:6 [binder, in Complexity.L.Functions.IterupN]
i:6 [binder, in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
i:6 [binder, in Undecidability.TM.Code.ProgrammingTools]
i:60 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
i:60 [binder, in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
i:60 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
i:61 [binder, in Undecidability.L.Tactics.Lrewrite]
I:61 [binder, in Complexity.TM.Code.Decode]
i:61 [binder, in Complexity.NP.TM.M_multi2mono]
i:61 [binder, in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
i:62 [binder, in Undecidability.TM.Single.StepTM]
i:62 [binder, in Undecidability.Shared.Libs.DLW.Utils.sorting]
i:62 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
i:62 [binder, in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
i:62 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
i:63 [binder, in Undecidability.Shared.Libs.DLW.Utils.sorting]
I:63 [binder, in Undecidability.TM.Lifting.LiftTapes]
i:63 [binder, in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
i:63 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
i:63 [binder, in Undecidability.Shared.Libs.DLW.Code.subcode]
i:64 [binder, in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
i:64 [binder, in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
I:64 [binder, in Undecidability.Shared.Libs.DLW.Code.subcode]
i:65 [binder, in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
i:65 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
i:65 [binder, in Undecidability.TM.Single.StepTM]
i:66 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
i:66 [binder, in Undecidability.TM.Lifting.LiftTapes]
i:66 [binder, in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
i:66 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
i:67 [binder, in Undecidability.Shared.Libs.DLW.Utils.sorting]
i:67 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
i:67 [binder, in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
i:67 [binder, in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
i:68 [binder, in Undecidability.TM.Single.StepTM]
i:68 [binder, in Undecidability.TM.Combinators.Switch]
i:68 [binder, in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
i:68 [binder, in Undecidability.Shared.Libs.DLW.Code.subcode]
i:69 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
i:69 [binder, in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
i:69 [binder, in Complexity.NP.Clique.kSAT_to_Clique]
i:69 [binder, in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
I:69 [binder, in Undecidability.Shared.Libs.DLW.Code.subcode]
i:7 [binder, in Undecidability.L.Tactics.GenEncode]
i:7 [binder, in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
i:7 [binder, in Undecidability.Shared.Libs.DLW.Code.subcode]
i:7 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler]
i:70 [binder, in Undecidability.TM.Single.StepTM]
i:70 [binder, in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
i:71 [binder, in Undecidability.Shared.Libs.DLW.Utils.sorting]
i:71 [binder, in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
i:71 [binder, in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
i:71 [binder, in Undecidability.Shared.Libs.DLW.Code.subcode]
i:72 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
i:72 [binder, in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
i:72 [binder, in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
i:72 [binder, in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
i:73 [binder, in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
i:73 [binder, in Undecidability.L.Tactics.GenEncode]
i:73 [binder, in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
i:74 [binder, in Undecidability.TM.Single.StepTM]
i:74 [binder, in Undecidability.L.Tactics.Extract]
i:74 [binder, in Undecidability.Shared.Libs.DLW.Utils.sorting]
i:74 [binder, in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
I:75 [binder, in Undecidability.TM.Lifting.LiftTapes]
i:76 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
i:76 [binder, in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
i:76 [binder, in Undecidability.Shared.Libs.DLW.Code.subcode]
i:77 [binder, in Undecidability.TM.Single.StepTM]
i:77 [binder, in Undecidability.Shared.Libs.DLW.Utils.sorting]
i:78 [binder, in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
i:78 [binder, in Undecidability.L.Tactics.LClos]
i:78 [binder, in Undecidability.TM.Lifting.LiftTapes]
i:78 [binder, in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
i:79 [binder, in Undecidability.TM.Single.StepTM]
i:79 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
i:8 [binder, in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
i:8 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Fin]
i:8 [binder, in Complexity.L.TM.TMunflatten]
I:8 [binder, in Complexity.TM.Single.DecodeTapes]
i:80 [binder, in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
i:80 [binder, in Undecidability.Shared.Libs.DLW.Utils.sorting]
I:80 [binder, in Undecidability.TM.Lifting.LiftTapes]
i:80 [binder, in Undecidability.Shared.Libs.DLW.Code.subcode]
i:80 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
i:81 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
i:81 [binder, in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
i:81 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
i:83 [binder, in Undecidability.TM.Lifting.LiftTapes]
i:83 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
i:84 [binder, in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
i:84 [binder, in Undecidability.Shared.Libs.DLW.Utils.sorting]
I:84 [binder, in Undecidability.TM.Lifting.LiftTapes]
i:84 [binder, in Undecidability.Shared.Libs.DLW.Code.subcode]
i:85 [binder, in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
I:85 [binder, in Undecidability.Shared.Libs.DLW.Code.subcode]
I:87 [binder, in Undecidability.TM.Lifting.LiftTapes]
i:88 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
i:9 [binder, in Undecidability.TM.Single.StepTM]
i:9 [binder, in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
i:9 [binder, in Undecidability.Shared.FinTypeEquiv]
i:9 [binder, in Undecidability.Shared.Libs.DLW.Utils.interval]
i:9 [binder, in Undecidability.L.Complexity.ResourceMeasures]
i:9 [binder, in Undecidability.Shared.Libs.DLW.Utils.binomial]
I:9 [binder, in Undecidability.TM.Lifting.LiftTapes]
i:9 [binder, in Undecidability.Shared.Libs.DLW.Code.subcode]
I:9 [binder, in Undecidability.TM.Hoare.HoareExamples]
i:9 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
i:90 [binder, in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
i:90 [binder, in Undecidability.TM.Lifting.LiftTapes]
i:91 [binder, in Undecidability.Shared.Libs.DLW.Utils.sorting]
i:92 [binder, in Complexity.NP.Clique.kSAT_to_Clique]
i:92 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.CC]
i:93 [binder, in Undecidability.Shared.Libs.DLW.Utils.sorting]
i:93 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
i:94 [binder, in Complexity.NP.Clique.kSAT_to_Clique]
i:95 [binder, in Undecidability.L.Complexity.ResourceMeasures]
i:95 [binder, in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
i:96 [binder, in Complexity.NP.Clique.kSAT_to_Clique]
i:96 [binder, in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
i:96 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
i:97 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
i:98 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
i:99 [binder, in Undecidability.L.Tactics.Extract]
i:99 [binder, in Complexity.NP.Clique.kSAT_to_Clique]

J

Join [section, in Undecidability.Shared.Libs.PSL.Retracts]
join [definition, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
joinable [definition, in Undecidability.L.Prelim.ARS]
join_extension_formula_sat [lemma, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
join_extension_cnf_sat [lemma, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
join_extension_clause_sat [lemma, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
join_extension_literal_sat [lemma, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
join_extension_var_sat [lemma, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
Join.A [variable, in Undecidability.Shared.Libs.PSL.Retracts]
Join.B [variable, in Undecidability.Shared.Libs.PSL.Retracts]
Join.disjoint [variable, in Undecidability.Shared.Libs.PSL.Retracts]
Join.retr1 [variable, in Undecidability.Shared.Libs.PSL.Retracts]
Join.retr2 [variable, in Undecidability.Shared.Libs.PSL.Retracts]
Join.Z [variable, in Undecidability.Shared.Libs.PSL.Retracts]
jumpTarget [definition, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
jumpTarget [definition, in Undecidability.L.AbstractMachines.FlatPro.Programs]
JumpTarget [definition, in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
JumpTargetTM [library]
JumpTarget_steps_nice.JumpTarget_steps_nice [lemma, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
JumpTarget_steps_nice.JumpTarget_Loop_steps_nice [lemma, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
JumpTarget_steps_nice.JumpTarget_Step_steps_nice' [lemma, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
JumpTarget_steps_nice.JumpTarget_Step_steps_nice [lemma, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
JumpTarget_steps_nice.JumpTarget_Step_steps_CaseList_nice [lemma, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
JumpTarget_steps_nice.JumpTarget_Step_steps_CaseCom_nice [lemma, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
JumpTarget_steps_nice.App_Com_steps_nice [lemma, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
JumpTarget_steps_nice.App_ACom_steps_nice [lemma, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
JumpTarget_steps_nice.App_steps_nice [lemma, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
JumpTarget_steps_nice [module, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
jumpTarget_correct [lemma, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
jumpTarget_eq [lemma, in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisStep]
jumpTarget_correct [lemma, in Undecidability.L.AbstractMachines.FlatPro.Programs]
JumpTarget_Terminates [lemma, in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
JumpTarget_T [definition, in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
JumpTarget_steps [definition, in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
JumpTarget_Realise [lemma, in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
JumpTarget_Rel [definition, in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
JumpTarget_size [definition, in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
JumpTarget_Loop_Terminates [lemma, in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
JumpTarget_Loop_T [definition, in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
JumpTarget_Loop_steps [definition, in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
JumpTarget_Loop_Realise [lemma, in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
JumpTarget_Loop_Rel [definition, in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
JumpTarget_Loop_size [definition, in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
JumpTarget_Loop [definition, in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
jumpTarget_k [definition, in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
JumpTarget_Step_Terminates [lemma, in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
JumpTarget_Step_T [definition, in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
JumpTarget_Step_steps [definition, in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
JumpTarget_Step_steps_CaseList [definition, in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
JumpTarget_Step_steps_CaseCom [definition, in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
JumpTarget_Step_Realise [lemma, in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
JumpTarget_Step_Rel [definition, in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
JumpTarget_Step_size [definition, in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
JumpTarget_Step [definition, in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
j':2763 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
j1:387 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
j1:64 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
j1:78 [binder, in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
j1:82 [binder, in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
j2:389 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
j2:66 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
j2:80 [binder, in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
j2:84 [binder, in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
j2:94 [binder, in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
j:10 [binder, in Undecidability.Shared.Libs.DLW.Utils.interval]
j:10 [binder, in Undecidability.L.Complexity.ResourceMeasures]
j:100 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.CC]
j:101 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.CC]
j:102 [binder, in Undecidability.Shared.Libs.DLW.Utils.sorting]
j:102 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.CC]
j:103 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.CC]
j:104 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.CC]
j:106 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
j:109 [binder, in Undecidability.L.Tactics.LClos]
j:11 [binder, in Undecidability.L.Tactics.Lbeta]
j:110 [binder, in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
j:112 [binder, in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
j:127 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
j:13 [binder, in Undecidability.Shared.Libs.DLW.Utils.interval]
j:13 [binder, in Undecidability.Shared.Libs.DLW.Utils.sorting]
j:136 [binder, in Undecidability.Shared.Libs.DLW.Utils.sorting]
j:144 [binder, in Undecidability.L.Util.L_facts]
j:16 [binder, in Undecidability.Shared.Libs.DLW.Code.compiler]
j:18 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
j:187 [binder, in Undecidability.L.Util.L_facts]
j:19 [binder, in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
j:191 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
j:192 [binder, in Undecidability.L.Util.L_facts]
j:197 [binder, in Undecidability.L.Util.L_facts]
j:20 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
j:203 [binder, in Undecidability.L.Util.L_facts]
j:21 [binder, in Undecidability.Shared.Libs.DLW.Utils.interval]
j:21 [binder, in Undecidability.Shared.Libs.DLW.Utils.sorting]
j:216 [binder, in Undecidability.L.Util.L_facts]
j:217 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
j:22 [binder, in Undecidability.Shared.Libs.DLW.Code.compiler]
j:22 [binder, in Undecidability.Shared.Libs.DLW.Utils.sorting]
j:221 [binder, in Undecidability.L.Util.L_facts]
j:23 [binder, in Undecidability.Shared.Libs.DLW.Utils.sorting]
j:24 [binder, in Undecidability.Shared.Libs.DLW.Utils.interval]
j:24 [binder, in Undecidability.Shared.Libs.DLW.Utils.crt]
j:24 [binder, in Undecidability.Shared.Libs.DLW.Utils.sorting]
j:24 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
j:245 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
j:25 [binder, in Undecidability.Shared.Libs.DLW.Code.compiler]
j:25 [binder, in Undecidability.Shared.Libs.DLW.Utils.sorting]
j:25 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
j:252 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
j:26 [binder, in Undecidability.Shared.Libs.DLW.Utils.sorting]
j:266 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
j:2671 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
j:2672 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
j:27 [binder, in Undecidability.Shared.Libs.DLW.Utils.crt]
j:27 [binder, in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
j:2760 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
j:28 [binder, in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
j:2849 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
j:2853 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
j:2862 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
j:2873 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
j:2883 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
j:2896 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
j:29 [binder, in Undecidability.Shared.Libs.DLW.Code.compiler]
j:29 [binder, in Undecidability.Shared.Libs.DLW.Utils.sorting]
j:29 [binder, in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
j:30 [binder, in Undecidability.Shared.Libs.DLW.Utils.sorting]
j:30 [binder, in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
j:31 [binder, in Undecidability.Shared.Libs.DLW.Utils.sorting]
j:31 [binder, in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
j:314 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
j:32 [binder, in Undecidability.Shared.Libs.DLW.Utils.sorting]
j:322 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
j:336 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
j:342 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
j:35 [binder, in Undecidability.Shared.Libs.DLW.Code.compiler]
j:352 [binder, in Undecidability.TM.Hoare.HoareRegister]
j:353 [binder, in Undecidability.TM.Hoare.HoareRegister]
j:36 [binder, in Undecidability.Shared.Libs.DLW.Utils.sorting]
j:367 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
j:371 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
j:378 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
j:38 [binder, in Undecidability.Shared.Libs.DLW.Code.compiler]
j:384 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
j:384 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
j:397 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
j:399 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
j:4 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
j:40 [binder, in Undecidability.Shared.Libs.DLW.Utils.sorting]
j:409 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
j:42 [binder, in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
j:421 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
j:43 [binder, in Undecidability.Shared.Libs.DLW.Code.compiler]
j:43 [binder, in Undecidability.Shared.Libs.DLW.Utils.sorting]
j:433 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
j:435 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
j:452 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
j:46 [binder, in Undecidability.Shared.Libs.DLW.Code.compiler]
j:472 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
j:474 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
j:49 [binder, in Undecidability.Shared.Libs.DLW.Code.compiler]
j:49 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
j:5 [binder, in Undecidability.L.Tactics.LClos_Eval]
j:50 [binder, in Undecidability.Shared.Libs.DLW.Code.compiler]
j:50 [binder, in Undecidability.Shared.Libs.DLW.Utils.sorting]
j:50 [binder, in Undecidability.TM.Lifting.LiftTapes]
j:55 [binder, in Undecidability.Shared.Libs.DLW.Code.compiler]
j:55 [binder, in Undecidability.TM.Lifting.LiftTapes]
j:56 [binder, in Undecidability.L.Tactics.Lrewrite]
j:56 [binder, in Undecidability.Shared.Libs.DLW.Code.compiler]
j:56 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
j:57 [binder, in Undecidability.Shared.Libs.DLW.Utils.sorting]
j:59 [binder, in Undecidability.Shared.Libs.PSL.Vectors.VectorDupfree]
j:60 [binder, in Undecidability.Shared.Libs.DLW.Code.subcode]
j:61 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
j:62 [binder, in Undecidability.L.Tactics.Lrewrite]
j:64 [binder, in Undecidability.Shared.Libs.DLW.Utils.sorting]
j:65 [binder, in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
j:65 [binder, in Undecidability.Shared.Libs.DLW.Code.subcode]
J:66 [binder, in Undecidability.Shared.Libs.DLW.Code.subcode]
j:7 [binder, in Undecidability.L.Tactics.Lrewrite]
j:70 [binder, in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
j:72 [binder, in Undecidability.Shared.Libs.DLW.Code.subcode]
j:73 [binder, in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
j:75 [binder, in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
j:77 [binder, in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
j:77 [binder, in Undecidability.Shared.Libs.DLW.Code.subcode]
j:79 [binder, in Undecidability.L.Tactics.LClos]
j:79 [binder, in Undecidability.TM.Lifting.LiftTapes]
j:81 [binder, in Undecidability.Shared.Libs.DLW.Code.subcode]
j:81 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
j:92 [binder, in Undecidability.Shared.Libs.DLW.Utils.sorting]
j:94 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.CC]
j:96 [binder, in Undecidability.L.Complexity.ResourceMeasures]
j:96 [binder, in Undecidability.Shared.Libs.DLW.Utils.sorting]
j:97 [binder, in Undecidability.Shared.Libs.DLW.Utils.sorting]
j:97 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.CC]
j:98 [binder, in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
j:98 [binder, in Undecidability.L.Tactics.Reflection]
j:98 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.CC]
j:99 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
j:99 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.CC]

K

K [definition, in Undecidability.L.Util.L_facts]
k [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
kCNF [inductive, in Complexity.NP.SAT.kSAT]
kCNFB [constructor, in Complexity.NP.SAT.kSAT]
kCNFS [constructor, in Complexity.NP.SAT.kSAT]
kCNF_decb_poly [lemma, in Complexity.NP.SAT.kSAT]
kCNF_decb_time_bound [lemma, in Complexity.NP.SAT.kSAT]
kCNF_decb_time [definition, in Complexity.NP.SAT.kSAT]
kCNF_decb_iff [lemma, in Complexity.NP.SAT.kSAT]
kCNF_decb [definition, in Complexity.NP.SAT.kSAT]
kCNF_app [lemma, in Complexity.NP.SAT.kSAT]
kCNF_clause_length [lemma, in Complexity.NP.SAT.kSAT]
key:137 [binder, in Undecidability.TM.Univ.LowLevel]
kflat [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
kflat_poly [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
kflat_time_bound [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
kflat_time [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
kflat_k_eq [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
knowsFirstSymbols [definition, in Undecidability.TM.Single.StepTM]
knowsFirstSymbols_all' [lemma, in Undecidability.TM.Single.StepTM]
knowsFirstSymbols_all [lemma, in Undecidability.TM.Single.StepTM]
knowsFirstSymbols_nil [lemma, in Undecidability.TM.Single.StepTM]
kn:503 [binder, in Undecidability.TM.Single.StepTM]
kSAT [definition, in Complexity.NP.SAT.kSAT]
kSAT [library]
kSAT_to_FlatClique [lemma, in Complexity.NP.SAT.CookLevin]
kSAT_reduces_to_Clique [lemma, in Complexity.NP.Clique.kSAT_to_Clique]
kSAT_to_SAT [lemma, in Complexity.NP.SAT.kSAT_to_SAT]
kSAT_to_FlatClique_poly [lemma, in Complexity.NP.Clique.kSAT_to_FlatClique]
kSAT_reduces_to_FlatClique [lemma, in Complexity.NP.Clique.kSAT_to_FlatClique]
kSAT_to_SAT [library]
kSAT_to_Clique [library]
kSAT_to_FlatClique [library]
K_proc [lemma, in Undecidability.L.Tactics.Lsimpl]
k_M:475 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
k_MU:472 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
k_M':431 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
k_M:430 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
k_M':421 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
k_M:387 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
k_M:381 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
k_M:315 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
k_Univ:270 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
k_M:266 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
k_M:258 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
k__steps:81 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
k__steps:53 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
k__sim:17 [binder, in Complexity.NP.TM.M_multi2mono]
k__steps:97 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler]
k__LM:604 [binder, in Complexity.NP.TM.LM_to_mTM]
k__LM:599 [binder, in Complexity.NP.TM.LM_to_mTM]
k__LM:38 [binder, in Complexity.NP.TM.LM_to_mTM]
k':104 [binder, in Undecidability.TM.Hoare.HoareLogic]
k':11 [binder, in Complexity.NP.L.LMGenNP]
k':1113 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
k':1120 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
k':117 [binder, in Undecidability.TM.Univ.Univ]
k':124 [binder, in Undecidability.TM.Univ.Univ]
k':128 [binder, in Undecidability.TM.Univ.Univ]
k':132 [binder, in Undecidability.L.Tactics.ComputableTime]
k':132 [binder, in Undecidability.TM.Univ.Univ]
k':136 [binder, in Undecidability.TM.Univ.Univ]
k':137 [binder, in Undecidability.TM.Hoare.HoareLogic]
k':140 [binder, in Undecidability.TM.Lifting.LiftTapes]
k':140 [binder, in Undecidability.TM.Univ.Univ]
k':144 [binder, in Undecidability.TM.Univ.Univ]
k':148 [binder, in Undecidability.TM.Univ.Univ]
k':15 [binder, in Complexity.L.AbstractMachines.Computable.HeapMachine]
k':152 [binder, in Undecidability.TM.Univ.Univ]
k':156 [binder, in Undecidability.TM.Univ.Univ]
k':16 [binder, in Complexity.NP.TM.M_multi2mono]
k':160 [binder, in Undecidability.TM.Univ.Univ]
k':165 [binder, in Undecidability.L.Util.L_facts]
k':169 [binder, in Undecidability.L.Util.L_facts]
k':17 [binder, in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
k':18 [binder, in Complexity.TM.Code.DecodeList]
k':18 [binder, in Complexity.L.AbstractMachines.Computable.HeapMachine]
k':183 [binder, in Undecidability.TM.Univ.Univ]
k':185 [binder, in Undecidability.TM.Hoare.HoareRegister]
k':187 [binder, in Undecidability.TM.Hoare.HoareRegister]
k':2 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.SingleTMGenNP]
k':214 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
k':215 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
k':218 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
k':219 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
k':23 [binder, in Undecidability.TM.Combinators.While]
k':288 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
k':303 [binder, in Undecidability.TM.Util.TM_facts]
k':317 [binder, in Undecidability.TM.Util.TM_facts]
k':323 [binder, in Undecidability.TM.Util.TM_facts]
k':37 [binder, in Undecidability.TM.Hoare.HoareLogic]
k':399 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
k':404 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
k':408 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
k':412 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
k':414 [binder, in Undecidability.TM.Hoare.HoareCombinators]
k':417 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
k':422 [binder, in Undecidability.TM.Hoare.HoareCombinators]
k':44 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler]
k':50 [binder, in Undecidability.TM.Combinators.StateWhile]
k':50 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler]
k':517 [binder, in Undecidability.TM.Single.StepTM]
k':53 [binder, in Complexity.NP.TM.M_multi2mono]
k':56 [binder, in Undecidability.TM.Util.VectorPrelim]
k':57 [binder, in Undecidability.L.Functions.UnboundIteration]
k':6 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.SingleTMGenNP]
k':69 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
k':7 [binder, in Complexity.L.AbstractMachines.Computable.Lookup]
k':75 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
k':79 [binder, in Complexity.TM.Code.Decode]
k':801 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
k':803 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
k':806 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
k':809 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
k':812 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
k':816 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
k':819 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
k':822 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
k':826 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
k':835 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
k':839 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
k':843 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
k':847 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
k':85 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachine]
k':852 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
k':856 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
k':86 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachine]
k':866 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
k':874 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
k':879 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
k':947 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
k':951 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
k':956 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
k':961 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
k0:23 [binder, in Undecidability.L.TM.TMinL]
k0:24 [binder, in Undecidability.L.TM.TMinL]
k0:54 [binder, in Undecidability.L.Functions.UnboundIteration]
k1:10 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
k1:10 [binder, in Undecidability.TM.Util.Prelim]
k1:112 [binder, in Undecidability.TM.Combinators.StateWhile]
k1:140 [binder, in Undecidability.TM.Util.Relations]
k1:152 [binder, in Undecidability.TM.Hoare.HoareCombinators]
k1:157 [binder, in Undecidability.TM.Combinators.StateWhile]
k1:17 [binder, in Undecidability.TM.Combinators.While]
k1:171 [binder, in Undecidability.TM.Hoare.HoareCombinators]
k1:184 [binder, in Undecidability.TM.Hoare.HoareCombinators]
k1:200 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
k1:205 [binder, in Undecidability.L.Util.L_facts]
k1:205 [binder, in Undecidability.TM.Hoare.HoareCombinators]
k1:206 [binder, in Undecidability.TM.Hoare.HoareLogic]
k1:208 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
k1:214 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
k1:218 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
k1:221 [binder, in Undecidability.TM.Hoare.HoareCombinators]
k1:224 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
k1:229 [binder, in Undecidability.TM.Hoare.HoareLogic]
k1:23 [binder, in Undecidability.TM.Util.Prelim]
k1:239 [binder, in Undecidability.TM.Hoare.HoareCombinators]
k1:252 [binder, in Undecidability.TM.Hoare.HoareCombinators]
k1:274 [binder, in Undecidability.TM.Hoare.HoareCombinators]
k1:28 [binder, in Undecidability.TM.Combinators.While]
k1:287 [binder, in Undecidability.TM.Hoare.HoareCombinators]
k1:30 [binder, in Undecidability.TM.Combinators.SequentialComposition]
k1:303 [binder, in Undecidability.TM.Hoare.HoareCombinators]
k1:33 [binder, in Undecidability.TM.Combinators.While]
k1:34 [binder, in Undecidability.TM.Combinators.Switch]
k1:39 [binder, in Undecidability.TM.Combinators.If]
k1:46 [binder, in Undecidability.TM.Combinators.Switch]
k1:51 [binder, in Undecidability.TM.Combinators.While]
k1:51 [binder, in Undecidability.TM.Util.Prelim]
k1:59 [binder, in Undecidability.TM.Util.Prelim]
k1:6 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
k1:61 [binder, in Undecidability.TM.Combinators.While]
k1:61 [binder, in Undecidability.TM.Combinators.StateWhile]
k1:63 [binder, in Undecidability.TM.Combinators.StateWhile]
k1:65 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
k1:76 [binder, in Undecidability.TM.Combinators.Switch]
k1:79 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachine]
k1:90 [binder, in Undecidability.TM.Combinators.While]
k1:91 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
k1:98 [binder, in Undecidability.TM.Combinators.StateWhile]
k2':159 [binder, in Undecidability.TM.Hoare.HoareCombinators]
k2':41 [binder, in Undecidability.TM.Combinators.Switch]
k22':216 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
k22':217 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
k22':87 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachine]
k22':88 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachine]
k2:103 [binder, in Undecidability.TM.Combinators.StateWhile]
k2:11 [binder, in Undecidability.TM.Util.Prelim]
k2:117 [binder, in Undecidability.TM.Combinators.StateWhile]
k2:13 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
k2:141 [binder, in Undecidability.TM.Util.Relations]
k2:153 [binder, in Undecidability.TM.Hoare.HoareCombinators]
k2:161 [binder, in Undecidability.TM.Combinators.StateWhile]
k2:172 [binder, in Undecidability.TM.Hoare.HoareCombinators]
k2:18 [binder, in Undecidability.TM.Combinators.While]
k2:185 [binder, in Undecidability.TM.Hoare.HoareCombinators]
k2:201 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
k2:206 [binder, in Undecidability.L.Util.L_facts]
k2:206 [binder, in Undecidability.TM.Hoare.HoareCombinators]
k2:207 [binder, in Undecidability.TM.Hoare.HoareLogic]
k2:209 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
k2:215 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
k2:219 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
k2:222 [binder, in Undecidability.TM.Hoare.HoareCombinators]
k2:225 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
k2:230 [binder, in Undecidability.TM.Hoare.HoareLogic]
k2:24 [binder, in Undecidability.TM.Util.Prelim]
k2:240 [binder, in Undecidability.TM.Hoare.HoareCombinators]
k2:253 [binder, in Undecidability.TM.Hoare.HoareCombinators]
k2:275 [binder, in Undecidability.TM.Hoare.HoareCombinators]
k2:288 [binder, in Undecidability.TM.Hoare.HoareCombinators]
k2:29 [binder, in Undecidability.TM.Combinators.While]
k2:31 [binder, in Undecidability.TM.Combinators.SequentialComposition]
k2:35 [binder, in Undecidability.TM.Combinators.Switch]
k2:38 [binder, in Undecidability.TM.Combinators.Switch]
k2:40 [binder, in Undecidability.TM.Combinators.If]
k2:48 [binder, in Undecidability.TM.Combinators.Switch]
k2:52 [binder, in Undecidability.TM.Util.Prelim]
k2:55 [binder, in Undecidability.TM.Combinators.While]
k2:61 [binder, in Undecidability.TM.Util.Prelim]
k2:62 [binder, in Undecidability.TM.Combinators.StateWhile]
k2:63 [binder, in Undecidability.TM.Combinators.While]
k2:64 [binder, in Undecidability.TM.Combinators.StateWhile]
k2:66 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
k2:7 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
k2:77 [binder, in Undecidability.TM.Combinators.Switch]
k2:80 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachine]
k2:92 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
k2:94 [binder, in Undecidability.TM.Combinators.While]
k3:207 [binder, in Undecidability.TM.Hoare.HoareCombinators]
k3:223 [binder, in Undecidability.TM.Hoare.HoareCombinators]
k3:241 [binder, in Undecidability.TM.Hoare.HoareCombinators]
k3:41 [binder, in Undecidability.TM.Combinators.If]
k:1 [binder, in Undecidability.TM.L.CompilerBoolFuns.NaryApp]
k:1 [binder, in Undecidability.TM.L.CompilerBoolFuns.LComp_to_TMComp]
k:1 [binder, in Complexity.NP.SAT.kSAT]
k:1 [binder, in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
k:1 [binder, in Undecidability.L.Functions.Proc]
k:1 [binder, in Complexity.NP.SAT.kSAT_to_SAT]
k:10 [binder, in Complexity.NP.SAT.CookLevin.Reductions.TCC_to_CC]
k:10 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
k:10 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
k:10 [binder, in Undecidability.L.Datatypes.List.List_extra]
k:10 [binder, in Undecidability.Shared.Libs.DLW.Utils.list_bool]
k:10 [binder, in Complexity.NP.Clique.FlatClique]
k:10 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
k:10 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
k:10 [binder, in Undecidability.TM.Hoare.HoareCombinators]
k:10 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
k:100 [binder, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
k:100 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
k:100 [binder, in Undecidability.L.Complexity.ResourceMeasures]
k:100 [binder, in Undecidability.TM.Univ.LowLevel]
k:100 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
k:100 [binder, in Complexity.NP.Clique.kSAT_to_FlatClique]
k:101 [binder, in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
k:101 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
k:102 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
k:102 [binder, in Undecidability.TM.Univ.Univ]
k:1029 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
k:103 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
k:103 [binder, in Undecidability.L.Tactics.Reflection]
k:1032 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
k:104 [binder, in Undecidability.L.Util.L_facts]
k:104 [binder, in Undecidability.L.Tactics.LClos_Eval]
k:104 [binder, in Complexity.NP.Clique.kSAT_to_FlatClique]
k:1047 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
k:105 [binder, in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
k:105 [binder, in Undecidability.L.Util.L_facts]
k:105 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
k:105 [binder, in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
k:105 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.CC]
k:1050 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
k:1052 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
k:1055 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
k:1057 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
k:106 [binder, in Undecidability.L.Tactics.LClos_Eval]
k:106 [binder, in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
k:106 [binder, in Complexity.TM.Single.DecodeTape]
k:107 [binder, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
k:108 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
k:108 [binder, in Undecidability.L.Tactics.LClos_Eval]
k:108 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
k:108 [binder, in Complexity.NP.Clique.kSAT_to_FlatClique]
k:109 [binder, in Undecidability.TM.Code.Copy]
k:11 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_nat_facts]
k:11 [binder, in Complexity.L.AbstractMachines.UnfoldHeap]
k:11 [binder, in Undecidability.L.Complexity.ResourceMeasures]
k:11 [binder, in Complexity.NP.Clique.Clique]
k:11 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.BinaryCC]
k:11 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachine]
k:11 [binder, in Undecidability.TM.Lifting.LiftTapes]
k:110 [binder, in Undecidability.L.Tactics.LClos]
k:110 [binder, in Undecidability.TM.Hoare.HoareRegister]
k:110 [binder, in Undecidability.TM.Univ.Univ]
k:111 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
k:111 [binder, in Undecidability.L.Tactics.LClos_Eval]
k:111 [binder, in Undecidability.TM.Combinators.StateWhile]
k:111 [binder, in Complexity.NP.Clique.kSAT_to_FlatClique]
k:113 [binder, in Undecidability.TM.Code.NatTM]
k:113 [binder, in Complexity.NP.Clique.kSAT_to_FlatClique]
k:114 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
k:114 [binder, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
k:114 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
k:114 [binder, in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
k:114 [binder, in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
k:114 [binder, in Undecidability.TM.Util.TM_facts]
k:114 [binder, in Undecidability.TM.L.HeapInterpreter.LookupTM]
k:115 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
k:115 [binder, in Undecidability.TM.Code.Copy]
k:115 [binder, in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
k:116 [binder, in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
k:116 [binder, in Complexity.NP.Clique.kSAT_to_FlatClique]
k:117 [binder, in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
k:118 [binder, in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
k:118 [binder, in Complexity.NP.Clique.kSAT_to_FlatClique]
k:12 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
k:12 [binder, in Complexity.NP.SAT.kSAT]
k:12 [binder, in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
k:12 [binder, in Undecidability.L.Tactics.Lbeta]
k:12 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
k:12 [binder, in Complexity.NP.SAT.kSAT_to_SAT]
k:12 [binder, in Undecidability.L.Functions.Size]
k:12 [binder, in Complexity.L.AbstractMachines.LambdaDepth]
k:120 [binder, in Undecidability.TM.Lifting.LiftTapes]
k:120 [binder, in Complexity.NP.Clique.kSAT_to_FlatClique]
k:121 [binder, in Undecidability.TM.Compound.MoveToSymbol]
k:121 [binder, in Undecidability.TM.Code.Copy]
k:122 [binder, in Undecidability.L.Prelim.ARS]
k:122 [binder, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
k:122 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
k:122 [binder, in Undecidability.TM.Hoare.HoareLogic]
k:122 [binder, in Complexity.NP.Clique.kSAT_to_FlatClique]
k:123 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
k:123 [binder, in Undecidability.TM.Combinators.StateWhile]
k:124 [binder, in Complexity.NP.Clique.kSAT_to_FlatClique]
k:125 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
k:125 [binder, in Undecidability.TM.Compound.CopySymbols]
k:125 [binder, in Undecidability.TM.Univ.LowLevel]
k:126 [binder, in Undecidability.TM.Lifting.LiftTapes]
k:126 [binder, in Complexity.NP.Clique.kSAT_to_FlatClique]
k:127 [binder, in Undecidability.TM.Code.List.Nth]
k:127 [binder, in Complexity.NP.Clique.FlatClique]
k:129 [binder, in Undecidability.Shared.Libs.DLW.Utils.sorting]
k:129 [binder, in Complexity.NP.Clique.kSAT_to_FlatClique]
k:13 [binder, in Complexity.NP.Clique.Clique]
k:13 [binder, in Complexity.L.AbstractMachines.FlatPro.Computable.Compile]
k:13 [binder, in Complexity.NP.TM.M_LM2TM]
k:13 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachine]
k:13 [binder, in Undecidability.TM.L.Eval]
k:13 [binder, in Undecidability.L.TM.TMinL.TMinL_extract]
k:13 [binder, in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
k:13 [binder, in Complexity.NP.TM.LM_to_mTM]
k:130 [binder, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
k:130 [binder, in Undecidability.TM.Code.NatTM]
k:130 [binder, in Undecidability.TM.Util.Relations]
k:130 [binder, in Undecidability.TM.Compound.Shift]
k:131 [binder, in Undecidability.L.Tactics.ComputableTime]
k:131 [binder, in Complexity.NP.Clique.FlatClique]
k:131 [binder, in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
k:131 [binder, in Undecidability.TM.Lifting.LiftTapes]
k:132 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
k:133 [binder, in Undecidability.TM.Hoare.HoareLogic]
k:133 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
k:134 [binder, in Complexity.NP.Clique.kSAT_to_FlatClique]
k:135 [binder, in Undecidability.L.Prelim.ARS]
k:136 [binder, in Complexity.NP.Clique.kSAT_to_FlatClique]
k:137 [binder, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
k:137 [binder, in Undecidability.TM.Code.NatTM]
k:137 [binder, in Complexity.NP.Clique.FlatClique]
k:137 [binder, in Undecidability.TM.Lifting.LiftTapes]
k:138 [binder, in Complexity.NP.Clique.kSAT_to_Clique]
k:138 [binder, in Complexity.NP.Clique.kSAT_to_FlatClique]
k:14 [binder, in Undecidability.TM.Combinators.While]
k:14 [binder, in Undecidability.TM.L.CompilerBoolFuns.NaryApp]
k:14 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
k:14 [binder, in Complexity.NP.SAT.kSAT]
k:14 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
k:14 [binder, in Undecidability.Shared.Libs.DLW.Utils.list_bool]
k:14 [binder, in Complexity.L.AbstractMachines.Computable.HeapMachine]
k:14 [binder, in Complexity.NP.L.GenNP]
k:14 [binder, in Complexity.L.AbstractMachines.Computable.LargestVar]
k:14 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
k:14 [binder, in Complexity.L.AbstractMachines.LambdaDepth]
k:140 [binder, in Complexity.NP.Clique.kSAT_to_Clique]
k:140 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
k:140 [binder, in Complexity.NP.Clique.kSAT_to_FlatClique]
k:141 [binder, in Complexity.NP.Clique.FlatClique]
k:142 [binder, in Undecidability.L.Prelim.ARS]
k:142 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
k:142 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
k:142 [binder, in Undecidability.TM.Hoare.HoareLogic]
k:143 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
k:143 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
k:144 [binder, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
k:145 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
k:146 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
k:147 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
k:148 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
k:149 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
k:149 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
k:149 [binder, in Undecidability.TM.Code.Copy]
k:149 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
k:15 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
k:15 [binder, in Undecidability.TM.Code.List.Cons_constant]
k:15 [binder, in Undecidability.TM.Util.Prelim]
k:15 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
k:15 [binder, in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
k:15 [binder, in Complexity.NP.TM.M_multi2mono]
k:15 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
k:15 [binder, in Undecidability.L.TM.TMinL.TMinL_extract]
k:15 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.CC]
k:151 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
k:151 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
k:151 [binder, in Undecidability.TM.Hoare.HoareCombinators]
k:154 [binder, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
k:155 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
k:155 [binder, in Undecidability.TM.Combinators.StateWhile]
k:156 [binder, in Undecidability.TM.Univ.LookupAssociativeListTM]
k:157 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
k:158 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
k:158 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
k:159 [binder, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
k:159 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
k:16 [binder, in Undecidability.TM.Combinators.Combinators]
k:16 [binder, in Complexity.NP.SAT.kSAT]
k:16 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_nat_facts]
k:16 [binder, in Undecidability.Shared.Libs.DLW.Utils.seteq]
k:16 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
k:162 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
k:163 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
k:164 [binder, in Undecidability.L.Util.L_facts]
k:165 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
k:168 [binder, in Undecidability.L.Util.L_facts]
k:17 [binder, in Undecidability.L.TM.TMinL]
k:17 [binder, in Complexity.L.AbstractMachines.UnfoldTailRec]
k:17 [binder, in Complexity.TM.Code.DecodeList]
k:17 [binder, in Complexity.L.AbstractMachines.Computable.UnivDecTime]
k:17 [binder, in Complexity.NP.Clique.Clique]
k:17 [binder, in Complexity.NP.TM.M_LM2TM]
k:17 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
k:17 [binder, in Complexity.L.AbstractMachines.Computable.HeapMachine]
k:170 [binder, in Undecidability.TM.Hoare.HoareCombinators]
k:173 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
k:173 [binder, in Undecidability.TM.Univ.Univ]
k:174 [binder, in Complexity.TM.PrettyBounds.UnivBounds]
k:175 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
k:176 [binder, in Undecidability.TM.Hoare.HoareRegister]
k:178 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
k:179 [binder, in Undecidability.TM.Univ.Univ]
k:18 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
k:18 [binder, in Complexity.NP.SAT.kSAT]
k:18 [binder, in Undecidability.L.Prelim.LoopSum]
k:18 [binder, in Undecidability.TM.Util.Prelim]
k:18 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
k:18 [binder, in Complexity.NP.L.LMGenNP]
k:18 [binder, in Undecidability.L.AbstractMachines.FlatPro.UnfoldClos]
k:18 [binder, in Undecidability.L.AbstractMachines.FlatPro.Programs]
k:18 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
k:18 [binder, in Complexity.L.AbstractMachines.FunctionalDefinitions]
k:18 [binder, in Complexity.NP.L.GenNP]
k:180 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
k:181 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
k:183 [binder, in Undecidability.TM.Hoare.HoareCombinators]
k:183 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
k:184 [binder, in Undecidability.TM.Code.Copy]
k:184 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
k:185 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
k:188 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
k:19 [binder, in Undecidability.TM.L.Transcode.Boollist_to_Enc]
k:19 [binder, in Undecidability.Shared.Libs.DLW.Utils.prime]
k:19 [binder, in Undecidability.TM.Lifting.LiftAlphabet]
k:19 [binder, in Complexity.L.AbstractMachines.UnfoldHeap]
k:19 [binder, in Undecidability.L.Tactics.LClos_Eval]
k:190 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
k:190 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
k:190 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
k:192 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
k:198 [binder, in Undecidability.L.Util.L_facts]
k:2 [binder, in Undecidability.L.Tactics.Lbeta_nonrefl]
k:20 [binder, in Undecidability.TM.Combinators.While]
k:20 [binder, in Undecidability.TM.L.CompilerBoolFuns.NaryApp]
k:20 [binder, in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisUnfoldClos]
k:20 [binder, in Complexity.NP.SAT.kSAT]
k:20 [binder, in Undecidability.TM.Combinators.Mirror]
k:20 [binder, in Undecidability.TM.Util.Prelim]
k:20 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
k:20 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
k:204 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
k:204 [binder, in Undecidability.TM.Code.Copy]
k:204 [binder, in Undecidability.TM.Hoare.HoareCombinators]
k:205 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
k:206 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
k:207 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
k:21 [binder, in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
k:21 [binder, in Complexity.TM.Code.Decode]
k:21 [binder, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
k:21 [binder, in Complexity.TM.Code.DecodeList]
k:211 [binder, in Undecidability.L.Util.L_facts]
k:211 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
k:211 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
k:212 [binder, in Undecidability.L.Tactics.Extract]
k:214 [binder, in Undecidability.TM.Code.Copy]
k:215 [binder, in Undecidability.L.Util.L_facts]
k:216 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
k:219 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
k:219 [binder, in Undecidability.TM.Hoare.HoareLogic]
k:22 [binder, in Undecidability.L.TM.TMinL]
k:22 [binder, in Complexity.NP.SAT.kSAT]
k:22 [binder, in Undecidability.TM.Code.List.Rev]
k:22 [binder, in Undecidability.Shared.Libs.DLW.Utils.list_bool]
k:22 [binder, in Complexity.L.AbstractMachines.AbstractSubstMachine]
k:22 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
k:220 [binder, in Undecidability.L.Util.L_facts]
k:220 [binder, in Undecidability.TM.Hoare.HoareCombinators]
k:222 [binder, in Undecidability.TM.Single.StepTM]
k:222 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
k:222 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
k:223 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
k:223 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
k:225 [binder, in Undecidability.L.Util.L_facts]
k:229 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
k:229 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
K:23 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_quotient]
k:23 [binder, in Undecidability.TM.Hoare.HoareLegacy]
k:23 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
k:23 [binder, in Undecidability.TM.Combinators.Mirror]
k:23 [binder, in Undecidability.L.Complexity.ResourceMeasures]
k:23 [binder, in Complexity.NP.L.LMGenNP]
k:23 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
k:23 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.CC]
k:231 [binder, in Undecidability.L.Util.L_facts]
k:233 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
k:235 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
k:238 [binder, in Undecidability.TM.Hoare.HoareCombinators]
k:24 [binder, in Undecidability.TM.Combinators.While]
k:24 [binder, in Undecidability.TM.L.CompilerBoolFuns.NaryApp]
k:24 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
k:24 [binder, in Undecidability.TM.L.Transcode.Boollist_to_Enc]
k:24 [binder, in Complexity.NP.SAT.kSAT]
k:24 [binder, in Undecidability.L.Complexity.ResourceMeasures]
k:24 [binder, in Undecidability.L.AbstractMachines.FlatPro.Programs]
k:24 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachine]
k:240 [binder, in Undecidability.L.Prelim.ARS]
k:241 [binder, in Undecidability.TM.Single.StepTM]
k:244 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
k:25 [binder, in Undecidability.TM.L.Transcode.Boollist_to_Enc]
k:25 [binder, in Undecidability.L.TM.TMinL]
k:25 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
k:25 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_nat_facts]
k:25 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
k:25 [binder, in Undecidability.L.L]
k:25 [binder, in Complexity.L.AbstractMachines.FunctionalDefinitions]
k:25 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
k:25 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.CC]
k:251 [binder, in Undecidability.TM.Hoare.HoareCombinators]
k:253 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
k:26 [binder, in Undecidability.TM.Code.List.Concat_Repeat]
k:26 [binder, in Undecidability.L.TM.TMinL]
k:26 [binder, in Complexity.L.AbstractMachines.UnfoldTailRec]
k:26 [binder, in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisUnfoldClos]
k:26 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
k:26 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
k:26 [binder, in Undecidability.Shared.Libs.DLW.Utils.list_bool]
k:260 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
k:260 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
k:260 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
k:269 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
k:27 [binder, in Undecidability.TM.L.CompilerBoolFuns.NaryApp]
k:27 [binder, in Undecidability.TM.Hoare.HoareLegacy]
k:27 [binder, in Complexity.NP.SAT.kSAT]
k:27 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
k:27 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
k:27 [binder, in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
k:270 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
k:270 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
k:271 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
k:272 [binder, in Undecidability.TM.Single.StepTM]
k:273 [binder, in Undecidability.TM.Hoare.HoareCombinators]
k:274 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
k:274 [binder, in Undecidability.L.Tactics.Reflection]
k:276 [binder, in Undecidability.L.Tactics.Reflection]
k:277 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
k:278 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
k:278 [binder, in Undecidability.L.Tactics.Reflection]
k:278 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
k:279 [binder, in Undecidability.TM.Util.TM_facts]
k:28 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
k:28 [binder, in Undecidability.TM.Code.List.Length]
k:28 [binder, in Undecidability.L.Prelim.LoopSum]
k:28 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_nat_facts]
k:28 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
k:28 [binder, in Undecidability.L.AbstractMachines.FlatPro.Programs]
k:28 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
k:28 [binder, in Undecidability.TM.Lifting.LiftTapes]
k:28 [binder, in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
k:28 [binder, in Complexity.NP.TM.LM_to_mTM]
k:280 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
k:281 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
k:281 [binder, in Undecidability.TM.Hoare.HoareRegister]
k:282 [binder, in Complexity.L.TM.TMflatComp]
k:283 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
k:284 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
k:284 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
k:285 [binder, in Complexity.L.TM.TMflatComp]
k:286 [binder, in Undecidability.TM.Hoare.HoareCombinators]
k:287 [binder, in Undecidability.L.Tactics.Reflection]
k:288 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
k:289 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
k:289 [binder, in Complexity.L.TM.TMflatComp]
k:29 [binder, in Undecidability.TM.Combinators.Combinators]
k:29 [binder, in Complexity.Libs.UniformHomomorphisms]
k:29 [binder, in Undecidability.L.TM.TapeFuns]
k:291 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
k:292 [binder, in Undecidability.TM.Util.TM_facts]
k:294 [binder, in Undecidability.TM.Single.StepTM]
k:296 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
k:298 [binder, in Undecidability.TM.Hoare.HoareRegister]
k:3 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
k:3 [binder, in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
k:3 [binder, in Undecidability.TM.L.CompilerBoolFuns.LComp_to_TMComp]
k:3 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
k:30 [binder, in Complexity.NP.SAT.kSAT]
k:30 [binder, in Complexity.L.AbstractMachines.UnfoldHeap]
k:30 [binder, in Complexity.L.AbstractMachines.AbstractSubstMachine]
k:30 [binder, in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
k:30 [binder, in Complexity.TM.Single.DecodeTapes]
k:30 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
k:300 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
k:302 [binder, in Undecidability.TM.Util.TM_facts]
k:302 [binder, in Undecidability.TM.Hoare.HoareCombinators]
k:303 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
k:305 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
k:308 [binder, in Undecidability.TM.Util.TM_facts]
k:309 [binder, in Undecidability.TM.Single.StepTM]
k:31 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
k:31 [binder, in Complexity.L.TM.TMflatComp]
k:31 [binder, in Complexity.NP.Clique.FlatClique]
k:31 [binder, in Undecidability.TM.Combinators.StateWhile]
k:311 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
k:316 [binder, in Undecidability.TM.Util.TM_facts]
k:318 [binder, in Undecidability.TM.Single.StepTM]
k:319 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
k:32 [binder, in Undecidability.TM.L.CompilerBoolFuns.NaryApp]
k:32 [binder, in Complexity.L.AbstractMachines.UnfoldTailRec]
k:32 [binder, in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
k:32 [binder, in Complexity.L.AbstractMachines.FunctionalDefinitions]
k:32 [binder, in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
k:321 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
k:321 [binder, in Undecidability.TM.Hoare.HoareLogic]
k:322 [binder, in Undecidability.TM.Util.TM_facts]
k:328 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
k:329 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
k:329 [binder, in Undecidability.TM.Util.TM_facts]
k:33 [binder, in Complexity.L.AbstractMachines.Computable.EvalForTime]
k:33 [binder, in Complexity.L.AbstractMachines.UnfoldHeap]
k:33 [binder, in Undecidability.Shared.Libs.DLW.Utils.list_bool]
k:33 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
k:33 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
k:332 [binder, in Undecidability.TM.Hoare.HoareLogic]
k:334 [binder, in Undecidability.TM.Hoare.HoareRegister]
k:335 [binder, in Undecidability.TM.Util.TM_facts]
k:337 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
k:34 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
k:34 [binder, in Undecidability.TM.Combinators.Mirror]
k:34 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
k:34 [binder, in Complexity.NP.Clique.FlatClique]
k:34 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
k:34 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachine]
k:34 [binder, in Complexity.NP.TM.LM_to_mTM]
k:341 [binder, in Undecidability.TM.Util.TM_facts]
k:344 [binder, in Undecidability.TM.Hoare.HoareLogic]
k:345 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
k:346 [binder, in Undecidability.TM.Single.StepTM]
k:347 [binder, in Undecidability.TM.Util.TM_facts]
k:35 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds_Loop]
k:35 [binder, in Undecidability.Shared.Libs.DLW.Utils.interval]
k:35 [binder, in Undecidability.TM.Hoare.HoareLogic]
k:355 [binder, in Undecidability.TM.Hoare.HoareLogic]
k:359 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
k:36 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_nat_facts]
k:36 [binder, in Complexity.L.TM.TMflatComp]
k:36 [binder, in Complexity.L.TM.TMflatten]
k:36 [binder, in Undecidability.TM.Combinators.StateWhile]
k:36 [binder, in Complexity.NP.TM.LM_to_mTM]
k:360 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
k:361 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
k:363 [binder, in Undecidability.TM.Util.TM_facts]
k:367 [binder, in Undecidability.TM.Util.TM_facts]
k:367 [binder, in Undecidability.TM.Hoare.HoareLogic]
k:37 [binder, in Undecidability.TM.Combinators.Mirror]
k:37 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
k:37 [binder, in Undecidability.TM.Code.CompareValue]
k:37 [binder, in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
k:37 [binder, in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
k:37 [binder, in Complexity.L.AbstractMachines.FunctionalDefinitions]
k:37 [binder, in Undecidability.TM.Hoare.HoareCombinators]
k:37 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.CC]
k:375 [binder, in Undecidability.TM.Hoare.HoareLogic]
k:38 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
k:38 [binder, in Undecidability.TM.Util.Prelim]
k:38 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
k:383 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
k:383 [binder, in Undecidability.TM.Hoare.HoareLogic]
k:384 [binder, in Undecidability.TM.Hoare.HoareRegister]
k:385 [binder, in Undecidability.TM.Util.TM_facts]
k:389 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
k:39 [binder, in Complexity.TM.Code.Decode]
k:39 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_nat_facts]
k:39 [binder, in Undecidability.L.TM.TapeFuns]
k:39 [binder, in Undecidability.TM.Code.CasePair]
k:391 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
k:392 [binder, in Undecidability.TM.Util.TM_facts]
k:393 [binder, in Undecidability.TM.Hoare.HoareLogic]
k:394 [binder, in Undecidability.TM.Single.StepTM]
k:394 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
k:397 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
k:4 [binder, in Complexity.L.AbstractMachines.UnfoldTailRec]
k:4 [binder, in Complexity.NP.TM.TMGenNP]
k:4 [binder, in Undecidability.Shared.Libs.DLW.Utils.list_bool]
k:4 [binder, in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
k:4 [binder, in Complexity.L.AbstractMachines.FunctionalDefinitions]
k:4 [binder, in Complexity.L.AbstractMachines.LambdaDepth]
k:40 [binder, in Undecidability.TM.L.Transcode.Boollist_to_Enc]
k:40 [binder, in Undecidability.L.Complexity.ResourceMeasures]
k:40 [binder, in Undecidability.TM.Single.EncodeTapes]
k:402 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
k:402 [binder, in Undecidability.TM.Hoare.HoareLogic]
k:403 [binder, in Undecidability.TM.Hoare.HoareCombinators]
k:406 [binder, in Undecidability.TM.Hoare.HoareCombinators]
k:407 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
k:41 [binder, in Undecidability.TM.L.CompilerBoolFuns.NaryApp]
k:41 [binder, in Undecidability.L.Util.L_facts]
k:41 [binder, in Undecidability.TM.Util.Prelim]
k:41 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
k:41 [binder, in Complexity.L.TM.TMflatten]
k:41 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
k:411 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
k:414 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
k:419 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
k:42 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds_Loop]
k:42 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
k:42 [binder, in Complexity.L.AbstractMachines.UnfoldTailRec]
k:42 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
k:42 [binder, in Undecidability.TM.Code.List.Rev]
k:42 [binder, in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
k:42 [binder, in Undecidability.TM.Hoare.HoareLogic]
k:42 [binder, in Undecidability.TM.Code.List.App]
k:422 [binder, in Undecidability.TM.Single.StepTM]
k:424 [binder, in Undecidability.TM.Hoare.HoareRegister]
k:426 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
k:43 [binder, in Undecidability.L.Util.L_facts]
k:43 [binder, in Undecidability.TM.Combinators.Switch]
k:43 [binder, in Undecidability.L.Complexity.ResourceMeasures]
k:43 [binder, in Complexity.Libs.UniformHomomorphisms]
k:43 [binder, in Undecidability.Shared.Libs.DLW.Utils.list_bool]
k:43 [binder, in Complexity.L.AbstractMachines.AbstractSubstMachine]
k:44 [binder, in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisUnfoldClos]
k:44 [binder, in Complexity.Libs.CookPrelim.PolyBounds]
k:446 [binder, in Undecidability.TM.Single.StepTM]
k:45 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds_Loop]
k:45 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
k:45 [binder, in Undecidability.Shared.Libs.DLW.Utils.list_bool]
k:45 [binder, in Complexity.Complexity.SpaceBoundsTime]
k:45 [binder, in Undecidability.TM.Combinators.StateWhile]
k:45 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
k:450 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
k:458 [binder, in Undecidability.TM.Single.StepTM]
k:46 [binder, in Undecidability.TM.Code.CaseList]
k:46 [binder, in Undecidability.L.Util.L_facts]
k:46 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
k:46 [binder, in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
k:46 [binder, in Undecidability.L.Datatypes.List.List_eqb]
k:46 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
k:47 [binder, in Undecidability.TM.L.CompilerBoolFuns.NaryApp]
k:47 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_nat_facts]
k:47 [binder, in Complexity.L.TM.TMflatComp]
k:47 [binder, in Undecidability.Shared.Libs.DLW.Utils.sorting]
k:47 [binder, in Complexity.L.TM.TMflatten]
k:47 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachine]
k:474 [binder, in Undecidability.TM.Single.StepTM]
k:479 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
k:48 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
k:48 [binder, in Undecidability.TM.Code.NatTM]
k:48 [binder, in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
k:48 [binder, in Complexity.Complexity.SpaceBoundsTime]
k:48 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
k:484 [binder, in Undecidability.TM.Single.StepTM]
k:488 [binder, in Undecidability.TM.Single.StepTM]
k:488 [binder, in Undecidability.TM.Hoare.HoareRegister]
k:49 [binder, in Undecidability.L.Util.L_facts]
k:49 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
k:49 [binder, in Undecidability.L.Functions.UnboundIteration]
k:49 [binder, in Undecidability.TM.Hoare.HoareCombinators]
k:49 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
k:49 [binder, in Complexity.NP.Clique.kSAT_to_FlatClique]
k:495 [binder, in Undecidability.TM.Single.StepTM]
k:5 [binder, in Undecidability.TM.L.CompilerBoolFuns.NaryApp]
k:5 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_nat_facts]
k:5 [binder, in Undecidability.TM.Util.Prelim]
k:5 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.VectorFin]
k:5 [binder, in Complexity.L.AbstractMachines.UnfoldHeap]
k:5 [binder, in Complexity.NP.Clique.Clique]
k:5 [binder, in Complexity.NP.L.LMGenNP]
k:5 [binder, in Undecidability.TM.L.Eval]
k:50 [binder, in Undecidability.TM.Combinators.While]
k:50 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
k:50 [binder, in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
k:501 [binder, in Undecidability.TM.Single.StepTM]
k:509 [binder, in Undecidability.TM.Hoare.HoareRegister]
k:51 [binder, in Undecidability.TM.L.CompilerBoolFuns.NaryApp]
k:51 [binder, in Undecidability.L.Util.L_facts]
k:51 [binder, in Undecidability.TM.Code.List.Length]
k:51 [binder, in Complexity.NP.TM.M_multi2mono]
k:51 [binder, in Undecidability.TM.Combinators.StateWhile]
k:51 [binder, in Undecidability.TM.Hoare.HoareLogic]
k:51 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
k:51 [binder, in Complexity.NP.Clique.kSAT_to_FlatClique]
k:515 [binder, in Undecidability.TM.Single.StepTM]
k:52 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
k:52 [binder, in Undecidability.TM.Code.CaseList]
k:52 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
k:53 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
k:53 [binder, in Complexity.Complexity.SpaceBoundsTime]
k:53 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler]
k:53 [binder, in Complexity.NP.Clique.kSAT_to_FlatClique]
k:530 [binder, in Undecidability.TM.Hoare.HoareRegister]
k:54 [binder, in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
k:54 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
k:54 [binder, in Undecidability.TM.Code.List.Concat_Repeat]
k:54 [binder, in Undecidability.L.Util.L_facts]
k:54 [binder, in Undecidability.TM.Code.NatTM]
k:54 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
k:54 [binder, in Undecidability.Shared.Libs.DLW.Utils.sorting]
k:55 [binder, in Undecidability.TM.Util.VectorPrelim]
k:55 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
k:55 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
k:55 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
k:55 [binder, in Complexity.NP.Clique.kSAT_to_FlatClique]
k:553 [binder, in Undecidability.TM.Hoare.HoareRegister]
k:56 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
k:56 [binder, in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
k:56 [binder, in Undecidability.TM.Lifting.LiftAlphabet]
k:56 [binder, in Undecidability.TM.Util.Prelim]
k:56 [binder, in Undecidability.TM.Combinators.StateWhile]
k:57 [binder, in Complexity.L.AbstractMachines.Computable.EvalForTime]
k:57 [binder, in Undecidability.TM.L.CompilerBoolFuns.NaryApp]
k:57 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
k:57 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachine]
k:57 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
k:57 [binder, in Undecidability.TM.Code.CasePair]
k:578 [binder, in Undecidability.TM.Hoare.HoareRegister]
k:58 [binder, in Undecidability.L.Util.L_facts]
k:58 [binder, in Undecidability.TM.Lifting.LiftAlphabet]
k:58 [binder, in Undecidability.Shared.Libs.DLW.Utils.quotient]
k:58 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
k:58 [binder, in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
k:58 [binder, in Complexity.Complexity.SpaceBoundsTime]
k:58 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
k:58 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
k:58 [binder, in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
k:58 [binder, in Undecidability.TM.Hoare.HoareLogic]
k:58 [binder, in Complexity.NP.Clique.kSAT_to_FlatClique]
k:59 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
k:59 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
k:59 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
k:59 [binder, in Complexity.L.TM.TMflatten]
k:59 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
k:6 [binder, in Undecidability.L.TM.TMinL]
k:6 [binder, in Complexity.NP.SAT.kSAT]
k:6 [binder, in Undecidability.Shared.Libs.DLW.Utils.list_bool]
k:6 [binder, in Complexity.L.AbstractMachines.Computable.Lookup]
k:6 [binder, in Undecidability.L.Functions.Proc]
k:6 [binder, in Complexity.L.AbstractMachines.Computable.HeapMachine]
k:60 [binder, in Undecidability.TM.Combinators.While]
k:60 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
k:60 [binder, in Undecidability.L.Util.L_facts]
k:60 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
k:60 [binder, in Undecidability.TM.Code.List.Rev]
k:60 [binder, in Undecidability.TM.Util.TM_facts]
k:60 [binder, in Undecidability.TM.Code.List.App]
k:61 [binder, in Undecidability.TM.L.CompilerBoolFuns.NaryApp]
k:61 [binder, in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
k:61 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
k:61 [binder, in Undecidability.TM.Single.EncodeTapes]
k:62 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
k:62 [binder, in Complexity.L.AbstractMachines.Computable.EvalForTime]
k:62 [binder, in Undecidability.TM.Univ.Univ]
k:62 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler]
k:63 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
k:63 [binder, in Complexity.Complexity.SpaceBoundsTime]
k:63 [binder, in Complexity.L.TM.TMflatFun]
k:64 [binder, in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
k:64 [binder, in Undecidability.TM.Lifting.LiftAlphabet]
k:64 [binder, in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
k:64 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
k:64 [binder, in Undecidability.TM.Single.EncodeTapes]
k:65 [binder, in Complexity.Complexity.UpToCPoly]
k:65 [binder, in Undecidability.TM.Hoare.HoareLogic]
k:66 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
k:67 [binder, in Undecidability.TM.Code.CaseList]
k:67 [binder, in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
k:67 [binder, in Complexity.Complexity.SpaceBoundsTime]
k:68 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
k:68 [binder, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
k:68 [binder, in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
k:68 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachine]
k:68 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
k:68 [binder, in Undecidability.TM.Util.TM_facts]
k:68 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
k:69 [binder, in Undecidability.L.Util.L_facts]
k:69 [binder, in Undecidability.TM.Compound.MoveToSymbol]
k:69 [binder, in Undecidability.L.Complexity.ResourceMeasures]
k:69 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
k:69 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
k:7 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
k:7 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.VectorFin]
k:7 [binder, in Undecidability.L.Tactics.Lbeta_nonrefl]
k:7 [binder, in Complexity.NP.Clique.FlatClique]
k:70 [binder, in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
k:70 [binder, in Undecidability.TM.Code.List.Length]
k:70 [binder, in Undecidability.TM.Compound.CopySymbols]
k:70 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
k:70 [binder, in Undecidability.TM.Combinators.StateWhile]
k:70 [binder, in Complexity.TM.Single.DecodeTape]
k:72 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
k:72 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
k:72 [binder, in Undecidability.L.Datatypes.LVector]
k:72 [binder, in Undecidability.TM.Univ.Univ]
k:72 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
k:73 [binder, in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
k:73 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
k:73 [binder, in Undecidability.TM.Code.CasePair]
k:73 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler]
k:73 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.CC]
k:74 [binder, in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
k:74 [binder, in Undecidability.TM.Compound.Shift]
k:75 [binder, in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
k:75 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
k:75 [binder, in Complexity.NP.Clique.kSAT_to_FlatClique]
k:76 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
k:76 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
k:76 [binder, in Undecidability.TM.Hoare.HoareLogic]
k:77 [binder, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
k:77 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
k:77 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachine]
k:77 [binder, in Complexity.L.TM.TMflatFun]
k:78 [binder, in Complexity.TM.Code.Decode]
k:79 [binder, in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
k:79 [binder, in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
k:79 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
k:8 [binder, in Complexity.NP.SAT.CookLevin]
k:8 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
k:8 [binder, in Undecidability.L.Tactics.Lrewrite]
k:8 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
k:8 [binder, in Undecidability.TM.Util.Prelim]
k:8 [binder, in Undecidability.Shared.Libs.DLW.Utils.list_bool]
k:8 [binder, in Undecidability.L.L]
k:8 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
k:8 [binder, in Complexity.L.AbstractMachines.Computable.HeapMachine]
k:8 [binder, in Complexity.L.AbstractMachines.LambdaDepth]
k:80 [binder, in Undecidability.L.Complexity.ResourceMeasures]
k:80 [binder, in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
k:80 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
k:80 [binder, in Complexity.NP.Clique.kSAT_to_FlatClique]
k:81 [binder, in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
k:81 [binder, in Undecidability.TM.Hoare.HoareCombinators]
k:82 [binder, in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
k:82 [binder, in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
k:83 [binder, in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
k:83 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
k:84 [binder, in Undecidability.L.Util.L_facts]
k:84 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
k:84 [binder, in Undecidability.Shared.Libs.DLW.Utils.php]
k:84 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
k:84 [binder, in Complexity.TM.Single.DecodeTape]
k:84 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.CC]
k:84 [binder, in Complexity.NP.Clique.kSAT_to_FlatClique]
k:85 [binder, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
k:85 [binder, in Complexity.L.TM.TMflatComp]
k:85 [binder, in Undecidability.TM.Compound.Compare]
k:85 [binder, in Complexity.NP.Clique.FlatClique]
k:86 [binder, in Undecidability.L.Complexity.ResourceMeasures]
k:86 [binder, in Complexity.TM.Single.DecodeTape]
k:863 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
k:865 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
k:87 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
k:870 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
k:88 [binder, in Undecidability.TM.Combinators.While]
k:88 [binder, in Complexity.NP.Clique.FlatClique]
k:88 [binder, in Complexity.TM.Single.DecodeTape]
k:89 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
k:89 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachine]
k:89 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
k:9 [binder, in Undecidability.TM.L.CompilerBoolFuns.NaryApp]
k:9 [binder, in Complexity.NP.SAT.kSAT]
k:9 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.BinaryCC]
k:9 [binder, in Undecidability.L.AbstractMachines.FlatPro.UnfoldClos]
k:9 [binder, in Complexity.NP.TM.TMGenNP_fixed_mTM]
k:91 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
k:91 [binder, in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
k:91 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.CC]
k:92 [binder, in Complexity.NP.Clique.FlatClique]
k:93 [binder, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
k:93 [binder, in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
k:93 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
k:93 [binder, in Undecidability.TM.Hoare.HoareCombinators]
k:94 [binder, in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
k:95 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
k:95 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
k:96 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
k:96 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
k:96 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
k:97 [binder, in Undecidability.L.Complexity.ResourceMeasures]
k:97 [binder, in Undecidability.TM.Combinators.StateWhile]
k:98 [binder, in Undecidability.TM.Code.CaseList]
k:98 [binder, in Undecidability.TM.Lifting.LiftTapes]
k:98 [binder, in Undecidability.TM.Hoare.HoareLogic]
k:99 [binder, in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
k:99 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
k:99 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler]

L

L [abbreviation, in Undecidability.L.TM.TMEncoding]
l [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
L [abbreviation, in Undecidability.L.TM.TMinL.TMinL_extract]
L [definition, in Undecidability.Synthetic.ReducibilityFacts]
L [library]
lacc [definition, in Undecidability.L.Computability.Acceptability]
lacc_disj [lemma, in Undecidability.L.Computability.Acceptability]
lacc_conj [lemma, in Undecidability.L.Computability.Acceptability]
lam [constructor, in Undecidability.L.L]
lamAT [constructor, in Undecidability.TM.L.Alphabets]
lambda [definition, in Undecidability.L.Util.L_facts]
lambdab [definition, in Undecidability.L.Functions.Proc]
lambdab_spec [lemma, in Undecidability.L.Functions.Proc]
lambdaComp [constructor, in Undecidability.L.Tactics.LClos]
lambdaDepth [definition, in Complexity.L.AbstractMachines.LambdaDepth]
LambdaDepth [library]
lambdaDepthP [definition, in Complexity.L.AbstractMachines.LambdaDepth]
lambdaDepthP_compile [lemma, in Complexity.L.AbstractMachines.LambdaDepth]
lambdaDepthP_compile' [lemma, in Complexity.L.AbstractMachines.LambdaDepth]
lambdaDepthP_min [lemma, in Complexity.L.AbstractMachines.LambdaDepth]
lambda_dec [instance, in Undecidability.L.Util.L_facts]
lambda_lam [lemma, in Undecidability.L.Util.L_facts]
lamComp [inductive, in Undecidability.L.Tactics.LClos]
lamOmega [lemma, in Undecidability.L.Computability.Rice]
lamT [constructor, in Undecidability.L.AbstractMachines.FlatPro.ProgramsDef]
lam_terminal [lemma, in Undecidability.L.Util.L_facts]
lam_app_proper [lemma, in Undecidability.L.Tactics.Lbeta_nonrefl]
largestVar [definition, in Undecidability.L.AbstractMachines.LargestVar]
LargestVar [library]
LargestVar [library]
largestVarC [definition, in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
largestVarC [definition, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
largestVarCs [definition, in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
largestVarCs [definition, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
largestVarC_V_leq [lemma, in Complexity.L.AbstractMachines.AbstractHeapMachine]
largestVarH [definition, in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
largestVarH [definition, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
largestVarHE [definition, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
largestVarH_leq [lemma, in Complexity.L.AbstractMachines.AbstractHeapMachine]
largestVarH_bound [lemma, in Complexity.L.AbstractMachines.AbstractHeapMachine]
largestVarP [definition, in Undecidability.L.AbstractMachines.FlatPro.Programs]
largestVarState [definition, in Complexity.L.AbstractMachines.UnfoldTailRec]
largestVarT [definition, in Undecidability.L.AbstractMachines.FlatPro.Programs]
largestVarTR_correct [lemma, in Complexity.L.AbstractMachines.Computable.LargestVar]
largestVarTR' [definition, in Complexity.L.AbstractMachines.Computable.LargestVar]
largestVarTR'_fuel_leq_largestVar [lemma, in Complexity.L.AbstractMachines.Computable.LargestVar]
largestVarTR'_correct [lemma, in Complexity.L.AbstractMachines.Computable.LargestVar]
largestVarTR'_fuel [definition, in Complexity.L.AbstractMachines.Computable.LargestVar]
largestVar_compile [lemma, in Undecidability.L.AbstractMachines.FlatPro.Programs]
largestVar_start [lemma, in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
largestVar_size [lemma, in Undecidability.L.AbstractMachines.LargestVar]
largestVar_term [lemma, in Undecidability.L.AbstractMachines.LargestVar]
largestVar_nat [lemma, in Undecidability.L.AbstractMachines.LargestVar]
largestVar_prod [lemma, in Undecidability.L.AbstractMachines.LargestVar]
largestVar:12 [binder, in Complexity.HierarchyTheorem.TimeHierarchyTheorem]
largestVar:30 [binder, in Complexity.L.AbstractMachines.Computable.Unfolding]
largestVar:4 [binder, in Complexity.L.AbstractMachines.Computable.EvalForTimeBool]
largestVar:8 [binder, in Complexity.L.AbstractMachines.Computable.Unfolding]
last_app_eq [lemma, in Complexity.TM.Single.EncodeTapesInvariants]
last_not_default [lemma, in Complexity.TM.Compound.MoveToSymbol_niceSpec]
last_app [lemma, in Undecidability.TM.Code.BinNumbers.PosShiftTM]
LA_In_f_times_step [lemma, in Complexity.HierarchyTheorem.TimeHierarchyTheorem]
LA_In_f_times_step' [lemma, in Complexity.HierarchyTheorem.TimeHierarchyTheorem]
LA_In_f_times_step [lemma, in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
lb [abbreviation, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
lb [abbreviation, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
lbeq [abbreviation, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
lbeq [abbreviation, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
Lbeta [library]
Lbeta_nonrefl [library]
LBinNums [library]
LBool [library]
lb_shift_ortho_meet [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
lb_shift_ortho [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
lb_shift_join [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
lb_shift_meet [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
lb_nat_shift [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
lb_shift_S [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
lb_shift_0 [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
lb_shift [definition, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
lb_bots [definition, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
lb_join_dio [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
lb_meet_dio [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
lb_minus_plus [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
lb_ortho_plus_id [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
lb_ortho_plus_join [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
lb_ortho_plus [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
lb_plus_spec_0 [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
lb_plus_spec [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
lb_plus_fix_2 [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
lb_plus_fix_1 [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
lb_plus_fix_0 [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
lb_plus [definition, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
lb_succ_bot [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
lb_succ_spec [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
lb_succ_spec_1 [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
lb_succ_spec_0 [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
lb_succ [definition, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
lb_mask_equiv_equal [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
lb_mask_eq_binary_le [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
lb_mask_nat [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
lb_mask_nat.lb_mask_nat_2 [variable, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
lb_mask_nat.lb_mask_nat_1 [variable, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
lb_mask_nat [section, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
lb_nat_lb [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
lb_mask_binary_le [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
lb_nat_app [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
lb_nat_fix_3 [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
lb_nat_fix_2 [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
lb_nat_fix_1 [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
lb_nat_fix_0 [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
lb_nat [definition, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
lb_minus [definition, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
lb_complement [definition, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
lb_complement.bin_comp [variable, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
lb_complement [section, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
lb_ortho_mask_nil [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
lb_ortho_join [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
lb_join_nil_eq [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
lb_join_meet_idem [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
lb_meet_join_idem [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
lb_meet_spec [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
lb_join_spec [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
lb_join_assoc [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
lb_meet_assoc [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
lb_meet_join_distr [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
lb_join_meet_distr [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
lb_join_idem [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
lb_meet_idem [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
lb_mask_meet [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
lb_mask_join [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
lb_meet_dec_right [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
lb_join_inc_right [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
lb_meet_dec_left [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
lb_join_inc_left [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
lb_ortho_meet_nil [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
lb_join_mono [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
lb_join_length_le [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
lb_join_cons [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
lb_join_right [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
lb_join_comm [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
lb_join_left [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
lb_meet_app [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
lb_meet_length [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
lb_meet_length_le [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
lb_meet_mono [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
lb_meet_cons [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
lb_meet_right [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
lb_meet_comm [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
lb_meet_left [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
lb_join [definition, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
lb_meet [definition, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
lb_pointwise_mono_left [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
lb_pointwise.lbpw_mono_2 [variable, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
lb_pointwise.lbpw_mono_f_0 [variable, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
lb_pointwise.lbpw_mono_1 [variable, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
lb_pointwise.Hf2 [variable, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
lb_pointwise.Hf1 [variable, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
lb_pointwise_sym [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
lb_pointwise_length [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
lb_pointwise_cons [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
lb_pointwise_right [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
lb_pointwise_left [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
lb_pointwise_nil [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
lb_pointwise [definition, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
lb_pointwise.f [variable, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
lb_pointwise [section, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
lb_ortho_anti [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
lb_ortho_sym [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
lb_ortho_anti_left [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
lb_ortho_cons_inv [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
lb_ortho [inductive, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
lb_mask_equiv_app [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
lb_mask_app [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
lb_mask_equiv_trans [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
lb_mask_equiv_sym [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
lb_mask_equiv_refl [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
lb_mask_equiv [definition, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
lb_mask_trans [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
lb_mask_refl [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
lb_mask_leb [definition, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
lb_mask_inv_cons_cons [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
lb_mask_inv_cons_nil [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
lb_mask_inv_cons [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
lb_mask_inv_left [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
lb_mask_inv_nil [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
lb_mask [inductive, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
lb:15 [binder, in Undecidability.Shared.Libs.DLW.Utils.list_bool]
lb:23 [binder, in Undecidability.Shared.Libs.DLW.Utils.list_bool]
lb:27 [binder, in Undecidability.Shared.Libs.DLW.Utils.list_bool]
lb:3 [binder, in Undecidability.Shared.Libs.DLW.Utils.list_bool]
lb:34 [binder, in Undecidability.Shared.Libs.DLW.Utils.list_bool]
lb:7 [binder, in Undecidability.Shared.Libs.DLW.Utils.list_bool]
LClos [library]
LClos_Eval [library]
lcm [definition, in Undecidability.Shared.Libs.DLW.Utils.gcd]
lcm_spec [lemma, in Undecidability.Shared.Libs.DLW.Utils.gcd]
LComparison [library]
lcomp_comp [lemma, in Undecidability.L.Computability.Computability]
LComp_to_TMComp [library]
lc:17 [binder, in Undecidability.Shared.Libs.DLW.Utils.list_bool]
lc:29 [binder, in Undecidability.Shared.Libs.DLW.Utils.list_bool]
ldec [definition, in Undecidability.L.Computability.Decidability]
ldec_disj [lemma, in Undecidability.L.Computability.Decidability]
ldec_conj [lemma, in Undecidability.L.Computability.Decidability]
ldec_complement [lemma, in Undecidability.L.Computability.Decidability]
ldec_proc [lemma, in Undecidability.L.Functions.Proc]
ldec_closed [lemma, in Undecidability.L.Functions.Proc]
ldec_lambda [lemma, in Undecidability.L.Functions.Proc]
LDepPair [library]
leb_iff [lemma, in Complexity.Libs.CookPrelim.FlatFinTypes]
leb_strict [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
leb_trans [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
leb_refl [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
leb_time_bound_r [lemma, in Complexity.Libs.CookPrelim.PolyBounds]
leb_time_bound_l [lemma, in Complexity.Libs.CookPrelim.PolyBounds]
leb_time [definition, in Undecidability.L.Datatypes.LNat]
left [definition, in Undecidability.TM.SBTM]
left [definition, in Undecidability.TM.Util.TM_facts]
LeftBlank [constructor, in Undecidability.TM.Single.EncodeTapes]
Leftmost [module, in Undecidability.L.Complexity.ResourceMeasures]
Leftmost_space_bounds_time [lemma, in Complexity.Complexity.SpaceBoundsTime]
Leftmost.pow_step_lm_congR [instance, in Undecidability.L.Complexity.ResourceMeasures]
Leftmost.pow_step_lm_congL [instance, in Undecidability.L.Complexity.ResourceMeasures]
Leftmost.redWithMaxSizeL [definition, in Undecidability.L.Complexity.ResourceMeasures]
Leftmost.redWithMaxSizeL_congR [lemma, in Undecidability.L.Complexity.ResourceMeasures]
Leftmost.redWithMaxSizeL_congL [lemma, in Undecidability.L.Complexity.ResourceMeasures]
Leftmost.spaceBS [inductive, in Undecidability.L.Complexity.ResourceMeasures]
Leftmost.spaceBSBeta [constructor, in Undecidability.L.Complexity.ResourceMeasures]
Leftmost.spaceBSVal [constructor, in Undecidability.L.Complexity.ResourceMeasures]
Leftmost.spaceBS_eval [lemma, in Undecidability.L.Complexity.ResourceMeasures]
Leftmost.spaceBS_correct_lm [lemma, in Undecidability.L.Complexity.ResourceMeasures]
Leftmost.spaceBS_ge [lemma, in Undecidability.L.Complexity.ResourceMeasures]
Leftmost.step_lm_evaluatesSpace [lemma, in Undecidability.L.Complexity.ResourceMeasures]
Leftmost.step_lm_evaluatesIn [lemma, in Undecidability.L.Complexity.ResourceMeasures]
Leftmost.step_lm_step [instance, in Undecidability.L.Complexity.ResourceMeasures]
Leftmost.step_lm_functional [lemma, in Undecidability.L.Complexity.ResourceMeasures]
Leftmost.step_lmAppL [constructor, in Undecidability.L.Complexity.ResourceMeasures]
Leftmost.step_lmAppR [constructor, in Undecidability.L.Complexity.ResourceMeasures]
Leftmost.step_lmApp [constructor, in Undecidability.L.Complexity.ResourceMeasures]
Leftmost.step_lm [inductive, in Undecidability.L.Complexity.ResourceMeasures]
Leftmost.timeBS_correct_lm [lemma, in Undecidability.L.Complexity.ResourceMeasures]
_ ≻lm _ [notation, in Undecidability.L.Complexity.ResourceMeasures]
leftof [constructor, in Undecidability.TM.TM]
left_inv_inj [lemma, in Undecidability.Shared.Libs.PSL.Bijection]
left_inverse [definition, in Undecidability.Shared.Libs.PSL.Bijection]
lemma [section, in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
lemmas_for_LMGenNP_to_TMGenNP_mTM [section, in Complexity.NP.TM.M_multi2mono]
Lenght [section, in Undecidability.TM.Code.List.Length]
Lenght.cX [variable, in Undecidability.TM.Code.List.Length]
Lenght.retr1 [variable, in Undecidability.TM.Code.List.Length]
Lenght.retr2 [variable, in Undecidability.TM.Code.List.Length]
Lenght.sig [variable, in Undecidability.TM.Code.List.Length]
Lenght.sigX [variable, in Undecidability.TM.Code.List.Length]
Lenght.X [variable, in Undecidability.TM.Code.List.Length]
length [section, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
Length [definition, in Undecidability.TM.Code.List.Length]
Length [library]
lengthEq [definition, in Undecidability.L.Datatypes.List.List_extra]
lengthEq_time [definition, in Undecidability.L.Datatypes.List.List_extra]
lengthEq_spec [lemma, in Undecidability.L.Datatypes.List.List_extra]
lengthH:29 [binder, in Complexity.L.AbstractMachines.Computable.Unfolding]
lengthH:7 [binder, in Complexity.L.AbstractMachines.Computable.Unfolding]
Length_steps_nice [lemma, in Complexity.TM.PrettyBounds.BaseCode]
Length_Loop_steps_nice [lemma, in Complexity.TM.PrettyBounds.BaseCode]
Length_Step_steps_nice_cons [lemma, in Complexity.TM.PrettyBounds.BaseCode]
Length_Step_steps_nice_nil [lemma, in Complexity.TM.PrettyBounds.BaseCode]
Length_steps_nice.cX [variable, in Complexity.TM.PrettyBounds.BaseCode]
Length_steps_nice.X [variable, in Complexity.TM.PrettyBounds.BaseCode]
Length_steps_nice.sigX [variable, in Complexity.TM.PrettyBounds.BaseCode]
Length_steps_nice [section, in Complexity.TM.PrettyBounds.BaseCode]
length_cons [lemma, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
length_nil [lemma, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
length_tape_local_right [lemma, in Undecidability.TM.PrettyBounds.SizeBounds]
Length_steps_nice [lemma, in Undecidability.TM.Code.List.Length]
Length_Loop_steps_nice [lemma, in Undecidability.TM.Code.List.Length]
Length_steps_nice.cX [variable, in Undecidability.TM.Code.List.Length]
Length_steps_nice.X [variable, in Undecidability.TM.Code.List.Length]
Length_steps_nice.sigX [variable, in Undecidability.TM.Code.List.Length]
Length_steps_nice [section, in Undecidability.TM.Code.List.Length]
Length_Terminates [lemma, in Undecidability.TM.Code.List.Length]
Length_T [definition, in Undecidability.TM.Code.List.Length]
Length_steps [definition, in Undecidability.TM.Code.List.Length]
Length_Computes [lemma, in Undecidability.TM.Code.List.Length]
Length_Rel [definition, in Undecidability.TM.Code.List.Length]
Length_size [definition, in Undecidability.TM.Code.List.Length]
Length_Loop_Terminates [lemma, in Undecidability.TM.Code.List.Length]
Length_Loop_T [definition, in Undecidability.TM.Code.List.Length]
Length_Loop_steps [definition, in Undecidability.TM.Code.List.Length]
Length_Loop_Realise [lemma, in Undecidability.TM.Code.List.Length]
Length_Loop_Rel [definition, in Undecidability.TM.Code.List.Length]
Length_Loop_size [definition, in Undecidability.TM.Code.List.Length]
Length_Loop [definition, in Undecidability.TM.Code.List.Length]
Length_Step_Terminates [lemma, in Undecidability.TM.Code.List.Length]
Length_Step_T [definition, in Undecidability.TM.Code.List.Length]
Length_Step_steps [definition, in Undecidability.TM.Code.List.Length]
Length_Step_Realise [lemma, in Undecidability.TM.Code.List.Length]
Length_Step_Rel [definition, in Undecidability.TM.Code.List.Length]
Length_Step_size [definition, in Undecidability.TM.Code.List.Length]
Length_Step [definition, in Undecidability.TM.Code.List.Length]
length_compiler_app [lemma, in Undecidability.Shared.Libs.DLW.Code.compiler]
length_compiler [definition, in Undecidability.Shared.Libs.DLW.Code.compiler]
Length_size_nice [lemma, in Complexity.TM.PrettyBounds.BaseCodeSpace]
Length_Loop_size_nice [lemma, in Complexity.TM.PrettyBounds.BaseCodeSpace]
Length_Step_size_nice [lemma, in Complexity.TM.PrettyBounds.BaseCodeSpace]
Length_size_nice.cX [variable, in Complexity.TM.PrettyBounds.BaseCodeSpace]
Length_size_nice.X [variable, in Complexity.TM.PrettyBounds.BaseCodeSpace]
Length_size_nice.sigX [variable, in Complexity.TM.PrettyBounds.BaseCodeSpace]
Length_size_nice [section, in Complexity.TM.PrettyBounds.BaseCodeSpace]
length_TV [lemma, in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisStep]
length_H [lemma, in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisStep]
length_le_and_incl_implies_dup_or_perm [lemma, in Undecidability.Shared.Libs.DLW.Utils.php]
length_compile_leq [lemma, in Undecidability.L.AbstractMachines.FlatPro.Programs]
length_TV [lemma, in Complexity.L.AbstractMachines.AbstractHeapMachine]
length_H [lemma, in Complexity.L.AbstractMachines.AbstractHeapMachine]
length_app_decompose [lemma, in Complexity.Libs.CookPrelim.MorePrelim]
length_concat [lemma, in Undecidability.L.Prelim.MoreList]
length.X [variable, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
lenumerates [definition, in Undecidability.L.Computability.Synthetic]
len1:27 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
len1:64 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
len2:28 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
len2:302 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
len2:65 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
len:12 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
len:15 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
len:15 [binder, in Undecidability.L.Datatypes.List.List_extra]
len:17 [binder, in Undecidability.L.Datatypes.List.List_extra]
len:20 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
len:23 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
len:292 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
len:43 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
len:7 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
leToC_eta [lemma, in Undecidability.L.Complexity.UpToCNary]
leUpToC [record, in Undecidability.L.Complexity.UpToC]
leUpToC_clean [lemma, in Undecidability.TM.Code.List.Concat_Repeat]
leUpToC_finCases_nary [lemma, in Undecidability.L.Complexity.UpToCNary]
leUpToC_finCases [lemma, in Undecidability.L.Complexity.UpToC]
leUpToC_proper_eq_flip [instance, in Undecidability.L.Complexity.UpToC]
leUpToC_proper_eq [instance, in Undecidability.L.Complexity.UpToC]
leUpToC_preorder [instance, in Undecidability.L.Complexity.UpToC]
le_ge [lemma, in Complexity.TM.PrettyBounds.M2MBounds]
le_evalLe_proper [instance, in Undecidability.L.Util.L_facts]
le_redLe_proper [instance, in Undecidability.L.Util.L_facts]
le_preorder [instance, in Undecidability.L.Prelim.MoreBase]
le_leUpToC_subrelation [instance, in Undecidability.L.Complexity.UpToC]
le_add_l [lemma, in Complexity.Libs.CookPrelim.PolyBounds]
le_lt_impl [instance, in Complexity.Libs.CookPrelim.PolyBounds]
le_add_l [lemma, in Complexity.Complexity.UpToCPoly]
le_lt_impl [instance, in Complexity.Complexity.UpToCPoly]
le_length_sizeP [lemma, in Undecidability.L.AbstractMachines.FlatPro.Programs]
le_f [definition, in Undecidability.Synthetic.Infinite]
le_pirr [lemma, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
le_indd [definition, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
le_lt_pirr [section, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
LFinType [library]
lf:238 [binder, in Complexity.L.TM.TMflatComp]
lf:241 [binder, in Complexity.L.TM.TMflatComp]
LHaltsOrDiverges [definition, in Complexity.NP.L.GenNP]
lhs:176 [binder, in Undecidability.L.Tactics.Extract]
lhs:51 [binder, in Undecidability.L.Tactics.GenEncode]
lift [definition, in Undecidability.TM.Combinators.StateWhile]
LiftAlphabet [definition, in Undecidability.TM.Lifting.LiftAlphabet]
LiftAlphabet [section, in Undecidability.TM.Lifting.LiftAlphabet]
LiftAlphabet [library]
LiftAlphabet_RealiseIn [lemma, in Undecidability.TM.Lifting.LiftAlphabet]
LiftAlphabet_TerminatesIn [lemma, in Undecidability.TM.Lifting.LiftAlphabet]
LiftAlphabet_unlift [lemma, in Undecidability.TM.Lifting.LiftAlphabet]
LiftAlphabet_Realise [lemma, in Undecidability.TM.Lifting.LiftAlphabet]
LiftAlphabet_lift [lemma, in Undecidability.TM.Lifting.LiftAlphabet]
LiftAlphabet_comp_step [lemma, in Undecidability.TM.Lifting.LiftAlphabet]
LiftAlphabet_TM [definition, in Undecidability.TM.Lifting.LiftAlphabet]
LiftAlphabet.def [variable, in Undecidability.TM.Lifting.LiftAlphabet]
LiftAlphabet.F [variable, in Undecidability.TM.Lifting.LiftAlphabet]
LiftAlphabet.Inj [variable, in Undecidability.TM.Lifting.LiftAlphabet]
LiftAlphabet.n [variable, in Undecidability.TM.Lifting.LiftAlphabet]
LiftAlphabet.pMSig [variable, in Undecidability.TM.Lifting.LiftAlphabet]
LiftAlphabet.sig [variable, in Undecidability.TM.Lifting.LiftAlphabet]
LiftAlphabet.tau [variable, in Undecidability.TM.Lifting.LiftAlphabet]
lifted_preludeInitialString [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
lifth [definition, in Undecidability.TM.Combinators.StateWhile]
lifth_comp' [lemma, in Undecidability.TM.Combinators.StateWhile]
lifth_comp [lemma, in Undecidability.TM.Combinators.StateWhile]
Lifting [section, in Undecidability.TM.Hoare.HoareRegister]
Lifting [library]
Lifting.HI [variable, in Undecidability.TM.Hoare.HoareRegister]
Lifting.I [variable, in Undecidability.TM.Hoare.HoareRegister]
Lifting.m [variable, in Undecidability.TM.Hoare.HoareRegister]
Lifting.n [variable, in Undecidability.TM.Hoare.HoareRegister]
Lifting.P [variable, in Undecidability.TM.Hoare.HoareRegister]
Lifting.sig [variable, in Undecidability.TM.Hoare.HoareRegister]
LiftNM [section, in Undecidability.TM.Lifting.LiftTapes]
LiftNM.F [variable, in Undecidability.TM.Lifting.LiftTapes]
LiftNM.I [variable, in Undecidability.TM.Lifting.LiftTapes]
LiftNM.I_dupfree [variable, in Undecidability.TM.Lifting.LiftTapes]
LiftNM.m [variable, in Undecidability.TM.Lifting.LiftTapes]
LiftNM.n [variable, in Undecidability.TM.Lifting.LiftTapes]
LiftNM.pM [variable, in Undecidability.TM.Lifting.LiftTapes]
LiftNM.sig [variable, in Undecidability.TM.Lifting.LiftTapes]
liftOrig [inductive, in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
liftOrigC [constructor, in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
liftOrig_relpower_p [lemma, in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
liftOrig_valid_p [lemma, in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
liftPhi [definition, in Undecidability.L.Tactics.Reflection]
liftPhi_correct [lemma, in Undecidability.L.Tactics.Reflection]
liftPrelude [abbreviation, in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
liftPrelude [inductive, in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
liftPreludeC [constructor, in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
liftPrelude_subs_combP [lemma, in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
LiftSpec [definition, in Undecidability.TM.Hoare.HoareRegister]
LiftSpec_withSpace [lemma, in Undecidability.TM.Hoare.HoareRegister]
LiftSpec_withSpace_single [lemma, in Undecidability.TM.Hoare.HoareRegister]
LiftSpec_surjectTapes_tspec' [lemma, in Undecidability.TM.Hoare.HoareRegister]
LiftSpec_surjectTapes_tspec [lemma, in Undecidability.TM.Hoare.HoareRegister]
LiftSpec_surjectTape_tspec_single' [lemma, in Undecidability.TM.Hoare.HoareRegister]
LiftSpec_surjectTape_tspec_single [lemma, in Undecidability.TM.Hoare.HoareRegister]
LiftSpec_single [definition, in Undecidability.TM.Hoare.HoareRegister]
liftState [definition, in Undecidability.TM.Combinators.StateWhile]
LiftTapes [definition, in Undecidability.TM.Lifting.LiftTapes]
LiftTapes [library]
LiftTapes_SpecT_space_con [lemma, in Undecidability.TM.Hoare.HoareRegister]
LiftTapes_Spec_space_con [lemma, in Undecidability.TM.Hoare.HoareRegister]
LiftTapes_SpecT_space [lemma, in Undecidability.TM.Hoare.HoareRegister]
LiftTapes_Spec_space [lemma, in Undecidability.TM.Hoare.HoareRegister]
LiftTapes_SpecT_con [lemma, in Undecidability.TM.Hoare.HoareRegister]
LiftTapes_SpecT [lemma, in Undecidability.TM.Hoare.HoareRegister]
LiftTapes_Spec_con [lemma, in Undecidability.TM.Hoare.HoareRegister]
LiftTapes_Spec [lemma, in Undecidability.TM.Hoare.HoareRegister]
LiftTapes_Spec_ex [lemma, in Undecidability.TM.Hoare.HoareRegister]
LiftTapes_RealiseIn [lemma, in Undecidability.TM.Lifting.LiftTapes]
LiftTapes_Terminates [lemma, in Undecidability.TM.Lifting.LiftTapes]
LiftTapes_unlift [lemma, in Undecidability.TM.Lifting.LiftTapes]
LiftTapes_Realise [lemma, in Undecidability.TM.Lifting.LiftTapes]
LiftTapes_eq [lemma, in Undecidability.TM.Lifting.LiftTapes]
LiftTapes_comp_eq [lemma, in Undecidability.TM.Lifting.LiftTapes]
LiftTapes_lift [lemma, in Undecidability.TM.Lifting.LiftTapes]
LiftTapes_comp_step [lemma, in Undecidability.TM.Lifting.LiftTapes]
LiftTapes_TM [definition, in Undecidability.TM.Lifting.LiftTapes]
LiftTapes_trans [definition, in Undecidability.TM.Lifting.LiftTapes]
LiftTapes_T [definition, in Undecidability.TM.Lifting.LiftTapes]
LiftTapes_Rel.T [variable, in Undecidability.TM.Lifting.LiftTapes]
LiftTapes_Rel [definition, in Undecidability.TM.Lifting.LiftTapes]
LiftTapes_eq_Rel [definition, in Undecidability.TM.Lifting.LiftTapes]
LiftTapes_select_Rel [definition, in Undecidability.TM.Lifting.LiftTapes]
LiftTapes_Rel.R [variable, in Undecidability.TM.Lifting.LiftTapes]
LiftTapes_Rel.I [variable, in Undecidability.TM.Lifting.LiftTapes]
LiftTapes_Rel.n [variable, in Undecidability.TM.Lifting.LiftTapes]
LiftTapes_Rel.m [variable, in Undecidability.TM.Lifting.LiftTapes]
LiftTapes_Rel.F [variable, in Undecidability.TM.Lifting.LiftTapes]
LiftTapes_Rel.sig [variable, in Undecidability.TM.Lifting.LiftTapes]
LiftTapes_Rel [section, in Undecidability.TM.Lifting.LiftTapes]
lift_final [lemma, in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
lift_initc [lemma, in Undecidability.TM.Combinators.Switch]
lift_confR [definition, in Undecidability.TM.Combinators.Switch]
lift_confL [definition, in Undecidability.TM.Combinators.Switch]
lift_trans [definition, in Undecidability.TM.Lifting.LiftAlphabet]
lift_sigma_tau_T [definition, in Undecidability.TM.Lifting.LiftAlphabet]
lift_sigma_tau_Rel [definition, in Undecidability.TM.Lifting.LiftAlphabet]
lift_sigma_tau.F [variable, in Undecidability.TM.Lifting.LiftAlphabet]
lift_sigma_tau.def [variable, in Undecidability.TM.Lifting.LiftAlphabet]
lift_sigma_tau.g [variable, in Undecidability.TM.Lifting.LiftAlphabet]
lift_sigma_tau.tau [variable, in Undecidability.TM.Lifting.LiftAlphabet]
lift_sigma_tau.sig [variable, in Undecidability.TM.Lifting.LiftAlphabet]
lift_sigma_tau.n [variable, in Undecidability.TM.Lifting.LiftAlphabet]
lift_sigma_tau [section, in Undecidability.TM.Lifting.LiftAlphabet]
lift_init [lemma, in Undecidability.TM.Combinators.StateWhile]
Lin [section, in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
linDec_sum [instance, in Complexity.Complexity.LinTimeDecodable]
linDec_prod [instance, in Complexity.Complexity.LinTimeDecodable]
linDec_term [instance, in Complexity.Complexity.LinTimeDecodable]
linDec_unit [instance, in Complexity.Complexity.LinTimeDecodable]
linDec_tape [instance, in Complexity.L.TM.TapeDecode]
linDec_nat [instance, in Undecidability.L.Complexity.LinDecode.LTDnat]
linDec_polyTimeComputable [lemma, in Complexity.Complexity.Definitions]
linDec_list [instance, in Undecidability.L.Complexity.LinDecode.LTDlist]
linDec_bool [instance, in Undecidability.L.Complexity.LinDecode.LTDbool]
link [definition, in Undecidability.Shared.Libs.DLW.Code.compiler]
linker [definition, in Undecidability.Shared.Libs.DLW.Code.compiler]
linker [section, in Undecidability.Shared.Libs.DLW.Code.compiler]
linker_out_err [lemma, in Undecidability.Shared.Libs.DLW.Code.compiler]
linker_out_code [lemma, in Undecidability.Shared.Libs.DLW.Code.compiler]
linker_code_end [lemma, in Undecidability.Shared.Libs.DLW.Code.compiler]
linker_middle [lemma, in Undecidability.Shared.Libs.DLW.Code.compiler]
linker_code_start [lemma, in Undecidability.Shared.Libs.DLW.Code.compiler]
linker_in_code [lemma, in Undecidability.Shared.Libs.DLW.Code.compiler]
linker_err_code [lemma, in Undecidability.Shared.Libs.DLW.Code.compiler]
linker_app [lemma, in Undecidability.Shared.Libs.DLW.Code.compiler]
linker.c [variable, in Undecidability.Shared.Libs.DLW.Code.compiler]
linker.comp [section, in Undecidability.Shared.Libs.DLW.Code.compiler]
linker.comp.lnk [variable, in Undecidability.Shared.Libs.DLW.Code.compiler]
linker.err [variable, in Undecidability.Shared.Libs.DLW.Code.compiler]
linker.Hc [variable, in Undecidability.Shared.Libs.DLW.Code.compiler]
linker.i [variable, in Undecidability.Shared.Libs.DLW.Code.compiler]
linker.lc [variable, in Undecidability.Shared.Libs.DLW.Code.compiler]
linker.linker_in_code.Hlc [variable, in Undecidability.Shared.Libs.DLW.Code.compiler]
linker.linker_in_code [section, in Undecidability.Shared.Libs.DLW.Code.compiler]
linker.P [variable, in Undecidability.Shared.Libs.DLW.Code.compiler]
linker.X [variable, in Undecidability.Shared.Libs.DLW.Code.compiler]
linker.Y [variable, in Undecidability.Shared.Libs.DLW.Code.compiler]
link_fst [lemma, in Undecidability.Shared.Libs.DLW.Code.compiler]
link_app [lemma, in Undecidability.Shared.Libs.DLW.Code.compiler]
linTimeDecodable [record, in Undecidability.L.Complexity.LinDecode.LTD_def]
LinTimeDecodable [library]
Lin.HA [variable, in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
Lin.Heap [variable, in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
listAnd [definition, in Complexity.NP.SAT.FSAT.FormulaEncoding]
listAnd_size [lemma, in Complexity.NP.SAT.FSAT.FormulaEncoding]
listAnd_varsIn [lemma, in Complexity.NP.SAT.FSAT.FormulaEncoding]
listAnd_time [definition, in Complexity.NP.SAT.FSAT.FormulaEncoding]
listAnd_sat_iff [lemma, in Complexity.NP.SAT.FSAT.FormulaEncoding]
ListAutomation [library]
ListAutomationNotations [module, in Undecidability.Shared.ListAutomation]
_ <<= _ [notation, in Undecidability.Shared.ListAutomation]
_ el _ [notation, in Undecidability.Shared.ListAutomation]
( _ × _ × .. × _ ) [notation, in Undecidability.Shared.ListAutomation]
[ _ | _ ∈ _ ] [notation, in Undecidability.Shared.ListAutomation]
[ _ | _ ∈ _ , _ ] [notation, in Undecidability.Shared.ListAutomation]
listcards:230 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
ListEnumerabilityFacts [library]
listOr [definition, in Complexity.NP.SAT.FSAT.FormulaEncoding]
listOr_size [lemma, in Complexity.NP.SAT.FSAT.FormulaEncoding]
listOr_varsIn [lemma, in Complexity.NP.SAT.FSAT.FormulaEncoding]
listOr_time [definition, in Complexity.NP.SAT.FSAT.FormulaEncoding]
listOr_sat_iff [lemma, in Complexity.NP.SAT.FSAT.FormulaEncoding]
listPreludeRules [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Lists [library]
ListStuff [section, in Undecidability.TM.Code.List.App]
ListStuff.X [variable, in Undecidability.TM.Code.List.App]
ListTM [library]
list_weak_dec [definition, in Undecidability.Shared.Libs.DLW.Utils.fin_dec]
list_ofFlatType_repEl [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
list_ofFlatType_map [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
list_ofFlatType_rev [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
list_prod_length [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
list_prod_poly [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
list_prod_time_bound [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
list_prod_time [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
list_vec_full [definition, in Undecidability.Shared.Libs.DLW.Vec.vec]
list_vec_iso [lemma, in Undecidability.Shared.Libs.DLW.Vec.vec]
list_vec [definition, in Undecidability.Shared.Libs.DLW.Vec.vec]
list_constructors [definition, in Undecidability.L.Tactics.Extract]
list_eq_dec [instance, in Undecidability.Shared.Libs.PSL.EqDec]
list_discrim [definition, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
list_discrim.PQdec [variable, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
list_discrim.Q [variable, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
list_discrim.P [variable, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
list_discrim.X [variable, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
list_discrim [section, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
list_dec [lemma, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
list_dec.H [variable, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
list_dec.Q [variable, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
list_dec.P [variable, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
list_dec.X [variable, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
list_dec [section, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
list_first_dec [lemma, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
list_choose_dec [lemma, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
list_first_dec.Pdec [variable, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
list_first_dec.P [variable, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
list_first_dec.X [variable, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
list_first_dec [section, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
list_assoc_app [lemma, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
list_assoc_In [lemma, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
list_assoc_neq [lemma, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
list_assoc_eq [lemma, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
list_assoc [definition, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
list_assoc.eq_X_dec [variable, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
list_assoc.Y [variable, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
list_assoc.X [variable, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
list_assoc [section, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
list_in_map [definition, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
list_in_map.Y [variable, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
list_in_map.X [variable, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
list_in_map [section, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
list_split_middle [lemma, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
list_pick [lemma, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
list_split_length [lemma, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
list_app_inj [lemma, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
list_cons_app_cons_eq_inv [lemma, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
list_app_cons_eq_inv [lemma, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
list_app_eq_inv [lemma, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
list_repeat_length [lemma, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
list_repeat_plus [lemma, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
list_repeat [definition, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
list_app_head_not_nil [lemma, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
list_injective_map [lemma, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
list_injective_rect [lemma, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
list_injective.HP1 [variable, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
list_injective.HP0 [variable, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
list_injective.P [variable, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
list_injective_inv [lemma, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
list_injective [definition, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
list_injective.X [variable, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
list_injective [section, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
list_upper_bound [lemma, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
list_fun_inv [definition, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
list_an_duplicate_inv [lemma, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
list_an_app_inv [lemma, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
list_an_spec [lemma, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
list_an_length [lemma, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
list_an_plus [lemma, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
list_an_S [lemma, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
list_an [definition, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
list_an [section, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
list_eq_nth_error [lemma, in Undecidability.TM.Util.VectorPrelim]
list_cc [lemma, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
list_exists_not_incl [lemma, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
list_exists_DM [lemma, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
list_exists_dec [instance, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
list_forall_dec [instance, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
list_in_dec [instance, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
list_cycle [lemma, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
list_encode_prefixInjective [lemma, in Complexity.TM.Code.DecodeList]
list_discrete_bij_nat [lemma, in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
list_discrete_bij_pos [lemma, in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
list_discr_pos_n [lemma, in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
list_discr_vec.f [variable, in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
list_discr_vec.Hv [variable, in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
list_discr_vec.v [variable, in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
list_discr_vec.Hl2 [variable, in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
list_discr_vec.Hl1 [variable, in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
list_discr_vec.l [variable, in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
list_discr_vec.ll [variable, in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
list_discr_vec.D [variable, in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
list_discr_vec.X [variable, in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
list_discr_vec [section, in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
list_ofFlatType_dec_poly [lemma, in Complexity.Libs.CookPrelim.FlatFinTypes]
list_ofFlatType_dec_time_bound [lemma, in Complexity.Libs.CookPrelim.FlatFinTypes]
list_ofFlatType_dec_time [definition, in Complexity.Libs.CookPrelim.FlatFinTypes]
list_ofFlatType_dec_correct [lemma, in Complexity.Libs.CookPrelim.FlatFinTypes]
list_ofFlatType_dec [definition, in Complexity.Libs.CookPrelim.FlatFinTypes]
list_finReprEl' [definition, in Complexity.Libs.CookPrelim.FlatFinTypes]
list_ofFlatType_cons [lemma, in Complexity.Libs.CookPrelim.FlatFinTypes]
list_ofFlatType_app [lemma, in Complexity.Libs.CookPrelim.FlatFinTypes]
list_ofFlatType [definition, in Complexity.Libs.CookPrelim.FlatFinTypes]
list_forall_exists [lemma, in Undecidability.Shared.FinTypeForallExists]
list_in_decb_time [definition, in Complexity.NP.SAT.SAT_inNP]
list_incl_dupfree_size [lemma, in Complexity.Libs.CookPrelim.PolyBounds]
list_rem_size_le [lemma, in Complexity.Libs.CookPrelim.PolyBounds]
list_dupfree_incl_length [lemma, in Complexity.Libs.CookPrelim.PolyBounds]
list_incl_decb_poly [lemma, in Complexity.Libs.CookPrelim.PolyBounds]
list_incl_decb_time_bound [lemma, in Complexity.Libs.CookPrelim.PolyBounds]
list_in_decb_poly [lemma, in Complexity.Libs.CookPrelim.PolyBounds]
list_in_decb_time_bound [lemma, in Complexity.Libs.CookPrelim.PolyBounds]
list_size_of_el [lemma, in Complexity.Libs.CookPrelim.PolyBounds]
list_size_enc_length [lemma, in Complexity.Libs.CookPrelim.PolyBounds]
list_size_length [lemma, in Complexity.Libs.CookPrelim.PolyBounds]
list_size_concat [lemma, in Complexity.Libs.CookPrelim.PolyBounds]
list_size_app [lemma, in Complexity.Libs.CookPrelim.PolyBounds]
list_size_cons [lemma, in Complexity.Libs.CookPrelim.PolyBounds]
list_subsequence_size_bound [lemma, in Complexity.Libs.CookPrelim.PolyBounds]
list_app_size_r [lemma, in Complexity.Libs.CookPrelim.PolyBounds]
list_app_size_l [lemma, in Complexity.Libs.CookPrelim.PolyBounds]
list_size_at_least [lemma, in Complexity.Libs.CookPrelim.PolyBounds]
list_app_size [lemma, in Complexity.Libs.CookPrelim.PolyBounds]
list_el_size_bound [lemma, in Complexity.Libs.CookPrelim.PolyBounds]
list_bool_next_total [lemma, in Undecidability.Shared.Libs.DLW.Utils.list_bool]
list_bool_succ_rect [lemma, in Undecidability.Shared.Libs.DLW.Utils.list_bool]
list_bool_succ_rect.list_bool_succ_rec [variable, in Undecidability.Shared.Libs.DLW.Utils.list_bool]
list_bool_succ_rect.HPS [variable, in Undecidability.Shared.Libs.DLW.Utils.list_bool]
list_bool_succ_rect.HP0 [variable, in Undecidability.Shared.Libs.DLW.Utils.list_bool]
list_bool_succ_rect.P [variable, in Undecidability.Shared.Libs.DLW.Utils.list_bool]
list_bool_succ_rect [section, in Undecidability.Shared.Libs.DLW.Utils.list_bool]
list_bool_succ_nat [lemma, in Undecidability.Shared.Libs.DLW.Utils.list_bool]
list_bool_next_neq_nil [lemma, in Undecidability.Shared.Libs.DLW.Utils.list_bool]
list_bool_next_spec [definition, in Undecidability.Shared.Libs.DLW.Utils.list_bool]
list_bool_next [definition, in Undecidability.Shared.Libs.DLW.Utils.list_bool]
list_bool_next.list_bool_next_def [variable, in Undecidability.Shared.Libs.DLW.Utils.list_bool]
list_bool_next [section, in Undecidability.Shared.Libs.DLW.Utils.list_bool]
list_bool_succ_neq_nil [lemma, in Undecidability.Shared.Libs.DLW.Utils.list_bool]
list_bool_succ_neq [lemma, in Undecidability.Shared.Libs.DLW.Utils.list_bool]
list_bool_succ_nil [lemma, in Undecidability.Shared.Libs.DLW.Utils.list_bool]
list_bool_succ_fun [lemma, in Undecidability.Shared.Libs.DLW.Utils.list_bool]
list_One_inj [lemma, in Undecidability.Shared.Libs.DLW.Utils.list_bool]
list_One_Zero_not [lemma, in Undecidability.Shared.Libs.DLW.Utils.list_bool]
list_One_Zero_inj [lemma, in Undecidability.Shared.Libs.DLW.Utils.list_bool]
list_bool_succ_props [section, in Undecidability.Shared.Libs.DLW.Utils.list_bool]
list_bool_succ [inductive, in Undecidability.Shared.Libs.DLW.Utils.list_bool]
list_bool_nat_ge_1 [lemma, in Undecidability.Shared.Libs.DLW.Utils.list_bool]
list_bool_nat [definition, in Undecidability.Shared.Libs.DLW.Utils.list_bool]
list_bool_valid_dec [lemma, in Undecidability.Shared.Libs.DLW.Utils.list_bool]
list_bool_invalid [definition, in Undecidability.Shared.Libs.DLW.Utils.list_bool]
list_bool_valid [definition, in Undecidability.Shared.Libs.DLW.Utils.list_bool]
list_bool_decomp [lemma, in Undecidability.Shared.Libs.DLW.Utils.list_bool]
list_nat_bool [definition, in Undecidability.Shared.Libs.DLW.Utils.list_bool]
list_bool_choose_sym [lemma, in Undecidability.Shared.Libs.DLW.Utils.list_bool]
list_bool_choose [lemma, in Undecidability.Shared.Libs.DLW.Utils.list_bool]
list_bool_dec [lemma, in Undecidability.Shared.Libs.DLW.Utils.list_bool]
list_length_neq [lemma, in Undecidability.TM.Code.CompareValue]
list_incl_dupfree_size [lemma, in Complexity.Complexity.UpToCPoly]
list_rem_size_le [lemma, in Complexity.Complexity.UpToCPoly]
list_dupfree_incl_length [lemma, in Complexity.Complexity.UpToCPoly]
list_size_of_el [lemma, in Complexity.Complexity.UpToCPoly]
list_size_enc_length [lemma, in Complexity.Complexity.UpToCPoly]
list_size_length [lemma, in Complexity.Complexity.UpToCPoly]
list_size_concat [lemma, in Complexity.Complexity.UpToCPoly]
list_size_app [lemma, in Complexity.Complexity.UpToCPoly]
list_size_cons [lemma, in Complexity.Complexity.UpToCPoly]
list_subsequence_size_bound [lemma, in Complexity.Complexity.UpToCPoly]
list_app_size_r [lemma, in Complexity.Complexity.UpToCPoly]
list_app_size_l [lemma, in Complexity.Complexity.UpToCPoly]
list_size_at_least [lemma, in Complexity.Complexity.UpToCPoly]
list_app_size [lemma, in Complexity.Complexity.UpToCPoly]
list_el_size_bound [lemma, in Complexity.Complexity.UpToCPoly]
list_exists [lemma, in Undecidability.Shared.Libs.DLW.Utils.php]
list_has_dup_map_inv [lemma, in Undecidability.Shared.Libs.DLW.Utils.php]
list_has_dup_equiv [definition, in Undecidability.Shared.Libs.DLW.Utils.php]
list_has_dup_eq_duplicates [lemma, in Undecidability.Shared.Libs.DLW.Utils.php]
list_has_dup_app_inv [lemma, in Undecidability.Shared.Libs.DLW.Utils.php]
list_has_dup_app_right [lemma, in Undecidability.Shared.Libs.DLW.Utils.php]
list_has_dup_app_left [lemma, in Undecidability.Shared.Libs.DLW.Utils.php]
list_has_dup_cons_inv [definition, in Undecidability.Shared.Libs.DLW.Utils.php]
list_hd_cons_inv [lemma, in Undecidability.Shared.Libs.DLW.Utils.php]
list_has_dup [inductive, in Undecidability.Shared.Libs.DLW.Utils.php]
list_sum_le_max_times_length [lemma, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
list_sum_le_upperBound_times_length [lemma, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
list_sum_shift [lemma, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
list_sum [definition, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
list_prod_spec [lemma, in Undecidability.Shared.Libs.DLW.Utils.fin_base]
list_prod [definition, in Undecidability.Shared.Libs.DLW.Utils.fin_base]
list_comperasion_cons [definition, in Undecidability.TM.Compound.Compare]
list_comperasion [definition, in Undecidability.TM.Compound.Compare]
list_eqbTime_bound_r [lemma, in Undecidability.L.Datatypes.List.List_eqb]
list_eqbTime_leq [definition, in Undecidability.L.Datatypes.List.List_eqb]
list_eqbTime [definition, in Undecidability.L.Datatypes.List.List_eqb]
list_eqb_spec [lemma, in Undecidability.L.Datatypes.List.List_eqb]
list_eqb [definition, in Undecidability.L.Datatypes.List.List_eqb]
list_eqb.spec [variable, in Undecidability.L.Datatypes.List.List_eqb]
list_eqb.eqb [variable, in Undecidability.L.Datatypes.List.List_eqb]
list_eqb.X [variable, in Undecidability.L.Datatypes.List.List_eqb]
list_eqb [section, in Undecidability.L.Datatypes.List.List_eqb]
list_bound [lemma, in Complexity.L.AbstractMachines.AbstractHeapMachine]
list_enumerator__T0:133 [binder, in Undecidability.Synthetic.ListEnumerabilityFacts]
list_enumerator_to_cumul [lemma, in Undecidability.Synthetic.ListEnumerabilityFacts]
list_enumerable__T_enumerable [lemma, in Undecidability.Synthetic.ListEnumerabilityFacts]
list_enumerable_enumerable [lemma, in Undecidability.Synthetic.ListEnumerabilityFacts]
list_enumerator_enumerator [lemma, in Undecidability.Synthetic.ListEnumerabilityFacts]
list_enumerator_to_enumerator [lemma, in Undecidability.Synthetic.ListEnumerabilityFacts]
list_enumerable__T [definition, in Undecidability.Synthetic.ListEnumerabilityFacts]
list_enumerator__T [abbreviation, in Undecidability.Synthetic.ListEnumerabilityFacts]
list_enumerator__T' [definition, in Undecidability.Synthetic.ListEnumerabilityFacts]
list_enumerable [definition, in Undecidability.Synthetic.ListEnumerabilityFacts]
list_enumerator [definition, in Undecidability.Synthetic.ListEnumerabilityFacts]
list_choose_dep [lemma, in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
list_choose_dep.Q [variable, in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
list_choose_dep.P [variable, in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
list_choose_dep.X [variable, in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
list_choose_dep [section, in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
list_choose_d [lemma, in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
list_choose_d.Q [variable, in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
list_choose_d.P [variable, in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
list_choose_d.X [variable, in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
list_choose_d [section, in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
list_incl_decb_time [definition, in Undecidability.L.Datatypes.List.List_in]
list_in_decb_time [definition, in Undecidability.L.Datatypes.List.List_in]
list_in_time.X [variable, in Undecidability.L.Datatypes.List.List_in]
list_in_time [section, in Undecidability.L.Datatypes.List.List_in]
list_incl_decb_iff' [lemma, in Undecidability.L.Datatypes.List.List_in]
list_incl_decb_iff [lemma, in Undecidability.L.Datatypes.List.List_in]
list_incl_decb [definition, in Undecidability.L.Datatypes.List.List_in]
list_in_decb_iff' [lemma, in Undecidability.L.Datatypes.List.List_in]
list_in_decb_iff [lemma, in Undecidability.L.Datatypes.List.List_in]
list_in_decb [definition, in Undecidability.L.Datatypes.List.List_in]
list_in.eqb_correct [variable, in Undecidability.L.Datatypes.List.List_in]
list_in.eqb [variable, in Undecidability.L.Datatypes.List.List_in]
list_in.X [variable, in Undecidability.L.Datatypes.List.List_in]
list_in [section, in Undecidability.L.Datatypes.List.List_in]
list_isFlatEnvOf_map [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
list_length_le3 [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
list_length_le2 [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
list_length_le1 [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
list_length_le0 [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
list_finReprEl [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
list_isFlatEnvOf [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
list_prod [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
list_eq_dec [instance, in Undecidability.Shared.Dec]
list_dec_choose_one [lemma, in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
list_discrete_choice [lemma, in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
list_reif_t [lemma, in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
list_in_dec [instance, in Undecidability.Shared.ListAutomation]
list_has_dup_seteq [lemma, in Undecidability.Shared.Libs.DLW.Utils.seteq]
list_decode [definition, in Undecidability.L.Functions.Decoding]
list_eqn_length [lemma, in Complexity.Libs.CookPrelim.MorePrelim]
list_eq_nth_error [lemma, in Complexity.Libs.CookPrelim.MorePrelim]
list_eq_length [lemma, in Complexity.Libs.CookPrelim.MorePrelim]
list_length_split2 [lemma, in Complexity.Libs.CookPrelim.MorePrelim]
list_length_split1 [lemma, in Complexity.Libs.CookPrelim.MorePrelim]
List_enc [library]
List_fold [library]
List_extra [library]
List_in [library]
List_nat [library]
List_eqb [library]
list_bool [library]
List_basics [library]
list_focus [library]
literal [abbreviation, in Complexity.NP.SAT.SAT]
literalInClause_exists_vertex [lemma, in Complexity.NP.Clique.kSAT_to_Clique]
literalsConflict [definition, in Complexity.NP.Clique.kSAT_to_Clique]
literalsConflict_dec [lemma, in Complexity.NP.Clique.kSAT_to_Clique]
literalsConflict_symm [lemma, in Complexity.NP.Clique.kSAT_to_Clique]
literalsConflict_decb_time [definition, in Complexity.NP.Clique.kSAT_to_FlatClique]
literalsConflict_decb_iff [lemma, in Complexity.NP.Clique.kSAT_to_FlatClique]
literalsConflict_decb [definition, in Complexity.NP.Clique.kSAT_to_FlatClique]
lits:134 [binder, in Complexity.NP.Clique.kSAT_to_Clique]
li':67 [binder, in Complexity.NP.Clique.kSAT_to_Clique]
li1:113 [binder, in Complexity.NP.Clique.kSAT_to_Clique]
li1:27 [binder, in Complexity.NP.Clique.kSAT_to_Clique]
li1:29 [binder, in Complexity.NP.Clique.kSAT_to_FlatClique]
li1:35 [binder, in Complexity.NP.Clique.kSAT_to_FlatClique]
li2:114 [binder, in Complexity.NP.Clique.kSAT_to_Clique]
li2:27 [binder, in Complexity.NP.Clique.kSAT_to_FlatClique]
li2:29 [binder, in Complexity.NP.Clique.kSAT_to_Clique]
li2:37 [binder, in Complexity.NP.Clique.kSAT_to_FlatClique]
li:105 [binder, in Complexity.NP.Clique.kSAT_to_Clique]
li:109 [binder, in Complexity.NP.Clique.kSAT_to_Clique]
li:118 [binder, in Complexity.NP.Clique.kSAT_to_Clique]
li:121 [binder, in Complexity.NP.Clique.kSAT_to_Clique]
li:150 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
li:39 [binder, in Complexity.NP.Clique.kSAT_to_FlatClique]
li:48 [binder, in Complexity.NP.Clique.kSAT_to_Clique]
li:5 [binder, in Complexity.NP.Clique.kSAT_to_FlatClique]
li:58 [binder, in Complexity.NP.Clique.kSAT_to_Clique]
li:62 [binder, in Complexity.NP.Clique.kSAT_to_Clique]
li:66 [binder, in Complexity.NP.Clique.kSAT_to_Clique]
li:79 [binder, in Complexity.NP.Clique.kSAT_to_FlatClique]
li:8 [binder, in Complexity.NP.Clique.kSAT_to_FlatClique]
li:84 [binder, in Complexity.NP.Clique.kSAT_to_Clique]
li:89 [binder, in Complexity.NP.Clique.kSAT_to_FlatClique]
li:9 [binder, in Complexity.NP.Clique.kSAT_to_FlatClique]
li:92 [binder, in Complexity.NP.Clique.kSAT_to_FlatClique]
li:96 [binder, in Complexity.NP.Clique.kSAT_to_FlatClique]
li:99 [binder, in Complexity.NP.Clique.kSAT_to_FlatClique]
LL [definition, in Undecidability.Synthetic.Infinite]
llength [definition, in Undecidability.TM.Compound.MoveToSymbol]
llength [definition, in Undecidability.TM.Compound.CopySymbols]
llength [abbreviation, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
llength' [definition, in Undecidability.TM.Compound.CopySymbols]
LL_F [lemma, in Undecidability.Synthetic.Infinite]
LL_f [lemma, in Undecidability.Synthetic.Infinite]
LL_cum [lemma, in Undecidability.Synthetic.Infinite]
ll':407 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
ll:100 [binder, in Undecidability.Shared.Libs.DLW.Utils.php]
ll:107 [binder, in Undecidability.Shared.Libs.DLW.Utils.php]
ll:113 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
ll:115 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
ll:119 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
ll:12 [binder, in Undecidability.Shared.Libs.DLW.Code.compiler]
ll:122 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
ll:124 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
ll:124 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
ll:126 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
ll:128 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
ll:131 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
ll:141 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
ll:15 [binder, in Undecidability.Shared.Libs.DLW.Code.compiler]
ll:157 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
ll:16 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_upto]
ll:162 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
ll:189 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
ll:20 [binder, in Undecidability.Shared.Libs.DLW.Code.compiler]
ll:22 [binder, in Undecidability.Shared.Libs.DLW.Wf.wf_incl]
ll:228 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
ll:231 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
ll:234 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
ll:24 [binder, in Undecidability.Shared.Libs.DLW.Code.compiler]
ll:243 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
ll:252 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
ll:256 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
ll:259 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
ll:266 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
ll:28 [binder, in Undecidability.Shared.Libs.DLW.Code.compiler]
ll:296 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
ll:302 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
ll:309 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
ll:325 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
ll:33 [binder, in Undecidability.Shared.Libs.DLW.Code.compiler]
ll:330 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
ll:335 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
ll:342 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
ll:37 [binder, in Undecidability.Shared.Libs.DLW.Code.compiler]
ll:396 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
ll:404 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
ll:413 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
ll:42 [binder, in Undecidability.Shared.Libs.DLW.Code.compiler]
ll:423 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
ll:433 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
ll:439 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
ll:44 [binder, in Undecidability.Shared.Libs.DLW.Code.compiler]
ll:443 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
ll:448 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
ll:451 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
ll:456 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
ll:467 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
ll:472 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
ll:52 [binder, in Undecidability.Shared.Libs.DLW.Code.compiler]
ll:53 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
ll:60 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
ll:62 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
ll:72 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
ll:8 [binder, in Undecidability.Shared.Libs.DLW.Wf.wf_incl]
LM [module, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
lmax [definition, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
lmax_prop [lemma, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
lmax_spec [lemma, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
LMBounds [library]
LMBounds_Loop [library]
LMGenNP [definition, in Complexity.NP.L.LMGenNP]
LMGenNP [library]
LMGenNP_to_TMGenNP [lemma, in Complexity.NP.SAT.CookLevin]
LMGenNP_to_TMGenNP_mTM.M__mono [variable, in Complexity.NP.TM.mTM_to_singleTapeTM]
LMGenNP_to_TMGenNP_mTM [section, in Complexity.NP.TM.mTM_to_singleTapeTM]
LMGenNP_to_TMGenNP_mTM [lemma, in Complexity.NP.TM.LM_to_mTM]
LMGenNP' [definition, in Complexity.NP.L.LMGenNP]
LMHaltsOrDiverges [definition, in Complexity.NP.L.LMGenNP]
Lmove [constructor, in Undecidability.TM.TM]
Lmove [constructor, in Undecidability.TM.SBTM]
LMtoTM [module, in Complexity.NP.TM.M_LM2TM]
LMtoTM.M [definition, in Complexity.NP.TM.M_LM2TM]
LMtoTM.Realise [definition, in Complexity.NP.TM.M_LM2TM]
LMtoTM.Rel [definition, in Complexity.NP.TM.M_LM2TM]
LMtoTM.retr__nat [definition, in Complexity.NP.TM.M_LM2TM]
LMtoTM.retr__pro [definition, in Complexity.NP.TM.M_LM2TM]
LMtoTM.retr__HClos [definition, in Complexity.NP.TM.M_LM2TM]
LMtoTM.retr__Heap [definition, in Complexity.NP.TM.M_LM2TM]
LMtoTM.retr__listHClos [definition, in Complexity.NP.TM.M_LM2TM]
LMtoTM.sec [section, in Complexity.NP.TM.M_LM2TM]
LMtoTM.sec.sig [variable, in Complexity.NP.TM.M_LM2TM]
LMtoTM.size_compile_list_bool [lemma, in Complexity.NP.TM.M_LM2TM]
LMtoTM.Ter [definition, in Complexity.NP.TM.M_LM2TM]
LMtoTM.Terminates [definition, in Complexity.NP.TM.M_LM2TM]
LMtoTM._Terminates [definition, in Complexity.NP.TM.M_LM2TM]
LM_Lookup_nice.heap_greatest_address_size [lemma, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
LM_Lookup_nice.Encode_list_hasSize_ge_max [lemma, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
LM_Lookup_nice.heap_greatest_address_bounded [lemma, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
LM_Lookup_nice.heap_global_greatest_address_ge [lemma, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
LM_Lookup_nice.heap_global_greatest_address [definition, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
LM_Lookup_nice.heap_global_greatest_address_helper [definition, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
LM_Lookup_nice.heap_global_greatest_address_Bound [section, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
LM_Lookup_nice.heap_greatest_address_leq [lemma, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
LM_Lookup_nice.heap_greatest_address2 [definition, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
LM_Lookup_nice.heap_greatest_address_invalid [lemma, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
LM_Lookup_nice.Lookup_steps_nice [lemma, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
LM_Lookup_nice.max_mult [lemma, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
LM_Lookup_nice.max_plus [lemma, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
LM_Lookup_nice.Encode_nat_hasSize_max [lemma, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
LM_Lookup_nice.ge1_mul [lemma, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
LM_Lookup_nice.heap_greatest_address_eq [lemma, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
LM_Lookup_nice.heap_greatest_address [definition, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
LM_Lookup_nice.Lookup_steps_eq [lemma, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
LM_Lookup_nice.Lookup_Step_steps_nice [lemma, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
LM_Lookup_nice.Lookup_Step_steps_Nth'_nice [lemma, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
LM_Lookup_nice.Lookup_Step_steps_CaseOption_nice [lemma, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
LM_Lookup_nice.Lookup_Step_steps_CaseNat_nice [lemma, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
LM_Lookup_nice [module, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
LM_heap_def [library]
LM_heap_correct [library]
LM_to_mTM [library]
LM.ConsClos_steps_nice [lemma, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
LM.Encode_Heap_hasSize_ge_length [lemma, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
LM.heap_greatest_address_ge [lemma, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
LM.jumpTarget_size_fab [lemma, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
LM.jumpTarget_size [lemma, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
LM.jumpTarget_size' [lemma, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
LM.lookup_size [lemma, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
LM.Put_steps_nice [lemma, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
LM.size_length_heap [lemma, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
LM.Step_steps_nice [lemma, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
LM.Step_steps_CaseList_nice [lemma, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
LM.Step_steps_CaseList'_nice [lemma, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
LM.Step_steps_CaseCom_nice [lemma, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
LM.Step_var_steps_nice' [lemma, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
LM.Step_var_steps_Lookup_nice [lemma, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
LM.Step_app_steps_nice [lemma, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
LM.Step_app_steps_CaseList_nice [lemma, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
LM.Step_app_steps_CaseList'_nice [lemma, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
LM.Step_lam_steps_nice [lemma, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
LM.Step_lam_steps_nice' [lemma, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
LM.Step_lam_steps_JumpTarget_nice [lemma, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
LM.TailRec_steps_nice [lemma, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
LNat [library]
lnk [abbreviation, in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
lnk:23 [binder, in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
lnk:5 [binder, in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
lnk:82 [binder, in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
ln:11 [binder, in Undecidability.Shared.Libs.DLW.Utils.list_bool]
ln:16 [binder, in Undecidability.Shared.Libs.DLW.Utils.list_bool]
ln:19 [binder, in Undecidability.Shared.Libs.DLW.Utils.list_bool]
ln:24 [binder, in Undecidability.Shared.Libs.DLW.Utils.list_bool]
ln:28 [binder, in Undecidability.Shared.Libs.DLW.Utils.list_bool]
ln:35 [binder, in Undecidability.Shared.Libs.DLW.Utils.list_bool]
ln:36 [binder, in Undecidability.Shared.Libs.DLW.Utils.list_bool]
Lock [definition, in Undecidability.Shared.Libs.PSL.Tactics.Tactics]
logical [lemma, in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
lookup [definition, in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
lookup [definition, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
lookup [definition, in Undecidability.L.Functions.FinTypeLookup]
Lookup [section, in Undecidability.L.Functions.FinTypeLookup]
Lookup [definition, in Undecidability.TM.Univ.LookupAssociativeListTM]
lookup [definition, in Undecidability.TM.Univ.LookupAssociativeListTM]
Lookup [definition, in Undecidability.TM.L.HeapInterpreter.LookupTM]
Lookup [section, in Undecidability.TM.L.HeapInterpreter.LookupTM]
lookup [definition, in Undecidability.Shared.Libs.PSL.FiniteTypes.FiniteFunction]
Lookup [library]
LookupAssociativeList [section, in Undecidability.TM.Univ.LookupAssociativeListTM]
LookupAssociativeListTM [library]
LookupAssociativeList.cX [variable, in Undecidability.TM.Univ.LookupAssociativeListTM]
LookupAssociativeList.cX_injective [variable, in Undecidability.TM.Univ.LookupAssociativeListTM]
LookupAssociativeList.cY [variable, in Undecidability.TM.Univ.LookupAssociativeListTM]
LookupAssociativeList.sigX [variable, in Undecidability.TM.Univ.LookupAssociativeListTM]
LookupAssociativeList.sigY [variable, in Undecidability.TM.Univ.LookupAssociativeListTM]
LookupAssociativeList.X [variable, in Undecidability.TM.Univ.LookupAssociativeListTM]
LookupAssociativeList.Y [variable, in Undecidability.TM.Univ.LookupAssociativeListTM]
lookupTime [definition, in Complexity.L.AbstractMachines.Computable.Lookup]
lookupTime [definition, in Undecidability.L.Functions.FinTypeLookup]
lookupTime_mono [lemma, in Complexity.L.AbstractMachines.Computable.Lookup]
lookupTime_leq [lemma, in Undecidability.L.Functions.FinTypeLookup]
LookupTM [library]
Lookup_size_nice [lemma, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
Lookup_Loop_size_nice [lemma, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
lookup_hd_incl [lemma, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
lookup_hd [definition, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
Lookup_Step_size_nice_neq [lemma, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
Lookup_Step_size_nice_eq [lemma, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
Lookup_size_nice.cY [variable, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
Lookup_size_nice.cX [variable, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
Lookup_size_nice.Y [variable, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
Lookup_size_nice.X [variable, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
Lookup_size_nice.sigY [variable, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
Lookup_size_nice.sigX [variable, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
Lookup_size_nice [section, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
lookup_eq [lemma, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
lookup_el [lemma, in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisUnfoldClos]
lookup_extend [lemma, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
lookup_el [lemma, in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisStep]
lookup_graph [lemma, in Undecidability.TM.Univ.LowLevel]
lookup_map [lemma, in Undecidability.TM.Univ.LowLevel]
lookup_In' [lemma, in Undecidability.TM.Univ.LowLevel]
lookup_In [lemma, in Undecidability.TM.Univ.LowLevel]
lookup_sound' [lemma, in Complexity.L.TM.TMunflatten]
lookup_size [lemma, in Complexity.L.AbstractMachines.AbstractHeapMachine]
lookup_el [lemma, in Complexity.L.AbstractMachines.AbstractHeapMachine]
lookup_extend [lemma, in Complexity.L.AbstractMachines.AbstractHeapMachine]
lookup_index_vector_None [lemma, in Undecidability.TM.Lifting.LiftTapes]
lookup_index_vector_Some' [lemma, in Undecidability.TM.Lifting.LiftTapes]
lookup_index_vector_Some [lemma, in Undecidability.TM.Lifting.LiftTapes]
lookup_index_vector [definition, in Undecidability.TM.Lifting.LiftTapes]
lookup_complete [lemma, in Undecidability.L.Functions.FinTypeLookup]
lookup_sound [lemma, in Undecidability.L.Functions.FinTypeLookup]
lookup_sound' [lemma, in Undecidability.L.Functions.FinTypeLookup]
lookup_funTable [lemma, in Undecidability.L.Functions.FinTypeLookup]
Lookup_Terminates [lemma, in Undecidability.TM.Univ.LookupAssociativeListTM]
Lookup_T [definition, in Undecidability.TM.Univ.LookupAssociativeListTM]
Lookup_Realise [lemma, in Undecidability.TM.Univ.LookupAssociativeListTM]
Lookup_SpecT_space [lemma, in Undecidability.TM.Univ.LookupAssociativeListTM]
Lookup_steps [definition, in Undecidability.TM.Univ.LookupAssociativeListTM]
Lookup_Rel [definition, in Undecidability.TM.Univ.LookupAssociativeListTM]
Lookup_size [definition, in Undecidability.TM.Univ.LookupAssociativeListTM]
Lookup_Loop_SpecT_space [lemma, in Undecidability.TM.Univ.LookupAssociativeListTM]
Lookup_Loop_steps [definition, in Undecidability.TM.Univ.LookupAssociativeListTM]
Lookup_Loop_size [definition, in Undecidability.TM.Univ.LookupAssociativeListTM]
Lookup_Loop [definition, in Undecidability.TM.Univ.LookupAssociativeListTM]
Lookup_Step_SpecT_space [lemma, in Undecidability.TM.Univ.LookupAssociativeListTM]
Lookup_Step_steps [definition, in Undecidability.TM.Univ.LookupAssociativeListTM]
Lookup_Step_steps_CaseList [definition, in Undecidability.TM.Univ.LookupAssociativeListTM]
Lookup_Step_steps_Compare [definition, in Undecidability.TM.Univ.LookupAssociativeListTM]
Lookup_Step_size [definition, in Undecidability.TM.Univ.LookupAssociativeListTM]
Lookup_Step [definition, in Undecidability.TM.Univ.LookupAssociativeListTM]
Lookup_Terminates [lemma, in Undecidability.TM.L.HeapInterpreter.LookupTM]
Lookup_T [definition, in Undecidability.TM.L.HeapInterpreter.LookupTM]
Lookup_Realise [lemma, in Undecidability.TM.L.HeapInterpreter.LookupTM]
Lookup_SpecT_space [lemma, in Undecidability.TM.L.HeapInterpreter.LookupTM]
Lookup_steps [definition, in Undecidability.TM.L.HeapInterpreter.LookupTM]
Lookup_Rel [definition, in Undecidability.TM.L.HeapInterpreter.LookupTM]
Lookup_size_eq [lemma, in Undecidability.TM.L.HeapInterpreter.LookupTM]
Lookup_size [definition, in Undecidability.TM.L.HeapInterpreter.LookupTM]
Lookup_Step_SpecT_space [lemma, in Undecidability.TM.L.HeapInterpreter.LookupTM]
Lookup_Step_steps [definition, in Undecidability.TM.L.HeapInterpreter.LookupTM]
Lookup_Step_steps_Nth' [definition, in Undecidability.TM.L.HeapInterpreter.LookupTM]
Lookup_Step_steps_CaseOption [definition, in Undecidability.TM.L.HeapInterpreter.LookupTM]
Lookup_Step_steps_CaseNat [definition, in Undecidability.TM.L.HeapInterpreter.LookupTM]
Lookup_Step_size [definition, in Undecidability.TM.L.HeapInterpreter.LookupTM]
Lookup_Step [definition, in Undecidability.TM.L.HeapInterpreter.LookupTM]
lookup_complete [lemma, in Undecidability.Shared.Libs.PSL.FiniteTypes.FiniteFunction]
lookup_sound [lemma, in Undecidability.Shared.Libs.PSL.FiniteTypes.FiniteFunction]
Lookup.retr_heap_lookup [variable, in Undecidability.TM.L.HeapInterpreter.LookupTM]
Lookup.retr_clos_lookup [variable, in Undecidability.TM.L.HeapInterpreter.LookupTM]
Lookup.sigLookup [variable, in Undecidability.TM.L.HeapInterpreter.LookupTM]
Lookup.X [variable, in Undecidability.L.Functions.FinTypeLookup]
Lookup.Y [variable, in Undecidability.L.Functions.FinTypeLookup]
Loop [definition, in Undecidability.TM.Single.StepTM]
loop [definition, in Undecidability.TM.Util.Prelim]
Loop [section, in Undecidability.TM.Util.Prelim]
Loop [definition, in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
LoopLift [section, in Undecidability.TM.Util.Prelim]
LoopLift.A [variable, in Undecidability.TM.Util.Prelim]
LoopLift.B [variable, in Undecidability.TM.Util.Prelim]
LoopLift.f [variable, in Undecidability.TM.Util.Prelim]
LoopLift.f' [variable, in Undecidability.TM.Util.Prelim]
LoopLift.h [variable, in Undecidability.TM.Util.Prelim]
LoopLift.halt_lift_comp [variable, in Undecidability.TM.Util.Prelim]
LoopLift.h' [variable, in Undecidability.TM.Util.Prelim]
LoopLift.lift [variable, in Undecidability.TM.Util.Prelim]
LoopLift.step_lift_comp [variable, in Undecidability.TM.Util.Prelim]
loopM [section, in Undecidability.L.TM.TMinL]
loopM [section, in Undecidability.L.TM.TMinL.TMinL_extract]
loopM [definition, in Undecidability.TM.Util.TM_facts]
LoopMerge [section, in Undecidability.TM.Util.Prelim]
LoopMerge.A [variable, in Undecidability.TM.Util.Prelim]
LoopMerge.f [variable, in Undecidability.TM.Util.Prelim]
LoopMerge.h [variable, in Undecidability.TM.Util.Prelim]
LoopMerge.halt_comp [variable, in Undecidability.TM.Util.Prelim]
LoopMerge.h' [variable, in Undecidability.TM.Util.Prelim]
loopMflat [definition, in Complexity.L.TM.TMflatFun]
loopMflat_time_nice [lemma, in Complexity.L.TM.TMflatComp]
loopMflat_timeNice [definition, in Complexity.L.TM.TMflatComp]
loopMflat_time [definition, in Complexity.L.TM.TMflatComp]
loopMflat_correct [lemma, in Complexity.L.TM.TMflatFun]
loopM_halt' [lemma, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
loopM_halt [lemma, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
loopM_halt [lemma, in Complexity.NP.SAT.CookLevin.Subproblems.TM_single]
loopM.eqb_state [variable, in Undecidability.L.TM.TMinL.TMinL_extract]
loopM.eqb_sig [variable, in Undecidability.L.TM.TMinL.TMinL_extract]
loopM.M [variable, in Undecidability.L.TM.TMinL.TMinL_extract]
loopM.n [variable, in Undecidability.L.TM.TMinL.TMinL_extract]
loopM.reg_state [variable, in Undecidability.L.TM.TMinL.TMinL_extract]
loopM.reg_sig [variable, in Undecidability.L.TM.TMinL.TMinL_extract]
loopSum [section, in Undecidability.L.Functions.LoopSum]
loopSum [definition, in Undecidability.L.Prelim.LoopSum]
LoopSum [library]
LoopSum [library]
loopSum_rel_correct2 [lemma, in Undecidability.L.Prelim.LoopSum]
loopSum_sound_rel [lemma, in Undecidability.L.Prelim.LoopSum]
loopSum_mono [definition, in Undecidability.L.Prelim.LoopSum]
loopSum.X [variable, in Undecidability.L.Functions.LoopSum]
loopSum.Y [variable, in Undecidability.L.Functions.LoopSum]
loopTime [definition, in Undecidability.L.TM.TapeFuns]
Loop_steps_nice [lemma, in Complexity.TM.PrettyBounds.M2MBounds]
Loop_steps_asym_bounded' [lemma, in Complexity.TM.PrettyBounds.M2MBounds]
Loop_steps_nice_final [lemma, in Complexity.TM.PrettyBounds.M2MBounds]
Loop_steps_asym_bounded [lemma, in Complexity.TM.PrettyBounds.M2MBounds]
Loop_steps_asym_nice [lemma, in Complexity.TM.PrettyBounds.M2MBounds]
Loop_steps_asym_halt [lemma, in Complexity.TM.PrettyBounds.M2MBounds]
Loop_steps_asym [definition, in Complexity.TM.PrettyBounds.M2MBounds]
Loop_Terminates [lemma, in Undecidability.TM.Single.StepTM]
Loop_T [definition, in Undecidability.TM.Single.StepTM]
Loop_steps_eq [lemma, in Undecidability.TM.Single.StepTM]
Loop_steps [definition, in Undecidability.TM.Single.StepTM]
Loop_Realise [lemma, in Undecidability.TM.Single.StepTM]
Loop_Rel [definition, in Undecidability.TM.Single.StepTM]
Loop_steps_nice [lemma, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds_Loop]
Loop_steps_nice' [lemma, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds_Loop]
loop_split [lemma, in Undecidability.TM.Util.Prelim]
loop_merge [lemma, in Undecidability.TM.Util.Prelim]
loop_unlift [lemma, in Undecidability.TM.Util.Prelim]
loop_lift [lemma, in Undecidability.TM.Util.Prelim]
loop_monotone [lemma, in Undecidability.TM.Util.Prelim]
loop_eq_0 [lemma, in Undecidability.TM.Util.Prelim]
loop_0 [lemma, in Undecidability.TM.Util.Prelim]
loop_fulfills [lemma, in Undecidability.TM.Util.Prelim]
loop_injective [lemma, in Undecidability.TM.Util.Prelim]
loop_step [lemma, in Undecidability.TM.Util.Prelim]
loop_relpower_agree [lemma, in Complexity.NP.SAT.CookLevin.Subproblems.TM_single]
loop_map [lemma, in Undecidability.TM.Lifting.LiftTapes]
loop_map.step_map_comp [variable, in Undecidability.TM.Lifting.LiftTapes]
loop_map.g [variable, in Undecidability.TM.Lifting.LiftTapes]
loop_map.h [variable, in Undecidability.TM.Lifting.LiftTapes]
loop_map.f [variable, in Undecidability.TM.Lifting.LiftTapes]
loop_map.B [variable, in Undecidability.TM.Lifting.LiftTapes]
loop_map.A [variable, in Undecidability.TM.Lifting.LiftTapes]
loop_map [section, in Undecidability.TM.Lifting.LiftTapes]
Loop_Terminates [lemma, in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
Loop_T [definition, in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
Loop_steps [definition, in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
Loop_Realise [lemma, in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
Loop_Rel [definition, in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
Loop_size_step [lemma, in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
Loop_size [definition, in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
Loop.A [variable, in Undecidability.TM.Util.Prelim]
Loop.f [variable, in Undecidability.TM.Util.Prelim]
Loop.p [variable, in Undecidability.TM.Util.Prelim]
LOptions [library]
lower:14 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
lower:19 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
lower:22 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
LowLevel [library]
lpreludeRules [abbreviation, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
LPro [library]
Lproc [library]
lprod [abbreviation, in Undecidability.Shared.Libs.DLW.Utils.prime]
LProd [library]
lprod_app [lemma, in Undecidability.Shared.Libs.DLW.Utils.prime]
lprod_ge_1 [lemma, in Undecidability.Shared.Libs.DLW.Utils.prime]
lp:10 [binder, in Undecidability.TM.Code.BinNumbers.PosPointers]
lp:13 [binder, in Undecidability.TM.Code.BinNumbers.PosPointers]
lp:18 [binder, in Undecidability.TM.Code.BinNumbers.PosPointers]
lp:2 [binder, in Undecidability.TM.Code.BinNumbers.PosPointers]
lp:23 [binder, in Undecidability.TM.Code.BinNumbers.PosPointers]
lp:26 [binder, in Undecidability.TM.Code.BinNumbers.PosPointers]
lP:479 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
lp:7 [binder, in Undecidability.TM.Code.BinNumbers.PosPointers]
lQ:480 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
Lrewrite [library]
LrewriteTime_helper_index [lemma, in Undecidability.L.Tactics.Lrewrite]
LrewriteTime_helper [lemma, in Undecidability.L.Tactics.Lrewrite]
Lrewrite_in_helper [lemma, in Undecidability.L.Tactics.Lrewrite]
Lrewrite_equiv_helper [lemma, in Undecidability.L.Tactics.Lrewrite]
Lrewrite_helper [lemma, in Undecidability.L.Tactics.Lrewrite]
Lsimpl [library]
lStep [lemma, in Undecidability.L.Tactics.Lbeta_nonrefl]
lst:22 [binder, in Undecidability.TM.Univ.LowLevel]
lst:28 [binder, in Undecidability.TM.Univ.LowLevel]
lst:36 [binder, in Undecidability.TM.Univ.LowLevel]
lsum [abbreviation, in Undecidability.Shared.Libs.DLW.Code.compiler]
lsum [definition, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
LSum [library]
lsum_le [lemma, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
lsum_app [lemma, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
ls':126 [binder, in Undecidability.TM.Compound.Shift]
ls':152 [binder, in Undecidability.TM.Compound.MoveToSymbol]
ls':159 [binder, in Undecidability.TM.Compound.MoveToSymbol]
ls':179 [binder, in Undecidability.TM.Util.TM_facts]
ls':188 [binder, in Undecidability.TM.Compound.MoveToSymbol]
ls':189 [binder, in Undecidability.TM.Util.TM_facts]
ls':193 [binder, in Undecidability.TM.Compound.MoveToSymbol]
ls':34 [binder, in Undecidability.TM.Code.Copy]
ls':42 [binder, in Undecidability.TM.Code.Copy]
ls':68 [binder, in Undecidability.TM.Code.Copy]
ls':72 [binder, in Undecidability.TM.Code.Copy]
ls1:118 [binder, in Undecidability.TM.Compound.Compare]
ls1:137 [binder, in Undecidability.TM.Compound.Compare]
ls1:157 [binder, in Undecidability.TM.Compound.Compare]
ls1:168 [binder, in Undecidability.TM.Compound.Compare]
ls1:186 [binder, in Undecidability.TM.Compound.Compare]
ls1:196 [binder, in Undecidability.TM.Compound.Compare]
ls1:210 [binder, in Undecidability.TM.Compound.Compare]
ls1:220 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
ls2:120 [binder, in Undecidability.TM.Compound.Compare]
ls2:138 [binder, in Undecidability.TM.Compound.Compare]
ls2:159 [binder, in Undecidability.TM.Compound.Compare]
ls2:170 [binder, in Undecidability.TM.Compound.Compare]
ls2:187 [binder, in Undecidability.TM.Compound.Compare]
ls2:197 [binder, in Undecidability.TM.Compound.Compare]
ls2:211 [binder, in Undecidability.TM.Compound.Compare]
ls2:221 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
ls:102 [binder, in Undecidability.TM.Single.StepTM]
ls:103 [binder, in Undecidability.TM.Util.TM_facts]
ls:11 [binder, in Undecidability.TM.SBTM]
ls:116 [binder, in Undecidability.TM.Compound.Shift]
ls:12 [binder, in Undecidability.TM.Code.CaseList]
ls:121 [binder, in Undecidability.TM.Compound.Shift]
ls:13 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
ls:130 [binder, in Undecidability.TM.Compound.MoveToSymbol]
ls:136 [binder, in Undecidability.TM.Compound.MoveToSymbol]
ls:14 [binder, in Undecidability.TM.Code.Copy]
ls:151 [binder, in Undecidability.TM.Compound.MoveToSymbol]
ls:157 [binder, in Undecidability.TM.Compound.MoveToSymbol]
ls:16 [binder, in Undecidability.TM.Util.TM_facts]
ls:167 [binder, in Undecidability.TM.Compound.MoveToSymbol]
ls:17 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
ls:172 [binder, in Undecidability.TM.Compound.MoveToSymbol]
ls:177 [binder, in Undecidability.TM.Util.TM_facts]
ls:179 [binder, in Undecidability.TM.Single.StepTM]
ls:186 [binder, in Undecidability.TM.Util.TM_facts]
ls:187 [binder, in Undecidability.TM.Compound.MoveToSymbol]
ls:188 [binder, in Undecidability.TM.Single.StepTM]
ls:19 [binder, in Undecidability.TM.Util.TM_facts]
ls:192 [binder, in Undecidability.TM.Compound.MoveToSymbol]
ls:21 [binder, in Undecidability.TM.Code.CaseList]
ls:21 [binder, in Undecidability.TM.Code.Copy]
ls:213 [binder, in Undecidability.TM.Util.TM_facts]
ls:217 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
ls:217 [binder, in Undecidability.TM.Util.TM_facts]
ls:22 [binder, in Undecidability.TM.Util.TM_facts]
ls:220 [binder, in Undecidability.TM.Util.TM_facts]
ls:223 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
ls:225 [binder, in Undecidability.TM.Util.TM_facts]
ls:228 [binder, in Undecidability.TM.Util.TM_facts]
ls:229 [binder, in Undecidability.TM.Util.TM_facts]
ls:235 [binder, in Undecidability.TM.Util.TM_facts]
ls:238 [binder, in Undecidability.TM.Util.TM_facts]
ls:2643 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
ls:28 [binder, in Undecidability.TM.Util.TM_facts]
ls:287 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
ls:3 [binder, in Undecidability.TM.SBTM]
ls:302 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
ls:317 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
ls:32 [binder, in Undecidability.TM.Code.BinNumbers.PosPointers]
ls:33 [binder, in Undecidability.TM.Code.Copy]
ls:363 [binder, in Undecidability.TM.Single.StepTM]
ls:40 [binder, in Undecidability.TM.Code.Copy]
ls:47 [binder, in Undecidability.TM.Code.CaseList]
ls:5 [binder, in Undecidability.TM.Code.BinNumbers.PosPointers]
ls:52 [binder, in Undecidability.TM.Code.Copy]
ls:52 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
ls:53 [binder, in Undecidability.TM.Code.CaseList]
ls:55 [binder, in Undecidability.TM.Compound.Shift]
ls:57 [binder, in Undecidability.TM.Code.Copy]
ls:59 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
ls:61 [binder, in Undecidability.TM.Compound.Shift]
ls:66 [binder, in Undecidability.TM.Code.Copy]
ls:66 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
ls:7 [binder, in Undecidability.TM.SBTM]
ls:71 [binder, in Undecidability.TM.Code.Copy]
ls:87 [binder, in Undecidability.TM.Single.StepTM]
ls:92 [binder, in Undecidability.TM.Util.TM_facts]
ls:96 [binder, in Undecidability.TM.Single.StepTM]
LTactics [library]
ltb_time_bound_l [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
ltb_time [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
ltb_time [definition, in Undecidability.L.Datatypes.LNat]
LTDbool [library]
LTDlist [library]
LTDnat [library]
LTD_def [library]
LTerm [library]
lt_le_impl [instance, in Complexity.Libs.CookPrelim.PolyBounds]
lt_le_impl [instance, in Complexity.Complexity.UpToCPoly]
lt_le_rew [lemma, in Complexity.NP.Clique.kSAT_to_Clique]
lt_acc [lemma, in Undecidability.Synthetic.Infinite]
lt_pirr [lemma, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
lT:15 [binder, in Undecidability.L.Datatypes.List.List_nat]
lt:269 [binder, in Complexity.L.TM.TMflatComp]
lT:886 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
LUnit [library]
LVector [library]
LX [definition, in Undecidability.Synthetic.Infinite]
LX_NoDup [lemma, in Undecidability.Synthetic.Infinite]
LX_el [lemma, in Undecidability.Synthetic.Infinite]
LX_len [lemma, in Undecidability.Synthetic.Infinite]
lx:127 [binder, in Undecidability.Shared.Libs.DLW.Utils.php]
lX:2 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_base]
lX:5 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_base]
lx:9 [binder, in Undecidability.Shared.Libs.DLW.Code.compiler]
ly:128 [binder, in Undecidability.Shared.Libs.DLW.Utils.php]
L_Notations [module, in Undecidability.L.Util.L_facts]
L_Notations_app [module, in Undecidability.L.Util.L_facts]
L_A_notIn_f [lemma, in Complexity.HierarchyTheorem.TimeHierarchyTheorem]
L__f [definition, in Complexity.HierarchyTheorem.TimeHierarchyTheorem]
L_computable [definition, in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
L_bool_computable [definition, in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
L_facts_mp [definition, in Undecidability.L.Tactics.GenEncode]
L_computable_to_TM_computable [lemma, in Undecidability.TM.L.CompilerBoolFuns.LComp_to_TMComp]
L_bool_computable_to_TM_bool_computable [lemma, in Undecidability.TM.L.CompilerBoolFuns.LComp_to_TMComp]
L_computable_to_L_bool_computable [lemma, in Undecidability.TM.L.CompilerBoolFuns.Compiler_nat_facts]
l__r:44 [binder, in Complexity.L.TM.TMunflatten]
l__r:28 [binder, in Complexity.L.TM.TMunflatten]
l__r:17 [binder, in Complexity.L.TM.TMunflatten]
l__r:11 [binder, in Complexity.L.TM.TMunflatten]
L_computable_can_closed [lemma, in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
L_bool_computable_can_closed [lemma, in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
L_bool_computable_closed [definition, in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
L_computable_closed [definition, in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
L_computable [definition, in Undecidability.L.L]
l_i:121 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
L_bool_computable_function [lemma, in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
L_term_card [lemma, in Complexity.Complexity.SpaceBoundsTime]
L_Pro_length [lemma, in Complexity.Complexity.SpaceBoundsTime]
L_Pro_length' [lemma, in Complexity.Complexity.SpaceBoundsTime]
L_Pro_mono [lemma, in Complexity.Complexity.SpaceBoundsTime]
L_Pro_in_iff [lemma, in Complexity.Complexity.SpaceBoundsTime]
L_Pro [definition, in Complexity.Complexity.SpaceBoundsTime]
L_T [definition, in Undecidability.Synthetic.ListEnumerabilityFacts]
L_list_cumulative [lemma, in Undecidability.Synthetic.ListEnumerabilityFacts]
L_list [definition, in Undecidability.Synthetic.ListEnumerabilityFacts]
L_list_def.L [variable, in Undecidability.Synthetic.ListEnumerabilityFacts]
L_list_def [section, in Undecidability.Synthetic.ListEnumerabilityFacts]
l_:28 [binder, in Undecidability.TM.Combinators.StateWhile]
L_recognisable_halt [lemma, in Undecidability.L.Computability.Synthetic]
L_recognisable'_recognisable [lemma, in Undecidability.L.Computability.Synthetic]
L_enumerable_halt [lemma, in Undecidability.L.Computability.Synthetic]
L_enumerable_enum [lemma, in Undecidability.L.Computability.Synthetic]
L_enumerable_ext [lemma, in Undecidability.L.Computability.Synthetic]
L_enum [definition, in Undecidability.L.Computability.Synthetic]
L_nat [definition, in Undecidability.L.Computability.Synthetic]
L_enumerable_recognisable [lemma, in Undecidability.L.Computability.Synthetic]
L_enum_rec.H_d [variable, in Undecidability.L.Computability.Synthetic]
L_enum_rec.c_d [variable, in Undecidability.L.Computability.Synthetic]
L_enum_rec.d [variable, in Undecidability.L.Computability.Synthetic]
L_enum_rec.H_f [variable, in Undecidability.L.Computability.Synthetic]
L_enum_rec.c_f [variable, in Undecidability.L.Computability.Synthetic]
L_enum_rec.f [variable, in Undecidability.L.Computability.Synthetic]
L_enum_rec.p [variable, in Undecidability.L.Computability.Synthetic]
L_enum_rec.X [variable, in Undecidability.L.Computability.Synthetic]
L_enum_rec [section, in Undecidability.L.Computability.Synthetic]
L_recognisable' [definition, in Undecidability.L.Computability.Synthetic]
L_recognisable [definition, in Undecidability.L.Computability.Synthetic]
L_enumerable [definition, in Undecidability.L.Computability.Synthetic]
L_decidable [definition, in Undecidability.L.Computability.Synthetic]
L_A_notIn_f [lemma, in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
L__f [definition, in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
l_i:64 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler]
l_i:54 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler]
L_to_LM [library]
L_facts [library]
l'':133 [binder, in Complexity.Libs.CookPrelim.PolyBounds]
l'':135 [binder, in Complexity.Libs.CookPrelim.PolyBounds]
l':10 [binder, in Undecidability.Shared.ListAutomation]
l':101 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
l':105 [binder, in Undecidability.L.Tactics.Extract]
l':105 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
l':109 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
l':132 [binder, in Complexity.Libs.CookPrelim.PolyBounds]
l':134 [binder, in Complexity.Libs.CookPrelim.PolyBounds]
l':134 [binder, in Undecidability.TM.Combinators.StateWhile]
l':139 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
l':149 [binder, in Complexity.L.TM.TMflatComp]
l':149 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
l':15 [binder, in Complexity.Libs.CookPrelim.PolyBounds]
l':178 [binder, in Undecidability.TM.Util.TM_facts]
l':19 [binder, in Complexity.Libs.CookPrelim.PolyBounds]
l':23 [binder, in Complexity.Libs.CookPrelim.PolyBounds]
l':24 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_nat_facts]
l':25 [binder, in Undecidability.Shared.Libs.PSL.Numbers]
l':26 [binder, in Complexity.L.AbstractMachines.Computable.Unfolding]
l':28 [binder, in Undecidability.Shared.Libs.PSL.Numbers]
l':28 [binder, in Undecidability.L.Tactics.GenEncode]
l':29 [binder, in Complexity.Complexity.UpToCPoly]
l':30 [binder, in Undecidability.TM.Combinators.StateWhile]
l':3085 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
l':3090 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
l':31 [binder, in Undecidability.Shared.Libs.PSL.Numbers]
l':31 [binder, in Undecidability.Shared.Libs.PSL.Lists.Position]
l':3101 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
l':33 [binder, in Undecidability.TM.Combinators.StateWhile]
l':34 [binder, in Undecidability.Shared.Libs.PSL.Lists.Position]
l':343 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
l':36 [binder, in Complexity.Complexity.UpToCPoly]
l':38 [binder, in Undecidability.Shared.Libs.PSL.Lists.Position]
l':38 [binder, in Undecidability.TM.Combinators.StateWhile]
L':38 [binder, in Undecidability.Synthetic.ReducibilityFacts]
l':40 [binder, in Complexity.Complexity.UpToCPoly]
l':42 [binder, in Complexity.L.TM.TMflatten]
l':44 [binder, in Complexity.Complexity.UpToCPoly]
L':44 [binder, in Undecidability.Synthetic.ReducibilityFacts]
l':47 [binder, in Undecidability.L.Prelim.MoreList]
l':48 [binder, in Complexity.L.TM.TMflatten]
l':57 [binder, in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
l':59 [binder, in Complexity.Libs.CookPrelim.PolyBounds]
l':71 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
l':8 [binder, in Complexity.Libs.CookPrelim.PolyBounds]
l':82 [binder, in Undecidability.TM.Combinators.StateWhile]
l0:3091 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
l0:49 [binder, in Complexity.L.TM.TMflatten]
l1:102 [binder, in Undecidability.TM.Combinators.StateWhile]
l1:107 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
l1:115 [binder, in Complexity.NP.Clique.kSAT_to_Clique]
l1:116 [binder, in Undecidability.TM.Combinators.StateWhile]
l1:12 [binder, in Complexity.NP.Clique.kSAT_to_FlatClique]
l1:120 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
l1:128 [binder, in Complexity.NP.Clique.kSAT_to_Clique]
l1:13 [binder, in Complexity.NP.Clique.kSAT_to_Clique]
l1:130 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
l1:136 [binder, in Undecidability.Shared.Libs.DLW.Utils.php]
l1:137 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
l1:140 [binder, in Complexity.Libs.CookPrelim.PolyBounds]
l1:140 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
l1:148 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
l1:151 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
l1:152 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
l1:154 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
l1:157 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
l1:158 [binder, in Complexity.Libs.CookPrelim.PolyBounds]
l1:168 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
l1:17 [binder, in Undecidability.TM.Combinators.StateWhile]
l1:177 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
l1:183 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
l1:19 [binder, in Complexity.NP.Clique.kSAT_to_FlatClique]
l1:20 [binder, in Undecidability.TM.Combinators.StateWhile]
l1:208 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
l1:210 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
l1:213 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
l1:215 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
l1:22 [binder, in Undecidability.L.Datatypes.List.List_extra]
l1:221 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
l1:24 [binder, in Undecidability.L.Datatypes.List.List_extra]
l1:248 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
l1:25 [binder, in Complexity.TM.PrettyBounds.BaseCode]
l1:257 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
l1:259 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
l1:26 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
l1:26 [binder, in Undecidability.Shared.Libs.DLW.Utils.php]
l1:26 [binder, in Undecidability.TM.Code.ChangeAlphabet]
l1:260 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
l1:267 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
l1:269 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
l1:27 [binder, in Complexity.TM.PrettyBounds.BaseCode]
l1:272 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
l1:276 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
l1:29 [binder, in Undecidability.L.Datatypes.LVector]
l1:29 [binder, in Complexity.Libs.CookPrelim.PolyBounds]
l1:29 [binder, in Undecidability.Shared.Libs.DLW.Utils.php]
l1:296 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
l1:300 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
l1:305 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
l1:3093 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
l1:3112 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
l1:3125 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
l1:32 [binder, in Complexity.NP.Clique.kSAT_to_Clique]
l1:327 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
l1:35 [binder, in Complexity.Libs.UniformHomomorphisms]
l1:36 [binder, in Complexity.NP.Clique.kSAT_to_Clique]
l1:37 [binder, in Complexity.Libs.UniformHomomorphisms]
l1:379 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
l1:390 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
l1:41 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
l1:43 [binder, in Undecidability.L.Datatypes.LVector]
l1:43 [binder, in Complexity.NP.Clique.kSAT_to_Clique]
l1:448 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
l1:47 [binder, in Undecidability.TM.Combinators.StateWhile]
l1:48 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
l1:50 [binder, in Complexity.Complexity.UpToCPoly]
l1:51 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
l1:51 [binder, in Complexity.L.TM.TMflatten]
l1:52 [binder, in Complexity.L.TM.TMflatComp]
l1:55 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
l1:55 [binder, in Undecidability.L.Datatypes.LVector]
l1:57 [binder, in Undecidability.L.Datatypes.LVector]
l1:59 [binder, in Complexity.L.TM.TMflatComp]
l1:6 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
l1:60 [binder, in Complexity.NP.Clique.kSAT_to_FlatClique]
l1:61 [binder, in Complexity.Libs.Pigeonhole]
l1:62 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
l1:63 [binder, in Complexity.Libs.Pigeonhole]
l1:64 [binder, in Complexity.NP.Clique.kSAT_to_FlatClique]
l1:66 [binder, in Undecidability.TM.Combinators.StateWhile]
l1:68 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
l1:70 [binder, in Undecidability.L.Datatypes.LVector]
L1:78 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
l1:79 [binder, in Undecidability.Shared.Libs.DLW.Utils.prime]
l1:80 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
l1:80 [binder, in Undecidability.TM.Combinators.StateWhile]
l1:82 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
L1:83 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
l1:84 [binder, in Undecidability.TM.Code.Code]
l1:88 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
l1:88 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
l1:89 [binder, in Complexity.Libs.CookPrelim.PolyBounds]
l1:9 [binder, in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
l1:90 [binder, in Complexity.Complexity.UpToCPoly]
l1:92 [binder, in Undecidability.TM.Compound.Compare]
l1:93 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
l1:96 [binder, in Undecidability.TM.Compound.Compare]
l1:98 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
l1:99 [binder, in Undecidability.TM.Compound.Compare]
l2:10 [binder, in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
l2:100 [binder, in Undecidability.TM.Compound.Compare]
l2:100 [binder, in Undecidability.TM.Combinators.StateWhile]
l2:108 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
l2:114 [binder, in Undecidability.TM.Combinators.StateWhile]
l2:116 [binder, in Complexity.NP.Clique.kSAT_to_Clique]
l2:121 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
l2:129 [binder, in Complexity.NP.Clique.kSAT_to_Clique]
l2:13 [binder, in Complexity.NP.Clique.kSAT_to_FlatClique]
l2:131 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
l2:137 [binder, in Undecidability.Shared.Libs.DLW.Utils.php]
l2:138 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
l2:14 [binder, in Complexity.NP.Clique.kSAT_to_Clique]
l2:141 [binder, in Complexity.Libs.CookPrelim.PolyBounds]
l2:141 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
l2:145 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
l2:149 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
l2:152 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
l2:153 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
l2:155 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
l2:158 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
l2:159 [binder, in Complexity.Libs.CookPrelim.PolyBounds]
l2:171 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
l2:178 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
l2:187 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
l2:20 [binder, in Complexity.NP.Clique.kSAT_to_FlatClique]
l2:209 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
l2:211 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
l2:214 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
l2:216 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
l2:222 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
l2:23 [binder, in Undecidability.L.Datatypes.List.List_extra]
l2:249 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
l2:25 [binder, in Undecidability.L.Datatypes.List.List_extra]
l2:258 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
l2:26 [binder, in Complexity.TM.PrettyBounds.BaseCode]
l2:260 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
l2:261 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
l2:268 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
l2:27 [binder, in Undecidability.Shared.Libs.DLW.Utils.php]
l2:27 [binder, in Undecidability.TM.Code.ChangeAlphabet]
l2:270 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
l2:273 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
l2:277 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
l2:28 [binder, in Complexity.TM.PrettyBounds.BaseCode]
l2:297 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
l2:30 [binder, in Undecidability.L.Datatypes.LVector]
l2:30 [binder, in Complexity.Libs.CookPrelim.PolyBounds]
l2:30 [binder, in Undecidability.Shared.Libs.DLW.Utils.php]
l2:301 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
l2:306 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
l2:3113 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
l2:3126 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
l2:328 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
l2:33 [binder, in Complexity.NP.Clique.kSAT_to_Clique]
l2:36 [binder, in Complexity.Libs.UniformHomomorphisms]
l2:37 [binder, in Complexity.NP.Clique.kSAT_to_Clique]
l2:38 [binder, in Complexity.Libs.UniformHomomorphisms]
l2:380 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
l2:391 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
l2:42 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
l2:44 [binder, in Undecidability.L.Datatypes.LVector]
l2:44 [binder, in Complexity.NP.Clique.kSAT_to_Clique]
l2:449 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
l2:49 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
l2:51 [binder, in Complexity.Complexity.UpToCPoly]
l2:52 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
l2:53 [binder, in Complexity.L.TM.TMflatComp]
l2:53 [binder, in Undecidability.TM.Combinators.StateWhile]
l2:56 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
l2:56 [binder, in Undecidability.L.Datatypes.LVector]
l2:58 [binder, in Undecidability.L.Datatypes.LVector]
l2:60 [binder, in Complexity.L.TM.TMflatComp]
l2:61 [binder, in Complexity.NP.Clique.kSAT_to_FlatClique]
l2:62 [binder, in Complexity.Libs.Pigeonhole]
l2:63 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
l2:64 [binder, in Complexity.Libs.Pigeonhole]
l2:65 [binder, in Complexity.NP.Clique.kSAT_to_FlatClique]
l2:69 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
l2:7 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
l2:71 [binder, in Undecidability.L.Datatypes.LVector]
l2:72 [binder, in Undecidability.TM.Combinators.StateWhile]
L2:79 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
l2:80 [binder, in Undecidability.Shared.Libs.DLW.Utils.prime]
l2:81 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
l2:83 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
L2:84 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
l2:85 [binder, in Undecidability.TM.Code.Code]
l2:86 [binder, in Undecidability.TM.Combinators.StateWhile]
l2:89 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
l2:89 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
l2:90 [binder, in Complexity.Libs.CookPrelim.PolyBounds]
l2:91 [binder, in Complexity.Complexity.UpToCPoly]
l2:93 [binder, in Undecidability.TM.Compound.Compare]
l2:94 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
l2:97 [binder, in Undecidability.TM.Compound.Compare]
l2:99 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
l3:250 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
l3:3114 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
l3:3127 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
l3:94 [binder, in Undecidability.TM.Compound.Compare]
l4:3115 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
l4:3128 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
l:1 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
l:1 [binder, in Complexity.L.AbstractMachines.FlatPro.Computable.Decompile]
l:1 [binder, in Complexity.NP.SAT.SAT_inNP]
l:1 [binder, in Undecidability.Shared.Libs.DLW.Utils.list_bool]
l:1 [binder, in Complexity.L.AbstractMachines.Computable.Lookup]
l:1 [binder, in Undecidability.L.Prelim.StringBase]
l:10 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
l:10 [binder, in Complexity.L.AbstractMachines.FlatPro.Computable.Decompile]
l:10 [binder, in Undecidability.TM.PrettyBounds.SizeBounds]
l:10 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
l:10 [binder, in Complexity.TM.Single.EncodeTapesInvariants]
l:10 [binder, in Undecidability.Shared.Libs.DLW.Wf.wf_incl]
l:10 [binder, in Complexity.NP.SAT.SAT_inNP]
L:10 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
l:10 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_base]
l:10 [binder, in Undecidability.L.Datatypes.List.List_in]
l:10 [binder, in Undecidability.L.Datatypes.List.List_fold]
l:10 [binder, in Complexity.NP.SAT.SAT]
l:100 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
L:100 [binder, in Complexity.NP.Clique.kSAT_to_Clique]
l:1008 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
L:101 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
l:101 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
l:101 [binder, in Undecidability.L.Tactics.Reflection]
l:101 [binder, in Undecidability.Shared.Libs.DLW.Vec.pos]
l:1011 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
l:1014 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
l:1017 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
l:102 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
l:1021 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
l:1022 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
l:1025 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
l:1027 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
l:103 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
l:103 [binder, in Undecidability.TM.Code.List.Nth]
l:103 [binder, in Undecidability.L.Tactics.LClos_Eval]
l:103 [binder, in Complexity.Libs.CookPrelim.PolyBounds]
l:104 [binder, in Undecidability.L.Tactics.Extract]
l:104 [binder, in Undecidability.TM.Combinators.StateWhile]
L:104 [binder, in Complexity.NP.Clique.kSAT_to_Clique]
l:104 [binder, in Undecidability.Shared.Libs.DLW.Vec.pos]
l:1041 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
l:105 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
l:105 [binder, in Undecidability.TM.Combinators.StateWhile]
l:106 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
l:106 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
l:107 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
l:107 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
l:1077 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
l:108 [binder, in Undecidability.TM.Code.List.Nth]
L:108 [binder, in Complexity.NP.SAT.SAT_inNP]
l:108 [binder, in Complexity.Libs.CookPrelim.PolyBounds]
l:1081 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
l:1086 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
l:109 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
l:109 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
l:109 [binder, in Undecidability.TM.Combinators.StateWhile]
l:1090 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
l:1094 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
l:11 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
l:11 [binder, in Undecidability.TM.Code.List.Nth]
l:11 [binder, in Undecidability.L.Tactics.Extract]
l:11 [binder, in Undecidability.L.Datatypes.LSum]
l:11 [binder, in Complexity.L.TM.CompCode]
l:11 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
l:11 [binder, in Complexity.Libs.CookPrelim.PolyBounds]
l:11 [binder, in Undecidability.Shared.Libs.DLW.Utils.php]
l:11 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
L:11 [binder, in Undecidability.Synthetic.ListEnumerabilityFacts]
l:11 [binder, in Undecidability.Shared.Libs.DLW.Utils.seteq]
l:110 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
l:1107 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
l:112 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
l:112 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
l:112 [binder, in Complexity.Libs.CookPrelim.PolyBounds]
L:113 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
l:114 [binder, in Undecidability.Shared.Libs.DLW.Utils.php]
l:114 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
l:115 [binder, in Undecidability.L.Tactics.Extract]
l:115 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
l:115 [binder, in Undecidability.TM.Compound.Shift]
l:117 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
l:118 [binder, in Undecidability.TM.Code.List.Nth]
L:118 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
l:118 [binder, in Undecidability.TM.Combinators.StateWhile]
l:119 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
l:119 [binder, in Undecidability.TM.Combinators.StateWhile]
l:119 [binder, in Complexity.NP.Clique.kSAT_to_Clique]
l:12 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_dec]
l:12 [binder, in Undecidability.Shared.FinTypeEquiv]
l:12 [binder, in Complexity.TM.Single.EncodeTapesInvariants]
l:12 [binder, in Undecidability.L.Complexity.ResourceMeasures]
l:12 [binder, in Undecidability.L.Datatypes.List.List_in]
l:12 [binder, in Undecidability.L.Datatypes.List.List_fold]
l:12 [binder, in Undecidability.Shared.Libs.DLW.Utils.seteq]
L:120 [binder, in Complexity.NP.SAT.SAT_inNP]
l:120 [binder, in Undecidability.Shared.Libs.DLW.Utils.php]
l:120 [binder, in Undecidability.TM.Combinators.StateWhile]
L:120 [binder, in Complexity.NP.Clique.kSAT_to_Clique]
l:121 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
l:122 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
l:123 [binder, in Undecidability.L.Prelim.ARS]
l:123 [binder, in Complexity.Libs.CookPrelim.PolyBounds]
l:124 [binder, in Undecidability.TM.Compound.Shift]
l:125 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
l:125 [binder, in Complexity.NP.Clique.kSAT_to_Clique]
l:126 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
l:127 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
l:127 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
l:127 [binder, in Complexity.L.TM.CompCode]
l:127 [binder, in Complexity.NP.Clique.kSAT_to_Clique]
l:128 [binder, in Undecidability.TM.Code.List.Nth]
L:128 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
l:129 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
l:13 [binder, in Complexity.L.AbstractMachines.FlatPro.Computable.Decompile]
l:13 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
l:13 [binder, in Undecidability.L.Tactics.GenEncode]
l:13 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
l:13 [binder, in Undecidability.L.Datatypes.List.List_extra]
l:13 [binder, in Complexity.Libs.UniformHomomorphisms]
l:13 [binder, in Complexity.NP.Clique.FlatClique]
l:13 [binder, in Undecidability.L.Functions.FinTypeLookup]
l:130 [binder, in Complexity.NP.Clique.FlatClique]
L:130 [binder, in Complexity.NP.Clique.kSAT_to_Clique]
l:131 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
l:131 [binder, in Undecidability.TM.Combinators.StateWhile]
l:132 [binder, in Complexity.NP.SAT.SAT_inNP]
l:133 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
l:133 [binder, in Undecidability.Shared.Libs.DLW.Utils.php]
l:133 [binder, in Undecidability.TM.Combinators.StateWhile]
L:134 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
l:134 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
l:134 [binder, in Complexity.NP.Clique.FlatClique]
l:134 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
l:135 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
l:135 [binder, in Complexity.L.TM.TMflatComp]
l:135 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
l:135 [binder, in Complexity.NP.Clique.kSAT_to_Clique]
l:136 [binder, in Undecidability.L.Prelim.ARS]
l:136 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
l:136 [binder, in Undecidability.L.Tactics.LClos]
l:136 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
l:136 [binder, in Complexity.NP.Clique.FlatClique]
l:137 [binder, in Undecidability.L.Tactics.LClos]
l:137 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
l:138 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
l:138 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
l:138 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
l:14 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
l:14 [binder, in Complexity.TM.Single.EncodeTapesInvariants]
L:14 [binder, in Complexity.NP.Clique.Clique]
l:14 [binder, in Undecidability.L.Datatypes.List.List_nat]
l:14 [binder, in Complexity.Libs.CookPrelim.PolyBounds]
l:14 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_base]
l:14 [binder, in Complexity.NP.Clique.FlatClique]
l:14 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
l:14 [binder, in Undecidability.Shared.Libs.DLW.Utils.seteq]
l:14 [binder, in Undecidability.TM.Code.List.App]
l:140 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
l:140 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
l:140 [binder, in Complexity.NP.Clique.FlatClique]
l:140 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
l:141 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
l:141 [binder, in Undecidability.TM.Combinators.StateWhile]
l:142 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
l:143 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
l:145 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
l:145 [binder, in Complexity.Libs.CookPrelim.PolyBounds]
l:146 [binder, in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
l:146 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
L:146 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
l:146 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
L:147 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
l:147 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
l:147 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
l:148 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
L:148 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
l:148 [binder, in Complexity.L.TM.TMflatComp]
l:149 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
l:149 [binder, in Complexity.L.TM.CompCode]
l:149 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
L:15 [binder, in Undecidability.Shared.Libs.PSL.Numbers]
l:15 [binder, in Undecidability.TM.Code.CaseList]
l:15 [binder, in Undecidability.L.Datatypes.List.List_basics]
l:15 [binder, in Undecidability.Shared.FinTypeEquiv]
l:15 [binder, in Complexity.TM.Single.EncodeTapesInvariants]
l:15 [binder, in Undecidability.Shared.Libs.DLW.Wf.wf_incl]
l:15 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
l:15 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_upto]
l:15 [binder, in Undecidability.Shared.Libs.DLW.Code.subcode]
l:151 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
l:151 [binder, in Complexity.L.TM.CompCode]
l:152 [binder, in Complexity.L.TM.CompCode]
l:152 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
l:152 [binder, in Undecidability.TM.Combinators.StateWhile]
l:152 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
l:153 [binder, in Complexity.L.TM.CompCode]
l:153 [binder, in Undecidability.TM.Combinators.StateWhile]
l:154 [binder, in Undecidability.L.Util.L_facts]
l:154 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
l:155 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
l:156 [binder, in Undecidability.Shared.Libs.DLW.Utils.php]
l:156 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
l:157 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
l:157 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
l:158 [binder, in Undecidability.L.Util.L_facts]
l:158 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
l:159 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
l:16 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
l:16 [binder, in Undecidability.L.Tactics.Extract]
l:16 [binder, in Undecidability.TM.Code.List.Cons_constant]
l:16 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_string]
l:16 [binder, in Complexity.NP.SAT.SAT_inNP]
l:16 [binder, in Undecidability.Shared.Libs.DLW.Utils.php]
L:16 [binder, in Undecidability.Synthetic.ListEnumerabilityFacts]
l:160 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
l:162 [binder, in Undecidability.TM.Lifting.LiftTapes]
l:163 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
l:165 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
L:167 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
l:167 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
l:169 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
l:169 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
l:17 [binder, in Undecidability.Shared.Libs.PSL.Numbers]
l:17 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
l:17 [binder, in Undecidability.TM.Code.List.Cons_constant]
l:17 [binder, in Undecidability.L.Datatypes.Lists]
l:17 [binder, in Complexity.Complexity.UpToCPoly]
l:17 [binder, in Undecidability.L.Datatypes.List.List_eqb]
l:17 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
l:17 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
l:17 [binder, in Undecidability.Shared.Libs.DLW.Utils.seteq]
l:17 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
l:170 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
l:171 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
l:172 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
l:176 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
l:176 [binder, in Undecidability.TM.Code.Code]
l:176 [binder, in Undecidability.TM.Util.TM_facts]
l:177 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
l:179 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
l:179 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
L:179 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
l:179 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
l:18 [binder, in Undecidability.TM.PrettyBounds.SizeBounds]
l:18 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
l:18 [binder, in Complexity.NP.Clique.Clique]
l:18 [binder, in Undecidability.L.Datatypes.LVector]
l:18 [binder, in Complexity.Libs.CookPrelim.PolyBounds]
l:18 [binder, in Undecidability.Shared.Libs.DLW.Wf.wf_finite]
l:18 [binder, in Undecidability.L.Functions.Encoding]
l:182 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
l:182 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
l:183 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
l:185 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
l:186 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
l:187 [binder, in Undecidability.TM.Single.StepTM]
l:188 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
l:188 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
l:189 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
l:19 [binder, in Undecidability.Shared.Libs.PSL.Numbers]
l:19 [binder, in Undecidability.Shared.FinTypeEquiv]
l:19 [binder, in Undecidability.Shared.Libs.DLW.Utils.php]
l:19 [binder, in Undecidability.L.Datatypes.List.List_fold]
l:191 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
l:191 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
l:191 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
l:192 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
l:193 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
l:195 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
l:195 [binder, in Complexity.L.TM.TMflatComp]
l:195 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
l:197 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
l:197 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
l:197 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
l:198 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
l:198 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
L:2 [binder, in Undecidability.L.Tactics.GenEncode]
l:2 [binder, in Undecidability.Shared.Libs.DLW.Wf.wf_incl]
l:2 [binder, in Complexity.NP.Clique.Clique]
l:2 [binder, in Undecidability.Shared.Libs.DLW.Utils.php]
l:2 [binder, in Complexity.NP.Clique.FlatClique]
L:2 [binder, in Undecidability.Synthetic.ListEnumerabilityFacts]
l:2 [binder, in Complexity.NP.SAT.SAT]
l:20 [binder, in Undecidability.TM.Code.List.Nth]
l:20 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_nat_facts]
l:20 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
l:20 [binder, in Complexity.NP.Clique.FlatClique]
l:20 [binder, in Complexity.L.TM.TMflatten]
l:20 [binder, in Undecidability.L.Functions.FinTypeLookup]
l:20 [binder, in Undecidability.Shared.Libs.DLW.Utils.seteq]
l:20 [binder, in Undecidability.TM.Compound.WriteString]
l:200 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
l:202 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
l:202 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
l:203 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
l:203 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
l:203 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
l:203 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
l:204 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
l:206 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
l:206 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
l:207 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
l:208 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
l:209 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
l:21 [binder, in Undecidability.Shared.Libs.PSL.Numbers]
L:21 [binder, in Undecidability.L.Tactics.GenEncode]
l:21 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
l:21 [binder, in Undecidability.Shared.Libs.DLW.Wf.wf_incl]
l:21 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
l:21 [binder, in Complexity.Complexity.UpToCPoly]
l:21 [binder, in Undecidability.TM.Combinators.StateWhile]
l:213 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
l:213 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
l:214 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
l:215 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
l:217 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
l:218 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
l:219 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
l:22 [binder, in Undecidability.TM.L.Transcode.Boollist_to_Enc]
l:22 [binder, in Undecidability.L.Datatypes.List.List_basics]
l:22 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_nat_facts]
l:22 [binder, in Complexity.Libs.CookPrelim.PolyBounds]
L:22 [binder, in Undecidability.Synthetic.ListEnumerabilityFacts]
l:22 [binder, in Undecidability.L.Tactics.Reflection]
l:220 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
l:221 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
l:222 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
l:222 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
l:226 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
l:227 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
l:227 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
l:228 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
l:23 [binder, in Undecidability.Shared.Libs.PSL.Numbers]
l:23 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
l:23 [binder, in Undecidability.Shared.Libs.DLW.Wf.wf_incl]
l:23 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
l:23 [binder, in Complexity.L.TM.TMunflatten]
l:23 [binder, in Undecidability.TM.Combinators.StateWhile]
l:23 [binder, in Undecidability.L.Functions.FinTypeLookup]
l:23 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
l:233 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
l:233 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
l:235 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
l:235 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
l:237 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
l:237 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
l:239 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
l:24 [binder, in Undecidability.TM.Code.CaseList]
l:24 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
l:24 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
l:24 [binder, in Undecidability.Shared.Libs.DLW.Utils.php]
l:24 [binder, in Complexity.L.TM.TMflatten]
l:24 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
l:24 [binder, in Undecidability.Shared.Libs.DLW.Utils.seteq]
l:24 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.FiniteFunction]
l:241 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
l:242 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
l:244 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
l:245 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
l:247 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
l:25 [binder, in Complexity.L.AbstractMachines.Computable.Unfolding]
l:25 [binder, in Complexity.Complexity.UpToCPoly]
l:25 [binder, in Complexity.NP.Clique.FlatClique]
l:25 [binder, in Undecidability.Shared.Libs.DLW.Wf.wf_finite]
l:25 [binder, in Undecidability.TM.Combinators.StateWhile]
l:25 [binder, in Undecidability.L.Datatypes.List.List_fold]
l:25 [binder, in Complexity.NP.SAT.SAT]
l:250 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
l:253 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
l:255 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
l:255 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
l:257 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
l:258 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
l:259 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
l:26 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_quotient]
l:26 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
l:26 [binder, in Complexity.Libs.CookPrelim.PolyBounds]
l:26 [binder, in Undecidability.Shared.Libs.DLW.Utils.seteq]
l:26 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
l:26 [binder, in Undecidability.L.Prelim.MoreList]
l:262 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
l:265 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
l:2696 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
l:27 [binder, in Undecidability.L.Tactics.GenEncode]
l:27 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
l:27 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
l:27 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
l:27 [binder, in Complexity.L.AbstractMachines.AbstractSubstMachine]
l:27 [binder, in Undecidability.L.Datatypes.List.List_in]
l:27 [binder, in Undecidability.TM.Combinators.StateWhile]
l:27 [binder, in Undecidability.Shared.Libs.DLW.Utils.seteq]
l:271 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
l:272 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
l:272 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
l:2725 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
l:273 [binder, in Undecidability.L.Tactics.Reflection]
l:2746 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
l:2753 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
l:277 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
l:28 [binder, in Undecidability.Shared.Libs.PSL.Lists.Position]
l:28 [binder, in Complexity.Complexity.UpToCPoly]
l:282 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
l:282 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
l:286 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
l:286 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
l:289 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
l:289 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
l:29 [binder, in Undecidability.L.Datatypes.List.List_basics]
l:29 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
l:29 [binder, in Undecidability.TM.Combinators.Mirror]
l:29 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
l:29 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TM_single]
l:29 [binder, in Complexity.L.TM.TMflatten]
l:29 [binder, in Undecidability.Shared.Libs.DLW.Utils.seteq]
l:291 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
l:2924 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
l:293 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
l:294 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
l:299 [binder, in Undecidability.L.Tactics.Reflection]
l:3 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
l:3 [binder, in Undecidability.Shared.FinTypeEquiv]
l:3 [binder, in Undecidability.L.Datatypes.Lists]
l:3 [binder, in Complexity.TM.Single.EncodeTapesInvariants]
L:3 [binder, in Undecidability.Shared.FinTypeForallExists]
l:3 [binder, in Complexity.Libs.CookPrelim.PolyBounds]
l:3 [binder, in Complexity.L.TM.TMunflatten]
l:3 [binder, in Undecidability.L.Functions.Encoding]
l:3 [binder, in Undecidability.TM.Compound.WriteString]
l:30 [binder, in Complexity.TM.PrettyBounds.BaseCode]
l:30 [binder, in Undecidability.TM.Code.List.Concat_Repeat]
l:30 [binder, in Undecidability.TM.Lifting.LiftAlphabet]
l:30 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
l:30 [binder, in Undecidability.Shared.Libs.PSL.Lists.Position]
l:30 [binder, in Complexity.TM.Single.EncodeTapesInvariants]
l:30 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
l:30 [binder, in Complexity.NP.Clique.FlatClique]
l:30 [binder, in Undecidability.L.AbstractMachines.FlatPro.Programs]
l:30 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TM_single]
L:30 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.FiniteFunction]
l:303 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
l:304 [binder, in Undecidability.L.Tactics.Reflection]
l:308 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
l:3084 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
l:3089 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
l:309 [binder, in Undecidability.L.Tactics.Reflection]
l:3095 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
l:3099 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
l:31 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
l:31 [binder, in Complexity.TM.Single.EncodeTapesInvariants]
l:31 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
l:31 [binder, in Undecidability.L.Datatypes.List.List_in]
l:31 [binder, in Undecidability.Shared.Libs.DLW.Utils.seteq]
l:31 [binder, in Undecidability.L.Prelim.MoreList]
l:310 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
l:3165 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
l:3182 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
l:319 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
l:32 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
l:32 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
l:32 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_nat_facts]
l:32 [binder, in Complexity.TM.Single.EncodeTapesInvariants]
l:32 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
l:32 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_upto]
l:32 [binder, in Complexity.Complexity.UpToCPoly]
l:32 [binder, in Undecidability.Shared.Libs.DLW.Utils.php]
l:32 [binder, in Undecidability.TM.Combinators.StateWhile]
l:32 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
l:3224 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
l:329 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
l:329 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
l:33 [binder, in Undecidability.L.Datatypes.List.List_basics]
l:33 [binder, in Undecidability.Shared.Libs.PSL.Lists.Position]
l:33 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_nat_facts]
l:33 [binder, in Complexity.TM.Single.EncodeTapesInvariants]
l:33 [binder, in Complexity.Libs.CookPrelim.PolyBounds]
l:33 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_base]
l:33 [binder, in Complexity.NP.Clique.FlatClique]
l:33 [binder, in Complexity.L.TM.TMflatten]
l:33 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
l:33 [binder, in Undecidability.L.Datatypes.List.List_fold]
l:33 [binder, in Undecidability.Shared.Libs.DLW.Utils.seteq]
l:33 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.CC]
l:330 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
l:330 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
l:331 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
l:333 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
l:334 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
l:337 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
l:338 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
l:339 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
l:34 [binder, in Undecidability.TM.Code.List.Concat_Repeat]
l:34 [binder, in Undecidability.TM.L.Transcode.Boollist_to_Enc]
l:34 [binder, in Undecidability.L.Datatypes.List.List_basics]
l:34 [binder, in Complexity.Libs.UniformHomomorphisms]
l:34 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
l:348 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
l:349 [binder, in Undecidability.TM.Util.TM_facts]
l:35 [binder, in Undecidability.L.Datatypes.List.List_basics]
l:35 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
l:35 [binder, in Complexity.Complexity.UpToCPoly]
l:35 [binder, in Undecidability.Shared.Libs.DLW.Utils.php]
l:35 [binder, in Complexity.L.TM.TMflatten]
l:35 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
l:35 [binder, in Undecidability.L.Prelim.MoreList]
l:357 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
l:357 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
l:3579 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
l:3580 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
l:3582 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
l:3586 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
l:3598 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
l:36 [binder, in Undecidability.TM.L.Transcode.Boollist_to_Enc]
l:36 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
l:36 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
l:36 [binder, in Complexity.NP.Clique.FlatClique]
L:36 [binder, in Undecidability.L.Functions.FinTypeLookup]
l:360 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
l:369 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
l:37 [binder, in Undecidability.TM.Code.List.Concat_Repeat]
l:37 [binder, in Undecidability.TM.L.Transcode.Boollist_to_Enc]
l:37 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
l:37 [binder, in Undecidability.Shared.Libs.PSL.Lists.Position]
l:37 [binder, in Complexity.Libs.CookPrelim.PolyBounds]
l:37 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_upto]
l:37 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
l:37 [binder, in Undecidability.Shared.Libs.DLW.Utils.list_bool]
l:37 [binder, in Undecidability.TM.Code.WriteValue]
l:37 [binder, in Undecidability.TM.Combinators.StateWhile]
l:37 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
l:3703 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
l:373 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
l:38 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
l:38 [binder, in Undecidability.L.Datatypes.LOptions]
l:38 [binder, in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
l:38 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
l:38 [binder, in Undecidability.L.AbstractMachines.FlatPro.Programs]
l:387 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
l:39 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
l:39 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
l:39 [binder, in Complexity.Complexity.UpToCPoly]
l:4 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
l:4 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
l:4 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_upto]
l:4 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
l:4 [binder, in Undecidability.L.Datatypes.List.List_fold]
l:4 [binder, in Complexity.TM.Single.DecodeTape]
l:40 [binder, in Undecidability.TM.Code.CaseList]
l:40 [binder, in Undecidability.L.Datatypes.List.List_basics]
l:40 [binder, in Undecidability.TM.Code.List.Nth]
l:40 [binder, in Complexity.Libs.CookPrelim.PolyBounds]
l:40 [binder, in Undecidability.Shared.Libs.DLW.Utils.list_bool]
l:40 [binder, in Undecidability.Shared.Libs.DLW.Utils.php]
l:40 [binder, in Complexity.NP.Clique.FlatClique]
l:40 [binder, in Complexity.L.TM.TMflatten]
l:40 [binder, in Undecidability.TM.Combinators.StateWhile]
l:40 [binder, in Undecidability.L.Datatypes.List.List_fold]
l:41 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
L:41 [binder, in Complexity.NP.Clique.FlatClique]
l:41 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TM_single]
l:41 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
l:41 [binder, in Undecidability.TM.Combinators.StateWhile]
l:41 [binder, in Complexity.NP.SAT.SAT]
l:42 [binder, in Undecidability.TM.Code.List.Concat_Repeat]
l:42 [binder, in Undecidability.TM.L.Transcode.Boollist_to_Enc]
l:42 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
l:42 [binder, in Undecidability.Shared.Libs.DLW.Utils.php]
L:42 [binder, in Complexity.NP.Clique.FlatClique]
l:42 [binder, in Undecidability.L.AbstractMachines.FlatPro.Programs]
l:42 [binder, in Undecidability.L.Prelim.MoreList]
l:43 [binder, in Undecidability.TM.Code.List.Concat_Repeat]
l:43 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
l:43 [binder, in Complexity.Libs.CookPrelim.PolyBounds]
l:43 [binder, in Complexity.Complexity.UpToCPoly]
l:43 [binder, in Complexity.NP.Clique.FlatClique]
l:43 [binder, in Undecidability.TM.Combinators.StateWhile]
l:43 [binder, in Undecidability.Shared.Libs.DLW.Code.subcode]
L:43 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.FiniteFunction]
l:44 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
l:44 [binder, in Undecidability.L.Datatypes.List.List_basics]
l:44 [binder, in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
l:44 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
l:44 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
l:44 [binder, in Undecidability.Shared.Libs.DLW.Utils.list_bool]
l:44 [binder, in Complexity.NP.Clique.FlatClique]
l:44 [binder, in Undecidability.L.AbstractMachines.FlatPro.Programs]
l:44 [binder, in Undecidability.L.Datatypes.List.List_in]
l:44 [binder, in Undecidability.L.Prelim.MoreList]
l:45 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
l:45 [binder, in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
l:45 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
l:45 [binder, in Undecidability.Shared.Libs.DLW.Utils.php]
L:45 [binder, in Complexity.NP.Clique.FlatClique]
L:45 [binder, in Complexity.NP.Clique.kSAT_to_Clique]
l:46 [binder, in Undecidability.L.Tactics.GenEncode]
l:46 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
l:46 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
l:46 [binder, in Undecidability.Shared.Libs.DLW.Utils.php]
l:46 [binder, in Complexity.L.TM.TMflatten]
l:46 [binder, in Undecidability.TM.Combinators.StateWhile]
l:46 [binder, in Undecidability.L.Prelim.MoreList]
l:461 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
l:47 [binder, in Undecidability.TM.Code.List.Nth]
l:47 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
l:47 [binder, in Complexity.Complexity.UpToCPoly]
l:47 [binder, in Undecidability.L.Datatypes.List.List_in]
l:47 [binder, in Undecidability.Shared.Libs.DLW.Code.subcode]
l:478 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
l:48 [binder, in Undecidability.TM.Code.List.Concat_Repeat]
l:48 [binder, in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
l:48 [binder, in Undecidability.L.Tactics.ComputableDemo]
l:48 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
l:48 [binder, in Undecidability.Shared.Libs.DLW.Utils.list_bool]
l:48 [binder, in Undecidability.Shared.Libs.DLW.Utils.php]
l:48 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_base]
l:48 [binder, in Undecidability.L.Datatypes.List.List_in]
L:48 [binder, in Undecidability.L.Functions.FinTypeLookup]
l:48 [binder, in Undecidability.L.Prelim.MoreList]
l:49 [binder, in Undecidability.TM.Code.List.Concat_Repeat]
l:49 [binder, in Undecidability.L.Datatypes.List.List_basics]
l:49 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
l:49 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
l:49 [binder, in Complexity.Libs.CookPrelim.PolyBounds]
l:49 [binder, in Complexity.NP.SAT.SAT]
l:5 [binder, in Complexity.NP.SAT.SAT_inNP]
l:5 [binder, in Undecidability.Shared.Libs.DLW.Utils.php]
l:5 [binder, in Undecidability.Shared.Libs.DLW.Utils.seteq]
l:5 [binder, in Complexity.TM.Single.DecodeTape]
l:50 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_quotient]
l:50 [binder, in Undecidability.TM.Code.CaseList]
l:50 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
l:50 [binder, in Undecidability.Shared.Libs.DLW.Utils.php]
l:51 [binder, in Undecidability.Shared.Libs.DLW.Utils.prime]
l:51 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TM_single]
l:51 [binder, in Undecidability.Shared.Libs.DLW.Code.subcode]
l:52 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
l:52 [binder, in Undecidability.Shared.Libs.DLW.Utils.list_bool]
l:52 [binder, in Undecidability.Shared.Libs.DLW.Utils.php]
l:52 [binder, in Undecidability.TM.Combinators.StateWhile]
l:53 [binder, in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
l:53 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
l:53 [binder, in Complexity.Libs.CookPrelim.PolyBounds]
l:53 [binder, in Complexity.L.TM.TMflatten]
l:53 [binder, in Complexity.NP.Clique.kSAT_to_Clique]
l:53 [binder, in Complexity.NP.SAT.SAT]
l:53 [binder, in Complexity.TM.PrettyBounds.PrettyBounds]
l:54 [binder, in Undecidability.Shared.Libs.DLW.Utils.prime]
l:54 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
l:54 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
l:54 [binder, in Complexity.Libs.CookPrelim.PolyBounds]
l:54 [binder, in Complexity.Complexity.UpToCPoly]
l:54 [binder, in Undecidability.L.Datatypes.List.List_in]
l:55 [binder, in Undecidability.Shared.Libs.DLW.Utils.prime]
l:55 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
l:55 [binder, in Undecidability.Shared.Libs.DLW.Utils.list_bool]
l:55 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_base]
l:56 [binder, in Undecidability.TM.Code.CaseList]
l:56 [binder, in Undecidability.Shared.Libs.DLW.Utils.prime]
l:56 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
l:56 [binder, in Complexity.Libs.CookPrelim.PolyBounds]
l:56 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
l:56 [binder, in Complexity.L.TM.TMflatFun]
l:56 [binder, in Undecidability.Shared.Libs.DLW.Code.subcode]
l:57 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
l:57 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
l:57 [binder, in Undecidability.L.Datatypes.List.List_in]
l:57 [binder, in Undecidability.TM.Combinators.StateWhile]
l:57 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
l:58 [binder, in Complexity.Libs.CookPrelim.PolyBounds]
l:58 [binder, in Undecidability.Shared.Libs.DLW.Utils.list_bool]
l:58 [binder, in Complexity.Complexity.UpToCPoly]
l:58 [binder, in Complexity.L.TM.TMflatten]
l:59 [binder, in Undecidability.TM.Code.List.Concat_Repeat]
l:59 [binder, in Undecidability.Shared.Libs.DLW.Utils.prime]
l:59 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
l:59 [binder, in Undecidability.Shared.Libs.DLW.Utils.list_bool]
l:59 [binder, in Complexity.NP.Clique.FlatClique]
L:59 [binder, in Undecidability.L.Functions.FinTypeLookup]
l:6 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
l:6 [binder, in Complexity.NP.Clique.Clique]
l:6 [binder, in Undecidability.L.Datatypes.List.List_nat]
l:6 [binder, in Complexity.L.TM.TMunflatten]
L:6 [binder, in Undecidability.Synthetic.ListEnumerabilityFacts]
l:6 [binder, in Undecidability.L.Datatypes.List.List_in]
l:6 [binder, in Undecidability.TM.Combinators.StateWhile]
l:6 [binder, in Complexity.NP.Clique.kSAT_to_FlatClique]
l:60 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
l:60 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
L:60 [binder, in Complexity.L.TM.TMflatten]
L:60 [binder, in Undecidability.Synthetic.ListEnumerabilityFacts]
l:61 [binder, in Undecidability.Shared.Libs.DLW.Utils.prime]
l:61 [binder, in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
l:61 [binder, in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
l:61 [binder, in Undecidability.Shared.Libs.DLW.Utils.list_bool]
l:61 [binder, in Complexity.Complexity.UpToCPoly]
l:61 [binder, in Complexity.TM.PrettyBounds.PrettyBounds]
l:62 [binder, in Undecidability.Shared.Libs.DLW.Utils.prime]
l:62 [binder, in Undecidability.Shared.Libs.DLW.Utils.list_bool]
l:62 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
l:63 [binder, in Undecidability.TM.Code.List.Concat_Repeat]
l:63 [binder, in Undecidability.L.Datatypes.List.List_basics]
l:63 [binder, in Complexity.NP.L.CanEnumTerm]
l:63 [binder, in Complexity.Libs.CookPrelim.PolyBounds]
l:63 [binder, in Complexity.NP.Clique.FlatClique]
L:63 [binder, in Undecidability.L.Computability.Synthetic]
l:64 [binder, in Undecidability.TM.Code.CaseList]
l:64 [binder, in Complexity.NP.L.CanEnumTerm]
l:64 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
l:64 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
l:64 [binder, in Undecidability.Shared.Libs.DLW.Utils.list_bool]
l:64 [binder, in Complexity.Complexity.UpToCPoly]
l:64 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachine]
l:65 [binder, in Undecidability.Shared.Libs.DLW.Utils.prime]
l:65 [binder, in Undecidability.L.Datatypes.List.List_basics]
l:65 [binder, in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
l:65 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
l:65 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
l:65 [binder, in Undecidability.Shared.Libs.DLW.Utils.list_bool]
l:65 [binder, in Undecidability.Shared.Libs.DLW.Utils.php]
l:65 [binder, in Complexity.NP.Clique.FlatClique]
L:65 [binder, in Undecidability.Synthetic.ListEnumerabilityFacts]
l:65 [binder, in Undecidability.TM.Combinators.StateWhile]
l:66 [binder, in Undecidability.TM.Code.List.Concat_Repeat]
l:66 [binder, in Undecidability.L.Datatypes.List.List_basics]
l:66 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
l:66 [binder, in Undecidability.Shared.Libs.DLW.Utils.list_bool]
l:66 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
l:67 [binder, in Undecidability.L.Datatypes.List.List_basics]
l:67 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
l:67 [binder, in Complexity.Libs.CookPrelim.PolyBounds]
l:67 [binder, in Undecidability.Shared.Libs.DLW.Utils.list_bool]
L:67 [binder, in Undecidability.Synthetic.ListEnumerabilityFacts]
l:67 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
l:67 [binder, in Undecidability.TM.Single.EncodeTapes]
l:670 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
l:679 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
l:68 [binder, in Undecidability.TM.Code.CaseList]
l:68 [binder, in Undecidability.L.Datatypes.List.List_basics]
l:68 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
l:68 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
l:68 [binder, in Undecidability.Shared.Libs.DLW.Utils.php]
l:685 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
l:69 [binder, in Undecidability.Shared.Libs.DLW.Utils.prime]
l:69 [binder, in Undecidability.Shared.Libs.DLW.Utils.list_bool]
l:69 [binder, in Complexity.NP.Clique.FlatClique]
l:7 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
l:7 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
l:7 [binder, in Undecidability.Shared.FinTypeEquiv]
l:7 [binder, in Complexity.L.TM.CompCode]
l:7 [binder, in Undecidability.Shared.Libs.DLW.Wf.wf_incl]
l:7 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
l:7 [binder, in Complexity.Libs.CookPrelim.PolyBounds]
l:7 [binder, in Undecidability.TM.Combinators.StateWhile]
l:70 [binder, in Undecidability.L.Datatypes.List.List_basics]
l:70 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
l:70 [binder, in Complexity.Complexity.UpToCPoly]
L:70 [binder, in Complexity.NP.Clique.kSAT_to_Clique]
L:70 [binder, in Undecidability.L.Computability.Synthetic]
l:70 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
l:71 [binder, in Undecidability.L.Datatypes.List.List_basics]
l:71 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
l:71 [binder, in Undecidability.TM.Combinators.StateWhile]
l:72 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
l:72 [binder, in Undecidability.Shared.Libs.DLW.Utils.prime]
l:72 [binder, in Undecidability.L.Datatypes.List.List_basics]
l:72 [binder, in Undecidability.Shared.Libs.DLW.Utils.php]
L:72 [binder, in Undecidability.Synthetic.ListEnumerabilityFacts]
l:73 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
l:73 [binder, in Undecidability.Shared.Libs.DLW.Utils.list_bool]
L:73 [binder, in Complexity.NP.Clique.kSAT_to_Clique]
l:73 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
l:74 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
l:74 [binder, in Complexity.L.TM.TMflatComp]
l:74 [binder, in Undecidability.Shared.Libs.DLW.Utils.php]
l:74 [binder, in Complexity.NP.Clique.FlatClique]
l:74 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
l:74 [binder, in Undecidability.Shared.Libs.DLW.Code.subcode]
l:75 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
l:75 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
l:75 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
l:75 [binder, in Complexity.Complexity.UpToCPoly]
l:75 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
l:76 [binder, in Undecidability.Shared.Libs.DLW.Utils.prime]
L:76 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
l:76 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
l:76 [binder, in Undecidability.Shared.Libs.DLW.Utils.php]
L:76 [binder, in Undecidability.Synthetic.ListEnumerabilityFacts]
l:76 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
l:77 [binder, in Undecidability.L.Computability.Seval]
l:77 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
l:77 [binder, in Undecidability.Shared.Libs.DLW.Utils.list_bool]
l:77 [binder, in Complexity.NP.Clique.FlatClique]
l:77 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
l:78 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
l:78 [binder, in Undecidability.Shared.Libs.DLW.Utils.list_bool]
l:78 [binder, in Undecidability.TM.Combinators.StateWhile]
l:79 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
l:79 [binder, in Undecidability.Shared.Libs.DLW.Utils.list_bool]
l:79 [binder, in Complexity.Complexity.UpToCPoly]
l:79 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_base]
l:8 [binder, in Undecidability.TM.Code.List.Cons_constant]
l:8 [binder, in Undecidability.L.Datatypes.Lists]
l:8 [binder, in Undecidability.L.Prelim.MoreBase]
l:8 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
l:8 [binder, in Undecidability.Shared.ListAutomation]
l:8 [binder, in Undecidability.L.Datatypes.List.List_fold]
L:80 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
l:81 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
l:81 [binder, in Complexity.NP.Clique.FlatClique]
l:82 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
L:82 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
l:82 [binder, in Undecidability.Shared.Libs.DLW.Utils.php]
l:82 [binder, in Complexity.L.TM.TMunflatten]
L:82 [binder, in Undecidability.Synthetic.ListEnumerabilityFacts]
l:83 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
l:83 [binder, in Undecidability.L.Tactics.LClos]
L:83 [binder, in Complexity.NP.Clique.kSAT_to_Clique]
l:83 [binder, in Undecidability.Shared.Libs.DLW.Code.subcode]
l:84 [binder, in Complexity.NP.Clique.FlatClique]
L:84 [binder, in Undecidability.Synthetic.ListEnumerabilityFacts]
l:84 [binder, in Undecidability.TM.Combinators.StateWhile]
l:85 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
l:85 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
L:85 [binder, in Complexity.L.TM.TMunflatten]
l:86 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
l:86 [binder, in Complexity.Libs.CookPrelim.PolyBounds]
l:86 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_base]
L:86 [binder, in Undecidability.Synthetic.ListEnumerabilityFacts]
l:86 [binder, in Undecidability.Shared.Libs.DLW.Code.subcode]
l:864 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
l:867 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
l:87 [binder, in Undecidability.L.Tactics.LClos]
L:87 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
L:87 [binder, in Complexity.NP.SAT.SAT_inNP]
l:87 [binder, in Complexity.NP.Clique.FlatClique]
l:88 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
l:88 [binder, in Undecidability.TM.Combinators.StateWhile]
l:885 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
l:89 [binder, in Undecidability.TM.Code.CaseList]
l:89 [binder, in Undecidability.L.Computability.Seval]
l:89 [binder, in Undecidability.L.Datatypes.LVector]
L:89 [binder, in Complexity.NP.SAT.SAT_inNP]
l:890 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
l:893 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
l:898 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
l:9 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
l:9 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
L:9 [binder, in Complexity.NP.Clique.Clique]
l:9 [binder, in Complexity.Libs.UniformHomomorphisms]
l:9 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_upto]
l:9 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
l:9 [binder, in Complexity.NP.Clique.FlatClique]
l:9 [binder, in Undecidability.L.AbstractMachines.FlatPro.Programs]
l:9 [binder, in Undecidability.TM.Combinators.StateWhile]
l:9 [binder, in Undecidability.Shared.Libs.DLW.Utils.seteq]
l:90 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
l:90 [binder, in Complexity.NP.Clique.FlatClique]
l:90 [binder, in Undecidability.L.Tactics.Reflection]
l:90 [binder, in Undecidability.TM.Combinators.StateWhile]
l:91 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
l:91 [binder, in Undecidability.Shared.Libs.DLW.Utils.php]
l:91 [binder, in Undecidability.TM.Combinators.StateWhile]
l:917 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
l:92 [binder, in Undecidability.L.Computability.Seval]
l:92 [binder, in Complexity.Libs.CookPrelim.PolyBounds]
l:93 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
l:93 [binder, in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
L:93 [binder, in Undecidability.Synthetic.ListEnumerabilityFacts]
l:94 [binder, in Complexity.NP.Clique.FlatClique]
l:94 [binder, in Undecidability.TM.Combinators.StateWhile]
l:94 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
l:95 [binder, in Complexity.Complexity.UpToCPoly]
l:95 [binder, in Undecidability.TM.Combinators.StateWhile]
l:96 [binder, in Undecidability.L.Computability.Seval]
l:96 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
L:96 [binder, in Undecidability.Synthetic.ListEnumerabilityFacts]
l:97 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
L:97 [binder, in Complexity.NP.Clique.kSAT_to_Clique]
L:98 [binder, in Undecidability.L.Tactics.Extract]
l:98 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
l:98 [binder, in Undecidability.L.Complexity.ResourceMeasures]
l:98 [binder, in Complexity.NP.SAT.SAT_inNP]
L:98 [binder, in Undecidability.Synthetic.ListEnumerabilityFacts]
l:99 [binder, in Undecidability.TM.Code.CaseList]
l:99 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
l:99 [binder, in Complexity.Libs.CookPrelim.PolyBounds]
l:99 [binder, in Undecidability.Shared.Libs.DLW.Utils.php]

M

M [abbreviation, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
M [module, in Complexity.NP.TM.LM_to_mTM]
main [section, in Undecidability.TM.L.CompilerBoolFuns.Compiler]
main.Hscl [variable, in Undecidability.TM.L.CompilerBoolFuns.Compiler]
main.Hs1 [variable, in Undecidability.TM.L.CompilerBoolFuns.Compiler]
main.Hs2 [variable, in Undecidability.TM.L.CompilerBoolFuns.Compiler]
main.k [variable, in Undecidability.TM.L.CompilerBoolFuns.Compiler]
main.R [variable, in Undecidability.TM.L.CompilerBoolFuns.Compiler]
main.s [variable, in Undecidability.TM.L.CompilerBoolFuns.Compiler]
makeAllEvalEnv [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
makeAllEvalEnvFin [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
makeAllEvalEnvFlat [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
makeAllEvalEnvFlat_length_poly [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
makeAllEvalEnvFlat_length_bound [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
makeAllEvalEnvFlat_envBounded [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
makeAllEvalEnvFlat_envOfFlatTypes [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
makeAllEvalEnvFlat_poly [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
makeAllEvalEnvFlat_time_bound [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
makeAllEvalEnvFlat_time [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
makeAllEvalEnv_isFlatEnvOf' [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
makeAllEvalEnv_isFlatEnvOf [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
makeCards [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
makeCardsFin [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
makeCardsFlat [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
makeCardsFlat_ofFlatType [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
makeCardsFlat_length_bound [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
makeCardsFlat_poly [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
makeCardsFlat_time_bound [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
makeCardsFlat_time [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
makeCardsP_length [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
makeCardsP_poly [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
makeCardsP_time_bound [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
makeCardsP_flat_time [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
makeCardsP_flat [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
makeCardsP_flat_step_time [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
makeCardsP_flat_step [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
makeCardsP_isFlatTCardsOf [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
makeCardsT [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
makeCards_isFlatCardOf [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
makeCards' [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
makeEdge [definition, in Complexity.NP.Clique.kSAT_to_FlatClique]
makeEdges [definition, in Complexity.NP.Clique.kSAT_to_FlatClique]
makeEdges_size_bound [lemma, in Complexity.NP.Clique.kSAT_to_FlatClique]
makeEdges_fedges_wf [lemma, in Complexity.NP.Clique.kSAT_to_FlatClique]
makeEdges_length [lemma, in Complexity.NP.Clique.kSAT_to_FlatClique]
makeEdges_poly [lemma, in Complexity.NP.Clique.kSAT_to_FlatClique]
makeEdges_time_bound [lemma, in Complexity.NP.Clique.kSAT_to_FlatClique]
makeEdges_time [definition, in Complexity.NP.Clique.kSAT_to_FlatClique]
makeEdge_poly [lemma, in Complexity.NP.Clique.kSAT_to_FlatClique]
makeEdge_time_bound [lemma, in Complexity.NP.Clique.kSAT_to_FlatClique]
makeEdge_time [definition, in Complexity.NP.Clique.kSAT_to_FlatClique]
makeHalt [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
makeHaltFlat [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
makeHaltFlat_poly [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
makeHaltFlat_time_bound [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
makeHaltFlat_time [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
makeHalt_rules [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
makeNoneLeft [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
makeNoneLeftFlat [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
makeNoneLeft_rules [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
makeNoneRight [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
makeNoneRightFlat [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
makeNoneRight_rules [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
makeNoneStay [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
makeNoneStayFlat [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
makeNoneStay_rules [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
makeNone_base_flat_poly [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
makeNone_base_flat_time_bound [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
makeNone_base_flat_time [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
makeNone_base_flat_ofFlatType [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
makeNone_base_flat [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
makeNone_base [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
makePreludeCards [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
makePreludeCards_flat_poly [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
makePreludeCards_flat_time_bound [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
makePreludeCards_flat_time [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
makePreludeCards_flat [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
makeSingleTape [definition, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
MakeSingleTape [section, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
makeSingleTape_sizeOfmTapes [lemma, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
MakeSingleTape_Bounded_by_sizeOfmTapes.n [variable, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
MakeSingleTape_Bounded_by_sizeOfmTapes.sig [variable, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
MakeSingleTape_Bounded_by_sizeOfmTapes [section, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
makeSingleTape_size [lemma, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
makeSingleTape_size' [lemma, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
makeSingleTape_sizeOfTape' [lemma, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
makeSingleTape_sizeOfTape [lemma, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
makeSingleTape_correct [lemma, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
MakeSingleTape.n [variable, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
MakeSingleTape.sigM [variable, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
makeSomeLeft [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
makeSomeLeftFlat [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
makeSomeLeft_rules [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
makeSomeRight [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
makeSomeRightFlat [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
makeSomeRight_rules [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
makeSomeStay [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
makeSomeStayFlat [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
makeSomeStay_rules [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
makeSome_base_flat_poly [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
makeSome_base_flat_time_bound [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
makeSome_base_flat_time [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
makeSome_base_flat_ofFlatType [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
makeSome_base_flat [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
makeSome_base [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
makeUnivGraphTape [definition, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
makeUnivGraphTape_correct [lemma, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
makeUnivGraphTape_correct_size [lemma, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
makeUnivStartStateTape [definition, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
makeUnivStartStateTape_correct [lemma, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
makeUnivStartStateTape_correct_size [lemma, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
makeUnivTapes [definition, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
makeUnivTapes_size_nice [lemma, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
makeUnivTapes_correct [lemma, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
makeUnivTapes_correct_size [lemma, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
makeUnivWorkingTape [definition, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
makeUnivWorkingTape_sizeOfTape_nice [lemma, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
makeUnivWorkingTape_size' [lemma, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
makeUnivWorkingTape_size [lemma, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
makeUnivWorkingTape_correct [lemma, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
many_var_in [lemma, in Undecidability.TM.L.CompilerBoolFuns.NaryApp]
many_subst_closed [lemma, in Undecidability.TM.L.CompilerBoolFuns.NaryApp]
many_subst_many_app [lemma, in Undecidability.TM.L.CompilerBoolFuns.NaryApp]
many_subst_app [lemma, in Undecidability.TM.L.CompilerBoolFuns.NaryApp]
many_beta [lemma, in Undecidability.TM.L.CompilerBoolFuns.NaryApp]
many_subst [definition, in Undecidability.TM.L.CompilerBoolFuns.NaryApp]
many_vars_S [lemma, in Undecidability.TM.L.CompilerBoolFuns.NaryApp]
many_vars [definition, in Undecidability.TM.L.CompilerBoolFuns.NaryApp]
many_app [definition, in Undecidability.TM.L.CompilerBoolFuns.NaryApp]
many_lam [definition, in Undecidability.TM.L.CompilerBoolFuns.NaryApp]
many_app_eq_nat [lemma, in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
many_app_eq [lemma, in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
many_subst_apply_encs_to [lemma, in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
map [section, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
Map [section, in Undecidability.TM.Util.Prelim]
MapCode [section, in Undecidability.TM.Code.ChangeAlphabet]
MapCode.cX [variable, in Undecidability.TM.Code.ChangeAlphabet]
MapCode.I [variable, in Undecidability.TM.Code.ChangeAlphabet]
MapCode.I_x [variable, in Undecidability.TM.Code.ChangeAlphabet]
MapCode.retr [variable, in Undecidability.TM.Code.ChangeAlphabet]
MapCode.sig [variable, in Undecidability.TM.Code.ChangeAlphabet]
MapCode.sigX [variable, in Undecidability.TM.Code.ChangeAlphabet]
MapCode.tau [variable, in Undecidability.TM.Code.ChangeAlphabet]
MapCode.X [variable, in Undecidability.TM.Code.ChangeAlphabet]
f' [notation, in Undecidability.TM.Code.ChangeAlphabet]
g' [notation, in Undecidability.TM.Code.ChangeAlphabet]
mapPolarity [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
mapTape [definition, in Undecidability.TM.Util.TM_facts]
MapTape [section, in Undecidability.TM.Util.TM_facts]
mapTapes [definition, in Undecidability.TM.Util.TM_facts]
mapTape_isVoid [lemma, in Undecidability.TM.Code.CodeTM]
mapTape_isVoid_size [lemma, in Undecidability.TM.Code.CodeTM]
mapTape_local [lemma, in Undecidability.TM.Util.TM_facts]
mapTape_id [lemma, in Undecidability.TM.Util.TM_facts]
mapTape_ext [lemma, in Undecidability.TM.Util.TM_facts]
mapTape_mapTape [lemma, in Undecidability.TM.Util.TM_facts]
mapTape_inv_midtape [lemma, in Undecidability.TM.Util.TM_facts]
mapTape_inv_leftof [lemma, in Undecidability.TM.Util.TM_facts]
mapTape_inv_rightof [lemma, in Undecidability.TM.Util.TM_facts]
mapTape_inv_niltap [lemma, in Undecidability.TM.Util.TM_facts]
mapTape_move_right [lemma, in Undecidability.TM.Util.TM_facts]
mapTape_move_left [lemma, in Undecidability.TM.Util.TM_facts]
mapTape_right [lemma, in Undecidability.TM.Util.TM_facts]
mapTape_left [lemma, in Undecidability.TM.Util.TM_facts]
mapTape_current [lemma, in Undecidability.TM.Util.TM_facts]
MapTape.g [variable, in Undecidability.TM.Util.TM_facts]
MapTape.sig [variable, in Undecidability.TM.Util.TM_facts]
MapTape.tau [variable, in Undecidability.TM.Util.TM_facts]
mapTime_upTo [lemma, in Undecidability.L.Datatypes.List.List_basics]
map_vect_list_app_drop [lemma, in Complexity.TM.PrettyBounds.M2MBounds]
map_vec_pos_equiv [lemma, in Undecidability.Shared.Libs.DLW.Vec.vec]
map_vec_pos_equiv.T_trans [variable, in Undecidability.Shared.Libs.DLW.Vec.vec]
map_vec_pos_equiv.T_refl [variable, in Undecidability.Shared.Libs.DLW.Vec.vec]
map_vec_pos_equiv.T [variable, in Undecidability.Shared.Libs.DLW.Vec.vec]
map_vec_pos_equiv.Y [variable, in Undecidability.Shared.Libs.DLW.Vec.vec]
map_vec_pos_equiv.R [variable, in Undecidability.Shared.Libs.DLW.Vec.vec]
map_vec_pos_equiv.X [variable, in Undecidability.Shared.Libs.DLW.Vec.vec]
map_vec_pos_equiv [section, in Undecidability.Shared.Libs.DLW.Vec.vec]
map_vec_map_list [lemma, in Undecidability.Shared.Libs.DLW.Vec.vec]
map_pos_list_vec [lemma, in Undecidability.Shared.Libs.DLW.Vec.vec]
map_time_const [lemma, in Undecidability.L.Datatypes.List.List_basics]
map_time [definition, in Undecidability.L.Datatypes.List.List_basics]
map_vect_list_eq [lemma, in Undecidability.TM.Single.StepTM]
map_vect_list_app [lemma, in Undecidability.TM.Single.StepTM]
map_vect_list_length [lemma, in Undecidability.TM.Single.StepTM]
map_vect_list [definition, in Undecidability.TM.Single.StepTM]
map_lam [lemma, in Undecidability.L.Computability.Enum]
map_retract_prefix_inj [lemma, in Complexity.TM.Code.Decode]
map_duplicate_inv [lemma, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
map_middle_inv [lemma, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
map_app_inv [lemma, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
map_cons_inv [lemma, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
map_cst_rev [lemma, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
map_cst_snoc [lemma, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
map_cst_repeat [lemma, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
map_list_repeat [lemma, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
map_S_list_an [lemma, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
map_act [definition, in Undecidability.TM.Lifting.LiftAlphabet]
map_ext_proper [instance, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
map_injective [lemma, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
map_eq_app [lemma, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
map_eq_cons' [lemma, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
map_eq_cons [lemma, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
map_eq_nil' [lemma, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
map_eq_nil [lemma, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
map_repeat [lemma, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
map_opt_fold [lemma, in Undecidability.TM.Util.Prelim]
map_snd [definition, in Undecidability.TM.Util.Prelim]
map_fst [definition, in Undecidability.TM.Util.Prelim]
map_inr [definition, in Undecidability.TM.Util.Prelim]
map_inl [definition, in Undecidability.TM.Util.Prelim]
map_opt [definition, in Undecidability.TM.Util.Prelim]
map_term [lemma, in Undecidability.L.Tactics.ComputableDemo]
map_time_bound_env [lemma, in Complexity.Libs.CookPrelim.PolyBounds]
map_time_mono [lemma, in Complexity.Libs.CookPrelim.PolyBounds]
map_hNat_size_bound [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
map_pair [definition, in Undecidability.TM.Univ.LowLevel]
map_time_mono [lemma, in Complexity.Complexity.UpToCPoly]
map_length_eq [lemma, in Undecidability.TM.Code.ChangeAlphabet]
map_ext' [lemma, in Undecidability.L.Tactics.Reflection]
map_app_map_seperate [lemma, in Undecidability.TM.Code.Code]
map_removelast [lemma, in Undecidability.TM.Code.List.App]
map_repEl [lemma, in Complexity.Libs.CookPrelim.MorePrelim]
map_firstn [lemma, in Complexity.Libs.CookPrelim.MorePrelim]
map_skipn [lemma, in Complexity.Libs.CookPrelim.MorePrelim]
map_involution [lemma, in Complexity.Libs.CookPrelim.MorePrelim]
map_dupfree [lemma, in Complexity.Libs.CookPrelim.MorePrelim]
map.f [variable, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
map.X [variable, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
Map.X [variable, in Undecidability.TM.Util.Prelim]
map.Y [variable, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
Map.Y [variable, in Undecidability.TM.Util.Prelim]
Map.Z [variable, in Undecidability.TM.Util.Prelim]
MarkedSymbol [constructor, in Undecidability.TM.Single.EncodeTapes]
marked:4 [binder, in Undecidability.TM.Single.EncodeTapes]
marked:5 [binder, in Undecidability.TM.Single.EncodeTapes]
Match [abbreviation, in Undecidability.TM.Combinators.Switch]
MATCH [abbreviation, in Undecidability.TM.Combinators.Switch]
matchlem [definition, in Undecidability.L.Tactics.GenEncode]
MatchTapes [section, in Undecidability.TM.Util.TM_facts]
MatchTapes.sig [variable, in Undecidability.TM.Util.TM_facts]
Max [definition, in Undecidability.TM.Code.BinNumbers.PosCompareTM]
maxDepth:16 [binder, in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisUnfoldClos]
maxDepth:24 [binder, in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisUnfoldClos]
maxDepth:42 [binder, in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisUnfoldClos]
maxDepth:9 [binder, in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisUnfoldClos]
maxl [definition, in Undecidability.L.Prelim.MoreList]
MaxList [library]
maxl_rev [lemma, in Undecidability.L.Prelim.MoreList]
maxl_app [lemma, in Undecidability.L.Prelim.MoreList]
maxl_leq_l [lemma, in Undecidability.L.Prelim.MoreList]
maxl_leq [lemma, in Undecidability.L.Prelim.MoreList]
maxP [definition, in Undecidability.L.Prelim.MoreBase]
maxPro:14 [binder, in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisUnfoldClos]
maxPro:22 [binder, in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisUnfoldClos]
maxPro:40 [binder, in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisUnfoldClos]
maxPro:7 [binder, in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisUnfoldClos]
maxSize [definition, in Complexity.Complexity.UpToCPoly]
maxSize_enc_size [lemma, in Complexity.Complexity.UpToCPoly]
maxSize_bounds_time [lemma, in Complexity.Complexity.SpaceBoundsTime]
maxSize:10 [binder, in Complexity.NP.TM.TMGenNP]
maxSize:10 [binder, in Complexity.NP.L.GenNP]
maxSize:11 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
maxSize:12 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
maxSize:13 [binder, in Complexity.NP.L.LMGenNP]
maxSize:14 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
maxSize:14 [binder, in Complexity.NP.TM.TMGenNP_fixed_mTM]
maxSize:15 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.SingleTMGenNP]
maxSize:18 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
maxSize:18 [binder, in Complexity.NP.TM.TMGenNP]
maxSize:2 [binder, in Complexity.NP.L.GenNPBool]
maxSize:23 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.SingleTMGenNP]
maxSize:24 [binder, in Complexity.NP.TM.TMGenNP]
maxSize:25 [binder, in Complexity.NP.L.GenNPBool]
maxSize:26 [binder, in Complexity.NP.TM.TMGenNP_fixed_mTM]
maxSize:27 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
maxSize:30 [binder, in Complexity.NP.L.GenNPBool]
maxSize:31 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
maxSize:34 [binder, in Complexity.NP.TM.TMGenNP]
maxSize:34 [binder, in Complexity.NP.L.GenNPBool]
maxSize:39 [binder, in Complexity.NP.L.GenNPBool]
maxSize:4 [binder, in Complexity.NP.TM.L_to_LM]
maxSize:4 [binder, in Complexity.NP.L.GenNP]
maxSize:45 [binder, in Complexity.NP.TM.TMGenNP]
maxSize:5 [binder, in Complexity.NP.TM.TMGenNP_fixed_mTM]
maxSize:50 [binder, in Complexity.NP.TM.TMGenNP]
maxSize:51 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.SingleTMGenNP]
maxSize:587 [binder, in Complexity.NP.TM.LM_to_mTM]
maxSize:591 [binder, in Complexity.NP.TM.LM_to_mTM]
maxSize:597 [binder, in Complexity.NP.TM.LM_to_mTM]
maxSize:6 [binder, in Complexity.NP.L.LMGenNP]
maxSize:602 [binder, in Complexity.NP.TM.LM_to_mTM]
maxSize:606 [binder, in Complexity.NP.TM.LM_to_mTM]
maxSize:610 [binder, in Complexity.NP.TM.LM_to_mTM]
maxSize:616 [binder, in Complexity.NP.TM.LM_to_mTM]
maxSize:620 [binder, in Complexity.NP.TM.LM_to_mTM]
maxSize:8 [binder, in Complexity.NP.TM.L_to_LM]
maxVar':13 [binder, in Complexity.L.AbstractMachines.Computable.HeapMachine]
maxVar':19 [binder, in Complexity.HierarchyTheorem.TimeHierarchyTheorem]
maxVar':61 [binder, in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
maxVar':66 [binder, in Complexity.L.AbstractMachines.Computable.EvalForTime]
maxVar:12 [binder, in Complexity.L.AbstractMachines.Computable.UnivDecTime]
maxVar:12 [binder, in Complexity.L.AbstractMachines.Computable.HeapMachine]
maxVar:15 [binder, in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisUnfoldClos]
maxVar:16 [binder, in Complexity.L.AbstractMachines.Computable.HeapMachine]
maxVar:18 [binder, in Complexity.HierarchyTheorem.TimeHierarchyTheorem]
maxVar:23 [binder, in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisUnfoldClos]
maxVar:24 [binder, in Complexity.HierarchyTheorem.TimeHierarchyTheorem]
maxVar:41 [binder, in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisUnfoldClos]
maxVar:46 [binder, in Complexity.L.AbstractMachines.Computable.EvalForTime]
maxVar:5 [binder, in Complexity.L.AbstractMachines.Computable.HeapMachine]
maxVar:60 [binder, in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
maxVar:65 [binder, in Complexity.L.AbstractMachines.Computable.EvalForTime]
maxVar:66 [binder, in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
maxVar:71 [binder, in Complexity.L.AbstractMachines.Computable.EvalForTime]
maxVar:8 [binder, in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisUnfoldClos]
max_plus_l [lemma, in Complexity.TM.PrettyBounds.BaseCode]
max_le_mono [instance, in Undecidability.TM.Util.ArithPrelim]
max_list_rec_proper [instance, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
max_list_rec_map_monotone' [lemma, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
max_list_sumn [lemma, in Undecidability.TM.PrettyBounds.SizeBounds]
max_list_rec_eq_foldl [lemma, in Undecidability.TM.PrettyBounds.SizeBounds]
Max_Realise [lemma, in Undecidability.TM.Code.BinNumbers.PosCompareTM]
Max_Rel [definition, in Undecidability.TM.Code.BinNumbers.PosCompareTM]
max_le_proper [instance, in Undecidability.L.Prelim.MoreBase]
max_list_map_repeat [lemma, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
max_list_rec_repeat [lemma, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
max_time [definition, in Undecidability.L.Datatypes.LNat]
max_list_map_monotone [lemma, in Undecidability.TM.PrettyBounds.MaxList]
max_list_map_In [lemma, in Undecidability.TM.PrettyBounds.MaxList]
max_list_map_lower_bound [lemma, in Undecidability.TM.PrettyBounds.MaxList]
max_list_map_ge [lemma, in Undecidability.TM.PrettyBounds.MaxList]
max_list_map_rec [definition, in Undecidability.TM.PrettyBounds.MaxList]
max_list_map [definition, in Undecidability.TM.PrettyBounds.MaxList]
max_list_map.f [variable, in Undecidability.TM.PrettyBounds.MaxList]
max_list_map.X [variable, in Undecidability.TM.PrettyBounds.MaxList]
max_list_map [section, in Undecidability.TM.PrettyBounds.MaxList]
max_list_In [lemma, in Undecidability.TM.PrettyBounds.MaxList]
max_list_monotone [lemma, in Undecidability.TM.PrettyBounds.MaxList]
max_list_lower_bound [lemma, in Undecidability.TM.PrettyBounds.MaxList]
max_list_ge [lemma, in Undecidability.TM.PrettyBounds.MaxList]
max_list [definition, in Undecidability.TM.PrettyBounds.MaxList]
max_list_rec_In [lemma, in Undecidability.TM.PrettyBounds.MaxList]
max_list_rec_gt' [lemma, in Undecidability.TM.PrettyBounds.MaxList]
max_list_rec_gt [lemma, in Undecidability.TM.PrettyBounds.MaxList]
max_list_rec_el_or_eq [lemma, in Undecidability.TM.PrettyBounds.MaxList]
max_list_rec_idem [lemma, in Undecidability.TM.PrettyBounds.MaxList]
max_list_rec_max'' [lemma, in Undecidability.TM.PrettyBounds.MaxList]
max_list_rec_max' [lemma, in Undecidability.TM.PrettyBounds.MaxList]
max_list_rec_lower_bound [lemma, in Undecidability.TM.PrettyBounds.MaxList]
max_list_rec_monotone' [lemma, in Undecidability.TM.PrettyBounds.MaxList]
max_list_rec_monotone [lemma, in Undecidability.TM.PrettyBounds.MaxList]
max_list_rec_ge_el_ge [lemma, in Undecidability.TM.PrettyBounds.MaxList]
max_list_rec_ge_el [lemma, in Undecidability.TM.PrettyBounds.MaxList]
max_list_rec_ge [lemma, in Undecidability.TM.PrettyBounds.MaxList]
max_list_rec_irrelevant [lemma, in Undecidability.TM.PrettyBounds.MaxList]
max_list_rec_max [lemma, in Undecidability.TM.PrettyBounds.MaxList]
max_list_rec [definition, in Undecidability.TM.PrettyBounds.MaxList]
max'_le_mono [instance, in Undecidability.TM.Util.ArithPrelim]
max:11 [binder, in Complexity.L.Functions.IterupN]
max:16 [binder, in Complexity.L.Functions.IterupN]
max:21 [binder, in Complexity.L.Functions.IterupN]
max:28 [binder, in Complexity.L.Functions.IterupN]
max:3 [binder, in Complexity.L.Functions.IterupN]
max:33 [binder, in Complexity.L.Functions.IterupN]
mA:61 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.FiniteFunction]
mb:11 [binder, in Undecidability.TM.Code.BinNumbers.PosPointers]
mb:24 [binder, in Undecidability.TM.Code.BinNumbers.PosPointers]
mb:3 [binder, in Undecidability.TM.Code.BinNumbers.PosPointers]
mB:62 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.FiniteFunction]
mb:8 [binder, in Undecidability.TM.Code.BinNumbers.PosPointers]
mconfig [record, in Undecidability.TM.Util.TM_facts]
mconfigAsPair [definition, in Undecidability.L.TM.TMEncoding]
mconfigFlat [definition, in Complexity.L.TM.TMflat]
mconfig_for_sconfig [definition, in Complexity.NP.SAT.CookLevin.Subproblems.TM_single]
measure_double_rect_fix [lemma, in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
measure_double_rect.measure_double_rect.Fix_F_2_Acc_irr [variable, in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
measure_double_rect.measure_double_rect.Fix_F_2_paired_Acc_irr [variable, in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
measure_double_rect.measure_double_rect.Fix_F_2_paired [variable, in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
measure_double_rect.measure_double_rect.F_ext [variable, in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
measure_double_rect [definition, in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
measure_double_rect.measure_double_rect.Fix_F_2_fix [variable, in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
measure_double_rect.measure_double_rect.Fix_F_2 [variable, in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
measure_double_rect.measure_double_rect [section, in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
measure_double_rect_paired [lemma, in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
measure_double_rect.measure_double_rect_paired.Q [variable, in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
measure_double_rect.measure_double_rect_paired [section, in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
measure_double_rect.Rwf [variable, in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
measure_double_rect.R [variable, in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
measure_double_rect.m' [variable, in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
measure_double_rect.F [variable, in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
measure_double_rect.P [variable, in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
measure_double_rect.m [variable, in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
measure_double_rect.Y [variable, in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
measure_double_rect.X [variable, in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
measure_double_rect [section, in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
measure_rect_fix [lemma, in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
measure_rect.Fix_F_Acc_irr [variable, in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
measure_rect.F_ext [variable, in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
measure_rect [definition, in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
measure_rect.Fix_F_fix [variable, in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
measure_rect.Fix_F [variable, in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
measure_rect.Rwf [variable, in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
measure_rect.R [variable, in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
measure_rect.F [variable, in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
measure_rect.P [variable, in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
measure_rect.m [variable, in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
measure_rect.X [variable, in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
measure_rect [section, in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
measure_rect3 [definition, in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
measure_rect_123.measure_rect3.R [variable, in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
measure_rect_123.measure_rect3.m' [variable, in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
measure_rect_123.measure_rect3.F [variable, in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
measure_rect_123.measure_rect3.P [variable, in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
measure_rect_123.measure_rect3.m [variable, in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
measure_rect_123.measure_rect3.Z [variable, in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
measure_rect_123.measure_rect3.Y [variable, in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
measure_rect_123.measure_rect3.X [variable, in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
measure_rect_123.measure_rect3 [section, in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
measure_rect2 [definition, in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
measure_rect_123.measure_rect2.R [variable, in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
measure_rect_123.measure_rect2.m' [variable, in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
measure_rect_123.measure_rect2.F [variable, in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
measure_rect_123.measure_rect2.P [variable, in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
measure_rect_123.measure_rect2.m [variable, in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
measure_rect_123.measure_rect2.Y [variable, in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
measure_rect_123.measure_rect2.X [variable, in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
measure_rect_123.measure_rect2 [section, in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
measure_rect [definition, in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
measure_rect_123.measure_rect.F [variable, in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
measure_rect_123.measure_rect.P [variable, in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
measure_rect_123.measure_rect.m [variable, in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
measure_rect_123.measure_rect.X [variable, in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
measure_rect_123.measure_rect [section, in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
measure_rect_123 [section, in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
measure_ind [library]
meet_sum_powers [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
Membership [section, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
Membership.X [variable, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
mem_sigma [lemma, in Complexity.Libs.Pigeonhole]
mem_dec [lemma, in Complexity.Libs.Pigeonhole]
Mf [definition, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
mflat:3684 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Mfp [definition, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
Mfp_nice [lemma, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
Mfp_nice3 [lemma, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
Mfp_nice2 [lemma, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
Mfp_nice1 [lemma, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
Mfp_nice0 [lemma, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
Mfp_eq [lemma, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
Mf_bounded [lemma, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
midtape [constructor, in Undecidability.TM.TM]
midtape_tape_local_l_cons_right [lemma, in Undecidability.TM.Util.TM_facts]
midtape_tape_local_l_cons [lemma, in Undecidability.TM.Util.TM_facts]
midtape_tape_local_cons_left [lemma, in Undecidability.TM.Util.TM_facts]
midtape_tape_local_cons [lemma, in Undecidability.TM.Util.TM_facts]
minimize [lemma, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
minSucc:152 [binder, in Undecidability.TM.Single.StepTM]
min_le_proper [instance, in Undecidability.L.Prelim.MoreBase]
min_time [definition, in Undecidability.L.Datatypes.LNat]
min_dec [definition, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
min:151 [binder, in Undecidability.TM.Single.StepTM]
Mirror [definition, in Undecidability.TM.Combinators.Mirror]
Mirror [section, in Undecidability.TM.Combinators.Mirror]
Mirror [library]
mirrorConf [definition, in Undecidability.TM.Combinators.Mirror]
mirrorConf_injective [lemma, in Undecidability.TM.Combinators.Mirror]
mirrorConf_involution [lemma, in Undecidability.TM.Combinators.Mirror]
MirrorTape [section, in Undecidability.TM.Util.TM_facts]
MirrorTape.n [variable, in Undecidability.TM.Util.TM_facts]
MirrorTape.sig [variable, in Undecidability.TM.Util.TM_facts]
MirrorTM [definition, in Undecidability.TM.Combinators.Mirror]
Mirror_RealiseIn [lemma, in Undecidability.TM.Combinators.Mirror]
Mirror_Terminates [lemma, in Undecidability.TM.Combinators.Mirror]
Mirror_T [definition, in Undecidability.TM.Combinators.Mirror]
Mirror_Realise [lemma, in Undecidability.TM.Combinators.Mirror]
Mirror_Rel [definition, in Undecidability.TM.Combinators.Mirror]
mirror_unlift [lemma, in Undecidability.TM.Combinators.Mirror]
mirror_lift [lemma, in Undecidability.TM.Combinators.Mirror]
mirror_step [lemma, in Undecidability.TM.Combinators.Mirror]
Mirror_trans [definition, in Undecidability.TM.Combinators.Mirror]
mirror_acts_involution [lemma, in Undecidability.TM.Combinators.Mirror]
mirror_act_involution [lemma, in Undecidability.TM.Combinators.Mirror]
mirror_acts [definition, in Undecidability.TM.Combinators.Mirror]
mirror_act [definition, in Undecidability.TM.Combinators.Mirror]
mirror_tape_move_right' [lemma, in Undecidability.TM.Util.TM_facts]
mirror_tape_move_left' [lemma, in Undecidability.TM.Util.TM_facts]
mirror_tapes_nth [lemma, in Undecidability.TM.Util.TM_facts]
mirror_move_involution [lemma, in Undecidability.TM.Util.TM_facts]
mirror_move [definition, in Undecidability.TM.Util.TM_facts]
mirror_tapes_injective [lemma, in Undecidability.TM.Util.TM_facts]
mirror_tapes_involution [lemma, in Undecidability.TM.Util.TM_facts]
mirror_tapes [definition, in Undecidability.TM.Util.TM_facts]
mirror_tape_inv_niltape' [lemma, in Undecidability.TM.Util.TM_facts]
mirror_tape_inv_rightof' [lemma, in Undecidability.TM.Util.TM_facts]
mirror_tape_inv_leftof' [lemma, in Undecidability.TM.Util.TM_facts]
mirror_tape_inv_midtape' [lemma, in Undecidability.TM.Util.TM_facts]
mirror_tape_inv_niltape [lemma, in Undecidability.TM.Util.TM_facts]
mirror_tape_inv_rightof [lemma, in Undecidability.TM.Util.TM_facts]
mirror_tape_inv_leftof [lemma, in Undecidability.TM.Util.TM_facts]
mirror_tape_inv_midtape [lemma, in Undecidability.TM.Util.TM_facts]
mirror_tape_move_right [lemma, in Undecidability.TM.Util.TM_facts]
mirror_tape_move_left [lemma, in Undecidability.TM.Util.TM_facts]
mirror_tape_injective [lemma, in Undecidability.TM.Util.TM_facts]
mirror_tape_involution [lemma, in Undecidability.TM.Util.TM_facts]
mirror_tape_current [lemma, in Undecidability.TM.Util.TM_facts]
mirror_tape_right [lemma, in Undecidability.TM.Util.TM_facts]
mirror_tape_left [lemma, in Undecidability.TM.Util.TM_facts]
mirror_tape [definition, in Undecidability.TM.Util.TM_facts]
Mirror.F [variable, in Undecidability.TM.Combinators.Mirror]
Mirror.n [variable, in Undecidability.TM.Combinators.Mirror]
Mirror.pM [variable, in Undecidability.TM.Combinators.Mirror]
Mirror.sig [variable, in Undecidability.TM.Combinators.Mirror]
mixedTactics [library]
mkApp [definition, in Undecidability.L.Tactics.Extract]
mkAppList [definition, in Undecidability.L.Tactics.Extract]
mkArgList [definition, in Complexity.L.TM.TMflatten]
mkFixMatch [definition, in Undecidability.L.Tactics.Extract]
mkIsFlatCardsOf [constructor, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
mkIsFlatCardsOf [constructor, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
mkIsFlatCCCardO [constructor, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
mkIsFlatCCOf [constructor, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
mkIsFlatEdgesOf [constructor, in Complexity.NP.Clique.FlatUGraph]
mkIsFlatFinalOf [constructor, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
mkIsFlatTCCCardOf [constructor, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
mkIsFlatTCCCardPOf [constructor, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
mkIsFlatTCCOf [constructor, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
mkisFlatteningConfigOf [constructor, in Complexity.L.TM.TMflat]
mkIsFlatteningHaltOf [constructor, in Complexity.L.TM.TMflat]
mkIsFlatteningTapeOf [constructor, in Complexity.L.TM.TMflat]
mkIsFlatteningTMOf [constructor, in Complexity.L.TM.TMflat]
mkIsFlatteningTransOf [constructor, in Complexity.L.TM.TMflat]
mkLam [definition, in Undecidability.L.Tactics.Extract]
mkLApp [definition, in Undecidability.L.Tactics.GenEncode]
mkMatch [definition, in Undecidability.L.Tactics.GenEncode]
mkNat [definition, in Undecidability.L.Tactics.Extract]
mkUpToC [constructor, in Undecidability.L.Complexity.UpToC]
mkVar [definition, in Undecidability.L.Tactics.Extract]
mkVarEnv [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
mkVarEnv_poly [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
mkVarEnv_time_bound [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
mkVarEnv_length [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
mkVarEnv_time [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
mkVarEnv_step_time [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
mkVarEnv_step [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
Mk_finite_quotient [constructor, in Undecidability.Shared.Libs.DLW.Utils.fin_quotient]
Mk_finite_partial_quotient [constructor, in Undecidability.Shared.Libs.DLW.Utils.fin_quotient]
mk_encodable [constructor, in Undecidability.L.Tactics.Extract]
Mk_R_p [definition, in Undecidability.TM.Basic.Mono]
Mk_Mono.R [variable, in Undecidability.TM.Basic.Mono]
Mk_Mono.F [variable, in Undecidability.TM.Basic.Mono]
Mk_Mono_TM [definition, in Undecidability.TM.Basic.Mono]
Mk_Mono.fin [variable, in Undecidability.TM.Basic.Mono]
Mk_Mono.init [variable, in Undecidability.TM.Basic.Mono]
Mk_Mono.mono_trans [variable, in Undecidability.TM.Basic.Mono]
Mk_Mono.state [variable, in Undecidability.TM.Basic.Mono]
Mk_Mono.sig [variable, in Undecidability.TM.Basic.Mono]
Mk_Mono [section, in Undecidability.TM.Basic.Mono]
mk_monoid [constructor, in Undecidability.Shared.Libs.DLW.Utils.sums]
Mk_domain_of_goal [constructor, in Undecidability.L.Complexity.GenericNary]
Mk_domain_goal_hint [constructor, in Undecidability.L.Complexity.GenericNary]
mk_mconfig [constructor, in Undecidability.TM.Util.TM_facts]
mk_init.sim [variable, in Undecidability.TM.L.CompilerBoolFuns.Compiler]
mk_init.k [variable, in Undecidability.TM.L.CompilerBoolFuns.Compiler]
mk_init.m [variable, in Undecidability.TM.L.CompilerBoolFuns.Compiler]
mk_init.H_disj [variable, in Undecidability.TM.L.CompilerBoolFuns.Compiler]
mk_init.b [variable, in Undecidability.TM.L.CompilerBoolFuns.Compiler]
mk_init.s [variable, in Undecidability.TM.L.CompilerBoolFuns.Compiler]
mk_init.Σ [variable, in Undecidability.TM.L.CompilerBoolFuns.Compiler]
mk_init [section, in Undecidability.TM.L.CompilerBoolFuns.Compiler]
mk_init_one.retr_list [variable, in Undecidability.TM.L.CompilerBoolFuns.Compiler]
mk_init_one.retr_pro [variable, in Undecidability.TM.L.CompilerBoolFuns.Compiler]
mk_init_one.H_disj [variable, in Undecidability.TM.L.CompilerBoolFuns.Compiler]
mk_init_one.b [variable, in Undecidability.TM.L.CompilerBoolFuns.Compiler]
mk_init_one.s [variable, in Undecidability.TM.L.CompilerBoolFuns.Compiler]
mk_init_one.Σ [variable, in Undecidability.TM.L.CompilerBoolFuns.Compiler]
mk_init_one [section, in Undecidability.TM.L.CompilerBoolFuns.Compiler]
MK_isVoid_multi_SpecT [lemma, in Undecidability.TM.L.CompilerBoolFuns.Compiler]
MK_isVoid_multi [definition, in Undecidability.TM.L.CompilerBoolFuns.Compiler]
MK_isVoid_Spec [lemma, in Undecidability.TM.L.CompilerBoolFuns.Compiler]
MK_isVoid_Sem [lemma, in Undecidability.TM.L.CompilerBoolFuns.Compiler]
MK_isVoid [definition, in Undecidability.TM.L.CompilerBoolFuns.Compiler]
MK_isVoid [section, in Undecidability.TM.L.CompilerBoolFuns.Compiler]
mm':399 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
mm:108 [binder, in Undecidability.Shared.Libs.DLW.Utils.php]
mm:120 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
mm:13 [binder, in Undecidability.Shared.Libs.DLW.Code.compiler]
mm:21 [binder, in Undecidability.Shared.Libs.DLW.Code.compiler]
mm:297 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
mm:34 [binder, in Undecidability.Shared.Libs.DLW.Code.compiler]
mm:397 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
mm:405 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
mm:414 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
mm:422 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
mm:434 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
mm:444 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
mm:45 [binder, in Undecidability.Shared.Libs.DLW.Code.compiler]
mm:54 [binder, in Undecidability.Shared.Libs.DLW.Code.compiler]
modpath:61 [binder, in Undecidability.L.Tactics.GenEncode]
modS_divide [lemma, in Undecidability.Shared.Libs.DLW.Utils.prime]
modulo_time_bound [lemma, in Complexity.Libs.CookPrelim.PolyBounds]
modulo_time [definition, in Undecidability.L.Datatypes.LNat]
Mono [library]
monoid_assoc [projection, in Undecidability.Shared.Libs.DLW.Utils.sums]
monoid_unit_r [projection, in Undecidability.Shared.Libs.DLW.Utils.sums]
monoid_unit_l [projection, in Undecidability.Shared.Libs.DLW.Utils.sums]
monoid_theory [record, in Undecidability.Shared.Libs.DLW.Utils.sums]
monoIn__toTerm [projection, in Complexity.NP.L.CanEnumTerm_def]
monotonic [definition, in Complexity.Complexity.Monotonic]
Monotonic [library]
monotonic_pointwise_eq [instance, in Complexity.Complexity.Monotonic]
monotonic_comp [lemma, in Complexity.Complexity.Monotonic]
monotonic_x [lemma, in Complexity.Complexity.Monotonic]
monotonic_pow_c [lemma, in Complexity.Complexity.Monotonic]
monotonic_mul [lemma, in Complexity.Complexity.Monotonic]
monotonic_S [lemma, in Complexity.Complexity.Monotonic]
monotonic_add [lemma, in Complexity.Complexity.Monotonic]
monotonic_c [lemma, in Complexity.Complexity.Monotonic]
mono_t__evalForTime [lemma, in Complexity.L.AbstractMachines.Computable.EvalForTime]
mono_t__E [lemma, in Complexity.HierarchyTheorem.TimeHierarchyTheorem]
Mono_Nop.sig [variable, in Undecidability.TM.Basic.Null]
Mono_Nop [section, in Undecidability.TM.Basic.Null]
mono__polyTC [projection, in Complexity.Complexity.Definitions]
mono__rSP [projection, in Complexity.Complexity.Definitions]
mono__pCR [projection, in Complexity.Complexity.NP]
mono_map_time [lemma, in Complexity.NP.TM.LM_to_mTM]
MoreBase [library]
MoreDominationLemmas [section, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
MoreEnumerabilityFacts [library]
MoreList [library]
MorePrelim [library]
MoreSums [section, in Undecidability.Shared.Libs.PSL.Retracts]
mout:2027 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
mout:2059 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
mout:2089 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Move [definition, in Undecidability.TM.Basic.Mono]
move [inductive, in Undecidability.TM.TM]
move [inductive, in Undecidability.TM.SBTM]
Move [section, in Undecidability.TM.Code.Copy]
movedToLeft [definition, in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
MoveLeft [definition, in Undecidability.TM.Code.Copy]
MoveLeft_Terminates [lemma, in Undecidability.TM.Code.Copy]
MoveLeft_steps [definition, in Undecidability.TM.Code.Copy]
MoveLeft_Realise [lemma, in Undecidability.TM.Code.Copy]
MoveLeft_Rel [definition, in Undecidability.TM.Code.Copy]
MovePar [definition, in Undecidability.TM.Compound.Multi]
MovePar [section, in Undecidability.TM.Compound.Multi]
MovePar_Sem [lemma, in Undecidability.TM.Compound.Multi]
MovePar_R [definition, in Undecidability.TM.Compound.Multi]
MovePar.D1 [variable, in Undecidability.TM.Compound.Multi]
MovePar.D2 [variable, in Undecidability.TM.Compound.Multi]
MovePar.sig [variable, in Undecidability.TM.Compound.Multi]
MoveRight [definition, in Undecidability.TM.Code.Copy]
MoveRight_Terminates [lemma, in Undecidability.TM.Code.Copy]
MoveRight_steps [definition, in Undecidability.TM.Code.Copy]
MoveRight_Realise [lemma, in Undecidability.TM.Code.Copy]
MoveRight_Rel [definition, in Undecidability.TM.Code.Copy]
MoveToStart [definition, in Undecidability.TM.Single.StepTM]
MoveToStart_steps_nice [lemma, in Complexity.TM.PrettyBounds.M2MBounds]
MoveToStart_Terminates [lemma, in Undecidability.TM.Single.StepTM]
MoveToStart_T [definition, in Undecidability.TM.Single.StepTM]
MoveToStart_steps [definition, in Undecidability.TM.Single.StepTM]
MoveToStart_Realise [lemma, in Undecidability.TM.Single.StepTM]
MoveToStart_Rel [definition, in Undecidability.TM.Single.StepTM]
MoveToSymbol [definition, in Undecidability.TM.Compound.MoveToSymbol]
MoveToSymbol [section, in Undecidability.TM.Compound.MoveToSymbol]
MoveToSymbol [library]
MoveToSymbol_L_steps_moveleft [lemma, in Undecidability.TM.Compound.MoveToSymbol]
MoveToSymbol_L_steps_midtape [lemma, in Undecidability.TM.Compound.MoveToSymbol]
MoveToSymbol_L_steps_local [lemma, in Undecidability.TM.Compound.MoveToSymbol]
MoveToSymbol_steps_midtape_end [lemma, in Undecidability.TM.Compound.MoveToSymbol]
MoveToSymbol_steps_local_end [lemma, in Undecidability.TM.Compound.MoveToSymbol]
MoveToSymbol_steps_moveright [lemma, in Undecidability.TM.Compound.MoveToSymbol]
MoveToSymbol_steps_midtape [lemma, in Undecidability.TM.Compound.MoveToSymbol]
MoveToSymbol_steps_local [lemma, in Undecidability.TM.Compound.MoveToSymbol]
MoveToSymbol_L_correct_moveleft [lemma, in Undecidability.TM.Compound.MoveToSymbol]
MoveToSymbol_L_correct_midtape [lemma, in Undecidability.TM.Compound.MoveToSymbol]
MoveToSymbol_L_correct [lemma, in Undecidability.TM.Compound.MoveToSymbol]
MoveToSymbol_correct_midtape_end [lemma, in Undecidability.TM.Compound.MoveToSymbol]
MoveToSymbol_correct_moveright [lemma, in Undecidability.TM.Compound.MoveToSymbol]
MoveToSymbol_correct_midtape [lemma, in Undecidability.TM.Compound.MoveToSymbol]
MoveToSymbol_correct [lemma, in Undecidability.TM.Compound.MoveToSymbol]
MoveToSymbol_Sem.f [variable, in Undecidability.TM.Compound.MoveToSymbol]
MoveToSymbol_Sem.stop [variable, in Undecidability.TM.Compound.MoveToSymbol]
MoveToSymbol_Sem.sig [variable, in Undecidability.TM.Compound.MoveToSymbol]
MoveToSymbol_Sem [section, in Undecidability.TM.Compound.MoveToSymbol]
MoveToSymbol_L_Terminates [lemma, in Undecidability.TM.Compound.MoveToSymbol]
MoveToSymbol_steps_mirror [lemma, in Undecidability.TM.Compound.MoveToSymbol]
MoveToSymbol_L_Realise [lemma, in Undecidability.TM.Compound.MoveToSymbol]
MoveToSymbol_L_Rel [definition, in Undecidability.TM.Compound.MoveToSymbol]
MoveToSymbol_mirror' [lemma, in Undecidability.TM.Compound.MoveToSymbol]
MoveToSymbol_mirror [lemma, in Undecidability.TM.Compound.MoveToSymbol]
MoveToSymbol_L [definition, in Undecidability.TM.Compound.MoveToSymbol]
MoveToSymbol_Terminates [lemma, in Undecidability.TM.Compound.MoveToSymbol]
MoveToSymbol_Realise [lemma, in Undecidability.TM.Compound.MoveToSymbol]
MoveToSymbol_Rel [definition, in Undecidability.TM.Compound.MoveToSymbol]
MoveToSymbol_skip [lemma, in Undecidability.TM.Compound.MoveToSymbol]
MoveToSymbol_Step_Fun_M2_true [lemma, in Undecidability.TM.Compound.MoveToSymbol]
MoveToSymbol_Step_false [lemma, in Undecidability.TM.Compound.MoveToSymbol]
MoveToSymbol_Step_true [lemma, in Undecidability.TM.Compound.MoveToSymbol]
MoveToSymbol_Step_None [lemma, in Undecidability.TM.Compound.MoveToSymbol]
MoveToSymbol_Step_Fun_M2_None [lemma, in Undecidability.TM.Compound.MoveToSymbol]
MoveToSymbol_Step_Sem [lemma, in Undecidability.TM.Compound.MoveToSymbol]
MoveToSymbol_Step_Rel [definition, in Undecidability.TM.Compound.MoveToSymbol]
MoveToSymbol_Step_Fun [definition, in Undecidability.TM.Compound.MoveToSymbol]
MoveToSymbol_Step [definition, in Undecidability.TM.Compound.MoveToSymbol]
MoveToSymbol_Fun_is_rel [lemma, in Complexity.TM.Compound.MoveToSymbol_niceSpec]
MoveToSymbol_Fun_nice [lemma, in Complexity.TM.Compound.MoveToSymbol_niceSpec]
MoveToSymbol_Rel_nice [definition, in Complexity.TM.Compound.MoveToSymbol_niceSpec]
MoveToSymbol_SpecTReg [lemma, in Undecidability.TM.Hoare.HoareStdLib]
MoveToSymbol_niceSpec [library]
MoveToSymbol.f [variable, in Undecidability.TM.Compound.MoveToSymbol]
MoveToSymbol.g [variable, in Undecidability.TM.Compound.MoveToSymbol]
MoveToSymbol.sig [variable, in Undecidability.TM.Compound.MoveToSymbol]
MoveValue [definition, in Undecidability.TM.Code.Copy]
MoveValue [section, in Undecidability.TM.Code.Copy]
MoveValue_steps_nice' [lemma, in Complexity.TM.PrettyBounds.BaseCode]
MoveValue_steps_nice [lemma, in Complexity.TM.PrettyBounds.BaseCode]
MoveValue_size_y_nice [lemma, in Complexity.TM.PrettyBounds.BaseCodeSpace]
MoveValue_size_x_nice [lemma, in Complexity.TM.PrettyBounds.BaseCodeSpace]
MoveValue_Spec [lemma, in Undecidability.TM.Code.Copy]
MoveValue_Spec_size [lemma, in Undecidability.TM.Code.Copy]
MoveValue_SpecT [lemma, in Undecidability.TM.Code.Copy]
MoveValue_SpecT_size [lemma, in Undecidability.TM.Code.Copy]
MoveValue_size [definition, in Undecidability.TM.Code.Copy]
MoveValue_Terminates [lemma, in Undecidability.TM.Code.Copy]
MoveValue_steps [definition, in Undecidability.TM.Code.Copy]
MoveValue_Realise [lemma, in Undecidability.TM.Code.Copy]
MoveValue_Rel [definition, in Undecidability.TM.Code.Copy]
MoveValue_size_y [definition, in Undecidability.TM.Code.Copy]
MoveValue_size_x [definition, in Undecidability.TM.Code.Copy]
MoveValue_Spec [lemma, in Undecidability.TM.Hoare.HoareExamples]
MoveValue_SpecT [lemma, in Undecidability.TM.Hoare.HoareExamples]
MoveValue_SpecT_size [lemma, in Undecidability.TM.Hoare.HoareExamples]
MoveValue_size [definition, in Undecidability.TM.Hoare.HoareExamples]
MoveValue.cX [variable, in Undecidability.TM.Code.Copy]
MoveValue.cY [variable, in Undecidability.TM.Code.Copy]
MoveValue.I1 [variable, in Undecidability.TM.Code.Copy]
MoveValue.I2 [variable, in Undecidability.TM.Code.Copy]
MoveValue.sig [variable, in Undecidability.TM.Code.Copy]
MoveValue.sigX [variable, in Undecidability.TM.Code.Copy]
MoveValue.sigY [variable, in Undecidability.TM.Code.Copy]
MoveValue.X [variable, in Undecidability.TM.Code.Copy]
MoveValue.Y [variable, in Undecidability.TM.Code.Copy]
Move_Sem [lemma, in Undecidability.TM.Basic.Mono]
Move_Rel [definition, in Undecidability.TM.Basic.Mono]
move_eqb_spec [lemma, in Undecidability.L.TM.TMEncoding]
move_eqb [definition, in Undecidability.L.TM.TMEncoding]
move_finC [instance, in Undecidability.TM.Util.TM_facts]
move_eq_dec [instance, in Undecidability.TM.Util.TM_facts]
Move.cX [variable, in Undecidability.TM.Code.Copy]
Move.I [variable, in Undecidability.TM.Code.Copy]
Move.sig [variable, in Undecidability.TM.Code.Copy]
Move.sigX [variable, in Undecidability.TM.Code.Copy]
Move.X [variable, in Undecidability.TM.Code.Copy]
mscal [definition, in Undecidability.Shared.Libs.DLW.Utils.sums]
mscal_morph [lemma, in Undecidability.Shared.Libs.DLW.Utils.sums]
mscal_mult [lemma, in Undecidability.Shared.Libs.DLW.Utils.sums]
mscal_sum [lemma, in Undecidability.Shared.Libs.DLW.Utils.sums]
mscal_comm [lemma, in Undecidability.Shared.Libs.DLW.Utils.sums]
mscal_plus1 [lemma, in Undecidability.Shared.Libs.DLW.Utils.sums]
mscal_plus [lemma, in Undecidability.Shared.Libs.DLW.Utils.sums]
mscal_of_unit [lemma, in Undecidability.Shared.Libs.DLW.Utils.sums]
mscal_1 [lemma, in Undecidability.Shared.Libs.DLW.Utils.sums]
mscal_S [lemma, in Undecidability.Shared.Libs.DLW.Utils.sums]
mscal_0 [lemma, in Undecidability.Shared.Libs.DLW.Utils.sums]
mstates [abbreviation, in Complexity.NP.SAT.CookLevin.Subproblems.TM_single]
msum [definition, in Undecidability.Shared.Libs.DLW.Utils.sums]
msum [section, in Undecidability.Shared.Libs.DLW.Utils.sums]
msum_morph [lemma, in Undecidability.Shared.Libs.DLW.Utils.sums]
msum_morphism.Hphi2 [variable, in Undecidability.Shared.Libs.DLW.Utils.sums]
msum_morphism.Hphi1 [variable, in Undecidability.Shared.Libs.DLW.Utils.sums]
msum_morphism.phi [variable, in Undecidability.Shared.Libs.DLW.Utils.sums]
msum_morphism.H2 [variable, in Undecidability.Shared.Libs.DLW.Utils.sums]
msum_morphism.H1 [variable, in Undecidability.Shared.Libs.DLW.Utils.sums]
msum_morphism.u2 [variable, in Undecidability.Shared.Libs.DLW.Utils.sums]
msum_morphism.m2 [variable, in Undecidability.Shared.Libs.DLW.Utils.sums]
msum_morphism.u1 [variable, in Undecidability.Shared.Libs.DLW.Utils.sums]
msum_morphism.m1 [variable, in Undecidability.Shared.Libs.DLW.Utils.sums]
msum_morphism.Y [variable, in Undecidability.Shared.Libs.DLW.Utils.sums]
msum_morphism.X [variable, in Undecidability.Shared.Libs.DLW.Utils.sums]
msum_morphism [section, in Undecidability.Shared.Libs.DLW.Utils.sums]
msum_mscal [lemma, in Undecidability.Shared.Libs.DLW.Utils.sums]
msum_first_two [lemma, in Undecidability.Shared.Libs.DLW.Utils.sums]
msum_ends [lemma, in Undecidability.Shared.Libs.DLW.Utils.sums]
msum_msum [lemma, in Undecidability.Shared.Libs.DLW.Utils.sums]
msum_only_one [lemma, in Undecidability.Shared.Libs.DLW.Utils.sums]
msum_of_unit [lemma, in Undecidability.Shared.Libs.DLW.Utils.sums]
msum_sum [lemma, in Undecidability.Shared.Libs.DLW.Utils.sums]
msum_comm [lemma, in Undecidability.Shared.Libs.DLW.Utils.sums]
msum_unit [lemma, in Undecidability.Shared.Libs.DLW.Utils.sums]
msum_ext [lemma, in Undecidability.Shared.Libs.DLW.Utils.sums]
msum_plus1 [lemma, in Undecidability.Shared.Libs.DLW.Utils.sums]
msum_plus [lemma, in Undecidability.Shared.Libs.DLW.Utils.sums]
msum_1 [lemma, in Undecidability.Shared.Libs.DLW.Utils.sums]
msum_S [lemma, in Undecidability.Shared.Libs.DLW.Utils.sums]
msum_0 [lemma, in Undecidability.Shared.Libs.DLW.Utils.sums]
msum_fold_map [lemma, in Undecidability.Shared.Libs.DLW.Utils.sums]
msum.Hmonoid [variable, in Undecidability.Shared.Libs.DLW.Utils.sums]
msum.m [variable, in Undecidability.Shared.Libs.DLW.Utils.sums]
msum.u [variable, in Undecidability.Shared.Libs.DLW.Utils.sums]
msum.X [variable, in Undecidability.Shared.Libs.DLW.Utils.sums]
_ ⊕ _ [notation, in Undecidability.Shared.Libs.DLW.Utils.sums]
∑ [notation, in Undecidability.Shared.Libs.DLW.Utils.sums]
mtch:42 [binder, in Undecidability.L.Tactics.GenEncode]
mtiRules [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
mtlRules [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
mTM [section, in Complexity.NP.TM.TMGenNP_fixed_mTM]
mTMGenNP_fixed [definition, in Complexity.NP.TM.TMGenNP_fixed_mTM]
mTMGenNP_fixed' [definition, in Complexity.NP.TM.TMGenNP_fixed_mTM]
mTM_to_singleTapeTM [library]
mtrans [abbreviation, in Complexity.NP.SAT.CookLevin.Subproblems.TM_single]
mtrRules [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
mt:270 [binder, in Complexity.L.TM.TMflatComp]
MU [definition, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
mu [definition, in Undecidability.Synthetic.Infinite]
mu [definition, in Undecidability.L.Computability.MuRec]
Mult [definition, in Undecidability.TM.Code.BinNumbers.PosMultTM]
Mult [definition, in Undecidability.TM.Code.NatTM]
Mult [definition, in Undecidability.TM.Hoare.HoareMult]
Mult [definition, in Undecidability.TM.Hoare.HoareExamples]
Multi [library]
multistep_inversion [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
multistep_halt [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
multistep_simulation [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
MultiToMono [module, in Complexity.NP.TM.M_multi2mono]
MultiToMono.M [definition, in Complexity.NP.TM.M_multi2mono]
MultiToMono.multiToMono [section, in Complexity.NP.TM.M_multi2mono]
MultiToMono.Realise [lemma, in Complexity.NP.TM.M_multi2mono]
MultiToMono.Rel [definition, in Complexity.NP.TM.M_multi2mono]
MultiToMono.Ter [definition, in Complexity.NP.TM.M_multi2mono]
MultiToMono.Terminates [lemma, in Complexity.NP.TM.M_multi2mono]
MultiUnivTimeSpaceSimulation [library]
mult_le_mono [instance, in Undecidability.TM.Util.ArithPrelim]
Mult_Realise [lemma, in Undecidability.TM.Code.BinNumbers.PosMultTM]
Mult_Rel [definition, in Undecidability.TM.Code.BinNumbers.PosMultTM]
Mult_Loop_Realise [lemma, in Undecidability.TM.Code.BinNumbers.PosMultTM]
Mult_Loop [definition, in Undecidability.TM.Code.BinNumbers.PosMultTM]
Mult_Loop_Rel [definition, in Undecidability.TM.Code.BinNumbers.PosMultTM]
Mult_Step_Realise [lemma, in Undecidability.TM.Code.BinNumbers.PosMultTM]
Mult_Step [definition, in Undecidability.TM.Code.BinNumbers.PosMultTM]
Mult_Step_Rel [definition, in Undecidability.TM.Code.BinNumbers.PosMultTM]
mult_TR_correct [lemma, in Undecidability.TM.Code.BinNumbers.PosMultTM]
mult_TR_cont_correct [lemma, in Undecidability.TM.Code.BinNumbers.PosMultTM]
mult_TR_cont_shift [lemma, in Undecidability.TM.Code.BinNumbers.PosMultTM]
mult_TR [definition, in Undecidability.TM.Code.BinNumbers.PosMultTM]
mult_TR_cont [definition, in Undecidability.TM.Code.BinNumbers.PosMultTM]
Mult_Terminates [lemma, in Undecidability.TM.Code.NatTM]
Mult_T [definition, in Undecidability.TM.Code.NatTM]
Mult_steps [definition, in Undecidability.TM.Code.NatTM]
Mult_Main_Terminates [lemma, in Undecidability.TM.Code.NatTM]
Mult_Main_T [definition, in Undecidability.TM.Code.NatTM]
Mult_Main_steps [definition, in Undecidability.TM.Code.NatTM]
Mult_Loop_Terminates [lemma, in Undecidability.TM.Code.NatTM]
Mult_Loop_steps [definition, in Undecidability.TM.Code.NatTM]
Mult_Step_Terminates [lemma, in Undecidability.TM.Code.NatTM]
Mult_Step_steps [definition, in Undecidability.TM.Code.NatTM]
Mult_Computes [lemma, in Undecidability.TM.Code.NatTM]
Mult_Rel [definition, in Undecidability.TM.Code.NatTM]
Mult_Main_Realise [lemma, in Undecidability.TM.Code.NatTM]
Mult_Main_Rel [definition, in Undecidability.TM.Code.NatTM]
Mult_Loop_Realise [lemma, in Undecidability.TM.Code.NatTM]
Mult_Loop_Rel [definition, in Undecidability.TM.Code.NatTM]
Mult_Loop_space34 [definition, in Undecidability.TM.Code.NatTM]
Mult_Step_Realise [lemma, in Undecidability.TM.Code.NatTM]
Mult_Step_Rel [definition, in Undecidability.TM.Code.NatTM]
Mult_Main [definition, in Undecidability.TM.Code.NatTM]
Mult_Loop [definition, in Undecidability.TM.Code.NatTM]
Mult_Step [definition, in Undecidability.TM.Code.NatTM]
Mult_N_Realise [lemma, in Undecidability.TM.Code.BinNumbers.NTM]
Mult_N_Rel [definition, in Undecidability.TM.Code.BinNumbers.NTM]
Mult_N [definition, in Undecidability.TM.Code.BinNumbers.NTM]
mult_le_proper [instance, in Undecidability.L.Prelim.MoreBase]
mult_lt_le [instance, in Complexity.Libs.CookPrelim.PolyBounds]
mult_lt_le [instance, in Complexity.Complexity.UpToCPoly]
Mult_SpecT_space [lemma, in Undecidability.TM.Hoare.HoareMult]
Mult_size [definition, in Undecidability.TM.Hoare.HoareMult]
Mult_steps [definition, in Undecidability.TM.Hoare.HoareMult]
Mult_Loop_SpecT_size [lemma, in Undecidability.TM.Hoare.HoareMult]
Mult_Loop_size [definition, in Undecidability.TM.Hoare.HoareMult]
Mult_Loop_steps [definition, in Undecidability.TM.Hoare.HoareMult]
Mult_Loop [definition, in Undecidability.TM.Hoare.HoareMult]
Mult_Step_SpecT_size [lemma, in Undecidability.TM.Hoare.HoareMult]
Mult_Step_space [definition, in Undecidability.TM.Hoare.HoareMult]
Mult_Step_steps [definition, in Undecidability.TM.Hoare.HoareMult]
Mult_Step [definition, in Undecidability.TM.Hoare.HoareMult]
mult_time [definition, in Undecidability.L.Datatypes.LNat]
mult_2_eq_plus [lemma, in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
mult_is_one [lemma, in Undecidability.Shared.Libs.DLW.Utils.gcd]
Mult_SpecT_space [lemma, in Undecidability.TM.Hoare.HoareExamples]
Mult_size [definition, in Undecidability.TM.Hoare.HoareExamples]
Mult_SpecT_space [lemma, in Undecidability.TM.Hoare.HoareExamples]
Mult_size_bug [definition, in Undecidability.TM.Hoare.HoareExamples]
Mult_SpecT [lemma, in Undecidability.TM.Hoare.HoareExamples]
Mult_steps [definition, in Undecidability.TM.Hoare.HoareExamples]
Mult_Loop_SpecT_size [lemma, in Undecidability.TM.Hoare.HoareExamples]
Mult_Loop_size [definition, in Undecidability.TM.Hoare.HoareExamples]
Mult_Loop_SpecT [lemma, in Undecidability.TM.Hoare.HoareExamples]
Mult_Loop_steps [definition, in Undecidability.TM.Hoare.HoareExamples]
Mult_Loop [definition, in Undecidability.TM.Hoare.HoareExamples]
Mult_Step_SpecT_size [lemma, in Undecidability.TM.Hoare.HoareExamples]
Mult_Step_space [definition, in Undecidability.TM.Hoare.HoareExamples]
Mult_Step_SpecT [lemma, in Undecidability.TM.Hoare.HoareExamples]
Mult_Step_steps [definition, in Undecidability.TM.Hoare.HoareExamples]
Mult_Step_Post [definition, in Undecidability.TM.Hoare.HoareExamples]
Mult_Step [definition, in Undecidability.TM.Hoare.HoareExamples]
MUniv [abbreviation, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
MuRec [library]
MuRecursor [section, in Undecidability.L.Computability.MuRec]
MuRecursor.dec'_P [variable, in Undecidability.L.Computability.MuRec]
MuRecursor.hoas [section, in Undecidability.L.Computability.MuRec]
MuRecursor.P [variable, in Undecidability.L.Computability.MuRec]
MuRecursor.P_proc [variable, in Undecidability.L.Computability.MuRec]
MU_Realises [lemma, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
MU_Rel [definition, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
MU_size [definition, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
MU_terminatesIn [lemma, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
MU_T [definition, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
MU_steps [definition, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
mu_least [lemma, in Undecidability.Synthetic.Infinite]
mu_spec [lemma, in Undecidability.L.Computability.MuRec]
mu_complete [lemma, in Undecidability.L.Computability.MuRec]
mu_sound [lemma, in Undecidability.L.Computability.MuRec]
mu_proc [lemma, in Undecidability.L.Computability.MuRec]
mu' [abbreviation, in Undecidability.Synthetic.Infinite]
mu' [definition, in Undecidability.L.Computability.MuRec]
mu'_complete [lemma, in Undecidability.L.Computability.MuRec]
mu'_sound [lemma, in Undecidability.L.Computability.MuRec]
mu'_n_true [lemma, in Undecidability.L.Computability.MuRec]
mu'_0_false [lemma, in Undecidability.L.Computability.MuRec]
mu'_n_false [lemma, in Undecidability.L.Computability.MuRec]
mu'_proc [lemma, in Undecidability.L.Computability.MuRec]
mu:8 [binder, in Undecidability.L.Computability.MuRec]
mv [definition, in Undecidability.TM.TM]
mv [definition, in Undecidability.TM.SBTM]
mv:49 [binder, in Undecidability.TM.Util.TM_facts]
M__mono [definition, in Complexity.NP.TM.M_multi2mono]
M__multi:4 [binder, in Complexity.NP.TM.M_multi2mono]
M_main_SpecT [lemma, in Undecidability.TM.L.CompilerBoolFuns.Compiler]
M_main_Spec [lemma, in Undecidability.TM.L.CompilerBoolFuns.Compiler]
M_main [definition, in Undecidability.TM.L.CompilerBoolFuns.Compiler]
M_out_SpecT [lemma, in Undecidability.TM.L.CompilerBoolFuns.Compiler]
M_out [definition, in Undecidability.TM.L.CompilerBoolFuns.Compiler]
M_init_SpecT [lemma, in Undecidability.TM.L.CompilerBoolFuns.Compiler]
M_init [definition, in Undecidability.TM.L.CompilerBoolFuns.Compiler]
M_init'_SpecT [lemma, in Undecidability.TM.L.CompilerBoolFuns.Compiler]
M_init' [definition, in Undecidability.TM.L.CompilerBoolFuns.Compiler]
M_init_one_Spec [lemma, in Undecidability.TM.L.CompilerBoolFuns.Compiler]
M_init_one [definition, in Undecidability.TM.L.CompilerBoolFuns.Compiler]
M_multi2mono [library]
M_LHeapInterpreter [library]
M_LM2TM [library]
M' [abbreviation, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
M' [abbreviation, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
M'_final:482 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
m':102 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
m':103 [binder, in Undecidability.TM.Hoare.HoareMult]
M':106 [binder, in Complexity.L.TM.TMunflatten]
m':108 [binder, in Undecidability.TM.Code.NatTM]
m':109 [binder, in Undecidability.TM.Hoare.HoareMult]
M':112 [binder, in Complexity.L.TM.TMunflatten]
m':114 [binder, in Undecidability.TM.Code.NatTM]
m':114 [binder, in Undecidability.L.Complexity.ResourceMeasures]
m':117 [binder, in Undecidability.TM.Code.NatTM]
m':118 [binder, in Undecidability.L.Complexity.ResourceMeasures]
m':124 [binder, in Undecidability.TM.Code.NatTM]
m':125 [binder, in Undecidability.TM.Hoare.HoareMult]
m':13 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler]
m':130 [binder, in Undecidability.TM.Hoare.HoareMult]
m':136 [binder, in Undecidability.TM.Hoare.HoareMult]
M':15 [binder, in Complexity.NP.TM.TMGenNP]
m':172 [binder, in Undecidability.L.Prelim.ARS]
m':190 [binder, in Undecidability.TM.Util.TM_facts]
M':20 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.SingleTMGenNP]
m':2009 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m':2036 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m':2041 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m':2069 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m':2073 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m':2104 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m':2115 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m':2126 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m':2137 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m':2148 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m':2159 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m':2169 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m':2179 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m':2189 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m':2199 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
M':22 [binder, in Complexity.NP.TM.TMGenNP]
m':2209 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m':2219 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m':25 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler]
m':264 [binder, in Undecidability.TM.Hoare.HoareExamples]
m':267 [binder, in Undecidability.TM.Hoare.HoareExamples]
m':271 [binder, in Undecidability.TM.Hoare.HoareExamples]
m':274 [binder, in Undecidability.TM.Hoare.HoareExamples]
m':278 [binder, in Undecidability.TM.Hoare.HoareExamples]
m':28 [binder, in Undecidability.L.Complexity.ResourceMeasures]
m':283 [binder, in Undecidability.TM.Hoare.HoareExamples]
m':288 [binder, in Undecidability.TM.Hoare.HoareExamples]
m':293 [binder, in Undecidability.TM.Hoare.HoareExamples]
m':297 [binder, in Undecidability.TM.Hoare.HoareExamples]
M':30 [binder, in Complexity.NP.TM.TMGenNP]
m':302 [binder, in Undecidability.TM.Hoare.HoareExamples]
m':315 [binder, in Undecidability.TM.Hoare.HoareExamples]
m':319 [binder, in Undecidability.TM.Hoare.HoareExamples]
m':324 [binder, in Undecidability.TM.Hoare.HoareExamples]
m':3252 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m':3258 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m':33 [binder, in Undecidability.L.Complexity.ResourceMeasures]
m':335 [binder, in Undecidability.TM.Hoare.HoareExamples]
m':340 [binder, in Undecidability.TM.Hoare.HoareExamples]
m':345 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
m':347 [binder, in Undecidability.TM.Hoare.HoareExamples]
m':352 [binder, in Undecidability.TM.Hoare.HoareExamples]
m':358 [binder, in Undecidability.TM.Hoare.HoareExamples]
m':374 [binder, in Undecidability.TM.Hoare.HoareExamples]
m':379 [binder, in Undecidability.TM.Hoare.HoareExamples]
m':385 [binder, in Undecidability.TM.Hoare.HoareExamples]
M':39 [binder, in Complexity.L.TM.TMflat]
M':40 [binder, in Complexity.NP.TM.TMGenNP]
m':421 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
m':428 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
m':44 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_nat_facts]
m':457 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
m':463 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
m':471 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
m':478 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
m':488 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
M':49 [binder, in Complexity.NP.TM.M_multi2mono]
m':494 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
m':499 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
m':505 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
m':510 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
m':515 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
m':52 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_nat_facts]
m':52 [binder, in Complexity.L.AbstractMachines.AbstractSubstMachine]
M':52 [binder, in Complexity.L.TM.TMflatFun]
m':520 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
m':526 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
m':531 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
m':536 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
m':541 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
m':547 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
m':552 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
m':62 [binder, in Undecidability.TM.Code.NatTM]
m':62 [binder, in Undecidability.Shared.Libs.DLW.Utils.php]
M':62 [binder, in Complexity.L.TM.TMflatFun]
m':66 [binder, in Undecidability.Shared.Libs.DLW.Utils.php]
m':68 [binder, in Undecidability.L.Tactics.GenEncode]
m':68 [binder, in Undecidability.TM.Hoare.HoareMult]
M':69 [binder, in Complexity.L.TM.TMflatFun]
m':7 [binder, in Undecidability.L.Prelim.MoreBase]
m':71 [binder, in Undecidability.TM.Code.NatTM]
m':71 [binder, in Undecidability.Shared.Libs.DLW.Utils.php]
m':72 [binder, in Undecidability.TM.Hoare.HoareMult]
m':76 [binder, in Undecidability.TM.Hoare.HoareMult]
m':81 [binder, in Undecidability.TM.Code.NatTM]
M':81 [binder, in Complexity.L.TM.TMflatFun]
m':81 [binder, in Undecidability.TM.Hoare.HoareMult]
m':86 [binder, in Undecidability.TM.Hoare.HoareMult]
m':91 [binder, in Undecidability.TM.Hoare.HoareMult]
m':98 [binder, in Undecidability.TM.Hoare.HoareMult]
M.M [definition, in Complexity.NP.TM.LM_to_mTM]
M.M [section, in Complexity.NP.TM.LM_to_mTM]
M.M.n [variable, in Complexity.NP.TM.LM_to_mTM]
M.Realise [definition, in Complexity.NP.TM.LM_to_mTM]
M.Rel [definition, in Complexity.NP.TM.LM_to_mTM]
M.Retr1 [definition, in Complexity.NP.TM.LM_to_mTM]
M.Retr2 [definition, in Complexity.NP.TM.LM_to_mTM]
M.sig [definition, in Complexity.NP.TM.LM_to_mTM]
M.sig__reg [definition, in Complexity.NP.TM.LM_to_mTM]
M.sizeStart [lemma, in Complexity.NP.TM.LM_to_mTM]
M.Terminates [definition, in Complexity.NP.TM.LM_to_mTM]
M.time [definition, in Complexity.NP.TM.LM_to_mTM]
M.ts__start [definition, in Complexity.NP.TM.LM_to_mTM]
m0:2091 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m0:2092 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
M1 [definition, in Undecidability.TM.Code.CaseList]
M1 [abbreviation, in Undecidability.TM.Combinators.Switch]
M1_Terminates [lemma, in Undecidability.TM.Code.CaseList]
M1_Realise [lemma, in Undecidability.TM.Code.CaseList]
M1_Rel [definition, in Undecidability.TM.Code.CaseList]
m1:106 [binder, in Undecidability.L.Complexity.ResourceMeasures]
m1:13 [binder, in Undecidability.Shared.Libs.DLW.Utils.php]
m1:134 [binder, in Undecidability.Shared.Libs.DLW.Utils.php]
m1:1431 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m1:1460 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m1:1613 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m1:1641 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m1:184 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
m1:185 [binder, in Undecidability.L.Prelim.ARS]
m1:198 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m1:2029 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m1:2062 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m1:22 [binder, in Undecidability.Shared.Libs.DLW.Utils.php]
m1:2513 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m1:2518 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m1:2523 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m1:2804 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m1:2816 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m1:2819 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m1:2822 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m1:351 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m1:3535 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m1:3540 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m1:3545 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m1:382 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
m1:386 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m1:388 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
m1:395 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m1:427 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m1:437 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m1:472 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m1:482 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m1:517 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m1:52 [binder, in Undecidability.L.Complexity.ResourceMeasures]
m1:526 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m1:558 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m1:56 [binder, in Undecidability.Shared.Libs.DLW.Utils.list_bool]
m1:568 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m1:59 [binder, in Undecidability.L.Computability.Enum]
m1:603 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m1:613 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m1:647 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m1:656 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m1:690 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m1:699 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m1:733 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m1:8 [binder, in Undecidability.Shared.Libs.DLW.Utils.php]
M2MBounds [library]
M2M_Retract.pM [variable, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
M2M_Retract.n [variable, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
M2M_Retract.F [variable, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
M2M_Retract.sigM [variable, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
M2M_Retract [section, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
m2:109 [binder, in Undecidability.L.Complexity.ResourceMeasures]
m2:135 [binder, in Undecidability.Shared.Libs.DLW.Utils.php]
m2:14 [binder, in Undecidability.Shared.Libs.DLW.Utils.php]
m2:186 [binder, in Undecidability.L.Prelim.ARS]
m2:186 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
m2:199 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m2:23 [binder, in Undecidability.Shared.Libs.DLW.Utils.php]
m2:2514 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m2:2519 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m2:2524 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m2:272 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
m2:296 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m2:352 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m2:3536 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m2:3541 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m2:3546 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m2:383 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
m2:387 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m2:389 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
m2:396 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m2:428 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m2:438 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m2:473 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m2:483 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m2:518 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m2:527 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m2:53 [binder, in Undecidability.L.Complexity.ResourceMeasures]
m2:559 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m2:569 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m2:57 [binder, in Undecidability.Shared.Libs.DLW.Utils.list_bool]
m2:60 [binder, in Undecidability.L.Computability.Enum]
m2:604 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m2:614 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m2:648 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m2:657 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m2:691 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m2:700 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m2:734 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m2:9 [binder, in Undecidability.Shared.Libs.DLW.Utils.php]
m3:110 [binder, in Undecidability.L.Complexity.ResourceMeasures]
m3:187 [binder, in Undecidability.L.Prelim.ARS]
m3:200 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m3:2061 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m3:353 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m3:388 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m3:397 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m3:429 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m3:439 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m3:474 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m3:484 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m3:519 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m3:528 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m3:54 [binder, in Undecidability.L.Complexity.ResourceMeasures]
m3:560 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m3:570 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m3:605 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m4:2030 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
M:1 [binder, in Complexity.L.TM.TMflatEnc]
M:1 [binder, in Complexity.NP.SAT.CookLevin.Reductions.TMGenNP_fixed_singleTapeTM_to_FlatFunSingleTMGenNP]
m:1 [binder, in Undecidability.L.TM.TMEncoding]
m:1 [binder, in Undecidability.TM.Lifting.LiftTapes]
m:1 [binder, in Complexity.L.AbstractMachines.FunctionalDefinitions]
M:1 [binder, in Undecidability.L.Computability.Scott]
m:10 [binder, in Undecidability.Shared.Libs.DLW.Utils.crt]
m:10 [binder, in Undecidability.Shared.FinTypeForallExists]
m:10 [binder, in Complexity.Complexity.SpaceBoundsTime]
m:10 [binder, in Undecidability.TM.SBTM]
m:10 [binder, in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
m:100 [binder, in Undecidability.TM.Code.NatTM]
m:100 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
m:102 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
m:102 [binder, in Undecidability.Shared.Libs.DLW.Vec.pos]
m:103 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
m:103 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
m:104 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
M:104 [binder, in Undecidability.TM.Univ.LowLevel]
m:105 [binder, in Undecidability.Shared.Libs.DLW.Vec.pos]
m:106 [binder, in Undecidability.L.Prelim.ARS]
m:106 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
m:106 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
M:107 [binder, in Undecidability.TM.Univ.LowLevel]
m:107 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
M:107 [binder, in Undecidability.TM.Univ.Univ]
m:108 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
M:108 [binder, in Complexity.L.TM.TMunflatten]
M:109 [binder, in Complexity.L.TM.TMunflatten]
m:11 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
m:11 [binder, in Undecidability.Shared.Libs.DLW.Wf.wf_incl]
M:11 [binder, in Complexity.NP.TM.TMGenNP]
m:11 [binder, in Undecidability.L.Functions.Ackermann]
m:110 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
m:111 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
m:111 [binder, in Undecidability.L.Complexity.ResourceMeasures]
M:111 [binder, in Undecidability.TM.Univ.LowLevel]
m:113 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
m:113 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
m:113 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
M:114 [binder, in Undecidability.TM.Univ.Univ]
m:115 [binder, in Undecidability.L.Complexity.ResourceMeasures]
m:115 [binder, in Undecidability.Shared.Libs.DLW.Utils.php]
m:115 [binder, in Undecidability.TM.Hoare.HoareMult]
m:116 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
m:117 [binder, in Undecidability.TM.Compound.Shift]
m:118 [binder, in Undecidability.L.Prelim.ARS]
m:118 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
M:118 [binder, in Undecidability.TM.Univ.LowLevel]
m:119 [binder, in Undecidability.TM.Code.CodeTM]
M:12 [binder, in Undecidability.L.TM.TMinL]
m:12 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Fin]
m:12 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
m:12 [binder, in Undecidability.Shared.Libs.DLW.Utils.php]
m:12 [binder, in Complexity.L.TM.TMunflatten]
M:12 [binder, in Undecidability.L.Computability.Rice]
m:120 [binder, in Undecidability.TM.Hoare.HoareMult]
m:121 [binder, in Undecidability.Shared.Libs.DLW.Utils.php]
m:121 [binder, in Undecidability.TM.Compound.Compare]
m:122 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
m:122 [binder, in Undecidability.TM.Compound.Shift]
M:124 [binder, in Complexity.TM.PrettyBounds.UnivBounds]
M:124 [binder, in Undecidability.TM.Hoare.HoareRegister]
m:126 [binder, in Undecidability.L.Prelim.ARS]
M:126 [binder, in Complexity.TM.PrettyBounds.UnivBounds]
M:126 [binder, in Undecidability.TM.Univ.LowLevel]
m:126 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m:127 [binder, in Undecidability.TM.Code.NatTM]
m:127 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
m:128 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
M:128 [binder, in Undecidability.TM.Univ.LowLevel]
M:129 [binder, in Complexity.TM.PrettyBounds.UnivBounds]
M:13 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
m:13 [binder, in Undecidability.Shared.Libs.DLW.Utils.seteq]
m:130 [binder, in Undecidability.L.Prelim.ARS]
m:130 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
m:131 [binder, in Undecidability.TM.Code.NatTM]
m:132 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
m:133 [binder, in Undecidability.TM.Compound.MoveToSymbol]
m:134 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
m:134 [binder, in Undecidability.TM.Code.NatTM]
m:134 [binder, in Undecidability.TM.Compound.Compare]
m:134 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m:135 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
m:135 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
m:135 [binder, in Undecidability.TM.Univ.LowLevel]
M:136 [binder, in Undecidability.TM.Univ.LowLevel]
m:137 [binder, in Undecidability.TM.Compound.MoveToSymbol]
m:137 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
m:137 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
m:1379 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
M:138 [binder, in Complexity.TM.PrettyBounds.UnivBounds]
m:138 [binder, in Undecidability.TM.Code.NatTM]
m:138 [binder, in Undecidability.Synthetic.ListEnumerabilityFacts]
m:1384 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m:14 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
m:14 [binder, in Undecidability.L.Functions.Ackermann]
m:14 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
m:14 [binder, in Undecidability.Synthetic.ListEnumerabilityFacts]
M:140 [binder, in Undecidability.TM.Univ.LowLevel]
m:1412 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m:1414 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m:142 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
m:142 [binder, in Undecidability.TM.Hoare.HoareMult]
m:143 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
m:143 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
M:144 [binder, in Undecidability.TM.Univ.LowLevel]
M:145 [binder, in Undecidability.TM.Univ.LowLevel]
m:146 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
M:146 [binder, in Complexity.TM.PrettyBounds.UnivBounds]
m:146 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
M:146 [binder, in Undecidability.TM.Univ.LowLevel]
m:147 [binder, in Undecidability.TM.Hoare.HoareMult]
m:1471 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m:1476 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m:148 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
M:149 [binder, in Complexity.TM.PrettyBounds.UnivBounds]
m:149 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
m:149 [binder, in Undecidability.TM.Hoare.HoareMult]
m:15 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
m:15 [binder, in Undecidability.L.Computability.Enum]
m:15 [binder, in Undecidability.TM.Code.Copy]
m:15 [binder, in Complexity.L.AbstractMachines.FunctionalDefinitions]
m:15 [binder, in Undecidability.Shared.Libs.DLW.Utils.seteq]
m:15 [binder, in Undecidability.L.Datatypes.LNat]
M:15 [binder, in Undecidability.TM.Univ.Univ]
m:150 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
m:150 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachine]
m:1505 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m:1509 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m:151 [binder, in Undecidability.TM.Hoare.HoareMult]
m:151 [binder, in Undecidability.Shared.Libs.DLW.Vec.pos]
m:1516 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
M:152 [binder, in Complexity.TM.PrettyBounds.UnivBounds]
m:152 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
M:152 [binder, in Undecidability.TM.Univ.LowLevel]
m:152 [binder, in Undecidability.TM.Lifting.LiftTapes]
m:1520 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m:153 [binder, in Undecidability.TM.Hoare.HoareMult]
m:153 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
m:154 [binder, in Undecidability.TM.Compound.MoveToSymbol]
M:154 [binder, in Undecidability.TM.Univ.LowLevel]
M:154 [binder, in Undecidability.TM.Hoare.HoareRegister]
m:154 [binder, in Undecidability.Shared.Libs.DLW.Vec.pos]
m:1548 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m:155 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
m:1551 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m:156 [binder, in Undecidability.TM.Lifting.LiftTapes]
m:1568 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
M:157 [binder, in Complexity.TM.PrettyBounds.UnivBounds]
M:157 [binder, in Undecidability.TM.Univ.LowLevel]
m:157 [binder, in Undecidability.Shared.Libs.DLW.Utils.php]
m:158 [binder, in Undecidability.Shared.Libs.DLW.Vec.pos]
m:159 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
m:159 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
m:1597 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m:16 [binder, in Undecidability.Shared.Libs.DLW.Wf.wf_incl]
M:16 [binder, in Complexity.NP.TM.TMGenNP]
m:16 [binder, in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
M:16 [binder, in Undecidability.L.Computability.Acceptability]
m:160 [binder, in Undecidability.TM.Compound.MoveToSymbol]
m:160 [binder, in Undecidability.TM.Compound.Compare]
m:1608 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
M:161 [binder, in Complexity.TM.PrettyBounds.UnivBounds]
m:161 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
m:162 [binder, in Undecidability.Shared.Libs.DLW.Vec.pos]
m:163 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
m:164 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
m:1644 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m:165 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
m:165 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
m:165 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
m:165 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
m:1651 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m:1655 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m:166 [binder, in Undecidability.L.Prelim.ARS]
M:166 [binder, in Complexity.TM.PrettyBounds.UnivBounds]
m:166 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
m:167 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
m:167 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
M:167 [binder, in Undecidability.TM.Univ.Univ]
m:1682 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m:1684 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m:169 [binder, in Undecidability.TM.Compound.MoveToSymbol]
m:169 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
m:1691 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m:17 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Fin]
m:17 [binder, in Undecidability.Shared.Libs.DLW.Utils.php]
M:17 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.SingleTMGenNP]
m:17 [binder, in Undecidability.L.Functions.Ackermann]
m:171 [binder, in Undecidability.L.Prelim.ARS]
M:171 [binder, in Complexity.TM.PrettyBounds.UnivBounds]
m:171 [binder, in Undecidability.TM.Compound.Compare]
m:171 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
m:1723 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m:173 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
m:173 [binder, in Undecidability.TM.Compound.MoveToSymbol]
m:1730 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m:175 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
m:1762 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
M:177 [binder, in Undecidability.TM.Hoare.HoareRegister]
m:178 [binder, in Undecidability.L.Prelim.ARS]
m:179 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
m:18 [binder, in Undecidability.Shared.Libs.PSL.Lists.Position]
m:18 [binder, in Undecidability.TM.SBTM]
M:18 [binder, in Undecidability.L.Computability.Acceptability]
m:18 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m:18 [binder, in Undecidability.Shared.Libs.DLW.Utils.seteq]
m:18 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler]
m:180 [binder, in Undecidability.TM.Single.StepTM]
m:180 [binder, in Complexity.L.TM.TMunflatten]
M:180 [binder, in Undecidability.TM.Univ.Univ]
m:183 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
m:185 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
m:185 [binder, in Undecidability.TM.Compound.Compare]
m:187 [binder, in Undecidability.TM.Util.TM_facts]
m:189 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
m:189 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
m:19 [binder, in Undecidability.L.Computability.Enum]
m:19 [binder, in Undecidability.TM.Code.NatTM]
m:19 [binder, in Undecidability.Synthetic.EnumerabilityFacts]
m:19 [binder, in Undecidability.Shared.FinTypeForallExists]
m:19 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
M:19 [binder, in Complexity.NP.TM.TMGenNP]
m:19 [binder, in Undecidability.Synthetic.ListEnumerabilityFacts]
M:19 [binder, in Undecidability.L.Computability.Acceptability]
m:190 [binder, in Undecidability.TM.Compound.MoveToSymbol]
m:192 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
m:195 [binder, in Undecidability.TM.Compound.MoveToSymbol]
m:195 [binder, in Undecidability.TM.Compound.Compare]
m:196 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
m:199 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
M:2 [binder, in Complexity.NP.SAT.CookLevin]
m:2 [binder, in Undecidability.Shared.Libs.DLW.Utils.list_bool]
m:2 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
m:2 [binder, in Undecidability.TM.SBTM]
m:2 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachine]
M:2 [binder, in Undecidability.L.Computability.Rice]
m:2 [binder, in Undecidability.Shared.Libs.DLW.Vec.pos]
M:20 [binder, in Undecidability.L.TM.TMinL]
M:20 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
m:20 [binder, in Undecidability.Shared.Libs.DLW.Wf.wf_incl]
m:20 [binder, in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
m:20 [binder, in Undecidability.L.Functions.Ackermann]
m:20 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.CompoundFinTypes]
m:200 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
m:2008 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m:202 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
M:203 [binder, in Complexity.L.TM.TMunflatten]
m:204 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
M:204 [binder, in Complexity.L.TM.TMunflatten]
m:2040 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m:206 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
m:207 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
m:2072 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
M:208 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
m:209 [binder, in Undecidability.TM.Compound.Compare]
m:2096 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
M:21 [binder, in Undecidability.TM.Hoare.HoareLegacy]
m:21 [binder, in Undecidability.Shared.Libs.PSL.Lists.Position]
m:21 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Fin]
m:21 [binder, in Undecidability.Shared.Libs.DLW.Utils.php]
m:21 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m:21 [binder, in Undecidability.Shared.Libs.DLW.Utils.seteq]
M:21 [binder, in Undecidability.TM.Univ.Univ]
m:21 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler]
m:210 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
m:2107 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m:211 [binder, in Undecidability.L.Prelim.ARS]
m:2118 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
M:212 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
m:2129 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m:2140 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m:215 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
m:2151 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m:2162 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
M:217 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
m:2172 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m:218 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
m:2182 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m:2192 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
M:22 [binder, in Undecidability.TM.Combinators.Combinators]
m:22 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
m:22 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
m:22 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
m:22 [binder, in Undecidability.TM.Code.Copy]
M:22 [binder, in Undecidability.L.Computability.Rice]
m:22 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler]
m:2202 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m:221 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
m:2212 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m:223 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
M:223 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
m:223 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
M:226 [binder, in Undecidability.L.Tactics.Extract]
m:227 [binder, in Undecidability.L.Util.L_facts]
m:228 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
M:228 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
m:23 [binder, in Undecidability.Synthetic.EnumerabilityFacts]
m:23 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
M:23 [binder, in Undecidability.TM.TM]
m:23 [binder, in Complexity.L.AbstractMachines.FunctionalDefinitions]
M:231 [binder, in Complexity.L.TM.TMunflatten]
m:232 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
M:233 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
m:233 [binder, in Undecidability.TM.Hoare.HoareRegister]
m:234 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
m:236 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
M:239 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
m:239 [binder, in Undecidability.TM.Util.TM_facts]
m:24 [binder, in Undecidability.Shared.Libs.PSL.Lists.Position]
m:24 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Fin]
m:24 [binder, in Undecidability.Shared.Libs.DLW.Wf.wf_incl]
M:24 [binder, in Undecidability.TM.SBTM]
m:24 [binder, in Complexity.NP.TM.M_multi2mono]
m:24 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
M:24 [binder, in Complexity.NP.TM.TMGenNP_fixed_mTM]
m:241 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
M:244 [binder, in Complexity.L.TM.TMflatComp]
M:244 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
m:245 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
m:247 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
m:249 [binder, in Undecidability.TM.Hoare.HoareRegister]
m:25 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
M:25 [binder, in Complexity.NP.TM.TMGenNP]
m:25 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
m:25 [binder, in Undecidability.Shared.Libs.DLW.Utils.php]
M:25 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.SingleTMGenNP]
m:25 [binder, in Complexity.NP.TM.M_multi2mono]
M:250 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
m:2515 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
M:252 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
M:252 [binder, in Undecidability.TM.Util.TM_facts]
m:2520 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m:2525 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m:253 [binder, in Undecidability.TM.Hoare.HoareExamples]
m:2537 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m:254 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
M:254 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
m:257 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
M:259 [binder, in Undecidability.TM.Util.TM_facts]
m:26 [binder, in Undecidability.TM.Code.NatTM]
M:261 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
m:261 [binder, in Undecidability.TM.Hoare.HoareRegister]
M:264 [binder, in Undecidability.TM.Util.TM_facts]
M:267 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
M:267 [binder, in Undecidability.TM.Util.TM_facts]
M:268 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
M:269 [binder, in Undecidability.TM.Util.TM_facts]
m:27 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
m:27 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
m:27 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
m:27 [binder, in Undecidability.TM.Code.NatTM]
m:27 [binder, in Undecidability.L.Complexity.ResourceMeasures]
m:27 [binder, in Complexity.Complexity.ONotationIsAppropriate]
m:271 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
M:272 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
M:275 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
m:276 [binder, in Undecidability.TM.Hoare.HoareRegister]
M:278 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
m:28 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Fin]
m:28 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
m:28 [binder, in Undecidability.Shared.Libs.DLW.Utils.seteq]
M:28 [binder, in Undecidability.TM.Univ.Univ]
M:280 [binder, in Complexity.L.TM.TMflatComp]
M:280 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
m:2802 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m:2808 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m:281 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
m:281 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
m:2810 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m:2828 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
M:283 [binder, in Complexity.L.TM.TMflatComp]
m:2831 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m:2832 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
M:285 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
m:285 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
M:287 [binder, in Complexity.L.TM.TMflatComp]
m:288 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
m:289 [binder, in Undecidability.TM.Hoare.HoareRegister]
M:289 [binder, in Undecidability.TM.Util.TM_facts]
M:29 [binder, in Complexity.L.TM.TMflatComp]
m:29 [binder, in Complexity.Complexity.ONotationIsAppropriate]
m:29 [binder, in Undecidability.L.L]
m:29 [binder, in Complexity.L.AbstractMachines.FunctionalDefinitions]
m:291 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
m:291 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
M:294 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
M:295 [binder, in Undecidability.TM.Util.TM_facts]
m:295 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
M:2955 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
M:297 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
M:299 [binder, in Undecidability.TM.Util.TM_facts]
m:299 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
M:3 [binder, in Undecidability.L.TM.TMinL]
m:3 [binder, in Undecidability.Shared.Libs.DLW.Wf.wf_incl]
m:3 [binder, in Undecidability.Shared.Libs.DLW.Utils.php]
M:3 [binder, in Complexity.NP.TM.TMGenNP_fixed_mTM]
m:30 [binder, in Undecidability.L.Computability.Enum]
m:30 [binder, in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
m:30 [binder, in Undecidability.TM.Code.NatTM]
m:30 [binder, in Undecidability.Shared.Libs.DLW.Utils.quotient]
m:30 [binder, in Undecidability.Shared.Libs.DLW.Utils.seteq]
m:30 [binder, in Undecidability.TM.Single.EncodeTapes]
M:300 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
m:301 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
M:302 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
m:303 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
m:303 [binder, in Undecidability.TM.Hoare.HoareRegister]
m:304 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m:304 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
M:3043 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m:307 [binder, in Undecidability.TM.Hoare.HoareExamples]
M:3073 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
M:308 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
m:309 [binder, in Undecidability.TM.Hoare.HoareRegister]
m:31 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
m:31 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
m:31 [binder, in Complexity.Complexity.ONotationIsAppropriate]
m:311 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m:311 [binder, in Undecidability.TM.Hoare.HoareExamples]
M:316 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
m:316 [binder, in Undecidability.TM.Hoare.HoareRegister]
M:3163 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
M:3172 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
M:318 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
M:3180 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
M:3190 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m:32 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Fin]
m:32 [binder, in Undecidability.L.Complexity.ResourceMeasures]
m:32 [binder, in Complexity.L.TM.TMflatten]
m:32 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
m:32 [binder, in Undecidability.Shared.Libs.DLW.Utils.seteq]
M:32 [binder, in Undecidability.TM.Univ.Univ]
m:323 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
M:324 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
M:324 [binder, in Undecidability.TM.Hoare.HoareRegister]
m:3244 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m:3251 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m:3257 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m:326 [binder, in Undecidability.TM.Hoare.HoareRegister]
m:327 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
m:3270 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m:3274 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m:328 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
m:329 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
m:329 [binder, in Undecidability.TM.Hoare.HoareExamples]
m:33 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
m:33 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
m:33 [binder, in Complexity.Complexity.ONotationIsAppropriate]
M:33 [binder, in Complexity.L.TM.TMunflatten]
m:33 [binder, in Undecidability.TM.TM]
m:33 [binder, in Undecidability.TM.SBTM]
M:33 [binder, in Undecidability.L.Computability.Rice]
m:331 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
M:332 [binder, in Undecidability.TM.Util.TM_facts]
m:333 [binder, in Undecidability.TM.Hoare.HoareExamples]
M:334 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
M:335 [binder, in Undecidability.TM.Hoare.HoareRegister]
m:336 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
m:337 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
M:34 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
m:34 [binder, in Undecidability.TM.Code.NatTM]
M:34 [binder, in Complexity.L.TM.TMflatComp]
m:34 [binder, in Complexity.L.TM.TMflatten]
m:34 [binder, in Complexity.L.AbstractMachines.FunctionalDefinitions]
m:34 [binder, in Undecidability.Shared.Libs.DLW.Utils.seteq]
M:34 [binder, in Undecidability.TM.Univ.Univ]
m:344 [binder, in Undecidability.TM.Hoare.HoareRegister]
M:344 [binder, in Undecidability.TM.Util.TM_facts]
m:3452 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m:3462 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m:3472 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
M:35 [binder, in Complexity.NP.TM.TMGenNP]
m:35 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
m:35 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_base]
m:35 [binder, in Complexity.L.AbstractMachines.AbstractSubstMachine]
m:35 [binder, in Undecidability.TM.Code.Copy]
m:35 [binder, in Undecidability.TM.Util.TM_facts]
m:350 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
m:353 [binder, in Undecidability.TM.Single.StepTM]
m:3537 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m:354 [binder, in Undecidability.TM.Hoare.HoareRegister]
m:3542 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m:3547 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m:3552 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m:358 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
M:3597 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m:36 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
m:36 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Fin]
m:36 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
m:36 [binder, in Undecidability.Shared.Libs.DLW.Utils.php]
m:36 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
m:36 [binder, in Undecidability.TM.Lifting.LiftTapes]
m:3624 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
M:3630 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m:364 [binder, in Undecidability.TM.Single.StepTM]
m:364 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
m:364 [binder, in Undecidability.TM.Hoare.HoareExamples]
m:365 [binder, in Undecidability.TM.Hoare.HoareRegister]
m:3658 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m:3664 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m:3666 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m:368 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
m:3683 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m:369 [binder, in Undecidability.TM.Single.StepTM]
m:369 [binder, in Undecidability.TM.Hoare.HoareExamples]
m:37 [binder, in Undecidability.L.Computability.Enum]
M:37 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
M:37 [binder, in Undecidability.TM.SBTM]
m:37 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
m:3705 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
M:372 [binder, in Undecidability.TM.Util.TM_facts]
m:375 [binder, in Undecidability.TM.Single.StepTM]
m:375 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
m:379 [binder, in Undecidability.TM.Hoare.HoareRegister]
m:38 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
M:38 [binder, in Complexity.L.TM.TMflat]
M:38 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
M:38 [binder, in Undecidability.TM.TM]
m:381 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
M:383 [binder, in Undecidability.TM.Util.TM_facts]
M:389 [binder, in Undecidability.TM.Util.TM_facts]
m:39 [binder, in Undecidability.Shared.Libs.DLW.Utils.quotient]
M:39 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
M:39 [binder, in Undecidability.TM.Univ.Univ]
m:391 [binder, in Undecidability.TM.Hoare.HoareExamples]
m:394 [binder, in Undecidability.TM.Hoare.HoareRegister]
m:396 [binder, in Undecidability.TM.Hoare.HoareExamples]
m:398 [binder, in Undecidability.TM.Hoare.HoareExamples]
M:4 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
m:4 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
m:4 [binder, in Undecidability.L.Functions.Ackermann]
m:40 [binder, in Undecidability.Synthetic.EnumerabilityFacts]
m:40 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
M:40 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
M:40 [binder, in Complexity.NP.TM.M_multi2mono]
m:40 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
m:40 [binder, in Undecidability.Shared.Libs.DLW.Vec.pos]
m:400 [binder, in Undecidability.TM.Hoare.HoareExamples]
m:402 [binder, in Undecidability.TM.Hoare.HoareExamples]
m:404 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
m:404 [binder, in Undecidability.TM.Hoare.HoareExamples]
M:406 [binder, in Undecidability.TM.Util.TM_facts]
m:407 [binder, in Undecidability.TM.Hoare.HoareExamples]
m:408 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
m:409 [binder, in Undecidability.TM.Hoare.HoareExamples]
m:41 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
M:41 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
M:41 [binder, in Undecidability.TM.SBTM]
m:412 [binder, in Undecidability.TM.Hoare.HoareRegister]
m:42 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_nat_facts]
M:42 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
M:42 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TM_single]
m:42 [binder, in Undecidability.Shared.Libs.DLW.Code.subcode]
M:42 [binder, in Undecidability.TM.Univ.Univ]
m:420 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
m:425 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
m:427 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
M:43 [binder, in Complexity.L.TM.TMflatComp]
M:43 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
m:43 [binder, in Undecidability.TM.Code.Copy]
m:448 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
m:45 [binder, in Undecidability.TM.Code.NatTM]
M:45 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
m:45 [binder, in Undecidability.Synthetic.ListEnumerabilityFacts]
m:45 [binder, in Undecidability.Shared.Libs.DLW.Vec.pos]
m:456 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
m:46 [binder, in Undecidability.Shared.Libs.DLW.Utils.quotient]
M:46 [binder, in Complexity.NP.TM.TMGenNP]
M:46 [binder, in Complexity.L.TM.TMflatComp]
M:46 [binder, in Undecidability.TM.TM]
m:46 [binder, in Undecidability.TM.Lifting.LiftTapes]
m:46 [binder, in Undecidability.Shared.Libs.DLW.Code.subcode]
m:462 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
m:466 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
m:47 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
m:47 [binder, in Undecidability.Shared.Libs.DLW.Utils.quotient]
m:47 [binder, in Undecidability.Shared.Libs.DLW.Utils.php]
m:47 [binder, in Complexity.L.AbstractMachines.AbstractSubstMachine]
M:47 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
m:47 [binder, in Undecidability.TM.Single.EncodeTapes]
m:470 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
m:477 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
M:48 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
M:48 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
M:48 [binder, in Undecidability.TM.SBTM]
m:487 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
m:49 [binder, in Undecidability.TM.Code.NatTM]
m:49 [binder, in Undecidability.Shared.Libs.DLW.Utils.list_bool]
m:49 [binder, in Undecidability.Shared.Libs.DLW.Utils.php]
M:49 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.SingleTMGenNP]
m:49 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_base]
m:49 [binder, in Complexity.Complexity.SpaceBoundsTime]
m:493 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
m:498 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
m:5 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
M:5 [binder, in Complexity.NP.TM.TMGenNP]
m:5 [binder, in Undecidability.Shared.embed_nat]
m:5 [binder, in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
m:5 [binder, in Undecidability.L.Prelim.MoreList]
m:50 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
m:50 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
m:50 [binder, in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
m:50 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
m:50 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_nat_facts]
m:50 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
M:50 [binder, in Undecidability.TM.Univ.Univ]
m:504 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
m:509 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
m:51 [binder, in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
m:51 [binder, in Undecidability.TM.Code.NatTM]
M:51 [binder, in Complexity.NP.TM.TMGenNP]
m:51 [binder, in Undecidability.Shared.Libs.DLW.Utils.php]
m:51 [binder, in Complexity.L.AbstractMachines.AbstractSubstMachine]
m:51 [binder, in Undecidability.TM.Lifting.LiftTapes]
m:51 [binder, in Undecidability.Shared.Libs.DLW.Vec.pos]
m:514 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
m:519 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
m:52 [binder, in Undecidability.L.Datatypes.LNat]
m:525 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
m:53 [binder, in Undecidability.L.Util.L_facts]
m:53 [binder, in Undecidability.L.Computability.Enum]
m:53 [binder, in Undecidability.Shared.Libs.DLW.Utils.php]
m:53 [binder, in Undecidability.TM.Code.Copy]
m:53 [binder, in Undecidability.Shared.Libs.DLW.Vec.pos]
m:530 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
m:535 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
m:54 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
m:54 [binder, in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
m:54 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
M:54 [binder, in Undecidability.TM.TM]
m:54 [binder, in Undecidability.Synthetic.ListEnumerabilityFacts]
m:54 [binder, in Complexity.L.AbstractMachines.FunctionalDefinitions]
m:54 [binder, in Undecidability.TM.Single.EncodeTapes]
m:540 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
m:546 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
m:55 [binder, in Undecidability.TM.Code.NatTM]
m:55 [binder, in Undecidability.L.Complexity.ResourceMeasures]
m:55 [binder, in Undecidability.Shared.Libs.DLW.Utils.php]
m:55 [binder, in Undecidability.Shared.Libs.DLW.Vec.pos]
m:551 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
m:56 [binder, in Undecidability.L.Util.L_facts]
m:56 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
m:56 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
m:56 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_base]
m:56 [binder, in Complexity.Complexity.SpaceBoundsTime]
m:56 [binder, in Undecidability.TM.Lifting.LiftTapes]
m:56 [binder, in Undecidability.TM.Compound.Shift]
m:57 [binder, in Undecidability.Shared.Libs.DLW.Utils.prime]
m:57 [binder, in Undecidability.L.Tactics.GenEncode]
m:57 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
m:57 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m:58 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
m:58 [binder, in Undecidability.L.Complexity.ResourceMeasures]
M:58 [binder, in Complexity.L.TM.TMflatFun]
m:58 [binder, in Undecidability.TM.Code.Copy]
m:58 [binder, in Undecidability.Shared.Libs.DLW.Vec.pos]
m:58 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
m:59 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
m:59 [binder, in Complexity.Complexity.SpaceBoundsTime]
M:59 [binder, in Undecidability.TM.Univ.Univ]
M:6 [binder, in Undecidability.TM.Hoare.HoareLegacy]
m:6 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
m:6 [binder, in Undecidability.L.Prelim.MoreBase]
m:6 [binder, in Undecidability.Shared.Libs.DLW.Wf.wf_incl]
m:6 [binder, in Undecidability.L.Datatypes.LVector]
m:6 [binder, in Undecidability.Shared.Libs.DLW.Utils.php]
m:6 [binder, in Undecidability.TM.SBTM]
m:6 [binder, in Undecidability.TM.Lifting.LiftTapes]
m:6 [binder, in Undecidability.Shared.Libs.DLW.Utils.seteq]
M:6 [binder, in Undecidability.TM.PrettyBounds.MaxList]
m:6 [binder, in Undecidability.L.Computability.Computability]
m:60 [binder, in Undecidability.Shared.Libs.DLW.Utils.list_bool]
m:61 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
m:61 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
m:61 [binder, in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
m:61 [binder, in Undecidability.Shared.Libs.DLW.Utils.php]
M:61 [binder, in Complexity.L.TM.TMflatFun]
m:61 [binder, in Undecidability.TM.Lifting.LiftTapes]
m:61 [binder, in Undecidability.TM.Hoare.HoareMult]
m:61 [binder, in Undecidability.Shared.Libs.DLW.Vec.pos]
m:62 [binder, in Undecidability.L.Complexity.ResourceMeasures]
m:62 [binder, in Undecidability.TM.Compound.Shift]
m:625 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
m:63 [binder, in Undecidability.Shared.Libs.DLW.Utils.prime]
M:63 [binder, in Complexity.L.TM.TMflatComp]
m:63 [binder, in Undecidability.Shared.Libs.DLW.Utils.list_bool]
m:63 [binder, in Undecidability.Shared.Libs.DLW.Utils.php]
m:631 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
m:635 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
m:64 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
m:64 [binder, in Undecidability.Shared.Libs.DLW.Vec.pos]
m:641 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
m:65 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
m:65 [binder, in Undecidability.L.Complexity.ResourceMeasures]
m:65 [binder, in Complexity.L.TM.TMflatComp]
m:65 [binder, in Complexity.Complexity.SpaceBoundsTime]
m:650 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
m:655 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
m:659 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
m:66 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
m:66 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
m:66 [binder, in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
m:66 [binder, in Undecidability.L.Tactics.GenEncode]
m:66 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
M:66 [binder, in Complexity.L.TM.TMflatComp]
m:66 [binder, in Undecidability.L.Computability.Synthetic]
m:663 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
m:668 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
m:67 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
m:67 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
m:67 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
M:67 [binder, in Undecidability.TM.Univ.Univ]
m:674 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
m:677 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
m:68 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
m:68 [binder, in Undecidability.L.Complexity.ResourceMeasures]
m:68 [binder, in Complexity.L.TM.TMflatComp]
m:68 [binder, in Complexity.L.TM.TMunflatten]
M:68 [binder, in Complexity.L.TM.TMflatFun]
m:683 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
m:69 [binder, in Complexity.Complexity.SpaceBoundsTime]
m:69 [binder, in Undecidability.TM.Code.Copy]
m:690 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
m:698 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
m:7 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
m:7 [binder, in Undecidability.Shared.Libs.DLW.Utils.sorting]
m:7 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachine]
m:70 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
m:70 [binder, in Undecidability.Shared.Libs.DLW.Utils.prime]
m:70 [binder, in Undecidability.Shared.Libs.DLW.Utils.list_bool]
m:70 [binder, in Undecidability.Shared.Libs.DLW.Utils.php]
M:70 [binder, in Complexity.L.TM.TMunflatten]
m:70 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.CC]
m:702 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
m:71 [binder, in Undecidability.Synthetic.Infinite]
m:72 [binder, in Undecidability.L.Complexity.ResourceMeasures]
M:72 [binder, in Complexity.L.TM.TMflatFun]
m:73 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
m:73 [binder, in Complexity.Libs.CookPrelim.PolyBounds]
m:73 [binder, in Undecidability.Shared.Libs.DLW.Utils.php]
m:73 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
m:73 [binder, in Undecidability.Synthetic.Infinite]
m:734 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
m:737 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
m:74 [binder, in Undecidability.L.Complexity.ResourceMeasures]
m:74 [binder, in Undecidability.Shared.Libs.DLW.Utils.list_bool]
m:74 [binder, in Undecidability.TM.Univ.LowLevel]
m:74 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
m:74 [binder, in Undecidability.TM.Code.Copy]
m:75 [binder, in Undecidability.L.Computability.Enum]
m:75 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
m:75 [binder, in Undecidability.Shared.Libs.DLW.Utils.php]
m:75 [binder, in Complexity.L.TM.TMunflatten]
M:75 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
m:75 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
M:75 [binder, in Complexity.L.TM.TMflatFun]
m:76 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
m:76 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
m:76 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
m:76 [binder, in Undecidability.L.Complexity.ResourceMeasures]
m:77 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
m:77 [binder, in Undecidability.Shared.Libs.DLW.Utils.php]
m:78 [binder, in Undecidability.L.Datatypes.LVector]
m:78 [binder, in Undecidability.Synthetic.Infinite]
m:79 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
m:79 [binder, in Undecidability.L.Computability.Enum]
m:79 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler]
m:8 [binder, in Undecidability.Shared.Libs.PSL.Lists.Position]
m:8 [binder, in Undecidability.TM.TM]
m:8 [binder, in Undecidability.L.Functions.Ackermann]
m:8 [binder, in Undecidability.Synthetic.ListEnumerabilityFacts]
m:80 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
m:80 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
M:80 [binder, in Complexity.L.TM.TMflatComp]
m:80 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
m:80 [binder, in Undecidability.Shared.Libs.DLW.Vec.pos]
m:82 [binder, in Undecidability.L.Computability.Enum]
m:82 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
m:82 [binder, in Undecidability.Shared.Libs.DLW.Vec.pos]
M:83 [binder, in Complexity.L.TM.TMflatComp]
m:83 [binder, in Undecidability.Shared.Libs.DLW.Utils.php]
m:84 [binder, in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
m:84 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
m:85 [binder, in Complexity.Complexity.UpToCPoly]
m:85 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler]
m:87 [binder, in Undecidability.Shared.Libs.DLW.Vec.pos]
m:872 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
m:89 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
m:89 [binder, in Undecidability.TM.Util.Prelim]
m:89 [binder, in Undecidability.L.Computability.Synthetic]
m:89 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
M:9 [binder, in Undecidability.TM.Combinators.Combinators]
m:9 [binder, in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
m:9 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
m:90 [binder, in Undecidability.TM.Code.NatTM]
m:90 [binder, in Undecidability.Shared.Libs.DLW.Vec.pos]
m:91 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
m:91 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler]
m:92 [binder, in Undecidability.TM.Util.Prelim]
m:922 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
m:928 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
m:93 [binder, in Undecidability.Shared.Libs.DLW.Vec.pos]
m:934 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
m:94 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
m:95 [binder, in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
m:97 [binder, in Undecidability.Shared.Libs.DLW.Vec.pos]
M:99 [binder, in Undecidability.TM.Univ.Univ]

N

N [abbreviation, in Undecidability.L.TM.TMEncoding]
N [abbreviation, in Undecidability.L.TM.TMinL.TMinL_extract]
name_of [definition, in Undecidability.L.Tactics.Extract]
name_after_dot [definition, in Undecidability.L.Prelim.StringBase]
name_after_dot' [definition, in Undecidability.L.Prelim.StringBase]
name:10 [binder, in Undecidability.L.Tactics.GenEncode]
name:113 [binder, in Undecidability.L.Tactics.Extract]
name:116 [binder, in Undecidability.L.Tactics.Extract]
NaryApp [library]
natsLess [definition, in Undecidability.L.Prelim.MoreList]
natsLess_S [lemma, in Undecidability.L.Prelim.MoreList]
natsLess_in_iff [lemma, in Undecidability.L.Prelim.MoreList]
NatSub [library]
NatTM [library]
natToDigit [definition, in Undecidability.Shared.Libs.DLW.Utils.utils_string]
nat_le_dec [instance, in Undecidability.Shared.Libs.PSL.Numbers]
nat_bool [lemma, in Undecidability.Shared.Libs.PSL.Prelim]
nat_eq_dec [instance, in Undecidability.Shared.Libs.PSL.EqDec]
nat_meet_digits.binary_le_meet_sum_powers.He [variable, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
nat_meet_digits.binary_le_meet_sum_powers.Hg [variable, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
nat_meet_digits.binary_le_meet_sum_powers.Hf [variable, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
nat_meet_digits.binary_le_meet_sum_powers.e [variable, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
nat_meet_digits.binary_le_meet_sum_powers.g [variable, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
nat_meet_digits.binary_le_meet_sum_powers.f [variable, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
nat_meet_digits.binary_le_meet_sum_powers.n [variable, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
nat_meet_digits.binary_le_meet_sum_powers [section, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
nat_meet_digits.double_sum_powers_ortho.dsmpo_1 [variable, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
nat_meet_digits.double_sum_powers_ortho.He [variable, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
nat_meet_digits.double_sum_powers_ortho.Hf [variable, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
nat_meet_digits.double_sum_powers_ortho.e [variable, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
nat_meet_digits.double_sum_powers_ortho.f [variable, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
nat_meet_digits.double_sum_powers_ortho.n [variable, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
nat_meet_digits.double_sum_powers_ortho [section, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
nat_meet_powers_neq [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
nat_meet_digits.nat_meet_powers_neq.nat_meet_neq_powers [variable, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
nat_meet_digits.nat_meet_powers_neq [section, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
nat_meet_powers_eq [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
nat_meet_digits.Hr' [variable, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
nat_meet_digits.Hr [variable, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
nat_meet_digits.r [variable, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
nat_meet_digits.Hq [variable, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
nat_meet_digits.q [variable, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
nat_meet_digits [section, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
nat_ortho_joins [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
nat_ortho_sum_join [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
nat_ortho_joins_left [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
nat_join_eq_0 [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
nat_meet_joins [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
nat_ortho_plus_join [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
nat_lb_plus [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
nat_join_euclid2 [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
nat_join_mult_power2 [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
nat_double_joins_binary_le [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
nat_joins_binary_le [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
nat_joins_binary_le_right [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
nat_joins_binary_le_left [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
nat_join_binary_le [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
nat_meet_joins_distr_l [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
nat_join_monoid [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
nat_meet_join_distr_l [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
nat_join_meet_distr_l [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
nat_join_assoc [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
nat_join_mono [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
nat_join_idem [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
nat_join_n0 [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
nat_join_0n [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
nat_join_right [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
nat_join_left [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
nat_join_comm [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
nat_join [definition, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
nat_meet_12 [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
nat_meet_12n [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
nat_meet_power2_neq [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
nat_meet_power2_neq.nat_meet_power2_lt [variable, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
nat_meet_power2_neq [section, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
nat_meet_assoc [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
nat_meet_idem [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
nat_meet_n0 [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
nat_meet_0n [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
nat_meet_euclid_2 [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
nat_meet_euclid_power_2 [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
nat_meet_mult_power2 [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
nat_meet_dio [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
nat_meet_right [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
nat_meet_left [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
nat_meet_comm [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
nat_meet [definition, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
nat_euclid_pow2_lb [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
nat_pow2_lb_shift [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
nat_lb_nat [definition, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
nat_lb_length [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
nat_lb_1 [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
nat_lb_fix_2 [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
nat_lb_fix_1 [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
nat_lb_fix_0 [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
nat_lb_spec [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
nat_lb [definition, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
nat_lb_def.nat_lb_full [variable, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
nat_lb_def [section, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
nat_enum [definition, in Undecidability.Synthetic.EnumerabilityFacts]
nat_enum_cls [definition, in Undecidability.Shared.Libs.DLW.Utils.quotient]
Nat_log2_le_Proper [instance, in Undecidability.L.Prelim.MoreBase]
nat_size_le [lemma, in Complexity.Libs.CookPrelim.PolyBounds]
nat_size_lt [lemma, in Complexity.Libs.CookPrelim.PolyBounds]
nat_mul_size_bound [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
nat_swap.j [variable, in Undecidability.Shared.Libs.DLW.Utils.sorting]
nat_swap.i [variable, in Undecidability.Shared.Libs.DLW.Utils.sorting]
nat_swap [section, in Undecidability.Shared.Libs.DLW.Utils.sorting]
Nat_mult_monoid [lemma, in Undecidability.Shared.Libs.DLW.Utils.sums]
Nat_plus_monoid [lemma, in Undecidability.Shared.Libs.DLW.Utils.sums]
nat_size_le [lemma, in Complexity.Complexity.UpToCPoly]
nat_size_lt [lemma, in Complexity.Complexity.UpToCPoly]
nat_enc [definition, in Undecidability.L.L]
nat_size_mul [lemma, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
nat_eq_dec [instance, in Undecidability.Shared.Dec]
nat_unenc [definition, in Undecidability.L.Datatypes.LNat]
nat_minimize.nat_min.min_rec [variable, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
nat_minimize.nat_min [section, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
nat_minimize.HP [variable, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
nat_minimize.P [variable, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
nat_minimize [section, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
nat_rev_bounded_ind [lemma, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
nat_rev_bounded_ind.HP [variable, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
nat_rev_bounded_ind.P [variable, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
nat_rev_bounded_ind.k [variable, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
nat_rev_bounded_ind [section, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
nat_rev_ind [lemma, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
nat_sinc_inj [lemma, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
nat_sinc [lemma, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
nat_sort_sorted [lemma, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
nat_sort_eq [lemma, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
nat_sort_length [lemma, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
nat_sort [definition, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
nat_list_insert_sorted [lemma, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
nat_list_insert_Forall [lemma, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
nat_list_insert_incl [lemma, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
nat_list_insert_length [lemma, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
nat_list_insert [definition, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
nat_sorted_injective [lemma, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
nat_sorted_rect [lemma, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
nat_sorted.HP2 [variable, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
nat_sorted.HP1 [variable, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
nat_sorted.HP0 [variable, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
nat_sorted.P [variable, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
nat_sorted_head_inv [lemma, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
nat_sorted_Forall [lemma, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
nat_sorted_cons_inv [lemma, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
nat_sorted [definition, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
nat_sorted [section, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
nat_new_spec [lemma, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
nat_new [definition, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
nat_pos [definition, in Undecidability.Shared.Libs.DLW.Vec.pos]
nat_size_mul [lemma, in Complexity.NP.Clique.kSAT_to_FlatClique]
nat2bool [definition, in Undecidability.Shared.Libs.PSL.Prelim]
nat2bool [definition, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
nat2bool2nat [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
nat2pos [definition, in Undecidability.Shared.Libs.DLW.Vec.pos]
nat2pos_pos2nat [lemma, in Undecidability.Shared.Libs.DLW.Vec.pos]
nblank [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
nblank_finReprEl [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Ncl [definition, in Complexity.NP.Clique.kSAT_to_Clique]
Ncl [definition, in Complexity.NP.Clique.kSAT_to_FlatClique]
ndelimC [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
ndelimC_finReprEl [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
negative [abbreviation, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
negb_not [lemma, in Complexity.NP.Clique.kSAT_to_FlatClique]
negb_true_prop [lemma, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
neutral [abbreviation, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
new [section, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
newSymbols:130 [binder, in Undecidability.TM.Single.StepTM]
news:261 [binder, in Undecidability.TM.Util.TM_facts]
news:44 [binder, in Complexity.L.TM.TMflatFun]
news:7 [binder, in Undecidability.L.TM.TMinL.TMinL_extract]
Newton_nat_S [lemma, in Undecidability.Shared.Libs.DLW.Utils.sums]
Newton_nat [lemma, in Undecidability.Shared.Libs.DLW.Utils.sums]
Newton_nat.plus_cancel_l' [variable, in Undecidability.Shared.Libs.DLW.Utils.sums]
∑ [notation, in Undecidability.Shared.Libs.DLW.Utils.sums]
Newton_nat [section, in Undecidability.Shared.Libs.DLW.Utils.sums]
nextState:24 [binder, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
nfVar:57 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
nf':135 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
nf':146 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
nf':150 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
nf':154 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
nf':216 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
nf':220 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
nf':249 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
nf':261 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
nf':287 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
nf':300 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
nf':305 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
nf':310 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
nf':66 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
nf:134 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
nf:145 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
nf:149 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
nf:153 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
nf:215 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
nf:219 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
nf:246 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
nf:260 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
nf:286 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
nf:299 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
nf:304 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
nf:309 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
nf:349 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
nf:63 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
NilBlank [constructor, in Undecidability.TM.Single.EncodeTapes]
niltape [constructor, in Undecidability.TM.TM]
niltape_repr [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
ninit [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
ninit_finReprEl [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
nMax [abbreviation, in Undecidability.TM.Single.StepTM]
Nmove [constructor, in Undecidability.TM.TM]
Nmove [constructor, in Undecidability.TM.SBTM]
nm:208 [binder, in Undecidability.L.Tactics.Extract]
nm:239 [binder, in Undecidability.L.Tactics.Extract]
nm:246 [binder, in Undecidability.L.Tactics.Extract]
NoDup_vec_list [lemma, in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
NoneElement [lemma, in Undecidability.Shared.Libs.PSL.FiniteTypes.CompoundFinTypes]
None_ofFlatType [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
Nop [definition, in Undecidability.TM.Compound.Multi]
Nop [section, in Undecidability.TM.Compound.Multi]
nop_action [definition, in Undecidability.TM.Util.TM_facts]
Nop_Action.sig [variable, in Undecidability.TM.Util.TM_facts]
Nop_Action.n [variable, in Undecidability.TM.Util.TM_facts]
Nop_Action [section, in Undecidability.TM.Util.TM_facts]
Nop_SpecT_con [lemma, in Undecidability.TM.Hoare.HoareCombinators]
Nop_SpecT [lemma, in Undecidability.TM.Hoare.HoareCombinators]
Nop_Spec [lemma, in Undecidability.TM.Hoare.HoareCombinators]
Nop_Sem [lemma, in Undecidability.TM.Compound.Multi]
Nop_Rel [definition, in Undecidability.TM.Compound.Multi]
Nop.n [variable, in Undecidability.TM.Compound.Multi]
Nop.sig [variable, in Undecidability.TM.Compound.Multi]
norm:20 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.Arbitrary]
notHigherOrder [definition, in Undecidability.L.Tactics.ComputableTime]
notInZero [lemma, in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
not_dupfree_rep [lemma, in Complexity.Libs.Pigeonhole]
not_dec [instance, in Undecidability.Shared.Libs.PSL.EqDec]
not_In_list_assoc [lemma, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
not_in_cons [lemma, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
not_list_an_has_dup [lemma, in Undecidability.Shared.Libs.DLW.Utils.php]
not_list_has_dup_an [lemma, in Undecidability.Shared.Libs.DLW.Utils.php]
not_dupfree [lemma, in Undecidability.Shared.Libs.PSL.Lists.Dupfree]
not_dec [instance, in Undecidability.Shared.Dec]
not_index_reflect_helper2 [lemma, in Undecidability.TM.Lifting.LiftTapes]
not_index_reflect_helper [lemma, in Undecidability.TM.Lifting.LiftTapes]
not_index_reflect [lemma, in Undecidability.TM.Lifting.LiftTapes]
not_indexb [definition, in Undecidability.TM.Lifting.LiftTapes]
not_index [definition, in Undecidability.TM.Lifting.LiftTapes]
not_coenumerable [lemma, in Undecidability.Synthetic.ReducibilityFacts]
not_decidable [lemma, in Undecidability.Synthetic.ReducibilityFacts]
not_compat [lemma, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
no_common_prime_is_coprime [lemma, in Undecidability.Shared.Libs.DLW.Utils.prime]
NP [library]
NPcomplete [definition, in Complexity.Complexity.NP]
NPhard [definition, in Complexity.Complexity.NP]
NPhard_GenNP [lemma, in Complexity.NP.L.GenNP_is_hard]
NPhard_GenNPBool [lemma, in Complexity.NP.L.GenNPBool]
NPhard_sig [lemma, in Complexity.Complexity.NP]
NP_certificate_fix.Y [variable, in Complexity.Complexity.NP]
NP_certificate_fix.X [variable, in Complexity.Complexity.NP]
NP_certificate_fix [section, in Complexity.Complexity.NP]
nrep_card_length [lemma, in Complexity.Libs.Pigeonhole]
nsig [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
nsig_reprEl [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
nstar [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
nstar_finReprEl [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Nth [library]
nth_tabulate [lemma, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
nth_error_none [lemma, in Undecidability.Shared.Libs.PSL.Lists.Position]
nth_error_Some_lt [lemma, in Undecidability.L.Prelim.MoreBase]
nth_error_time [definition, in Undecidability.L.Datatypes.List.List_nat]
nth_error_time_bound [lemma, in Complexity.Libs.CookPrelim.PolyBounds]
nth_error_to_list [lemma, in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
nth_index [lemma, in Complexity.NP.Clique.kSAT_to_Clique]
nth_map2' [lemma, in Undecidability.TM.Util.TM_facts]
nth_map' [lemma, in Undecidability.TM.Util.TM_facts]
nth_nth_error [lemma, in Complexity.Libs.CookPrelim.MorePrelim]
nth_error_skipn [lemma, in Complexity.Libs.CookPrelim.MorePrelim]
nth_error_firstn [lemma, in Complexity.Libs.CookPrelim.MorePrelim]
nth_error_step [lemma, in Complexity.Libs.CookPrelim.MorePrelim]
nth_error_Some_length [lemma, in Complexity.Libs.CookPrelim.MorePrelim]
nth_error_map [lemma, in Complexity.Libs.CookPrelim.MorePrelim]
nth_error_nth' [lemma, in Complexity.Libs.CookPrelim.MorePrelim]
nth_error_nth [lemma, in Complexity.Libs.CookPrelim.MorePrelim]
Nth' [definition, in Undecidability.TM.Code.List.Nth]
Nth' [section, in Undecidability.TM.Code.List.Nth]
Nth'_steps_nice [lemma, in Complexity.TM.PrettyBounds.BaseCode]
Nth'_Loop_steps_nice [lemma, in Complexity.TM.PrettyBounds.BaseCode]
Nth'_Step_steps_nice_cons [lemma, in Complexity.TM.PrettyBounds.BaseCode]
Nth'_Step_steps_nice_nil [lemma, in Complexity.TM.PrettyBounds.BaseCode]
Nth'_nice.cX [variable, in Complexity.TM.PrettyBounds.BaseCode]
Nth'_nice.X [variable, in Complexity.TM.PrettyBounds.BaseCode]
Nth'_nice.sigX [variable, in Complexity.TM.PrettyBounds.BaseCode]
Nth'_nice [section, in Complexity.TM.PrettyBounds.BaseCode]
Nth'_Terminates [lemma, in Undecidability.TM.Code.List.Nth]
Nth'_T [definition, in Undecidability.TM.Code.List.Nth]
Nth'_Realise [lemma, in Undecidability.TM.Code.List.Nth]
Nth'_Rel [definition, in Undecidability.TM.Code.List.Nth]
Nth'_SpecT_size [lemma, in Undecidability.TM.Code.List.Nth]
Nth'_steps [definition, in Undecidability.TM.Code.List.Nth]
Nth'_size [definition, in Undecidability.TM.Code.List.Nth]
Nth'_Loop_SpecT_size [lemma, in Undecidability.TM.Code.List.Nth]
Nth'_Loop_steps [definition, in Undecidability.TM.Code.List.Nth]
Nth'_Loop [definition, in Undecidability.TM.Code.List.Nth]
Nth'_Loop_size [definition, in Undecidability.TM.Code.List.Nth]
Nth'_Step_SpecT_size [lemma, in Undecidability.TM.Code.List.Nth]
Nth'_Step_steps_CaseList [definition, in Undecidability.TM.Code.List.Nth]
Nth'_Step_steps [definition, in Undecidability.TM.Code.List.Nth]
Nth'_Step [definition, in Undecidability.TM.Code.List.Nth]
Nth'_Step_size [definition, in Undecidability.TM.Code.List.Nth]
Nth'.cX [variable, in Undecidability.TM.Code.List.Nth]
Nth'.Legacy [section, in Undecidability.TM.Code.List.Nth]
Nth'.retr1 [variable, in Undecidability.TM.Code.List.Nth]
Nth'.retr2 [variable, in Undecidability.TM.Code.List.Nth]
Nth'.sig [variable, in Undecidability.TM.Code.List.Nth]
Nth'.sigX [variable, in Undecidability.TM.Code.List.Nth]
Nth'.X [variable, in Undecidability.TM.Code.List.Nth]
NTM [library]
NToDigit [definition, in Undecidability.Shared.Libs.DLW.Utils.utils_string]
Null [definition, in Undecidability.TM.Basic.Null]
Null [library]
NullMul [lemma, in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
NullTM [definition, in Undecidability.TM.Basic.Null]
Null_Sem [lemma, in Undecidability.TM.Basic.Null]
Null_Rel [definition, in Undecidability.TM.Basic.Null]
Numbers [library]
num_states [projection, in Undecidability.TM.SBTM]
num:127 [binder, in Undecidability.L.Tactics.Extract]
num:138 [binder, in Undecidability.L.Tactics.Extract]
num:148 [binder, in Undecidability.L.Tactics.Extract]
num:247 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
num:249 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
num:35 [binder, in Undecidability.L.Tactics.GenEncode]
N_size_nat_add_leq [lemma, in Complexity.L.Datatypes.LBinNums]
N_size_nat_monotone [lemma, in Complexity.L.Datatypes.LBinNums]
N_size_nat_leq [lemma, in Complexity.L.Datatypes.LBinNums]
N_size_nat_eq [lemma, in Complexity.L.Datatypes.LBinNums]
N_size_nat_leq' [lemma, in Complexity.L.Datatypes.LBinNums]
N_to_optionPos [definition, in Undecidability.TM.Code.BinNumbers.EncodeBinNumbers]
N_to_string.loop [variable, in Undecidability.Shared.Libs.DLW.Utils.utils_string]
N_to_string [section, in Undecidability.Shared.Libs.DLW.Utils.utils_string]
n_main [definition, in Undecidability.TM.L.CompilerBoolFuns.Compiler]
N'':72 [binder, in Complexity.NP.Clique.kSAT_to_Clique]
n':104 [binder, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
n':111 [binder, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
n':115 [binder, in Undecidability.TM.Single.StepTM]
n':119 [binder, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
n':127 [binder, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
n':13 [binder, in Complexity.L.AbstractMachines.UnfoldHeap]
n':134 [binder, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
n':14 [binder, in Undecidability.L.Prelim.LoopSum]
n':14 [binder, in Undecidability.L.Computability.MuRec]
n':141 [binder, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
n':149 [binder, in Undecidability.L.Prelim.ARS]
n':161 [binder, in Undecidability.TM.Lifting.LiftTapes]
n':17 [binder, in Complexity.L.Datatypes.LBinNums]
n':178 [binder, in Undecidability.L.Util.L_facts]
n':182 [binder, in Undecidability.L.Util.L_facts]
n':186 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
n':19 [binder, in Undecidability.L.Computability.MuRec]
n':196 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
n':20 [binder, in Undecidability.L.Computability.MuRec]
n':205 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
n':21 [binder, in Complexity.NP.TM.M_multi2mono]
n':216 [binder, in Undecidability.L.Prelim.ARS]
n':22 [binder, in Undecidability.L.Computability.MuRec]
n':23 [binder, in Complexity.Complexity.ONotation]
n':25 [binder, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
n':25 [binder, in Undecidability.L.Computability.MuRec]
n':27 [binder, in Complexity.NP.TM.M_multi2mono]
n':28 [binder, in Undecidability.L.Functions.LoopSum]
n':28 [binder, in Complexity.L.AbstractMachines.Computable.Unfolding]
n':28 [binder, in Undecidability.L.Computability.MuRec]
n':2842 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
n':2845 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
n':2848 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
n':29 [binder, in Undecidability.L.Computability.MuRec]
n':31 [binder, in Complexity.NP.TM.M_multi2mono]
n':32 [binder, in Undecidability.Synthetic.Infinite]
n':34 [binder, in Complexity.NP.TM.M_multi2mono]
n':38 [binder, in Undecidability.L.Functions.UnboundIteration]
n':47 [binder, in Undecidability.TM.Util.VectorPrelim]
n':48 [binder, in Undecidability.L.Functions.EqBool]
n':48 [binder, in Complexity.NP.TM.M_multi2mono]
n':49 [binder, in Undecidability.TM.Single.StepTM]
n':5 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
n':50 [binder, in Undecidability.Synthetic.Infinite]
n':51 [binder, in Undecidability.TM.Util.VectorPrelim]
n':52 [binder, in Undecidability.TM.Single.StepTM]
n':55 [binder, in Undecidability.L.Functions.EqBool]
n':6 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
N':68 [binder, in Complexity.NP.Clique.kSAT_to_Clique]
n':7 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
n':71 [binder, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
n':72 [binder, in Complexity.NP.TM.M_multi2mono]
n':74 [binder, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
n':75 [binder, in Undecidability.TM.Single.StepTM]
n':77 [binder, in Undecidability.L.Datatypes.LVector]
n':8 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
n':82 [binder, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
n':9 [binder, in Complexity.L.AbstractMachines.Computable.Lookup]
n':90 [binder, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
n':97 [binder, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
n0:14 [binder, in Complexity.L.AbstractMachines.Computable.UnivDecTime]
n0:18 [binder, in Undecidability.L.Computability.MuRec]
n0:20 [binder, in Complexity.Complexity.ONotation]
n0:21 [binder, in Undecidability.L.Computability.MuRec]
n0:27 [binder, in Undecidability.L.Computability.MuRec]
n0:3 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.Arbitrary]
n0:3 [binder, in Undecidability.L.Computability.Por]
n0:34 [binder, in Undecidability.L.Functions.UnboundIteration]
n0:4 [binder, in Complexity.Complexity.ONotation]
n0:41 [binder, in Complexity.Complexity.ONotationIsAppropriate]
n0:47 [binder, in Complexity.Complexity.ONotation]
n0:5 [binder, in Complexity.Complexity.ONotationIsAppropriate]
n0:5 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.Arbitrary]
n0:53 [binder, in Undecidability.L.Computability.Synthetic]
n0:85 [binder, in Complexity.Complexity.Definitions]
n0:88 [binder, in Undecidability.L.Datatypes.LVector]
n0:9 [binder, in Complexity.Complexity.ONotationIsAppropriate]
N1:10 [binder, in Complexity.NP.SAT.kSAT]
n1:107 [binder, in Undecidability.TM.Single.StepTM]
n1:11 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n1:17 [binder, in Undecidability.L.Computability.Enum]
n1:18 [binder, in Undecidability.TM.Util.VectorPrelim]
n1:219 [binder, in Undecidability.L.Prelim.ARS]
n1:230 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
n1:244 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
n1:275 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n1:280 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n1:284 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n1:289 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n1:294 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n1:299 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n1:308 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n1:3116 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
n1:3129 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
n1:313 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n1:3151 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
n1:3155 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
n1:318 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
n1:319 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n1:323 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
N1:33 [binder, in Complexity.NP.SAT.SAT]
n1:4 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n1:4 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
n1:41 [binder, in Undecidability.Shared.Libs.DLW.Utils.quotient]
n1:43 [binder, in Undecidability.TM.Single.EncodeTapes]
n1:44 [binder, in Complexity.NP.Clique.kSAT_to_FlatClique]
n1:57 [binder, in Undecidability.L.Computability.Enum]
n1:6 [binder, in Complexity.NP.Clique.kSAT_to_Clique]
n1:61 [binder, in Undecidability.Shared.Libs.PSL.Vectors.VectorDupfree]
N1:62 [binder, in Complexity.NP.SAT.SAT_inNP]
N1:74 [binder, in Complexity.NP.SAT.SAT]
n1:77 [binder, in Undecidability.L.Computability.Enum]
n1:8 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n1:97 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
N2:11 [binder, in Complexity.NP.SAT.kSAT]
n2:12 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n2:18 [binder, in Undecidability.L.Computability.Enum]
n2:19 [binder, in Undecidability.TM.Util.VectorPrelim]
n2:220 [binder, in Undecidability.L.Prelim.ARS]
n2:232 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
n2:245 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
n2:276 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n2:281 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n2:285 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n2:290 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n2:295 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n2:300 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n2:309 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n2:3117 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
n2:3130 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
n2:314 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n2:3152 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
n2:3156 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
n2:319 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
n2:320 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n2:324 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
N2:34 [binder, in Complexity.NP.SAT.SAT]
n2:42 [binder, in Undecidability.Shared.Libs.DLW.Utils.quotient]
n2:45 [binder, in Complexity.NP.Clique.kSAT_to_FlatClique]
n2:5 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n2:5 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
n2:58 [binder, in Undecidability.L.Computability.Enum]
n2:62 [binder, in Undecidability.Shared.Libs.PSL.Vectors.VectorDupfree]
N2:63 [binder, in Complexity.NP.SAT.SAT_inNP]
n2:7 [binder, in Complexity.NP.Clique.kSAT_to_Clique]
n2:72 [binder, in Undecidability.L.Tactics.GenEncode]
N2:75 [binder, in Complexity.NP.SAT.SAT]
n2:78 [binder, in Undecidability.L.Computability.Enum]
n2:9 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n2:98 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
n3:277 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n3:282 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n3:286 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n3:291 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n3:296 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n3:301 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n3:310 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n3:3118 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
n3:3131 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
n3:315 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n3:3153 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
n3:3157 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
n3:321 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n3:325 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n3:64 [binder, in Undecidability.L.Tactics.GenEncode]
n3:74 [binder, in Undecidability.L.Tactics.GenEncode]
n4:278 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n4:283 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n4:287 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n4:292 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n4:297 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n4:302 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n4:311 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n4:3119 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
n4:3132 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
n4:3154 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
n4:3158 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
n4:316 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n4:322 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n4:326 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n4:67 [binder, in Undecidability.L.Tactics.GenEncode]
n:1 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:1 [binder, in Undecidability.L.Tactics.Extract]
n:1 [binder, in Undecidability.TM.Code.BinNumbers.NTM]
n:1 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.VectorFin]
n:1 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Fin]
n:1 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_string]
n:1 [binder, in Complexity.TM.PrettyBounds.BaseCodeSpace]
n:1 [binder, in Undecidability.L.Datatypes.LTerm]
n:1 [binder, in Undecidability.Shared.Libs.DLW.Utils.binomial]
n:1 [binder, in Undecidability.L.Functions.Ackermann]
n:1 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.Arbitrary]
n:1 [binder, in Complexity.Complexity.SpaceBoundsTime]
N:1 [binder, in Complexity.NP.Clique.kSAT_to_Clique]
n:1 [binder, in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
n:1 [binder, in Undecidability.Shared.Libs.DLW.Vec.pos]
n:1 [binder, in Undecidability.L.Functions.Encoding]
n:1 [binder, in Undecidability.L.Prelim.MoreList]
n:10 [binder, in Complexity.L.Datatypes.LBinNums]
n:10 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
n:10 [binder, in Undecidability.L.Util.L_facts]
n:10 [binder, in Undecidability.TM.Single.StepTM]
n:10 [binder, in Undecidability.TM.Code.List.Nth]
n:10 [binder, in Undecidability.L.Computability.Enum]
n:10 [binder, in Undecidability.TM.Util.VectorPrelim]
n:10 [binder, in Undecidability.L.Prelim.MoreBase]
n:10 [binder, in Undecidability.L.Tactics.LClos_Eval]
n:10 [binder, in Undecidability.L.Datatypes.LVector]
n:10 [binder, in Undecidability.Shared.Libs.DLW.Utils.binomial]
n:10 [binder, in Complexity.Complexity.ONotationIsAppropriate]
n:10 [binder, in Complexity.L.TM.TMflat]
n:10 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
n:10 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
n:10 [binder, in Complexity.TM.Single.DecodeTapes]
n:10 [binder, in Undecidability.L.Functions.EnumInt]
n:10 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatTCC_to_FlatCC]
n:10 [binder, in Undecidability.TM.L.CaseCom]
n:10 [binder, in Undecidability.L.Computability.MuRec]
n:10 [binder, in Complexity.NP.SAT.kSAT_to_SAT]
n:10 [binder, in Complexity.NP.SAT.CookLevin.Reductions.CC_to_BinaryCC]
n:100 [binder, in Undecidability.TM.Single.StepTM]
n:100 [binder, in Undecidability.Shared.Libs.DLW.Utils.sorting]
n:100 [binder, in Undecidability.TM.Hoare.HoareCombinators]
n:101 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:101 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
n:101 [binder, in Undecidability.L.Computability.Seval]
n:101 [binder, in Undecidability.L.Tactics.LClos]
n:101 [binder, in Undecidability.TM.Code.NatTM]
n:101 [binder, in Undecidability.L.Tactics.LClos_Eval]
n:101 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
n:101 [binder, in Undecidability.TM.L.HeapInterpreter.LookupTM]
N:101 [binder, in Complexity.NP.Clique.kSAT_to_FlatClique]
n:1018 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:102 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:102 [binder, in Undecidability.L.Tactics.Extract]
n:102 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
n:102 [binder, in Undecidability.TM.Hoare.HoareMult]
n:1026 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:1028 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:103 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachine]
n:103 [binder, in Undecidability.Shared.Libs.DLW.Vec.pos]
n:103 [binder, in Undecidability.TM.Hoare.HoareExamples]
n:103 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:1031 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:1034 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:1039 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:104 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
n:104 [binder, in Undecidability.TM.Code.List.Nth]
n:104 [binder, in Complexity.Libs.CookPrelim.PolyBounds]
n:104 [binder, in Complexity.L.TM.TMunflatten]
n:104 [binder, in Undecidability.Synthetic.ListEnumerabilityFacts]
n:104 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
n:1046 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:1049 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:105 [binder, in Undecidability.L.Prelim.ARS]
n:105 [binder, in Complexity.TM.PrettyBounds.BaseCodeSpace]
n:105 [binder, in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
n:105 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_base]
n:105 [binder, in Undecidability.L.Tactics.Reflection]
n:105 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
N:105 [binder, in Complexity.NP.Clique.kSAT_to_FlatClique]
n:1051 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:1053 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:1054 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:1056 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:1059 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:106 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
n:106 [binder, in Undecidability.Shared.Libs.DLW.Utils.sorting]
n:106 [binder, in Undecidability.TM.Hoare.HoareRegister]
n:106 [binder, in Undecidability.TM.L.HeapInterpreter.LookupTM]
n:106 [binder, in Undecidability.Shared.Libs.DLW.Vec.pos]
n:1064 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:1069 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:107 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
n:107 [binder, in Complexity.NP.Clique.kSAT_to_FlatClique]
n:1071 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:1075 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:1079 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:108 [binder, in Undecidability.L.Computability.Seval]
n:108 [binder, in Undecidability.TM.Hoare.HoareMult]
n:108 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
n:1082 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:1084 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:1088 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:109 [binder, in Complexity.TM.PrettyBounds.BaseCode]
n:109 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:109 [binder, in Undecidability.TM.Code.List.Nth]
n:109 [binder, in Undecidability.TM.Code.NatTM]
n:109 [binder, in Complexity.NP.Clique.FlatClique]
n:109 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
n:109 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
n:109 [binder, in Undecidability.Synthetic.ListEnumerabilityFacts]
n:109 [binder, in Undecidability.TM.Hoare.HoareLogic]
n:109 [binder, in Undecidability.Shared.Libs.DLW.Vec.pos]
N:109 [binder, in Complexity.NP.Clique.kSAT_to_FlatClique]
n:1092 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:1096 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:11 [binder, in Undecidability.Shared.Libs.PSL.Numbers]
n:11 [binder, in Complexity.L.Datatypes.LBinNums]
n:11 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
n:11 [binder, in Undecidability.Shared.Libs.DLW.Utils.prime]
n:11 [binder, in Undecidability.L.Functions.LoopSum]
n:11 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
n:11 [binder, in Complexity.L.AbstractMachines.Computable.Unfolding]
n:11 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Fin]
n:11 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_string]
N:11 [binder, in Complexity.NP.SAT.SAT_inNP]
n:11 [binder, in Undecidability.Shared.Libs.DLW.Utils.binomial]
n:11 [binder, in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
n:11 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
n:11 [binder, in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
n:11 [binder, in Complexity.NP.SAT.kSAT_to_SAT]
n:110 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
n:110 [binder, in Undecidability.L.Tactics.LClos_Eval]
n:110 [binder, in Undecidability.Shared.Libs.DLW.Utils.sorting]
n:110 [binder, in Undecidability.L.Tactics.Reflection]
n:110 [binder, in Complexity.NP.Clique.kSAT_to_Clique]
n:110 [binder, in Undecidability.TM.L.HeapInterpreter.LookupTM]
n:110 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:1100 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:1103 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:1105 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:111 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
n:111 [binder, in Undecidability.TM.Code.List.Nth]
n:111 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
n:111 [binder, in Undecidability.L.Tactics.LClos]
n:111 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
n:111 [binder, in Complexity.Libs.CookPrelim.PolyBounds]
n:111 [binder, in Complexity.L.TM.TMunflatten]
n:111 [binder, in Undecidability.Shared.Libs.DLW.Vec.pos]
n:1110 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:1118 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:112 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
N:112 [binder, in Complexity.NP.Clique.kSAT_to_FlatClique]
n:1123 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:113 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
n:113 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
n:113 [binder, in Undecidability.TM.Hoare.HoareRegister]
n:114 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
n:114 [binder, in Undecidability.Shared.Libs.DLW.Utils.sorting]
n:114 [binder, in Undecidability.TM.Hoare.HoareRegister]
n:114 [binder, in Undecidability.TM.Hoare.HoareMult]
N:114 [binder, in Complexity.NP.Clique.kSAT_to_FlatClique]
n:115 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
n:115 [binder, in Undecidability.TM.Code.NatTM]
n:115 [binder, in Undecidability.TM.Code.CodeTM]
n:115 [binder, in Undecidability.TM.Hoare.HoareCombinators]
n:115 [binder, in Complexity.NP.Clique.kSAT_to_FlatClique]
n:116 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
n:116 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
n:116 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
n:116 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
n:116 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
n:116 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
n:116 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:117 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:117 [binder, in Complexity.Complexity.PolyTimeComputable]
n:117 [binder, in Undecidability.TM.L.HeapInterpreter.LookupTM]
n:117 [binder, in Undecidability.Shared.Libs.DLW.Vec.pos]
N:117 [binder, in Complexity.NP.Clique.kSAT_to_FlatClique]
n:117 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
n:118 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
n:118 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:118 [binder, in Undecidability.TM.Code.NatTM]
n:118 [binder, in Undecidability.TM.Hoare.HoareRegister]
n:118 [binder, in Complexity.NP.Clique.FlatClique]
n:118 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
n:118 [binder, in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
n:118 [binder, in Complexity.Complexity.PolyTimeComputable]
n:119 [binder, in Undecidability.TM.Code.List.Nth]
n:119 [binder, in Undecidability.Synthetic.ListEnumerabilityFacts]
n:119 [binder, in Undecidability.TM.Hoare.HoareMult]
n:119 [binder, in Undecidability.TM.Hoare.HoareLogic]
n:119 [binder, in Complexity.Complexity.PolyTimeComputable]
n:119 [binder, in Undecidability.Shared.Libs.DLW.Vec.pos]
N:119 [binder, in Complexity.NP.Clique.kSAT_to_FlatClique]
n:12 [binder, in Undecidability.TM.Single.StepTM]
n:12 [binder, in Undecidability.Shared.Libs.PSL.Prelim]
n:12 [binder, in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
n:12 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
n:12 [binder, in Complexity.L.AbstractMachines.Computable.Unfolding]
n:12 [binder, in Undecidability.Synthetic.EnumerabilityFacts]
n:12 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.VectorFin]
n:12 [binder, in Complexity.L.AbstractMachines.UnfoldHeap]
n:12 [binder, in Undecidability.Shared.Libs.DLW.Wf.wf_incl]
n:12 [binder, in Undecidability.Shared.embed_nat]
n:12 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
n:12 [binder, in Undecidability.Synthetic.MoreEnumerabilityFacts]
n:12 [binder, in Complexity.Complexity.SpaceBoundsTime]
n:12 [binder, in Undecidability.L.Functions.UnboundIteration]
n:12 [binder, in Undecidability.Shared.Libs.DLW.Wf.wf_finite]
n:12 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatTCC_to_FlatCC]
n:12 [binder, in Undecidability.L.Computability.MuRec]
n:12 [binder, in Undecidability.Shared.Libs.DLW.Vec.pos]
n:12 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
n:120 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
n:120 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
n:120 [binder, in Undecidability.TM.Code.CodeTM]
n:120 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
n:120 [binder, in Undecidability.Synthetic.ListEnumerabilityFacts]
n:120 [binder, in Complexity.Complexity.PolyTimeComputable]
n:121 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
n:121 [binder, in Undecidability.TM.Single.StepTM]
n:121 [binder, in Undecidability.Shared.Libs.DLW.Vec.pos]
N:121 [binder, in Complexity.NP.Clique.kSAT_to_FlatClique]
n:122 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
n:122 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
n:122 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:123 [binder, in Undecidability.TM.Single.StepTM]
n:123 [binder, in Undecidability.Shared.Libs.DLW.Utils.sorting]
N:123 [binder, in Complexity.NP.Clique.kSAT_to_FlatClique]
n:124 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
n:124 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
n:124 [binder, in Undecidability.TM.Hoare.HoareMult]
n:124 [binder, in Undecidability.TM.Hoare.HoareCombinators]
n:124 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
n:125 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:125 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
n:125 [binder, in Undecidability.TM.Code.NatTM]
n:125 [binder, in Complexity.NP.Clique.FlatClique]
N:125 [binder, in Complexity.NP.Clique.kSAT_to_FlatClique]
n:126 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
n:126 [binder, in Undecidability.Synthetic.ListEnumerabilityFacts]
n:126 [binder, in Complexity.Complexity.PolyTimeComputable]
n:126 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
n:127 [binder, in Undecidability.TM.Single.StepTM]
n:127 [binder, in Undecidability.Synthetic.ListEnumerabilityFacts]
n:127 [binder, in Complexity.Complexity.PolyTimeComputable]
N:127 [binder, in Complexity.NP.Clique.kSAT_to_FlatClique]
n:128 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
n:128 [binder, in Undecidability.TM.Code.NatTM]
n:128 [binder, in Undecidability.Shared.Libs.DLW.Utils.sorting]
n:128 [binder, in Complexity.Complexity.PolyTimeComputable]
n:128 [binder, in Complexity.NP.Clique.kSAT_to_FlatClique]
n:129 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
n:129 [binder, in Undecidability.TM.Code.List.Nth]
n:129 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
N:129 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
n:129 [binder, in Undecidability.TM.Hoare.HoareMult]
n:129 [binder, in Complexity.Complexity.PolyTimeComputable]
n:129 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:129 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
n:13 [binder, in Undecidability.Shared.Libs.PSL.Numbers]
n:13 [binder, in Complexity.Complexity.ONotation]
n:13 [binder, in Complexity.L.Datatypes.LBinNums]
n:13 [binder, in Undecidability.Shared.Libs.DLW.Utils.prime]
n:13 [binder, in Undecidability.L.TM.TMinL]
n:13 [binder, in Undecidability.TM.Single.StepTM]
n:13 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
n:13 [binder, in Undecidability.L.Computability.Seval]
N:13 [binder, in Complexity.NP.SAT.kSAT]
n:13 [binder, in Undecidability.L.Prelim.LoopSum]
n:13 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
n:13 [binder, in Undecidability.Shared.Libs.PSL.Inhabited]
N:13 [binder, in Undecidability.Shared.FinTypeForallExists]
n:13 [binder, in Undecidability.L.Datatypes.List.List_nat]
n:13 [binder, in Undecidability.Shared.embed_nat]
n:13 [binder, in Complexity.Complexity.ONotationIsAppropriate]
n:13 [binder, in Complexity.Complexity.SpaceBoundsTime]
n:13 [binder, in Undecidability.Synthetic.ListEnumerabilityFacts]
n:13 [binder, in Undecidability.L.TM.TMEncoding]
n:13 [binder, in Undecidability.Shared.Libs.PSL.Vectors.VectorDupfree]
n:13 [binder, in Undecidability.TM.Code.Code]
n:13 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatTCC_to_FlatCC]
n:13 [binder, in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
n:13 [binder, in Undecidability.TM.Hoare.HoareLogic]
n:13 [binder, in Undecidability.L.Computability.MuRec]
n:13 [binder, in Undecidability.TM.L.HeapInterpreter.LookupTM]
n:13 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
n:130 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
n:130 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
n:130 [binder, in Undecidability.TM.Hoare.HoareLogic]
N:130 [binder, in Complexity.NP.Clique.kSAT_to_FlatClique]
n:131 [binder, in Undecidability.L.Prelim.ARS]
n:131 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
N:131 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:132 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
n:132 [binder, in Undecidability.TM.Code.NatTM]
n:132 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
n:133 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
n:133 [binder, in Undecidability.TM.Single.StepTM]
N:133 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
n:133 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
n:133 [binder, in Complexity.NP.Clique.kSAT_to_FlatClique]
n:134 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
n:134 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:134 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
n:134 [binder, in Undecidability.TM.Hoare.HoareCombinators]
n:135 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:135 [binder, in Undecidability.TM.Code.NatTM]
n:135 [binder, in Complexity.NP.Clique.FlatClique]
n:135 [binder, in Undecidability.TM.Hoare.HoareMult]
n:135 [binder, in Complexity.Complexity.PolyTimeComputable]
N:135 [binder, in Complexity.NP.Clique.kSAT_to_FlatClique]
n:136 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
N:136 [binder, in Complexity.NP.SAT.SAT_inNP]
n:136 [binder, in Undecidability.Synthetic.ListEnumerabilityFacts]
n:136 [binder, in Complexity.Complexity.PolyTimeComputable]
n:136 [binder, in Undecidability.Shared.Libs.DLW.Vec.pos]
n:136 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:137 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
n:137 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
n:137 [binder, in Undecidability.Synthetic.ListEnumerabilityFacts]
n:137 [binder, in Complexity.Complexity.PolyTimeComputable]
N:137 [binder, in Complexity.NP.Clique.kSAT_to_FlatClique]
n:137 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
n:138 [binder, in Undecidability.TM.Single.StepTM]
n:138 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
n:138 [binder, in Undecidability.TM.Lifting.LiftTapes]
n:138 [binder, in Complexity.Complexity.PolyTimeComputable]
n:138 [binder, in Undecidability.Shared.Libs.DLW.Vec.pos]
n:139 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
n:139 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
n:139 [binder, in Undecidability.TM.Code.NatTM]
n:139 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
n:139 [binder, in Undecidability.TM.Lifting.LiftTapes]
N:139 [binder, in Complexity.NP.Clique.kSAT_to_Clique]
n:139 [binder, in Undecidability.TM.Hoare.HoareLogic]
N:139 [binder, in Complexity.NP.Clique.kSAT_to_FlatClique]
n:139 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:14 [binder, in Complexity.L.Datatypes.LBinNums]
n:14 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
n:14 [binder, in Undecidability.L.Computability.Enum]
n:14 [binder, in Complexity.NP.TM.TMGenNP]
N:14 [binder, in Complexity.NP.SAT.SAT_inNP]
n:14 [binder, in Undecidability.L.Datatypes.List.List_extra]
n:14 [binder, in Undecidability.Shared.embed_nat]
n:14 [binder, in Undecidability.L.Tactics.Reflection]
n:14 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatTCC_to_FlatCC]
n:14 [binder, in Undecidability.L.Datatypes.LNat]
n:14 [binder, in Undecidability.TM.Hoare.HoareCombinators]
n:140 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
n:140 [binder, in Undecidability.L.Tactics.Extract]
n:140 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
N:140 [binder, in Complexity.NP.SAT.SAT_inNP]
n:140 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:141 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
n:141 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:141 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
n:141 [binder, in Undecidability.Synthetic.ListEnumerabilityFacts]
n:141 [binder, in Undecidability.TM.Lifting.LiftTapes]
N:141 [binder, in Complexity.NP.Clique.kSAT_to_Clique]
n:141 [binder, in Undecidability.TM.Hoare.HoareMult]
n:141 [binder, in Undecidability.Shared.Libs.DLW.Vec.pos]
n:141 [binder, in Complexity.NP.Clique.kSAT_to_FlatClique]
n:142 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
n:142 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
n:142 [binder, in Complexity.NP.Clique.kSAT_to_FlatClique]
n:143 [binder, in Undecidability.TM.Single.StepTM]
n:143 [binder, in Undecidability.TM.Hoare.HoareCombinators]
n:143 [binder, in Complexity.NP.Clique.kSAT_to_FlatClique]
n:144 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
n:144 [binder, in Undecidability.L.Tactics.Extract]
n:144 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
n:144 [binder, in Complexity.NP.Clique.FlatClique]
n:144 [binder, in Undecidability.Shared.Libs.DLW.Vec.pos]
n:145 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
n:145 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
n:145 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
n:145 [binder, in Complexity.NP.SAT.SAT_inNP]
n:145 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
n:146 [binder, in Undecidability.TM.Single.StepTM]
n:146 [binder, in Complexity.NP.SAT.SAT_inNP]
n:146 [binder, in Undecidability.TM.Lifting.LiftTapes]
n:146 [binder, in Undecidability.TM.Hoare.HoareMult]
n:147 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
n:147 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
n:147 [binder, in Undecidability.TM.Util.Relations]
n:147 [binder, in Undecidability.Shared.Libs.DLW.Vec.pos]
n:148 [binder, in Undecidability.L.Prelim.ARS]
n:148 [binder, in Undecidability.Shared.Libs.DLW.Vec.pos]
N:148 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:149 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
n:149 [binder, in Undecidability.TM.Single.StepTM]
n:149 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
n:149 [binder, in Undecidability.TM.Hoare.HoareRegister]
n:149 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
n:15 [binder, in Undecidability.TM.Code.List.Concat_Repeat]
n:15 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
n:15 [binder, in Undecidability.TM.Single.StepTM]
n:15 [binder, in Undecidability.TM.Code.CaseNat]
n:15 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
n:15 [binder, in Undecidability.TM.Util.VectorPrelim]
n:15 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_nat_facts]
n:15 [binder, in Undecidability.Shared.Libs.PSL.Inhabited]
n:15 [binder, in Undecidability.L.Datatypes.LVector]
n:15 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
n:15 [binder, in Undecidability.TM.Code.Code]
n:15 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatTCC_to_FlatCC]
n:15 [binder, in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
n:15 [binder, in Undecidability.L.Computability.MuRec]
N:15 [binder, in Complexity.NP.SAT.SAT]
n:15 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
n:150 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:150 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
n:150 [binder, in Undecidability.TM.Hoare.HoareMult]
n:150 [binder, in Undecidability.TM.Hoare.HoareLogic]
n:150 [binder, in Undecidability.Shared.Libs.DLW.Vec.pos]
n:151 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:151 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
n:151 [binder, in Undecidability.TM.Lifting.LiftTapes]
n:152 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
n:152 [binder, in Undecidability.TM.Hoare.HoareMult]
N:152 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:152 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
n:153 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
n:153 [binder, in Undecidability.Shared.Libs.DLW.Vec.pos]
n:154 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
n:154 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
n:154 [binder, in Undecidability.TM.Hoare.HoareMult]
n:155 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
n:155 [binder, in Undecidability.TM.Lifting.LiftTapes]
n:156 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
n:156 [binder, in Undecidability.Shared.Libs.DLW.Vec.pos]
N:156 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:157 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
n:157 [binder, in Complexity.Libs.CookPrelim.PolyBounds]
n:157 [binder, in Undecidability.TM.Hoare.HoareLogic]
n:157 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:158 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
n:158 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:158 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
n:158 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
n:158 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
n:158 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:159 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:159 [binder, in Complexity.L.TM.TMunflatten]
n:159 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
n:159 [binder, in Undecidability.TM.Code.Code]
n:159 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:159 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
n:16 [binder, in Undecidability.Shared.Libs.PSL.FCI]
n:16 [binder, in Undecidability.TM.Compound.TMTac]
n:16 [binder, in Undecidability.TM.L.CompilerBoolFuns.NaryApp]
n:16 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
n:16 [binder, in Complexity.L.Datatypes.LBinNums]
n:16 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
n:16 [binder, in Undecidability.L.Computability.Seval]
n:16 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
n:16 [binder, in Undecidability.TM.Code.List.Length]
n:16 [binder, in Undecidability.Shared.FinTypeForallExists]
n:16 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Fin]
n:16 [binder, in Undecidability.Shared.Libs.DLW.Utils.binomial]
n:16 [binder, in Undecidability.L.AbstractMachines.FlatPro.UnfoldClos]
n:16 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
n:16 [binder, in Complexity.Complexity.ONotationIsAppropriate]
n:16 [binder, in Complexity.L.TM.TMunflatten]
n:16 [binder, in Complexity.Complexity.SpaceBoundsTime]
n:16 [binder, in Undecidability.L.Functions.UnboundIteration]
n:16 [binder, in Complexity.L.TM.TMflatFun]
n:16 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
n:16 [binder, in Undecidability.L.Functions.EnumInt]
n:16 [binder, in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
n:16 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatTCC_to_FlatCC]
n:16 [binder, in Undecidability.L.Computability.Computability]
n:160 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
n:160 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
n:160 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
n:160 [binder, in Undecidability.Shared.Libs.DLW.Vec.pos]
n:160 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:161 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
n:161 [binder, in Undecidability.L.Tactics.Extract]
n:161 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
n:161 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:162 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
n:162 [binder, in Undecidability.TM.Hoare.HoareLogic]
n:162 [binder, in Undecidability.TM.Hoare.HoareCombinators]
n:162 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:163 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
n:163 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:164 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
n:164 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
n:164 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
n:164 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
n:164 [binder, in Undecidability.Shared.Libs.DLW.Vec.pos]
n:164 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:164 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
n:165 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:165 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:166 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
n:166 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
n:166 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:167 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
n:167 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
n:167 [binder, in Undecidability.TM.Hoare.HoareLogic]
n:167 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:168 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
n:168 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:168 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
n:168 [binder, in Undecidability.TM.Util.TM_facts]
n:168 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
n:168 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:169 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
n:169 [binder, in Undecidability.TM.Hoare.HoareLogic]
n:169 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:17 [binder, in Undecidability.L.Prelim.ARS]
n:17 [binder, in Complexity.Complexity.ONotation]
n:17 [binder, in Undecidability.Shared.Libs.DLW.Utils.prime]
n:17 [binder, in Undecidability.TM.Single.StepTM]
N:17 [binder, in Complexity.NP.SAT.kSAT]
n:17 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
n:17 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
n:17 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
n:17 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_string]
n:17 [binder, in Undecidability.Shared.Libs.DLW.Utils.binomial]
n:17 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
n:17 [binder, in Complexity.Complexity.SpaceBoundsTime]
n:17 [binder, in Undecidability.Synthetic.Definitions]
N:17 [binder, in Undecidability.L.Computability.Acceptability]
n:17 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
n:17 [binder, in Undecidability.TM.Code.Code]
n:17 [binder, in Undecidability.L.Computability.MuRec]
n:17 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
n:17 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler]
n:170 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
n:170 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
n:170 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:171 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
n:171 [binder, in Complexity.L.TM.TMunflatten]
n:171 [binder, in Undecidability.TM.Hoare.HoareRegister]
n:171 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
n:171 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
n:171 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:172 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:172 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
n:172 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
n:172 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:173 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
n:173 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:174 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
n:174 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
n:174 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
n:174 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:175 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
n:175 [binder, in Undecidability.TM.Hoare.HoareCombinators]
n:175 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:176 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
n:176 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
n:176 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:177 [binder, in Undecidability.L.Util.L_facts]
n:177 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
n:177 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:178 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
n:178 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
n:178 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:179 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
n:179 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
n:179 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:18 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
n:18 [binder, in Undecidability.TM.Hoare.HoareLegacy]
n:18 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
n:18 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
n:18 [binder, in Complexity.L.AbstractMachines.Computable.Unfolding]
n:18 [binder, in Undecidability.Synthetic.EnumerabilityFacts]
n:18 [binder, in Complexity.L.AbstractMachines.Computable.UnivDecTime]
n:18 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.VectorFin]
n:18 [binder, in Undecidability.Shared.FinTypeForallExists]
N:18 [binder, in Complexity.NP.SAT.SAT_inNP]
n:18 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
n:18 [binder, in Complexity.NP.SAT.CookLevin.Reductions.TMGenNP_fixed_singleTapeTM_to_FlatFunSingleTMGenNP]
n:18 [binder, in Complexity.Complexity.ONotationIsAppropriate]
n:18 [binder, in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
n:18 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
n:18 [binder, in Complexity.TM.Single.DecodeTapes]
n:18 [binder, in Undecidability.L.Tactics.Reflection]
n:18 [binder, in Undecidability.Shared.Libs.PSL.Vectors.VectorDupfree]
n:18 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
n:18 [binder, in Undecidability.TM.L.HeapInterpreter.LookupTM]
n:18 [binder, in Undecidability.L.Computability.Computability]
n:18 [binder, in Undecidability.L.Prelim.MoreList]
n:180 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:180 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
n:180 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
n:180 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:181 [binder, in Undecidability.L.Util.L_facts]
n:181 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:182 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
n:182 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:183 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:184 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:184 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
n:184 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
n:184 [binder, in Undecidability.TM.Hoare.HoareLogic]
n:184 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:185 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
n:185 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
n:185 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
n:185 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:186 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
n:186 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
n:186 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
n:186 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:187 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
n:187 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
n:187 [binder, in Undecidability.TM.Hoare.HoareLogic]
n:187 [binder, in Undecidability.TM.Hoare.HoareCombinators]
n:187 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:188 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:188 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
n:188 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
n:188 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
n:188 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
n:188 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
n:188 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:189 [binder, in Undecidability.TM.Hoare.HoareRegister]
n:189 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:19 [binder, in Undecidability.L.TM.TMinL]
n:19 [binder, in Undecidability.TM.Single.StepTM]
n:19 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
N:19 [binder, in Complexity.NP.SAT.kSAT]
n:19 [binder, in Complexity.L.AbstractMachines.Computable.Unfolding]
n:19 [binder, in Undecidability.L.Prelim.LoopSum]
n:19 [binder, in Undecidability.TM.Code.BinNumbers.EncodeBinNumbers]
n:19 [binder, in Undecidability.Shared.Libs.DLW.Wf.wf_incl]
n:19 [binder, in Undecidability.L.Datatypes.List.List_nat]
N:19 [binder, in Complexity.NP.SAT.SAT_inNP]
n:19 [binder, in Undecidability.Shared.Libs.DLW.Utils.binomial]
n:19 [binder, in Complexity.Complexity.SpaceBoundsTime]
n:19 [binder, in Complexity.NP.TM.M_multi2mono]
n:19 [binder, in Undecidability.L.TM.TMEncoding]
n:190 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
n:190 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
n:190 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:191 [binder, in Undecidability.L.Prelim.ARS]
n:191 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
n:191 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
n:191 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:192 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:193 [binder, in Undecidability.L.Tactics.Extract]
n:193 [binder, in Undecidability.TM.Code.Code]
n:193 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
n:193 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:194 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
n:194 [binder, in Undecidability.TM.Hoare.HoareLogic]
n:194 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:195 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
n:195 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
N:195 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
n:195 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
n:195 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
n:195 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:196 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
n:196 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
n:196 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
n:196 [binder, in Complexity.L.TM.TMunflatten]
n:196 [binder, in Undecidability.TM.Hoare.HoareCombinators]
n:196 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:197 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:197 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
n:197 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
n:197 [binder, in Undecidability.TM.Hoare.HoareRegister]
n:197 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:198 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
n:198 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
n:198 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:199 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
N:199 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
n:199 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:2 [binder, in Undecidability.L.Functions.Eval]
n:2 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:2 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
n:2 [binder, in Undecidability.L.TM.TMinL]
n:2 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
n:2 [binder, in Complexity.L.AbstractMachines.Computable.Shared]
n:2 [binder, in Undecidability.TM.Util.VectorPrelim]
n:2 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_nat_facts]
n:2 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
n:2 [binder, in Undecidability.TM.Code.BinNumbers.NTM]
n:2 [binder, in Undecidability.L.Functions.Subst]
n:2 [binder, in Complexity.NP.TM.TMGenNP]
n:2 [binder, in Complexity.L.TM.TMunflatten]
n:2 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.Arbitrary]
n:2 [binder, in Complexity.TM.Single.DecodeTapes]
n:2 [binder, in Undecidability.L.TM.TMEncoding]
n:2 [binder, in Undecidability.Shared.Libs.PSL.Vectors.VectorDupfree]
n:2 [binder, in Undecidability.TM.Lifting.LiftTapes]
n:2 [binder, in Complexity.NP.Clique.kSAT_to_Clique]
n:2 [binder, in Undecidability.TM.Util.TM_facts]
n:2 [binder, in Undecidability.TM.Hoare.HoareLogic]
n:2 [binder, in Undecidability.TM.Hoare.HoareCombinators]
N:2 [binder, in Complexity.NP.SAT.kSAT_to_SAT]
n:2 [binder, in Complexity.NP.TM.TMGenNP_fixed_mTM]
n:20 [binder, in Undecidability.TM.Compound.TMTac]
n:20 [binder, in Undecidability.L.Tactics.Extract]
n:20 [binder, in Undecidability.TM.Code.NatTM]
n:20 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
n:20 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
n:20 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Fin]
n:20 [binder, in Undecidability.L.Tactics.LClos_Eval]
n:20 [binder, in Undecidability.Shared.Libs.DLW.Utils.binomial]
n:20 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
n:20 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
n:20 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
n:20 [binder, in Undecidability.L.Functions.EnumInt]
n:20 [binder, in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
n:20 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatTCC_to_FlatCC]
n:20 [binder, in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
n:200 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
n:200 [binder, in Complexity.L.TM.TMunflatten]
n:200 [binder, in Undecidability.TM.Code.Code]
n:200 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:201 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:201 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
n:201 [binder, in Undecidability.TM.Code.Code]
n:201 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
n:201 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:202 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
n:202 [binder, in Undecidability.TM.Code.Code]
n:202 [binder, in Undecidability.TM.Hoare.HoareLogic]
n:202 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:203 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
n:203 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
n:203 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:204 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
n:204 [binder, in Undecidability.L.Tactics.Extract]
n:204 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
n:204 [binder, in Undecidability.TM.Hoare.HoareRegister]
n:204 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
n:204 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:205 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
n:205 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
n:205 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
n:205 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:206 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
n:206 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:207 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
n:207 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
n:207 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
n:207 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:208 [binder, in Undecidability.L.Prelim.ARS]
n:208 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
n:208 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:209 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
n:209 [binder, in Complexity.L.TM.TMunflatten]
n:209 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
n:209 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:21 [binder, in Undecidability.Shared.Libs.PSL.FCI]
n:21 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
n:21 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
n:21 [binder, in Undecidability.TM.Single.StepTM]
n:21 [binder, in Undecidability.TM.Code.List.Nth]
n:21 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
n:21 [binder, in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
n:21 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
n:21 [binder, in Undecidability.TM.Code.BinNumbers.EncodeBinNumbers]
n:21 [binder, in Complexity.L.AbstractMachines.Computable.UnivDecTime]
N:21 [binder, in Complexity.NP.SAT.SAT_inNP]
n:21 [binder, in Undecidability.L.TM.TapeFuns]
n:21 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
n:21 [binder, in Undecidability.L.AbstractMachines.FlatPro.UnfoldClos]
n:21 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
n:21 [binder, in Complexity.L.TM.TMunflatten]
n:21 [binder, in Undecidability.Synthetic.MoreEnumerabilityFacts]
n:21 [binder, in Complexity.Complexity.SpaceBoundsTime]
n:21 [binder, in Undecidability.Shared.Libs.DLW.Wf.wf_finite]
n:21 [binder, in Complexity.L.TM.TMflatFun]
n:21 [binder, in Undecidability.Synthetic.Infinite]
n:21 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatTCC_to_FlatCC]
n:21 [binder, in Undecidability.TM.Hoare.HoareLogic]
n:21 [binder, in Undecidability.TM.L.HeapInterpreter.LookupTM]
n:21 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
n:21 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.CompoundFinTypes]
n:210 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
n:210 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
n:210 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
n:210 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:211 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:212 [binder, in Undecidability.L.Prelim.ARS]
n:212 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:212 [binder, in Undecidability.TM.Hoare.HoareRegister]
n:212 [binder, in Undecidability.TM.Hoare.HoareCombinators]
n:212 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:213 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
n:213 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
n:213 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
n:213 [binder, in Undecidability.TM.Hoare.HoareLogic]
n:214 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
n:214 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
n:214 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
n:214 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
n:216 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
n:216 [binder, in Complexity.L.TM.TMunflatten]
n:216 [binder, in Undecidability.TM.Hoare.HoareLogic]
n:216 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
n:217 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
n:217 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
n:218 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
n:218 [binder, in Complexity.L.TM.TMflatComp]
n:218 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
n:218 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
N:218 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:219 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
n:219 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
n:22 [binder, in Undecidability.TM.Code.List.Concat_Repeat]
n:22 [binder, in Undecidability.L.Computability.Seval]
n:22 [binder, in Undecidability.Synthetic.EnumerabilityFacts]
n:22 [binder, in Undecidability.Shared.FinTypeEquiv]
n:22 [binder, in Undecidability.TM.Code.BinNumbers.EncodeBinNumbers]
n:22 [binder, in Undecidability.Shared.Libs.DLW.Utils.crt]
n:22 [binder, in Undecidability.Shared.Libs.DLW.Utils.binomial]
n:22 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
n:22 [binder, in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
n:22 [binder, in Undecidability.L.L]
n:22 [binder, in Undecidability.TM.Hoare.HoareRegister]
n:22 [binder, in Undecidability.L.TM.TMEncoding]
n:22 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
n:22 [binder, in Undecidability.L.Computability.Synthetic]
n:22 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatTCC_to_FlatCC]
n:22 [binder, in Undecidability.Shared.Libs.DLW.Vec.pos]
n:22 [binder, in Undecidability.L.Functions.Size]
n:220 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
n:220 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
n:221 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
n:221 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
n:222 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
N:222 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:223 [binder, in Undecidability.L.Tactics.Extract]
n:223 [binder, in Complexity.L.TM.TMunflatten]
n:223 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
n:223 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:224 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
n:224 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
n:224 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:225 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
n:225 [binder, in Undecidability.TM.Hoare.HoareLogic]
n:225 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:225 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
n:226 [binder, in Undecidability.L.Util.L_facts]
n:226 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
n:226 [binder, in Complexity.L.TM.TMflatComp]
n:226 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:227 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:227 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
n:227 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:228 [binder, in Complexity.L.TM.TMunflatten]
n:228 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:229 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
n:229 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:229 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
n:23 [binder, in Undecidability.Shared.Libs.PSL.FCI]
n:23 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
n:23 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
n:23 [binder, in Undecidability.TM.Single.StepTM]
n:23 [binder, in Complexity.L.AbstractMachines.UnfoldTailRec]
n:23 [binder, in Undecidability.TM.Util.VectorPrelim]
n:23 [binder, in Undecidability.Shared.Libs.PSL.Lists.Position]
n:23 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
n:23 [binder, in Complexity.NP.Clique.FlatUGraph]
n:23 [binder, in Undecidability.L.Tactics.ComputableDemo]
n:23 [binder, in Undecidability.Shared.Libs.DLW.Utils.binomial]
n:23 [binder, in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
n:23 [binder, in Undecidability.TM.Hoare.HoareRegister]
n:23 [binder, in Complexity.Complexity.SpaceBoundsTime]
n:23 [binder, in Complexity.TM.Single.DecodeTapes]
n:23 [binder, in Undecidability.TM.L.Transcode.Enc_to_Boollist]
n:230 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
n:230 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
n:230 [binder, in Undecidability.TM.Hoare.HoareCombinators]
n:230 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:231 [binder, in Undecidability.L.Tactics.Extract]
n:231 [binder, in Complexity.L.TM.TMflatComp]
n:231 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:232 [binder, in Undecidability.L.Util.L_facts]
n:232 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
n:232 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
n:232 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:233 [binder, in Undecidability.L.Prelim.ARS]
n:233 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
n:233 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:233 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:234 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
n:234 [binder, in Undecidability.TM.Hoare.HoareRegister]
n:234 [binder, in Undecidability.TM.Hoare.HoareLogic]
n:234 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:235 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
n:235 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
n:235 [binder, in Complexity.L.TM.TMflatComp]
n:235 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:236 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:236 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
n:236 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:237 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
n:237 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
n:237 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:237 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
n:238 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:238 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
n:238 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:239 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
n:239 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:24 [binder, in Undecidability.TM.Compound.TMTac]
n:24 [binder, in Undecidability.TM.Single.StepTM]
n:24 [binder, in Undecidability.TM.Code.CaseNat]
n:24 [binder, in Undecidability.L.Computability.Enum]
n:24 [binder, in Undecidability.L.Functions.LoopSum]
n:24 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
n:24 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
n:24 [binder, in Undecidability.TM.Code.BinNumbers.EncodeBinNumbers]
n:24 [binder, in Complexity.L.AbstractMachines.Computable.UnivDecTime]
n:24 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
n:24 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
n:24 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
n:24 [binder, in Undecidability.TM.Hoare.HoareRegister]
n:24 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
n:24 [binder, in Undecidability.Shared.Libs.PSL.Vectors.VectorDupfree]
n:24 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
n:24 [binder, in Undecidability.TM.L.CaseCom]
n:24 [binder, in Undecidability.L.Computability.MuRec]
n:24 [binder, in Undecidability.TM.L.HeapInterpreter.LookupTM]
n:24 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler]
n:24 [binder, in Complexity.L.AbstractMachines.Computable.LargestVar]
n:240 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:240 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
n:240 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
n:240 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:241 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
n:241 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
n:241 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:241 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
n:242 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:242 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:243 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
n:243 [binder, in Undecidability.TM.Hoare.HoareCombinators]
n:243 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:244 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
n:244 [binder, in Undecidability.TM.Hoare.HoareLogic]
n:245 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
n:246 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:246 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
n:246 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
n:247 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
n:248 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
N:248 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:249 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
n:25 [binder, in Undecidability.L.Computability.Seval]
n:25 [binder, in Undecidability.TM.Lifting.LiftAlphabet]
n:25 [binder, in Undecidability.L.Tactics.GenEncode]
N:25 [binder, in Complexity.NP.SAT.kSAT]
n:25 [binder, in Undecidability.Shared.Libs.DLW.Utils.quotient]
n:25 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
n:25 [binder, in Undecidability.TM.Code.BinNumbers.NTM]
n:25 [binder, in Undecidability.Shared.Libs.DLW.Utils.crt]
n:25 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Fin]
n:25 [binder, in Undecidability.Shared.Libs.DLW.Wf.wf_incl]
n:25 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_string]
n:25 [binder, in Undecidability.Shared.Libs.DLW.Utils.binomial]
n:25 [binder, in Complexity.L.AbstractMachines.FlatPro.Computable.Compile]
n:25 [binder, in Undecidability.Synthetic.Definitions]
n:25 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
n:25 [binder, in Undecidability.L.TM.TMEncoding]
n:25 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
n:25 [binder, in Undecidability.TM.L.CaseCom]
n:25 [binder, in Undecidability.TM.Hoare.HoareCombinators]
n:250 [binder, in Undecidability.TM.Hoare.HoareRegister]
n:250 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
n:250 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
n:250 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:251 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:251 [binder, in Undecidability.TM.Util.TM_facts]
n:251 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:252 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
n:252 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
n:252 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
n:252 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:253 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
n:253 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:253 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
n:254 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
n:254 [binder, in Undecidability.TM.Util.TM_facts]
n:254 [binder, in Undecidability.TM.Hoare.HoareExamples]
n:254 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:255 [binder, in Undecidability.TM.Hoare.HoareLogic]
n:255 [binder, in Undecidability.TM.Hoare.HoareCombinators]
n:255 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:256 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
n:256 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
n:256 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
n:256 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:257 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
n:258 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
n:258 [binder, in Undecidability.TM.Util.TM_facts]
N:258 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:258 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
n:26 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:26 [binder, in Undecidability.L.Util.L_facts]
n:26 [binder, in Undecidability.TM.Code.List.Nth]
n:26 [binder, in Undecidability.L.Functions.LoopSum]
n:26 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
n:26 [binder, in Undecidability.L.Computability.Seval]
n:26 [binder, in Complexity.L.AbstractMachines.UnfoldHeap]
n:26 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
n:26 [binder, in Complexity.Complexity.ONotationIsAppropriate]
n:26 [binder, in Undecidability.Synthetic.MoreEnumerabilityFacts]
n:26 [binder, in Undecidability.Synthetic.ListEnumerabilityFacts]
n:26 [binder, in Undecidability.Synthetic.Infinite]
n:26 [binder, in Undecidability.L.Computability.MuRec]
n:260 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
n:260 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
n:260 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
n:262 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
n:262 [binder, in Undecidability.TM.Hoare.HoareRegister]
n:263 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
n:263 [binder, in Undecidability.TM.Util.TM_facts]
n:263 [binder, in Undecidability.TM.Hoare.HoareExamples]
n:263 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:264 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
n:265 [binder, in Undecidability.TM.Hoare.HoareLogic]
n:265 [binder, in Undecidability.TM.Hoare.HoareCombinators]
n:266 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
n:266 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
n:266 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
n:266 [binder, in Undecidability.TM.Util.TM_facts]
N:266 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:267 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
n:268 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
n:268 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
n:268 [binder, in Undecidability.TM.Util.TM_facts]
n:268 [binder, in Undecidability.TM.Hoare.HoareExamples]
n:269 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
n:269 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
N:269 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:27 [binder, in Undecidability.Shared.Libs.PSL.Numbers]
n:27 [binder, in Undecidability.TM.Single.StepTM]
n:27 [binder, in Undecidability.L.Computability.Enum]
n:27 [binder, in Complexity.L.AbstractMachines.Computable.Unfolding]
n:27 [binder, in Undecidability.Shared.Libs.PSL.Lists.Position]
n:27 [binder, in Complexity.NP.Clique.FlatUGraph]
n:27 [binder, in Complexity.L.AbstractMachines.Computable.UnivDecTime]
n:27 [binder, in Complexity.L.AbstractMachines.UnfoldHeap]
n:27 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_string]
n:27 [binder, in Undecidability.Shared.Libs.DLW.Utils.binomial]
n:27 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
n:27 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
n:27 [binder, in Undecidability.TM.Hoare.HoareLogic]
n:27 [binder, in Undecidability.Shared.Libs.DLW.Vec.pos]
n:27 [binder, in Undecidability.L.Functions.Size]
n:270 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
n:270 [binder, in Undecidability.L.Tactics.Reflection]
n:271 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:271 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
n:272 [binder, in Complexity.L.TM.TMflatComp]
n:272 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
n:272 [binder, in Undecidability.TM.Hoare.HoareExamples]
n:273 [binder, in Undecidability.TM.Util.TM_facts]
n:274 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
n:274 [binder, in Undecidability.TM.Util.TM_facts]
n:274 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
n:275 [binder, in Complexity.L.TM.TMflatComp]
n:275 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
n:275 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
n:275 [binder, in Undecidability.TM.Hoare.HoareExamples]
n:276 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
n:276 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
n:276 [binder, in Undecidability.TM.Hoare.HoareLogic]
n:277 [binder, in Undecidability.TM.Hoare.HoareRegister]
n:277 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
n:277 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
n:278 [binder, in Complexity.L.TM.TMflatComp]
n:278 [binder, in Undecidability.TM.Hoare.HoareCombinators]
n:279 [binder, in Undecidability.TM.Hoare.HoareExamples]
n:28 [binder, in Undecidability.TM.Code.List.Concat_Repeat]
n:28 [binder, in Complexity.Complexity.ONotation]
n:28 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
n:28 [binder, in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
N:28 [binder, in Complexity.NP.SAT.kSAT]
n:28 [binder, in Undecidability.TM.Util.VectorPrelim]
n:28 [binder, in Undecidability.TM.Code.NatTM]
n:28 [binder, in Complexity.Complexity.ONotationIsAppropriate]
n:28 [binder, in Complexity.L.TM.TMflatten]
n:28 [binder, in Complexity.TM.Single.DecodeTapes]
n:28 [binder, in Undecidability.TM.Compound.WriteString]
n:281 [binder, in Undecidability.TM.Util.TM_facts]
n:282 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
n:283 [binder, in Undecidability.TM.Hoare.HoareLogic]
n:2834 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
n:2838 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
n:2839 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
n:284 [binder, in Undecidability.L.Tactics.Reflection]
n:284 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
n:284 [binder, in Undecidability.TM.Hoare.HoareExamples]
n:2841 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
n:2844 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
n:2847 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
n:285 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
n:2857 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
n:287 [binder, in Undecidability.TM.Util.TM_facts]
n:2870 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
n:2879 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
n:288 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:288 [binder, in Undecidability.TM.Util.TM_facts]
n:288 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
n:2888 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
n:289 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
n:289 [binder, in Undecidability.TM.Hoare.HoareExamples]
N:289 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:2892 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
n:29 [binder, in Complexity.Complexity.ONotation]
n:29 [binder, in Complexity.HierarchyTheorem.TimeHierarchyTheorem]
n:29 [binder, in Undecidability.TM.Single.StepTM]
n:29 [binder, in Complexity.L.AbstractMachines.UnfoldTailRec]
n:29 [binder, in Undecidability.L.Computability.Enum]
n:29 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
n:29 [binder, in Complexity.NP.SAT.kSAT]
n:29 [binder, in Undecidability.Shared.Libs.DLW.Utils.quotient]
n:29 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Fin]
n:29 [binder, in Complexity.NP.TM.TMGenNP]
n:29 [binder, in Undecidability.Shared.Libs.DLW.Utils.binomial]
n:29 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
n:29 [binder, in Complexity.L.AbstractMachines.FlatPro.Computable.Compile]
n:29 [binder, in Undecidability.TM.Hoare.HoareRegister]
n:29 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
n:29 [binder, in Undecidability.Synthetic.Infinite]
n:29 [binder, in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
n:29 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
n:29 [binder, in Complexity.L.AbstractMachines.Computable.LargestVar]
n:290 [binder, in Undecidability.TM.Hoare.HoareRegister]
n:290 [binder, in Undecidability.TM.Hoare.HoareLogic]
n:290 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
n:2903 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
n:291 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
n:291 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
n:2913 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
n:292 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
n:292 [binder, in Undecidability.TM.Hoare.HoareExamples]
N:292 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:2925 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
n:293 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
n:294 [binder, in Undecidability.TM.Util.TM_facts]
n:294 [binder, in Undecidability.TM.Hoare.HoareCombinators]
n:294 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
n:295 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
n:296 [binder, in Undecidability.L.Tactics.Reflection]
n:296 [binder, in Undecidability.TM.Hoare.HoareExamples]
n:297 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
n:298 [binder, in Undecidability.TM.Util.TM_facts]
n:298 [binder, in Undecidability.TM.Hoare.HoareLogic]
n:299 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
n:2993 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
n:3 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
n:3 [binder, in Complexity.HierarchyTheorem.TimeHierarchyTheorem]
n:3 [binder, in Undecidability.TM.Hoare.HoareLegacy]
n:3 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
n:3 [binder, in Undecidability.L.Prelim.LoopSum]
n:3 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.VectorFin]
n:3 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_string]
n:3 [binder, in Undecidability.L.Datatypes.LVector]
n:3 [binder, in Complexity.TM.PrettyBounds.BaseCodeSpace]
n:3 [binder, in Undecidability.L.Datatypes.List.List_nat]
n:3 [binder, in Undecidability.L.Datatypes.List.List_extra]
n:3 [binder, in Undecidability.Shared.Libs.DLW.Utils.sorting]
n:3 [binder, in Undecidability.L.L]
n:3 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
n:3 [binder, in Complexity.NP.TM.M_multi2mono]
n:3 [binder, in Undecidability.Synthetic.ListEnumerabilityFacts]
n:3 [binder, in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
n:3 [binder, in Undecidability.L.AbstractMachines.FlatPro.ProgramsDef]
n:3 [binder, in Undecidability.L.Computability.MuRec]
N:3 [binder, in Complexity.NP.SAT.kSAT_to_SAT]
n:3 [binder, in Undecidability.Shared.Libs.DLW.Vec.pos]
n:3 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
n:30 [binder, in Undecidability.Shared.Libs.PSL.Numbers]
n:30 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
n:30 [binder, in Complexity.HierarchyTheorem.TimeHierarchyTheorem]
n:30 [binder, in Undecidability.Shared.Libs.DLW.Utils.prime]
n:30 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
n:30 [binder, in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
n:30 [binder, in Undecidability.TM.Code.List.Length]
n:30 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
n:30 [binder, in Complexity.L.AbstractMachines.Computable.UnivDecTime]
n:30 [binder, in Undecidability.Shared.Libs.DLW.Utils.crt]
n:30 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
n:30 [binder, in Complexity.Complexity.ONotationIsAppropriate]
n:30 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
n:30 [binder, in Undecidability.L.TM.TMEncoding]
n:30 [binder, in Undecidability.Shared.Libs.PSL.Vectors.VectorDupfree]
n:30 [binder, in Undecidability.TM.Lifting.LiftTapes]
n:30 [binder, in Undecidability.Synthetic.Infinite]
n:30 [binder, in Undecidability.L.Computability.MuRec]
N:30 [binder, in Complexity.NP.SAT.SAT]
n:300 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
n:301 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
n:301 [binder, in Undecidability.L.Tactics.Reflection]
n:301 [binder, in Undecidability.TM.Hoare.HoareExamples]
n:302 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
n:302 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
N:302 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:3027 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
n:303 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
n:304 [binder, in Undecidability.TM.Hoare.HoareRegister]
n:304 [binder, in Undecidability.TM.Util.TM_facts]
n:305 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:305 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
n:305 [binder, in Undecidability.TM.Single.StepTM]
n:305 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
n:306 [binder, in Undecidability.L.Tactics.Reflection]
n:306 [binder, in Undecidability.TM.Hoare.HoareLogic]
n:306 [binder, in Undecidability.TM.Hoare.HoareExamples]
n:307 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
N:307 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:309 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
n:3096 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
n:31 [binder, in Undecidability.TM.Code.List.Concat_Repeat]
n:31 [binder, in Undecidability.TM.L.CompilerBoolFuns.NaryApp]
n:31 [binder, in Complexity.HierarchyTheorem.TimeHierarchyTheorem]
n:31 [binder, in Undecidability.Shared.Libs.DLW.Utils.prime]
n:31 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
n:31 [binder, in Undecidability.L.Computability.Seval]
N:31 [binder, in Complexity.NP.SAT.kSAT]
n:31 [binder, in Undecidability.Synthetic.EnumerabilityFacts]
n:31 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
n:31 [binder, in Undecidability.Shared.Libs.DLW.Utils.crt]
n:31 [binder, in Undecidability.Shared.Libs.DLW.Utils.binomial]
n:31 [binder, in Undecidability.L.L]
n:31 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
n:31 [binder, in Undecidability.Shared.Libs.DLW.Vec.pos]
n:31 [binder, in Undecidability.TM.Compound.WriteString]
n:310 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
n:310 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
n:310 [binder, in Undecidability.TM.Hoare.HoareRegister]
n:310 [binder, in Undecidability.TM.Hoare.HoareExamples]
n:3100 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
n:311 [binder, in Undecidability.L.Tactics.Reflection]
n:311 [binder, in Undecidability.TM.Util.TM_facts]
n:311 [binder, in Undecidability.TM.Hoare.HoareCombinators]
n:311 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
N:312 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:313 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
n:314 [binder, in Undecidability.TM.Hoare.HoareExamples]
n:314 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:315 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
n:315 [binder, in Undecidability.TM.Hoare.HoareLogic]
n:315 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:317 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:317 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
n:317 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
n:317 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
n:317 [binder, in Undecidability.TM.Hoare.HoareRegister]
n:317 [binder, in Undecidability.L.Tactics.Reflection]
n:317 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
n:318 [binder, in Undecidability.TM.Util.TM_facts]
n:318 [binder, in Undecidability.TM.Hoare.HoareExamples]
N:318 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:32 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:32 [binder, in Complexity.HierarchyTheorem.TimeHierarchyTheorem]
n:32 [binder, in Undecidability.Shared.Libs.DLW.Utils.prime]
n:32 [binder, in Undecidability.L.Computability.Enum]
n:32 [binder, in Complexity.NP.SAT.kSAT]
n:32 [binder, in Undecidability.Synthetic.EnumerabilityFacts]
n:32 [binder, in Undecidability.Shared.Libs.DLW.Utils.quotient]
n:32 [binder, in Undecidability.Shared.Libs.DLW.Utils.binomial]
n:32 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
n:32 [binder, in Complexity.Complexity.ONotationIsAppropriate]
n:32 [binder, in Complexity.L.TM.TMunflatten]
n:32 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
n:32 [binder, in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
n:32 [binder, in Undecidability.L.Functions.Size]
n:3201 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
n:3204 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
n:321 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
N:321 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:322 [binder, in Undecidability.L.Tactics.Reflection]
n:322 [binder, in Undecidability.TM.Hoare.HoareCombinators]
n:322 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:323 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
n:323 [binder, in Undecidability.TM.Hoare.HoareExamples]
n:324 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
n:324 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
n:324 [binder, in Undecidability.TM.Util.TM_facts]
n:325 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
n:325 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
n:325 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:326 [binder, in Undecidability.TM.Hoare.HoareLogic]
n:327 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
n:327 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
n:327 [binder, in Undecidability.TM.Hoare.HoareRegister]
n:328 [binder, in Undecidability.TM.Hoare.HoareExamples]
n:329 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
n:33 [binder, in Complexity.HierarchyTheorem.TimeHierarchyTheorem]
n:33 [binder, in Undecidability.Synthetic.EnumerabilityFacts]
n:33 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Fin]
n:33 [binder, in Undecidability.Shared.Libs.DLW.Utils.sorting]
n:33 [binder, in Complexity.L.AbstractMachines.FlatPro.Computable.Compile]
n:33 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
n:33 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
n:33 [binder, in Undecidability.Shared.Libs.PSL.Vectors.VectorDupfree]
n:33 [binder, in Undecidability.TM.Lifting.LiftTapes]
n:33 [binder, in Undecidability.Synthetic.Infinite]
n:33 [binder, in Undecidability.TM.Hoare.HoareLogic]
n:33 [binder, in Undecidability.TM.Single.EncodeTapes]
n:330 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
n:330 [binder, in Undecidability.TM.Util.TM_facts]
n:331 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
n:332 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
n:332 [binder, in Undecidability.TM.Hoare.HoareExamples]
n:332 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
n:332 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:333 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
n:333 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
n:334 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
n:336 [binder, in Undecidability.TM.Hoare.HoareExamples]
n:337 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:337 [binder, in Undecidability.TM.Hoare.HoareRegister]
n:337 [binder, in Undecidability.TM.Util.TM_facts]
n:338 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
n:338 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
n:338 [binder, in Undecidability.TM.Hoare.HoareLogic]
n:338 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
n:34 [binder, in Undecidability.TM.L.CompilerBoolFuns.NaryApp]
n:34 [binder, in Complexity.Complexity.ONotation]
n:34 [binder, in Complexity.HierarchyTheorem.TimeHierarchyTheorem]
n:34 [binder, in Undecidability.TM.Single.StepTM]
n:34 [binder, in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
n:34 [binder, in Undecidability.L.Computability.Seval]
n:34 [binder, in Undecidability.TM.Util.VectorPrelim]
n:34 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
n:34 [binder, in Undecidability.L.Datatypes.LVector]
n:34 [binder, in Complexity.Complexity.ONotationIsAppropriate]
n:34 [binder, in Undecidability.TM.Hoare.HoareRegister]
n:34 [binder, in Undecidability.Synthetic.ListEnumerabilityFacts]
n:34 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
n:34 [binder, in Complexity.L.AbstractMachines.Computable.LargestVar]
n:341 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
n:341 [binder, in Undecidability.TM.Hoare.HoareExamples]
n:342 [binder, in Undecidability.TM.Util.TM_facts]
n:344 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
n:344 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
n:345 [binder, in Undecidability.TM.Hoare.HoareRegister]
n:346 [binder, in Undecidability.TM.Hoare.HoareExamples]
N:348 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:349 [binder, in Undecidability.TM.Hoare.HoareLogic]
n:35 [binder, in Undecidability.TM.Code.List.Concat_Repeat]
n:35 [binder, in Undecidability.Shared.Libs.PSL.FCI]
n:35 [binder, in Complexity.Complexity.ONotation]
n:35 [binder, in Complexity.HierarchyTheorem.TimeHierarchyTheorem]
n:35 [binder, in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
n:35 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
n:35 [binder, in Undecidability.TM.Code.NatTM]
n:35 [binder, in Undecidability.Shared.Libs.DLW.Utils.quotient]
n:35 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
n:35 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
n:35 [binder, in Undecidability.L.TM.TMEncoding]
n:35 [binder, in Undecidability.L.Datatypes.LNat]
n:35 [binder, in Undecidability.TM.Hoare.HoareCombinators]
n:35 [binder, in Undecidability.TM.L.HeapInterpreter.LookupTM]
n:350 [binder, in Undecidability.TM.Util.TM_facts]
n:351 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
n:351 [binder, in Undecidability.TM.Hoare.HoareExamples]
n:351 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:353 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
n:355 [binder, in Undecidability.TM.Hoare.HoareRegister]
n:355 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:356 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
n:357 [binder, in Undecidability.TM.Hoare.HoareExamples]
n:36 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:36 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
n:36 [binder, in Undecidability.TM.Single.StepTM]
n:36 [binder, in Undecidability.L.Tactics.Extract]
n:36 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
n:36 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
n:36 [binder, in Undecidability.Synthetic.MoreEnumerabilityFacts]
n:36 [binder, in Undecidability.L.Functions.UnboundIteration]
n:36 [binder, in Undecidability.Synthetic.ListEnumerabilityFacts]
N:36 [binder, in Complexity.NP.SAT.SAT]
n:36 [binder, in Undecidability.Shared.Libs.DLW.Vec.pos]
n:36 [binder, in Undecidability.TM.Single.EncodeTapes]
n:36 [binder, in Undecidability.L.Prelim.MoreList]
n:360 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:362 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:362 [binder, in Undecidability.TM.Hoare.HoareLogic]
n:363 [binder, in Undecidability.TM.Hoare.HoareCombinators]
n:363 [binder, in Undecidability.TM.Hoare.HoareExamples]
n:365 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:366 [binder, in Undecidability.TM.Hoare.HoareRegister]
n:367 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
n:368 [binder, in Undecidability.TM.Hoare.HoareExamples]
n:3693 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
n:3694 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
n:37 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
n:37 [binder, in Complexity.HierarchyTheorem.TimeHierarchyTheorem]
n:37 [binder, in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
n:37 [binder, in Undecidability.L.Computability.Seval]
n:37 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Fin]
n:37 [binder, in Complexity.L.AbstractMachines.FlatPro.Computable.Compile]
n:37 [binder, in Complexity.L.TM.TMflat]
n:37 [binder, in Undecidability.TM.TM]
n:37 [binder, in Undecidability.Synthetic.MoreEnumerabilityFacts]
n:37 [binder, in Undecidability.Synthetic.ListEnumerabilityFacts]
n:37 [binder, in Complexity.TM.Single.DecodeTapes]
n:37 [binder, in Undecidability.TM.Lifting.LiftTapes]
N:37 [binder, in Complexity.NP.SAT.SAT]
n:37 [binder, in Undecidability.L.Functions.Size]
n:370 [binder, in Undecidability.TM.Util.TM_facts]
n:370 [binder, in Undecidability.TM.Hoare.HoareLogic]
n:373 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
n:373 [binder, in Undecidability.TM.Util.TM_facts]
n:373 [binder, in Undecidability.TM.Hoare.HoareExamples]
n:374 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
n:378 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
n:378 [binder, in Undecidability.TM.Hoare.HoareLogic]
n:378 [binder, in Undecidability.TM.Hoare.HoareExamples]
n:38 [binder, in Undecidability.TM.Code.List.Concat_Repeat]
n:38 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
n:38 [binder, in Undecidability.Synthetic.EnumerabilityFacts]
n:38 [binder, in Undecidability.Shared.Libs.DLW.Utils.quotient]
n:38 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
n:38 [binder, in Undecidability.Shared.Libs.DLW.Utils.sorting]
n:38 [binder, in Undecidability.TM.Hoare.HoareRegister]
n:38 [binder, in Complexity.L.TM.TMflatFun]
n:38 [binder, in Undecidability.Shared.Libs.PSL.Vectors.VectorDupfree]
n:38 [binder, in Undecidability.TM.Single.EncodeTapes]
n:380 [binder, in Undecidability.TM.Hoare.HoareRegister]
n:380 [binder, in Undecidability.TM.Hoare.HoareCombinators]
n:382 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
n:382 [binder, in Undecidability.TM.Util.TM_facts]
n:384 [binder, in Undecidability.TM.Hoare.HoareExamples]
n:385 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:386 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
n:387 [binder, in Undecidability.TM.Util.TM_facts]
n:387 [binder, in Undecidability.TM.Hoare.HoareLogic]
n:389 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:389 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
n:39 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
n:39 [binder, in Undecidability.TM.Single.StepTM]
n:39 [binder, in Undecidability.TM.Code.List.Nth]
n:39 [binder, in Undecidability.L.Computability.Enum]
n:39 [binder, in Undecidability.TM.Util.VectorPrelim]
n:39 [binder, in Undecidability.Synthetic.EnumerabilityFacts]
n:39 [binder, in Complexity.NP.TM.TMGenNP]
n:39 [binder, in Complexity.L.TM.TMflatComp]
n:39 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
n:39 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
n:39 [binder, in Complexity.L.TM.TMunflatten]
n:39 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TM_single]
n:39 [binder, in Complexity.NP.TM.M_multi2mono]
n:39 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
n:39 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
n:39 [binder, in Undecidability.TM.Hoare.HoareLogic]
n:39 [binder, in Undecidability.L.Datatypes.LNat]
n:39 [binder, in Undecidability.Shared.Libs.DLW.Vec.pos]
n:39 [binder, in Undecidability.Synthetic.ReducibilityFacts]
n:39 [binder, in Complexity.L.AbstractMachines.Computable.LargestVar]
n:390 [binder, in Undecidability.TM.Hoare.HoareExamples]
n:393 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
n:394 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
n:395 [binder, in Undecidability.TM.Hoare.HoareRegister]
n:395 [binder, in Undecidability.TM.Hoare.HoareExamples]
n:396 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
n:396 [binder, in Undecidability.TM.Hoare.HoareLogic]
n:399 [binder, in Undecidability.TM.Util.TM_facts]
n:399 [binder, in Undecidability.TM.Hoare.HoareExamples]
n:4 [binder, in Undecidability.L.Functions.Eval]
n:4 [binder, in Complexity.L.Datatypes.LBinNums]
n:4 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
n:4 [binder, in Undecidability.Shared.Libs.DLW.Utils.prime]
n:4 [binder, in Undecidability.Synthetic.SemiDecidabilityFacts]
n:4 [binder, in Undecidability.TM.PrettyBounds.SizeBounds]
n:4 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
N:4 [binder, in Complexity.NP.SAT.kSAT]
n:4 [binder, in Undecidability.Synthetic.EnumerabilityFacts]
n:4 [binder, in Complexity.NP.Clique.FlatUGraph]
n:4 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.VectorFin]
N:4 [binder, in Undecidability.Shared.FinTypeForallExists]
N:4 [binder, in Complexity.NP.SAT.SAT_inNP]
n:4 [binder, in Undecidability.Shared.Libs.DLW.Utils.binomial]
n:4 [binder, in Undecidability.Shared.Libs.DLW.Utils.sorting]
n:4 [binder, in Complexity.Complexity.ONotationIsAppropriate]
n:4 [binder, in Complexity.L.TM.TMunflatten]
n:4 [binder, in Undecidability.L.Tactics.Lbeta]
n:4 [binder, in Complexity.L.TM.TMflatFun]
n:4 [binder, in Complexity.NP.Clique.kSAT_to_Clique]
n:4 [binder, in Undecidability.TM.Hoare.HoareLogic]
n:4 [binder, in Complexity.NP.SAT.kSAT_to_SAT]
n:4 [binder, in Undecidability.L.Computability.Por]
n:4 [binder, in Undecidability.L.Prelim.MoreList]
n:40 [binder, in Undecidability.L.Computability.Seval]
n:40 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
n:40 [binder, in Undecidability.TM.Code.List.Length]
n:40 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
n:40 [binder, in Complexity.NP.Clique.FlatUGraph]
n:40 [binder, in Undecidability.Shared.Libs.DLW.Utils.crt]
n:40 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
n:40 [binder, in Undecidability.L.Computability.Synthetic]
n:40 [binder, in Undecidability.Synthetic.Infinite]
n:40 [binder, in Undecidability.TM.L.HeapInterpreter.LookupTM]
n:40 [binder, in Undecidability.L.Prelim.MoreList]
n:401 [binder, in Undecidability.TM.Hoare.HoareExamples]
n:403 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:403 [binder, in Undecidability.TM.Hoare.HoareExamples]
n:405 [binder, in Undecidability.TM.Util.TM_facts]
n:405 [binder, in Undecidability.TM.Hoare.HoareExamples]
n:408 [binder, in Undecidability.TM.Hoare.HoareExamples]
n:409 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:41 [binder, in Undecidability.Shared.Libs.PSL.Numbers]
n:41 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:41 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
n:41 [binder, in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
n:41 [binder, in Undecidability.Shared.Libs.PSL.Lists.Position]
n:41 [binder, in Undecidability.Shared.Libs.DLW.Utils.sorting]
n:41 [binder, in Complexity.L.AbstractMachines.FlatPro.Computable.Compile]
n:41 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
n:41 [binder, in Undecidability.L.Functions.UnboundIteration]
n:41 [binder, in Complexity.TM.Single.DecodeTapes]
n:41 [binder, in Undecidability.L.TM.TMEncoding]
n:41 [binder, in Undecidability.Shared.Libs.PSL.Vectors.VectorDupfree]
n:41 [binder, in Undecidability.Shared.Libs.DLW.Code.subcode]
n:41 [binder, in Undecidability.L.Prelim.MoreList]
n:410 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
n:410 [binder, in Undecidability.TM.Hoare.HoareExamples]
n:411 [binder, in Undecidability.TM.Util.TM_facts]
n:413 [binder, in Undecidability.TM.Hoare.HoareRegister]
n:414 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
n:417 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:42 [binder, in Undecidability.L.Util.L_facts]
n:42 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
n:42 [binder, in Undecidability.Shared.Libs.DLW.Utils.prime]
n:42 [binder, in Undecidability.TM.Single.StepTM]
N:42 [binder, in Complexity.NP.SAT.SAT_inNP]
n:42 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
n:42 [binder, in Undecidability.TM.TM]
n:42 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
n:42 [binder, in Undecidability.Synthetic.Infinite]
n:42 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
n:42 [binder, in Undecidability.L.Functions.Size]
n:422 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
n:425 [binder, in Undecidability.TM.Hoare.HoareCombinators]
n:429 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:43 [binder, in Undecidability.Shared.Libs.PSL.Numbers]
n:43 [binder, in Complexity.Complexity.ONotation]
n:43 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
n:43 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
n:43 [binder, in Complexity.NP.Clique.FlatUGraph]
n:43 [binder, in Complexity.L.TM.TMunflatten]
n:43 [binder, in Complexity.NP.SAT.FSAT.FSAT]
n:43 [binder, in Undecidability.TM.Hoare.HoareRegister]
n:43 [binder, in Undecidability.Synthetic.MoreEnumerabilityFacts]
n:43 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
n:43 [binder, in Undecidability.Synthetic.ListEnumerabilityFacts]
n:43 [binder, in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
n:43 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
n:432 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:436 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:44 [binder, in Undecidability.TM.Code.List.Concat_Repeat]
n:44 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
n:44 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
n:44 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
n:44 [binder, in Undecidability.Shared.Libs.DLW.Utils.quotient]
N:44 [binder, in Complexity.NP.SAT.SAT_inNP]
n:44 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
n:44 [binder, in Undecidability.Synthetic.MoreEnumerabilityFacts]
n:44 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TM_single]
n:44 [binder, in Undecidability.Synthetic.ListEnumerabilityFacts]
n:44 [binder, in Undecidability.Shared.Libs.PSL.Vectors.VectorDupfree]
n:44 [binder, in Undecidability.Synthetic.Infinite]
n:44 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
n:44 [binder, in Undecidability.Shared.Libs.DLW.Vec.pos]
n:44 [binder, in Complexity.L.AbstractMachines.Computable.LargestVar]
n:44 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:440 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:444 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:444 [binder, in Undecidability.TM.Hoare.HoareCombinators]
n:445 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
n:446 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:45 [binder, in Undecidability.TM.Single.StepTM]
n:45 [binder, in Undecidability.L.Computability.Seval]
n:45 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
n:45 [binder, in Undecidability.TM.Util.VectorPrelim]
n:45 [binder, in Complexity.L.AbstractMachines.FlatPro.Computable.Compile]
n:45 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
n:45 [binder, in Complexity.Complexity.Definitions]
n:45 [binder, in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
n:45 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
n:45 [binder, in Undecidability.Shared.Libs.DLW.Code.subcode]
n:45 [binder, in Undecidability.L.Prelim.MoreList]
n:454 [binder, in Undecidability.TM.Hoare.HoareRegister]
n:46 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
n:46 [binder, in Undecidability.TM.Code.NatTM]
N:46 [binder, in Complexity.NP.SAT.SAT_inNP]
n:46 [binder, in Complexity.L.TM.TMunflatten]
n:46 [binder, in Complexity.NP.SAT.FSAT.FSAT]
n:46 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
n:46 [binder, in Undecidability.Synthetic.Infinite]
n:46 [binder, in Complexity.Complexity.Definitions]
n:46 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
n:46 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
n:46 [binder, in Complexity.NP.TM.LM_to_mTM]
n:460 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
n:463 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
n:47 [binder, in Undecidability.Shared.Libs.PSL.Numbers]
n:47 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
n:47 [binder, in Undecidability.Shared.Libs.DLW.Utils.crt]
n:47 [binder, in Undecidability.L.Functions.UnboundIteration]
n:47 [binder, in Complexity.L.TM.TMflatFun]
n:47 [binder, in Undecidability.Synthetic.ListEnumerabilityFacts]
n:47 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
n:47 [binder, in Complexity.TM.Single.DecodeTapes]
n:47 [binder, in Undecidability.Shared.Libs.PSL.Vectors.VectorDupfree]
n:47 [binder, in Undecidability.TM.Lifting.LiftTapes]
n:47 [binder, in Complexity.Complexity.Definitions]
n:47 [binder, in Undecidability.TM.Hoare.HoareCombinators]
N:47 [binder, in Complexity.NP.SAT.SAT]
n:47 [binder, in Complexity.NP.TM.LM_to_mTM]
n:47 [binder, in Undecidability.L.Functions.Size]
n:48 [binder, in Undecidability.TM.L.CompilerBoolFuns.NaryApp]
n:48 [binder, in Complexity.Complexity.ONotation]
n:48 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
n:48 [binder, in Undecidability.TM.Code.List.Nth]
n:48 [binder, in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
n:48 [binder, in Undecidability.L.Computability.Seval]
n:48 [binder, in Undecidability.L.Tactics.GenEncode]
n:48 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
n:48 [binder, in Undecidability.Shared.Libs.DLW.Utils.quotient]
n:48 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
n:48 [binder, in Undecidability.Shared.Libs.DLW.Utils.sorting]
n:48 [binder, in Undecidability.Synthetic.ListEnumerabilityFacts]
n:48 [binder, in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
n:48 [binder, in Undecidability.TM.Hoare.HoareLogic]
n:48 [binder, in Undecidability.TM.L.HeapInterpreter.LookupTM]
n:48 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
n:48 [binder, in Complexity.NP.TM.LM_to_mTM]
n:48 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:48 [binder, in Undecidability.TM.Single.EncodeTapes]
n:480 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:484 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:49 [binder, in Undecidability.L.Computability.Seval]
n:49 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
n:49 [binder, in Undecidability.Synthetic.EnumerabilityFacts]
n:49 [binder, in Undecidability.Shared.Libs.DLW.Utils.quotient]
N:49 [binder, in Complexity.NP.SAT.SAT_inNP]
n:49 [binder, in Complexity.L.TM.TMflat]
n:49 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
n:49 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
n:49 [binder, in Undecidability.L.Computability.Synthetic]
n:49 [binder, in Undecidability.Synthetic.Infinite]
n:49 [binder, in Complexity.L.AbstractMachines.Computable.LargestVar]
n:49 [binder, in Complexity.NP.TM.LM_to_mTM]
n:5 [binder, in Complexity.Complexity.ONotation]
n:5 [binder, in Complexity.L.Datatypes.LBinNums]
n:5 [binder, in Undecidability.L.Util.L_facts]
n:5 [binder, in Complexity.HierarchyTheorem.TimeHierarchyTheorem]
n:5 [binder, in Undecidability.Shared.Libs.DLW.Utils.prime]
n:5 [binder, in Undecidability.TM.Single.StepTM]
n:5 [binder, in Undecidability.L.Computability.Enum]
n:5 [binder, in Undecidability.L.Computability.Seval]
n:5 [binder, in Undecidability.Shared.Libs.DLW.Wf.wf_incl]
n:5 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_string]
n:5 [binder, in Undecidability.Shared.Libs.DLW.Utils.binomial]
n:5 [binder, in Undecidability.L.TM.TapeFuns]
n:5 [binder, in Undecidability.Shared.Libs.DLW.Utils.sorting]
n:5 [binder, in Complexity.Complexity.SpaceBoundsTime]
n:5 [binder, in Undecidability.L.Functions.EnumInt]
n:5 [binder, in Undecidability.Shared.Libs.PSL.Vectors.VectorDupfree]
N:5 [binder, in Complexity.NP.Clique.kSAT_to_Clique]
n:5 [binder, in Undecidability.TM.Hoare.HoareCombinators]
n:5 [binder, in Complexity.NP.SAT.kSAT_to_SAT]
n:5 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler]
n:50 [binder, in Undecidability.TM.Code.List.Concat_Repeat]
n:50 [binder, in Undecidability.TM.Code.NatTM]
n:50 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
n:50 [binder, in Undecidability.TM.TM]
n:50 [binder, in Undecidability.Shared.Libs.PSL.Vectors.VectorDupfree]
n:50 [binder, in Undecidability.L.Computability.Synthetic]
n:50 [binder, in Undecidability.TM.Util.TM_facts]
n:50 [binder, in Complexity.Complexity.Definitions]
n:50 [binder, in Undecidability.Shared.Libs.DLW.Code.subcode]
n:50 [binder, in Undecidability.Shared.Libs.DLW.Vec.pos]
N:50 [binder, in Complexity.NP.Clique.kSAT_to_FlatClique]
n:51 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
n:51 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
n:51 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
n:51 [binder, in Complexity.TM.PrettyBounds.BaseCodeSpace]
N:51 [binder, in Complexity.NP.SAT.SAT_inNP]
n:51 [binder, in Undecidability.TM.Hoare.HoareRegister]
n:51 [binder, in Complexity.L.TM.TMflatFun]
n:51 [binder, in Complexity.Complexity.Definitions]
n:51 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:52 [binder, in Undecidability.TM.L.CompilerBoolFuns.NaryApp]
n:52 [binder, in Complexity.Complexity.ONotation]
n:52 [binder, in Undecidability.TM.Code.BinNumbers.PosDefinitions]
n:52 [binder, in Undecidability.L.Computability.Enum]
n:52 [binder, in Undecidability.L.Computability.Seval]
n:52 [binder, in Undecidability.TM.Code.NatTM]
n:52 [binder, in Undecidability.Shared.Libs.DLW.Utils.crt]
n:52 [binder, in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
n:52 [binder, in Undecidability.TM.TM]
n:52 [binder, in Undecidability.Synthetic.ListEnumerabilityFacts]
n:52 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
n:52 [binder, in Undecidability.TM.Lifting.LiftTapes]
n:52 [binder, in Complexity.Complexity.Definitions]
n:52 [binder, in Undecidability.Shared.Libs.DLW.Vec.pos]
N:52 [binder, in Complexity.NP.Clique.kSAT_to_FlatClique]
n:53 [binder, in Undecidability.Shared.Libs.PSL.Numbers]
n:53 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
n:53 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
n:53 [binder, in Undecidability.TM.Code.List.Nth]
n:53 [binder, in Undecidability.TM.Code.List.Length]
n:53 [binder, in Undecidability.Shared.Libs.DLW.Utils.crt]
N:53 [binder, in Complexity.NP.SAT.SAT_inNP]
n:53 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
n:53 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
n:53 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
n:53 [binder, in Undecidability.Synthetic.ListEnumerabilityFacts]
n:53 [binder, in Undecidability.TM.Util.TM_facts]
n:53 [binder, in Undecidability.TM.Single.EncodeTapes]
n:54 [binder, in Undecidability.Shared.Libs.DLW.Utils.quotient]
n:54 [binder, in Complexity.L.TM.TMunflatten]
n:54 [binder, in Complexity.L.TM.TMflat]
n:54 [binder, in Complexity.L.TM.TMflatten]
n:54 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
n:54 [binder, in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
n:54 [binder, in Undecidability.Synthetic.Infinite]
n:54 [binder, in Undecidability.L.Datatypes.LNat]
n:54 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
n:54 [binder, in Undecidability.Shared.Libs.DLW.Code.subcode]
n:54 [binder, in Undecidability.Shared.Libs.DLW.Vec.pos]
N:54 [binder, in Complexity.NP.Clique.kSAT_to_FlatClique]
n:54 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:55 [binder, in Undecidability.TM.Code.BinNumbers.PosMultTM]
n:55 [binder, in Undecidability.TM.Single.StepTM]
n:55 [binder, in Undecidability.L.Tactics.GenEncode]
n:55 [binder, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
N:55 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
n:55 [binder, in Undecidability.Shared.Libs.DLW.Utils.sorting]
n:55 [binder, in Undecidability.Synthetic.Infinite]
n:55 [binder, in Undecidability.TM.Hoare.HoareLogic]
n:55 [binder, in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
n:56 [binder, in Undecidability.TM.Code.List.Concat_Repeat]
n:56 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
n:56 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
n:56 [binder, in Undecidability.L.Computability.Enum]
n:56 [binder, in Undecidability.TM.Code.NatTM]
n:56 [binder, in Undecidability.TM.TM]
n:56 [binder, in Complexity.TM.Single.DecodeTapes]
n:56 [binder, in Undecidability.Shared.Libs.PSL.Vectors.VectorDupfree]
n:56 [binder, in Undecidability.L.Datatypes.LNat]
n:56 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
N:56 [binder, in Complexity.NP.Clique.kSAT_to_FlatClique]
n:56 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:567 [binder, in Complexity.NP.TM.LM_to_mTM]
n:57 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:57 [binder, in Undecidability.TM.Code.List.Nth]
n:57 [binder, in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
n:57 [binder, in Undecidability.Shared.Libs.DLW.Utils.quotient]
N:57 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
n:57 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
n:57 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
n:57 [binder, in Undecidability.TM.Hoare.HoareRegister]
n:57 [binder, in Undecidability.TM.Lifting.LiftTapes]
n:57 [binder, in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
n:57 [binder, in Undecidability.Shared.Libs.DLW.Vec.pos]
n:57 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
n:57 [binder, in Complexity.NP.Clique.kSAT_to_FlatClique]
n:573 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:577 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:58 [binder, in Undecidability.Shared.Libs.PSL.Numbers]
n:58 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
n:58 [binder, in Undecidability.TM.Code.List.Concat_Repeat]
n:58 [binder, in Undecidability.TM.L.CompilerBoolFuns.NaryApp]
n:58 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:58 [binder, in Undecidability.Shared.Libs.DLW.Utils.prime]
n:58 [binder, in Undecidability.TM.Single.StepTM]
n:58 [binder, in Undecidability.TM.Code.BinNumbers.PosDefinitions]
n:58 [binder, in Complexity.TM.Code.Decode]
n:58 [binder, in Undecidability.L.Tactics.GenEncode]
n:58 [binder, in Undecidability.Shared.Libs.DLW.Utils.sorting]
n:58 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
n:58 [binder, in Undecidability.TM.Util.TM_facts]
n:58 [binder, in Undecidability.L.Datatypes.LNat]
n:58 [binder, in Undecidability.TM.Hoare.HoareCombinators]
n:59 [binder, in Undecidability.Shared.Libs.PSL.Numbers]
n:59 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
n:59 [binder, in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
N:59 [binder, in Complexity.NP.SAT.SAT_inNP]
n:59 [binder, in Complexity.L.TM.TMflat]
n:59 [binder, in Undecidability.L.Functions.UnboundIteration]
n:59 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
n:59 [binder, in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
n:59 [binder, in Undecidability.TM.L.HeapInterpreter.LookupTM]
n:59 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
N:59 [binder, in Complexity.NP.Clique.kSAT_to_FlatClique]
n:59 [binder, in Undecidability.TM.Single.EncodeTapes]
n:6 [binder, in Complexity.NP.SAT.CookLevin]
n:6 [binder, in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
n:6 [binder, in Undecidability.TM.L.CompilerBoolFuns.NaryApp]
n:6 [binder, in Complexity.L.Datatypes.LBinNums]
n:6 [binder, in Complexity.HierarchyTheorem.TimeHierarchyTheorem]
n:6 [binder, in Undecidability.Synthetic.SemiDecidabilityFacts]
n:6 [binder, in Undecidability.L.Tactics.Extract]
n:6 [binder, in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
n:6 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
n:6 [binder, in Undecidability.Shared.Libs.DLW.Utils.quotient]
n:6 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
n:6 [binder, in Undecidability.TM.Code.BinNumbers.NTM]
n:6 [binder, in Undecidability.Shared.Libs.DLW.Code.compiler]
n:6 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.VectorFin]
n:6 [binder, in Undecidability.Shared.Libs.DLW.Utils.binomial]
n:6 [binder, in Undecidability.Shared.embed_nat]
n:6 [binder, in Undecidability.Shared.Libs.DLW.Utils.sorting]
n:6 [binder, in Complexity.Complexity.ONotationIsAppropriate]
n:6 [binder, in Undecidability.TM.Util.TM_facts]
n:6 [binder, in Undecidability.L.Computability.MuRec]
n:6 [binder, in Undecidability.TM.L.HeapInterpreter.LookupTM]
n:6 [binder, in Complexity.NP.SAT.kSAT_to_SAT]
n:6 [binder, in Undecidability.L.Prelim.MoreList]
n:60 [binder, in Undecidability.Shared.Libs.PSL.Numbers]
n:60 [binder, in Complexity.L.TM.TMflatFun]
n:60 [binder, in Undecidability.L.Datatypes.LNat]
n:60 [binder, in Undecidability.Shared.Libs.DLW.Vec.pos]
n:61 [binder, in Undecidability.L.Prelim.ARS]
n:61 [binder, in Undecidability.TM.Single.StepTM]
n:61 [binder, in Undecidability.TM.Code.List.Nth]
n:61 [binder, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
n:61 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
n:61 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
n:61 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
n:61 [binder, in Undecidability.L.Functions.UnboundIteration]
n:61 [binder, in Undecidability.Synthetic.ListEnumerabilityFacts]
n:61 [binder, in Undecidability.L.Datatypes.LNat]
n:62 [binder, in Undecidability.TM.Code.List.Concat_Repeat]
n:62 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
n:62 [binder, in Undecidability.L.Util.L_facts]
n:62 [binder, in Undecidability.L.Computability.Enum]
n:62 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
n:62 [binder, in Undecidability.TM.Lifting.LiftTapes]
n:62 [binder, in Undecidability.TM.Hoare.HoareMult]
n:62 [binder, in Undecidability.TM.Hoare.HoareLogic]
n:62 [binder, in Undecidability.L.Datatypes.LNat]
n:62 [binder, in Complexity.NP.TM.LM_to_mTM]
n:624 [binder, in Complexity.NP.TM.LM_to_mTM]
n:625 [binder, in Complexity.NP.TM.LM_to_mTM]
n:63 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
n:63 [binder, in Undecidability.L.Computability.Enum]
n:63 [binder, in Undecidability.TM.Code.NatTM]
N:63 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
n:63 [binder, in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
n:63 [binder, in Undecidability.L.Functions.UnboundIteration]
n:63 [binder, in Undecidability.Shared.Libs.DLW.Vec.pos]
n:63 [binder, in Complexity.NP.TM.LM_to_mTM]
n:63 [binder, in Undecidability.TM.Single.EncodeTapes]
n:64 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:64 [binder, in Undecidability.TM.Single.StepTM]
n:64 [binder, in Undecidability.TM.Code.BinNumbers.PosDefinitions]
n:64 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
n:64 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
n:64 [binder, in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
n:64 [binder, in Undecidability.Synthetic.Infinite]
n:64 [binder, in Undecidability.TM.L.HeapInterpreter.LookupTM]
n:65 [binder, in Undecidability.L.Prelim.ARS]
n:65 [binder, in Undecidability.TM.Code.List.Concat_Repeat]
n:65 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
n:65 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
N:65 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
n:65 [binder, in Complexity.NP.SAT.SAT_inNP]
n:65 [binder, in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
n:65 [binder, in Undecidability.L.Functions.UnboundIteration]
n:65 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
n:65 [binder, in Undecidability.TM.Util.TM_facts]
N:65 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:652 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:66 [binder, in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
n:66 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
n:66 [binder, in Undecidability.TM.Code.BinNumbers.PosDefinitions]
n:66 [binder, in Undecidability.TM.Code.List.Nth]
n:66 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
N:66 [binder, in Complexity.NP.SAT.SAT_inNP]
n:66 [binder, in Complexity.NP.SAT.FSAT.FSAT]
n:66 [binder, in Complexity.NP.TM.LM_to_mTM]
n:67 [binder, in Undecidability.TM.Single.StepTM]
n:67 [binder, in Complexity.NP.SAT.SAT_inNP]
n:67 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
n:67 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
n:67 [binder, in Complexity.L.TM.TMflat]
n:67 [binder, in Undecidability.TM.Hoare.HoareRegister]
n:67 [binder, in Undecidability.L.Functions.UnboundIteration]
n:67 [binder, in Complexity.L.TM.TMflatFun]
n:67 [binder, in Undecidability.Synthetic.Infinite]
n:68 [binder, in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
n:68 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
n:68 [binder, in Undecidability.L.Computability.Seval]
n:68 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
n:68 [binder, in Undecidability.Shared.Libs.DLW.Utils.sorting]
n:68 [binder, in Undecidability.Shared.Libs.DLW.Utils.list_bool]
n:68 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
n:68 [binder, in Undecidability.Synthetic.Infinite]
n:68 [binder, in Undecidability.TM.L.HeapInterpreter.LookupTM]
N:68 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:687 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:69 [binder, in Undecidability.TM.Single.StepTM]
n:69 [binder, in Undecidability.L.Tactics.Extract]
n:69 [binder, in Undecidability.L.Tactics.GenEncode]
n:69 [binder, in Complexity.NP.SAT.SAT_inNP]
n:69 [binder, in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
n:69 [binder, in Undecidability.Synthetic.ListEnumerabilityFacts]
n:69 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
n:69 [binder, in Undecidability.TM.Hoare.HoareMult]
n:69 [binder, in Undecidability.Synthetic.Infinite]
n:69 [binder, in Undecidability.TM.Hoare.HoareLogic]
n:69 [binder, in Undecidability.TM.Hoare.HoareCombinators]
n:69 [binder, in Complexity.NP.SAT.SAT]
n:696 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:7 [binder, in Complexity.NP.SAT.CookLevin]
n:7 [binder, in Undecidability.L.Functions.Eval]
n:7 [binder, in Complexity.HierarchyTheorem.TimeHierarchyTheorem]
n:7 [binder, in Undecidability.Shared.Libs.DLW.Utils.prime]
n:7 [binder, in Undecidability.L.TM.TMinL]
n:7 [binder, in Undecidability.TM.Code.CaseNat]
n:7 [binder, in Undecidability.L.Functions.LoopSum]
n:7 [binder, in Undecidability.L.Computability.Seval]
n:7 [binder, in Undecidability.TM.PrettyBounds.SizeBounds]
N:7 [binder, in Complexity.NP.SAT.kSAT]
n:7 [binder, in Undecidability.TM.Util.VectorPrelim]
n:7 [binder, in Undecidability.Synthetic.EnumerabilityFacts]
n:7 [binder, in Complexity.NP.Clique.FlatUGraph]
n:7 [binder, in Undecidability.TM.Code.BinNumbers.NTM]
n:7 [binder, in Undecidability.Shared.FinTypeForallExists]
n:7 [binder, in Undecidability.L.Datatypes.List.List_nat]
n:7 [binder, in Undecidability.Shared.Libs.DLW.Utils.binomial]
n:7 [binder, in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
n:7 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
n:7 [binder, in Undecidability.L.Functions.Ackermann]
n:7 [binder, in Undecidability.Synthetic.MoreEnumerabilityFacts]
n:7 [binder, in Undecidability.Synthetic.ListEnumerabilityFacts]
n:7 [binder, in Undecidability.TM.Lifting.LiftTapes]
n:7 [binder, in Undecidability.L.Computability.Synthetic]
n:7 [binder, in Undecidability.Synthetic.Infinite]
N:7 [binder, in Complexity.NP.SAT.SAT]
n:7 [binder, in Complexity.NP.SAT.kSAT_to_SAT]
n:7 [binder, in Undecidability.Shared.Libs.DLW.Vec.pos]
n:7 [binder, in Undecidability.L.Computability.Computability]
n:7 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
n:70 [binder, in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
n:70 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
n:70 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
n:70 [binder, in Undecidability.L.Computability.Enum]
n:70 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
n:70 [binder, in Complexity.L.TM.TMflatComp]
n:70 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
n:70 [binder, in Undecidability.TM.Hoare.HoareRegister]
n:70 [binder, in Complexity.L.TM.TMflatten]
n:70 [binder, in Undecidability.Synthetic.ListEnumerabilityFacts]
n:70 [binder, in Undecidability.Synthetic.Infinite]
n:70 [binder, in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
n:70 [binder, in Complexity.Complexity.NP]
n:70 [binder, in Complexity.TM.PrettyBounds.PrettyBounds]
n:71 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
n:71 [binder, in Undecidability.TM.Single.StepTM]
n:71 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
n:71 [binder, in Undecidability.TM.Code.List.Nth]
n:71 [binder, in Undecidability.Shared.Libs.DLW.Utils.quotient]
n:71 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
n:71 [binder, in Complexity.L.TM.TMflatComp]
N:71 [binder, in Complexity.NP.SAT.SAT_inNP]
n:71 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
n:71 [binder, in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
N:71 [binder, in Complexity.NP.SAT.SAT]
n:71 [binder, in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
n:71 [binder, in Complexity.Complexity.NP]
n:711 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:715 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:72 [binder, in Complexity.TM.PrettyBounds.BaseCode]
n:72 [binder, in Undecidability.TM.Single.StepTM]
n:72 [binder, in Undecidability.L.Computability.Seval]
n:72 [binder, in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
n:72 [binder, in Undecidability.TM.Code.NatTM]
n:72 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
n:72 [binder, in Undecidability.Shared.Libs.DLW.Utils.quotient]
n:72 [binder, in Complexity.NP.SAT.SAT_inNP]
n:72 [binder, in Complexity.Libs.CookPrelim.PolyBounds]
n:72 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
n:72 [binder, in Undecidability.Shared.Libs.DLW.Utils.sorting]
n:72 [binder, in Complexity.L.TM.TMunflatten]
n:72 [binder, in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
n:72 [binder, in Undecidability.Synthetic.Infinite]
n:72 [binder, in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
n:72 [binder, in Undecidability.TM.L.HeapInterpreter.LookupTM]
n:72 [binder, in Complexity.NP.Clique.kSAT_to_FlatClique]
n:725 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:73 [binder, in Undecidability.TM.Single.StepTM]
n:73 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
n:73 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
n:73 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
n:73 [binder, in Complexity.NP.Clique.FlatClique]
n:73 [binder, in Complexity.L.TM.TMflatten]
n:73 [binder, in Undecidability.TM.Hoare.HoareMult]
n:74 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
n:74 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
n:74 [binder, in Undecidability.L.Computability.Enum]
n:74 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
n:74 [binder, in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
n:74 [binder, in Complexity.L.TM.TMflatFun]
n:74 [binder, in Undecidability.Synthetic.ListEnumerabilityFacts]
n:74 [binder, in Undecidability.Synthetic.Infinite]
n:74 [binder, in Undecidability.TM.Hoare.HoareLogic]
n:74 [binder, in Undecidability.Shared.Libs.DLW.Vec.pos]
n:74 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:747 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:75 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
n:75 [binder, in Undecidability.Shared.Libs.DLW.Utils.prime]
n:75 [binder, in Undecidability.TM.Code.List.Nth]
n:75 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
N:75 [binder, in Complexity.NP.SAT.SAT_inNP]
n:75 [binder, in Undecidability.Shared.Libs.DLW.Utils.sorting]
n:75 [binder, in Undecidability.Synthetic.Infinite]
n:752 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:758 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:76 [binder, in Complexity.TM.PrettyBounds.BaseCode]
n:76 [binder, in Undecidability.TM.Single.StepTM]
n:76 [binder, in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
n:76 [binder, in Undecidability.Shared.Libs.DLW.Utils.list_bool]
n:76 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
N:76 [binder, in Complexity.NP.Clique.kSAT_to_FlatClique]
n:76 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
n:77 [binder, in Undecidability.Shared.Libs.DLW.Utils.prime]
n:77 [binder, in Complexity.L.TM.TMflatComp]
n:77 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
n:77 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
n:77 [binder, in Undecidability.TM.Hoare.HoareMult]
n:77 [binder, in Undecidability.Synthetic.Infinite]
n:77 [binder, in Undecidability.Shared.Libs.DLW.Vec.pos]
n:772 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:776 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:78 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
n:78 [binder, in Undecidability.Shared.Libs.DLW.Utils.prime]
n:78 [binder, in Undecidability.TM.Single.StepTM]
n:78 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
n:78 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
n:78 [binder, in Undecidability.Shared.Libs.DLW.Utils.sorting]
n:78 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_base]
n:78 [binder, in Undecidability.Synthetic.ListEnumerabilityFacts]
n:78 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
n:78 [binder, in Undecidability.L.Computability.Synthetic]
n:78 [binder, in Undecidability.TM.L.HeapInterpreter.LookupTM]
n:784 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:79 [binder, in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
n:79 [binder, in Undecidability.TM.Code.List.Nth]
n:79 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
n:79 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
n:79 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
n:79 [binder, in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
n:79 [binder, in Undecidability.Synthetic.ListEnumerabilityFacts]
n:79 [binder, in Undecidability.L.Computability.Synthetic]
n:79 [binder, in Undecidability.TM.Hoare.HoareCombinators]
n:79 [binder, in Undecidability.Shared.Libs.DLW.Vec.pos]
n:790 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:792 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:795 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:799 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:8 [binder, in Undecidability.TM.Compound.TMTac]
n:8 [binder, in Complexity.L.Datatypes.LBinNums]
n:8 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
n:8 [binder, in Undecidability.TM.Single.StepTM]
n:8 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.VectorFin]
n:8 [binder, in Undecidability.Shared.Libs.DLW.Utils.binomial]
n:8 [binder, in Complexity.L.AbstractMachines.Computable.Lookup]
n:8 [binder, in Undecidability.L.Functions.EnumInt]
n:8 [binder, in Undecidability.TM.Hoare.HoareCombinators]
n:8 [binder, in Undecidability.TM.L.HeapInterpreter.LookupTM]
N:8 [binder, in Complexity.NP.SAT.kSAT_to_SAT]
n:80 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
n:80 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
n:80 [binder, in Undecidability.Shared.Libs.DLW.Utils.list_bool]
n:80 [binder, in Complexity.L.TM.TMflatFun]
n:80 [binder, in Undecidability.Synthetic.Infinite]
n:80 [binder, in Undecidability.TM.Hoare.HoareLogic]
n:80 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
n:805 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:81 [binder, in Undecidability.L.Computability.Enum]
n:81 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
n:81 [binder, in Undecidability.L.Computability.Seval]
n:81 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
n:81 [binder, in Undecidability.Shared.Libs.DLW.Utils.sorting]
n:81 [binder, in Complexity.L.TM.TMunflatten]
n:81 [binder, in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
n:81 [binder, in Undecidability.Shared.Libs.DLW.Vec.pos]
n:81 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler]
N:81 [binder, in Complexity.NP.Clique.kSAT_to_FlatClique]
n:814 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:82 [binder, in Complexity.TM.PrettyBounds.BaseCode]
n:82 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:82 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
n:82 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
n:82 [binder, in Undecidability.TM.Code.NatTM]
n:82 [binder, in Complexity.NP.Clique.FlatClique]
n:82 [binder, in Undecidability.TM.Hoare.HoareMult]
n:82 [binder, in Undecidability.Synthetic.Infinite]
n:824 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:829 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:83 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:83 [binder, in Undecidability.TM.Code.List.Nth]
n:83 [binder, in Undecidability.L.Computability.Seval]
n:83 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
n:83 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
n:83 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
n:83 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
n:83 [binder, in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
n:83 [binder, in Undecidability.Synthetic.Infinite]
n:83 [binder, in Complexity.Complexity.Definitions]
n:83 [binder, in Undecidability.TM.L.HeapInterpreter.LookupTM]
n:83 [binder, in Undecidability.Shared.Libs.DLW.Vec.pos]
n:83 [binder, in Complexity.NP.Clique.kSAT_to_FlatClique]
n:831 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:833 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:84 [binder, in Undecidability.L.Computability.Enum]
n:84 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
n:84 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
n:84 [binder, in Complexity.Complexity.UpToCPoly]
n:84 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachine]
n:84 [binder, in Complexity.Complexity.Definitions]
n:84 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:85 [binder, in Complexity.TM.PrettyBounds.BaseCode]
n:85 [binder, in Undecidability.TM.Single.StepTM]
n:85 [binder, in Undecidability.L.Computability.Enum]
n:85 [binder, in Complexity.Libs.CookPrelim.PolyBounds]
n:85 [binder, in Undecidability.Shared.Libs.DLW.Utils.sorting]
n:85 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
n:85 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_base]
n:85 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
n:85 [binder, in Undecidability.TM.Hoare.HoareLogic]
n:85 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
N:85 [binder, in Complexity.NP.Clique.kSAT_to_FlatClique]
n:85 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:850 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:86 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
n:862 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:87 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:87 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
n:87 [binder, in Undecidability.Shared.Libs.DLW.Utils.sorting]
n:87 [binder, in Undecidability.Shared.Libs.DLW.Utils.php]
n:87 [binder, in Undecidability.TM.Hoare.HoareRegister]
n:87 [binder, in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
n:87 [binder, in Undecidability.TM.Hoare.HoareMult]
n:87 [binder, in Undecidability.L.Computability.Synthetic]
n:87 [binder, in Undecidability.TM.L.HeapInterpreter.LookupTM]
n:87 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler]
n:87 [binder, in Complexity.NP.TM.LM_to_mTM]
N:87 [binder, in Complexity.NP.Clique.kSAT_to_FlatClique]
n:871 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:877 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:88 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
n:88 [binder, in Undecidability.TM.Code.List.Nth]
n:88 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
n:88 [binder, in Undecidability.TM.Util.Prelim]
n:88 [binder, in Complexity.Libs.CookPrelim.PolyBounds]
n:88 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
n:88 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
n:88 [binder, in Undecidability.L.Computability.Synthetic]
n:88 [binder, in Undecidability.Shared.Libs.DLW.Vec.pos]
n:88 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
n:884 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:89 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
n:9 [binder, in Undecidability.L.Functions.Eval]
n:9 [binder, in Complexity.Complexity.ONotation]
n:9 [binder, in Complexity.L.Datatypes.LBinNums]
n:9 [binder, in Undecidability.Shared.Libs.DLW.Utils.prime]
n:9 [binder, in Undecidability.L.TM.TMinL]
n:9 [binder, in Complexity.L.AbstractMachines.FlatPro.Computable.Decompile]
n:9 [binder, in Undecidability.Shared.Libs.DLW.Utils.crt]
n:9 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.VectorFin]
n:9 [binder, in Undecidability.Shared.FinTypeForallExists]
n:9 [binder, in Undecidability.L.Datatypes.List.List_extra]
n:9 [binder, in Complexity.Complexity.SpaceBoundsTime]
n:9 [binder, in Undecidability.Shared.Libs.DLW.Wf.wf_finite]
n:9 [binder, in Complexity.TM.Single.DecodeTapes]
n:9 [binder, in Undecidability.Shared.Libs.PSL.Vectors.VectorDupfree]
n:9 [binder, in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
N:9 [binder, in Complexity.NP.SAT.kSAT_to_SAT]
n:9 [binder, in Undecidability.Shared.Libs.DLW.Vec.pos]
n:9 [binder, in Undecidability.TM.L.Transcode.Enc_to_Boollist]
n:9 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
n:9 [binder, in Undecidability.L.AbstractMachines.LargestVar]
n:90 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
n:90 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
n:90 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
n:90 [binder, in Undecidability.Synthetic.ListEnumerabilityFacts]
N:90 [binder, in Complexity.NP.Clique.kSAT_to_FlatClique]
n:91 [binder, in Undecidability.TM.Code.NatTM]
n:91 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
n:91 [binder, in Complexity.Libs.CookPrelim.PolyBounds]
n:91 [binder, in Complexity.NP.Clique.FlatClique]
n:91 [binder, in Undecidability.TM.Hoare.HoareCombinators]
n:91 [binder, in Undecidability.TM.L.HeapInterpreter.LookupTM]
n:91 [binder, in Undecidability.Shared.Libs.DLW.Vec.pos]
n:91 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:913 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:92 [binder, in Undecidability.TM.Hoare.HoareRegister]
n:92 [binder, in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
n:92 [binder, in Undecidability.TM.Hoare.HoareMult]
n:93 [binder, in Undecidability.TM.Code.List.Nth]
n:93 [binder, in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
n:93 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
n:93 [binder, in Undecidability.TM.Util.Prelim]
n:93 [binder, in Undecidability.L.Datatypes.LVector]
n:93 [binder, in Complexity.NP.Clique.kSAT_to_FlatClique]
n:931 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:939 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:94 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
n:94 [binder, in Undecidability.TM.Single.StepTM]
n:94 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
n:94 [binder, in Undecidability.Shared.Libs.DLW.Utils.sorting]
n:94 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
n:94 [binder, in Undecidability.Shared.Libs.DLW.Vec.pos]
n:94 [binder, in Undecidability.TM.Hoare.HoareExamples]
N:94 [binder, in Complexity.NP.Clique.kSAT_to_FlatClique]
n:943 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:944 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:95 [binder, in Undecidability.Shared.Libs.DLW.Utils.php]
n:95 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachine]
n:95 [binder, in Undecidability.TM.Hoare.HoareLogic]
n:95 [binder, in Undecidability.TM.L.HeapInterpreter.LookupTM]
n:95 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
n:95 [binder, in Complexity.NP.TM.LM_to_mTM]
n:954 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:959 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:96 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
n:96 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
n:96 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_base]
n:96 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
n:96 [binder, in Complexity.NP.TM.LM_to_mTM]
n:97 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
n:97 [binder, in Undecidability.TM.Code.List.Nth]
n:97 [binder, in Undecidability.L.Tactics.LClos]
n:97 [binder, in Complexity.L.TM.TMflatComp]
n:97 [binder, in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
n:97 [binder, in Undecidability.TM.Hoare.HoareMult]
N:97 [binder, in Complexity.NP.Clique.kSAT_to_FlatClique]
n:98 [binder, in Undecidability.L.Computability.Seval]
n:98 [binder, in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
n:98 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
n:98 [binder, in Undecidability.Shared.Libs.DLW.Vec.pos]
n:99 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
n:99 [binder, in Undecidability.L.Datatypes.LVector]
n:99 [binder, in Complexity.TM.PrettyBounds.BaseCodeSpace]
n:99 [binder, in Complexity.L.TM.TMunflatten]
n:99 [binder, in Undecidability.TM.Hoare.HoareRegister]
n:99 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_base]

O

o [abbreviation, in Undecidability.Shared.Libs.DLW.Utils.sums]
ob:53 [binder, in Undecidability.Shared.Libs.PSL.Retracts]
oconf':61 [binder, in Undecidability.TM.Lifting.LiftAlphabet]
oconf:174 [binder, in Undecidability.TM.Univ.Univ]
oconf:320 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
oconf:60 [binder, in Undecidability.TM.Lifting.LiftAlphabet]
oenc_correct_some [lemma, in Undecidability.L.Datatypes.LOptions]
ofClause [definition, in Complexity.NP.Clique.kSAT_to_Clique]
ofFlatType [definition, in Complexity.Libs.CookPrelim.FlatFinTypes]
ofFlatType_dec_poly [lemma, in Complexity.Libs.CookPrelim.FlatFinTypes]
ofFlatType_dec_time_bound [lemma, in Complexity.Libs.CookPrelim.FlatFinTypes]
ofFlatType_dec_time [definition, in Complexity.Libs.CookPrelim.FlatFinTypes]
ofFlatType_dec [definition, in Complexity.Libs.CookPrelim.FlatFinTypes]
offset [abbreviation, in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
offset [projection, in Complexity.NP.SAT.CookLevin.Subproblems.BinaryCC]
offset [abbreviation, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
offset [abbreviation, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
offset [abbreviation, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
offset [abbreviation, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
offset [projection, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
offset [abbreviation, in Complexity.NP.SAT.CookLevin.Reductions.CC_to_BinaryCC]
offset [projection, in Complexity.NP.SAT.CookLevin.Subproblems.CC]
Omega [definition, in Undecidability.L.Util.L_facts]
omega [definition, in Undecidability.L.Util.L_facts]
OmegaLift [definition, in Undecidability.L.Datatypes.LBool]
OmegaLift_proc [lemma, in Undecidability.L.Datatypes.LBool]
Omega_diverge [lemma, in Undecidability.L.Tactics.Lsimpl]
Omega_closed [lemma, in Undecidability.L.Tactics.Lsimpl]
omega_proc [lemma, in Undecidability.L.Tactics.Lsimpl]
Omega_diverges [lemma, in Undecidability.L.Computability.Seval]
One [abbreviation, in Undecidability.Shared.Libs.DLW.Utils.list_bool]
One [abbreviation, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
ONotation [library]
ONotationIsAppropriate [library]
on0 [definition, in Undecidability.L.Tactics.ComputableDemo]
optBind [definition, in Complexity.Libs.CookPrelim.MorePrelim]
optBound [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
optBound_poly [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
optBound_time_bound [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
optBound_time [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
Option [module, in Undecidability.TM.Code.ProgrammingTools]
optionFToSum [definition, in Undecidability.L.Prelim.LoopSum]
optionMap_time_bound_c [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
optionMap_time [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
option_eqb_spec [lemma, in Undecidability.L.Datatypes.LOptions]
option_eqb [definition, in Undecidability.L.Datatypes.LOptions]
option_eqb.spec [variable, in Undecidability.L.Datatypes.LOptions]
option_eqb.eqb [variable, in Undecidability.L.Datatypes.LOptions]
option_eqb.X [variable, in Undecidability.L.Datatypes.LOptions]
option_eqb [section, in Undecidability.L.Datatypes.LOptions]
option_eq_dec [instance, in Undecidability.Shared.Libs.PSL.EqDec]
option_enum [definition, in Undecidability.Synthetic.EnumerabilityFacts]
option_eq_dec [instance, in Undecidability.Shared.Dec]
option_decode [definition, in Undecidability.L.Functions.Decoding]
option_enum_ok [lemma, in Undecidability.Shared.Libs.PSL.FiniteTypes.CompoundFinTypes]
optReturn [definition, in Complexity.Libs.CookPrelim.MorePrelim]
opt_generateCardsForFlatNonHalt_ofFlatType [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
opt_generateCardsForFlatNonHalt_poly [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
opt_generateCardsForFlatNonHalt_time_bound [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
opt_generateCardsForFlatNonHalt_time [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
opt_to_sum_unit [definition, in Undecidability.TM.Single.StepTM]
opt_to_sum [definition, in Undecidability.TM.Code.CaseSum]
opt_generateCardsForFlatNonHalt [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
opt_finReprElP_None [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
opt_finReprElP_Some [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
opt_finReprElP_case [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
opt_finReprEl' [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
opt_literalsConflict [definition, in Complexity.NP.Clique.kSAT_to_Clique]
opt_to_list [definition, in Undecidability.L.Computability.Synthetic]
opt_literalsConflict_decb_poly [lemma, in Complexity.NP.Clique.kSAT_to_FlatClique]
opt_literalsConflict_decb_time_bound [lemma, in Complexity.NP.Clique.kSAT_to_FlatClique]
opt_literalsConflict_decb_time [definition, in Complexity.NP.Clique.kSAT_to_FlatClique]
opt_literalsConflict_decb_iff [lemma, in Complexity.NP.Clique.kSAT_to_FlatClique]
opt_literalsConflict_decb [definition, in Complexity.NP.Clique.kSAT_to_FlatClique]
orFree [inductive, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
orFreeAnd [constructor, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
orFreeNot [constructor, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
orFreeTrue [constructor, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
orFreeVar [constructor, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
orFree_eliminate [lemma, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
or_dec [instance, in Undecidability.Shared.Libs.PSL.EqDec]
or_dec [instance, in Undecidability.Shared.Dec]
ostate:326 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
otapes:327 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
OtherWhileRel [section, in Undecidability.TM.Combinators.While]
OtherWhileRel.F [variable, in Undecidability.TM.Combinators.While]
OtherWhileRel.n [variable, in Undecidability.TM.Combinators.While]
OtherWhileRel.R [variable, in Undecidability.TM.Combinators.While]
OtherWhileRel.sig [variable, in Undecidability.TM.Combinators.While]
outc:280 [binder, in Undecidability.TM.Util.TM_facts]
outc:310 [binder, in Undecidability.TM.Util.TM_facts]
outc:362 [binder, in Undecidability.TM.Util.TM_facts]
outc:368 [binder, in Undecidability.TM.Util.TM_facts]
outc:40 [binder, in Undecidability.TM.Combinators.Switch]
outc:45 [binder, in Undecidability.TM.Combinators.Switch]
outc:504 [binder, in Undecidability.TM.Single.StepTM]
out_interval [definition, in Undecidability.Shared.Libs.DLW.Utils.interval]
out_code [definition, in Undecidability.Shared.Libs.DLW.Code.subcode]
out:7 [binder, in Complexity.NP.TM.LM_to_mTM]
out:8 [binder, in Complexity.TM.Code.DecodeBool]
own_multiple [lemma, in Undecidability.Shared.Libs.DLW.Utils.gcd]
O_Rel [definition, in Undecidability.TM.Code.CaseNat]
o1:19 [binder, in Complexity.NP.Clique.kSAT_to_Clique]
o1:21 [binder, in Complexity.NP.Clique.kSAT_to_FlatClique]
o1:25 [binder, in Complexity.NP.Clique.kSAT_to_FlatClique]
o1:30 [binder, in Complexity.NP.Clique.kSAT_to_Clique]
o1:66 [binder, in Complexity.NP.Clique.kSAT_to_FlatClique]
o1:70 [binder, in Complexity.NP.Clique.kSAT_to_FlatClique]
o1:73 [binder, in Complexity.NP.Clique.kSAT_to_FlatClique]
o2:20 [binder, in Complexity.NP.Clique.kSAT_to_Clique]
o2:22 [binder, in Complexity.NP.Clique.kSAT_to_FlatClique]
o2:26 [binder, in Complexity.NP.Clique.kSAT_to_FlatClique]
o2:31 [binder, in Complexity.NP.Clique.kSAT_to_Clique]
o2:67 [binder, in Complexity.NP.Clique.kSAT_to_FlatClique]
o2:71 [binder, in Complexity.NP.Clique.kSAT_to_FlatClique]
o2:74 [binder, in Complexity.NP.Clique.kSAT_to_FlatClique]
o:101 [binder, in Undecidability.TM.Util.Prelim]
o:11 [binder, in Undecidability.TM.Code.CaseNat]
o:11 [binder, in Undecidability.TM.Compound.MoveToSymbol]
o:113 [binder, in Complexity.TM.PrettyBounds.BaseCode]
o:13 [binder, in Undecidability.TM.SBTM]
o:143 [binder, in Undecidability.TM.Code.Code]
o:145 [binder, in Undecidability.TM.Code.Code]
o:147 [binder, in Undecidability.TM.Code.Code]
o:17 [binder, in Undecidability.TM.Code.CaseSum]
o:186 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
o:19 [binder, in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
o:199 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
o:20 [binder, in Undecidability.TM.Compound.Multi]
o:34 [binder, in Undecidability.TM.Code.CaseSum]
o:42 [binder, in Undecidability.TM.Code.CaseSum]
o:44 [binder, in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
o:622 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
o:67 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
o:71 [binder, in Undecidability.TM.Code.CaseSum]
o:73 [binder, in Undecidability.TM.Code.CaseSum]
o:74 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
o:79 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
o:8 [binder, in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
o:80 [binder, in Complexity.TM.PrettyBounds.PrettyBounds]
o:83 [binder, in Undecidability.L.Tactics.Extract]
o:84 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler]
o:87 [binder, in Undecidability.L.Tactics.Extract]
o:9 [binder, in Undecidability.TM.Compound.CopySymbols]
o:90 [binder, in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
o:92 [binder, in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]

P

padding:27 [binder, in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
padding:40 [binder, in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
pair_ofFlatType [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
pair_inv [lemma, in Undecidability.TM.Code.CompareValue]
pair_inv [lemma, in Undecidability.TM.Code.Copy]
pair_eq [lemma, in Undecidability.TM.Code.CasePair]
pair_eq [lemma, in Undecidability.TM.Code.List.App]
parametrized_confluence [lemma, in Undecidability.L.Prelim.ARS]
parametrized_semi_confluence [lemma, in Undecidability.L.Prelim.ARS]
params:20 [binder, in Undecidability.L.Tactics.GenEncode]
Params:73 [binder, in Undecidability.L.Tactics.Extract]
params:77 [binder, in Undecidability.L.Tactics.Extract]
params:97 [binder, in Undecidability.L.Tactics.Extract]
Partial [library]
partition_intersection [lemma, in Undecidability.Shared.Libs.DLW.Utils.php]
pat:10 [binder, in Undecidability.TM.Hoare.HoareLegacy]
pat:10 [binder, in Undecidability.TM.Compound.MoveToSymbol]
pat:10 [binder, in Undecidability.TM.Code.List.Rev]
pat:10 [binder, in Undecidability.TM.Code.BinNumbers.NTM]
pat:10 [binder, in Complexity.NP.TM.L_to_LM]
pat:100 [binder, in Undecidability.L.Computability.Synthetic]
pat:103 [binder, in Undecidability.L.Tactics.Extract]
pat:103 [binder, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
pat:103 [binder, in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
pat:103 [binder, in Undecidability.TM.Univ.LookupAssociativeListTM]
pat:103 [binder, in Undecidability.TM.L.HeapInterpreter.LookupTM]
pat:104 [binder, in Undecidability.TM.Hoare.HoareMult]
pat:105 [binder, in Undecidability.TM.Code.BinNumbers.PosAddTM]
pat:107 [binder, in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
pat:107 [binder, in Complexity.NP.Clique.kSAT_to_Clique]
pat:107 [binder, in Undecidability.TM.Univ.LookupAssociativeListTM]
pat:108 [binder, in Undecidability.TM.L.HeapInterpreter.LookupTM]
pat:11 [binder, in Undecidability.TM.Combinators.Switch]
pat:11 [binder, in Undecidability.TM.Basic.Mono]
pat:11 [binder, in Undecidability.TM.Hoare.HoareLogic]
pat:11 [binder, in Complexity.NP.Clique.kSAT_to_FlatClique]
pat:110 [binder, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
pat:110 [binder, in Undecidability.TM.Lifting.LiftTapes]
pat:110 [binder, in Undecidability.TM.Hoare.HoareMult]
pat:110 [binder, in Undecidability.TM.Code.BinNumbers.PosAddTM]
pat:111 [binder, in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
pat:111 [binder, in Complexity.L.TM.TMflatComp]
pat:112 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
pat:112 [binder, in Undecidability.TM.Univ.LookupAssociativeListTM]
pat:112 [binder, in Undecidability.TM.Hoare.HoareCombinators]
pat:112 [binder, in Undecidability.TM.L.HeapInterpreter.LookupTM]
pat:115 [binder, in Undecidability.TM.Util.Relations]
pat:116 [binder, in Undecidability.TM.Hoare.HoareMult]
pat:117 [binder, in Undecidability.TM.Code.List.Nth]
pat:117 [binder, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
pat:117 [binder, in Undecidability.TM.Univ.LowLevel]
pat:117 [binder, in Undecidability.TM.Univ.LookupAssociativeListTM]
pat:117 [binder, in Undecidability.TM.Hoare.HoareLogic]
pat:119 [binder, in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
pat:12 [binder, in Undecidability.TM.L.Transcode.Boollist_to_Enc]
pat:12 [binder, in Complexity.NP.TM.TMGenNP]
pat:12 [binder, in Undecidability.TM.Code.CaseSum]
pat:12 [binder, in Undecidability.TM.Compound.Compare]
pat:12 [binder, in Complexity.NP.Clique.FlatClique]
pat:12 [binder, in Undecidability.TM.SBTM]
pat:12 [binder, in Complexity.NP.L.GenNP]
pat:12 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler]
pat:12 [binder, in Undecidability.TM.Code.BinNumbers.PosShiftTM]
pat:120 [binder, in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
pat:121 [binder, in Undecidability.TM.Hoare.HoareMult]
pat:121 [binder, in Undecidability.TM.Univ.LookupAssociativeListTM]
pat:123 [binder, in Complexity.NP.Clique.kSAT_to_Clique]
pat:124 [binder, in Complexity.L.TM.TMunflatten]
pat:125 [binder, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
pat:125 [binder, in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
pat:125 [binder, in Undecidability.TM.Code.Code]
pat:125 [binder, in Complexity.Complexity.NP]
pat:126 [binder, in Undecidability.TM.Hoare.HoareMult]
pat:126 [binder, in Undecidability.TM.Hoare.HoareExamples]
pat:127 [binder, in Undecidability.TM.Univ.Univ]
pat:128 [binder, in Undecidability.TM.Hoare.HoareLogic]
pat:128 [binder, in Complexity.Complexity.NP]
pat:129 [binder, in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
pat:129 [binder, in Complexity.NP.Clique.FlatClique]
pat:13 [binder, in Undecidability.TM.Code.List.Concat_Repeat]
pat:13 [binder, in Undecidability.TM.Code.BinNumbers.NTM]
pat:13 [binder, in Undecidability.TM.Combinators.StateWhile]
pat:13 [binder, in Undecidability.TM.Basic.Duo]
pat:131 [binder, in Undecidability.TM.Univ.LowLevel]
pat:131 [binder, in Undecidability.TM.Hoare.HoareMult]
pat:131 [binder, in Undecidability.TM.Univ.Univ]
pat:133 [binder, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
pat:133 [binder, in Complexity.NP.Clique.FlatClique]
pat:133 [binder, in Undecidability.TM.Univ.LookupAssociativeListTM]
pat:135 [binder, in Undecidability.TM.Univ.Univ]
pat:135 [binder, in Undecidability.TM.Hoare.HoareExamples]
pat:137 [binder, in Undecidability.TM.Hoare.HoareMult]
pat:138 [binder, in Undecidability.TM.Hoare.HoareExamples]
pat:139 [binder, in Complexity.NP.Clique.FlatClique]
pat:139 [binder, in Undecidability.TM.Univ.Univ]
pat:14 [binder, in Undecidability.TM.Code.List.Length]
pat:14 [binder, in Complexity.L.TM.TMunflatten]
pat:14 [binder, in Undecidability.TM.Code.NatSub]
pat:140 [binder, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
pat:140 [binder, in Undecidability.TM.Hoare.HoareRegister]
pat:142 [binder, in Undecidability.TM.Hoare.HoareExamples]
pat:143 [binder, in Complexity.NP.Clique.FlatClique]
pat:143 [binder, in Undecidability.TM.Hoare.HoareMult]
pat:143 [binder, in Undecidability.TM.Univ.Univ]
pat:145 [binder, in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
pat:146 [binder, in Undecidability.TM.Hoare.HoareRegister]
pat:146 [binder, in Undecidability.TM.Hoare.HoareExamples]
pat:147 [binder, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
pat:147 [binder, in Undecidability.TM.Univ.Univ]
pat:148 [binder, in Undecidability.TM.Hoare.HoareMult]
pat:149 [binder, in Undecidability.TM.Hoare.HoareExamples]
pat:15 [binder, in Undecidability.L.TM.TMinL]
pat:15 [binder, in Complexity.NP.L.LMGenNP]
pat:151 [binder, in Undecidability.TM.Univ.Univ]
pat:153 [binder, in Undecidability.TM.Hoare.HoareExamples]
pat:155 [binder, in Undecidability.TM.Univ.Univ]
pat:159 [binder, in Undecidability.TM.Univ.Univ]
pat:16 [binder, in Complexity.TM.Code.Decode]
pat:16 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
pat:16 [binder, in Undecidability.TM.Lifting.LiftAlphabet]
pat:16 [binder, in Undecidability.TM.Hoare.HoareLegacy]
pat:16 [binder, in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
pat:16 [binder, in Complexity.L.AbstractMachines.Computable.Unfolding]
pat:16 [binder, in Undecidability.L.Functions.FinTypeLookup]
pat:16 [binder, in Complexity.NP.TM.TMGenNP_fixed_mTM]
pat:163 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
pat:163 [binder, in Undecidability.TM.Univ.Univ]
pat:164 [binder, in Undecidability.TM.Hoare.HoareRegister]
pat:166 [binder, in Complexity.L.TM.TMunflatten]
pat:166 [binder, in Undecidability.TM.Univ.Univ]
pat:169 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
pat:169 [binder, in Undecidability.TM.Hoare.HoareRegister]
pat:17 [binder, in Undecidability.TM.Code.BinNumbers.PosIncrementTM]
pat:17 [binder, in Undecidability.TM.Code.NatSub]
pat:170 [binder, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
pat:170 [binder, in Undecidability.TM.Hoare.HoareExamples]
pat:172 [binder, in Complexity.L.TM.TMflatComp]
pat:173 [binder, in Undecidability.TM.Hoare.HoareExamples]
pat:177 [binder, in Undecidability.TM.Hoare.HoareExamples]
pat:18 [binder, in Undecidability.TM.Basic.Mono]
pat:18 [binder, in Undecidability.TM.Code.BinNumbers.NTM]
pat:18 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.SingleTMGenNP]
pat:18 [binder, in Undecidability.TM.Basic.Duo]
pat:181 [binder, in Complexity.L.TM.TMflatComp]
pat:181 [binder, in Undecidability.TM.Hoare.HoareExamples]
pat:184 [binder, in Undecidability.TM.Hoare.HoareExamples]
pat:187 [binder, in Undecidability.TM.Hoare.HoareExamples]
pat:19 [binder, in Undecidability.TM.Code.BinNumbers.PosMultTM]
pat:19 [binder, in Undecidability.TM.Code.CaseNat]
pat:190 [binder, in Undecidability.TM.Hoare.HoareExamples]
pat:194 [binder, in Undecidability.TM.Hoare.HoareExamples]
pat:198 [binder, in Undecidability.TM.Hoare.HoareExamples]
pat:20 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
pat:20 [binder, in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
pat:20 [binder, in Complexity.NP.TM.TMGenNP]
pat:20 [binder, in Undecidability.TM.Hoare.HoareMult]
pat:20 [binder, in Complexity.TM.Single.DecodeTape]
pat:20 [binder, in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
pat:201 [binder, in Undecidability.TM.Hoare.HoareExamples]
pat:202 [binder, in Undecidability.TM.Single.StepTM]
pat:208 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
pat:21 [binder, in Undecidability.L.Functions.Size]
pat:212 [binder, in Undecidability.TM.Single.StepTM]
pat:212 [binder, in Undecidability.TM.Hoare.HoareExamples]
pat:216 [binder, in Undecidability.TM.Hoare.HoareExamples]
pat:22 [binder, in Undecidability.TM.Lifting.LiftTapes]
pat:22 [binder, in Complexity.L.AbstractMachines.Computable.HeapMachine]
pat:221 [binder, in Undecidability.TM.Hoare.HoareExamples]
pat:224 [binder, in Undecidability.L.Tactics.Extract]
pat:224 [binder, in Complexity.L.TM.TMflatComp]
pat:226 [binder, in Undecidability.TM.Hoare.HoareExamples]
pat:229 [binder, in Undecidability.TM.Single.StepTM]
pat:23 [binder, in Complexity.L.AbstractMachines.Computable.Unfolding]
pat:23 [binder, in Complexity.L.AbstractMachines.Computable.LargestVar]
pat:230 [binder, in Undecidability.TM.Hoare.HoareExamples]
pat:234 [binder, in Undecidability.TM.Hoare.HoareExamples]
pat:237 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
pat:238 [binder, in Undecidability.TM.Hoare.HoareExamples]
pat:24 [binder, in Undecidability.TM.Code.BinNumbers.PosIncrementTM]
pat:24 [binder, in Undecidability.TM.Code.BinNumbers.NTM]
pat:24 [binder, in Complexity.L.AbstractMachines.FlatPro.Computable.Compile]
pat:24 [binder, in Undecidability.TM.Hoare.HoareMult]
pat:243 [binder, in Undecidability.TM.Hoare.HoareExamples]
pat:248 [binder, in Undecidability.TM.Hoare.HoareExamples]
pat:25 [binder, in Complexity.TM.Code.Decode]
pat:25 [binder, in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
pat:25 [binder, in Undecidability.TM.Code.CompareValue]
pat:25 [binder, in Complexity.L.TM.TMunflatten]
pat:25 [binder, in Undecidability.TM.Code.NatSub]
pat:250 [binder, in Undecidability.TM.Single.StepTM]
pat:252 [binder, in Undecidability.TM.Hoare.HoareExamples]
pat:258 [binder, in Undecidability.TM.Single.StepTM]
pat:26 [binder, in Undecidability.L.Tactics.GenEncode]
pat:26 [binder, in Complexity.NP.TM.TMGenNP]
pat:26 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.SingleTMGenNP]
pat:26 [binder, in Undecidability.L.Functions.Size]
pat:265 [binder, in Undecidability.TM.Hoare.HoareExamples]
pat:267 [binder, in Undecidability.TM.Single.StepTM]
pat:27 [binder, in Complexity.TM.Single.DecodeTapes]
pat:28 [binder, in Undecidability.TM.Code.BinNumbers.PosCompareTM]
pat:28 [binder, in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
pat:28 [binder, in Undecidability.TM.Code.BinNumbers.NTM]
pat:28 [binder, in Complexity.L.AbstractMachines.FlatPro.Computable.Compile]
pat:28 [binder, in Undecidability.TM.L.Transcode.Enc_to_Boollist]
pat:28 [binder, in Undecidability.TM.Compound.Multi]
pat:28 [binder, in Complexity.L.AbstractMachines.Computable.LargestVar]
pat:28 [binder, in Complexity.NP.TM.TMGenNP_fixed_mTM]
pat:28 [binder, in Undecidability.TM.Code.BinNumbers.PosShiftTM]
pat:282 [binder, in Undecidability.TM.Single.StepTM]
pat:29 [binder, in Complexity.L.AbstractMachines.Computable.EvalForTime]
pat:29 [binder, in Undecidability.TM.Code.NatSub]
pat:29 [binder, in Undecidability.TM.Hoare.HoareMult]
pat:294 [binder, in Undecidability.TM.Hoare.HoareExamples]
pat:298 [binder, in Undecidability.TM.Hoare.HoareExamples]
pat:3 [binder, in Undecidability.Shared.embed_nat]
pat:3 [binder, in Undecidability.L.Functions.Size]
pat:30 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
pat:30 [binder, in Undecidability.TM.Combinators.Mirror]
pat:303 [binder, in Undecidability.TM.Single.StepTM]
pat:303 [binder, in Undecidability.TM.Hoare.HoareExamples]
pat:308 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
pat:308 [binder, in Undecidability.TM.Hoare.HoareExamples]
pat:31 [binder, in Undecidability.TM.L.Transcode.Boollist_to_Enc]
pat:31 [binder, in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
pat:31 [binder, in Undecidability.TM.Code.List.Rev]
pat:31 [binder, in Undecidability.TM.L.Transcode.Enc_to_Boollist]
pat:31 [binder, in Undecidability.L.Functions.Size]
pat:31 [binder, in Complexity.NP.Clique.kSAT_to_FlatClique]
pat:312 [binder, in Undecidability.TM.Hoare.HoareExamples]
pat:316 [binder, in Undecidability.TM.Hoare.HoareExamples]
pat:32 [binder, in Undecidability.TM.Code.List.Concat_Repeat]
pat:32 [binder, in Complexity.L.AbstractMachines.Computable.EvalForTime]
pat:32 [binder, in Complexity.L.AbstractMachines.FlatPro.Computable.Compile]
pat:32 [binder, in Undecidability.TM.Code.NatSub]
pat:320 [binder, in Undecidability.TM.Hoare.HoareExamples]
pat:325 [binder, in Undecidability.TM.Hoare.HoareExamples]
pat:33 [binder, in Undecidability.TM.Code.BinNumbers.NTM]
pat:33 [binder, in Undecidability.TM.Code.CaseSum]
pat:33 [binder, in Complexity.NP.TM.M_LM2TM]
pat:33 [binder, in Complexity.Complexity.NP]
pat:33 [binder, in Complexity.L.AbstractMachines.Computable.LargestVar]
pat:330 [binder, in Undecidability.TM.Hoare.HoareExamples]
pat:334 [binder, in Undecidability.TM.Hoare.HoareExamples]
pat:34 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
pat:34 [binder, in Undecidability.TM.Code.BinNumbers.PosCompareTM]
pat:34 [binder, in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
pat:34 [binder, in Undecidability.TM.Hoare.HoareMult]
pat:345 [binder, in Undecidability.TM.Hoare.HoareCombinators]
pat:348 [binder, in Undecidability.TM.Hoare.HoareExamples]
pat:35 [binder, in Undecidability.TM.Code.WriteValue]
pat:35 [binder, in Undecidability.TM.TM]
pat:35 [binder, in Undecidability.TM.L.Transcode.Enc_to_Boollist]
pat:350 [binder, in Undecidability.TM.Hoare.HoareCombinators]
pat:353 [binder, in Undecidability.TM.Hoare.HoareExamples]
pat:355 [binder, in Undecidability.TM.Hoare.HoareCombinators]
pat:359 [binder, in Undecidability.TM.Hoare.HoareExamples]
pat:36 [binder, in Undecidability.TM.Code.List.Concat_Repeat]
pat:36 [binder, in Undecidability.TM.Basic.Mono]
pat:36 [binder, in Complexity.NP.TM.TMGenNP]
pat:36 [binder, in Complexity.NP.L.GenNPBool]
pat:36 [binder, in Complexity.L.AbstractMachines.FlatPro.Computable.Compile]
pat:36 [binder, in Undecidability.TM.Code.NatSub]
pat:36 [binder, in Undecidability.TM.Util.Relations]
pat:36 [binder, in Undecidability.L.Functions.Size]
pat:360 [binder, in Undecidability.TM.Hoare.HoareCombinators]
pat:361 [binder, in Undecidability.TM.Util.TM_facts]
pat:365 [binder, in Undecidability.TM.Hoare.HoareExamples]
pat:37 [binder, in Undecidability.TM.Code.BinNumbers.PosMultTM]
pat:37 [binder, in Complexity.NP.TM.M_LM2TM]
pat:370 [binder, in Undecidability.TM.Hoare.HoareExamples]
pat:375 [binder, in Undecidability.TM.Hoare.HoareExamples]
pat:38 [binder, in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
pat:38 [binder, in Undecidability.TM.SBTM]
pat:38 [binder, in Undecidability.TM.Hoare.HoareMult]
pat:38 [binder, in Undecidability.TM.Code.BinNumbers.PosAddTM]
pat:38 [binder, in Complexity.L.AbstractMachines.Computable.LargestVar]
pat:38 [binder, in Undecidability.TM.Code.BinNumbers.PosShiftTM]
pat:380 [binder, in Undecidability.TM.Hoare.HoareExamples]
pat:386 [binder, in Undecidability.TM.Hoare.HoareExamples]
pat:39 [binder, in Undecidability.TM.Code.List.Concat_Repeat]
pat:39 [binder, in Undecidability.TM.Code.CaseList]
pat:39 [binder, in Undecidability.TM.Code.BinNumbers.NTM]
pat:39 [binder, in Undecidability.TM.Code.NatSub]
pat:39 [binder, in Undecidability.TM.L.Transcode.Enc_to_Boollist]
pat:392 [binder, in Undecidability.TM.Hoare.HoareExamples]
pat:397 [binder, in Undecidability.TM.Hoare.HoareExamples]
pat:4 [binder, in Undecidability.TM.Basic.Null]
pat:4 [binder, in Undecidability.TM.Code.BinNumbers.PosIncrementTM]
pat:4 [binder, in Undecidability.TM.Code.NatTM]
pat:4 [binder, in Complexity.L.AbstractMachines.Computable.Unfolding]
pat:4 [binder, in Complexity.L.AbstractMachines.Computable.UnivDecTime]
pat:4 [binder, in Complexity.NP.L.GenNPBool]
pat:4 [binder, in Undecidability.L.AbstractMachines.FlatPro.UnfoldClos]
pat:4 [binder, in Complexity.L.AbstractMachines.FlatPro.Computable.Compile]
pat:4 [binder, in Undecidability.TM.Code.NatSub]
pat:4 [binder, in Undecidability.TM.SBTM]
pat:4 [binder, in Undecidability.Synthetic.DecidabilityFacts]
pat:40 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
pat:40 [binder, in Complexity.L.AbstractMachines.FlatPro.Computable.Compile]
pat:40 [binder, in Complexity.L.AbstractMachines.AbstractSubstMachine]
pat:40 [binder, in Complexity.NP.TM.M_LM2TM]
pat:404 [binder, in Undecidability.TM.Single.StepTM]
pat:41 [binder, in Undecidability.TM.Code.BinNumbers.PosCompareTM]
pat:41 [binder, in Complexity.NP.L.GenNPBool]
pat:41 [binder, in Undecidability.L.Functions.Size]
pat:411 [binder, in Undecidability.TM.Hoare.HoareCombinators]
pat:415 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
pat:419 [binder, in Undecidability.TM.Hoare.HoareCombinators]
pat:42 [binder, in Undecidability.TM.Basic.Mono]
pat:42 [binder, in Undecidability.TM.Hoare.HoareMult]
pat:42 [binder, in Undecidability.TM.L.Transcode.Enc_to_Boollist]
pat:424 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
pat:43 [binder, in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
pat:43 [binder, in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
pat:43 [binder, in Complexity.NP.TM.M_LM2TM]
pat:43 [binder, in Complexity.NP.TM.M_multi2mono]
pat:43 [binder, in Complexity.L.AbstractMachines.Computable.LargestVar]
pat:432 [binder, in Undecidability.TM.Single.StepTM]
pat:44 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds_Loop]
pat:44 [binder, in Complexity.L.AbstractMachines.FlatPro.Computable.Compile]
pat:45 [binder, in Undecidability.TM.Code.List.Concat_Repeat]
pat:45 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
pat:45 [binder, in Undecidability.TM.Lifting.LiftAlphabet]
pat:45 [binder, in Undecidability.TM.L.HeapInterpreter.LookupTM]
pat:45 [binder, in Undecidability.TM.L.Transcode.Enc_to_Boollist]
pat:45 [binder, in Complexity.Complexity.NP]
pat:46 [binder, in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
pat:46 [binder, in Complexity.NP.TM.M_LM2TM]
pat:46 [binder, in Undecidability.L.Complexity.GenericNary]
pat:46 [binder, in Undecidability.TM.Hoare.HoareMult]
pat:46 [binder, in Undecidability.L.Functions.Size]
pat:46 [binder, in Undecidability.TM.Code.BinNumbers.PosShiftTM]
pat:464 [binder, in Undecidability.TM.Single.StepTM]
pat:47 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds_Loop]
pat:47 [binder, in Undecidability.TM.Basic.Mono]
pat:47 [binder, in Complexity.NP.TM.TMGenNP]
pat:47 [binder, in Undecidability.TM.Code.NatSub]
pat:48 [binder, in Undecidability.TM.TM]
pat:48 [binder, in Undecidability.TM.L.Transcode.Enc_to_Boollist]
pat:48 [binder, in Complexity.L.AbstractMachines.Computable.LargestVar]
pat:480 [binder, in Undecidability.TM.Single.StepTM]
pat:49 [binder, in Complexity.L.AbstractMachines.UnfoldTailRec]
pat:49 [binder, in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
pat:49 [binder, in Undecidability.TM.SBTM]
pat:49 [binder, in Undecidability.TM.Code.BinNumbers.PosAddTM]
pat:5 [binder, in Complexity.L.AbstractMachines.Computable.EvalForTime]
pat:5 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
pat:5 [binder, in Undecidability.TM.Code.BinNumbers.PosCompareTM]
pat:5 [binder, in Undecidability.TM.Code.BinNumbers.NTM]
pat:5 [binder, in Complexity.L.AbstractMachines.Computable.LargestVar]
pat:5 [binder, in Undecidability.TM.Code.BinNumbers.PosShiftTM]
pat:50 [binder, in Undecidability.TM.Code.BinNumbers.PosCompareTM]
pat:50 [binder, in Undecidability.TM.Compound.Compare]
pat:50 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
pat:50 [binder, in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
pat:51 [binder, in Undecidability.TM.Code.List.Concat_Repeat]
pat:51 [binder, in Undecidability.TM.Code.BinNumbers.PosMultTM]
pat:51 [binder, in Undecidability.TM.Code.NatSub]
pat:51 [binder, in Undecidability.TM.Hoare.HoareMult]
pat:510 [binder, in Undecidability.TM.Single.StepTM]
pat:52 [binder, in Undecidability.TM.Code.List.Rev]
pat:52 [binder, in Complexity.NP.TM.TMGenNP]
pat:52 [binder, in Undecidability.TM.L.Transcode.Enc_to_Boollist]
pat:54 [binder, in Undecidability.TM.Code.NatSub]
pat:56 [binder, in Undecidability.TM.Hoare.HoareMult]
pat:56 [binder, in Undecidability.TM.L.Transcode.Enc_to_Boollist]
pat:57 [binder, in Complexity.NP.SAT.SAT_inNP]
pat:57 [binder, in Undecidability.TM.TM]
pat:57 [binder, in Complexity.L.AbstractMachines.FunctionalDefinitions]
pat:58 [binder, in Undecidability.L.Computability.Synthetic]
pat:58 [binder, in Undecidability.TM.Code.BinNumbers.PosShiftTM]
pat:59 [binder, in Undecidability.TM.Code.List.Nth]
pat:59 [binder, in Undecidability.TM.L.Transcode.Enc_to_Boollist]
pat:59 [binder, in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
pat:6 [binder, in Undecidability.TM.Code.CaseNat]
pat:6 [binder, in Undecidability.TM.Code.CaseBool]
pat:6 [binder, in Complexity.Complexity.Subtypes]
pat:6 [binder, in Complexity.NP.TM.TMGenNP]
pat:6 [binder, in Complexity.NP.TM.L_to_LM]
pat:6 [binder, in Undecidability.TM.L.CaseCom]
pat:6 [binder, in Complexity.NP.L.GenNP]
pat:6 [binder, in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
pat:60 [binder, in Undecidability.TM.Code.List.Concat_Repeat]
pat:60 [binder, in Undecidability.TM.Code.NatTM]
pat:60 [binder, in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
pat:60 [binder, in Undecidability.TM.Hoare.HoareMult]
pat:608 [binder, in Complexity.NP.TM.LM_to_mTM]
pat:61 [binder, in Undecidability.L.Computability.Synthetic]
pat:612 [binder, in Complexity.NP.TM.LM_to_mTM]
pat:619 [binder, in Complexity.NP.TM.LM_to_mTM]
pat:623 [binder, in Complexity.NP.TM.LM_to_mTM]
pat:63 [binder, in Undecidability.TM.Code.List.Nth]
pat:63 [binder, in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
pat:63 [binder, in Undecidability.TM.Code.BinNumbers.PosShiftTM]
pat:64 [binder, in Undecidability.TM.Code.List.Concat_Repeat]
pat:65 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
pat:65 [binder, in Complexity.TM.Code.Decode]
pat:65 [binder, in Complexity.L.AbstractMachines.FunctionalDefinitions]
pat:65 [binder, in Undecidability.TM.Code.BinNumbers.PosAddTM]
pat:66 [binder, in Complexity.Complexity.Subtypes]
pat:66 [binder, in Undecidability.TM.Univ.LowLevel]
pat:67 [binder, in Undecidability.TM.Code.List.Concat_Repeat]
pat:68 [binder, in Undecidability.TM.Code.List.Nth]
pat:68 [binder, in Complexity.Complexity.Subtypes]
pat:68 [binder, in Complexity.TM.Single.DecodeTape]
pat:68 [binder, in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
pat:68 [binder, in Undecidability.TM.Code.BinNumbers.PosShiftTM]
pat:7 [binder, in Undecidability.TM.Combinators.While]
pat:7 [binder, in Complexity.NP.TM.M_LM2TM]
pat:7 [binder, in Undecidability.TM.Basic.Duo]
pat:7 [binder, in Undecidability.TM.Compound.Shift]
pat:7 [binder, in Complexity.NP.TM.TMGenNP_fixed_mTM]
pat:70 [binder, in Undecidability.TM.L.HeapInterpreter.LookupTM]
pat:71 [binder, in Undecidability.TM.Code.BinNumbers.PosAddTM]
pat:72 [binder, in Undecidability.TM.Code.BinNumbers.PosCompareTM]
pat:73 [binder, in Undecidability.TM.Code.List.Nth]
pat:74 [binder, in Undecidability.TM.Code.CaseList]
pat:74 [binder, in Complexity.TM.Single.DecodeTape]
pat:74 [binder, in Undecidability.TM.L.HeapInterpreter.LookupTM]
pat:75 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
pat:75 [binder, in Undecidability.TM.Univ.LowLevel]
pat:76 [binder, in Undecidability.TM.Code.BinNumbers.PosAddTM]
pat:77 [binder, in Undecidability.TM.Code.List.Nth]
pat:77 [binder, in Undecidability.TM.Util.Prelim]
pat:78 [binder, in Undecidability.L.Complexity.UpToCNary]
pat:78 [binder, in Undecidability.TM.Code.BinNumbers.PosCompareTM]
pat:78 [binder, in Complexity.TM.Single.DecodeTape]
pat:78 [binder, in Undecidability.TM.Univ.Univ]
pat:8 [binder, in Complexity.L.AbstractMachines.UnfoldTailRec]
pat:8 [binder, in Undecidability.TM.Code.CaseFin]
pat:8 [binder, in Complexity.L.Functions.IterupN]
pat:8 [binder, in Undecidability.TM.Compound.CopySymbols]
pat:8 [binder, in Complexity.NP.L.LMGenNP]
pat:8 [binder, in Undecidability.TM.SBTM]
pat:8 [binder, in Complexity.NP.TM.M_multi2mono]
pat:80 [binder, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
pat:80 [binder, in Undecidability.TM.L.HeapInterpreter.LookupTM]
pat:81 [binder, in Undecidability.TM.Code.List.Nth]
pat:81 [binder, in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
pat:81 [binder, in Undecidability.TM.Util.Prelim]
pat:81 [binder, in Undecidability.TM.Univ.LookupAssociativeListTM]
pat:82 [binder, in Undecidability.L.Complexity.UpToCNary]
pat:82 [binder, in Complexity.TM.Single.DecodeTape]
pat:82 [binder, in Undecidability.TM.Univ.Univ]
pat:82 [binder, in Undecidability.TM.Code.BinNumbers.PosAddTM]
pat:84 [binder, in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
pat:84 [binder, in Undecidability.TM.Code.BinNumbers.PosShiftTM]
pat:85 [binder, in Undecidability.L.Complexity.UpToCNary]
pat:85 [binder, in Undecidability.TM.Code.List.Nth]
pat:85 [binder, in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
pat:85 [binder, in Undecidability.TM.Univ.LookupAssociativeListTM]
pat:85 [binder, in Undecidability.TM.L.HeapInterpreter.LookupTM]
pat:86 [binder, in Complexity.NP.Clique.kSAT_to_Clique]
pat:86 [binder, in Undecidability.TM.Univ.Univ]
pat:88 [binder, in Undecidability.L.Complexity.UpToCNary]
pat:88 [binder, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
pat:89 [binder, in Undecidability.TM.L.HeapInterpreter.LookupTM]
pat:9 [binder, in Complexity.TM.Code.DecodeList]
pat:9 [binder, in Undecidability.Shared.embed_nat]
pat:9 [binder, in Undecidability.TM.Univ.LowLevel]
pat:90 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
pat:90 [binder, in Undecidability.TM.Code.List.Nth]
pat:90 [binder, in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
pat:90 [binder, in Undecidability.TM.Univ.LookupAssociativeListTM]
pat:90 [binder, in Undecidability.TM.Univ.Univ]
pat:91 [binder, in Undecidability.L.Complexity.UpToCNary]
pat:924 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
pat:93 [binder, in Undecidability.TM.L.HeapInterpreter.LookupTM]
pat:93 [binder, in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
pat:94 [binder, in Undecidability.L.Complexity.UpToCNary]
pat:94 [binder, in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
pat:94 [binder, in Undecidability.TM.Univ.Univ]
pat:94 [binder, in Undecidability.TM.Code.BinNumbers.PosShiftTM]
pat:95 [binder, in Undecidability.TM.Code.List.Nth]
pat:95 [binder, in Undecidability.TM.Univ.LookupAssociativeListTM]
pat:96 [binder, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
pat:97 [binder, in Undecidability.TM.L.HeapInterpreter.LookupTM]
pat:98 [binder, in Undecidability.TM.Univ.Univ]
pat:98 [binder, in Undecidability.TM.Code.BinNumbers.PosAddTM]
pat:99 [binder, in Undecidability.TM.Code.List.Nth]
pat:99 [binder, in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
pat:99 [binder, in Undecidability.TM.Hoare.HoareMult]
pat:99 [binder, in Undecidability.TM.Univ.LookupAssociativeListTM]
Pcards [projection, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
Pdec:117 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_base]
Pdec:5 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_dec]
Permutation_In_inv [lemma, in Undecidability.Shared.Libs.DLW.Utils.php]
Permutation_tools.X [variable, in Undecidability.Shared.Libs.DLW.Utils.php]
Permutation_tools [section, in Undecidability.Shared.Libs.DLW.Utils.php]
perm_list_has_dup [lemma, in Undecidability.Shared.Libs.DLW.Utils.php]
perm_in_head [lemma, in Undecidability.Shared.Libs.DLW.Utils.php]
perm_incl_right [lemma, in Undecidability.Shared.Libs.DLW.Utils.php]
perm_incl_left [lemma, in Undecidability.Shared.Libs.DLW.Utils.php]
perm_seteq [lemma, in Undecidability.Shared.Libs.DLW.Utils.seteq]
Pfinal [projection, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
pFlipAlphabet [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
pFlipAlphabet_pFlipGamma_eqn [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
phi:112 [binder, in Undecidability.L.Tactics.Reflection]
phi:13 [binder, in Undecidability.L.Tactics.Reflection]
phi:15 [binder, in Undecidability.L.Tactics.Reflection]
phi:17 [binder, in Undecidability.L.Tactics.Reflection]
phi:21 [binder, in Undecidability.L.Tactics.Reflection]
phi:271 [binder, in Undecidability.L.Tactics.Reflection]
phi:283 [binder, in Undecidability.L.Tactics.Reflection]
phi:286 [binder, in Undecidability.L.Tactics.Reflection]
phi:289 [binder, in Undecidability.L.Tactics.Reflection]
phi:290 [binder, in Undecidability.L.Tactics.Reflection]
phi:292 [binder, in Undecidability.L.Tactics.Reflection]
phi:294 [binder, in Undecidability.L.Tactics.Reflection]
phi:297 [binder, in Undecidability.L.Tactics.Reflection]
phi:302 [binder, in Undecidability.L.Tactics.Reflection]
phi:307 [binder, in Undecidability.L.Tactics.Reflection]
phi:316 [binder, in Undecidability.L.Tactics.Reflection]
phi:319 [binder, in Undecidability.L.Tactics.Reflection]
phi:32 [binder, in Undecidability.L.Tactics.Reflection]
phi:80 [binder, in Undecidability.L.Tactics.Reflection]
phi:82 [binder, in Undecidability.L.Tactics.Reflection]
phi:9 [binder, in Undecidability.L.Tactics.Reflection]
phi:92 [binder, in Undecidability.L.Tactics.Reflection]
php [library]
php_fun [lemma, in Undecidability.Shared.Libs.DLW.Utils.sorting]
php_fun.Hf [variable, in Undecidability.Shared.Libs.DLW.Utils.sorting]
php_fun.f [variable, in Undecidability.Shared.Libs.DLW.Utils.sorting]
php_fun.n [variable, in Undecidability.Shared.Libs.DLW.Utils.sorting]
php_fun [section, in Undecidability.Shared.Libs.DLW.Utils.sorting]
php_upto [lemma, in Undecidability.Shared.Libs.DLW.Utils.php]
php_upto [section, in Undecidability.Shared.Libs.DLW.Utils.php]
PHP_rel [lemma, in Undecidability.Shared.Libs.DLW.Utils.php]
PHP_rel.Hlm [variable, in Undecidability.Shared.Libs.DLW.Utils.php]
PHP_rel.image_R_l [variable, in Undecidability.Shared.Libs.DLW.Utils.php]
PHP_rel.HR [variable, in Undecidability.Shared.Libs.DLW.Utils.php]
PHP_rel.m [variable, in Undecidability.Shared.Libs.DLW.Utils.php]
PHP_rel.l [variable, in Undecidability.Shared.Libs.DLW.Utils.php]
PHP_rel.R [variable, in Undecidability.Shared.Libs.DLW.Utils.php]
PHP_rel.V [variable, in Undecidability.Shared.Libs.DLW.Utils.php]
PHP_rel.U [variable, in Undecidability.Shared.Libs.DLW.Utils.php]
PHP_rel [section, in Undecidability.Shared.Libs.DLW.Utils.php]
pi [definition, in Undecidability.L.Computability.Acceptability]
pickx [definition, in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
pigeonhole [lemma, in Complexity.Libs.Pigeonhole]
Pigeonhole [library]
pigeonhole' [lemma, in Complexity.Libs.Pigeonhole]
pigeon_list.X [variable, in Undecidability.Shared.Libs.DLW.Utils.php]
pigeon_list [section, in Undecidability.Shared.Libs.DLW.Utils.php]
Pinit [projection, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
Pirr:41 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_base]
plus_le_proper [instance, in Undecidability.L.Prelim.MoreBase]
plus_cancel_l [lemma, in Undecidability.Shared.Libs.DLW.Utils.sums]
plus' [definition, in Undecidability.TM.Util.Prelim]
Pl:29 [binder, in Undecidability.L.Tactics.LClos]
Pl:45 [binder, in Undecidability.L.Tactics.Reflection]
pM [definition, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
pm_id [definition, in Undecidability.Shared.Libs.DLW.Vec.pos]
pm_comp_lift [lemma, in Undecidability.Shared.Libs.DLW.Vec.pos]
pm_comp [definition, in Undecidability.Shared.Libs.DLW.Vec.pos]
pm_lift_ext [lemma, in Undecidability.Shared.Libs.DLW.Vec.pos]
pm_lift_nxt [lemma, in Undecidability.Shared.Libs.DLW.Vec.pos]
pm_lift_fst [lemma, in Undecidability.Shared.Libs.DLW.Vec.pos]
pm_lift [definition, in Undecidability.Shared.Libs.DLW.Vec.pos]
pm_ext_eq [definition, in Undecidability.Shared.Libs.DLW.Vec.pos]
pM' [abbreviation, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
pM' [abbreviation, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
pM1:103 [binder, in Undecidability.TM.Hoare.HoareCombinators]
pM1:118 [binder, in Undecidability.TM.Hoare.HoareCombinators]
pM1:127 [binder, in Undecidability.TM.Hoare.HoareCombinators]
pM1:137 [binder, in Undecidability.TM.Hoare.HoareCombinators]
pM1:146 [binder, in Undecidability.TM.Hoare.HoareCombinators]
pM1:165 [binder, in Undecidability.TM.Hoare.HoareCombinators]
pM1:178 [binder, in Undecidability.TM.Hoare.HoareCombinators]
pM1:189 [binder, in Undecidability.TM.Hoare.HoareCombinators]
pM1:198 [binder, in Undecidability.TM.Hoare.HoareCombinators]
pM1:214 [binder, in Undecidability.TM.Hoare.HoareCombinators]
pM1:232 [binder, in Undecidability.TM.Hoare.HoareCombinators]
pM1:245 [binder, in Undecidability.TM.Hoare.HoareCombinators]
pM1:258 [binder, in Undecidability.TM.Hoare.HoareCombinators]
pM1:268 [binder, in Undecidability.TM.Hoare.HoareCombinators]
pM1:281 [binder, in Undecidability.TM.Hoare.HoareCombinators]
pM1:297 [binder, in Undecidability.TM.Hoare.HoareCombinators]
pM2:104 [binder, in Undecidability.TM.Hoare.HoareCombinators]
pM2:119 [binder, in Undecidability.TM.Hoare.HoareCombinators]
pM2:128 [binder, in Undecidability.TM.Hoare.HoareCombinators]
pM2:138 [binder, in Undecidability.TM.Hoare.HoareCombinators]
pM2:147 [binder, in Undecidability.TM.Hoare.HoareCombinators]
pM2:166 [binder, in Undecidability.TM.Hoare.HoareCombinators]
pM2:179 [binder, in Undecidability.TM.Hoare.HoareCombinators]
pM2:190 [binder, in Undecidability.TM.Hoare.HoareCombinators]
pM2:199 [binder, in Undecidability.TM.Hoare.HoareCombinators]
pM2:215 [binder, in Undecidability.TM.Hoare.HoareCombinators]
pM2:233 [binder, in Undecidability.TM.Hoare.HoareCombinators]
pM2:246 [binder, in Undecidability.TM.Hoare.HoareCombinators]
pM2:259 [binder, in Undecidability.TM.Hoare.HoareCombinators]
pM2:269 [binder, in Undecidability.TM.Hoare.HoareCombinators]
pM2:282 [binder, in Undecidability.TM.Hoare.HoareCombinators]
pM2:298 [binder, in Undecidability.TM.Hoare.HoareCombinators]
pM3:191 [binder, in Undecidability.TM.Hoare.HoareCombinators]
pM3:200 [binder, in Undecidability.TM.Hoare.HoareCombinators]
pM3:216 [binder, in Undecidability.TM.Hoare.HoareCombinators]
pM3:234 [binder, in Undecidability.TM.Hoare.HoareCombinators]
pM3:247 [binder, in Undecidability.TM.Hoare.HoareCombinators]
pM:103 [binder, in Undecidability.TM.Hoare.HoareRegister]
pM:111 [binder, in Undecidability.TM.Hoare.HoareRegister]
pM:112 [binder, in Undecidability.TM.Hoare.HoareLogic]
pM:123 [binder, in Undecidability.TM.Hoare.HoareLogic]
pM:134 [binder, in Undecidability.TM.Hoare.HoareLogic]
pM:143 [binder, in Undecidability.TM.Hoare.HoareLogic]
pM:16 [binder, in Undecidability.TM.Hoare.HoareLogic]
pM:17 [binder, in Undecidability.TM.Hoare.HoareCombinators]
pM:175 [binder, in Undecidability.TM.Hoare.HoareLogic]
pM:192 [binder, in Undecidability.TM.Hoare.HoareLogic]
pM:199 [binder, in Undecidability.TM.Hoare.HoareLogic]
pM:21 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
pM:210 [binder, in Undecidability.TM.Hoare.HoareLogic]
pM:222 [binder, in Undecidability.TM.Hoare.HoareLogic]
pM:232 [binder, in Undecidability.TM.Hoare.HoareLogic]
pM:236 [binder, in Undecidability.TM.Hoare.HoareLogic]
pM:24 [binder, in Undecidability.TM.Hoare.HoareLogic]
pM:240 [binder, in Undecidability.TM.Hoare.HoareRegister]
pM:246 [binder, in Undecidability.TM.Hoare.HoareLogic]
pM:254 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
pM:256 [binder, in Undecidability.TM.Hoare.HoareRegister]
pM:257 [binder, in Undecidability.TM.Hoare.HoareLogic]
pM:263 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
pM:267 [binder, in Undecidability.TM.Hoare.HoareLogic]
pM:270 [binder, in Undecidability.TM.Hoare.HoareRegister]
pM:276 [binder, in Undecidability.TM.Util.TM_facts]
pM:278 [binder, in Undecidability.TM.Hoare.HoareLogic]
pM:283 [binder, in Undecidability.TM.Util.TM_facts]
pM:284 [binder, in Undecidability.TM.Hoare.HoareRegister]
pM:285 [binder, in Undecidability.TM.Hoare.HoareLogic]
pM:286 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
pM:29 [binder, in Undecidability.TM.Hoare.HoareCombinators]
pM:292 [binder, in Undecidability.TM.Hoare.HoareLogic]
pM:299 [binder, in Undecidability.TM.Hoare.HoareRegister]
pM:30 [binder, in Undecidability.TM.Hoare.HoareLogic]
pM:300 [binder, in Undecidability.TM.Hoare.HoareLogic]
pM:306 [binder, in Undecidability.TM.Util.TM_facts]
pM:308 [binder, in Undecidability.TM.Hoare.HoareLogic]
pM:309 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
pM:313 [binder, in Undecidability.TM.Util.TM_facts]
pM:314 [binder, in Undecidability.TM.Hoare.HoareCombinators]
pM:317 [binder, in Undecidability.TM.Hoare.HoareLogic]
pM:320 [binder, in Undecidability.TM.Util.TM_facts]
pM:325 [binder, in Undecidability.TM.Hoare.HoareCombinators]
pM:326 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
pM:326 [binder, in Undecidability.TM.Util.TM_facts]
pM:328 [binder, in Undecidability.TM.Hoare.HoareLogic]
pM:333 [binder, in Undecidability.TM.Util.TM_facts]
pM:339 [binder, in Undecidability.TM.Util.TM_facts]
pM:340 [binder, in Undecidability.TM.Hoare.HoareLogic]
pM:342 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
pM:345 [binder, in Undecidability.TM.Util.TM_facts]
pM:351 [binder, in Undecidability.TM.Hoare.HoareLogic]
pM:352 [binder, in Undecidability.TM.Util.TM_facts]
pM:364 [binder, in Undecidability.TM.Hoare.HoareLogic]
pM:366 [binder, in Undecidability.TM.Hoare.HoareCombinators]
pM:372 [binder, in Undecidability.TM.Hoare.HoareRegister]
pM:372 [binder, in Undecidability.TM.Hoare.HoareLogic]
pM:376 [binder, in Undecidability.TM.Util.TM_facts]
pM:380 [binder, in Undecidability.TM.Hoare.HoareLogic]
pM:383 [binder, in Undecidability.TM.Hoare.HoareCombinators]
pM:387 [binder, in Undecidability.TM.Hoare.HoareRegister]
pM:389 [binder, in Undecidability.TM.Hoare.HoareLogic]
pM:39 [binder, in Undecidability.TM.Hoare.HoareCombinators]
pM:390 [binder, in Undecidability.TM.Util.TM_facts]
pM:398 [binder, in Undecidability.TM.Hoare.HoareLogic]
pM:406 [binder, in Undecidability.TM.Hoare.HoareRegister]
pM:425 [binder, in Undecidability.TM.Hoare.HoareRegister]
pM:428 [binder, in Undecidability.TM.Hoare.HoareCombinators]
pM:43 [binder, in Undecidability.TM.Hoare.HoareLogic]
pM:447 [binder, in Undecidability.TM.Hoare.HoareCombinators]
pM:467 [binder, in Undecidability.TM.Hoare.HoareRegister]
pM:480 [binder, in Undecidability.TM.Hoare.HoareRegister]
pM:489 [binder, in Undecidability.TM.Hoare.HoareRegister]
pM:498 [binder, in Undecidability.TM.Hoare.HoareRegister]
pM:510 [binder, in Undecidability.TM.Hoare.HoareRegister]
pM:52 [binder, in Undecidability.TM.Hoare.HoareLogic]
pM:52 [binder, in Undecidability.TM.Hoare.HoareCombinators]
pM:521 [binder, in Undecidability.TM.Hoare.HoareRegister]
pM:531 [binder, in Undecidability.TM.Hoare.HoareRegister]
pM:540 [binder, in Undecidability.TM.Hoare.HoareRegister]
pM:554 [binder, in Undecidability.TM.Hoare.HoareRegister]
pM:567 [binder, in Undecidability.TM.Hoare.HoareRegister]
pM:579 [binder, in Undecidability.TM.Hoare.HoareRegister]
pM:59 [binder, in Undecidability.TM.Hoare.HoareLogic]
pM:61 [binder, in Undecidability.TM.Hoare.HoareCombinators]
pM:66 [binder, in Undecidability.TM.Hoare.HoareLogic]
pM:71 [binder, in Undecidability.TM.Hoare.HoareLogic]
pM:73 [binder, in Undecidability.TM.Hoare.HoareCombinators]
pM:77 [binder, in Undecidability.TM.Hoare.HoareLogic]
pM:82 [binder, in Undecidability.TM.Hoare.HoareLogic]
pM:83 [binder, in Undecidability.TM.Hoare.HoareCombinators]
pM:88 [binder, in Undecidability.TM.Hoare.HoareLogic]
pM:96 [binder, in Undecidability.TM.Hoare.HoareCombinators]
pM:99 [binder, in Undecidability.TM.Hoare.HoareLogic]
pointwise_equivalence [instance, in Undecidability.L.Complexity.UpToCNary]
pointwise_transitive [instance, in Undecidability.L.Complexity.UpToCNary]
pointwise_symmetric [instance, in Undecidability.L.Complexity.UpToCNary]
pointwise_reflexive [instance, in Undecidability.L.Complexity.UpToCNary]
polarity [abbreviation, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
polarityEnv [projection, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
polarityFlip [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
polarityFlipGamma [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
polarityFlipGammaInv1 [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
polarityFlipGamma_involution [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
polarityFlipSigma [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
polarityFlipSigmaInv1 [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
polarityFlipSigma_involution [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
polarityFlipTapeSigma [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
polarityFlipTapeSigmaInv1 [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
polarityFlipTapeSigma_involution [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
polarityFlip_involution [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
polarityRev [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
polarityRev_involution [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
polarity_finRepr [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
polConst [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
polSigma [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
polVar [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
polyBoundedWitness_introSpec [constructor, in Complexity.Complexity.NP]
PolyBounds [library]
polyCertRel [record, in Complexity.Complexity.NP]
polyCertRel_compPoly [lemma, in Complexity.Complexity.NP]
polyIn__toTerm [projection, in Complexity.NP.L.CanEnumTerm_def]
polyTimeComputable [record, in Complexity.Complexity.Definitions]
PolyTimeComputable [library]
polyTimeComputable_sig_out [lemma, in Complexity.Complexity.Subtypes]
polyTimeComputable_sig_in [lemma, in Complexity.Complexity.Subtypes]
polyTimeComputable_compTime [lemma, in Complexity.Complexity.Definitions]
polyTimeComputable_intro [constructor, in Complexity.Complexity.Definitions]
polyTimeComputable_simpl [lemma, in Complexity.Complexity.PolyTimeComputable]
polyTimeComputable_eta [lemma, in Complexity.Complexity.PolyTimeComputable]
polyTimeComputable_proper_eq_flip [instance, in Complexity.Complexity.PolyTimeComputable]
polyTimeComputable_proper_eq [instance, in Complexity.Complexity.PolyTimeComputable]
polyTimeComputable_prod [lemma, in Complexity.Complexity.PolyTimeComputable]
polyTimeComputable_composition2 [lemma, in Complexity.Complexity.PolyTimeComputable]
polyTimeComputable_composition [lemma, in Complexity.Complexity.PolyTimeComputable]
poly__reductionSize [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
poly__reduction [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
poly__isValidFlatTM [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
poly__isValidFlatTrans [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
poly__isBoundTransTable [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
poly__isBoundTrans [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
poly__optBound [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
poly__isInjFinfuncTable [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
poly__allSameEntry [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
poly__reductionWfSize [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
poly__reductionWf [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
poly__flatFinalSubstringsSize [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
poly__finalSubstrings [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
poly__flatFinalSubstringsStep [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
poly__flatHaltingStates [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
poly__flatInitialStringSize [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
poly__flatInitialString [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
poly__zPflat [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
poly__zflat [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
poly__kflat [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
poly__allFlatCardsSize [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
poly__allFlatCardsLength [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
poly__allFlatCards [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
poly__flatPreludeCards [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
poly__makePreludeCardsFlat [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
poly__flatStateCards [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
poly__generateCardsForFlatLength [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
poly__generateCardsForFlat [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
poly__generateCardsForFlatHalt [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
poly__makeHaltFlat [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
poly__generateCardsForFlatNonHaltLength [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
poly__generateCardsForFlatNonHalt [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
poly__optGenerateCardsForFlatNonHalt [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
poly__makeNoneBaseFlat [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
poly__makeSomeBaseFlat [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
poly__flatTapeCardsLength [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
poly__flatTapeCards [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
poly__flatMTLCards [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
poly__flatMTICards [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
poly__flatMTRCards [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
poly__makeCardsFlat [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
poly__makeCards' [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
poly__filterSome [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
poly__makeAllEvalEnvFlatLength [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
poly__makeAllEvalEnvFlat [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
poly__prodLists [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
poly__mkVarEnv [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
poly__listProd [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
poly__generateCard [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
poly__generateAlphabetFlat [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
poly__generatePreludeSigPFlat [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
poly__generateGammaFlat [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
poly__generateStatesFlat [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
poly__generateTapeSigmaFlat [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
poly__generatePolSigmaFlat [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
poly__generateStateSigmaFlat [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
poly__generatePolarityFlat [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
poly__flatAlphabet [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
poly__flatGamma [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
poly__flatStates [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
poly__flatPolSigma [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
poly__encodeListAt [definition, in Complexity.NP.SAT.FSAT.FormulaEncoding]
poly__tabulateStep [definition, in Complexity.NP.SAT.FSAT.FormulaEncoding]
poly__kCNFDecb [definition, in Complexity.NP.SAT.kSAT]
poly__listOfFlatTypeDec [definition, in Complexity.Libs.CookPrelim.FlatFinTypes]
poly__ofFlatTypeDec [definition, in Complexity.Libs.CookPrelim.FlatFinTypes]
poly__prodLists [definition, in Complexity.Libs.CookPrelim.PolyBounds]
poly__concat [definition, in Complexity.Libs.CookPrelim.PolyBounds]
poly__dupfreeb [definition, in Complexity.Libs.CookPrelim.PolyBounds]
poly__listInclDecb [definition, in Complexity.Libs.CookPrelim.PolyBounds]
poly__listInDecb [definition, in Complexity.Libs.CookPrelim.PolyBounds]
poly__reduction [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
poly__hBinaryCC [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
poly__hfinal [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
poly__hcards [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
poly__hcard [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
poly__hflat [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
poly__hNat [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
poly__repEl [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
poly__formulaMaxVar [definition, in Complexity.NP.SAT.FSAT.FSAT]
poly__fgraphWfDecb [definition, in Complexity.NP.Clique.FlatClique]
poly__fedgesWfDecb [definition, in Complexity.NP.Clique.FlatClique]
poly__fedgesSymmetricDecb [definition, in Complexity.NP.Clique.FlatClique]
poly__isfKCliqueDecb [definition, in Complexity.NP.Clique.FlatClique]
poly__isfCliqueDecb [definition, in Complexity.NP.Clique.FlatClique]
poly__allPairsOfEdgesDecb [definition, in Complexity.NP.Clique.FlatClique]
poly__BinaryCCWfDec [definition, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
poly__encodeTableau [definition, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
poly__encodeFinalConstraint [definition, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
poly__encodeSubstringInLine' [definition, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
poly__encodeSubstringInLineP1 [definition, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
poly__encodeCardsInAllLines [definition, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
poly__encodeCardsInLine [definition, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
poly__encodeCardsInLine' [definition, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
poly__encodeCardsInLineP1 [definition, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
poly__encodeCardsAt [definition, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
poly__encodeCardAt [definition, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
poly__isValidFlatteningDec [definition, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
poly__CCCardOfFlatTypeDec [definition, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
poly__FlatCCWfDec [definition, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
poly__CCCards [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatTCC_to_FlatCC]
poly__polyTC [projection, in Complexity.Complexity.Definitions]
poly__rSP [projection, in Complexity.Complexity.Definitions]
poly__pCR [projection, in Complexity.Complexity.NP]
poly__GflatSize [definition, in Complexity.NP.Clique.kSAT_to_FlatClique]
poly__Gflat [definition, in Complexity.NP.Clique.kSAT_to_FlatClique]
poly__makeEdges [definition, in Complexity.NP.Clique.kSAT_to_FlatClique]
poly__makeEdge [definition, in Complexity.NP.Clique.kSAT_to_FlatClique]
poly__cnfGetLiteral [definition, in Complexity.NP.Clique.kSAT_to_FlatClique]
poly__toVertex [definition, in Complexity.NP.Clique.kSAT_to_FlatClique]
poly__optLiteralsConflictDecb [definition, in Complexity.NP.Clique.kSAT_to_FlatClique]
poly__allPositions [definition, in Complexity.NP.Clique.kSAT_to_FlatClique]
poly__reduction [definition, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
poly__tseytin [definition, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
poly__tseytin' [definition, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
poly__eliminateOR [definition, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
Por [definition, in Undecidability.L.Computability.Por]
Por [library]
Por_correct' [lemma, in Undecidability.L.Computability.Por]
Por_correct_2 [lemma, in Undecidability.L.Computability.Por]
Por_correct_1 [lemma, in Undecidability.L.Computability.Por]
Por_correct_1b [lemma, in Undecidability.L.Computability.Por]
Por_correct_1a [lemma, in Undecidability.L.Computability.Por]
Por_proc [lemma, in Undecidability.L.Computability.Por]
pos [section, in Complexity.L.Datatypes.LBinNums]
pos [definition, in Undecidability.Shared.Libs.PSL.Lists.Position]
pos [abbreviation, in Undecidability.Shared.Libs.DLW.Vec.pos]
pos [library]
PosAddTM [library]
PosCompareTM [library]
PosDefinitions [library]
PosHelperMachines [library]
posIn [definition, in Undecidability.Shared.FinTypeEquiv]
PosIncrementTM [library]
position [definition, in Undecidability.Shared.FinTypeEquiv]
Position [library]
position_in [lemma, in Undecidability.Shared.FinTypeEquiv]
positive [abbreviation, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
PosMultTM [library]
PosPointers [library]
PosShiftTM [library]
POST:434 [binder, in Undecidability.TM.Hoare.HoareCombinators]
pos_def [definition, in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
Pos_size_nat_leq [lemma, in Complexity.L.Datatypes.LBinNums]
pos_size_nat_leq [lemma, in Complexity.L.Datatypes.LBinNums]
pos_size_nat_eq [lemma, in Complexity.L.Datatypes.LBinNums]
pos_size_eq_log2 [lemma, in Complexity.L.Datatypes.LBinNums]
pos_size_shift_left [lemma, in Undecidability.TM.Code.BinNumbers.PosMultTM]
pos_size_add_monotone [lemma, in Undecidability.TM.Code.BinNumbers.PosMultTM]
pos_size_add [lemma, in Undecidability.TM.Code.BinNumbers.PosMultTM]
pos_size_add_carry [lemma, in Undecidability.TM.Code.BinNumbers.PosMultTM]
pos_size_lt [lemma, in Undecidability.TM.Code.BinNumbers.PosDefinitions]
pos_size_monotone [lemma, in Undecidability.TM.Code.BinNumbers.PosDefinitions]
pos_size_correct [lemma, in Undecidability.TM.Code.BinNumbers.PosDefinitions]
pos_size_append_bit [lemma, in Undecidability.TM.Code.BinNumbers.PosDefinitions]
pos_size [definition, in Undecidability.TM.Code.BinNumbers.PosDefinitions]
pos_to_bits_pushHSB [lemma, in Undecidability.TM.Code.BinNumbers.PosDefinitions]
pos_to_bits_inj [lemma, in Undecidability.TM.Code.BinNumbers.PosDefinitions]
pos_to_bits_append_bits' [lemma, in Undecidability.TM.Code.BinNumbers.PosDefinitions]
pos_to_bits_append_bits [lemma, in Undecidability.TM.Code.BinNumbers.PosDefinitions]
pos_to_bits_app_bit [lemma, in Undecidability.TM.Code.BinNumbers.PosDefinitions]
pos_to_bits_to_pos [lemma, in Undecidability.TM.Code.BinNumbers.PosDefinitions]
pos_to_bits [definition, in Undecidability.TM.Code.BinNumbers.PosDefinitions]
pos_length [lemma, in Undecidability.Shared.Libs.PSL.Lists.Position]
pos_second_S [lemma, in Undecidability.Shared.Libs.PSL.Lists.Position]
pos_first_S [lemma, in Undecidability.Shared.Libs.PSL.Lists.Position]
pos_None [lemma, in Undecidability.Shared.Libs.PSL.Lists.Position]
pos_elAt [lemma, in Undecidability.Shared.Libs.PSL.Lists.Position]
Pos_add_le_Proper [instance, in Undecidability.L.Prelim.MoreBase]
Pos_to_nat_le_Proper [instance, in Undecidability.L.Prelim.MoreBase]
pos_nondec_spec [lemma, in Undecidability.L.Datatypes.List.List_nat]
pos_nondec [definition, in Undecidability.L.Datatypes.List.List_nat]
pos_sub [section, in Complexity.L.Functions.BinNumsSub]
pos_dec_rel2fun [lemma, in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
pos_dec_reif [lemma, in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
pos_reif [abbreviation, in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
pos_reification [lemma, in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
pos_reif_t [lemma, in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
pos_not_diag_spec [lemma, in Undecidability.Shared.Libs.DLW.Vec.pos]
pos_not_diag [definition, in Undecidability.Shared.Libs.DLW.Vec.pos]
pos_prod.ll_prop [variable, in Undecidability.Shared.Libs.DLW.Vec.pos]
pos_prod.ll [variable, in Undecidability.Shared.Libs.DLW.Vec.pos]
pos_prod.n [variable, in Undecidability.Shared.Libs.DLW.Vec.pos]
pos_prod [section, in Undecidability.Shared.Libs.DLW.Vec.pos]
pos_list2nat [lemma, in Undecidability.Shared.Libs.DLW.Vec.pos]
pos_sub2nat [lemma, in Undecidability.Shared.Libs.DLW.Vec.pos]
pos_sub [definition, in Undecidability.Shared.Libs.DLW.Vec.pos]
pos_nat [definition, in Undecidability.Shared.Libs.DLW.Vec.pos]
pos_nat [section, in Undecidability.Shared.Libs.DLW.Vec.pos]
pos_map [definition, in Undecidability.Shared.Libs.DLW.Vec.pos]
pos_map [section, in Undecidability.Shared.Libs.DLW.Vec.pos]
pos_list_length [lemma, in Undecidability.Shared.Libs.DLW.Vec.pos]
pos_list_prop [lemma, in Undecidability.Shared.Libs.DLW.Vec.pos]
pos_list [definition, in Undecidability.Shared.Libs.DLW.Vec.pos]
pos_left_right_rect [lemma, in Undecidability.Shared.Libs.DLW.Vec.pos]
pos_left_right_rect.HP2 [variable, in Undecidability.Shared.Libs.DLW.Vec.pos]
pos_left_right_rect.HP1 [variable, in Undecidability.Shared.Libs.DLW.Vec.pos]
pos_left_right_rect.P [variable, in Undecidability.Shared.Libs.DLW.Vec.pos]
pos_left_right_rect.m [variable, in Undecidability.Shared.Libs.DLW.Vec.pos]
pos_left_right_rect.n [variable, in Undecidability.Shared.Libs.DLW.Vec.pos]
pos_left_right_rect [section, in Undecidability.Shared.Libs.DLW.Vec.pos]
pos_lr_both [lemma, in Undecidability.Shared.Libs.DLW.Vec.pos]
pos_both_lr [lemma, in Undecidability.Shared.Libs.DLW.Vec.pos]
pos_both_right [lemma, in Undecidability.Shared.Libs.DLW.Vec.pos]
pos_both_left [lemma, in Undecidability.Shared.Libs.DLW.Vec.pos]
pos_lr [definition, in Undecidability.Shared.Libs.DLW.Vec.pos]
pos_both [definition, in Undecidability.Shared.Libs.DLW.Vec.pos]
pos_right [definition, in Undecidability.Shared.Libs.DLW.Vec.pos]
pos_left [definition, in Undecidability.Shared.Libs.DLW.Vec.pos]
pos_eq_dec [definition, in Undecidability.Shared.Libs.DLW.Vec.pos]
pos_O_any [definition, in Undecidability.Shared.Libs.DLW.Vec.pos]
pos_S_invert [lemma, in Undecidability.Shared.Libs.DLW.Vec.pos]
pos_O_invert [lemma, in Undecidability.Shared.Libs.DLW.Vec.pos]
pos_invert.pos_invert [variable, in Undecidability.Shared.Libs.DLW.Vec.pos]
pos_invert.pos_invert_t [variable, in Undecidability.Shared.Libs.DLW.Vec.pos]
pos_invert [section, in Undecidability.Shared.Libs.DLW.Vec.pos]
pos_nxt_inj [definition, in Undecidability.Shared.Libs.DLW.Vec.pos]
pos_S_inv [definition, in Undecidability.Shared.Libs.DLW.Vec.pos]
pos_O_inv [definition, in Undecidability.Shared.Libs.DLW.Vec.pos]
pos_inv.pos_inv [variable, in Undecidability.Shared.Libs.DLW.Vec.pos]
pos_inv.pos_inv_t [variable, in Undecidability.Shared.Libs.DLW.Vec.pos]
pos_inv [section, in Undecidability.Shared.Libs.DLW.Vec.pos]
pos_iso [definition, in Undecidability.Shared.Libs.DLW.Vec.pos]
pos_nxt [abbreviation, in Undecidability.Shared.Libs.DLW.Vec.pos]
pos_fst [abbreviation, in Undecidability.Shared.Libs.DLW.Vec.pos]
pos0 [abbreviation, in Undecidability.Shared.Libs.DLW.Vec.pos]
pos1 [abbreviation, in Undecidability.Shared.Libs.DLW.Vec.pos]
pos10 [abbreviation, in Undecidability.Shared.Libs.DLW.Vec.pos]
pos11 [abbreviation, in Undecidability.Shared.Libs.DLW.Vec.pos]
pos12 [abbreviation, in Undecidability.Shared.Libs.DLW.Vec.pos]
pos13 [abbreviation, in Undecidability.Shared.Libs.DLW.Vec.pos]
pos14 [abbreviation, in Undecidability.Shared.Libs.DLW.Vec.pos]
pos15 [abbreviation, in Undecidability.Shared.Libs.DLW.Vec.pos]
pos16 [abbreviation, in Undecidability.Shared.Libs.DLW.Vec.pos]
pos17 [abbreviation, in Undecidability.Shared.Libs.DLW.Vec.pos]
pos18 [abbreviation, in Undecidability.Shared.Libs.DLW.Vec.pos]
pos19 [abbreviation, in Undecidability.Shared.Libs.DLW.Vec.pos]
pos2 [abbreviation, in Undecidability.Shared.Libs.DLW.Vec.pos]
pos2nat [definition, in Undecidability.Shared.Libs.DLW.Vec.pos]
pos2nat_right [lemma, in Undecidability.Shared.Libs.DLW.Vec.pos]
pos2nat_left [lemma, in Undecidability.Shared.Libs.DLW.Vec.pos]
pos2nat_nxt [lemma, in Undecidability.Shared.Libs.DLW.Vec.pos]
pos2nat_fst [lemma, in Undecidability.Shared.Libs.DLW.Vec.pos]
pos2nat_nat2pos [lemma, in Undecidability.Shared.Libs.DLW.Vec.pos]
pos2nat_inj [lemma, in Undecidability.Shared.Libs.DLW.Vec.pos]
pos2nat_prop [lemma, in Undecidability.Shared.Libs.DLW.Vec.pos]
pos20 [abbreviation, in Undecidability.Shared.Libs.DLW.Vec.pos]
pos3 [abbreviation, in Undecidability.Shared.Libs.DLW.Vec.pos]
pos4 [abbreviation, in Undecidability.Shared.Libs.DLW.Vec.pos]
pos5 [abbreviation, in Undecidability.Shared.Libs.DLW.Vec.pos]
pos6 [abbreviation, in Undecidability.Shared.Libs.DLW.Vec.pos]
pos7 [abbreviation, in Undecidability.Shared.Libs.DLW.Vec.pos]
pos8 [abbreviation, in Undecidability.Shared.Libs.DLW.Vec.pos]
pos9 [abbreviation, in Undecidability.Shared.Libs.DLW.Vec.pos]
pow [definition, in Undecidability.L.Prelim.ARS]
pow [inductive, in Undecidability.TM.Util.Relations]
power [abbreviation, in Undecidability.Shared.Libs.DLW.Utils.prime]
power [abbreviation, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
power [abbreviation, in Undecidability.Shared.Libs.DLW.Utils.sums]
power [definition, in Undecidability.Shared.Libs.PSL.Lists.Power]
Power [section, in Undecidability.Shared.Libs.PSL.Lists.Power]
power [abbreviation, in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
power [abbreviation, in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
power [abbreviation, in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
power [abbreviation, in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
Power [library]
PowerRep [section, in Undecidability.Shared.Libs.PSL.Lists.Power]
PowerRep.X [variable, in Undecidability.Shared.Libs.PSL.Lists.Power]
power_2_minus_1_gt [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
power_2_minus_1 [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
power_0_inv [lemma, in Undecidability.Shared.Libs.DLW.Utils.sums]
power_mono_r [lemma, in Undecidability.Shared.Libs.DLW.Utils.sums]
power_smono_l [lemma, in Undecidability.Shared.Libs.DLW.Utils.sums]
power_mono [definition, in Undecidability.Shared.Libs.DLW.Utils.sums]
power_mono_l [lemma, in Undecidability.Shared.Libs.DLW.Utils.sums]
power_ge_n [lemma, in Undecidability.Shared.Libs.DLW.Utils.sums]
power_sinc [lemma, in Undecidability.Shared.Libs.DLW.Utils.sums]
power_ge_1 [lemma, in Undecidability.Shared.Libs.DLW.Utils.sums]
power_mult [lemma, in Undecidability.Shared.Libs.DLW.Utils.sums]
power_plus [lemma, in Undecidability.Shared.Libs.DLW.Utils.sums]
power_of_1 [lemma, in Undecidability.Shared.Libs.DLW.Utils.sums]
power_of_0 [lemma, in Undecidability.Shared.Libs.DLW.Utils.sums]
power_1 [lemma, in Undecidability.Shared.Libs.DLW.Utils.sums]
power_S [lemma, in Undecidability.Shared.Libs.DLW.Utils.sums]
power_0 [lemma, in Undecidability.Shared.Libs.DLW.Utils.sums]
power_extensional [lemma, in Undecidability.Shared.Libs.PSL.Lists.Power]
power_nil [lemma, in Undecidability.Shared.Libs.PSL.Lists.Power]
power_incl [lemma, in Undecidability.Shared.Libs.PSL.Lists.Power]
power_injective.power_inj_2 [variable, in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
power_injective.power_plus_lt [variable, in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
power_2_inj [lemma, in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
power_injective.power_2_inj_1 [variable, in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
power_injective [section, in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
power_decomp_unique' [lemma, in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
power_decomp_uniq.lt_minus_cancel [variable, in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
power_decomp_uniq.power_nzero [variable, in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
power_decomp_factor [lemma, in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
power_decomp_uniq.Hp [variable, in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
power_decomp_uniq.p [variable, in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
power_decomp_uniq [section, in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
power_decomp_unique [lemma, in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
power_decomp_is_digit [lemma, in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
power_decomp_lt [lemma, in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
power_decomp.power_nzero [variable, in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
power_decomp.Hp [variable, in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
power_decomp.p [variable, in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
power_decomp [section, in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
power_decomp [library]
Power.X [variable, in Undecidability.Shared.Libs.PSL.Lists.Power]
power2_gt_0 [lemma, in Undecidability.Shared.Libs.DLW.Utils.sums]
powSk [lemma, in Undecidability.L.Util.L_facts]
pow_ecl_subrel [instance, in Undecidability.L.Prelim.ARS]
pow_add [lemma, in Undecidability.L.Prelim.ARS]
pow_star [lemma, in Undecidability.L.Prelim.ARS]
pow_Rstep [lemma, in Complexity.L.AbstractMachines.Computable.EvalForTime]
pow_app_helperR [lemma, in Undecidability.L.Tactics.Lrewrite]
pow_app_helperL [lemma, in Undecidability.L.Tactics.Lrewrite]
pow_redLe_subrelation' [lemma, in Undecidability.L.Tactics.Lrewrite]
pow_app_helper [lemma, in Undecidability.L.Tactics.Lrewrite]
pow_trans_lam [lemma, in Undecidability.L.Util.L_facts]
pow_trans_lam' [lemma, in Undecidability.L.Util.L_facts]
pow_redLe_subrelation [instance, in Undecidability.L.Util.L_facts]
pow_star_subrelation [instance, in Undecidability.L.Util.L_facts]
pow_trans [lemma, in Undecidability.L.Util.L_facts]
pow_step_congR [instance, in Undecidability.L.Util.L_facts]
pow_step_congL [instance, in Undecidability.L.Util.L_facts]
pow_le_proper [instance, in Undecidability.L.Prelim.MoreBase]
pow_plus [lemma, in Undecidability.TM.Util.Relations]
pow_S [constructor, in Undecidability.TM.Util.Relations]
pow_0 [constructor, in Undecidability.TM.Util.Relations]
pow_trans_eq [lemma, in Undecidability.L.Tactics.Lbeta]
pow_time_bound [lemma, in Complexity.Complexity.Definitions]
pow_time [definition, in Undecidability.L.Datatypes.LNat]
pow0_refl [instance, in Undecidability.L.Util.L_facts]
pow2 [definition, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
pow2_bound.loop_prop [variable, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
pow2_bound.loop [variable, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
pow2_bound [section, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
pow2_dec_ge1 [lemma, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
pow2_dec_uniq [lemma, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
pow2_2n1_dec [lemma, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
pow2_ge1 [lemma, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
pow2_fix1 [lemma, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
pow2_fix0 [lemma, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
predicate [definition, in Complexity.NP.SAT.FSAT.FormulaEncoding]
predT:97 [binder, in Complexity.Libs.CookPrelim.PolyBounds]
pred:2637 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
pred:2648 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
pred:2674 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
prefInj:73 [binder, in Complexity.TM.Code.Decode]
prefix [section, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
prefix [definition, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
prefix [definition, in Complexity.Libs.CookPrelim.MorePrelim]
prefixInjective [definition, in Complexity.TM.Code.Decode]
prefix_app_lft_inv [lemma, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
prefix_spec [definition, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
prefix_app_inv [lemma, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
prefix_rect [definition, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
prefix_trans [lemma, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
prefix_refl [lemma, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
prefix_list_inv [lemma, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
prefix_inv [lemma, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
prefix_app_lft [lemma, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
prefix_length [lemma, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
prefix.prefix_rect.HP1 [variable, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
prefix.prefix_rect.HP0 [variable, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
prefix.prefix_rect.P [variable, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
prefix.prefix_rect [section, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
prefix.X [variable, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
pRel [definition, in Undecidability.TM.Util.TM_facts]
Prelim [library]
Prelim [library]
preludeInitialPred [definition, in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
preludeInitialString [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
preludeInitialString_length [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
preludeRule [abbreviation, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
preludeRules [inductive, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
preludeSig [abbreviation, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
preludeSigP_finRepr [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
preludeSigP_finTypeC [instance, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
preludeSigP_eqTypeC [instance, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
preludeSig' [inductive, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
prelude_ok [lemma, in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
prelude_reduction_from_ExPTCC [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
prelude_sound [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
prelude_complete [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
prelude_whole_string_covering_unique [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
prelude_whole_string_covering [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
prelude_left_covering_blank_unique [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
prelude_left_covering_blank [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
prelude_center_covering_state_unique [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
prelude_center_covering_state [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
prelude_right_half_covering_input_unique' [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
prelude_right_half_covering_input_unique [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
prelude_right_half_covering_input [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
prelude_right_half_covering_cert_unique' [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
prelude_right_half_covering_cert_unique [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
prelude_right_half_covering_cert' [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
prelude_right_half_covering_cert [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
prelude_right_half_covering_blank [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
prelude_blank_tape_covering_right_unique [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
prelude_blank_tape_covering_right [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
prem [projection, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
prem [projection, in Complexity.NP.SAT.CookLevin.Subproblems.CC]
preprocessT:23 [binder, in Undecidability.L.Functions.UnboundIteration]
preprocess:22 [binder, in Undecidability.L.Functions.UnboundIteration]
PrettyBounds [library]
PRE:432 [binder, in Undecidability.TM.Hoare.HoareCombinators]
prime [definition, in Undecidability.Shared.Libs.DLW.Utils.prime]
prime [section, in Undecidability.Shared.Libs.DLW.Utils.prime]
prime [library]
prime_decomp_uniq [lemma, in Undecidability.Shared.Libs.DLW.Utils.prime]
prime_in_decomp [lemma, in Undecidability.Shared.Libs.DLW.Utils.prime]
prime_decomp [lemma, in Undecidability.Shared.Libs.DLW.Utils.prime]
prime_rect [lemma, in Undecidability.Shared.Libs.DLW.Utils.prime]
prime_factor [lemma, in Undecidability.Shared.Libs.DLW.Utils.prime]
prime_or_div [definition, in Undecidability.Shared.Libs.DLW.Utils.prime]
prime_div_mult [lemma, in Undecidability.Shared.Libs.DLW.Utils.prime]
prime_gcd [lemma, in Undecidability.Shared.Libs.DLW.Utils.prime]
prime_ge_2 [lemma, in Undecidability.Shared.Libs.DLW.Utils.prime]
prime_bool_spec [lemma, in Undecidability.Shared.Libs.DLW.Utils.prime]
prime_bool [definition, in Undecidability.Shared.Libs.DLW.Utils.prime]
prime_bool_rec_spec [lemma, in Undecidability.Shared.Libs.DLW.Utils.prime]
prime_bool_rec [definition, in Undecidability.Shared.Libs.DLW.Utils.prime]
prime_algo [lemma, in Undecidability.Shared.Libs.DLW.Utils.prime]
prime_2 [lemma, in Undecidability.Shared.Libs.DLW.Utils.prime]
prime.prime_rect.HPm [variable, in Undecidability.Shared.Libs.DLW.Utils.prime]
prime.prime_rect.HPp [variable, in Undecidability.Shared.Libs.DLW.Utils.prime]
prime.prime_rect.HP1 [variable, in Undecidability.Shared.Libs.DLW.Utils.prime]
prime.prime_rect.HP0 [variable, in Undecidability.Shared.Libs.DLW.Utils.prime]
prime.prime_rect.P [variable, in Undecidability.Shared.Libs.DLW.Utils.prime]
prime.prime_rect [section, in Undecidability.Shared.Libs.DLW.Utils.prime]
_ <d _ [notation, in Undecidability.Shared.Libs.DLW.Utils.prime]
Private_UnfoldClos.SpecT [lemma, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
Private_UnfoldClos.steps [definition, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
Private_UnfoldClos.M [definition, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
Private_UnfoldClos.SpecT__loop [lemma, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
Private_UnfoldClos.steps_loop [definition, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
Private_UnfoldClos.tspec_revertPure [lemma, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
Private_UnfoldClos.M__loop [definition, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
Private_UnfoldClos.SpecT__step [lemma, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
Private_UnfoldClos.steps_step [definition, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
Private_UnfoldClos.M__step [definition, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
Private_UnfoldClos.i_aux4 [abbreviation, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
Private_UnfoldClos.i_aux3 [abbreviation, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
Private_UnfoldClos.i_aux2 [abbreviation, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
Private_UnfoldClos.i_aux1 [abbreviation, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
Private_UnfoldClos.i_res [abbreviation, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
Private_UnfoldClos.i_stack' [abbreviation, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
Private_UnfoldClos.i_k [abbreviation, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
Private_UnfoldClos.i_P [abbreviation, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
Private_UnfoldClos.i_a [abbreviation, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
Private_UnfoldClos.i_H [abbreviation, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
Private_UnfoldClos.Lookup [definition, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
Private_UnfoldClos.retr_nat_stack [definition, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
Private_UnfoldClos.retr_stackEl [definition, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
Private_UnfoldClos.retr_nat_clos_var [definition, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
Private_UnfoldClos.retr_nat_clos_var' [definition, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
Private_UnfoldClos.retr_nat_clos_ad [definition, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
Private_UnfoldClos.retr_nat_clos_ad' [definition, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
Private_UnfoldClos.retr_com [definition, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
Private_UnfoldClos.retr_pro [definition, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
Private_UnfoldClos.retr_clos [definition, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
Private_UnfoldClos.Fix.retr_heap [variable, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
Private_UnfoldClos.Fix.retr_stack [variable, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
Private_UnfoldClos.Fix.Σ [variable, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
Private_UnfoldClos.Fix [section, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
Private_UnfoldClos [module, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
Pro [abbreviation, in Undecidability.L.AbstractMachines.FlatPro.ProgramsDef]
proc [definition, in Undecidability.L.Util.L_facts]
Proc [definition, in Undecidability.L.Tactics.Reflection]
Proc [library]
proc_enc [projection, in Undecidability.L.Tactics.Extract]
proc_extT [lemma, in Undecidability.L.Tactics.ComputableTime]
proc_test [lemma, in Undecidability.L.Computability.Synthetic]
proc_lambda [lemma, in Undecidability.L.Tactics.Lproc]
proc_closed [lemma, in Undecidability.L.Tactics.Lproc]
proc_ext [lemma, in Undecidability.L.Tactics.Computable]
ProdCount [lemma, in Undecidability.Shared.Libs.PSL.FiniteTypes.VectorFin]
ProdCount [lemma, in Undecidability.Shared.Libs.PSL.FiniteTypes.CompoundFinTypes]
prodLists [definition, in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
prodLists_poly [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
prodLists_time_bound [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
prodLists_time [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
prodLists_time [definition, in Undecidability.L.Datatypes.List.List_extra]
prodLists_poly [lemma, in Complexity.Libs.CookPrelim.PolyBounds]
prodLists_time_bound [lemma, in Complexity.Libs.CookPrelim.PolyBounds]
prodLists_bound.Y [variable, in Complexity.Libs.CookPrelim.PolyBounds]
prodLists_bound.X [variable, in Complexity.Libs.CookPrelim.PolyBounds]
prodLists_bound [section, in Complexity.Libs.CookPrelim.PolyBounds]
prodLists_length [lemma, in Complexity.Libs.CookPrelim.MorePrelim]
prod_eqb_spec [lemma, in Undecidability.L.Datatypes.LProd]
prod_eqb [definition, in Undecidability.L.Datatypes.LProd]
prod_eq_dec [instance, in Undecidability.Shared.Libs.PSL.EqDec]
prod_nil [lemma, in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
prod_enum [definition, in Undecidability.Synthetic.EnumerabilityFacts]
prod_enum_ok [lemma, in Undecidability.Shared.Libs.PSL.FiniteTypes.VectorFin]
prod_eq [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
prod_eq_dec [instance, in Undecidability.Shared.Dec]
prod_decode [definition, in Undecidability.L.Functions.Decoding]
prod_enum_ok [lemma, in Undecidability.Shared.Libs.PSL.FiniteTypes.CompoundFinTypes]
ProgrammingTools [library]
Programs [library]
ProgramsDef [library]
projection [lemma, in Undecidability.Synthetic.MoreEnumerabilityFacts]
projection [lemma, in Undecidability.Synthetic.ListEnumerabilityFacts]
projection [lemma, in Undecidability.L.Computability.Synthetic]
projection' [lemma, in Undecidability.Synthetic.MoreEnumerabilityFacts]
projection' [lemma, in Undecidability.Synthetic.ListEnumerabilityFacts]
projVars [definition, in Complexity.NP.SAT.FSAT.FormulaEncoding]
projVars_mul_offset [lemma, in Complexity.NP.SAT.FSAT.FormulaEncoding]
projVars_combined2 [lemma, in Complexity.NP.SAT.FSAT.FormulaEncoding]
projVars_combined1 [lemma, in Complexity.NP.SAT.FSAT.FormulaEncoding]
projVars_in_ge [lemma, in Complexity.NP.SAT.FSAT.FormulaEncoding]
projVars_length_le2 [lemma, in Complexity.NP.SAT.FSAT.FormulaEncoding]
projVars_length_le [lemma, in Complexity.NP.SAT.FSAT.FormulaEncoding]
projVars_add [lemma, in Complexity.NP.SAT.FSAT.FormulaEncoding]
projVars_comp [lemma, in Complexity.NP.SAT.FSAT.FormulaEncoding]
projVars_all [lemma, in Complexity.NP.SAT.FSAT.FormulaEncoding]
projVars_app3 [lemma, in Complexity.NP.SAT.FSAT.FormulaEncoding]
projVars_app2 [lemma, in Complexity.NP.SAT.FSAT.FormulaEncoding]
projVars_app1 [lemma, in Complexity.NP.SAT.FSAT.FormulaEncoding]
projVars_length [lemma, in Complexity.NP.SAT.FSAT.FormulaEncoding]
Properties [section, in Undecidability.Synthetic.InformativeReducibilityFacts]
Properties [section, in Undecidability.Synthetic.ReducibilityFacts]
Properties.P [variable, in Undecidability.Synthetic.InformativeReducibilityFacts]
Properties.P [variable, in Undecidability.Synthetic.ReducibilityFacts]
Properties.Q [variable, in Undecidability.Synthetic.InformativeReducibilityFacts]
Properties.Q [variable, in Undecidability.Synthetic.ReducibilityFacts]
Properties.R [variable, in Undecidability.Synthetic.InformativeReducibilityFacts]
Properties.R [variable, in Undecidability.Synthetic.ReducibilityFacts]
Properties.X [variable, in Undecidability.Synthetic.InformativeReducibilityFacts]
Properties.X [variable, in Undecidability.Synthetic.ReducibilityFacts]
Properties.Y [variable, in Undecidability.Synthetic.InformativeReducibilityFacts]
Properties.Y [variable, in Undecidability.Synthetic.ReducibilityFacts]
Properties.Z [variable, in Undecidability.Synthetic.InformativeReducibilityFacts]
Properties.Z [variable, in Undecidability.Synthetic.ReducibilityFacts]
proper_le_pow [instance, in Complexity.Libs.CookPrelim.PolyBounds]
proper_lt_add [instance, in Complexity.Libs.CookPrelim.PolyBounds]
proper_lt_mul [instance, in Complexity.Libs.CookPrelim.PolyBounds]
proper_le_pow [instance, in Complexity.Complexity.UpToCPoly]
proper_lt_add [instance, in Complexity.Complexity.UpToCPoly]
proper_lt_mul [instance, in Complexity.Complexity.UpToCPoly]
Proper_decidable [instance, in Undecidability.Synthetic.DecidabilityFacts]
Proper_decides [instance, in Undecidability.Synthetic.DecidabilityFacts]
Proper_tabulate [instance, in Undecidability.TM.L.CompilerBoolFuns.Compiler]
proveOne [lemma, in Undecidability.Shared.Libs.PSL.FiniteTypes.CompoundFinTypes]
pro_enum_term [lemma, in Complexity.NP.L.CanEnumTerm]
pr:137 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
pr:139 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
pr:14 [binder, in Complexity.NP.SAT.CookLevin.Reductions.CC_to_BinaryCC]
pr:15 [binder, in Complexity.NP.SAT.CookLevin.Reductions.CC_to_BinaryCC]
pr:26 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.CC]
pr:27 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.CC]
pr:3697 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
pr:50 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
pr:85 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
pr:96 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
PSigma [projection, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
Psteps [projection, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
Ps:101 [binder, in Undecidability.TM.Hoare.HoareRegister]
Ps:108 [binder, in Undecidability.TM.Hoare.HoareRegister]
Ps:30 [binder, in Undecidability.TM.Hoare.HoareRegister]
Ps:39 [binder, in Undecidability.TM.Hoare.HoareRegister]
Ps:44 [binder, in Undecidability.TM.Hoare.HoareRegister]
Ps:58 [binder, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
Ps:74 [binder, in Undecidability.TM.Hoare.HoareRegister]
Ps:79 [binder, in Undecidability.TM.Hoare.HoareRegister]
Ps:81 [binder, in Undecidability.TM.Hoare.HoareRegister]
Ps:83 [binder, in Undecidability.TM.Hoare.HoareRegister]
Ps:89 [binder, in Undecidability.TM.Hoare.HoareRegister]
Ps:95 [binder, in Undecidability.TM.Hoare.HoareRegister]
PTCC [record, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
PTCCLang [definition, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
PTCC_wellformed [definition, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
PTCC_Preludes [library]
pTC_pow_c [lemma, in Complexity.Complexity.PolyTimeComputable]
pTC_max [lemma, in Complexity.Complexity.PolyTimeComputable]
pTC_plus [lemma, in Complexity.Complexity.PolyTimeComputable]
pTC_mult [lemma, in Complexity.Complexity.PolyTimeComputable]
pTC_S [lemma, in Complexity.Complexity.PolyTimeComputable]
pTC_id [lemma, in Complexity.Complexity.PolyTimeComputable]
pTC_cnst [lemma, in Complexity.Complexity.PolyTimeComputable]
pTC_snd [lemma, in Complexity.Complexity.PolyTimeComputable]
pTC_fst [lemma, in Complexity.Complexity.PolyTimeComputable]
pTC_destructuringToProj [lemma, in Complexity.Complexity.PolyTimeComputable]
pTC_inl [lemma, in Complexity.NP.TM.LM_to_mTM]
pTC_Encode_Prog [lemma, in Complexity.NP.TM.LM_to_mTM]
pTC_Encode_Com [lemma, in Complexity.NP.TM.LM_to_mTM]
pTC_initValue [lemma, in Complexity.NP.TM.LM_to_mTM]
pTC_app [lemma, in Complexity.NP.TM.LM_to_mTM]
pTC_concat [lemma, in Complexity.NP.TM.LM_to_mTM]
pTC_map [lemma, in Complexity.NP.TM.LM_to_mTM]
pTC_Vector_cons [lemma, in Complexity.NP.TM.LM_to_mTM]
pTC_cons [lemma, in Complexity.NP.TM.LM_to_mTM]
pTC_Code_size [lemma, in Complexity.NP.TM.LM_to_mTM]
pTC_length [lemma, in Complexity.NP.TM.LM_to_mTM]
pTM [definition, in Undecidability.TM.Util.TM_facts]
pT:27 [binder, in Undecidability.L.TM.TapeFuns]
pT:37 [binder, in Undecidability.L.TM.TapeFuns]
pT:39 [binder, in Undecidability.L.Datatypes.List.List_basics]
pT:889 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
pure [definition, in Undecidability.Shared.Libs.PSL.FiniteTypes.Arbitrary]
pure_eq [lemma, in Undecidability.Shared.Libs.PSL.FiniteTypes.Arbitrary]
pure_impure [lemma, in Undecidability.Shared.Libs.PSL.FiniteTypes.Arbitrary]
pure_equiv [lemma, in Undecidability.Shared.Libs.PSL.FiniteTypes.Arbitrary]
purify [lemma, in Undecidability.Shared.Libs.PSL.FiniteTypes.Arbitrary]
pushHFS_append2 [lemma, in Undecidability.TM.Code.BinNumbers.PosIncrementTM]
pushHFS_append1 [lemma, in Undecidability.TM.Code.BinNumbers.PosIncrementTM]
pushHFS_append2' [lemma, in Undecidability.TM.Code.BinNumbers.PosAddTM]
pushHFS_append1' [lemma, in Undecidability.TM.Code.BinNumbers.PosAddTM]
pushHSB [definition, in Undecidability.TM.Code.BinNumbers.PosDefinitions]
PushHSB [definition, in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
PushHSB_Sem [lemma, in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
PushHSB_steps [definition, in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
PushHSB_Rel [definition, in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
put [definition, in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
put [definition, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
Put [definition, in Undecidability.TM.L.HeapInterpreter.StepTM]
putEndAtFirst [definition, in Complexity.NP.TM.M_multi2mono]
putEndAtFirst_to_list [lemma, in Complexity.NP.TM.M_multi2mono]
putEndAtFirst_dupfree [lemma, in Complexity.NP.TM.M_multi2mono]
putEnd_invL [lemma, in Complexity.NP.TM.M_multi2mono]
putFirst [section, in Complexity.NP.TM.M_multi2mono]
putFirstAtEnd [definition, in Complexity.NP.TM.M_multi2mono]
putFirstAtEnd_to_list [lemma, in Complexity.NP.TM.M_multi2mono]
putFirstAtEnd_dupfree [lemma, in Complexity.NP.TM.M_multi2mono]
putFirst.printFin [section, in Complexity.NP.TM.M_multi2mono]
put_get [instance, in Complexity.L.AbstractMachines.Computable.Shared]
put_extends [lemma, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
Put_Terminates [lemma, in Undecidability.TM.L.HeapInterpreter.StepTM]
Put_T [definition, in Undecidability.TM.L.HeapInterpreter.StepTM]
Put_steps [definition, in Undecidability.TM.L.HeapInterpreter.StepTM]
Put_Realise [lemma, in Undecidability.TM.L.HeapInterpreter.StepTM]
Put_Rel [definition, in Undecidability.TM.L.HeapInterpreter.StepTM]
Put_size [definition, in Undecidability.TM.L.HeapInterpreter.StepTM]
put_extends [lemma, in Complexity.L.AbstractMachines.AbstractHeapMachine]
Pv:31 [binder, in Undecidability.TM.Hoare.HoareRegister]
Pv:40 [binder, in Undecidability.TM.Hoare.HoareRegister]
Pv:45 [binder, in Undecidability.TM.Hoare.HoareRegister]
px:13 [binder, in Undecidability.TM.Code.BinNumbers.PosShiftTM]
px:17 [binder, in Undecidability.TM.Code.BinNumbers.PosShiftTM]
px:20 [binder, in Undecidability.TM.Code.BinNumbers.PosMultTM]
px:25 [binder, in Undecidability.TM.Code.BinNumbers.PosMultTM]
px:26 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.Arbitrary]
px:29 [binder, in Undecidability.TM.Code.BinNumbers.PosShiftTM]
px:33 [binder, in Undecidability.TM.Code.BinNumbers.PosShiftTM]
px:38 [binder, in Undecidability.TM.Code.BinNumbers.PosMultTM]
px:43 [binder, in Undecidability.TM.Code.BinNumbers.PosMultTM]
px:69 [binder, in Undecidability.TM.Code.BinNumbers.PosShiftTM]
px:73 [binder, in Undecidability.TM.Code.BinNumbers.PosShiftTM]
px:85 [binder, in Undecidability.TM.Code.BinNumbers.PosShiftTM]
px:89 [binder, in Undecidability.TM.Code.BinNumbers.PosShiftTM]
Px:97 [binder, in Complexity.TM.PrettyBounds.PrettyBounds]
Py:96 [binder, in Complexity.TM.PrettyBounds.PrettyBounds]
p_dec:14 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
p_invariant [lemma, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
P__dec:21 [binder, in Complexity.Complexity.Definitions]
P__dec:15 [binder, in Complexity.Complexity.Definitions]
P_NP_incl [lemma, in Complexity.Complexity.NP]
p__pCR [projection, in Complexity.Complexity.NP]
P':101 [binder, in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
p':104 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p':119 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
P':123 [binder, in Undecidability.TM.Hoare.HoareRegister]
P':125 [binder, in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
p':125 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p':132 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p':1421 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p':1426 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p':1464 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p':1466 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p':1473 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p':1479 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p':1508 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p':1511 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
P':153 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
P':153 [binder, in Undecidability.TM.Hoare.HoareRegister]
p':153 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p':1558 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
P':156 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
p':1563 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
P':159 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
p':1601 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p':1603 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p':1610 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p':1646 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
P':174 [binder, in Undecidability.TM.Hoare.HoareRegister]
P':201 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
p':203 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p':2033 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p':2034 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p':2035 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p':2037 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p':205 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p':2065 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p':2066 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p':2067 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p':2068 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
P':207 [binder, in Undecidability.TM.Hoare.HoareRegister]
P':215 [binder, in Undecidability.TM.Hoare.HoareRegister]
P':227 [binder, in Undecidability.TM.Hoare.HoareRegister]
P':227 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
P':23 [binder, in Undecidability.L.Tactics.ComputableTactics]
P':236 [binder, in Undecidability.TM.Hoare.HoareRegister]
p':251 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
P':252 [binder, in Undecidability.TM.Hoare.HoareRegister]
p':259 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
P':26 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
P':264 [binder, in Undecidability.TM.Hoare.HoareRegister]
P':27 [binder, in Undecidability.L.Tactics.ComputableTactics]
p':274 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
P':279 [binder, in Undecidability.TM.Hoare.HoareRegister]
p':279 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
P':292 [binder, in Undecidability.TM.Hoare.HoareRegister]
P':312 [binder, in Undecidability.TM.Hoare.HoareRegister]
P':319 [binder, in Undecidability.TM.Hoare.HoareRegister]
P':329 [binder, in Undecidability.TM.Hoare.HoareRegister]
p':33 [binder, in Undecidability.L.Complexity.GenericNary]
P':348 [binder, in Undecidability.TM.Hoare.HoareRegister]
P':360 [binder, in Undecidability.TM.Hoare.HoareRegister]
P':368 [binder, in Undecidability.TM.Hoare.HoareRegister]
P':382 [binder, in Undecidability.TM.Hoare.HoareRegister]
P':397 [binder, in Undecidability.TM.Hoare.HoareRegister]
P':415 [binder, in Undecidability.TM.Hoare.HoareRegister]
P':442 [binder, in Undecidability.TM.Hoare.HoareRegister]
P':446 [binder, in Undecidability.TM.Hoare.HoareRegister]
P':451 [binder, in Undecidability.TM.Hoare.HoareCombinators]
P':464 [binder, in Undecidability.TM.Hoare.HoareRegister]
p':47 [binder, in Undecidability.L.Complexity.GenericNary]
P':478 [binder, in Undecidability.TM.Hoare.HoareRegister]
P':486 [binder, in Undecidability.TM.Hoare.HoareRegister]
P':497 [binder, in Undecidability.TM.Hoare.HoareRegister]
P':508 [binder, in Undecidability.TM.Hoare.HoareRegister]
P':520 [binder, in Undecidability.TM.Hoare.HoareRegister]
P':529 [binder, in Undecidability.TM.Hoare.HoareRegister]
P':539 [binder, in Undecidability.TM.Hoare.HoareRegister]
P':54 [binder, in Undecidability.L.AbstractMachines.FlatPro.Programs]
P':552 [binder, in Undecidability.TM.Hoare.HoareRegister]
P':566 [binder, in Undecidability.TM.Hoare.HoareRegister]
P':577 [binder, in Undecidability.TM.Hoare.HoareRegister]
P':64 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
P':7 [binder, in Complexity.L.AbstractMachines.AbstractSubstMachine]
p':99 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p0:106 [binder, in Undecidability.TM.Code.BinNumbers.PosAddTM]
p0:111 [binder, in Undecidability.TM.Code.BinNumbers.PosAddTM]
p0:15 [binder, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
p0:15 [binder, in Undecidability.TM.Code.BinNumbers.PosCompareTM]
p0:19 [binder, in Undecidability.TM.Code.BinNumbers.PosCompareTM]
p0:23 [binder, in Undecidability.TM.Code.BinNumbers.PosCompareTM]
P0:25 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds_Loop]
P0:31 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds_Loop]
p0:39 [binder, in Undecidability.TM.Code.BinNumbers.PosShiftTM]
p0:41 [binder, in Undecidability.TM.Code.BinNumbers.PosPointers]
P0:43 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds_Loop]
P0:46 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds_Loop]
P0:48 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
p0:48 [binder, in Undecidability.TM.Code.BinNumbers.PosPointers]
P0:495 [binder, in Undecidability.TM.Hoare.HoareRegister]
p0:50 [binder, in Undecidability.TM.Code.BinNumbers.PosAddTM]
P0:506 [binder, in Undecidability.TM.Hoare.HoareRegister]
p0:51 [binder, in Undecidability.TM.Code.BinNumbers.PosCompareTM]
P0:518 [binder, in Undecidability.TM.Hoare.HoareRegister]
P0:527 [binder, in Undecidability.TM.Hoare.HoareRegister]
p0:53 [binder, in Undecidability.TM.Code.BinNumbers.PosPointers]
P0:537 [binder, in Undecidability.TM.Hoare.HoareRegister]
P0:550 [binder, in Undecidability.TM.Hoare.HoareRegister]
P0:56 [binder, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
p0:56 [binder, in Undecidability.TM.Code.BinNumbers.PosAddTM]
P0:564 [binder, in Undecidability.TM.Hoare.HoareRegister]
p0:57 [binder, in Undecidability.TM.Code.BinNumbers.PosCompareTM]
P0:575 [binder, in Undecidability.TM.Hoare.HoareRegister]
p0:6 [binder, in Undecidability.TM.Code.BinNumbers.PosCompareTM]
p0:60 [binder, in Undecidability.TM.Code.BinNumbers.PosAddTM]
p0:61 [binder, in Undecidability.TM.Code.BinNumbers.PosCompareTM]
p0:65 [binder, in Undecidability.TM.Code.BinNumbers.PosCompareTM]
p0:73 [binder, in Undecidability.TM.Code.BinNumbers.PosCompareTM]
P0:78 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
p0:79 [binder, in Undecidability.TM.Code.BinNumbers.PosCompareTM]
p0:83 [binder, in Undecidability.TM.Code.BinNumbers.PosAddTM]
p0:89 [binder, in Undecidability.TM.Code.BinNumbers.PosAddTM]
P0:93 [binder, in Undecidability.TM.Hoare.HoareRegister]
p0:93 [binder, in Undecidability.TM.Code.BinNumbers.PosAddTM]
p0:95 [binder, in Undecidability.TM.Code.BinNumbers.PosShiftTM]
p0:99 [binder, in Undecidability.TM.Code.BinNumbers.PosAddTM]
p1 [abbreviation, in Undecidability.TM.Combinators.Switch]
p1:100 [binder, in Undecidability.TM.Code.BinNumbers.PosAddTM]
p1:100 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
p1:102 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
p1:106 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
p1:107 [binder, in Undecidability.TM.Code.BinNumbers.PosAddTM]
p1:111 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
p1:112 [binder, in Undecidability.TM.Code.BinNumbers.PosAddTM]
p1:113 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
p1:119 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
p1:126 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
P1:13 [binder, in Undecidability.Synthetic.DecidabilityFacts]
p1:14 [binder, in Undecidability.L.Functions.EnumInt]
P1:151 [binder, in Undecidability.TM.Hoare.HoareLogic]
P1:158 [binder, in Undecidability.TM.Hoare.HoareLogic]
P1:163 [binder, in Undecidability.TM.Hoare.HoareLogic]
P1:171 [binder, in Undecidability.TM.Hoare.HoareLogic]
p1:18 [binder, in Undecidability.TM.Code.BinNumbers.PosCompareTM]
p1:185 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
p1:187 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
P1:189 [binder, in Undecidability.TM.Hoare.HoareLogic]
p1:194 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
p1:199 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
p1:20 [binder, in Undecidability.TM.Code.BinNumbers.PosCompareTM]
P1:204 [binder, in Undecidability.TM.Hoare.HoareLogic]
p1:21 [binder, in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
P1:227 [binder, in Undecidability.TM.Hoare.HoareLogic]
p1:229 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
p1:24 [binder, in Undecidability.TM.Code.BinNumbers.PosCompareTM]
p1:30 [binder, in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
P1:301 [binder, in Undecidability.TM.Hoare.HoareLogic]
p1:32 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.Arbitrary]
p1:36 [binder, in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
p1:3612 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
P1:390 [binder, in Undecidability.TM.Hoare.HoareLogic]
p1:40 [binder, in Undecidability.TM.Code.BinNumbers.PosShiftTM]
p1:41 [binder, in Undecidability.TM.Code.BinNumbers.PosDefinitions]
p1:42 [binder, in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
p1:44 [binder, in Undecidability.TM.Code.BinNumbers.PosPointers]
p1:50 [binder, in Undecidability.TM.Code.BinNumbers.PosPointers]
p1:51 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
p1:53 [binder, in Undecidability.TM.Code.BinNumbers.PosAddTM]
p1:54 [binder, in Undecidability.TM.Code.BinNumbers.PosCompareTM]
p1:54 [binder, in Undecidability.TM.Code.BinNumbers.PosPointers]
p1:57 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
p1:57 [binder, in Undecidability.TM.Code.BinNumbers.PosAddTM]
p1:60 [binder, in Undecidability.TM.Code.BinNumbers.PosCompareTM]
p1:61 [binder, in Undecidability.TM.Code.BinNumbers.PosAddTM]
p1:62 [binder, in Undecidability.TM.Code.BinNumbers.PosCompareTM]
p1:66 [binder, in Undecidability.TM.Code.BinNumbers.PosCompareTM]
p1:66 [binder, in Complexity.NP.SAT.SAT]
p1:67 [binder, in Undecidability.L.Computability.Enum]
p1:74 [binder, in Undecidability.TM.Code.BinNumbers.PosCompareTM]
p1:75 [binder, in Undecidability.TM.Code.BinNumbers.PosDefinitions]
p1:80 [binder, in Undecidability.TM.Code.BinNumbers.PosCompareTM]
p1:81 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
p1:86 [binder, in Undecidability.TM.Code.BinNumbers.PosAddTM]
p1:9 [binder, in Undecidability.TM.Code.BinNumbers.PosCompareTM]
P1:9 [binder, in Undecidability.Synthetic.DecidabilityFacts]
p1:90 [binder, in Undecidability.TM.Code.BinNumbers.PosAddTM]
p1:94 [binder, in Undecidability.TM.Code.BinNumbers.PosAddTM]
p1:96 [binder, in Undecidability.TM.Code.BinNumbers.PosShiftTM]
P2:10 [binder, in Undecidability.Synthetic.DecidabilityFacts]
p2:101 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
p2:103 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
p2:107 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
p2:112 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
p2:114 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
p2:120 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
p2:127 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
P2:14 [binder, in Undecidability.Synthetic.DecidabilityFacts]
p2:15 [binder, in Undecidability.L.Functions.EnumInt]
P2:152 [binder, in Undecidability.TM.Hoare.HoareLogic]
P2:159 [binder, in Undecidability.TM.Hoare.HoareLogic]
P2:164 [binder, in Undecidability.TM.Hoare.HoareLogic]
P2:172 [binder, in Undecidability.TM.Hoare.HoareLogic]
p2:186 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
p2:188 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
P2:190 [binder, in Undecidability.TM.Hoare.HoareLogic]
p2:195 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
p2:200 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
P2:205 [binder, in Undecidability.TM.Hoare.HoareLogic]
P2:228 [binder, in Undecidability.TM.Hoare.HoareLogic]
p2:230 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
p2:24 [binder, in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
P2:302 [binder, in Undecidability.TM.Hoare.HoareLogic]
p2:33 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.Arbitrary]
p2:33 [binder, in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
p2:3613 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p2:37 [binder, in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
P2:391 [binder, in Undecidability.TM.Hoare.HoareLogic]
p2:42 [binder, in Undecidability.TM.Code.BinNumbers.PosDefinitions]
p2:43 [binder, in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
p2:52 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
p2:58 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
p2:67 [binder, in Complexity.NP.SAT.SAT]
p2:68 [binder, in Undecidability.L.Computability.Enum]
p2:76 [binder, in Undecidability.TM.Code.BinNumbers.PosDefinitions]
p2:82 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
p:1 [binder, in Undecidability.Shared.Libs.PSL.Numbers]
p:1 [binder, in Undecidability.Shared.Libs.DLW.Utils.prime]
p:1 [binder, in Undecidability.TM.Code.BinNumbers.PosDefinitions]
P:1 [binder, in Complexity.NP.L.CanEnumTerm]
p:1 [binder, in Undecidability.Synthetic.Infinite]
p:1 [binder, in Undecidability.Shared.ListAutomation]
p:1 [binder, in Undecidability.L.Tactics.Lproc]
p:10 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
P:10 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
p:10 [binder, in Undecidability.Shared.FilterFacts]
p:10 [binder, in Undecidability.Shared.Libs.DLW.Utils.prime]
p:10 [binder, in Undecidability.TM.Code.BinNumbers.PosIncrementTM]
P:10 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
p:10 [binder, in Undecidability.Shared.Libs.PSL.Lists.Filter]
p:10 [binder, in Undecidability.TM.Basic.Mono]
p:10 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.Arbitrary]
P:10 [binder, in Undecidability.L.Computability.Synthetic]
P:10 [binder, in Undecidability.L.AbstractMachines.FlatPro.ProgramsDef]
P:10 [binder, in Undecidability.Shared.Libs.DLW.Code.subcode]
p:10 [binder, in Undecidability.Shared.Libs.DLW.Vec.pos]
P:100 [binder, in Undecidability.TM.Hoare.HoareRegister]
p:1000 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
p:1005 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
P:101 [binder, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
p:101 [binder, in Complexity.NP.SAT.SAT_inNP]
p:101 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_base]
p:101 [binder, in Undecidability.Synthetic.ListEnumerabilityFacts]
p:101 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
P:101 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
P:1017 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:102 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
p:102 [binder, in Complexity.NP.Clique.kSAT_to_FlatClique]
P:103 [binder, in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
p:103 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
P:104 [binder, in Undecidability.L.Tactics.ComputableTime]
P:104 [binder, in Complexity.Complexity.NP]
P:104 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
P:105 [binder, in Undecidability.TM.Hoare.HoareCombinators]
p:105 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
p:106 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
p:106 [binder, in Complexity.NP.Clique.kSAT_to_FlatClique]
P:107 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
P:107 [binder, in Undecidability.TM.Hoare.HoareRegister]
P:107 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
p:107 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
P:1071 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:108 [binder, in Complexity.TM.PrettyBounds.BaseCode]
P:108 [binder, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
p:108 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
p:108 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
P:108 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
p:109 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:109 [binder, in Undecidability.L.Computability.Synthetic]
P:11 [binder, in Complexity.L.AbstractMachines.FlatPro.Computable.Decompile]
P:11 [binder, in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisUnfoldClos]
P:11 [binder, in Complexity.Complexity.Subtypes]
P:11 [binder, in Undecidability.L.AbstractMachines.FlatPro.UnfoldClos]
p:11 [binder, in Complexity.NP.SAT.CookLevin.Reductions.TMGenNP_fixed_singleTapeTM_to_FlatFunSingleTMGenNP]
P:11 [binder, in Complexity.L.AbstractMachines.AbstractSubstMachine]
P:11 [binder, in Undecidability.L.AbstractMachines.FlatPro.Programs]
P:11 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
P:11 [binder, in Undecidability.Synthetic.Definitions]
p:11 [binder, in Undecidability.L.Computability.Acceptability]
P:11 [binder, in Undecidability.Shared.Dec]
P:11 [binder, in Undecidability.Shared.ListAutomation]
P:11 [binder, in Undecidability.Shared.Libs.DLW.Code.subcode]
P:11 [binder, in Complexity.L.AbstractMachines.LambdaDepth]
p:110 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
P:110 [binder, in Undecidability.L.Tactics.ComputableTime]
p:110 [binder, in Undecidability.Shared.Libs.DLW.Vec.pos]
p:110 [binder, in Complexity.NP.Clique.kSAT_to_FlatClique]
P:111 [binder, in Undecidability.L.Computability.Seval]
p:111 [binder, in Undecidability.TM.Util.Relations]
P:111 [binder, in Undecidability.TM.Hoare.HoareLogic]
p:1116 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
P:112 [binder, in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
p:112 [binder, in Undecidability.L.Computability.Synthetic]
p:112 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
p:112 [binder, in Undecidability.Shared.Libs.DLW.Vec.pos]
P:112 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
p:1124 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
P:1125 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:113 [binder, in Complexity.NP.SAT.SAT_inNP]
p:113 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
P:113 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
p:113 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
p:114 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
p:114 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
p:114 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
p:114 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
P:115 [binder, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
P:115 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_base]
P:115 [binder, in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
p:116 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
p:116 [binder, in Undecidability.Synthetic.ListEnumerabilityFacts]
P:116 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
P:117 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
p:117 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
P:117 [binder, in Complexity.Complexity.NP]
P:1179 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:118 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
p:118 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:118 [binder, in Undecidability.Shared.Libs.DLW.Vec.pos]
P:119 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_base]
p:119 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
p:12 [binder, in Undecidability.Shared.Libs.DLW.Utils.prime]
p:12 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
P:12 [binder, in Undecidability.Shared.FinTypeForallExists]
p:12 [binder, in Undecidability.Shared.Libs.DLW.Utils.binomial]
P:12 [binder, in Undecidability.L.Computability.Decidability]
P:12 [binder, in Undecidability.Synthetic.InformativeDefinitions]
p:12 [binder, in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
P:120 [binder, in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
p:120 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
P:120 [binder, in Undecidability.TM.Hoare.HoareCombinators]
p:120 [binder, in Undecidability.Shared.Libs.DLW.Vec.pos]
P:120 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
P:121 [binder, in Undecidability.TM.Hoare.HoareLogic]
p:121 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
P:122 [binder, in Undecidability.TM.Hoare.HoareRegister]
P:123 [binder, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
p:123 [binder, in Complexity.NP.SAT.SAT_inNP]
p:123 [binder, in Undecidability.Synthetic.ListEnumerabilityFacts]
P:123 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
P:1233 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:124 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:125 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
P:126 [binder, in Undecidability.Shared.Libs.DLW.Utils.php]
p:126 [binder, in Undecidability.TM.Code.Code]
p:127 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
P:127 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
P:1284 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
P:129 [binder, in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
p:129 [binder, in Undecidability.TM.Code.Code]
P:129 [binder, in Undecidability.TM.Hoare.HoareCombinators]
p:129 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
p:13 [binder, in Undecidability.Shared.FilterFacts]
p:13 [binder, in Undecidability.Shared.Libs.PSL.Lists.Filter]
p:13 [binder, in Undecidability.Shared.Libs.DLW.Utils.crt]
P:13 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_base]
p:13 [binder, in Undecidability.L.Functions.EnumInt]
P:13 [binder, in Undecidability.Shared.Dec]
p:13 [binder, in Undecidability.L.Computability.Rice]
P:13 [binder, in Complexity.Complexity.Definitions]
p:13 [binder, in Undecidability.Shared.Libs.DLW.Vec.pos]
P:13 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
p:130 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
P:131 [binder, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
p:131 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
P:131 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
P:132 [binder, in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
P:132 [binder, in Undecidability.TM.Hoare.HoareLogic]
P:1329 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:133 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
P:133 [binder, in Complexity.Complexity.NP]
p:134 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
p:134 [binder, in Complexity.NP.SAT.SAT_inNP]
P:134 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
p:135 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
P:136 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
p:137 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:137 [binder, in Complexity.NP.Clique.kSAT_to_Clique]
P:1374 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
P:138 [binder, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
P:138 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
p:138 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
p:138 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
p:1380 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:1385 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
P:139 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
P:139 [binder, in Undecidability.TM.Hoare.HoareCombinators]
p:139 [binder, in Undecidability.Shared.Libs.DLW.Vec.pos]
p:14 [binder, in Undecidability.Shared.Libs.DLW.Utils.prime]
p:14 [binder, in Undecidability.TM.Code.BinNumbers.PosDefinitions]
P:14 [binder, in Complexity.L.AbstractMachines.FlatPro.Computable.Decompile]
P:14 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
p:14 [binder, in Undecidability.Shared.Libs.DLW.Utils.crt]
P:14 [binder, in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisStep]
P:14 [binder, in Complexity.NP.L.LMGenNP]
p:14 [binder, in Complexity.NP.SAT.CookLevin.Reductions.TMGenNP_fixed_singleTapeTM_to_FlatFunSingleTMGenNP]
P:14 [binder, in Undecidability.L.Functions.EqBool]
P:14 [binder, in Undecidability.L.Computability.Acceptability]
p:14 [binder, in Undecidability.L.Computability.Rice]
p:140 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
P:140 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
p:141 [binder, in Complexity.NP.SAT.SAT_inNP]
P:141 [binder, in Undecidability.TM.Hoare.HoareLogic]
p:141 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
P:1410 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:1413 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:1415 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:142 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
p:142 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
P:142 [binder, in Undecidability.TM.Lifting.LiftTapes]
P:142 [binder, in Complexity.Complexity.NP]
p:1420 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:1425 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:1432 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
P:144 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
p:144 [binder, in Complexity.NP.SAT.SAT_inNP]
P:144 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
P:145 [binder, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
P:145 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
p:145 [binder, in Undecidability.Synthetic.ListEnumerabilityFacts]
p:145 [binder, in Undecidability.Shared.Libs.DLW.Vec.pos]
P:1457 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:146 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:1461 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:1463 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:1465 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
P:147 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
p:147 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
P:147 [binder, in Complexity.Complexity.NP]
p:1472 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:1478 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
P:148 [binder, in Undecidability.TM.Hoare.HoareCombinators]
p:149 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
p:149 [binder, in Undecidability.Shared.Libs.DLW.Vec.pos]
p:15 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.Arbitrary]
P:15 [binder, in Undecidability.Synthetic.Definitions]
p:15 [binder, in Undecidability.L.Computability.Synthetic]
P:15 [binder, in Undecidability.TM.Hoare.HoareLogic]
P:15 [binder, in Undecidability.TM.Hoare.HoareCombinators]
P:150 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
P:150 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
P:1504 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:1507 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:151 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
P:151 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
p:151 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
P:151 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
p:1510 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:1517 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
P:152 [binder, in Undecidability.TM.Hoare.HoareRegister]
p:152 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:152 [binder, in Undecidability.Shared.Libs.DLW.Vec.pos]
p:1522 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
P:154 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
P:1547 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:155 [binder, in Undecidability.Shared.Libs.DLW.Vec.pos]
P:155 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
p:1550 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:1552 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:1557 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:156 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
P:156 [binder, in Complexity.Complexity.NP]
p:1562 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:1569 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
P:157 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
p:157 [binder, in Undecidability.Shared.Libs.DLW.Vec.pos]
P:158 [binder, in Undecidability.TM.Lifting.LiftTapes]
P:159 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
p:159 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
P:1594 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:1598 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:16 [binder, in Undecidability.Shared.FilterFacts]
p:16 [binder, in Undecidability.TM.Code.BinNumbers.PosDefinitions]
P:16 [binder, in Undecidability.Shared.Libs.PSL.EqDec]
p:16 [binder, in Undecidability.Synthetic.EnumerabilityFacts]
p:16 [binder, in Undecidability.Shared.Libs.PSL.Lists.Filter]
p:16 [binder, in Undecidability.Shared.Libs.DLW.Utils.crt]
p:16 [binder, in Complexity.NP.SAT.CookLevin.Reductions.TMGenNP_fixed_singleTapeTM_to_FlatFunSingleTMGenNP]
P:16 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
p:16 [binder, in Undecidability.Shared.Libs.PSL.Lists.Dupfree]
P:16 [binder, in Undecidability.Synthetic.DecidabilityFacts]
p:16 [binder, in Undecidability.Synthetic.ReducibilityFacts]
p:160 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
p:160 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
P:160 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
p:1600 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:1602 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:1609 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
P:161 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
p:161 [binder, in Undecidability.Shared.Libs.DLW.Vec.pos]
p:1615 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:162 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
P:163 [binder, in Undecidability.TM.Lifting.LiftTapes]
P:164 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
p:164 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:164 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
P:164 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
P:1640 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:1643 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:1645 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:1652 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:1656 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:166 [binder, in Undecidability.Shared.Libs.DLW.Vec.pos]
P:167 [binder, in Undecidability.TM.Hoare.HoareCombinators]
P:167 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
P:168 [binder, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
p:168 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:168 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
p:168 [binder, in Undecidability.Shared.Libs.DLW.Vec.pos]
P:1681 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:1683 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:1685 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
P:169 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
p:1692 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:1695 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
P:17 [binder, in Undecidability.TM.Compound.TMTac]
p:17 [binder, in Undecidability.Synthetic.EnumerabilityFacts]
P:17 [binder, in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisStep]
P:17 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_base]
P:17 [binder, in Undecidability.L.AbstractMachines.FlatPro.Programs]
p:17 [binder, in Undecidability.Synthetic.ListEnumerabilityFacts]
p:17 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
P:17 [binder, in Undecidability.L.Tactics.ComputableTactics]
P:17 [binder, in Complexity.L.AbstractMachines.FunctionalDefinitions]
P:170 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
p:171 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
P:171 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
p:171 [binder, in Undecidability.Shared.Libs.DLW.Vec.pos]
p:172 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
P:1720 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:1721 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:1724 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:1731 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:1734 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:174 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
p:174 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
P:175 [binder, in Undecidability.TM.Hoare.HoareRegister]
P:1759 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:176 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
p:176 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:1760 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:1763 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
P:177 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
p:177 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
P:177 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
p:179 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
p:179 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
P:179 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
p:179 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
p:18 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
p:18 [binder, in Undecidability.Shared.Libs.DLW.Utils.prime]
P:18 [binder, in Undecidability.Shared.Libs.PSL.EqDec]
p:18 [binder, in Undecidability.TM.Code.BinNumbers.PosIncrementTM]
p:18 [binder, in Undecidability.Shared.Libs.DLW.Utils.binomial]
p:18 [binder, in Undecidability.TM.Univ.LowLevel]
p:18 [binder, in Undecidability.Synthetic.MoreEnumerabilityFacts]
P:18 [binder, in Complexity.NP.TM.M_LM2TM]
p:18 [binder, in Undecidability.Synthetic.DecidabilityFacts]
P:18 [binder, in Undecidability.Shared.Libs.DLW.Code.subcode]
P:180 [binder, in Undecidability.TM.Hoare.HoareCombinators]
P:180 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
P:1808 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:181 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
P:182 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
p:182 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
p:182 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
p:182 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
P:184 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
P:184 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
P:185 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
p:185 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
p:185 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
P:1856 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:186 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
p:186 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:188 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:189 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
P:189 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
P:19 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_dec]
p:19 [binder, in Undecidability.Shared.FilterFacts]
P:19 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds_Loop]
P:19 [binder, in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisUnfoldClos]
p:19 [binder, in Undecidability.Shared.Libs.PSL.Lists.Filter]
P:19 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.Arbitrary]
P:19 [binder, in Undecidability.Synthetic.Definitions]
P:19 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
p:19 [binder, in Undecidability.L.Computability.Synthetic]
P:19 [binder, in Complexity.Complexity.Definitions]
p:190 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
P:1904 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:191 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
p:191 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:192 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
P:192 [binder, in Undecidability.TM.Hoare.HoareRegister]
P:192 [binder, in Undecidability.TM.Hoare.HoareCombinators]
P:192 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
p:193 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
P:194 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
P:194 [binder, in Undecidability.TM.Hoare.HoareRegister]
p:195 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
P:195 [binder, in Undecidability.TM.Hoare.HoareRegister]
p:195 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
P:195 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
P:1952 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:196 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
P:196 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
P:196 [binder, in Undecidability.TM.Hoare.HoareLogic]
p:198 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
p:198 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
P:198 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
p:199 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
p:199 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
P:2 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_dec]
p:2 [binder, in Undecidability.Synthetic.SemiDecidabilityFacts]
P:2 [binder, in Complexity.NP.L.CanEnumTerm]
P:2 [binder, in Complexity.L.AbstractMachines.FlatPro.Computable.Decompile]
P:2 [binder, in Undecidability.Shared.Libs.PSL.EqDec]
p:2 [binder, in Undecidability.Synthetic.EnumerabilityFacts]
P:2 [binder, in Undecidability.Shared.FinTypeForallExists]
p:2 [binder, in Undecidability.Synthetic.Undecidability]
P:2 [binder, in Undecidability.L.Computability.Decidability]
p:2 [binder, in Undecidability.Synthetic.MoreEnumerabilityFacts]
P:2 [binder, in Undecidability.Synthetic.Definitions]
P:2 [binder, in Undecidability.Synthetic.InformativeDefinitions]
P:2 [binder, in Undecidability.Shared.Dec]
p:2 [binder, in Undecidability.Shared.ListAutomation]
p:2 [binder, in Undecidability.L.Tactics.Lproc]
P:2 [binder, in Undecidability.Shared.Libs.DLW.Code.subcode]
p:20 [binder, in Undecidability.Shared.Libs.PSL.Numbers]
p:20 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
p:20 [binder, in Undecidability.Shared.Libs.DLW.Utils.prime]
P:20 [binder, in Undecidability.Shared.Libs.PSL.EqDec]
P:20 [binder, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
p:20 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
P:20 [binder, in Undecidability.Shared.Dec]
p:200 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
P:200 [binder, in Undecidability.TM.Hoare.HoareRegister]
P:2001 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
P:201 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
p:201 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
p:201 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
P:201 [binder, in Undecidability.TM.Hoare.HoareCombinators]
p:202 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
P:202 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
p:203 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
p:203 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
p:204 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:204 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
p:205 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
P:206 [binder, in Undecidability.TM.Hoare.HoareRegister]
p:206 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
P:206 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
p:208 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
P:209 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
P:21 [binder, in Undecidability.TM.Compound.TMTac]
p:21 [binder, in Undecidability.Shared.Libs.DLW.Utils.prime]
P:21 [binder, in Undecidability.L.Functions.LoopSum]
p:21 [binder, in Undecidability.TM.Code.BinNumbers.PosIncrementTM]
P:21 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
p:21 [binder, in Undecidability.Synthetic.EnumerabilityFacts]
p:21 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
p:21 [binder, in Undecidability.Shared.Libs.DLW.Utils.binomial]
p:21 [binder, in Undecidability.Synthetic.ListEnumerabilityFacts]
P:21 [binder, in Complexity.Complexity.NP]
P:21 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
p:210 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
P:211 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
p:211 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
P:212 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
p:212 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
p:212 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
P:214 [binder, in Undecidability.TM.Hoare.HoareRegister]
p:214 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
P:217 [binder, in Undecidability.TM.Hoare.HoareCombinators]
p:217 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
P:217 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
P:218 [binder, in Undecidability.TM.Hoare.HoareLogic]
P:219 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
p:22 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
p:22 [binder, in Undecidability.Shared.FilterFacts]
p:22 [binder, in Undecidability.Shared.Libs.DLW.Utils.prime]
P:22 [binder, in Undecidability.Shared.Libs.PSL.EqDec]
P:22 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
p:22 [binder, in Undecidability.Shared.Libs.PSL.Lists.Filter]
P:22 [binder, in Complexity.L.AbstractMachines.UnfoldHeap]
p:22 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.Arbitrary]
P:22 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
P:22 [binder, in Undecidability.L.Tactics.ComputableTactics]
P:22 [binder, in Undecidability.Shared.Libs.DLW.Code.subcode]
p:22 [binder, in Undecidability.Synthetic.ReducibilityFacts]
P:22 [binder, in Complexity.NP.TM.LM_to_mTM]
p:221 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
p:221 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
P:222 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
p:223 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
P:224 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
p:225 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
P:226 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
p:227 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
p:228 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
p:229 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
p:23 [binder, in Undecidability.Shared.Libs.DLW.Utils.prime]
P:23 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_base]
P:23 [binder, in Undecidability.L.Computability.Decidability]
P:23 [binder, in Undecidability.Synthetic.Definitions]
p:23 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:23 [binder, in Complexity.NP.Clique.kSAT_to_Clique]
p:23 [binder, in Undecidability.L.Computability.Rice]
P:23 [binder, in Undecidability.TM.Hoare.HoareLogic]
P:23 [binder, in Undecidability.Shared.Libs.DLW.Code.subcode]
P:230 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
P:232 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
P:234 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
P:235 [binder, in Undecidability.TM.Hoare.HoareCombinators]
p:235 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
P:236 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
P:237 [binder, in Undecidability.TM.Hoare.HoareRegister]
P:238 [binder, in Undecidability.TM.Hoare.HoareLogic]
P:238 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
p:239 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
p:24 [binder, in Undecidability.Shared.Libs.DLW.Utils.binomial]
P:24 [binder, in Undecidability.L.Computability.Decidability]
p:24 [binder, in Undecidability.L.Computability.Rice]
P:24 [binder, in Complexity.L.AbstractMachines.FunctionalDefinitions]
P:24 [binder, in Undecidability.Shared.Libs.DLW.Vec.pos]
P:24 [binder, in Complexity.Complexity.NP]
P:24 [binder, in Complexity.NP.TM.LM_to_mTM]
p:240 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
p:243 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
p:246 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
P:248 [binder, in Undecidability.TM.Hoare.HoareLogic]
P:248 [binder, in Undecidability.TM.Hoare.HoareCombinators]
P:25 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
p:25 [binder, in Undecidability.Shared.Libs.DLW.Utils.prime]
p:25 [binder, in Undecidability.TM.Code.BinNumbers.PosIncrementTM]
p:25 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
P:25 [binder, in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisStep]
P:25 [binder, in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
p:25 [binder, in Undecidability.Synthetic.DecidabilityFacts]
p:25 [binder, in Undecidability.L.Computability.Synthetic]
P:25 [binder, in Complexity.Complexity.Definitions]
P:25 [binder, in Undecidability.Shared.Libs.DLW.Code.subcode]
P:25 [binder, in Undecidability.Shared.Libs.DLW.Vec.pos]
p:250 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:251 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
p:2516 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:252 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
p:2521 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:2526 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
P:253 [binder, in Undecidability.TM.Hoare.HoareRegister]
p:254 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
p:2541 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:2544 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:256 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
p:257 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
p:258 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
P:259 [binder, in Undecidability.TM.Hoare.HoareLogic]
p:259 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
p:26 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
P:26 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_dec]
p:26 [binder, in Undecidability.Shared.FilterFacts]
p:26 [binder, in Undecidability.Synthetic.EnumerabilityFacts]
p:26 [binder, in Undecidability.Shared.Libs.PSL.Lists.Filter]
p:26 [binder, in Undecidability.Shared.Libs.DLW.Utils.binomial]
p:26 [binder, in Undecidability.L.TM.TapeFuns]
p:26 [binder, in Complexity.L.AbstractMachines.AbstractSubstMachine]
P:26 [binder, in Undecidability.L.Computability.Decidability]
P:26 [binder, in Complexity.Complexity.SpaceBoundsTime]
p:26 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
P:26 [binder, in Undecidability.L.Tactics.ComputableTactics]
P:26 [binder, in Undecidability.TM.Hoare.HoareCombinators]
p:26 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
p:26 [binder, in Undecidability.Shared.Libs.DLW.Vec.pos]
P:260 [binder, in Undecidability.TM.Hoare.HoareCombinators]
p:2603 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:2608 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:2613 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:262 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
p:262 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
P:265 [binder, in Undecidability.TM.Hoare.HoareRegister]
P:265 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
p:2656 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:266 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:268 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
P:269 [binder, in Undecidability.TM.Hoare.HoareLogic]
P:269 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
P:27 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
P:27 [binder, in Complexity.Complexity.SpaceBoundsTime]
P:27 [binder, in Undecidability.Synthetic.Definitions]
P:27 [binder, in Undecidability.Shared.Libs.DLW.Code.subcode]
p:27 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
p:27 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.FiniteFunction]
p:270 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
P:270 [binder, in Undecidability.TM.Hoare.HoareCombinators]
p:2710 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:272 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
p:275 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
p:275 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
P:275 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
p:276 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
p:277 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
P:279 [binder, in Undecidability.TM.Hoare.HoareLogic]
p:279 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
p:28 [binder, in Undecidability.Shared.Libs.DLW.Utils.prime]
p:28 [binder, in Undecidability.TM.Code.BinNumbers.PosDefinitions]
P:28 [binder, in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisUnfoldClos]
P:28 [binder, in Undecidability.L.Tactics.LClos]
p:28 [binder, in Undecidability.Synthetic.EnumerabilityFacts]
p:28 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
p:28 [binder, in Undecidability.Shared.Libs.DLW.Utils.binomial]
P:28 [binder, in Undecidability.L.Computability.Decidability]
p:28 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.Arbitrary]
P:28 [binder, in Undecidability.Shared.Libs.DLW.Vec.pos]
P:28 [binder, in Complexity.Complexity.NP]
P:280 [binder, in Undecidability.TM.Hoare.HoareRegister]
P:282 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
p:283 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
P:283 [binder, in Undecidability.TM.Hoare.HoareCombinators]
p:283 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
P:286 [binder, in Undecidability.TM.Hoare.HoareLogic]
p:288 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
p:2889 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
P:289 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
p:29 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
P:29 [binder, in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
P:29 [binder, in Undecidability.Shared.Libs.PSL.EqDec]
p:29 [binder, in Undecidability.Synthetic.DecidabilityFacts]
P:29 [binder, in Undecidability.TM.Hoare.HoareLogic]
P:29 [binder, in Undecidability.Shared.Libs.DLW.Code.subcode]
p:29 [binder, in Undecidability.Shared.Libs.DLW.Vec.pos]
p:290 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
p:290 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:292 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
P:293 [binder, in Undecidability.TM.Hoare.HoareRegister]
P:293 [binder, in Undecidability.TM.Hoare.HoareLogic]
P:295 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
p:2969 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:297 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
p:2977 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:298 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
P:299 [binder, in Undecidability.TM.Hoare.HoareCombinators]
P:299 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
p:2994 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:2995 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
P:3 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
p:3 [binder, in Undecidability.Shared.FilterFacts]
p:3 [binder, in Undecidability.Shared.Libs.DLW.Utils.prime]
P:3 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds_Loop]
P:3 [binder, in Complexity.L.Datatypes.LDepPair]
p:3 [binder, in Undecidability.Shared.Libs.PSL.Lists.Filter]
P:3 [binder, in Complexity.Complexity.Subtypes]
P:3 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_upto]
P:3 [binder, in Undecidability.L.AbstractMachines.FlatPro.Programs]
P:3 [binder, in Undecidability.L.Computability.Acceptability]
p:3 [binder, in Undecidability.Synthetic.Infinite]
p:3 [binder, in Undecidability.L.Computability.Rice]
p:3 [binder, in Undecidability.Shared.ListAutomation]
P:3 [binder, in Complexity.Complexity.Definitions]
P:3 [binder, in Complexity.L.AbstractMachines.FunctionalDefinitions]
P:3 [binder, in Undecidability.TM.Hoare.HoareCombinators]
P:3 [binder, in Undecidability.Shared.Libs.DLW.Code.subcode]
P:3 [binder, in Undecidability.TM.Hoare.HoareStdLib]
p:30 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
p:30 [binder, in Undecidability.Shared.FilterFacts]
p:30 [binder, in Undecidability.Shared.Libs.PSL.Lists.Filter]
p:30 [binder, in Undecidability.Shared.Libs.DLW.Utils.binomial]
p:30 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
P:30 [binder, in Complexity.NP.TM.LM_to_mTM]
p:300 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
p:3005 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:3013 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
P:302 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
p:3025 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:304 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
P:306 [binder, in Undecidability.TM.Hoare.HoareRegister]
p:306 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
P:306 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
P:309 [binder, in Undecidability.TM.Hoare.HoareLogic]
p:31 [binder, in Undecidability.TM.Code.BinNumbers.PosDefinitions]
p:31 [binder, in Undecidability.TM.Code.BinNumbers.PosPointers]
p:31 [binder, in Complexity.L.AbstractMachines.AbstractSubstMachine]
P:31 [binder, in Undecidability.L.AbstractMachines.FlatPro.Programs]
P:31 [binder, in Undecidability.L.Functions.UnboundIteration]
p:31 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
P:31 [binder, in Complexity.Complexity.Definitions]
P:31 [binder, in Complexity.L.AbstractMachines.FunctionalDefinitions]
P:31 [binder, in Undecidability.Shared.Libs.DLW.Code.subcode]
p:31 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
p:31 [binder, in Undecidability.TM.Code.CasePair]
P:31 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
P:310 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
p:312 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
P:313 [binder, in Undecidability.TM.Hoare.HoareRegister]
p:313 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:315 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
P:315 [binder, in Undecidability.TM.Hoare.HoareCombinators]
P:319 [binder, in Undecidability.TM.Hoare.HoareLogic]
p:32 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
p:32 [binder, in Undecidability.Shared.Libs.DLW.Utils.list_bool]
P:32 [binder, in Complexity.L.AbstractMachines.AbstractSubstMachine]
P:32 [binder, in Undecidability.Synthetic.Definitions]
p:32 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
P:32 [binder, in Undecidability.Shared.Libs.DLW.Code.subcode]
P:32 [binder, in Undecidability.Shared.Libs.DLW.Vec.pos]
P:320 [binder, in Undecidability.TM.Hoare.HoareRegister]
p:320 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:326 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
p:326 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
P:327 [binder, in Undecidability.TM.Hoare.HoareCombinators]
p:33 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
p:33 [binder, in Undecidability.Shared.Libs.DLW.Utils.prime]
p:33 [binder, in Undecidability.TM.Code.BinNumbers.PosDefinitions]
P:33 [binder, in Complexity.Complexity.Subtypes]
p:33 [binder, in Undecidability.Shared.Libs.DLW.Utils.binomial]
p:33 [binder, in Undecidability.Synthetic.MoreEnumerabilityFacts]
p:33 [binder, in Undecidability.Shared.Libs.DLW.Vec.pos]
p:33 [binder, in Undecidability.TM.Code.BinNumbers.PosAddTM]
P:330 [binder, in Undecidability.TM.Hoare.HoareRegister]
P:330 [binder, in Undecidability.TM.Hoare.HoareLogic]
p:331 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
p:336 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
P:338 [binder, in Undecidability.TM.Hoare.HoareRegister]
p:34 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
p:34 [binder, in Undecidability.Shared.FilterFacts]
p:34 [binder, in Undecidability.Shared.Libs.PSL.Lists.Filter]
p:34 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
p:34 [binder, in Undecidability.TM.Code.BinNumbers.PosPointers]
p:34 [binder, in Complexity.L.TM.TMflat]
P:34 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_base]
p:34 [binder, in Undecidability.Synthetic.DecidabilityFacts]
p:34 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:34 [binder, in Undecidability.L.Computability.Rice]
P:34 [binder, in Undecidability.TM.Hoare.HoareLogic]
p:34 [binder, in Undecidability.Shared.Libs.DLW.Vec.pos]
P:342 [binder, in Undecidability.TM.Hoare.HoareLogic]
P:347 [binder, in Undecidability.TM.Hoare.HoareRegister]
P:35 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
p:35 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
p:35 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
p:35 [binder, in Undecidability.Shared.Libs.DLW.Utils.crt]
P:35 [binder, in Undecidability.TM.Hoare.HoareRegister]
P:35 [binder, in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
p:35 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.Arbitrary]
p:35 [binder, in Undecidability.L.Computability.Rice]
P:35 [binder, in Undecidability.Shared.Libs.DLW.Code.subcode]
P:35 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
p:350 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
P:353 [binder, in Undecidability.TM.Hoare.HoareLogic]
p:3538 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:354 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
p:354 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:3543 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:3548 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
P:359 [binder, in Undecidability.TM.Hoare.HoareRegister]
p:36 [binder, in Undecidability.Shared.Libs.PSL.FCI]
p:36 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
P:36 [binder, in Complexity.HierarchyTheorem.TimeHierarchyTheorem]
p:36 [binder, in Undecidability.Shared.Libs.DLW.Utils.crt]
p:36 [binder, in Undecidability.TM.Code.BinNumbers.PosPointers]
p:36 [binder, in Undecidability.L.TM.TapeFuns]
p:36 [binder, in Complexity.NP.SAT.FSAT.FSAT]
P:36 [binder, in Complexity.L.AbstractMachines.AbstractSubstMachine]
P:36 [binder, in Complexity.Complexity.Definitions]
P:36 [binder, in Complexity.L.AbstractMachines.FunctionalDefinitions]
P:36 [binder, in Undecidability.TM.Hoare.HoareCombinators]
p:360 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
p:361 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
p:362 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
p:363 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
P:365 [binder, in Undecidability.TM.Hoare.HoareLogic]
P:368 [binder, in Undecidability.TM.Hoare.HoareCombinators]
P:369 [binder, in Undecidability.TM.Hoare.HoareRegister]
p:37 [binder, in Undecidability.Shared.Libs.PSL.Numbers]
p:37 [binder, in Undecidability.Shared.Libs.DLW.Utils.prime]
p:37 [binder, in Undecidability.TM.Code.BinNumbers.PosDefinitions]
p:37 [binder, in Undecidability.Shared.Libs.DLW.Utils.crt]
P:37 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_base]
P:37 [binder, in Undecidability.Synthetic.Definitions]
P:37 [binder, in Complexity.NP.TM.LM_to_mTM]
p:37 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.FiniteFunction]
p:370 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
P:373 [binder, in Undecidability.TM.Hoare.HoareLogic]
p:38 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_quotient]
p:38 [binder, in Undecidability.L.Datatypes.List.List_basics]
P:38 [binder, in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
p:38 [binder, in Undecidability.Shared.Libs.DLW.Utils.crt]
P:38 [binder, in Undecidability.Shared.Libs.DLW.Code.subcode]
p:38 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
p:38 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.FiniteFunction]
p:380 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
P:381 [binder, in Undecidability.TM.Hoare.HoareLogic]
P:383 [binder, in Undecidability.TM.Hoare.HoareRegister]
P:385 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
P:387 [binder, in Undecidability.TM.Hoare.HoareCombinators]
p:388 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
p:389 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:39 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_quotient]
p:39 [binder, in Undecidability.Shared.Libs.PSL.Lists.Filter]
p:39 [binder, in Undecidability.Shared.Libs.DLW.Utils.crt]
P:39 [binder, in Undecidability.L.Functions.UnboundIteration]
p:39 [binder, in Undecidability.Synthetic.ListEnumerabilityFacts]
p:39 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
p:39 [binder, in Undecidability.TM.Code.BinNumbers.PosAddTM]
P:39 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
p:39 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.FiniteFunction]
P:398 [binder, in Undecidability.TM.Hoare.HoareRegister]
p:398 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
P:399 [binder, in Undecidability.TM.Hoare.HoareLogic]
p:4 [binder, in Undecidability.Shared.Libs.PSL.Prelim]
p:4 [binder, in Undecidability.Synthetic.Undecidability]
p:4 [binder, in Undecidability.Synthetic.MoreEnumerabilityFacts]
p:4 [binder, in Undecidability.L.Computability.Rice]
P:4 [binder, in Undecidability.Shared.Libs.DLW.Code.subcode]
p:40 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
p:40 [binder, in Undecidability.TM.Code.BinNumbers.PosDefinitions]
P:40 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
P:40 [binder, in Undecidability.L.AbstractMachines.FlatPro.Programs]
p:40 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.Arbitrary]
p:40 [binder, in Undecidability.Synthetic.MoreEnumerabilityFacts]
p:40 [binder, in Undecidability.Synthetic.DecidabilityFacts]
p:40 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:40 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
p:40 [binder, in Undecidability.TM.Code.CasePair]
p:40 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.FiniteFunction]
p:41 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
p:41 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
P:41 [binder, in Undecidability.TM.Hoare.HoareLogic]
P:41 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
p:41 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
p:41 [binder, in Undecidability.Shared.Libs.DLW.Vec.pos]
P:41 [binder, in Complexity.Complexity.NP]
p:413 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
p:414 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
p:415 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
P:416 [binder, in Undecidability.TM.Hoare.HoareRegister]
P:42 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
p:42 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
P:42 [binder, in Complexity.Complexity.Definitions]
p:42 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
P:42 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
P:426 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:43 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
p:43 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
p:43 [binder, in Undecidability.TM.Code.BinNumbers.PosDefinitions]
P:43 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
p:43 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
P:43 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_base]
p:43 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:43 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
p:43 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
P:43 [binder, in Complexity.NP.TM.LM_to_mTM]
p:430 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:44 [binder, in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
p:44 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
p:44 [binder, in Undecidability.Shared.Libs.DLW.Utils.crt]
P:44 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_upto]
P:44 [binder, in Complexity.L.AbstractMachines.AbstractSubstMachine]
P:44 [binder, in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
P:44 [binder, in Undecidability.L.Tactics.Reflection]
p:440 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
P:442 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
P:443 [binder, in Undecidability.TM.Hoare.HoareRegister]
P:445 [binder, in Undecidability.TM.Hoare.HoareRegister]
P:446 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
p:45 [binder, in Undecidability.Shared.Libs.DLW.Utils.prime]
p:45 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
p:45 [binder, in Undecidability.Shared.Libs.DLW.Utils.crt]
P:45 [binder, in Undecidability.L.AbstractMachines.FlatPro.Programs]
P:45 [binder, in Undecidability.L.Functions.UnboundIteration]
p:45 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
P:450 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
P:450 [binder, in Undecidability.TM.Hoare.HoareRegister]
P:454 [binder, in Undecidability.TM.Hoare.HoareCombinators]
P:455 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
P:456 [binder, in Undecidability.TM.Hoare.HoareRegister]
p:46 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
p:46 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
P:46 [binder, in Complexity.Complexity.Subtypes]
p:46 [binder, in Undecidability.Shared.Libs.DLW.Utils.crt]
p:46 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.Arbitrary]
P:46 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
p:46 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
P:462 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
p:462 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
P:465 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
P:466 [binder, in Undecidability.TM.Hoare.HoareRegister]
p:47 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
p:47 [binder, in Undecidability.TM.Code.BinNumbers.PosDefinitions]
P:47 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_upto]
P:47 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
p:47 [binder, in Undecidability.Synthetic.ReducibilityFacts]
p:47 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.FiniteFunction]
p:47 [binder, in Undecidability.TM.Code.BinNumbers.PosShiftTM]
P:470 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
P:471 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:475 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
P:479 [binder, in Undecidability.TM.Hoare.HoareRegister]
p:48 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
P:48 [binder, in Undecidability.TM.Hoare.HoareRegister]
P:48 [binder, in Undecidability.TM.Hoare.HoareCombinators]
p:48 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.FiniteFunction]
p:485 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
P:487 [binder, in Undecidability.TM.Hoare.HoareRegister]
p:49 [binder, in Undecidability.Shared.Libs.DLW.Utils.prime]
p:49 [binder, in Undecidability.TM.Code.BinNumbers.PosDefinitions]
P:49 [binder, in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
P:49 [binder, in Undecidability.L.Tactics.LClos]
p:49 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:49 [binder, in Undecidability.Shared.Libs.PSL.Vectors.VectorDupfree]
p:49 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
P:49 [binder, in Undecidability.Shared.Libs.DLW.Code.subcode]
p:49 [binder, in Undecidability.Shared.Libs.DLW.Vec.pos]
p:49 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.FiniteFunction]
P:496 [binder, in Undecidability.TM.Hoare.HoareRegister]
p:5 [binder, in Undecidability.Shared.FilterFacts]
P:5 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds_Loop]
p:5 [binder, in Undecidability.TM.Code.BinNumbers.PosDefinitions]
p:5 [binder, in Undecidability.TM.Code.BinNumbers.PosIncrementTM]
P:5 [binder, in Undecidability.TM.Hoare.HoareLegacy]
p:5 [binder, in Undecidability.Shared.Libs.PSL.Lists.Filter]
P:5 [binder, in Undecidability.L.Prelim.MoreBase]
P:5 [binder, in Undecidability.L.Computability.Decidability]
P:5 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
P:5 [binder, in Undecidability.Synthetic.Definitions]
P:5 [binder, in Undecidability.Synthetic.InformativeDefinitions]
P:5 [binder, in Complexity.L.AbstractMachines.LambdaDepth]
p:50 [binder, in Undecidability.L.Prelim.ARS]
p:50 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
P:50 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
p:50 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.Arbitrary]
p:50 [binder, in Undecidability.Synthetic.ListEnumerabilityFacts]
p:50 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
P:50 [binder, in Complexity.L.AbstractMachines.FunctionalDefinitions]
P:50 [binder, in Undecidability.TM.Hoare.HoareLogic]
P:50 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
p:50 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.FiniteFunction]
P:507 [binder, in Undecidability.TM.Hoare.HoareRegister]
p:51 [binder, in Undecidability.Shared.Libs.PSL.Numbers]
p:51 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
p:51 [binder, in Undecidability.TM.Code.BinNumbers.PosDefinitions]
p:51 [binder, in Undecidability.Shared.Libs.DLW.Utils.crt]
p:51 [binder, in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
p:51 [binder, in Undecidability.Synthetic.ReducibilityFacts]
P:516 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
P:519 [binder, in Undecidability.TM.Hoare.HoareRegister]
p:52 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
p:52 [binder, in Undecidability.Shared.Libs.DLW.Utils.prime]
p:52 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
P:52 [binder, in Undecidability.TM.Hoare.HoareRegister]
p:520 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
P:528 [binder, in Undecidability.TM.Hoare.HoareRegister]
p:529 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:53 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
P:53 [binder, in Complexity.L.AbstractMachines.AbstractSubstMachine]
P:53 [binder, in Undecidability.L.AbstractMachines.FlatPro.Programs]
p:53 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
P:53 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
P:53 [binder, in Undecidability.Shared.Libs.DLW.Code.subcode]
p:53 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
P:53 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
P:538 [binder, in Undecidability.TM.Hoare.HoareRegister]
p:54 [binder, in Undecidability.TM.Code.BinNumbers.PosMultTM]
p:54 [binder, in Complexity.L.AbstractMachines.UnfoldTailRec]
P:54 [binder, in Undecidability.TM.Hoare.HoareRegister]
p:54 [binder, in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
p:54 [binder, in Undecidability.TM.Code.BinNumbers.PosShiftTM]
p:55 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
p:55 [binder, in Undecidability.TM.Code.BinNumbers.PosDefinitions]
p:55 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
P:55 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
p:55 [binder, in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
p:55 [binder, in Undecidability.Synthetic.ReducibilityFacts]
P:551 [binder, in Undecidability.TM.Hoare.HoareRegister]
P:557 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:56 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
p:56 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.Arbitrary]
p:56 [binder, in Undecidability.Synthetic.ListEnumerabilityFacts]
p:56 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
p:56 [binder, in Undecidability.Shared.Libs.DLW.Vec.pos]
P:56 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
p:561 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
P:565 [binder, in Undecidability.TM.Hoare.HoareRegister]
p:57 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
p:57 [binder, in Undecidability.TM.Code.BinNumbers.PosDefinitions]
p:57 [binder, in Complexity.L.AbstractMachines.UnfoldTailRec]
P:57 [binder, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
P:57 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
p:57 [binder, in Complexity.L.TM.TMflatComp]
P:57 [binder, in Undecidability.TM.Hoare.HoareLogic]
p:57 [binder, in Complexity.NP.SAT.SAT]
p:571 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
P:576 [binder, in Undecidability.TM.Hoare.HoareRegister]
p:58 [binder, in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
P:58 [binder, in Complexity.Complexity.Subtypes]
P:58 [binder, in Complexity.TM.PrettyBounds.BaseCodeSpace]
P:58 [binder, in Undecidability.Shared.Libs.DLW.Code.subcode]
p:59 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
P:59 [binder, in Undecidability.TM.Hoare.HoareRegister]
P:59 [binder, in Undecidability.TM.Hoare.HoareCombinators]
p:59 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
p:59 [binder, in Undecidability.Shared.Libs.DLW.Vec.pos]
p:59 [binder, in Undecidability.TM.Code.BinNumbers.PosShiftTM]
P:596 [binder, in Complexity.NP.TM.LM_to_mTM]
p:6 [binder, in Undecidability.Shared.Libs.DLW.Utils.prime]
p:6 [binder, in Undecidability.TM.Code.BinNumbers.PosDefinitions]
P:6 [binder, in Complexity.L.AbstractMachines.AbstractSubstMachine]
P:6 [binder, in Complexity.Complexity.SpaceBoundsTime]
P:6 [binder, in Undecidability.Synthetic.DecidabilityFacts]
P:6 [binder, in Undecidability.TM.Hoare.HoareLogic]
P:6 [binder, in Undecidability.TM.Hoare.HoareCombinators]
P:6 [binder, in Undecidability.Shared.Libs.DLW.Code.subcode]
p:6 [binder, in Undecidability.Shared.Libs.DLW.Vec.pos]
p:6 [binder, in Undecidability.TM.Code.BinNumbers.PosShiftTM]
p:60 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
p:60 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
p:60 [binder, in Undecidability.Shared.Libs.DLW.Utils.prime]
p:60 [binder, in Complexity.L.AbstractMachines.UnfoldTailRec]
P:60 [binder, in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
p:60 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
P:60 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_base]
p:60 [binder, in Complexity.NP.SAT.SAT]
P:60 [binder, in Complexity.Complexity.NP]
p:60 [binder, in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
P:601 [binder, in Complexity.NP.TM.LM_to_mTM]
P:602 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:606 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
P:607 [binder, in Complexity.NP.TM.LM_to_mTM]
p:61 [binder, in Undecidability.TM.Code.BinNumbers.PosDefinitions]
P:61 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
P:611 [binder, in Complexity.NP.TM.LM_to_mTM]
p:615 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
P:617 [binder, in Complexity.NP.TM.LM_to_mTM]
p:62 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
P:62 [binder, in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
p:62 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
p:62 [binder, in Undecidability.Shared.Libs.DLW.Vec.pos]
p:62 [binder, in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
P:62 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
P:621 [binder, in Complexity.NP.TM.LM_to_mTM]
p:63 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
p:63 [binder, in Undecidability.TM.Code.BinNumbers.PosDefinitions]
p:63 [binder, in Undecidability.L.Tactics.GenEncode]
P:63 [binder, in Undecidability.TM.Hoare.HoareRegister]
P:63 [binder, in Undecidability.L.AbstractMachines.FlatPro.Programs]
p:63 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
P:63 [binder, in Complexity.Complexity.NP]
p:64 [binder, in Undecidability.Shared.Libs.DLW.Utils.prime]
p:64 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
P:64 [binder, in Complexity.TM.PrettyBounds.BaseCodeSpace]
p:64 [binder, in Complexity.L.TM.TMflatten]
p:64 [binder, in Undecidability.L.Computability.Synthetic]
P:64 [binder, in Undecidability.TM.Hoare.HoareLogic]
p:64 [binder, in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
p:64 [binder, in Undecidability.TM.Code.BinNumbers.PosShiftTM]
P:646 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:649 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:65 [binder, in Undecidability.TM.Code.BinNumbers.PosDefinitions]
P:65 [binder, in Complexity.NP.L.CanEnumTerm]
P:65 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
P:65 [binder, in Undecidability.TM.Hoare.HoareRegister]
P:65 [binder, in Undecidability.L.Tactics.Reflection]
p:65 [binder, in Complexity.NP.SAT.SAT]
p:65 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
p:65 [binder, in Undecidability.Shared.Libs.DLW.Vec.pos]
P:65 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
p:658 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:66 [binder, in Undecidability.L.Computability.Enum]
P:66 [binder, in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
p:66 [binder, in Undecidability.TM.Code.CasePair]
p:66 [binder, in Complexity.Complexity.NP]
p:67 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
p:67 [binder, in Undecidability.TM.Code.BinNumbers.PosDefinitions]
P:67 [binder, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
p:67 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
p:68 [binder, in Undecidability.Shared.Libs.DLW.Utils.prime]
P:68 [binder, in Complexity.NP.L.CanEnumTerm]
P:68 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
p:68 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
p:68 [binder, in Complexity.Complexity.NP]
P:689 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:69 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
P:69 [binder, in Undecidability.TM.Hoare.HoareRegister]
P:69 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_base]
p:69 [binder, in Undecidability.L.Computability.Synthetic]
p:69 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
p:69 [binder, in Undecidability.Shared.Libs.DLW.Vec.pos]
p:69 [binder, in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
p:692 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:7 [binder, in Undecidability.Shared.Libs.PSL.Numbers]
p:7 [binder, in Complexity.L.Datatypes.LBinNums]
p:7 [binder, in Undecidability.Shared.FilterFacts]
p:7 [binder, in Undecidability.TM.Code.BinNumbers.PosDefinitions]
p:7 [binder, in Undecidability.Shared.Libs.PSL.Lists.Filter]
P:7 [binder, in Complexity.NP.L.LMGenNP]
p:7 [binder, in Undecidability.Shared.Libs.DLW.Utils.php]
P:7 [binder, in Undecidability.L.Computability.Decidability]
P:7 [binder, in Undecidability.L.AbstractMachines.FlatPro.Programs]
P:7 [binder, in Complexity.Complexity.NP]
p:7 [binder, in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
p:70 [binder, in Undecidability.TM.Code.BinNumbers.PosDefinitions]
P:70 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
p:70 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
P:70 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
P:70 [binder, in Undecidability.TM.Hoare.HoareCombinators]
p:70 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
p:701 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:71 [binder, in Undecidability.Shared.Libs.DLW.Utils.prime]
P:71 [binder, in Complexity.NP.L.CanEnumTerm]
P:71 [binder, in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
p:71 [binder, in Undecidability.Shared.Libs.DLW.Vec.pos]
P:71 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
p:72 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
p:72 [binder, in Undecidability.TM.Code.BinNumbers.PosDefinitions]
P:72 [binder, in Complexity.NP.L.CanEnumTerm]
P:72 [binder, in Undecidability.TM.Hoare.HoareRegister]
p:72 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
p:72 [binder, in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
P:73 [binder, in Complexity.NP.L.CanEnumTerm]
p:73 [binder, in Undecidability.L.Computability.Enum]
P:73 [binder, in Complexity.L.TM.TMflatComp]
p:73 [binder, in Undecidability.Shared.Libs.DLW.Vec.pos]
P:732 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:735 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:74 [binder, in Undecidability.TM.Code.CasePair]
P:75 [binder, in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
p:75 [binder, in Undecidability.L.Computability.Synthetic]
p:76 [binder, in Undecidability.L.Computability.Enum]
p:76 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
P:76 [binder, in Complexity.Complexity.NP]
p:77 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
p:77 [binder, in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
P:77 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
p:77 [binder, in Complexity.NP.Clique.kSAT_to_FlatClique]
P:78 [binder, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
P:78 [binder, in Undecidability.TM.Hoare.HoareRegister]
P:78 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
p:78 [binder, in Complexity.NP.Clique.kSAT_to_Clique]
p:78 [binder, in Undecidability.Shared.Libs.DLW.Vec.pos]
p:78 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
P:786 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:8 [binder, in Undecidability.Shared.Libs.DLW.Utils.prime]
p:8 [binder, in Undecidability.Synthetic.SemiDecidabilityFacts]
P:8 [binder, in Complexity.NP.TM.M_LM2TM]
P:8 [binder, in Undecidability.Synthetic.Definitions]
P:8 [binder, in Undecidability.Synthetic.InformativeDefinitions]
p:8 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
P:8 [binder, in Undecidability.Shared.Libs.DLW.Code.subcode]
p:8 [binder, in Undecidability.Shared.Libs.DLW.Vec.pos]
p:80 [binder, in Undecidability.L.Computability.Enum]
P:80 [binder, in Undecidability.TM.Hoare.HoareRegister]
P:80 [binder, in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
P:80 [binder, in Undecidability.TM.Hoare.HoareCombinators]
p:80 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
P:81 [binder, in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
p:81 [binder, in Undecidability.Synthetic.ListEnumerabilityFacts]
p:81 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
p:82 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
P:82 [binder, in Undecidability.TM.Hoare.HoareRegister]
p:82 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:82 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
p:82 [binder, in Undecidability.L.Computability.Synthetic]
P:82 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
p:82 [binder, in Complexity.NP.Clique.kSAT_to_FlatClique]
p:83 [binder, in Undecidability.L.Computability.Enum]
P:83 [binder, in Undecidability.TM.Hoare.HoareLogic]
p:83 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
p:83 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
p:84 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
P:846 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:85 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
p:85 [binder, in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
p:86 [binder, in Undecidability.L.Computability.Enum]
P:86 [binder, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
p:86 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
p:86 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
p:86 [binder, in Undecidability.Shared.Libs.DLW.Vec.pos]
p:86 [binder, in Complexity.NP.Clique.kSAT_to_FlatClique]
p:87 [binder, in Undecidability.L.Computability.Enum]
P:87 [binder, in Undecidability.L.Complexity.ResourceMeasures]
p:87 [binder, in Undecidability.Synthetic.ListEnumerabilityFacts]
P:87 [binder, in Undecidability.TM.Hoare.HoareLogic]
p:87 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
p:87 [binder, in Undecidability.TM.Code.CasePair]
P:87 [binder, in Complexity.Complexity.NP]
P:87 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
P:88 [binder, in Undecidability.TM.Hoare.HoareRegister]
p:88 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
p:88 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
p:88 [binder, in Undecidability.TM.Code.CasePair]
p:888 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
p:89 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
P:9 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_base]
P:9 [binder, in Undecidability.L.Computability.Decidability]
p:9 [binder, in Undecidability.L.Computability.Acceptability]
P:9 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
P:9 [binder, in Undecidability.L.Computability.MuRec]
P:9 [binder, in Undecidability.TM.Hoare.HoareCombinators]
P:9 [binder, in Complexity.Complexity.NP]
P:9 [binder, in Undecidability.TM.Hoare.HoareStdLib]
P:9 [binder, in Complexity.L.AbstractMachines.LambdaDepth]
p:90 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:90 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
P:906 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
P:91 [binder, in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
p:91 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
p:916 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
p:92 [binder, in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
P:92 [binder, in Undecidability.TM.Hoare.HoareCombinators]
p:926 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
p:93 [binder, in Complexity.L.TM.TMunflatten]
p:93 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
P:93 [binder, in Complexity.Complexity.NP]
P:93 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
p:930 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
P:94 [binder, in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
P:94 [binder, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
p:94 [binder, in Undecidability.TM.Util.Prelim]
p:94 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
p:94 [binder, in Complexity.L.TM.TMunflatten]
P:94 [binder, in Undecidability.TM.Hoare.HoareRegister]
p:94 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:94 [binder, in Undecidability.L.Computability.Synthetic]
p:94 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
p:94 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
p:94 [binder, in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
p:95 [binder, in Complexity.L.TM.TMunflatten]
p:95 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
p:96 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
p:96 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
p:96 [binder, in Complexity.L.TM.TMunflatten]
p:96 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
p:96 [binder, in Undecidability.Shared.Libs.DLW.Vec.pos]
P:963 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
P:97 [binder, in Undecidability.L.Computability.Seval]
p:97 [binder, in Undecidability.L.Computability.Synthetic]
P:97 [binder, in Undecidability.TM.Hoare.HoareLogic]
P:97 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
P:98 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_base]
p:98 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:98 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
p:98 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
p:995 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]

Q

qflat:3682 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
qflat:3686 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
qi':182 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
qi:181 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
qm:2644 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
qm:60 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
qm:67 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
qout_M':429 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
qout_M:428 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
qout_M:314 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
qsym:7 [binder, in Undecidability.TM.Combinators.Mirror]
qs:2766 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
quotient [definition, in Undecidability.Shared.Libs.DLW.Utils.quotient]
quotient [library]
quotient_is_enum [lemma, in Undecidability.Shared.Libs.DLW.Utils.quotient]
q_fin:330 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
q_fin:320 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
q_fin:312 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
q_fin:304 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
q_final:227 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
q_final:208 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
q_M:469 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
q_M':374 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
q_M':370 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
q_M':364 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
q_M':360 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
q_M':356 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
q_M':352 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
q_M:311 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
q_M:264 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
q_M:256 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
q''':154 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
q'':143 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
q'':151 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
q'':30 [binder, in Undecidability.TM.TM]
q'':34 [binder, in Undecidability.TM.SBTM]
q':1018 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Q':102 [binder, in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
q':1020 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':1022 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':1027 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':1035 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':104 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
q':1043 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':105 [binder, in Undecidability.TM.Univ.Univ]
q':1072 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':1074 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':1076 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':1081 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':1089 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':1097 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':111 [binder, in Undecidability.TM.Lifting.LiftTapes]
q':112 [binder, in Undecidability.TM.Univ.Univ]
q':1126 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':1128 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':1130 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':1135 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':1143 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':1151 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':1180 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':1182 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':1184 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':1189 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':119 [binder, in Undecidability.TM.Univ.Univ]
q':1197 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':12 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TM_single]
q':1205 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':122 [binder, in Undecidability.TM.Univ.Univ]
q':123 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
q':1234 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':1236 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':1238 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Q':126 [binder, in Undecidability.TM.Hoare.HoareRegister]
Q':126 [binder, in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
q':128 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
q':13 [binder, in Undecidability.TM.Combinators.Switch]
q':132 [binder, in Undecidability.TM.Univ.LowLevel]
q':1378 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':1382 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':1387 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':1395 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':14 [binder, in Undecidability.TM.Combinators.StateWhile]
q':140 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
q':1403 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':1419 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':1423 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':1428 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':143 [binder, in Undecidability.TM.Univ.LowLevel]
q':1434 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':1442 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':1450 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':1470 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':1475 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':148 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
q':1481 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':1489 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':149 [binder, in Undecidability.TM.Univ.LowLevel]
q':1497 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':15 [binder, in Undecidability.TM.Combinators.Switch]
q':1515 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':1519 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Q':152 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
q':1524 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':1532 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':1540 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Q':155 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
q':1556 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Q':156 [binder, in Undecidability.TM.Hoare.HoareRegister]
q':1560 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':1565 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':1571 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':1579 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Q':158 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
q':1587 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':1607 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':161 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
q':1612 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':1617 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':1625 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':1633 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':165 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
q':1650 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':1654 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':1658 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':1666 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':1674 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':168 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
q':168 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
q':1689 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':1694 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':1697 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':1705 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':1713 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':1728 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':1733 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':1736 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':1744 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':1752 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':1767 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':1774 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Q':178 [binder, in Undecidability.TM.Hoare.HoareRegister]
q':1781 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':1809 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':1810 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':1811 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':1815 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':1822 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':1829 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':184 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
q':184 [binder, in Undecidability.TM.Univ.Univ]
q':1857 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':1858 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':1859 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':1863 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':1870 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':1877 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':1905 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':1906 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':1907 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':2007 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':2039 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':2071 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':2103 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':2114 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':2125 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':2136 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':2147 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':2158 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':2168 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':2178 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':2188 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':2198 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':2208 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':2218 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':2225 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':2234 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':2243 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':2252 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':2261 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':2270 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':2279 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':2288 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':2297 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':2305 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':2313 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':2321 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':2329 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':2337 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':2345 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':2353 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':2361 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':2369 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':2377 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Q':238 [binder, in Undecidability.TM.Hoare.HoareRegister]
q':2385 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':2393 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':24 [binder, in Undecidability.TM.Univ.Univ]
q':2401 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':2409 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':2417 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':2425 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':2433 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':2441 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':2448 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':2455 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':2462 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':2469 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':2476 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':2483 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':2490 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':2497 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Q':25 [binder, in Undecidability.L.Tactics.ComputableTactics]
q':2504 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Q':254 [binder, in Undecidability.TM.Hoare.HoareRegister]
q':257 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
Q':266 [binder, in Undecidability.TM.Hoare.HoareRegister]
q':2716 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':2730 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':2736 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':274 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
q':2744 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':2761 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':2772 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':2780 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':28 [binder, in Undecidability.TM.TM]
Q':28 [binder, in Undecidability.L.Tactics.ComputableTactics]
Q':28 [binder, in Undecidability.TM.Hoare.HoareCombinators]
Q':282 [binder, in Undecidability.TM.Hoare.HoareRegister]
Q':29 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
Q':294 [binder, in Undecidability.TM.Hoare.HoareRegister]
q':31 [binder, in Undecidability.TM.SBTM]
q':3247 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':3250 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':3256 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':3263 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':3278 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':3288 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':3298 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':33 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TM_single]
q':33 [binder, in Undecidability.TM.Univ.Univ]
q':3310 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':3320 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':3330 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':3342 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':3352 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':3362 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':3374 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':3382 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':3390 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':3400 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':3408 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':3416 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':3426 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':3434 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':3442 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':3454 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':3464 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':3474 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':348 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':3483 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':3492 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':3501 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':3509 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':3517 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':3525 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':356 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':366 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':37 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TM_single]
q':37 [binder, in Undecidability.TM.Univ.Univ]
Q':370 [binder, in Undecidability.TM.Hoare.HoareRegister]
q':376 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Q':385 [binder, in Undecidability.TM.Hoare.HoareRegister]
q':39 [binder, in Undecidability.TM.SBTM]
q':393 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Q':399 [binder, in Undecidability.TM.Hoare.HoareRegister]
q':40 [binder, in Undecidability.TM.TM]
q':400 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':409 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':409 [binder, in Undecidability.TM.Util.TM_facts]
q':411 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q':416 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
Q':417 [binder, in Undecidability.TM.Hoare.HoareRegister]
q':418 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':419 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q':426 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q':434 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':44 [binder, in Undecidability.TM.SBTM]
q':442 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':45 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TM_single]
q':452 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Q':452 [binder, in Undecidability.TM.Hoare.HoareCombinators]
q':455 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q':46 [binder, in Undecidability.TM.Lifting.LiftAlphabet]
q':461 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q':462 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':467 [binder, in Undecidability.TM.Single.StepTM]
Q':468 [binder, in Undecidability.TM.Hoare.HoareRegister]
q':469 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q':47 [binder, in Undecidability.TM.Univ.Univ]
q':471 [binder, in Undecidability.TM.Single.StepTM]
q':476 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q':479 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Q':481 [binder, in Undecidability.TM.Hoare.HoareRegister]
q':486 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q':487 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':49 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TM_single]
Q':490 [binder, in Undecidability.TM.Hoare.HoareRegister]
q':491 [binder, in Undecidability.TM.Single.StepTM]
q':492 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q':497 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q':497 [binder, in Undecidability.TM.Single.StepTM]
q':497 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Q':50 [binder, in Undecidability.TM.Code.List.App]
Q':501 [binder, in Undecidability.TM.Hoare.HoareRegister]
q':503 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q':507 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':508 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
Q':51 [binder, in Undecidability.TM.Hoare.HoareCombinators]
q':513 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
Q':513 [binder, in Undecidability.TM.Hoare.HoareRegister]
q':518 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q':524 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q':524 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':529 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q':531 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':534 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q':539 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q':54 [binder, in Undecidability.TM.Univ.Univ]
Q':54 [binder, in Undecidability.TM.Code.List.App]
q':540 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Q':543 [binder, in Undecidability.TM.Hoare.HoareRegister]
q':545 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q':549 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':550 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q':556 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
Q':557 [binder, in Undecidability.TM.Hoare.HoareRegister]
q':560 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q':565 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':566 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q':571 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q':573 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':579 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
Q':58 [binder, in Undecidability.TM.Code.List.App]
q':583 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q':583 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':586 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q':590 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q':593 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q':593 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':596 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q':599 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q':6 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TM_single]
q':603 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q':606 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q':609 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q':610 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':612 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q':616 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q':617 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':619 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
Q':62 [binder, in Undecidability.TM.Code.List.App]
q':627 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':637 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':65 [binder, in Undecidability.TM.Univ.Univ]
q':653 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':660 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':664 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q':669 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q':67 [binder, in Complexity.L.TM.TMflatten]
q':670 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':678 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q':680 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':684 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
Q':69 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
q':696 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':703 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':713 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Q':72 [binder, in Undecidability.TM.Hoare.HoareCombinators]
q':723 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':73 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
q':73 [binder, in Undecidability.TM.Univ.Univ]
q':739 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':748 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':757 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':787 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':790 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':793 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':799 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':8 [binder, in Undecidability.TM.Combinators.Mirror]
q':808 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':81 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
q':817 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':847 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':850 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':853 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':859 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Q':86 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
q':868 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':877 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':907 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':910 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':913 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':919 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':927 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':935 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Q':95 [binder, in Undecidability.TM.Hoare.HoareCombinators]
q':964 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':966 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':968 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':97 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
q':973 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':981 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':989 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q0:2095 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q0:2106 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q0:2117 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q0:2128 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q0:2139 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q0:2150 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q0:2161 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q0:2171 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q0:2181 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q0:2191 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q0:2201 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q0:2211 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Q0:499 [binder, in Undecidability.TM.Hoare.HoareRegister]
Q0:511 [binder, in Undecidability.TM.Hoare.HoareRegister]
Q0:522 [binder, in Undecidability.TM.Hoare.HoareRegister]
Q0:532 [binder, in Undecidability.TM.Hoare.HoareRegister]
Q0:541 [binder, in Undecidability.TM.Hoare.HoareRegister]
Q0:555 [binder, in Undecidability.TM.Hoare.HoareRegister]
Q0:568 [binder, in Undecidability.TM.Hoare.HoareRegister]
Q0:580 [binder, in Undecidability.TM.Hoare.HoareRegister]
q1:169 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
q1:172 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
Q1:173 [binder, in Undecidability.TM.Hoare.HoareLogic]
Q1:197 [binder, in Undecidability.TM.Hoare.HoareLogic]
Q1:208 [binder, in Undecidability.TM.Hoare.HoareLogic]
Q1:220 [binder, in Undecidability.TM.Hoare.HoareLogic]
Q1:310 [binder, in Undecidability.TM.Hoare.HoareLogic]
Q1:400 [binder, in Undecidability.TM.Hoare.HoareLogic]
q1:54 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
q1:57 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
q1:60 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
Q1:61 [binder, in Undecidability.Shared.Libs.DLW.Code.subcode]
q2:170 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
q2:173 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
Q2:174 [binder, in Undecidability.TM.Hoare.HoareLogic]
Q2:198 [binder, in Undecidability.TM.Hoare.HoareLogic]
Q2:209 [binder, in Undecidability.TM.Hoare.HoareLogic]
Q2:221 [binder, in Undecidability.TM.Hoare.HoareLogic]
Q2:311 [binder, in Undecidability.TM.Hoare.HoareLogic]
Q2:401 [binder, in Undecidability.TM.Hoare.HoareLogic]
q2:55 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
q2:58 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
q2:61 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
Q2:62 [binder, in Undecidability.Shared.Libs.DLW.Code.subcode]
q:10 [binder, in Undecidability.TM.Combinators.While]
q:10 [binder, in Undecidability.TM.Combinators.Switch]
q:10 [binder, in Complexity.L.AbstractMachines.Computable.Unfolding]
Q:10 [binder, in Undecidability.L.Computability.Decidability]
q:10 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TM_single]
q:10 [binder, in Undecidability.L.Computability.Acceptability]
Q:10 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
q:100 [binder, in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
Q:100 [binder, in Undecidability.TM.Hoare.HoareLogic]
q:100 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
q:100 [binder, in Undecidability.TM.Univ.Univ]
q:1003 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:101 [binder, in Undecidability.TM.Univ.LowLevel]
q:1010 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Q:102 [binder, in Undecidability.TM.Hoare.HoareRegister]
q:102 [binder, in Undecidability.Synthetic.ListEnumerabilityFacts]
q:102 [binder, in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
q:102 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
q:1026 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:103 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
q:1034 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Q:104 [binder, in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
q:104 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachine]
Q:104 [binder, in Undecidability.TM.Hoare.HoareExamples]
q:1042 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:105 [binder, in Undecidability.TM.Univ.LowLevel]
Q:105 [binder, in Complexity.Complexity.NP]
q:1050 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:1057 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Q:106 [binder, in Undecidability.TM.Hoare.HoareCombinators]
q:106 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
q:1064 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:107 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachine]
q:108 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
q:108 [binder, in Undecidability.TM.Univ.LowLevel]
q:108 [binder, in Undecidability.TM.Univ.Univ]
q:1080 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:1088 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Q:109 [binder, in Undecidability.TM.Hoare.HoareRegister]
q:109 [binder, in Undecidability.TM.Lifting.LiftTapes]
q:109 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
q:1096 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Q:11 [binder, in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
q:11 [binder, in Undecidability.Shared.Libs.DLW.Vec.pos]
Q:110 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_base]
q:1104 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:1111 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:1118 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:112 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
q:112 [binder, in Undecidability.TM.Univ.LowLevel]
Q:113 [binder, in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
Q:113 [binder, in Undecidability.TM.Hoare.HoareLogic]
q:1134 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:1142 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:115 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
q:1150 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:1158 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:116 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
q:116 [binder, in Undecidability.TM.Univ.Univ]
q:1165 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:117 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
q:1172 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:118 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
q:118 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
Q:118 [binder, in Complexity.Complexity.NP]
q:1188 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:119 [binder, in Undecidability.TM.Univ.LowLevel]
q:1196 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:12 [binder, in Undecidability.TM.Combinators.Combinators]
Q:12 [binder, in Complexity.L.AbstractMachines.AbstractSubstMachine]
q:12 [binder, in Undecidability.L.Computability.Acceptability]
q:12 [binder, in Undecidability.TM.Combinators.StateWhile]
Q:12 [binder, in Undecidability.Shared.Libs.DLW.Code.subcode]
q:12 [binder, in Undecidability.TM.Univ.Univ]
q:120 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
q:1204 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Q:121 [binder, in Undecidability.TM.Hoare.HoareCombinators]
q:1212 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:1219 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:122 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
q:122 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
q:1226 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Q:124 [binder, in Undecidability.TM.Hoare.HoareLogic]
q:1242 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:1249 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Q:125 [binder, in Undecidability.TM.Hoare.HoareRegister]
q:125 [binder, in Undecidability.TM.Univ.Univ]
q:1256 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:126 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
q:126 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
q:1263 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:127 [binder, in Complexity.TM.PrettyBounds.UnivBounds]
q:127 [binder, in Undecidability.TM.Univ.LowLevel]
q:1270 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:1277 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Q:128 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
q:1287 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:129 [binder, in Undecidability.TM.Univ.LowLevel]
q:129 [binder, in Undecidability.TM.Univ.Univ]
q:1294 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Q:13 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_dec]
Q:13 [binder, in Undecidability.L.Computability.Decidability]
Q:13 [binder, in Undecidability.Synthetic.InformativeDefinitions]
q:130 [binder, in Complexity.TM.PrettyBounds.UnivBounds]
Q:130 [binder, in Undecidability.TM.Hoare.HoareCombinators]
q:130 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
q:1301 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:1308 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:1315 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Q:132 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
q:1322 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:133 [binder, in Undecidability.TM.Univ.Univ]
q:1332 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:1339 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:134 [binder, in Undecidability.Shared.Libs.DLW.Utils.sorting]
q:134 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
q:1346 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Q:135 [binder, in Undecidability.TM.Hoare.HoareLogic]
q:1353 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:1360 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:1367 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:137 [binder, in Undecidability.TM.Univ.Univ]
Q:137 [binder, in Complexity.Complexity.NP]
Q:137 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
q:1377 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:138 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
q:1381 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:1386 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:139 [binder, in Complexity.TM.PrettyBounds.UnivBounds]
q:139 [binder, in Undecidability.TM.Univ.LowLevel]
q:139 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
q:1394 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:14 [binder, in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
q:14 [binder, in Undecidability.Shared.Libs.DLW.Vec.pos]
Q:140 [binder, in Undecidability.TM.Hoare.HoareCombinators]
q:140 [binder, in Undecidability.Shared.Libs.DLW.Vec.pos]
q:1402 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Q:141 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
q:141 [binder, in Undecidability.TM.Univ.Univ]
Q:141 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
q:1418 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:142 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
q:1422 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:1427 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Q:143 [binder, in Complexity.Complexity.NP]
q:1433 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Q:144 [binder, in Undecidability.TM.Hoare.HoareLogic]
q:1441 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:1449 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:145 [binder, in Undecidability.TM.Univ.Univ]
Q:145 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
q:146 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
q:1469 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:1474 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:148 [binder, in Undecidability.TM.Univ.LowLevel]
q:148 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
q:1480 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:1488 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Q:149 [binder, in Undecidability.TM.Hoare.HoareCombinators]
q:149 [binder, in Undecidability.TM.Univ.Univ]
q:1496 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:15 [binder, in Undecidability.Shared.Libs.DLW.Utils.crt]
q:15 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TM_single]
Q:15 [binder, in Undecidability.L.Computability.Acceptability]
q:15 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
q:150 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
q:150 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
Q:151 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
q:1514 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:1518 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:152 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
q:1523 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:153 [binder, in Complexity.TM.PrettyBounds.UnivBounds]
q:153 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
q:153 [binder, in Undecidability.TM.Univ.Univ]
q:1531 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:1539 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:154 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
Q:155 [binder, in Undecidability.TM.Hoare.HoareRegister]
q:1555 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:1559 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:156 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
q:156 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
q:1564 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:157 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
q:157 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
q:157 [binder, in Undecidability.TM.Univ.Univ]
q:1570 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:1578 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:158 [binder, in Complexity.TM.PrettyBounds.UnivBounds]
q:1586 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:159 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
Q:16 [binder, in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
q:16 [binder, in Undecidability.TM.Combinators.StateWhile]
Q:16 [binder, in Undecidability.TM.Hoare.HoareCombinators]
q:16 [binder, in Undecidability.TM.Univ.Univ]
q:1606 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:161 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
q:161 [binder, in Undecidability.TM.Univ.Univ]
Q:161 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
q:1611 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:1616 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:162 [binder, in Complexity.TM.PrettyBounds.UnivBounds]
q:1624 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:163 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
q:1632 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:164 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
q:1649 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:165 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
q:1653 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:1657 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:166 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
q:1665 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:167 [binder, in Complexity.TM.PrettyBounds.UnivBounds]
q:167 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
q:167 [binder, in Undecidability.Shared.Libs.DLW.Vec.pos]
q:1673 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Q:168 [binder, in Undecidability.TM.Hoare.HoareCombinators]
q:1688 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:169 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
q:169 [binder, in Undecidability.Shared.Libs.DLW.Vec.pos]
q:169 [binder, in Undecidability.TM.Univ.Univ]
q:1693 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:1696 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:17 [binder, in Undecidability.TM.Basic.Mono]
q:17 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
Q:17 [binder, in Undecidability.TM.Hoare.HoareLogic]
q:1704 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:171 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
q:171 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
q:1712 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:172 [binder, in Complexity.TM.PrettyBounds.UnivBounds]
q:172 [binder, in Undecidability.Shared.Libs.DLW.Vec.pos]
q:1727 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:173 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
q:1732 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:1735 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:174 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
q:1743 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:175 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
q:1751 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:176 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
q:1766 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:1773 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:1780 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:1787 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Q:179 [binder, in Undecidability.TM.Hoare.HoareRegister]
q:1794 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:18 [binder, in Undecidability.TM.Combinators.Switch]
Q:18 [binder, in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
q:18 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TM_single]
Q:18 [binder, in Undecidability.L.Tactics.ComputableTactics]
q:18 [binder, in Undecidability.Synthetic.ReducibilityFacts]
q:180 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
q:1801 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Q:181 [binder, in Undecidability.TM.Hoare.HoareCombinators]
q:1814 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:182 [binder, in Undecidability.TM.Univ.Univ]
q:1821 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:1828 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:183 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
q:1835 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:1842 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:1849 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:186 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
q:186 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
q:1862 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:1869 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:1876 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:1883 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:1890 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:1897 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Q:19 [binder, in Undecidability.L.AbstractMachines.FlatPro.Programs]
q:19 [binder, in Undecidability.Synthetic.MoreEnumerabilityFacts]
q:19 [binder, in Undecidability.TM.Combinators.StateWhile]
Q:19 [binder, in Complexity.L.AbstractMachines.FunctionalDefinitions]
q:19 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
Q:191 [binder, in Undecidability.TM.Hoare.HoareLogic]
q:191 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
q:1910 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:1917 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:1924 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:193 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
Q:193 [binder, in Undecidability.TM.Hoare.HoareCombinators]
q:1931 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:1938 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:1945 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:1955 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:196 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
q:1962 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:1969 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:1976 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:199 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
q:199 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
q:2 [binder, in Undecidability.Shared.Libs.DLW.Utils.prime]
Q:2 [binder, in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
Q:20 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_dec]
Q:20 [binder, in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
q:20 [binder, in Undecidability.TM.Combinators.Switch]
q:200 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
q:2002 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:2003 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:2004 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:2005 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:2006 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Q:202 [binder, in Undecidability.TM.Hoare.HoareCombinators]
q:2038 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:205 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
q:206 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
q:207 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
q:2070 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:209 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
q:2094 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Q:21 [binder, in Undecidability.Shared.Dec]
Q:210 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
q:2105 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:211 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
q:2116 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:2127 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:213 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
q:2138 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:214 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
q:2149 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:215 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
q:216 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
q:2160 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:2170 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Q:218 [binder, in Undecidability.TM.Hoare.HoareCombinators]
Q:218 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
q:2180 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:219 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
q:2190 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Q:22 [binder, in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
q:220 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
q:2200 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:2210 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:222 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
q:222 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
q:2222 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:2231 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:224 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
q:2240 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:2249 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:225 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
q:225 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
q:2258 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:226 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
q:2267 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Q:227 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
q:2276 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:228 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
q:2285 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Q:229 [binder, in Undecidability.TM.Hoare.HoareRegister]
q:2294 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:23 [binder, in Undecidability.Shared.FilterFacts]
q:23 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
q:23 [binder, in Undecidability.Shared.Libs.PSL.Lists.Filter]
q:23 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
q:23 [binder, in Undecidability.TM.Univ.Univ]
q:2303 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:231 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
Q:231 [binder, in Undecidability.TM.Hoare.HoareLogic]
q:2311 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:2319 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:2327 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:233 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
q:2335 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:234 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
q:2343 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Q:235 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
q:2351 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:2359 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:236 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
Q:236 [binder, in Undecidability.TM.Hoare.HoareCombinators]
q:2367 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:2375 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:238 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
q:2383 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Q:239 [binder, in Undecidability.TM.Hoare.HoareRegister]
Q:239 [binder, in Undecidability.TM.Hoare.HoareLogic]
Q:239 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
q:2391 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:2399 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:24 [binder, in Undecidability.Shared.Libs.DLW.Utils.prime]
Q:24 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_base]
q:24 [binder, in Undecidability.TM.TM]
Q:24 [binder, in Undecidability.L.Tactics.ComputableTactics]
Q:24 [binder, in Undecidability.Shared.Libs.DLW.Code.subcode]
q:24 [binder, in Undecidability.Synthetic.ReducibilityFacts]
q:2407 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:241 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
q:2415 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:242 [binder, in Undecidability.L.Tactics.Extract]
q:242 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
q:2423 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:2431 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:2439 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:244 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
q:2447 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:2454 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:246 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
q:2461 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:2468 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:2475 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:2482 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:2489 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Q:249 [binder, in Undecidability.TM.Hoare.HoareLogic]
Q:249 [binder, in Undecidability.TM.Hoare.HoareCombinators]
q:249 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
q:2496 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:25 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
Q:25 [binder, in Undecidability.L.Computability.Decidability]
Q:25 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
Q:25 [binder, in Undecidability.TM.Hoare.HoareLogic]
Q:250 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
q:2503 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:2512 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:2517 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:2522 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:253 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
q:2535 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:2539 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:255 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
Q:255 [binder, in Undecidability.TM.Hoare.HoareRegister]
q:255 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
q:258 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
q:2592 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:2599 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:26 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
Q:26 [binder, in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
Q:26 [binder, in Complexity.Complexity.Definitions]
Q:26 [binder, in Complexity.L.AbstractMachines.FunctionalDefinitions]
Q:26 [binder, in Undecidability.Shared.Libs.DLW.Code.subcode]
Q:260 [binder, in Undecidability.TM.Hoare.HoareLogic]
Q:260 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
Q:261 [binder, in Undecidability.TM.Hoare.HoareCombinators]
q:2615 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:2616 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:2617 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:2618 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:2619 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:2620 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:2621 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:2622 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:2623 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:2630 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:2639 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:264 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
Q:267 [binder, in Undecidability.TM.Hoare.HoareRegister]
q:269 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
Q:27 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
q:27 [binder, in Undecidability.Shared.FilterFacts]
q:27 [binder, in Undecidability.Shared.Libs.PSL.Lists.Filter]
Q:27 [binder, in Undecidability.L.Computability.Decidability]
Q:27 [binder, in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
q:27 [binder, in Undecidability.TM.SBTM]
Q:27 [binder, in Undecidability.TM.Hoare.HoareCombinators]
Q:270 [binder, in Undecidability.TM.Hoare.HoareLogic]
Q:271 [binder, in Undecidability.TM.Hoare.HoareCombinators]
q:2713 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:2720 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:2726 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:2732 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:2738 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:274 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
q:2742 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:2750 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:2756 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Q:276 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
q:2765 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:2767 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:277 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
q:2770 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:2776 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:279 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
Q:28 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
Q:28 [binder, in Undecidability.Shared.Libs.DLW.Code.subcode]
q:28 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
Q:280 [binder, in Undecidability.TM.Hoare.HoareLogic]
q:280 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
q:281 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
Q:283 [binder, in Undecidability.TM.Hoare.HoareRegister]
Q:284 [binder, in Undecidability.TM.Hoare.HoareCombinators]
q:287 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
Q:287 [binder, in Undecidability.TM.Hoare.HoareLogic]
q:288 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
q:289 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
q:29 [binder, in Undecidability.Shared.Libs.DLW.Utils.prime]
q:29 [binder, in Undecidability.TM.SBTM]
q:29 [binder, in Undecidability.TM.Univ.Univ]
q:291 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
q:293 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
q:293 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
Q:294 [binder, in Undecidability.TM.Hoare.HoareLogic]
q:295 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
Q:295 [binder, in Undecidability.TM.Hoare.HoareRegister]
q:295 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
Q:3 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_dec]
q:3 [binder, in Undecidability.TM.Basic.Null]
q:3 [binder, in Complexity.L.AbstractMachines.UnfoldTailRec]
Q:3 [binder, in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
Q:30 [binder, in Undecidability.Shared.Libs.PSL.EqDec]
Q:30 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
q:30 [binder, in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
Q:30 [binder, in Undecidability.Shared.Libs.DLW.Code.subcode]
Q:300 [binder, in Undecidability.TM.Hoare.HoareCombinators]
q:301 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
Q:303 [binder, in Undecidability.TM.Hoare.HoareLogic]
q:309 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
q:31 [binder, in Undecidability.Shared.FilterFacts]
Q:31 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
q:31 [binder, in Undecidability.Shared.Libs.PSL.Lists.Filter]
Q:31 [binder, in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
q:31 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TM_single]
Q:31 [binder, in Undecidability.TM.Hoare.HoareLogic]
Q:311 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
Q:316 [binder, in Undecidability.TM.Hoare.HoareCombinators]
q:317 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
Q:320 [binder, in Undecidability.TM.Hoare.HoareLogic]
q:3242 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:3246 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:3249 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Q:325 [binder, in Undecidability.TM.Hoare.HoareRegister]
q:3255 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:3262 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:3266 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:3269 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:327 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
q:3272 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:3273 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:3277 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Q:328 [binder, in Undecidability.TM.Hoare.HoareCombinators]
q:3287 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:3297 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Q:33 [binder, in Undecidability.Synthetic.Definitions]
Q:33 [binder, in Complexity.L.AbstractMachines.FunctionalDefinitions]
Q:33 [binder, in Undecidability.Shared.Libs.DLW.Code.subcode]
q:3309 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Q:331 [binder, in Undecidability.TM.Hoare.HoareLogic]
q:3319 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:3329 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:3341 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:335 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
q:3351 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Q:336 [binder, in Undecidability.TM.Hoare.HoareRegister]
q:3361 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:337 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
q:3373 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:3381 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:3389 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:3399 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Q:34 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
q:3407 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:3415 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:3425 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:343 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
Q:343 [binder, in Undecidability.TM.Hoare.HoareLogic]
q:3433 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:3441 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:3451 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:3461 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:347 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:3471 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:3481 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:3490 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:3499 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:35 [binder, in Undecidability.Shared.FilterFacts]
q:35 [binder, in Undecidability.Shared.Libs.PSL.Lists.Filter]
Q:35 [binder, in Complexity.Complexity.Subtypes]
q:35 [binder, in Complexity.Complexity.ONotationIsAppropriate]
q:35 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TM_single]
Q:35 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
q:35 [binder, in Undecidability.Synthetic.DecidabilityFacts]
q:35 [binder, in Undecidability.TM.Univ.Univ]
q:3508 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:3516 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:3524 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:3534 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:3539 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Q:354 [binder, in Undecidability.TM.Hoare.HoareLogic]
q:3544 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:355 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:3551 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:3559 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Q:358 [binder, in Undecidability.TM.Hoare.HoareRegister]
Q:36 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
Q:36 [binder, in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
q:36 [binder, in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
Q:36 [binder, in Undecidability.Shared.Libs.DLW.Code.subcode]
Q:36 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
q:3623 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:3625 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:3631 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:365 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:3657 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Q:366 [binder, in Undecidability.TM.Hoare.HoareLogic]
q:3662 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:3663 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:3665 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:3681 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:3685 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Q:369 [binder, in Undecidability.TM.Hoare.HoareCombinators]
q:3696 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:37 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
Q:37 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
q:3704 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Q:371 [binder, in Undecidability.TM.Hoare.HoareRegister]
Q:374 [binder, in Undecidability.TM.Hoare.HoareLogic]
q:375 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Q:38 [binder, in Undecidability.Synthetic.Definitions]
Q:38 [binder, in Complexity.L.AbstractMachines.FunctionalDefinitions]
Q:38 [binder, in Undecidability.TM.Hoare.HoareCombinators]
Q:382 [binder, in Undecidability.TM.Hoare.HoareLogic]
Q:386 [binder, in Undecidability.TM.Hoare.HoareRegister]
Q:388 [binder, in Undecidability.TM.Hoare.HoareCombinators]
q:39 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
Q:39 [binder, in Undecidability.Shared.Libs.DLW.Code.subcode]
q:392 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Q:392 [binder, in Undecidability.TM.Hoare.HoareLogic]
q:398 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q:399 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:4 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TM_single]
Q:40 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
q:40 [binder, in Undecidability.TM.Univ.Univ]
Q:400 [binder, in Undecidability.TM.Hoare.HoareRegister]
q:402 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q:407 [binder, in Undecidability.TM.Util.TM_facts]
q:408 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:41 [binder, in Undecidability.Synthetic.DecidabilityFacts]
q:410 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q:415 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q:417 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:418 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
Q:418 [binder, in Undecidability.TM.Hoare.HoareRegister]
q:42 [binder, in Undecidability.TM.SBTM]
q:42 [binder, in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
q:425 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q:43 [binder, in Undecidability.L.Datatypes.LNat]
q:433 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:44 [binder, in Undecidability.TM.Lifting.LiftAlphabet]
Q:44 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
Q:44 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_base]
Q:44 [binder, in Undecidability.TM.Hoare.HoareLogic]
q:44 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
q:44 [binder, in Undecidability.TM.Univ.Univ]
q:441 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
q:441 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:444 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
Q:45 [binder, in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
q:451 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:454 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q:455 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
Q:455 [binder, in Undecidability.TM.Hoare.HoareCombinators]
q:460 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q:460 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
q:461 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:465 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
Q:466 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
q:468 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
Q:469 [binder, in Undecidability.TM.Hoare.HoareRegister]
Q:47 [binder, in Complexity.Complexity.Subtypes]
q:47 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TM_single]
q:47 [binder, in Undecidability.TM.SBTM]
q:47 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
q:475 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q:476 [binder, in Undecidability.TM.Single.StepTM]
q:478 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:48 [binder, in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
Q:48 [binder, in Complexity.L.AbstractMachines.AbstractSubstMachine]
q:48 [binder, in Undecidability.Synthetic.ReducibilityFacts]
Q:482 [binder, in Undecidability.TM.Hoare.HoareRegister]
q:485 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q:485 [binder, in Undecidability.TM.Single.StepTM]
q:486 [binder, in Undecidability.TM.Single.StepTM]
q:486 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Q:49 [binder, in Undecidability.TM.Code.List.App]
q:491 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
Q:491 [binder, in Undecidability.TM.Hoare.HoareRegister]
q:493 [binder, in Undecidability.TM.Single.StepTM]
q:496 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q:496 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:499 [binder, in Undecidability.TM.Single.StepTM]
q:5 [binder, in Undecidability.Synthetic.MoreEnumerabilityFacts]
q:50 [binder, in Undecidability.Shared.Libs.DLW.Utils.prime]
Q:50 [binder, in Undecidability.TM.Hoare.HoareCombinators]
Q:500 [binder, in Undecidability.TM.Hoare.HoareRegister]
q:502 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q:505 [binder, in Undecidability.TM.Single.StepTM]
q:506 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:507 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q:51 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
Q:51 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
q:512 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
Q:512 [binder, in Undecidability.TM.Hoare.HoareRegister]
q:517 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q:52 [binder, in Undecidability.TM.Univ.Univ]
q:52 [binder, in Undecidability.Synthetic.ReducibilityFacts]
q:523 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
Q:523 [binder, in Undecidability.TM.Hoare.HoareRegister]
q:523 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:528 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q:53 [binder, in Undecidability.Shared.Libs.DLW.Utils.prime]
Q:53 [binder, in Undecidability.TM.Hoare.HoareLogic]
Q:53 [binder, in Undecidability.TM.Code.List.App]
q:530 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:533 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
Q:533 [binder, in Undecidability.TM.Hoare.HoareRegister]
q:538 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q:539 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:54 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
Q:542 [binder, in Undecidability.TM.Hoare.HoareRegister]
q:544 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q:548 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:549 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q:555 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
Q:556 [binder, in Undecidability.TM.Hoare.HoareRegister]
q:559 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q:56 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:56 [binder, in Undecidability.Synthetic.ReducibilityFacts]
q:564 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:565 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
Q:569 [binder, in Undecidability.TM.Hoare.HoareRegister]
Q:57 [binder, in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
q:57 [binder, in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
Q:57 [binder, in Undecidability.TM.Code.List.App]
q:570 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q:572 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:578 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
Q:58 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
Q:58 [binder, in Undecidability.TM.Hoare.HoareRegister]
Q:581 [binder, in Undecidability.TM.Hoare.HoareRegister]
q:582 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q:582 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:585 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q:589 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
Q:59 [binder, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
q:592 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q:592 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:595 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q:598 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q:6 [binder, in Undecidability.TM.Combinators.While]
q:6 [binder, in Undecidability.Synthetic.Undecidability]
Q:60 [binder, in Complexity.Complexity.Subtypes]
Q:60 [binder, in Undecidability.TM.Hoare.HoareLogic]
Q:60 [binder, in Undecidability.TM.Hoare.HoareCombinators]
q:602 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q:605 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q:608 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q:609 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Q:61 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_base]
q:61 [binder, in Undecidability.TM.Univ.Univ]
Q:61 [binder, in Undecidability.TM.Code.List.App]
q:611 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q:615 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q:616 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:618 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
Q:62 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
q:624 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q:626 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Q:63 [binder, in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
q:63 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
q:630 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q:634 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q:636 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:64 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
q:640 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
Q:65 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
q:65 [binder, in Complexity.L.TM.TMflatten]
q:652 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:654 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q:658 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q:659 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:66 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
q:662 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q:667 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q:669 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Q:67 [binder, in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
Q:67 [binder, in Undecidability.TM.Hoare.HoareLogic]
Q:67 [binder, in Undecidability.Shared.Libs.DLW.Code.subcode]
q:673 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q:676 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q:679 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Q:68 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
q:68 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
q:682 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q:689 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q:69 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:69 [binder, in Undecidability.TM.Univ.Univ]
q:695 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:697 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
Q:7 [binder, in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
Q:7 [binder, in Undecidability.TM.Hoare.HoareLogic]
Q:70 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_base]
q:70 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
q:701 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q:702 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:704 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q:706 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q:709 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
Q:71 [binder, in Undecidability.TM.Hoare.HoareRegister]
Q:71 [binder, in Undecidability.TM.Hoare.HoareCombinators]
q:712 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:713 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q:718 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q:72 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
Q:72 [binder, in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
Q:72 [binder, in Undecidability.TM.Hoare.HoareLogic]
q:720 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q:722 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q:722 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:724 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q:727 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q:729 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q:73 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
q:73 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:73 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
q:730 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q:733 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q:736 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q:738 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:739 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q:742 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q:744 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q:746 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q:747 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:749 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
Q:75 [binder, in Undecidability.TM.Hoare.HoareRegister]
q:754 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q:756 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q:756 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:76 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:76 [binder, in Undecidability.TM.Univ.Univ]
q:760 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q:761 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q:765 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q:765 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:767 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q:77 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
Q:77 [binder, in Complexity.Complexity.NP]
q:770 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q:772 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:774 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q:779 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Q:78 [binder, in Undecidability.TM.Hoare.HoareLogic]
q:79 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
q:798 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:8 [binder, in Undecidability.TM.Combinators.While]
Q:8 [binder, in Complexity.L.AbstractMachines.AbstractSubstMachine]
q:8 [binder, in Undecidability.TM.Combinators.StateWhile]
q:80 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
q:80 [binder, in Undecidability.TM.Univ.Univ]
q:807 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:81 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
q:816 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Q:82 [binder, in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
Q:82 [binder, in Undecidability.TM.Hoare.HoareCombinators]
q:825 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Q:83 [binder, in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
q:83 [binder, in Undecidability.L.Computability.Synthetic]
q:832 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:839 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:84 [binder, in Undecidability.TM.Univ.Univ]
Q:85 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
q:858 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:867 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:876 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:88 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
q:88 [binder, in Undecidability.TM.Univ.Univ]
Q:88 [binder, in Complexity.Complexity.NP]
q:885 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Q:89 [binder, in Undecidability.TM.Hoare.HoareLogic]
q:892 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:899 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Q:9 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
Q:90 [binder, in Undecidability.TM.Hoare.HoareRegister]
q:90 [binder, in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
q:903 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q:905 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q:907 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q:909 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q:91 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
q:918 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Q:92 [binder, in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
q:92 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
q:92 [binder, in Undecidability.TM.Univ.Univ]
q:926 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:934 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:94 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
Q:94 [binder, in Undecidability.TM.Hoare.HoareCombinators]
q:942 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:949 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:95 [binder, in Undecidability.TM.Univ.LowLevel]
q:95 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
q:956 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Q:96 [binder, in Undecidability.TM.Hoare.HoareRegister]
q:96 [binder, in Undecidability.TM.Univ.Univ]
q:972 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:980 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:988 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:99 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
q:996 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]

R

R [definition, in Undecidability.L.Util.L_facts]
r [definition, in Undecidability.L.Util.L_facts]
R [abbreviation, in Undecidability.L.TM.TMEncoding]
R [abbreviation, in Undecidability.L.TM.TMinL.TMinL_extract]
range:2 [binder, in Undecidability.L.Complexity.GenericNary]
range:20 [binder, in Undecidability.L.Complexity.GenericNary]
range:34 [binder, in Undecidability.L.Complexity.GenericNary]
range:37 [binder, in Undecidability.L.Complexity.GenericNary]
range:42 [binder, in Undecidability.L.Complexity.GenericNary]
range:49 [binder, in Undecidability.L.Complexity.GenericNary]
range:61 [binder, in Undecidability.L.Complexity.GenericNary]
range:65 [binder, in Undecidability.L.Complexity.GenericNary]
range:71 [binder, in Undecidability.L.Complexity.GenericNary]
range:75 [binder, in Undecidability.L.Complexity.GenericNary]
range:79 [binder, in Undecidability.L.Complexity.GenericNary]
range:83 [binder, in Undecidability.L.Complexity.GenericNary]
range:86 [binder, in Undecidability.L.Complexity.GenericNary]
rApp [constructor, in Undecidability.L.Tactics.Reflection]
Rarrow [definition, in Undecidability.L.Complexity.GenericNary]
rClosed [definition, in Undecidability.L.Tactics.Reflection]
rClosed_decb_correct [lemma, in Undecidability.L.Tactics.Reflection]
rClosed_decb [definition, in Undecidability.L.Tactics.Reflection]
rClosed_decb'_correct [lemma, in Undecidability.L.Tactics.Reflection]
rClosed_decb' [definition, in Undecidability.L.Tactics.Reflection]
rClosed_valid [lemma, in Undecidability.L.Tactics.Reflection]
rcomp [definition, in Undecidability.L.Prelim.ARS]
rcomp [definition, in Undecidability.TM.Util.Relations]
rComp [inductive, in Undecidability.L.Tactics.Reflection]
rCompApp [constructor, in Undecidability.L.Tactics.Reflection]
rCompAppCount [definition, in Undecidability.L.Tactics.Reflection]
rCompBeta [definition, in Undecidability.L.Tactics.Reflection]
rCompBeta_rValidComp [lemma, in Undecidability.L.Tactics.Reflection]
rCompBeta_sound [lemma, in Undecidability.L.Tactics.Reflection]
rCompClos [constructor, in Undecidability.L.Tactics.Reflection]
rCompSeval [definition, in Undecidability.L.Tactics.Reflection]
rCompSeval_rValidComp [lemma, in Undecidability.L.Tactics.Reflection]
rCompSeval_sound [lemma, in Undecidability.L.Tactics.Reflection]
rCompSeval' [definition, in Undecidability.L.Tactics.Reflection]
rCompVar [constructor, in Undecidability.L.Tactics.Reflection]
rcomp_comm [lemma, in Undecidability.L.Prelim.ARS]
rcomp_1 [lemma, in Undecidability.L.Prelim.ARS]
rcomp_eq [lemma, in Undecidability.L.Prelim.ARS]
rComp_ind_deep [definition, in Undecidability.L.Tactics.Reflection]
rComp_ind_deep' [definition, in Undecidability.L.Tactics.Reflection]
rConst [constructor, in Undecidability.L.Tactics.Reflection]
rDeClos [definition, in Undecidability.L.Tactics.Reflection]
rDeClos_rValidComp [lemma, in Undecidability.L.Tactics.Reflection]
rDeClos_reduce [lemma, in Undecidability.L.Tactics.Reflection]
ReadChar [definition, in Undecidability.TM.Basic.Mono]
ReadChar [section, in Undecidability.TM.Basic.Mono]
ReadChar [section, in Undecidability.TM.Compound.Multi]
ReadChar_Sem [definition, in Undecidability.TM.Basic.Mono]
ReadChar_Rel [definition, in Undecidability.TM.Basic.Mono]
ReadChar_at_Sem [lemma, in Undecidability.TM.Compound.Multi]
ReadChar_at_Rel [definition, in Undecidability.TM.Compound.Multi]
ReadChar_at [definition, in Undecidability.TM.Compound.Multi]
ReadChar.k [variable, in Undecidability.TM.Compound.Multi]
ReadChar.n [variable, in Undecidability.TM.Compound.Multi]
ReadChar.sig [variable, in Undecidability.TM.Basic.Mono]
ReadChar.sig [variable, in Undecidability.TM.Compound.Multi]
ReadChar2 [definition, in Undecidability.TM.Basic.Duo]
ReadChar2 [section, in Undecidability.TM.Basic.Duo]
ReadChar2_Sem [definition, in Undecidability.TM.Basic.Duo]
ReadChar2_Rel [definition, in Undecidability.TM.Basic.Duo]
ReadChar2.sig [variable, in Undecidability.TM.Basic.Duo]
ReadCurrent [definition, in Undecidability.TM.Single.StepTM]
ReadCurrent [definition, in Undecidability.TM.Univ.LowLevel]
ReadCurrentSymbols [definition, in Undecidability.TM.Single.StepTM]
ReadCurrentSymbols_steps_nice [lemma, in Complexity.TM.PrettyBounds.M2MBounds]
ReadCurrentSymbols_Loop_steps_cons_nice [lemma, in Complexity.TM.PrettyBounds.M2MBounds]
ReadCurrentSymbols_Step_steps_cons_nice [lemma, in Complexity.TM.PrettyBounds.M2MBounds]
ReadCurrentSymbols_Terminates [lemma, in Undecidability.TM.Single.StepTM]
ReadCurrentSymbols_T [definition, in Undecidability.TM.Single.StepTM]
ReadCurrentSymbols_steps [definition, in Undecidability.TM.Single.StepTM]
ReadCurrentSymbols_Realise [lemma, in Undecidability.TM.Single.StepTM]
ReadCurrentSymbols_Rel [definition, in Undecidability.TM.Single.StepTM]
ReadCurrentSymbols_Loop_Terminates [lemma, in Undecidability.TM.Single.StepTM]
ReadCurrentSymbols_Loop_T [definition, in Undecidability.TM.Single.StepTM]
ReadCurrentSymbols_Loop_steps_cons [definition, in Undecidability.TM.Single.StepTM]
ReadCurrentSymbols_Loop_steps_nil [definition, in Undecidability.TM.Single.StepTM]
ReadCurrentSymbols_Loop_Realise [lemma, in Undecidability.TM.Single.StepTM]
ReadCurrentSymbols_Loop_Rel [definition, in Undecidability.TM.Single.StepTM]
ReadCurrentSymbols_Loop [definition, in Undecidability.TM.Single.StepTM]
ReadCurrentSymbols_Step_Terminates [lemma, in Undecidability.TM.Single.StepTM]
ReadCurrentSymbols_Step_T [definition, in Undecidability.TM.Single.StepTM]
ReadCurrentSymbols_Step_steps_nil [definition, in Undecidability.TM.Single.StepTM]
ReadCurrentSymbols_Step_steps_cons [definition, in Undecidability.TM.Single.StepTM]
ReadCurrentSymbols_Step_Realise [lemma, in Undecidability.TM.Single.StepTM]
ReadCurrentSymbols_Step [definition, in Undecidability.TM.Single.StepTM]
ReadCurrentSymbols_Step_Rel [definition, in Undecidability.TM.Single.StepTM]
ReadCurrent_Sem [lemma, in Undecidability.TM.Single.StepTM]
ReadCurrent_steps [definition, in Undecidability.TM.Single.StepTM]
ReadCurrent_Rel [definition, in Undecidability.TM.Single.StepTM]
ReadCurrent_size [definition, in Undecidability.TM.Univ.LowLevel]
ReadCurrent_Sem [lemma, in Undecidability.TM.Univ.LowLevel]
ReadCurrent_Rel [definition, in Undecidability.TM.Univ.LowLevel]
ReadCurrent' [definition, in Undecidability.TM.Univ.LowLevel]
ReadCurrent'_Sem [lemma, in Undecidability.TM.Univ.LowLevel]
ReadCurrent'_steps [definition, in Undecidability.TM.Univ.LowLevel]
ReadCurrent'_Rel [definition, in Undecidability.TM.Univ.LowLevel]
ReadCurrent'_SpecT_space [lemma, in Undecidability.TM.Univ.Univ]
ReadCurrent'_size [definition, in Undecidability.TM.Univ.Univ]
ReadPosSym [definition, in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
ReadPosSym_Sem [lemma, in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
ReadPosSym_Rel [definition, in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
ReadPosSym2 [definition, in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
ReadPosSym2_Sem [lemma, in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
ReadPosSym2_Rel [definition, in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
readSymbols:116 [binder, in Undecidability.TM.Single.StepTM]
readSymbols:122 [binder, in Undecidability.TM.Single.StepTM]
readSymbols:124 [binder, in Undecidability.TM.Single.StepTM]
readSymbols:128 [binder, in Undecidability.TM.Single.StepTM]
readSymbols:134 [binder, in Undecidability.TM.Single.StepTM]
readSymbols:139 [binder, in Undecidability.TM.Single.StepTM]
readSymbols:266 [binder, in Undecidability.TM.Single.StepTM]
Realise [definition, in Undecidability.TM.Util.TM_facts]
RealiseIn [definition, in Undecidability.TM.Util.TM_facts]
RealiseIntroAll [lemma, in Undecidability.TM.Hoare.HoareLegacy]
RealiseIn_TerminatesIn [lemma, in Undecidability.TM.Util.TM_facts]
RealiseIn_Realise [lemma, in Undecidability.TM.Util.TM_facts]
RealiseIn_split [lemma, in Undecidability.TM.Util.TM_facts]
RealiseIn_monotone' [lemma, in Undecidability.TM.Util.TM_facts]
RealiseIn_monotone [lemma, in Undecidability.TM.Util.TM_facts]
RealiseIn_TripleT [lemma, in Undecidability.TM.Hoare.HoareLogic]
Realises_M_checkX:74 [binder, in Complexity.TM.Code.Decode]
Realises_M_checkX:72 [binder, in Complexity.TM.Code.Decode]
Realises__mono [lemma, in Complexity.NP.TM.M_multi2mono]
Realise_strengthen [lemma, in Undecidability.TM.Util.TM_facts]
Realise_total [lemma, in Undecidability.TM.Util.TM_facts]
Realise_monotone [lemma, in Undecidability.TM.Util.TM_facts]
Realise_TripleT [lemma, in Undecidability.TM.Hoare.HoareLogic]
Realise_Triple [lemma, in Undecidability.TM.Hoare.HoareLogic]
recRel_prettify_rel [lemma, in Undecidability.L.Tactics.ComputableTactics]
recRel_prettify_conj_drop_r [lemma, in Undecidability.L.Tactics.ComputableTactics]
recRel_prettify_conj [lemma, in Undecidability.L.Tactics.ComputableTactics]
recRel_prettify_forall [lemma, in Undecidability.L.Tactics.ComputableTactics]
recRel_prettify_drop [lemma, in Undecidability.L.Tactics.ComputableTactics]
rect2 [definition, in Undecidability.Shared.Libs.DLW.Vec.vec]
recvec:237 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
redLe [definition, in Undecidability.L.Util.L_facts]
redLe_app_helperR [lemma, in Undecidability.L.Tactics.Lrewrite]
redLe_app_helperL [lemma, in Undecidability.L.Tactics.Lrewrite]
redLe_app_helper [lemma, in Undecidability.L.Tactics.Lrewrite]
redLe_refl [instance, in Undecidability.L.Util.L_facts]
redLe_trans_eq [lemma, in Undecidability.L.Util.L_facts]
redLe_trans [lemma, in Undecidability.L.Util.L_facts]
redLe_mono [lemma, in Undecidability.L.Util.L_facts]
redLe_star_subrelation [instance, in Undecidability.L.Util.L_facts]
reduces [definition, in Undecidability.Synthetic.Definitions]
reducesPolyMO [record, in Complexity.Complexity.NP]
reducesPolyMO_intro_restrictBy_both [lemma, in Complexity.Complexity.Subtypes]
reducesPolyMO_intro_restrictBy_in [lemma, in Complexity.Complexity.Subtypes]
reducesPolyMO_intro_restrictBy_out [lemma, in Complexity.Complexity.Subtypes]
reducesPolyMO_transitive [lemma, in Complexity.Complexity.NP]
reducesPolyMO_reflexive [lemma, in Complexity.Complexity.NP]
reducesPolyMO_elim [lemma, in Complexity.Complexity.NP]
reducesPolyMO_intro [constructor, in Complexity.Complexity.NP]
reduces_ireduces_iff [lemma, in Undecidability.Synthetic.InformativeReducibilityFacts]
reduces_ireduces [lemma, in Undecidability.Synthetic.InformativeReducibilityFacts]
reduces_dependent [lemma, in Undecidability.Synthetic.ReducibilityFacts]
reduces_transitive [lemma, in Undecidability.Synthetic.ReducibilityFacts]
reduces_reflexive [lemma, in Undecidability.Synthetic.ReducibilityFacts]
reduce_eval_proper [instance, in Undecidability.L.Util.L_facts]
ReducibilityFacts [library]
reduction [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
reduction [definition, in Complexity.NP.SAT.CookLevin.Reductions.TMGenNP_fixed_singleTapeTM_to_FlatFunSingleTMGenNP]
reduction [definition, in Undecidability.Synthetic.Definitions]
reduction [definition, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
reduction [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
reduction [definition, in Complexity.NP.Clique.kSAT_to_Clique]
reduction [definition, in Complexity.NP.SAT.CookLevin.Reductions.CC_to_BinaryCC]
reduction [definition, in Complexity.NP.Clique.kSAT_to_FlatClique]
reduction [definition, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
ReductionChainNotations [module, in Undecidability.Synthetic.ReducibilityFacts]
_ ⪯ₘ _ (reduction_chain) [notation, in Undecidability.Synthetic.ReducibilityFacts]
⎩ _ ⎭ [notation, in Undecidability.Synthetic.ReducibilityFacts]
reduction_size_bound [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
reduction_poly [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
reduction_time_bound [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
reduction_time [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
reduction_wf_size_poly [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
reduction_wf_size_bound [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
reduction_wf_poly [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
reduction_wf_time_bound [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
reduction_wf_time [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
reduction_size_bound [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
reduction_poly [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
reduction_time_bound [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
reduction_time [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
reduction_correct [lemma, in Complexity.NP.SAT.CookLevin.Reductions.TMGenNP_fixed_singleTapeTM_to_FlatFunSingleTMGenNP]
reduction_time [definition, in Complexity.NP.SAT.CookLevin.Reductions.TMGenNP_fixed_singleTapeTM_to_FlatFunSingleTMGenNP]
reduction_time [definition, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
reduction_wf [lemma, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
reduction_wf_correct [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
reduction_isFlatTCCOf [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
reduction_wf [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
reduction_to_Clique [lemma, in Complexity.NP.Clique.kSAT_to_Clique]
reduction_wf [lemma, in Complexity.NP.SAT.CookLevin.Reductions.CC_to_BinaryCC]
reduction_time [definition, in Complexity.NP.Clique.kSAT_to_FlatClique]
reduction_poly [lemma, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
reduction_time_bound [lemma, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
reduction_time [definition, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
reduction_poly_size [lemma, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
reduction_varBound [lemma, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
reduction_size [lemma, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
redWithMaxSize [inductive, in Undecidability.L.Prelim.ARS]
redWithMaxSizeC [constructor, in Undecidability.L.Prelim.ARS]
redWithMaxSizeR [constructor, in Undecidability.L.Prelim.ARS]
redWithMaxSizeS [definition, in Complexity.L.AbstractMachines.AbstractSubstMachine]
redWithMaxSize_star [lemma, in Undecidability.L.Prelim.ARS]
redWithMaxSize_trans [lemma, in Undecidability.L.Prelim.ARS]
redWithMaxSize_ge [lemma, in Undecidability.L.Prelim.ARS]
red_to_exptpr [lemma, in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
red_NPhard [lemma, in Complexity.Complexity.NP]
red_inNP [lemma, in Complexity.Complexity.NP]
red_comp [lemma, in Undecidability.Synthetic.ReducibilityFacts]
red:117 [binder, in Undecidability.L.Tactics.Extract]
red:21 [binder, in Undecidability.L.Tactics.Extract]
reflb:9 [binder, in Undecidability.L.Complexity.UpToCNary]
Reflection [library]
reflects [definition, in Undecidability.Synthetic.Definitions]
reflects_prv [lemma, in Undecidability.Synthetic.DecidabilityFacts]
reflects_disj [lemma, in Undecidability.Synthetic.DecidabilityFacts]
reflects_conj [lemma, in Undecidability.Synthetic.DecidabilityFacts]
reflects_not [lemma, in Undecidability.Synthetic.DecidabilityFacts]
reflexive [definition, in Undecidability.L.Prelim.ARS]
regD:81 [binder, in Complexity.Complexity.PolyTimeComputable]
registerAs [lemma, in Undecidability.L.Tactics.Computable]
registerInjAs [lemma, in Undecidability.L.Tactics.Computable]
register_unit [instance, in Undecidability.L.Tactics.ComputableDemo]
register_vector [instance, in Undecidability.L.Datatypes.LVector]
regP_bool [instance, in Complexity.Complexity.EncodableP]
regP_option [instance, in Complexity.Complexity.EncodableP]
regP_list [instance, in Complexity.Complexity.EncodableP]
regP_Prod [instance, in Complexity.Complexity.EncodableP]
regP_term [instance, in Complexity.Complexity.EncodableP]
regP_nat [instance, in Complexity.Complexity.EncodableP]
regP_TM [instance, in Complexity.L.TM.TMflatEnc]
regP_move [instance, in Complexity.L.TM.TMflatEnc]
RegSpec [inductive, in Undecidability.TM.Hoare.HoareRegister]
RegSpec [section, in Undecidability.TM.Hoare.HoareRegister]
RegSpec.sig [variable, in Undecidability.TM.Hoare.HoareRegister]
_ ^+ (type_scope) [notation, in Undecidability.TM.Hoare.HoareRegister]
regX:101 [binder, in Complexity.Complexity.NP]
regX:115 [binder, in Complexity.Complexity.NP]
regX:57 [binder, in Complexity.NP.TM.LM_to_mTM]
regX:68 [binder, in Complexity.NP.TM.LM_to_mTM]
regX:82 [binder, in Complexity.Complexity.PolyTimeComputable]
regX:85 [binder, in Complexity.NP.TM.LM_to_mTM]
regX:92 [binder, in Complexity.Complexity.NP]
regY:102 [binder, in Complexity.Complexity.NP]
regY:116 [binder, in Complexity.Complexity.NP]
RegY:4 [binder, in Complexity.Complexity.NP]
regY:58 [binder, in Complexity.NP.TM.LM_to_mTM]
regY:86 [binder, in Complexity.NP.TM.LM_to_mTM]
regZ:103 [binder, in Complexity.Complexity.NP]
reg__sig:3 [binder, in Complexity.NP.SAT.CookLevin]
reg_A:2 [binder, in Complexity.L.Datatypes.LDepPair]
reg_is_extT [instance, in Undecidability.L.Tactics.ComputableTime]
reg_sig:2 [binder, in Undecidability.L.TM.TapeFuns]
reg_sig:11 [binder, in Undecidability.L.TM.TMEncoding]
reg_sig:8 [binder, in Undecidability.L.TM.TMEncoding]
reg_tapes.sig [variable, in Undecidability.L.TM.TMEncoding]
reg_tapes [section, in Undecidability.L.TM.TMEncoding]
reg__Y:66 [binder, in Undecidability.L.Functions.FinTypeLookup]
reg__X:65 [binder, in Undecidability.L.Functions.FinTypeLookup]
reg_is_ext [instance, in Undecidability.L.Tactics.Computable]
Reg__X:3 [binder, in Complexity.Complexity.NP]
Rel [definition, in Undecidability.TM.Util.Relations]
Relabel [definition, in Undecidability.TM.Combinators.Combinators]
Relabel [section, in Undecidability.TM.Combinators.Combinators]
Relabel_Terminates [lemma, in Undecidability.TM.Combinators.Combinators]
Relabel_RealiseIn [lemma, in Undecidability.TM.Combinators.Combinators]
Relabel_Realise [lemma, in Undecidability.TM.Combinators.Combinators]
Relabel_SpecT_con [lemma, in Undecidability.TM.Hoare.HoareCombinators]
Relabel_SpecT [lemma, in Undecidability.TM.Hoare.HoareCombinators]
Relabel_Spec_con [lemma, in Undecidability.TM.Hoare.HoareCombinators]
Relabel_Spec [lemma, in Undecidability.TM.Hoare.HoareCombinators]
Relabel.F [variable, in Undecidability.TM.Combinators.Combinators]
Relabel.F' [variable, in Undecidability.TM.Combinators.Combinators]
Relabel.n [variable, in Undecidability.TM.Combinators.Combinators]
Relabel.p [variable, in Undecidability.TM.Combinators.Combinators]
Relabel.pM [variable, in Undecidability.TM.Combinators.Combinators]
Relabel.sig [variable, in Undecidability.TM.Combinators.Combinators]
Relations [library]
relpower [inductive, in Complexity.Libs.CookPrelim.MorePrelim]
relpowerB [constructor, in Complexity.Libs.CookPrelim.MorePrelim]
relpowerRev [inductive, in Complexity.Libs.CookPrelim.MorePrelim]
relpowerRevB [constructor, in Complexity.Libs.CookPrelim.MorePrelim]
relpowerRevS [constructor, in Complexity.Libs.CookPrelim.MorePrelim]
relpowerRev_trans [lemma, in Complexity.Libs.CookPrelim.MorePrelim]
relpowerS [constructor, in Complexity.Libs.CookPrelim.MorePrelim]
relpower_valid_map_inl [lemma, in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
relpower_comb_split [lemma, in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
relpower_inl_liftOrig [lemma, in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
relpower_inr_liftPrelude [lemma, in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
relpower_inr_liftPrelude' [lemma, in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
relpower_valid_agree [lemma, in Complexity.NP.SAT.CookLevin.Reductions.TCC_to_CC]
relpower_valid_flat_agree [lemma, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
relpower_valid_length_inv [lemma, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
relpower_loop_agree [lemma, in Complexity.NP.SAT.CookLevin.Subproblems.TM_single]
relpower_valid_to_assignment [lemma, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
relpower_valid_flat_agree [lemma, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
relpower_valid_list_ofFlatType_invariant [lemma, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
relpower_valid_length_inv [lemma, in Complexity.NP.SAT.CookLevin.Subproblems.CC]
relpower_add_split [lemma, in Complexity.Libs.CookPrelim.MorePrelim]
relpower_relpowerRev [lemma, in Complexity.Libs.CookPrelim.MorePrelim]
relpower_congruent [lemma, in Complexity.Libs.CookPrelim.MorePrelim]
relpower_monotonous [lemma, in Complexity.Libs.CookPrelim.MorePrelim]
relpower_trans [lemma, in Complexity.Libs.CookPrelim.MorePrelim]
rel_evalForTime__step [lemma, in Complexity.L.AbstractMachines.Computable.EvalForTime]
rel_prime_mult [lemma, in Undecidability.Shared.Libs.DLW.Utils.prime]
rel_iter_seq_equiv [lemma, in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
rel_iter_iter_seq [lemma, in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
∑ [notation, in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
rel_iter_seq_iter [lemma, in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
rel_iter_seq [definition, in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
rel_iter_seq.R [variable, in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
rel_iter_seq [section, in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
rel_iter_bound_equiv [lemma, in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
rel_iter_iter_bound [lemma, in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
∑ [notation, in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
rel_iter_bound_iter [lemma, in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
rel_iter_bound [definition, in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
rel_iter_bound.Hk' [variable, in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
rel_iter_bound.Hk1 [variable, in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
rel_iter_bound.k [variable, in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
rel_iter_bound.R [variable, in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
rel_iter_bound [section, in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
rel_iter_sequence [lemma, in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
rel_iter_S [lemma, in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
rel_iter_1 [lemma, in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
rel_iter_plus [lemma, in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
rel_iter [definition, in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
rel_iter.R [variable, in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
rel_iter.X [variable, in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
rel_iter [section, in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
rel_iter [library]
rem [definition, in Complexity.Libs.Pigeonhole]
rem [definition, in Undecidability.Shared.Libs.PSL.Lists.Removal]
rem [section, in Undecidability.Shared.Libs.DLW.Utils.gcd]
rem [definition, in Undecidability.Shared.Libs.DLW.Utils.gcd]
Removal [section, in Undecidability.Shared.Libs.PSL.Lists.Removal]
Removal [library]
Removal.X [variable, in Undecidability.Shared.Libs.PSL.Lists.Removal]
remove [section, in Complexity.Libs.CookPrelim.MorePrelim]
removelast_length [lemma, in Undecidability.TM.Single.StepTM]
removelast_cons [lemma, in Undecidability.TM.Single.StepTM]
removelast_as_tail [lemma, in Complexity.TM.Compound.MoveToSymbol_niceSpec]
removelast_length [lemma, in Undecidability.TM.Code.List.App]
removelast_cons [lemma, in Undecidability.TM.Code.List.App]
removelast_app_singleton [lemma, in Undecidability.TM.Code.List.App]
removeLSB [definition, in Undecidability.TM.Code.BinNumbers.PosDefinitions]
remove_length_el [lemma, in Complexity.Libs.CookPrelim.MorePrelim]
remove_length [lemma, in Complexity.Libs.CookPrelim.MorePrelim]
remove.X [variable, in Complexity.Libs.CookPrelim.MorePrelim]
rem_cons_eq' [lemma, in Complexity.Libs.Pigeonhole]
rem_cons_eq [lemma, in Complexity.Libs.Pigeonhole]
rem_nel_eq [lemma, in Complexity.Libs.Pigeonhole]
rem_el [lemma, in Complexity.Libs.Pigeonhole]
rem_inclr [lemma, in Undecidability.Shared.Libs.PSL.Lists.Removal]
rem_reorder [lemma, in Undecidability.Shared.Libs.PSL.Lists.Removal]
rem_id [lemma, in Undecidability.Shared.Libs.PSL.Lists.Removal]
rem_fst' [lemma, in Undecidability.Shared.Libs.PSL.Lists.Removal]
rem_fst [lemma, in Undecidability.Shared.Libs.PSL.Lists.Removal]
rem_comm [lemma, in Undecidability.Shared.Libs.PSL.Lists.Removal]
rem_equi [lemma, in Undecidability.Shared.Libs.PSL.Lists.Removal]
rem_app' [lemma, in Undecidability.Shared.Libs.PSL.Lists.Removal]
rem_app [lemma, in Undecidability.Shared.Libs.PSL.Lists.Removal]
rem_neq [lemma, in Undecidability.Shared.Libs.PSL.Lists.Removal]
rem_in [lemma, in Undecidability.Shared.Libs.PSL.Lists.Removal]
rem_cons' [lemma, in Undecidability.Shared.Libs.PSL.Lists.Removal]
rem_cons [lemma, in Undecidability.Shared.Libs.PSL.Lists.Removal]
rem_mono [lemma, in Undecidability.Shared.Libs.PSL.Lists.Removal]
rem_incl [lemma, in Undecidability.Shared.Libs.PSL.Lists.Removal]
rem_not_in [lemma, in Undecidability.Shared.Libs.PSL.Lists.Removal]
rem_2_bool2nat [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
rem_app_eq [lemma, in Complexity.Libs.CookPrelim.PolyBounds]
rem_app_eq [lemma, in Complexity.Complexity.UpToCPoly]
rem_2_lt [lemma, in Undecidability.Shared.Libs.DLW.Utils.gcd]
rem_2_fix_2 [lemma, in Undecidability.Shared.Libs.DLW.Utils.gcd]
rem_2_fix_1 [lemma, in Undecidability.Shared.Libs.DLW.Utils.gcd]
rem_2_fix_0 [lemma, in Undecidability.Shared.Libs.DLW.Utils.gcd]
rem_2_mult [lemma, in Undecidability.Shared.Libs.DLW.Utils.gcd]
rem_2_is_0_or_1 [lemma, in Undecidability.Shared.Libs.DLW.Utils.gcd]
rem_2 [section, in Undecidability.Shared.Libs.DLW.Utils.gcd]
rem_plus_div [lemma, in Undecidability.Shared.Libs.DLW.Utils.gcd]
rem_scal [lemma, in Undecidability.Shared.Libs.DLW.Utils.gcd]
rem_plus [lemma, in Undecidability.Shared.Libs.DLW.Utils.gcd]
rem_lt [lemma, in Undecidability.Shared.Libs.DLW.Utils.gcd]
rem_diag [lemma, in Undecidability.Shared.Libs.DLW.Utils.gcd]
rem_mult_rem [lemma, in Undecidability.Shared.Libs.DLW.Utils.gcd]
rem_plus_rem [lemma, in Undecidability.Shared.Libs.DLW.Utils.gcd]
rem_of_0 [lemma, in Undecidability.Shared.Libs.DLW.Utils.gcd]
rem_erase [lemma, in Undecidability.Shared.Libs.DLW.Utils.gcd]
rem_rem [lemma, in Undecidability.Shared.Libs.DLW.Utils.gcd]
rem_idem [lemma, in Undecidability.Shared.Libs.DLW.Utils.gcd]
rem_prop [lemma, in Undecidability.Shared.Libs.DLW.Utils.gcd]
rem_0 [lemma, in Undecidability.Shared.Libs.DLW.Utils.gcd]
rem.Hp [variable, in Undecidability.Shared.Libs.DLW.Utils.gcd]
rem.p [variable, in Undecidability.Shared.Libs.DLW.Utils.gcd]
ren:47 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler]
ren:49 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler]
ren:51 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler]
rep [inductive, in Complexity.Libs.Pigeonhole]
rep [section, in Complexity.Libs.Pigeonhole]
rep [definition, in Undecidability.Shared.Libs.PSL.Lists.Power]
repB [constructor, in Complexity.Libs.Pigeonhole]
repeat_eq_iff [lemma, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
repeat_app_eq [lemma, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
repeat_S_cons [lemma, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
repeat_add_app [lemma, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
repeat_choice_two [lemma, in Undecidability.Shared.Libs.DLW.Utils.php]
repEl [definition, in Complexity.Libs.CookPrelim.MorePrelim]
repEl_isFlatListOf [lemma, in Complexity.Libs.CookPrelim.FlatFinTypes]
repEl_poly [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
repEl_time_bound [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
repEl_time_mono [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
repEl_time [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
repEl_app_inv [lemma, in Complexity.Libs.CookPrelim.MorePrelim]
repEl_add [lemma, in Complexity.Libs.CookPrelim.MorePrelim]
repEl_length [lemma, in Complexity.Libs.CookPrelim.MorePrelim]
repEl_fixX.X [variable, in Complexity.Libs.CookPrelim.MorePrelim]
repEl_fixX [section, in Complexity.Libs.CookPrelim.MorePrelim]
replace [definition, in Undecidability.Shared.Libs.PSL.Lists.Position]
replace_nth2 [lemma, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
replace_nth [lemma, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
replace_pos [lemma, in Undecidability.Shared.Libs.PSL.Lists.Position]
replace_diff [lemma, in Undecidability.Shared.Libs.PSL.Lists.Position]
replace_same [lemma, in Undecidability.Shared.Libs.PSL.Lists.Position]
replace_nochange [lemma, in Undecidability.Shared.Libs.PSL.Vectors.VectorDupfree]
reprC [inductive, in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
reprC [inductive, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
reprCC [constructor, in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
reprCC [constructor, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
reprConfig [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
reprConfig' [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
reprC_extend_Proper [instance, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
reprC_extend [lemma, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
reprC_elim_deep [lemma, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
reprC_elim [lemma, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
reprC_extend_Proper [instance, in Complexity.L.AbstractMachines.AbstractHeapMachine]
reprC_extend [lemma, in Complexity.L.AbstractMachines.AbstractHeapMachine]
reprC_functional [lemma, in Complexity.L.AbstractMachines.AbstractHeapMachine]
reprP [inductive, in Undecidability.L.AbstractMachines.FlatPro.ProgramsDef]
reprPC [constructor, in Undecidability.L.AbstractMachines.FlatPro.ProgramsDef]
reprP_elim [lemma, in Undecidability.L.AbstractMachines.FlatPro.ProgramsDef]
reprTape [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
reprTape_no_isStateSym [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
reprTape' [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
repS [constructor, in Complexity.Libs.Pigeonhole]
rep_card_length [lemma, in Complexity.Libs.Pigeonhole]
rep_sigma [lemma, in Complexity.Libs.Pigeonhole]
rep_plus_nrep [lemma, in Complexity.Libs.Pigeonhole]
rep_dupfree_False [lemma, in Complexity.Libs.Pigeonhole]
rep_cons [lemma, in Complexity.Libs.Pigeonhole]
rep_nil [lemma, in Complexity.Libs.Pigeonhole]
rep_dupfree [lemma, in Undecidability.Shared.Libs.PSL.Lists.Power]
rep_idempotent [lemma, in Undecidability.Shared.Libs.PSL.Lists.Power]
rep_injective [lemma, in Undecidability.Shared.Libs.PSL.Lists.Power]
rep_eq [lemma, in Undecidability.Shared.Libs.PSL.Lists.Power]
rep_eq' [lemma, in Undecidability.Shared.Libs.PSL.Lists.Power]
rep_mono [lemma, in Undecidability.Shared.Libs.PSL.Lists.Power]
rep_equi [lemma, in Undecidability.Shared.Libs.PSL.Lists.Power]
rep_in [lemma, in Undecidability.Shared.Libs.PSL.Lists.Power]
rep_incl [lemma, in Undecidability.Shared.Libs.PSL.Lists.Power]
rep_power [lemma, in Undecidability.Shared.Libs.PSL.Lists.Power]
rep_cons_eq [lemma, in Undecidability.Shared.Libs.PSL.Lists.Power]
rep_cons' [lemma, in Undecidability.Shared.Libs.PSL.Lists.Power]
rep_cons [lemma, in Undecidability.Shared.Libs.PSL.Lists.Power]
rep.X [variable, in Complexity.Libs.Pigeonhole]
_ <<= _ [notation, in Complexity.Libs.Pigeonhole]
Reset [definition, in Undecidability.TM.Code.Copy]
ResetEmpty [definition, in Undecidability.TM.Code.Copy]
ResetEmpty_Spec [lemma, in Undecidability.TM.Code.Copy]
ResetEmpty_Spec_size [lemma, in Undecidability.TM.Code.Copy]
ResetEmpty_SpecT [lemma, in Undecidability.TM.Code.Copy]
ResetEmpty_SpecT_space [lemma, in Undecidability.TM.Code.Copy]
ResetEmpty_Sem [lemma, in Undecidability.TM.Code.Copy]
ResetEmpty_steps [definition, in Undecidability.TM.Code.Copy]
ResetEmpty_Rel [definition, in Undecidability.TM.Code.Copy]
ResetEmpty_size [definition, in Undecidability.TM.Code.Copy]
ResetEmpty1 [definition, in Undecidability.TM.Code.Copy]
ResetEmpty1_Spec [lemma, in Undecidability.TM.Code.Copy]
ResetEmpty1_Spec_size [lemma, in Undecidability.TM.Code.Copy]
ResetEmpty1_SpecT [lemma, in Undecidability.TM.Code.Copy]
ResetEmpty1_SpecT_space [lemma, in Undecidability.TM.Code.Copy]
ResetEmpty1_Sem [lemma, in Undecidability.TM.Code.Copy]
ResetEmpty1_steps [definition, in Undecidability.TM.Code.Copy]
ResetEmpty1_Rel [definition, in Undecidability.TM.Code.Copy]
ResetEmpty1_size [definition, in Undecidability.TM.Code.Copy]
Reset_steps_nice [lemma, in Complexity.TM.PrettyBounds.BaseCode]
Reset_size_nice [lemma, in Complexity.TM.PrettyBounds.BaseCodeSpace]
Reset_Spec [lemma, in Undecidability.TM.Code.Copy]
Reset_Spec_size [lemma, in Undecidability.TM.Code.Copy]
Reset_SpecT [lemma, in Undecidability.TM.Code.Copy]
Reset_SpecT_space [lemma, in Undecidability.TM.Code.Copy]
Reset_Terminates [definition, in Undecidability.TM.Code.Copy]
Reset_steps [definition, in Undecidability.TM.Code.Copy]
Reset_Realise [lemma, in Undecidability.TM.Code.Copy]
Reset_Rel [definition, in Undecidability.TM.Code.Copy]
Reset_size [definition, in Undecidability.TM.Code.Copy]
Reset_Spec [lemma, in Undecidability.TM.Hoare.HoareExamples]
Reset_SpecT [lemma, in Undecidability.TM.Hoare.HoareExamples]
Reset_SpecT_space [lemma, in Undecidability.TM.Hoare.HoareExamples]
ResourceMeasures [library]
resSizePoly [record, in Complexity.Complexity.Definitions]
resSizePoly_compSize [lemma, in Complexity.Complexity.Definitions]
resSizePoly_prod [lemma, in Complexity.Complexity.PolyTimeComputable]
resSizePoly_composition2 [lemma, in Complexity.Complexity.PolyTimeComputable]
resSizePoly_composition [lemma, in Complexity.Complexity.PolyTimeComputable]
resSize__polyTC [projection, in Complexity.Complexity.Definitions]
resSize__rSP [projection, in Complexity.Complexity.Definitions]
restrict [definition, in Undecidability.TM.Util.Relations]
restrict [definition, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
restrictBy [definition, in Complexity.Complexity.Subtypes]
restrict_formula_equisat [lemma, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
resType [definition, in Undecidability.L.Tactics.Computable]
res':10 [binder, in Complexity.NP.TM.TMGenNP_fixed_mTM]
res2:30 [binder, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
res:1 [binder, in Complexity.L.AbstractMachines.Computable.Unfolding]
res:1 [binder, in Undecidability.L.Functions.Size]
res:10 [binder, in Undecidability.L.AbstractMachines.FlatPro.Programs]
res:10 [binder, in Undecidability.L.Functions.Size]
res:101 [binder, in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
res:105 [binder, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
res:105 [binder, in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
res:109 [binder, in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
res:11 [binder, in Complexity.L.AbstractMachines.FlatPro.Computable.Compile]
res:112 [binder, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
res:118 [binder, in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
res:12 [binder, in Complexity.L.AbstractMachines.Computable.LargestVar]
res:12 [binder, in Complexity.NP.TM.TMGenNP_fixed_mTM]
res:120 [binder, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
res:123 [binder, in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
res:127 [binder, in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
res:128 [binder, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
res:13 [binder, in Complexity.L.AbstractMachines.Computable.Unfolding]
res:135 [binder, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
res:14 [binder, in Undecidability.TM.L.Transcode.Boollist_to_Enc]
res:14 [binder, in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
res:14 [binder, in Undecidability.L.AbstractMachines.FlatPro.UnfoldClos]
res:142 [binder, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
res:17 [binder, in Complexity.HierarchyTheorem.TimeHierarchyTheorem]
res:17 [binder, in Undecidability.L.Functions.FinTypeLookup]
res:170 [binder, in Undecidability.L.Tactics.Extract]
res:18 [binder, in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
res:181 [binder, in Undecidability.L.Tactics.Extract]
res:183 [binder, in Undecidability.L.Tactics.Extract]
res:19 [binder, in Undecidability.L.Datatypes.List.List_eqb]
res:19 [binder, in Undecidability.L.Functions.Size]
res:195 [binder, in Undecidability.L.Tactics.Extract]
res:2 [binder, in Undecidability.L.AbstractMachines.FlatPro.UnfoldClos]
res:2 [binder, in Complexity.L.AbstractMachines.FlatPro.Computable.Compile]
res:20 [binder, in Complexity.L.AbstractMachines.Computable.Unfolding]
res:21 [binder, in Undecidability.TM.L.Transcode.Boollist_to_Enc]
res:21 [binder, in Complexity.L.AbstractMachines.UnfoldTailRec]
res:21 [binder, in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
res:21 [binder, in Complexity.L.AbstractMachines.Computable.LargestVar]
res:22 [binder, in Undecidability.TM.L.Transcode.Enc_to_Boollist]
res:23 [binder, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
res:23 [binder, in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
res:24 [binder, in Undecidability.L.Functions.Size]
res:26 [binder, in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
res:26 [binder, in Undecidability.TM.L.Transcode.Enc_to_Boollist]
res:26 [binder, in Complexity.L.AbstractMachines.Computable.LargestVar]
res:29 [binder, in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
res:29 [binder, in Undecidability.TM.L.Transcode.Enc_to_Boollist]
res:29 [binder, in Undecidability.L.Functions.Size]
res:3 [binder, in Complexity.L.AbstractMachines.Computable.LargestVar]
res:30 [binder, in Undecidability.L.Datatypes.List.List_basics]
res:30 [binder, in Undecidability.TM.Code.CompareValue]
res:30 [binder, in Complexity.NP.TM.TMGenNP_fixed_mTM]
res:31 [binder, in Complexity.L.AbstractMachines.Computable.LargestVar]
res:32 [binder, in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisUnfoldClos]
res:32 [binder, in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
res:33 [binder, in Undecidability.TM.L.Transcode.Boollist_to_Enc]
res:33 [binder, in Undecidability.TM.L.Transcode.Enc_to_Boollist]
res:34 [binder, in Undecidability.L.Functions.Size]
res:35 [binder, in Complexity.L.AbstractMachines.UnfoldTailRec]
res:36 [binder, in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
res:36 [binder, in Complexity.L.AbstractMachines.Computable.LargestVar]
res:37 [binder, in Undecidability.TM.L.Transcode.Enc_to_Boollist]
res:39 [binder, in Undecidability.L.Functions.Size]
res:40 [binder, in Undecidability.TM.L.Transcode.Enc_to_Boollist]
res:41 [binder, in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
res:41 [binder, in Complexity.L.AbstractMachines.Computable.LargestVar]
res:42 [binder, in Undecidability.L.Datatypes.List.List_basics]
res:43 [binder, in Complexity.L.AbstractMachines.Computable.EvalForTime]
res:43 [binder, in Undecidability.TM.L.Transcode.Enc_to_Boollist]
res:44 [binder, in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
res:44 [binder, in Undecidability.L.Functions.Size]
res:45 [binder, in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
res:46 [binder, in Complexity.L.AbstractMachines.UnfoldTailRec]
res:46 [binder, in Undecidability.TM.L.Transcode.Enc_to_Boollist]
res:46 [binder, in Complexity.L.AbstractMachines.Computable.LargestVar]
res:47 [binder, in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
res:48 [binder, in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisUnfoldClos]
res:5 [binder, in Complexity.L.AbstractMachines.UnfoldTailRec]
res:50 [binder, in Undecidability.L.Tactics.ComputableDemo]
res:50 [binder, in Undecidability.TM.L.Transcode.Enc_to_Boollist]
res:51 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
res:52 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
res:54 [binder, in Undecidability.TM.L.Transcode.Enc_to_Boollist]
res:57 [binder, in Undecidability.TM.L.Transcode.Enc_to_Boollist]
res:70 [binder, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
res:72 [binder, in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
res:75 [binder, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
res:79 [binder, in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
res:79 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
res:8 [binder, in Undecidability.TM.L.Transcode.Enc_to_Boollist]
res:80 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
res:83 [binder, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
res:83 [binder, in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
res:9 [binder, in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
res:91 [binder, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
res:92 [binder, in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
res:96 [binder, in Complexity.TM.Single.DecodeTape]
res:96 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler]
res:97 [binder, in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
res:98 [binder, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
retAT [constructor, in Undecidability.TM.L.Alphabets]
retrAB:61 [binder, in Undecidability.Shared.Libs.PSL.Retracts]
retrAB:67 [binder, in Undecidability.Shared.Libs.PSL.Retracts]
Retract [record, in Undecidability.Shared.Libs.PSL.Retracts]
retract [definition, in Undecidability.Shared.Libs.PSL.Retracts]
Retract [section, in Undecidability.Shared.Libs.PSL.Retracts]
Retracts [library]
Retract_sum7 [instance, in Undecidability.Shared.Libs.PSL.Retracts]
Retract_sum6 [instance, in Undecidability.Shared.Libs.PSL.Retracts]
Retract_sum5 [instance, in Undecidability.Shared.Libs.PSL.Retracts]
Retract_sum4 [instance, in Undecidability.Shared.Libs.PSL.Retracts]
Retract_sum3 [instance, in Undecidability.Shared.Libs.PSL.Retracts]
Retract_join [instance, in Undecidability.Shared.Libs.PSL.Retracts]
retract_join [lemma, in Undecidability.Shared.Libs.PSL.Retracts]
retract_join_g [definition, in Undecidability.Shared.Libs.PSL.Retracts]
retract_join_f [definition, in Undecidability.Shared.Libs.PSL.Retracts]
Retract_sum [instance, in Undecidability.Shared.Libs.PSL.Retracts]
retract_sum_g [definition, in Undecidability.Shared.Libs.PSL.Retracts]
retract_sum_f [definition, in Undecidability.Shared.Libs.PSL.Retracts]
Retract_inr [instance, in Undecidability.Shared.Libs.PSL.Retracts]
retract_inr_g [definition, in Undecidability.Shared.Libs.PSL.Retracts]
retract_inr_f [definition, in Undecidability.Shared.Libs.PSL.Retracts]
Retract_inl [instance, in Undecidability.Shared.Libs.PSL.Retracts]
retract_inl_g [definition, in Undecidability.Shared.Libs.PSL.Retracts]
retract_inl_f [definition, in Undecidability.Shared.Libs.PSL.Retracts]
Retract_option [instance, in Undecidability.Shared.Libs.PSL.Retracts]
Retract_Empty_right [instance, in Undecidability.Shared.Libs.PSL.Retracts]
Retract_Empty_left [instance, in Undecidability.Shared.Libs.PSL.Retracts]
Retract_Empty [instance, in Undecidability.Shared.Libs.PSL.Retracts]
Retract_id [instance, in Undecidability.Shared.Libs.PSL.Retracts]
retract_g_None [lemma, in Undecidability.Shared.Libs.PSL.Retracts]
retract_g_Some [lemma, in Undecidability.Shared.Libs.PSL.Retracts]
retract_f_injective [lemma, in Undecidability.Shared.Libs.PSL.Retracts]
retract_g_surjective [lemma, in Undecidability.Shared.Libs.PSL.Retracts]
retract_g_inv [definition, in Undecidability.Shared.Libs.PSL.Retracts]
retract_g_adjoint [definition, in Undecidability.Shared.Libs.PSL.Retracts]
Retract_Properties.I [variable, in Undecidability.Shared.Libs.PSL.Retracts]
Retract_Properties.Y [variable, in Undecidability.Shared.Libs.PSL.Retracts]
Retract_Properties.X [variable, in Undecidability.Shared.Libs.PSL.Retracts]
Retract_Properties [section, in Undecidability.Shared.Libs.PSL.Retracts]
Retract_sigOption_sigSum [instance, in Undecidability.TM.Code.CaseSum]
Retract_plus [instance, in Undecidability.TM.Code.ChangeAlphabet]
Retract_sigList_X [instance, in Undecidability.TM.Code.Code]
Retract_sigOption_X [instance, in Undecidability.TM.Code.Code]
Retract_sigPair_Y [instance, in Undecidability.TM.Code.Code]
Retract_sigPair_X [instance, in Undecidability.TM.Code.Code]
Retract_sigSum_Y [instance, in Undecidability.TM.Code.Code]
Retract_sigSum_X [instance, in Undecidability.TM.Code.Code]
Retract.X [variable, in Undecidability.Shared.Libs.PSL.Retracts]
Retract.Y [variable, in Undecidability.Shared.Libs.PSL.Retracts]
retr__Pro:3 [binder, in Undecidability.TM.L.Transcode.Boollist_to_Enc]
retr__list:2 [binder, in Undecidability.TM.L.Transcode.Boollist_to_Enc]
retr_X_list' [instance, in Undecidability.TM.Code.List.Nth]
retr_comp_g [definition, in Undecidability.Shared.Libs.PSL.Retracts]
retr_comp_f [definition, in Undecidability.Shared.Libs.PSL.Retracts]
Retr_retr [projection, in Undecidability.Shared.Libs.PSL.Retracts]
Retr_g [projection, in Undecidability.Shared.Libs.PSL.Retracts]
Retr_f [projection, in Undecidability.Shared.Libs.PSL.Retracts]
retr_X_list' [instance, in Undecidability.TM.Code.List.Length]
retr__bools:23 [binder, in Complexity.TM.Code.DecodeList]
retr_value_sig [definition, in Undecidability.TM.Univ.LowLevel]
retr_value_sigGraph [definition, in Undecidability.TM.Univ.LowLevel]
retr_key_sig [definition, in Undecidability.TM.Univ.LowLevel]
retr_key_sigGraph [definition, in Undecidability.TM.Univ.LowLevel]
retr_act_sig [definition, in Undecidability.TM.Univ.LowLevel]
retr_act_sigGraph [definition, in Undecidability.TM.Univ.LowLevel]
retr_sigCurrentSymbol_sig [definition, in Undecidability.TM.Univ.LowLevel]
retr_sigCurrentSymbol_sigGraph [definition, in Undecidability.TM.Univ.LowLevel]
retr_sigNextState_sig [definition, in Undecidability.TM.Univ.LowLevel]
retr_sigNextState_sigGraph [definition, in Undecidability.TM.Univ.LowLevel]
retr_sigCurrentStateFinal_sig [definition, in Undecidability.TM.Univ.LowLevel]
retr_sigCurrentStateFinal_sigGraph [definition, in Undecidability.TM.Univ.LowLevel]
retr_sigCurrentState_sig [definition, in Undecidability.TM.Univ.LowLevel]
retr_sigCurrentState_sigGraph [definition, in Undecidability.TM.Univ.LowLevel]
retr_sigCurrentStateNumber_sig [definition, in Undecidability.TM.Univ.LowLevel]
retr_sigCurrentStateNumber_sigGraph [definition, in Undecidability.TM.Univ.LowLevel]
retr_sigSimTape_sigUniv [definition, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
retr_sigSimGraph_sigUniv [definition, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
retr_nat_prog [definition, in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
retr__list:3 [binder, in Complexity.NP.TM.M_LM2TM]
retr__LAM:2 [binder, in Complexity.NP.TM.M_LM2TM]
retr_closure_step [definition, in Undecidability.TM.L.HeapInterpreter.StepTM]
retr_hent_step [definition, in Undecidability.TM.L.HeapInterpreter.StepTM]
retr_hent'_step [definition, in Undecidability.TM.L.HeapInterpreter.StepTM]
retr_clos_step_hent [definition, in Undecidability.TM.L.HeapInterpreter.StepTM]
retr_nat_step_hent [definition, in Undecidability.TM.L.HeapInterpreter.StepTM]
retr_nat_step_clos_var [definition, in Undecidability.TM.L.HeapInterpreter.StepTM]
retr_nat_clos_var [definition, in Undecidability.TM.L.HeapInterpreter.StepTM]
retr_nat_step_clos_ad [definition, in Undecidability.TM.L.HeapInterpreter.StepTM]
retr_nat_clos_ad [definition, in Undecidability.TM.L.HeapInterpreter.StepTM]
retr_tok_step [definition, in Undecidability.TM.L.HeapInterpreter.StepTM]
retr_pro_step [definition, in Undecidability.TM.L.HeapInterpreter.StepTM]
retr_pro_clos [definition, in Undecidability.TM.L.HeapInterpreter.StepTM]
retr_clos_step [definition, in Undecidability.TM.L.HeapInterpreter.StepTM]
retr_pro:3 [binder, in Undecidability.TM.L.Eval]
retr_eval:2 [binder, in Undecidability.TM.L.Eval]
retr_closures_step [definition, in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
retr_heap_step [definition, in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
retr_sig_sigY [definition, in Undecidability.TM.Univ.LookupAssociativeListTM]
retr_sig_sigX [definition, in Undecidability.TM.Univ.LookupAssociativeListTM]
retr_hent'_lookup [definition, in Undecidability.TM.L.HeapInterpreter.LookupTM]
retr_hent'_heap [definition, in Undecidability.TM.L.HeapInterpreter.LookupTM]
retr_hent_lookup [definition, in Undecidability.TM.L.HeapInterpreter.LookupTM]
retr_hent_heap [definition, in Undecidability.TM.L.HeapInterpreter.LookupTM]
retr_clos_lookup_heap [definition, in Undecidability.TM.L.HeapInterpreter.LookupTM]
retr_clos_heap [definition, in Undecidability.TM.L.HeapInterpreter.LookupTM]
retr_nat_lookup_entry [definition, in Undecidability.TM.L.HeapInterpreter.LookupTM]
retr_nat_heap_entry [definition, in Undecidability.TM.L.HeapInterpreter.LookupTM]
retr_nat_lookup_clos_var [definition, in Undecidability.TM.L.HeapInterpreter.LookupTM]
retr_nat_clos_var [definition, in Undecidability.TM.L.HeapInterpreter.LookupTM]
retr_nat_lookup_clos_ad [definition, in Undecidability.TM.L.HeapInterpreter.LookupTM]
retr_nat_clos_ad [definition, in Undecidability.TM.L.HeapInterpreter.LookupTM]
retr__Pro:3 [binder, in Undecidability.TM.L.Transcode.Enc_to_Boollist]
retr__list:2 [binder, in Undecidability.TM.L.Transcode.Enc_to_Boollist]
retr_pro [definition, in Undecidability.TM.L.CompilerBoolFuns.Compiler]
retr_clos [definition, in Undecidability.TM.L.CompilerBoolFuns.Compiler]
retr_closs [definition, in Undecidability.TM.L.CompilerBoolFuns.Compiler]
retr_intern [definition, in Undecidability.TM.L.CompilerBoolFuns.Compiler]
retr_bools [definition, in Undecidability.TM.L.CompilerBoolFuns.Compiler]
retr_bools:40 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler]
retr_pro:39 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler]
retr1:106 [binder, in Undecidability.Shared.Libs.PSL.Retracts]
retr1:120 [binder, in Undecidability.Shared.Libs.PSL.Retracts]
retr1:137 [binder, in Undecidability.Shared.Libs.PSL.Retracts]
retr1:157 [binder, in Undecidability.Shared.Libs.PSL.Retracts]
retr1:34 [binder, in Undecidability.Shared.Libs.PSL.Retracts]
retr1:76 [binder, in Undecidability.Shared.Libs.PSL.Retracts]
retr1:95 [binder, in Undecidability.Shared.Libs.PSL.Retracts]
retr2:107 [binder, in Undecidability.Shared.Libs.PSL.Retracts]
retr2:121 [binder, in Undecidability.Shared.Libs.PSL.Retracts]
retr2:138 [binder, in Undecidability.Shared.Libs.PSL.Retracts]
retr2:158 [binder, in Undecidability.Shared.Libs.PSL.Retracts]
retr2:35 [binder, in Undecidability.Shared.Libs.PSL.Retracts]
retr2:77 [binder, in Undecidability.Shared.Libs.PSL.Retracts]
retr2:96 [binder, in Undecidability.Shared.Libs.PSL.Retracts]
retr3:108 [binder, in Undecidability.Shared.Libs.PSL.Retracts]
retr3:122 [binder, in Undecidability.Shared.Libs.PSL.Retracts]
retr3:139 [binder, in Undecidability.Shared.Libs.PSL.Retracts]
retr3:159 [binder, in Undecidability.Shared.Libs.PSL.Retracts]
retr3:97 [binder, in Undecidability.Shared.Libs.PSL.Retracts]
retr4:109 [binder, in Undecidability.Shared.Libs.PSL.Retracts]
retr4:123 [binder, in Undecidability.Shared.Libs.PSL.Retracts]
retr4:140 [binder, in Undecidability.Shared.Libs.PSL.Retracts]
retr4:160 [binder, in Undecidability.Shared.Libs.PSL.Retracts]
retr5:124 [binder, in Undecidability.Shared.Libs.PSL.Retracts]
retr5:141 [binder, in Undecidability.Shared.Libs.PSL.Retracts]
retr5:161 [binder, in Undecidability.Shared.Libs.PSL.Retracts]
retr6:142 [binder, in Undecidability.Shared.Libs.PSL.Retracts]
retr6:162 [binder, in Undecidability.Shared.Libs.PSL.Retracts]
retr7:163 [binder, in Undecidability.Shared.Libs.PSL.Retracts]
retr:136 [binder, in Undecidability.TM.Code.Code]
retr:166 [binder, in Undecidability.TM.Code.Code]
retr:44 [binder, in Undecidability.Shared.Libs.PSL.Retracts]
retr:48 [binder, in Undecidability.Shared.Libs.PSL.Retracts]
retr:52 [binder, in Undecidability.Shared.Libs.PSL.Retracts]
retT [constructor, in Undecidability.L.AbstractMachines.FlatPro.ProgramsDef]
Return [definition, in Undecidability.TM.Combinators.Combinators]
Return [section, in Undecidability.TM.Combinators.Combinators]
Return_Terminates [lemma, in Undecidability.TM.Combinators.Combinators]
Return_RealiseIn [lemma, in Undecidability.TM.Combinators.Combinators]
Return_Realise [lemma, in Undecidability.TM.Combinators.Combinators]
Return_SpecT_con [lemma, in Undecidability.TM.Hoare.HoareCombinators]
Return_SpecT [lemma, in Undecidability.TM.Hoare.HoareCombinators]
Return_Spec_con [lemma, in Undecidability.TM.Hoare.HoareCombinators]
Return_Spec [lemma, in Undecidability.TM.Hoare.HoareCombinators]
Return.F [variable, in Undecidability.TM.Combinators.Combinators]
Return.F' [variable, in Undecidability.TM.Combinators.Combinators]
Return.n [variable, in Undecidability.TM.Combinators.Combinators]
Return.p [variable, in Undecidability.TM.Combinators.Combinators]
Return.pM [variable, in Undecidability.TM.Combinators.Combinators]
Return.sig [variable, in Undecidability.TM.Combinators.Combinators]
Rev [definition, in Undecidability.TM.Code.List.Rev]
Rev [section, in Undecidability.TM.Code.List.Rev]
Rev [library]
revArg:164 [binder, in Undecidability.L.Tactics.Extract]
revQ:5 [binder, in Complexity.L.AbstractMachines.FunctionalDefinitions]
rev_concat_length [lemma, in Undecidability.L.Datatypes.List.List_basics]
rev_concat_rev [lemma, in Undecidability.L.Datatypes.List.List_basics]
rev_concat [definition, in Undecidability.L.Datatypes.List.List_basics]
rev_eq_cons [lemma, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
rev_eq_nil [lemma, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
rev_repeat [lemma, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
Rev_SpecT [lemma, in Undecidability.TM.Code.List.Rev]
Rev_Terminates [lemma, in Undecidability.TM.Code.List.Rev]
Rev_T [definition, in Undecidability.TM.Code.List.Rev]
Rev_steps [definition, in Undecidability.TM.Code.List.Rev]
Rev_Realise [lemma, in Undecidability.TM.Code.List.Rev]
Rev_Rel [definition, in Undecidability.TM.Code.List.Rev]
Rev_size [definition, in Undecidability.TM.Code.List.Rev]
Rev_Append_SpecT [lemma, in Undecidability.TM.Code.List.Rev]
Rev_Append_Terminates [lemma, in Undecidability.TM.Code.List.Rev]
Rev_Append_T [definition, in Undecidability.TM.Code.List.Rev]
Rev_Append_steps [definition, in Undecidability.TM.Code.List.Rev]
Rev_Append_Realise [lemma, in Undecidability.TM.Code.List.Rev]
Rev_Append_Rel [definition, in Undecidability.TM.Code.List.Rev]
Rev_Append_size [definition, in Undecidability.TM.Code.List.Rev]
Rev_Append [definition, in Undecidability.TM.Code.List.Rev]
Rev_Step_Terminates [lemma, in Undecidability.TM.Code.List.Rev]
Rev_Step_T [definition, in Undecidability.TM.Code.List.Rev]
Rev_Step_steps [definition, in Undecidability.TM.Code.List.Rev]
Rev_Step_Realise [lemma, in Undecidability.TM.Code.List.Rev]
Rev_Step_Rel [definition, in Undecidability.TM.Code.List.Rev]
Rev_Step_size [definition, in Undecidability.TM.Code.List.Rev]
Rev_Step [definition, in Undecidability.TM.Code.List.Rev]
rev_string [definition, in Undecidability.L.Prelim.StringBase]
rev_repEl [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
rev_E [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
rev_polarityRev [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
rev_fold [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
rev_involution [lemma, in Complexity.Libs.CookPrelim.MorePrelim]
Rev.cX [variable, in Undecidability.TM.Code.List.Rev]
Rev.sig [variable, in Undecidability.TM.Code.List.Rev]
Rev.sigX [variable, in Undecidability.TM.Code.List.Rev]
Rev.X [variable, in Undecidability.TM.Code.List.Rev]
rfix [definition, in Undecidability.TM.Util.Relations]
rho [definition, in Undecidability.L.Util.L_facts]
rho_lambda [lemma, in Undecidability.L.Util.L_facts]
rho_cls [lemma, in Undecidability.L.Util.L_facts]
rho_dcls [lemma, in Undecidability.L.Util.L_facts]
rho_inj [lemma, in Undecidability.L.Tactics.Lsimpl]
rho_correctPow [lemma, in Undecidability.L.Tactics.Lsimpl]
rho_correct [lemma, in Undecidability.L.Tactics.Lsimpl]
rhs:177 [binder, in Undecidability.L.Tactics.Extract]
Rice [lemma, in Undecidability.L.Computability.Rice]
Rice [library]
Rice_classical [lemma, in Undecidability.L.Computability.Rice]
Rice1 [lemma, in Undecidability.L.Computability.Rice]
Rice2 [lemma, in Undecidability.L.Computability.Rice]
right [definition, in Undecidability.TM.SBTM]
right [definition, in Undecidability.TM.Util.TM_facts]
RightBlank [constructor, in Undecidability.TM.Single.EncodeTapes]
rightof [constructor, in Undecidability.TM.TM]
right_sizeOfTape [lemma, in Undecidability.TM.PrettyBounds.SizeBounds]
right_inv_surjective [lemma, in Undecidability.Shared.Libs.PSL.Bijection]
right_inverse [definition, in Undecidability.Shared.Libs.PSL.Bijection]
rimplication [definition, in Undecidability.TM.Util.Relations]
rincl_fin_chain_bounded [lemma, in Undecidability.Shared.Libs.DLW.Wf.wf_incl]
rincl_fin_chains [lemma, in Undecidability.Shared.Libs.DLW.Wf.wf_incl]
rincl_fin [definition, in Undecidability.Shared.Libs.DLW.Wf.wf_incl]
rincl_fin.M [variable, in Undecidability.Shared.Libs.DLW.Wf.wf_incl]
rincl_fin.X [variable, in Undecidability.Shared.Libs.DLW.Wf.wf_incl]
rincl_fin [section, in Undecidability.Shared.Libs.DLW.Wf.wf_incl]
rIntersection [definition, in Undecidability.TM.Util.Relations]
rintersection [definition, in Undecidability.TM.Util.Relations]
rLam [constructor, in Undecidability.L.Tactics.Reflection]
rlength [definition, in Undecidability.TM.Compound.MoveToSymbol]
rlength [definition, in Undecidability.TM.Compound.CopySymbols]
rlength' [definition, in Undecidability.TM.Compound.CopySymbols]
Rl:146 [binder, in Undecidability.Shared.Libs.DLW.Utils.php]
Rmove [constructor, in Undecidability.TM.TM]
Rmove [constructor, in Undecidability.TM.SBTM]
rPow [definition, in Undecidability.L.Tactics.Reflection]
rpr:16 [binder, in Undecidability.Shared.Libs.DLW.Utils.quotient]
rReduceIntro [lemma, in Undecidability.L.Tactics.Reflection]
rRho [constructor, in Undecidability.L.Tactics.Reflection]
rr:246 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
rStandardize [lemma, in Undecidability.L.Tactics.Reflection]
rStandardizeUse [lemma, in Undecidability.L.Tactics.Reflection]
rStandardizeUsePow [lemma, in Undecidability.L.Tactics.Reflection]
rSubstList [definition, in Undecidability.L.Tactics.Reflection]
rSubstList_correct [lemma, in Undecidability.L.Tactics.Reflection]
rs':132 [binder, in Undecidability.TM.Compound.MoveToSymbol]
rs':140 [binder, in Undecidability.TM.Compound.MoveToSymbol]
rs':171 [binder, in Undecidability.TM.Compound.MoveToSymbol]
rs':176 [binder, in Undecidability.TM.Compound.MoveToSymbol]
rs':18 [binder, in Undecidability.TM.Code.Copy]
rs':184 [binder, in Undecidability.TM.Util.TM_facts]
rs':191 [binder, in Undecidability.TM.Util.TM_facts]
rs':25 [binder, in Undecidability.TM.Code.Copy]
rs':56 [binder, in Undecidability.TM.Code.Copy]
rs':61 [binder, in Undecidability.TM.Code.Copy]
rs':66 [binder, in Undecidability.TM.Compound.Shift]
rs1:111 [binder, in Undecidability.TM.Compound.Compare]
rs1:119 [binder, in Undecidability.TM.Compound.Compare]
rs1:145 [binder, in Undecidability.TM.Compound.Compare]
rs1:158 [binder, in Undecidability.TM.Compound.Compare]
rs1:169 [binder, in Undecidability.TM.Compound.Compare]
rs1:178 [binder, in Undecidability.TM.Compound.Compare]
rs1:188 [binder, in Undecidability.TM.Compound.Compare]
rs1:198 [binder, in Undecidability.TM.Compound.Compare]
rs1:212 [binder, in Undecidability.TM.Compound.Compare]
rs2:112 [binder, in Undecidability.TM.Compound.Compare]
rs2:122 [binder, in Undecidability.TM.Compound.Compare]
rs2:146 [binder, in Undecidability.TM.Compound.Compare]
rs2:161 [binder, in Undecidability.TM.Compound.Compare]
rs2:172 [binder, in Undecidability.TM.Compound.Compare]
rs2:179 [binder, in Undecidability.TM.Compound.Compare]
rs2:189 [binder, in Undecidability.TM.Compound.Compare]
rs2:199 [binder, in Undecidability.TM.Compound.Compare]
rs2:213 [binder, in Undecidability.TM.Compound.Compare]
rs:1 [binder, in Undecidability.TM.SBTM]
rs:100 [binder, in Undecidability.TM.Util.TM_facts]
rs:118 [binder, in Undecidability.TM.Compound.Shift]
rs:123 [binder, in Undecidability.TM.Compound.Shift]
rs:13 [binder, in Undecidability.TM.Code.CaseList]
rs:13 [binder, in Undecidability.TM.Util.TM_facts]
rs:131 [binder, in Undecidability.TM.Compound.MoveToSymbol]
rs:135 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
rs:138 [binder, in Undecidability.TM.Compound.MoveToSymbol]
rs:140 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
rs:144 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
rs:148 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
rs:15 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
rs:153 [binder, in Undecidability.TM.Compound.MoveToSymbol]
rs:155 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
rs:16 [binder, in Undecidability.TM.Code.BinNumbers.PosPointers]
rs:16 [binder, in Undecidability.TM.Code.Copy]
rs:161 [binder, in Undecidability.TM.Compound.MoveToSymbol]
rs:161 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
rs:170 [binder, in Undecidability.TM.Compound.MoveToSymbol]
rs:174 [binder, in Undecidability.TM.Single.StepTM]
rs:174 [binder, in Undecidability.TM.Compound.MoveToSymbol]
rs:181 [binder, in Undecidability.TM.Single.StepTM]
rs:182 [binder, in Undecidability.TM.Util.TM_facts]
rs:188 [binder, in Undecidability.TM.Util.TM_facts]
rs:19 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
rs:191 [binder, in Undecidability.TM.Compound.MoveToSymbol]
rs:196 [binder, in Undecidability.TM.Compound.MoveToSymbol]
rs:20 [binder, in Undecidability.TM.Code.BinNumbers.PosPointers]
rs:21 [binder, in Undecidability.TM.Util.TM_facts]
rs:215 [binder, in Undecidability.TM.Util.TM_facts]
rs:219 [binder, in Undecidability.TM.Util.TM_facts]
rs:22 [binder, in Undecidability.TM.Code.CaseList]
rs:222 [binder, in Undecidability.TM.Util.TM_facts]
rs:223 [binder, in Undecidability.TM.Util.TM_facts]
rs:226 [binder, in Undecidability.TM.Util.TM_facts]
rs:23 [binder, in Undecidability.TM.Code.Copy]
rs:231 [binder, in Undecidability.TM.Util.TM_facts]
rs:233 [binder, in Undecidability.TM.Util.TM_facts]
rs:236 [binder, in Undecidability.TM.Util.TM_facts]
rs:24 [binder, in Undecidability.TM.Util.TM_facts]
rs:2645 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
rs:280 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
rs:29 [binder, in Undecidability.TM.Code.BinNumbers.PosPointers]
rs:294 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
rs:30 [binder, in Undecidability.TM.Util.TM_facts]
rs:310 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
rs:36 [binder, in Undecidability.TM.Code.Copy]
rs:365 [binder, in Undecidability.TM.Single.StepTM]
rs:39 [binder, in Undecidability.TM.Code.BinNumbers.PosPointers]
rs:4 [binder, in Undecidability.TM.Code.BinNumbers.PosPointers]
rs:4 [binder, in Undecidability.TM.Code.CodeTM]
rs:44 [binder, in Undecidability.TM.Code.Copy]
rs:48 [binder, in Undecidability.TM.Code.CaseList]
rs:5 [binder, in Undecidability.TM.SBTM]
rs:54 [binder, in Undecidability.TM.Code.CaseList]
rs:54 [binder, in Undecidability.TM.Code.Copy]
rs:57 [binder, in Undecidability.TM.Compound.Shift]
rs:59 [binder, in Undecidability.TM.Code.Copy]
rs:61 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
rs:63 [binder, in Undecidability.TM.Compound.Shift]
rs:68 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
rs:68 [binder, in Undecidability.TM.Compound.Shift]
rs:70 [binder, in Undecidability.TM.Code.Copy]
rs:71 [binder, in Undecidability.TM.Compound.Shift]
rs:75 [binder, in Undecidability.TM.Code.Copy]
rs:89 [binder, in Undecidability.TM.Util.TM_facts]
rs:9 [binder, in Undecidability.TM.Code.CodeTM]
rs:9 [binder, in Undecidability.TM.SBTM]
rTerm [inductive, in Undecidability.L.Tactics.Reflection]
Rtuple [definition, in Undecidability.L.Complexity.GenericNary]
ruleList:3254 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
ruleList:3261 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
rules:3175 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
rules:3193 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
rules:3218 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
rules:381 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
rules:384 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
rules:396 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
rules:459 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
rules:558 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
rules:564 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
rules:569 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
rules:575 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
rule:204 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
rule:3046 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
rule:3076 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
rule:3080 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
rule:3166 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
rule:3183 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
rule:3196 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
rule:3211 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
rule:3604 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
rule:3606 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
rUnion [definition, in Undecidability.TM.Util.Relations]
runion [definition, in Undecidability.TM.Util.Relations]
rValidComp [definition, in Undecidability.L.Tactics.Reflection]
rVar [constructor, in Undecidability.L.Tactics.Reflection]
RX:23 [binder, in Complexity.Complexity.Subtypes]
Rx:26 [binder, in Undecidability.L.Tactics.ComputableDemo]
Rx:30 [binder, in Undecidability.L.Tactics.ComputableDemo]
RX:31 [binder, in Complexity.Complexity.Subtypes]
Rx:37 [binder, in Undecidability.L.Tactics.ComputableDemo]
RX:43 [binder, in Complexity.Complexity.Subtypes]
RX:55 [binder, in Complexity.Complexity.Subtypes]
Rx:6 [binder, in Undecidability.L.AbstractMachines.LargestVar]
RX:85 [binder, in Complexity.Complexity.NP]
RY:24 [binder, in Complexity.Complexity.Subtypes]
Ry:27 [binder, in Undecidability.L.Tactics.ComputableDemo]
Ry:31 [binder, in Undecidability.L.Tactics.ComputableDemo]
RY:32 [binder, in Complexity.Complexity.Subtypes]
Ry:38 [binder, in Undecidability.L.Tactics.ComputableDemo]
RY:44 [binder, in Complexity.Complexity.Subtypes]
RY:56 [binder, in Complexity.Complexity.Subtypes]
Ry:7 [binder, in Undecidability.L.AbstractMachines.LargestVar]
RY:86 [binder, in Complexity.Complexity.NP]
Ry:9 [binder, in Undecidability.L.Computability.Computability]
RY:96 [binder, in Complexity.Libs.CookPrelim.PolyBounds]
R_star [lemma, in Undecidability.L.Prelim.ARS]
R__step [definition, in Complexity.L.AbstractMachines.Computable.EvalForTime]
R__cert:13 [binder, in Complexity.NP.L.CanEnumTerm_def]
R__cert:2 [binder, in Complexity.NP.L.CanEnumTerm_def]
R__cert:2 [binder, in Complexity.NP.L.GenNP_is_hard]
R__sig:3 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
R__X:12 [binder, in Undecidability.L.Datatypes.Lists]
R__edgesComplete:66 [binder, in Complexity.NP.Clique.FlatUGraph]
R__edgesSound:63 [binder, in Complexity.NP.Clique.FlatUGraph]
R__Y:46 [binder, in Complexity.L.TM.CompCode]
R__X:45 [binder, in Complexity.L.TM.CompCode]
R__X:4 [binder, in Complexity.NP.L.LMGenNP]
R__halt:47 [binder, in Complexity.L.TM.TMflat]
R__trans:45 [binder, in Complexity.L.TM.TMflat]
R__halt:35 [binder, in Complexity.L.TM.TMflat]
R_complete:28 [binder, in Complexity.L.TM.TMflat]
R__sound:23 [binder, in Complexity.L.TM.TMflat]
R__R:60 [binder, in Complexity.NP.TM.M_multi2mono]
R__L:57 [binder, in Complexity.NP.TM.M_multi2mono]
R__X:2 [binder, in Complexity.NP.TM.L_to_LM]
R_canonical_functional [lemma, in Undecidability.TM.Util.TM_facts]
R__cert:2 [binder, in Complexity.NP.L.GenNP]
R_NP__correct [projection, in Complexity.Complexity.NP]
R_NP__comp [projection, in Complexity.Complexity.NP]
R_NP [projection, in Complexity.Complexity.NP]
R':111 [binder, in Undecidability.L.Prelim.ARS]
R':144 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
r':183 [binder, in Undecidability.TM.Util.TM_facts]
R':209 [binder, in Undecidability.TM.Hoare.HoareRegister]
R':217 [binder, in Undecidability.TM.Hoare.HoareRegister]
R':268 [binder, in Undecidability.TM.Hoare.HoareRegister]
R':285 [binder, in Undecidability.TM.Util.TM_facts]
R':296 [binder, in Undecidability.TM.Hoare.HoareRegister]
R':315 [binder, in Undecidability.TM.Util.TM_facts]
r':347 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
R':4 [binder, in Complexity.NP.TM.LM_to_mTM]
R':401 [binder, in Undecidability.TM.Hoare.HoareRegister]
R':419 [binder, in Undecidability.TM.Hoare.HoareRegister]
R':453 [binder, in Undecidability.TM.Hoare.HoareCombinators]
R':8 [binder, in Complexity.NP.TM.LM_to_mTM]
R1:10 [binder, in Undecidability.TM.Combinators.SequentialComposition]
r1:110 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
r1:119 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
R1:13 [binder, in Undecidability.TM.Combinators.If]
r1:132 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
R1:135 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
r1:139 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
r1:146 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
r1:154 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
r1:155 [binder, in Undecidability.TM.Util.TM_facts]
r1:159 [binder, in Undecidability.TM.Util.TM_facts]
r1:162 [binder, in Undecidability.TM.Util.TM_facts]
r1:164 [binder, in Undecidability.TM.Compound.MoveToSymbol]
r1:170 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
r1:177 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
r1:180 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
r1:181 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
r1:184 [binder, in Undecidability.TM.Compound.MoveToSymbol]
R1:19 [binder, in Undecidability.TM.Combinators.SequentialComposition]
r1:231 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
r1:238 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
R1:24 [binder, in Undecidability.TM.Combinators.If]
r1:262 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
R1:28 [binder, in Undecidability.TM.Combinators.SequentialComposition]
r1:296 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
R1:327 [binder, in Undecidability.TM.Util.TM_facts]
R1:353 [binder, in Undecidability.TM.Util.TM_facts]
R1:36 [binder, in Undecidability.TM.Combinators.If]
r1:48 [binder, in Undecidability.TM.Code.CodeTM]
r1:49 [binder, in Undecidability.TM.Code.Copy]
R1:50 [binder, in Undecidability.TM.Combinators.Switch]
r1:52 [binder, in Undecidability.TM.Code.CodeTM]
R1:54 [binder, in Undecidability.TM.Combinators.Switch]
r1:55 [binder, in Undecidability.TM.Code.CodeTM]
r1:59 [binder, in Undecidability.TM.Code.CodeTM]
R1:6 [binder, in Undecidability.L.Functions.Encoding]
r1:63 [binder, in Undecidability.TM.Code.Copy]
R1:64 [binder, in Undecidability.TM.Combinators.Switch]
R1:7 [binder, in Undecidability.TM.Combinators.SequentialComposition]
R1:74 [binder, in Undecidability.TM.Combinators.Switch]
R1:74 [binder, in Undecidability.TM.Util.Relations]
R1:79 [binder, in Undecidability.TM.Util.Relations]
R1:8 [binder, in Undecidability.TM.Combinators.If]
R1:84 [binder, in Undecidability.TM.Util.Relations]
r1:84 [binder, in Undecidability.Shared.Libs.DLW.Vec.pos]
r1:85 [binder, in Undecidability.TM.Util.TM_facts]
R1:90 [binder, in Undecidability.TM.Util.Relations]
r1:96 [binder, in Undecidability.TM.Util.TM_facts]
r1:99 [binder, in Undecidability.Shared.Libs.DLW.Vec.pos]
r2:100 [binder, in Undecidability.Shared.Libs.DLW.Vec.pos]
r2:111 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
r2:120 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
r2:133 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
R2:136 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
r2:140 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
r2:147 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
r2:152 [binder, in Undecidability.TM.Util.TM_facts]
r2:155 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
r2:156 [binder, in Undecidability.TM.Util.TM_facts]
r2:163 [binder, in Undecidability.TM.Util.TM_facts]
r2:166 [binder, in Undecidability.TM.Compound.MoveToSymbol]
r2:173 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
r2:179 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
r2:182 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
r2:183 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
r2:186 [binder, in Undecidability.TM.Compound.MoveToSymbol]
r2:233 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
r2:239 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
r2:263 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
R2:29 [binder, in Undecidability.TM.Combinators.SequentialComposition]
r2:298 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
R2:328 [binder, in Undecidability.TM.Util.TM_facts]
R2:354 [binder, in Undecidability.TM.Util.TM_facts]
R2:37 [binder, in Undecidability.TM.Combinators.If]
R2:51 [binder, in Undecidability.TM.Combinators.Switch]
r2:51 [binder, in Undecidability.TM.Code.Copy]
r2:65 [binder, in Undecidability.TM.Code.Copy]
R2:7 [binder, in Undecidability.L.Functions.Encoding]
R2:75 [binder, in Undecidability.TM.Combinators.Switch]
R2:75 [binder, in Undecidability.TM.Util.Relations]
R2:8 [binder, in Undecidability.TM.Combinators.SequentialComposition]
R2:80 [binder, in Undecidability.TM.Util.Relations]
R2:85 [binder, in Undecidability.TM.Util.Relations]
r2:85 [binder, in Undecidability.Shared.Libs.DLW.Vec.pos]
r2:86 [binder, in Undecidability.TM.Util.TM_facts]
R2:9 [binder, in Undecidability.TM.Combinators.If]
R2:91 [binder, in Undecidability.TM.Util.Relations]
r2:97 [binder, in Undecidability.TM.Util.TM_facts]
R3:10 [binder, in Undecidability.TM.Combinators.If]
R3:38 [binder, in Undecidability.TM.Combinators.If]
R3:76 [binder, in Undecidability.TM.Util.Relations]
R3:81 [binder, in Undecidability.TM.Util.Relations]
R3:86 [binder, in Undecidability.TM.Util.Relations]
R3:92 [binder, in Undecidability.TM.Util.Relations]
R4:87 [binder, in Undecidability.TM.Util.Relations]
R4:93 [binder, in Undecidability.TM.Util.Relations]
r:1 [binder, in Undecidability.TM.Code.BinNumbers.PosCompareTM]
R:10 [binder, in Undecidability.L.Prelim.ARS]
R:10 [binder, in Complexity.Complexity.NP]
R:100 [binder, in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
r:100 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
R:100 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler]
R:101 [binder, in Undecidability.TM.Hoare.HoareLogic]
R:103 [binder, in Undecidability.L.Prelim.ARS]
R:103 [binder, in Undecidability.TM.Util.Relations]
r:103 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
R:104 [binder, in Undecidability.L.Prelim.ARS]
r:104 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
R:104 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
R:105 [binder, in Undecidability.Shared.Libs.DLW.Utils.php]
R:106 [binder, in Complexity.Complexity.NP]
R:107 [binder, in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
R:107 [binder, in Undecidability.TM.Hoare.HoareCombinators]
r:107 [binder, in Undecidability.Shared.Libs.DLW.Vec.pos]
R:109 [binder, in Undecidability.L.Prelim.ARS]
r:11 [binder, in Undecidability.TM.Hoare.HoareRegister]
r:11 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler]
R:110 [binder, in Undecidability.TM.Util.Relations]
R:110 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
r:111 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
R:113 [binder, in Undecidability.Shared.Libs.DLW.Utils.php]
R:115 [binder, in Undecidability.L.Prelim.ARS]
R:116 [binder, in Undecidability.L.Prelim.ARS]
R:116 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
r:116 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
R:117 [binder, in Undecidability.L.Prelim.ARS]
R:117 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
R:118 [binder, in Undecidability.Shared.Libs.DLW.Utils.php]
r:118 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
R:119 [binder, in Undecidability.L.Tactics.Computable]
R:119 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
R:12 [binder, in Undecidability.TM.Lifting.LiftAlphabet]
R:12 [binder, in Complexity.Complexity.Definitions]
R:122 [binder, in Undecidability.TM.Hoare.HoareCombinators]
R:125 [binder, in Undecidability.L.Prelim.ARS]
R:128 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
R:129 [binder, in Undecidability.L.Prelim.ARS]
R:13 [binder, in Undecidability.TM.Combinators.Combinators]
R:13 [binder, in Undecidability.Shared.Libs.DLW.Utils.quotient]
R:13 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_upto]
R:13 [binder, in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
R:13 [binder, in Complexity.L.AbstractMachines.AbstractSubstMachine]
R:13 [binder, in Undecidability.TM.Util.Relations]
R:13 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
R:130 [binder, in Undecidability.TM.Lifting.LiftTapes]
r:130 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.CC]
R:131 [binder, in Undecidability.TM.Hoare.HoareCombinators]
r:131 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.CC]
R:132 [binder, in Undecidability.Shared.Libs.DLW.Utils.php]
R:136 [binder, in Undecidability.TM.Lifting.LiftTapes]
R:137 [binder, in Undecidability.L.Tactics.Computable]
R:138 [binder, in Undecidability.L.Prelim.ARS]
R:14 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_quotient]
R:141 [binder, in Undecidability.TM.Hoare.HoareCombinators]
R:143 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
R:144 [binder, in Undecidability.L.Prelim.ARS]
r:144 [binder, in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
R:145 [binder, in Undecidability.TM.Hoare.HoareLogic]
r:149 [binder, in Undecidability.L.Tactics.Extract]
R:15 [binder, in Undecidability.TM.Combinators.Combinators]
R:15 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
R:15 [binder, in Undecidability.L.Functions.Encoding]
R:150 [binder, in Undecidability.L.Prelim.ARS]
R:150 [binder, in Undecidability.TM.Hoare.HoareCombinators]
R:150 [binder, in Undecidability.L.Tactics.Computable]
R:151 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
R:153 [binder, in Undecidability.L.Prelim.ARS]
R:153 [binder, in Undecidability.L.Tactics.ComputableTime]
R:155 [binder, in Undecidability.Shared.Libs.DLW.Utils.php]
r:156 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
R:158 [binder, in Undecidability.L.Prelim.ARS]
R:158 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
R:16 [binder, in Undecidability.L.Prelim.ARS]
r:16 [binder, in Undecidability.L.Util.L_facts]
r:16 [binder, in Undecidability.Shared.Libs.DLW.Code.subcode]
r:16 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
r:160 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
r:162 [binder, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
R:163 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
R:164 [binder, in Undecidability.L.Tactics.ComputableTime]
R:165 [binder, in Undecidability.L.Tactics.Extract]
r:166 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
R:169 [binder, in Undecidability.TM.Hoare.HoareCombinators]
R:17 [binder, in Undecidability.L.Prelim.LoopSum]
R:17 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_upto]
r:173 [binder, in Undecidability.TM.Single.StepTM]
r:176 [binder, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
R:179 [binder, in Undecidability.L.Tactics.Extract]
R:179 [binder, in Undecidability.TM.Hoare.HoareLogic]
r:18 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
r:18 [binder, in Undecidability.TM.Hoare.HoareRegister]
R:18 [binder, in Complexity.Complexity.Definitions]
r:181 [binder, in Undecidability.TM.Util.TM_facts]
R:182 [binder, in Undecidability.TM.Hoare.HoareCombinators]
R:19 [binder, in Undecidability.TM.Util.Relations]
r:19 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
R:191 [binder, in Undecidability.TM.Hoare.HoareRegister]
R:194 [binder, in Undecidability.TM.Hoare.HoareCombinators]
R:195 [binder, in Undecidability.L.Prelim.ARS]
R:199 [binder, in Undecidability.L.Prelim.ARS]
R:199 [binder, in Undecidability.TM.Hoare.HoareRegister]
R:2 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_quotient]
R:2 [binder, in Undecidability.TM.L.CompilerBoolFuns.LComp_to_TMComp]
R:2 [binder, in Undecidability.Shared.Libs.DLW.Utils.quotient]
R:2 [binder, in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
R:2 [binder, in Complexity.Complexity.Definitions]
R:2 [binder, in Undecidability.L.Tactics.Computable]
R:20 [binder, in Undecidability.L.Prelim.ARS]
R:20 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_quotient]
r:20 [binder, in Undecidability.Shared.Libs.DLW.Utils.list_bool]
R:20 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
R:203 [binder, in Undecidability.L.Prelim.ARS]
R:203 [binder, in Undecidability.TM.Hoare.HoareCombinators]
R:205 [binder, in Undecidability.L.Prelim.ARS]
R:207 [binder, in Undecidability.L.Prelim.ARS]
R:208 [binder, in Undecidability.TM.Hoare.HoareRegister]
r:21 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_string]
R:21 [binder, in Undecidability.L.Functions.Encoding]
R:210 [binder, in Undecidability.L.Prelim.ARS]
R:216 [binder, in Undecidability.TM.Hoare.HoareRegister]
R:218 [binder, in Undecidability.L.Prelim.ARS]
R:219 [binder, in Undecidability.TM.Hoare.HoareCombinators]
r:219 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
R:22 [binder, in Complexity.L.AbstractMachines.FunctionalDefinitions]
R:22 [binder, in Complexity.Complexity.NP]
R:225 [binder, in Undecidability.L.Prelim.ARS]
R:229 [binder, in Undecidability.L.Prelim.ARS]
r:229 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
r:23 [binder, in Undecidability.L.Tactics.Extract]
R:232 [binder, in Undecidability.L.Prelim.ARS]
R:237 [binder, in Undecidability.TM.Hoare.HoareCombinators]
r:237 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
R:24 [binder, in Complexity.Complexity.Definitions]
r:241 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
r:245 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
r:25 [binder, in Undecidability.TM.Code.BinNumbers.PosCompareTM]
R:25 [binder, in Undecidability.TM.Util.Relations]
R:250 [binder, in Undecidability.TM.Hoare.HoareCombinators]
r:252 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
R:26 [binder, in Undecidability.TM.Combinators.Combinators]
R:26 [binder, in Undecidability.L.Prelim.ARS]
R:26 [binder, in Undecidability.TM.Combinators.Mirror]
R:26 [binder, in Undecidability.L.L]
R:262 [binder, in Undecidability.TM.Hoare.HoareCombinators]
r:267 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
R:269 [binder, in Undecidability.TM.Hoare.HoareRegister]
R:27 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_quotient]
r:27 [binder, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
R:27 [binder, in Undecidability.L.Prelim.LoopSum]
R:272 [binder, in Undecidability.TM.Hoare.HoareCombinators]
R:277 [binder, in Undecidability.TM.Util.TM_facts]
R:28 [binder, in Undecidability.TM.Combinators.Combinators]
r:28 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
R:284 [binder, in Undecidability.TM.Util.TM_facts]
R:285 [binder, in Undecidability.TM.Hoare.HoareCombinators]
R:29 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
R:296 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
R:297 [binder, in Undecidability.TM.Hoare.HoareRegister]
R:30 [binder, in Undecidability.L.Prelim.ARS]
R:30 [binder, in Undecidability.L.Tactics.ComputableTactics]
R:30 [binder, in Complexity.Complexity.Definitions]
r:30 [binder, in Complexity.TM.Single.DecodeTape]
R:301 [binder, in Undecidability.TM.Hoare.HoareCombinators]
r:304 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
r:3044 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
r:305 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
R:307 [binder, in Undecidability.TM.Util.TM_facts]
r:3074 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
r:309 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
r:31 [binder, in Undecidability.TM.Code.BinNumbers.PosCompareTM]
R:31 [binder, in Undecidability.TM.Combinators.Mirror]
R:31 [binder, in Undecidability.L.Functions.EqBool]
r:312 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
R:314 [binder, in Undecidability.TM.Util.TM_facts]
r:316 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
R:317 [binder, in Undecidability.TM.Hoare.HoareCombinators]
R:32 [binder, in Undecidability.L.Prelim.ARS]
R:32 [binder, in Undecidability.TM.Util.Relations]
R:32 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
R:321 [binder, in Undecidability.TM.Util.TM_facts]
r:3225 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
r:3226 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
r:3259 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
r:3264 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
r:3267 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
R:329 [binder, in Undecidability.TM.Hoare.HoareCombinators]
r:33 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
R:33 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_upto]
r:33 [binder, in Undecidability.Shared.Libs.DLW.Utils.php]
R:33 [binder, in Complexity.TM.Single.DecodeTapes]
R:33 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
r:334 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
R:334 [binder, in Undecidability.TM.Util.TM_facts]
R:34 [binder, in Undecidability.Shared.Libs.DLW.Code.subcode]
R:340 [binder, in Undecidability.TM.Util.TM_facts]
r:341 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
r:343 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
R:346 [binder, in Undecidability.TM.Util.TM_facts]
R:35 [binder, in Undecidability.L.Prelim.ARS]
R:35 [binder, in Complexity.Complexity.Definitions]
r:352 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
R:355 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
R:36 [binder, in Undecidability.TM.Combinators.Mirror]
r:3602 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
R:363 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
r:3632 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
R:367 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
R:370 [binder, in Undecidability.TM.Hoare.HoareCombinators]
R:371 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
R:378 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
R:38 [binder, in Undecidability.L.Tactics.Lrewrite]
R:38 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_upto]
r:38 [binder, in Complexity.TM.Single.DecodeTape]
R:386 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
R:389 [binder, in Undecidability.TM.Hoare.HoareCombinators]
R:39 [binder, in Undecidability.L.Prelim.ARS]
R:39 [binder, in Undecidability.L.Tactics.Computable]
R:394 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
R:4 [binder, in Undecidability.TM.L.CompilerBoolFuns.LComp_to_TMComp]
R:4 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
R:4 [binder, in Undecidability.L.Computability.Computability]
R:40 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_quotient]
r:40 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
R:40 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_nat_facts]
R:40 [binder, in Undecidability.TM.Util.Relations]
R:40 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
R:40 [binder, in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
R:402 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
R:402 [binder, in Undecidability.TM.Hoare.HoareRegister]
R:41 [binder, in Complexity.Complexity.SpaceBoundsTime]
R:411 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
R:42 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
R:42 [binder, in Complexity.Complexity.NP]
R:420 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
R:420 [binder, in Undecidability.TM.Hoare.HoareRegister]
R:43 [binder, in Undecidability.L.Functions.EqBool]
r:43 [binder, in Complexity.TM.Single.DecodeTape]
R:430 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
R:438 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
R:44 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
r:44 [binder, in Undecidability.Shared.Libs.DLW.Code.subcode]
R:45 [binder, in Undecidability.L.Tactics.Lrewrite]
r:45 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_nat_facts]
R:456 [binder, in Undecidability.TM.Hoare.HoareCombinators]
R:46 [binder, in Undecidability.L.Prelim.ARS]
r:46 [binder, in Undecidability.TM.Code.BinNumbers.PosCompareTM]
r:46 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_nat_facts]
r:47 [binder, in Undecidability.L.Datatypes.List.List_basics]
R:47 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
R:48 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_nat_facts]
R:48 [binder, in Undecidability.TM.Util.Relations]
r:48 [binder, in Undecidability.Shared.Libs.DLW.Code.subcode]
R:49 [binder, in Undecidability.L.Prelim.ARS]
R:50 [binder, in Undecidability.L.Functions.EqBool]
R:51 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_quotient]
r:52 [binder, in Undecidability.L.Datatypes.List.List_basics]
R:52 [binder, in Undecidability.L.Functions.UnboundIteration]
r:52 [binder, in Undecidability.Shared.Libs.DLW.Code.subcode]
R:55 [binder, in Undecidability.L.Prelim.ARS]
R:55 [binder, in Undecidability.TM.Util.Relations]
R:56 [binder, in Undecidability.L.Prelim.ARS]
R:56 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
r:562 [binder, in Complexity.NP.TM.LM_to_mTM]
R:57 [binder, in Undecidability.L.Prelim.ARS]
R:57 [binder, in Undecidability.TM.Lifting.LiftAlphabet]
R:58 [binder, in Undecidability.L.Prelim.ARS]
R:58 [binder, in Undecidability.L.Tactics.ComputableTime]
r:58 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
r:58 [binder, in Undecidability.TM.Compound.Shift]
r:59 [binder, in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
R:590 [binder, in Complexity.NP.TM.LM_to_mTM]
R:594 [binder, in Complexity.NP.TM.LM_to_mTM]
R:6 [binder, in Undecidability.TM.Util.Relations]
R:60 [binder, in Undecidability.TM.Util.Relations]
R:61 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
R:61 [binder, in Undecidability.L.Tactics.Computable]
R:62 [binder, in Undecidability.L.Prelim.ARS]
R:63 [binder, in Undecidability.TM.Lifting.LiftAlphabet]
r:64 [binder, in Undecidability.TM.Compound.Shift]
R:66 [binder, in Undecidability.L.Prelim.ARS]
R:66 [binder, in Undecidability.Shared.Libs.DLW.Utils.quotient]
R:66 [binder, in Undecidability.TM.Util.Relations]
r:67 [binder, in Undecidability.TM.Code.BinNumbers.PosCompareTM]
r:68 [binder, in Undecidability.TM.Code.BinNumbers.PosCompareTM]
R:69 [binder, in Undecidability.Shared.Libs.DLW.Utils.quotient]
r:7 [binder, in Undecidability.TM.Hoare.HoareRegister]
R:70 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
r:71 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
r:71 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
R:73 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
r:73 [binder, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
r:74 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
r:75 [binder, in Undecidability.Shared.Libs.DLW.Code.subcode]
R:76 [binder, in Undecidability.L.Prelim.ARS]
R:77 [binder, in Undecidability.L.Prelim.ARS]
R:78 [binder, in Undecidability.L.Prelim.ARS]
r:78 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
R:79 [binder, in Undecidability.L.Prelim.ARS]
R:79 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
r:79 [binder, in Undecidability.Shared.Libs.DLW.Code.subcode]
R:8 [binder, in Undecidability.L.Tactics.Computable]
r:80 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
R:81 [binder, in Undecidability.L.Tactics.Extract]
r:82 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
R:83 [binder, in Undecidability.L.Prelim.ARS]
R:84 [binder, in Undecidability.L.Tactics.ComputableTime]
R:85 [binder, in Undecidability.TM.Hoare.HoareRegister]
R:86 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
R:87 [binder, in Undecidability.L.Prelim.ARS]
R:88 [binder, in Undecidability.L.Prelim.ARS]
r:89 [binder, in Undecidability.Shared.Libs.DLW.Vec.pos]
r:896 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
R:9 [binder, in Undecidability.Shared.Libs.DLW.Utils.quotient]
R:9 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
r:9 [binder, in Undecidability.L.Prelim.StringBase]
R:90 [binder, in Undecidability.TM.Hoare.HoareLogic]
r:90 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
r:901 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
R:92 [binder, in Undecidability.L.Prelim.ARS]
r:92 [binder, in Undecidability.Shared.Libs.DLW.Vec.pos]
R:93 [binder, in Undecidability.L.Prelim.ARS]
r:93 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
r:93 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
R:94 [binder, in Undecidability.L.Prelim.ARS]
R:95 [binder, in Undecidability.L.Prelim.ARS]
r:95 [binder, in Undecidability.Shared.Libs.DLW.Vec.pos]
R:96 [binder, in Undecidability.L.Prelim.ARS]
R:96 [binder, in Undecidability.TM.Util.Relations]
R:97 [binder, in Undecidability.L.Prelim.ARS]
r:97 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
R:98 [binder, in Undecidability.L.Prelim.ARS]
R:98 [binder, in Undecidability.Shared.Libs.DLW.Utils.php]

S

SAT [definition, in Complexity.NP.SAT.SAT]
SAT [library]
satAssgn [definition, in Complexity.NP.Clique.kSAT_to_Clique]
satAssgn_sat_cnf [lemma, in Complexity.NP.Clique.kSAT_to_Clique]
satAssgn_sat_literals [lemma, in Complexity.NP.Clique.kSAT_to_Clique]
satFinal [definition, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
satFinal [definition, in Complexity.NP.SAT.CookLevin.Subproblems.CC]
satFinal_final_equivalent [lemma, in Complexity.NP.SAT.CookLevin.Subproblems.CC]
satFinal_final_monotonous [lemma, in Complexity.NP.SAT.CookLevin.Subproblems.CC]
satisfies [definition, in Complexity.NP.SAT.FSAT.FSAT]
satisfies [definition, in Complexity.NP.SAT.SAT]
satLiterals [definition, in Complexity.NP.Clique.kSAT_to_Clique]
satLiterals_not_conflicting [lemma, in Complexity.NP.Clique.kSAT_to_Clique]
satLiterals_sat [lemma, in Complexity.NP.Clique.kSAT_to_Clique]
satLiterals_for_all_clauses [lemma, in Complexity.NP.Clique.kSAT_to_Clique]
satPositions [definition, in Complexity.NP.Clique.kSAT_to_Clique]
satPositions_valid [lemma, in Complexity.NP.Clique.kSAT_to_Clique]
satPositions_non_conflicting [lemma, in Complexity.NP.Clique.kSAT_to_Clique]
satPositions_for_all_clauses [lemma, in Complexity.NP.Clique.kSAT_to_Clique]
satPositions_dupfree [lemma, in Complexity.NP.Clique.kSAT_to_Clique]
sat_NP [lemma, in Complexity.NP.SAT.SAT_inNP]
sat_verifierb_time [definition, in Complexity.NP.SAT.SAT_inNP]
sat_verifierb_correct [lemma, in Complexity.NP.SAT.SAT_inNP]
sat_verifierb [definition, in Complexity.NP.SAT.SAT_inNP]
sat_verifier [definition, in Complexity.NP.SAT.SAT_inNP]
SAT_equiv_FlatClique [lemma, in Complexity.NP.Clique.kSAT_to_FlatClique]
SAT_implies_FlatClique [lemma, in Complexity.NP.Clique.kSAT_to_FlatClique]
SAT_inNP [library]
sa:15 [binder, in Undecidability.TM.Code.NatTM]
sa:7 [binder, in Undecidability.TM.Code.NatTM]
sbbC [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
SBTM [record, in Undecidability.TM.SBTM]
SBTM [library]
sb:16 [binder, in Undecidability.TM.Code.NatTM]
sb:8 [binder, in Undecidability.TM.Code.NatTM]
scal [abbreviation, in Undecidability.Shared.Libs.DLW.Utils.sums]
scal_one [lemma, in Undecidability.Shared.Libs.DLW.Utils.sums]
scal_one_comm [lemma, in Undecidability.Shared.Libs.DLW.Utils.sums]
scal_times [lemma, in Undecidability.Shared.Libs.DLW.Utils.sums]
sconfig [definition, in Complexity.NP.SAT.CookLevin.Subproblems.TM_single]
sconfig [abbreviation, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
sconfig_for_mconfig [definition, in Complexity.NP.SAT.CookLevin.Subproblems.TM_single]
Scott [lemma, in Undecidability.L.Computability.Scott]
Scott [library]
sc:66 [binder, in Undecidability.TM.Code.NatTM]
sc:85 [binder, in Undecidability.TM.Code.NatTM]
SecondFixedPoint [lemma, in Undecidability.L.Computability.Fixpoints]
seenMark:89 [binder, in Complexity.TM.Single.DecodeTape]
seenSymbol:90 [binder, in Complexity.TM.Single.DecodeTape]
select [definition, in Undecidability.TM.Lifting.LiftTapes]
selectConf [definition, in Undecidability.TM.Lifting.LiftTapes]
select_nth [lemma, in Undecidability.TM.Lifting.LiftTapes]
self_div_comb [lemma, in Undecidability.L.Computability.Rice]
self_div [lemma, in Undecidability.L.Computability.Rice]
self_diverging_comb [definition, in Undecidability.L.Computability.Rice]
self_diverging [definition, in Undecidability.L.Computability.Rice]
Semantics [section, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
Semantics [section, in Undecidability.TM.Util.TM_facts]
Semantics.Canonical_Termination.M [variable, in Undecidability.TM.Util.TM_facts]
Semantics.Canonical_Termination.n [variable, in Undecidability.TM.Util.TM_facts]
Semantics.Canonical_Termination [section, in Undecidability.TM.Util.TM_facts]
Semantics.Canonical_Correctness.pM [variable, in Undecidability.TM.Util.TM_facts]
Semantics.Canonical_Correctness.F [variable, in Undecidability.TM.Util.TM_facts]
Semantics.Canonical_Correctness.n [variable, in Undecidability.TM.Util.TM_facts]
Semantics.Canonical_Correctness [section, in Undecidability.TM.Util.TM_facts]
Semantics.sig [variable, in Undecidability.TM.Util.TM_facts]
_ ⊨c( _ ) _ [notation, in Undecidability.TM.Util.TM_facts]
_ ↓ _ [notation, in Undecidability.TM.Util.TM_facts]
_ ⊨ _ [notation, in Undecidability.TM.Util.TM_facts]
SemiDecidabilityFacts [library]
semi_confluent_confluent [lemma, in Undecidability.L.Prelim.ARS]
semi_confluent [definition, in Undecidability.L.Prelim.ARS]
semi_decidable_enumerable [lemma, in Undecidability.Synthetic.EnumerabilityFacts]
semi_decidable [definition, in Undecidability.Synthetic.Definitions]
semi_decider [definition, in Undecidability.Synthetic.Definitions]
Seq [definition, in Undecidability.TM.Combinators.SequentialComposition]
seqeq_incl [lemma, in Undecidability.Shared.Libs.DLW.Utils.seteq]
sequence_of_coprimes.seq_of_coprimes_lt [variable, in Undecidability.Shared.Libs.DLW.Utils.crt]
sequence_of_coprimes [section, in Undecidability.Shared.Libs.DLW.Utils.crt]
SequentialComposition [library]
seq_isFlatListOf [lemma, in Complexity.Libs.CookPrelim.FlatFinTypes]
seq_of_coprimes [lemma, in Undecidability.Shared.Libs.DLW.Utils.crt]
seq_time [definition, in Undecidability.L.Datatypes.List.List_extra]
Seq_RealiseIn [lemma, in Undecidability.TM.Combinators.SequentialComposition]
Seq_TerminatesIn' [lemma, in Undecidability.TM.Combinators.SequentialComposition]
Seq_TerminatesIn [lemma, in Undecidability.TM.Combinators.SequentialComposition]
Seq_Realise [lemma, in Undecidability.TM.Combinators.SequentialComposition]
Seq_SpecT' [lemma, in Undecidability.TM.Hoare.HoareCombinators]
Seq_SpecT [lemma, in Undecidability.TM.Hoare.HoareCombinators]
Seq_SpecT_strong [lemma, in Undecidability.TM.Hoare.HoareCombinators]
Seq_Spec_swapped' [lemma, in Undecidability.TM.Hoare.HoareCombinators]
Seq_Spec_swapped [lemma, in Undecidability.TM.Hoare.HoareCombinators]
Seq_Spec' [lemma, in Undecidability.TM.Hoare.HoareCombinators]
Seq_Spec [lemma, in Undecidability.TM.Hoare.HoareCombinators]
SetBitAndMoveLeft [definition, in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
SetBitAndMoveLeft_Sem [lemma, in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
SetBitAndMoveLeft_Rel [definition, in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
seteq [inductive, in Undecidability.Shared.Libs.DLW.Utils.seteq]
seteq [section, in Undecidability.Shared.Libs.DLW.Utils.seteq]
seteq [library]
seteq_bi_incl [lemma, in Undecidability.Shared.Libs.DLW.Utils.seteq]
seteq_trans [constructor, in Undecidability.Shared.Libs.DLW.Utils.seteq]
seteq_sym [constructor, in Undecidability.Shared.Libs.DLW.Utils.seteq]
seteq_dup [constructor, in Undecidability.Shared.Libs.DLW.Utils.seteq]
seteq_swap [constructor, in Undecidability.Shared.Libs.DLW.Utils.seteq]
seteq_skip [constructor, in Undecidability.Shared.Libs.DLW.Utils.seteq]
seteq_nil [constructor, in Undecidability.Shared.Libs.DLW.Utils.seteq]
seteq.X [variable, in Undecidability.Shared.Libs.DLW.Utils.seteq]
_ ⊆ _ [notation, in Undecidability.Shared.Libs.DLW.Utils.seteq]
_ ≡ _ [notation, in Undecidability.Shared.Libs.DLW.Utils.seteq]
SetFinal [definition, in Undecidability.TM.Univ.LowLevel]
SetFinal_size_nice [lemma, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
SetFinal_Terminates [lemma, in Undecidability.TM.Univ.LowLevel]
SetFinal_T [definition, in Undecidability.TM.Univ.LowLevel]
SetFinal_steps [definition, in Undecidability.TM.Univ.LowLevel]
SetFinal_Realise [lemma, in Undecidability.TM.Univ.LowLevel]
SetFinal_Rel [definition, in Undecidability.TM.Univ.LowLevel]
SetFinal_size [definition, in Undecidability.TM.Univ.LowLevel]
SetFinal_SpecT_space [lemma, in Undecidability.TM.Univ.Univ]
seval [inductive, in Undecidability.L.Computability.Seval]
Seval [library]
sevalR [constructor, in Undecidability.L.Computability.Seval]
sevalS [constructor, in Undecidability.L.Computability.Seval]
seval_Eval [lemma, in Undecidability.L.Functions.Eval]
seval_rect [lemma, in Undecidability.L.Computability.Seval]
seval_eva [lemma, in Undecidability.L.Computability.Seval]
seval_S [lemma, in Undecidability.L.Computability.Seval]
seval_eval [lemma, in Undecidability.L.Computability.Seval]
sfin:21 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.SingleTMGenNP]
sf:109 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.CC]
sf:126 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
sf:13 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.BinaryCC]
sf:196 [binder, in Complexity.L.TM.TMflatComp]
sf:210 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
sf:22 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
sf:239 [binder, in Complexity.L.TM.TMflatComp]
sf:242 [binder, in Complexity.L.TM.TMflatComp]
sf:27 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
sf:54 [binder, in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
sf:55 [binder, in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
sf:56 [binder, in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
sf:73 [binder, in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
sf:81 [binder, in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
sf:82 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
sf:85 [binder, in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
Shared [library]
SharedSAT [library]
Shift [definition, in Undecidability.TM.Compound.Shift]
Shift [section, in Undecidability.TM.Compound.Shift]
Shift [library]
ShiftLeft [definition, in Undecidability.TM.Code.BinNumbers.PosShiftTM]
shiftLeftTapeC [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
ShiftLeft_num_Realise [lemma, in Undecidability.TM.Code.BinNumbers.PosShiftTM]
ShiftLeft_num_Rel [definition, in Undecidability.TM.Code.BinNumbers.PosShiftTM]
ShiftLeft_num [definition, in Undecidability.TM.Code.BinNumbers.PosShiftTM]
ShiftLeft_num_Loop_Realise [lemma, in Undecidability.TM.Code.BinNumbers.PosShiftTM]
ShiftLeft_num_Loop [definition, in Undecidability.TM.Code.BinNumbers.PosShiftTM]
ShiftLeft_num_Loop_Rel [definition, in Undecidability.TM.Code.BinNumbers.PosShiftTM]
ShiftLeft_num_Step_Realise [lemma, in Undecidability.TM.Code.BinNumbers.PosShiftTM]
ShiftLeft_num_Step [definition, in Undecidability.TM.Code.BinNumbers.PosShiftTM]
ShiftLeft_num_Step_Rel [definition, in Undecidability.TM.Code.BinNumbers.PosShiftTM]
ShiftLeft_Realise [lemma, in Undecidability.TM.Code.BinNumbers.PosShiftTM]
ShiftLeft_Rel [definition, in Undecidability.TM.Code.BinNumbers.PosShiftTM]
ShiftRight [definition, in Undecidability.TM.Code.BinNumbers.PosShiftTM]
shiftRightBBBB [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
shiftRightBBBS [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
shiftRightBBS [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
shiftRightBSS [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
shiftRightRules [inductive, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
shiftRightSBB [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
shiftRightSSB [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
shiftRightSSSB [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
shiftRightSSSS [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
shiftRightTapeC [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
ShiftRight_num_Realise [lemma, in Undecidability.TM.Code.BinNumbers.PosShiftTM]
ShiftRight_num_Rel [definition, in Undecidability.TM.Code.BinNumbers.PosShiftTM]
ShiftRight_num [definition, in Undecidability.TM.Code.BinNumbers.PosShiftTM]
ShiftRight_num_Loop_Realise [lemma, in Undecidability.TM.Code.BinNumbers.PosShiftTM]
ShiftRight_num_Loop [definition, in Undecidability.TM.Code.BinNumbers.PosShiftTM]
ShiftRight_num_Loop_Rel [definition, in Undecidability.TM.Code.BinNumbers.PosShiftTM]
ShiftRight_num_Step_Realise [lemma, in Undecidability.TM.Code.BinNumbers.PosShiftTM]
ShiftRight_num_Step [definition, in Undecidability.TM.Code.BinNumbers.PosShiftTM]
ShiftRight_num_Step_Rel [definition, in Undecidability.TM.Code.BinNumbers.PosShiftTM]
ShiftRight_Realise [lemma, in Undecidability.TM.Code.BinNumbers.PosShiftTM]
ShiftRight_Rel [definition, in Undecidability.TM.Code.BinNumbers.PosShiftTM]
ShiftRight' [definition, in Undecidability.TM.Code.BinNumbers.PosShiftTM]
ShiftRight'_Realise [lemma, in Undecidability.TM.Code.BinNumbers.PosShiftTM]
ShiftRight'_Rel [definition, in Undecidability.TM.Code.BinNumbers.PosShiftTM]
shift_left_shift_right [lemma, in Undecidability.TM.Code.BinNumbers.PosDefinitions]
shift_left_append_zero [lemma, in Undecidability.TM.Code.BinNumbers.PosDefinitions]
shift_right [definition, in Undecidability.TM.Code.BinNumbers.PosDefinitions]
shift_left [definition, in Undecidability.TM.Code.BinNumbers.PosDefinitions]
Shift_L_TerminatesIn [lemma, in Undecidability.TM.Compound.Shift]
Shift_L_fun_correct_midtape_stop [lemma, in Undecidability.TM.Compound.Shift]
Shift_L_fun_correct_midtape [lemma, in Undecidability.TM.Compound.Shift]
Shift_L_Realise [lemma, in Undecidability.TM.Compound.Shift]
Shift_fun_mirror [lemma, in Undecidability.TM.Compound.Shift]
Shift_L_Rel [definition, in Undecidability.TM.Compound.Shift]
Shift_L_fun_measure [definition, in Undecidability.TM.Compound.Shift]
Shift_L [definition, in Undecidability.TM.Compound.Shift]
Shift_TerminatesIn [lemma, in Undecidability.TM.Compound.Shift]
Shift_steps_local [lemma, in Undecidability.TM.Compound.Shift]
Shift_steps [definition, in Undecidability.TM.Compound.Shift]
Shift_fun_correct_midtape_stop [lemma, in Undecidability.TM.Compound.Shift]
Shift_fun_correct_midtape [lemma, in Undecidability.TM.Compound.Shift]
Shift_Realise [lemma, in Undecidability.TM.Compound.Shift]
Shift_fun_move [lemma, in Undecidability.TM.Compound.Shift]
Shift_Rel [definition, in Undecidability.TM.Compound.Shift]
Shift_fun_measure [definition, in Undecidability.TM.Compound.Shift]
Shift_Step_Sem [lemma, in Undecidability.TM.Compound.Shift]
Shift_Step [definition, in Undecidability.TM.Compound.Shift]
Shift_Step_Rel [definition, in Undecidability.TM.Compound.Shift]
Shift.f [variable, in Undecidability.TM.Compound.Shift]
Shift.sig [variable, in Undecidability.TM.Compound.Shift]
sig [section, in Complexity.L.Datatypes.LDepPair]
sig [abbreviation, in Undecidability.TM.Code.CaseBool]
sig [projection, in Complexity.L.TM.TMflat]
sig [abbreviation, in Undecidability.TM.Univ.LookupAssociativeListTM]
sigCom [definition, in Undecidability.TM.L.Alphabets]
sigCom_fin [definition, in Undecidability.TM.L.Alphabets]
sigGraph [abbreviation, in Undecidability.TM.Univ.LowLevel]
sigGraph [definition, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
sigGraph [abbreviation, in Undecidability.TM.Univ.Univ]
sigHAdd [definition, in Undecidability.TM.L.Alphabets]
sigHAdd_fin [definition, in Undecidability.TM.L.Alphabets]
sigHClos [definition, in Undecidability.TM.L.Alphabets]
sigHClos_fin [definition, in Undecidability.TM.L.Alphabets]
sigHeap [definition, in Undecidability.TM.L.Alphabets]
sigHeap_fin [definition, in Undecidability.TM.L.Alphabets]
sigHEntr [definition, in Undecidability.TM.L.Alphabets]
sigHEntr_fin [definition, in Undecidability.TM.L.Alphabets]
sigHEntr' [definition, in Undecidability.TM.L.Alphabets]
sigHEntr'_fin [definition, in Undecidability.TM.L.Alphabets]
sigList [section, in Complexity.L.TM.CompCode]
sigList [inductive, in Undecidability.TM.Code.Code]
sigList [abbreviation, in Undecidability.TM.Code.List.App]
sigList_eqb_spec [lemma, in Complexity.L.TM.CompCode]
sigList_eqb [definition, in Complexity.L.TM.CompCode]
sigList_eqb.spec__X [variable, in Complexity.L.TM.CompCode]
sigList_eqb.eqb__X [variable, in Complexity.L.TM.CompCode]
sigList_eqb.X [variable, in Complexity.L.TM.CompCode]
sigList_eqb [section, in Complexity.L.TM.CompCode]
sigList_fin [instance, in Undecidability.TM.Code.Code]
sigList_dec [instance, in Undecidability.TM.Code.Code]
sigList_cons [constructor, in Undecidability.TM.Code.Code]
sigList_nil [constructor, in Undecidability.TM.Code.Code]
sigList_X [constructor, in Undecidability.TM.Code.Code]
Sigma [abbreviation, in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
Sigma [projection, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
Sigma [abbreviation, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
Sigma [projection, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
Sigma [abbreviation, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
Sigma [abbreviation, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
Sigma [projection, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
Sigma [abbreviation, in Complexity.NP.SAT.CookLevin.Reductions.CC_to_BinaryCC]
Sigma [projection, in Complexity.NP.SAT.CookLevin.Subproblems.CC]
sigmaEnv [projection, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Sigma_finRepr [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
sigma':12 [binder, in Complexity.NP.TM.M_LM2TM]
sigma':21 [binder, in Complexity.NP.L.LMGenNP]
sigma':23 [binder, in Complexity.NP.TM.M_LM2TM]
sigma':27 [binder, in Complexity.NP.TM.LM_to_mTM]
sigma':33 [binder, in Complexity.NP.TM.LM_to_mTM]
sigma':41 [binder, in Complexity.NP.TM.LM_to_mTM]
sigma:1 [binder, in Complexity.L.AbstractMachines.Computable.EvalForTime]
Sigma:1 [binder, in Undecidability.L.TM.TMinL]
Sigma:1 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.CC]
Sigma:10 [binder, in Undecidability.L.TM.TMinL]
sigma:10 [binder, in Complexity.NP.L.LMGenNP]
sigma:11 [binder, in Complexity.L.AbstractMachines.Computable.EvalForTime]
Sigma:14 [binder, in Undecidability.L.TM.TMinL]
sigma:16 [binder, in Complexity.L.AbstractMachines.Computable.EvalForTime]
sigma:19 [binder, in Complexity.NP.L.LMGenNP]
sigma:207 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
sigma:221 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
sigma:232 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
sigma:239 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
sigma:24 [binder, in Complexity.NP.L.LMGenNP]
sigma:3 [binder, in Complexity.L.AbstractMachines.Computable.EvalForTime]
sigma:36 [binder, in Undecidability.Shared.Libs.PSL.Numbers]
Sigma:47 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
Sigma:50 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
sigma:54 [binder, in Complexity.L.AbstractMachines.Computable.EvalForTime]
sigma:56 [binder, in Undecidability.Shared.Libs.PSL.Numbers]
Sigma:67 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
Sigma:72 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
sigma:78 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachine]
Sigma:8 [binder, in Undecidability.L.TM.TMinL]
sigma:91 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachine]
sigMU [abbreviation, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
sigMUniv [abbreviation, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
sigM' [definition, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
sigM:11 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
sigM:119 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
sigM:121 [binder, in Complexity.TM.PrettyBounds.UnivBounds]
sigM:123 [binder, in Complexity.TM.PrettyBounds.UnivBounds]
sigM:123 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
sigM:125 [binder, in Complexity.TM.PrettyBounds.UnivBounds]
sigM:128 [binder, in Complexity.TM.PrettyBounds.UnivBounds]
sigM:132 [binder, in Complexity.TM.PrettyBounds.UnivBounds]
sigM:135 [binder, in Complexity.TM.PrettyBounds.UnivBounds]
sigM:137 [binder, in Complexity.TM.PrettyBounds.UnivBounds]
sigM:145 [binder, in Complexity.TM.PrettyBounds.UnivBounds]
sigM:148 [binder, in Complexity.TM.PrettyBounds.UnivBounds]
sigM:151 [binder, in Complexity.TM.PrettyBounds.UnivBounds]
sigM:156 [binder, in Complexity.TM.PrettyBounds.UnivBounds]
sigM:160 [binder, in Complexity.TM.PrettyBounds.UnivBounds]
sigM:165 [binder, in Complexity.TM.PrettyBounds.UnivBounds]
sigM:18 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
sigM:316 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
sigM:322 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
sigM:41 [binder, in Undecidability.TM.Univ.LowLevel]
sigN [abbreviation, in Undecidability.TM.Code.BinNumbers.EncodeBinNumbers]
sigNat [inductive, in Undecidability.TM.Code.Code]
sigNat_eqb_spec [lemma, in Complexity.L.TM.CompCode]
sigNat_eqb [definition, in Complexity.L.TM.CompCode]
sigNat_fin [instance, in Undecidability.TM.Code.Code]
sigNat_eq [instance, in Undecidability.TM.Code.Code]
sigNat_S [constructor, in Undecidability.TM.Code.Code]
sigNat_O [constructor, in Undecidability.TM.Code.Code]
sign:177 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
sign:179 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
sign:182 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
sigOption [inductive, in Undecidability.TM.Code.Code]
sigOption_eqb_spec [lemma, in Complexity.L.TM.CompCode]
sigOption_eqb [definition, in Complexity.L.TM.CompCode]
sigOption_eqb.spec__X [variable, in Complexity.L.TM.CompCode]
sigOption_eqb.eqb__X [variable, in Complexity.L.TM.CompCode]
sigOption_eqb.X [variable, in Complexity.L.TM.CompCode]
sigOption_eqb [section, in Complexity.L.TM.CompCode]
sigOption_fin [instance, in Undecidability.TM.Code.Code]
sigOption_dec [instance, in Undecidability.TM.Code.Code]
sigOption_Some [constructor, in Undecidability.TM.Code.Code]
sigOption_None [constructor, in Undecidability.TM.Code.Code]
sigOption_X [constructor, in Undecidability.TM.Code.Code]
sigPair [inductive, in Undecidability.TM.Code.Code]
sigPair [abbreviation, in Undecidability.TM.Code.CasePair]
sigPair_eqb_spec [lemma, in Complexity.L.TM.CompCode]
sigPair_eqb [definition, in Complexity.L.TM.CompCode]
sigPair_eqb.spec__Y [variable, in Complexity.L.TM.CompCode]
sigPair_eqb.eqb__Y [variable, in Complexity.L.TM.CompCode]
sigPair_eqb.spec__X [variable, in Complexity.L.TM.CompCode]
sigPair_eqb.eqb__X [variable, in Complexity.L.TM.CompCode]
sigPair_eqb.Y [variable, in Complexity.L.TM.CompCode]
sigPair_eqb.X [variable, in Complexity.L.TM.CompCode]
sigPair_eqb [section, in Complexity.L.TM.CompCode]
sigPair_fin [instance, in Undecidability.TM.Code.Code]
sigPair_dec [instance, in Undecidability.TM.Code.Code]
sigPair_Y [constructor, in Undecidability.TM.Code.Code]
sigPair_X [constructor, in Undecidability.TM.Code.Code]
sigPos [inductive, in Undecidability.TM.Code.BinNumbers.EncodeBinNumbers]
sigPos_fin [instance, in Undecidability.TM.Code.BinNumbers.EncodeBinNumbers]
sigPos_eq [instance, in Undecidability.TM.Code.BinNumbers.EncodeBinNumbers]
sigPos_xH [constructor, in Undecidability.TM.Code.BinNumbers.EncodeBinNumbers]
sigPos_xO [constructor, in Undecidability.TM.Code.BinNumbers.EncodeBinNumbers]
sigPos_xI [constructor, in Undecidability.TM.Code.BinNumbers.EncodeBinNumbers]
sigPro [definition, in Undecidability.TM.L.Alphabets]
sigPro_fin [definition, in Undecidability.TM.L.Alphabets]
sigSim [abbreviation, in Complexity.TM.PrettyBounds.M2MBounds]
sigSim [abbreviation, in Undecidability.TM.Single.StepTM]
sigState [abbreviation, in Undecidability.TM.Univ.LowLevel]
sigStep [definition, in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
sigSum [section, in Complexity.L.TM.CompCode]
sigSum [inductive, in Undecidability.TM.Code.Code]
sigSum_eqb_spec [lemma, in Complexity.L.TM.CompCode]
sigSum_eqb [definition, in Complexity.L.TM.CompCode]
sigSum_eqb.spec__Y [variable, in Complexity.L.TM.CompCode]
sigSum_eqb.eqb__Y [variable, in Complexity.L.TM.CompCode]
sigSum_eqb.spec__X [variable, in Complexity.L.TM.CompCode]
sigSum_eqb.eqb__X [variable, in Complexity.L.TM.CompCode]
sigSum_eqb.Y [variable, in Complexity.L.TM.CompCode]
sigSum_eqb.X [variable, in Complexity.L.TM.CompCode]
sigSum_eqb [section, in Complexity.L.TM.CompCode]
sigSum_fin [instance, in Undecidability.TM.Code.Code]
sigSum_dec [instance, in Undecidability.TM.Code.Code]
sigSum_inr [constructor, in Undecidability.TM.Code.Code]
sigSum_inl [constructor, in Undecidability.TM.Code.Code]
sigSum_Y [constructor, in Undecidability.TM.Code.Code]
sigSum_X [constructor, in Undecidability.TM.Code.Code]
sigTape [section, in Complexity.L.TM.CompCode]
sigTape [inductive, in Undecidability.TM.Single.EncodeTapes]
sigTape_eqb_spec [lemma, in Complexity.L.TM.CompCode]
sigTape_eqb [definition, in Complexity.L.TM.CompCode]
sigTape_eqb.spec__X [variable, in Complexity.L.TM.CompCode]
sigTape_eqb.eqb__X [variable, in Complexity.L.TM.CompCode]
sigTape_eqb.X [variable, in Complexity.L.TM.CompCode]
sigTape_eqb [section, in Complexity.L.TM.CompCode]
sigTape_fin [instance, in Undecidability.TM.Single.EncodeTapes]
sigTape_eq [instance, in Undecidability.TM.Single.EncodeTapes]
sigU [definition, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
sigUniv [definition, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
sigUniv' [definition, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
sigX:1 [binder, in Complexity.TM.PrettyBounds.UnivBounds]
sigX:1 [binder, in Complexity.TM.Code.DecodeList]
sigX:1 [binder, in Undecidability.TM.Hoare.HoareExamples]
sigX:10 [binder, in Complexity.TM.PrettyBounds.UnivBounds]
sigX:10 [binder, in Undecidability.TM.Code.List.Cons_constant]
sigX:100 [binder, in Undecidability.TM.Code.List.Nth]
sigX:102 [binder, in Complexity.TM.PrettyBounds.BaseCode]
sigX:103 [binder, in Undecidability.TM.Code.Code]
sigX:105 [binder, in Undecidability.TM.Code.List.Nth]
sigX:105 [binder, in Undecidability.TM.Code.Copy]
sigX:107 [binder, in Undecidability.TM.Code.Code]
sigX:110 [binder, in Complexity.TM.PrettyBounds.BaseCode]
sigX:111 [binder, in Undecidability.TM.Code.Copy]
sigX:111 [binder, in Undecidability.TM.Code.Code]
sigX:115 [binder, in Complexity.TM.PrettyBounds.BaseCode]
sigX:115 [binder, in Undecidability.TM.Code.Code]
sigX:117 [binder, in Undecidability.TM.Code.Copy]
sigX:12 [binder, in Undecidability.TM.Univ.LookupAssociativeListTM]
sigX:120 [binder, in Complexity.TM.PrettyBounds.BaseCode]
sigX:122 [binder, in Undecidability.TM.Univ.LookupAssociativeListTM]
sigX:13 [binder, in Undecidability.TM.Hoare.HoareExamples]
sigX:130 [binder, in Complexity.TM.PrettyBounds.BaseCode]
sigX:130 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
sigX:130 [binder, in Undecidability.TM.Code.Code]
sigX:136 [binder, in Complexity.TM.PrettyBounds.BaseCode]
sigX:137 [binder, in Undecidability.TM.Code.Code]
sigX:139 [binder, in Undecidability.TM.Code.Code]
sigX:143 [binder, in Undecidability.TM.Univ.LookupAssociativeListTM]
sigX:15 [binder, in Complexity.TM.PrettyBounds.BaseCode]
sigX:15 [binder, in Undecidability.TM.Hoare.HoareRegister]
sigX:16 [binder, in Undecidability.TM.PrettyBounds.SizeBounds]
sigX:16 [binder, in Complexity.NP.TM.LM_to_mTM]
sigX:160 [binder, in Undecidability.TM.Code.Copy]
sigX:160 [binder, in Undecidability.TM.Code.Code]
sigX:164 [binder, in Undecidability.TM.Code.Copy]
sigX:167 [binder, in Undecidability.TM.Code.Code]
sigX:169 [binder, in Undecidability.TM.Code.Code]
sigX:17 [binder, in Undecidability.TM.Code.List.Nth]
sigX:17 [binder, in Undecidability.TM.Code.WriteValue]
sigX:177 [binder, in Undecidability.TM.Code.Copy]
sigX:19 [binder, in Undecidability.TM.Code.CasePair]
sigX:19 [binder, in Undecidability.TM.Hoare.HoareExamples]
sigX:199 [binder, in Undecidability.TM.Code.Copy]
sigX:2 [binder, in Complexity.TM.PrettyBounds.BaseCode]
sigX:2 [binder, in Undecidability.TM.Code.WriteValue]
sigX:21 [binder, in Complexity.TM.PrettyBounds.UnivBounds]
sigX:21 [binder, in Undecidability.TM.Univ.LookupAssociativeListTM]
sigX:210 [binder, in Undecidability.TM.Code.Copy]
sigX:216 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
sigX:216 [binder, in Undecidability.TM.Code.Copy]
sigX:22 [binder, in Undecidability.TM.Code.List.Length]
sigX:221 [binder, in Undecidability.TM.Code.Copy]
sigX:228 [binder, in Undecidability.TM.Code.Copy]
sigX:234 [binder, in Undecidability.TM.Code.Copy]
sigX:24 [binder, in Undecidability.TM.Code.CasePair]
sigX:241 [binder, in Undecidability.TM.Code.Copy]
sigX:244 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
sigX:247 [binder, in Undecidability.TM.Code.Copy]
sigX:254 [binder, in Undecidability.TM.Code.Copy]
sigX:26 [binder, in Undecidability.TM.Code.CaseList]
sigX:26 [binder, in Undecidability.TM.Hoare.HoareExamples]
sigX:26 [binder, in Undecidability.TM.Code.List.App]
sigX:260 [binder, in Undecidability.TM.Code.Copy]
sigX:267 [binder, in Undecidability.TM.Code.Copy]
sigX:273 [binder, in Undecidability.TM.Code.Copy]
sigX:280 [binder, in Undecidability.TM.Code.Copy]
sigX:286 [binder, in Undecidability.TM.Code.Copy]
sigX:293 [binder, in Undecidability.TM.Code.Copy]
sigX:299 [binder, in Undecidability.TM.Code.Copy]
sigX:306 [binder, in Undecidability.TM.Code.Copy]
sigX:31 [binder, in Undecidability.TM.Code.CaseList]
sigX:31 [binder, in Complexity.TM.PrettyBounds.UnivBounds]
sigX:31 [binder, in Undecidability.TM.Code.List.Length]
sigX:31 [binder, in Undecidability.TM.Code.CompareValue]
sigX:31 [binder, in Undecidability.TM.Univ.LookupAssociativeListTM]
sigX:312 [binder, in Undecidability.TM.Code.Copy]
sigX:319 [binder, in Undecidability.TM.Code.Copy]
sigX:32 [binder, in Complexity.TM.PrettyBounds.BaseCode]
sigX:32 [binder, in Undecidability.TM.Hoare.HoareExamples]
sigX:326 [binder, in Undecidability.TM.Code.Copy]
sigX:333 [binder, in Undecidability.TM.Code.Copy]
sigX:34 [binder, in Undecidability.TM.Code.CasePair]
sigX:345 [binder, in Undecidability.TM.Code.Copy]
sigX:356 [binder, in Undecidability.TM.Code.Copy]
sigX:36 [binder, in Undecidability.TM.Code.List.Nth]
sigX:368 [binder, in Undecidability.TM.Code.Copy]
sigX:37 [binder, in Complexity.TM.PrettyBounds.BaseCode]
sigX:37 [binder, in Undecidability.TM.Code.List.App]
sigX:379 [binder, in Undecidability.TM.Code.Copy]
sigX:387 [binder, in Undecidability.TM.Code.Copy]
sigX:39 [binder, in Undecidability.TM.Hoare.HoareExamples]
sigX:394 [binder, in Undecidability.TM.Code.Copy]
sigX:4 [binder, in Undecidability.TM.Hoare.HoareRegister]
sigX:40 [binder, in Undecidability.TM.Univ.LookupAssociativeListTM]
sigX:402 [binder, in Undecidability.TM.Code.Copy]
sigX:41 [binder, in Complexity.TM.PrettyBounds.UnivBounds]
sigX:41 [binder, in Undecidability.TM.Code.CasePair]
sigX:42 [binder, in Complexity.TM.PrettyBounds.BaseCode]
sigX:44 [binder, in Undecidability.TM.Code.List.Nth]
sigX:44 [binder, in Undecidability.TM.Code.List.Length]
sigX:46 [binder, in Undecidability.TM.Hoare.HoareExamples]
sigX:47 [binder, in Complexity.TM.PrettyBounds.BaseCode]
sigX:5 [binder, in Complexity.TM.PrettyBounds.UnivBounds]
sigX:50 [binder, in Complexity.TM.PrettyBounds.UnivBounds]
sigX:52 [binder, in Undecidability.TM.Code.Code]
sigX:52 [binder, in Undecidability.TM.Code.CasePair]
sigX:54 [binder, in Undecidability.TM.Code.List.Length]
sigX:54 [binder, in Undecidability.TM.Univ.LookupAssociativeListTM]
sigX:56 [binder, in Complexity.TM.PrettyBounds.BaseCode]
sigX:57 [binder, in Undecidability.TM.Code.CaseList]
sigX:58 [binder, in Undecidability.TM.Code.Code]
sigX:58 [binder, in Undecidability.TM.Hoare.HoareExamples]
sigX:59 [binder, in Undecidability.TM.Code.CasePair]
sigX:6 [binder, in Undecidability.TM.Hoare.HoareExamples]
sigX:60 [binder, in Complexity.TM.PrettyBounds.UnivBounds]
sigX:61 [binder, in Undecidability.TM.Code.CaseList]
sigX:62 [binder, in Undecidability.TM.Code.Code]
sigX:64 [binder, in Undecidability.TM.Univ.LookupAssociativeListTM]
sigX:65 [binder, in Undecidability.TM.Code.List.Length]
sigX:66 [binder, in Undecidability.TM.Code.Code]
sigX:67 [binder, in Complexity.TM.PrettyBounds.BaseCodeSpace]
sigX:68 [binder, in Undecidability.TM.Code.CasePair]
sigX:69 [binder, in Complexity.TM.PrettyBounds.UnivBounds]
sigX:69 [binder, in Undecidability.TM.Hoare.HoareExamples]
sigX:7 [binder, in Undecidability.TM.Code.List.Nth]
sigX:7 [binder, in Undecidability.TM.Code.List.Length]
sigX:70 [binder, in Undecidability.TM.Code.Code]
sigX:73 [binder, in Complexity.TM.PrettyBounds.BaseCodeSpace]
sigX:78 [binder, in Complexity.TM.PrettyBounds.UnivBounds]
sigX:78 [binder, in Complexity.TM.PrettyBounds.BaseCodeSpace]
sigX:8 [binder, in Undecidability.TM.Hoare.HoareRegister]
sigX:82 [binder, in Undecidability.TM.Code.CaseList]
sigX:83 [binder, in Complexity.TM.PrettyBounds.BaseCodeSpace]
sigX:87 [binder, in Complexity.TM.PrettyBounds.UnivBounds]
sigX:9 [binder, in Complexity.TM.PrettyBounds.BaseCode]
sigX:9 [binder, in Undecidability.TM.Code.WriteValue]
sigX:93 [binder, in Undecidability.TM.Code.CaseList]
sigX:97 [binder, in Undecidability.TM.Code.Copy]
sigX:97 [binder, in Undecidability.TM.Code.Code]
sigY:103 [binder, in Complexity.TM.PrettyBounds.BaseCode]
sigY:104 [binder, in Undecidability.TM.Code.Code]
sigY:108 [binder, in Undecidability.TM.Code.Code]
sigY:11 [binder, in Complexity.TM.PrettyBounds.UnivBounds]
sigY:112 [binder, in Undecidability.TM.Code.Code]
sigY:116 [binder, in Undecidability.TM.Code.Code]
sigY:123 [binder, in Undecidability.TM.Univ.LookupAssociativeListTM]
sigY:13 [binder, in Undecidability.TM.Univ.LookupAssociativeListTM]
sigY:144 [binder, in Undecidability.TM.Univ.LookupAssociativeListTM]
sigY:165 [binder, in Undecidability.TM.Code.Copy]
sigY:178 [binder, in Undecidability.TM.Code.Copy]
sigY:22 [binder, in Complexity.TM.PrettyBounds.UnivBounds]
sigY:22 [binder, in Undecidability.TM.Univ.LookupAssociativeListTM]
sigY:32 [binder, in Complexity.TM.PrettyBounds.UnivBounds]
sigY:32 [binder, in Undecidability.TM.Univ.LookupAssociativeListTM]
sigY:327 [binder, in Undecidability.TM.Code.Copy]
sigY:334 [binder, in Undecidability.TM.Code.Copy]
sigY:346 [binder, in Undecidability.TM.Code.Copy]
sigY:357 [binder, in Undecidability.TM.Code.Copy]
sigY:369 [binder, in Undecidability.TM.Code.Copy]
sigY:40 [binder, in Undecidability.TM.Hoare.HoareExamples]
sigY:41 [binder, in Undecidability.TM.Univ.LookupAssociativeListTM]
sigY:42 [binder, in Complexity.TM.PrettyBounds.UnivBounds]
sigY:47 [binder, in Undecidability.TM.Hoare.HoareExamples]
sigY:50 [binder, in Complexity.TM.PrettyBounds.BaseCode]
sigY:51 [binder, in Complexity.TM.PrettyBounds.UnivBounds]
sigY:53 [binder, in Undecidability.TM.Code.Code]
sigY:55 [binder, in Undecidability.TM.Univ.LookupAssociativeListTM]
sigY:59 [binder, in Undecidability.TM.Code.Code]
sigY:59 [binder, in Undecidability.TM.Hoare.HoareExamples]
sigY:61 [binder, in Complexity.TM.PrettyBounds.BaseCode]
sigY:61 [binder, in Complexity.TM.PrettyBounds.UnivBounds]
sigY:63 [binder, in Undecidability.TM.Code.Code]
sigY:65 [binder, in Undecidability.TM.Univ.LookupAssociativeListTM]
sigY:67 [binder, in Undecidability.TM.Code.Code]
sigY:70 [binder, in Complexity.TM.PrettyBounds.UnivBounds]
sigY:70 [binder, in Undecidability.TM.Hoare.HoareExamples]
sigY:71 [binder, in Undecidability.TM.Code.Code]
sigY:79 [binder, in Complexity.TM.PrettyBounds.UnivBounds]
sigY:85 [binder, in Complexity.TM.PrettyBounds.BaseCodeSpace]
sigY:88 [binder, in Complexity.TM.PrettyBounds.UnivBounds]
sigY:98 [binder, in Undecidability.TM.Code.Code]
sig_TM_le [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
sig':105 [binder, in Complexity.L.TM.TMunflatten]
sig':11 [binder, in Undecidability.TM.PrettyBounds.SizeBounds]
sig':11 [binder, in Undecidability.TM.Compound.WriteString]
sig':13 [binder, in Undecidability.TM.PrettyBounds.SizeBounds]
sig':15 [binder, in Undecidability.TM.Compound.WriteString]
sig':17 [binder, in Complexity.TM.Compound.MoveToSymbol_niceSpec]
sig':20 [binder, in Complexity.L.TM.TMflatFun]
sig':212 [binder, in Complexity.L.TM.TMunflatten]
sig':22 [binder, in Complexity.TM.Compound.MoveToSymbol_niceSpec]
sig':36 [binder, in Complexity.L.TM.TMflat]
sig':39 [binder, in Complexity.TM.Single.DecodeTapes]
sig':47 [binder, in Complexity.NP.TM.M_multi2mono]
sig':50 [binder, in Complexity.L.TM.TMflatFun]
sig':6 [binder, in Undecidability.TM.Compound.WriteString]
sig':65 [binder, in Undecidability.TM.Single.EncodeTapes]
sig':68 [binder, in Undecidability.TM.Single.EncodeTapes]
sig':7 [binder, in Complexity.TM.Compound.MoveToSymbol_niceSpec]
sig':71 [binder, in Complexity.NP.TM.M_multi2mono]
sig':8 [binder, in Complexity.L.TM.TMflatFun]
sig:1 [binder, in Complexity.NP.SAT.CookLevin]
sig:1 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
sig:1 [binder, in Complexity.TM.Code.Decode]
sig:1 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
sig:1 [binder, in Undecidability.TM.Hoare.HoareLegacy]
sig:1 [binder, in Complexity.NP.TM.TMGenNP]
sig:1 [binder, in Undecidability.TM.Code.CodeTM]
sig:1 [binder, in Undecidability.TM.Code.WriteValue]
sig:1 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.SingleTMGenNP]
sig:1 [binder, in Complexity.NP.TM.M_multi2mono]
sig:1 [binder, in Complexity.L.TM.TMflatFun]
sig:1 [binder, in Complexity.TM.Single.DecodeTapes]
sig:1 [binder, in Undecidability.TM.Code.Code]
sig:1 [binder, in Undecidability.L.TM.TMinL.TMinL_extract]
sig:1 [binder, in Undecidability.TM.Hoare.HoareLogic]
sig:1 [binder, in Complexity.TM.Single.DecodeTape]
sig:1 [binder, in Undecidability.TM.Hoare.HoareCombinators]
sig:1 [binder, in Undecidability.TM.Hoare.HoareStdLib]
sig:1 [binder, in Complexity.NP.TM.TMGenNP_fixed_mTM]
sig:1 [binder, in Undecidability.TM.Single.EncodeTapes]
sig:10 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds_Loop]
sig:10 [binder, in Undecidability.TM.Code.CodeTM]
sig:10 [binder, in Complexity.L.TM.TMunflatten]
sig:10 [binder, in Undecidability.TM.Single.EncodeTapes]
sig:100 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
sig:103 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
sig:1033 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
sig:1038 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
sig:104 [binder, in Undecidability.TM.Hoare.HoareRegister]
sig:105 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
sig:1058 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
sig:1063 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
sig:1070 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
sig:1074 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
sig:1078 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
sig:108 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
sig:108 [binder, in Undecidability.TM.Hoare.HoareLogic]
sig:1083 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
sig:1087 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
sig:1091 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
sig:1095 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
sig:1099 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
sig:11 [binder, in Complexity.L.TM.TMflatFun]
sig:11 [binder, in Undecidability.TM.Hoare.HoareCombinators]
sig:110 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
sig:110 [binder, in Complexity.L.TM.TMunflatten]
sig:1104 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
sig:111 [binder, in Undecidability.TM.Single.StepTM]
sig:112 [binder, in Undecidability.TM.Hoare.HoareRegister]
sig:113 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
sig:114 [binder, in Undecidability.TM.Hoare.HoareCombinators]
sig:117 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
sig:118 [binder, in Undecidability.TM.Hoare.HoareLogic]
sig:119 [binder, in Undecidability.TM.Hoare.HoareRegister]
sig:12 [binder, in Undecidability.TM.Hoare.HoareLogic]
sig:12 [binder, in Undecidability.TM.Hoare.HoareExamples]
sig:123 [binder, in Undecidability.TM.Hoare.HoareCombinators]
sig:125 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
sig:125 [binder, in Complexity.L.TM.CompCode]
sig:126 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
sig:129 [binder, in Undecidability.TM.Hoare.HoareLogic]
sig:13 [binder, in Complexity.NP.TM.TMGenNP]
sig:13 [binder, in Undecidability.TM.Code.CodeTM]
sig:13 [binder, in Undecidability.TM.Single.EncodeTapes]
sig:133 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
sig:133 [binder, in Undecidability.TM.Hoare.HoareCombinators]
sig:134 [binder, in Undecidability.TM.Code.Code]
sig:136 [binder, in Undecidability.TM.Code.Copy]
sig:138 [binder, in Undecidability.TM.Hoare.HoareLogic]
sig:14 [binder, in Undecidability.TM.Hoare.HoareStdLib]
sig:140 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
sig:142 [binder, in Undecidability.TM.Hoare.HoareCombinators]
sig:144 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
sig:145 [binder, in Undecidability.TM.Code.Copy]
sig:148 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
sig:149 [binder, in Undecidability.TM.Hoare.HoareLogic]
sig:15 [binder, in Complexity.L.TM.TMunflatten]
sig:15 [binder, in Complexity.L.TM.TMflatFun]
sig:15 [binder, in Complexity.TM.Single.DecodeTape]
sig:15 [binder, in Complexity.NP.TM.LM_to_mTM]
sig:150 [binder, in Undecidability.TM.Hoare.HoareRegister]
sig:156 [binder, in Undecidability.TM.Hoare.HoareLogic]
sig:157 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
sig:158 [binder, in Complexity.L.TM.TMunflatten]
sig:16 [binder, in Undecidability.TM.Code.WriteValue]
sig:16 [binder, in Undecidability.TM.Single.EncodeTapes]
sig:161 [binder, in Undecidability.TM.Hoare.HoareLogic]
sig:161 [binder, in Undecidability.TM.Hoare.HoareCombinators]
sig:164 [binder, in Undecidability.TM.Code.Code]
sig:166 [binder, in Undecidability.TM.Hoare.HoareLogic]
sig:167 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
sig:168 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
sig:168 [binder, in Undecidability.TM.Hoare.HoareLogic]
sig:17 [binder, in Undecidability.TM.Hoare.HoareLegacy]
sig:17 [binder, in Undecidability.TM.Code.CodeTM]
sig:170 [binder, in Complexity.TM.PrettyBounds.UnivBounds]
sig:170 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
sig:170 [binder, in Complexity.L.TM.TMunflatten]
sig:172 [binder, in Undecidability.TM.Hoare.HoareRegister]
sig:172 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
sig:173 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
sig:174 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
sig:174 [binder, in Undecidability.TM.Hoare.HoareCombinators]
sig:175 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
sig:176 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
sig:177 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
sig:178 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
sig:18 [binder, in Undecidability.L.TM.TMinL]
sig:18 [binder, in Undecidability.TM.Hoare.HoareExamples]
sig:183 [binder, in Undecidability.TM.Hoare.HoareLogic]
sig:186 [binder, in Undecidability.TM.Hoare.HoareLogic]
sig:186 [binder, in Undecidability.TM.Hoare.HoareCombinators]
sig:188 [binder, in Undecidability.TM.Hoare.HoareRegister]
sig:19 [binder, in Complexity.L.TM.TMunflatten]
sig:19 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.SingleTMGenNP]
sig:19 [binder, in Undecidability.TM.Single.EncodeTapes]
sig:192 [binder, in Undecidability.TM.Util.TM_facts]
sig:193 [binder, in Undecidability.TM.Hoare.HoareLogic]
sig:195 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
sig:195 [binder, in Complexity.L.TM.TMunflatten]
sig:195 [binder, in Undecidability.TM.Hoare.HoareCombinators]
sig:196 [binder, in Undecidability.TM.Hoare.HoareRegister]
sig:199 [binder, in Complexity.L.TM.TMunflatten]
sig:199 [binder, in Undecidability.TM.Util.TM_facts]
sig:20 [binder, in Undecidability.TM.Hoare.HoareLogic]
sig:20 [binder, in Complexity.NP.TM.TMGenNP_fixed_mTM]
sig:201 [binder, in Undecidability.TM.Hoare.HoareLogic]
sig:202 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
sig:203 [binder, in Undecidability.TM.Hoare.HoareRegister]
sig:205 [binder, in Complexity.L.TM.TMunflatten]
sig:205 [binder, in Undecidability.TM.Util.TM_facts]
sig:208 [binder, in Complexity.L.TM.TMflatComp]
sig:208 [binder, in Complexity.L.TM.TMunflatten]
sig:208 [binder, in Undecidability.TM.Util.TM_facts]
sig:209 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
sig:21 [binder, in Complexity.TM.Single.EncodeTapesInvariants]
sig:21 [binder, in Complexity.NP.TM.TMGenNP]
sig:21 [binder, in Complexity.NP.TM.LM_to_mTM]
sig:211 [binder, in Complexity.L.TM.TMflatComp]
sig:211 [binder, in Complexity.L.TM.TMunflatten]
sig:211 [binder, in Undecidability.TM.Hoare.HoareRegister]
sig:211 [binder, in Undecidability.TM.Hoare.HoareCombinators]
sig:212 [binder, in Undecidability.TM.Hoare.HoareLogic]
sig:213 [binder, in Complexity.L.TM.TMflatComp]
sig:215 [binder, in Complexity.L.TM.TMflatComp]
sig:215 [binder, in Complexity.L.TM.TMunflatten]
sig:215 [binder, in Undecidability.TM.Hoare.HoareLogic]
sig:217 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
sig:217 [binder, in Complexity.L.TM.TMflatComp]
sig:219 [binder, in Complexity.L.TM.TMunflatten]
sig:22 [binder, in Undecidability.TM.Code.CodeTM]
sig:22 [binder, in Undecidability.TM.Hoare.HoareCombinators]
sig:22 [binder, in Undecidability.TM.Single.EncodeTapes]
sig:220 [binder, in Undecidability.TM.Code.Copy]
sig:222 [binder, in Complexity.L.TM.TMunflatten]
sig:224 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
sig:224 [binder, in Undecidability.TM.Hoare.HoareLogic]
sig:225 [binder, in Complexity.L.TM.TMflatComp]
sig:226 [binder, in Complexity.L.TM.TMunflatten]
sig:227 [binder, in Undecidability.TM.Code.Copy]
sig:229 [binder, in Complexity.L.TM.TMunflatten]
sig:229 [binder, in Undecidability.TM.Hoare.HoareCombinators]
sig:23 [binder, in Complexity.NP.TM.TMGenNP_fixed_mTM]
sig:230 [binder, in Complexity.L.TM.TMflatComp]
sig:230 [binder, in Undecidability.TM.Hoare.HoareRegister]
sig:232 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
sig:233 [binder, in Undecidability.TM.Code.Copy]
sig:233 [binder, in Undecidability.TM.Hoare.HoareLogic]
sig:234 [binder, in Complexity.L.TM.TMflatComp]
sig:240 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
sig:240 [binder, in Undecidability.TM.Code.Copy]
sig:242 [binder, in Undecidability.TM.Hoare.HoareCombinators]
sig:243 [binder, in Undecidability.TM.Hoare.HoareLogic]
sig:245 [binder, in Complexity.L.TM.TMflatComp]
sig:246 [binder, in Undecidability.TM.Code.Copy]
sig:247 [binder, in Complexity.L.TM.TMflatComp]
sig:247 [binder, in Undecidability.TM.Hoare.HoareRegister]
sig:248 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
sig:25 [binder, in Undecidability.TM.Hoare.HoareExamples]
sig:25 [binder, in Undecidability.TM.Single.EncodeTapes]
sig:250 [binder, in Complexity.L.TM.TMflatComp]
sig:251 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
sig:253 [binder, in Undecidability.TM.Code.Copy]
sig:254 [binder, in Undecidability.TM.Hoare.HoareLogic]
sig:254 [binder, in Undecidability.TM.Hoare.HoareCombinators]
sig:256 [binder, in Complexity.L.TM.TMflatComp]
sig:258 [binder, in Complexity.L.TM.TMflatComp]
sig:259 [binder, in Undecidability.TM.Hoare.HoareRegister]
sig:259 [binder, in Undecidability.TM.Code.Copy]
sig:26 [binder, in Undecidability.TM.Code.CodeTM]
sig:26 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
sig:26 [binder, in Undecidability.TM.Hoare.HoareLogic]
sig:260 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
sig:260 [binder, in Complexity.L.TM.TMflatComp]
sig:262 [binder, in Complexity.L.TM.TMflatComp]
sig:264 [binder, in Undecidability.TM.Hoare.HoareLogic]
sig:264 [binder, in Undecidability.TM.Hoare.HoareCombinators]
sig:266 [binder, in Undecidability.TM.Code.Copy]
sig:267 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
sig:268 [binder, in Complexity.L.TM.TMflatComp]
sig:271 [binder, in Complexity.L.TM.TMflatComp]
sig:271 [binder, in Undecidability.TM.Util.TM_facts]
sig:272 [binder, in Undecidability.TM.Code.Copy]
sig:274 [binder, in Complexity.L.TM.TMflatComp]
sig:274 [binder, in Undecidability.TM.Hoare.HoareRegister]
sig:275 [binder, in Undecidability.TM.Hoare.HoareLogic]
sig:277 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
sig:277 [binder, in Complexity.L.TM.TMflatComp]
sig:277 [binder, in Undecidability.TM.Hoare.HoareCombinators]
sig:279 [binder, in Undecidability.TM.Code.Copy]
sig:28 [binder, in Complexity.NP.TM.TMGenNP]
sig:28 [binder, in Undecidability.TM.Code.CodeTM]
sig:28 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
sig:28 [binder, in Undecidability.TM.Code.WriteValue]
sig:28 [binder, in Undecidability.TM.Single.EncodeTapes]
sig:282 [binder, in Undecidability.TM.Hoare.HoareLogic]
sig:283 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
sig:285 [binder, in Undecidability.TM.Code.Copy]
sig:286 [binder, in Undecidability.TM.Util.TM_facts]
sig:287 [binder, in Undecidability.TM.Hoare.HoareRegister]
sig:289 [binder, in Undecidability.TM.Hoare.HoareLogic]
sig:29 [binder, in Undecidability.TM.Single.EncodeTapes]
sig:290 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
sig:292 [binder, in Undecidability.TM.Code.Copy]
sig:293 [binder, in Undecidability.TM.Hoare.HoareCombinators]
sig:294 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
sig:297 [binder, in Undecidability.TM.Hoare.HoareLogic]
sig:298 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
sig:298 [binder, in Undecidability.TM.Code.Copy]
sig:3 [binder, in Undecidability.TM.PrettyBounds.SizeBounds]
sig:3 [binder, in Complexity.L.TM.TMflatFun]
sig:3 [binder, in Complexity.TM.Code.DecodeBool]
sig:3 [binder, in Undecidability.TM.Hoare.HoareLogic]
sig:30 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
sig:305 [binder, in Undecidability.TM.Hoare.HoareRegister]
sig:305 [binder, in Undecidability.TM.Code.Copy]
sig:305 [binder, in Undecidability.TM.Hoare.HoareLogic]
sig:306 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
sig:31 [binder, in Undecidability.TM.Code.CodeTM]
sig:31 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
sig:31 [binder, in Undecidability.TM.Hoare.HoareExamples]
sig:310 [binder, in Undecidability.TM.Hoare.HoareCombinators]
sig:311 [binder, in Undecidability.TM.Hoare.HoareRegister]
sig:311 [binder, in Undecidability.TM.Code.Copy]
sig:314 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
sig:314 [binder, in Undecidability.TM.Hoare.HoareLogic]
sig:318 [binder, in Undecidability.TM.Hoare.HoareRegister]
sig:318 [binder, in Undecidability.TM.Code.Copy]
sig:32 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.SingleTMGenNP]
sig:32 [binder, in Undecidability.TM.Hoare.HoareLogic]
sig:32 [binder, in Undecidability.TM.Hoare.HoareCombinators]
sig:32 [binder, in Undecidability.TM.Single.EncodeTapes]
sig:321 [binder, in Undecidability.TM.Hoare.HoareCombinators]
sig:323 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
sig:324 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
sig:325 [binder, in Undecidability.TM.Hoare.HoareLogic]
sig:326 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
sig:328 [binder, in Undecidability.TM.Hoare.HoareRegister]
sig:33 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
sig:332 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
sig:332 [binder, in Undecidability.TM.Code.Copy]
sig:337 [binder, in Undecidability.TM.Hoare.HoareLogic]
sig:339 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
sig:34 [binder, in Complexity.TM.Single.EncodeTapesInvariants]
sig:34 [binder, in Undecidability.TM.Code.CodeTM]
sig:34 [binder, in Undecidability.TM.Compound.WriteString]
sig:344 [binder, in Undecidability.TM.Code.Copy]
sig:346 [binder, in Undecidability.TM.Hoare.HoareRegister]
sig:348 [binder, in Undecidability.TM.Hoare.HoareLogic]
sig:35 [binder, in Undecidability.TM.Single.EncodeTapes]
sig:355 [binder, in Undecidability.TM.Code.Copy]
sig:357 [binder, in Undecidability.TM.Hoare.HoareRegister]
sig:36 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
sig:36 [binder, in Undecidability.TM.Code.CodeTM]
sig:36 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.SingleTMGenNP]
sig:36 [binder, in Undecidability.L.TM.TMEncoding]
sig:361 [binder, in Undecidability.TM.Hoare.HoareLogic]
sig:3611 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
sig:3616 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
sig:362 [binder, in Undecidability.TM.Hoare.HoareCombinators]
sig:363 [binder, in Undecidability.TM.Hoare.HoareRegister]
sig:367 [binder, in Undecidability.TM.Code.Copy]
sig:369 [binder, in Undecidability.TM.Hoare.HoareLogic]
sig:37 [binder, in Complexity.L.TM.TMflatFun]
sig:37 [binder, in Undecidability.TM.Compound.WriteString]
sig:371 [binder, in Undecidability.TM.Util.TM_facts]
sig:374 [binder, in Undecidability.TM.Util.TM_facts]
sig:377 [binder, in Undecidability.TM.Hoare.HoareRegister]
sig:377 [binder, in Undecidability.TM.Hoare.HoareLogic]
sig:378 [binder, in Undecidability.TM.Code.Copy]
sig:379 [binder, in Undecidability.TM.Hoare.HoareCombinators]
sig:38 [binder, in Complexity.TM.Single.EncodeTapesInvariants]
sig:38 [binder, in Complexity.NP.TM.TMGenNP]
sig:38 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
sig:38 [binder, in Complexity.NP.TM.M_multi2mono]
sig:38 [binder, in Undecidability.TM.Hoare.HoareLogic]
sig:381 [binder, in Undecidability.TM.Util.TM_facts]
sig:386 [binder, in Undecidability.TM.Code.Copy]
sig:386 [binder, in Undecidability.TM.Util.TM_facts]
sig:386 [binder, in Undecidability.TM.Hoare.HoareLogic]
sig:39 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
sig:39 [binder, in Undecidability.L.TM.TMEncoding]
sig:392 [binder, in Undecidability.TM.Hoare.HoareRegister]
sig:393 [binder, in Undecidability.TM.Code.Copy]
sig:395 [binder, in Undecidability.TM.Hoare.HoareLogic]
sig:4 [binder, in Complexity.TM.Single.EncodeTapesInvariants]
sig:4 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.SingleTMGenNP]
sig:4 [binder, in Undecidability.TM.Hoare.HoareCombinators]
Sig:4 [binder, in Complexity.NP.SAT.CookLevin.Reductions.CC_to_BinaryCC]
sig:40 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
sig:40 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TM_single]
sig:40 [binder, in Undecidability.TM.Compound.WriteString]
sig:401 [binder, in Undecidability.TM.Code.Copy]
sig:41 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
sig:41 [binder, in Complexity.L.TM.TMflatComp]
sig:410 [binder, in Undecidability.TM.Hoare.HoareRegister]
sig:42 [binder, in Undecidability.TM.Univ.LowLevel]
sig:42 [binder, in Complexity.L.TM.TMunflatten]
sig:424 [binder, in Undecidability.TM.Hoare.HoareCombinators]
sig:43 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
sig:43 [binder, in Undecidability.TM.Compound.WriteString]
sig:432 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
sig:44 [binder, in Undecidability.TM.Hoare.HoareCombinators]
sig:443 [binder, in Undecidability.TM.Hoare.HoareCombinators]
sig:447 [binder, in Undecidability.TM.Hoare.HoareRegister]
sig:45 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
sig:45 [binder, in Complexity.L.TM.TMunflatten]
sig:45 [binder, in Undecidability.TM.Hoare.HoareExamples]
sig:452 [binder, in Undecidability.TM.Hoare.HoareRegister]
sig:46 [binder, in Complexity.L.TM.TMflatFun]
sig:47 [binder, in Undecidability.TM.Hoare.HoareLogic]
sig:48 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
sig:48 [binder, in Complexity.L.TM.TMflat]
sig:5 [binder, in Undecidability.TM.Code.CodeTM]
sig:5 [binder, in Undecidability.TM.Code.Code]
sig:5 [binder, in Undecidability.TM.Hoare.HoareExamples]
sig:50 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
sig:51 [binder, in Complexity.NP.TM.LM_to_mTM]
sig:53 [binder, in Complexity.L.TM.TMunflatten]
sig:53 [binder, in Complexity.L.TM.TMflat]
sig:54 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
sig:54 [binder, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
sig:54 [binder, in Undecidability.TM.Hoare.HoareLogic]
sig:55 [binder, in Undecidability.TM.Hoare.HoareCombinators]
sig:556 [binder, in Complexity.NP.TM.LM_to_mTM]
sig:56 [binder, in Complexity.TM.Code.Decode]
sig:57 [binder, in Undecidability.TM.Hoare.HoareExamples]
sig:58 [binder, in Complexity.L.TM.TMflat]
sig:589 [binder, in Complexity.NP.TM.LM_to_mTM]
sig:59 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
sig:59 [binder, in Complexity.L.TM.TMflatFun]
sig:593 [binder, in Complexity.NP.TM.LM_to_mTM]
sig:6 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds_Loop]
sig:6 [binder, in Undecidability.TM.PrettyBounds.SizeBounds]
sig:6 [binder, in Complexity.TM.Single.DecodeTapes]
sig:6 [binder, in Complexity.TM.Single.DecodeTape]
Sig:6 [binder, in Complexity.NP.SAT.CookLevin.Reductions.CC_to_BinaryCC]
sig:6 [binder, in Undecidability.TM.Hoare.HoareStdLib]
sig:61 [binder, in Undecidability.TM.Hoare.HoareLogic]
sig:64 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
sig:66 [binder, in Complexity.L.TM.TMflat]
sig:66 [binder, in Complexity.L.TM.TMflatFun]
sig:66 [binder, in Undecidability.TM.Hoare.HoareCombinators]
sig:68 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
sig:68 [binder, in Undecidability.TM.Hoare.HoareLogic]
sig:68 [binder, in Undecidability.TM.Hoare.HoareExamples]
sig:69 [binder, in Complexity.L.TM.TMflatten]
sig:7 [binder, in Complexity.L.TM.TMunflatten]
sig:7 [binder, in Complexity.L.TM.TMflatFun]
sig:7 [binder, in Undecidability.TM.Hoare.HoareCombinators]
sig:70 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
sig:71 [binder, in Complexity.L.TM.TMunflatten]
sig:72 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
sig:72 [binder, in Complexity.L.TM.TMflatten]
sig:73 [binder, in Undecidability.TM.Hoare.HoareLogic]
sig:75 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
sig:76 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
sig:76 [binder, in Undecidability.TM.Hoare.HoareCombinators]
sig:78 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
sig:79 [binder, in Complexity.L.TM.TMflatFun]
sig:79 [binder, in Undecidability.TM.Hoare.HoareLogic]
sig:8 [binder, in Complexity.TM.Code.Decode]
sig:8 [binder, in Undecidability.TM.Code.WriteValue]
Sig:8 [binder, in Complexity.NP.SAT.CookLevin.Reductions.CC_to_BinaryCC]
sig:8 [binder, in Undecidability.TM.Single.EncodeTapes]
sig:84 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
sig:84 [binder, in Undecidability.TM.Hoare.HoareLogic]
sig:86 [binder, in Complexity.L.TM.TMflatComp]
sig:86 [binder, in Undecidability.TM.Hoare.HoareRegister]
sig:88 [binder, in Complexity.L.TM.TMflatComp]
sig:88 [binder, in Undecidability.TM.Hoare.HoareCombinators]
sig:89 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
sig:9 [binder, in Complexity.L.TM.CompCode]
sig:9 [binder, in Complexity.L.TM.TMflat]
sig:9 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.SingleTMGenNP]
sig:9 [binder, in Undecidability.TM.Single.EncodeTapes]
sig:91 [binder, in Undecidability.TM.Hoare.HoareRegister]
sig:93 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
sig:94 [binder, in Undecidability.TM.Hoare.HoareLogic]
sig:95 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
sig:98 [binder, in Complexity.L.TM.TMflatComp]
sig:98 [binder, in Complexity.L.TM.TMunflatten]
sig:98 [binder, in Undecidability.TM.Hoare.HoareRegister]
sig:99 [binder, in Undecidability.TM.Hoare.HoareCombinators]
simRules [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
simulation [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
sincl [definition, in Undecidability.Shared.Libs.DLW.Wf.wf_incl]
sincl [section, in Undecidability.Shared.Libs.DLW.Wf.wf_incl]
sincl_chain_bounded [lemma, in Undecidability.Shared.Libs.DLW.Wf.wf_incl]
sincl_chain [lemma, in Undecidability.Shared.Libs.DLW.Wf.wf_incl]
sincl.X [variable, in Undecidability.Shared.Libs.DLW.Wf.wf_incl]
sinc_injective [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
sinc_decidable [lemma, in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
sinc_decidable.decidable [variable, in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
sinc_decidable.unbounded [variable, in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
sinc_decidable.f_ge_n [variable, in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
sinc_decidable.f_smono [variable, in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
sinc_decidable.f_mono [variable, in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
sinc_decidable.HP [variable, in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
sinc_decidable.Hf [variable, in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
sinc_decidable.f [variable, in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
sinc_decidable.P [variable, in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
sinc_decidable [section, in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
SingleTMGenNP [definition, in Complexity.NP.SAT.CookLevin.Subproblems.SingleTMGenNP]
SingleTMGenNP [library]
SingleTMGenNP_to_TCC [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
SingleTMGenNP_to_PTCC [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
SingleTMGenNP_to_TCC [library]
singleton_incl [lemma, in Complexity.Libs.CookPrelim.Tactics]
size [definition, in Undecidability.L.Util.L_facts]
size [definition, in Undecidability.TM.Code.Code]
Size [library]
SizeAnalysisStep [library]
SizeAnalysisUnfoldClos [library]
SizeBounds [library]
sizeC [definition, in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
sizeGt1':67 [binder, in Complexity.TM.PrettyBounds.BaseCode]
sizeGt1:60 [binder, in Complexity.TM.PrettyBounds.BaseCode]
sizeH [definition, in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
sizeHE [definition, in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
sizeM:35 [binder, in Complexity.NP.TM.M_LM2TM]
sizeM:38 [binder, in Complexity.NP.TM.M_LM2TM]
sizeOfmTapes [definition, in Undecidability.TM.Util.TM_facts]
sizeOfmTapesFlat [definition, in Complexity.L.TM.TMflatFun]
sizeOfmTapesFlat_timeBySize [lemma, in Complexity.L.TM.TMflatComp]
sizeOfmTapesFlat_timeSize [definition, in Complexity.L.TM.TMflatComp]
sizeOfmTapesFlat_time [definition, in Complexity.L.TM.TMflatComp]
sizeOfmTapesFlat_eq [lemma, in Complexity.L.TM.TMflatFun]
sizeOfmTapes_upperBound [lemma, in Undecidability.TM.PrettyBounds.SizeBounds]
sizeOfmTapes_max_list_map [lemma, in Undecidability.TM.PrettyBounds.SizeBounds]
sizeOfmTapes_by_size [lemma, in Undecidability.L.TM.TMEncoding]
sizeOfmTapes:28 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
sizeOfmTapes:32 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
sizeOfTape [definition, in Undecidability.TM.Util.TM_facts]
sizeOfTape_tape_contains_size [lemma, in Undecidability.TM.Code.CodeTM]
sizeoftape_maptape_eq [lemma, in Complexity.L.TM.TMflatFun]
sizeOfTape_by_size [lemma, in Undecidability.L.TM.TMEncoding]
sizeOfTape_lcr [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
sizeOfTape_encodeTape_le [lemma, in Undecidability.TM.Single.EncodeTapes]
sizeOfTape_encodeTape [lemma, in Undecidability.TM.Single.EncodeTapes]
sizeP [definition, in Undecidability.L.AbstractMachines.FlatPro.Programs]
sizePN [definition, in Complexity.L.AbstractMachines.FunctionalDefinitions]
sizeP_le_size [lemma, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds_Loop]
sizeP_size [lemma, in Undecidability.L.AbstractMachines.FlatPro.Programs]
sizeP_size' [lemma, in Undecidability.L.AbstractMachines.FlatPro.Programs]
sizeQ:16 [binder, in Complexity.L.AbstractMachines.FunctionalDefinitions]
sizeQ:2 [binder, in Complexity.L.AbstractMachines.FunctionalDefinitions]
sizeSt [definition, in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
sizeSt [definition, in Complexity.L.AbstractMachines.AbstractSubstMachine]
sizeT [definition, in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
sizeT [definition, in Undecidability.L.AbstractMachines.FlatPro.Programs]
sizeTN [definition, in Complexity.L.AbstractMachines.FunctionalDefinitions]
sizeTR_correct [lemma, in Undecidability.L.Functions.Size]
sizeTR' [definition, in Undecidability.L.Functions.Size]
sizeTR'_fuel_leq_size [lemma, in Undecidability.L.Functions.Size]
sizeTR'_correct [lemma, in Undecidability.L.Functions.Size]
sizeTR'_fuel [definition, in Undecidability.L.Functions.Size]
sizeT_le_size [lemma, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds_Loop]
sizeT_ge_1 [lemma, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds_Loop]
sizeT_compile_list_bool [lemma, in Complexity.L.AbstractMachines.FlatPro.Computable.Compile]
size_recursion [lemma, in Undecidability.Shared.Libs.PSL.Numbers]
size_induction_dep [lemma, in Undecidability.Shared.Libs.PSL.Numbers]
size_induction [lemma, in Undecidability.Shared.Libs.PSL.Numbers]
size_prod [lemma, in Undecidability.L.Datatypes.LProd]
size_final_tapes' [lemma, in Complexity.TM.PrettyBounds.M2MBounds]
size_final_tapes [lemma, in Complexity.TM.PrettyBounds.M2MBounds]
size_doAct_multi' [lemma, in Complexity.TM.PrettyBounds.M2MBounds]
size_doAct_multi [lemma, in Complexity.TM.PrettyBounds.M2MBounds]
size_tape_ge1 [lemma, in Complexity.TM.PrettyBounds.M2MBounds]
size_doActions' [lemma, in Complexity.TM.PrettyBounds.M2MBounds]
size_doActions [lemma, in Complexity.TM.PrettyBounds.M2MBounds]
size_tape_bounded [lemma, in Complexity.TM.PrettyBounds.M2MBounds]
size_tapes_ge1 [lemma, in Complexity.TM.PrettyBounds.M2MBounds]
size_state_le [lemma, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
size_state_lt [lemma, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
size_char_eq [lemma, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
size_HClos_le [lemma, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds_Loop]
size_list_le_bound [lemma, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds_Loop]
size_list [lemma, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds_Loop]
size_le_sizeP [lemma, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds_Loop]
size_sizeT_le [lemma, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds_Loop]
size_option [lemma, in Undecidability.L.Datatypes.LOptions]
size_bool_enc [lemma, in Undecidability.L.Datatypes.LBool]
size_bool [lemma, in Undecidability.L.Datatypes.LBool]
size_X_ge1:96 [binder, in Complexity.TM.PrettyBounds.UnivBounds]
size_TM [lemma, in Complexity.L.TM.TMflatEnc]
size_sum [lemma, in Undecidability.L.Datatypes.LSum]
size_list [lemma, in Undecidability.TM.PrettyBounds.SizeBounds]
size_Com_singleton [lemma, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
size_nat' [lemma, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
size_Var [lemma, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
size_ACom' [lemma, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
size_ACom [lemma, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
size_ACom_singleton' [lemma, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
size_ACom_singleton [lemma, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
size_list_enc_r [lemma, in Undecidability.L.Datatypes.Lists]
size_list_In [lemma, in Undecidability.L.Datatypes.Lists]
size_rev [lemma, in Undecidability.L.Datatypes.Lists]
size_list_cons [lemma, in Undecidability.L.Datatypes.Lists]
size_list [lemma, in Undecidability.L.Datatypes.Lists]
size_Tok_enc [lemma, in Complexity.L.AbstractMachines.FlatPro.Computable.LPro]
size_Tok_enc_r [lemma, in Complexity.L.AbstractMachines.FlatPro.Computable.LPro]
size_sigTape [lemma, in Complexity.L.TM.CompCode]
size_sigList [lemma, in Complexity.L.TM.CompCode]
size_boundary [lemma, in Complexity.L.TM.CompCode]
size_S [lemma, in Complexity.TM.PrettyBounds.BaseCodeSpace]
size_unit_enc [lemma, in Undecidability.L.Datatypes.LUnit]
size_term_enc_r [lemma, in Undecidability.L.Datatypes.LTerm]
size_term_enc [lemma, in Undecidability.L.Datatypes.LTerm]
size_clos [lemma, in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisStep]
size_input_index [lemma, in Complexity.NP.SAT.CookLevin.Reductions.TMGenNP_fixed_singleTapeTM_to_FlatFunSingleTMGenNP]
size_finType_any_le_c [lemma, in Undecidability.L.Datatypes.LFinType]
size_finType_any_le [lemma, in Undecidability.L.Datatypes.LFinType]
size_finType_le [lemma, in Undecidability.L.Datatypes.LFinType]
size_geq_1 [lemma, in Undecidability.L.AbstractMachines.FlatPro.Programs]
size_flatTapes [lemma, in Complexity.L.TM.TMflatFun]
size_flatTape [lemma, in Complexity.L.TM.TMflatFun]
size_nat_enc_r [lemma, in Undecidability.L.Datatypes.LNat]
size_nat_enc [lemma, in Undecidability.L.Datatypes.LNat]
size_cnf_app [lemma, in Complexity.NP.SAT.SAT]
size_clause_app [lemma, in Complexity.NP.SAT.SAT]
size_cnf [definition, in Complexity.NP.SAT.SAT]
size_clause [definition, in Complexity.NP.SAT.SAT]
size_cnf_ge_length [lemma, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
size' [definition, in Undecidability.L.Util.L_facts]
size'_surj [lemma, in Undecidability.L.Functions.Size]
size':23 [binder, in Complexity.HierarchyTheorem.TimeHierarchyTheorem]
size':64 [binder, in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
size':70 [binder, in Complexity.L.AbstractMachines.Computable.EvalForTime]
size:122 [binder, in Undecidability.TM.Univ.LowLevel]
size:124 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
size:13 [binder, in Complexity.HierarchyTheorem.TimeHierarchyTheorem]
size:13 [binder, in Complexity.L.AbstractMachines.Computable.UnivDecTime]
size:141 [binder, in Undecidability.TM.Univ.LookupAssociativeListTM]
size:149 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachine]
size:16 [binder, in Undecidability.TM.Code.List.Rev]
size:162 [binder, in Undecidability.L.Prelim.ARS]
size:174 [binder, in Undecidability.L.Prelim.ARS]
size:175 [binder, in Undecidability.TM.Univ.Univ]
size:178 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
size:180 [binder, in Undecidability.L.Prelim.ARS]
size:216 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
size:22 [binder, in Complexity.HierarchyTheorem.TimeHierarchyTheorem]
size:25 [binder, in Complexity.HierarchyTheorem.TimeHierarchyTheorem]
size:31 [binder, in Complexity.NP.TM.M_LM2TM]
size:37 [binder, in Undecidability.TM.Code.List.Rev]
size:41 [binder, in Complexity.NP.TM.M_LM2TM]
size:43 [binder, in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
size:44 [binder, in Complexity.NP.TM.M_LM2TM]
size:47 [binder, in Complexity.L.AbstractMachines.Computable.EvalForTime]
size:49 [binder, in Undecidability.TM.Hoare.HoareRegister]
size:5 [binder, in Complexity.L.AbstractMachines.Computable.EvalForTimeBool]
size:52 [binder, in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
size:54 [binder, in Undecidability.TM.L.HeapInterpreter.LookupTM]
size:55 [binder, in Undecidability.TM.Hoare.HoareRegister]
size:57 [binder, in Undecidability.TM.Code.List.Rev]
size:62 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
size:63 [binder, in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
size:67 [binder, in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
size:69 [binder, in Complexity.L.AbstractMachines.Computable.EvalForTime]
size:72 [binder, in Complexity.L.AbstractMachines.Computable.EvalForTime]
size:90 [binder, in Undecidability.TM.Univ.LowLevel]
size:94 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
size:99 [binder, in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
si:123 [binder, in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
skipn_repeat [lemma, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
skipn_repeat_add [lemma, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
skipn_length [lemma, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
skipn_app [lemma, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
skipn_nil [lemma, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
skipn_tl [lemma, in Undecidability.TM.Code.Code]
skipn_0 [lemma, in Undecidability.TM.Code.Code]
skipn_firstn_skipn [lemma, in Complexity.Libs.CookPrelim.MorePrelim]
skipn_skipn [lemma, in Complexity.Libs.CookPrelim.MorePrelim]
skipn_firstn_shift [lemma, in Complexity.Libs.CookPrelim.MorePrelim]
skipn_firstn_rev [lemma, in Complexity.Libs.CookPrelim.MorePrelim]
skipn_app3 [lemma, in Complexity.Libs.CookPrelim.MorePrelim]
skipn_app2 [lemma, in Complexity.Libs.CookPrelim.MorePrelim]
skipn_add [lemma, in Complexity.Libs.CookPrelim.MorePrelim]
skipn_tl [lemma, in Undecidability.TM.Compound.WriteString]
skipn_S [lemma, in Undecidability.TM.Compound.WriteString]
Skip_cons_Terminates [lemma, in Undecidability.TM.Code.CaseList]
Skip_cons_Realise [lemma, in Undecidability.TM.Code.CaseList]
Skip_cons_Rel [definition, in Undecidability.TM.Code.CaseList]
Skip_cons [definition, in Undecidability.TM.Code.CaseList]
smallo_equiv.ino_agree_real [lemma, in Complexity.Complexity.ONotationIsAppropriate]
smallo_equiv.NtoQ_pos [lemma, in Complexity.Complexity.ONotationIsAppropriate]
smallo_equiv.liftR [definition, in Complexity.Complexity.ONotationIsAppropriate]
smallo_equiv.QtoN_ceil [lemma, in Complexity.Complexity.ONotationIsAppropriate]
smallo_equiv.NtoQ_id [lemma, in Complexity.Complexity.ONotationIsAppropriate]
smallo_equiv.NtoQ_inj_mult [lemma, in Complexity.Complexity.ONotationIsAppropriate]
smallo_equiv.NtoQ_inj_add [lemma, in Complexity.Complexity.ONotationIsAppropriate]
smallo_equiv.NtoQ_inj_le [lemma, in Complexity.Complexity.ONotationIsAppropriate]
smallo_equiv.NtoQ_inj_lt [lemma, in Complexity.Complexity.ONotationIsAppropriate]
smallo_equiv.QtoNceil [definition, in Complexity.Complexity.ONotationIsAppropriate]
smallo_equiv.NtoQ [definition, in Complexity.Complexity.ONotationIsAppropriate]
smallo_equiv.inoR [definition, in Complexity.Complexity.ONotationIsAppropriate]
smallo_equiv [module, in Complexity.Complexity.ONotationIsAppropriate]
Small_Step_Semantics.sss_loop.HP2 [variable, in Undecidability.Shared.Libs.DLW.Code.sss]
Small_Step_Semantics.sss_loop.HP1 [variable, in Undecidability.Shared.Libs.DLW.Code.sss]
Small_Step_Semantics.sss_loop.Hp [variable, in Undecidability.Shared.Libs.DLW.Code.sss]
Small_Step_Semantics.sss_loop.p [variable, in Undecidability.Shared.Libs.DLW.Code.sss]
Small_Step_Semantics.sss_loop.i [variable, in Undecidability.Shared.Libs.DLW.Code.sss]
Small_Step_Semantics.sss_loop.HC [variable, in Undecidability.Shared.Libs.DLW.Code.sss]
Small_Step_Semantics.sss_loop.C2 [variable, in Undecidability.Shared.Libs.DLW.Code.sss]
Small_Step_Semantics.sss_loop.C1 [variable, in Undecidability.Shared.Libs.DLW.Code.sss]
Small_Step_Semantics.sss_loop.Hf [variable, in Undecidability.Shared.Libs.DLW.Code.sss]
Small_Step_Semantics.sss_loop.f [variable, in Undecidability.Shared.Libs.DLW.Code.sss]
Small_Step_Semantics.sss_loop.spec [variable, in Undecidability.Shared.Libs.DLW.Code.sss]
Small_Step_Semantics.sss_loop.pre [variable, in Undecidability.Shared.Libs.DLW.Code.sss]
Small_Step_Semantics.sss_loop.P [variable, in Undecidability.Shared.Libs.DLW.Code.sss]
Small_Step_Semantics.sss_loop [section, in Undecidability.Shared.Libs.DLW.Code.sss]
Small_Step_Semantics.sss_compute_max_ind.HQ1 [variable, in Undecidability.Shared.Libs.DLW.Code.sss]
Small_Step_Semantics.sss_compute_max_ind.HQ0 [variable, in Undecidability.Shared.Libs.DLW.Code.sss]
Small_Step_Semantics.sss_compute_max_ind.R [variable, in Undecidability.Shared.Libs.DLW.Code.sss]
Small_Step_Semantics.sss_compute_max_ind.P [variable, in Undecidability.Shared.Libs.DLW.Code.sss]
Small_Step_Semantics.sss_compute_max_ind [section, in Undecidability.Shared.Libs.DLW.Code.sss]
Small_Step_Semantics.sss_terminates_ind.HR1 [variable, in Undecidability.Shared.Libs.DLW.Code.sss]
Small_Step_Semantics.sss_terminates_ind.HR0 [variable, in Undecidability.Shared.Libs.DLW.Code.sss]
Small_Step_Semantics.sss_terminates_ind.R [variable, in Undecidability.Shared.Libs.DLW.Code.sss]
Small_Step_Semantics.sss_terminates_ind.P [variable, in Undecidability.Shared.Libs.DLW.Code.sss]
Small_Step_Semantics.sss_terminates_ind [section, in Undecidability.Shared.Libs.DLW.Code.sss]
_ // _ -]] _ [notation, in Undecidability.Shared.Libs.DLW.Code.sss]
_ // _ ↓ [notation, in Undecidability.Shared.Libs.DLW.Code.sss]
_ // _ ~~> _ [notation, in Undecidability.Shared.Libs.DLW.Code.sss]
_ // _ ->> _ [notation, in Undecidability.Shared.Libs.DLW.Code.sss]
_ // _ -+> _ [notation, in Undecidability.Shared.Libs.DLW.Code.sss]
_ // _ -[ _ ]-> _ [notation, in Undecidability.Shared.Libs.DLW.Code.sss]
_ // _ :1> _ [notation, in Undecidability.Shared.Libs.DLW.Code.sss]
Small_Step_Semantics.sss_dec [variable, in Undecidability.Shared.Libs.DLW.Code.sss]
Small_Step_Semantics.sss_fun [variable, in Undecidability.Shared.Libs.DLW.Code.sss]
_ ⟬ _ ⦒ _ [notation, in Undecidability.Shared.Libs.DLW.Code.sss]
_ // _ -1> _ [notation, in Undecidability.Shared.Libs.DLW.Code.sss]
Small_Step_Semantics.one_step [variable, in Undecidability.Shared.Libs.DLW.Code.sss]
Small_Step_Semantics.data [variable, in Undecidability.Shared.Libs.DLW.Code.sss]
Small_Step_Semantics.instr [variable, in Undecidability.Shared.Libs.DLW.Code.sss]
Small_Step_Semantics [section, in Undecidability.Shared.Libs.DLW.Code.sss]
smpl_dupfree_helper2 [lemma, in Undecidability.TM.Lifting.LiftTapes]
smpl_dupfree_helper1 [lemma, in Undecidability.TM.Lifting.LiftTapes]
sm:102 [binder, in Undecidability.TM.Code.NatTM]
sm:21 [binder, in Undecidability.TM.Code.NatTM]
sm:64 [binder, in Undecidability.TM.Code.NatTM]
sm:83 [binder, in Undecidability.TM.Code.NatTM]
sm:92 [binder, in Undecidability.TM.Code.NatTM]
SN [inductive, in Undecidability.L.Prelim.ARS]
SNC [constructor, in Undecidability.L.Prelim.ARS]
Snd [definition, in Undecidability.TM.Code.CasePair]
Snd_Terminates [lemma, in Undecidability.TM.Code.CasePair]
Snd_T [definition, in Undecidability.TM.Code.CasePair]
Snd_steps [definition, in Undecidability.TM.Code.CasePair]
Snd_Realise [lemma, in Undecidability.TM.Code.CasePair]
Snd_Rel [definition, in Undecidability.TM.Code.CasePair]
Snd_size [definition, in Undecidability.TM.Code.CasePair]
SN_unfold [lemma, in Undecidability.L.Prelim.ARS]
sn:103 [binder, in Undecidability.TM.Code.NatTM]
Sn:11 [binder, in Undecidability.L.Computability.MuRec]
sn:16 [binder, in Undecidability.TM.Code.CaseNat]
sn:20 [binder, in Undecidability.TM.Code.CaseNat]
sn:22 [binder, in Undecidability.TM.Code.NatTM]
sn:65 [binder, in Undecidability.TM.Code.NatTM]
sn:8 [binder, in Undecidability.TM.Code.CaseNat]
sn:84 [binder, in Undecidability.TM.Code.NatTM]
sn:93 [binder, in Undecidability.TM.Code.NatTM]
SomeElement [lemma, in Undecidability.Shared.Libs.PSL.FiniteTypes.CompoundFinTypes]
someSigmaVar [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Some_ofFlatType [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
Some_injective [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Some_inj [lemma, in Undecidability.TM.Lifting.LiftTapes]
sorting [library]
soundness [lemma, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
soundness [lemma, in Complexity.L.AbstractMachines.AbstractHeapMachine]
soundness [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
soundnessTime [lemma, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
soundnessTime' [lemma, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
soundness' [lemma, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
soundness' [lemma, in Complexity.L.AbstractMachines.AbstractHeapMachine]
sound_evalForTime__step2' [lemma, in Complexity.L.AbstractMachines.Computable.EvalForTime]
sound_evalForTime__step [lemma, in Complexity.L.AbstractMachines.Computable.EvalForTime]
sound__decInTime [lemma, in Complexity.Complexity.Definitions]
sound__pCR [projection, in Complexity.Complexity.NP]
so:104 [binder, in Undecidability.TM.Code.NatTM]
so:29 [binder, in Undecidability.TM.Code.NatTM]
so:38 [binder, in Undecidability.TM.Code.NatTM]
so:94 [binder, in Undecidability.TM.Code.NatTM]
SpaceBoundReached [constructor, in Complexity.L.AbstractMachines.FunctionalDefinitions]
SpaceBounds [library]
SpaceBoundsTime [library]
spaceBS_hasSpace [lemma, in Undecidability.L.Complexity.ResourceMeasures]
spaces:53 [binder, in Undecidability.TM.Hoare.HoareRegister]
space_constant_correct [lemma, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
space_constant [definition, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
space_bounds_time [lemma, in Complexity.Complexity.SpaceBoundsTime]
space:127 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
space:209 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
space:228 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
Spec [definition, in Undecidability.TM.Hoare.HoareRegister]
SpecV [definition, in Undecidability.TM.Hoare.HoareRegister]
SpecVTrue [definition, in Undecidability.TM.Hoare.HoareRegister]
spec_evalForTime__step [lemma, in Complexity.L.AbstractMachines.Computable.EvalForTime]
spec_extractRes [lemma, in Complexity.L.AbstractMachines.Computable.EvalForTime]
spec_L__f [lemma, in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
spec:12 [binder, in Undecidability.TM.Hoare.HoareRegister]
spec:25 [binder, in Undecidability.TM.Hoare.HoareRegister]
splitAllFin [lemma, in Undecidability.TM.Lifting.LiftTapes]
split_head_symbol [definition, in Undecidability.L.Tactics.Extract]
split_interval [lemma, in Undecidability.Shared.Libs.DLW.Utils.sorting]
split_interval.Hh2 [variable, in Undecidability.Shared.Libs.DLW.Utils.sorting]
split_interval.Hh1 [variable, in Undecidability.Shared.Libs.DLW.Utils.sorting]
split_interval.Hg2 [variable, in Undecidability.Shared.Libs.DLW.Utils.sorting]
split_interval.Hg1 [variable, in Undecidability.Shared.Libs.DLW.Utils.sorting]
split_interval.h [variable, in Undecidability.Shared.Libs.DLW.Utils.sorting]
split_interval.g [variable, in Undecidability.Shared.Libs.DLW.Utils.sorting]
split_interval.Hi [variable, in Undecidability.Shared.Libs.DLW.Utils.sorting]
split_interval.i [variable, in Undecidability.Shared.Libs.DLW.Utils.sorting]
split_interval.n [variable, in Undecidability.Shared.Libs.DLW.Utils.sorting]
split_interval [section, in Undecidability.Shared.Libs.DLW.Utils.sorting]
split_nat [lemma, in Undecidability.TM.Single.EncodeTapes]
split_vector_correct [lemma, in Undecidability.TM.Single.EncodeTapes]
split_vector [definition, in Undecidability.TM.Single.EncodeTapes]
sr:123 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
sr:172 [binder, in Undecidability.TM.Univ.Univ]
sr:215 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
sr:38 [binder, in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
sr:61 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
ssbBC [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
ssbSC [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
sss [library]
sssBC [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
sssSBC [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
sssSSC [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
sss_loop_complete [lemma, in Undecidability.Shared.Libs.DLW.Code.sss]
sss_loop_sound [lemma, in Undecidability.Shared.Libs.DLW.Code.sss]
sss_output_fun [lemma, in Undecidability.Shared.Libs.DLW.Code.sss]
sss_compute_fun [lemma, in Undecidability.Shared.Libs.DLW.Code.sss]
sss_compute_stop [lemma, in Undecidability.Shared.Libs.DLW.Code.sss]
sss_steps_stop [lemma, in Undecidability.Shared.Libs.DLW.Code.sss]
sss_compute_step_out_inv [lemma, in Undecidability.Shared.Libs.DLW.Code.sss]
sss_compute_inv [lemma, in Undecidability.Shared.Libs.DLW.Code.sss]
sss_compute_max_ind [lemma, in Undecidability.Shared.Libs.DLW.Code.sss]
sss_terminates_ind [lemma, in Undecidability.Shared.Libs.DLW.Code.sss]
sss_steps_stall [lemma, in Undecidability.Shared.Libs.DLW.Code.sss]
sss_step_stall_inv [lemma, in Undecidability.Shared.Libs.DLW.Code.sss]
sss_stall_step_0 [lemma, in Undecidability.Shared.Libs.DLW.Code.sss]
sss_stall_step_stall [lemma, in Undecidability.Shared.Libs.DLW.Code.sss]
sss_out_step_stall [lemma, in Undecidability.Shared.Libs.DLW.Code.sss]
sss_compute_max [definition, in Undecidability.Shared.Libs.DLW.Code.sss]
sss_steps_stall_fun [lemma, in Undecidability.Shared.Libs.DLW.Code.sss]
sss_steps_stall_inv [lemma, in Undecidability.Shared.Libs.DLW.Code.sss]
sss_step_stall [definition, in Undecidability.Shared.Libs.DLW.Code.sss]
sss_stall [definition, in Undecidability.Shared.Libs.DLW.Code.sss]
sss_terminates [definition, in Undecidability.Shared.Libs.DLW.Code.sss]
sss_output [definition, in Undecidability.Shared.Libs.DLW.Code.sss]
sss_steps_compute [lemma, in Undecidability.Shared.Libs.DLW.Code.sss]
sss_step_in_code [lemma, in Undecidability.Shared.Libs.DLW.Code.sss]
sss_progress_trans [lemma, in Undecidability.Shared.Libs.DLW.Code.sss]
sss_compute_progress_trans [lemma, in Undecidability.Shared.Libs.DLW.Code.sss]
sss_progress_compute_trans [lemma, in Undecidability.Shared.Libs.DLW.Code.sss]
sss_compute_trans [lemma, in Undecidability.Shared.Libs.DLW.Code.sss]
sss_progress_compute [lemma, in Undecidability.Shared.Libs.DLW.Code.sss]
sss_compute [definition, in Undecidability.Shared.Libs.DLW.Code.sss]
sss_progress [definition, in Undecidability.Shared.Libs.DLW.Code.sss]
sss_steps_plus_inv [lemma, in Undecidability.Shared.Libs.DLW.Code.sss]
sss_steps_fun [lemma, in Undecidability.Shared.Libs.DLW.Code.sss]
sss_steps_S_inv' [lemma, in Undecidability.Shared.Libs.DLW.Code.sss]
sss_steps_inv [lemma, in Undecidability.Shared.Libs.DLW.Code.sss]
sss_steps_S_inv [lemma, in Undecidability.Shared.Libs.DLW.Code.sss]
sss_steps_0_inv [lemma, in Undecidability.Shared.Libs.DLW.Code.sss]
sss_steps_trans [lemma, in Undecidability.Shared.Libs.DLW.Code.sss]
sss_steps_1 [lemma, in Undecidability.Shared.Libs.DLW.Code.sss]
sss_steps_0 [lemma, in Undecidability.Shared.Libs.DLW.Code.sss]
sss_steps [inductive, in Undecidability.Shared.Libs.DLW.Code.sss]
sss_step_dec [lemma, in Undecidability.Shared.Libs.DLW.Code.sss]
sss_step_supcode [lemma, in Undecidability.Shared.Libs.DLW.Code.sss]
sss_step_subcode_inv [lemma, in Undecidability.Shared.Libs.DLW.Code.sss]
sss_step_fun [lemma, in Undecidability.Shared.Libs.DLW.Code.sss]
sss_step [definition, in Undecidability.Shared.Libs.DLW.Code.sss]
sstep [definition, in Complexity.NP.SAT.CookLevin.Subproblems.TM_single]
sstep [abbreviation, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
sstepRel [definition, in Complexity.NP.SAT.CookLevin.Subproblems.TM_single]
sstep_agree2 [lemma, in Complexity.NP.SAT.CookLevin.Subproblems.TM_single]
sstep_agree1 [lemma, in Complexity.NP.SAT.CookLevin.Subproblems.TM_single]
ss'':405 [binder, in Undecidability.TM.Hoare.HoareRegister]
ss'':423 [binder, in Undecidability.TM.Hoare.HoareRegister]
ss':219 [binder, in Undecidability.TM.Hoare.HoareRegister]
ss':351 [binder, in Undecidability.TM.Hoare.HoareRegister]
ss':362 [binder, in Undecidability.TM.Hoare.HoareRegister]
ss':374 [binder, in Undecidability.TM.Hoare.HoareRegister]
ss':389 [binder, in Undecidability.TM.Hoare.HoareRegister]
ss':404 [binder, in Undecidability.TM.Hoare.HoareRegister]
ss':422 [binder, in Undecidability.TM.Hoare.HoareRegister]
ss':545 [binder, in Undecidability.TM.Hoare.HoareRegister]
ss':559 [binder, in Undecidability.TM.Hoare.HoareRegister]
ss':571 [binder, in Undecidability.TM.Hoare.HoareRegister]
ss':583 [binder, in Undecidability.TM.Hoare.HoareRegister]
ss:10 [binder, in Undecidability.TM.Code.CaseBool]
ss:10 [binder, in Undecidability.TM.Univ.Univ]
ss:100 [binder, in Undecidability.TM.Hoare.HoareMult]
ss:100 [binder, in Undecidability.TM.Univ.LookupAssociativeListTM]
ss:100 [binder, in Undecidability.TM.L.HeapInterpreter.LookupTM]
ss:104 [binder, in Undecidability.TM.Univ.LookupAssociativeListTM]
ss:105 [binder, in Undecidability.TM.L.HeapInterpreter.LookupTM]
ss:106 [binder, in Undecidability.TM.Hoare.HoareMult]
ss:107 [binder, in Undecidability.TM.Code.CaseList]
ss:108 [binder, in Undecidability.TM.Code.CaseList]
ss:109 [binder, in Undecidability.TM.Univ.LookupAssociativeListTM]
ss:109 [binder, in Undecidability.TM.L.HeapInterpreter.LookupTM]
ss:11 [binder, in Undecidability.TM.Hoare.HoareExamples]
ss:112 [binder, in Undecidability.TM.Code.CaseList]
ss:112 [binder, in Undecidability.TM.Code.List.Nth]
ss:112 [binder, in Undecidability.TM.Hoare.HoareMult]
ss:114 [binder, in Undecidability.TM.Univ.LookupAssociativeListTM]
ss:117 [binder, in Undecidability.TM.Hoare.HoareMult]
ss:118 [binder, in Undecidability.TM.Univ.LookupAssociativeListTM]
ss:122 [binder, in Undecidability.TM.Hoare.HoareMult]
ss:127 [binder, in Undecidability.TM.Hoare.HoareMult]
ss:13 [binder, in Undecidability.TM.Univ.Univ]
ss:133 [binder, in Undecidability.TM.Hoare.HoareMult]
ss:139 [binder, in Undecidability.TM.Hoare.HoareMult]
ss:14 [binder, in Undecidability.TM.Code.CaseFin]
ss:14 [binder, in Undecidability.TM.Code.CaseSum]
ss:144 [binder, in Undecidability.TM.Hoare.HoareMult]
ss:153 [binder, in Undecidability.TM.Univ.LookupAssociativeListTM]
ss:155 [binder, in Undecidability.TM.Hoare.HoareMult]
ss:16 [binder, in Undecidability.TM.Hoare.HoareMult]
ss:162 [binder, in Undecidability.TM.Hoare.HoareExamples]
ss:17 [binder, in Undecidability.TM.Hoare.HoareMult]
ss:17 [binder, in Undecidability.TM.Univ.Univ]
ss:18 [binder, in Undecidability.TM.Code.List.Cons_constant]
ss:20 [binder, in Undecidability.TM.Univ.Univ]
ss:201 [binder, in Undecidability.TM.Hoare.HoareRegister]
ss:208 [binder, in Undecidability.TM.Hoare.HoareExamples]
ss:209 [binder, in Undecidability.TM.Hoare.HoareExamples]
ss:21 [binder, in Undecidability.TM.Code.CaseNat]
ss:21 [binder, in Undecidability.TM.Hoare.HoareMult]
ss:21 [binder, in Undecidability.TM.L.CaseCom]
ss:213 [binder, in Undecidability.TM.Hoare.HoareExamples]
ss:218 [binder, in Undecidability.TM.Hoare.HoareRegister]
ss:218 [binder, in Undecidability.TM.Hoare.HoareExamples]
ss:22 [binder, in Undecidability.TM.Code.CaseSum]
ss:223 [binder, in Undecidability.TM.Hoare.HoareExamples]
ss:226 [binder, in Undecidability.TM.Code.Copy]
ss:227 [binder, in Undecidability.TM.Hoare.HoareExamples]
ss:23 [binder, in Undecidability.TM.Code.CaseNat]
ss:231 [binder, in Undecidability.TM.Hoare.HoareExamples]
ss:235 [binder, in Undecidability.TM.Hoare.HoareExamples]
ss:239 [binder, in Undecidability.TM.Code.Copy]
ss:24 [binder, in Undecidability.TM.Hoare.HoareExamples]
ss:240 [binder, in Undecidability.TM.Hoare.HoareExamples]
ss:245 [binder, in Undecidability.TM.Hoare.HoareExamples]
ss:249 [binder, in Undecidability.TM.Hoare.HoareExamples]
ss:25 [binder, in Undecidability.TM.L.HeapInterpreter.LookupTM]
ss:252 [binder, in Undecidability.TM.Code.Copy]
ss:26 [binder, in Undecidability.TM.Code.CaseSum]
ss:26 [binder, in Undecidability.TM.Hoare.HoareMult]
ss:26 [binder, in Undecidability.TM.L.CaseCom]
ss:261 [binder, in Undecidability.TM.Hoare.HoareExamples]
ss:265 [binder, in Undecidability.TM.Code.Copy]
ss:27 [binder, in Undecidability.TM.Code.CaseNat]
ss:278 [binder, in Undecidability.TM.Code.Copy]
ss:28 [binder, in Undecidability.TM.Code.List.Nth]
ss:281 [binder, in Undecidability.TM.Hoare.HoareExamples]
ss:291 [binder, in Undecidability.TM.Code.Copy]
ss:304 [binder, in Undecidability.TM.Code.Copy]
ss:308 [binder, in Undecidability.TM.Hoare.HoareRegister]
ss:31 [binder, in Undecidability.TM.Hoare.HoareMult]
ss:315 [binder, in Undecidability.TM.Hoare.HoareRegister]
ss:317 [binder, in Undecidability.TM.Code.Copy]
ss:322 [binder, in Undecidability.TM.Hoare.HoareRegister]
ss:332 [binder, in Undecidability.TM.Hoare.HoareRegister]
ss:343 [binder, in Undecidability.TM.Code.Copy]
ss:343 [binder, in Undecidability.TM.Hoare.HoareExamples]
ss:344 [binder, in Undecidability.TM.Hoare.HoareExamples]
ss:349 [binder, in Undecidability.TM.Hoare.HoareExamples]
ss:35 [binder, in Undecidability.TM.Hoare.HoareMult]
ss:350 [binder, in Undecidability.TM.Hoare.HoareRegister]
ss:355 [binder, in Undecidability.TM.Hoare.HoareExamples]
ss:361 [binder, in Undecidability.TM.Hoare.HoareRegister]
ss:361 [binder, in Undecidability.TM.Hoare.HoareExamples]
ss:366 [binder, in Undecidability.TM.Code.Copy]
ss:366 [binder, in Undecidability.TM.Hoare.HoareExamples]
ss:371 [binder, in Undecidability.TM.Hoare.HoareExamples]
ss:373 [binder, in Undecidability.TM.Hoare.HoareRegister]
ss:376 [binder, in Undecidability.TM.Hoare.HoareExamples]
ss:382 [binder, in Undecidability.TM.Hoare.HoareExamples]
ss:385 [binder, in Undecidability.TM.Code.Copy]
ss:388 [binder, in Undecidability.TM.Hoare.HoareRegister]
ss:388 [binder, in Undecidability.TM.Hoare.HoareExamples]
ss:39 [binder, in Undecidability.TM.Hoare.HoareMult]
ss:393 [binder, in Undecidability.TM.Hoare.HoareExamples]
ss:400 [binder, in Undecidability.TM.Code.Copy]
ss:403 [binder, in Undecidability.TM.Hoare.HoareRegister]
ss:406 [binder, in Undecidability.TM.Hoare.HoareExamples]
ss:411 [binder, in Undecidability.TM.Hoare.HoareExamples]
ss:421 [binder, in Undecidability.TM.Hoare.HoareRegister]
ss:43 [binder, in Undecidability.TM.Hoare.HoareMult]
ss:44 [binder, in Undecidability.TM.Code.WriteValue]
ss:45 [binder, in Undecidability.TM.Univ.Univ]
ss:457 [binder, in Undecidability.TM.Hoare.HoareRegister]
ss:47 [binder, in Undecidability.TM.Code.List.Rev]
ss:48 [binder, in Undecidability.TM.Code.CompareValue]
ss:48 [binder, in Undecidability.TM.Hoare.HoareMult]
ss:48 [binder, in Undecidability.TM.Code.List.App]
ss:50 [binder, in Undecidability.TM.Univ.LookupAssociativeListTM]
ss:53 [binder, in Undecidability.TM.Hoare.HoareMult]
ss:54 [binder, in Undecidability.TM.Code.List.Nth]
ss:544 [binder, in Undecidability.TM.Hoare.HoareRegister]
ss:55 [binder, in Undecidability.TM.Code.CompareValue]
ss:558 [binder, in Undecidability.TM.Hoare.HoareRegister]
ss:56 [binder, in Undecidability.TM.Code.List.Nth]
ss:56 [binder, in Undecidability.TM.Hoare.HoareExamples]
ss:57 [binder, in Undecidability.TM.Hoare.HoareMult]
ss:570 [binder, in Undecidability.TM.Hoare.HoareRegister]
ss:58 [binder, in Undecidability.TM.Code.CaseSum]
ss:582 [binder, in Undecidability.TM.Hoare.HoareRegister]
ss:6 [binder, in Undecidability.TM.Hoare.HoareMult]
ss:60 [binder, in Undecidability.TM.Code.List.Nth]
ss:60 [binder, in Undecidability.TM.Code.CaseSum]
ss:62 [binder, in Undecidability.TM.Code.CaseSum]
ss:63 [binder, in Undecidability.TM.Code.List.Rev]
ss:65 [binder, in Undecidability.TM.Code.List.Nth]
ss:65 [binder, in Undecidability.TM.L.HeapInterpreter.LookupTM]
ss:65 [binder, in Undecidability.TM.Code.List.App]
ss:67 [binder, in Undecidability.TM.Hoare.HoareMult]
ss:67 [binder, in Undecidability.TM.L.HeapInterpreter.LookupTM]
ss:68 [binder, in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
ss:69 [binder, in Undecidability.TM.Code.CaseSum]
ss:70 [binder, in Undecidability.TM.Code.List.Nth]
ss:70 [binder, in Undecidability.TM.Code.CaseSum]
ss:70 [binder, in Undecidability.TM.Univ.Univ]
ss:71 [binder, in Undecidability.TM.L.HeapInterpreter.LookupTM]
ss:72 [binder, in Undecidability.TM.Lifting.LiftTapes]
ss:74 [binder, in Undecidability.TM.Code.List.Nth]
ss:74 [binder, in Undecidability.TM.Code.CaseSum]
ss:75 [binder, in Undecidability.TM.Univ.Univ]
ss:76 [binder, in Undecidability.TM.Univ.LookupAssociativeListTM]
ss:77 [binder, in Undecidability.TM.L.HeapInterpreter.LookupTM]
ss:78 [binder, in Undecidability.TM.Code.List.Nth]
ss:78 [binder, in Undecidability.TM.Univ.LookupAssociativeListTM]
ss:79 [binder, in Undecidability.TM.Hoare.HoareMult]
ss:79 [binder, in Undecidability.TM.Univ.Univ]
ss:82 [binder, in Undecidability.TM.Code.List.Nth]
ss:82 [binder, in Undecidability.TM.Univ.LookupAssociativeListTM]
ss:82 [binder, in Undecidability.TM.L.HeapInterpreter.LookupTM]
ss:83 [binder, in Undecidability.TM.Univ.Univ]
ss:86 [binder, in Undecidability.TM.L.HeapInterpreter.LookupTM]
ss:86 [binder, in Undecidability.TM.Code.CasePair]
ss:87 [binder, in Undecidability.TM.Code.List.Nth]
ss:87 [binder, in Undecidability.TM.Univ.LookupAssociativeListTM]
ss:87 [binder, in Undecidability.TM.Univ.Univ]
ss:89 [binder, in Undecidability.TM.Code.CasePair]
ss:89 [binder, in Undecidability.TM.Hoare.HoareExamples]
ss:90 [binder, in Undecidability.TM.L.HeapInterpreter.LookupTM]
ss:91 [binder, in Undecidability.TM.Univ.Univ]
ss:91 [binder, in Undecidability.TM.Hoare.HoareExamples]
ss:92 [binder, in Undecidability.TM.Code.List.Nth]
ss:92 [binder, in Undecidability.TM.Univ.LookupAssociativeListTM]
ss:94 [binder, in Undecidability.TM.Hoare.HoareMult]
ss:94 [binder, in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
ss:94 [binder, in Undecidability.TM.L.HeapInterpreter.LookupTM]
ss:95 [binder, in Undecidability.TM.Hoare.HoareMult]
ss:95 [binder, in Undecidability.TM.Univ.Univ]
ss:96 [binder, in Undecidability.TM.Code.List.Nth]
ss:96 [binder, in Undecidability.TM.Univ.LookupAssociativeListTM]
ss:97 [binder, in Undecidability.TM.Hoare.HoareExamples]
stack [definition, in Undecidability.L.Tactics.Extract]
stack':106 [binder, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
stack':113 [binder, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
stack':121 [binder, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
stack':129 [binder, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
stack':136 [binder, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
stack':143 [binder, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
stack':22 [binder, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
stack':31 [binder, in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisUnfoldClos]
stack':47 [binder, in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisUnfoldClos]
stack':69 [binder, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
stack':76 [binder, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
stack':84 [binder, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
stack':92 [binder, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
stack':99 [binder, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
stack2:29 [binder, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
stack:10 [binder, in Complexity.L.AbstractMachines.FlatPro.Computable.Compile]
stack:11 [binder, in Complexity.L.AbstractMachines.Computable.LargestVar]
stack:13 [binder, in Undecidability.L.AbstractMachines.FlatPro.UnfoldClos]
stack:15 [binder, in Complexity.L.AbstractMachines.Computable.Unfolding]
stack:17 [binder, in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisUnfoldClos]
stack:2 [binder, in Undecidability.L.Functions.Size]
stack:20 [binder, in Complexity.L.AbstractMachines.UnfoldTailRec]
stack:20 [binder, in Undecidability.L.Functions.Size]
stack:22 [binder, in Complexity.L.AbstractMachines.Computable.Unfolding]
stack:22 [binder, in Complexity.L.AbstractMachines.Computable.LargestVar]
stack:23 [binder, in Complexity.L.AbstractMachines.FlatPro.Computable.Compile]
stack:25 [binder, in Undecidability.L.Functions.Size]
stack:27 [binder, in Complexity.L.AbstractMachines.FlatPro.Computable.Compile]
stack:27 [binder, in Complexity.L.AbstractMachines.Computable.LargestVar]
stack:3 [binder, in Complexity.L.AbstractMachines.Computable.Unfolding]
stack:3 [binder, in Undecidability.L.AbstractMachines.FlatPro.UnfoldClos]
stack:3 [binder, in Complexity.L.AbstractMachines.FlatPro.Computable.Compile]
stack:30 [binder, in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisUnfoldClos]
stack:30 [binder, in Undecidability.L.Functions.Size]
stack:31 [binder, in Complexity.L.AbstractMachines.FlatPro.Computable.Compile]
stack:32 [binder, in Complexity.L.AbstractMachines.Computable.LargestVar]
stack:33 [binder, in Complexity.L.AbstractMachines.UnfoldTailRec]
stack:35 [binder, in Complexity.L.AbstractMachines.FlatPro.Computable.Compile]
stack:35 [binder, in Undecidability.L.Functions.Size]
stack:37 [binder, in Complexity.L.AbstractMachines.Computable.LargestVar]
stack:39 [binder, in Complexity.L.AbstractMachines.FlatPro.Computable.Compile]
stack:4 [binder, in Complexity.L.AbstractMachines.Computable.LargestVar]
stack:40 [binder, in Undecidability.L.Functions.Size]
stack:42 [binder, in Complexity.L.AbstractMachines.Computable.LargestVar]
stack:43 [binder, in Complexity.L.AbstractMachines.FlatPro.Computable.Compile]
stack:45 [binder, in Undecidability.L.Functions.Size]
stack:47 [binder, in Complexity.L.AbstractMachines.Computable.LargestVar]
stack:48 [binder, in Complexity.L.AbstractMachines.UnfoldTailRec]
stack:7 [binder, in Complexity.L.AbstractMachines.UnfoldTailRec]
stack:9 [binder, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
stack:9 [binder, in Undecidability.L.Functions.Size]
stape [abbreviation, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
star [inductive, in Undecidability.L.Prelim.ARS]
star [inductive, in Undecidability.TM.Util.Relations]
starC [constructor, in Undecidability.L.Prelim.ARS]
starC [constructor, in Undecidability.TM.Util.Relations]
starR [constructor, in Undecidability.L.Prelim.ARS]
starR [constructor, in Undecidability.TM.Util.Relations]
START [constructor, in Undecidability.TM.Code.CodeTM]
start [projection, in Complexity.L.TM.TMflat]
start [projection, in Undecidability.TM.TM]
start [abbreviation, in Complexity.NP.SAT.CookLevin.Subproblems.TM_single]
start [abbreviation, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
startA:10 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
startA:123 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
startA:136 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
startA:142 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
startA:147 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
startA:153 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
startA:18 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
startA:190 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
startA:23 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
startA:28 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
startA:3 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
startB:11 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
startB:124 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
startB:137 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
startB:143 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
startB:148 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
startB:154 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
startB:19 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
startB:24 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
startB:29 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
startB:4 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
startRen [definition, in Undecidability.TM.L.CompilerBoolFuns.Compiler]
startRen_spec [lemma, in Undecidability.TM.L.CompilerBoolFuns.Compiler]
StartState_irrelevant [lemma, in Undecidability.TM.Combinators.StateWhile]
startState_irrelevant' [lemma, in Undecidability.TM.Combinators.StateWhile]
startState_irrelevant [lemma, in Undecidability.TM.Combinators.StateWhile]
start_not_in [lemma, in Undecidability.TM.Code.Copy]
start1:105 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
start1:80 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
start1:84 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
start1:96 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
start2:106 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
start2:81 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
start2:85 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
start2:97 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
start:13 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
start:16 [binder, in Undecidability.L.Datatypes.List.List_extra]
start:180 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
start:187 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
start:193 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
start:194 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
start:199 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
start:204 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
start:210 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
start:213 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
start:217 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
start:221 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
start:226 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
start:229 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
start:232 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
start:235 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
start:238 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
start:240 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
start:240 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
start:242 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
start:244 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
start:247 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
start:249 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
start:252 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
start:258 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
start:261 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
start:30 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
start:34 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
start:35 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
start:36 [binder, in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
start:37 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
start:4 [binder, in Undecidability.L.TM.TMinL]
start:42 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
start:42 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
start:48 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
start:53 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
start:55 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
start:6 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
start:61 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
start:65 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
start:70 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
start:71 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
start:72 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
start:74 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
start:77 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
star_ecl_subrel [instance, in Undecidability.L.Prelim.ARS]
star_ecl [lemma, in Undecidability.L.Prelim.ARS]
star_pow [lemma, in Undecidability.L.Prelim.ARS]
star_PO [instance, in Undecidability.L.Prelim.ARS]
star_trans [lemma, in Undecidability.L.Prelim.ARS]
star_simpl_ind [lemma, in Undecidability.L.Prelim.ARS]
star_equiv_subrelation [instance, in Undecidability.L.Util.L_facts]
star_equiv [lemma, in Undecidability.L.Util.L_facts]
star_closed_proper [instance, in Undecidability.L.Util.L_facts]
star_step_app_proper [instance, in Undecidability.L.Util.L_facts]
star_trans_r [lemma, in Undecidability.L.Util.L_facts]
star_trans_l [lemma, in Undecidability.L.Util.L_facts]
star_PreOrder [instance, in Undecidability.L.Util.L_facts]
star_pow [lemma, in Undecidability.TM.Util.Relations]
star_preorder [instance, in Undecidability.TM.Util.Relations]
star_trans [lemma, in Undecidability.TM.Util.Relations]
Star_Pow.R [variable, in Undecidability.TM.Util.Relations]
Star_Pow.X [variable, in Undecidability.TM.Util.Relations]
Star_Pow [section, in Undecidability.TM.Util.Relations]
state [definition, in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
state [definition, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
state [projection, in Undecidability.TM.TM]
state [abbreviation, in Complexity.L.AbstractMachines.AbstractSubstMachine]
state [abbreviation, in Undecidability.TM.SBTM]
state [abbreviation, in Undecidability.Shared.Libs.DLW.Code.sss]
stateEnv [projection, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
states [projection, in Complexity.L.TM.TMflat]
States [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
states [abbreviation, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
stateSigma [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
stateSigmaEnv [projection, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
stateSigmaVar [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
stateSigma_incl [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
stateSigma_finRepr [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
states_TM_le [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
states_finRepr [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
states:1035 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
states:1040 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
states:1060 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
states:1065 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
states:1072 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
states:1076 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
states:1080 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
states:1085 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
states:1089 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
states:1093 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
states:1097 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
states:1101 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
states:1106 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
states:160 [binder, in Complexity.L.TM.TMunflatten]
states:172 [binder, in Complexity.L.TM.TMunflatten]
states:18 [binder, in Complexity.L.TM.TMunflatten]
states:197 [binder, in Complexity.L.TM.TMunflatten]
states:201 [binder, in Complexity.L.TM.TMunflatten]
states:219 [binder, in Complexity.L.TM.TMflatComp]
states:227 [binder, in Complexity.L.TM.TMflatComp]
states:232 [binder, in Complexity.L.TM.TMflatComp]
states:236 [binder, in Complexity.L.TM.TMflatComp]
states:29 [binder, in Complexity.L.TM.TMunflatten]
states:37 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.SingleTMGenNP]
states:38 [binder, in Complexity.L.TM.TMflatComp]
states:55 [binder, in Complexity.L.TM.TMunflatten]
StateWhile [definition, in Undecidability.TM.Combinators.StateWhile]
StateWhile [section, in Undecidability.TM.Combinators.StateWhile]
StateWhile [library]
StateWhileCoInduction [lemma, in Undecidability.TM.Combinators.StateWhile]
StateWhileInduction [lemma, in Undecidability.TM.Combinators.StateWhile]
StateWhileInduction [section, in Undecidability.TM.Combinators.StateWhile]
StateWhileInduction.F1 [variable, in Undecidability.TM.Combinators.StateWhile]
StateWhileInduction.F2 [variable, in Undecidability.TM.Combinators.StateWhile]
StateWhileInduction.n [variable, in Undecidability.TM.Combinators.StateWhile]
StateWhileInduction.R1 [variable, in Undecidability.TM.Combinators.StateWhile]
StateWhileInduction.R2 [variable, in Undecidability.TM.Combinators.StateWhile]
StateWhileInduction.sig [variable, in Undecidability.TM.Combinators.StateWhile]
StateWhileTM [definition, in Undecidability.TM.Combinators.StateWhile]
StateWhile_liftStart_halt [lemma, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
StateWhile_index_irrelevant [lemma, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
StateWhile_halt_irrelevant' [lemma, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
StateWhile_halt_irrelevant [lemma, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
StateWhile_irrelevant'.defF [variable, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
StateWhile_irrelevant'.pM [variable, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
StateWhile_irrelevant'.F2 [variable, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
StateWhile_irrelevant'.F1 [variable, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
StateWhile_irrelevant'.n [variable, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
StateWhile_irrelevant'.sig [variable, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
StateWhile_irrelevant' [section, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
StateWhile_graph_irrelevant [lemma, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
StateWhile_irrelevant.defF [variable, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
StateWhile_irrelevant.pM [variable, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
StateWhile_irrelevant.F2 [variable, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
StateWhile_irrelevant.F1 [variable, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
StateWhile_irrelevant.sig [variable, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
StateWhile_irrelevant [section, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
StateWhile_TerminatesIn [lemma, in Undecidability.TM.Combinators.StateWhile]
StateWhile_T_intro [constructor, in Undecidability.TM.Combinators.StateWhile]
StateWhile_T [inductive, in Undecidability.TM.Combinators.StateWhile]
StateWhile_TerminatesIn_ind [lemma, in Undecidability.TM.Combinators.StateWhile]
StateWhile_Realise [lemma, in Undecidability.TM.Combinators.StateWhile]
StateWhile_Rel_break [constructor, in Undecidability.TM.Combinators.StateWhile]
StateWhile_Rel_loop [constructor, in Undecidability.TM.Combinators.StateWhile]
StateWhile_Rel [inductive, in Undecidability.TM.Combinators.StateWhile]
StateWhile_merge_break [lemma, in Undecidability.TM.Combinators.StateWhile]
StateWhile_merge_repeat [lemma, in Undecidability.TM.Combinators.StateWhile]
StateWhile_split [lemma, in Undecidability.TM.Combinators.StateWhile]
StateWhile_split_break [lemma, in Undecidability.TM.Combinators.StateWhile]
StateWhile_split_repeat [lemma, in Undecidability.TM.Combinators.StateWhile]
StateWhile_trans_repeat [lemma, in Undecidability.TM.Combinators.StateWhile]
StateWhile_part [definition, in Undecidability.TM.Combinators.StateWhile]
StateWhile_halt [definition, in Undecidability.TM.Combinators.StateWhile]
StateWhile_trans [definition, in Undecidability.TM.Combinators.StateWhile]
StateWhile_states [definition, in Undecidability.TM.Combinators.StateWhile]
StateWhile.defF [variable, in Undecidability.TM.Combinators.StateWhile]
StateWhile.F1 [variable, in Undecidability.TM.Combinators.StateWhile]
StateWhile.F2 [variable, in Undecidability.TM.Combinators.StateWhile]
StateWhile.n [variable, in Undecidability.TM.Combinators.StateWhile]
StateWhile.pM [variable, in Undecidability.TM.Combinators.StateWhile]
StateWhile.R [variable, in Undecidability.TM.Combinators.StateWhile]
StateWhile.sig [variable, in Undecidability.TM.Combinators.StateWhile]
StateWhile.StateWhile_TerminatesIn_coind.T [variable, in Undecidability.TM.Combinators.StateWhile]
StateWhile.StateWhile_TerminatesIn_coind [section, in Undecidability.TM.Combinators.StateWhile]
StateWhile.StateWhile_TerminatesIn.T' [variable, in Undecidability.TM.Combinators.StateWhile]
StateWhile.StateWhile_TerminatesIn.T [variable, in Undecidability.TM.Combinators.StateWhile]
StateWhile.StateWhile_TerminatesIn [section, in Undecidability.TM.Combinators.StateWhile]
state_index_le [lemma, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
state_index_lt [lemma, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
state:253 [binder, in Undecidability.TM.Util.TM_facts]
step [inductive, in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
step [inductive, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
step [inductive, in Undecidability.L.Util.L_facts]
Step [definition, in Undecidability.TM.Single.StepTM]
step [inductive, in Complexity.L.AbstractMachines.AbstractSubstMachine]
Step [definition, in Undecidability.TM.L.HeapInterpreter.StepTM]
step [definition, in Undecidability.TM.Util.TM_facts]
stepApp [constructor, in Undecidability.L.Util.L_facts]
stepAppL [constructor, in Undecidability.L.Util.L_facts]
stepAppR [constructor, in Undecidability.L.Util.L_facts]
stepf [definition, in Undecidability.L.Computability.Seval]
stepFlat [definition, in Complexity.L.TM.TMflatFun]
stepFlat_time_nice [lemma, in Complexity.L.TM.TMflatComp]
stepFlat_timeNice [definition, in Complexity.L.TM.TMflatComp]
stepFlat_time [definition, in Complexity.L.TM.TMflatComp]
stepFlat_eq [lemma, in Complexity.L.TM.TMflatFun]
stepf_spec [lemma, in Undecidability.L.Computability.Seval]
stepindex:121 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
stepindex:134 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
stepindex:140 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
stepindex:16 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
stepindex:178 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
stepindex:191 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
stepindex:197 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
stepindex:202 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
stepindex:208 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
stepindex:40 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
stepi:128 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
stepi:145 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
stepi:151 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
stepi:185 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
StepMachine [section, in Undecidability.TM.L.HeapInterpreter.StepTM]
StepMachine.retr_heap_step [variable, in Undecidability.TM.L.HeapInterpreter.StepTM]
StepMachine.retr_closures_step [variable, in Undecidability.TM.L.HeapInterpreter.StepTM]
StepMachine.sigStep [variable, in Undecidability.TM.L.HeapInterpreter.StepTM]
stepn [definition, in Undecidability.L.Computability.Seval]
stepn_spec [lemma, in Undecidability.L.Computability.Seval]
steps [abbreviation, in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
steps [definition, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
steps [projection, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
steps [projection, in Complexity.NP.SAT.CookLevin.Subproblems.BinaryCC]
steps [abbreviation, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
steps [projection, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
steps [abbreviation, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
steps [abbreviation, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
steps [abbreviation, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
steps [projection, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
steps [abbreviation, in Complexity.NP.SAT.CookLevin.Reductions.CC_to_BinaryCC]
steps [projection, in Complexity.NP.SAT.CookLevin.Subproblems.CC]
stepsim [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
steps_steps_k [lemma, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
steps_k_steps [lemma, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
steps_k [definition, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
steps__LM:39 [binder, in Complexity.NP.TM.M_LM2TM]
steps__LM:36 [binder, in Complexity.NP.TM.M_LM2TM]
steps__LM:19 [binder, in Complexity.NP.TM.M_LM2TM]
steps:1 [binder, in Complexity.NP.L.GenNPBool]
steps:111 [binder, in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
steps:12 [binder, in Complexity.NP.L.LMGenNP]
steps:13 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
steps:13 [binder, in Complexity.NP.TM.TMGenNP_fixed_mTM]
steps:14 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.SingleTMGenNP]
steps:17 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
steps:17 [binder, in Complexity.NP.TM.TMGenNP]
steps:22 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.SingleTMGenNP]
steps:228 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
steps:23 [binder, in Complexity.NP.TM.TMGenNP]
steps:25 [binder, in Complexity.NP.TM.TMGenNP_fixed_mTM]
steps:26 [binder, in Complexity.NP.L.GenNPBool]
steps:29 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
steps:3 [binder, in Complexity.NP.TM.TMGenNP]
steps:3 [binder, in Complexity.NP.SAT.CookLevin.Reductions.TMGenNP_fixed_singleTapeTM_to_FlatFunSingleTMGenNP]
steps:3 [binder, in Complexity.NP.TM.L_to_LM]
steps:3 [binder, in Complexity.NP.L.GenNP]
steps:31 [binder, in Complexity.NP.L.GenNPBool]
steps:32 [binder, in Complexity.NP.TM.M_LM2TM]
steps:33 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
steps:33 [binder, in Complexity.NP.TM.TMGenNP]
steps:33 [binder, in Complexity.NP.L.GenNPBool]
steps:38 [binder, in Complexity.NP.L.GenNPBool]
steps:4 [binder, in Complexity.NP.TM.TMGenNP_fixed_mTM]
steps:42 [binder, in Complexity.NP.TM.M_LM2TM]
steps:44 [binder, in Complexity.NP.TM.TMGenNP]
steps:44 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
steps:45 [binder, in Complexity.NP.TM.M_LM2TM]
steps:46 [binder, in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
steps:49 [binder, in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
steps:49 [binder, in Complexity.NP.TM.TMGenNP]
steps:52 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.SingleTMGenNP]
steps:53 [binder, in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
steps:595 [binder, in Complexity.NP.TM.LM_to_mTM]
steps:600 [binder, in Complexity.NP.TM.LM_to_mTM]
steps:605 [binder, in Complexity.NP.TM.LM_to_mTM]
steps:609 [binder, in Complexity.NP.TM.LM_to_mTM]
steps:618 [binder, in Complexity.NP.TM.LM_to_mTM]
steps:622 [binder, in Complexity.NP.TM.LM_to_mTM]
steps:7 [binder, in Complexity.NP.TM.L_to_LM]
steps:70 [binder, in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
steps:9 [binder, in Complexity.NP.TM.TMGenNP]
steps:9 [binder, in Complexity.NP.L.GenNP]
StepTM [library]
StepTM [library]
stepT:120 [binder, in Complexity.Libs.CookPrelim.PolyBounds]
step_comp [lemma, in Undecidability.TM.Combinators.While]
Step_steps_nice [lemma, in Complexity.TM.PrettyBounds.M2MBounds]
Step_steps_nice' [lemma, in Complexity.TM.PrettyBounds.M2MBounds]
step_app [constructor, in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
step_load [constructor, in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
step_beta [constructor, in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
step_pushVal [constructor, in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
step_is_halt_state [lemma, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
step_functional [lemma, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
step_iff [lemma, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
step_fun_step [lemma, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
step_step_fun [lemma, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
step_fun [definition, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
step_load [constructor, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
step_beta [constructor, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
step_pushVal [constructor, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
step_eval [lemma, in Undecidability.L.Util.L_facts]
step_equiv_subrelation [instance, in Undecidability.L.Util.L_facts]
step_star_subrelation [instance, in Undecidability.L.Util.L_facts]
step_star [lemma, in Undecidability.L.Util.L_facts]
step_Lproc [lemma, in Undecidability.L.Util.L_facts]
Step_Terminates [lemma, in Undecidability.TM.Single.StepTM]
Step_T [definition, in Undecidability.TM.Single.StepTM]
Step_steps [definition, in Undecidability.TM.Single.StepTM]
Step_Realise [lemma, in Undecidability.TM.Single.StepTM]
Step_Rel [definition, in Undecidability.TM.Single.StepTM]
Step_steps_nicer [lemma, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds_Loop]
step_nop_split [lemma, in Undecidability.TM.Combinators.Switch]
step_nop_transition [lemma, in Undecidability.TM.Combinators.Switch]
step_comp_liftR [lemma, in Undecidability.TM.Combinators.Switch]
step_comp_liftL [lemma, in Undecidability.TM.Combinators.Switch]
step_UC [lemma, in Complexity.L.AbstractMachines.Computable.UnivDecTime]
step_timeBS [lemma, in Undecidability.L.Complexity.ResourceMeasures]
step_beta [constructor, in Complexity.L.AbstractMachines.AbstractSubstMachine]
step_pushVal [constructor, in Complexity.L.AbstractMachines.AbstractSubstMachine]
Step_Terminates [lemma, in Undecidability.TM.L.HeapInterpreter.StepTM]
Step_T [definition, in Undecidability.TM.L.HeapInterpreter.StepTM]
Step_steps [definition, in Undecidability.TM.L.HeapInterpreter.StepTM]
Step_steps_CaseList [definition, in Undecidability.TM.L.HeapInterpreter.StepTM]
Step_steps_CaseList' [definition, in Undecidability.TM.L.HeapInterpreter.StepTM]
Step_steps_CaseCom [definition, in Undecidability.TM.L.HeapInterpreter.StepTM]
Step_Realise [lemma, in Undecidability.TM.L.HeapInterpreter.StepTM]
Step_Rel [definition, in Undecidability.TM.L.HeapInterpreter.StepTM]
Step_size [definition, in Undecidability.TM.L.HeapInterpreter.StepTM]
Step_var_Terminates [lemma, in Undecidability.TM.L.HeapInterpreter.StepTM]
Step_var_T [definition, in Undecidability.TM.L.HeapInterpreter.StepTM]
Step_var_steps [definition, in Undecidability.TM.L.HeapInterpreter.StepTM]
Step_var_steps_Lookup [definition, in Undecidability.TM.L.HeapInterpreter.StepTM]
Step_var_Realise [lemma, in Undecidability.TM.L.HeapInterpreter.StepTM]
Step_var [definition, in Undecidability.TM.L.HeapInterpreter.StepTM]
Step_var_Rel [definition, in Undecidability.TM.L.HeapInterpreter.StepTM]
Step_var_size [definition, in Undecidability.TM.L.HeapInterpreter.StepTM]
Step_app_Terminates [lemma, in Undecidability.TM.L.HeapInterpreter.StepTM]
Step_app_T [definition, in Undecidability.TM.L.HeapInterpreter.StepTM]
Step_app_steps [definition, in Undecidability.TM.L.HeapInterpreter.StepTM]
Step_app_steps_CaseList [definition, in Undecidability.TM.L.HeapInterpreter.StepTM]
Step_app_steps_CaseList' [definition, in Undecidability.TM.L.HeapInterpreter.StepTM]
Step_app_Realise [lemma, in Undecidability.TM.L.HeapInterpreter.StepTM]
Step_app [definition, in Undecidability.TM.L.HeapInterpreter.StepTM]
Step_app_Rel [definition, in Undecidability.TM.L.HeapInterpreter.StepTM]
Step_app_size [definition, in Undecidability.TM.L.HeapInterpreter.StepTM]
Step_lam_Terminates [lemma, in Undecidability.TM.L.HeapInterpreter.StepTM]
Step_lam_T [definition, in Undecidability.TM.L.HeapInterpreter.StepTM]
Step_lam_steps [definition, in Undecidability.TM.L.HeapInterpreter.StepTM]
Step_lam_steps_JumpTarget [definition, in Undecidability.TM.L.HeapInterpreter.StepTM]
Step_lam_Realise [lemma, in Undecidability.TM.L.HeapInterpreter.StepTM]
Step_lam [definition, in Undecidability.TM.L.HeapInterpreter.StepTM]
Step_lam_Rel [definition, in Undecidability.TM.L.HeapInterpreter.StepTM]
Step_lam_size [definition, in Undecidability.TM.L.HeapInterpreter.StepTM]
Step_Lookup [definition, in Undecidability.TM.L.HeapInterpreter.StepTM]
step_functional [lemma, in Complexity.L.AbstractMachines.AbstractHeapMachine]
step_inversion' [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
step_inversion [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
step_comp [lemma, in Undecidability.TM.Combinators.StateWhile]
step_k_inv [lemma, in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
step' [definition, in Undecidability.L.TM.TMinL.TMinL_extract]
step:114 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
step:119 [binder, in Complexity.Libs.CookPrelim.PolyBounds]
step:120 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
step:123 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
step:129 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
step:136 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
step:144 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
step:153 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
step:163 [binder, in Undecidability.L.Prelim.ARS]
step:175 [binder, in Undecidability.L.Prelim.ARS]
step:181 [binder, in Undecidability.L.Prelim.ARS]
step:190 [binder, in Undecidability.L.Prelim.ARS]
step:209 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
step:211 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
step:215 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
step:217 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
step:221 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
step:225 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
step:234 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
step:237 [binder, in Undecidability.L.Prelim.ARS]
step:243 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
stHypo [lemma, in Undecidability.L.Tactics.Lbeta]
stop [definition, in Undecidability.TM.Code.CaseList]
STOP [constructor, in Undecidability.TM.Code.CodeTM]
stopAfterFirst [definition, in Undecidability.TM.Code.CasePair]
stopAtStart [definition, in Undecidability.TM.Code.CasePair]
stop_lemma [lemma, in Undecidability.TM.Code.CaseList]
stop_not_in [lemma, in Undecidability.TM.Code.Copy]
stop':190 [binder, in Undecidability.TM.Compound.Compare]
stop':204 [binder, in Undecidability.TM.Compound.Compare]
strans [definition, in Complexity.NP.SAT.CookLevin.Subproblems.TM_single]
strconfig [abbreviation, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
strict_greatest_upper_bound [lemma, in Undecidability.TM.PrettyBounds.MaxList]
string [abbreviation, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
string [abbreviation, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
StringBase [library]
stringForConfig [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
stringForConfig_reprConfig [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
stringForTapeHalf [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
stringForTapeHalfP_eq [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
stringForTapeHalf_reprTape [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
stringForTapeHalf' [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
string_of_int [definition, in Undecidability.L.Tactics.Extract]
string_of_nat [definition, in Undecidability.Shared.Libs.DLW.Utils.utils_string]
string_of_N [definition, in Undecidability.Shared.Libs.DLW.Utils.utils_string]
string_reprConfig_length [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
string_reprTape_length [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
string_reprTapeP_length [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
str'':20 [binder, in Undecidability.TM.Code.ChangeAlphabet]
str':15 [binder, in Undecidability.TM.Code.ChangeAlphabet]
str':18 [binder, in Undecidability.TM.Code.BinNumbers.EncodeBinNumbers]
str':19 [binder, in Undecidability.TM.Code.ChangeAlphabet]
str':50 [binder, in Undecidability.TM.Code.ChangeAlphabet]
str':6 [binder, in Undecidability.TM.Code.ChangeAlphabet]
str':8 [binder, in Undecidability.TM.Code.ChangeAlphabet]
str1:10 [binder, in Undecidability.TM.Code.Copy]
str1:124 [binder, in Undecidability.TM.Compound.Compare]
str1:126 [binder, in Undecidability.TM.Compound.MoveToSymbol]
str1:131 [binder, in Undecidability.TM.Compound.Compare]
str1:143 [binder, in Undecidability.TM.Compound.Compare]
str1:147 [binder, in Undecidability.TM.Compound.MoveToSymbol]
str1:152 [binder, in Undecidability.TM.Compound.Compare]
str1:163 [binder, in Undecidability.TM.Compound.Compare]
str1:174 [binder, in Undecidability.TM.Compound.Compare]
str1:181 [binder, in Undecidability.TM.Compound.Compare]
str1:191 [binder, in Undecidability.TM.Compound.Compare]
str1:205 [binder, in Undecidability.TM.Compound.Compare]
str1:29 [binder, in Undecidability.TM.Code.Copy]
str2:12 [binder, in Undecidability.TM.Code.ChangeAlphabet]
str2:12 [binder, in Undecidability.TM.Code.Copy]
str2:125 [binder, in Undecidability.TM.Compound.Compare]
str2:127 [binder, in Undecidability.TM.Compound.MoveToSymbol]
str2:132 [binder, in Undecidability.TM.Compound.Compare]
str2:144 [binder, in Undecidability.TM.Compound.Compare]
str2:148 [binder, in Undecidability.TM.Compound.MoveToSymbol]
str2:153 [binder, in Undecidability.TM.Compound.Compare]
str2:164 [binder, in Undecidability.TM.Compound.Compare]
str2:17 [binder, in Undecidability.TM.Code.ChangeAlphabet]
str2:175 [binder, in Undecidability.TM.Compound.Compare]
str2:182 [binder, in Undecidability.TM.Compound.Compare]
str2:192 [binder, in Undecidability.TM.Compound.Compare]
str2:206 [binder, in Undecidability.TM.Compound.Compare]
str2:31 [binder, in Undecidability.TM.Code.Copy]
str3:126 [binder, in Undecidability.TM.Compound.Compare]
str3:133 [binder, in Undecidability.TM.Compound.Compare]
str3:18 [binder, in Undecidability.TM.Code.ChangeAlphabet]
str:108 [binder, in Undecidability.TM.Compound.Compare]
str:11 [binder, in Undecidability.TM.Code.ChangeAlphabet]
str:115 [binder, in Undecidability.TM.Compound.Compare]
str:13 [binder, in Undecidability.TM.Compound.WriteString]
str:16 [binder, in Undecidability.TM.Code.ChangeAlphabet]
str:17 [binder, in Undecidability.TM.Compound.WriteString]
str:21 [binder, in Undecidability.TM.Compound.WriteString]
str:22 [binder, in Undecidability.TM.Compound.WriteString]
str:25 [binder, in Undecidability.TM.Compound.WriteString]
str:35 [binder, in Undecidability.TM.Compound.WriteString]
str:38 [binder, in Undecidability.TM.Compound.WriteString]
str:41 [binder, in Undecidability.TM.Compound.WriteString]
str:44 [binder, in Undecidability.TM.Compound.WriteString]
str:48 [binder, in Undecidability.TM.Code.ChangeAlphabet]
str:5 [binder, in Undecidability.TM.Code.ChangeAlphabet]
str:7 [binder, in Undecidability.TM.Code.ChangeAlphabet]
str:7 [binder, in Undecidability.L.Prelim.StringBase]
str:8 [binder, in Undecidability.TM.Compound.WriteString]
st__o:27 [binder, in Complexity.L.TM.TMunflatten]
st':166 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
st':169 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
st':176 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
st':179 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
st':201 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
st':208 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
st':34 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
st':38 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
st1:10 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
st1:102 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
st1:105 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
st1:109 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
st1:113 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
st1:117 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
st1:121 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
st1:125 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
st1:129 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
st1:134 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
st1:138 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
st1:14 [binder, in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
st1:14 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
st1:142 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
st1:146 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
st1:152 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
st1:157 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
st1:162 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
st1:172 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
st1:19 [binder, in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
st1:212 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
st1:219 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
st1:224 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
st1:230 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
st1:237 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
st1:241 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
st1:249 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
st1:258 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
st1:263 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
st1:266 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
st1:271 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
st1:278 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
st1:285 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
st1:29 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
st1:292 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
st1:297 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
st1:300 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
st1:303 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
st1:308 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
st1:40 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
st1:45 [binder, in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
st1:47 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
st1:51 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
st1:54 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
st1:59 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
st1:63 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
st1:66 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
st1:73 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
st1:78 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
st1:90 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
st1:94 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
st1:98 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
st2:103 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
st2:106 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
st2:11 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
st2:110 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
st2:114 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
st2:118 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
st2:122 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
st2:126 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
st2:130 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
st2:135 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
st2:139 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
st2:143 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
st2:147 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
st2:15 [binder, in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
st2:15 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
st2:153 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
st2:158 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
st2:163 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
st2:173 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
st2:20 [binder, in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
st2:216 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
st2:221 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
st2:225 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
st2:231 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
st2:242 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
st2:251 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
st2:261 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
st2:267 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
st2:272 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
st2:279 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
st2:286 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
st2:293 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
st2:298 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
st2:30 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
st2:301 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
st2:304 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
st2:309 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
st2:41 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
st2:48 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
st2:49 [binder, in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
st2:52 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
st2:55 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
st2:60 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
st2:64 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
st2:70 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
st2:76 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
st2:81 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
st2:92 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
st2:95 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
st2:99 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
st3:107 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
st3:111 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
st3:115 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
st3:119 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
st3:148 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
st3:159 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
st3:213 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
st3:220 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
st3:232 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
st3:243 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
st3:259 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
st3:264 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
st3:268 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
st3:273 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
st3:280 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
st3:287 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
st3:305 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
st3:49 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
st3:61 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
st3:67 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
st3:74 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
st3:79 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
st3:91 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
st:154 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
st:165 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
st:168 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
st:175 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
st:178 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
st:18 [binder, in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
st:19 [binder, in Complexity.L.TM.TMflatFun]
st:193 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
st:196 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
st:200 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
st:203 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
st:207 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
st:236 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
st:24 [binder, in Complexity.L.TM.TMunflatten]
st:243 [binder, in Complexity.L.TM.TMflatComp]
st:247 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
st:253 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
st:254 [binder, in Undecidability.TM.Single.StepTM]
st:256 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
st:264 [binder, in Undecidability.TM.Single.StepTM]
st:269 [binder, in Undecidability.TM.Single.StepTM]
st:277 [binder, in Undecidability.TM.Single.StepTM]
st:278 [binder, in Undecidability.TM.Single.StepTM]
st:287 [binder, in Undecidability.TM.Single.StepTM]
st:29 [binder, in Complexity.L.TM.TMflat]
st:292 [binder, in Undecidability.TM.Single.StepTM]
st:294 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
st:299 [binder, in Undecidability.TM.Single.StepTM]
st:307 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
st:312 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
st:33 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
st:37 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
st:40 [binder, in Complexity.L.TM.TMflatComp]
st:45 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
st:57 [binder, in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
st:57 [binder, in Complexity.L.TM.TMflat]
st:65 [binder, in Complexity.L.TM.TMflat]
st:8 [binder, in Complexity.L.TM.TMflat]
st:97 [binder, in Complexity.L.TM.TMunflatten]
subcode [definition, in Undecidability.Shared.Libs.DLW.Code.subcode]
subcode [section, in Undecidability.Shared.Libs.DLW.Code.subcode]
subcode [library]
subcode_cons_invert_left [lemma, in Undecidability.Shared.Libs.DLW.Code.subcode]
subcode_snoc_inv [lemma, in Undecidability.Shared.Libs.DLW.Code.subcode]
subcode_cons_inv [lemma, in Undecidability.Shared.Libs.DLW.Code.subcode]
subcode_app_inv [lemma, in Undecidability.Shared.Libs.DLW.Code.subcode]
subcode_cons_invert_right [lemma, in Undecidability.Shared.Libs.DLW.Code.subcode]
subcode_app_invert_right [lemma, in Undecidability.Shared.Libs.DLW.Code.subcode]
subcode_cons [lemma, in Undecidability.Shared.Libs.DLW.Code.subcode]
subcode_app_end [lemma, in Undecidability.Shared.Libs.DLW.Code.subcode]
subcode_right [lemma, in Undecidability.Shared.Libs.DLW.Code.subcode]
subcode_left [lemma, in Undecidability.Shared.Libs.DLW.Code.subcode]
subcode_out_code [lemma, in Undecidability.Shared.Libs.DLW.Code.subcode]
subcode_in_code [lemma, in Undecidability.Shared.Libs.DLW.Code.subcode]
subcode_trans [lemma, in Undecidability.Shared.Libs.DLW.Code.subcode]
subcode_refl [lemma, in Undecidability.Shared.Libs.DLW.Code.subcode]
subcode_start_in_code [lemma, in Undecidability.Shared.Libs.DLW.Code.subcode]
subcode_length_le [lemma, in Undecidability.Shared.Libs.DLW.Code.subcode]
subcode_length' [lemma, in Undecidability.Shared.Libs.DLW.Code.subcode]
subcode_length [lemma, in Undecidability.Shared.Libs.DLW.Code.subcode]
subcode_cons_inj [lemma, in Undecidability.Shared.Libs.DLW.Code.subcode]
subcode_sss_terminates [lemma, in Undecidability.Shared.Libs.DLW.Code.sss]
subcode_sss_steps_stop [lemma, in Undecidability.Shared.Libs.DLW.Code.sss]
subcode_sss_steps_inv_1 [lemma, in Undecidability.Shared.Libs.DLW.Code.sss]
subcode_sss_subcode_compute_inv [lemma, in Undecidability.Shared.Libs.DLW.Code.sss]
subcode_sss_progress_inv [lemma, in Undecidability.Shared.Libs.DLW.Code.sss]
subcode_sss_terminates_inv [lemma, in Undecidability.Shared.Libs.DLW.Code.sss]
subcode_sss_subcode_inv [lemma, in Undecidability.Shared.Libs.DLW.Code.sss]
subcode_sss_step_inv_1 [lemma, in Undecidability.Shared.Libs.DLW.Code.sss]
subcode_sss_compute_inv [lemma, in Undecidability.Shared.Libs.DLW.Code.sss]
subcode_sss_steps_inv [lemma, in Undecidability.Shared.Libs.DLW.Code.sss]
subcode_sss_terminates_instr [lemma, in Undecidability.Shared.Libs.DLW.Code.sss]
subcode_sss_step_inv [lemma, in Undecidability.Shared.Libs.DLW.Code.sss]
subcode_sss_compute_instr [lemma, in Undecidability.Shared.Libs.DLW.Code.sss]
subcode_sss_compute_linstr [lemma, in Undecidability.Shared.Libs.DLW.Code.sss]
subcode_sss_compute_trans [lemma, in Undecidability.Shared.Libs.DLW.Code.sss]
subcode_sss_compute [lemma, in Undecidability.Shared.Libs.DLW.Code.sss]
subcode_sss_progress [lemma, in Undecidability.Shared.Libs.DLW.Code.sss]
subcode_sss_steps [lemma, in Undecidability.Shared.Libs.DLW.Code.sss]
subcode_sss_step [lemma, in Undecidability.Shared.Libs.DLW.Code.sss]
subcode.Q [variable, in Undecidability.Shared.Libs.DLW.Code.subcode]
subcode.X [variable, in Undecidability.Shared.Libs.DLW.Code.subcode]
_ <sc _ [notation, in Undecidability.Shared.Libs.DLW.Code.subcode]
sublist_C [lemma, in Undecidability.L.Computability.Enum]
sublist_T [lemma, in Undecidability.L.Computability.Enum]
subrel [definition, in Undecidability.TM.Util.Relations]
subrel_or2 [lemma, in Undecidability.TM.Util.Relations]
subrel_and2 [lemma, in Undecidability.TM.Util.Relations]
subrel_or [lemma, in Undecidability.TM.Util.Relations]
subrel_and [lemma, in Undecidability.TM.Util.Relations]
subsequence [definition, in Complexity.Libs.CookPrelim.MorePrelim]
subsequence [section, in Complexity.Libs.CookPrelim.MorePrelim]
subsequence_incl [lemma, in Complexity.Libs.CookPrelim.MorePrelim]
subsequence.X [variable, in Complexity.Libs.CookPrelim.MorePrelim]
_ subs _ [notation, in Complexity.Libs.CookPrelim.MorePrelim]
subst [definition, in Undecidability.L.L]
Subst [library]
substList [definition, in Undecidability.L.Tactics.LClos]
substList_nil [lemma, in Undecidability.L.Tactics.LClos]
substList_closed' [lemma, in Undecidability.L.Tactics.LClos]
substList_is_bound [lemma, in Undecidability.L.Tactics.LClos]
substList_var [lemma, in Undecidability.L.Tactics.LClos]
substList_var' [lemma, in Undecidability.L.Tactics.LClos]
substList_closed [lemma, in Undecidability.L.Tactics.LClos]
substList_bound [lemma, in Undecidability.L.Tactics.LClos]
SubstMachine [section, in Complexity.L.AbstractMachines.FunctionalDefinitions]
SubstMachine [library]
substP [definition, in Undecidability.L.AbstractMachines.FlatPro.Programs]
substP_correct [lemma, in Undecidability.L.AbstractMachines.FlatPro.Programs]
substP_correct' [lemma, in Undecidability.L.AbstractMachines.FlatPro.Programs]
substP_keepTrack_correct [lemma, in Complexity.L.AbstractMachines.FunctionalDefinitions]
substP_keepTrack [definition, in Complexity.L.AbstractMachines.FunctionalDefinitions]
substP_keepTrack'_keepsTrack [lemma, in Complexity.L.AbstractMachines.FunctionalDefinitions]
substP_keepTrack'_sound [lemma, in Complexity.L.AbstractMachines.FunctionalDefinitions]
substP_keepTrack' [definition, in Complexity.L.AbstractMachines.FunctionalDefinitions]
substring [definition, in Complexity.Libs.CookPrelim.MorePrelim]
substStep [definition, in Complexity.L.AbstractMachines.FunctionalDefinitions]
substStepResult [inductive, in Complexity.L.AbstractMachines.FunctionalDefinitions]
subst_many_app [lemma, in Undecidability.TM.L.CompilerBoolFuns.NaryApp]
subst_many_lam [lemma, in Undecidability.TM.L.CompilerBoolFuns.NaryApp]
subst_substList [lemma, in Undecidability.L.Tactics.LClos]
subst_gen_list [lemma, in Undecidability.TM.L.CompilerBoolFuns.Compiler_nat_facts]
subst_apply_encs_to [lemma, in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
subst_closed [lemma, in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
subst' [definition, in Undecidability.L.Tactics.Lbeta_nonrefl]
subst'_rho [lemma, in Undecidability.L.Tactics.Lbeta_nonrefl]
subst'_eq_proper [lemma, in Undecidability.L.Tactics.Lbeta_nonrefl]
subst'_int [lemma, in Undecidability.L.Tactics.Lbeta_nonrefl]
subst'_cls [lemma, in Undecidability.L.Tactics.Lbeta_nonrefl]
subst'_eq [lemma, in Undecidability.L.Tactics.Lbeta_nonrefl]
subs:2791 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
subs:36 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.CC]
subs:89 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
subterm [inductive, in Complexity.L.AbstractMachines.AbstractHeapMachine]
subtermAppL [constructor, in Complexity.L.AbstractMachines.AbstractHeapMachine]
subtermAppR [constructor, in Complexity.L.AbstractMachines.AbstractHeapMachine]
subtermLam [constructor, in Complexity.L.AbstractMachines.AbstractHeapMachine]
subtermPO [instance, in Complexity.L.AbstractMachines.AbstractHeapMachine]
subtermR [constructor, in Complexity.L.AbstractMachines.AbstractHeapMachine]
subterm_property [lemma, in Complexity.L.AbstractMachines.AbstractHeapMachine]
subterm_largestVar [lemma, in Complexity.L.AbstractMachines.AbstractHeapMachine]
subterm_app_r [lemma, in Complexity.L.AbstractMachines.AbstractHeapMachine]
subterm_app_l [lemma, in Complexity.L.AbstractMachines.AbstractHeapMachine]
subterm_lam_inv [lemma, in Complexity.L.AbstractMachines.AbstractHeapMachine]
Subtract [definition, in Undecidability.TM.Code.NatSub]
Subtract_SpecT [lemma, in Undecidability.TM.Code.NatSub]
Subtract_Realise [lemma, in Undecidability.TM.Code.NatSub]
Subtract_Rel [definition, in Undecidability.TM.Code.NatSub]
subtype [definition, in Undecidability.Shared.Libs.PSL.FiniteTypes.Arbitrary]
Subtypes [library]
subType_eq_dec [instance, in Undecidability.Shared.Libs.PSL.FiniteTypes.Arbitrary]
subtype_extensionality [lemma, in Undecidability.Shared.Libs.PSL.FiniteTypes.Arbitrary]
sub_le_mono [instance, in Complexity.TM.PrettyBounds.M2MBounds]
sub_time_bound_r [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
sub_time_bound_l [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
sub_maskC_ext_eq [lemma, in Complexity.L.Functions.BinNumsSub]
sub_maskC [definition, in Complexity.L.Functions.BinNumsSub]
sub_dec [lemma, in Undecidability.Synthetic.Infinite]
sub_time [definition, in Undecidability.L.Datatypes.LNat]
succ_size [lemma, in Undecidability.TM.Code.BinNumbers.PosMultTM]
SujectTape [section, in Undecidability.TM.Lifting.LiftAlphabet]
SujectTape.def [variable, in Undecidability.TM.Lifting.LiftAlphabet]
SujectTape.g [variable, in Undecidability.TM.Lifting.LiftAlphabet]
SujectTape.sig [variable, in Undecidability.TM.Lifting.LiftAlphabet]
SujectTape.tau [variable, in Undecidability.TM.Lifting.LiftAlphabet]
sumn [definition, in Undecidability.L.Prelim.MoreList]
sumNmap [definition, in Complexity.L.AbstractMachines.FunctionalDefinitions]
sumNmap' [definition, in Complexity.L.AbstractMachines.FunctionalDefinitions]
sumn_map_le_pointwise [lemma, in Undecidability.L.Prelim.MoreBase]
sumn_le_bound [lemma, in Undecidability.L.Prelim.MoreBase]
sumn_map_mult_c_l [lemma, in Complexity.NP.SAT.SAT_inNP]
sumn_map_const [lemma, in Complexity.Libs.CookPrelim.PolyBounds]
sumn_map_mono [lemma, in Complexity.Libs.CookPrelim.PolyBounds]
sumn_map_const [lemma, in Complexity.Complexity.UpToCPoly]
sumn_map_mono [lemma, in Complexity.Complexity.UpToCPoly]
sumn_repeat [lemma, in Complexity.NP.TM.LM_to_mTM]
sumn_repeat [lemma, in Undecidability.L.Prelim.MoreList]
sumn_concat [lemma, in Undecidability.L.Prelim.MoreList]
sumn_le_in [lemma, in Undecidability.L.Prelim.MoreList]
sumn_map_c [lemma, in Undecidability.L.Prelim.MoreList]
sumn_map_mult_c_r [lemma, in Undecidability.L.Prelim.MoreList]
sumn_map_add [lemma, in Undecidability.L.Prelim.MoreList]
sumn_map_natsLess [lemma, in Undecidability.L.Prelim.MoreList]
sumn_rev [lemma, in Undecidability.L.Prelim.MoreList]
sumn_app [lemma, in Undecidability.L.Prelim.MoreList]
sums [library]
sum_eq_dec [instance, in Undecidability.Shared.Libs.PSL.EqDec]
sum_eqb_spec [lemma, in Undecidability.L.Datatypes.LSum]
sum_eqb [definition, in Undecidability.L.Datatypes.LSum]
sum_eqb.spec__Y [variable, in Undecidability.L.Datatypes.LSum]
sum_eqb.eqb__Y [variable, in Undecidability.L.Datatypes.LSum]
sum_eqb.spec__X [variable, in Undecidability.L.Datatypes.LSum]
sum_eqb.eqb__X [variable, in Undecidability.L.Datatypes.LSum]
sum_eqb.Y [variable, in Undecidability.L.Datatypes.LSum]
sum_eqb.X [variable, in Undecidability.L.Datatypes.LSum]
sum_eqb [section, in Undecidability.L.Datatypes.LSum]
sum_power_binary_lt_inv [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
sum_powers_binary_le_inv [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
sum_power_binary_lt [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
sum_powers_ortho [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
sum_powers_euclid [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
sum_powers_bound [lemma, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
sum_powers [abbreviation, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
sum_list_rec_ge [lemma, in Complexity.TM.PrettyBounds.SpaceBounds]
sum_list_rec_S [lemma, in Complexity.TM.PrettyBounds.SpaceBounds]
sum_list_rec_plus [lemma, in Complexity.TM.PrettyBounds.SpaceBounds]
sum_list_rec [definition, in Complexity.TM.PrettyBounds.SpaceBounds]
sum_bijection [lemma, in Undecidability.Shared.Libs.DLW.Utils.sorting]
sum_bijection [section, in Undecidability.Shared.Libs.DLW.Utils.sorting]
sum_injective [lemma, in Undecidability.Shared.Libs.DLW.Utils.sorting]
sum_composed_permutation [lemma, in Undecidability.Shared.Libs.DLW.Utils.sorting]
sum_bounded_permutation [lemma, in Undecidability.Shared.Libs.DLW.Utils.sorting]
sum_bounded_permutation.flat_right [variable, in Undecidability.Shared.Libs.DLW.Utils.sorting]
sum_bounded_permutation.flat_left [variable, in Undecidability.Shared.Libs.DLW.Utils.sorting]
sum_bounded_permutation.flat [variable, in Undecidability.Shared.Libs.DLW.Utils.sorting]
sum_bounded_permutation.sum_permutation_1 [variable, in Undecidability.Shared.Libs.DLW.Utils.sorting]
sum_bounded_permutation.sigma_sum_split [variable, in Undecidability.Shared.Libs.DLW.Utils.sorting]
sum_bounded_permutation [section, in Undecidability.Shared.Libs.DLW.Utils.sorting]
sum_power_lt [lemma, in Undecidability.Shared.Libs.DLW.Utils.sums]
sum_0n_le_one [lemma, in Undecidability.Shared.Libs.DLW.Utils.sums]
sum_0n_mono [lemma, in Undecidability.Shared.Libs.DLW.Utils.sums]
sum_0n_scal_r [lemma, in Undecidability.Shared.Libs.DLW.Utils.sums]
sum_0n_scal_l [lemma, in Undecidability.Shared.Libs.DLW.Utils.sums]
sum_fold_map [lemma, in Undecidability.Shared.Libs.DLW.Utils.sums]
sum_0n_distr_r [lemma, in Undecidability.Shared.Libs.DLW.Utils.sums]
sum_0n_distr_l [lemma, in Undecidability.Shared.Libs.DLW.Utils.sums]
sum_0n_scal [lemma, in Undecidability.Shared.Libs.DLW.Utils.sums]
Sum_bounded_by_max [section, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
sum_eq_dec [instance, in Undecidability.Shared.Dec]
sum_decode [definition, in Undecidability.L.Functions.Decoding]
sum_2_power_2_injective [lemma, in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
sum_0n_distr_in_out [lemma, in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
sum_enum_ok [lemma, in Undecidability.Shared.Libs.PSL.FiniteTypes.CompoundFinTypes]
suplin_t__evalForTime [lemma, in Complexity.L.AbstractMachines.Computable.EvalForTime]
suplin_t__E [lemma, in Complexity.HierarchyTheorem.TimeHierarchyTheorem]
supported3 [lemma, in Undecidability.L.Tactics.ComputableDemo]
surject [definition, in Undecidability.TM.Lifting.LiftAlphabet]
surjectConf [definition, in Undecidability.TM.Lifting.LiftAlphabet]
SurjectInject [section, in Undecidability.TM.Code.ChangeAlphabet]
SurjectInject.def [variable, in Undecidability.TM.Code.ChangeAlphabet]
SurjectInject.retr [variable, in Undecidability.TM.Code.ChangeAlphabet]
SurjectInject.sig [variable, in Undecidability.TM.Code.ChangeAlphabet]
SurjectInject.tau [variable, in Undecidability.TM.Code.ChangeAlphabet]
surjective [definition, in Undecidability.Shared.Libs.PSL.Bijection]
surjective [definition, in Undecidability.TM.Util.Relations]
surjectReadSymbols [definition, in Undecidability.TM.Lifting.LiftAlphabet]
surjectSymbols [definition, in Undecidability.TM.Code.ChangeAlphabet]
surjectTape [definition, in Undecidability.TM.Lifting.LiftAlphabet]
surjectTape [abbreviation, in Undecidability.TM.Code.ChangeAlphabet]
surjectTapes [definition, in Undecidability.TM.Lifting.LiftAlphabet]
surjectTapes_nth [lemma, in Undecidability.TM.Lifting.LiftAlphabet]
surjectTape_isVoid' [lemma, in Undecidability.TM.Code.ChangeAlphabet]
surjectTape_isVoid [lemma, in Undecidability.TM.Code.ChangeAlphabet]
surjectTape_isVoid'_size [lemma, in Undecidability.TM.Code.ChangeAlphabet]
surjectTape_isVoid_size [lemma, in Undecidability.TM.Code.ChangeAlphabet]
surjectTape_injectTape [lemma, in Undecidability.TM.Code.ChangeAlphabet]
surject_inject_tape [lemma, in Undecidability.TM.Lifting.LiftAlphabet]
surject_inject' [lemma, in Undecidability.TM.Lifting.LiftAlphabet]
surject_inject_inr [lemma, in Undecidability.TM.Code.ChangeAlphabet]
surject_app [lemma, in Undecidability.TM.Code.ChangeAlphabet]
surject_cons [lemma, in Undecidability.TM.Code.ChangeAlphabet]
surject_inject [lemma, in Undecidability.TM.Code.ChangeAlphabet]
surj_t_compose [lemma, in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
surj_t [definition, in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
swap [definition, in Undecidability.Shared.Libs.DLW.Utils.sorting]
swap [definition, in Undecidability.TM.Compound.Compare]
swap [definition, in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
swap_bounded_permut [lemma, in Undecidability.Shared.Libs.DLW.Utils.sorting]
swap_inj [lemma, in Undecidability.Shared.Libs.DLW.Utils.sorting]
swap_involutive [lemma, in Undecidability.Shared.Libs.DLW.Utils.sorting]
swap_spec [lemma, in Undecidability.Shared.Libs.DLW.Utils.sorting]
swap_spec_j [lemma, in Undecidability.Shared.Libs.DLW.Utils.sorting]
swap_spec_i [lemma, in Undecidability.Shared.Libs.DLW.Utils.sorting]
Switch [definition, in Undecidability.TM.Combinators.Switch]
Switch [section, in Undecidability.TM.Combinators.Switch]
Switch [library]
SwitchTM [definition, in Undecidability.TM.Combinators.Switch]
Switch_RealiseIn [lemma, in Undecidability.TM.Combinators.Switch]
Switch_TerminatesIn' [lemma, in Undecidability.TM.Combinators.Switch]
Switch_TerminatesIn [lemma, in Undecidability.TM.Combinators.Switch]
Switch_Realise [lemma, in Undecidability.TM.Combinators.Switch]
Switch_split [lemma, in Undecidability.TM.Combinators.Switch]
Switch_merge [lemma, in Undecidability.TM.Combinators.Switch]
Switch_p [definition, in Undecidability.TM.Combinators.Switch]
Switch_halt [definition, in Undecidability.TM.Combinators.Switch]
Switch_trans [definition, in Undecidability.TM.Combinators.Switch]
Switch_SpecTReg [lemma, in Undecidability.TM.Hoare.HoareCombinators]
Switch_SpecT_strong [lemma, in Undecidability.TM.Hoare.HoareCombinators]
Switch_SpecT [lemma, in Undecidability.TM.Hoare.HoareCombinators]
Switch_Spec [lemma, in Undecidability.TM.Hoare.HoareCombinators]
Switch.F [variable, in Undecidability.TM.Combinators.Switch]
Switch.F' [variable, in Undecidability.TM.Combinators.Switch]
Switch.n [variable, in Undecidability.TM.Combinators.Switch]
Switch.pMf [variable, in Undecidability.TM.Combinators.Switch]
Switch.pM1 [variable, in Undecidability.TM.Combinators.Switch]
Switch.sig [variable, in Undecidability.TM.Combinators.Switch]
Mf _ [notation, in Undecidability.TM.Combinators.Switch]
p2 _ [notation, in Undecidability.TM.Combinators.Switch]
sx:13 [binder, in Undecidability.TM.Code.List.Rev]
sx:143 [binder, in Undecidability.TM.Code.Copy]
sx:163 [binder, in Undecidability.TM.Code.Copy]
sx:175 [binder, in Undecidability.TM.Code.Copy]
sx:28 [binder, in Undecidability.TM.Code.CompareValue]
sx:34 [binder, in Undecidability.TM.Code.List.Rev]
sx:36 [binder, in Undecidability.TM.Code.NatTM]
symbols:145 [binder, in Undecidability.TM.Single.StepTM]
symbols:148 [binder, in Undecidability.TM.Single.StepTM]
symb:13 [binder, in Undecidability.L.Complexity.UpToCNary]
symmetric [definition, in Undecidability.L.Prelim.ARS]
syms_diff [lemma, in Undecidability.TM.L.CompilerBoolFuns.Compiler]
sym_b:3 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
sym_s:2 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
sym_b [definition, in Undecidability.TM.L.CompilerBoolFuns.Compiler]
sym_s [definition, in Undecidability.TM.L.CompilerBoolFuns.Compiler]
sym:108 [binder, in Undecidability.TM.Lifting.LiftTapes]
sym:16 [binder, in Undecidability.TM.Basic.Mono]
sym:165 [binder, in Undecidability.TM.Compound.MoveToSymbol]
sym:185 [binder, in Undecidability.TM.Compound.MoveToSymbol]
sym:35 [binder, in Undecidability.TM.Basic.Mono]
sym:43 [binder, in Undecidability.TM.Lifting.LiftAlphabet]
sym:50 [binder, in Undecidability.TM.Code.Copy]
sym:6 [binder, in Undecidability.TM.Basic.Duo]
sym:64 [binder, in Undecidability.TM.Code.Copy]
sym:66 [binder, in Complexity.L.TM.TMflatten]
Synthetic [library]
sy:14 [binder, in Undecidability.TM.Code.List.Rev]
sy:170 [binder, in Undecidability.TM.Code.Copy]
sy:176 [binder, in Undecidability.TM.Code.Copy]
sy:29 [binder, in Undecidability.TM.Code.CompareValue]
sy:35 [binder, in Undecidability.TM.Code.List.Rev]
sy:37 [binder, in Undecidability.TM.Code.NatTM]
sz:15 [binder, in Undecidability.TM.Code.List.Rev]
sz:36 [binder, in Undecidability.TM.Code.List.Rev]
S_le_mono [instance, in Undecidability.TM.Util.ArithPrelim]
S_Rel [definition, in Undecidability.TM.Code.CaseNat]
S_le_proper [instance, in Undecidability.L.Prelim.MoreBase]
s_Univ:457 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
s_Univ:445 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
s_Univ:426 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
s_Univ:376 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
s_Univ:372 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
s_Univ:366 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
s_Univ:358 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
s_Univ:312 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
s_Univ:248 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
s_Univ:238 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
s_Univ:227 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
s_Univ:221 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
S_injective [lemma, in Complexity.Libs.CookPrelim.Tactics]
s__f:6 [binder, in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
s'':169 [binder, in Undecidability.L.Tactics.Extract]
s'':2642 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s'':2646 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s'':2719 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s'':2724 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s'':2749 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s'':2755 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s'0:167 [binder, in Undecidability.L.Tactics.Extract]
s':10 [binder, in Undecidability.L.Tactics.Lrewrite]
s':100 [binder, in Undecidability.L.Util.L_facts]
s':102 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
s':105 [binder, in Undecidability.L.Complexity.ResourceMeasures]
s':11 [binder, in Undecidability.L.AbstractMachines.FlatPro.ProgramsDef]
s':110 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
S':112 [binder, in Undecidability.L.Prelim.ARS]
s':112 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachine]
s':113 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
s':115 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachine]
s':116 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachine]
s':117 [binder, in Undecidability.L.Complexity.ResourceMeasures]
s':12 [binder, in Undecidability.L.AbstractMachines.FlatPro.UnfoldClos]
s':125 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
s':126 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachine]
s':128 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
s':129 [binder, in Undecidability.L.Util.L_facts]
s':136 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
s':14 [binder, in Undecidability.L.Tactics.Lbeta]
s':15 [binder, in Undecidability.L.Tactics.Lrewrite]
s':15 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachine]
s':156 [binder, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
s':16 [binder, in Complexity.L.TM.TMflat]
s':161 [binder, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
s':163 [binder, in Complexity.L.TM.TMunflatten]
s':168 [binder, in Undecidability.L.Tactics.Extract]
s':169 [binder, in Undecidability.L.Prelim.ARS]
s':175 [binder, in Complexity.L.TM.TMunflatten]
s':178 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
s':182 [binder, in Complexity.L.TM.TMunflatten]
s':189 [binder, in Complexity.L.TM.TMunflatten]
s':19 [binder, in Undecidability.L.Tactics.Lrewrite]
s':19 [binder, in Complexity.L.AbstractMachines.UnfoldTailRec]
s':19 [binder, in Undecidability.TM.L.Eval]
s':2 [binder, in Undecidability.L.Tactics.Lrewrite]
s':20 [binder, in Undecidability.L.Computability.Seval]
s':20 [binder, in Undecidability.L.AbstractMachines.FlatPro.UnfoldClos]
s':20 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachine]
s':21 [binder, in Complexity.L.AbstractMachines.UnfoldHeap]
s':21 [binder, in Undecidability.L.Complexity.ResourceMeasures]
s':219 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
s':22 [binder, in Undecidability.L.Tactics.Lrewrite]
s':22 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_string]
s':22 [binder, in Undecidability.L.Tactics.Lbeta_nonrefl]
s':221 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
s':221 [binder, in Complexity.L.TM.TMflatComp]
s':223 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
s':229 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
s':232 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
s':234 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
s':24 [binder, in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
s':24 [binder, in Complexity.NP.L.GenNPBool]
s':2549 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s':26 [binder, in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
s':26 [binder, in Undecidability.L.Tactics.Lbeta_nonrefl]
s':26 [binder, in Complexity.L.TM.TMflatFun]
s':2641 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s':2675 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s':2718 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s':2723 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s':2729 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s':2735 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s':2741 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s':2748 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s':2754 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s':2759 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s':2775 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s':2779 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s':28 [binder, in Complexity.L.AbstractMachines.UnfoldTailRec]
s':28 [binder, in Undecidability.L.Tactics.Lbeta_nonrefl]
s':28 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TM_single]
s':28 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachine]
s':2852 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s':2856 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s':2865 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s':2867 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s':2876 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s':2887 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s':29 [binder, in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisUnfoldClos]
s':29 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
s':29 [binder, in Complexity.NP.L.GenNPBool]
s':2900 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s':2906 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s':3 [binder, in Complexity.NP.L.GenNPBool]
s':30 [binder, in Complexity.L.AbstractMachines.Computable.EvalForTime]
s':30 [binder, in Undecidability.L.Complexity.ResourceMeasures]
s':300 [binder, in Undecidability.L.Tactics.Reflection]
s':305 [binder, in Undecidability.L.Tactics.Reflection]
s':31 [binder, in Complexity.L.AbstractMachines.UnfoldHeap]
s':310 [binder, in Undecidability.L.Tactics.Reflection]
s':32 [binder, in Undecidability.L.Tactics.Lrewrite]
s':32 [binder, in Undecidability.L.Tactics.Lbeta_nonrefl]
s':33 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
s':34 [binder, in Complexity.Complexity.SpaceBoundsTime]
s':35 [binder, in Complexity.NP.L.GenNPBool]
s':35 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.SingleTMGenNP]
s':35 [binder, in Undecidability.L.Tactics.Lbeta_nonrefl]
s':37 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
s':38 [binder, in Complexity.L.AbstractMachines.UnfoldTailRec]
s':38 [binder, in Undecidability.L.Complexity.ResourceMeasures]
s':40 [binder, in Complexity.NP.L.GenNPBool]
s':42 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.SingleTMGenNP]
s':44 [binder, in Complexity.L.AbstractMachines.UnfoldTailRec]
s':44 [binder, in Complexity.Complexity.SpaceBoundsTime]
s':46 [binder, in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisUnfoldClos]
s':47 [binder, in Undecidability.L.Computability.Seval]
s':48 [binder, in Undecidability.L.Complexity.ResourceMeasures]
s':49 [binder, in Undecidability.L.AbstractMachines.FlatPro.Programs]
s':5 [binder, in Undecidability.L.Complexity.ResourceMeasures]
s':50 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
s':50 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
s':52 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
s':52 [binder, in Undecidability.L.Tactics.Lrewrite]
s':52 [binder, in Undecidability.L.AbstractMachines.FlatPro.Programs]
s':52 [binder, in Complexity.Complexity.SpaceBoundsTime]
s':53 [binder, in Undecidability.TM.Code.ChangeAlphabet]
s':55 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
s':56 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
s':57 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
s':58 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
s':6 [binder, in Undecidability.L.Datatypes.LOptions]
s':60 [binder, in Undecidability.L.Complexity.ResourceMeasures]
s':61 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
s':61 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
s':61 [binder, in Complexity.Complexity.SpaceBoundsTime]
s':62 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
s':62 [binder, in Complexity.Complexity.SpaceBoundsTime]
s':63 [binder, in Complexity.L.TM.TMunflatten]
s':64 [binder, in Undecidability.L.Tactics.Lrewrite]
s':65 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
s':66 [binder, in Complexity.Complexity.SpaceBoundsTime]
s':71 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
s':72 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
s':75 [binder, in Undecidability.L.Complexity.ResourceMeasures]
s':78 [binder, in Undecidability.L.Complexity.ResourceMeasures]
s':79 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
s':79 [binder, in Undecidability.L.Complexity.ResourceMeasures]
s':80 [binder, in Undecidability.L.Util.L_facts]
s':80 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
s':81 [binder, in Undecidability.L.Tactics.LClos]
s':82 [binder, in Undecidability.L.Complexity.ResourceMeasures]
s':86 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
s':87 [binder, in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
s':88 [binder, in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
s':91 [binder, in Undecidability.L.Complexity.ResourceMeasures]
s':92 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
s':95 [binder, in Undecidability.L.Util.L_facts]
s':97 [binder, in Undecidability.L.Util.L_facts]
s':99 [binder, in Undecidability.L.Tactics.LClos]
s0':20 [binder, in Complexity.L.TM.TMflat]
s0':26 [binder, in Complexity.L.TM.TMflat]
s0':41 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.SingleTMGenNP]
s0:104 [binder, in Complexity.TM.PrettyBounds.BaseCodeSpace]
s0:110 [binder, in Complexity.TM.PrettyBounds.BaseCodeSpace]
s0:118 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
s0:118 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachine]
s0:120 [binder, in Undecidability.TM.Code.List.Nth]
s0:120 [binder, in Undecidability.TM.Univ.LowLevel]
s0:120 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
s0:121 [binder, in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
s0:121 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachine]
s0:124 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachine]
s0:13 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
s0:136 [binder, in Undecidability.TM.Univ.LookupAssociativeListTM]
s0:14 [binder, in Undecidability.TM.Code.List.Nth]
s0:163 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
s0:17 [binder, in Undecidability.TM.Code.List.Length]
s0:170 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
s0:181 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
s0:19 [binder, in Undecidability.TM.Code.List.Cons_constant]
s0:19 [binder, in Complexity.L.TM.TMflat]
s0:199 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
s0:2 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
s0:212 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
s0:225 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
s0:23 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
s0:23 [binder, in Undecidability.TM.Code.CasePair]
s0:24 [binder, in Complexity.L.TM.TMflat]
s0:24 [binder, in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
s0:27 [binder, in Undecidability.TM.Code.BinNumbers.PosCompareTM]
s0:30 [binder, in Undecidability.TM.Code.CaseList]
s0:32 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
s0:32 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
s0:32 [binder, in Undecidability.TM.PrettyBounds.MaxList]
s0:32 [binder, in Undecidability.TM.Code.CasePair]
s0:33 [binder, in Undecidability.TM.Code.BinNumbers.PosCompareTM]
s0:35 [binder, in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
s0:35 [binder, in Undecidability.TM.Code.List.App]
s0:36 [binder, in Complexity.L.AbstractMachines.UnfoldTailRec]
s0:36 [binder, in Undecidability.TM.Code.WriteValue]
s0:36 [binder, in Undecidability.TM.PrettyBounds.MaxList]
s0:39 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.SingleTMGenNP]
s0:40 [binder, in Undecidability.TM.Code.BinNumbers.PosCompareTM]
s0:41 [binder, in Undecidability.TM.Code.CaseList]
s0:41 [binder, in Undecidability.TM.Code.List.Length]
s0:43 [binder, in Complexity.TM.PrettyBounds.BaseCodeSpace]
s0:446 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
s0:45 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
s0:47 [binder, in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
s0:49 [binder, in Undecidability.TM.L.HeapInterpreter.LookupTM]
s0:50 [binder, in Undecidability.TM.Code.CasePair]
s0:54 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
s0:54 [binder, in Undecidability.TM.Code.List.Rev]
s0:55 [binder, in Undecidability.TM.Code.List.App]
s0:56 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
s0:58 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachine]
s0:61 [binder, in Undecidability.TM.Code.List.Length]
s0:64 [binder, in Undecidability.TM.Code.BinNumbers.PosAddTM]
s0:65 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
s0:70 [binder, in Undecidability.TM.Code.BinNumbers.PosAddTM]
s0:71 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachine]
s0:75 [binder, in Undecidability.TM.Code.BinNumbers.PosAddTM]
s0:8 [binder, in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
s0:80 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler]
s0:86 [binder, in Undecidability.TM.Code.CaseList]
s0:86 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler]
s0:88 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
s0:9 [binder, in Undecidability.TM.Code.List.Cons_constant]
s0:91 [binder, in Undecidability.TM.Code.CaseList]
s0:94 [binder, in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
s0:96 [binder, in Undecidability.TM.Univ.LowLevel]
s0:97 [binder, in Complexity.TM.PrettyBounds.BaseCodeSpace]
s1':154 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
s1':172 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
s1':47 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.SingleTMGenNP]
s1:100 [binder, in Complexity.TM.PrettyBounds.BaseCodeSpace]
s1:104 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
s1:106 [binder, in Complexity.TM.PrettyBounds.BaseCodeSpace]
s1:106 [binder, in Undecidability.TM.Code.CodeTM]
s1:107 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
s1:109 [binder, in Undecidability.TM.Compound.Compare]
s1:11 [binder, in Complexity.NP.SAT.CookLevin.Reductions.TCC_to_CC]
s1:111 [binder, in Complexity.TM.PrettyBounds.BaseCodeSpace]
s1:111 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
s1:111 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
s1:113 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
s1:116 [binder, in Undecidability.TM.Compound.Compare]
s1:117 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
s1:119 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
s1:120 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
s1:121 [binder, in Undecidability.TM.Code.List.Nth]
s1:121 [binder, in Undecidability.TM.Univ.LowLevel]
s1:122 [binder, in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
s1:126 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
s1:13 [binder, in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
s1:130 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
s1:132 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
s1:137 [binder, in Undecidability.TM.Univ.LookupAssociativeListTM]
s1:139 [binder, in Undecidability.TM.Code.Copy]
s1:14 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
s1:144 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
s1:144 [binder, in Undecidability.TM.Code.Copy]
s1:148 [binder, in Undecidability.TM.Compound.Compare]
s1:15 [binder, in Undecidability.TM.Code.CodeTM]
s1:152 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
s1:153 [binder, in Undecidability.TM.Code.Code]
s1:155 [binder, in Undecidability.TM.Compound.Compare]
s1:16 [binder, in Undecidability.TM.Code.List.Nth]
s1:16 [binder, in Undecidability.TM.PrettyBounds.MaxList]
s1:166 [binder, in Undecidability.TM.Compound.Compare]
s1:170 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
s1:170 [binder, in Undecidability.TM.Univ.Univ]
s1:171 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
s1:176 [binder, in Undecidability.TM.Compound.Compare]
s1:18 [binder, in Undecidability.TM.Code.List.Length]
s1:182 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
s1:183 [binder, in Undecidability.TM.Compound.Compare]
s1:187 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
s1:19 [binder, in Undecidability.TM.PrettyBounds.MaxList]
s1:190 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
s1:193 [binder, in Undecidability.TM.Compound.Compare]
s1:2 [binder, in Undecidability.L.Datatypes.LTerm]
s1:2 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler]
s1:207 [binder, in Undecidability.TM.Compound.Compare]
s1:210 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
s1:213 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
s1:223 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
s1:229 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
s1:234 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
s1:24 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
s1:25 [binder, in Undecidability.TM.Code.CaseList]
s1:25 [binder, in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
s1:254 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
s1:259 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
s1:26 [binder, in Undecidability.TM.Code.BinNumbers.PosCompareTM]
s1:262 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
s1:28 [binder, in Undecidability.TM.Code.CasePair]
s1:3 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
s1:30 [binder, in Undecidability.TM.Code.CodeTM]
s1:30 [binder, in Undecidability.TM.Code.List.App]
s1:315 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
s1:32 [binder, in Undecidability.TM.Code.BinNumbers.PosCompareTM]
s1:33 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
s1:33 [binder, in Undecidability.TM.Code.CodeTM]
s1:33 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
s1:33 [binder, in Undecidability.TM.PrettyBounds.MaxList]
s1:33 [binder, in Undecidability.TM.Code.CasePair]
s1:35 [binder, in Undecidability.TM.Code.CaseList]
s1:36 [binder, in Complexity.L.AbstractMachines.UnfoldHeap]
s1:36 [binder, in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
s1:36 [binder, in Undecidability.TM.Code.List.App]
s1:3617 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s1:37 [binder, in Undecidability.TM.PrettyBounds.MaxList]
s1:39 [binder, in Undecidability.TM.Code.BinNumbers.PosCompareTM]
s1:40 [binder, in Complexity.TM.Single.EncodeTapesInvariants]
s1:42 [binder, in Undecidability.TM.Code.CaseList]
s1:42 [binder, in Undecidability.TM.Code.List.Length]
s1:43 [binder, in Undecidability.TM.PrettyBounds.MaxList]
s1:44 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.SingleTMGenNP]
s1:447 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
s1:45 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
s1:45 [binder, in Complexity.TM.PrettyBounds.BaseCodeSpace]
s1:45 [binder, in Undecidability.TM.Code.CasePair]
s1:46 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
s1:46 [binder, in Undecidability.TM.PrettyBounds.MaxList]
s1:47 [binder, in Complexity.TM.PrettyBounds.BaseCodeSpace]
s1:48 [binder, in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
s1:5 [binder, in Complexity.TM.PrettyBounds.SpaceBounds]
s1:50 [binder, in Undecidability.TM.L.HeapInterpreter.LookupTM]
s1:51 [binder, in Undecidability.TM.Code.CasePair]
s1:55 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
s1:55 [binder, in Undecidability.TM.Code.List.Rev]
s1:56 [binder, in Undecidability.TM.Code.List.App]
s1:57 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
s1:6 [binder, in Undecidability.L.Computability.Acceptability]
s1:62 [binder, in Undecidability.TM.Code.List.Length]
s1:63 [binder, in Undecidability.TM.Code.BinNumbers.PosAddTM]
s1:66 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
s1:69 [binder, in Undecidability.TM.Code.BinNumbers.PosAddTM]
s1:71 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
s1:74 [binder, in Undecidability.TM.Code.BinNumbers.PosAddTM]
s1:78 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
s1:8 [binder, in Complexity.NP.SAT.CookLevin.Reductions.TCC_to_CC]
s1:85 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
s1:86 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
s1:88 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
s1:89 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
s1:9 [binder, in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
s1:91 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
s1:92 [binder, in Undecidability.TM.Code.CaseList]
s1:94 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
s1:95 [binder, in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
s1:97 [binder, in Undecidability.TM.Univ.LowLevel]
s1:98 [binder, in Undecidability.TM.Code.CodeTM]
s1:99 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
s2':155 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
s2':173 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
s2':48 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.SingleTMGenNP]
s2:100 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
s2:102 [binder, in Complexity.TM.PrettyBounds.BaseCodeSpace]
s2:105 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
s2:105 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
s2:107 [binder, in Complexity.TM.PrettyBounds.BaseCodeSpace]
s2:107 [binder, in Undecidability.TM.Code.CodeTM]
s2:108 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
s2:110 [binder, in Undecidability.TM.Compound.Compare]
s2:112 [binder, in Complexity.TM.PrettyBounds.BaseCodeSpace]
s2:112 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
s2:112 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
s2:114 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
s2:117 [binder, in Undecidability.TM.Compound.Compare]
s2:118 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
s2:12 [binder, in Complexity.NP.SAT.CookLevin.Reductions.TCC_to_CC]
s2:120 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
s2:122 [binder, in Undecidability.TM.Code.List.Nth]
s2:123 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
s2:124 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
s2:127 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
s2:131 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
s2:133 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
s2:138 [binder, in Undecidability.TM.Univ.LookupAssociativeListTM]
s2:139 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
s2:14 [binder, in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
s2:145 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
s2:147 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
s2:149 [binder, in Undecidability.TM.Compound.Compare]
s2:15 [binder, in Undecidability.TM.Code.List.Nth]
s2:15 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
s2:153 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
s2:154 [binder, in Undecidability.TM.Code.Code]
s2:156 [binder, in Undecidability.TM.Compound.Compare]
s2:16 [binder, in Undecidability.TM.Code.CodeTM]
s2:166 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
s2:167 [binder, in Undecidability.TM.Compound.Compare]
s2:17 [binder, in Undecidability.TM.PrettyBounds.MaxList]
s2:171 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
s2:171 [binder, in Undecidability.TM.Univ.Univ]
s2:172 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
s2:177 [binder, in Undecidability.TM.Compound.Compare]
s2:183 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
s2:184 [binder, in Undecidability.TM.Compound.Compare]
s2:188 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
s2:19 [binder, in Undecidability.TM.Code.List.Length]
s2:191 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
s2:194 [binder, in Undecidability.TM.Compound.Compare]
s2:20 [binder, in Undecidability.TM.PrettyBounds.MaxList]
s2:200 [binder, in Undecidability.L.Tactics.Extract]
s2:208 [binder, in Undecidability.TM.Compound.Compare]
s2:211 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
s2:214 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
s2:222 [binder, in Undecidability.L.Tactics.Extract]
s2:224 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
s2:23 [binder, in Undecidability.TM.Code.NatTM]
s2:230 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
s2:235 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
s2:25 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
s2:255 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
s2:26 [binder, in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
s2:260 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
s2:263 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
s2:3 [binder, in Undecidability.L.Datatypes.LTerm]
s2:3 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler]
s2:316 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
s2:34 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
s2:34 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
s2:3618 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s2:37 [binder, in Complexity.L.AbstractMachines.UnfoldHeap]
s2:37 [binder, in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
s2:42 [binder, in Complexity.TM.Single.EncodeTapesInvariants]
s2:43 [binder, in Undecidability.TM.Code.List.Length]
s2:44 [binder, in Undecidability.TM.PrettyBounds.MaxList]
s2:448 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
s2:45 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.SingleTMGenNP]
s2:46 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
s2:47 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
s2:47 [binder, in Undecidability.TM.PrettyBounds.MaxList]
s2:49 [binder, in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
s2:51 [binder, in Undecidability.TM.L.HeapInterpreter.LookupTM]
s2:56 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
s2:56 [binder, in Undecidability.TM.Code.List.Rev]
s2:58 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
s2:6 [binder, in Complexity.TM.PrettyBounds.SpaceBounds]
s2:63 [binder, in Undecidability.TM.Code.List.Length]
s2:7 [binder, in Undecidability.L.Computability.Acceptability]
s2:72 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
s2:81 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
s2:86 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
s2:87 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
s2:89 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
s2:9 [binder, in Complexity.NP.SAT.CookLevin.Reductions.TCC_to_CC]
s2:90 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
s2:92 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
s2:95 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
s2:96 [binder, in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
s2:99 [binder, in Undecidability.TM.Code.CodeTM]
s3:105 [binder, in Undecidability.TM.Code.NatTM]
s3:109 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
s3:114 [binder, in Complexity.TM.PrettyBounds.BaseCodeSpace]
s3:121 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
s3:123 [binder, in Undecidability.TM.Code.List.Nth]
s3:134 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
s3:139 [binder, in Undecidability.TM.Univ.LookupAssociativeListTM]
s3:173 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
s3:173 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
s3:175 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
s3:193 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
s3:195 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
s3:212 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
s3:231 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
s3:24 [binder, in Undecidability.TM.Code.NatTM]
s3:26 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
s3:31 [binder, in Undecidability.TM.Code.NatTM]
s3:35 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
s3:3619 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s3:39 [binder, in Undecidability.TM.Code.NatTM]
s3:449 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
s3:49 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
s3:50 [binder, in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
s3:52 [binder, in Undecidability.TM.L.HeapInterpreter.LookupTM]
s3:58 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
s3:59 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
s3:64 [binder, in Undecidability.TM.Code.List.Length]
s3:67 [binder, in Undecidability.TM.Code.NatTM]
s3:74 [binder, in Undecidability.TM.Code.NatTM]
s3:86 [binder, in Undecidability.TM.Code.NatTM]
s3:91 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
s3:95 [binder, in Undecidability.TM.Code.NatTM]
s3:97 [binder, in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
s4:106 [binder, in Undecidability.TM.Code.NatTM]
s4:113 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
s4:122 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
s4:135 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
s4:140 [binder, in Undecidability.TM.Univ.LookupAssociativeListTM]
s4:174 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
s4:197 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
s4:202 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
s4:213 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
s4:232 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
s4:450 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
s4:51 [binder, in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
s4:53 [binder, in Undecidability.TM.L.HeapInterpreter.LookupTM]
s4:60 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
s4:60 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
s4:68 [binder, in Undecidability.TM.Code.NatTM]
s4:75 [binder, in Undecidability.TM.Code.NatTM]
s4:87 [binder, in Undecidability.TM.Code.NatTM]
s4:92 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
s4:96 [binder, in Undecidability.TM.Code.NatTM]
s4:98 [binder, in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
s5:107 [binder, in Undecidability.TM.Code.NatTM]
s5:115 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
s5:136 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
s5:175 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
s5:214 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
s5:233 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
s5:451 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
s5:93 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
s5:97 [binder, in Undecidability.TM.Code.NatTM]
s6:176 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
s7:177 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
s:1 [binder, in Undecidability.L.Tactics.Lrewrite]
s:1 [binder, in Undecidability.L.Util.L_facts]
s:1 [binder, in Undecidability.L.Tactics.Lsimpl]
s:1 [binder, in Undecidability.L.Computability.Seval]
s:1 [binder, in Undecidability.L.Tactics.GenEncode]
s:1 [binder, in Complexity.TM.PrettyBounds.SpaceBounds]
s:1 [binder, in Undecidability.TM.Code.CaseBool]
s:1 [binder, in Undecidability.L.Tactics.LClos_Eval]
s:1 [binder, in Undecidability.L.Functions.Subst]
s:1 [binder, in Complexity.NP.L.LMGenNP]
s:1 [binder, in Complexity.L.AbstractMachines.FlatPro.Computable.Compile]
s:1 [binder, in Undecidability.L.Computability.Fixpoints]
s:1 [binder, in Undecidability.L.Tactics.Lbeta_nonrefl]
s:1 [binder, in Undecidability.L.Tactics.Lbeta]
s:1 [binder, in Undecidability.L.Computability.Acceptability]
s:1 [binder, in Undecidability.L.Computability.Rice]
s:1 [binder, in Complexity.L.AbstractMachines.Computable.HeapMachine]
s:1 [binder, in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
s:1 [binder, in Undecidability.L.Computability.Computability]
s:1 [binder, in Undecidability.L.Functions.Equality]
s:1 [binder, in Undecidability.L.Computability.Por]
s:1 [binder, in Undecidability.L.AbstractMachines.LargestVar]
s:1 [binder, in Complexity.L.AbstractMachines.LambdaDepth]
s:10 [binder, in Undecidability.L.Functions.Eval]
s:10 [binder, in Complexity.L.AbstractMachines.Computable.EvalForTime]
s:10 [binder, in Undecidability.TM.L.CompilerBoolFuns.NaryApp]
s:10 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
s:10 [binder, in Complexity.TM.PrettyBounds.SpaceBounds]
s:10 [binder, in Undecidability.L.Tactics.LClos]
s:10 [binder, in Undecidability.TM.Code.CaseFin]
s:10 [binder, in Complexity.TM.PrettyBounds.BaseCodeSpace]
s:10 [binder, in Undecidability.L.AbstractMachines.FlatPro.UnfoldClos]
s:10 [binder, in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
s:10 [binder, in Undecidability.TM.Code.ChangeAlphabet]
s:10 [binder, in Undecidability.L.Tactics.Reflection]
s:10 [binder, in Undecidability.L.Functions.Decoding]
s:10 [binder, in Undecidability.L.AbstractMachines.LargestVar]
s:10 [binder, in Complexity.L.AbstractMachines.LambdaDepth]
s:100 [binder, in Undecidability.TM.Code.Copy]
s:101 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
s:101 [binder, in Undecidability.L.Tactics.Extract]
s:101 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
s:101 [binder, in Undecidability.L.Complexity.ResourceMeasures]
s:101 [binder, in Undecidability.TM.Code.Code]
s:102 [binder, in Undecidability.L.Util.L_facts]
s:102 [binder, in Undecidability.L.Computability.Seval]
s:102 [binder, in Undecidability.L.Tactics.LClos]
s:102 [binder, in Undecidability.L.Tactics.LClos_Eval]
s:102 [binder, in Undecidability.TM.Code.Code]
s:103 [binder, in Undecidability.L.Complexity.ResourceMeasures]
s:103 [binder, in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
s:103 [binder, in Undecidability.TM.Code.Copy]
s:104 [binder, in Undecidability.L.Complexity.ResourceMeasures]
s:104 [binder, in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
s:105 [binder, in Undecidability.L.Tactics.LClos]
S:106 [binder, in Undecidability.Shared.Libs.DLW.Utils.php]
s:106 [binder, in Undecidability.L.Tactics.Computable]
s:107 [binder, in Undecidability.L.Prelim.ARS]
s:107 [binder, in Undecidability.TM.Compound.Shift]
s:108 [binder, in Undecidability.L.Util.L_facts]
s:108 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
s:108 [binder, in Undecidability.Shared.Libs.DLW.Vec.pos]
s:109 [binder, in Undecidability.L.Computability.Seval]
s:109 [binder, in Undecidability.TM.Univ.LowLevel]
s:109 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachine]
S:11 [binder, in Undecidability.L.Prelim.ARS]
s:11 [binder, in Undecidability.L.Util.L_facts]
s:11 [binder, in Complexity.HierarchyTheorem.TimeHierarchyTheorem]
s:11 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
s:11 [binder, in Undecidability.TM.Code.BinNumbers.PosIncrementTM]
s:11 [binder, in Complexity.L.AbstractMachines.Computable.UnivDecTime]
s:11 [binder, in Complexity.L.AbstractMachines.Computable.EvalForTimeBool]
s:11 [binder, in Undecidability.TM.Combinators.StateWhile]
s:11 [binder, in Undecidability.TM.Compound.Shift]
s:11 [binder, in Undecidability.TM.PrettyBounds.MaxList]
s:11 [binder, in Complexity.NP.L.GenNP]
s:11 [binder, in Undecidability.L.Functions.Size]
s:11 [binder, in Undecidability.L.Computability.Por]
s:11 [binder, in Undecidability.TM.Single.EncodeTapes]
s:11 [binder, in Undecidability.L.AbstractMachines.LargestVar]
S:110 [binder, in Undecidability.L.Prelim.ARS]
s:110 [binder, in Undecidability.L.Util.L_facts]
s:110 [binder, in Undecidability.TM.Compound.Shift]
s:111 [binder, in Undecidability.L.Util.L_facts]
s:111 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
s:112 [binder, in Undecidability.L.Computability.Seval]
s:112 [binder, in Undecidability.L.Tactics.LClos_Eval]
s:112 [binder, in Undecidability.L.Complexity.ResourceMeasures]
s:113 [binder, in Undecidability.L.Prelim.ARS]
s:113 [binder, in Undecidability.L.Util.L_facts]
s:113 [binder, in Undecidability.L.Tactics.LClos]
s:113 [binder, in Undecidability.TM.Univ.LowLevel]
s:113 [binder, in Undecidability.L.Tactics.Reflection]
s:113 [binder, in Undecidability.TM.Compound.Shift]
s:114 [binder, in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
s:114 [binder, in Undecidability.L.Computability.Seval]
s:114 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
s:114 [binder, in Undecidability.TM.Compound.Shift]
s:115 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
s:115 [binder, in Undecidability.L.Tactics.ComputableTime]
s:115 [binder, in Undecidability.L.Tactics.LClos]
s:116 [binder, in Undecidability.L.Util.L_facts]
s:116 [binder, in Undecidability.L.Complexity.ResourceMeasures]
s:116 [binder, in Undecidability.TM.Hoare.HoareRegister]
s:117 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
s:117 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachine]
s:118 [binder, in Undecidability.L.Util.L_facts]
s:118 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
s:118 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
s:119 [binder, in Undecidability.L.Prelim.ARS]
s:119 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
S:119 [binder, in Undecidability.Shared.Libs.DLW.Utils.php]
s:119 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachine]
s:12 [binder, in Undecidability.L.Functions.Eval]
s:12 [binder, in Complexity.TM.PrettyBounds.BaseCodeSpace]
s:12 [binder, in Undecidability.TM.Code.CodeTM]
s:12 [binder, in Complexity.L.AbstractMachines.FlatPro.Computable.Compile]
s:12 [binder, in Undecidability.L.Tactics.Lbeta_nonrefl]
s:12 [binder, in Undecidability.TM.TM]
s:12 [binder, in Undecidability.TM.L.Eval]
s:12 [binder, in Undecidability.L.Prelim.StringBase]
s:12 [binder, in Undecidability.L.AbstractMachines.FlatPro.ProgramsDef]
s:120 [binder, in Undecidability.L.Computability.Seval]
s:120 [binder, in Undecidability.TM.Compound.Shift]
s:121 [binder, in Undecidability.L.Util.L_facts]
s:122 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachine]
s:123 [binder, in Undecidability.L.Util.L_facts]
s:124 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
s:124 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
s:124 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.CC]
s:125 [binder, in Undecidability.L.Util.L_facts]
s:125 [binder, in Undecidability.L.Tactics.LClos]
s:125 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachine]
s:125 [binder, in Undecidability.TM.Code.Copy]
s:126 [binder, in Undecidability.TM.Single.StepTM]
s:127 [binder, in Undecidability.L.Prelim.ARS]
s:127 [binder, in Undecidability.L.Tactics.LClos]
s:127 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
s:127 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.CC]
s:128 [binder, in Undecidability.L.Util.L_facts]
s:128 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
s:128 [binder, in Undecidability.TM.Compound.Shift]
s:129 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
s:13 [binder, in Complexity.NP.SAT.CookLevin.Reductions.TCC_to_CC]
s:13 [binder, in Undecidability.L.Computability.Enum]
s:13 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
s:13 [binder, in Undecidability.TM.Code.CaseSum]
s:13 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
s:13 [binder, in Undecidability.L.Tactics.Lbeta]
s:13 [binder, in Undecidability.TM.Code.ChangeAlphabet]
s:13 [binder, in Undecidability.L.Computability.Acceptability]
s:13 [binder, in Complexity.L.AbstractMachines.Computable.LargestVar]
s:13 [binder, in Undecidability.L.Functions.Size]
s:13 [binder, in Complexity.L.AbstractMachines.LambdaDepth]
s:130 [binder, in Undecidability.L.Tactics.ComputableTime]
s:130 [binder, in Undecidability.TM.Univ.LowLevel]
s:130 [binder, in Undecidability.TM.Code.Copy]
s:131 [binder, in Undecidability.L.Tactics.LClos]
s:132 [binder, in Undecidability.L.Prelim.ARS]
s:132 [binder, in Undecidability.L.Util.L_facts]
s:133 [binder, in Undecidability.TM.Hoare.HoareRegister]
s:133 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachine]
s:133 [binder, in Undecidability.TM.Code.Code]
s:134 [binder, in Undecidability.L.Util.L_facts]
s:134 [binder, in Undecidability.L.Tactics.Extract]
s:134 [binder, in Undecidability.L.Tactics.LClos]
s:135 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
s:135 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
s:135 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachine]
s:135 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
s:136 [binder, in Undecidability.L.Util.L_facts]
s:137 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachine]
s:138 [binder, in Undecidability.L.Util.L_facts]
s:138 [binder, in Undecidability.L.Tactics.LClos]
s:138 [binder, in Undecidability.TM.Univ.LowLevel]
s:14 [binder, in Undecidability.L.Functions.Eval]
s:14 [binder, in Undecidability.L.Tactics.Lrewrite]
s:14 [binder, in Undecidability.L.Computability.Seval]
s:14 [binder, in Undecidability.L.Tactics.LClos]
s:14 [binder, in Complexity.TM.PrettyBounds.BaseCodeSpace]
s:14 [binder, in Complexity.L.AbstractMachines.FlatPro.Computable.Compile]
s:14 [binder, in Undecidability.TM.Code.WriteValue]
s:14 [binder, in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
s:14 [binder, in Undecidability.L.L]
S:14 [binder, in Undecidability.TM.Util.Relations]
s:14 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachine]
s:14 [binder, in Undecidability.TM.Util.TM_facts]
s:14 [binder, in Undecidability.L.Computability.Por]
s:14 [binder, in Undecidability.L.Computability.Scott]
s:14 [binder, in Undecidability.TM.Single.EncodeTapes]
s:140 [binder, in Undecidability.L.Util.L_facts]
s:140 [binder, in Undecidability.L.Tactics.LClos]
s:140 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachine]
s:141 [binder, in Undecidability.L.Tactics.Extract]
s:141 [binder, in Undecidability.TM.Hoare.HoareRegister]
s:142 [binder, in Undecidability.L.Tactics.LClos]
s:142 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachine]
s:143 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
s:143 [binder, in Undecidability.L.Tactics.ComputableTime]
s:143 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
s:144 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachine]
s:146 [binder, in Undecidability.L.Util.L_facts]
s:147 [binder, in Undecidability.TM.Hoare.HoareRegister]
s:148 [binder, in Undecidability.L.Util.L_facts]
s:148 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
s:15 [binder, in Complexity.HierarchyTheorem.TimeHierarchyTheorem]
s:15 [binder, in Undecidability.Shared.Libs.PSL.Lists.Position]
s:15 [binder, in Complexity.L.AbstractMachines.Computable.UnivDecTime]
s:15 [binder, in Complexity.L.AbstractMachines.UnfoldHeap]
s:15 [binder, in Undecidability.L.Tactics.LClos_Eval]
s:15 [binder, in Undecidability.L.Complexity.ResourceMeasures]
s:15 [binder, in Complexity.L.TM.TMflat]
s:15 [binder, in Undecidability.L.L]
s:15 [binder, in Undecidability.L.AbstractMachines.FlatPro.Programs]
s:15 [binder, in Complexity.L.TM.TMflatten]
s:15 [binder, in Undecidability.L.Computability.Rice]
s:15 [binder, in Complexity.L.AbstractMachines.Computable.LargestVar]
s:151 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
s:152 [binder, in Undecidability.L.Util.L_facts]
s:152 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
s:153 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
s:154 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
s:155 [binder, in Undecidability.L.Util.L_facts]
s:155 [binder, in Undecidability.L.Tactics.Extract]
s:155 [binder, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
s:155 [binder, in Undecidability.TM.Univ.LowLevel]
s:156 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
s:157 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
s:158 [binder, in Undecidability.TM.Univ.LowLevel]
s:158 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
s:159 [binder, in Undecidability.L.Util.L_facts]
s:159 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
s:159 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
s:159 [binder, in Undecidability.TM.Hoare.HoareRegister]
s:16 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
s:16 [binder, in Undecidability.L.Computability.Enum]
s:16 [binder, in Undecidability.L.Tactics.LClos]
s:16 [binder, in Complexity.NP.L.LMGenNP]
s:16 [binder, in Complexity.L.AbstractMachines.FlatPro.Computable.Compile]
s:16 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.SingleTMGenNP]
s:16 [binder, in Complexity.L.AbstractMachines.AbstractSubstMachine]
s:16 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
s:16 [binder, in Undecidability.L.Tactics.Reflection]
s:16 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
s:16 [binder, in Undecidability.TM.Compound.Multi]
s:160 [binder, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
s:160 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
s:161 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
s:162 [binder, in Undecidability.L.Util.L_facts]
s:163 [binder, in Undecidability.L.Tactics.Extract]
s:163 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
s:163 [binder, in Undecidability.TM.Code.Code]
s:165 [binder, in Complexity.L.TM.TMunflatten]
s:165 [binder, in Undecidability.TM.Hoare.HoareRegister]
s:166 [binder, in Undecidability.L.Util.L_facts]
s:166 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
s:167 [binder, in Undecidability.L.Prelim.ARS]
s:168 [binder, in Undecidability.L.Prelim.ARS]
s:168 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
s:17 [binder, in Undecidability.L.Functions.Eval]
s:17 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
s:17 [binder, in Undecidability.L.Computability.Seval]
s:17 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
s:17 [binder, in Undecidability.Shared.Libs.PSL.Lists.Position]
s:17 [binder, in Undecidability.L.Complexity.ResourceMeasures]
s:17 [binder, in Complexity.TM.PrettyBounds.BaseCodeSpace]
s:17 [binder, in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
s:17 [binder, in Complexity.L.AbstractMachines.AbstractSubstMachine]
s:17 [binder, in Undecidability.TM.L.Eval]
s:17 [binder, in Undecidability.TM.Util.TM_facts]
s:17 [binder, in Undecidability.TM.Compound.Shift]
s:17 [binder, in Undecidability.L.Functions.Size]
s:17 [binder, in Undecidability.TM.Single.EncodeTapes]
s:170 [binder, in Undecidability.TM.Hoare.HoareRegister]
s:172 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
s:173 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
s:174 [binder, in Complexity.L.TM.TMunflatten]
s:175 [binder, in Undecidability.L.Util.L_facts]
s:175 [binder, in Undecidability.TM.Single.StepTM]
s:175 [binder, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
s:176 [binder, in Undecidability.L.Prelim.ARS]
s:177 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
s:177 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
s:178 [binder, in Undecidability.L.Tactics.Extract]
s:178 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
s:179 [binder, in Undecidability.L.Util.L_facts]
s:18 [binder, in Undecidability.TM.Code.CaseList]
s:18 [binder, in Undecidability.TM.L.CompilerBoolFuns.NaryApp]
s:18 [binder, in Undecidability.L.Tactics.Lrewrite]
s:18 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
s:18 [binder, in Undecidability.L.Tactics.Extract]
s:18 [binder, in Complexity.L.AbstractMachines.UnfoldTailRec]
s:18 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_string]
s:18 [binder, in Undecidability.L.Tactics.LClos_Eval]
s:18 [binder, in Complexity.L.AbstractMachines.FlatPro.Computable.Compile]
s:18 [binder, in Undecidability.L.Functions.Size]
s:181 [binder, in Complexity.L.TM.TMunflatten]
s:182 [binder, in Undecidability.L.Prelim.ARS]
s:182 [binder, in Undecidability.TM.Single.StepTM]
s:182 [binder, in Undecidability.TM.Hoare.HoareRegister]
s:183 [binder, in Undecidability.L.Util.L_facts]
s:183 [binder, in Undecidability.TM.Single.StepTM]
s:184 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
s:184 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
s:186 [binder, in Undecidability.L.Tactics.Extract]
s:188 [binder, in Undecidability.L.Util.L_facts]
s:188 [binder, in Complexity.L.TM.TMunflatten]
s:189 [binder, in Undecidability.TM.Single.StepTM]
s:19 [binder, in Undecidability.L.Functions.Eval]
s:19 [binder, in Undecidability.TM.L.CompilerBoolFuns.NaryApp]
s:19 [binder, in Undecidability.L.Util.L_facts]
s:19 [binder, in Undecidability.L.Computability.Seval]
s:19 [binder, in Undecidability.Shared.Libs.PSL.Lists.Position]
s:19 [binder, in Undecidability.L.AbstractMachines.FlatPro.UnfoldClos]
s:19 [binder, in Complexity.L.AbstractMachines.FlatPro.Computable.Compile]
s:19 [binder, in Complexity.L.TM.TMflatten]
s:19 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachine]
s:19 [binder, in Undecidability.L.Tactics.Reflection]
s:19 [binder, in Undecidability.TM.L.CaseCom]
s:19 [binder, in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
s:19 [binder, in Complexity.L.AbstractMachines.Computable.LargestVar]
s:19 [binder, in Undecidability.TM.Code.BinNumbers.PosShiftTM]
s:190 [binder, in Undecidability.L.Tactics.ComputableTime]
s:190 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
s:190 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
s:193 [binder, in Undecidability.L.Util.L_facts]
s:195 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
s:196 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
s:197 [binder, in Undecidability.TM.Single.StepTM]
s:198 [binder, in Undecidability.TM.Code.Copy]
s:199 [binder, in Undecidability.L.Util.L_facts]
s:2 [binder, in Undecidability.TM.L.CompilerBoolFuns.NaryApp]
s:2 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
s:2 [binder, in Undecidability.TM.Basic.Null]
s:2 [binder, in Undecidability.Shared.Libs.PSL.Lists.Position]
s:2 [binder, in Complexity.TM.PrettyBounds.BaseCodeSpace]
s:2 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
s:2 [binder, in Undecidability.L.Functions.Encoding]
s:20 [binder, in Complexity.L.AbstractMachines.UnfoldHeap]
s:20 [binder, in Undecidability.L.Complexity.ResourceMeasures]
s:20 [binder, in Undecidability.TM.Code.CodeTM]
s:20 [binder, in Complexity.L.AbstractMachines.FlatPro.Computable.Compile]
s:20 [binder, in Undecidability.L.L]
s:20 [binder, in Undecidability.TM.Hoare.HoareRegister]
s:20 [binder, in Complexity.L.AbstractMachines.AbstractSubstMachine]
s:20 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
S:20 [binder, in Undecidability.TM.Util.Relations]
s:20 [binder, in Undecidability.TM.Util.TM_facts]
s:20 [binder, in Undecidability.L.Functions.Decoding]
s:20 [binder, in Undecidability.TM.Compound.Shift]
s:20 [binder, in Complexity.L.AbstractMachines.Computable.LargestVar]
s:20 [binder, in Undecidability.TM.Single.EncodeTapes]
s:200 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
s:201 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
s:204 [binder, in Undecidability.L.Util.L_facts]
s:207 [binder, in Undecidability.TM.Single.StepTM]
s:207 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
s:209 [binder, in Undecidability.L.Util.L_facts]
s:209 [binder, in Undecidability.TM.Code.Copy]
s:21 [binder, in Undecidability.L.Tactics.Lrewrite]
s:21 [binder, in Undecidability.L.Tactics.LClos_Eval]
s:21 [binder, in Complexity.L.AbstractMachines.FlatPro.Computable.Compile]
s:21 [binder, in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
s:21 [binder, in Undecidability.L.Tactics.Lbeta_nonrefl]
s:21 [binder, in Complexity.L.TM.TMflatten]
s:21 [binder, in Complexity.NP.TM.TMGenNP_fixed_mTM]
s:21 [binder, in Undecidability.TM.Code.BinNumbers.PosShiftTM]
s:211 [binder, in Undecidability.L.Tactics.Extract]
s:212 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
s:212 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
s:213 [binder, in Undecidability.L.Prelim.ARS]
s:214 [binder, in Undecidability.L.Util.L_facts]
s:214 [binder, in Complexity.L.TM.TMflatComp]
s:215 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
s:216 [binder, in Complexity.L.TM.TMflatComp]
s:216 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
s:218 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
s:218 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
s:219 [binder, in Undecidability.L.Util.L_facts]
s:22 [binder, in Complexity.L.AbstractMachines.Computable.EvalForTime]
s:22 [binder, in Undecidability.TM.L.CompilerBoolFuns.NaryApp]
s:22 [binder, in Undecidability.L.Computability.Enum]
s:22 [binder, in Complexity.TM.PrettyBounds.BaseCodeSpace]
s:22 [binder, in Complexity.L.AbstractMachines.FlatPro.Computable.Compile]
s:22 [binder, in Undecidability.TM.Code.WriteValue]
s:22 [binder, in Undecidability.TM.Compound.Shift]
s:22 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
s:220 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
s:220 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
s:220 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
s:220 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
s:221 [binder, in Undecidability.L.Prelim.ARS]
s:222 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
s:223 [binder, in Complexity.L.TM.TMflatComp]
s:224 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
s:224 [binder, in Undecidability.L.Util.L_facts]
s:224 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
s:225 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
s:225 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
s:226 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
s:226 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
s:227 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
s:228 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
s:23 [binder, in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
s:23 [binder, in Undecidability.L.Computability.Seval]
s:23 [binder, in Undecidability.L.AbstractMachines.FlatPro.Programs]
s:23 [binder, in Complexity.L.TM.TMflatten]
s:23 [binder, in Undecidability.L.Tactics.Reflection]
s:23 [binder, in Undecidability.TM.PrettyBounds.MaxList]
s:23 [binder, in Undecidability.TM.Single.EncodeTapes]
s:23 [binder, in Undecidability.TM.Code.BinNumbers.PosShiftTM]
s:230 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
s:230 [binder, in Undecidability.L.Util.L_facts]
s:230 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
s:231 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
s:231 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
s:233 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
s:233 [binder, in Undecidability.L.Util.L_facts]
s:233 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
s:233 [binder, in Complexity.L.TM.TMunflatten]
s:233 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
s:235 [binder, in Undecidability.L.Util.L_facts]
s:235 [binder, in Undecidability.TM.Single.StepTM]
s:236 [binder, in Undecidability.L.Util.L_facts]
s:236 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
s:237 [binder, in Undecidability.L.Util.L_facts]
s:238 [binder, in Undecidability.L.Prelim.ARS]
s:238 [binder, in Undecidability.L.Util.L_facts]
s:238 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
s:24 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
s:24 [binder, in Complexity.L.AbstractMachines.Computable.EvalForTime]
s:24 [binder, in Undecidability.L.Tactics.GenEncode]
s:24 [binder, in Complexity.L.AbstractMachines.UnfoldHeap]
s:24 [binder, in Complexity.TM.PrettyBounds.BaseCodeSpace]
s:24 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.SingleTMGenNP]
s:24 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
s:24 [binder, in Complexity.L.TM.TMflatFun]
s:241 [binder, in Undecidability.L.Util.L_facts]
s:241 [binder, in Undecidability.TM.Util.TM_facts]
s:242 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
s:243 [binder, in Undecidability.TM.Util.TM_facts]
s:245 [binder, in Undecidability.TM.Single.StepTM]
s:245 [binder, in Undecidability.TM.Util.TM_facts]
s:248 [binder, in Undecidability.TM.Util.TM_facts]
s:25 [binder, in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
s:25 [binder, in Undecidability.L.Util.L_facts]
s:25 [binder, in Undecidability.L.Computability.Enum]
s:25 [binder, in Undecidability.Shared.Libs.PSL.Lists.Position]
s:25 [binder, in Undecidability.L.Complexity.ResourceMeasures]
s:25 [binder, in Undecidability.L.Tactics.Lbeta_nonrefl]
s:25 [binder, in Complexity.Complexity.SpaceBoundsTime]
s:25 [binder, in Complexity.L.TM.TMflatten]
s:25 [binder, in Undecidability.L.Computability.Rice]
s:25 [binder, in Undecidability.TM.Compound.Shift]
s:25 [binder, in Undecidability.TM.PrettyBounds.MaxList]
s:252 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
s:253 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
s:253 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s:254 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
s:2548 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s:255 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s:257 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s:257 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
s:26 [binder, in Complexity.L.AbstractMachines.Computable.EvalForTime]
s:26 [binder, in Undecidability.L.Tactics.Lrewrite]
s:26 [binder, in Complexity.TM.PrettyBounds.BaseCodeSpace]
s:26 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
S:26 [binder, in Undecidability.TM.Util.Relations]
s:26 [binder, in Undecidability.L.Computability.Synthetic]
s:26 [binder, in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
s:261 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s:2638 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s:265 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s:267 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
s:269 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s:27 [binder, in Complexity.L.AbstractMachines.Computable.EvalForTime]
s:27 [binder, in Complexity.L.AbstractMachines.UnfoldTailRec]
s:27 [binder, in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisUnfoldClos]
s:27 [binder, in Undecidability.L.Datatypes.List.List_nat]
s:27 [binder, in Undecidability.L.L]
s:27 [binder, in Undecidability.L.Tactics.Lbeta_nonrefl]
s:27 [binder, in Undecidability.L.AbstractMachines.FlatPro.Programs]
s:27 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TM_single]
s:27 [binder, in Complexity.L.TM.TMflatten]
s:27 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachine]
s:27 [binder, in Undecidability.TM.Compound.Shift]
s:271 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
s:2712 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s:2715 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s:272 [binder, in Undecidability.L.Tactics.Reflection]
s:2722 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s:2728 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s:273 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s:2734 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s:2740 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s:2747 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s:2752 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s:2758 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s:2764 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s:2769 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s:2774 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s:2778 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s:278 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s:2784 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s:2790 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s:28 [binder, in Undecidability.L.Util.L_facts]
s:28 [binder, in Undecidability.TM.Code.BinNumbers.PosMultTM]
s:28 [binder, in Undecidability.L.Computability.Enum]
s:28 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
s:28 [binder, in Complexity.L.AbstractMachines.UnfoldHeap]
s:28 [binder, in Complexity.TM.PrettyBounds.BaseCodeSpace]
s:28 [binder, in Complexity.L.AbstractMachines.AbstractSubstMachine]
s:28 [binder, in Undecidability.L.Tactics.Reflection]
s:28 [binder, in Undecidability.L.Computability.Rice]
s:28 [binder, in Undecidability.TM.PrettyBounds.MaxList]
s:280 [binder, in Undecidability.L.Tactics.Reflection]
s:2835 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s:2836 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s:2837 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s:2840 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s:2843 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s:2846 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s:285 [binder, in Undecidability.L.Tactics.Reflection]
s:2851 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s:2855 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s:2859 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s:2864 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s:2866 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s:2869 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s:2875 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s:2878 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s:288 [binder, in Undecidability.L.Tactics.Reflection]
s:2886 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s:2891 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s:2899 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s:29 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
s:29 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
s:29 [binder, in Undecidability.L.Tactics.Extract]
s:29 [binder, in Undecidability.L.Complexity.ResourceMeasures]
s:29 [binder, in Undecidability.L.Computability.Rice]
s:29 [binder, in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
s:29 [binder, in Undecidability.TM.Compound.Shift]
s:2904 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s:2905 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s:291 [binder, in Undecidability.L.Tactics.Reflection]
s:293 [binder, in Undecidability.L.Tactics.Reflection]
s:295 [binder, in Undecidability.L.Tactics.Reflection]
s:2970 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s:2978 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s:298 [binder, in Undecidability.L.Tactics.Reflection]
s:2985 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s:3 [binder, in Undecidability.L.Tactics.Lsimpl]
s:3 [binder, in Undecidability.TM.Code.CaseFin]
s:3 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_nat_facts]
s:3 [binder, in Complexity.L.AbstractMachines.Computable.EvalForTimeBool]
s:3 [binder, in Complexity.L.AbstractMachines.UnfoldHeap]
s:3 [binder, in Undecidability.L.Complexity.ResourceMeasures]
s:3 [binder, in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
s:3 [binder, in Undecidability.L.Computability.Fixpoints]
s:3 [binder, in Undecidability.L.Computability.Decidability]
s:3 [binder, in Undecidability.TM.Compound.Shift]
s:30 [binder, in Undecidability.L.Tactics.Lrewrite]
s:30 [binder, in Undecidability.L.Util.L_facts]
s:30 [binder, in Complexity.L.AbstractMachines.UnfoldTailRec]
s:30 [binder, in Undecidability.L.L]
s:30 [binder, in Undecidability.L.Tactics.Reflection]
s:3006 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s:3014 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s:3021 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s:303 [binder, in Undecidability.L.Tactics.Reflection]
s:308 [binder, in Undecidability.L.Tactics.Reflection]
s:31 [binder, in Undecidability.L.Util.L_facts]
s:31 [binder, in Undecidability.L.Computability.Enum]
s:31 [binder, in Undecidability.TM.Code.WriteValue]
s:31 [binder, in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
s:31 [binder, in Undecidability.L.Tactics.Lbeta_nonrefl]
s:31 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
s:31 [binder, in Undecidability.L.Computability.Rice]
s:31 [binder, in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
s:314 [binder, in Undecidability.TM.Single.StepTM]
s:315 [binder, in Undecidability.L.Tactics.Reflection]
s:318 [binder, in Undecidability.L.Tactics.Reflection]
s:32 [binder, in Undecidability.L.Util.L_facts]
s:32 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
s:32 [binder, in Undecidability.L.Computability.Seval]
s:32 [binder, in Undecidability.L.Tactics.LClos]
s:32 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
s:32 [binder, in Complexity.Complexity.SpaceBoundsTime]
s:320 [binder, in Undecidability.L.Tactics.Reflection]
s:324 [binder, in Undecidability.L.Tactics.Reflection]
s:326 [binder, in Undecidability.TM.Single.StepTM]
s:329 [binder, in Undecidability.TM.Single.StepTM]
s:33 [binder, in Undecidability.TM.L.CompilerBoolFuns.NaryApp]
s:33 [binder, in Undecidability.L.Computability.Enum]
s:33 [binder, in Undecidability.TM.Basic.Mono]
s:33 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
s:33 [binder, in Complexity.Complexity.SpaceBoundsTime]
s:33 [binder, in Undecidability.L.Tactics.Reflection]
s:336 [binder, in Undecidability.TM.Single.StepTM]
s:339 [binder, in Undecidability.TM.Single.StepTM]
s:34 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
s:34 [binder, in Complexity.L.AbstractMachines.UnfoldHeap]
s:34 [binder, in Undecidability.L.Complexity.ResourceMeasures]
s:34 [binder, in Complexity.TM.PrettyBounds.BaseCodeSpace]
s:34 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.SingleTMGenNP]
s:34 [binder, in Undecidability.L.Tactics.Lbeta_nonrefl]
s:34 [binder, in Complexity.L.AbstractMachines.AbstractSubstMachine]
s:35 [binder, in Undecidability.L.Computability.Seval]
s:35 [binder, in Undecidability.L.Tactics.LClos]
s:35 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
s:35 [binder, in Undecidability.TM.Code.CaseSum]
s:35 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachine]
s:35 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
s:35 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.CC]
s:351 [binder, in Undecidability.TM.Single.StepTM]
S:356 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
s:359 [binder, in Undecidability.TM.Single.StepTM]
s:36 [binder, in Undecidability.L.Computability.Enum]
s:36 [binder, in Complexity.TM.Single.EncodeTapesInvariants]
s:36 [binder, in Undecidability.TM.Compound.CopySymbols]
s:36 [binder, in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
s:36 [binder, in Complexity.TM.Single.DecodeTapes]
s:36 [binder, in Undecidability.L.Tactics.Reflection]
s:36 [binder, in Undecidability.L.Computability.Rice]
s:36 [binder, in Undecidability.L.Functions.Decoding]
s:366 [binder, in Undecidability.TM.Single.StepTM]
s:3695 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s:37 [binder, in Undecidability.TM.Basic.Mono]
s:37 [binder, in Undecidability.L.Complexity.ResourceMeasures]
s:37 [binder, in Complexity.L.TM.TMflatComp]
s:37 [binder, in Undecidability.L.Tactics.Lbeta_nonrefl]
s:37 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
s:37 [binder, in Undecidability.TM.Code.ChangeAlphabet]
s:38 [binder, in Complexity.L.AbstractMachines.Computable.EvalForTime]
s:38 [binder, in Undecidability.TM.L.CompilerBoolFuns.NaryApp]
s:38 [binder, in Undecidability.L.Computability.Enum]
s:38 [binder, in Undecidability.L.Tactics.ComputableTime]
s:38 [binder, in Undecidability.L.Computability.Seval]
s:38 [binder, in Undecidability.TM.Code.CodeTM]
s:38 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.SingleTMGenNP]
s:38 [binder, in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
s:39 [binder, in Undecidability.TM.Compound.CopySymbols]
s:39 [binder, in Undecidability.L.AbstractMachines.FlatPro.Programs]
s:39 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
s:39 [binder, in Undecidability.TM.PrettyBounds.MaxList]
s:4 [binder, in Undecidability.L.Datatypes.LOptions]
s:4 [binder, in Undecidability.L.Tactics.LClos]
s:4 [binder, in Undecidability.L.Complexity.ResourceMeasures]
s:4 [binder, in Complexity.TM.PrettyBounds.BaseCodeSpace]
s:4 [binder, in Complexity.L.TM.TapeDecode]
s:4 [binder, in Undecidability.L.Datatypes.LTerm]
s:4 [binder, in Undecidability.L.L]
s:4 [binder, in Undecidability.L.AbstractMachines.FlatPro.Programs]
s:4 [binder, in Undecidability.TM.L.Eval]
s:4 [binder, in Undecidability.L.Prelim.StringBase]
s:4 [binder, in Undecidability.L.Tactics.Reflection]
s:4 [binder, in Undecidability.L.AbstractMachines.FlatPro.ProgramsDef]
s:4 [binder, in Undecidability.TM.Basic.Duo]
s:4 [binder, in Undecidability.L.Computability.Scott]
s:40 [binder, in Complexity.L.AbstractMachines.UnfoldTailRec]
s:40 [binder, in Undecidability.L.Computability.Enum]
s:41 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
s:41 [binder, in Undecidability.L.Computability.Seval]
s:41 [binder, in Undecidability.L.Tactics.GenEncode]
s:41 [binder, in Undecidability.L.Complexity.ResourceMeasures]
s:41 [binder, in Complexity.L.AbstractMachines.AbstractSubstMachine]
s:41 [binder, in Undecidability.L.Tactics.Reflection]
s:413 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
s:42 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
s:42 [binder, in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
s:42 [binder, in Complexity.Complexity.SpaceBoundsTime]
s:42 [binder, in Undecidability.TM.Util.TM_facts]
s:43 [binder, in Undecidability.TM.L.CompilerBoolFuns.NaryApp]
s:43 [binder, in Undecidability.L.Computability.Seval]
s:43 [binder, in Undecidability.L.AbstractMachines.FlatPro.Programs]
s:43 [binder, in Undecidability.TM.Code.ChangeAlphabet]
s:438 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
s:44 [binder, in Undecidability.L.Util.L_facts]
s:44 [binder, in Undecidability.TM.Compound.MoveToSymbol]
s:44 [binder, in Undecidability.TM.Util.TM_facts]
s:44 [binder, in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
s:440 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
s:45 [binder, in Complexity.L.AbstractMachines.Computable.EvalForTime]
s:45 [binder, in Undecidability.TM.L.CompilerBoolFuns.NaryApp]
s:45 [binder, in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisUnfoldClos]
s:45 [binder, in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
s:45 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
s:45 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachine]
s:451 [binder, in Undecidability.TM.Hoare.HoareRegister]
s:46 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
s:46 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
s:46 [binder, in Undecidability.L.Computability.Seval]
s:46 [binder, in Undecidability.L.Complexity.ResourceMeasures]
s:46 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.SingleTMGenNP]
s:46 [binder, in Complexity.Complexity.SpaceBoundsTime]
s:46 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
s:46 [binder, in Undecidability.TM.Util.TM_facts]
s:46 [binder, in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
s:47 [binder, in Undecidability.L.Tactics.Lrewrite]
s:47 [binder, in Undecidability.L.Util.L_facts]
s:47 [binder, in Undecidability.L.Complexity.ResourceMeasures]
s:47 [binder, in Undecidability.TM.Code.CaseSum]
s:47 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s:47 [binder, in Undecidability.TM.Compound.Shift]
s:48 [binder, in Undecidability.L.Util.L_facts]
s:48 [binder, in Undecidability.L.AbstractMachines.FlatPro.Programs]
s:48 [binder, in Undecidability.L.Tactics.Reflection]
s:48 [binder, in Undecidability.TM.PrettyBounds.MaxList]
s:49 [binder, in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
s:49 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
s:49 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
s:49 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
s:49 [binder, in Complexity.L.AbstractMachines.AbstractSubstMachine]
s:49 [binder, in Undecidability.L.Datatypes.LNat]
s:5 [binder, in Undecidability.TM.Combinators.While]
s:5 [binder, in Undecidability.L.Functions.Eval]
s:5 [binder, in Undecidability.L.Tactics.Lsimpl]
s:5 [binder, in Undecidability.L.Datatypes.LTerm]
s:5 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.SingleTMGenNP]
s:5 [binder, in Undecidability.L.AbstractMachines.FlatPro.Programs]
s:5 [binder, in Undecidability.L.Tactics.Lbeta]
s:5 [binder, in Undecidability.L.Functions.Proc]
s:5 [binder, in Complexity.NP.TM.L_to_LM]
s:5 [binder, in Undecidability.L.Computability.Rice]
s:5 [binder, in Complexity.NP.L.GenNP]
s:5 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
s:5 [binder, in Undecidability.L.Computability.Por]
s:50 [binder, in Undecidability.TM.L.CompilerBoolFuns.NaryApp]
s:50 [binder, in Undecidability.L.Computability.Enum]
s:50 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
s:50 [binder, in Undecidability.L.Computability.Seval]
s:50 [binder, in Complexity.TM.PrettyBounds.BaseCodeSpace]
s:50 [binder, in Undecidability.TM.Code.CaseSum]
s:50 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.SingleTMGenNP]
s:50 [binder, in Undecidability.L.AbstractMachines.FlatPro.Programs]
s:50 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
s:50 [binder, in Undecidability.L.Functions.Decoding]
s:51 [binder, in Complexity.L.AbstractMachines.Computable.EvalForTime]
s:51 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
s:51 [binder, in Undecidability.L.Tactics.Lrewrite]
s:51 [binder, in Undecidability.TM.Code.CodeTM]
s:51 [binder, in Complexity.L.AbstractMachines.FlatPro.Computable.Compile]
s:51 [binder, in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
s:51 [binder, in Undecidability.L.AbstractMachines.FlatPro.Programs]
s:51 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachine]
s:51 [binder, in Undecidability.L.Tactics.Reflection]
s:51 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s:51 [binder, in Undecidability.TM.Compound.Shift]
s:51 [binder, in Undecidability.TM.PrettyBounds.MaxList]
s:52 [binder, in Undecidability.L.Util.L_facts]
s:52 [binder, in Undecidability.L.Tactics.GenEncode]
s:52 [binder, in Undecidability.L.Tactics.LClos]
s:52 [binder, in Complexity.L.AbstractMachines.FlatPro.Computable.Compile]
s:53 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
s:53 [binder, in Undecidability.L.Computability.Seval]
s:53 [binder, in Undecidability.TM.Univ.LowLevel]
s:53 [binder, in Undecidability.TM.Compound.Shift]
s:54 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
s:54 [binder, in Undecidability.L.Computability.Seval]
s:54 [binder, in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
s:54 [binder, in Complexity.Complexity.SpaceBoundsTime]
s:54 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
s:54 [binder, in Undecidability.TM.Compound.Shift]
s:54 [binder, in Undecidability.TM.PrettyBounds.MaxList]
s:55 [binder, in Undecidability.L.Util.L_facts]
s:55 [binder, in Undecidability.L.Tactics.LClos]
s:55 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
s:55 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachine]
s:55 [binder, in Undecidability.TM.Code.ChangeAlphabet]
s:55 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler]
s:56 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
s:56 [binder, in Undecidability.TM.L.CompilerBoolFuns.NaryApp]
s:56 [binder, in Undecidability.L.Computability.Seval]
s:56 [binder, in Undecidability.L.Complexity.ResourceMeasures]
s:56 [binder, in Undecidability.TM.Univ.LowLevel]
s:56 [binder, in Undecidability.TM.Code.Code]
s:57 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
s:57 [binder, in Undecidability.L.Tactics.Lrewrite]
s:57 [binder, in Undecidability.L.Util.L_facts]
s:57 [binder, in Undecidability.L.Computability.Seval]
s:57 [binder, in Complexity.Complexity.SpaceBoundsTime]
s:57 [binder, in Undecidability.TM.Code.Code]
s:58 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
s:58 [binder, in Undecidability.TM.Code.CodeTM]
s:58 [binder, in Undecidability.TM.PrettyBounds.MaxList]
s:59 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
s:59 [binder, in Undecidability.L.Computability.Seval]
s:59 [binder, in Undecidability.L.Complexity.ResourceMeasures]
s:6 [binder, in Undecidability.TM.Code.CaseList]
s:6 [binder, in Undecidability.L.Util.L_facts]
s:6 [binder, in Undecidability.L.Computability.Seval]
s:6 [binder, in Undecidability.L.Tactics.LClos]
s:6 [binder, in Undecidability.Shared.Libs.PSL.Lists.Position]
s:6 [binder, in Undecidability.L.Datatypes.LTerm]
s:6 [binder, in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
s:6 [binder, in Undecidability.L.L]
s:6 [binder, in Undecidability.L.Tactics.Lbeta_nonrefl]
s:6 [binder, in Undecidability.L.AbstractMachines.FlatPro.Programs]
s:6 [binder, in Undecidability.L.Tactics.Lbeta]
s:6 [binder, in Undecidability.L.Tactics.Reflection]
s:6 [binder, in Undecidability.L.Functions.Size]
s:6 [binder, in Undecidability.TM.Single.EncodeTapes]
s:60 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
s:60 [binder, in Complexity.L.AbstractMachines.Computable.EvalForTime]
s:60 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
s:60 [binder, in Undecidability.TM.Univ.LowLevel]
s:60 [binder, in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
s:60 [binder, in Undecidability.TM.Hoare.HoareRegister]
s:60 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
s:60 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
s:60 [binder, in Undecidability.TM.Code.ChangeAlphabet]
s:60 [binder, in Undecidability.TM.Compound.Shift]
s:61 [binder, in Undecidability.L.Util.L_facts]
s:61 [binder, in Undecidability.TM.Code.CaseSum]
s:61 [binder, in Undecidability.L.Functions.Decoding]
s:62 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
s:62 [binder, in Complexity.L.TM.TMunflatten]
s:62 [binder, in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
s:62 [binder, in Undecidability.TM.PrettyBounds.MaxList]
s:63 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
s:63 [binder, in Undecidability.L.Tactics.Lrewrite]
s:63 [binder, in Undecidability.L.Complexity.ResourceMeasures]
s:63 [binder, in Undecidability.TM.Code.CasePair]
s:63 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler]
s:64 [binder, in Undecidability.L.Util.L_facts]
s:64 [binder, in Undecidability.L.Tactics.LClos]
s:64 [binder, in Undecidability.TM.Code.CodeTM]
s:64 [binder, in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
s:64 [binder, in Undecidability.L.AbstractMachines.FlatPro.Programs]
s:64 [binder, in Complexity.Complexity.SpaceBoundsTime]
s:64 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
s:64 [binder, in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
s:65 [binder, in Undecidability.L.Util.L_facts]
s:65 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
s:65 [binder, in Undecidability.L.Tactics.Extract]
s:65 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s:66 [binder, in Undecidability.L.Computability.Seval]
s:66 [binder, in Undecidability.L.Complexity.ResourceMeasures]
s:66 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
s:66 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachine]
s:66 [binder, in Undecidability.TM.Code.ChangeAlphabet]
s:66 [binder, in Undecidability.L.Functions.Decoding]
s:67 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
s:67 [binder, in Undecidability.L.Tactics.Lrewrite]
s:67 [binder, in Undecidability.L.Util.L_facts]
s:67 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
s:67 [binder, in Undecidability.TM.Code.CodeTM]
S:67 [binder, in Undecidability.TM.Util.Relations]
s:67 [binder, in Undecidability.TM.Code.CasePair]
s:67 [binder, in Undecidability.L.Tactics.Computable]
s:68 [binder, in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
s:68 [binder, in Complexity.Complexity.SpaceBoundsTime]
s:68 [binder, in Undecidability.L.Tactics.Reflection]
s:68 [binder, in Undecidability.L.Functions.Decoding]
s:69 [binder, in Undecidability.TM.Code.CaseList]
s:69 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
s:69 [binder, in Undecidability.L.Computability.Seval]
s:69 [binder, in Undecidability.L.Tactics.LClos]
s:7 [binder, in Complexity.NP.L.CanEnumTerm_def]
s:7 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
s:7 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
s:7 [binder, in Undecidability.TM.Code.CodeTM]
s:7 [binder, in Complexity.L.AbstractMachines.FlatPro.Computable.Compile]
s:7 [binder, in Undecidability.L.L]
S:7 [binder, in Undecidability.TM.Util.Relations]
s:7 [binder, in Undecidability.L.Tactics.Lbeta]
s:7 [binder, in Complexity.L.AbstractMachines.Computable.HeapMachine]
s:7 [binder, in Undecidability.TM.PrettyBounds.MaxList]
s:7 [binder, in Undecidability.L.Computability.Por]
s:7 [binder, in Undecidability.TM.Single.EncodeTapes]
s:70 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
s:70 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
s:70 [binder, in Undecidability.L.Util.L_facts]
s:70 [binder, in Undecidability.L.Complexity.ResourceMeasures]
s:70 [binder, in Undecidability.TM.Code.CodeTM]
s:71 [binder, in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
s:71 [binder, in Undecidability.L.Util.L_facts]
s:71 [binder, in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
s:71 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
s:71 [binder, in Undecidability.L.Tactics.Reflection]
s:71 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s:72 [binder, in Complexity.TM.PrettyBounds.BaseCodeSpace]
s:72 [binder, in Undecidability.TM.Univ.LowLevel]
s:72 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachine]
s:72 [binder, in Undecidability.TM.Code.ChangeAlphabet]
s:72 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s:72 [binder, in Undecidability.TM.Compound.Shift]
s:73 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
s:73 [binder, in Undecidability.L.Computability.Seval]
s:73 [binder, in Undecidability.L.Complexity.ResourceMeasures]
s:73 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
s:74 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
s:74 [binder, in Undecidability.L.Util.L_facts]
s:74 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
s:74 [binder, in Undecidability.L.Tactics.LClos]
s:74 [binder, in Undecidability.TM.Code.ChangeAlphabet]
s:74 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s:75 [binder, in Undecidability.L.Computability.Seval]
s:75 [binder, in Undecidability.L.Tactics.LClos]
s:75 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s:75 [binder, in Undecidability.TM.Compound.Shift]
s:75 [binder, in Undecidability.TM.Code.BinNumbers.PosShiftTM]
s:76 [binder, in Undecidability.TM.Code.CaseList]
s:76 [binder, in Undecidability.L.Util.L_facts]
s:76 [binder, in Undecidability.TM.Univ.LowLevel]
s:76 [binder, in Undecidability.TM.Code.Code]
s:76 [binder, in Undecidability.TM.Code.CasePair]
s:77 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
s:77 [binder, in Undecidability.L.Complexity.ResourceMeasures]
s:77 [binder, in Complexity.TM.PrettyBounds.BaseCodeSpace]
s:77 [binder, in Undecidability.TM.Code.CodeTM]
s:77 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s:77 [binder, in Undecidability.TM.Compound.Shift]
s:77 [binder, in Undecidability.TM.PrettyBounds.MaxList]
s:77 [binder, in Undecidability.TM.Code.BinNumbers.PosShiftTM]
s:78 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
s:78 [binder, in Undecidability.L.Computability.Seval]
s:78 [binder, in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
s:78 [binder, in Undecidability.TM.Code.Code]
s:79 [binder, in Undecidability.L.Util.L_facts]
s:79 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
s:79 [binder, in Undecidability.L.Tactics.Computable]
s:79 [binder, in Undecidability.TM.Code.BinNumbers.PosShiftTM]
s:8 [binder, in Complexity.L.AbstractMachines.Computable.EvalForTime]
s:8 [binder, in Undecidability.TM.Code.CaseList]
s:8 [binder, in Undecidability.TM.L.CompilerBoolFuns.NaryApp]
s:8 [binder, in Undecidability.L.Computability.Seval]
s:8 [binder, in Complexity.TM.PrettyBounds.SpaceBounds]
s:8 [binder, in Undecidability.TM.Code.CaseBool]
s:8 [binder, in Complexity.L.AbstractMachines.Computable.EvalForTimeBool]
s:8 [binder, in Undecidability.L.AbstractMachines.FlatPro.Programs]
s:8 [binder, in Undecidability.L.Prelim.StringBase]
s:8 [binder, in Undecidability.L.Tactics.Reflection]
s:8 [binder, in Undecidability.L.Functions.Proc]
s:8 [binder, in Undecidability.TM.L.CaseCom]
s:8 [binder, in Undecidability.TM.Basic.Duo]
s:8 [binder, in Undecidability.TM.Compound.Shift]
s:8 [binder, in Complexity.L.AbstractMachines.Computable.LargestVar]
s:80 [binder, in Undecidability.L.Tactics.Extract]
s:80 [binder, in Undecidability.L.Tactics.LClos]
s:80 [binder, in Undecidability.TM.Code.CodeTM]
s:80 [binder, in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
s:80 [binder, in Undecidability.TM.Code.Code]
s:80 [binder, in Undecidability.TM.Compound.Shift]
s:81 [binder, in Undecidability.TM.Code.CaseList]
s:81 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
s:81 [binder, in Undecidability.L.Complexity.ResourceMeasures]
s:81 [binder, in Undecidability.TM.Code.Copy]
s:81 [binder, in Undecidability.L.Tactics.Reflection]
s:82 [binder, in Undecidability.L.Util.L_facts]
s:82 [binder, in Complexity.TM.PrettyBounds.BaseCodeSpace]
s:82 [binder, in Undecidability.TM.Compound.Shift]
s:83 [binder, in Undecidability.Shared.Libs.PSL.Retracts]
s:83 [binder, in Undecidability.TM.Code.CodeTM]
s:83 [binder, in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
s:83 [binder, in Undecidability.TM.Code.Copy]
s:83 [binder, in Undecidability.L.Tactics.Reflection]
s:84 [binder, in Undecidability.L.Tactics.LClos]
s:84 [binder, in Undecidability.L.Complexity.ResourceMeasures]
s:84 [binder, in Undecidability.TM.Univ.LowLevel]
s:84 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
s:85 [binder, in Undecidability.L.Util.L_facts]
s:85 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
s:85 [binder, in Undecidability.TM.Compound.Shift]
s:86 [binder, in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
s:86 [binder, in Undecidability.TM.Code.Copy]
s:87 [binder, in Undecidability.L.Util.L_facts]
s:87 [binder, in Undecidability.L.Computability.Seval]
s:87 [binder, in Undecidability.TM.Compound.Shift]
s:88 [binder, in Undecidability.L.Tactics.LClos]
s:88 [binder, in Undecidability.L.Complexity.ResourceMeasures]
s:88 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
s:88 [binder, in Undecidability.TM.Code.Copy]
s:89 [binder, in Undecidability.L.Util.L_facts]
s:89 [binder, in Undecidability.TM.Univ.LowLevel]
s:89 [binder, in Undecidability.TM.Compound.Shift]
s:9 [binder, in Undecidability.L.Tactics.Lrewrite]
s:9 [binder, in Complexity.HierarchyTheorem.TimeHierarchyTheorem]
s:9 [binder, in Undecidability.TM.Combinators.Switch]
s:9 [binder, in Undecidability.Shared.Libs.PSL.Lists.Position]
s:9 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
s:9 [binder, in Complexity.L.AbstractMachines.UnfoldHeap]
s:9 [binder, in Undecidability.L.Tactics.Lbeta_nonrefl]
s:9 [binder, in Undecidability.L.Functions.EnumInt]
s:9 [binder, in Undecidability.L.Functions.Proc]
s:9 [binder, in Complexity.NP.TM.L_to_LM]
s:9 [binder, in Undecidability.L.AbstractMachines.FlatPro.ProgramsDef]
s:9 [binder, in Undecidability.L.Computability.Por]
s:90 [binder, in Undecidability.L.Computability.Seval]
s:90 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
s:90 [binder, in Undecidability.L.Complexity.ResourceMeasures]
s:90 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachine]
s:90 [binder, in Complexity.TM.PrettyBounds.PrettyBounds]
s:91 [binder, in Undecidability.L.Util.L_facts]
s:91 [binder, in Complexity.TM.PrettyBounds.BaseCodeSpace]
s:92 [binder, in Undecidability.TM.Code.Copy]
s:920 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
s:923 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
s:927 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
s:93 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
s:93 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
s:93 [binder, in Undecidability.L.Tactics.LClos]
s:93 [binder, in Undecidability.L.Tactics.Reflection]
s:933 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
s:94 [binder, in Undecidability.L.Util.L_facts]
s:94 [binder, in Undecidability.L.Computability.Seval]
s:94 [binder, in Undecidability.L.Tactics.Reflection]
s:96 [binder, in Undecidability.L.Util.L_facts]
s:96 [binder, in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
s:96 [binder, in Undecidability.TM.Code.Copy]
s:97 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
s:97 [binder, in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
S:97 [binder, in Undecidability.TM.Util.Relations]
s:98 [binder, in Undecidability.L.Tactics.LClos]
s:98 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
s:99 [binder, in Undecidability.L.Prelim.ARS]
s:99 [binder, in Undecidability.L.Util.L_facts]
s:99 [binder, in Undecidability.L.Computability.Seval]

T

T [definition, in Undecidability.L.Computability.Enum]
tabulate [definition, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
tabulate [definition, in Complexity.Libs.CookPrelim.MorePrelim]
tabulate [section, in Complexity.Libs.CookPrelim.MorePrelim]
tabulate_ext [lemma, in Undecidability.TM.L.CompilerBoolFuns.NaryApp]
tabulate_vec.X [variable, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
tabulate_vec [section, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
tabulate_formula_length [lemma, in Complexity.NP.SAT.FSAT.FormulaEncoding]
tabulate_formula_varsIn [lemma, in Complexity.NP.SAT.FSAT.FormulaEncoding]
tabulate_formula_time [definition, in Complexity.NP.SAT.FSAT.FormulaEncoding]
tabulate_step_length [lemma, in Complexity.NP.SAT.FSAT.FormulaEncoding]
tabulate_step_poly [lemma, in Complexity.NP.SAT.FSAT.FormulaEncoding]
tabulate_step_time_bound [lemma, in Complexity.NP.SAT.FSAT.FormulaEncoding]
tabulate_step_time [definition, in Complexity.NP.SAT.FSAT.FormulaEncoding]
tabulate_formula [definition, in Complexity.NP.SAT.FSAT.FormulaEncoding]
tabulate_step [definition, in Complexity.NP.SAT.FSAT.FormulaEncoding]
tabulate_nth [lemma, in Undecidability.TM.L.CompilerBoolFuns.Compiler]
tabulate_In [lemma, in Complexity.Libs.CookPrelim.MorePrelim]
tabulate_nth [lemma, in Complexity.Libs.CookPrelim.MorePrelim]
tabulate_length [lemma, in Complexity.Libs.CookPrelim.MorePrelim]
tabulate.A [variable, in Complexity.Libs.CookPrelim.MorePrelim]
Tactics [library]
Tactics [library]
TailRec [definition, in Undecidability.TM.L.HeapInterpreter.StepTM]
tailRecursion [definition, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
tailRecursion_compile [lemma, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
tailRecursion_length [lemma, in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisStep]
tailRecursion_incl [lemma, in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisStep]
TailRec_Terminates [lemma, in Undecidability.TM.L.HeapInterpreter.StepTM]
TailRec_T [definition, in Undecidability.TM.L.HeapInterpreter.StepTM]
TailRec_steps [definition, in Undecidability.TM.L.HeapInterpreter.StepTM]
TailRec_Realise [lemma, in Undecidability.TM.L.HeapInterpreter.StepTM]
TailRec_Rel [definition, in Undecidability.TM.L.HeapInterpreter.StepTM]
TailRec_size [definition, in Undecidability.TM.L.HeapInterpreter.StepTM]
tam [lemma, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
tam [lemma, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
tam [lemma, in Undecidability.TM.Univ.Univ]
tamtam [lemma, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
tamtam [lemma, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
tam_O [lemma, in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
tam_I [lemma, in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
tape [inductive, in Undecidability.TM.TM]
tape [definition, in Undecidability.TM.SBTM]
tape [abbreviation, in Undecidability.TM.Util.TM_facts]
TapeDecode [library]
TapeFuns [library]
tapeOrderSwap [definition, in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
tapeOrderSwap_dupfree [lemma, in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
tapeRules [inductive, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
tapeRules_revp [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
tapeRules_revp' [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
tapes [projection, in Complexity.L.TM.TMflat]
tapes [definition, in Undecidability.TM.Util.TM_facts]
tapeSigma [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
tapes_encode_prefixInjective [lemma, in Complexity.TM.Single.DecodeTapes]
tapes:113 [binder, in Undecidability.TM.Util.TM_facts]
tapes:270 [binder, in Undecidability.TM.Util.TM_facts]
tapes:384 [binder, in Undecidability.TM.Util.TM_facts]
tapes:391 [binder, in Undecidability.TM.Util.TM_facts]
tapes:54 [binder, in Undecidability.TM.Util.TM_facts]
tapes:71 [binder, in Undecidability.TM.Util.TM_facts]
tapeToList [definition, in Undecidability.TM.Util.TM_facts]
tapeToList_map_commute [lemma, in Complexity.L.TM.TMunflatten]
tapeToList_lcr [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
tapeToList_move_L [lemma, in Undecidability.TM.Util.TM_facts]
tapeToList_move_R [lemma, in Undecidability.TM.Util.TM_facts]
tapeToList_move [lemma, in Undecidability.TM.Util.TM_facts]
tape_size_sum_le_size [lemma, in Complexity.TM.PrettyBounds.M2MBounds]
tape_doAct_right_length [lemma, in Complexity.TM.PrettyBounds.M2MBounds]
tape_size_sum [definition, in Complexity.TM.PrettyBounds.M2MBounds]
tape_size_ge1 [lemma, in Complexity.TM.PrettyBounds.M2MBounds]
tape_size [definition, in Complexity.TM.PrettyBounds.M2MBounds]
tape_dir [definition, in Undecidability.TM.Single.StepTM]
tape_destruct2' [lemma, in Undecidability.TM.Compound.CopySymbols]
tape_destruct2 [lemma, in Undecidability.TM.Compound.CopySymbols]
tape_decode [definition, in Complexity.L.TM.TapeDecode]
tape_contains_rev_size_ext [lemma, in Undecidability.TM.Code.CodeTM]
tape_contains_rev_ext [lemma, in Undecidability.TM.Code.CodeTM]
tape_contains_size_ext [lemma, in Undecidability.TM.Code.CodeTM]
tape_contains_ext [lemma, in Undecidability.TM.Code.CodeTM]
tape_contains_rev_size_sizeOfTape [lemma, in Undecidability.TM.Code.CodeTM]
tape_contains_size_sizeOfTape [lemma, in Undecidability.TM.Code.CodeTM]
tape_contains_rev_contains_rev_size [lemma, in Undecidability.TM.Code.CodeTM]
tape_contains_contains_size [lemma, in Undecidability.TM.Code.CodeTM]
tape_contains_rev_size_contains [lemma, in Undecidability.TM.Code.CodeTM]
tape_contains_size_contains [lemma, in Undecidability.TM.Code.CodeTM]
tape_contains_rev_size_isVoid [lemma, in Undecidability.TM.Code.CodeTM]
tape_contains_rev_isVoid [lemma, in Undecidability.TM.Code.CodeTM]
tape_contains_rev_size [definition, in Undecidability.TM.Code.CodeTM]
tape_contains_rev [definition, in Undecidability.TM.Code.CodeTM]
tape_contains_size [definition, in Undecidability.TM.Code.CodeTM]
tape_contains [definition, in Undecidability.TM.Code.CodeTM]
tape_local_contains_size [lemma, in Undecidability.TM.Code.WriteValue]
tape_contains_size_strengthen [lemma, in Undecidability.TM.Code.WriteValue]
tape_local_contains [lemma, in Undecidability.TM.Code.WriteValue]
tape_sizeOfTape_nice [lemma, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
tape_size_nice [lemma, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
tape_fulfill_Downlift_select [lemma, in Undecidability.TM.Hoare.HoareRegister]
tape_repr_stay_left [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
tape_repr_stay_right [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
tape_repr_rem_left [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
tape_repr_rem_right [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
tape_repr_add_left [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
tape_repr_add_right [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
tape_cover_symm3 [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
tape_cover_symm2 [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
tape_cover_symm1 [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
tape_repr_inv17 [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
tape_repr_inv15 [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
tape_repr_inv14 [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
tape_repr_inv13 [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
tape_repr_inv12 [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
tape_repr_inv11 [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
tape_repr_inv9 [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
tape_repr_inv8 [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
tape_repr_inv16 [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
tape_repr_inv7 [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
tape_repr_inv5 [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
tape_repr_inv4 [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
tape_repr_inv3 [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
tape_repr_inv2 [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
tape_repr_inv [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
tape_repr_step' [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
tape_repr_step [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
tape_repr_polarityFlip [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
tape_write_current [lemma, in Undecidability.TM.Util.TM_facts]
tape_write_current_None [lemma, in Undecidability.TM.Util.TM_facts]
tape_write_current_Some [lemma, in Undecidability.TM.Util.TM_facts]
tape_write_right [lemma, in Undecidability.TM.Util.TM_facts]
tape_write_left [lemma, in Undecidability.TM.Util.TM_facts]
tape_move_niltape [lemma, in Undecidability.TM.Util.TM_facts]
tape_local_move_right' [lemma, in Undecidability.TM.Util.TM_facts]
tape_right_move_right [lemma, in Undecidability.TM.Util.TM_facts]
tape_right_move_right' [lemma, in Undecidability.TM.Util.TM_facts]
tape_local_l_move_left' [lemma, in Undecidability.TM.Util.TM_facts]
tape_right_move_left' [lemma, in Undecidability.TM.Util.TM_facts]
tape_left_move_right' [lemma, in Undecidability.TM.Util.TM_facts]
tape_left_move_left [lemma, in Undecidability.TM.Util.TM_facts]
tape_left_move_left' [lemma, in Undecidability.TM.Util.TM_facts]
tape_right_move_left [lemma, in Undecidability.TM.Util.TM_facts]
tape_left_move_right [lemma, in Undecidability.TM.Util.TM_facts]
tape_local_l_move_left [lemma, in Undecidability.TM.Util.TM_facts]
tape_local_move_right [lemma, in Undecidability.TM.Util.TM_facts]
tape_local_nil [lemma, in Undecidability.TM.Util.TM_facts]
tape_local_l_cons_iff [lemma, in Undecidability.TM.Util.TM_facts]
tape_local_cons_iff [lemma, in Undecidability.TM.Util.TM_facts]
tape_local_l_left [lemma, in Undecidability.TM.Util.TM_facts]
tape_local_right [lemma, in Undecidability.TM.Util.TM_facts]
tape_local_l_current_cons [lemma, in Undecidability.TM.Util.TM_facts]
tape_local_current_cons [lemma, in Undecidability.TM.Util.TM_facts]
tape_local_mirror' [lemma, in Undecidability.TM.Util.TM_facts]
tape_local_mirror [lemma, in Undecidability.TM.Util.TM_facts]
tape_local_l [definition, in Undecidability.TM.Util.TM_facts]
tape_local [definition, in Undecidability.TM.Util.TM_facts]
Tape_Local.sig [variable, in Undecidability.TM.Util.TM_facts]
Tape_Local [section, in Undecidability.TM.Util.TM_facts]
tape_write [definition, in Undecidability.TM.Util.TM_facts]
tape_move_left_right [lemma, in Undecidability.TM.Util.TM_facts]
tape_move_right_left [lemma, in Undecidability.TM.Util.TM_facts]
tape_move [definition, in Undecidability.TM.Util.TM_facts]
tape_move_left [definition, in Undecidability.TM.Util.TM_facts]
tape_move_left' [definition, in Undecidability.TM.Util.TM_facts]
tape_move_right [definition, in Undecidability.TM.Util.TM_facts]
tape_move_right' [definition, in Undecidability.TM.Util.TM_facts]
tape_is_midtape [lemma, in Undecidability.TM.Util.TM_facts]
tape_midtape_current_left [lemma, in Undecidability.TM.Util.TM_facts]
tape_midtape_current_right [lemma, in Undecidability.TM.Util.TM_facts]
tape_encode_prefixInjective [lemma, in Complexity.TM.Single.DecodeTape]
tape_encode_injective [lemma, in Complexity.TM.Single.DecodeTape]
tape':34 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TM_single]
tape':38 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TM_single]
tape':46 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TM_single]
tape0:24 [binder, in Complexity.TM.Code.DecodeList]
tape:32 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TM_single]
tape:36 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TM_single]
tape:49 [binder, in Undecidability.TM.Lifting.LiftAlphabet]
task [inductive, in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
task [module, in Complexity.L.AbstractMachines.UnfoldTailRec]
task.appT [constructor, in Complexity.L.AbstractMachines.UnfoldTailRec]
task.closT [constructor, in Complexity.L.AbstractMachines.UnfoldTailRec]
task.lamT [constructor, in Complexity.L.AbstractMachines.UnfoldTailRec]
task.task [inductive, in Complexity.L.AbstractMachines.UnfoldTailRec]
tau:105 [binder, in Undecidability.TM.Code.Code]
tau:109 [binder, in Undecidability.TM.Code.Code]
tau:135 [binder, in Undecidability.TM.Code.Code]
tau:14 [binder, in Undecidability.L.Tactics.Computable]
tau:16 [binder, in Complexity.TM.Single.DecodeTape]
tau:165 [binder, in Undecidability.TM.Code.Code]
tau:18 [binder, in Undecidability.TM.Code.CodeTM]
tau:193 [binder, in Undecidability.TM.Util.TM_facts]
tau:200 [binder, in Undecidability.TM.Util.TM_facts]
tau:209 [binder, in Undecidability.TM.Util.TM_facts]
tau:23 [binder, in Undecidability.TM.Code.CodeTM]
tau:4 [binder, in Complexity.TM.Code.DecodeList]
tau:4 [binder, in Complexity.TM.Code.DecodeBool]
tau:43 [binder, in Undecidability.TM.Univ.LowLevel]
tau:448 [binder, in Undecidability.TM.Hoare.HoareRegister]
tau:453 [binder, in Undecidability.TM.Hoare.HoareRegister]
tau:557 [binder, in Complexity.NP.TM.LM_to_mTM]
tau:57 [binder, in Complexity.TM.Code.Decode]
tau:60 [binder, in Undecidability.TM.Code.Code]
tau:64 [binder, in Undecidability.TM.Code.Code]
tau:7 [binder, in Complexity.TM.Single.DecodeTapes]
tau:9 [binder, in Complexity.TM.Code.Decode]
tc [definition, in Complexity.L.AbstractMachines.AbstractSubstMachine]
TCC [record, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
TCC [library]
TCCCard [record, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
TCCCardP [record, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
TCCCardP_enc_size [lemma, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
TCCCardP_ofFlatType [definition, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
TCCCardP_to_list [definition, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
TCCCardP_inj [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
TCCCard_to_CCCard [definition, in Complexity.NP.SAT.CookLevin.Reductions.TCC_to_CC]
TCCCard_enc_size [lemma, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
TCCCard_ofFlatType [definition, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
TCCCard_inj [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
TCCCard_to_CCCard_size [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatTCC_to_FlatCC]
TCCLang [definition, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
TCC_to_CC [lemma, in Complexity.NP.SAT.CookLevin.Reductions.TCC_to_CC]
TCC_wellformed [definition, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
TCC_to_CC [library]
tcompl [definition, in Undecidability.L.Computability.Decidability]
tconj [definition, in Undecidability.L.Computability.Decidability]
tc_compile [lemma, in Complexity.L.AbstractMachines.AbstractSubstMachine]
tdisj [definition, in Undecidability.L.Computability.Decidability]
term [inductive, in Undecidability.L.L]
terminal [definition, in Undecidability.L.Prelim.ARS]
terminal_noRed [lemma, in Undecidability.L.Prelim.ARS]
terminates [definition, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
TerminatesIn [definition, in Undecidability.TM.Util.TM_facts]
TerminatesInIntroEx [lemma, in Undecidability.TM.Hoare.HoareLegacy]
TerminatesIn_extend [lemma, in Undecidability.TM.Util.TM_facts]
TerminatesIn_monotone [lemma, in Undecidability.TM.Util.TM_facts]
Terminates_M_checkX:76 [binder, in Complexity.TM.Code.Decode]
Terminates__mono [lemma, in Complexity.NP.TM.M_multi2mono]
Terminates_False [lemma, in Complexity.NP.TM.M_multi2mono]
terms_enum_themselves [lemma, in Complexity.NP.L.CanEnumTerm]
termT_init__evalForTime [instance, in Complexity.L.AbstractMachines.Computable.EvalForTime]
termT_evalForTime__step [instance, in Complexity.L.AbstractMachines.Computable.EvalForTime]
termT_extractRes [instance, in Complexity.L.AbstractMachines.Computable.EvalForTime]
termT_Pos_succ [instance, in Complexity.L.Datatypes.LBinNums]
termT_N_NPos [instance, in Complexity.L.Datatypes.LBinNums]
termT_Pos_xO [instance, in Complexity.L.Datatypes.LBinNums]
termT_Pos_xI [instance, in Complexity.L.Datatypes.LBinNums]
termT_rev [instance, in Undecidability.L.Datatypes.List.List_basics]
termT_rev_append [instance, in Undecidability.L.Datatypes.List.List_basics]
termT_append [instance, in Undecidability.L.Datatypes.List.List_basics]
termT_proj1_sig [instance, in Complexity.L.Datatypes.LDepPair]
termT_loopSum [instance, in Undecidability.L.Functions.LoopSum]
termT_S [instance, in Complexity.L.AbstractMachines.Computable.Unfolding]
termT_univStep [instance, in Complexity.L.AbstractMachines.Computable.UnivDecTime]
termT_map [lemma, in Undecidability.L.Tactics.ComputableDemo]
termT_map [lemma, in Undecidability.L.Tactics.ComputableDemo]
termT_length [instance, in Undecidability.L.Datatypes.List.List_nat]
termT_nth_error [instance, in Undecidability.L.Datatypes.List.List_nat]
termT_compile [instance, in Complexity.L.AbstractMachines.FlatPro.Computable.Compile]
termT_compileTR' [instance, in Complexity.L.AbstractMachines.FlatPro.Computable.Compile]
termT_N_pred [instance, in Complexity.L.Functions.BinNumsSub]
termT_N_sub [instance, in Complexity.L.Functions.BinNumsSub]
termT_Pos_sub [instance, in Complexity.L.Functions.BinNumsSub]
termT_Pos_sub_mask [instance, in Complexity.L.Functions.BinNumsSub]
termT_Pos_sub_maskC [instance, in Complexity.L.Functions.BinNumsSub]
termT_Pos_predN [instance, in Complexity.L.Functions.BinNumsSub]
termT_Pos_pred [instance, in Complexity.L.Functions.BinNumsSub]
termT_Pos_double_pred_mask [instance, in Complexity.L.Functions.BinNumsSub]
termT_Pos_pred_double [instance, in Complexity.L.Functions.BinNumsSub]
termT_Pos_succ_double_mask [instance, in Complexity.L.Functions.BinNumsSub]
termT_Pos_double_mask [instance, in Complexity.L.Functions.BinNumsSub]
termT_isPos [instance, in Complexity.L.Functions.BinNumsSub]
termT_ackermann [lemma, in Undecidability.L.Functions.Ackermann]
termT_N_eqb [instance, in Complexity.L.Functions.BinNumsCompare]
termT_N_ltb [instance, in Complexity.L.Functions.BinNumsCompare]
termT_N_leb [instance, in Complexity.L.Functions.BinNumsCompare]
termT_N_compare [instance, in Complexity.L.Functions.BinNumsCompare]
termT_Pos_compare_cont [instance, in Complexity.L.Functions.BinNumsCompare]
termT_closedb [instance, in Undecidability.L.Functions.Proc]
termT_cons [instance, in Undecidability.L.Datatypes.List.List_enc]
TermT_init [instance, in Complexity.L.AbstractMachines.Computable.HeapMachine]
termT_S [instance, in Complexity.L.AbstractMachines.Computable.HeapMachine]
termT_f:16 [binder, in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
termT_modulo [instance, in Undecidability.L.Datatypes.LNat]
termT_divmod [instance, in Undecidability.L.Datatypes.LNat]
termT_pow [instance, in Undecidability.L.Datatypes.LNat]
termT_nat_max [instance, in Undecidability.L.Datatypes.LNat]
termT_nat_min [instance, in Undecidability.L.Datatypes.LNat]
termT_leb [instance, in Undecidability.L.Datatypes.LNat]
termT_mult [instance, in Undecidability.L.Datatypes.LNat]
termT_plus' [instance, in Undecidability.L.Datatypes.LNat]
termT_pred [instance, in Undecidability.L.Datatypes.LNat]
termT_S [instance, in Undecidability.L.Datatypes.LNat]
termT_largestVar [instance, in Complexity.L.AbstractMachines.Computable.LargestVar]
termT_largestVarTR' [instance, in Complexity.L.AbstractMachines.Computable.LargestVar]
termT_max [instance, in Complexity.L.AbstractMachines.Computable.LargestVar]
termT_cons [instance, in Complexity.NP.TM.LM_to_mTM]
termT_size [instance, in Undecidability.L.Functions.Size]
termT_sizeTR' [instance, in Undecidability.L.Functions.Size]
termT_N_add [instance, in Complexity.L.Functions.BinNumsAdd]
termT_Pos_add [instance, in Complexity.L.Functions.BinNumsAdd]
termT_Pos_addC [instance, in Complexity.L.Functions.BinNumsAdd]
term_snd [instance, in Undecidability.L.Datatypes.LProd]
term_fst [instance, in Undecidability.L.Datatypes.LProd]
term_pair [instance, in Undecidability.L.Datatypes.LProd]
term_doesHaltIn [instance, in Undecidability.L.Functions.Eval]
term_eva [instance, in Undecidability.L.Functions.Eval]
term_evalForTime [definition, in Complexity.L.AbstractMachines.Computable.EvalForTime]
term_reduction [instance, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_isValidFlatTM [instance, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_isValidFlatTrans [instance, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_isBoundTransTable [instance, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_isBoundTrans [instance, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_fst_optBound [instance, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_optBound [instance, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_ltb [instance, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_isInjFinfuncTable [instance, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_allSameEntry [instance, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_allSameEntry_step [instance, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_implb [instance, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_reduction_wf [instance, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_flat_finalSubstrings [instance, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_flat_finalSubstrings_step [instance, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_flat_haltingStates [instance, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_isHalting [instance, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_filter [instance, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_nth [instance, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_flat_initial_string [instance, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_flatInr_flatNsig [instance, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_zPflat [instance, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_zflat [instance, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_kflat [instance, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_repEl [instance, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_allFlatCards [instance, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_flatPreludeCards [instance, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_flat_baseEnvPrelude [instance, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_makePreludeCards [instance, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_flatStateCards [instance, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_generateCardsForFlat [instance, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_generateCardsForFlat_step [instance, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_generateCardsForFlatHalt [instance, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_makeHaltFlat [instance, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_generateCardsForFlatNonHalt [instance, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_opt_generateCardsForFlatNonHalt [instance, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_fOpt [instance, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_flat_baseEnvNone [instance, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_flat_baseEnv [instance, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_makeNoneStayFlat [instance, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_makeNoneLeftFlat [instance, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_makeNoneRightFlat [instance, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_makeNone_base_flat [instance, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_makeSomeStayFlat [instance, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_makeSomeLeftFlat [instance, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_makeSomeRightFlat [instance, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_makeSome_base_flat [instance, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_flatTapeCards [instance, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_flatMTLCards [instance, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_flatMTICards [instance, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_flatMTRCards [instance, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_transEnvAddSM [instance, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_transEnvAddS [instance, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_envAddSSigma [instance, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_envAddState [instance, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_makeCardsFlat [instance, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_makeCards' [instance, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_makeCardsP_flat_step [instance, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_filterSome [instance, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_makeAllEvalEnvFlat [instance, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_prodLists [instance, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_tupToEvalEnv [instance, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_mkVarEnv [instance, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_it [instance, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_mkVarEnv_step [instance, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_listProd [instance, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_generateCard [instance, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_generateAlphabetFlat [instance, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_generatePreludeSigPFlat [instance, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_flatNsig [instance, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_generateGammaFlat [instance, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_generateStatesFlat [instance, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_generateTapeSigmaFlat [instance, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_generatePolSigmaFlat [instance, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_optReturn [instance, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_generateStateSigmaFlat [instance, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_option_map [instance, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_generatePolarityFlat [instance, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_flattenPolarity [instance, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_flatAlphabet [instance, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_flatPreludeSig' [instance, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_flatGamma [instance, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_flatStates [instance, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_flatTapeSigma [instance, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_flatPolSigma [instance, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_flatStateSigma [instance, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_stateEnv [instance, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_stateSigmaEnv [instance, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_sigmaEnv [instance, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_polarityEnv [instance, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_Build_evalEnv [instance, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_N_succ [instance, in Complexity.L.Datatypes.LBinNums]
term_N_of_nat [instance, in Complexity.L.Datatypes.LBinNums]
term_Pos_of_succ_nat [instance, in Complexity.L.Datatypes.LBinNums]
term_eq_dec_proc [definition, in Undecidability.L.Util.L_facts]
term_eq_dec [instance, in Undecidability.L.Util.L_facts]
term_encodeListAt [instance, in Complexity.NP.SAT.FSAT.FormulaEncoding]
term_encodeLiteral [instance, in Complexity.NP.SAT.FSAT.FormulaEncoding]
term_tabulate_formula [instance, in Complexity.NP.SAT.FSAT.FormulaEncoding]
term_tabulate_step [instance, in Complexity.NP.SAT.FSAT.FormulaEncoding]
term_listOr [instance, in Complexity.NP.SAT.FSAT.FormulaEncoding]
term_listAnd [instance, in Complexity.NP.SAT.FSAT.FormulaEncoding]
term_t__E [instance, in Complexity.HierarchyTheorem.TimeHierarchyTheorem]
term_concat [instance, in Undecidability.L.Datatypes.List.List_basics]
term_rev_concat [instance, in Undecidability.L.Datatypes.List.List_basics]
term_repeat [instance, in Undecidability.L.Datatypes.List.List_basics]
term_filter_notime [instance, in Undecidability.L.Datatypes.List.List_basics]
term_filter [instance, in Undecidability.L.Datatypes.List.List_basics]
term_map_noTime [instance, in Undecidability.L.Datatypes.List.List_basics]
term_map [instance, in Undecidability.L.Datatypes.List.List_basics]
term_test [definition, in Undecidability.L.TM.TMinL]
term_isSome [instance, in Undecidability.L.Datatypes.LOptions]
term_option_eqb [instance, in Undecidability.L.Datatypes.LOptions]
term_Some [instance, in Undecidability.L.Datatypes.LOptions]
term_orb [instance, in Undecidability.L.Datatypes.LBool]
term_andb [instance, in Undecidability.L.Datatypes.LBool]
term_negb [instance, in Undecidability.L.Datatypes.LBool]
term_FlatTCC_steps [instance, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
term_FlatTCC_final [instance, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
term_FlatTCC_cards [instance, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
term_FlatTCC_init [instance, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
term_FlatTCC_Sigma [instance, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
term_Build_FlatTCC [instance, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
term_conc [instance, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
term_prem [instance, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
term_Build_TCCCard [instance, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
term_TCCCardP_to_list [instance, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
term_cardEl3 [instance, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
term_cardEl2 [instance, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
term_cardEl1 [instance, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
term_Build_TCCCardP [instance, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
term_decompile [instance, in Complexity.L.AbstractMachines.FlatPro.Computable.Decompile]
term_kn [definition, in Undecidability.L.Tactics.Extract]
term_mp [definition, in Undecidability.L.Tactics.Extract]
term_TM_enc [instance, in Complexity.L.TM.TMflatEnc]
term_move_enc [instance, in Complexity.L.TM.TMflatEnc]
term_halt [instance, in Complexity.L.TM.TMflatEnc]
term_start [instance, in Complexity.L.TM.TMflatEnc]
term_trans [instance, in Complexity.L.TM.TMflatEnc]
term_states [instance, in Complexity.L.TM.TMflatEnc]
term_tapes [instance, in Complexity.L.TM.TMflatEnc]
term_sig [instance, in Complexity.L.TM.TMflatEnc]
term_Build_TM [instance, in Complexity.L.TM.TMflatEnc]
term_inr [instance, in Undecidability.L.Datatypes.LSum]
term_inl [instance, in Undecidability.L.Datatypes.LSum]
term_kCNF_decb [instance, in Complexity.NP.SAT.kSAT]
term_clause_length_decb [instance, in Complexity.NP.SAT.kSAT]
term_get [instance, in Complexity.L.AbstractMachines.Computable.Shared]
term_heapEntryC [instance, in Complexity.L.AbstractMachines.Computable.Shared]
term_unfoldBool [instance, in Complexity.L.AbstractMachines.Computable.Unfolding]
term_unfoldTailRecStep [instance, in Complexity.L.AbstractMachines.Computable.Unfolding]
term_validate [instance, in Undecidability.TM.L.CompilerBoolFuns.Compiler_nat_facts]
term_alltrue [instance, in Undecidability.TM.L.CompilerBoolFuns.Compiler_nat_facts]
term_idbool [instance, in Undecidability.TM.L.CompilerBoolFuns.Compiler_nat_facts]
term_forallb'' [instance, in Undecidability.TM.L.CompilerBoolFuns.Compiler_nat_facts]
term_forallb' [instance, in Undecidability.TM.L.CompilerBoolFuns.Compiler_nat_facts]
term_list_ofFlatType_dec [instance, in Complexity.Libs.CookPrelim.FlatFinTypes]
term_ofFlatType_dec [instance, in Complexity.Libs.CookPrelim.FlatFinTypes]
term_flatPair [instance, in Complexity.Libs.CookPrelim.FlatFinTypes]
term_id [instance, in Complexity.Libs.CookPrelim.FlatFinTypes]
term_iterupN [instance, in Complexity.L.Functions.IterupN]
term_varT [instance, in Complexity.L.AbstractMachines.FlatPro.Computable.LPro]
term_encode_tape [instance, in Complexity.L.TM.CompCode]
term_UnmarkedSymbol_X [instance, in Complexity.L.TM.CompCode]
term_MarkedSymbol_X [instance, in Complexity.L.TM.CompCode]
term_RightBlank_X [instance, in Complexity.L.TM.CompCode]
term_LeftBlank_X [instance, in Complexity.L.TM.CompCode]
term_sigSum_X [instance, in Complexity.L.TM.CompCode]
term_sigSum_Y [instance, in Complexity.L.TM.CompCode]
term_sigPair_X [instance, in Complexity.L.TM.CompCode]
term_sigPair_Y [instance, in Complexity.L.TM.CompCode]
term_sigList_X [instance, in Complexity.L.TM.CompCode]
term_map [lemma, in Undecidability.L.Tactics.ComputableDemo]
term_on0 [instance, in Undecidability.L.Tactics.ComputableDemo]
term_vector_eqb [instance, in Undecidability.L.Datatypes.LVector]
term_map2 [instance, in Undecidability.L.Datatypes.LVector]
term_vector_map [instance, in Undecidability.L.Datatypes.LVector]
term_to_list [instance, in Undecidability.L.Datatypes.LVector]
term_substT [instance, in Undecidability.L.Functions.Subst]
term_BinaryCC_steps [instance, in Complexity.NP.SAT.CookLevin.Subproblems.BinaryCC]
term_BinaryCC_final [instance, in Complexity.NP.SAT.CookLevin.Subproblems.BinaryCC]
term_BinaryCC_cards [instance, in Complexity.NP.SAT.CookLevin.Subproblems.BinaryCC]
term_BinaryCC_init [instance, in Complexity.NP.SAT.CookLevin.Subproblems.BinaryCC]
term_BinaryCC_width [instance, in Complexity.NP.SAT.CookLevin.Subproblems.BinaryCC]
term_BinaryCC_offset [instance, in Complexity.NP.SAT.CookLevin.Subproblems.BinaryCC]
term_Build_BinaryCC [instance, in Complexity.NP.SAT.CookLevin.Subproblems.BinaryCC]
term_execFlatTM [instance, in Complexity.L.TM.TMflatComp]
term_isValidFlatTapes [instance, in Complexity.L.TM.TMflatComp]
term_isValidFlatTape [instance, in Complexity.L.TM.TMflatComp]
term_isValidFlatTM [instance, in Complexity.L.TM.TMflatComp]
term_isValidFlatTrans [instance, in Complexity.L.TM.TMflatComp]
term_isBoundTransTable [instance, in Complexity.L.TM.TMflatComp]
term_isBoundEntry [instance, in Complexity.L.TM.TMflatComp]
term_isBoundWrite [instance, in Complexity.L.TM.TMflatComp]
term_isBoundRead [instance, in Complexity.L.TM.TMflatComp]
term_isInjFinfuncTable [instance, in Complexity.L.TM.TMflatComp]
term_allSameEntry [instance, in Complexity.L.TM.TMflatComp]
term_allSameEntry_helper [instance, in Complexity.L.TM.TMflatComp]
term_sizeOfmTapesFlat [instance, in Complexity.L.TM.TMflatComp]
term_loopMflat [instance, in Complexity.L.TM.TMflatComp]
term_stepFlat [instance, in Complexity.L.TM.TMflatComp]
term_zipWith [instance, in Complexity.L.TM.TMflatComp]
term_haltConfFlat [instance, in Complexity.L.TM.TMflatComp]
term_pos_nondec [instance, in Undecidability.L.Datatypes.List.List_nat]
term_repeat [instance, in Undecidability.L.Datatypes.List.List_nat]
term_nth [instance, in Undecidability.L.Datatypes.List.List_nat]
term_sat_verifierb [instance, in Complexity.NP.SAT.SAT_inNP]
term_evalCnf [instance, in Complexity.NP.SAT.SAT_inNP]
term_evalClause [instance, in Complexity.NP.SAT.SAT_inNP]
term_forallb [instance, in Complexity.NP.SAT.SAT_inNP]
term_existsb [instance, in Complexity.NP.SAT.SAT_inNP]
term_evalLiteral [instance, in Complexity.NP.SAT.SAT_inNP]
term_evalVar [instance, in Complexity.NP.SAT.SAT_inNP]
term_list_in_decb [instance, in Complexity.NP.SAT.SAT_inNP]
term_bool_eqb [instance, in Complexity.NP.SAT.SAT_inNP]
term_prodLists [instance, in Undecidability.L.Datatypes.List.List_extra]
term_seq [instance, in Undecidability.L.Datatypes.List.List_extra]
term_lengthEq [instance, in Undecidability.L.Datatypes.List.List_extra]
term_lam [instance, in Undecidability.L.Datatypes.LTerm]
term_app [instance, in Undecidability.L.Datatypes.LTerm]
term_var [instance, in Undecidability.L.Datatypes.LTerm]
term_concat [instance, in Complexity.Libs.CookPrelim.PolyBounds]
term_loop [instance, in Undecidability.L.TM.TapeFuns]
term_doAct [instance, in Undecidability.L.TM.TapeFuns]
term_current_chars [instance, in Undecidability.L.TM.TapeFuns]
term_current [instance, in Undecidability.L.TM.TapeFuns]
term_sizeOfmTapes [instance, in Undecidability.L.TM.TapeFuns]
term_sizeOfTape [instance, in Undecidability.L.TM.TapeFuns]
term_tapeToList [instance, in Undecidability.L.TM.TapeFuns]
term_tape_write [instance, in Undecidability.L.TM.TapeFuns]
term_right [instance, in Undecidability.L.TM.TapeFuns]
term_left [instance, in Undecidability.L.TM.TapeFuns]
term_tape_move [instance, in Undecidability.L.TM.TapeFuns]
term_tape_move_right [instance, in Undecidability.L.TM.TapeFuns]
term_tape_move_right' [instance, in Undecidability.L.TM.TapeFuns]
term_tape_move_left [instance, in Undecidability.L.TM.TapeFuns]
term_tape_move_left' [instance, in Undecidability.L.TM.TapeFuns]
term_reduction [instance, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
term_hBinaryCC [instance, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
term_hfinal [instance, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
term_hcards [instance, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
term_hcard [instance, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
term_hflat [instance, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
term_hNat [instance, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
term_repEl [instance, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
term_reduction [instance, in Complexity.NP.SAT.CookLevin.Reductions.TMGenNP_fixed_singleTapeTM_to_FlatFunSingleTMGenNP]
term_index [instance, in Undecidability.L.Datatypes.LFinType]
term_formula_maxVar [instance, in Complexity.NP.SAT.FSAT.FSAT]
term_Fneg [instance, in Complexity.NP.SAT.FSAT.FSAT]
term_For [instance, in Complexity.NP.SAT.FSAT.FSAT]
term_Fand [instance, in Complexity.NP.SAT.FSAT.FSAT]
term_Fvar [instance, in Complexity.NP.SAT.FSAT.FSAT]
term_fgraph_wf_decb [instance, in Complexity.NP.Clique.FlatClique]
term_fedges_wf [instance, in Complexity.NP.Clique.FlatClique]
term_fedge_wf [instance, in Complexity.NP.Clique.FlatClique]
term_fedges_symmetric_decb [instance, in Complexity.NP.Clique.FlatClique]
term_fedges_symmetric_decb_step [instance, in Complexity.NP.Clique.FlatClique]
term_isfKClique_decb [instance, in Complexity.NP.Clique.FlatClique]
term_isfClique_decb [instance, in Complexity.NP.Clique.FlatClique]
term_allPairsOfEdges_decb [instance, in Complexity.NP.Clique.FlatClique]
term_allPairsOfEdges_decb_step [instance, in Complexity.NP.Clique.FlatClique]
term_fedges_edge_in_decb [instance, in Complexity.NP.Clique.FlatClique]
term_ackermann [lemma, in Undecidability.L.Functions.Ackermann]
term_list_eqb [instance, in Undecidability.L.Datatypes.List.List_eqb]
term_inb_notime [instance, in Undecidability.L.Datatypes.List.List_eqb]
term_inb [instance, in Undecidability.L.Datatypes.List.List_eqb]
term_lookup [instance, in Complexity.L.AbstractMachines.Computable.Lookup]
term_reduction [instance, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
term_BinaryCC_wf_dec [instance, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
term_encodeTableau [instance, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
term_encodeFinalConstraint [instance, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
term_encodeFinalConstraint_step [instance, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
term_encodeSubstringInLine [instance, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
term_encodeSubstringInLine' [instance, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
term_encodeCardsInAllLines [instance, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
term_encodeCardsInLine [instance, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
term_encodeCardsInLine' [instance, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
term_encodeCardsAt [instance, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
term_encodeCardAt [instance, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
term_isValidFlattening_dec [instance, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
term_CCCard_ofFlatType_dec [instance, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
term_FlatCC_wf_dec [instance, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
term_CCCard_of_size_dec [instance, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
term_FlatCC_steps [instance, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
term_FlatCC_final [instance, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
term_FlatCC_cards [instance, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
term_FlatCC_init [instance, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
term_FlatCC_width [instance, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
term_FlatCC_offset [instance, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
term_FlatCC_Sigma [instance, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
term_Build_FlatCC [instance, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
term_conc [instance, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
term_prem [instance, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
term_Build_CCCard [instance, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
term_c [instance, in Undecidability.L.Functions.EnumInt]
term_eSize [instance, in Undecidability.L.Functions.EnumInt]
term_C [instance, in Undecidability.L.Functions.EnumInt]
term_C_nondec [instance, in Undecidability.L.Functions.EnumInt]
term_g [instance, in Undecidability.L.Functions.EnumInt]
term_g_nondec [instance, in Undecidability.L.Functions.EnumInt]
term_g_inv [instance, in Undecidability.L.Functions.EnumInt]
term_T [instance, in Undecidability.L.Functions.EnumInt]
term_T_nondec [instance, in Undecidability.L.Functions.EnumInt]
term_exh_size [instance, in Undecidability.L.Functions.EnumInt]
term_appCross [instance, in Undecidability.L.Functions.EnumInt]
term_dupfreeb [instance, in Undecidability.L.Datatypes.List.List_in]
term_list_incl_decb [instance, in Undecidability.L.Datatypes.List.List_in]
term_list_in_decb [instance, in Undecidability.L.Datatypes.List.List_in]
term_ctapes [instance, in Undecidability.L.TM.TMEncoding]
term_cstate [instance, in Undecidability.L.TM.TMEncoding]
term_mconfigAsPair [instance, in Undecidability.L.TM.TMEncoding]
term_midtape [instance, in Undecidability.L.TM.TMEncoding]
term_rightof [instance, in Undecidability.L.TM.TMEncoding]
term_leftof [instance, in Undecidability.L.TM.TMEncoding]
term_Pos_compare [instance, in Complexity.L.Functions.BinNumsCompare]
term_lambdab [instance, in Undecidability.L.Functions.Proc]
term_boundb [instance, in Undecidability.L.Functions.Proc]
term_F1 [instance, in Undecidability.L.Computability.Synthetic]
term_unembed_nat [instance, in Undecidability.L.Computability.Synthetic]
term_embed_nat [instance, in Undecidability.L.Computability.Synthetic]
term_F'' [instance, in Undecidability.L.Computability.Synthetic]
term_F' [instance, in Undecidability.L.Computability.Synthetic]
term_L_nat [instance, in Undecidability.L.Computability.Synthetic]
term_opt_to_list [instance, in Undecidability.L.Computability.Synthetic]
term_test [instance, in Undecidability.L.Computability.Synthetic]
term_test [instance, in Undecidability.L.TM.TMinL.TMinL_extract]
term_loopM [instance, in Undecidability.L.TM.TMinL.TMinL_extract]
term_haltConf [instance, in Undecidability.L.TM.TMinL.TMinL_extract]
term_halt [instance, in Undecidability.L.TM.TMinL.TMinL_extract]
term_step' [instance, in Undecidability.L.TM.TMinL.TMinL_extract]
term_doAct_multi [instance, in Undecidability.L.TM.TMinL.TMinL_extract]
term_trans [instance, in Undecidability.L.TM.TMinL.TMinL_extract]
term_lookup [instance, in Undecidability.L.Functions.FinTypeLookup]
term_heapStep [instance, in Complexity.L.AbstractMachines.Computable.HeapMachine]
term_FCC_instance [instance, in Complexity.NP.SAT.CookLevin.Reductions.FlatTCC_to_FlatCC]
term_CC_cards [instance, in Complexity.NP.SAT.CookLevin.Reductions.FlatTCC_to_FlatCC]
term_TCCCard_to_CCCard [instance, in Complexity.NP.SAT.CookLevin.Reductions.FlatTCC_to_FlatCC]
term_fold_right [instance, in Undecidability.L.Datatypes.List.List_fold]
term_fold_left [instance, in Undecidability.L.Datatypes.List.List_fold]
term_forallb [instance, in Undecidability.L.Datatypes.List.List_fold]
term_U_preproc [instance, in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
term_start [instance, in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
term_decode [definition, in Undecidability.L.Functions.Decoding]
term_ltb [instance, in Undecidability.L.Datatypes.LNat]
term_sub [instance, in Undecidability.L.Datatypes.LNat]
term_option_enc [instance, in Undecidability.L.Functions.Encoding]
term_list_enc [instance, in Undecidability.L.Functions.Encoding]
term_prod_enc [instance, in Undecidability.L.Functions.Encoding]
term_term_enc [instance, in Undecidability.L.Functions.Encoding]
term_nat_enc [instance, in Undecidability.L.Functions.Encoding]
term_eqb_spec [lemma, in Undecidability.L.Functions.Equality]
term_eqb [definition, in Undecidability.L.Functions.Equality]
term_size' [instance, in Undecidability.L.Functions.Size]
term_reduction [instance, in Complexity.NP.Clique.kSAT_to_FlatClique]
term_Gflat [instance, in Complexity.NP.Clique.kSAT_to_FlatClique]
term_makeEdges [instance, in Complexity.NP.Clique.kSAT_to_FlatClique]
term_makeEdge [instance, in Complexity.NP.Clique.kSAT_to_FlatClique]
term_cnfGetLiteral [instance, in Complexity.NP.Clique.kSAT_to_FlatClique]
term_toVertex [instance, in Complexity.NP.Clique.kSAT_to_FlatClique]
term_opt_literalsConflict_decb [instance, in Complexity.NP.Clique.kSAT_to_FlatClique]
term_literalsConflict_decb [instance, in Complexity.NP.Clique.kSAT_to_FlatClique]
term_allPositions [instance, in Complexity.NP.Clique.kSAT_to_FlatClique]
term_reduction [instance, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
term_tseytin [instance, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
term_tseytin' [instance, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
term_tseytinTrue [instance, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
term_tseytinEquiv [instance, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
term_tseytinNot [instance, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
term_tseytinOr [instance, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
term_tseytinAnd [instance, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
term_eliminateOR [instance, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
Ter__X:15 [binder, in Complexity.TM.Code.DecodeList]
ter:135 [binder, in Undecidability.L.Tactics.Extract]
ter:34 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler]
ter:53 [binder, in Undecidability.L.Tactics.GenEncode]
ter:54 [binder, in Undecidability.L.Tactics.GenEncode]
test [section, in Undecidability.TM.Compound.TMTac]
test [section, in Undecidability.Shared.Libs.DLW.Utils.focus]
test [definition, in Undecidability.L.Computability.Synthetic]
test_Some_nat [lemma, in Undecidability.L.Tactics.ComputableDemo]
Test_def.pM [variable, in Undecidability.TM.Util.TM_facts]
Test_def.F [variable, in Undecidability.TM.Util.TM_facts]
Test_def.sig [variable, in Undecidability.TM.Util.TM_facts]
Test_def.n [variable, in Undecidability.TM.Util.TM_facts]
Test_def [section, in Undecidability.TM.Util.TM_facts]
test.a [variable, in Undecidability.Shared.Libs.DLW.Utils.focus]
test.b [variable, in Undecidability.Shared.Libs.DLW.Utils.focus]
test.c [variable, in Undecidability.Shared.Libs.DLW.Utils.focus]
test.dec_P [variable, in Undecidability.TM.Compound.TMTac]
test.P [variable, in Undecidability.TM.Compound.TMTac]
test.x [variable, in Undecidability.Shared.Libs.DLW.Utils.focus]
test.X [variable, in Undecidability.Shared.Libs.DLW.Utils.focus]
test.y [variable, in Undecidability.Shared.Libs.DLW.Utils.focus]
test.z [variable, in Undecidability.Shared.Libs.DLW.Utils.focus]
tf:223 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
tf:228 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
tf:32 [binder, in Undecidability.L.Datatypes.List.List_fold]
TH [definition, in Undecidability.L.Util.L_facts]
timeBS [inductive, in Undecidability.L.Complexity.ResourceMeasures]
timeBSBeta [constructor, in Undecidability.L.Complexity.ResourceMeasures]
timeBSVal [constructor, in Undecidability.L.Complexity.ResourceMeasures]
timeBS_rect [lemma, in Undecidability.L.Complexity.ResourceMeasures]
timeBS_evalIn [lemma, in Undecidability.L.Complexity.ResourceMeasures]
timeComplexity [definition, in Undecidability.L.Tactics.ComputableTime]
timeComplexity_leq [definition, in Undecidability.L.Tactics.ComputableTime]
timeConstructible [definition, in Complexity.Complexity.Definitions]
timeConstructible_inO [definition, in Complexity.Complexity.Definitions]
timeConstructible_computableTime' [definition, in Complexity.Complexity.Definitions]
TimeHierarchy [section, in Complexity.HierarchyTheorem.TimeHierarchyTheorem]
TimeHierarchyTheorem [lemma, in Complexity.HierarchyTheorem.TimeHierarchyTheorem]
TimeHierarchyTheorem [library]
TimeHierarchy_Parametric.suplin_t__E [variable, in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
TimeHierarchy_Parametric.mono_t__E [variable, in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
TimeHierarchy_Parametric.n_leq_tn [variable, in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
TimeHierarchy_Parametric.f_TC [variable, in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
TimeHierarchy_Parametric.E__proc [variable, in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
TimeHierarchy_Parametric.E__spec [variable, in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
TimeHierarchy_Parametric.t__E [variable, in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
TimeHierarchy_Parametric.E [variable, in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
TimeHierarchy_Parametric.fT [variable, in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
TimeHierarchy_Parametric.f' [variable, in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
TimeHierarchy_Parametric.start [variable, in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
TimeHierarchy_Parametric.f [variable, in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
TimeHierarchy_Parametric [section, in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
TimeHierarchy.f [variable, in Complexity.HierarchyTheorem.TimeHierarchyTheorem]
TimeHierarchy.fT [variable, in Complexity.HierarchyTheorem.TimeHierarchyTheorem]
TimeHierarchy.f_geq_n [variable, in Complexity.HierarchyTheorem.TimeHierarchyTheorem]
TimeHierarchy.TC__f [variable, in Complexity.HierarchyTheorem.TimeHierarchyTheorem]
times_zero_r [lemma, in Undecidability.Shared.Libs.DLW.Utils.sums]
times_zero_l [lemma, in Undecidability.Shared.Libs.DLW.Utils.sums]
time_uiter_evalForTime__step [lemma, in Complexity.L.AbstractMachines.Computable.EvalForTime]
time_evalForTime__step [definition, in Complexity.L.AbstractMachines.Computable.EvalForTime]
time_N_of_nat [definition, in Complexity.L.Datatypes.LBinNums]
time_decompile_nice_leq [lemma, in Complexity.L.AbstractMachines.FlatPro.Computable.Decompile]
time_decompile_nice [definition, in Complexity.L.AbstractMachines.FlatPro.Computable.Decompile]
time_decompile [definition, in Complexity.L.AbstractMachines.FlatPro.Computable.Decompile]
time_loopSum_bound_onlyByN [lemma, in Undecidability.L.Functions.LoopSum]
time_loopSum [definition, in Undecidability.L.Functions.LoopSum]
time_unfoldTailRecStep [definition, in Complexity.L.AbstractMachines.Computable.Unfolding]
time_map2_leq [lemma, in Undecidability.L.Datatypes.LVector]
time_map2 [definition, in Undecidability.L.Datatypes.LVector]
time_isValidFlatTrans [definition, in Complexity.L.TM.TMflatComp]
time_compile [definition, in Complexity.L.AbstractMachines.FlatPro.Computable.Compile]
time_space_trace [lemma, in Complexity.Complexity.SpaceBoundsTime]
time_Leftmost_space_trace [lemma, in Complexity.Complexity.SpaceBoundsTime]
time__polyTC [projection, in Complexity.Complexity.Definitions]
time:10 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_string]
time:105 [binder, in Complexity.NP.SAT.SAT_inNP]
time:110 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
time:117 [binder, in Complexity.NP.SAT.SAT_inNP]
time:119 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
time:126 [binder, in Complexity.NP.SAT.SAT_inNP]
time:131 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
time:137 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
time:138 [binder, in Complexity.NP.SAT.SAT_inNP]
time:143 [binder, in Complexity.NP.SAT.SAT_inNP]
time:147 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
time:15 [binder, in Complexity.NP.TM.M_LM2TM]
time:150 [binder, in Complexity.L.TM.CompCode]
time:151 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
time:155 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
time:164 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
time:17 [binder, in Undecidability.TM.L.Transcode.Boollist_to_Enc]
time:176 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
time:185 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
time:197 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
time:202 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
time:23 [binder, in Undecidability.TM.L.Transcode.Boollist_to_Enc]
time:24 [binder, in Undecidability.TM.Code.List.Concat_Repeat]
time:33 [binder, in Undecidability.TM.Code.List.Concat_Repeat]
time:34 [binder, in Complexity.NP.TM.M_LM2TM]
time:35 [binder, in Undecidability.TM.L.Transcode.Boollist_to_Enc]
time:38 [binder, in Undecidability.TM.L.Transcode.Boollist_to_Enc]
time:4 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_string]
time:43 [binder, in Undecidability.TM.L.Transcode.Boollist_to_Enc]
time:52 [binder, in Undecidability.TM.Code.List.Concat_Repeat]
time:61 [binder, in Undecidability.TM.Code.List.Concat_Repeat]
time:61 [binder, in Complexity.NP.L.CanEnumTerm]
time:64 [binder, in Undecidability.L.Datatypes.List.List_basics]
time:69 [binder, in Undecidability.L.Datatypes.List.List_basics]
time:81 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
time:85 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
time:88 [binder, in Complexity.NP.SAT.SAT_inNP]
time:89 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
time:92 [binder, in Complexity.NP.SAT.SAT_inNP]
time:94 [binder, in Undecidability.L.Tactics.ComputableTime]
time:96 [binder, in Complexity.NP.SAT.SAT_inNP]
time:98 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
tin:1 [binder, in Undecidability.TM.Code.BinNumbers.PosIncrementTM]
tin:1 [binder, in Undecidability.TM.Code.NatTM]
tin:1 [binder, in Undecidability.TM.Code.NatSub]
tin:10 [binder, in Undecidability.TM.Code.List.Concat_Repeat]
tin:10 [binder, in Undecidability.TM.Code.CaseList]
tin:100 [binder, in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
tin:100 [binder, in Undecidability.TM.Compound.CopySymbols]
tin:101 [binder, in Undecidability.TM.Code.Copy]
tin:103 [binder, in Undecidability.TM.Hoare.HoareLogic]
tin:103 [binder, in Undecidability.TM.Code.BinNumbers.PosAddTM]
tin:104 [binder, in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
tin:105 [binder, in Undecidability.TM.Hoare.HoareLogic]
tin:108 [binder, in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
tin:108 [binder, in Undecidability.TM.Code.Copy]
tin:108 [binder, in Undecidability.TM.Compound.Shift]
tin:108 [binder, in Undecidability.TM.Code.BinNumbers.PosAddTM]
tin:108 [binder, in Undecidability.TM.Hoare.HoareExamples]
tin:109 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
tin:109 [binder, in Undecidability.TM.Hoare.HoareCombinators]
tin:11 [binder, in Undecidability.TM.Code.List.Length]
tin:11 [binder, in Undecidability.TM.Code.NatTM]
tin:11 [binder, in Undecidability.TM.Code.BinNumbers.NTM]
tin:110 [binder, in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
tin:111 [binder, in Undecidability.TM.Hoare.HoareExamples]
tin:112 [binder, in Undecidability.TM.Code.NatTM]
tin:113 [binder, in Undecidability.TM.L.HeapInterpreter.LookupTM]
tin:114 [binder, in Undecidability.TM.Code.List.Nth]
tin:114 [binder, in Undecidability.TM.Univ.LowLevel]
tin:114 [binder, in Undecidability.TM.Code.Copy]
tin:114 [binder, in Undecidability.TM.Hoare.HoareLogic]
tin:116 [binder, in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
tin:117 [binder, in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
tin:12 [binder, in Undecidability.TM.Compound.CopySymbols]
tin:12 [binder, in Complexity.NP.TM.LM_to_mTM]
tin:120 [binder, in Undecidability.TM.Compound.MoveToSymbol]
tin:120 [binder, in Undecidability.TM.Code.Copy]
tin:121 [binder, in Undecidability.TM.Univ.Univ]
tin:122 [binder, in Undecidability.TM.Code.NatTM]
tin:122 [binder, in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
tin:123 [binder, in Undecidability.TM.Code.Copy]
tin:124 [binder, in Undecidability.TM.Compound.CopySymbols]
tin:124 [binder, in Undecidability.TM.Univ.LowLevel]
tin:125 [binder, in Undecidability.TM.Hoare.HoareLogic]
tin:126 [binder, in Undecidability.TM.Code.List.Nth]
tin:126 [binder, in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
tin:127 [binder, in Undecidability.TM.Code.Copy]
tin:129 [binder, in Undecidability.TM.Code.NatTM]
tin:129 [binder, in Undecidability.TM.Compound.Shift]
tin:13 [binder, in Undecidability.TM.Code.CaseNat]
tin:13 [binder, in Complexity.TM.Code.Decode]
tin:13 [binder, in Undecidability.TM.Lifting.LiftAlphabet]
tin:13 [binder, in Undecidability.TM.Hoare.HoareLegacy]
tin:13 [binder, in Undecidability.TM.Compound.CopySymbols]
tin:13 [binder, in Undecidability.TM.Combinators.SequentialComposition]
tin:13 [binder, in Undecidability.TM.L.CaseCom]
tin:130 [binder, in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
tin:130 [binder, in Undecidability.TM.Univ.LookupAssociativeListTM]
tin:132 [binder, in Undecidability.TM.Combinators.StateWhile]
tin:136 [binder, in Undecidability.TM.Code.NatTM]
tin:136 [binder, in Undecidability.TM.Hoare.HoareLogic]
tin:137 [binder, in Undecidability.TM.Hoare.HoareRegister]
tin:14 [binder, in Undecidability.TM.Code.List.Cons_constant]
tin:14 [binder, in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
tin:140 [binder, in Undecidability.TM.Code.Copy]
tin:140 [binder, in Undecidability.TM.Combinators.StateWhile]
tin:143 [binder, in Undecidability.TM.Hoare.HoareRegister]
tin:146 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
tin:146 [binder, in Undecidability.TM.Hoare.HoareLogic]
tin:148 [binder, in Undecidability.TM.Code.Copy]
tin:15 [binder, in Undecidability.TM.Code.BinNumbers.PosIncrementTM]
tin:15 [binder, in Undecidability.TM.Code.BinNumbers.NTM]
tin:15 [binder, in Undecidability.TM.Compound.CopySymbols]
tin:154 [binder, in Undecidability.TM.Combinators.StateWhile]
tin:154 [binder, in Undecidability.TM.Hoare.HoareCombinators]
tin:155 [binder, in Undecidability.TM.Univ.LookupAssociativeListTM]
tin:155 [binder, in Undecidability.TM.Hoare.HoareLogic]
tin:16 [binder, in Undecidability.TM.Code.BinNumbers.PosMultTM]
tin:16 [binder, in Undecidability.TM.Compound.CopySymbols]
tin:16 [binder, in Complexity.NP.TM.M_LM2TM]
tin:16 [binder, in Undecidability.TM.L.CaseCom]
tin:160 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
tin:160 [binder, in Undecidability.TM.Hoare.HoareLogic]
tin:161 [binder, in Undecidability.TM.Hoare.HoareRegister]
tin:164 [binder, in Undecidability.TM.Univ.Univ]
tin:165 [binder, in Undecidability.TM.Hoare.HoareLogic]
tin:166 [binder, in Undecidability.TM.Hoare.HoareRegister]
tin:17 [binder, in Undecidability.TM.Code.CaseNat]
tin:17 [binder, in Undecidability.TM.Code.NatTM]
tin:17 [binder, in Undecidability.TM.Combinators.If]
tin:17 [binder, in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
tin:17 [binder, in Undecidability.TM.Hoare.HoareStdLib]
tin:171 [binder, in Undecidability.TM.Code.Copy]
tin:178 [binder, in Undecidability.TM.Univ.Univ]
tin:18 [binder, in Undecidability.TM.L.Transcode.Boollist_to_Enc]
tin:18 [binder, in Undecidability.TM.Lifting.LiftAlphabet]
tin:18 [binder, in Undecidability.TM.Compound.CopySymbols]
tin:18 [binder, in Undecidability.TM.Compound.Multi]
tin:183 [binder, in Undecidability.TM.Code.Copy]
tin:184 [binder, in Undecidability.TM.Hoare.HoareRegister]
tin:186 [binder, in Undecidability.TM.Hoare.HoareRegister]
tin:189 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
tin:19 [binder, in Undecidability.TM.Code.List.Concat_Repeat]
tin:19 [binder, in Undecidability.TM.Code.CaseList]
tin:19 [binder, in Undecidability.TM.Compound.CopySymbols]
tin:19 [binder, in Undecidability.TM.Code.CaseSum]
tin:19 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
tin:195 [binder, in Undecidability.TM.Code.Copy]
tin:199 [binder, in Undecidability.TM.Single.StepTM]
tin:2 [binder, in Undecidability.TM.Code.BinNumbers.PosCompareTM]
tin:2 [binder, in Undecidability.TM.Code.BinNumbers.PosShiftTM]
tin:20 [binder, in Complexity.TM.Code.DecodeList]
tin:20 [binder, in Undecidability.TM.Compound.CopySymbols]
tin:20 [binder, in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
tin:203 [binder, in Undecidability.TM.Code.Copy]
tin:205 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
tin:206 [binder, in Undecidability.TM.Code.Copy]
tin:208 [binder, in Undecidability.TM.Hoare.HoareCombinators]
tin:209 [binder, in Undecidability.TM.Single.StepTM]
tin:21 [binder, in Undecidability.TM.Code.List.Rev]
tin:213 [binder, in Undecidability.TM.Code.Copy]
tin:22 [binder, in Complexity.TM.Code.Decode]
tin:22 [binder, in Undecidability.TM.Code.BinNumbers.PosIncrementTM]
tin:22 [binder, in Undecidability.TM.Hoare.HoareLegacy]
tin:22 [binder, in Undecidability.TM.Code.BinNumbers.NTM]
tin:22 [binder, in Undecidability.TM.Code.CompareValue]
tin:22 [binder, in Undecidability.TM.Combinators.SequentialComposition]
tin:221 [binder, in Undecidability.TM.Single.StepTM]
tin:226 [binder, in Undecidability.TM.Single.StepTM]
tin:23 [binder, in Undecidability.TM.Code.CaseSum]
tin:23 [binder, in Complexity.NP.TM.LM_to_mTM]
tin:23 [binder, in Undecidability.TM.Compound.WriteString]
tin:240 [binder, in Undecidability.TM.Single.StepTM]
tin:240 [binder, in Undecidability.TM.Hoare.HoareLogic]
tin:243 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
tin:247 [binder, in Undecidability.TM.Single.StepTM]
tin:25 [binder, in Undecidability.TM.Code.List.Concat_Repeat]
tin:25 [binder, in Undecidability.TM.Compound.Multi]
tin:25 [binder, in Undecidability.TM.Code.BinNumbers.PosShiftTM]
tin:255 [binder, in Undecidability.TM.Single.StepTM]
tin:26 [binder, in Undecidability.TM.Hoare.HoareLegacy]
tin:26 [binder, in Undecidability.TM.Code.BinNumbers.NTM]
tin:261 [binder, in Undecidability.TM.Hoare.HoareLogic]
tin:27 [binder, in Undecidability.TM.Code.List.Length]
tin:27 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
tin:271 [binder, in Undecidability.TM.Single.StepTM]
tin:279 [binder, in Undecidability.TM.Single.StepTM]
tin:28 [binder, in Undecidability.TM.L.Transcode.Boollist_to_Enc]
tin:28 [binder, in Undecidability.TM.Code.List.Rev]
tin:28 [binder, in Undecidability.TM.Combinators.If]
tin:281 [binder, in Undecidability.TM.Hoare.HoareLogic]
tin:289 [binder, in Undecidability.TM.Hoare.HoareCombinators]
tin:29 [binder, in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
tin:29 [binder, in Undecidability.TM.Code.CasePair]
tin:29 [binder, in Complexity.NP.TM.LM_to_mTM]
tin:291 [binder, in Undecidability.TM.Util.TM_facts]
tin:293 [binder, in Undecidability.TM.Single.StepTM]
tin:3 [binder, in Undecidability.TM.Code.CaseNat]
tin:3 [binder, in Undecidability.TM.Code.CaseBool]
tin:3 [binder, in Undecidability.TM.Code.BinNumbers.NTM]
tin:3 [binder, in Undecidability.TM.L.CaseCom]
tin:3 [binder, in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
tin:30 [binder, in Undecidability.TM.Code.CaseSum]
tin:30 [binder, in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
tin:300 [binder, in Undecidability.TM.Single.StepTM]
tin:301 [binder, in Undecidability.TM.Util.TM_facts]
tin:304 [binder, in Undecidability.TM.Hoare.HoareLogic]
tin:306 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
tin:308 [binder, in Undecidability.TM.Single.StepTM]
tin:31 [binder, in Undecidability.TM.Code.BinNumbers.NTM]
tin:31 [binder, in Undecidability.TM.Code.List.App]
tin:311 [binder, in Undecidability.TM.Single.StepTM]
tin:317 [binder, in Undecidability.TM.Single.StepTM]
tin:32 [binder, in Undecidability.TM.Code.NatTM]
tin:322 [binder, in Undecidability.TM.Hoare.HoareLogic]
tin:33 [binder, in Undecidability.TM.Code.WriteValue]
tin:330 [binder, in Undecidability.TM.Single.StepTM]
tin:332 [binder, in Undecidability.TM.Hoare.HoareCombinators]
tin:34 [binder, in Undecidability.TM.Compound.CopySymbols]
tin:342 [binder, in Undecidability.TM.Hoare.HoareCombinators]
tin:345 [binder, in Undecidability.TM.Single.StepTM]
tin:345 [binder, in Undecidability.TM.Hoare.HoareLogic]
tin:347 [binder, in Undecidability.TM.Hoare.HoareCombinators]
tin:348 [binder, in Undecidability.TM.Util.TM_facts]
tin:35 [binder, in Undecidability.TM.Code.BinNumbers.PosMultTM]
tin:35 [binder, in Complexity.NP.TM.LM_to_mTM]
tin:35 [binder, in Undecidability.TM.Code.BinNumbers.PosShiftTM]
tin:352 [binder, in Undecidability.TM.Hoare.HoareCombinators]
tin:354 [binder, in Undecidability.TM.Single.StepTM]
tin:357 [binder, in Undecidability.TM.Hoare.HoareCombinators]
tin:36 [binder, in Undecidability.TM.Code.CaseList]
tin:36 [binder, in Undecidability.TM.Code.BinNumbers.NTM]
tin:36 [binder, in Undecidability.TM.Code.CompareValue]
tin:36 [binder, in Undecidability.TM.Hoare.HoareLogic]
tin:36 [binder, in Undecidability.TM.Code.BinNumbers.PosAddTM]
tin:361 [binder, in Undecidability.TM.Single.StepTM]
tin:368 [binder, in Undecidability.TM.Hoare.HoareLogic]
tin:37 [binder, in Undecidability.TM.Code.List.Length]
tin:37 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
tin:378 [binder, in Undecidability.TM.Single.StepTM]
tin:38 [binder, in Undecidability.TM.Code.CasePair]
tin:39 [binder, in Undecidability.TM.L.Transcode.Boollist_to_Enc]
tin:392 [binder, in Undecidability.TM.Hoare.HoareCombinators]
tin:393 [binder, in Undecidability.TM.Single.StepTM]
tin:394 [binder, in Undecidability.TM.Hoare.HoareLogic]
tin:4 [binder, in Undecidability.TM.L.Transcode.Boollist_to_Enc]
tin:4 [binder, in Complexity.NP.TM.M_LM2TM]
tin:4 [binder, in Undecidability.TM.Compound.Shift]
tin:40 [binder, in Undecidability.TM.Combinators.While]
tin:40 [binder, in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
tin:401 [binder, in Undecidability.TM.Single.StepTM]
tin:402 [binder, in Undecidability.TM.Hoare.HoareCombinators]
tin:405 [binder, in Undecidability.TM.Hoare.HoareCombinators]
tin:408 [binder, in Undecidability.TM.Hoare.HoareCombinators]
tin:41 [binder, in Undecidability.TM.Code.NatTM]
tin:41 [binder, in Undecidability.TM.Code.List.Rev]
tin:41 [binder, in Complexity.NP.TM.M_multi2mono]
tin:41 [binder, in Undecidability.TM.Code.List.App]
tin:413 [binder, in Undecidability.TM.Hoare.HoareCombinators]
tin:416 [binder, in Undecidability.TM.Hoare.HoareCombinators]
tin:42 [binder, in Undecidability.TM.L.HeapInterpreter.LookupTM]
tin:421 [binder, in Undecidability.TM.Single.StepTM]
tin:421 [binder, in Undecidability.TM.Hoare.HoareCombinators]
tin:422 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
tin:429 [binder, in Undecidability.TM.Single.StepTM]
tin:43 [binder, in Undecidability.TM.Combinators.While]
tin:43 [binder, in Undecidability.TM.Code.BinNumbers.PosShiftTM]
tin:44 [binder, in Undecidability.TM.Code.CaseSum]
tin:441 [binder, in Undecidability.TM.Hoare.HoareRegister]
tin:444 [binder, in Undecidability.TM.Hoare.HoareRegister]
tin:445 [binder, in Undecidability.TM.Single.StepTM]
tin:45 [binder, in Undecidability.TM.Code.CaseList]
tin:45 [binder, in Undecidability.TM.Compound.MoveToSymbol]
tin:452 [binder, in Undecidability.TM.Single.StepTM]
tin:457 [binder, in Undecidability.TM.Single.StepTM]
tin:46 [binder, in Undecidability.TM.Code.CasePair]
tin:46 [binder, in Undecidability.TM.Code.BinNumbers.PosAddTM]
tin:461 [binder, in Undecidability.TM.Single.StepTM]
tin:47 [binder, in Undecidability.TM.Code.BinNumbers.PosCompareTM]
tin:47 [binder, in Undecidability.TM.Code.NatTM]
tin:47 [binder, in Undecidability.TM.Compound.Compare]
tin:47 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
tin:473 [binder, in Undecidability.TM.Single.StepTM]
tin:477 [binder, in Undecidability.TM.Single.StepTM]
tin:48 [binder, in Undecidability.TM.Code.BinNumbers.PosMultTM]
tin:48 [binder, in Undecidability.TM.Code.CaseSum]
tin:48 [binder, in Undecidability.TM.Compound.Shift]
tin:48 [binder, in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
tin:49 [binder, in Undecidability.TM.Combinators.While]
tin:49 [binder, in Undecidability.TM.Code.List.Rev]
tin:5 [binder, in Undecidability.TM.Code.CaseFin]
tin:5 [binder, in Undecidability.TM.Compound.CopySymbols]
tin:5 [binder, in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
tin:50 [binder, in Undecidability.TM.Code.List.Length]
tin:500 [binder, in Undecidability.TM.Single.StepTM]
tin:507 [binder, in Undecidability.TM.Single.StepTM]
tin:51 [binder, in Undecidability.TM.Code.CaseList]
tin:51 [binder, in Undecidability.TM.Code.List.App]
tin:514 [binder, in Undecidability.TM.Single.StepTM]
tin:53 [binder, in Undecidability.TM.Code.List.Concat_Repeat]
tin:53 [binder, in Undecidability.TM.Code.NatTM]
tin:53 [binder, in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
tin:55 [binder, in Undecidability.TM.Code.BinNumbers.PosShiftTM]
tin:56 [binder, in Undecidability.TM.Code.CasePair]
tin:57 [binder, in Undecidability.TM.Combinators.Switch]
tin:57 [binder, in Undecidability.TM.Code.NatTM]
tin:57 [binder, in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
tin:58 [binder, in Undecidability.TM.Code.List.Length]
tin:59 [binder, in Undecidability.TM.Combinators.While]
tin:59 [binder, in Undecidability.TM.Code.List.Rev]
tin:59 [binder, in Undecidability.TM.Code.List.App]
tin:6 [binder, in Undecidability.TM.Code.List.Cons_constant]
tin:6 [binder, in Complexity.NP.TM.LM_to_mTM]
tin:60 [binder, in Undecidability.TM.Code.BinNumbers.PosShiftTM]
tin:63 [binder, in Undecidability.TM.Univ.LowLevel]
tin:64 [binder, in Undecidability.TM.Code.CasePair]
tin:65 [binder, in Undecidability.TM.Code.BinNumbers.PosShiftTM]
tin:66 [binder, in Undecidability.TM.Code.CaseList]
tin:66 [binder, in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
tin:67 [binder, in Undecidability.TM.Combinators.Switch]
tin:68 [binder, in Undecidability.TM.Compound.MoveToSymbol]
tin:69 [binder, in Undecidability.TM.Code.BinNumbers.PosCompareTM]
tin:69 [binder, in Undecidability.TM.Code.List.Length]
tin:69 [binder, in Undecidability.TM.Compound.CopySymbols]
tin:69 [binder, in Undecidability.TM.Univ.LowLevel]
tin:69 [binder, in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
tin:7 [binder, in Undecidability.TM.Hoare.HoareLegacy]
tin:7 [binder, in Undecidability.TM.Compound.MoveToSymbol]
tin:7 [binder, in Undecidability.TM.Code.List.Rev]
tin:7 [binder, in Complexity.TM.Code.DecodeBool]
tin:71 [binder, in Undecidability.TM.Combinators.While]
tin:71 [binder, in Undecidability.TM.Code.CaseList]
tin:71 [binder, in Complexity.TM.Single.DecodeTape]
tin:72 [binder, in Undecidability.TM.Compound.CopySymbols]
tin:72 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
tin:72 [binder, in Undecidability.TM.Code.CasePair]
tin:73 [binder, in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
tin:73 [binder, in Undecidability.TM.Compound.CopySymbols]
tin:73 [binder, in Undecidability.TM.Compound.Shift]
tin:75 [binder, in Undecidability.TM.Code.BinNumbers.PosCompareTM]
tin:75 [binder, in Undecidability.TM.Compound.CopySymbols]
tin:76 [binder, in Undecidability.TM.Compound.CopySymbols]
tin:77 [binder, in Undecidability.TM.Combinators.While]
tin:78 [binder, in Undecidability.TM.Code.NatTM]
tin:78 [binder, in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
tin:78 [binder, in Undecidability.TM.Compound.CopySymbols]
tin:78 [binder, in Undecidability.TM.Univ.LowLevel]
tin:79 [binder, in Undecidability.TM.Code.CaseList]
tin:79 [binder, in Undecidability.TM.Compound.CopySymbols]
tin:8 [binder, in Undecidability.TM.Code.BinNumbers.NTM]
tin:8 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
tin:8 [binder, in Undecidability.TM.Hoare.HoareLogic]
tin:80 [binder, in Undecidability.TM.Compound.CopySymbols]
tin:80 [binder, in Undecidability.TM.Code.BinNumbers.PosAddTM]
tin:80 [binder, in Undecidability.TM.Hoare.HoareExamples]
tin:81 [binder, in Undecidability.TM.Code.BinNumbers.PosShiftTM]
tin:82 [binder, in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
tin:82 [binder, in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
tin:82 [binder, in Undecidability.TM.Hoare.HoareExamples]
tin:83 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
tin:84 [binder, in Undecidability.TM.Compound.Compare]
tin:85 [binder, in Undecidability.TM.Univ.LowLevel]
tin:85 [binder, in Undecidability.TM.Hoare.HoareExamples]
tin:87 [binder, in Undecidability.TM.Combinators.While]
tin:87 [binder, in Undecidability.TM.Code.CaseList]
tin:87 [binder, in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
tin:88 [binder, in Undecidability.TM.Code.NatTM]
tin:88 [binder, in Undecidability.TM.Hoare.HoareExamples]
tin:89 [binder, in Undecidability.TM.Code.Copy]
tin:89 [binder, in Undecidability.TM.Combinators.StateWhile]
tin:9 [binder, in Undecidability.TM.L.Transcode.Boollist_to_Enc]
tin:9 [binder, in Undecidability.TM.Code.CaseSum]
tin:9 [binder, in Undecidability.TM.Compound.Compare]
tin:9 [binder, in Undecidability.TM.Code.BinNumbers.PosShiftTM]
tin:91 [binder, in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
tin:91 [binder, in Undecidability.TM.Hoare.HoareLogic]
tin:91 [binder, in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
tin:91 [binder, in Undecidability.TM.Code.BinNumbers.PosShiftTM]
tin:93 [binder, in Undecidability.TM.Univ.LowLevel]
tin:93 [binder, in Undecidability.TM.Code.Copy]
tin:96 [binder, in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
tin:96 [binder, in Undecidability.TM.Compound.MoveToSymbol]
tin:96 [binder, in Undecidability.TM.Combinators.StateWhile]
tin:96 [binder, in Undecidability.TM.Code.BinNumbers.PosAddTM]
tin:97 [binder, in Undecidability.TM.Code.CaseList]
tin:97 [binder, in Complexity.TM.Single.DecodeTape]
tin:98 [binder, in Undecidability.TM.Code.NatTM]
tin:98 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
tin:99 [binder, in Undecidability.TM.Univ.LowLevel]
tl_length [lemma, in Undecidability.TM.Code.CaseList]
tl_length [lemma, in Undecidability.TM.Code.CaseNat]
tl_rev [lemma, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
tl_app [lemma, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
tl_map [lemma, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
tl_length [lemma, in Undecidability.TM.Code.CaseSum]
tl_length [lemma, in Undecidability.TM.Code.CasePair]
tl:142 [binder, in Undecidability.TM.Compound.MoveToSymbol]
tl:179 [binder, in Undecidability.TM.Compound.MoveToSymbol]
tl:5 [binder, in Undecidability.Shared.Libs.DLW.Utils.list_bool]
tl:65 [binder, in Complexity.NP.TM.M_multi2mono]
tl:69 [binder, in Complexity.NP.TM.M_multi2mono]
tl:9 [binder, in Undecidability.Shared.Libs.DLW.Utils.list_bool]
TM [record, in Undecidability.TM.TM]
TM [abbreviation, in Undecidability.TM.Util.TM_facts]
TM [library]
tmArgsOfConstructor [definition, in Undecidability.L.Tactics.Extract]
tmEncode [definition, in Undecidability.L.Tactics.Extract]
TMEncoding [library]
tmExtract [definition, in Undecidability.L.Tactics.Extract]
tmExtractConstr [definition, in Undecidability.L.Tactics.Extract]
tmExtractConstr' [definition, in Undecidability.L.Tactics.Extract]
TMflat [library]
TMflatComp [library]
TMflatEnc [library]
TMflatFun [library]
TMflatten [library]
tmGenEncode [definition, in Undecidability.L.Tactics.GenEncode]
tmGenEncodeInj [definition, in Undecidability.L.Tactics.GenEncode]
TMGenNP [definition, in Complexity.NP.TM.TMGenNP]
TMGenNP [library]
TMGenNP_to_TMGenNP_fixed_singleTapeTM [lemma, in Complexity.NP.SAT.CookLevin]
TMGenNP_mTM_to_TMGenNP_singleTM [lemma, in Complexity.NP.TM.mTM_to_singleTapeTM]
TMGenNP_fixed_singleTapeTM_to_FlatFunSingleTMGenNP [lemma, in Complexity.NP.SAT.CookLevin.Reductions.TMGenNP_fixed_singleTapeTM_to_FlatFunSingleTMGenNP]
TMGenNP_fixed [definition, in Complexity.NP.TM.TMGenNP_fixed_mTM]
TMGenNP_fixed_singleTapeTM_to_FlatFunSingleTMGenNP [library]
TMGenNP_fixed_mTM [library]
TMGenNP' [definition, in Complexity.NP.TM.TMGenNP]
tmGetMyOption [definition, in Undecidability.L.Tactics.Extract]
tmGetOption [definition, in Undecidability.L.Tactics.Extract]
tmid:101 [binder, in Undecidability.TM.Combinators.StateWhile]
tmid:113 [binder, in Undecidability.TM.Combinators.StateWhile]
tmid:135 [binder, in Undecidability.TM.Combinators.StateWhile]
tmid:156 [binder, in Undecidability.TM.Hoare.HoareCombinators]
tmid:158 [binder, in Undecidability.TM.Hoare.HoareCombinators]
tmid:159 [binder, in Undecidability.TM.Combinators.StateWhile]
tmid:318 [binder, in Undecidability.TM.Hoare.HoareCombinators]
tmid:333 [binder, in Undecidability.TM.Hoare.HoareCombinators]
tmid:339 [binder, in Undecidability.TM.Hoare.HoareCombinators]
tmid:393 [binder, in Undecidability.TM.Hoare.HoareCombinators]
tmid:399 [binder, in Undecidability.TM.Hoare.HoareCombinators]
tmid:44 [binder, in Undecidability.TM.Combinators.While]
tmid:53 [binder, in Undecidability.TM.Combinators.While]
tmid:54 [binder, in Undecidability.TM.Combinators.While]
tmid:62 [binder, in Undecidability.TM.Combinators.While]
tmid:64 [binder, in Undecidability.TM.Combinators.While]
tmid:72 [binder, in Undecidability.TM.Combinators.While]
tmid:92 [binder, in Undecidability.TM.Combinators.While]
tmid:99 [binder, in Undecidability.TM.Combinators.StateWhile]
TMinL [library]
TMinL_extract [library]
tmInstanceRed [definition, in Undecidability.L.Tactics.Extract]
tmIsType [definition, in Undecidability.L.Tactics.Extract]
tmMatchCorrect [definition, in Undecidability.L.Tactics.GenEncode]
tmNumConstructors [definition, in Undecidability.L.Tactics.Extract]
tmp:10 [binder, in Undecidability.TM.L.Eval]
tmp:35 [binder, in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
TMTac [library]
tmTryInfer [definition, in Undecidability.L.Tactics.Extract]
tmTypeOf [definition, in Undecidability.L.Tactics.Extract]
TMunflatten [library]
tmUnfoldTerm [definition, in Undecidability.L.Tactics.Extract]
TM_Correct_noSwitchAuto [definition, in Undecidability.TM.Combinators.Combinators]
tm_trans_isValidFlatAct [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
TM_computable [definition, in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
TM_bool_computable [definition, in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
TM_bool_computable_to_TM_computable [lemma, in Undecidability.TM.L.CompilerBoolFuns.Compiler_nat_facts]
tm_step_size [lemma, in Complexity.NP.SAT.CookLevin.Subproblems.TM_single]
_ ▷(≤ _ ) _ [notation, in Complexity.NP.SAT.CookLevin.Subproblems.TM_single]
_ ▷( _ ) _ [notation, in Complexity.NP.SAT.CookLevin.Subproblems.TM_single]
_ ≻( _ ) _ [notation, in Complexity.NP.SAT.CookLevin.Subproblems.TM_single]
_ ≻ _ [notation, in Complexity.NP.SAT.CookLevin.Subproblems.TM_single]
TM_single.TM [variable, in Complexity.NP.SAT.CookLevin.Subproblems.TM_single]
TM_single.Sigma [variable, in Complexity.NP.SAT.CookLevin.Subproblems.TM_single]
TM_single [section, in Complexity.NP.SAT.CookLevin.Subproblems.TM_single]
TM_bool_computable_hoare'_spec [lemma, in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
TM_bool_computable_hoare_out'_spec [lemma, in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
TM_bool_computable_hoare_in'_spec [lemma, in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
TM_bool_computable_hoare' [definition, in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
TM_bool_computable_hoare_out' [definition, in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
TM_bool_computable_hoare_in' [definition, in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
TM_bool_computable_hoare_spec [lemma, in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
TM_bool_computable_hoare [definition, in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
TM_bool_computable_hoare_out_spec [lemma, in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
TM_bool_computable_hoare_out [definition, in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
TM_bool_computable_hoare_in_spec [lemma, in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
TM_bool_computable_hoare_in [definition, in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
TM_reduction_to_ExPTCC [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
TM_eval_iff [lemma, in Undecidability.TM.Util.TM_facts]
TM_facts [library]
TM_single [library]
TM':3709 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
TM1GenNP [definition, in Complexity.NP.TM.TMGenNP]
tm:103 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:106 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:1108 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:1109 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:1111 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:1114 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:1121 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:114 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:120 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:122 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:131 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:136 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:14 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:140 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:143 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:147 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:15 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:153 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:155 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:16 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:169 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:17 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:173 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:177 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:18 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:181 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:185 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:189 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:19 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:190 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:194 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:198 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:20 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:202 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:21 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:22 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:23 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:24 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:25 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:27 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:274 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:279 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:28 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:29 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:293 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:298 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:30 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:304 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:307 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:31 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:318 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:33 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:339 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:34 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:342 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:345 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:348 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:349 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:35 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:353 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:356 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:359 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:363 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:37 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:370 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:3708 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
tm:373 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:376 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:379 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:38 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:382 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:386 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:39 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:391 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:394 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:40 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:400 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:406 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:413 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:42 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:423 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:430 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:431 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:433 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:434 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:435 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:437 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:438 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:439 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:441 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:442 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:443 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:445 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:447 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:451 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:452 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:458 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:466 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:473 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:481 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:490 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:495 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:50 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:501 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:506 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:511 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:516 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:522 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:527 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:532 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:537 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:543 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:548 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:553 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:557 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:563 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:568 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:574 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:581 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:584 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:588 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:591 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:594 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:597 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:601 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:604 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:607 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:61 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:610 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:614 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:617 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:620 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:621 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:623 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:629 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:633 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:639 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:645 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:649 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:653 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:657 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:661 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:666 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:672 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:688 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:693 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:694 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:695 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:699 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:700 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:703 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:705 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:708 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:71 [binder, in Complexity.L.TM.TMflatten]
tm:712 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:717 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:719 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:721 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:723 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:726 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:728 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:731 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:732 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:735 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:738 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:74 [binder, in Complexity.L.TM.TMflatten]
tm:741 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:748 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:753 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:755 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:757 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:759 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:762 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:763 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:764 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:766 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:769 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:773 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:778 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:779 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:780 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:781 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:782 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:783 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:785 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:786 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:787 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:788 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:789 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:791 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:793 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:794 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:796 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:828 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:830 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:832 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:836 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:840 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:853 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:857 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:86 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:875 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:880 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:902 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:904 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:906 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:908 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:910 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:911 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:912 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:914 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:918 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:919 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:921 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:925 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:929 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:932 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:935 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:936 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:937 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:938 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:940 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:941 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:942 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:945 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:948 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:952 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:957 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:962 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:98 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
TM₁_bool_computable [definition, in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
tnlc1 [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
tnlc2 [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
tnll1 [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
tnll2 [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
tnll3 [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
tnlr1 [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
tnlr2 [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
tnrc1 [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
tnrc2 [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
tnrl1 [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
tnrl2 [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
tnrr1 [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
tnrr2 [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
tnrr3 [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
tnsc1 [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
tnsc2 [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
tnsl1 [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
tnsl2 [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
tnsr1 [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
tnsr2 [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
toAssignment [definition, in Complexity.NP.Clique.kSAT_to_Clique]
todo [abbreviation, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
ToggleMarked [definition, in Undecidability.TM.Single.StepTM]
ToggleMarked_Sem [lemma, in Undecidability.TM.Single.StepTM]
ToggleMarked_Rel [definition, in Undecidability.TM.Single.StepTM]
toggle_marked [definition, in Undecidability.TM.Single.StepTM]
Tok [inductive, in Undecidability.L.AbstractMachines.FlatPro.ProgramsDef]
Tok_eqb_spec [lemma, in Undecidability.L.AbstractMachines.FlatPro.Programs]
Tok_eqb [definition, in Undecidability.L.AbstractMachines.FlatPro.Programs]
Tok_eq_dec [instance, in Undecidability.L.AbstractMachines.FlatPro.ProgramsDef]
tolist_In [lemma, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
tolist_dupfree [lemma, in Undecidability.Shared.Libs.PSL.Vectors.VectorDupfree]
toLiterals [definition, in Complexity.NP.Clique.kSAT_to_Clique]
toOptionList [definition, in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
toPos [definition, in Complexity.NP.Clique.kSAT_to_Clique]
ToSingleTape [definition, in Undecidability.TM.Single.StepTM]
ToSingleTape [section, in Undecidability.TM.Single.StepTM]
ToSingleTape_bounds [section, in Complexity.TM.PrettyBounds.M2MBounds]
ToSingleTape_Terminates' [lemma, in Undecidability.TM.Single.StepTM]
ToSingleTape_T' [definition, in Undecidability.TM.Single.StepTM]
ToSingleTape_Realise' [lemma, in Undecidability.TM.Single.StepTM]
ToSingleTape_Rel' [definition, in Undecidability.TM.Single.StepTM]
ToSingleTape_Terminates [lemma, in Undecidability.TM.Single.StepTM]
ToSingleTape_T [definition, in Undecidability.TM.Single.StepTM]
ToSingleTape_Realise [lemma, in Undecidability.TM.Single.StepTM]
ToSingleTape_Rel [definition, in Undecidability.TM.Single.StepTM]
ToSingleTape_Loop_index [lemma, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
ToSingleTape_Loop_halt [lemma, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
ToSingleTape_Loop_graph [lemma, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
ToSingleTape_inj [definition, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
ToSingleTape_Loop_inj [definition, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
ToSingleTape_steps [definition, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
ToSingleTape.DoActions [section, in Undecidability.TM.Single.StepTM]
ToSingleTape.DoActions.acts [variable, in Undecidability.TM.Single.StepTM]
ToSingleTape.F [variable, in Undecidability.TM.Single.StepTM]
ToSingleTape.GoToCurrent [section, in Undecidability.TM.Single.StepTM]
ToSingleTape.GoToNext [section, in Undecidability.TM.Single.StepTM]
ToSingleTape.Loop [section, in Undecidability.TM.Single.StepTM]
ToSingleTape.Loop.M_T [variable, in Undecidability.TM.Single.StepTM]
ToSingleTape.Loop.M_R [variable, in Undecidability.TM.Single.StepTM]
ToSingleTape.MoveToStart [section, in Undecidability.TM.Single.StepTM]
ToSingleTape.n [variable, in Undecidability.TM.Single.StepTM]
ToSingleTape.pM [variable, in Undecidability.TM.Single.StepTM]
ToSingleTape.ReadCurrentSymbols [section, in Undecidability.TM.Single.StepTM]
ToSingleTape.sig [variable, in Undecidability.TM.Single.StepTM]
ToSingleTape.Step [section, in Undecidability.TM.Single.StepTM]
ToSingleTape.Step.q [variable, in Undecidability.TM.Single.StepTM]
_ ≃ _ [notation, in Undecidability.TM.Single.StepTM]
toSubList [definition, in Undecidability.Shared.Libs.PSL.FiniteTypes.Arbitrary]
toSubList_count [lemma, in Undecidability.Shared.Libs.PSL.FiniteTypes.Arbitrary]
toSumList1 [definition, in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
toSumList1_missing [lemma, in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
toSumList1_count [lemma, in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
toSumList2 [definition, in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
toSumList2_missing [lemma, in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
toSumList2_count [lemma, in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
total_decodable_closed_new [lemma, in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
tout:10 [binder, in Undecidability.TM.L.Transcode.Boollist_to_Enc]
tout:10 [binder, in Undecidability.TM.Code.CaseSum]
tout:10 [binder, in Undecidability.TM.Compound.Compare]
tout:10 [binder, in Undecidability.TM.Code.BinNumbers.PosShiftTM]
tout:101 [binder, in Undecidability.TM.Compound.CopySymbols]
tout:102 [binder, in Undecidability.TM.Code.Copy]
tout:104 [binder, in Undecidability.TM.Code.BinNumbers.PosAddTM]
tout:105 [binder, in Undecidability.TM.Hoare.HoareExamples]
tout:107 [binder, in Undecidability.TM.Hoare.HoareLogic]
tout:107 [binder, in Undecidability.TM.Hoare.HoareExamples]
tout:109 [binder, in Undecidability.TM.Compound.Shift]
tout:109 [binder, in Undecidability.TM.Code.BinNumbers.PosAddTM]
tout:11 [binder, in Undecidability.TM.Code.List.Concat_Repeat]
tout:11 [binder, in Undecidability.TM.Code.CaseList]
tout:110 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
tout:110 [binder, in Undecidability.TM.Hoare.HoareCombinators]
tout:110 [binder, in Undecidability.TM.Hoare.HoareExamples]
tout:115 [binder, in Undecidability.TM.Code.List.Nth]
tout:115 [binder, in Undecidability.TM.Univ.LowLevel]
tout:115 [binder, in Undecidability.TM.Hoare.HoareLogic]
tout:117 [binder, in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
tout:118 [binder, in Undecidability.TM.Univ.Univ]
tout:12 [binder, in Undecidability.TM.Code.List.Length]
tout:12 [binder, in Undecidability.TM.Code.NatTM]
tout:12 [binder, in Undecidability.TM.Code.BinNumbers.NTM]
tout:124 [binder, in Undecidability.TM.Code.Copy]
tout:126 [binder, in Undecidability.TM.Hoare.HoareLogic]
tout:128 [binder, in Undecidability.TM.Code.Copy]
tout:131 [binder, in Undecidability.TM.Univ.LookupAssociativeListTM]
tout:136 [binder, in Undecidability.TM.Combinators.StateWhile]
tout:138 [binder, in Undecidability.TM.Hoare.HoareRegister]
tout:14 [binder, in Undecidability.TM.Code.CaseNat]
tout:14 [binder, in Complexity.TM.Code.Decode]
tout:14 [binder, in Undecidability.TM.Lifting.LiftAlphabet]
tout:14 [binder, in Undecidability.TM.Hoare.HoareLegacy]
tout:14 [binder, in Undecidability.TM.L.CaseCom]
tout:14 [binder, in Complexity.NP.TM.LM_to_mTM]
tout:141 [binder, in Undecidability.TM.Code.Copy]
tout:143 [binder, in Undecidability.TM.Combinators.StateWhile]
tout:144 [binder, in Undecidability.TM.Hoare.HoareRegister]
tout:148 [binder, in Undecidability.TM.Hoare.HoareLogic]
tout:16 [binder, in Undecidability.TM.Code.BinNumbers.PosIncrementTM]
tout:16 [binder, in Undecidability.TM.Code.BinNumbers.NTM]
tout:161 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
tout:162 [binder, in Undecidability.TM.Hoare.HoareRegister]
tout:165 [binder, in Undecidability.TM.Univ.Univ]
tout:167 [binder, in Undecidability.TM.Hoare.HoareRegister]
tout:17 [binder, in Undecidability.TM.Code.BinNumbers.PosMultTM]
tout:17 [binder, in Undecidability.TM.Combinators.SequentialComposition]
tout:17 [binder, in Undecidability.TM.L.CaseCom]
tout:172 [binder, in Undecidability.TM.Code.Copy]
tout:18 [binder, in Undecidability.TM.Code.CaseNat]
tout:18 [binder, in Undecidability.TM.Code.NatTM]
tout:18 [binder, in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
tout:19 [binder, in Undecidability.TM.Compound.Multi]
tout:196 [binder, in Undecidability.TM.Code.Copy]
tout:2 [binder, in Undecidability.TM.Code.BinNumbers.PosIncrementTM]
tout:2 [binder, in Undecidability.TM.Code.NatTM]
tout:2 [binder, in Undecidability.TM.Code.NatSub]
tout:20 [binder, in Undecidability.TM.Code.List.Concat_Repeat]
tout:20 [binder, in Undecidability.TM.Code.CaseList]
tout:20 [binder, in Undecidability.TM.Code.CaseSum]
tout:200 [binder, in Undecidability.TM.Single.StepTM]
tout:206 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
tout:207 [binder, in Undecidability.TM.Code.Copy]
tout:21 [binder, in Undecidability.TM.Combinators.If]
tout:21 [binder, in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
tout:210 [binder, in Undecidability.TM.Single.StepTM]
tout:210 [binder, in Undecidability.TM.Hoare.HoareCombinators]
tout:227 [binder, in Undecidability.TM.Single.StepTM]
tout:23 [binder, in Complexity.TM.Code.Decode]
tout:23 [binder, in Undecidability.TM.Code.BinNumbers.PosIncrementTM]
tout:23 [binder, in Undecidability.TM.Code.BinNumbers.NTM]
tout:23 [binder, in Undecidability.TM.Code.CompareValue]
tout:24 [binder, in Undecidability.TM.Code.CaseSum]
tout:24 [binder, in Undecidability.TM.Compound.WriteString]
tout:248 [binder, in Undecidability.TM.Single.StepTM]
tout:25 [binder, in Undecidability.TM.Combinators.SequentialComposition]
tout:251 [binder, in Undecidability.TM.Hoare.HoareLogic]
tout:256 [binder, in Undecidability.TM.Single.StepTM]
tout:26 [binder, in Undecidability.TM.Compound.Multi]
tout:26 [binder, in Undecidability.TM.Code.BinNumbers.PosShiftTM]
tout:27 [binder, in Undecidability.TM.Code.BinNumbers.NTM]
tout:272 [binder, in Undecidability.TM.Hoare.HoareLogic]
tout:28 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
tout:280 [binder, in Undecidability.TM.Single.StepTM]
tout:29 [binder, in Undecidability.TM.L.Transcode.Boollist_to_Enc]
tout:29 [binder, in Undecidability.TM.Code.List.Rev]
tout:291 [binder, in Undecidability.TM.Hoare.HoareCombinators]
tout:296 [binder, in Undecidability.TM.Hoare.HoareLogic]
tout:3 [binder, in Undecidability.TM.Code.BinNumbers.PosCompareTM]
tout:3 [binder, in Undecidability.TM.Code.BinNumbers.PosShiftTM]
tout:30 [binder, in Undecidability.TM.Code.CasePair]
tout:301 [binder, in Undecidability.TM.Single.StepTM]
tout:307 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
tout:31 [binder, in Undecidability.TM.Code.CaseSum]
tout:31 [binder, in Undecidability.TM.Combinators.If]
tout:31 [binder, in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
tout:312 [binder, in Undecidability.TM.Single.StepTM]
tout:313 [binder, in Undecidability.TM.Hoare.HoareLogic]
tout:32 [binder, in Undecidability.TM.Code.BinNumbers.NTM]
tout:32 [binder, in Undecidability.TM.Code.List.App]
tout:320 [binder, in Undecidability.TM.Hoare.HoareCombinators]
tout:33 [binder, in Undecidability.TM.Code.NatTM]
tout:331 [binder, in Undecidability.TM.Single.StepTM]
tout:334 [binder, in Undecidability.TM.Hoare.HoareLogic]
tout:336 [binder, in Undecidability.TM.Hoare.HoareCombinators]
tout:34 [binder, in Undecidability.TM.Code.WriteValue]
tout:340 [binder, in Undecidability.TM.Hoare.HoareCombinators]
tout:343 [binder, in Undecidability.TM.Hoare.HoareCombinators]
tout:348 [binder, in Undecidability.TM.Hoare.HoareCombinators]
tout:35 [binder, in Undecidability.TM.Compound.CopySymbols]
tout:353 [binder, in Undecidability.TM.Hoare.HoareCombinators]
tout:355 [binder, in Undecidability.TM.Single.StepTM]
tout:358 [binder, in Undecidability.TM.Hoare.HoareLogic]
tout:358 [binder, in Undecidability.TM.Hoare.HoareCombinators]
tout:36 [binder, in Undecidability.TM.Code.BinNumbers.PosMultTM]
tout:36 [binder, in Undecidability.TM.Code.BinNumbers.PosShiftTM]
tout:362 [binder, in Undecidability.TM.Single.StepTM]
tout:37 [binder, in Undecidability.TM.Code.CaseList]
tout:37 [binder, in Undecidability.TM.Code.BinNumbers.NTM]
tout:37 [binder, in Undecidability.TM.Code.BinNumbers.PosAddTM]
tout:379 [binder, in Undecidability.TM.Single.StepTM]
tout:38 [binder, in Undecidability.TM.Code.List.Length]
tout:385 [binder, in Undecidability.TM.Hoare.HoareLogic]
tout:396 [binder, in Undecidability.TM.Hoare.HoareCombinators]
tout:4 [binder, in Undecidability.TM.Code.CaseNat]
tout:4 [binder, in Undecidability.TM.Code.CaseBool]
tout:4 [binder, in Undecidability.TM.Code.BinNumbers.NTM]
tout:4 [binder, in Undecidability.TM.L.CaseCom]
tout:4 [binder, in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
tout:400 [binder, in Undecidability.TM.Hoare.HoareCombinators]
tout:402 [binder, in Undecidability.TM.Single.StepTM]
tout:404 [binder, in Undecidability.TM.Hoare.HoareLogic]
tout:409 [binder, in Undecidability.TM.Hoare.HoareCombinators]
tout:41 [binder, in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
tout:417 [binder, in Undecidability.TM.Hoare.HoareCombinators]
tout:42 [binder, in Undecidability.TM.Combinators.While]
tout:42 [binder, in Complexity.NP.TM.M_multi2mono]
tout:423 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
tout:43 [binder, in Undecidability.TM.L.HeapInterpreter.LookupTM]
tout:430 [binder, in Undecidability.TM.Single.StepTM]
tout:44 [binder, in Undecidability.TM.Code.BinNumbers.PosShiftTM]
tout:45 [binder, in Undecidability.TM.Code.CaseSum]
tout:453 [binder, in Undecidability.TM.Single.StepTM]
tout:46 [binder, in Undecidability.TM.Combinators.While]
tout:46 [binder, in Undecidability.TM.Compound.MoveToSymbol]
tout:462 [binder, in Undecidability.TM.Single.StepTM]
tout:47 [binder, in Undecidability.TM.Code.CasePair]
tout:47 [binder, in Undecidability.TM.Code.BinNumbers.PosAddTM]
tout:478 [binder, in Undecidability.TM.Single.StepTM]
tout:48 [binder, in Undecidability.TM.Code.BinNumbers.PosCompareTM]
tout:48 [binder, in Undecidability.TM.Compound.Compare]
tout:48 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
tout:49 [binder, in Undecidability.TM.Code.BinNumbers.PosMultTM]
tout:49 [binder, in Undecidability.TM.Code.CaseSum]
tout:49 [binder, in Undecidability.TM.Compound.Shift]
tout:49 [binder, in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
tout:5 [binder, in Undecidability.TM.L.Transcode.Boollist_to_Enc]
tout:5 [binder, in Complexity.NP.TM.M_LM2TM]
tout:5 [binder, in Undecidability.TM.Compound.Shift]
tout:50 [binder, in Undecidability.TM.Code.List.Rev]
tout:508 [binder, in Undecidability.TM.Single.StepTM]
tout:52 [binder, in Undecidability.TM.Code.List.App]
tout:56 [binder, in Undecidability.TM.Code.BinNumbers.PosShiftTM]
tout:58 [binder, in Undecidability.TM.Code.NatTM]
tout:58 [binder, in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
tout:59 [binder, in Undecidability.TM.Code.List.Length]
tout:6 [binder, in Undecidability.TM.L.Transcode.Boollist_to_Enc]
tout:6 [binder, in Undecidability.TM.Code.CaseFin]
tout:6 [binder, in Undecidability.TM.Compound.CopySymbols]
tout:6 [binder, in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
tout:61 [binder, in Undecidability.TM.Combinators.Switch]
tout:61 [binder, in Undecidability.TM.Code.BinNumbers.PosShiftTM]
tout:64 [binder, in Undecidability.TM.Univ.LowLevel]
tout:65 [binder, in Undecidability.TM.Code.CasePair]
tout:66 [binder, in Undecidability.TM.Code.BinNumbers.PosShiftTM]
tout:67 [binder, in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
tout:7 [binder, in Undecidability.TM.Code.List.Cons_constant]
tout:70 [binder, in Undecidability.TM.Combinators.Switch]
tout:70 [binder, in Undecidability.TM.Code.BinNumbers.PosCompareTM]
tout:70 [binder, in Undecidability.TM.Univ.LowLevel]
tout:71 [binder, in Undecidability.TM.Univ.Univ]
tout:72 [binder, in Undecidability.TM.Code.CaseList]
tout:72 [binder, in Complexity.TM.Single.DecodeTape]
tout:73 [binder, in Undecidability.TM.Combinators.While]
tout:76 [binder, in Undecidability.TM.Code.BinNumbers.PosCompareTM]
tout:79 [binder, in Undecidability.TM.Combinators.While]
tout:79 [binder, in Undecidability.TM.Code.NatTM]
tout:79 [binder, in Undecidability.TM.Univ.LowLevel]
tout:79 [binder, in Undecidability.TM.Hoare.HoareExamples]
tout:8 [binder, in Undecidability.TM.Hoare.HoareLegacy]
tout:8 [binder, in Undecidability.TM.Compound.MoveToSymbol]
tout:8 [binder, in Undecidability.TM.Code.List.Rev]
tout:80 [binder, in Undecidability.TM.Code.CaseList]
tout:81 [binder, in Undecidability.TM.Code.BinNumbers.PosAddTM]
tout:81 [binder, in Undecidability.TM.Hoare.HoareExamples]
tout:82 [binder, in Undecidability.TM.Code.BinNumbers.PosShiftTM]
tout:83 [binder, in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
tout:84 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
tout:84 [binder, in Undecidability.TM.Hoare.HoareExamples]
tout:86 [binder, in Undecidability.TM.Univ.LowLevel]
tout:87 [binder, in Undecidability.TM.Hoare.HoareExamples]
tout:88 [binder, in Undecidability.TM.Code.CaseList]
tout:88 [binder, in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
tout:89 [binder, in Undecidability.TM.Code.NatTM]
tout:9 [binder, in Undecidability.TM.Code.BinNumbers.NTM]
tout:9 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
tout:9 [binder, in Undecidability.TM.Hoare.HoareLogic]
tout:90 [binder, in Undecidability.TM.Code.Copy]
tout:92 [binder, in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
tout:92 [binder, in Undecidability.TM.Code.BinNumbers.PosShiftTM]
tout:93 [binder, in Undecidability.TM.Hoare.HoareLogic]
tout:94 [binder, in Undecidability.TM.Univ.LowLevel]
tout:94 [binder, in Undecidability.TM.Code.Copy]
tout:97 [binder, in Undecidability.TM.Compound.MoveToSymbol]
tout:97 [binder, in Undecidability.TM.Code.BinNumbers.PosAddTM]
tout:99 [binder, in Undecidability.TM.Code.NatTM]
toVertex [definition, in Complexity.NP.Clique.kSAT_to_FlatClique]
toVertex_poly [lemma, in Complexity.NP.Clique.kSAT_to_FlatClique]
toVertex_time_bound [lemma, in Complexity.NP.Clique.kSAT_to_FlatClique]
toVertex_time [definition, in Complexity.NP.Clique.kSAT_to_FlatClique]
to_list_length [lemma, in Undecidability.L.Datatypes.LVector]
to_cumul_spec [lemma, in Undecidability.Synthetic.ListEnumerabilityFacts]
to_cumul_cumulative [lemma, in Undecidability.Synthetic.ListEnumerabilityFacts]
to_cumul [definition, in Undecidability.Synthetic.ListEnumerabilityFacts]
to_list [definition, in Undecidability.L.Prelim.StringBase]
to_string [definition, in Undecidability.L.Prelim.StringBase]
to_dec [lemma, in Undecidability.Shared.ListAutomation]
tpr_ptpr_agree [lemma, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
tpr:14 [binder, in Complexity.NP.SAT.CookLevin.Reductions.TCC_to_CC]
tpr:15 [binder, in Complexity.NP.SAT.CookLevin.Reductions.TCC_to_CC]
tpr:95 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
tpr:97 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
tpr:99 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
tps1a:213 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
tps1b:214 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
tps1:109 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
tps1:121 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
tps1:129 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
tps1:137 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
tps1:141 [binder, in Undecidability.TM.Single.StepTM]
tps1:152 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
tps1:161 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
tps1:162 [binder, in Undecidability.TM.Single.StepTM]
tps1:168 [binder, in Undecidability.TM.Single.StepTM]
tps1:171 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
tps1:171 [binder, in Undecidability.TM.Single.StepTM]
tps1:177 [binder, in Undecidability.TM.Single.StepTM]
tps1:185 [binder, in Undecidability.TM.Single.StepTM]
tps1:191 [binder, in Undecidability.TM.Single.StepTM]
tps1:199 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
tps1:203 [binder, in Undecidability.TM.Single.StepTM]
tps1:206 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
tps1:213 [binder, in Undecidability.TM.Single.StepTM]
tps1:221 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
tps1:223 [binder, in Undecidability.TM.Single.StepTM]
tps1:228 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
tps1:230 [binder, in Undecidability.TM.Single.StepTM]
tps1:236 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
tps1:242 [binder, in Undecidability.TM.Single.StepTM]
tps1:251 [binder, in Undecidability.TM.Single.StepTM]
tps1:259 [binder, in Undecidability.TM.Single.StepTM]
tps1:273 [binder, in Undecidability.TM.Single.StepTM]
tps1:283 [binder, in Undecidability.TM.Single.StepTM]
tps1:295 [binder, in Undecidability.TM.Single.StepTM]
tps1:332 [binder, in Undecidability.TM.Single.StepTM]
tps1:341 [binder, in Undecidability.TM.Single.StepTM]
tps1:347 [binder, in Undecidability.TM.Single.StepTM]
tps1:356 [binder, in Undecidability.TM.Single.StepTM]
tps1:380 [binder, in Undecidability.TM.Single.StepTM]
tps1:389 [binder, in Undecidability.TM.Single.StepTM]
tps1:395 [binder, in Undecidability.TM.Single.StepTM]
tps1:405 [binder, in Undecidability.TM.Single.StepTM]
tps1:417 [binder, in Undecidability.TM.Single.StepTM]
tps1:423 [binder, in Undecidability.TM.Single.StepTM]
tps1:433 [binder, in Undecidability.TM.Single.StepTM]
tps1:439 [binder, in Undecidability.TM.Single.StepTM]
tps1:447 [binder, in Undecidability.TM.Single.StepTM]
tps1:8 [binder, in Undecidability.TM.Basic.Mono]
tps1:80 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
tps1:86 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
tps1:92 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
tps1:98 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
tps2:111 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
tps2:122 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
tps2:130 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
tps2:138 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
tps2:142 [binder, in Undecidability.TM.Single.StepTM]
tps2:153 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
tps2:162 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
tps2:163 [binder, in Undecidability.TM.Single.StepTM]
tps2:169 [binder, in Undecidability.TM.Single.StepTM]
tps2:172 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
tps2:172 [binder, in Undecidability.TM.Single.StepTM]
tps2:178 [binder, in Undecidability.TM.Single.StepTM]
tps2:186 [binder, in Undecidability.TM.Single.StepTM]
tps2:192 [binder, in Undecidability.TM.Single.StepTM]
tps2:200 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
tps2:204 [binder, in Undecidability.TM.Single.StepTM]
tps2:207 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
tps2:214 [binder, in Undecidability.TM.Single.StepTM]
tps2:215 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
tps2:222 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
tps2:224 [binder, in Undecidability.TM.Single.StepTM]
tps2:229 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
tps2:231 [binder, in Undecidability.TM.Single.StepTM]
tps2:237 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
tps2:243 [binder, in Undecidability.TM.Single.StepTM]
tps2:252 [binder, in Undecidability.TM.Single.StepTM]
tps2:260 [binder, in Undecidability.TM.Single.StepTM]
tps2:274 [binder, in Undecidability.TM.Single.StepTM]
tps2:285 [binder, in Undecidability.TM.Single.StepTM]
tps2:288 [binder, in Undecidability.TM.Single.StepTM]
tps2:296 [binder, in Undecidability.TM.Single.StepTM]
tps2:333 [binder, in Undecidability.TM.Single.StepTM]
tps2:342 [binder, in Undecidability.TM.Single.StepTM]
tps2:348 [binder, in Undecidability.TM.Single.StepTM]
tps2:357 [binder, in Undecidability.TM.Single.StepTM]
tps2:381 [binder, in Undecidability.TM.Single.StepTM]
tps2:390 [binder, in Undecidability.TM.Single.StepTM]
tps2:396 [binder, in Undecidability.TM.Single.StepTM]
tps2:406 [binder, in Undecidability.TM.Single.StepTM]
tps2:418 [binder, in Undecidability.TM.Single.StepTM]
tps2:424 [binder, in Undecidability.TM.Single.StepTM]
tps2:434 [binder, in Undecidability.TM.Single.StepTM]
tps2:440 [binder, in Undecidability.TM.Single.StepTM]
tps2:448 [binder, in Undecidability.TM.Single.StepTM]
tps2:60 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
tps2:81 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
tps2:87 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
tps2:9 [binder, in Undecidability.TM.Basic.Mono]
tps2:93 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
tps2:99 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
tps:117 [binder, in Undecidability.TM.Single.StepTM]
tps:136 [binder, in Undecidability.TM.Single.StepTM]
tps:143 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
tps:144 [binder, in Undecidability.TM.Single.StepTM]
tps:147 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
tps:160 [binder, in Undecidability.TM.Single.StepTM]
tps:166 [binder, in Undecidability.TM.Single.StepTM]
tps:19 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TM_single]
tps:206 [binder, in Undecidability.TM.Single.StepTM]
tps:243 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
tps:249 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
tps:263 [binder, in Undecidability.TM.Single.StepTM]
tps:276 [binder, in Undecidability.TM.Single.StepTM]
tps:286 [binder, in Undecidability.TM.Single.StepTM]
tps:298 [binder, in Undecidability.TM.Single.StepTM]
tps:313 [binder, in Undecidability.TM.Single.StepTM]
tps:316 [binder, in Undecidability.TM.Single.StepTM]
tps:319 [binder, in Undecidability.TM.Single.StepTM]
tps:323 [binder, in Undecidability.TM.Single.StepTM]
tps:409 [binder, in Undecidability.TM.Single.StepTM]
tps:426 [binder, in Undecidability.TM.Single.StepTM]
tps:436 [binder, in Undecidability.TM.Single.StepTM]
tps:450 [binder, in Undecidability.TM.Single.StepTM]
tps:454 [binder, in Undecidability.TM.Single.StepTM]
tps:455 [binder, in Undecidability.TM.Single.StepTM]
tps:459 [binder, in Undecidability.TM.Single.StepTM]
tps:51 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
tps:55 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
tps:69 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
tps:71 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
tps:73 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
tps:76 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
tps:8 [binder, in Undecidability.TM.PrettyBounds.SizeBounds]
tp_final:226 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
tp_final:207 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
tp'':153 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
tp':106 [binder, in Undecidability.TM.Univ.Univ]
tp':113 [binder, in Undecidability.TM.Univ.Univ]
tp':120 [binder, in Undecidability.TM.Univ.Univ]
tp':123 [binder, in Undecidability.TM.Univ.Univ]
tp':131 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
tp':142 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
tp':150 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
tp':16 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
tp':167 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
tp':185 [binder, in Undecidability.TM.Univ.Univ]
tp':2717 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
tp':2731 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
tp':2737 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
tp':2745 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
tp':2762 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
tp':2773 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
tp':2781 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
tp':474 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
tp':48 [binder, in Undecidability.TM.Univ.Univ]
tp':481 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
tp':49 [binder, in Undecidability.TM.Univ.Univ]
tp':5 [binder, in Complexity.NP.SAT.CookLevin.Reductions.TMGenNP_fixed_singleTapeTM_to_FlatFunSingleTMGenNP]
tp':50 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TM_single]
tp':55 [binder, in Undecidability.TM.Univ.Univ]
tp':56 [binder, in Undecidability.TM.Univ.Univ]
tp':66 [binder, in Undecidability.TM.Univ.Univ]
tp':74 [binder, in Undecidability.TM.Univ.Univ]
tp0:462 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
tp0:463 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
tp1:101 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
tp2:102 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
tp:101 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
tp:101 [binder, in Undecidability.TM.Univ.Univ]
tp:104 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
tp:104 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
tp:105 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
tp:106 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
tp:106 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
tp:107 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
tp:108 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
tp:109 [binder, in Undecidability.TM.Univ.Univ]
tp:11 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
tp:11 [binder, in Undecidability.L.TM.TMinL]
tp:11 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TM_single]
tp:110 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
tp:111 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
tp:112 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
tp:113 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
tp:114 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
tp:114 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
tp:115 [binder, in Undecidability.TM.Univ.Univ]
tp:116 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
tp:117 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
tp:122 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
tp:123 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
tp:125 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
tp:126 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
tp:126 [binder, in Undecidability.TM.Univ.Univ]
tp:130 [binder, in Undecidability.TM.Univ.Univ]
tp:131 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
tp:133 [binder, in Complexity.TM.PrettyBounds.UnivBounds]
tp:134 [binder, in Undecidability.TM.Univ.Univ]
tp:136 [binder, in Complexity.TM.PrettyBounds.UnivBounds]
tp:137 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
tp:137 [binder, in Undecidability.TM.Single.StepTM]
tp:138 [binder, in Undecidability.TM.Univ.Univ]
tp:139 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
tp:14 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
tp:142 [binder, in Undecidability.TM.Univ.Univ]
tp:145 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
tp:146 [binder, in Undecidability.TM.Univ.Univ]
tp:147 [binder, in Undecidability.TM.Univ.LowLevel]
tp:150 [binder, in Undecidability.TM.Univ.Univ]
tp:154 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
tp:154 [binder, in Complexity.TM.PrettyBounds.UnivBounds]
tp:154 [binder, in Undecidability.TM.Univ.Univ]
tp:157 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
tp:158 [binder, in Undecidability.TM.Univ.Univ]
tp:16 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TM_single]
tp:162 [binder, in Undecidability.TM.Univ.Univ]
tp:163 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
tp:163 [binder, in Complexity.TM.PrettyBounds.UnivBounds]
tp:164 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
tp:164 [binder, in Undecidability.TM.Single.StepTM]
tp:168 [binder, in Complexity.TM.PrettyBounds.UnivBounds]
tp:168 [binder, in Undecidability.TM.Univ.Univ]
tp:170 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
tp:173 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
tp:173 [binder, in Complexity.TM.PrettyBounds.UnivBounds]
tp:177 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
tp:181 [binder, in Undecidability.TM.Univ.Univ]
tp:19 [binder, in Undecidability.TM.Univ.Univ]
tp:193 [binder, in Undecidability.TM.Single.StepTM]
tp:2 [binder, in Complexity.NP.SAT.CookLevin.Reductions.TMGenNP_fixed_singleTapeTM_to_FlatFunSingleTMGenNP]
tp:201 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
tp:205 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
tp:205 [binder, in Undecidability.TM.Single.StepTM]
tp:208 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
tp:210 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
tp:215 [binder, in Undecidability.TM.Single.StepTM]
tp:216 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
tp:218 [binder, in Undecidability.TM.Single.StepTM]
tp:22 [binder, in Undecidability.TM.Univ.Univ]
tp:220 [binder, in Undecidability.TM.Single.StepTM]
tp:223 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
tp:224 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
tp:225 [binder, in Undecidability.TM.Single.StepTM]
tp:228 [binder, in Undecidability.TM.Hoare.HoareRegister]
tp:230 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
tp:232 [binder, in Undecidability.TM.Single.StepTM]
tp:238 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
tp:239 [binder, in Undecidability.TM.Single.StepTM]
tp:244 [binder, in Undecidability.TM.Single.StepTM]
tp:253 [binder, in Undecidability.TM.Single.StepTM]
tp:259 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
tp:26 [binder, in Undecidability.TM.Univ.Univ]
tp:261 [binder, in Undecidability.TM.Single.StepTM]
tp:2640 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
tp:27 [binder, in Undecidability.TM.Univ.Univ]
tp:270 [binder, in Undecidability.TM.Single.StepTM]
tp:2714 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
tp:2721 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
tp:2727 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
tp:2733 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
tp:2739 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
tp:2743 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
tp:275 [binder, in Undecidability.TM.Single.StepTM]
tp:2751 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
tp:2757 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
tp:2768 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
tp:2771 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
tp:2777 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
tp:284 [binder, in Undecidability.TM.Single.StepTM]
tp:289 [binder, in Undecidability.TM.Single.StepTM]
tp:297 [binder, in Undecidability.TM.Single.StepTM]
tp:30 [binder, in Undecidability.TM.Univ.Univ]
tp:31 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
tp:32 [binder, in Undecidability.TM.TM]
tp:325 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
tp:327 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
tp:33 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.SingleTMGenNP]
tp:334 [binder, in Undecidability.TM.Single.StepTM]
tp:34 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
tp:343 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
tp:349 [binder, in Undecidability.TM.Single.StepTM]
tp:35 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
tp:358 [binder, in Undecidability.TM.Single.StepTM]
tp:36 [binder, in Undecidability.TM.Univ.Univ]
tp:37 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
tp:382 [binder, in Undecidability.TM.Single.StepTM]
tp:382 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
tp:397 [binder, in Undecidability.TM.Single.StepTM]
tp:40 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
tp:407 [binder, in Undecidability.TM.Single.StepTM]
tp:41 [binder, in Undecidability.TM.Univ.Univ]
tp:419 [binder, in Undecidability.TM.Single.StepTM]
tp:42 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
tp:425 [binder, in Undecidability.TM.Single.StepTM]
tp:43 [binder, in Undecidability.TM.Univ.Univ]
tp:435 [binder, in Undecidability.TM.Single.StepTM]
tp:437 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
tp:439 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
tp:44 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
tp:441 [binder, in Undecidability.TM.Single.StepTM]
tp:449 [binder, in Undecidability.TM.Single.StepTM]
tp:452 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
tp:453 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
tp:459 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
tp:46 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
tp:46 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
tp:464 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
tp:467 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
tp:473 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
tp:48 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TM_single]
tp:480 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
tp:49 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
tp:49 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
tp:5 [binder, in Undecidability.TM.Univ.Univ]
tp:51 [binder, in Undecidability.TM.Univ.Univ]
tp:52 [binder, in Undecidability.TM.Univ.LowLevel]
tp:55 [binder, in Undecidability.TM.Univ.LowLevel]
tp:57 [binder, in Undecidability.TM.Univ.Univ]
tp:59 [binder, in Undecidability.TM.Univ.LowLevel]
tp:60 [binder, in Undecidability.TM.Univ.Univ]
tp:61 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
tp:67 [binder, in Undecidability.TM.Univ.LowLevel]
tp:68 [binder, in Undecidability.TM.Univ.Univ]
tp:7 [binder, in Complexity.NP.TM.TMGenNP]
tp:70 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
tp:71 [binder, in Undecidability.TM.Univ.LowLevel]
tp:77 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
tp:77 [binder, in Undecidability.TM.Univ.Univ]
tp:8 [binder, in Undecidability.TM.Univ.Univ]
tp:80 [binder, in Undecidability.TM.Univ.LowLevel]
tp:81 [binder, in Undecidability.TM.Univ.Univ]
tp:85 [binder, in Undecidability.TM.Univ.Univ]
tp:87 [binder, in Undecidability.TM.Univ.LowLevel]
tp:89 [binder, in Undecidability.TM.Univ.Univ]
tp:93 [binder, in Undecidability.TM.Univ.Univ]
tp:97 [binder, in Undecidability.TM.Univ.Univ]
trace [inductive, in Complexity.Complexity.SpaceBoundsTime]
TraceArgument [section, in Complexity.Complexity.SpaceBoundsTime]
TraceArgument.R [variable, in Complexity.Complexity.SpaceBoundsTime]
TraceArgument.X [variable, in Complexity.Complexity.SpaceBoundsTime]
traceCons [constructor, in Complexity.Complexity.SpaceBoundsTime]
traceUn [constructor, in Complexity.Complexity.SpaceBoundsTime]
trace_not_dupfree_loop [lemma, in Complexity.Complexity.SpaceBoundsTime]
trace_app [lemma, in Complexity.Complexity.SpaceBoundsTime]
trans [projection, in Complexity.L.TM.TMflat]
trans [projection, in Undecidability.TM.TM]
trans [projection, in Undecidability.TM.SBTM]
trans [abbreviation, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transb:17 [binder, in Undecidability.L.Complexity.UpToCNary]
transEnvAddS [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transEnvAddSM [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transEnvAddSM_envBounded [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
transEnvAddS_envBounded [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
transition_graph_injective [lemma, in Undecidability.TM.Univ.LowLevel]
transitive [definition, in Undecidability.L.Prelim.ARS]
Translate [definition, in Undecidability.TM.Code.Copy]
translate [definition, in Undecidability.TM.Code.Copy]
Translate [section, in Undecidability.TM.Code.Copy]
TranslateAct [section, in Undecidability.TM.Lifting.LiftAlphabet]
TranslateAct.X [variable, in Undecidability.TM.Lifting.LiftAlphabet]
TranslateAct.Y [variable, in Undecidability.TM.Lifting.LiftAlphabet]
Translate_steps_nice [lemma, in Complexity.TM.PrettyBounds.BaseCode]
Translate_Spec [lemma, in Undecidability.TM.Code.Copy]
Translate_Spec_size [lemma, in Undecidability.TM.Code.Copy]
Translate_SpecT [lemma, in Undecidability.TM.Code.Copy]
Translate_SpecT_size [lemma, in Undecidability.TM.Code.Copy]
Translate_Terminates [lemma, in Undecidability.TM.Code.Copy]
Translate_T [definition, in Undecidability.TM.Code.Copy]
Translate_steps [definition, in Undecidability.TM.Code.Copy]
Translate_Realise [lemma, in Undecidability.TM.Code.Copy]
Translate_Rel [definition, in Undecidability.TM.Code.Copy]
Translate' [definition, in Undecidability.TM.Code.Copy]
Translate'_Terminates [lemma, in Undecidability.TM.Code.Copy]
Translate'_steps [definition, in Undecidability.TM.Code.Copy]
Translate'_Realise [lemma, in Undecidability.TM.Code.Copy]
Translate'_Rel [definition, in Undecidability.TM.Code.Copy]
Translate.cX [variable, in Undecidability.TM.Code.Copy]
Translate.I1 [variable, in Undecidability.TM.Code.Copy]
Translate.I2 [variable, in Undecidability.TM.Code.Copy]
Translate.sig [variable, in Undecidability.TM.Code.Copy]
Translate.sigX [variable, in Undecidability.TM.Code.Copy]
Translate.X [variable, in Undecidability.TM.Code.Copy]
transNNCenter [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transNNCenterCenterC [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transNNCenterLeftC [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transNNCenterRightC [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transNNLeft [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transNNLeftCenterC [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transNNLeftLeftC [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transNNLeftRightC [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transNNRight [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transNNRightCenterC [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transNNRightLeftC [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transNNRightRightC [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transNoneLeftCenter [inductive, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transNoneLeftCenter_inv [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transNoneLeftLeft [inductive, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transNoneLeftLeft_inv [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transNoneLeftRight [inductive, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transNoneLeftRight_inv [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transNoneNone [inductive, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transNoneNoneC [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transNoneNoneCenter [inductive, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transNoneNoneCenter_inv3 [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transNoneNoneCenter_inv2 [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transNoneNoneCenter_inv1 [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transNoneNoneCenter_inv [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transNoneNoneLeft [inductive, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transNoneNoneLeft_inv3 [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transNoneNoneLeft_inv2 [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transNoneNoneLeft_inv1 [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transNoneNoneLeft_inv [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transNoneNoneRight [inductive, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transNoneNoneRight_inv3 [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transNoneNoneRight_inv2 [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transNoneNoneRight_inv1 [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transNoneNoneRight_inv [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transNoneNone_inv3 [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transNoneNone_inv2 [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transNoneNone_inv1 [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transNoneNone_inv [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transNoneRightCenter [inductive, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transNoneRightCenter_inv [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transNoneRightLeft [inductive, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transNoneRightLeft_inv [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transNoneRightRight [inductive, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transNoneRightRight_inv [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transNoneSome [inductive, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transNoneSomeC [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transNoneSomeCenter [inductive, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transNoneSomeCenter_inv3 [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transNoneSomeCenter_inv2 [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transNoneSomeCenter_inv1 [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transNoneSomeCenter_inv [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transNoneSomeLeft [inductive, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transNoneSomeLeft_inv3 [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transNoneSomeLeft_inv2 [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transNoneSomeLeft_inv1 [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transNoneSomeLeft_inv [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transNoneSomeRight [inductive, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transNoneSomeRight_inv3 [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transNoneSomeRight_inv2 [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transNoneSomeRight_inv1 [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transNoneSomeRight_inv [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transNoneSome_inv3 [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transNoneSome_inv2 [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transNoneSome_inv1 [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transNoneSome_inv [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transNoneStayCenter [inductive, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transNoneStayCenter_inv [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transNoneStayLeft [inductive, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transNoneStayLeft_inv [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transNoneStayRight [inductive, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transNoneStayRight_inv [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transNSCenter [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transNSLeft [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transNSLeftCenterC [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transNSLeftLeftC [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transNSLeftRightC [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transNSRight [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transNSRightCenterC [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transNSRightLeftC [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transNSRightRightC [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transNSStayCenterC [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transNSStayLeftC [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transNSStayRightC [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transRule [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transRules [inductive, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transRules_statesym [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transRules_statesym3 [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transRules_statesym2 [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transRules_statesym1 [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transRules_semCasesCenter [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transRules_semCasesRight [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transRules_semCasesLeft [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transRules_inv [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transSNCenter [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transSNLeft [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transSNLeftCenterC [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transSNLeftLeftC [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transSNLeftRightC [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transSNRight [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transSNRightCenterC [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transSNRightLeftC [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transSNRightRightC [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transSNStayCenterC [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transSNStayLeftC [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transSNStayRightC [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transSomeLeftCenter [inductive, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transSomeLeftCenter_inv [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transSomeLeftLeft [inductive, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transSomeLeftLeft_inv [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transSomeLeftRight [inductive, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transSomeLeftRight_inv [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transSomeNone [inductive, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transSomeNoneC [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transSomeNoneCenter [inductive, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transSomeNoneCenter_inv3 [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transSomeNoneCenter_inv2 [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transSomeNoneCenter_inv1 [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transSomeNoneCenter_inv [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transSomeNoneLeft [inductive, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transSomeNoneLeft_inv3 [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transSomeNoneLeft_inv2 [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transSomeNoneLeft_inv1 [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transSomeNoneLeft_inv [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transSomeNoneRight [inductive, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transSomeNoneRight_inv3 [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transSomeNoneRight_inv2 [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transSomeNoneRight_inv1 [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transSomeNoneRight_inv [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transSomeNone_inv3 [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transSomeNone_inv2 [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transSomeNone_inv1 [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transSomeNone_inv [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transSomeRightCenter [inductive, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transSomeRightCenter_inv [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transSomeRightLeft [inductive, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transSomeRightLeft_inv [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transSomeRightRight [inductive, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transSomeRightRight_inv [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transSomeSome [inductive, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transSomeSomeC [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transSomeSomeCenter [inductive, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transSomeSomeCenter_inv3 [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transSomeSomeCenter_inv2 [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transSomeSomeCenter_inv1 [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transSomeSomeCenter_inv [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transSomeSomeLeft [inductive, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transSomeSomeLeft_inv3 [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transSomeSomeLeft_inv2 [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transSomeSomeLeft_inv1 [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transSomeSomeLeft_inv [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transSomeSomeRight [inductive, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transSomeSomeRight_inv3 [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transSomeSomeRight_inv2 [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transSomeSomeRight_inv1 [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transSomeSomeRight_inv [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transSomeSome_inv3 [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transSomeSome_inv2 [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transSomeSome_inv1 [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transSomeSome_inv [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transSomeStayCenter [inductive, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transSomeStayCenter_inv [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transSomeStayLeft [inductive, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transSomeStayLeft_inv [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transSomeStayRight [inductive, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transSomeStayRight_inv [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transSSCenter [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transSSLeft [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transSSLeftCenterC [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transSSLeftLeftC [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transSSLeftRightC [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transSSRight [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transSSRightCenterC [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transSSRightLeftC [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transSSRightRightC [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transSSStayCenterC [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transSSStayLeftC [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transSSStayRightC [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transTime [definition, in Undecidability.L.TM.TMinL.TMinL_extract]
transt:3659 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transt:636 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
transt:642 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
trans_map_keys_injective [lemma, in Undecidability.TM.Univ.LowLevel]
trans_map_values [definition, in Undecidability.TM.Univ.LowLevel]
trans_map_keys [definition, in Undecidability.TM.Univ.LowLevel]
trans':23 [binder, in Complexity.L.TM.TMflatFun]
trans0:101 [binder, in Complexity.L.TM.TMunflatten]
trans:22 [binder, in Complexity.L.TM.TMflatFun]
trans:42 [binder, in Complexity.L.TM.TMflatFun]
trans:53 [binder, in Complexity.L.TM.TMflatFun]
trans:8 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TM_single]
tRel [definition, in Undecidability.TM.Util.TM_facts]
triangle_bijection [inductive, in Undecidability.Shared.Libs.DLW.Utils.sorting]
Triple [inductive, in Undecidability.TM.Hoare.HoareLogic]
TripleE [lemma, in Undecidability.TM.Hoare.HoareLogic]
TripleI [constructor, in Undecidability.TM.Hoare.HoareLogic]
TripleT [inductive, in Undecidability.TM.Hoare.HoareLogic]
TripleTE [lemma, in Undecidability.TM.Hoare.HoareLogic]
TripleTI [constructor, in Undecidability.TM.Hoare.HoareLogic]
TripleT_Downlift_withSpace [lemma, in Undecidability.TM.Hoare.HoareRegister]
TripleT_RemoveSpace [lemma, in Undecidability.TM.Hoare.HoareRegister]
TripleT_introPure [lemma, in Undecidability.TM.Hoare.HoareRegister]
TripleT_and_con [lemma, in Undecidability.TM.Hoare.HoareLogic]
TripleT_and_pre [lemma, in Undecidability.TM.Hoare.HoareLogic]
TripleT_eta_con2 [lemma, in Undecidability.TM.Hoare.HoareLogic]
TripleT_eta_con [lemma, in Undecidability.TM.Hoare.HoareLogic]
TripleT_eta_pre [lemma, in Undecidability.TM.Hoare.HoareLogic]
TripleT_forall_con [lemma, in Undecidability.TM.Hoare.HoareLogic]
TripleT_forall_pre [lemma, in Undecidability.TM.Hoare.HoareLogic]
TripleT_exists_con [lemma, in Undecidability.TM.Hoare.HoareLogic]
TripleT_exists_pre [lemma, in Undecidability.TM.Hoare.HoareLogic]
TripleT_Entails_Proper [instance, in Undecidability.TM.Hoare.HoareLogic]
TripleT_TerminatesIn [lemma, in Undecidability.TM.Hoare.HoareLogic]
TripleT_Realise [lemma, in Undecidability.TM.Hoare.HoareLogic]
TripleT_False [lemma, in Undecidability.TM.Hoare.HoareLogic]
TripleT_Triple [lemma, in Undecidability.TM.Hoare.HoareLogic]
TripleT_iff [lemma, in Undecidability.TM.Hoare.HoareLogic]
Triple_Downlift_withSpace [lemma, in Undecidability.TM.Hoare.HoareRegister]
Triple_RemoveSpace [lemma, in Undecidability.TM.Hoare.HoareRegister]
Triple_RemoveSpace_ex [lemma, in Undecidability.TM.Hoare.HoareRegister]
Triple_introPure [lemma, in Undecidability.TM.Hoare.HoareRegister]
Triple_and_con [lemma, in Undecidability.TM.Hoare.HoareLogic]
Triple_and_pre [lemma, in Undecidability.TM.Hoare.HoareLogic]
Triple_eta_con2 [lemma, in Undecidability.TM.Hoare.HoareLogic]
Triple_eta_con [lemma, in Undecidability.TM.Hoare.HoareLogic]
Triple_eta_pre [lemma, in Undecidability.TM.Hoare.HoareLogic]
Triple_forall_con [lemma, in Undecidability.TM.Hoare.HoareLogic]
Triple_forall_pre [lemma, in Undecidability.TM.Hoare.HoareLogic]
Triple_exists_con [lemma, in Undecidability.TM.Hoare.HoareLogic]
Triple_exists_pre [lemma, in Undecidability.TM.Hoare.HoareLogic]
Triple_Entails_Proper [instance, in Undecidability.TM.Hoare.HoareLogic]
Triple_Realise [lemma, in Undecidability.TM.Hoare.HoareLogic]
Triple_True [lemma, in Undecidability.TM.Hoare.HoareLogic]
Triple_False [lemma, in Undecidability.TM.Hoare.HoareLogic]
Triple_TRel [definition, in Undecidability.TM.Hoare.HoareLogic]
Triple_iff [lemma, in Undecidability.TM.Hoare.HoareLogic]
Triple_Rel [definition, in Undecidability.TM.Hoare.HoareLogic]
trivialNoInstance [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
trivialNoInstance [definition, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
trivialNoInstance [lemma, in Complexity.NP.Clique.kSAT_to_Clique]
trivialNoInstance [definition, in Complexity.NP.SAT.CookLevin.Reductions.CC_to_BinaryCC]
trivialNoInstance [definition, in Complexity.NP.Clique.kSAT_to_FlatClique]
trivialNoInstance_isNoInstance [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
trivialNoInstance_isNoInstance [lemma, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
trivialNoInstance_isNoInstance [lemma, in Complexity.NP.SAT.CookLevin.Reductions.CC_to_BinaryCC]
trivialNoInstance_isNoInstance [lemma, in Complexity.NP.Clique.kSAT_to_FlatClique]
trivial_no_instance_is_no [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
trivial_no_instance [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
trueOrDiverge [definition, in Undecidability.L.Datatypes.LBool]
TrueOrDiverge [module, in Complexity.NP.TM.LM_to_mTM]
trueOrDiverge_eval [lemma, in Undecidability.L.Datatypes.LBool]
trueOrDiverge_true [lemma, in Undecidability.L.Datatypes.LBool]
trueOrDiverge_proc [lemma, in Undecidability.L.Datatypes.LBool]
TrueOrDiverge.M [definition, in Complexity.NP.TM.LM_to_mTM]
TrueOrDiverge.Realise [lemma, in Complexity.NP.TM.LM_to_mTM]
TrueOrDiverge.sec [section, in Complexity.NP.TM.LM_to_mTM]
TrueOrDiverge.sec.M' [variable, in Complexity.NP.TM.LM_to_mTM]
TrueOrDiverge.sec.n [variable, in Complexity.NP.TM.LM_to_mTM]
TrueOrDiverge.sec.sig [variable, in Complexity.NP.TM.LM_to_mTM]
TrueOrDiverge.Terminates [lemma, in Complexity.NP.TM.LM_to_mTM]
True_eq_dec [instance, in Undecidability.Shared.Libs.PSL.EqDec]
True_dec [instance, in Undecidability.Shared.Libs.PSL.EqDec]
True_enum_ok [lemma, in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicFinTypes]
True_eq_dec [instance, in Undecidability.Shared.Dec]
True_dec [instance, in Undecidability.Shared.Dec]
tr:144 [binder, in Undecidability.TM.Compound.MoveToSymbol]
tr:181 [binder, in Undecidability.TM.Compound.MoveToSymbol]
tseytin [definition, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
tseytinAnd [definition, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
tseytinAnd_3CNF [lemma, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
tseytinAnd_cnf_varsIn [lemma, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
tseytinAnd_sat [lemma, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
tseytinEquiv [definition, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
tseytinEquiv_3CNF [lemma, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
tseytinEquiv_cnf_varsIn [lemma, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
tseytinEquiv_sat [lemma, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
tseytinNot [definition, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
tseytinNot_3CNF [lemma, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
tseytinNot_cnf_varsIn [lemma, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
tseytinNot_sat [lemma, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
tseytinOr [definition, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
tseytinOr_3CNF [lemma, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
tseytinOr_cnf_varsIn [lemma, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
tseytinOr_sat [lemma, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
tseytinP_poly [lemma, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
tseytinP_time_bound [lemma, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
tseytinP_time [definition, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
tseytinP_varBound [lemma, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
tseytinP_nf_bound [lemma, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
tseytinP_size [lemma, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
tseytinP_3CNF [lemma, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
tseytinP_repr [lemma, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
tseytinP_nf_monotonic [lemma, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
tseytinTrue [definition, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
tseytinTrue_3CNF [lemma, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
tseytinTrue_cnf_varsIn [lemma, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
tseytinTrue_sat [lemma, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
tseytin_poly [lemma, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
tseytin_time_bound [lemma, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
tseytin_time [definition, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
tseytin_varBound [lemma, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
tseytin_size [lemma, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
tseytin_3CNF [lemma, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
tseytin_repr [lemma, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
tseytin_formula_repr_s [lemma, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
tseytin_formula_repr [definition, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
tseytin' [definition, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
tslc [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
tsll [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
tslr [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
tspec [definition, in Undecidability.TM.Hoare.HoareRegister]
tspecE [lemma, in Undecidability.TM.Hoare.HoareRegister]
tspecI [lemma, in Undecidability.TM.Hoare.HoareRegister]
tspec_Frame_withSpace' [lemma, in Undecidability.TM.Hoare.HoareRegister]
tspec_Downlift_withSpace [lemma, in Undecidability.TM.Hoare.HoareRegister]
tspec_space_ext [lemma, in Undecidability.TM.Hoare.HoareRegister]
tspec_ext [lemma, in Undecidability.TM.Hoare.HoareRegister]
tspec_space_solve [lemma, in Undecidability.TM.Hoare.HoareRegister]
tspec_solve [lemma, in Undecidability.TM.Hoare.HoareRegister]
tspec_revertPure [lemma, in Undecidability.TM.Hoare.HoareRegister]
tspec_introPure [lemma, in Undecidability.TM.Hoare.HoareRegister]
tspec_tspec_withSpace [lemma, in Undecidability.TM.Hoare.HoareRegister]
tspec_single_tspec_single_withSpace [lemma, in Undecidability.TM.Hoare.HoareRegister]
tspec_withSpace_tspec [lemma, in Undecidability.TM.Hoare.HoareRegister]
tspec_single_withSpace_tspec_single [lemma, in Undecidability.TM.Hoare.HoareRegister]
tspec_Entails [lemma, in Undecidability.TM.Hoare.HoareRegister]
tspec_iff [lemma, in Undecidability.TM.Hoare.HoareRegister]
tspec_single_Contains_size_Contains [lemma, in Undecidability.TM.Hoare.HoareRegister]
tspec_single [definition, in Undecidability.TM.Hoare.HoareRegister]
tsrc [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
tsrl [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
tsrr [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
tssc [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
tssl [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
tssr [constructor, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
ts':18 [binder, in Complexity.L.TM.TMflatFun]
ts:12 [binder, in Undecidability.L.TM.TapeFuns]
ts:12 [binder, in Complexity.L.TM.TMflatFun]
ts:13 [binder, in Complexity.NP.SAT.CookLevin.Reductions.TMGenNP_fixed_singleTapeTM_to_FlatFunSingleTMGenNP]
ts:15 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
ts:15 [binder, in Complexity.NP.TM.TMGenNP_fixed_mTM]
ts:17 [binder, in Complexity.NP.SAT.CookLevin.Reductions.TMGenNP_fixed_singleTapeTM_to_FlatFunSingleTMGenNP]
ts:17 [binder, in Complexity.L.TM.TMflatFun]
ts:19 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
ts:234 [binder, in Complexity.L.TM.TMunflatten]
ts:27 [binder, in Complexity.NP.TM.TMGenNP_fixed_mTM]
ts:36 [binder, in Complexity.NP.TM.M_multi2mono]
ts:5 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
ts:51 [binder, in Undecidability.TM.Util.TM_facts]
ts:53 [binder, in Undecidability.TM.L.CompilerBoolFuns.NaryApp]
ts:6 [binder, in Complexity.NP.TM.TMGenNP_fixed_mTM]
ts:8 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
ts:8 [binder, in Undecidability.L.TM.TapeFuns]
ts:91 [binder, in Complexity.L.TM.TMflatComp]
ts:94 [binder, in Complexity.L.TM.TMflatComp]
TT [inductive, in Undecidability.L.Tactics.Computable]
tt1:107 [binder, in Undecidability.L.Tactics.ComputableTime]
tt1:11 [binder, in Undecidability.L.Tactics.Computable]
tt1:120 [binder, in Undecidability.L.Tactics.ComputableTime]
tt1:124 [binder, in Undecidability.L.Tactics.Computable]
tt1:127 [binder, in Undecidability.L.Tactics.ComputableTime]
tt1:130 [binder, in Undecidability.L.Tactics.Computable]
tt1:135 [binder, in Undecidability.L.Tactics.Computable]
tt1:148 [binder, in Undecidability.L.Tactics.Computable]
tt1:151 [binder, in Undecidability.L.Tactics.ComputableTime]
tt1:162 [binder, in Undecidability.L.Tactics.ComputableTime]
tt1:46 [binder, in Undecidability.L.Tactics.Computable]
tt1:54 [binder, in Undecidability.L.Tactics.Computable]
tt1:65 [binder, in Undecidability.L.Tactics.ComputableTime]
tt1:70 [binder, in Undecidability.L.Tactics.Computable]
tt1:75 [binder, in Undecidability.L.Tactics.ComputableTime]
tt1:76 [binder, in Undecidability.L.Tactics.Computable]
tt1:86 [binder, in Undecidability.L.Tactics.Computable]
tt1:90 [binder, in Undecidability.L.Tactics.ComputableTime]
tt2:12 [binder, in Undecidability.L.Tactics.Computable]
tt2:125 [binder, in Undecidability.L.Tactics.Computable]
tt2:128 [binder, in Undecidability.L.Tactics.ComputableTime]
tt2:47 [binder, in Undecidability.L.Tactics.Computable]
tt2:55 [binder, in Undecidability.L.Tactics.Computable]
tt2:66 [binder, in Undecidability.L.Tactics.ComputableTime]
tt2:76 [binder, in Undecidability.L.Tactics.ComputableTime]
tt2:77 [binder, in Undecidability.L.Tactics.Computable]
tt2:87 [binder, in Undecidability.L.Tactics.Computable]
tt2:91 [binder, in Undecidability.L.Tactics.ComputableTime]
tt:101 [binder, in Undecidability.L.Tactics.Computable]
tt:103 [binder, in Undecidability.L.Tactics.Computable]
tt:108 [binder, in Undecidability.L.Tactics.Computable]
tt:140 [binder, in Undecidability.L.Tactics.ComputableTime]
tt:146 [binder, in Undecidability.L.Tactics.ComputableTime]
tt:179 [binder, in Undecidability.L.Tactics.ComputableTime]
tt:188 [binder, in Undecidability.L.Tactics.ComputableTime]
tt:194 [binder, in Undecidability.L.Tactics.ComputableTime]
tt:2 [binder, in Undecidability.L.Tactics.ComputableTime]
tt:94 [binder, in Undecidability.L.Tactics.Computable]
tupToEvalEnv [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
TyArr [constructor, in Undecidability.L.Tactics.Computable]
TyB [constructor, in Undecidability.L.Tactics.Computable]
type [projection, in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
type:1 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
ty:101 [binder, in Undecidability.L.Tactics.ComputableTime]
ty:113 [binder, in Undecidability.L.Tactics.ComputableTime]
ty:16 [binder, in Undecidability.L.Tactics.Lbeta_nonrefl]
ty:23 [binder, in Undecidability.L.Tactics.ComputableTime]
ty:25 [binder, in Undecidability.L.Tactics.Computable]
ty:29 [binder, in Undecidability.L.Tactics.Computable]
ty:30 [binder, in Undecidability.L.Tactics.ComputableTime]
ty:35 [binder, in Undecidability.L.Tactics.ComputableTime]
ty:35 [binder, in Undecidability.L.Tactics.Computable]
ty:38 [binder, in Undecidability.L.Tactics.Computable]
ty:40 [binder, in Undecidability.L.Tactics.ComputableTime]
ty:44 [binder, in Undecidability.L.Tactics.ComputableTime]
ty:48 [binder, in Undecidability.L.Tactics.ComputableTime]
ty:53 [binder, in Undecidability.L.Tactics.ComputableTime]
ty:57 [binder, in Undecidability.L.Tactics.ComputableTime]
ty:6 [binder, in Undecidability.L.Tactics.ComputableTime]
ty:65 [binder, in Undecidability.L.Tactics.Computable]
T_fin:331 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
T_fin:321 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
T_fin:313 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
T_fin:305 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
t__evalForTime [definition, in Complexity.L.AbstractMachines.Computable.EvalForTime]
t__E [definition, in Complexity.HierarchyTheorem.TimeHierarchyTheorem]
t__f:21 [binder, in Undecidability.L.Datatypes.List.List_basics]
T_dup [lemma, in Undecidability.L.Computability.Enum]
T_var_not [lemma, in Undecidability.L.Computability.Enum]
T_longenough [lemma, in Undecidability.L.Computability.Enum]
T_exhaustive [lemma, in Undecidability.L.Computability.Enum]
T_lam [lemma, in Undecidability.L.Computability.Enum]
T_el_ge [lemma, in Undecidability.L.Computability.Enum]
T_app [lemma, in Undecidability.L.Computability.Enum]
T_var [lemma, in Undecidability.L.Computability.Enum]
T_ge [lemma, in Undecidability.L.Computability.Enum]
T_S [lemma, in Undecidability.L.Computability.Enum]
T__X:75 [binder, in Complexity.TM.Code.Decode]
t__R:36 [binder, in Complexity.TM.Code.Decode]
t__L:34 [binder, in Complexity.TM.Code.Decode]
t__R:29 [binder, in Complexity.TM.Code.Decode]
t__L:28 [binder, in Complexity.TM.Code.Decode]
t__R:20 [binder, in Complexity.TM.Code.Decode]
t__g:59 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
t__g:56 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
T__X:14 [binder, in Complexity.TM.Code.DecodeList]
t__R:25 [binder, in Complexity.TM.Single.EncodeTapesInvariants]
t__evalForTimeBool [definition, in Complexity.L.AbstractMachines.Computable.EvalForTimeBool]
T_univ:468 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
T_univ:454 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
T_univ:443 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
T_Univ:384 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
T_Univ:379 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
T_univ:369 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
T_univ:367 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
T_univ:362 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
T_univ:355 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
T_univ:351 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
T_Univ:271 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
T_Univ:262 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
T_Univ:255 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
T_univ:249 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
T_univ:243 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
T_univ:235 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
T_univ:230 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
T_univ:224 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
T_univ:218 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
T_univ:213 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
T_univ:211 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
t__end:56 [binder, in Undecidability.L.Functions.UnboundIteration]
t__step:55 [binder, in Undecidability.L.Functions.UnboundIteration]
t__R2:15 [binder, in Complexity.TM.Compound.MoveToSymbol_niceSpec]
t__R1:14 [binder, in Complexity.TM.Compound.MoveToSymbol_niceSpec]
t__L:12 [binder, in Complexity.TM.Compound.MoveToSymbol_niceSpec]
T__multi:13 [binder, in Complexity.NP.TM.M_multi2mono]
T_nondec_correct [lemma, in Undecidability.L.Functions.EnumInt]
T_nondec [definition, in Undecidability.L.Functions.EnumInt]
T_nondec_helper [definition, in Undecidability.L.Functions.EnumInt]
t__f:18 [binder, in Undecidability.L.Datatypes.List.List_fold]
t__f:7 [binder, in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
t__R2:104 [binder, in Complexity.TM.Single.DecodeTape]
t__R1:103 [binder, in Complexity.TM.Single.DecodeTape]
t__R2:100 [binder, in Complexity.TM.Single.DecodeTape]
t__R1:99 [binder, in Complexity.TM.Single.DecodeTape]
t__R:95 [binder, in Complexity.TM.Single.DecodeTape]
t__L:94 [binder, in Complexity.TM.Single.DecodeTape]
t__L':93 [binder, in Complexity.TM.Single.DecodeTape]
t_a:22 [binder, in Undecidability.L.Tactics.Computable]
t_f:20 [binder, in Undecidability.L.Tactics.Computable]
t__X:22 [binder, in Undecidability.L.Functions.Encoding]
t__X:16 [binder, in Undecidability.L.Functions.Encoding]
t__Y:9 [binder, in Undecidability.L.Functions.Encoding]
t__X:8 [binder, in Undecidability.L.Functions.Encoding]
t__cert:603 [binder, in Complexity.NP.TM.LM_to_mTM]
t__cert:598 [binder, in Complexity.NP.TM.LM_to_mTM]
t__cert:42 [binder, in Complexity.NP.TM.LM_to_mTM]
t__cert:39 [binder, in Complexity.NP.TM.LM_to_mTM]
t__cert:31 [binder, in Complexity.NP.TM.LM_to_mTM]
t__cert:25 [binder, in Complexity.NP.TM.LM_to_mTM]
t__cert:11 [binder, in Complexity.NP.TM.TMGenNP_fixed_mTM]
t__cert':8 [binder, in Complexity.NP.TM.TMGenNP_fixed_mTM]
t'':83 [binder, in Undecidability.TM.Combinators.StateWhile]
t':10 [binder, in Complexity.TM.Single.DecodeTape]
t':10 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler]
T':10 [binder, in Complexity.NP.TM.LM_to_mTM]
t':104 [binder, in Undecidability.L.Tactics.LClos]
t':108 [binder, in Undecidability.L.Complexity.ResourceMeasures]
t':11 [binder, in Complexity.TM.Compound.MoveToSymbol_niceSpec]
t':11 [binder, in Undecidability.TM.Basic.Duo]
t':110 [binder, in Complexity.TM.Single.DecodeTape]
t':112 [binder, in Undecidability.TM.Compound.Shift]
t':113 [binder, in Undecidability.TM.Single.StepTM]
t':115 [binder, in Undecidability.TM.Combinators.StateWhile]
t':117 [binder, in Undecidability.L.Computability.Seval]
t':119 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
t':12 [binder, in Undecidability.L.Tactics.Lrewrite]
t':129 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
t':13 [binder, in Complexity.TM.Single.DecodeTapes]
t':13 [binder, in Undecidability.TM.Compound.Multi]
t':137 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
t':14 [binder, in Complexity.TM.Single.DecodeTape]
t':143 [binder, in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
t':16 [binder, in Undecidability.L.Functions.Eval]
T':16 [binder, in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisStep]
t':16 [binder, in Undecidability.TM.Basic.Duo]
t':171 [binder, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
t':18 [binder, in Undecidability.L.L]
t':19 [binder, in Undecidability.L.Complexity.ResourceMeasures]
T':19 [binder, in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisStep]
t':2 [binder, in Complexity.L.TM.TMflatFun]
t':2 [binder, in Complexity.TM.Code.DecodeBool]
t':20 [binder, in Undecidability.TM.Basic.Mono]
t':20 [binder, in Undecidability.TM.Lifting.LiftTapes]
t':21 [binder, in Complexity.TM.Compound.MoveToSymbol_niceSpec]
t':21 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachine]
t':218 [binder, in Complexity.L.TM.TMunflatten]
T':218 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
t':221 [binder, in Complexity.L.TM.TMunflatten]
t':225 [binder, in Complexity.L.TM.TMunflatten]
t':229 [binder, in Undecidability.L.Util.L_facts]
t':24 [binder, in Undecidability.L.Tactics.Lrewrite]
t':24 [binder, in Undecidability.L.Tactics.Lbeta_nonrefl]
t':24 [binder, in Undecidability.TM.Lifting.LiftTapes]
t':249 [binder, in Complexity.L.TM.TMflatComp]
t':25 [binder, in Undecidability.TM.Basic.Mono]
t':25 [binder, in Complexity.TM.Single.DecodeTapes]
t':27 [binder, in Undecidability.TM.Basic.Mono]
t':28 [binder, in Undecidability.TM.Combinators.Mirror]
t':29 [binder, in Undecidability.TM.Basic.Mono]
t':29 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachine]
T':297 [binder, in Undecidability.TM.Util.TM_facts]
t':3 [binder, in Complexity.TM.Single.DecodeTape]
t':31 [binder, in Complexity.NP.TM.TMGenNP]
t':31 [binder, in Undecidability.TM.TM]
T':313 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
t':33 [binder, in Undecidability.L.Tactics.Lrewrite]
t':35 [binder, in Undecidability.TM.SBTM]
t':36 [binder, in Undecidability.L.Complexity.ResourceMeasures]
t':38 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
T':39 [binder, in Complexity.L.AbstractMachines.AbstractSubstMachine]
T':39 [binder, in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
T':398 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
t':4 [binder, in Undecidability.L.Tactics.Lrewrite]
t':4 [binder, in Undecidability.TM.Compound.Multi]
t':40 [binder, in Undecidability.TM.L.CompilerBoolFuns.NaryApp]
t':40 [binder, in Undecidability.TM.Basic.Mono]
t':40 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
t':40 [binder, in Undecidability.TM.SBTM]
T':403 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
t':41 [binder, in Complexity.NP.TM.TMGenNP]
t':41 [binder, in Undecidability.TM.TM]
t':41 [binder, in Complexity.L.TM.TMflatFun]
t':410 [binder, in Undecidability.TM.Util.TM_facts]
T':427 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
t':44 [binder, in Complexity.TM.Code.Decode]
t':45 [binder, in Undecidability.L.Tactics.GenEncode]
t':45 [binder, in Undecidability.TM.Basic.Mono]
t':45 [binder, in Undecidability.L.Complexity.GenericNary]
T':468 [binder, in Undecidability.TM.Single.StepTM]
T':476 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
T':478 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
t':49 [binder, in Complexity.L.TM.TMflatFun]
t':5 [binder, in Undecidability.TM.Hoare.HoareStdLib]
t':50 [binder, in Undecidability.L.Complexity.ResourceMeasures]
t':50 [binder, in Undecidability.TM.SBTM]
t':50 [binder, in Complexity.TM.Single.DecodeTapes]
T':512 [binder, in Undecidability.TM.Single.StepTM]
t':52 [binder, in Undecidability.TM.Code.ChangeAlphabet]
t':56 [binder, in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
t':56 [binder, in Undecidability.L.AbstractMachines.FlatPro.Programs]
t':58 [binder, in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
t':59 [binder, in Undecidability.L.Tactics.Lrewrite]
t':6 [binder, in Undecidability.TM.Basic.Null]
t':6 [binder, in Complexity.NP.TM.M_multi2mono]
t':6 [binder, in Complexity.L.TM.TMflatFun]
t':60 [binder, in Undecidability.L.AbstractMachines.FlatPro.Programs]
t':63 [binder, in Complexity.TM.Code.Decode]
t':63 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
t':66 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
t':66 [binder, in Complexity.TM.Single.DecodeTape]
t':69 [binder, in Undecidability.L.Tactics.Lrewrite]
t':7 [binder, in Complexity.TM.Code.Decode]
t':7 [binder, in Complexity.TM.Code.DecodeList]
t':7 [binder, in Undecidability.L.Complexity.ResourceMeasures]
t':71 [binder, in Complexity.L.TM.TMflatFun]
t':76 [binder, in Complexity.TM.Single.DecodeTape]
t':78 [binder, in Undecidability.L.Util.L_facts]
t':8 [binder, in Undecidability.TM.Compound.Multi]
t':80 [binder, in Complexity.TM.Single.DecodeTape]
t':81 [binder, in Undecidability.TM.Combinators.StateWhile]
t':86 [binder, in Undecidability.L.Tactics.LClos]
t':87 [binder, in Undecidability.TM.Combinators.StateWhile]
T':91 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
t':93 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
t':93 [binder, in Undecidability.TM.Compound.MoveToSymbol]
t':93 [binder, in Undecidability.L.Complexity.ResourceMeasures]
t':95 [binder, in Undecidability.TM.Compound.MoveToSymbol]
t0:5 [binder, in Complexity.TM.Single.EncodeTapesInvariants]
t0:68 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
t0:98 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
t1':95 [binder, in Undecidability.TM.Compound.CopySymbols]
t1':98 [binder, in Undecidability.TM.Compound.CopySymbols]
T1:1 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.CompoundFinTypes]
t1:10 [binder, in Complexity.TM.Code.DecodeList]
t1:100 [binder, in Undecidability.L.Prelim.ARS]
t1:106 [binder, in Undecidability.L.Tactics.ComputableTime]
t1:108 [binder, in Undecidability.TM.Util.TM_facts]
T1:11 [binder, in Undecidability.TM.Combinators.SequentialComposition]
t1:119 [binder, in Undecidability.L.Tactics.ComputableTime]
t1:120 [binder, in Undecidability.L.Prelim.ARS]
t1:122 [binder, in Undecidability.L.Tactics.Computable]
t1:125 [binder, in Undecidability.L.Tactics.ComputableTime]
t1:129 [binder, in Undecidability.L.Tactics.Computable]
t1:133 [binder, in Undecidability.L.Prelim.ARS]
t1:134 [binder, in Undecidability.L.Tactics.Computable]
t1:14 [binder, in Undecidability.L.Tactics.GenEncode]
T1:14 [binder, in Undecidability.TM.Combinators.If]
T1:14 [binder, in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
t1:147 [binder, in Undecidability.L.Tactics.Computable]
t1:150 [binder, in Undecidability.L.Tactics.ComputableTime]
t1:16 [binder, in Complexity.TM.Single.DecodeTapes]
t1:161 [binder, in Undecidability.L.Tactics.ComputableTime]
t1:17 [binder, in Complexity.NP.TM.TMGenNP_fixed_mTM]
T1:19 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.VectorFin]
t1:199 [binder, in Undecidability.L.Tactics.Extract]
T1:20 [binder, in Undecidability.TM.Combinators.SequentialComposition]
T1:21 [binder, in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
t1:214 [binder, in Undecidability.L.Prelim.ARS]
t1:221 [binder, in Undecidability.L.Tactics.Extract]
t1:222 [binder, in Undecidability.L.Prelim.ARS]
t1:227 [binder, in Undecidability.L.Tactics.Extract]
t1:23 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
T1:25 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.VectorFin]
T1:25 [binder, in Undecidability.TM.Combinators.If]
t1:3 [binder, in Undecidability.L.Computability.Scott]
t1:358 [binder, in Undecidability.TM.Util.TM_facts]
t1:3620 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
t1:37 [binder, in Undecidability.TM.Compound.CopySymbols]
t1:40 [binder, in Undecidability.TM.Compound.CopySymbols]
t1:43 [binder, in Undecidability.TM.Compound.CopySymbols]
t1:44 [binder, in Undecidability.L.Tactics.Computable]
t1:46 [binder, in Undecidability.TM.Compound.CopySymbols]
t1:52 [binder, in Undecidability.L.Tactics.Computable]
T1:55 [binder, in Undecidability.TM.Combinators.Switch]
t1:6 [binder, in Undecidability.TM.Compound.MoveToSymbol]
t1:6 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
t1:60 [binder, in Undecidability.L.Tactics.Computable]
t1:63 [binder, in Undecidability.L.Tactics.ComputableTime]
t1:64 [binder, in Undecidability.TM.Code.ChangeAlphabet]
T1:65 [binder, in Undecidability.TM.Combinators.Switch]
t1:68 [binder, in Undecidability.TM.Code.ChangeAlphabet]
t1:69 [binder, in Undecidability.L.Tactics.Computable]
T1:7 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.CompoundFinTypes]
t1:73 [binder, in Undecidability.L.Tactics.ComputableTime]
t1:74 [binder, in Undecidability.L.Tactics.Computable]
t1:75 [binder, in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
t1:80 [binder, in Undecidability.TM.Util.TM_facts]
t1:83 [binder, in Undecidability.L.Tactics.ComputableTime]
t1:84 [binder, in Undecidability.L.Tactics.Computable]
t1:85 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
t1:88 [binder, in Undecidability.L.Tactics.ComputableTime]
t1:9 [binder, in Undecidability.L.Tactics.Computable]
t1:92 [binder, in Undecidability.L.Tactics.Extract]
t2':96 [binder, in Undecidability.TM.Compound.CopySymbols]
t2':99 [binder, in Undecidability.TM.Compound.CopySymbols]
T2:10 [binder, in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
t2:10 [binder, in Undecidability.L.Tactics.Computable]
t2:101 [binder, in Undecidability.L.Prelim.ARS]
t2:109 [binder, in Undecidability.TM.Util.TM_facts]
T2:12 [binder, in Undecidability.TM.Combinators.SequentialComposition]
t2:121 [binder, in Undecidability.L.Prelim.ARS]
t2:123 [binder, in Undecidability.L.Tactics.Computable]
t2:126 [binder, in Undecidability.L.Tactics.ComputableTime]
t2:134 [binder, in Undecidability.L.Prelim.ARS]
t2:15 [binder, in Undecidability.L.Tactics.GenEncode]
T2:15 [binder, in Undecidability.TM.Combinators.If]
t2:19 [binder, in Undecidability.TM.Code.Copy]
t2:2 [binder, in Undecidability.L.Computability.Scott]
T2:2 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.CompoundFinTypes]
T2:20 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.VectorFin]
t2:201 [binder, in Undecidability.L.Tactics.Extract]
T2:21 [binder, in Undecidability.TM.Combinators.SequentialComposition]
t2:215 [binder, in Undecidability.L.Prelim.ARS]
t2:223 [binder, in Undecidability.L.Prelim.ARS]
t2:225 [binder, in Undecidability.L.Tactics.Extract]
t2:228 [binder, in Undecidability.L.Tactics.Extract]
T2:24 [binder, in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
t2:24 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
t2:246 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
T2:26 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.VectorFin]
T2:26 [binder, in Undecidability.TM.Combinators.If]
t2:26 [binder, in Undecidability.TM.Code.Copy]
t2:359 [binder, in Undecidability.TM.Util.TM_facts]
t2:3621 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
t2:38 [binder, in Undecidability.TM.Compound.CopySymbols]
t2:38 [binder, in Undecidability.TM.Code.Copy]
t2:41 [binder, in Undecidability.TM.Compound.CopySymbols]
t2:44 [binder, in Undecidability.TM.Compound.CopySymbols]
t2:45 [binder, in Undecidability.TM.Code.Copy]
t2:45 [binder, in Undecidability.L.Tactics.Computable]
t2:47 [binder, in Undecidability.TM.Compound.CopySymbols]
t2:53 [binder, in Undecidability.L.Tactics.Computable]
T2:56 [binder, in Undecidability.TM.Combinators.Switch]
t2:64 [binder, in Undecidability.L.Tactics.ComputableTime]
t2:65 [binder, in Undecidability.TM.Code.ChangeAlphabet]
T2:66 [binder, in Undecidability.TM.Combinators.Switch]
t2:69 [binder, in Undecidability.TM.Code.ChangeAlphabet]
t2:7 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
t2:74 [binder, in Undecidability.L.Tactics.ComputableTime]
t2:75 [binder, in Undecidability.L.Tactics.Computable]
t2:76 [binder, in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
T2:8 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.CompoundFinTypes]
t2:81 [binder, in Undecidability.TM.Util.TM_facts]
t2:85 [binder, in Undecidability.L.Tactics.Computable]
t2:86 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
t2:89 [binder, in Undecidability.L.Tactics.ComputableTime]
t2:93 [binder, in Undecidability.L.Tactics.Extract]
T3:16 [binder, in Undecidability.TM.Combinators.If]
T3:27 [binder, in Undecidability.TM.Combinators.If]
t3:3622 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
t:1 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds_Loop]
t:1 [binder, in Undecidability.L.Tactics.ComputableTime]
t:1 [binder, in Complexity.L.AbstractMachines.FlatPro.Computable.LPro]
t:1 [binder, in Undecidability.TM.Code.BinNumbers.PosPointers]
t:1 [binder, in Undecidability.L.AbstractMachines.FlatPro.Programs]
t:1 [binder, in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
t:1 [binder, in Complexity.TM.Code.DecodeBool]
T:1 [binder, in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
t:1 [binder, in Undecidability.TM.L.CaseCom]
t:10 [binder, in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
t:10 [binder, in Undecidability.L.Tactics.Lbeta_nonrefl]
t:10 [binder, in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
T:10 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
t:10 [binder, in Complexity.L.TM.TMflatten]
t:10 [binder, in Complexity.TM.Compound.MoveToSymbol_niceSpec]
t:10 [binder, in Complexity.L.TM.TMflatFun]
t:10 [binder, in Undecidability.TM.Code.Code]
t:10 [binder, in Undecidability.L.Computability.Rice]
t:10 [binder, in Undecidability.TM.Util.TM_facts]
t:10 [binder, in Undecidability.TM.Basic.Duo]
t:10 [binder, in Undecidability.L.Computability.Por]
t:100 [binder, in Undecidability.L.Tactics.ComputableTime]
t:100 [binder, in Undecidability.L.Tactics.LClos]
t:100 [binder, in Undecidability.TM.Compound.MoveToSymbol]
t:100 [binder, in Complexity.L.TM.TMflatComp]
t:100 [binder, in Undecidability.TM.Code.CodeTM]
T:100 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
t:100 [binder, in Undecidability.L.Tactics.Computable]
t:101 [binder, in Undecidability.L.Util.L_facts]
t:101 [binder, in Undecidability.TM.Compound.MoveToSymbol]
t:102 [binder, in Undecidability.TM.Compound.CopySymbols]
t:102 [binder, in Undecidability.L.Complexity.ResourceMeasures]
t:102 [binder, in Undecidability.TM.Util.TM_facts]
T:102 [binder, in Undecidability.TM.Hoare.HoareLogic]
t:103 [binder, in Undecidability.L.Util.L_facts]
t:103 [binder, in Undecidability.L.Computability.Seval]
t:103 [binder, in Undecidability.L.Tactics.LClos]
t:103 [binder, in Undecidability.TM.Compound.MoveToSymbol]
t:103 [binder, in Undecidability.TM.Code.CodeTM]
t:103 [binder, in Undecidability.TM.Univ.LowLevel]
T:103 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
T:103 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
t:1036 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
t:104 [binder, in Undecidability.TM.Compound.MoveToSymbol]
t:104 [binder, in Undecidability.TM.Compound.CopySymbols]
t:105 [binder, in Undecidability.TM.Compound.MoveToSymbol]
t:105 [binder, in Undecidability.L.Tactics.LClos_Eval]
t:105 [binder, in Undecidability.TM.Compound.CopySymbols]
t:105 [binder, in Undecidability.TM.Util.TM_facts]
t:106 [binder, in Undecidability.L.Tactics.Extract]
t:106 [binder, in Undecidability.L.Tactics.LClos]
t:106 [binder, in Undecidability.TM.Univ.LowLevel]
t:106 [binder, in Undecidability.TM.Util.TM_facts]
t:1061 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
t:1066 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
t:107 [binder, in Undecidability.L.Tactics.LClos_Eval]
t:107 [binder, in Undecidability.TM.Compound.CopySymbols]
t:107 [binder, in Undecidability.L.Complexity.ResourceMeasures]
t:107 [binder, in Undecidability.TM.Util.TM_facts]
t:1073 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
t:108 [binder, in Undecidability.L.Prelim.ARS]
t:108 [binder, in Undecidability.TM.Compound.CopySymbols]
t:108 [binder, in Complexity.TM.Single.DecodeTape]
t:109 [binder, in Undecidability.L.Util.L_facts]
t:109 [binder, in Undecidability.L.Tactics.LClos_Eval]
t:109 [binder, in Undecidability.TM.Compound.CopySymbols]
T:109 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
t:11 [binder, in Undecidability.L.Functions.Eval]
t:11 [binder, in Undecidability.L.Tactics.Lrewrite]
t:11 [binder, in Undecidability.TM.Compound.CopySymbols]
t:11 [binder, in Undecidability.TM.Code.CodeTM]
t:11 [binder, in Undecidability.L.Computability.Decidability]
t:11 [binder, in Complexity.L.TM.TMflatten]
t:11 [binder, in Complexity.TM.Single.DecodeTapes]
t:11 [binder, in Undecidability.L.Computability.Rice]
t:11 [binder, in Undecidability.TM.L.CaseCom]
t:11 [binder, in Undecidability.TM.Hoare.HoareStdLib]
t:11 [binder, in Undecidability.L.Computability.Scott]
t:110 [binder, in Undecidability.L.Computability.Seval]
t:110 [binder, in Undecidability.TM.Univ.LowLevel]
t:110 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
t:110 [binder, in Undecidability.TM.Combinators.StateWhile]
T:111 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
t:111 [binder, in Complexity.TM.Single.DecodeTape]
t:111 [binder, in Undecidability.TM.Compound.Shift]
t:1112 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
t:1119 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
t:112 [binder, in Undecidability.L.Util.L_facts]
t:112 [binder, in Undecidability.TM.Single.StepTM]
t:112 [binder, in Undecidability.L.Tactics.ComputableTime]
t:112 [binder, in Complexity.TM.Single.DecodeTape]
t:113 [binder, in Undecidability.L.Tactics.LClos_Eval]
t:113 [binder, in Undecidability.L.Complexity.ResourceMeasures]
t:113 [binder, in Undecidability.TM.Compound.Compare]
T:113 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
t:113 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachine]
t:114 [binder, in Undecidability.L.Prelim.ARS]
t:114 [binder, in Undecidability.L.Util.L_facts]
t:114 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachine]
t:114 [binder, in Undecidability.L.Tactics.Reflection]
t:114 [binder, in Undecidability.TM.Lifting.LiftTapes]
T:115 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
t:115 [binder, in Undecidability.TM.Lifting.LiftTapes]
t:116 [binder, in Undecidability.L.Computability.Seval]
t:116 [binder, in Undecidability.TM.Util.TM_facts]
t:117 [binder, in Undecidability.L.Util.L_facts]
t:117 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
t:118 [binder, in Undecidability.TM.Util.TM_facts]
t:119 [binder, in Undecidability.L.Util.L_facts]
t:119 [binder, in Undecidability.TM.Compound.MoveToSymbol]
t:12 [binder, in Undecidability.TM.PrettyBounds.SizeBounds]
t:12 [binder, in Undecidability.L.Tactics.GenEncode]
t:12 [binder, in Undecidability.TM.Code.BinNumbers.PosPointers]
t:12 [binder, in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
t:12 [binder, in Undecidability.L.Functions.Proc]
t:12 [binder, in Undecidability.TM.Util.TM_facts]
t:12 [binder, in Undecidability.TM.L.CaseCom]
t:12 [binder, in Undecidability.TM.Compound.Multi]
t:12 [binder, in Undecidability.TM.Hoare.HoareStdLib]
t:12 [binder, in Undecidability.L.Computability.Por]
t:12 [binder, in Undecidability.TM.Compound.WriteString]
t:120 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachine]
t:120 [binder, in Undecidability.TM.Util.TM_facts]
t:121 [binder, in Undecidability.L.Computability.Seval]
T:121 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
t:121 [binder, in Undecidability.TM.Util.TM_facts]
t:122 [binder, in Undecidability.L.Util.L_facts]
t:122 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
t:123 [binder, in Undecidability.TM.Compound.CopySymbols]
t:123 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachine]
t:124 [binder, in Undecidability.L.Util.L_facts]
t:124 [binder, in Undecidability.L.Tactics.Extract]
t:124 [binder, in Undecidability.TM.Util.TM_facts]
t:125 [binder, in Undecidability.TM.Compound.MoveToSymbol]
T:125 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
t:126 [binder, in Undecidability.L.Util.L_facts]
t:126 [binder, in Undecidability.L.Tactics.Computable]
t:127 [binder, in Undecidability.TM.Util.TM_facts]
t:128 [binder, in Undecidability.L.Prelim.ARS]
t:129 [binder, in Undecidability.TM.Compound.Compare]
t:13 [binder, in Undecidability.L.Functions.Eval]
t:13 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
t:13 [binder, in Undecidability.TM.Compound.MoveToSymbol]
t:13 [binder, in Undecidability.TM.Hoare.HoareRegister]
t:13 [binder, in Undecidability.TM.TM]
t:13 [binder, in Undecidability.TM.Compound.Compare]
t:13 [binder, in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
t:13 [binder, in Complexity.TM.Single.DecodeTape]
t:13 [binder, in Undecidability.L.Functions.Decoding]
t:130 [binder, in Undecidability.TM.Hoare.HoareRegister]
t:130 [binder, in Undecidability.TM.Util.TM_facts]
t:131 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
t:131 [binder, in Undecidability.L.Tactics.Computable]
t:132 [binder, in Undecidability.L.Tactics.LClos]
t:133 [binder, in Undecidability.L.Util.L_facts]
t:133 [binder, in Undecidability.TM.Util.TM_facts]
t:134 [binder, in Undecidability.TM.Util.TM_facts]
t:135 [binder, in Undecidability.L.Util.L_facts]
t:135 [binder, in Undecidability.L.Tactics.LClos]
t:135 [binder, in Undecidability.TM.Hoare.HoareRegister]
T:135 [binder, in Undecidability.TM.Lifting.LiftTapes]
t:137 [binder, in Undecidability.L.Util.L_facts]
t:137 [binder, in Undecidability.TM.Util.TM_facts]
t:139 [binder, in Undecidability.L.Util.L_facts]
t:139 [binder, in Undecidability.L.Tactics.LClos]
t:14 [binder, in Undecidability.TM.PrettyBounds.SizeBounds]
t:14 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
t:14 [binder, in Undecidability.TM.Compound.MoveToSymbol]
t:14 [binder, in Undecidability.TM.Combinators.Mirror]
t:14 [binder, in Complexity.L.AbstractMachines.UnfoldHeap]
t:14 [binder, in Undecidability.TM.Code.CodeTM]
t:14 [binder, in Undecidability.L.Tactics.Lbeta_nonrefl]
t:14 [binder, in Undecidability.TM.Compound.Compare]
T:14 [binder, in Complexity.L.AbstractMachines.AbstractSubstMachine]
t:14 [binder, in Undecidability.L.Computability.Decidability]
t:14 [binder, in Undecidability.TM.SBTM]
t:14 [binder, in Complexity.NP.TM.M_multi2mono]
t:14 [binder, in Undecidability.TM.Code.ChangeAlphabet]
t:14 [binder, in Undecidability.TM.L.Eval]
t:14 [binder, in Undecidability.L.Functions.Proc]
t:140 [binder, in Undecidability.TM.Util.TM_facts]
t:141 [binder, in Undecidability.L.Util.L_facts]
t:141 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
t:141 [binder, in Undecidability.TM.Util.TM_facts]
t:142 [binder, in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
t:142 [binder, in Undecidability.TM.Compound.Compare]
t:144 [binder, in Undecidability.TM.Util.TM_facts]
t:146 [binder, in Undecidability.L.Tactics.Extract]
t:146 [binder, in Undecidability.TM.Compound.MoveToSymbol]
t:147 [binder, in Undecidability.L.Util.L_facts]
T:147 [binder, in Undecidability.TM.Single.StepTM]
t:147 [binder, in Undecidability.TM.Util.TM_facts]
T:148 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
t:149 [binder, in Undecidability.TM.Util.TM_facts]
t:15 [binder, in Undecidability.L.Functions.Eval]
t:15 [binder, in Undecidability.L.Computability.Seval]
t:15 [binder, in Undecidability.L.Tactics.LClos]
t:15 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
t:15 [binder, in Undecidability.TM.Combinators.Mirror]
t:15 [binder, in Undecidability.TM.Code.WriteValue]
t:15 [binder, in Undecidability.L.Tactics.Lbeta]
t:15 [binder, in Undecidability.TM.Util.TM_facts]
t:15 [binder, in Undecidability.TM.L.CaseCom]
t:15 [binder, in Undecidability.L.Functions.Decoding]
t:15 [binder, in Undecidability.TM.Basic.Duo]
t:15 [binder, in Complexity.NP.L.GenNP]
t:15 [binder, in Undecidability.L.Computability.Por]
t:15 [binder, in Undecidability.L.Computability.Scott]
t:150 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
T:150 [binder, in Undecidability.TM.Single.StepTM]
t:150 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
t:150 [binder, in Undecidability.TM.Compound.Compare]
t:151 [binder, in Undecidability.TM.Univ.LowLevel]
t:151 [binder, in Undecidability.TM.Util.TM_facts]
t:153 [binder, in Undecidability.L.Util.L_facts]
t:153 [binder, in Undecidability.TM.Univ.LowLevel]
t:154 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
T:154 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
t:154 [binder, in Undecidability.TM.Util.TM_facts]
t:155 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
t:156 [binder, in Undecidability.L.Util.L_facts]
t:156 [binder, in Undecidability.TM.Single.StepTM]
t:156 [binder, in Undecidability.L.Tactics.Extract]
t:156 [binder, in Undecidability.TM.Univ.LowLevel]
T:157 [binder, in Undecidability.TM.Single.StepTM]
t:158 [binder, in Undecidability.TM.Util.TM_facts]
t:159 [binder, in Undecidability.TM.Single.StepTM]
t:16 [binder, in Undecidability.L.Tactics.Lrewrite]
t:16 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
T:16 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
t:16 [binder, in Undecidability.TM.Compound.MoveToSymbol]
t:16 [binder, in Complexity.TM.Code.DecodeList]
t:16 [binder, in Undecidability.L.Tactics.LClos_Eval]
t:16 [binder, in Undecidability.L.Complexity.ResourceMeasures]
t:16 [binder, in Undecidability.TM.Compound.Compare]
t:16 [binder, in Undecidability.L.Computability.Rice]
t:16 [binder, in Undecidability.TM.Compound.Shift]
t:16 [binder, in Undecidability.TM.Compound.WriteString]
t:160 [binder, in Undecidability.L.Util.L_facts]
t:161 [binder, in Undecidability.TM.Single.StepTM]
t:161 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
t:161 [binder, in Undecidability.TM.Util.TM_facts]
t:163 [binder, in Undecidability.L.Util.L_facts]
t:163 [binder, in Undecidability.TM.Compound.MoveToSymbol]
T:164 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
t:165 [binder, in Undecidability.TM.Single.StepTM]
T:166 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
t:167 [binder, in Undecidability.L.Util.L_facts]
t:167 [binder, in Undecidability.TM.Single.StepTM]
t:169 [binder, in Undecidability.TM.Util.TM_facts]
T:17 [binder, in Undecidability.TM.Lifting.LiftAlphabet]
t:17 [binder, in Undecidability.TM.Compound.MoveToSymbol]
t:17 [binder, in Undecidability.TM.Combinators.Mirror]
t:17 [binder, in Undecidability.TM.Code.BinNumbers.PosPointers]
t:17 [binder, in Undecidability.L.L]
t:17 [binder, in Undecidability.TM.Compound.Compare]
t:17 [binder, in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
T:17 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.CompoundFinTypes]
t:170 [binder, in Undecidability.L.Prelim.ARS]
t:170 [binder, in Undecidability.TM.Single.StepTM]
t:170 [binder, in Undecidability.TM.Util.TM_facts]
t:171 [binder, in Undecidability.TM.Util.TM_facts]
t:172 [binder, in Undecidability.TM.Util.TM_facts]
t:173 [binder, in Undecidability.TM.Util.TM_facts]
t:174 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
t:174 [binder, in Undecidability.TM.Util.TM_facts]
t:175 [binder, in Undecidability.TM.Util.TM_facts]
t:176 [binder, in Undecidability.L.Util.L_facts]
t:176 [binder, in Undecidability.TM.Single.StepTM]
t:177 [binder, in Undecidability.L.Prelim.ARS]
t:177 [binder, in Undecidability.TM.Compound.MoveToSymbol]
t:177 [binder, in Undecidability.TM.Code.Code]
t:178 [binder, in Undecidability.L.Tactics.ComputableTime]
t:179 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
T:18 [binder, in Undecidability.TM.Combinators.Combinators]
t:18 [binder, in Undecidability.L.Functions.Eval]
t:18 [binder, in Undecidability.L.Computability.Seval]
t:18 [binder, in Undecidability.L.Complexity.ResourceMeasures]
t:18 [binder, in Undecidability.L.TM.TapeFuns]
T:18 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_upto]
t:18 [binder, in Undecidability.TM.L.Eval]
t:18 [binder, in Undecidability.L.Computability.Rice]
T:18 [binder, in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
t:18 [binder, in Undecidability.TM.Util.TM_facts]
t:18 [binder, in Undecidability.TM.Compound.Shift]
t:180 [binder, in Undecidability.L.Util.L_facts]
t:180 [binder, in Undecidability.TM.Compound.Compare]
t:180 [binder, in Undecidability.TM.Util.TM_facts]
t:181 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
t:183 [binder, in Undecidability.L.Prelim.ARS]
t:183 [binder, in Undecidability.TM.Compound.MoveToSymbol]
t:184 [binder, in Undecidability.L.Util.L_facts]
t:184 [binder, in Undecidability.TM.Single.StepTM]
T:184 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
t:185 [binder, in Undecidability.TM.Util.TM_facts]
t:189 [binder, in Undecidability.L.Util.L_facts]
t:19 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
t:19 [binder, in Undecidability.TM.Compound.MoveToSymbol]
t:19 [binder, in Undecidability.TM.Basic.Mono]
t:19 [binder, in Undecidability.TM.Code.CodeTM]
t:19 [binder, in Undecidability.TM.Compound.Compare]
t:19 [binder, in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
t:19 [binder, in Undecidability.TM.SBTM]
t:19 [binder, in Undecidability.TM.Lifting.LiftTapes]
t:19 [binder, in Undecidability.L.Computability.Rice]
t:19 [binder, in Complexity.NP.L.GenNP]
t:190 [binder, in Undecidability.TM.Single.StepTM]
t:190 [binder, in Undecidability.TM.Hoare.HoareRegister]
t:191 [binder, in Undecidability.L.Tactics.Extract]
t:191 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
T:191 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
t:192 [binder, in Undecidability.L.Tactics.Extract]
t:193 [binder, in Undecidability.TM.Code.Copy]
t:194 [binder, in Undecidability.L.Util.L_facts]
t:194 [binder, in Undecidability.L.Tactics.Extract]
t:195 [binder, in Undecidability.TM.Single.StepTM]
t:196 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
t:197 [binder, in Undecidability.TM.Util.TM_facts]
t:198 [binder, in Undecidability.L.Tactics.Extract]
t:198 [binder, in Undecidability.TM.Hoare.HoareRegister]
t:198 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
t:2 [binder, in Undecidability.L.Util.L_facts]
t:2 [binder, in Undecidability.L.Tactics.Lsimpl]
t:2 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds_Loop]
t:2 [binder, in Undecidability.L.Computability.Seval]
t:2 [binder, in Complexity.L.AbstractMachines.FlatPro.Computable.LPro]
t:2 [binder, in Undecidability.L.Tactics.LClos_Eval]
t:2 [binder, in Undecidability.L.Datatypes.List.List_extra]
t:2 [binder, in Undecidability.TM.Code.CodeTM]
t:2 [binder, in Undecidability.L.Computability.Fixpoints]
t:2 [binder, in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
t:2 [binder, in Undecidability.L.Tactics.Lbeta]
t:2 [binder, in Undecidability.L.Computability.Acceptability]
t:2 [binder, in Undecidability.L.Functions.Proc]
T:2 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
t:2 [binder, in Undecidability.L.Computability.Synthetic]
T:2 [binder, in Complexity.L.AbstractMachines.Computable.HeapMachine]
t:2 [binder, in Complexity.TM.Single.DecodeTape]
t:2 [binder, in Undecidability.L.Computability.Computability]
t:2 [binder, in Undecidability.L.Functions.Equality]
t:2 [binder, in Undecidability.L.Computability.Por]
t:20 [binder, in Undecidability.L.Tactics.Lrewrite]
t:20 [binder, in Undecidability.TM.Lifting.LiftAlphabet]
T:20 [binder, in Undecidability.TM.Hoare.HoareLegacy]
t:20 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
t:20 [binder, in Undecidability.TM.Compound.MoveToSymbol]
t:20 [binder, in Undecidability.L.TM.TapeFuns]
T:20 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_upto]
t:20 [binder, in Undecidability.L.Tactics.Lbeta_nonrefl]
t:20 [binder, in Undecidability.TM.Compound.Compare]
t:20 [binder, in Complexity.TM.Compound.MoveToSymbol_niceSpec]
t:20 [binder, in Undecidability.L.Tactics.Reflection]
t:20 [binder, in Undecidability.L.Computability.Rice]
t:20 [binder, in Undecidability.TM.L.CaseCom]
t:20 [binder, in Undecidability.TM.Hoare.HoareCombinators]
t:200 [binder, in Undecidability.L.Util.L_facts]
t:200 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
T:200 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
T:203 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
t:203 [binder, in Undecidability.TM.Util.TM_facts]
t:205 [binder, in Undecidability.TM.Hoare.HoareRegister]
t:206 [binder, in Complexity.L.TM.TMunflatten]
t:206 [binder, in Undecidability.TM.Util.TM_facts]
T:209 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
T:209 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
t:21 [binder, in Undecidability.L.Computability.Seval]
t:21 [binder, in Undecidability.TM.Compound.MoveToSymbol]
t:21 [binder, in Undecidability.L.L]
t:21 [binder, in Undecidability.TM.Hoare.HoareRegister]
t:21 [binder, in Undecidability.TM.Compound.Compare]
t:21 [binder, in Complexity.L.AbstractMachines.AbstractSubstMachine]
T:21 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
t:21 [binder, in Undecidability.L.Computability.Rice]
T:21 [binder, in Complexity.L.AbstractMachines.Computable.HeapMachine]
t:21 [binder, in Undecidability.TM.Compound.Shift]
t:210 [binder, in Undecidability.L.Util.L_facts]
t:210 [binder, in Complexity.L.TM.TMunflatten]
t:211 [binder, in Undecidability.TM.Util.TM_facts]
t:212 [binder, in Undecidability.L.Util.L_facts]
t:212 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
t:213 [binder, in Undecidability.TM.Hoare.HoareRegister]
t:214 [binder, in Complexity.L.TM.TMunflatten]
T:215 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
t:216 [binder, in Undecidability.TM.Util.TM_facts]
t:217 [binder, in Undecidability.L.Util.L_facts]
t:217 [binder, in Undecidability.L.Tactics.Extract]
T:217 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
t:217 [binder, in Complexity.L.TM.TMunflatten]
t:218 [binder, in Undecidability.L.Tactics.Extract]
t:22 [binder, in Undecidability.L.Tactics.LClos_Eval]
t:22 [binder, in Undecidability.L.Complexity.ResourceMeasures]
t:22 [binder, in Undecidability.TM.Code.BinNumbers.PosPointers]
T:22 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_upto]
T:22 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
t:220 [binder, in Undecidability.L.Tactics.Extract]
t:220 [binder, in Complexity.L.TM.TMunflatten]
T:220 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
t:221 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
t:222 [binder, in Undecidability.L.Util.L_facts]
T:222 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
t:224 [binder, in Complexity.L.TM.TMunflatten]
T:226 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
t:226 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
t:227 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
t:227 [binder, in Complexity.L.TM.TMunflatten]
t:228 [binder, in Undecidability.L.Util.L_facts]
t:229 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
t:229 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
t:23 [binder, in Undecidability.TM.L.CompilerBoolFuns.NaryApp]
t:23 [binder, in Undecidability.L.Tactics.Lrewrite]
t:23 [binder, in Undecidability.L.Computability.Enum]
t:23 [binder, in Undecidability.TM.Code.WriteValue]
t:23 [binder, in Undecidability.L.Tactics.Lbeta_nonrefl]
t:23 [binder, in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
t:23 [binder, in Undecidability.TM.Lifting.LiftTapes]
t:23 [binder, in Complexity.TM.Single.DecodeTape]
t:23 [binder, in Undecidability.TM.Compound.Shift]
t:230 [binder, in Complexity.L.TM.TMunflatten]
T:232 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
t:232 [binder, in Undecidability.TM.Util.TM_facts]
t:233 [binder, in Undecidability.L.Tactics.Extract]
t:234 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
t:236 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
t:236 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
T:236 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
t:237 [binder, in Undecidability.TM.Single.StepTM]
T:237 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
T:238 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
t:238 [binder, in Undecidability.L.Tactics.Extract]
t:239 [binder, in Undecidability.L.Prelim.ARS]
t:239 [binder, in Undecidability.L.Util.L_facts]
t:24 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
t:24 [binder, in Undecidability.L.Computability.Seval]
t:24 [binder, in Undecidability.TM.Basic.Mono]
t:24 [binder, in Complexity.TM.Single.EncodeTapesInvariants]
t:24 [binder, in Undecidability.TM.Code.CodeTM]
T:24 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_upto]
T:24 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
t:24 [binder, in Complexity.TM.Single.DecodeTapes]
t:24 [binder, in Undecidability.L.Tactics.Reflection]
t:24 [binder, in Undecidability.L.Complexity.GenericNary]
t:24 [binder, in Undecidability.L.Tactics.Computable]
t:240 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
T:240 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
t:240 [binder, in Undecidability.TM.Util.TM_facts]
t:242 [binder, in Undecidability.L.Util.L_facts]
t:242 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
T:242 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
t:242 [binder, in Undecidability.TM.Hoare.HoareRegister]
t:242 [binder, in Undecidability.TM.Util.TM_facts]
t:244 [binder, in Undecidability.L.Tactics.Extract]
t:244 [binder, in Undecidability.TM.Util.TM_facts]
t:245 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
t:245 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
t:245 [binder, in Undecidability.TM.Hoare.HoareRegister]
T:245 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
t:246 [binder, in Complexity.L.TM.TMflatComp]
t:246 [binder, in Undecidability.TM.Util.TM_facts]
T:247 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
t:247 [binder, in Undecidability.TM.Util.TM_facts]
t:248 [binder, in Complexity.L.TM.TMflatComp]
T:25 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
t:25 [binder, in Complexity.L.AbstractMachines.UnfoldHeap]
t:25 [binder, in Undecidability.TM.Code.BinNumbers.PosPointers]
t:25 [binder, in Undecidability.TM.TM]
t:25 [binder, in Complexity.TM.Compound.MoveToSymbol_niceSpec]
t:251 [binder, in Complexity.L.TM.TMflatComp]
T:251 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
T:253 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
T:256 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
t:257 [binder, in Complexity.L.TM.TMflatComp]
T:257 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
t:259 [binder, in Complexity.L.TM.TMflatComp]
T:26 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds_Loop]
t:26 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
t:26 [binder, in Undecidability.L.Computability.Enum]
t:26 [binder, in Undecidability.TM.Basic.Mono]
t:26 [binder, in Undecidability.L.Complexity.ResourceMeasures]
T:26 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_upto]
t:26 [binder, in Undecidability.L.AbstractMachines.FlatPro.Programs]
t:26 [binder, in Undecidability.L.Computability.Rice]
t:26 [binder, in Undecidability.TM.Util.TM_facts]
t:26 [binder, in Undecidability.L.Functions.Decoding]
t:26 [binder, in Undecidability.TM.Compound.Shift]
t:26 [binder, in Undecidability.TM.Single.EncodeTapes]
t:261 [binder, in Complexity.L.TM.TMflatComp]
t:263 [binder, in Complexity.L.TM.TMflatComp]
T:263 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
T:265 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
T:268 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
t:27 [binder, in Undecidability.L.Tactics.Lrewrite]
t:27 [binder, in Undecidability.L.Tactics.Extract]
t:27 [binder, in Undecidability.TM.Combinators.Mirror]
t:27 [binder, in Complexity.NP.TM.TMGenNP]
t:27 [binder, in Undecidability.TM.Code.CodeTM]
t:27 [binder, in Undecidability.TM.Hoare.HoareRegister]
t:27 [binder, in Undecidability.TM.Lifting.LiftTapes]
T:270 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
t:273 [binder, in Complexity.L.TM.TMflatComp]
T:273 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
t:275 [binder, in Undecidability.L.Tactics.Reflection]
t:276 [binder, in Complexity.L.TM.TMflatComp]
T:277 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
t:277 [binder, in Undecidability.L.Tactics.Reflection]
t:278 [binder, in Undecidability.TM.Util.TM_facts]
t:279 [binder, in Complexity.L.TM.TMflatComp]
t:279 [binder, in Undecidability.L.Tactics.Reflection]
t:28 [binder, in Undecidability.TM.Basic.Mono]
t:28 [binder, in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
t:28 [binder, in Undecidability.TM.SBTM]
t:28 [binder, in Undecidability.TM.Code.Copy]
t:28 [binder, in Undecidability.L.Complexity.GenericNary]
t:28 [binder, in Complexity.TM.Single.DecodeTape]
t:28 [binder, in Undecidability.L.Functions.Decoding]
t:28 [binder, in Undecidability.TM.Compound.Shift]
T:280 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
t:281 [binder, in Complexity.L.TM.TMflatComp]
t:281 [binder, in Undecidability.L.Tactics.Reflection]
T:282 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
t:284 [binder, in Complexity.L.TM.TMflatComp]
T:287 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
T:288 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
t:288 [binder, in Complexity.L.TM.TMflatComp]
T:29 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
t:29 [binder, in Undecidability.L.Util.L_facts]
t:29 [binder, in Undecidability.L.Tactics.GenEncode]
t:29 [binder, in Undecidability.TM.Code.CodeTM]
t:29 [binder, in Complexity.L.AbstractMachines.AbstractSubstMachine]
t:29 [binder, in Undecidability.L.AbstractMachines.FlatPro.Programs]
T:29 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
t:29 [binder, in Complexity.TM.Single.DecodeTapes]
t:29 [binder, in Undecidability.L.Tactics.Reflection]
T:290 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
T:290 [binder, in Undecidability.TM.Util.TM_facts]
T:291 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
T:292 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
T:293 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
T:296 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
T:296 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
T:296 [binder, in Undecidability.TM.Util.TM_facts]
T:299 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
t:3 [binder, in Undecidability.L.Tactics.Lrewrite]
t:3 [binder, in Undecidability.L.Datatypes.LBool]
T:3 [binder, in Complexity.L.AbstractMachines.Computable.UnivDecTime]
t:3 [binder, in Undecidability.L.Functions.Subst]
t:3 [binder, in Undecidability.L.TM.TapeFuns]
t:3 [binder, in Undecidability.TM.Util.TM_facts]
t:3 [binder, in Undecidability.TM.Compound.Multi]
t:30 [binder, in Undecidability.TM.Code.BinNumbers.PosPointers]
t:30 [binder, in Undecidability.L.Tactics.Lbeta_nonrefl]
t:30 [binder, in Undecidability.TM.SBTM]
t:30 [binder, in Undecidability.L.Computability.Rice]
t:30 [binder, in Undecidability.TM.Compound.Shift]
T:300 [binder, in Undecidability.TM.Util.TM_facts]
T:302 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
T:304 [binder, in Undecidability.TM.Single.StepTM]
T:304 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
T:306 [binder, in Undecidability.TM.Single.StepTM]
T:31 [binder, in Undecidability.TM.Combinators.Combinators]
t:31 [binder, in Undecidability.L.Tactics.Lrewrite]
T:31 [binder, in Undecidability.L.Datatypes.LOptions]
t:31 [binder, in Undecidability.TM.Lifting.LiftAlphabet]
t:31 [binder, in Undecidability.L.Complexity.ResourceMeasures]
t:31 [binder, in Undecidability.L.Complexity.GenericNary]
t:31 [binder, in Undecidability.TM.Single.EncodeTapes]
T:310 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
T:310 [binder, in Undecidability.TM.Single.StepTM]
T:310 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
t:3106 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
T:318 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
T:32 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds_Loop]
t:32 [binder, in Undecidability.L.Tactics.Extract]
t:32 [binder, in Undecidability.TM.Combinators.Switch]
t:32 [binder, in Undecidability.TM.Lifting.LiftAlphabet]
t:32 [binder, in Undecidability.L.Tactics.GenEncode]
t:32 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
T:32 [binder, in Undecidability.TM.Combinators.Mirror]
t:32 [binder, in Undecidability.TM.Code.CodeTM]
T:32 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
t:32 [binder, in Undecidability.TM.Hoare.HoareRegister]
t:32 [binder, in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
t:32 [binder, in Undecidability.L.Computability.Rice]
T:32 [binder, in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
t:32 [binder, in Undecidability.TM.Util.TM_facts]
t:32 [binder, in Complexity.TM.Single.DecodeTape]
T:3219 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
t:322 [binder, in Undecidability.TM.Single.StepTM]
T:324 [binder, in Undecidability.TM.Single.StepTM]
T:328 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
t:33 [binder, in Undecidability.L.Util.L_facts]
t:33 [binder, in Undecidability.L.Computability.Seval]
t:33 [binder, in Undecidability.TM.Combinators.Switch]
t:33 [binder, in Undecidability.L.Tactics.LClos]
t:33 [binder, in Undecidability.TM.Combinators.Mirror]
t:33 [binder, in Undecidability.TM.Code.BinNumbers.PosPointers]
t:33 [binder, in Undecidability.L.Tactics.Lbeta_nonrefl]
T:33 [binder, in Complexity.L.AbstractMachines.AbstractSubstMachine]
t:33 [binder, in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
T:336 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
T:339 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
T:34 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
T:34 [binder, in Undecidability.L.Datatypes.LOptions]
t:34 [binder, in Undecidability.L.Tactics.Extract]
t:34 [binder, in Undecidability.L.Tactics.ComputableTime]
T:34 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_upto]
T:34 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
t:34 [binder, in Undecidability.TM.Util.TM_facts]
t:34 [binder, in Complexity.TM.Single.DecodeTape]
t:34 [binder, in Undecidability.TM.Single.EncodeTapes]
t:340 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
T:341 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
T:342 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
T:344 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
T:344 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
T:349 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
t:35 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
t:35 [binder, in Undecidability.TM.Compound.MoveToSymbol]
T:35 [binder, in Undecidability.TM.Combinators.Mirror]
t:35 [binder, in Complexity.TM.Single.EncodeTapesInvariants]
t:35 [binder, in Undecidability.L.Complexity.ResourceMeasures]
t:35 [binder, in Undecidability.TM.Code.BinNumbers.PosPointers]
t:35 [binder, in Undecidability.TM.Code.CodeTM]
t:350 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
T:353 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
t:354 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
T:357 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
t:359 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
t:36 [binder, in Undecidability.L.Util.L_facts]
t:36 [binder, in Undecidability.L.Computability.Seval]
t:36 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
t:36 [binder, in Undecidability.TM.Compound.MoveToSymbol]
T:36 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
t:36 [binder, in Undecidability.TM.Hoare.HoareRegister]
t:36 [binder, in Undecidability.L.Tactics.Lbeta_nonrefl]
t:36 [binder, in Undecidability.TM.SBTM]
t:36 [binder, in Undecidability.TM.Code.ChangeAlphabet]
t:36 [binder, in Undecidability.TM.Compound.WriteString]
T:361 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
t:363 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
T:365 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
t:366 [binder, in Undecidability.TM.Util.TM_facts]
t:368 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
t:37 [binder, in Undecidability.TM.Compound.MoveToSymbol]
t:37 [binder, in Complexity.NP.TM.TMGenNP]
t:37 [binder, in Undecidability.TM.Code.BinNumbers.PosPointers]
t:37 [binder, in Undecidability.TM.Code.CodeTM]
T:37 [binder, in Complexity.L.AbstractMachines.AbstractSubstMachine]
t:37 [binder, in Undecidability.L.Computability.Rice]
t:37 [binder, in Undecidability.TM.Util.TM_facts]
t:37 [binder, in Complexity.TM.Single.DecodeTape]
T:371 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
t:373 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
T:375 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
T:377 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
T:378 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
t:38 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
t:38 [binder, in Undecidability.L.TM.TMEncoding]
T:380 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
T:385 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
T:388 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
T:39 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
t:39 [binder, in Undecidability.TM.L.CompilerBoolFuns.NaryApp]
t:39 [binder, in Undecidability.L.Tactics.ComputableTime]
t:39 [binder, in Undecidability.L.Computability.Seval]
t:39 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
t:39 [binder, in Undecidability.TM.Compound.MoveToSymbol]
t:39 [binder, in Undecidability.TM.Basic.Mono]
t:39 [binder, in Complexity.TM.Single.EncodeTapesInvariants]
t:39 [binder, in Undecidability.L.Complexity.ResourceMeasures]
T:39 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_upto]
t:39 [binder, in Undecidability.TM.TM]
T:39 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
t:39 [binder, in Undecidability.TM.Code.ChangeAlphabet]
t:39 [binder, in Undecidability.TM.Util.TM_facts]
t:39 [binder, in Complexity.L.AbstractMachines.FunctionalDefinitions]
t:39 [binder, in Undecidability.TM.Compound.WriteString]
T:390 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
T:393 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
T:396 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
t:4 [binder, in Undecidability.L.Tactics.Lsimpl]
t:4 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds_Loop]
t:4 [binder, in Undecidability.L.TM.TapeFuns]
t:4 [binder, in Undecidability.L.Computability.Fixpoints]
t:4 [binder, in Undecidability.TM.TM]
t:4 [binder, in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
T:4 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
t:4 [binder, in Undecidability.TM.Hoare.HoareStdLib]
T:40 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
t:40 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
t:40 [binder, in Complexity.TM.Code.Decode]
t:40 [binder, in Undecidability.TM.Code.BinNumbers.PosPointers]
t:40 [binder, in Complexity.L.TM.TMflatFun]
t:40 [binder, in Complexity.TM.Single.DecodeTapes]
t:40 [binder, in Undecidability.TM.Util.TM_facts]
t:40 [binder, in Complexity.TM.Single.DecodeTape]
T:401 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
T:406 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
t:408 [binder, in Undecidability.TM.Util.TM_facts]
t:41 [binder, in Undecidability.TM.Compound.MoveToSymbol]
t:41 [binder, in Undecidability.TM.Hoare.HoareRegister]
t:41 [binder, in Undecidability.TM.Code.ChangeAlphabet]
t:41 [binder, in Undecidability.TM.Util.TM_facts]
t:41 [binder, in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
t:41 [binder, in Undecidability.L.Tactics.Computable]
T:410 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
T:418 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
t:42 [binder, in Undecidability.L.Computability.Seval]
t:42 [binder, in Undecidability.TM.Compound.CopySymbols]
t:42 [binder, in Undecidability.L.Complexity.ResourceMeasures]
t:42 [binder, in Undecidability.TM.Combinators.If]
t:42 [binder, in Complexity.L.AbstractMachines.AbstractSubstMachine]
T:42 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
t:42 [binder, in Undecidability.L.TM.TMEncoding]
t:42 [binder, in Complexity.TM.Single.DecodeTape]
t:42 [binder, in Undecidability.TM.Hoare.HoareCombinators]
t:42 [binder, in Undecidability.TM.Compound.WriteString]
T:420 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
T:425 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
t:43 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
t:43 [binder, in Complexity.TM.Code.Decode]
t:43 [binder, in Undecidability.TM.Compound.MoveToSymbol]
t:43 [binder, in Complexity.NP.TM.TMGenNP]
t:43 [binder, in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
t:43 [binder, in Undecidability.TM.Util.TM_facts]
T:432 [binder, in Undecidability.TM.Hoare.HoareRegister]
T:434 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
t:434 [binder, in Undecidability.TM.Hoare.HoareRegister]
T:436 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
T:436 [binder, in Undecidability.TM.Hoare.HoareRegister]
t:437 [binder, in Undecidability.TM.Hoare.HoareRegister]
T:438 [binder, in Undecidability.TM.Hoare.HoareRegister]
t:439 [binder, in Undecidability.TM.Hoare.HoareRegister]
t:44 [binder, in Undecidability.L.Computability.Seval]
t:44 [binder, in Undecidability.TM.Combinators.Switch]
t:44 [binder, in Undecidability.TM.Basic.Mono]
t:44 [binder, in Undecidability.TM.Univ.LowLevel]
t:44 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
t:44 [binder, in Undecidability.TM.Code.ChangeAlphabet]
T:440 [binder, in Undecidability.TM.Hoare.HoareRegister]
T:442 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
T:45 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
t:45 [binder, in Undecidability.L.Util.L_facts]
t:45 [binder, in Undecidability.TM.Compound.CopySymbols]
t:45 [binder, in Undecidability.L.Datatypes.LVector]
t:45 [binder, in Undecidability.TM.TM]
T:45 [binder, in Complexity.L.AbstractMachines.AbstractSubstMachine]
t:45 [binder, in Undecidability.TM.SBTM]
t:45 [binder, in Undecidability.TM.Util.TM_facts]
t:45 [binder, in Undecidability.TM.Compound.WriteString]
T:456 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
t:46 [binder, in Undecidability.TM.L.CompilerBoolFuns.NaryApp]
T:46 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
t:46 [binder, in Undecidability.L.Computability.Enum]
t:46 [binder, in Undecidability.TM.Code.CodeTM]
t:46 [binder, in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
t:46 [binder, in Undecidability.TM.Hoare.HoareRegister]
t:46 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachine]
t:46 [binder, in Undecidability.TM.Code.ChangeAlphabet]
T:461 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
T:465 [binder, in Undecidability.TM.Single.StepTM]
T:466 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
t:47 [binder, in Undecidability.TM.Hoare.HoareTactics]
t:47 [binder, in Undecidability.L.Tactics.ComputableTime]
t:47 [binder, in Undecidability.TM.Compound.MoveToSymbol]
t:47 [binder, in Undecidability.TM.Code.BinNumbers.PosPointers]
t:47 [binder, in Complexity.Complexity.SpaceBoundsTime]
T:47 [binder, in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
T:470 [binder, in Undecidability.TM.Single.StepTM]
T:470 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
T:471 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
t:471 [binder, in Undecidability.TM.Hoare.HoareRegister]
T:475 [binder, in Undecidability.TM.Single.StepTM]
t:475 [binder, in Undecidability.TM.Hoare.HoareRegister]
T:477 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
t:48 [binder, in Undecidability.L.Tactics.Lrewrite]
t:48 [binder, in Undecidability.TM.Hoare.HoareTactics]
t:48 [binder, in Undecidability.TM.Compound.CopySymbols]
t:48 [binder, in Complexity.NP.TM.TMGenNP]
t:48 [binder, in Complexity.L.TM.TMflatFun]
t:48 [binder, in Undecidability.TM.Code.Copy]
t:48 [binder, in Complexity.TM.Single.DecodeTapes]
t:48 [binder, in Undecidability.TM.Util.TM_facts]
T:481 [binder, in Undecidability.TM.Single.StepTM]
T:487 [binder, in Undecidability.TM.Single.StepTM]
t:49 [binder, in Undecidability.TM.Compound.MoveToSymbol]
t:49 [binder, in Undecidability.L.Complexity.ResourceMeasures]
t:49 [binder, in Undecidability.TM.Code.CodeTM]
t:49 [binder, in Undecidability.L.Tactics.Reflection]
T:494 [binder, in Undecidability.TM.Single.StepTM]
t:5 [binder, in Undecidability.TM.Basic.Null]
t:5 [binder, in Undecidability.L.Tactics.ComputableTime]
t:5 [binder, in Undecidability.TM.Lifting.LiftAlphabet]
T:5 [binder, in Undecidability.TM.PrettyBounds.SizeBounds]
t:5 [binder, in Undecidability.L.Tactics.LClos]
t:5 [binder, in Undecidability.L.Computability.Fixpoints]
t:5 [binder, in Undecidability.L.L]
t:5 [binder, in Undecidability.TM.L.Alphabets]
t:5 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TM_single]
t:5 [binder, in Complexity.NP.TM.M_multi2mono]
t:5 [binder, in Complexity.L.TM.TMflatFun]
t:5 [binder, in Undecidability.L.Computability.Acceptability]
t:5 [binder, in Undecidability.L.Tactics.Reflection]
t:5 [binder, in Undecidability.TM.Util.TM_facts]
t:5 [binder, in Undecidability.L.Computability.Scott]
t:50 [binder, in Complexity.L.AbstractMachines.UnfoldTailRec]
t:50 [binder, in Undecidability.TM.Compound.MoveToSymbol]
t:50 [binder, in Undecidability.TM.Compound.CopySymbols]
t:50 [binder, in Undecidability.L.Datatypes.LVector]
t:50 [binder, in Complexity.L.AbstractMachines.AbstractSubstMachine]
t:50 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
t:50 [binder, in Complexity.NP.TM.M_multi2mono]
t:50 [binder, in Complexity.NP.Clique.kSAT_to_Clique]
t:50 [binder, in Undecidability.TM.Compound.Shift]
T:502 [binder, in Undecidability.TM.Single.StepTM]
t:51 [binder, in Undecidability.L.Computability.Enum]
t:51 [binder, in Undecidability.L.Computability.Seval]
t:51 [binder, in Undecidability.TM.Compound.CopySymbols]
t:51 [binder, in Undecidability.TM.Univ.LowLevel]
t:51 [binder, in Undecidability.TM.Compound.Compare]
T:51 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
T:51 [binder, in Undecidability.Synthetic.ListEnumerabilityFacts]
T:511 [binder, in Undecidability.TM.Single.StepTM]
T:516 [binder, in Undecidability.TM.Single.StepTM]
t:52 [binder, in Undecidability.TM.Lifting.LiftAlphabet]
t:52 [binder, in Undecidability.TM.Compound.MoveToSymbol]
t:52 [binder, in Undecidability.TM.Code.BinNumbers.PosPointers]
t:52 [binder, in Complexity.L.TM.TMflat]
t:53 [binder, in Undecidability.L.Tactics.Lrewrite]
t:53 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
t:53 [binder, in Undecidability.L.Tactics.LClos]
t:53 [binder, in Undecidability.TM.Compound.MoveToSymbol]
t:53 [binder, in Undecidability.TM.Compound.CopySymbols]
t:53 [binder, in Undecidability.TM.Code.CodeTM]
t:53 [binder, in Undecidability.TM.TM]
t:53 [binder, in Undecidability.TM.Compound.Compare]
t:53 [binder, in Undecidability.L.Datatypes.LNat]
t:54 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
t:54 [binder, in Undecidability.TM.Compound.MoveToSymbol]
t:54 [binder, in Undecidability.TM.Compound.CopySymbols]
t:54 [binder, in Undecidability.TM.Univ.LowLevel]
t:54 [binder, in Undecidability.TM.Compound.Compare]
t:55 [binder, in Undecidability.TM.L.CompilerBoolFuns.NaryApp]
t:55 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
t:55 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
t:55 [binder, in Undecidability.L.Computability.Seval]
t:55 [binder, in Undecidability.TM.Compound.CopySymbols]
t:55 [binder, in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
t:55 [binder, in Undecidability.L.AbstractMachines.FlatPro.Programs]
t:55 [binder, in Complexity.Complexity.SpaceBoundsTime]
T:55 [binder, in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
t:55 [binder, in Undecidability.L.Datatypes.LNat]
t:56 [binder, in Undecidability.TM.Code.CodeTM]
t:56 [binder, in Complexity.L.TM.TMflat]
t:56 [binder, in Undecidability.TM.Hoare.HoareRegister]
t:56 [binder, in Undecidability.TM.Compound.Compare]
t:56 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachine]
t:56 [binder, in Undecidability.TM.Code.ChangeAlphabet]
T:56 [binder, in Complexity.L.AbstractMachines.FunctionalDefinitions]
t:57 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
t:57 [binder, in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
t:57 [binder, in Undecidability.L.Complexity.ResourceMeasures]
t:57 [binder, in Undecidability.TM.Compound.Compare]
t:57 [binder, in Undecidability.L.Datatypes.LNat]
t:58 [binder, in Undecidability.L.Tactics.Lrewrite]
t:58 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
t:58 [binder, in Undecidability.L.Computability.Seval]
t:58 [binder, in Undecidability.TM.Univ.LowLevel]
t:58 [binder, in Undecidability.TM.Compound.Compare]
t:58 [binder, in Undecidability.TM.Code.ChangeAlphabet]
t:59 [binder, in Undecidability.L.Datatypes.LVector]
t:59 [binder, in Undecidability.L.AbstractMachines.FlatPro.Programs]
t:59 [binder, in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
t:59 [binder, in Undecidability.L.Datatypes.LNat]
T:6 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
t:6 [binder, in Undecidability.L.Tactics.Lsimpl]
t:6 [binder, in Complexity.TM.Code.Decode]
t:6 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
t:6 [binder, in Complexity.TM.Code.DecodeList]
t:6 [binder, in Undecidability.L.Complexity.ResourceMeasures]
t:6 [binder, in Undecidability.TM.Code.BinNumbers.PosPointers]
t:6 [binder, in Undecidability.TM.Code.CodeTM]
t:6 [binder, in Undecidability.L.TM.TapeFuns]
t:6 [binder, in Undecidability.TM.L.Eval]
t:6 [binder, in Undecidability.L.Computability.Rice]
t:6 [binder, in Undecidability.TM.Univ.Univ]
t:6 [binder, in Undecidability.L.Computability.Por]
t:60 [binder, in Undecidability.L.Tactics.ComputableTime]
t:60 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
t:60 [binder, in Undecidability.TM.Code.CodeTM]
T:60 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachine]
t:60 [binder, in Undecidability.L.Complexity.GenericNary]
T:60 [binder, in Complexity.L.AbstractMachines.FunctionalDefinitions]
t:61 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
t:61 [binder, in Undecidability.L.Complexity.ResourceMeasures]
t:61 [binder, in Undecidability.L.Datatypes.LVector]
t:61 [binder, in Undecidability.TM.Hoare.HoareRegister]
t:61 [binder, in Undecidability.L.AbstractMachines.FlatPro.Programs]
t:61 [binder, in Undecidability.TM.Code.ChangeAlphabet]
t:62 [binder, in Complexity.TM.Code.Decode]
T:62 [binder, in Undecidability.TM.Lifting.LiftAlphabet]
t:62 [binder, in Undecidability.TM.Code.CodeTM]
t:62 [binder, in Complexity.L.TM.TMflat]
t:62 [binder, in Undecidability.TM.Hoare.HoareRegister]
t:62 [binder, in Undecidability.TM.Code.Copy]
T:62 [binder, in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
t:63 [binder, in Complexity.L.AbstractMachines.Computable.EvalForTime]
t:63 [binder, in Undecidability.TM.Code.ChangeAlphabet]
t:63 [binder, in Complexity.TM.Single.DecodeTape]
t:64 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
t:64 [binder, in Complexity.L.AbstractMachines.Computable.EvalForTime]
T:64 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
t:64 [binder, in Undecidability.L.Complexity.ResourceMeasures]
t:64 [binder, in Complexity.L.TM.TMflatComp]
T:64 [binder, in Complexity.L.AbstractMachines.FunctionalDefinitions]
t:64 [binder, in Undecidability.TM.Hoare.HoareCombinators]
t:64 [binder, in Undecidability.L.Tactics.Computable]
T:65 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
t:65 [binder, in Undecidability.L.Tactics.Lrewrite]
t:65 [binder, in Undecidability.TM.Code.CodeTM]
T:65 [binder, in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
t:65 [binder, in Complexity.TM.Single.DecodeTape]
t:66 [binder, in Undecidability.L.Util.L_facts]
t:66 [binder, in Undecidability.TM.Hoare.HoareRegister]
t:66 [binder, in Undecidability.TM.Single.EncodeTapes]
t:67 [binder, in Undecidability.L.Computability.Seval]
t:67 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
t:67 [binder, in Undecidability.L.Complexity.ResourceMeasures]
t:67 [binder, in Complexity.L.TM.TMflatComp]
t:67 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachine]
t:68 [binder, in Undecidability.L.Tactics.Lrewrite]
t:68 [binder, in Undecidability.L.Util.L_facts]
t:68 [binder, in Undecidability.TM.Code.CodeTM]
t:68 [binder, in Undecidability.TM.Hoare.HoareRegister]
t:69 [binder, in Undecidability.L.Tactics.Reflection]
t:69 [binder, in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
t:69 [binder, in Undecidability.TM.Single.EncodeTapes]
t:7 [binder, in Undecidability.L.Util.L_facts]
t:7 [binder, in Undecidability.L.Tactics.Lsimpl]
t:7 [binder, in Undecidability.TM.Code.WriteValue]
t:7 [binder, in Undecidability.L.Functions.Proc]
T:7 [binder, in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
t:7 [binder, in Undecidability.TM.L.CaseCom]
t:7 [binder, in Undecidability.L.Functions.Decoding]
t:7 [binder, in Undecidability.L.Tactics.Computable]
t:7 [binder, in Undecidability.TM.Compound.Multi]
t:7 [binder, in Undecidability.L.Computability.Scott]
t:7 [binder, in Undecidability.TM.Compound.WriteString]
t:70 [binder, in Undecidability.TM.Compound.MoveToSymbol]
t:70 [binder, in Complexity.L.TM.TMflat]
t:70 [binder, in Complexity.L.TM.TMflatFun]
t:71 [binder, in Undecidability.TM.Compound.MoveToSymbol]
t:71 [binder, in Undecidability.TM.Compound.CopySymbols]
t:71 [binder, in Undecidability.L.Complexity.ResourceMeasures]
t:71 [binder, in Undecidability.TM.Code.CodeTM]
t:71 [binder, in Undecidability.TM.Code.ChangeAlphabet]
t:71 [binder, in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
t:73 [binder, in Undecidability.TM.Compound.MoveToSymbol]
t:73 [binder, in Undecidability.TM.Code.CodeTM]
t:73 [binder, in Undecidability.TM.Hoare.HoareRegister]
t:73 [binder, in Complexity.NP.TM.M_multi2mono]
t:73 [binder, in Complexity.L.TM.TMflatFun]
t:73 [binder, in Undecidability.TM.Code.ChangeAlphabet]
T:73 [binder, in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
t:74 [binder, in Undecidability.L.Computability.Seval]
t:74 [binder, in Undecidability.TM.Compound.MoveToSymbol]
T:74 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
T:74 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachine]
t:74 [binder, in Undecidability.TM.Util.TM_facts]
t:75 [binder, in Undecidability.L.Util.L_facts]
t:75 [binder, in Undecidability.L.Tactics.Extract]
t:75 [binder, in Undecidability.TM.Code.CodeTM]
t:75 [binder, in Undecidability.TM.Code.ChangeAlphabet]
t:75 [binder, in Complexity.TM.Single.DecodeTape]
T:76 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
t:76 [binder, in Undecidability.L.Computability.Seval]
t:76 [binder, in Undecidability.L.Tactics.LClos]
t:76 [binder, in Undecidability.TM.Compound.MoveToSymbol]
t:76 [binder, in Complexity.L.TM.TMflatFun]
t:76 [binder, in Undecidability.TM.Code.ChangeAlphabet]
t:76 [binder, in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
t:76 [binder, in Undecidability.TM.Util.TM_facts]
t:76 [binder, in Undecidability.TM.Compound.Shift]
t:76 [binder, in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
t:77 [binder, in Undecidability.L.Util.L_facts]
t:77 [binder, in Complexity.TM.Code.Decode]
t:77 [binder, in Undecidability.TM.Compound.MoveToSymbol]
t:77 [binder, in Undecidability.L.Complexity.GenericNary]
t:77 [binder, in Undecidability.TM.Util.TM_facts]
t:78 [binder, in Undecidability.TM.Compound.MoveToSymbol]
t:78 [binder, in Undecidability.TM.Code.CodeTM]
t:78 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
t:78 [binder, in Undecidability.TM.Util.TM_facts]
t:78 [binder, in Undecidability.TM.Compound.Shift]
t:79 [binder, in Undecidability.L.Computability.Seval]
t:79 [binder, in Undecidability.TM.Combinators.StateWhile]
t:79 [binder, in Undecidability.TM.Util.TM_facts]
t:79 [binder, in Complexity.TM.Single.DecodeTape]
t:8 [binder, in Complexity.TM.Single.EncodeTapesInvariants]
t:8 [binder, in Undecidability.L.Datatypes.List.List_extra]
t:8 [binder, in Undecidability.L.Computability.Decidability]
t:8 [binder, in Undecidability.TM.L.Alphabets]
t:8 [binder, in Undecidability.L.Tactics.Lbeta]
t:8 [binder, in Undecidability.L.Computability.Acceptability]
t:8 [binder, in Undecidability.L.Computability.Rice]
t:8 [binder, in Undecidability.TM.Util.TM_facts]
t:8 [binder, in Complexity.NP.L.GenNP]
t:8 [binder, in Undecidability.L.Computability.Por]
t:80 [binder, in Undecidability.L.Computability.Seval]
t:808 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
t:81 [binder, in Undecidability.L.Util.L_facts]
t:81 [binder, in Undecidability.TM.Code.CodeTM]
t:81 [binder, in Undecidability.TM.Compound.Shift]
t:811 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
t:815 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
t:818 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
t:82 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
t:82 [binder, in Undecidability.L.Computability.Seval]
t:82 [binder, in Undecidability.L.Tactics.LClos]
t:82 [binder, in Undecidability.TM.Util.TM_facts]
t:821 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
t:825 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
t:83 [binder, in Undecidability.L.Util.L_facts]
t:83 [binder, in Undecidability.L.Complexity.ResourceMeasures]
t:83 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachine]
t:83 [binder, in Undecidability.TM.Util.TM_facts]
t:83 [binder, in Complexity.TM.Single.DecodeTape]
t:83 [binder, in Undecidability.TM.Compound.Shift]
t:834 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
t:838 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
t:84 [binder, in Undecidability.L.Computability.Seval]
t:84 [binder, in Undecidability.TM.Util.TM_facts]
t:842 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
t:846 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
t:85 [binder, in Undecidability.L.Computability.Seval]
t:85 [binder, in Undecidability.L.Tactics.LClos]
t:85 [binder, in Undecidability.L.Complexity.ResourceMeasures]
t:85 [binder, in Undecidability.TM.Combinators.StateWhile]
t:85 [binder, in Complexity.TM.Single.DecodeTape]
t:851 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
t:855 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
t:86 [binder, in Undecidability.L.Util.L_facts]
t:86 [binder, in Undecidability.L.Computability.Seval]
t:86 [binder, in Undecidability.TM.Compound.Compare]
T:86 [binder, in Undecidability.L.Computability.Synthetic]
t:86 [binder, in Undecidability.TM.Hoare.HoareCombinators]
t:86 [binder, in Undecidability.TM.Compound.Shift]
t:87 [binder, in Complexity.L.TM.TMflatComp]
t:87 [binder, in Complexity.TM.Single.DecodeTape]
t:873 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
t:878 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
t:88 [binder, in Undecidability.L.Util.L_facts]
t:88 [binder, in Undecidability.L.Computability.Seval]
T:88 [binder, in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
t:88 [binder, in Undecidability.TM.Util.TM_facts]
t:88 [binder, in Undecidability.TM.Compound.Shift]
T:89 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
t:89 [binder, in Undecidability.L.Tactics.LClos]
t:9 [binder, in Undecidability.L.Util.L_facts]
t:9 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
t:9 [binder, in Undecidability.L.Computability.Seval]
t:9 [binder, in Undecidability.TM.PrettyBounds.SizeBounds]
t:9 [binder, in Undecidability.TM.Code.BinNumbers.PosPointers]
t:9 [binder, in Undecidability.TM.TM]
T:9 [binder, in Complexity.L.AbstractMachines.AbstractSubstMachine]
t:9 [binder, in Undecidability.TM.L.Alphabets]
t:9 [binder, in Undecidability.TM.Code.ChangeAlphabet]
t:9 [binder, in Undecidability.TM.Code.Copy]
t:9 [binder, in Undecidability.L.Computability.Rice]
T:9 [binder, in Complexity.L.AbstractMachines.Computable.HeapMachine]
t:9 [binder, in Complexity.TM.Single.DecodeTape]
t:9 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler]
t:90 [binder, in Undecidability.L.Util.L_facts]
T:90 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
t:90 [binder, in Complexity.L.TM.TMflatComp]
t:90 [binder, in Undecidability.TM.Compound.Shift]
t:90 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler]
t:91 [binder, in Undecidability.L.Computability.Seval]
t:91 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
t:91 [binder, in Undecidability.TM.Util.TM_facts]
t:92 [binder, in Undecidability.TM.Compound.MoveToSymbol]
t:92 [binder, in Undecidability.L.Complexity.ResourceMeasures]
t:92 [binder, in Undecidability.TM.Code.CodeTM]
t:93 [binder, in Undecidability.L.Computability.Seval]
t:93 [binder, in Undecidability.L.Tactics.Computable]
t:94 [binder, in Undecidability.L.Tactics.LClos]
t:94 [binder, in Undecidability.TM.Compound.MoveToSymbol]
t:94 [binder, in Undecidability.TM.Compound.CopySymbols]
t:94 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachine]
t:94 [binder, in Undecidability.TM.Util.TM_facts]
t:946 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
t:95 [binder, in Undecidability.L.Computability.Seval]
t:95 [binder, in Undecidability.TM.Code.CodeTM]
t:95 [binder, in Undecidability.L.Tactics.Reflection]
t:95 [binder, in Undecidability.TM.Util.TM_facts]
t:950 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
t:955 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
t:960 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
t:97 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
t:97 [binder, in Undecidability.TM.Compound.CopySymbols]
t:98 [binder, in Undecidability.L.Util.L_facts]
t:98 [binder, in Undecidability.TM.Compound.MoveToSymbol]
T:98 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
T:99 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
t:99 [binder, in Undecidability.TM.Util.TM_facts]

U

U [definition, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
U [section, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
U [definition, in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
uc_terminal [lemma, in Undecidability.L.Prelim.ARS]
UGraph [record, in Complexity.NP.Clique.UGraph]
UGraph [library]
UG:68 [binder, in Complexity.NP.Clique.FlatUGraph]
uiter [definition, in Undecidability.L.Functions.UnboundIteration]
uiter [section, in Undecidability.L.Functions.UnboundIteration]
uiterTime [definition, in Undecidability.L.Functions.UnboundIteration]
uiterTime_computesRel [lemma, in Undecidability.L.Functions.UnboundIteration]
uiterTime_bound_recRel [lemma, in Undecidability.L.Functions.UnboundIteration]
uiterTime_bound_recRel2 [lemma, in Undecidability.L.Functions.UnboundIteration]
uiterTime_bound_onlyByN [lemma, in Undecidability.L.Functions.UnboundIteration]
uiter_total_instanceTime [lemma, in Undecidability.L.Functions.UnboundIteration]
uiter_sound [lemma, in Undecidability.L.Functions.UnboundIteration]
uiter_proc [lemma, in Undecidability.L.Functions.UnboundIteration]
uiter.f [variable, in Undecidability.L.Functions.UnboundIteration]
uiter.fT [variable, in Undecidability.L.Functions.UnboundIteration]
uiter.X [variable, in Undecidability.L.Functions.UnboundIteration]
uiter.Y [variable, in Undecidability.L.Functions.UnboundIteration]
uiter:8 [binder, in Undecidability.L.Functions.UnboundIteration]
UnboundIteration [library]
Uncurry [definition, in Undecidability.L.Complexity.GenericNary]
Undecidability [library]
UndecidabilityNotations [module, in Undecidability.Synthetic.Undecidability]
undecidability_from_reducibility [lemma, in Undecidability.Synthetic.Undecidability]
undecidability_HaltTM [lemma, in Undecidability.Synthetic.Undecidability]
undecidable [definition, in Undecidability.Synthetic.Undecidability]
undup [definition, in Undecidability.Shared.Libs.PSL.Lists.Dupfree]
Undup [section, in Undecidability.Shared.Libs.PSL.Lists.Dupfree]
undup_idempotent [lemma, in Undecidability.Shared.Libs.PSL.Lists.Dupfree]
undup_id [lemma, in Undecidability.Shared.Libs.PSL.Lists.Dupfree]
undup_equi [lemma, in Undecidability.Shared.Libs.PSL.Lists.Dupfree]
undup_incl [lemma, in Undecidability.Shared.Libs.PSL.Lists.Dupfree]
undup_id_equi [lemma, in Undecidability.Shared.Libs.PSL.Lists.Dupfree]
Undup.X [variable, in Undecidability.Shared.Libs.PSL.Lists.Dupfree]
unembed [definition, in Undecidability.Shared.embed_nat]
unembedP [lemma, in Undecidability.Shared.embed_nat]
unenc_correct2 [lemma, in Undecidability.L.Datatypes.LNat]
unenc_correct [lemma, in Undecidability.L.Datatypes.LNat]
unflattenCarddow [lemma, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
unflattenCarddow [lemma, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
unflattenCards [lemma, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
unflattenCards [lemma, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
unflattenCC [lemma, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
unflattenFinal [lemma, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
unflattenFinal [lemma, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
unflattenString [lemma, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
unflattenString [lemma, in Complexity.Libs.CookPrelim.FlatFinTypes]
unflattenString [lemma, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
unflattenTCC [lemma, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
unflattenTCCCardP [lemma, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
unflattenTM [definition, in Complexity.L.TM.TMunflatten]
unflattenTM_correct [lemma, in Complexity.L.TM.TMunflatten]
unflattenVertex [lemma, in Complexity.NP.Clique.kSAT_to_FlatClique]
unflatten_trans_correct [lemma, in Complexity.L.TM.TMunflatten]
unflatten_acts_correct [lemma, in Complexity.L.TM.TMunflatten]
unflatten_in_correct [lemma, in Complexity.L.TM.TMunflatten]
unflatten_in [definition, in Complexity.L.TM.TMunflatten]
unflatten_halt [definition, in Complexity.L.TM.TMunflatten]
unflatten_trans [definition, in Complexity.L.TM.TMunflatten]
unflatten_acts [definition, in Complexity.L.TM.TMunflatten]
unflatten_acts' [definition, in Complexity.L.TM.TMunflatten]
unflatten_symb [definition, in Complexity.L.TM.TMunflatten]
unflatten_single [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
unfoldBoolean [definition, in Complexity.L.AbstractMachines.UnfoldTailRec]
unfoldBoolean_sound [lemma, in Complexity.L.AbstractMachines.UnfoldTailRec]
unfoldBoolean_complete [lemma, in Complexity.L.AbstractMachines.UnfoldTailRec]
unfoldBool_time_leq [lemma, in Complexity.L.AbstractMachines.Computable.Unfolding]
unfoldBool_time_mono [lemma, in Complexity.L.AbstractMachines.Computable.Unfolding]
unfoldBool_time [definition, in Complexity.L.AbstractMachines.Computable.Unfolding]
unfoldC [definition, in Complexity.L.AbstractMachines.UnfoldHeap]
UnfoldClos [module, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
UnfoldClos [library]
UnfoldClos [library]
UnfoldClos.Fix [section, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
UnfoldClos.Fix.retr_clos [variable, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
UnfoldClos.Fix.retr_heap [variable, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
UnfoldClos.Fix.retr_stack [variable, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
UnfoldClos.Fix.Σ [variable, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
UnfoldClos.i_H [abbreviation, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
UnfoldClos.i_io [abbreviation, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
UnfoldClos.M [definition, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
UnfoldClos.n [abbreviation, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
UnfoldClos.retr_nat_stack [definition, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
UnfoldClos.retr_stackEl [definition, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
UnfoldClos.retr_clos_stack [definition, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
UnfoldClos.retr_pro [definition, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
UnfoldClos.SpecT [lemma, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
UnfoldClos.steps [definition, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
unfoldC_correct_final [lemma, in Complexity.L.AbstractMachines.UnfoldHeap]
unfoldC_correct [lemma, in Complexity.L.AbstractMachines.UnfoldHeap]
unfoldC_mono [lemma, in Complexity.L.AbstractMachines.UnfoldHeap]
UnfoldHeap [library]
Unfolding [library]
UnfoldPro [section, in Complexity.L.AbstractMachines.UnfoldHeap]
UnfoldPro.H [variable, in Complexity.L.AbstractMachines.UnfoldHeap]
unfolds [inductive, in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
unfolds [inductive, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
unfoldsApp [constructor, in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
unfoldsApp [constructor, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
unfoldsBound [constructor, in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
unfoldsBound [constructor, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
unfoldsC_correct2 [lemma, in Complexity.L.AbstractMachines.UnfoldHeap]
unfoldsLam [constructor, in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
unfoldsLam [constructor, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
unfoldsUnbound [constructor, in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
unfoldsUnbound [constructor, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
unfolds_extend [lemma, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
unfolds_subst [lemma, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
unfolds_subst' [lemma, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
unfolds_inv_lam_lam [lemma, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
unfolds_bound [lemma, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
unfolds_rect [definition, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
unfolds_ind' [definition, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
unfolds_inj [lemma, in Complexity.L.AbstractMachines.UnfoldHeap]
unfolds_extend [lemma, in Complexity.L.AbstractMachines.AbstractHeapMachine]
unfolds_subst [lemma, in Complexity.L.AbstractMachines.AbstractHeapMachine]
unfolds_subst' [lemma, in Complexity.L.AbstractMachines.AbstractHeapMachine]
unfolds_bound [lemma, in Complexity.L.AbstractMachines.AbstractHeapMachine]
unfolds_functional [lemma, in Complexity.L.AbstractMachines.AbstractHeapMachine]
UnfoldTailRec [library]
unfoldTailRecStep [definition, in Complexity.L.AbstractMachines.UnfoldTailRec]
unfoldTailRecStep [definition, in Undecidability.L.AbstractMachines.FlatPro.UnfoldClos]
unfoldTailRecStep_largestVar_inv [lemma, in Complexity.L.AbstractMachines.UnfoldTailRec]
unfoldTailRecStep_sound [lemma, in Complexity.L.AbstractMachines.UnfoldTailRec]
unfoldTailRecStep_sound' [lemma, in Complexity.L.AbstractMachines.UnfoldTailRec]
unfoldTailRecStep_complete [lemma, in Complexity.L.AbstractMachines.UnfoldTailRec]
unfoldTailRecStep_complete' [lemma, in Complexity.L.AbstractMachines.UnfoldTailRec]
unfoldTailRecStep_sizes_correct [lemma, in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisUnfoldClos]
unfoldTailRecStep_sizes_correct' [lemma, in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisUnfoldClos]
unfoldTailRecStep_sizes [definition, in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisUnfoldClos]
unfoldTailRecStep_complete [lemma, in Undecidability.L.AbstractMachines.FlatPro.UnfoldClos]
unfoldTailRecStep_complete' [lemma, in Undecidability.L.AbstractMachines.FlatPro.UnfoldClos]
unfold_extend_Proper [instance, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
unfold_extend_Proper [instance, in Complexity.L.AbstractMachines.AbstractHeapMachine]
UniformHomomorphisms [library]
uniform_confluent_confluent [lemma, in Undecidability.L.Prelim.ARS]
uniform_confluence_parameterized_both_terminal [lemma, in Undecidability.L.Prelim.ARS]
uniform_confluence_parameterized_terminal [lemma, in Undecidability.L.Prelim.ARS]
uniform_confluent_noloop [lemma, in Undecidability.L.Prelim.ARS]
uniform_confluent [definition, in Undecidability.L.Prelim.ARS]
uniform_confluence [lemma, in Undecidability.L.Util.L_facts]
uniform_homomorphism [definition, in Complexity.Libs.UniformHomomorphisms]
unif_homo_eps_free [lemma, in Complexity.Libs.UniformHomomorphisms]
unif_homo_length [lemma, in Complexity.Libs.UniformHomomorphisms]
unique_normal_forms [lemma, in Undecidability.L.Prelim.ARS]
unique_normal_forms [lemma, in Undecidability.L.Util.L_facts]
unit_eq_dec [instance, in Undecidability.Shared.Libs.PSL.EqDec]
unit_enum [definition, in Undecidability.Synthetic.EnumerabilityFacts]
unit_enc [definition, in Undecidability.L.Tactics.ComputableDemo]
unit_enum_ok [lemma, in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicFinTypes]
unit_eq_dec [instance, in Undecidability.Shared.Dec]
unit_decode [definition, in Undecidability.L.Functions.Decoding]
Univ [section, in Undecidability.TM.Univ.LowLevel]
Univ [definition, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
Univ [definition, in Undecidability.TM.Univ.Univ]
Univ [section, in Undecidability.TM.Univ.Univ]
Univ [library]
UnivBounds [library]
univDecTime [definition, in Complexity.L.AbstractMachines.Computable.UnivDecTime]
UnivDecTime [library]
univDecTime_complete [lemma, in Complexity.L.AbstractMachines.Computable.UnivDecTime]
univDecTime_time [definition, in Complexity.L.AbstractMachines.Computable.UnivDecTime]
UnivMultiTimeSpaceTheorem [section, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
UnivMultiTimeSpaceTheorem.M [variable, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
UnivMultiTimeSpaceTheorem.n [variable, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
UnivMultiTimeSpaceTheorem.n_ge1 [variable, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
UnivMultiTimeSpaceTheorem.sigM [variable, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
castState _ [notation, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
UnivSpaceBounds [library]
univStep [definition, in Complexity.L.AbstractMachines.Computable.UnivDecTime]
Univ_size_nice [lemma, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
Univ_size_bound [definition, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
Univ_size_nice' [lemma, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
Univ_size_bound4 [definition, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
Univ_size_bound3 [definition, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
Univ_Step_size_bound3_better [lemma, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
Univ_size_bound2 [definition, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
Univ_Step_tape2_trice [definition, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
Univ_Step_tape2_twice [definition, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
Univ_Step_size_nice [lemma, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
Univ_Step_size_bound2_lt [lemma, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
Univ_Step_size_bound5 [definition, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
Univ_Step_size_bound4 [definition, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
Univ_Step_size_bound3 [definition, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
Univ_Step_size_bound2 [definition, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
Univ_nice.M [variable, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
Univ_nice.sigM [variable, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
Univ_nice [section, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
Univ_nice.Univ_steps_nice [lemma, in Complexity.TM.PrettyBounds.UnivBounds]
Univ_nice.Univ_Step_steps_nice [lemma, in Complexity.TM.PrettyBounds.UnivBounds]
Univ_nice.Univ_Step_steps_IsFinal_nice [lemma, in Complexity.TM.PrettyBounds.UnivBounds]
Univ_nice.Univ_Step_steps_Translate_nice [lemma, in Complexity.TM.PrettyBounds.UnivBounds]
Univ_nice.Univ_Step_steps_Lookup_nice [lemma, in Complexity.TM.PrettyBounds.UnivBounds]
Univ_nice.Encode_graph_hasSize_ge1 [lemma, in Complexity.TM.PrettyBounds.UnivBounds]
Univ_nice.tam [instance, in Complexity.TM.PrettyBounds.UnivBounds]
Univ_nice.length_graph_is_number_of_states [lemma, in Complexity.TM.PrettyBounds.UnivBounds]
Univ_nice.graph_of_fun_length [lemma, in Complexity.TM.PrettyBounds.UnivBounds]
Univ_nice.IsFinal_steps_nice [lemma, in Complexity.TM.PrettyBounds.UnivBounds]
Univ_nice.Encode_state_hasSize [lemma, in Complexity.TM.PrettyBounds.UnivBounds]
Univ_nice.Univ_Step_steps_ResetSymbol_nice [lemma, in Complexity.TM.PrettyBounds.UnivBounds]
Univ_nice.Univ_Step_steps_ConstrPair_nice [lemma, in Complexity.TM.PrettyBounds.UnivBounds]
Univ_nice.size_state_index_le [lemma, in Complexity.TM.PrettyBounds.UnivBounds]
Univ_nice.size_state_index_lt [lemma, in Complexity.TM.PrettyBounds.UnivBounds]
Univ_nice.number_of_states [definition, in Complexity.TM.PrettyBounds.UnivBounds]
Univ_nice.Univ_Step_steps_CasePair_nice [lemma, in Complexity.TM.PrettyBounds.UnivBounds]
Univ_nice.ReadCurrent'_steps_nice [lemma, in Complexity.TM.PrettyBounds.UnivBounds]
Univ_nice.DoAction'_steps_nice [lemma, in Complexity.TM.PrettyBounds.UnivBounds]
Univ_nice.Univ_nice [section, in Complexity.TM.PrettyBounds.UnivBounds]
Univ_nice.enum_length_ge1 [lemma, in Complexity.TM.PrettyBounds.UnivBounds]
Univ_nice.enum_not_nil [lemma, in Complexity.TM.PrettyBounds.UnivBounds]
Univ_nice.fin_prod_nil_Y_nil [lemma, in Complexity.TM.PrettyBounds.UnivBounds]
Univ_nice.prodLists_nil_Y_nil [lemma, in Complexity.TM.PrettyBounds.UnivBounds]
Univ_nice.prodLists_length [lemma, in Complexity.TM.PrettyBounds.UnivBounds]
Univ_nice.fin_empty_or_element [lemma, in Complexity.TM.PrettyBounds.UnivBounds]
Univ_nice.index_le [lemma, in Complexity.TM.PrettyBounds.UnivBounds]
Univ_nice.getPosition_le [lemma, in Complexity.TM.PrettyBounds.UnivBounds]
Univ_nice.Lookup_steps_nice' [lemma, in Complexity.TM.PrettyBounds.UnivBounds]
Univ_nice.Lookup_steps_nice [lemma, in Complexity.TM.PrettyBounds.UnivBounds]
Univ_nice.Lookup_Loop_steps_nice [lemma, in Complexity.TM.PrettyBounds.UnivBounds]
Univ_nice.Lookup_Loop_steps_nice' [lemma, in Complexity.TM.PrettyBounds.UnivBounds]
Univ_nice.Lookup_Loop_steps_eq [lemma, in Complexity.TM.PrettyBounds.UnivBounds]
Univ_nice.Lookup_Step_steps_nice' [lemma, in Complexity.TM.PrettyBounds.UnivBounds]
Univ_nice.Lookup_Step_steps_nice [lemma, in Complexity.TM.PrettyBounds.UnivBounds]
Univ_nice.Lookup_Step_steps_CaseList_nice [lemma, in Complexity.TM.PrettyBounds.UnivBounds]
Univ_nice.Lookup_Step_steps_Compare_nice [lemma, in Complexity.TM.PrettyBounds.UnivBounds]
Univ_nice.LookupAssociativeList_nice [section, in Complexity.TM.PrettyBounds.UnivBounds]
Univ_nice [module, in Complexity.TM.PrettyBounds.UnivBounds]
Univ_Terminates [lemma, in Undecidability.TM.Univ.Univ]
Univ_T [definition, in Undecidability.TM.Univ.Univ]
Univ_Realise [lemma, in Undecidability.TM.Univ.Univ]
Univ_Rel [definition, in Undecidability.TM.Univ.Univ]
Univ_SpecT [lemma, in Undecidability.TM.Univ.Univ]
Univ_steps_eq [lemma, in Undecidability.TM.Univ.Univ]
Univ_steps [definition, in Undecidability.TM.Univ.Univ]
Univ_Spec_space [lemma, in Undecidability.TM.Univ.Univ]
Univ_size [definition, in Undecidability.TM.Univ.Univ]
Univ_Step_SpecT [lemma, in Undecidability.TM.Univ.Univ]
Univ_Step_SpecT_space [lemma, in Undecidability.TM.Univ.Univ]
Univ_Step [definition, in Undecidability.TM.Univ.Univ]
Univ_Step_steps [definition, in Undecidability.TM.Univ.Univ]
Univ_Step_steps_IsFinal [definition, in Undecidability.TM.Univ.Univ]
Univ_Step_steps_Translate [definition, in Undecidability.TM.Univ.Univ]
Univ_Step_steps_CasePair [definition, in Undecidability.TM.Univ.Univ]
Univ_Step_steps_Lookup [definition, in Undecidability.TM.Univ.Univ]
Univ_Step_steps_ResetSymbol [definition, in Undecidability.TM.Univ.Univ]
Univ_Step_steps_ConstrPair [definition, in Undecidability.TM.Univ.Univ]
Univ_Step_size [definition, in Undecidability.TM.Univ.Univ]
Univ.LegacyLemmas [section, in Undecidability.TM.Univ.Univ]
Univ.retr_sigTape_sig [variable, in Undecidability.TM.Univ.LowLevel]
Univ.retr_sigGraph_sig [variable, in Undecidability.TM.Univ.LowLevel]
Univ.retr_sigTape_sig [variable, in Undecidability.TM.Univ.Univ]
Univ.retr_sigGraph_sig [variable, in Undecidability.TM.Univ.Univ]
Univ.sig [variable, in Undecidability.TM.Univ.LowLevel]
Univ.sig [variable, in Undecidability.TM.Univ.Univ]
Univ.sigM [variable, in Undecidability.TM.Univ.LowLevel]
Univ.sigM [variable, in Undecidability.TM.Univ.Univ]
ContainsState_size _ _ [notation, in Undecidability.TM.Univ.Univ]
ContainsState _ [notation, in Undecidability.TM.Univ.Univ]
ContainsTrans_size _ _ [notation, in Undecidability.TM.Univ.Univ]
ContainsTrans _ [notation, in Undecidability.TM.Univ.Univ]
UNKNOWN [constructor, in Undecidability.TM.Code.CodeTM]
UnmarkedSymbol [constructor, in Undecidability.TM.Single.EncodeTapes]
Unnamed_thm [definition, in Complexity.Libs.Pigeonhole]
Unnamed_thm [definition, in Undecidability.TM.Combinators.While]
Unnamed_thm [definition, in Undecidability.L.Prelim.ARS]
Unnamed_thm3 [definition, in Undecidability.TM.Compound.TMTac]
Unnamed_thm2 [definition, in Undecidability.TM.Compound.TMTac]
Unnamed_thm1 [definition, in Undecidability.TM.Compound.TMTac]
Unnamed_thm0 [definition, in Undecidability.TM.Compound.TMTac]
Unnamed_thm [definition, in Undecidability.TM.Compound.TMTac]
Unnamed_thm [definition, in Undecidability.TM.Code.CaseList]
Unnamed_thm0 [definition, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
Unnamed_thm [definition, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
Unnamed_thm [definition, in Undecidability.L.Util.L_facts]
Unnamed_thm1 [definition, in Undecidability.L.Complexity.UpToCNary]
Unnamed_thm0 [definition, in Undecidability.L.Complexity.UpToCNary]
Unnamed_thm [definition, in Undecidability.L.Complexity.UpToCNary]
Unnamed_thm [definition, in Undecidability.TM.Code.BinNumbers.PosDefinitions]
Unnamed_thm [definition, in Undecidability.TM.Code.CaseNat]
Unnamed_thm [definition, in Undecidability.TM.Code.NatTM]
Unnamed_thm2 [definition, in Undecidability.L.Tactics.ComputableDemo]
Unnamed_thm1 [definition, in Undecidability.L.Tactics.ComputableDemo]
Unnamed_thm0 [definition, in Undecidability.L.Tactics.ComputableDemo]
Unnamed_thm0 [definition, in Undecidability.L.Tactics.ComputableDemo]
Unnamed_thm0 [definition, in Undecidability.L.Tactics.ComputableDemo]
Unnamed_thm0 [definition, in Undecidability.L.Tactics.ComputableDemo]
Unnamed_thm [definition, in Undecidability.L.Tactics.ComputableDemo]
Unnamed_thm [definition, in Undecidability.Shared.Libs.PSL.Vectors.Fin]
Unnamed_thm0 [definition, in Undecidability.L.Complexity.UpToC]
Unnamed_thm [definition, in Undecidability.L.Complexity.UpToC]
Unnamed_thm [definition, in Undecidability.TM.Code.CaseSum]
Unnamed_thm [definition, in Undecidability.L.Computability.Fixpoints]
Unnamed_thm [definition, in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
Unnamed_thm [definition, in Undecidability.L.Computability.Acceptability]
Unnamed_thm0 [definition, in Undecidability.Shared.Libs.PSL.Vectors.VectorDupfree]
Unnamed_thm [definition, in Undecidability.Shared.Libs.PSL.Vectors.VectorDupfree]
Unnamed_thm2 [definition, in Undecidability.TM.Lifting.LiftTapes]
Unnamed_thm1 [definition, in Undecidability.TM.Lifting.LiftTapes]
Unnamed_thm0 [definition, in Undecidability.TM.Lifting.LiftTapes]
Unnamed_thm [definition, in Undecidability.TM.Lifting.LiftTapes]
Unnamed_thm0 [definition, in Undecidability.L.Computability.Rice]
Unnamed_thm [definition, in Undecidability.L.Computability.Rice]
Unnamed_thm0 [definition, in Undecidability.TM.Util.TM_facts]
Unnamed_thm [definition, in Undecidability.TM.Util.TM_facts]
Unnamed_thm [definition, in Undecidability.TM.Code.CasePair]
Unnamed_thm [definition, in Undecidability.L.Computability.Scott]
Unnamed_thm [definition, in Undecidability.TM.Single.EncodeTapes]
Unnamed_thm [definition, in Complexity.TM.PrettyBounds.PrettyBounds]
unsupported [lemma, in Undecidability.L.Tactics.ComputableDemo]
unsupported2 [lemma, in Undecidability.L.Tactics.ComputableDemo]
upperBound_In [lemma, in Undecidability.TM.PrettyBounds.MaxList]
UpToC [record, in Undecidability.L.Complexity.UpToC]
UpToC [library]
UpToCNary [library]
UpToCPoly [library]
upToC_pow_le_compat_nary [lemma, in Undecidability.L.Complexity.UpToCNary]
upToC_pow_r_drop_nary [lemma, in Undecidability.L.Complexity.UpToCNary]
upToC_mul_nary [lemma, in Undecidability.L.Complexity.UpToCNary]
upToC_S_nary [lemma, in Undecidability.L.Complexity.UpToCNary]
upToC_c_nary [lemma, in Undecidability.L.Complexity.UpToCNary]
upToC_mul_c_r_nary [lemma, in Undecidability.L.Complexity.UpToCNary]
upToC_mul_c_l_nary [lemma, in Undecidability.L.Complexity.UpToCNary]
upToC_min_nary [lemma, in Undecidability.L.Complexity.UpToCNary]
upToC_max_nary [lemma, in Undecidability.L.Complexity.UpToCNary]
upToC_add_nary [lemma, in Undecidability.L.Complexity.UpToCNary]
uptoc_mixed.sat_NP [lemma, in Complexity.L.ComparisonTimeBoundDerivation]
uptoc_mixed.term_sat_verifierb [instance, in Complexity.L.ComparisonTimeBoundDerivation]
uptoc_mixed._term_sat_verifierb [lemma, in Complexity.L.ComparisonTimeBoundDerivation]
uptoc_mixed.sat_verifierb_time [definition, in Complexity.L.ComparisonTimeBoundDerivation]
uptoc_mixed.evalCnf_poly [lemma, in Complexity.L.ComparisonTimeBoundDerivation]
uptoc_mixed.term_evalCnf [instance, in Complexity.L.ComparisonTimeBoundDerivation]
uptoc_mixed._term_evalCnf [lemma, in Complexity.L.ComparisonTimeBoundDerivation]
uptoc_mixed.evalCnf_time [definition, in Complexity.L.ComparisonTimeBoundDerivation]
uptoc_mixed.sumn_map_mult_c_l [lemma, in Complexity.L.ComparisonTimeBoundDerivation]
uptoc_mixed.evalClause_poly [lemma, in Complexity.L.ComparisonTimeBoundDerivation]
uptoc_mixed.term_evalClause [instance, in Complexity.L.ComparisonTimeBoundDerivation]
uptoc_mixed._term_evalClause [lemma, in Complexity.L.ComparisonTimeBoundDerivation]
uptoc_mixed.evalClause_time [definition, in Complexity.L.ComparisonTimeBoundDerivation]
uptoc_mixed.term_forallb [instance, in Complexity.L.ComparisonTimeBoundDerivation]
uptoc_mixed._term_forallb [lemma, in Complexity.L.ComparisonTimeBoundDerivation]
uptoc_mixed.forallb_time [definition, in Complexity.L.ComparisonTimeBoundDerivation]
uptoc_mixed.term_existsb [instance, in Complexity.L.ComparisonTimeBoundDerivation]
uptoc_mixed._term_existsb [lemma, in Complexity.L.ComparisonTimeBoundDerivation]
uptoc_mixed.existsb_time [definition, in Complexity.L.ComparisonTimeBoundDerivation]
uptoc_mixed.term_evalLiteral [instance, in Complexity.L.ComparisonTimeBoundDerivation]
uptoc_mixed._term_evalLiteral [lemma, in Complexity.L.ComparisonTimeBoundDerivation]
uptoc_mixed.evalLiteral_time [definition, in Complexity.L.ComparisonTimeBoundDerivation]
uptoc_mixed.term_evalVar [instance, in Complexity.L.ComparisonTimeBoundDerivation]
uptoc_mixed._term_evalVar [lemma, in Complexity.L.ComparisonTimeBoundDerivation]
uptoc_mixed.evalVar_time [definition, in Complexity.L.ComparisonTimeBoundDerivation]
uptoc_mixed.term_list_in_decb [instance, in Complexity.L.ComparisonTimeBoundDerivation]
uptoc_mixed._term_list_in_decb [lemma, in Complexity.L.ComparisonTimeBoundDerivation]
uptoc_mixed.list_in_decb_time [definition, in Complexity.L.ComparisonTimeBoundDerivation]
uptoc_mixed.uptoc_mixed.fixXeq.X [variable, in Complexity.L.ComparisonTimeBoundDerivation]
uptoc_mixed.uptoc_mixed.fixXeq [section, in Complexity.L.ComparisonTimeBoundDerivation]
uptoc_mixed.uptoc_mixed [section, in Complexity.L.ComparisonTimeBoundDerivation]
uptoc_mixed [module, in Complexity.L.ComparisonTimeBoundDerivation]
uptoc_pure.sat_NP [lemma, in Complexity.L.ComparisonTimeBoundDerivation]
uptoc_pure.term_sat_verifierb [instance, in Complexity.L.ComparisonTimeBoundDerivation]
uptoc_pure._term_sat_verifierb [lemma, in Complexity.L.ComparisonTimeBoundDerivation]
uptoc_pure.sat_verifierb_time [definition, in Complexity.L.ComparisonTimeBoundDerivation]
uptoc_pure.term_evalCnf [instance, in Complexity.L.ComparisonTimeBoundDerivation]
uptoc_pure._term_evalCnf [lemma, in Complexity.L.ComparisonTimeBoundDerivation]
uptoc_pure.evalCnf_time [definition, in Complexity.L.ComparisonTimeBoundDerivation]
uptoc_pure.sumn_map_mult_c_l [lemma, in Complexity.L.ComparisonTimeBoundDerivation]
uptoc_pure.term_evalClause [instance, in Complexity.L.ComparisonTimeBoundDerivation]
uptoc_pure._term_evalClause [lemma, in Complexity.L.ComparisonTimeBoundDerivation]
uptoc_pure.evalClause_time [definition, in Complexity.L.ComparisonTimeBoundDerivation]
uptoc_pure.term_forallb [instance, in Complexity.L.ComparisonTimeBoundDerivation]
uptoc_pure._term_forallb [lemma, in Complexity.L.ComparisonTimeBoundDerivation]
uptoc_pure.forallb_time [definition, in Complexity.L.ComparisonTimeBoundDerivation]
uptoc_pure.term_existsb [instance, in Complexity.L.ComparisonTimeBoundDerivation]
uptoc_pure._term_existsb [lemma, in Complexity.L.ComparisonTimeBoundDerivation]
uptoc_pure.existsb_time [definition, in Complexity.L.ComparisonTimeBoundDerivation]
uptoc_pure.term_evalLiteral [instance, in Complexity.L.ComparisonTimeBoundDerivation]
uptoc_pure._term_evalLiteral [lemma, in Complexity.L.ComparisonTimeBoundDerivation]
uptoc_pure.evalLiteral_time [definition, in Complexity.L.ComparisonTimeBoundDerivation]
uptoc_pure.term_evalVar [instance, in Complexity.L.ComparisonTimeBoundDerivation]
uptoc_pure._term_evalVar [lemma, in Complexity.L.ComparisonTimeBoundDerivation]
uptoc_pure.evalVar_time [definition, in Complexity.L.ComparisonTimeBoundDerivation]
uptoc_pure.term_list_in_decb [instance, in Complexity.L.ComparisonTimeBoundDerivation]
uptoc_pure._term_list_in_decb [lemma, in Complexity.L.ComparisonTimeBoundDerivation]
uptoc_pure.list_in_decb_time [definition, in Complexity.L.ComparisonTimeBoundDerivation]
uptoc_pure.maxSize_enc_size [lemma, in Complexity.L.ComparisonTimeBoundDerivation]
uptoc_pure.maxSize [definition, in Complexity.L.ComparisonTimeBoundDerivation]
uptoc_pure.uptoc_pure.fixXeq.X [variable, in Complexity.L.ComparisonTimeBoundDerivation]
uptoc_pure.uptoc_pure.fixXeq [section, in Complexity.L.ComparisonTimeBoundDerivation]
uptoc_pure.uptoc_pure [section, in Complexity.L.ComparisonTimeBoundDerivation]
uptoc_pure [module, in Complexity.L.ComparisonTimeBoundDerivation]
upToC_f__UpToC [lemma, in Undecidability.L.Complexity.UpToC]
upToC_le [lemma, in Undecidability.L.Complexity.UpToC]
upToC_pow_le_compat [lemma, in Undecidability.L.Complexity.UpToC]
upToC_pow_r_drop [lemma, in Undecidability.L.Complexity.UpToC]
upToC_mul [lemma, in Undecidability.L.Complexity.UpToC]
upToC_S [lemma, in Undecidability.L.Complexity.UpToC]
upToC_c [lemma, in Undecidability.L.Complexity.UpToC]
upToC_mul_c_r [lemma, in Undecidability.L.Complexity.UpToC]
upToC_mul_c_l [lemma, in Undecidability.L.Complexity.UpToC]
upToC_min [lemma, in Undecidability.L.Complexity.UpToC]
upToC_max [lemma, in Undecidability.L.Complexity.UpToC]
upToC_add [lemma, in Undecidability.L.Complexity.UpToC]
UpToC_le [lemma, in Undecidability.L.Complexity.UpToC]
Usefull_Retracts.Retract_sum [section, in Undecidability.Shared.Libs.PSL.Retracts]
Usefull_Retracts.D [variable, in Undecidability.Shared.Libs.PSL.Retracts]
Usefull_Retracts.C [variable, in Undecidability.Shared.Libs.PSL.Retracts]
Usefull_Retracts.B [variable, in Undecidability.Shared.Libs.PSL.Retracts]
Usefull_Retracts.A [variable, in Undecidability.Shared.Libs.PSL.Retracts]
Usefull_Retracts [section, in Undecidability.Shared.Libs.PSL.Retracts]
us1:136 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
us:106 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
us:121 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
us:130 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
utils [library]
utils_tac [library]
utils_nat [library]
utils_list [library]
utils_decidable [library]
utils_string [library]
U_Realises [lemma, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
U_Rel [definition, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
U_terminatesIn [lemma, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
U_T [definition, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
U_steps [definition, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
U_reflects_U_spec [lemma, in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
U_correct [lemma, in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
U_spec [definition, in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
U_spec_helper [lemma, in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
U_preproc [definition, in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
u':131 [binder, in Undecidability.L.Util.L_facts]
u':157 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
u':325 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
U.F [variable, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
U.inhSigM [variable, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
U.sigM [variable, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
u0:102 [binder, in Undecidability.L.Tactics.Reflection]
u1:57 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
u2:58 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
u:1 [binder, in Undecidability.L.Functions.Eval]
u:1 [binder, in Undecidability.L.Computability.Decidability]
u:10 [binder, in Undecidability.L.Computability.Seval]
U:10 [binder, in Undecidability.Shared.Libs.PSL.Lists.Power]
u:10 [binder, in Undecidability.L.Computability.Computability]
u:102 [binder, in Undecidability.L.Prelim.ARS]
u:104 [binder, in Undecidability.L.Computability.Seval]
u:105 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
u:106 [binder, in Undecidability.L.Tactics.Reflection]
u:107 [binder, in Undecidability.L.Tactics.LClos]
u:11 [binder, in Undecidability.L.Tactics.LClos_Eval]
u:11 [binder, in Undecidability.L.Tactics.Lbeta_nonrefl]
u:110 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
u:111 [binder, in Undecidability.L.Tactics.Reflection]
u:114 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
u:115 [binder, in Undecidability.L.Util.L_facts]
u:115 [binder, in Undecidability.L.Computability.Seval]
u:115 [binder, in Undecidability.L.Tactics.Reflection]
u:120 [binder, in Undecidability.L.Util.L_facts]
u:120 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
u:124 [binder, in Undecidability.L.Prelim.ARS]
u:127 [binder, in Undecidability.L.Util.L_facts]
u:127 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
u:128 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
u:129 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
u:13 [binder, in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
u:13 [binder, in Undecidability.L.Tactics.Lrewrite]
u:130 [binder, in Undecidability.L.Util.L_facts]
u:136 [binder, in Undecidability.L.Tactics.Extract]
u:137 [binder, in Undecidability.L.Prelim.ARS]
u:14 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_nat_facts]
U:14 [binder, in Undecidability.Shared.Libs.PSL.Lists.Power]
u:141 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
u:142 [binder, in Undecidability.L.Util.L_facts]
u:145 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
u:149 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
u:15 [binder, in Undecidability.L.Computability.Decidability]
u:151 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
u:158 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
u:16 [binder, in Undecidability.L.L]
u:163 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
u:167 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
u:17 [binder, in Undecidability.TM.L.CompilerBoolFuns.NaryApp]
u:17 [binder, in Undecidability.Shared.Libs.DLW.Utils.crt]
u:17 [binder, in Undecidability.L.Tactics.LClos_Eval]
u:17 [binder, in Undecidability.L.Computability.Decidability]
U:17 [binder, in Undecidability.Shared.Libs.PSL.Lists.Power]
u:17 [binder, in Undecidability.L.Computability.Rice]
u:172 [binder, in Undecidability.TM.Lifting.LiftTapes]
u:172 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
u:173 [binder, in Undecidability.TM.Lifting.LiftTapes]
u:178 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
u:183 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
u:184 [binder, in Undecidability.L.Prelim.ARS]
u:185 [binder, in Undecidability.L.Util.L_facts]
u:189 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
u:19 [binder, in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
u:19 [binder, in Undecidability.L.Tactics.Extract]
u:190 [binder, in Undecidability.L.Util.L_facts]
u:195 [binder, in Undecidability.L.Util.L_facts]
u:196 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
U:2 [binder, in Undecidability.Shared.Libs.PSL.Lists.Power]
u:2 [binder, in Undecidability.TM.PrettyBounds.MaxList]
u:20 [binder, in Undecidability.L.Computability.Decidability]
U:20 [binder, in Undecidability.Shared.Libs.PSL.Lists.Power]
u:201 [binder, in Undecidability.L.Util.L_facts]
u:212 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
U:22 [binder, in Undecidability.Shared.Libs.PSL.Lists.Power]
u:23 [binder, in Undecidability.L.Tactics.LClos_Eval]
U:24 [binder, in Undecidability.Shared.Libs.PSL.Lists.Power]
u:2543 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
u:2600 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
u:2605 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
u:2610 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
u:27 [binder, in Undecidability.L.Util.L_facts]
u:27 [binder, in Undecidability.L.Computability.Seval]
U:27 [binder, in Undecidability.Shared.Libs.PSL.Lists.Power]
u:27 [binder, in Undecidability.L.Computability.Rice]
u:2709 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
u:280 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
u:282 [binder, in Undecidability.L.Tactics.Reflection]
u:283 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
u:2880 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
u:2885 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
u:2893 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
u:2898 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
U:29 [binder, in Undecidability.Shared.Libs.PSL.Lists.Power]
u:3 [binder, in Undecidability.L.Functions.Eval]
u:3 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
u:3 [binder, in Undecidability.L.Tactics.Lbeta_nonrefl]
u:3 [binder, in Undecidability.L.Tactics.Lbeta]
u:312 [binder, in Undecidability.L.Tactics.Reflection]
u:316 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
u:32 [binder, in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
u:32 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_quotient]
u:32 [binder, in Undecidability.L.Datatypes.LOptions]
U:32 [binder, in Undecidability.Shared.Libs.PSL.Lists.Power]
u:322 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
u:34 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_quotient]
U:35 [binder, in Undecidability.Shared.Libs.PSL.Lists.Power]
u:35 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
u:357 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
u:37 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
u:38 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
u:38 [binder, in Undecidability.L.Computability.Rice]
u:39 [binder, in Undecidability.L.Tactics.Lrewrite]
u:39 [binder, in Undecidability.L.Tactics.Lbeta_nonrefl]
U:39 [binder, in Undecidability.Shared.Libs.PSL.Lists.Power]
u:4 [binder, in Undecidability.L.Computability.Acceptability]
U:42 [binder, in Undecidability.Shared.Libs.PSL.Lists.Power]
U:44 [binder, in Undecidability.Shared.Libs.PSL.Lists.Power]
u:44 [binder, in Undecidability.L.Datatypes.LNat]
U:45 [binder, in Undecidability.Shared.Libs.PSL.Lists.Power]
u:46 [binder, in Undecidability.L.Tactics.Lrewrite]
U:46 [binder, in Undecidability.Shared.Libs.PSL.Lists.Power]
u:46 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
U:49 [binder, in Undecidability.Shared.Libs.PSL.Lists.Power]
u:5 [binder, in Undecidability.L.Tactics.Lrewrite]
u:50 [binder, in Undecidability.L.Util.L_facts]
u:50 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
u:51 [binder, in Undecidability.L.Complexity.ResourceMeasures]
U:52 [binder, in Undecidability.Shared.Libs.PSL.Lists.Power]
u:52 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.CC]
u:53 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
u:53 [binder, in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
u:54 [binder, in Undecidability.L.Tactics.Lrewrite]
u:59 [binder, in Undecidability.L.Util.L_facts]
u:59 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.CC]
u:6 [binder, in Undecidability.L.Tactics.LClos_Eval]
u:6 [binder, in Undecidability.L.Computability.Decidability]
U:6 [binder, in Undecidability.Shared.Libs.PSL.Lists.Power]
u:60 [binder, in Undecidability.L.Tactics.Lrewrite]
u:61 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
u:63 [binder, in Undecidability.L.Util.L_facts]
u:63 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
u:63 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.CC]
u:65 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
u:66 [binder, in Undecidability.L.Tactics.Lrewrite]
u:66 [binder, in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
u:7 [binder, in Undecidability.TM.L.CompilerBoolFuns.NaryApp]
U:7 [binder, in Undecidability.Shared.Libs.PSL.Lists.Power]
u:7 [binder, in Undecidability.L.Computability.Rice]
u:70 [binder, in Undecidability.L.Tactics.Lrewrite]
u:70 [binder, in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
u:76 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
u:77 [binder, in Undecidability.L.Tactics.LClos]
u:78 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
u:8 [binder, in Undecidability.L.Complexity.ResourceMeasures]
u:8 [binder, in Undecidability.L.Tactics.Lbeta_nonrefl]
u:81 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.CC]
u:86 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
u:87 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
u:9 [binder, in Undecidability.L.L]
u:9 [binder, in Undecidability.L.Tactics.Lbeta]
u:93 [binder, in Undecidability.L.Util.L_facts]
u:93 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
u:94 [binder, in Undecidability.L.Complexity.ResourceMeasures]
u:99 [binder, in Undecidability.L.Tactics.Reflection]

V

V [abbreviation, in Complexity.NP.Clique.Clique]
V [projection, in Complexity.NP.Clique.UGraph]
valid [inductive, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
valid [inductive, in Complexity.NP.SAT.CookLevin.Subproblems.CC]
validate [definition, in Undecidability.TM.L.CompilerBoolFuns.Compiler_nat_facts]
validate_spec' [lemma, in Undecidability.TM.L.CompilerBoolFuns.Compiler_nat_facts]
validate_spec [lemma, in Undecidability.TM.L.CompilerBoolFuns.Compiler_nat_facts]
validate_spec_help [lemma, in Undecidability.TM.L.CompilerBoolFuns.Compiler_nat_facts]
validB [constructor, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
validB [constructor, in Complexity.NP.SAT.CookLevin.Subproblems.CC]
validComp [inductive, in Undecidability.L.Tactics.LClos]
validCompApp [constructor, in Undecidability.L.Tactics.LClos]
validCompClos [constructor, in Undecidability.L.Tactics.LClos]
validComp_closed [lemma, in Undecidability.L.Tactics.LClos]
validComp_step [lemma, in Undecidability.L.Tactics.LClos]
validDirect [inductive, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
validDirect [inductive, in Complexity.NP.SAT.CookLevin.Subproblems.CC]
validDirectB [constructor, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
validDirectB [constructor, in Complexity.NP.SAT.CookLevin.Subproblems.CC]
validDirectS [constructor, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
validDirectS [constructor, in Complexity.NP.SAT.CookLevin.Subproblems.CC]
validDirect_valid [lemma, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
validDirect_valid [lemma, in Complexity.NP.SAT.CookLevin.Subproblems.CC]
validEnv [definition, in Undecidability.L.Tactics.LClos]
validEnv_cons [lemma, in Undecidability.L.Tactics.LClos]
validEnv' [definition, in Undecidability.L.Tactics.LClos]
validEnv'_cons [lemma, in Undecidability.L.Tactics.LClos]
validExplicit [definition, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
validExplicit [definition, in Complexity.NP.SAT.CookLevin.Subproblems.CC]
validFlatConf [definition, in Complexity.L.TM.TMunflatten]
validFlatConf_step [lemma, in Complexity.L.TM.TMflatComp]
validFlatTape [definition, in Complexity.L.TM.TMunflatten]
validFlatTM [definition, in Complexity.L.TM.TMunflatten]
validFlatTrans [record, in Complexity.L.TM.TMunflatten]
validPreludeInitial [abbreviation, in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
validPreludeInitial [definition, in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
validS [constructor, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
validS [constructor, in Complexity.NP.SAT.CookLevin.Subproblems.CC]
validSA [constructor, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
validSA [constructor, in Complexity.NP.SAT.CookLevin.Subproblems.CC]
validX:2 [binder, in Complexity.Complexity.Subtypes]
validX:45 [binder, in Complexity.Complexity.Subtypes]
validX:57 [binder, in Complexity.Complexity.Subtypes]
validY:25 [binder, in Complexity.Complexity.Subtypes]
validY:34 [binder, in Complexity.Complexity.Subtypes]
validY:59 [binder, in Complexity.Complexity.Subtypes]
valid_liftOrig_isOrigString [lemma, in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
valid_relpower_homomorphism_iff [lemma, in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
valid_relpower_homomorphism2 [lemma, in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
valid_relpower_homomorphism1 [lemma, in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
valid_homomorphism_iff [lemma, in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
valid_homomorphism2 [lemma, in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
valid_homomorphism1 [lemma, in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
valid_agree [lemma, in Complexity.NP.SAT.CookLevin.Reductions.TCC_to_CC]
valid_flat_isFlatListOf_invariant [lemma, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
valid_flat_agree [lemma, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
valid_congruent [lemma, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
valid_monotonous [lemma, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
valid_iff [lemma, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
valid_base [lemma, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
valid_length_inv [lemma, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
valid_vacuous [lemma, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
valid_flat_isFlatListOf_invariant [lemma, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
valid_flat_agree [lemma, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
valid_list_ofFlatType_invariant [lemma, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
valid_conc_inv [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
valid_coversHeadInd_center [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
valid_reprConfig_unfold [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
valid_cards_equivalent [lemma, in Complexity.NP.SAT.CookLevin.Subproblems.CC]
valid_cards_monotonous [lemma, in Complexity.NP.SAT.CookLevin.Subproblems.CC]
valid_iff [lemma, in Complexity.NP.SAT.CookLevin.Subproblems.CC]
valid_multiple_of_offset [lemma, in Complexity.NP.SAT.CookLevin.Subproblems.CC]
valid_vacuous [lemma, in Complexity.NP.SAT.CookLevin.Subproblems.CC]
valid_length_inv [lemma, in Complexity.NP.SAT.CookLevin.Subproblems.CC]
valuation_one_union [definition, in Undecidability.Shared.Libs.DLW.Utils.interval]
valuation_union [definition, in Undecidability.Shared.Libs.DLW.Utils.interval]
value:141 [binder, in Undecidability.TM.Univ.LowLevel]
var [abbreviation, in Complexity.NP.SAT.SharedSAT]
var [constructor, in Undecidability.L.L]
var [abbreviation, in Complexity.NP.SAT.SAT]
varInClause [definition, in Complexity.NP.SAT.SAT]
varInCnf [definition, in Complexity.NP.SAT.SAT]
varInFormuAndL [constructor, in Complexity.NP.SAT.FSAT.FSAT]
varInFormula [inductive, in Complexity.NP.SAT.FSAT.FSAT]
varInFormulaAndR [constructor, in Complexity.NP.SAT.FSAT.FSAT]
varInFormulaNot [constructor, in Complexity.NP.SAT.FSAT.FSAT]
varInFormulaOrL [constructor, in Complexity.NP.SAT.FSAT.FSAT]
varInFormulaOrR [constructor, in Complexity.NP.SAT.FSAT.FSAT]
varInFormulaV [constructor, in Complexity.NP.SAT.FSAT.FSAT]
varInLiteral [definition, in Complexity.NP.SAT.SAT]
varsOfClause [definition, in Complexity.NP.SAT.SAT_inNP]
varsOfClause_size [lemma, in Complexity.NP.SAT.SAT_inNP]
varsOfClause_correct [lemma, in Complexity.NP.SAT.SAT_inNP]
varsOfCnf [definition, in Complexity.NP.SAT.SAT_inNP]
varsOfCnf_size [lemma, in Complexity.NP.SAT.SAT_inNP]
varsOfCnf_correct [lemma, in Complexity.NP.SAT.SAT_inNP]
varsOfLiteral [definition, in Complexity.NP.SAT.SAT_inNP]
varsOfLiteral_size [lemma, in Complexity.NP.SAT.SAT_inNP]
varsOfLiteral_correct [lemma, in Complexity.NP.SAT.SAT_inNP]
Vars:321 [binder, in Undecidability.L.Tactics.Reflection]
Vars:323 [binder, in Undecidability.L.Tactics.Reflection]
varT [constructor, in Undecidability.L.AbstractMachines.FlatPro.ProgramsDef]
Va:40 [binder, in Complexity.NP.Clique.kSAT_to_FlatClique]
Vb:41 [binder, in Complexity.NP.Clique.kSAT_to_FlatClique]
Vcnf [definition, in Complexity.NP.Clique.kSAT_to_Clique]
Vcnf_inhabitated [lemma, in Complexity.NP.Clique.kSAT_to_Clique]
Vcons [section, in Complexity.NP.TM.LM_to_mTM]
vec [abbreviation, in Undecidability.Shared.Libs.DLW.Vec.vec]
vec [abbreviation, in Undecidability.Shared.Libs.DLW.Vec.vec]
vec [library]
VecToListCoercion [module, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
vector [section, in Undecidability.Shared.Libs.DLW.Vec.vec]
VectorDupfree [library]
VectorFin [library]
VectorNotations2 [module, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
_ [@ _ ] (vector_scope) [notation, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
[ | _ ; _ ; .. ; _ | ] (vector_scope) [notation, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
[ | _ | ] (vector_scope) [notation, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
_ ::: _ (vector_scope) [notation, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
[ | | ] (vector_scope) [notation, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
VectorPrelim [library]
Vectors [library]
vector_drop [definition, in Complexity.TM.PrettyBounds.M2MBounds]
Vector_nth_R [lemma, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
Vector_nth_L [lemma, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
vector_nth_rev [lemma, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
vector_nth_rev_append_tail_l [lemma, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
vector_nth_rev_append_tail_r [lemma, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
vector_nth_rev_append_tail_r' [lemma, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
vector_fold_left_right [lemma, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
vector_fold_left_to_list [lemma, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
vector_fold_right_to_list [lemma, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
vector_map_to_list [lemma, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
vector_rev_to_list [lemma, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
vector_rev_append_tail_to_list [lemma, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
vector_to_list_length [lemma, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
vector_to_list_inj [lemma, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
vector_eqb_spec [lemma, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
Vector_in_app [lemma, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
Vector_map_app [lemma, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
Vector_eq_dec [instance, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
Vector_map_tabulate [lemma, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
Vector_tabulate_const [lemma, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
vector_to_list_inj [lemma, in Undecidability.TM.Single.StepTM]
vector_app_to_list [lemma, in Undecidability.TM.Util.VectorPrelim]
vector_nth_error_fin [lemma, in Undecidability.TM.Util.VectorPrelim]
vector_nth_error_nat [lemma, in Undecidability.TM.Util.VectorPrelim]
vector_to_list_In [lemma, in Undecidability.TM.Util.VectorPrelim]
vector_to_list_map2_eta [lemma, in Undecidability.TM.Util.VectorPrelim]
vector_to_list_eta [lemma, in Undecidability.TM.Util.VectorPrelim]
vector_to_list_cast [lemma, in Undecidability.TM.Util.VectorPrelim]
vector_to_list_map [lemma, in Undecidability.TM.Util.VectorPrelim]
vector_to_list_length [lemma, in Undecidability.TM.Util.VectorPrelim]
vector_to_list_correct [lemma, in Undecidability.TM.Util.VectorPrelim]
vector_to_list [definition, in Undecidability.TM.Util.VectorPrelim]
Vector_finTypeC [instance, in Undecidability.Shared.Libs.PSL.FiniteTypes.VectorFin]
Vector_pow [definition, in Undecidability.Shared.Libs.PSL.FiniteTypes.VectorFin]
vector_to_list_length [lemma, in Complexity.L.TM.TMunflatten]
Vector_of_list_length_eq [lemma, in Complexity.L.TM.TMunflatten]
Vector_of_list_length [definition, in Complexity.L.TM.TMunflatten]
vector_enc_bool [instance, in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
vector_1_eta [lemma, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
vector_sum_monotone_plus' [lemma, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
vector_sum_monotone_plus [lemma, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
vector_sum_monotone [lemma, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
vector_to_list_sum [lemma, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
vector_sum_shift [lemma, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
vector_sum [definition, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
vector_to_list_cons [lemma, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
vector_to_list_nil [lemma, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
vector_const_to_list [lemma, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
Vector_dupfree_app [lemma, in Undecidability.Shared.Libs.PSL.Vectors.VectorDupfree]
vector_tl_nth [lemma, in Undecidability.TM.Lifting.LiftTapes]
vector_hd_nth [lemma, in Undecidability.TM.Lifting.LiftTapes]
Vector_map2_ext [lemma, in Undecidability.TM.Util.TM_facts]
vector_cast_2 [lemma, in Undecidability.TM.Single.EncodeTapes]
vector_cast_ext [lemma, in Undecidability.TM.Single.EncodeTapes]
vector_cast_refl [lemma, in Undecidability.TM.Single.EncodeTapes]
vector.eq_X_dec [variable, in Undecidability.Shared.Libs.DLW.Vec.vec]
vector.vec_head_tail_prop [variable, in Undecidability.Shared.Libs.DLW.Vec.vec]
vector.vec_head_tail_type [variable, in Undecidability.Shared.Libs.DLW.Vec.vec]
vector.vec_decomp_type [variable, in Undecidability.Shared.Libs.DLW.Vec.vec]
vector.x [variable, in Undecidability.Shared.Libs.DLW.Vec.vec]
vector.X [variable, in Undecidability.Shared.Libs.DLW.Vec.vec]
vect_in_map_iff [lemma, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
vect_in_map [lemma, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
vect_nth_In' [lemma, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
vect_nth_In [lemma, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
vect_map_injective [lemma, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
vec_pos_fun2vec [lemma, in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_map_list_plus [lemma, in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_map_list_one [lemma, in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_map_list_zero [lemma, in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_map_list [definition, in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_map_list.X [variable, in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_map_list [section, in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_nat_induction [lemma, in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_nat_induction.HP2 [variable, in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_nat_induction.HP1 [variable, in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_nat_induction.HP0 [variable, in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_nat_induction.P [variable, in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_nat_induction.n [variable, in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_nat_induction [section, in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_sum_is_nzero [lemma, in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_sum_is_zero [lemma, in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_sum_one [lemma, in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_sum_zero [lemma, in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_sum_plus [lemma, in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_sum [definition, in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_change_pred [lemma, in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_change_succ [lemma, in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_plus_cons [lemma, in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_one_nxt [lemma, in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_one_fst [lemma, in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_zero_S [lemma, in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_one_spec_neq [lemma, in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_one_spec_eq [lemma, in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_one [definition, in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_plus_is_zero [lemma, in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_plus_assoc [lemma, in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_plus_comm [lemma, in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_zero_spec [lemma, in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_zero_plus [lemma, in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_pos_plus [lemma, in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_zero [definition, in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_plus [definition, in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_plus.n [variable, in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_plus [section, in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_map_set_pos [lemma, in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_pos_map [lemma, in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_map2 [definition, in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_map2 [section, in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_map_map [lemma, in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_list_vec_map [lemma, in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_map_ext [lemma, in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_in_map_ext [lemma, in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_in_map_vec_map_eq [lemma, in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_in_map [definition, in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_map [definition, in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_map.vec_map_def.f [variable, in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_map.vec_map_def [section, in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_map.Y [variable, in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_map.X [variable, in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_map [section, in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_app_cons [lemma, in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_app_nil [lemma, in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_pos_app_right [lemma, in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_pos_app_left [lemma, in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_split_app [lemma, in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_app_split [lemma, in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_split [definition, in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_app [definition, in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_app_split.m [variable, in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_app_split.n [variable, in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_app_split.X [variable, in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_app_split [section, in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_cons [abbreviation, in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_list_In_iff [lemma, in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_list_inv [lemma, in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_list_iso [lemma, in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_list_length [lemma, in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_list_vec_set_pos [lemma, in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_list_In [lemma, in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_list [definition, in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_eq_dec [definition, in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_change_same [lemma, in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_change_idem [lemma, in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_change_neq [lemma, in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_change_eq [lemma, in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_change [definition, in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_pos_set [lemma, in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_set_pos [definition, in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_pos_ext [lemma, in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_pos1 [lemma, in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_pos_tail [lemma, in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_pos0 [lemma, in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_pos [definition, in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_cons_inv [lemma, in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_head_tail [lemma, in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_0_nil [lemma, in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_tail [definition, in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_head [definition, in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_decomp [definition, in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_nil [abbreviation, in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_search [lemma, in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
vec_case1 [lemma, in Complexity.NP.SAT.CookLevin.Subproblems.SingleTMGenNP]
vec_case1 [lemma, in Complexity.NP.SAT.CookLevin.Subproblems.TM_single]
vec_prod [definition, in Complexity.L.TM.TMflatten]
vec_reif [lemma, in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
vec_reif_t [lemma, in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
vec2fun [definition, in Undecidability.Shared.Libs.DLW.Vec.vec]
vec2fun_fun2vec [lemma, in Undecidability.Shared.Libs.DLW.Vec.vec]
vertexSatisfied [definition, in Complexity.NP.Clique.kSAT_to_Clique]
vertexSatisfied_edge [lemma, in Complexity.NP.Clique.kSAT_to_Clique]
verticesClauseGe [definition, in Complexity.NP.Clique.kSAT_to_Clique]
vertices_repr [lemma, in Complexity.NP.Clique.kSAT_to_FlatClique]
Vf [definition, in Complexity.NP.Clique.kSAT_to_FlatClique]
Void [constructor, in Undecidability.TM.Hoare.HoareRegister]
Void_size [constructor, in Undecidability.TM.Hoare.HoareRegister]
vs:101 [binder, in Undecidability.TM.Single.StepTM]
vs:109 [binder, in Undecidability.TM.Single.StepTM]
vs:180 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
vs:191 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
vs:79 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
vs:86 [binder, in Undecidability.TM.Single.StepTM]
vs:95 [binder, in Undecidability.TM.Single.StepTM]
vx:121 [binder, in Undecidability.TM.Util.Relations]
vX:146 [binder, in Complexity.Complexity.NP]
vy:122 [binder, in Undecidability.TM.Util.Relations]
v':12 [binder, in Complexity.NP.Clique.Clique]
v':12 [binder, in Complexity.NP.TM.M_multi2mono]
v':130 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
V':132 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
v':162 [binder, in Complexity.L.TM.TMunflatten]
V':169 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
v':177 [binder, in Complexity.L.TM.TMunflatten]
v':18 [binder, in Complexity.L.TM.TMflat]
v':184 [binder, in Complexity.L.TM.TMunflatten]
v':188 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
v':19 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_nat_facts]
v':191 [binder, in Complexity.L.TM.TMunflatten]
v':198 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
v':207 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
v':21 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
V':219 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
v':220 [binder, in Complexity.L.TM.TMflatComp]
v':23 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
v':26 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
v':27 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_nat_facts]
v':27 [binder, in Complexity.L.TM.TMflatFun]
v':283 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
v':285 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
v':341 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
v':343 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
v':35 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
V':38 [binder, in Complexity.L.AbstractMachines.AbstractSubstMachine]
v':38 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
V':40 [binder, in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
v':43 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_nat_facts]
v':45 [binder, in Complexity.NP.TM.M_multi2mono]
v':50 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
v':51 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_nat_facts]
v':53 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
v':65 [binder, in Complexity.L.TM.TMunflatten]
v':73 [binder, in Complexity.L.TM.TMunflatten]
v':75 [binder, in Complexity.NP.TM.M_multi2mono]
v':78 [binder, in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
v':8 [binder, in Undecidability.L.Functions.Eval]
V':92 [binder, in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
v0':22 [binder, in Complexity.L.TM.TMflat]
v0':27 [binder, in Complexity.L.TM.TMflat]
v0:104 [binder, in Undecidability.L.Tactics.Reflection]
v0:21 [binder, in Complexity.L.TM.TMflat]
v0:25 [binder, in Complexity.L.TM.TMflat]
v0:37 [binder, in Complexity.NP.TM.M_multi2mono]
v1:100 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
v1:101 [binder, in Complexity.NP.Clique.FlatClique]
v1:149 [binder, in Undecidability.L.Util.L_facts]
V1:15 [binder, in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
v1:15 [binder, in Complexity.NP.Clique.kSAT_to_FlatClique]
v1:15 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
v1:16 [binder, in Complexity.NP.Clique.kSAT_to_Clique]
v1:18 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
V1:2 [binder, in Complexity.NP.Clique.FlatUGraph]
v1:207 [binder, in Undecidability.L.Util.L_facts]
v1:21 [binder, in Complexity.NP.Clique.FlatUGraph]
V1:22 [binder, in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
v1:220 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
v1:226 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
v1:233 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
v1:239 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
v1:24 [binder, in Complexity.NP.Clique.kSAT_to_Clique]
v1:25 [binder, in Complexity.NP.Clique.FlatUGraph]
v1:26 [binder, in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
v1:26 [binder, in Complexity.NP.Clique.FlatClique]
v1:27 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
v1:277 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
v1:280 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
v1:3 [binder, in Complexity.NP.Clique.Clique]
v1:31 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
v1:32 [binder, in Complexity.NP.Clique.kSAT_to_FlatClique]
v1:335 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
v1:338 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
v1:34 [binder, in Complexity.NP.Clique.kSAT_to_Clique]
v1:38 [binder, in Complexity.NP.Clique.kSAT_to_Clique]
v1:39 [binder, in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
v1:4 [binder, in Complexity.NP.Clique.UGraph]
v1:400 [binder, in Undecidability.TM.Util.TM_facts]
v1:42 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
v1:46 [binder, in Complexity.NP.Clique.kSAT_to_FlatClique]
v1:46 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
v1:5 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
v1:5 [binder, in Complexity.NP.Clique.FlatClique]
v1:51 [binder, in Complexity.NP.Clique.FlatClique]
v1:52 [binder, in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
v1:54 [binder, in Complexity.NP.Clique.FlatClique]
v1:55 [binder, in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
v1:57 [binder, in Complexity.NP.Clique.FlatClique]
v1:59 [binder, in Complexity.NP.Clique.FlatUGraph]
V1:61 [binder, in Complexity.NP.Clique.FlatUGraph]
v1:62 [binder, in Complexity.NP.Clique.kSAT_to_FlatClique]
v1:63 [binder, in Undecidability.Shared.Libs.PSL.Vectors.VectorDupfree]
v1:64 [binder, in Complexity.NP.Clique.FlatUGraph]
v1:66 [binder, in Undecidability.TM.Util.TM_facts]
v1:67 [binder, in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
v1:7 [binder, in Complexity.NP.Clique.UGraph]
v1:73 [binder, in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
v1:86 [binder, in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
v1:92 [binder, in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
v1:93 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
v1:97 [binder, in Complexity.NP.Clique.FlatClique]
v2':247 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
v2:101 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
v2:102 [binder, in Complexity.NP.Clique.FlatClique]
V2:11 [binder, in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
v2:150 [binder, in Undecidability.L.Util.L_facts]
v2:16 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
v2:17 [binder, in Complexity.NP.Clique.kSAT_to_FlatClique]
v2:18 [binder, in Complexity.NP.Clique.FlatClique]
v2:18 [binder, in Complexity.NP.Clique.kSAT_to_Clique]
v2:19 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
v2:208 [binder, in Undecidability.L.Util.L_facts]
v2:22 [binder, in Complexity.NP.Clique.FlatUGraph]
v2:221 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
v2:227 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
v2:234 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
v2:240 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
v2:243 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
v2:244 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
v2:25 [binder, in Complexity.NP.Clique.kSAT_to_Clique]
V2:25 [binder, in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
v2:26 [binder, in Complexity.NP.Clique.FlatUGraph]
v2:27 [binder, in Complexity.NP.Clique.FlatClique]
v2:278 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
v2:28 [binder, in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
v2:28 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
v2:281 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
V2:3 [binder, in Complexity.NP.Clique.FlatUGraph]
v2:32 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
v2:33 [binder, in Complexity.NP.Clique.kSAT_to_FlatClique]
v2:336 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
v2:339 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
v2:35 [binder, in Complexity.NP.Clique.kSAT_to_Clique]
v2:39 [binder, in Complexity.NP.Clique.kSAT_to_Clique]
v2:4 [binder, in Complexity.NP.Clique.Clique]
v2:401 [binder, in Undecidability.TM.Util.TM_facts]
v2:41 [binder, in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
v2:43 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
v2:47 [binder, in Complexity.NP.Clique.kSAT_to_FlatClique]
v2:47 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
v2:5 [binder, in Complexity.NP.Clique.UGraph]
v2:52 [binder, in Complexity.NP.Clique.FlatClique]
v2:55 [binder, in Complexity.NP.Clique.FlatClique]
v2:58 [binder, in Complexity.NP.Clique.FlatClique]
v2:59 [binder, in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
v2:6 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
v2:6 [binder, in Complexity.NP.Clique.FlatClique]
v2:60 [binder, in Complexity.NP.Clique.FlatUGraph]
V2:62 [binder, in Complexity.NP.Clique.FlatUGraph]
v2:63 [binder, in Complexity.NP.Clique.kSAT_to_FlatClique]
v2:64 [binder, in Undecidability.Shared.Libs.PSL.Vectors.VectorDupfree]
v2:65 [binder, in Complexity.NP.Clique.FlatUGraph]
v2:67 [binder, in Undecidability.TM.Util.TM_facts]
v2:69 [binder, in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
v2:8 [binder, in Complexity.NP.Clique.UGraph]
v2:89 [binder, in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
v2:94 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
v2:97 [binder, in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
v2:98 [binder, in Complexity.NP.Clique.FlatClique]
v:10 [binder, in Complexity.NP.SAT.SharedSAT]
v:10 [binder, in Complexity.NP.Clique.Clique]
V:10 [binder, in Complexity.L.AbstractMachines.AbstractSubstMachine]
v:10 [binder, in Complexity.NP.TM.M_multi2mono]
V:10 [binder, in Undecidability.TM.Lifting.LiftTapes]
V:10 [binder, in Complexity.L.AbstractMachines.Computable.HeapMachine]
v:100 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_base]
v:100 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
v:100 [binder, in Undecidability.L.Tactics.Reflection]
v:101 [binder, in Complexity.NP.Clique.kSAT_to_Clique]
v:102 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
v:102 [binder, in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
v:102 [binder, in Complexity.NP.Clique.kSAT_to_Clique]
v:102 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
v:103 [binder, in Complexity.NP.Clique.kSAT_to_Clique]
V:104 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
v:105 [binder, in Undecidability.L.Computability.Seval]
V:106 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
v:108 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
v:109 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
v:11 [binder, in Undecidability.TM.L.CompilerBoolFuns.NaryApp]
v:11 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
v:11 [binder, in Undecidability.L.Computability.Seval]
v:11 [binder, in Undecidability.TM.Util.VectorPrelim]
v:11 [binder, in Undecidability.Shared.Libs.DLW.Utils.crt]
v:11 [binder, in Complexity.NP.TM.M_multi2mono]
v:110 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
V:111 [binder, in Complexity.NP.Clique.FlatClique]
V:112 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
v:112 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
V:112 [binder, in Complexity.NP.Clique.FlatClique]
V:114 [binder, in Complexity.NP.Clique.FlatClique]
V:114 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
v:116 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
V:116 [binder, in Complexity.NP.Clique.FlatClique]
v:118 [binder, in Undecidability.L.Computability.Seval]
V:119 [binder, in Complexity.NP.Clique.FlatClique]
v:119 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
v:12 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
v:12 [binder, in Complexity.NP.SAT.SAT_inNP]
v:121 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
V:122 [binder, in Complexity.NP.Clique.FlatClique]
v:124 [binder, in Undecidability.L.Tactics.ComputableTime]
v:125 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
v:128 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
v:129 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
v:129 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
v:129 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
v:131 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
v:132 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
v:133 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
v:133 [binder, in Complexity.NP.Clique.kSAT_to_Clique]
V:137 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
v:138 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
v:138 [binder, in Undecidability.L.Tactics.ComputableTime]
v:14 [binder, in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
v:14 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
v:14 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
V:142 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
v:146 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
v:147 [binder, in Undecidability.TM.Lifting.LiftTapes]
v:147 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
v:148 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
v:149 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
V:149 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
v:15 [binder, in Undecidability.TM.L.CompilerBoolFuns.NaryApp]
v:15 [binder, in Undecidability.L.TM.TapeFuns]
v:15 [binder, in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
V:15 [binder, in Complexity.L.AbstractMachines.AbstractSubstMachine]
v:15 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
v:150 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
v:151 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
v:152 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
v:153 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
v:153 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
v:153 [binder, in Undecidability.Shared.Libs.DLW.Utils.php]
v:153 [binder, in Undecidability.TM.Lifting.LiftTapes]
v:154 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
V:155 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
v:155 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
v:157 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
v:157 [binder, in Undecidability.TM.Lifting.LiftTapes]
v:158 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
v:16 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
v:16 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
v:16 [binder, in Undecidability.TM.Util.VectorPrelim]
v:16 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
v:16 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.VectorFin]
v:16 [binder, in Undecidability.L.TM.TapeFuns]
v:16 [binder, in Undecidability.L.Computability.MuRec]
v:161 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
v:162 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
v:164 [binder, in Complexity.L.TM.TMunflatten]
V:165 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
v:167 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
V:167 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
v:168 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
v:17 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
V:17 [binder, in Complexity.NP.Clique.FlatUGraph]
v:17 [binder, in Complexity.L.TM.TMflat]
v:17 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
v:173 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
v:174 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
V:175 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
v:176 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
v:176 [binder, in Complexity.L.TM.TMunflatten]
v:177 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
v:178 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
v:18 [binder, in Complexity.NP.Clique.FlatUGraph]
v:18 [binder, in Undecidability.Shared.Libs.DLW.Utils.crt]
v:18 [binder, in Undecidability.L.Computability.Decidability]
v:18 [binder, in Complexity.NP.TM.M_multi2mono]
v:180 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
v:181 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
V:181 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
v:183 [binder, in Complexity.L.TM.TMunflatten]
V:185 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
v:186 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
v:187 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
v:189 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
v:19 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
v:19 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
v:19 [binder, in Complexity.NP.SAT.FSAT.FSAT]
v:19 [binder, in Undecidability.L.L]
V:19 [binder, in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
v:190 [binder, in Complexity.L.TM.TMunflatten]
V:192 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
v:197 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
v:197 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
v:197 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
v:2 [binder, in Complexity.NP.SAT.SharedSAT]
V:2 [binder, in Complexity.L.AbstractMachines.Computable.UnivDecTime]
V:2 [binder, in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
v:20 [binder, in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
v:20 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
V:20 [binder, in Complexity.L.AbstractMachines.Computable.HeapMachine]
v:20 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
v:201 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
V:201 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
V:202 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
V:204 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
v:206 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
v:208 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
v:21 [binder, in Undecidability.TM.L.CompilerBoolFuns.NaryApp]
v:21 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
v:21 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
v:21 [binder, in Undecidability.L.Tactics.ComputableTime]
v:21 [binder, in Undecidability.TM.Util.VectorPrelim]
V:21 [binder, in Complexity.NP.Clique.FlatClique]
v:21 [binder, in Undecidability.L.Computability.Decidability]
v:21 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TM_single]
V:210 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
v:213 [binder, in Undecidability.L.Util.L_facts]
v:213 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
v:213 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
V:213 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
v:214 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
v:217 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
v:218 [binder, in Undecidability.L.Util.L_facts]
v:218 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
V:218 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
v:22 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
v:22 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
v:22 [binder, in Complexity.NP.SAT.SAT]
v:22 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
v:221 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
v:222 [binder, in Complexity.L.TM.TMflatComp]
v:223 [binder, in Undecidability.L.Util.L_facts]
V:223 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
V:223 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
V:228 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
V:23 [binder, in Complexity.NP.Clique.FlatClique]
v:23 [binder, in Undecidability.L.Computability.MuRec]
v:23 [binder, in Undecidability.L.Tactics.Computable]
v:230 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
V:233 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
V:237 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
v:239 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
v:24 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
v:24 [binder, in Undecidability.TM.PrettyBounds.SizeBounds]
v:24 [binder, in Undecidability.TM.Util.VectorPrelim]
v:24 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
v:24 [binder, in Complexity.NP.SAT.FSAT.FSAT]
v:24 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
v:240 [binder, in Undecidability.L.Util.L_facts]
V:241 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
V:246 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
v:247 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
v:248 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
v:25 [binder, in Undecidability.TM.Compound.TMTac]
V:25 [binder, in Complexity.L.AbstractMachines.AbstractSubstMachine]
v:25 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
v:25 [binder, in Complexity.L.TM.TMflatFun]
v:250 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
v:259 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
V:26 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
v:26 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
v:26 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_nat_facts]
V:26 [binder, in Undecidability.Shared.Libs.PSL.Vectors.VectorDupfree]
v:26 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
v:261 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
v:265 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
v:268 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
V:27 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds_Loop]
v:270 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
v:273 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
v:275 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
v:276 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
v:276 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
v:278 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
v:279 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
v:28 [binder, in Undecidability.L.Tactics.Lrewrite]
v:28 [binder, in Undecidability.L.L]
v:28 [binder, in Complexity.NP.Clique.FlatClique]
v:281 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
v:282 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
v:284 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
v:284 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
v:285 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
v:286 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
v:287 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
v:288 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
v:29 [binder, in Undecidability.L.Tactics.Lrewrite]
v:29 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
v:29 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_nat_facts]
v:291 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
v:2931 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
v:2932 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
v:2933 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
v:2934 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
v:298 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
v:3 [binder, in Undecidability.TM.Util.VectorPrelim]
V:3 [binder, in Complexity.NP.Clique.FlatClique]
v:3 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
V:30 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
V:30 [binder, in Complexity.NP.Clique.FlatUGraph]
v:30 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.SingleTMGenNP]
v:30 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
v:301 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
v:306 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
v:307 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
v:311 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
v:311 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
v:314 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
v:317 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
v:318 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
v:32 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
V:32 [binder, in Complexity.NP.Clique.FlatUGraph]
v:32 [binder, in Undecidability.Shared.Libs.DLW.Utils.crt]
v:32 [binder, in Complexity.NP.TM.M_multi2mono]
v:320 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
v:321 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
v:322 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
v:328 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
v:33 [binder, in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
v:33 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_quotient]
V:33 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds_Loop]
v:33 [binder, in Complexity.NP.Clique.FlatUGraph]
V:33 [binder, in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
v:330 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
v:334 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
v:337 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
v:338 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
v:34 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
v:340 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
v:341 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
v:342 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
v:344 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
v:345 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
V:35 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
v:35 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_quotient]
v:35 [binder, in Undecidability.TM.L.CompilerBoolFuns.NaryApp]
v:35 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
v:35 [binder, in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
v:35 [binder, in Complexity.NP.TM.M_multi2mono]
v:357 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
v:358 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
v:36 [binder, in Undecidability.TM.Util.VectorPrelim]
v:36 [binder, in Undecidability.Shared.Libs.DLW.Utils.interval]
v:368 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
v:37 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_nat_facts]
v:37 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
v:38 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
v:38 [binder, in Complexity.NP.SAT.FSAT.FSAT]
v:38 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
v:39 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
v:39 [binder, in Undecidability.TM.Single.EncodeTapes]
v:390 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
v:394 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
v:4 [binder, in Complexity.NP.SAT.SharedSAT]
v:4 [binder, in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
V:40 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
v:40 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
v:40 [binder, in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
v:40 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
V:41 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
v:41 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_nat_facts]
v:41 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
v:412 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
v:416 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
v:419 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
v:42 [binder, in Undecidability.TM.L.CompilerBoolFuns.NaryApp]
v:420 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
v:43 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
V:43 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
v:44 [binder, in Complexity.NP.TM.M_multi2mono]
v:45 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
v:45 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
v:45 [binder, in Undecidability.TM.Single.EncodeTapes]
V:46 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
V:46 [binder, in Complexity.NP.Clique.FlatUGraph]
V:46 [binder, in Complexity.L.AbstractMachines.AbstractSubstMachine]
V:47 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
v:47 [binder, in Complexity.NP.Clique.FlatUGraph]
v:47 [binder, in Complexity.NP.SAT.SAT_inNP]
v:47 [binder, in Complexity.L.TM.TMunflatten]
V:48 [binder, in Complexity.NP.Clique.FlatUGraph]
v:48 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
v:48 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
V:48 [binder, in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
v:48 [binder, in Complexity.NP.SAT.SAT]
v:49 [binder, in Undecidability.TM.L.CompilerBoolFuns.NaryApp]
v:49 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
v:49 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
v:49 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_nat_facts]
v:49 [binder, in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
v:49 [binder, in Complexity.NP.Clique.kSAT_to_Clique]
v:49 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
v:5 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
v:5 [binder, in Undecidability.L.Datatypes.LOptions]
V:5 [binder, in Undecidability.TM.Lifting.LiftTapes]
V:51 [binder, in Complexity.NP.Clique.FlatUGraph]
v:51 [binder, in Complexity.NP.SAT.SAT]
v:51 [binder, in Undecidability.TM.Single.EncodeTapes]
v:52 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
v:52 [binder, in Complexity.NP.Clique.FlatUGraph]
v:52 [binder, in Complexity.NP.SAT.FSAT.FSAT]
V:52 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
v:52 [binder, in Complexity.NP.TM.M_multi2mono]
v:52 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler]
v:52 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
v:53 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.CC]
v:54 [binder, in Undecidability.TM.L.CompilerBoolFuns.NaryApp]
V:54 [binder, in Complexity.NP.Clique.FlatUGraph]
v:54 [binder, in Complexity.NP.SAT.SAT]
V:55 [binder, in Complexity.L.AbstractMachines.FunctionalDefinitions]
v:55 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
v:56 [binder, in Complexity.NP.SAT.SAT_inNP]
v:56 [binder, in Complexity.NP.Clique.kSAT_to_Clique]
V:56 [binder, in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
v:57 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
v:57 [binder, in Undecidability.TM.Single.EncodeTapes]
v:59 [binder, in Undecidability.TM.L.CompilerBoolFuns.NaryApp]
v:59 [binder, in Undecidability.TM.Util.TM_facts]
v:59 [binder, in Complexity.NP.SAT.SAT]
v:6 [binder, in Undecidability.L.Functions.Eval]
v:6 [binder, in Complexity.NP.SAT.SAT_inNP]
v:6 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler]
v:60 [binder, in Complexity.NP.Clique.kSAT_to_Clique]
v:60 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler]
v:60 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.CC]
v:60 [binder, in Undecidability.TM.Single.EncodeTapes]
V:61 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachine]
V:61 [binder, in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
v:61 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler]
v:62 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
v:62 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
v:62 [binder, in Complexity.L.TM.TMflatten]
v:62 [binder, in Complexity.NP.SAT.SAT]
V:63 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
v:63 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
V:63 [binder, in Complexity.L.AbstractMachines.FunctionalDefinitions]
v:64 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
v:64 [binder, in Complexity.L.TM.TMunflatten]
v:64 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.CC]
v:64 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
V:65 [binder, in Undecidability.TM.Lifting.LiftTapes]
v:66 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
v:66 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
V:66 [binder, in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
v:69 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
v:7 [binder, in Complexity.NP.SAT.SharedSAT]
v:7 [binder, in Undecidability.L.Tactics.LClos_Eval]
V:7 [binder, in Undecidability.Shared.Libs.PSL.Vectors.VectorDupfree]
v:7 [binder, in Undecidability.TM.Util.TM_facts]
v:70 [binder, in Complexity.NP.SAT.SAT_inNP]
v:71 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
v:71 [binder, in Complexity.NP.Clique.kSAT_to_Clique]
v:72 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
v:73 [binder, in Complexity.NP.SAT.SAT_inNP]
v:73 [binder, in Undecidability.L.Tactics.Computable]
V:74 [binder, in Complexity.NP.Clique.FlatUGraph]
v:74 [binder, in Complexity.NP.TM.M_multi2mono]
V:74 [binder, in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
v:75 [binder, in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
v:75 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
V:75 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
V:75 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachine]
v:75 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
v:76 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
v:76 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
v:77 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
v:77 [binder, in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
V:77 [binder, in Undecidability.TM.Lifting.LiftTapes]
V:78 [binder, in Complexity.NP.Clique.FlatClique]
v:78 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler]
v:8 [binder, in Undecidability.TM.Util.VectorPrelim]
v:8 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_nat_facts]
V:8 [binder, in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
v:80 [binder, in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
v:81 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
V:82 [binder, in Undecidability.TM.Lifting.LiftTapes]
v:82 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.CC]
v:83 [binder, in Undecidability.L.Tactics.Computable]
v:83 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler]
V:86 [binder, in Undecidability.TM.Lifting.LiftTapes]
v:87 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
v:87 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
V:88 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
v:88 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
V:88 [binder, in Undecidability.TM.Lifting.LiftTapes]
v:88 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
v:89 [binder, in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
V:89 [binder, in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
v:89 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler]
v:9 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
v:9 [binder, in Complexity.NP.SAT.SAT_inNP]
v:91 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
v:91 [binder, in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
v:91 [binder, in Complexity.NP.Clique.kSAT_to_Clique]
v:92 [binder, in Undecidability.L.Util.L_facts]
v:92 [binder, in Undecidability.L.Tactics.Computable]
v:94 [binder, in Complexity.NP.SAT.SAT_inNP]
v:95 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
v:95 [binder, in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
v:95 [binder, in Complexity.NP.Clique.kSAT_to_Clique]
v:95 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler]
v:97 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
v:98 [binder, in Complexity.NP.Clique.kSAT_to_Clique]
v:99 [binder, in Undecidability.L.Tactics.ComputableTime]

W

wf_chains [lemma, in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
wf_chains.HR [variable, in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
wf_chains.R [variable, in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
wf_chains.X [variable, in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
wf_chains [section, in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
wf_rincl_fin [lemma, in Undecidability.Shared.Libs.DLW.Wf.wf_incl]
wf_sincl [lemma, in Undecidability.Shared.Libs.DLW.Wf.wf_incl]
wf_strict_order_finite [lemma, in Undecidability.Shared.Libs.DLW.Wf.wf_finite]
wf_strict_order_finite.Rtrans [variable, in Undecidability.Shared.Libs.DLW.Wf.wf_finite]
wf_strict_order_finite.Rirrefl [variable, in Undecidability.Shared.Libs.DLW.Wf.wf_finite]
wf_strict_order_finite.R [variable, in Undecidability.Shared.Libs.DLW.Wf.wf_finite]
wf_strict_order_finite.HX [variable, in Undecidability.Shared.Libs.DLW.Wf.wf_finite]
wf_strict_order_finite.X [variable, in Undecidability.Shared.Libs.DLW.Wf.wf_finite]
wf_strict_order_finite [section, in Undecidability.Shared.Libs.DLW.Wf.wf_finite]
wf_strict_order_list [lemma, in Undecidability.Shared.Libs.DLW.Wf.wf_finite]
wf_strict_order_list.Hm [variable, in Undecidability.Shared.Libs.DLW.Wf.wf_finite]
wf_strict_order_list.m [variable, in Undecidability.Shared.Libs.DLW.Wf.wf_finite]
wf_strict_order_list.Rtrans [variable, in Undecidability.Shared.Libs.DLW.Wf.wf_finite]
wf_strict_order_list.Rirrefl [variable, in Undecidability.Shared.Libs.DLW.Wf.wf_finite]
wf_strict_order_list.R [variable, in Undecidability.Shared.Libs.DLW.Wf.wf_finite]
wf_strict_order_list.X [variable, in Undecidability.Shared.Libs.DLW.Wf.wf_finite]
wf_strict_order_list [section, in Undecidability.Shared.Libs.DLW.Wf.wf_finite]
wf_chains [library]
wf_incl [library]
wf_finite [library]
wf:129 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.CC]
WHILE [abbreviation, in Undecidability.TM.Combinators.While]
While [definition, in Undecidability.TM.Combinators.While]
While [section, in Undecidability.TM.Combinators.While]
While [library]
WhileCoInduction [lemma, in Undecidability.TM.Combinators.While]
WhileCoInduction [section, in Undecidability.TM.Combinators.While]
WhileCoInduction [section, in Undecidability.TM.Combinators.StateWhile]
WhileCoInduction.F [variable, in Undecidability.TM.Combinators.While]
WhileCoInduction.F1 [variable, in Undecidability.TM.Combinators.StateWhile]
WhileCoInduction.F2 [variable, in Undecidability.TM.Combinators.StateWhile]
WhileCoInduction.n [variable, in Undecidability.TM.Combinators.While]
WhileCoInduction.n [variable, in Undecidability.TM.Combinators.StateWhile]
WhileCoInduction.R [variable, in Undecidability.TM.Combinators.While]
WhileCoInduction.R [variable, in Undecidability.TM.Combinators.StateWhile]
WhileCoInduction.sig [variable, in Undecidability.TM.Combinators.While]
WhileCoInduction.sig [variable, in Undecidability.TM.Combinators.StateWhile]
WhileCoInduction.T [variable, in Undecidability.TM.Combinators.While]
WhileCoInduction.T [variable, in Undecidability.TM.Combinators.StateWhile]
WhileCoInduction.T' [variable, in Undecidability.TM.Combinators.While]
WhileCoInduction.T' [variable, in Undecidability.TM.Combinators.StateWhile]
WhileInduction [lemma, in Undecidability.TM.Combinators.While]
WhileInduction [section, in Undecidability.TM.Combinators.While]
WhileInduction.F [variable, in Undecidability.TM.Combinators.While]
WhileInduction.n [variable, in Undecidability.TM.Combinators.While]
WhileInduction.R1 [variable, in Undecidability.TM.Combinators.While]
WhileInduction.R2 [variable, in Undecidability.TM.Combinators.While]
WhileInduction.sig [variable, in Undecidability.TM.Combinators.While]
WhileTM [definition, in Undecidability.TM.Combinators.While]
While_Rel' [definition, in Undecidability.TM.Combinators.While]
While_TerminatesIn [lemma, in Undecidability.TM.Combinators.While]
While_T_intro [constructor, in Undecidability.TM.Combinators.While]
While_T [inductive, in Undecidability.TM.Combinators.While]
While_TerminatesIn_ind [lemma, in Undecidability.TM.Combinators.While]
While_Realise [lemma, in Undecidability.TM.Combinators.While]
While_Rel''_loop [constructor, in Undecidability.TM.Combinators.While]
While_Rel''_one [constructor, in Undecidability.TM.Combinators.While]
While_Rel [inductive, in Undecidability.TM.Combinators.While]
While_merge_term [lemma, in Undecidability.TM.Combinators.While]
While_merge_repeat [lemma, in Undecidability.TM.Combinators.While]
While_split_term [lemma, in Undecidability.TM.Combinators.While]
While_split_repeat [lemma, in Undecidability.TM.Combinators.While]
While_split [lemma, in Undecidability.TM.Combinators.While]
While_trans_repeat [lemma, in Undecidability.TM.Combinators.While]
While_part [definition, in Undecidability.TM.Combinators.While]
While_trans [definition, in Undecidability.TM.Combinators.While]
While_SpecTReg' [lemma, in Undecidability.TM.Hoare.HoareCombinators]
While_SpecTReg [lemma, in Undecidability.TM.Hoare.HoareCombinators]
While_SpecT [lemma, in Undecidability.TM.Hoare.HoareCombinators]
While_SpecReg [lemma, in Undecidability.TM.Hoare.HoareCombinators]
While_Spec [lemma, in Undecidability.TM.Hoare.HoareCombinators]
While_Spec0 [lemma, in Undecidability.TM.Hoare.HoareCombinators]
While.defF [variable, in Undecidability.TM.Combinators.While]
While.F [variable, in Undecidability.TM.Combinators.While]
While.n [variable, in Undecidability.TM.Combinators.While]
While.pM [variable, in Undecidability.TM.Combinators.While]
While.R [variable, in Undecidability.TM.Combinators.While]
While.sig [variable, in Undecidability.TM.Combinators.While]
While.While_TerminatesIn_coind.T [variable, in Undecidability.TM.Combinators.While]
While.While_TerminatesIn_coind [section, in Undecidability.TM.Combinators.While]
While.While_TerminatesIn.T' [variable, in Undecidability.TM.Combinators.While]
While.While_TerminatesIn.T [variable, in Undecidability.TM.Combinators.While]
While.While_TerminatesIn [section, in Undecidability.TM.Combinators.While]
width [abbreviation, in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
width [projection, in Complexity.NP.SAT.CookLevin.Subproblems.BinaryCC]
width [abbreviation, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
width [abbreviation, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
width [abbreviation, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
width [abbreviation, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
width [projection, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
width [abbreviation, in Complexity.NP.SAT.CookLevin.Reductions.CC_to_BinaryCC]
width [projection, in Complexity.NP.SAT.CookLevin.Subproblems.CC]
width:161 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
width:163 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
width:165 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
width:17 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.CC]
width:20 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.CC]
withSpace [definition, in Undecidability.TM.Hoare.HoareRegister]
withSpace_single [definition, in Undecidability.TM.Hoare.HoareRegister]
wo [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
workaround [section, in Undecidability.L.Complexity.UpToCNary]
workaround1 [instance, in Undecidability.L.Complexity.UpToCNary]
workaround2 [instance, in Undecidability.L.Complexity.UpToCNary]
workarround [lemma, in Undecidability.L.Tactics.ComputableDemo]
wr [definition, in Undecidability.TM.TM]
wr [definition, in Undecidability.TM.SBTM]
Write [definition, in Undecidability.TM.Basic.Mono]
WriteMove [definition, in Undecidability.TM.Basic.Mono]
WriteMove_Sem [lemma, in Undecidability.TM.Basic.Mono]
WriteMove_Rel [definition, in Undecidability.TM.Basic.Mono]
writeNatAux [definition, in Undecidability.Shared.Libs.DLW.Utils.utils_string]
writeNAux [definition, in Undecidability.Shared.Libs.DLW.Utils.utils_string]
WriteNumber [definition, in Undecidability.TM.Code.BinNumbers.NTM]
WriteNumber_Sem [lemma, in Undecidability.TM.Code.BinNumbers.NTM]
WriteNumber_steps [definition, in Undecidability.TM.Code.BinNumbers.NTM]
WriteNumber_Rel [definition, in Undecidability.TM.Code.BinNumbers.NTM]
WriteString [definition, in Undecidability.TM.Compound.WriteString]
WriteString [library]
WriteString_L_current [lemma, in Undecidability.TM.Compound.WriteString]
WriteString_L_right [lemma, in Undecidability.TM.Compound.WriteString]
WriteString_L_left [lemma, in Undecidability.TM.Compound.WriteString]
WriteString_L_local [lemma, in Undecidability.TM.Compound.WriteString]
WriteString_Sem [lemma, in Undecidability.TM.Compound.WriteString]
WriteString_Rel [definition, in Undecidability.TM.Compound.WriteString]
WriteString_fix_Sem [lemma, in Undecidability.TM.Compound.WriteString]
WriteString_steps [definition, in Undecidability.TM.Compound.WriteString]
WriteString_sem_fix [definition, in Undecidability.TM.Compound.WriteString]
WriteString_Fun_eq [lemma, in Undecidability.TM.Compound.WriteString]
WriteString_Fun [definition, in Undecidability.TM.Compound.WriteString]
WriteValue [section, in Undecidability.TM.Code.WriteValue]
WriteValue [definition, in Undecidability.TM.Code.WriteValue]
WriteValue [section, in Undecidability.TM.Code.WriteValue]
WriteValue [library]
WriteValue_SpecT_size [lemma, in Undecidability.TM.Code.WriteValue]
WriteValue_sizefun [definition, in Undecidability.TM.Code.WriteValue]
WriteValue_Sem [lemma, in Undecidability.TM.Code.WriteValue]
WriteValue_steps [definition, in Undecidability.TM.Code.WriteValue]
WriteValue_Rel [definition, in Undecidability.TM.Code.WriteValue]
WriteValue_size [definition, in Undecidability.TM.Code.WriteValue]
WriteValue.cX [variable, in Undecidability.TM.Code.WriteValue]
WriteValue.cX [variable, in Undecidability.TM.Code.WriteValue]
WriteValue.sig [variable, in Undecidability.TM.Code.WriteValue]
WriteValue.sig [variable, in Undecidability.TM.Code.WriteValue]
WriteValue.X [variable, in Undecidability.TM.Code.WriteValue]
WriteValue.X [variable, in Undecidability.TM.Code.WriteValue]
Write_Sem [lemma, in Undecidability.TM.Basic.Mono]
Write_Rel [definition, in Undecidability.TM.Basic.Mono]
Write_String_nil [lemma, in Undecidability.TM.Compound.WriteString]
Write_String.D [variable, in Undecidability.TM.Compound.WriteString]
Write_String.sig [variable, in Undecidability.TM.Compound.WriteString]
Write_String [section, in Undecidability.TM.Compound.WriteString]
w':103 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
w':106 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
w':146 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
w':79 [binder, in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
w1:116 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.CC]
w1:120 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.CC]
w1:264 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
w1:29 [binder, in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
w1:42 [binder, in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
w1:46 [binder, in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
w1:53 [binder, in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
w1:56 [binder, in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
w1:70 [binder, in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
w1:74 [binder, in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
w1:87 [binder, in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
w1:93 [binder, in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
w2:117 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.CC]
w2:121 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.CC]
w2:265 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
w2:30 [binder, in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
w2:43 [binder, in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
w2:50 [binder, in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
w2:60 [binder, in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
w2:71 [binder, in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
w2:90 [binder, in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
w2:95 [binder, in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
w3:47 [binder, in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
w:10 [binder, in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
w:101 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
w:102 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
w:104 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
w:106 [binder, in Undecidability.L.Computability.Seval]
w:108 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
w:11 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
w:11 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatTCC_to_FlatCC]
w:112 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
w:114 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
w:115 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
w:116 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
w:117 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
w:117 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
w:118 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
w:12 [binder, in Undecidability.L.Computability.Seval]
w:12 [binder, in Undecidability.Shared.Libs.DLW.Utils.crt]
W:12 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
w:12 [binder, in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
w:12 [binder, in Undecidability.L.Functions.Encoding]
w:120 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
w:123 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
w:133 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
w:134 [binder, in Undecidability.TM.Univ.LowLevel]
w:138 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
w:143 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
w:144 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
w:147 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
w:147 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
w:150 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
w:151 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
w:153 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
w:154 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
w:155 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
w:158 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
w:160 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
w:162 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
w:165 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
w:168 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
w:17 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatTCC_to_FlatCC]
w:173 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
w:175 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
w:178 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
w:187 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
w:21 [binder, in Undecidability.Shared.Libs.DLW.Utils.crt]
w:24 [binder, in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
w:25 [binder, in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
w:2542 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
w:2545 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
w:26 [binder, in Undecidability.TM.Compound.TMTac]
w:260 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
w:2604 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
w:2609 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
w:2614 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
w:27 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
w:271 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
w:2711 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
w:274 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
w:279 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
w:282 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
w:284 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
w:291 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
W:2917 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
W:2929 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
W:2954 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
w:299 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
w:299 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
w:30 [binder, in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
W:3042 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
W:3057 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
W:3063 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
w:307 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
W:3072 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
w:3077 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
w:309 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
W:3105 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
W:3111 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
W:3124 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
w:314 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
W:3162 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
W:3171 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
W:3179 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
W:3189 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
w:32 [binder, in Undecidability.TM.SBTM]
w:321 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
w:3212 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
w:3213 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
w:3214 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
w:3215 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
w:323 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
w:33 [binder, in Undecidability.L.Datatypes.LProd]
w:332 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
w:339 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
w:34 [binder, in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
w:358 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
W:3596 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
W:3629 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
w:37 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
w:413 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
w:42 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
w:42 [binder, in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
w:46 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
w:46 [binder, in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
w:48 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
w:50 [binder, in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
w:51 [binder, in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
w:54 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
w:54 [binder, in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
w:55 [binder, in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
w:59 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
w:59 [binder, in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
w:7 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatTCC_to_FlatCC]
w:73 [binder, in Undecidability.TM.Univ.LowLevel]
w:73 [binder, in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
w:74 [binder, in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
w:76 [binder, in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
w:8 [binder, in Undecidability.Shared.Libs.DLW.Utils.crt]
w:8 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatTCC_to_FlatCC]
w:8 [binder, in Undecidability.L.AbstractMachines.LargestVar]
w:81 [binder, in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
w:83 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
w:9 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatTCC_to_FlatCC]
w:91 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
w:92 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
w:95 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
w:96 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
w:97 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]

X

XeqbComp:145 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
XeqbComp:26 [binder, in Undecidability.L.Datatypes.List.List_in]
XeqbComp:5 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
XeqbComp:53 [binder, in Undecidability.L.Datatypes.List.List_in]
XeqbComp:79 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
XeqbComp:86 [binder, in Complexity.NP.SAT.SAT_inNP]
Xeqb:82 [binder, in Complexity.Libs.CookPrelim.PolyBounds]
Xeq:144 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
Xeq:25 [binder, in Undecidability.L.Datatypes.List.List_in]
Xeq:4 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
Xeq:52 [binder, in Undecidability.L.Datatypes.List.List_in]
Xeq:78 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
Xeq:85 [binder, in Complexity.NP.SAT.SAT_inNP]
xInt:13 [binder, in Undecidability.L.Tactics.ComputableTime]
Xint:155 [binder, in Complexity.Libs.CookPrelim.PolyBounds]
xInt:18 [binder, in Undecidability.L.Tactics.Computable]
Xint:20 [binder, in Undecidability.L.Datatypes.List.List_extra]
Xint:255 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
xInt:8 [binder, in Undecidability.L.Tactics.ComputableTime]
xs':205 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
xs':213 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
xs':54 [binder, in Complexity.TM.Code.Decode]
xs1:149 [binder, in Undecidability.TM.Code.Code]
xs1:34 [binder, in Undecidability.TM.PrettyBounds.MaxList]
xs2:150 [binder, in Undecidability.TM.Code.Code]
xs2:35 [binder, in Undecidability.TM.PrettyBounds.MaxList]
xs:1 [binder, in Undecidability.TM.PrettyBounds.MaxList]
xs:10 [binder, in Undecidability.L.Datatypes.Lists]
xs:101 [binder, in Complexity.TM.PrettyBounds.BaseCode]
xs:101 [binder, in Undecidability.TM.Compound.Compare]
xs:102 [binder, in Undecidability.TM.Univ.LookupAssociativeListTM]
xs:102 [binder, in Complexity.NP.TM.LM_to_mTM]
xs:103 [binder, in Complexity.TM.PrettyBounds.BaseCodeSpace]
xs:104 [binder, in Undecidability.TM.Compound.Compare]
xs:106 [binder, in Undecidability.TM.Code.CaseList]
xs:106 [binder, in Undecidability.TM.Univ.LookupAssociativeListTM]
xs:107 [binder, in Complexity.TM.PrettyBounds.UnivBounds]
xs:109 [binder, in Undecidability.TM.Code.CaseList]
xs:109 [binder, in Complexity.TM.PrettyBounds.BaseCodeSpace]
xs:11 [binder, in Complexity.TM.PrettyBounds.SpaceBounds]
xs:11 [binder, in Undecidability.TM.Code.List.Rev]
xs:11 [binder, in Undecidability.Shared.Libs.PSL.Vectors.VectorDupfree]
xs:110 [binder, in Undecidability.TM.Single.StepTM]
xs:110 [binder, in Undecidability.TM.Code.List.Nth]
xs:111 [binder, in Undecidability.TM.Code.CaseList]
xs:111 [binder, in Complexity.TM.PrettyBounds.UnivBounds]
xs:111 [binder, in Undecidability.TM.Univ.LookupAssociativeListTM]
xs:116 [binder, in Undecidability.TM.Univ.LookupAssociativeListTM]
xs:117 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
xs:12 [binder, in Undecidability.L.Prelim.MoreBase]
xs:12 [binder, in Undecidability.TM.PrettyBounds.MaxList]
xs:120 [binder, in Undecidability.TM.Univ.LookupAssociativeListTM]
xs:123 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
xs:123 [binder, in Undecidability.TM.Util.TM_facts]
xs:126 [binder, in Undecidability.TM.Util.TM_facts]
xs:128 [binder, in Undecidability.TM.Univ.LookupAssociativeListTM]
xs:129 [binder, in Undecidability.TM.Util.TM_facts]
xs:13 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds_Loop]
xs:130 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
xs:132 [binder, in Undecidability.TM.Util.TM_facts]
xs:133 [binder, in Complexity.TM.PrettyBounds.BaseCode]
xs:133 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
xs:134 [binder, in Undecidability.TM.Univ.LookupAssociativeListTM]
xs:136 [binder, in Undecidability.TM.Util.TM_facts]
xs:139 [binder, in Undecidability.TM.Util.TM_facts]
xs:14 [binder, in Undecidability.TM.Compound.TMTac]
xs:14 [binder, in Undecidability.L.Datatypes.Lists]
xs:14 [binder, in Undecidability.TM.Code.BinNumbers.EncodeBinNumbers]
xs:14 [binder, in Undecidability.TM.Code.CompareValue]
xs:14 [binder, in Undecidability.Shared.Libs.PSL.Vectors.VectorDupfree]
xs:141 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
xs:143 [binder, in Undecidability.TM.Util.TM_facts]
xs:145 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
xs:146 [binder, in Undecidability.TM.Util.TM_facts]
xs:147 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
xs:15 [binder, in Undecidability.TM.Code.List.Length]
xs:15 [binder, in Complexity.TM.PrettyBounds.BaseCodeSpace]
xs:15 [binder, in Undecidability.TM.PrettyBounds.MaxList]
xs:15 [binder, in Undecidability.TM.Code.List.App]
xs:150 [binder, in Undecidability.TM.Univ.LookupAssociativeListTM]
xs:151 [binder, in Undecidability.TM.Univ.LookupAssociativeListTM]
xs:152 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
xs:156 [binder, in Undecidability.TM.Code.Code]
xs:157 [binder, in Undecidability.TM.Univ.LookupAssociativeListTM]
xs:158 [binder, in Undecidability.TM.Code.Code]
xs:16 [binder, in Undecidability.TM.Code.List.Concat_Repeat]
xs:17 [binder, in Undecidability.TM.Code.List.App]
xs:173 [binder, in Undecidability.TM.Code.Code]
xs:178 [binder, in Undecidability.TM.Code.Code]
xs:18 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
xs:18 [binder, in Undecidability.TM.Compound.TMTac]
xs:18 [binder, in Complexity.L.TM.TMflatComp]
xs:18 [binder, in Undecidability.TM.Univ.LookupAssociativeListTM]
xs:18 [binder, in Undecidability.TM.PrettyBounds.MaxList]
xs:182 [binder, in Undecidability.TM.Code.Code]
xs:184 [binder, in Undecidability.TM.Code.Code]
xs:185 [binder, in Undecidability.TM.Code.Code]
xs:186 [binder, in Undecidability.TM.Code.Code]
xs:187 [binder, in Undecidability.TM.Code.Code]
xs:188 [binder, in Undecidability.TM.Code.Code]
xs:19 [binder, in Undecidability.L.Datatypes.List.List_basics]
xs:19 [binder, in Complexity.TM.PrettyBounds.UnivBounds]
xs:19 [binder, in Undecidability.TM.Code.List.Rev]
xs:19 [binder, in Undecidability.TM.Code.List.App]
xs:191 [binder, in Undecidability.TM.Code.Code]
xs:192 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
xs:192 [binder, in Undecidability.TM.Code.Code]
xs:194 [binder, in Undecidability.TM.Code.Code]
xs:195 [binder, in Undecidability.TM.Code.Code]
xs:197 [binder, in Undecidability.TM.Code.Code]
xs:2 [binder, in Undecidability.TM.Code.CaseList]
xs:2 [binder, in Undecidability.TM.Single.StepTM]
xs:2 [binder, in Undecidability.TM.Code.CaseNat]
xs:2 [binder, in Undecidability.TM.PrettyBounds.SizeBounds]
xs:2 [binder, in Complexity.TM.PrettyBounds.SpaceBounds]
xs:2 [binder, in Undecidability.TM.Code.CaseSum]
xs:201 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
xs:209 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
xs:218 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
xs:219 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
xs:22 [binder, in Undecidability.TM.Compound.TMTac]
xs:22 [binder, in Undecidability.TM.PrettyBounds.MaxList]
xs:225 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
xs:229 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
xs:23 [binder, in Undecidability.TM.Code.List.Concat_Repeat]
xs:23 [binder, in Undecidability.TM.Code.List.Rev]
xs:23 [binder, in Complexity.L.TM.TMflatComp]
xs:238 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
xs:24 [binder, in Undecidability.TM.Code.List.Nth]
xs:24 [binder, in Undecidability.TM.PrettyBounds.MaxList]
xs:240 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
xs:243 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
xs:247 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
xs:247 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
xs:25 [binder, in Undecidability.TM.Code.List.Length]
xs:25 [binder, in Undecidability.TM.Code.List.Rev]
xs:250 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
xs:254 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
xs:27 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
xs:27 [binder, in Undecidability.TM.Code.List.Nth]
xs:27 [binder, in Complexity.TM.PrettyBounds.UnivBounds]
xs:27 [binder, in Undecidability.TM.PrettyBounds.MaxList]
xs:27 [binder, in Undecidability.TM.Compound.WriteString]
xs:29 [binder, in Undecidability.TM.Code.List.Concat_Repeat]
xs:29 [binder, in Undecidability.TM.Code.List.Length]
xs:29 [binder, in Complexity.NP.TM.M_multi2mono]
xs:29 [binder, in Undecidability.TM.Code.List.App]
xs:30 [binder, in Undecidability.TM.Util.VectorPrelim]
xs:30 [binder, in Undecidability.TM.Univ.LookupAssociativeListTM]
xs:30 [binder, in Undecidability.TM.Compound.WriteString]
xs:31 [binder, in Undecidability.Shared.Libs.PSL.Vectors.VectorDupfree]
xs:31 [binder, in Undecidability.TM.Lifting.LiftTapes]
xs:31 [binder, in Undecidability.TM.PrettyBounds.MaxList]
xs:32 [binder, in Undecidability.TM.Code.List.Rev]
xs:32 [binder, in Complexity.L.TM.TMflatFun]
xs:321 [binder, in Undecidability.TM.Single.StepTM]
xs:33 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
xs:33 [binder, in Undecidability.TM.Code.List.App]
xs:331 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
xs:336 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
xs:34 [binder, in Undecidability.TM.Code.List.Length]
xs:34 [binder, in Undecidability.L.Tactics.ComputableDemo]
xs:35 [binder, in Undecidability.Shared.Libs.PSL.Vectors.VectorDupfree]
xs:35 [binder, in Undecidability.TM.Lifting.LiftTapes]
xs:37 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
xs:37 [binder, in Complexity.TM.PrettyBounds.UnivBounds]
xs:37 [binder, in Undecidability.TM.Univ.LookupAssociativeListTM]
xs:37 [binder, in Undecidability.L.Prelim.MoreList]
xs:38 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
xs:38 [binder, in Undecidability.TM.Code.List.Rev]
xs:38 [binder, in Undecidability.TM.PrettyBounds.MaxList]
xs:38 [binder, in Undecidability.L.Prelim.MoreList]
xs:39 [binder, in Undecidability.TM.Code.List.Length]
xs:4 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
xs:4 [binder, in Complexity.TM.PrettyBounds.UnivBounds]
xs:40 [binder, in Undecidability.TM.Util.VectorPrelim]
xs:40 [binder, in Undecidability.Shared.Libs.PSL.Vectors.VectorDupfree]
xs:40 [binder, in Undecidability.TM.Code.List.App]
xs:41 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
xs:41 [binder, in Undecidability.L.Tactics.ComputableDemo]
xs:42 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
xs:42 [binder, in Undecidability.TM.PrettyBounds.MaxList]
xs:43 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
xs:43 [binder, in Undecidability.TM.Util.VectorPrelim]
xs:43 [binder, in Undecidability.Shared.Libs.PSL.Lists.Position]
xs:43 [binder, in Undecidability.TM.Code.List.Rev]
xs:43 [binder, in Undecidability.Shared.Libs.PSL.Vectors.VectorDupfree]
xs:43 [binder, in Undecidability.TM.Code.List.App]
xs:45 [binder, in Undecidability.TM.Code.List.Rev]
xs:45 [binder, in Undecidability.Shared.Libs.PSL.Vectors.VectorDupfree]
xs:45 [binder, in Undecidability.TM.PrettyBounds.MaxList]
xs:45 [binder, in Undecidability.TM.Code.List.App]
xs:46 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
xs:46 [binder, in Undecidability.TM.Univ.LookupAssociativeListTM]
xs:46 [binder, in Undecidability.TM.Code.List.App]
xs:47 [binder, in Complexity.TM.PrettyBounds.UnivBounds]
xs:47 [binder, in Undecidability.TM.Code.List.Length]
xs:48 [binder, in Undecidability.Shared.Libs.PSL.Lists.Position]
xs:48 [binder, in Undecidability.TM.Code.List.Rev]
xs:48 [binder, in Undecidability.Shared.Libs.PSL.Vectors.VectorDupfree]
xs:48 [binder, in Undecidability.TM.Univ.LookupAssociativeListTM]
xs:49 [binder, in Undecidability.TM.Util.VectorPrelim]
xs:49 [binder, in Undecidability.TM.PrettyBounds.MaxList]
xs:5 [binder, in Complexity.TM.PrettyBounds.BaseCode]
xs:5 [binder, in Undecidability.TM.Code.List.Rev]
xs:5 [binder, in Undecidability.TM.PrettyBounds.MaxList]
xs:50 [binder, in Undecidability.Shared.Libs.PSL.Lists.Position]
xs:50 [binder, in Undecidability.TM.PrettyBounds.MaxList]
xs:51 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
xs:51 [binder, in Complexity.TM.Code.Decode]
xs:51 [binder, in Undecidability.Shared.Libs.PSL.Vectors.VectorDupfree]
xs:51 [binder, in Undecidability.TM.Code.BinNumbers.PosShiftTM]
xs:52 [binder, in Undecidability.TM.Code.List.Nth]
xs:52 [binder, in Undecidability.TM.Code.List.Length]
xs:53 [binder, in Undecidability.TM.Util.VectorPrelim]
xs:53 [binder, in Undecidability.Shared.Libs.PSL.Lists.Position]
xs:53 [binder, in Undecidability.TM.Code.List.Rev]
xs:53 [binder, in Undecidability.TM.PrettyBounds.MaxList]
xs:55 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
xs:56 [binder, in Undecidability.L.Datatypes.List.List_basics]
xs:56 [binder, in Complexity.NP.TM.M_multi2mono]
xs:57 [binder, in Undecidability.TM.Code.List.Concat_Repeat]
xs:57 [binder, in Complexity.TM.PrettyBounds.UnivBounds]
xs:57 [binder, in Undecidability.TM.Util.VectorPrelim]
xs:57 [binder, in Undecidability.TM.Code.List.Length]
xs:57 [binder, in Undecidability.Shared.Libs.PSL.Vectors.VectorDupfree]
xs:57 [binder, in Undecidability.TM.PrettyBounds.MaxList]
xs:58 [binder, in Undecidability.TM.Code.List.Nth]
xs:58 [binder, in Undecidability.TM.Code.List.Rev]
xs:59 [binder, in Undecidability.L.Datatypes.List.List_basics]
xs:59 [binder, in Complexity.TM.PrettyBounds.BaseCodeSpace]
xs:59 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
xs:59 [binder, in Complexity.TM.PrettyBounds.PrettyBounds]
xs:6 [binder, in Undecidability.TM.Single.StepTM]
xs:60 [binder, in Undecidability.TM.Code.List.Length]
xs:60 [binder, in Undecidability.TM.Univ.LookupAssociativeListTM]
xs:61 [binder, in Undecidability.L.Datatypes.List.List_basics]
xs:61 [binder, in Undecidability.TM.Code.List.Rev]
xs:61 [binder, in Undecidability.TM.PrettyBounds.MaxList]
xs:62 [binder, in Undecidability.TM.Code.List.Nth]
xs:62 [binder, in Undecidability.TM.Code.List.Rev]
xs:62 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
xs:63 [binder, in Undecidability.TM.Code.List.App]
xs:64 [binder, in Undecidability.TM.PrettyBounds.MaxList]
xs:65 [binder, in Complexity.TM.PrettyBounds.BaseCodeSpace]
xs:65 [binder, in Undecidability.TM.PrettyBounds.MaxList]
xs:67 [binder, in Undecidability.TM.Code.List.Nth]
xs:67 [binder, in Complexity.TM.PrettyBounds.UnivBounds]
xs:67 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
xs:67 [binder, in Undecidability.TM.PrettyBounds.MaxList]
xs:68 [binder, in Undecidability.TM.Code.List.Length]
xs:69 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
xs:69 [binder, in Complexity.TM.PrettyBounds.PrettyBounds]
xs:7 [binder, in Undecidability.L.Datatypes.List.List_basics]
xs:7 [binder, in Complexity.TM.PrettyBounds.SpaceBounds]
xs:7 [binder, in Complexity.L.TM.TMflatComp]
xs:70 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
xs:71 [binder, in Undecidability.TM.Code.List.Length]
xs:71 [binder, in Complexity.TM.PrettyBounds.BaseCodeSpace]
xs:71 [binder, in Undecidability.TM.Univ.LookupAssociativeListTM]
xs:71 [binder, in Undecidability.TM.PrettyBounds.MaxList]
xs:72 [binder, in Undecidability.TM.Code.List.Nth]
xs:73 [binder, in Undecidability.TM.PrettyBounds.MaxList]
xs:74 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
xs:74 [binder, in Undecidability.TM.Univ.LookupAssociativeListTM]
xs:75 [binder, in Complexity.TM.PrettyBounds.BaseCode]
xs:75 [binder, in Undecidability.TM.Code.CaseList]
xs:76 [binder, in Undecidability.TM.Code.List.Nth]
xs:76 [binder, in Complexity.TM.PrettyBounds.UnivBounds]
xs:76 [binder, in Undecidability.TM.PrettyBounds.MaxList]
xs:78 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
xs:78 [binder, in Undecidability.TM.PrettyBounds.MaxList]
xs:78 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
xs:79 [binder, in Undecidability.TM.PrettyBounds.MaxList]
xs:8 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
xs:8 [binder, in Complexity.TM.PrettyBounds.UnivBounds]
xs:8 [binder, in Undecidability.TM.Code.CompareValue]
xs:8 [binder, in Undecidability.TM.Code.CasePair]
xs:8 [binder, in Undecidability.TM.Code.List.App]
xs:80 [binder, in Undecidability.TM.Code.List.Nth]
xs:80 [binder, in Undecidability.TM.Univ.LookupAssociativeListTM]
xs:81 [binder, in Complexity.TM.PrettyBounds.BaseCode]
xs:81 [binder, in Undecidability.TM.PrettyBounds.MaxList]
xs:84 [binder, in Complexity.TM.PrettyBounds.BaseCode]
xs:84 [binder, in Undecidability.TM.Code.List.Nth]
xs:84 [binder, in Undecidability.TM.Univ.LookupAssociativeListTM]
xs:84 [binder, in Undecidability.TM.PrettyBounds.MaxList]
xs:85 [binder, in Complexity.TM.PrettyBounds.UnivBounds]
xs:85 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
xs:88 [binder, in Undecidability.TM.Compound.Compare]
xs:89 [binder, in Undecidability.TM.Code.List.Nth]
xs:89 [binder, in Undecidability.TM.Univ.LookupAssociativeListTM]
xs:89 [binder, in Undecidability.TM.PrettyBounds.MaxList]
xs:9 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds_Loop]
xs:9 [binder, in Complexity.TM.PrettyBounds.SpaceBounds]
xs:9 [binder, in Undecidability.TM.Code.BinNumbers.EncodeBinNumbers]
xs:9 [binder, in Complexity.TM.PrettyBounds.BaseCodeSpace]
xs:9 [binder, in Undecidability.TM.Univ.LookupAssociativeListTM]
xs:91 [binder, in Complexity.TM.PrettyBounds.BaseCode]
xs:92 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
xs:94 [binder, in Complexity.TM.PrettyBounds.BaseCode]
xs:94 [binder, in Undecidability.TM.Code.List.Nth]
xs:94 [binder, in Complexity.TM.PrettyBounds.UnivBounds]
xs:94 [binder, in Undecidability.TM.Univ.LookupAssociativeListTM]
xs:96 [binder, in Complexity.TM.PrettyBounds.BaseCode]
xs:96 [binder, in Complexity.TM.PrettyBounds.BaseCodeSpace]
xs:98 [binder, in Undecidability.TM.Code.List.Nth]
xs:98 [binder, in Undecidability.TM.Univ.LookupAssociativeListTM]
xTime:9 [binder, in Undecidability.L.Tactics.ComputableTime]
xT:10 [binder, in Undecidability.L.Tactics.ComputableTactics]
xT:160 [binder, in Undecidability.L.Tactics.ComputableTime]
xT:186 [binder, in Undecidability.L.Tactics.ComputableTime]
xT:19 [binder, in Undecidability.L.Datatypes.LNat]
xT:3 [binder, in Undecidability.L.Datatypes.LNat]
xT:43 [binder, in Undecidability.L.Tactics.Lrewrite]
xT:6 [binder, in Undecidability.L.Tactics.ComputableTactics]
xT:70 [binder, in Undecidability.L.Tactics.ComputableTime]
xT:8 [binder, in Undecidability.L.Tactics.ComputableTactics]
xT:80 [binder, in Undecidability.L.Tactics.ComputableTime]
xt:83 [binder, in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
xT:86 [binder, in Undecidability.L.Tactics.ComputableTime]
xT:9 [binder, in Undecidability.L.Datatypes.LNat]
xxx:81 [binder, in Undecidability.L.Complexity.UpToCNary]
xy:11 [binder, in Undecidability.Shared.embed_nat]
xy:124 [binder, in Complexity.L.TM.TMflatComp]
X__cert:12 [binder, in Complexity.NP.L.CanEnumTerm_def]
X__cert:1 [binder, in Complexity.NP.L.CanEnumTerm_def]
X__cert:1 [binder, in Complexity.NP.L.GenNP_is_hard]
X_encodable:119 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
x__tl:38 [binder, in Complexity.TM.Code.Decode]
x__hd:37 [binder, in Complexity.TM.Code.Decode]
x__last:33 [binder, in Complexity.TM.Code.Decode]
x__init:32 [binder, in Complexity.TM.Code.Decode]
x__tl:31 [binder, in Complexity.TM.Code.Decode]
x__hd:30 [binder, in Complexity.TM.Code.Decode]
X_encodable:160 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
X_encodable:156 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
X_gen [lemma, in Undecidability.Synthetic.Infinite]
X_encodable:6 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatTCC_to_FlatCC]
X__cert:1 [binder, in Complexity.NP.L.GenNP]
x':100 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
x':1001 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
x':105 [binder, in Undecidability.L.Tactics.Computable]
x':109 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
x':11 [binder, in Undecidability.L.Functions.UnboundIteration]
x':110 [binder, in Complexity.L.TM.TMflatComp]
x':110 [binder, in Undecidability.L.Tactics.Computable]
x':12 [binder, in Complexity.TM.Single.DecodeTape]
x':123 [binder, in Complexity.L.TM.TMunflatten]
x':14 [binder, in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
x':142 [binder, in Undecidability.L.Tactics.ComputableTime]
x':144 [binder, in Complexity.L.TM.TMunflatten]
x':146 [binder, in Complexity.L.TM.TMunflatten]
x':148 [binder, in Undecidability.L.Tactics.ComputableTime]
x':15 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
x':15 [binder, in Undecidability.Synthetic.Infinite]
x':151 [binder, in Complexity.L.TM.TMflatComp]
x':17 [binder, in Complexity.TM.PrettyBounds.UnivBounds]
x':171 [binder, in Complexity.L.TM.TMflatComp]
x':18 [binder, in Undecidability.L.Datatypes.List.List_eqb]
x':180 [binder, in Complexity.L.TM.TMflatComp]
x':19 [binder, in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
x':191 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
X':2 [binder, in Undecidability.TM.Univ.LowLevel]
x':21 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
x':21 [binder, in Complexity.HierarchyTheorem.TimeHierarchyTheorem]
x':21 [binder, in Undecidability.Shared.Libs.DLW.Vec.pos]
x':26 [binder, in Undecidability.L.Functions.EqBool]
x':28 [binder, in Undecidability.TM.Univ.LookupAssociativeListTM]
x':283 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x':287 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x':3 [binder, in Complexity.Complexity.Monotonic]
x':30 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
x':32 [binder, in Undecidability.L.Tactics.ComputableTactics]
x':33 [binder, in Undecidability.L.Prelim.LoopSum]
X':33 [binder, in Undecidability.TM.Univ.LowLevel]
x':334 [binder, in Undecidability.TM.Hoare.HoareCombinators]
x':37 [binder, in Complexity.L.AbstractMachines.Computable.EvalForTime]
x':375 [binder, in Undecidability.TM.Hoare.HoareCombinators]
x':38 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
x':394 [binder, in Undecidability.TM.Hoare.HoareCombinators]
x':40 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
X':428 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x':439 [binder, in Undecidability.TM.Hoare.HoareCombinators]
x':44 [binder, in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
x':44 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.Arbitrary]
x':45 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
x':461 [binder, in Undecidability.TM.Hoare.HoareCombinators]
x':5 [binder, in Complexity.TM.Code.Decode]
x':5 [binder, in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
x':53 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
x':54 [binder, in Undecidability.L.Prelim.ARS]
x':61 [binder, in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
x':633 [binder, in Complexity.NP.TM.LM_to_mTM]
x':634 [binder, in Complexity.NP.TM.LM_to_mTM]
x':66 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
x':68 [binder, in Complexity.L.AbstractMachines.Computable.EvalForTime]
x':68 [binder, in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
x':73 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
x':74 [binder, in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
x':78 [binder, in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
x':8 [binder, in Complexity.TM.Single.DecodeTape]
x':83 [binder, in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
x':84 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
x':96 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
x':98 [binder, in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
x':996 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
x0':111 [binder, in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
x0':124 [binder, in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
x0':62 [binder, in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
x0:103 [binder, in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
x0:105 [binder, in Undecidability.L.Computability.Synthetic]
x0:106 [binder, in Undecidability.L.Computability.Synthetic]
x0:108 [binder, in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
x0:110 [binder, in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
x0:113 [binder, in Undecidability.L.Computability.Synthetic]
x0:114 [binder, in Undecidability.L.Computability.Synthetic]
x0:116 [binder, in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
x0:120 [binder, in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
x0:123 [binder, in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
x0:14 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.DepPairs]
x0:17 [binder, in Complexity.L.AbstractMachines.Computable.Unfolding]
x0:17 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.DepPairs]
x0:22 [binder, in Complexity.Complexity.ONotationIsAppropriate]
x0:24 [binder, in Complexity.L.AbstractMachines.Computable.Unfolding]
x0:35 [binder, in Undecidability.L.Functions.UnboundIteration]
x0:3581 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
x0:3583 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
x0:3584 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
x0:3587 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
x0:3588 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
x0:3590 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
x0:51 [binder, in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
x0:53 [binder, in Undecidability.L.Functions.UnboundIteration]
x0:542 [binder, in Complexity.NP.TM.LM_to_mTM]
x0:543 [binder, in Complexity.NP.TM.LM_to_mTM]
x0:544 [binder, in Complexity.NP.TM.LM_to_mTM]
x0:545 [binder, in Complexity.NP.TM.LM_to_mTM]
x0:57 [binder, in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
x0:61 [binder, in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
x0:7 [binder, in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
x0:74 [binder, in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
x0:76 [binder, in Complexity.NP.TM.LM_to_mTM]
x0:78 [binder, in Complexity.NP.TM.LM_to_mTM]
x0:80 [binder, in Complexity.NP.TM.LM_to_mTM]
x0:82 [binder, in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
x0:82 [binder, in Complexity.NP.TM.LM_to_mTM]
x1:105 [binder, in Undecidability.TM.Util.Relations]
x1:11 [binder, in Undecidability.L.Datatypes.LProd]
x1:127 [binder, in Undecidability.TM.Compound.Compare]
x1:135 [binder, in Undecidability.TM.Compound.Compare]
x1:137 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
x1:138 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
x1:139 [binder, in Complexity.TM.PrettyBounds.BaseCode]
x1:169 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x1:177 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
x1:18 [binder, in Undecidability.Shared.Libs.DLW.Utils.quotient]
x1:187 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
x1:19 [binder, in Undecidability.Shared.Libs.PSL.Retracts]
x1:19 [binder, in Undecidability.TM.Code.CompareValue]
x1:198 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
x1:203 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
x1:21 [binder, in Undecidability.L.Datatypes.LProd]
x1:214 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
x1:23 [binder, in Complexity.TM.PrettyBounds.PrettyBounds]
x1:26 [binder, in Undecidability.TM.Code.CompareValue]
x1:2649 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
x1:3 [binder, in Undecidability.TM.Code.CompareValue]
x1:3 [binder, in Undecidability.TM.Code.Copy]
x1:3231 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
x1:33 [binder, in Undecidability.Shared.Libs.DLW.Utils.quotient]
x1:34 [binder, in Undecidability.TM.Code.CompareValue]
x1:349 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x1:3572 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
x1:3585 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
x1:3589 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
x1:3591 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
x1:38 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds_Loop]
x1:38 [binder, in Undecidability.TM.Code.CompareValue]
x1:4 [binder, in Complexity.Libs.UniformHomomorphisms]
x1:569 [binder, in Complexity.NP.TM.LM_to_mTM]
x1:570 [binder, in Complexity.NP.TM.LM_to_mTM]
x1:62 [binder, in Undecidability.Shared.Libs.DLW.Utils.quotient]
x1:63 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x1:64 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x1:65 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x1:66 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x1:67 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
x1:81 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
x1:82 [binder, in Undecidability.TM.Code.Code]
x1:9 [binder, in Complexity.TM.PrettyBounds.PrettyBounds]
x1:91 [binder, in Undecidability.TM.Code.Code]
x2:10 [binder, in Complexity.TM.PrettyBounds.PrettyBounds]
x2:106 [binder, in Undecidability.TM.Util.Relations]
x2:128 [binder, in Undecidability.TM.Compound.Compare]
x2:13 [binder, in Undecidability.L.Datatypes.LProd]
x2:136 [binder, in Undecidability.TM.Compound.Compare]
x2:138 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
x2:139 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
x2:140 [binder, in Complexity.TM.PrettyBounds.BaseCode]
x2:172 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x2:188 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
x2:19 [binder, in Undecidability.Shared.Libs.DLW.Utils.quotient]
x2:199 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
x2:20 [binder, in Undecidability.Shared.Libs.PSL.Retracts]
x2:20 [binder, in Undecidability.TM.Code.CompareValue]
x2:204 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
x2:215 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
x2:22 [binder, in Undecidability.L.Datatypes.LProd]
x2:24 [binder, in Complexity.TM.PrettyBounds.PrettyBounds]
x2:2650 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
x2:27 [binder, in Undecidability.TM.Code.CompareValue]
x2:3232 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
x2:34 [binder, in Undecidability.Shared.Libs.DLW.Utils.quotient]
x2:35 [binder, in Undecidability.TM.Code.CompareValue]
x2:351 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x2:3573 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
x2:3592 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
x2:39 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds_Loop]
x2:39 [binder, in Undecidability.TM.Code.CompareValue]
x2:4 [binder, in Undecidability.TM.Code.CompareValue]
x2:4 [binder, in Undecidability.TM.Code.Copy]
x2:5 [binder, in Complexity.Libs.UniformHomomorphisms]
x2:63 [binder, in Undecidability.Shared.Libs.DLW.Utils.quotient]
x2:68 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
x2:82 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
x2:83 [binder, in Undecidability.TM.Code.Code]
x2:92 [binder, in Undecidability.TM.Code.Code]
x3:140 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
x3:189 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
x3:205 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
x3:216 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
x3:2651 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
x3:3233 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
x3:3574 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
x4:141 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
x4:190 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
x4:206 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
x4:217 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
x4:2652 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
x4:3234 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
x4:3575 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
x5:142 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
x5:191 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
x5:207 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
x5:218 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
x5:2653 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
x5:3235 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
x5:3576 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
x6:143 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
x6:192 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
x6:208 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
x6:219 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
x6:2654 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
x6:3236 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
x6:3577 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
X:1 [binder, in Undecidability.Shared.Libs.PSL.Tactics.Tactics]
x:1 [binder, in Undecidability.L.Prelim.ARS]
X:1 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
X:1 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_dec]
X:1 [binder, in Undecidability.TM.Code.CaseList]
x:1 [binder, in Complexity.L.Datatypes.LBinNums]
X:1 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
X:1 [binder, in Complexity.Complexity.EncodableP]
X:1 [binder, in Undecidability.Synthetic.SemiDecidabilityFacts]
X:1 [binder, in Undecidability.L.Datatypes.List.List_basics]
X:1 [binder, in Undecidability.L.Complexity.UpToCNary]
X:1 [binder, in Undecidability.TM.Single.StepTM]
X:1 [binder, in Undecidability.Shared.Libs.PSL.Prelim]
X:1 [binder, in Undecidability.TM.Code.CaseNat]
X:1 [binder, in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
X:1 [binder, in Undecidability.Shared.Libs.PSL.EqDec]
X:1 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
X:1 [binder, in Undecidability.TM.Util.VectorPrelim]
X:1 [binder, in Undecidability.Synthetic.EnumerabilityFacts]
X:1 [binder, in Undecidability.L.Prelim.LoopSum]
X:1 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
X:1 [binder, in Undecidability.Shared.FinTypeEquiv]
X:1 [binder, in Undecidability.Shared.Libs.DLW.Utils.quotient]
X:1 [binder, in Undecidability.L.Datatypes.Lists]
X:1 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
X:1 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
X:1 [binder, in Complexity.Complexity.Subtypes]
X:1 [binder, in Undecidability.Shared.Libs.PSL.Inhabited]
X:1 [binder, in Complexity.L.Functions.IterupN]
X:1 [binder, in Complexity.Complexity.LinTimeDecodable]
x:1 [binder, in Undecidability.L.Tactics.ComputableDemo]
x:1 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
X:1 [binder, in Undecidability.L.Datatypes.LVector]
X:1 [binder, in Undecidability.L.Complexity.UpToC]
X:1 [binder, in Complexity.L.TM.TapeDecode]
X:1 [binder, in Undecidability.L.Datatypes.List.List_nat]
X:1 [binder, in Complexity.Libs.CookPrelim.PolyBounds]
X:1 [binder, in Undecidability.TM.Code.CompareValue]
X:1 [binder, in Undecidability.TM.Univ.LowLevel]
X:1 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
x:1 [binder, in Complexity.Complexity.UpToCPoly]
X:1 [binder, in Undecidability.TM.Code.CaseSum]
X:1 [binder, in Undecidability.L.Datatypes.LFinType]
X:1 [binder, in Undecidability.Synthetic.Undecidability]
x:1 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicFinTypes]
X:1 [binder, in Undecidability.L.Functions.EqBool]
X:1 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_base]
X:1 [binder, in Undecidability.Synthetic.MoreEnumerabilityFacts]
X:1 [binder, in Undecidability.Synthetic.Definitions]
X:1 [binder, in Undecidability.TM.Util.Relations]
X:1 [binder, in Complexity.L.TM.TMflatten]
X:1 [binder, in Complexity.TM.Compound.MoveToSymbol_niceSpec]
X:1 [binder, in Undecidability.Synthetic.InformativeDefinitions]
X:1 [binder, in Undecidability.Shared.Libs.PSL.Lists.Dupfree]
X:1 [binder, in Undecidability.Synthetic.ListEnumerabilityFacts]
X:1 [binder, in Undecidability.TM.Code.Copy]
X:1 [binder, in Undecidability.Synthetic.DecidabilityFacts]
X:1 [binder, in Undecidability.Shared.Libs.PSL.Vectors.VectorDupfree]
X:1 [binder, in Undecidability.Shared.Dec]
x:1 [binder, in Complexity.L.Functions.BinNumsCompare]
X:1 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
X:1 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
X:1 [binder, in Complexity.NP.TM.L_to_LM]
X:1 [binder, in Complexity.Complexity.Definitions]
X:1 [binder, in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
X:1 [binder, in Undecidability.L.Functions.Decoding]
x:1 [binder, in Undecidability.L.Datatypes.LNat]
X:1 [binder, in Undecidability.L.Complexity.LinDecode.LTD_def]
X:1 [binder, in Complexity.Complexity.PolyTimeComputable]
x:1 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
x:1 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
X:1 [binder, in Undecidability.L.Tactics.Computable]
x:1 [binder, in Complexity.L.AbstractMachines.Computable.LargestVar]
X:1 [binder, in Undecidability.L.Complexity.LinDecode.LTDlist]
x:10 [binder, in Complexity.Libs.Pigeonhole]
X:10 [binder, in Complexity.TM.PrettyBounds.BaseCode]
x:10 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_dec]
x:10 [binder, in Undecidability.Synthetic.InformativeReducibilityFacts]
X:10 [binder, in Undecidability.L.Datatypes.List.List_basics]
X:10 [binder, in Undecidability.L.Tactics.Extract]
X:10 [binder, in Complexity.TM.Code.Decode]
x:10 [binder, in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
x:10 [binder, in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
x:10 [binder, in Undecidability.TM.Code.List.Length]
X:10 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
X:10 [binder, in Undecidability.Shared.FinTypeEquiv]
x:10 [binder, in Undecidability.Shared.Libs.DLW.Utils.quotient]
X:10 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.VectorFin]
x:10 [binder, in Undecidability.L.Tactics.ComputableDemo]
X:10 [binder, in Undecidability.L.Complexity.UpToC]
x:10 [binder, in Complexity.NP.L.GenNPBool]
x:10 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_upto]
X:10 [binder, in Undecidability.TM.Code.WriteValue]
x:10 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
x:10 [binder, in Undecidability.Shared.Libs.DLW.Utils.php]
X:10 [binder, in Undecidability.L.Datatypes.LFinType]
X:10 [binder, in Undecidability.L.Functions.EqBool]
x:10 [binder, in Undecidability.Synthetic.MoreEnumerabilityFacts]
X:10 [binder, in Undecidability.Synthetic.Definitions]
X:10 [binder, in Undecidability.Synthetic.InformativeDefinitions]
x:10 [binder, in Undecidability.Shared.Libs.DLW.Wf.wf_finite]
X:10 [binder, in Undecidability.Synthetic.ListEnumerabilityFacts]
x:10 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
x:10 [binder, in Undecidability.Shared.Libs.PSL.Vectors.VectorDupfree]
x:10 [binder, in Undecidability.L.Functions.Proc]
x:10 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
x:10 [binder, in Undecidability.Synthetic.Infinite]
X:10 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.Cardinality]
x:10 [binder, in Undecidability.Shared.Libs.DLW.Utils.seteq]
X:10 [binder, in Complexity.Complexity.PolyTimeComputable]
x:10 [binder, in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
x:10 [binder, in Undecidability.TM.PrettyBounds.MaxList]
x:10 [binder, in Undecidability.Synthetic.ReducibilityFacts]
x:10 [binder, in Undecidability.TM.Hoare.HoareExamples]
x:10 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.FiniteFunction]
x:10 [binder, in Undecidability.L.Computability.Scott]
X:100 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:100 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:100 [binder, in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
x:100 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
x:100 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
x:100 [binder, in Undecidability.L.Complexity.UpToC]
X:100 [binder, in Undecidability.TM.Util.Relations]
X:100 [binder, in Undecidability.Synthetic.ListEnumerabilityFacts]
x:100 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
x:1003 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
X:101 [binder, in Undecidability.TM.Code.List.Nth]
x:101 [binder, in Complexity.TM.PrettyBounds.UnivBounds]
x:101 [binder, in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
x:101 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:101 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:101 [binder, in Complexity.TM.PrettyBounds.BaseCodeSpace]
X:101 [binder, in Complexity.L.TM.TMflatComp]
x:101 [binder, in Undecidability.TM.Code.CodeTM]
x:101 [binder, in Complexity.Complexity.UpToCPoly]
x:101 [binder, in Undecidability.Shared.Libs.DLW.Utils.php]
x:101 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
x:101 [binder, in Undecidability.L.Computability.Synthetic]
x:101 [binder, in Undecidability.TM.Util.TM_facts]
x:101 [binder, in Undecidability.TM.Univ.LookupAssociativeListTM]
x:1012 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
x:1015 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
X:102 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
x:102 [binder, in Undecidability.L.Complexity.UpToCNary]
X:102 [binder, in Complexity.TM.PrettyBounds.UnivBounds]
x:102 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:102 [binder, in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
X:102 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
X:102 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
x:102 [binder, in Complexity.L.TM.CompCode]
x:102 [binder, in Complexity.Complexity.UpToCPoly]
x:102 [binder, in Complexity.L.TM.TMunflatten]
X:102 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
x:102 [binder, in Complexity.TM.Single.DecodeTape]
X:102 [binder, in Undecidability.L.Tactics.Computable]
x:102 [binder, in Complexity.TM.PrettyBounds.PrettyBounds]
x:103 [binder, in Undecidability.TM.Single.StepTM]
x:103 [binder, in Complexity.TM.PrettyBounds.UnivBounds]
X:103 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:103 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
X:103 [binder, in Undecidability.TM.Util.Prelim]
X:103 [binder, in Complexity.NP.SAT.SAT_inNP]
X:103 [binder, in Undecidability.Shared.Libs.DLW.Utils.php]
x:103 [binder, in Complexity.L.TM.TMunflatten]
x:103 [binder, in Undecidability.TM.Compound.Compare]
x:103 [binder, in Undecidability.Synthetic.ListEnumerabilityFacts]
x:103 [binder, in Undecidability.L.Computability.Synthetic]
x:103 [binder, in Complexity.Complexity.PolyTimeComputable]
x:103 [binder, in Complexity.NP.TM.LM_to_mTM]
X:103 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
X:104 [binder, in Complexity.TM.PrettyBounds.BaseCode]
x:104 [binder, in Undecidability.TM.Code.CaseList]
x:104 [binder, in Complexity.TM.PrettyBounds.UnivBounds]
x:104 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:104 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
X:104 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
x:104 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
x:104 [binder, in Undecidability.TM.Code.CodeTM]
X:104 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_base]
x:104 [binder, in Undecidability.TM.Code.Copy]
x:104 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
x:104 [binder, in Undecidability.TM.Util.TM_facts]
x:104 [binder, in Complexity.Complexity.PolyTimeComputable]
x:104 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
x:104 [binder, in Undecidability.L.Tactics.Computable]
X:104 [binder, in Complexity.NP.TM.LM_to_mTM]
x:105 [binder, in Undecidability.TM.Code.CaseList]
X:105 [binder, in Undecidability.TM.Single.StepTM]
X:105 [binder, in Complexity.TM.PrettyBounds.UnivBounds]
x:105 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:105 [binder, in Undecidability.TM.Univ.LookupAssociativeListTM]
X:105 [binder, in Complexity.Complexity.PolyTimeComputable]
x:105 [binder, in Complexity.TM.PrettyBounds.PrettyBounds]
x:106 [binder, in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
x:106 [binder, in Undecidability.L.Complexity.UpToCNary]
X:106 [binder, in Undecidability.TM.Code.List.Nth]
x:106 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
X:106 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
x:106 [binder, in Undecidability.TM.Util.Prelim]
x:106 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
x:107 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
X:107 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:107 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:107 [binder, in Undecidability.TM.Util.Prelim]
X:107 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
x:107 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
x:107 [binder, in Complexity.L.TM.TMflatComp]
X:107 [binder, in Undecidability.TM.Util.Relations]
x:107 [binder, in Undecidability.Synthetic.ListEnumerabilityFacts]
x:107 [binder, in Undecidability.TM.Code.Copy]
x:107 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
X:107 [binder, in Undecidability.L.Computability.Synthetic]
x:107 [binder, in Complexity.TM.Single.DecodeTape]
x:107 [binder, in Complexity.Complexity.PolyTimeComputable]
X:107 [binder, in Undecidability.L.Tactics.Computable]
x:107 [binder, in Complexity.Complexity.NP]
X:108 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
x:108 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:108 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
X:108 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
x:108 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
x:108 [binder, in Complexity.TM.PrettyBounds.BaseCodeSpace]
x:108 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_base]
x:108 [binder, in Undecidability.Synthetic.ListEnumerabilityFacts]
x:108 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
x:108 [binder, in Complexity.Complexity.PolyTimeComputable]
x:108 [binder, in Complexity.Complexity.NP]
X:109 [binder, in Complexity.TM.PrettyBounds.UnivBounds]
x:109 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:109 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
x:109 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
X:109 [binder, in Complexity.NP.SAT.SAT_inNP]
x:109 [binder, in Undecidability.Shared.Libs.DLW.Utils.php]
X:109 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
x:109 [binder, in Complexity.Complexity.PolyTimeComputable]
x:109 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
x:109 [binder, in Undecidability.L.Tactics.Computable]
x:109 [binder, in Complexity.Complexity.NP]
X:109 [binder, in Complexity.NP.TM.LM_to_mTM]
X:109 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
x:11 [binder, in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
x:11 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_quotient]
x:11 [binder, in Undecidability.Shared.Libs.PSL.FCI]
X:11 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_dec]
x:11 [binder, in Complexity.NP.L.GenNP_is_hard]
x:11 [binder, in Undecidability.Synthetic.InformativeReducibilityFacts]
X:11 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds_Loop]
x:11 [binder, in Undecidability.L.Computability.Enum]
X:11 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
x:11 [binder, in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
x:11 [binder, in Undecidability.TM.Hoare.HoareLegacy]
X:11 [binder, in Undecidability.TM.Code.List.Cons_constant]
x:11 [binder, in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
x:11 [binder, in Undecidability.Synthetic.EnumerabilityFacts]
x:11 [binder, in Undecidability.L.Prelim.LoopSum]
x:11 [binder, in Undecidability.Shared.FinTypeEquiv]
X:11 [binder, in Undecidability.L.Datatypes.Lists]
x:11 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
x:11 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
x:11 [binder, in Undecidability.TM.Code.BinNumbers.EncodeBinNumbers]
x:11 [binder, in Undecidability.Shared.Libs.DLW.Utils.interval]
x:11 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
x:11 [binder, in Complexity.TM.Single.EncodeTapesInvariants]
X:11 [binder, in Undecidability.L.Prelim.MoreBase]
x:11 [binder, in Undecidability.Shared.Libs.DLW.Wf.acc_irr]
X:11 [binder, in Undecidability.L.Datatypes.LVector]
X:11 [binder, in Undecidability.L.Complexity.UpToC]
x:11 [binder, in Complexity.TM.PrettyBounds.BaseCodeSpace]
X:11 [binder, in Undecidability.L.Datatypes.List.List_nat]
x:11 [binder, in Complexity.Libs.UniformHomomorphisms]
x:11 [binder, in Undecidability.TM.Code.CompareValue]
x:11 [binder, in Complexity.Complexity.UpToCPoly]
X:11 [binder, in Undecidability.L.Datatypes.LFinType]
x:11 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_base]
x:11 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.Arbitrary]
x:11 [binder, in Undecidability.Shared.Libs.PSL.Lists.Power]
X:11 [binder, in Undecidability.TM.Util.Relations]
x:11 [binder, in Undecidability.TM.Code.Copy]
x:11 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
x:11 [binder, in Undecidability.L.Datatypes.List.List_in]
x:11 [binder, in Complexity.L.Functions.BinNumsCompare]
x:11 [binder, in Undecidability.L.Functions.Proc]
X:11 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
x:11 [binder, in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
x:11 [binder, in Undecidability.TM.Code.Code]
X:11 [binder, in Undecidability.Synthetic.Infinite]
X:11 [binder, in Complexity.Complexity.Definitions]
x:11 [binder, in Complexity.TM.Single.DecodeTape]
x:11 [binder, in Complexity.NP.SAT.CookLevin.Reductions.CC_to_BinaryCC]
x:11 [binder, in Undecidability.Synthetic.ReducibilityFacts]
x:11 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.DepPairs]
x:110 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:110 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
X:110 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
X:110 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
x:110 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
x:110 [binder, in Undecidability.TM.Code.Copy]
x:110 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
X:110 [binder, in Undecidability.L.Computability.Synthetic]
x:110 [binder, in Undecidability.TM.Univ.LookupAssociativeListTM]
x:110 [binder, in Complexity.Complexity.PolyTimeComputable]
x:110 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
x:110 [binder, in Complexity.Complexity.NP]
x:110 [binder, in Complexity.TM.PrettyBounds.PrettyBounds]
X:111 [binder, in Complexity.TM.PrettyBounds.BaseCode]
x:111 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
X:111 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
X:111 [binder, in Complexity.NP.SAT.SAT_inNP]
X:111 [binder, in Undecidability.Shared.Libs.DLW.Utils.php]
x:111 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_base]
x:111 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
x:111 [binder, in Complexity.Complexity.PolyTimeComputable]
x:111 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
X:111 [binder, in Undecidability.L.Tactics.Computable]
x:111 [binder, in Complexity.Complexity.NP]
X:112 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:112 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:112 [binder, in Undecidability.L.Tactics.LClos]
X:112 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
X:112 [binder, in Complexity.L.TM.TMflatComp]
x:112 [binder, in Undecidability.TM.Code.CodeTM]
x:112 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_base]
x:112 [binder, in Undecidability.TM.Util.Relations]
x:112 [binder, in Undecidability.Synthetic.ListEnumerabilityFacts]
X:112 [binder, in Complexity.Complexity.PolyTimeComputable]
x:112 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
x:112 [binder, in Complexity.Complexity.NP]
x:113 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
X:113 [binder, in Complexity.TM.PrettyBounds.UnivBounds]
x:113 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
X:113 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
x:113 [binder, in Complexity.TM.PrettyBounds.BaseCodeSpace]
x:113 [binder, in Undecidability.TM.Code.CodeTM]
X:113 [binder, in Complexity.Libs.CookPrelim.PolyBounds]
X:113 [binder, in Complexity.L.TM.TMunflatten]
x:113 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_base]
x:113 [binder, in Undecidability.Synthetic.ListEnumerabilityFacts]
x:113 [binder, in Undecidability.TM.Code.Copy]
x:113 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
X:113 [binder, in Complexity.Complexity.NP]
x:113 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
x:114 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
x:114 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:114 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
x:114 [binder, in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
x:114 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
X:114 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
x:114 [binder, in Undecidability.TM.Code.CodeTM]
X:114 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_base]
x:114 [binder, in Undecidability.TM.Compound.Compare]
X:114 [binder, in Undecidability.Synthetic.ListEnumerabilityFacts]
x:114 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
x:114 [binder, in Undecidability.TM.Hoare.HoareExamples]
x:114 [binder, in Complexity.NP.TM.LM_to_mTM]
x:114 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
X:115 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
X:115 [binder, in Complexity.TM.PrettyBounds.UnivBounds]
x:115 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:115 [binder, in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
X:115 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
X:115 [binder, in Complexity.NP.SAT.SAT_inNP]
x:115 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
x:115 [binder, in Undecidability.TM.Univ.LookupAssociativeListTM]
x:115 [binder, in Undecidability.L.Tactics.Computable]
x:115 [binder, in Complexity.NP.TM.LM_to_mTM]
X:116 [binder, in Complexity.TM.PrettyBounds.BaseCode]
x:116 [binder, in Complexity.TM.PrettyBounds.UnivBounds]
X:116 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:116 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:116 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
X:116 [binder, in Undecidability.Shared.Libs.DLW.Utils.php]
x:116 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_base]
x:116 [binder, in Undecidability.TM.Code.Copy]
x:116 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
x:116 [binder, in Complexity.Complexity.PolyTimeComputable]
x:116 [binder, in Undecidability.L.Tactics.Computable]
x:116 [binder, in Undecidability.TM.Hoare.HoareExamples]
x:116 [binder, in Complexity.NP.TM.LM_to_mTM]
x:117 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
X:117 [binder, in Complexity.TM.PrettyBounds.UnivBounds]
x:117 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:117 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
x:117 [binder, in Undecidability.L.Tactics.LClos]
X:117 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
X:117 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
x:117 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
x:117 [binder, in Undecidability.Synthetic.ListEnumerabilityFacts]
X:117 [binder, in Undecidability.L.Tactics.Computable]
x:117 [binder, in Complexity.NP.TM.LM_to_mTM]
x:118 [binder, in Complexity.TM.PrettyBounds.BaseCode]
X:118 [binder, in Undecidability.L.Tactics.Extract]
x:118 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:118 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
X:118 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_base]
x:118 [binder, in Undecidability.TM.Hoare.HoareExamples]
x:118 [binder, in Complexity.NP.TM.LM_to_mTM]
x:119 [binder, in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
x:119 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
x:119 [binder, in Undecidability.L.Tactics.Extract]
x:119 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:119 [binder, in Undecidability.L.Tactics.LClos]
X:119 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
x:119 [binder, in Complexity.L.TM.TMunflatten]
X:119 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
x:119 [binder, in Undecidability.TM.Code.Copy]
x:119 [binder, in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
x:119 [binder, in Undecidability.TM.Univ.LookupAssociativeListTM]
x:119 [binder, in Undecidability.TM.Compound.Shift]
x:119 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
x:119 [binder, in Complexity.Complexity.NP]
x:119 [binder, in Complexity.NP.TM.LM_to_mTM]
x:12 [binder, in Undecidability.L.Prelim.ARS]
x:12 [binder, in Complexity.TM.PrettyBounds.BaseCode]
x:12 [binder, in Complexity.L.Datatypes.LBinNums]
x:12 [binder, in Complexity.NP.L.GenNP_is_hard]
x:12 [binder, in Undecidability.Shared.FilterFacts]
x:12 [binder, in Undecidability.Shared.Libs.PSL.Lists.Removal]
x:12 [binder, in Undecidability.TM.Code.BinNumbers.PosMultTM]
x:12 [binder, in Undecidability.L.Tactics.Extract]
X:12 [binder, in Complexity.TM.PrettyBounds.UnivBounds]
x:12 [binder, in Undecidability.L.Tactics.ComputableTime]
X:12 [binder, in Undecidability.Shared.Libs.PSL.EqDec]
x:12 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:12 [binder, in Undecidability.TM.Hoare.HoareLegacy]
X:12 [binder, in Undecidability.TM.Util.VectorPrelim]
x:12 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
x:12 [binder, in Undecidability.Shared.Libs.PSL.Lists.Filter]
X:12 [binder, in Undecidability.Shared.Libs.DLW.Utils.quotient]
X:12 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_nat_facts]
X:12 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
X:12 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
x:12 [binder, in Complexity.L.Functions.IterupN]
X:12 [binder, in Undecidability.L.Complexity.UpToC]
x:12 [binder, in Complexity.NP.L.GenNPBool]
X:12 [binder, in Complexity.Libs.CookPrelim.PolyBounds]
x:12 [binder, in Undecidability.L.Datatypes.LFinType]
x:12 [binder, in Undecidability.L.Functions.EqBool]
X:12 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_base]
x:12 [binder, in Undecidability.Shared.Libs.PSL.Bijection]
x:12 [binder, in Undecidability.L.Datatypes.List.List_eqb]
x:12 [binder, in Undecidability.Synthetic.ListEnumerabilityFacts]
x:12 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
x:12 [binder, in Undecidability.L.Functions.EnumInt]
x:12 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
X:12 [binder, in Undecidability.Shared.Libs.PSL.Vectors.VectorDupfree]
x:12 [binder, in Undecidability.Shared.Libs.PSL.Lists.Cardinality]
x:12 [binder, in Undecidability.L.Computability.Synthetic]
x:12 [binder, in Undecidability.L.Functions.FinTypeLookup]
x:12 [binder, in Complexity.Complexity.Monotonic]
x:12 [binder, in Undecidability.L.Datatypes.LNat]
x:12 [binder, in Complexity.NP.SAT.CookLevin.Reductions.CC_to_BinaryCC]
x:12 [binder, in Undecidability.L.Computability.Scott]
X:12 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.CompoundFinTypes]
X:12 [binder, in Undecidability.L.Prelim.MoreList]
x:120 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:120 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
x:120 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_base]
x:120 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
x:120 [binder, in Complexity.NP.TM.LM_to_mTM]
X:121 [binder, in Complexity.TM.PrettyBounds.BaseCode]
X:121 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
X:121 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:121 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:121 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
X:121 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
X:121 [binder, in Complexity.NP.SAT.SAT_inNP]
X:121 [binder, in Undecidability.TM.Hoare.HoareRegister]
X:121 [binder, in Undecidability.Synthetic.ListEnumerabilityFacts]
X:121 [binder, in Complexity.Complexity.PolyTimeComputable]
x:121 [binder, in Complexity.Complexity.NP]
x:121 [binder, in Undecidability.TM.Hoare.HoareExamples]
x:121 [binder, in Complexity.NP.TM.LM_to_mTM]
x:122 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
X:122 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
X:122 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
x:122 [binder, in Complexity.L.TM.TMflatComp]
x:122 [binder, in Undecidability.Shared.Libs.DLW.Utils.php]
x:122 [binder, in Undecidability.TM.Code.Copy]
x:122 [binder, in Undecidability.TM.Util.TM_facts]
x:122 [binder, in Undecidability.Shared.Libs.DLW.Vec.pos]
x:122 [binder, in Complexity.NP.TM.LM_to_mTM]
x:123 [binder, in Complexity.TM.PrettyBounds.BaseCode]
x:123 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:123 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
x:123 [binder, in Undecidability.TM.Compound.Compare]
x:123 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
x:123 [binder, in Complexity.NP.TM.LM_to_mTM]
x:124 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:124 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
x:124 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
X:124 [binder, in Undecidability.Shared.Libs.DLW.Utils.php]
X:124 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
x:124 [binder, in Undecidability.TM.Code.Code]
X:124 [binder, in Undecidability.TM.Univ.LookupAssociativeListTM]
x:124 [binder, in Complexity.Complexity.NP]
x:124 [binder, in Complexity.NP.TM.LM_to_mTM]
x:125 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
x:125 [binder, in Undecidability.TM.Code.List.Nth]
X:125 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:125 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:125 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
x:125 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
X:125 [binder, in Complexity.L.TM.TMflatComp]
X:125 [binder, in Complexity.L.TM.TMunflatten]
x:125 [binder, in Undecidability.Synthetic.ListEnumerabilityFacts]
x:125 [binder, in Undecidability.TM.Util.TM_facts]
x:125 [binder, in Complexity.Complexity.PolyTimeComputable]
x:125 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
x:125 [binder, in Undecidability.Shared.Libs.DLW.Vec.pos]
x:125 [binder, in Complexity.NP.TM.LM_to_mTM]
x:126 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
x:126 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
x:126 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:126 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:126 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
x:126 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
x:126 [binder, in Undecidability.TM.Code.Copy]
x:126 [binder, in Undecidability.Shared.Libs.DLW.Vec.pos]
x:126 [binder, in Complexity.NP.TM.LM_to_mTM]
X:127 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
x:127 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:127 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
X:127 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
x:127 [binder, in Undecidability.TM.Code.Code]
x:127 [binder, in Undecidability.TM.Compound.Shift]
x:127 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
x:127 [binder, in Complexity.Complexity.NP]
x:127 [binder, in Complexity.NP.TM.LM_to_mTM]
X:128 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
x:128 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:128 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
x:128 [binder, in Undecidability.TM.Compound.MoveToSymbol]
x:128 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
X:128 [binder, in Undecidability.Synthetic.ListEnumerabilityFacts]
x:128 [binder, in Undecidability.TM.Util.TM_facts]
x:128 [binder, in Undecidability.Shared.Libs.DLW.Vec.pos]
x:128 [binder, in Complexity.NP.TM.LM_to_mTM]
x:129 [binder, in Undecidability.L.Tactics.Extract]
X:129 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:129 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:129 [binder, in Undecidability.TM.Compound.MoveToSymbol]
x:129 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
X:129 [binder, in Complexity.NP.SAT.SAT_inNP]
x:129 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
x:129 [binder, in Undecidability.TM.Util.Relations]
x:129 [binder, in Undecidability.TM.Code.Copy]
x:129 [binder, in Undecidability.TM.Univ.LookupAssociativeListTM]
x:129 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
x:129 [binder, in Complexity.Complexity.NP]
x:129 [binder, in Complexity.NP.TM.LM_to_mTM]
X:13 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
x:13 [binder, in Undecidability.Shared.Libs.PSL.FCI]
x:13 [binder, in Undecidability.TM.Compound.TMTac]
x:13 [binder, in Undecidability.Synthetic.InformativeReducibilityFacts]
x:13 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
X:13 [binder, in Complexity.Complexity.EncodableP]
X:13 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
x:13 [binder, in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
x:13 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
X:13 [binder, in Undecidability.Synthetic.EnumerabilityFacts]
x:13 [binder, in Undecidability.TM.Code.CaseFin]
x:13 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
x:13 [binder, in Undecidability.L.Datatypes.Lists]
X:13 [binder, in Undecidability.TM.Code.BinNumbers.EncodeBinNumbers]
x:13 [binder, in Complexity.Complexity.Subtypes]
x:13 [binder, in Complexity.TM.Single.EncodeTapesInvariants]
X:13 [binder, in Undecidability.L.Complexity.UpToC]
x:13 [binder, in Complexity.TM.PrettyBounds.BaseCodeSpace]
X:13 [binder, in Undecidability.TM.Code.CompareValue]
x:13 [binder, in Undecidability.TM.Univ.LowLevel]
x:13 [binder, in Undecidability.TM.Code.WriteValue]
x:13 [binder, in Complexity.L.Functions.BinNumsSub]
X:13 [binder, in Undecidability.L.Datatypes.LFinType]
x:13 [binder, in Undecidability.L.Tactics.Lbeta_nonrefl]
x:13 [binder, in Undecidability.TM.Code.NatSub]
x:13 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.Arbitrary]
x:13 [binder, in Undecidability.Shared.Libs.PSL.Lists.Power]
X:13 [binder, in Undecidability.Synthetic.Definitions]
x:13 [binder, in Undecidability.L.Functions.UnboundIteration]
x:13 [binder, in Undecidability.Shared.Libs.DLW.Wf.wf_finite]
x:13 [binder, in Undecidability.TM.Code.Copy]
x:13 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
x:13 [binder, in Undecidability.L.Datatypes.List.List_in]
x:13 [binder, in Complexity.L.Functions.BinNumsCompare]
X:13 [binder, in Undecidability.L.Computability.Synthetic]
X:13 [binder, in Undecidability.Shared.ListAutomation]
X:13 [binder, in Undecidability.L.Datatypes.List.List_fold]
x:13 [binder, in Complexity.Complexity.NP]
x:13 [binder, in Complexity.NP.SAT.CookLevin.Reductions.CC_to_BinaryCC]
x:13 [binder, in Undecidability.Synthetic.ReducibilityFacts]
X:13 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.CC]
x:13 [binder, in Undecidability.TM.Hoare.HoareStdLib]
x:13 [binder, in Undecidability.L.Computability.Scott]
x:13 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.DepPairs]
x:13 [binder, in Complexity.TM.PrettyBounds.PrettyBounds]
x:130 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:130 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
x:130 [binder, in Undecidability.L.Tactics.LClos]
x:130 [binder, in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
X:130 [binder, in Undecidability.Shared.Libs.DLW.Utils.php]
x:130 [binder, in Undecidability.TM.Compound.Compare]
X:130 [binder, in Complexity.Complexity.PolyTimeComputable]
x:130 [binder, in Complexity.Complexity.NP]
x:130 [binder, in Complexity.NP.TM.LM_to_mTM]
X:131 [binder, in Complexity.TM.PrettyBounds.BaseCode]
x:131 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
X:131 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
x:131 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
X:131 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
x:131 [binder, in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
x:131 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
x:131 [binder, in Complexity.L.TM.CompCode]
x:131 [binder, in Undecidability.TM.Hoare.HoareRegister]
x:131 [binder, in Undecidability.TM.Util.Relations]
X:131 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
X:131 [binder, in Undecidability.Synthetic.ListEnumerabilityFacts]
x:131 [binder, in Undecidability.TM.Util.TM_facts]
x:131 [binder, in Undecidability.Shared.Libs.DLW.Vec.pos]
X:131 [binder, in Complexity.Complexity.NP]
x:131 [binder, in Complexity.NP.TM.LM_to_mTM]
x:131 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
X:132 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
x:132 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:132 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
x:132 [binder, in Undecidability.TM.Hoare.HoareRegister]
x:132 [binder, in Undecidability.Shared.Libs.DLW.Vec.pos]
x:132 [binder, in Complexity.NP.TM.LM_to_mTM]
x:133 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:133 [binder, in Complexity.NP.SAT.SAT_inNP]
x:133 [binder, in Complexity.NP.TM.LM_to_mTM]
x:134 [binder, in Complexity.TM.PrettyBounds.BaseCode]
x:134 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
x:134 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:134 [binder, in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
x:134 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
x:134 [binder, in Undecidability.TM.Compound.MoveToSymbol]
X:134 [binder, in Complexity.L.TM.TMunflatten]
X:134 [binder, in Undecidability.Synthetic.ListEnumerabilityFacts]
x:134 [binder, in Complexity.Complexity.PolyTimeComputable]
x:134 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
x:134 [binder, in Undecidability.Shared.Libs.DLW.Vec.pos]
x:134 [binder, in Complexity.NP.TM.LM_to_mTM]
X:134 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
x:135 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
x:135 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:135 [binder, in Undecidability.TM.Compound.MoveToSymbol]
X:135 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
x:135 [binder, in Undecidability.TM.Util.TM_facts]
x:135 [binder, in Undecidability.TM.Univ.LookupAssociativeListTM]
x:135 [binder, in Complexity.NP.TM.LM_to_mTM]
X:136 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
X:136 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:136 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:136 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
x:136 [binder, in Complexity.L.TM.TMflatComp]
X:136 [binder, in Complexity.Libs.CookPrelim.PolyBounds]
x:136 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
x:136 [binder, in Undecidability.TM.Hoare.HoareRegister]
x:136 [binder, in Undecidability.TM.Util.Relations]
x:136 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
x:136 [binder, in Complexity.NP.TM.LM_to_mTM]
X:137 [binder, in Complexity.TM.PrettyBounds.BaseCode]
x:137 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:137 [binder, in Undecidability.TM.Util.Relations]
x:137 [binder, in Complexity.NP.TM.LM_to_mTM]
x:138 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
X:138 [binder, in Complexity.L.TM.TMflatComp]
x:138 [binder, in Undecidability.TM.Code.Copy]
x:138 [binder, in Undecidability.TM.Util.TM_facts]
X:138 [binder, in Complexity.Complexity.NP]
x:138 [binder, in Complexity.NP.TM.LM_to_mTM]
x:139 [binder, in Undecidability.L.Prelim.ARS]
X:139 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
x:139 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
X:139 [binder, in Undecidability.L.Tactics.ComputableTime]
x:139 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:139 [binder, in Undecidability.TM.Compound.MoveToSymbol]
X:139 [binder, in Complexity.Libs.CookPrelim.PolyBounds]
x:139 [binder, in Undecidability.TM.Compound.Compare]
X:139 [binder, in Undecidability.Synthetic.ListEnumerabilityFacts]
X:139 [binder, in Complexity.Complexity.PolyTimeComputable]
x:139 [binder, in Complexity.NP.TM.LM_to_mTM]
x:14 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
x:14 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_dec]
x:14 [binder, in Undecidability.TM.Code.CaseList]
X:14 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
x:14 [binder, in Undecidability.L.Util.L_facts]
x:14 [binder, in Undecidability.TM.Code.BinNumbers.PosMultTM]
x:14 [binder, in Undecidability.Shared.Libs.PSL.Retracts]
x:14 [binder, in Undecidability.L.Tactics.Extract]
x:14 [binder, in Undecidability.L.Functions.LoopSum]
X:14 [binder, in Undecidability.Shared.Libs.PSL.EqDec]
X:14 [binder, in Undecidability.Shared.FinTypeEquiv]
X:14 [binder, in Complexity.L.Functions.IterupN]
x:14 [binder, in Undecidability.TM.Code.BinNumbers.NTM]
x:14 [binder, in Undecidability.Shared.FinTypeForallExists]
x:14 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
x:14 [binder, in Complexity.NP.L.GenNPBool]
x:14 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_upto]
x:14 [binder, in Undecidability.Shared.Libs.DLW.Utils.sorting]
x:14 [binder, in Undecidability.TM.Univ.LowLevel]
x:14 [binder, in Complexity.L.Functions.BinNumsSub]
x:14 [binder, in Undecidability.L.Datatypes.LFinType]
X:14 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.Arbitrary]
x:14 [binder, in Undecidability.Shared.Libs.PSL.Lists.Dupfree]
x:14 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
x:14 [binder, in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
x:14 [binder, in Undecidability.Synthetic.Infinite]
X:14 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.Cardinality]
X:14 [binder, in Undecidability.TM.Univ.LookupAssociativeListTM]
x:14 [binder, in Undecidability.L.Functions.Decoding]
x:14 [binder, in Undecidability.L.Computability.Computability]
X:14 [binder, in Undecidability.L.Functions.Encoding]
x:14 [binder, in Undecidability.Synthetic.ReducibilityFacts]
X:14 [binder, in Undecidability.TM.Hoare.HoareExamples]
x:14 [binder, in Undecidability.L.Functions.Size]
x:14 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.CompoundFinTypes]
x:140 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:140 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
x:140 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
x:140 [binder, in Complexity.L.TM.TMunflatten]
x:140 [binder, in Complexity.NP.TM.LM_to_mTM]
x:141 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
x:141 [binder, in Undecidability.L.Tactics.ComputableTime]
x:141 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:141 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:141 [binder, in Undecidability.L.Tactics.LClos]
x:141 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
x:141 [binder, in Undecidability.TM.Compound.MoveToSymbol]
X:141 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
x:141 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
x:141 [binder, in Complexity.NP.TM.LM_to_mTM]
x:142 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:142 [binder, in Complexity.Libs.CookPrelim.PolyBounds]
x:142 [binder, in Undecidability.TM.Hoare.HoareRegister]
x:142 [binder, in Undecidability.TM.Util.Relations]
X:142 [binder, in Undecidability.Synthetic.ListEnumerabilityFacts]
x:142 [binder, in Undecidability.TM.Code.Copy]
x:142 [binder, in Undecidability.TM.Util.TM_facts]
x:142 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
x:142 [binder, in Complexity.NP.TM.LM_to_mTM]
X:142 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
X:143 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
x:143 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
X:143 [binder, in Complexity.Libs.CookPrelim.PolyBounds]
x:143 [binder, in Undecidability.Shared.Libs.DLW.Utils.php]
x:143 [binder, in Complexity.Complexity.PolyTimeComputable]
x:143 [binder, in Undecidability.L.Tactics.Computable]
x:143 [binder, in Complexity.NP.TM.LM_to_mTM]
X:144 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:144 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
X:144 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
X:144 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
X:144 [binder, in Undecidability.Synthetic.ListEnumerabilityFacts]
X:144 [binder, in Complexity.Complexity.NP]
x:144 [binder, in Complexity.NP.TM.LM_to_mTM]
x:145 [binder, in Undecidability.L.Prelim.ARS]
X:145 [binder, in Undecidability.L.Tactics.ComputableTime]
x:145 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:145 [binder, in Undecidability.TM.Compound.MoveToSymbol]
x:145 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
x:145 [binder, in Undecidability.TM.Util.Relations]
x:145 [binder, in Undecidability.TM.Util.TM_facts]
X:145 [binder, in Undecidability.TM.Univ.LookupAssociativeListTM]
x:145 [binder, in Complexity.NP.TM.LM_to_mTM]
x:146 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
X:146 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
x:146 [binder, in Complexity.Libs.CookPrelim.PolyBounds]
x:146 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
x:146 [binder, in Undecidability.L.Tactics.Computable]
x:146 [binder, in Complexity.NP.TM.LM_to_mTM]
x:146 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
x:147 [binder, in Complexity.TM.PrettyBounds.UnivBounds]
x:147 [binder, in Undecidability.L.Tactics.ComputableTime]
x:147 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
X:147 [binder, in Complexity.L.TM.CompCode]
X:147 [binder, in Complexity.Libs.CookPrelim.PolyBounds]
x:147 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
x:147 [binder, in Undecidability.TM.Compound.Compare]
x:147 [binder, in Undecidability.TM.Code.Copy]
x:147 [binder, in Complexity.NP.TM.LM_to_mTM]
x:148 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:148 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:148 [binder, in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
X:148 [binder, in Complexity.L.TM.TMunflatten]
x:148 [binder, in Undecidability.TM.Hoare.HoareRegister]
X:148 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachine]
X:148 [binder, in Undecidability.TM.Code.Code]
x:148 [binder, in Undecidability.TM.Util.TM_facts]
x:148 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
x:148 [binder, in Complexity.Complexity.NP]
x:148 [binder, in Complexity.NP.TM.LM_to_mTM]
x:148 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
x:149 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:149 [binder, in Undecidability.TM.Compound.MoveToSymbol]
x:149 [binder, in Undecidability.Shared.Libs.DLW.Utils.php]
x:149 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
x:149 [binder, in Undecidability.TM.Univ.LookupAssociativeListTM]
x:149 [binder, in Complexity.Complexity.NP]
x:149 [binder, in Complexity.NP.TM.LM_to_mTM]
x:15 [binder, in Complexity.Libs.Pigeonhole]
X:15 [binder, in Undecidability.L.Prelim.ARS]
X:15 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
x:15 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_quotient]
x:15 [binder, in Undecidability.Shared.Libs.PSL.FCI]
x:15 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_dec]
X:15 [binder, in Undecidability.TM.Compound.TMTac]
x:15 [binder, in Complexity.L.Datatypes.LBinNums]
x:15 [binder, in Undecidability.Synthetic.InformativeReducibilityFacts]
x:15 [binder, in Undecidability.Shared.Libs.PSL.Lists.Removal]
x:15 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds_Loop]
x:15 [binder, in Undecidability.Shared.Libs.PSL.Retracts]
X:15 [binder, in Undecidability.L.Tactics.Extract]
X:15 [binder, in Undecidability.L.Functions.LoopSum]
X:15 [binder, in Undecidability.TM.PrettyBounds.SizeBounds]
X:15 [binder, in Undecidability.Synthetic.EnumerabilityFacts]
X:15 [binder, in Undecidability.L.Prelim.LoopSum]
x:15 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
X:15 [binder, in Undecidability.L.Datatypes.Lists]
x:15 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
x:15 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
x:15 [binder, in Undecidability.TM.Code.BinNumbers.EncodeBinNumbers]
x:15 [binder, in Complexity.Complexity.Subtypes]
x:15 [binder, in Undecidability.TM.Basic.Mono]
x:15 [binder, in Undecidability.L.Prelim.MoreBase]
x:15 [binder, in Complexity.L.TM.CompCode]
x:15 [binder, in Undecidability.Shared.FinTypeForallExists]
x:15 [binder, in Undecidability.Shared.Libs.DLW.Wf.acc_irr]
x:15 [binder, in Complexity.NP.L.GenNPBool]
X:15 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
x:15 [binder, in Complexity.L.AbstractMachines.FlatPro.Computable.Compile]
x:15 [binder, in Complexity.L.Functions.BinNumsSub]
X:15 [binder, in Complexity.Complexity.UpToCPoly]
x:15 [binder, in Undecidability.Shared.Libs.DLW.Utils.php]
X:15 [binder, in Undecidability.L.Datatypes.LFinType]
x:15 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_base]
X:15 [binder, in Undecidability.L.Tactics.Lbeta_nonrefl]
x:15 [binder, in Undecidability.Synthetic.MoreEnumerabilityFacts]
x:15 [binder, in Undecidability.TM.Util.Relations]
x:15 [binder, in Undecidability.Shared.Libs.DLW.Wf.wf_finite]
X:15 [binder, in Undecidability.Synthetic.ListEnumerabilityFacts]
x:15 [binder, in Undecidability.L.TM.TMEncoding]
x:15 [binder, in Undecidability.Shared.Libs.PSL.Vectors.VectorDupfree]
X:15 [binder, in Undecidability.Shared.Dec]
x:15 [binder, in Complexity.L.Functions.BinNumsCompare]
x:15 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
X:15 [binder, in Undecidability.Shared.ListAutomation]
x:15 [binder, in Complexity.Complexity.Monotonic]
x:15 [binder, in Undecidability.TM.Code.CasePair]
X:15 [binder, in Undecidability.Synthetic.ReducibilityFacts]
x:15 [binder, in Undecidability.TM.Code.BinNumbers.PosAddTM]
X:15 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.CompoundFinTypes]
x:150 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
X:150 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
x:150 [binder, in Undecidability.TM.Compound.MoveToSymbol]
x:150 [binder, in Complexity.L.TM.TMflatComp]
x:150 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
x:150 [binder, in Undecidability.TM.Code.Copy]
x:150 [binder, in Undecidability.TM.Util.TM_facts]
x:150 [binder, in Complexity.Complexity.NP]
x:150 [binder, in Complexity.NP.TM.LM_to_mTM]
X:150 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
x:151 [binder, in Undecidability.L.Prelim.ARS]
X:151 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:151 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:151 [binder, in Complexity.Libs.CookPrelim.PolyBounds]
x:151 [binder, in Undecidability.TM.Compound.Compare]
x:151 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
x:151 [binder, in Complexity.Complexity.NP]
x:151 [binder, in Complexity.NP.TM.LM_to_mTM]
x:152 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:152 [binder, in Complexity.Libs.CookPrelim.PolyBounds]
x:152 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
x:152 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachine]
x:152 [binder, in Undecidability.TM.Univ.LookupAssociativeListTM]
x:152 [binder, in Complexity.Complexity.NP]
x:152 [binder, in Complexity.NP.TM.LM_to_mTM]
x:153 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
X:153 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
x:153 [binder, in Undecidability.TM.Util.TM_facts]
x:153 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
x:153 [binder, in Complexity.Complexity.NP]
x:153 [binder, in Complexity.NP.TM.LM_to_mTM]
x:154 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
X:154 [binder, in Complexity.L.TM.TMflatComp]
X:154 [binder, in Undecidability.Shared.Libs.DLW.Utils.php]
x:154 [binder, in Undecidability.TM.Compound.Compare]
X:154 [binder, in Complexity.Complexity.NP]
x:154 [binder, in Complexity.NP.TM.LM_to_mTM]
x:154 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
x:155 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:155 [binder, in Undecidability.TM.Compound.MoveToSymbol]
x:155 [binder, in Complexity.NP.TM.LM_to_mTM]
x:156 [binder, in Undecidability.L.Prelim.ARS]
X:156 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:156 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:156 [binder, in Undecidability.TM.Compound.MoveToSymbol]
x:156 [binder, in Complexity.NP.TM.LM_to_mTM]
x:157 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:157 [binder, in Undecidability.TM.Util.TM_facts]
x:157 [binder, in Complexity.NP.TM.LM_to_mTM]
X:157 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
X:158 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
x:158 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
X:158 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
x:158 [binder, in Undecidability.TM.Compound.MoveToSymbol]
X:158 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
x:158 [binder, in Undecidability.TM.Univ.LookupAssociativeListTM]
x:158 [binder, in Complexity.NP.TM.LM_to_mTM]
x:159 [binder, in Undecidability.L.Prelim.ARS]
X:159 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
x:159 [binder, in Undecidability.L.Tactics.ComputableTime]
x:159 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
X:159 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
x:159 [binder, in Undecidability.Shared.Libs.DLW.Utils.php]
x:159 [binder, in Complexity.NP.TM.LM_to_mTM]
X:16 [binder, in Undecidability.Shared.Libs.PSL.Numbers]
X:16 [binder, in Complexity.TM.PrettyBounds.BaseCode]
x:16 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_dec]
x:16 [binder, in Undecidability.Synthetic.InformativeReducibilityFacts]
X:16 [binder, in Complexity.Complexity.EncodableP]
x:16 [binder, in Undecidability.L.Datatypes.List.List_basics]
x:16 [binder, in Complexity.TM.PrettyBounds.UnivBounds]
x:16 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
x:16 [binder, in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
x:16 [binder, in Undecidability.L.Datatypes.LSum]
x:16 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
x:16 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
X:16 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
X:16 [binder, in Complexity.TM.Single.EncodeTapesInvariants]
x:16 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
x:16 [binder, in Complexity.TM.PrettyBounds.BaseCodeSpace]
x:16 [binder, in Complexity.NP.L.GenNPBool]
X:16 [binder, in Complexity.Libs.CookPrelim.PolyBounds]
x:16 [binder, in Undecidability.Shared.Libs.DLW.Utils.sorting]
x:16 [binder, in Complexity.L.Functions.BinNumsSub]
X:16 [binder, in Undecidability.TM.Hoare.HoareRegister]
X:16 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_base]
x:16 [binder, in Undecidability.TM.Code.NatSub]
x:16 [binder, in Undecidability.L.Computability.Decidability]
x:16 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.Arbitrary]
x:16 [binder, in Undecidability.L.Datatypes.List.List_eqb]
x:16 [binder, in Undecidability.Shared.Libs.PSL.Lists.Power]
x:16 [binder, in Undecidability.Synthetic.Definitions]
x:16 [binder, in Complexity.TM.Compound.MoveToSymbol_niceSpec]
X:16 [binder, in Undecidability.L.Tactics.ComputableTactics]
X:16 [binder, in Undecidability.Shared.Dec]
x:16 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
X:16 [binder, in Undecidability.Synthetic.Infinite]
x:16 [binder, in Complexity.Complexity.Definitions]
x:16 [binder, in Complexity.Complexity.Monotonic]
x:16 [binder, in Undecidability.L.Functions.Decoding]
x:16 [binder, in Undecidability.L.Datatypes.LNat]
x:16 [binder, in Complexity.Complexity.NP]
X:16 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.CC]
x:16 [binder, in Complexity.L.AbstractMachines.Computable.LargestVar]
x:16 [binder, in Undecidability.TM.Code.List.App]
x:16 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.DepPairs]
X:160 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
x:160 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:160 [binder, in Undecidability.TM.Util.TM_facts]
x:160 [binder, in Complexity.NP.TM.LM_to_mTM]
x:160 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
X:161 [binder, in Undecidability.L.Prelim.ARS]
X:161 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:161 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:161 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
x:161 [binder, in Complexity.NP.TM.LM_to_mTM]
x:162 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
X:162 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
x:162 [binder, in Undecidability.TM.Compound.MoveToSymbol]
x:162 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
X:162 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
x:162 [binder, in Undecidability.TM.Compound.Compare]
x:162 [binder, in Undecidability.TM.Code.Copy]
x:162 [binder, in Complexity.NP.TM.LM_to_mTM]
X:162 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
X:163 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
x:163 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:163 [binder, in Undecidability.Shared.Libs.DLW.Utils.php]
x:163 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
x:163 [binder, in Complexity.NP.TM.LM_to_mTM]
x:164 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:164 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:164 [binder, in Complexity.L.TM.TMflatComp]
x:164 [binder, in Undecidability.TM.Util.TM_facts]
x:164 [binder, in Complexity.NP.TM.LM_to_mTM]
x:165 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
X:165 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
x:165 [binder, in Undecidability.TM.Compound.Compare]
x:165 [binder, in Complexity.NP.TM.LM_to_mTM]
x:166 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
x:166 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:166 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
x:166 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
x:166 [binder, in Complexity.NP.TM.LM_to_mTM]
x:166 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
X:167 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
X:167 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:167 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:167 [binder, in Complexity.L.TM.TMflatComp]
x:167 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
x:167 [binder, in Complexity.NP.TM.LM_to_mTM]
X:168 [binder, in Undecidability.L.Tactics.ComputableTime]
x:168 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:168 [binder, in Undecidability.TM.Compound.MoveToSymbol]
X:168 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
x:168 [binder, in Undecidability.TM.Code.Copy]
x:168 [binder, in Complexity.NP.TM.LM_to_mTM]
x:169 [binder, in Undecidability.L.Tactics.ComputableTime]
x:169 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
X:169 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
x:169 [binder, in Complexity.NP.TM.LM_to_mTM]
X:169 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
x:17 [binder, in Undecidability.L.Datatypes.LProd]
X:17 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
x:17 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_quotient]
x:17 [binder, in Complexity.L.AbstractMachines.Computable.EvalForTime]
x:17 [binder, in Undecidability.TM.Code.CaseList]
x:17 [binder, in Complexity.NP.L.GenNP_is_hard]
x:17 [binder, in Undecidability.Shared.FilterFacts]
X:17 [binder, in Undecidability.L.Datatypes.List.List_basics]
x:17 [binder, in Undecidability.Shared.Libs.PSL.Retracts]
X:17 [binder, in Undecidability.TM.Util.VectorPrelim]
x:17 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
x:17 [binder, in Undecidability.Shared.Libs.PSL.Lists.Filter]
X:17 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_nat_facts]
X:17 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
x:17 [binder, in Undecidability.TM.Code.BinNumbers.EncodeBinNumbers]
x:17 [binder, in Complexity.Complexity.Subtypes]
x:17 [binder, in Undecidability.Shared.Libs.DLW.Utils.interval]
x:17 [binder, in Complexity.L.Functions.IterupN]
x:17 [binder, in Undecidability.Shared.FinTypeForallExists]
x:17 [binder, in Undecidability.Shared.Libs.DLW.Wf.wf_incl]
x:17 [binder, in Undecidability.Shared.Libs.DLW.Wf.acc_irr]
x:17 [binder, in Complexity.NP.L.GenNPBool]
x:17 [binder, in Complexity.Libs.UniformHomomorphisms]
x:17 [binder, in Complexity.L.AbstractMachines.FlatPro.Computable.Compile]
x:17 [binder, in Undecidability.TM.Univ.LowLevel]
x:17 [binder, in Complexity.L.Functions.BinNumsSub]
x:17 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
x:17 [binder, in Undecidability.L.Datatypes.LFinType]
X:17 [binder, in Undecidability.Synthetic.MoreEnumerabilityFacts]
x:17 [binder, in Undecidability.L.Functions.UnboundIteration]
X:17 [binder, in Undecidability.TM.Util.Relations]
x:17 [binder, in Undecidability.TM.Code.Copy]
x:17 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
X:17 [binder, in Undecidability.Synthetic.DecidabilityFacts]
X:17 [binder, in Undecidability.Shared.Libs.PSL.Vectors.VectorDupfree]
x:17 [binder, in Complexity.L.Functions.BinNumsCompare]
X:17 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
x:17 [binder, in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
x:17 [binder, in Undecidability.Shared.Libs.PSL.Lists.Cardinality]
X:17 [binder, in Undecidability.L.Computability.Synthetic]
X:17 [binder, in Complexity.Complexity.Definitions]
X:17 [binder, in Undecidability.L.Functions.Decoding]
x:17 [binder, in Undecidability.TM.Code.CasePair]
x:17 [binder, in Undecidability.L.Tactics.Computable]
x:17 [binder, in Undecidability.TM.Code.BinNumbers.PosAddTM]
x:17 [binder, in Undecidability.TM.Hoare.HoareExamples]
X:17 [binder, in Complexity.NP.TM.LM_to_mTM]
x:17 [binder, in Complexity.TM.PrettyBounds.PrettyBounds]
X:170 [binder, in Undecidability.L.Tactics.ComputableTime]
x:170 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
X:170 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
x:170 [binder, in Complexity.NP.TM.LM_to_mTM]
x:171 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:171 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
x:171 [binder, in Complexity.NP.TM.LM_to_mTM]
x:172 [binder, in Undecidability.L.Tactics.ComputableTime]
x:172 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:172 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
x:172 [binder, in Complexity.NP.TM.LM_to_mTM]
X:173 [binder, in Undecidability.L.Prelim.ARS]
X:173 [binder, in Undecidability.L.Tactics.ComputableTime]
x:173 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:173 [binder, in Complexity.L.TM.TMflatComp]
x:173 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
x:173 [binder, in Undecidability.TM.Compound.Compare]
x:173 [binder, in Undecidability.TM.Code.Copy]
x:173 [binder, in Complexity.NP.TM.LM_to_mTM]
x:173 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
x:174 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:174 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
X:174 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
X:174 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
x:174 [binder, in Complexity.NP.TM.LM_to_mTM]
X:174 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
x:175 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:175 [binder, in Undecidability.TM.Compound.MoveToSymbol]
x:175 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
x:175 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
x:175 [binder, in Complexity.NP.TM.LM_to_mTM]
x:176 [binder, in Undecidability.L.Tactics.ComputableTime]
x:176 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:176 [binder, in Complexity.L.TM.TMflatComp]
x:176 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
x:176 [binder, in Complexity.NP.TM.LM_to_mTM]
x:177 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
X:177 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
x:177 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
x:177 [binder, in Complexity.NP.TM.LM_to_mTM]
x:177 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
X:178 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
x:178 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
x:178 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:178 [binder, in Undecidability.TM.Compound.MoveToSymbol]
X:178 [binder, in Undecidability.TM.Hoare.HoareLogic]
x:178 [binder, in Complexity.NP.TM.LM_to_mTM]
X:179 [binder, in Undecidability.L.Prelim.ARS]
x:179 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:179 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
x:179 [binder, in Complexity.NP.TM.LM_to_mTM]
X:179 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
x:18 [binder, in Complexity.Libs.Pigeonhole]
X:18 [binder, in Undecidability.L.Prelim.ARS]
x:18 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
x:18 [binder, in Complexity.TM.PrettyBounds.BaseCode]
X:18 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_dec]
x:18 [binder, in Complexity.L.Datatypes.LBinNums]
x:18 [binder, in Complexity.NP.L.GenNP_is_hard]
x:18 [binder, in Undecidability.L.Util.L_facts]
x:18 [binder, in Undecidability.Shared.Libs.PSL.Lists.Removal]
X:18 [binder, in Undecidability.TM.Code.List.Nth]
x:18 [binder, in Complexity.TM.Code.Decode]
x:18 [binder, in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
x:18 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
X:18 [binder, in Undecidability.Shared.FinTypeEquiv]
x:18 [binder, in Complexity.Complexity.Subtypes]
x:18 [binder, in Undecidability.Shared.Libs.DLW.Wf.wf_incl]
X:18 [binder, in Undecidability.L.Complexity.UpToC]
x:18 [binder, in Complexity.NP.L.GenNPBool]
x:18 [binder, in Complexity.Libs.UniformHomomorphisms]
x:18 [binder, in Undecidability.Shared.Libs.DLW.Utils.list_bool]
X:18 [binder, in Undecidability.TM.Code.WriteValue]
x:18 [binder, in Complexity.L.Functions.BinNumsSub]
x:18 [binder, in Undecidability.Shared.Libs.DLW.Utils.php]
x:18 [binder, in Undecidability.L.Datatypes.LFinType]
X:18 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_base]
x:18 [binder, in Undecidability.Shared.Libs.PSL.Bijection]
x:18 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.Arbitrary]
x:18 [binder, in Undecidability.Shared.Libs.PSL.Lists.Power]
X:18 [binder, in Undecidability.Synthetic.Definitions]
X:18 [binder, in Undecidability.Shared.Libs.PSL.Lists.Dupfree]
x:18 [binder, in Undecidability.Synthetic.ListEnumerabilityFacts]
X:18 [binder, in Undecidability.Shared.Dec]
x:18 [binder, in Undecidability.TM.L.CaseCom]
x:18 [binder, in Undecidability.L.Datatypes.LNat]
x:18 [binder, in Complexity.Complexity.PolyTimeComputable]
x:18 [binder, in Undecidability.TM.Code.List.App]
x:18 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.CompoundFinTypes]
x:180 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
X:180 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
x:180 [binder, in Undecidability.TM.Code.Code]
x:180 [binder, in Complexity.NP.TM.LM_to_mTM]
x:181 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
X:181 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
x:181 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
x:181 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
x:181 [binder, in Undecidability.TM.Code.Copy]
x:181 [binder, in Undecidability.TM.Code.Code]
x:181 [binder, in Complexity.NP.TM.LM_to_mTM]
x:182 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
x:182 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:182 [binder, in Undecidability.TM.Compound.MoveToSymbol]
x:182 [binder, in Complexity.L.TM.TMflatComp]
x:182 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
x:182 [binder, in Undecidability.TM.Hoare.HoareLogic]
x:182 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
x:182 [binder, in Complexity.NP.TM.LM_to_mTM]
x:182 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
x:183 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:183 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
x:183 [binder, in Complexity.NP.TM.LM_to_mTM]
X:184 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
x:184 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:184 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
X:184 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
x:184 [binder, in Complexity.NP.TM.LM_to_mTM]
X:184 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
x:185 [binder, in Undecidability.L.Tactics.ComputableTime]
x:185 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:185 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
X:185 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
X:185 [binder, in Complexity.L.TM.TMflatComp]
x:185 [binder, in Undecidability.TM.Code.Copy]
x:185 [binder, in Complexity.NP.TM.LM_to_mTM]
x:186 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:186 [binder, in Complexity.NP.TM.LM_to_mTM]
X:187 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
x:187 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
X:187 [binder, in Undecidability.L.Tactics.ComputableTime]
x:187 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:187 [binder, in Complexity.NP.TM.LM_to_mTM]
X:188 [binder, in Undecidability.L.Prelim.ARS]
X:188 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:188 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
X:188 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
x:188 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
x:188 [binder, in Complexity.NP.TM.LM_to_mTM]
X:188 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
x:189 [binder, in Undecidability.L.Tactics.ComputableTime]
x:189 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:189 [binder, in Undecidability.TM.Compound.MoveToSymbol]
x:189 [binder, in Complexity.NP.TM.LM_to_mTM]
x:19 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
x:19 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
x:19 [binder, in Undecidability.Shared.Libs.PSL.FCI]
X:19 [binder, in Undecidability.TM.Compound.TMTac]
x:19 [binder, in Complexity.NP.L.GenNP_is_hard]
x:19 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
X:19 [binder, in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
x:19 [binder, in Complexity.TM.Code.Decode]
X:19 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
X:19 [binder, in Undecidability.TM.Hoare.HoareLegacy]
x:19 [binder, in Undecidability.TM.PrettyBounds.SizeBounds]
x:19 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
X:19 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
x:19 [binder, in Complexity.TM.Code.DecodeList]
X:19 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
x:19 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
x:19 [binder, in Complexity.Complexity.Subtypes]
x:19 [binder, in Undecidability.Shared.Libs.DLW.Utils.interval]
X:19 [binder, in Complexity.L.Functions.IterupN]
x:19 [binder, in Undecidability.TM.Code.BinNumbers.NTM]
x:19 [binder, in Undecidability.L.Datatypes.LVector]
x:19 [binder, in Complexity.NP.L.GenNPBool]
x:19 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_upto]
x:19 [binder, in Undecidability.TM.Univ.LowLevel]
x:19 [binder, in Complexity.L.Functions.BinNumsSub]
X:19 [binder, in Complexity.Complexity.UpToCPoly]
X:19 [binder, in Undecidability.L.Datatypes.LFinType]
x:19 [binder, in Undecidability.TM.Hoare.HoareRegister]
X:19 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_base]
x:19 [binder, in Undecidability.L.Tactics.Lbeta_nonrefl]
x:19 [binder, in Undecidability.L.Computability.Decidability]
x:19 [binder, in Undecidability.Shared.Libs.DLW.Wf.wf_finite]
x:19 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
x:19 [binder, in Undecidability.L.Tactics.ComputableTactics]
x:19 [binder, in Undecidability.TM.Code.Code]
x:19 [binder, in Undecidability.L.Functions.FinTypeLookup]
X:19 [binder, in Undecidability.Shared.ListAutomation]
x:19 [binder, in Undecidability.TM.Univ.LookupAssociativeListTM]
x:19 [binder, in Complexity.Complexity.Monotonic]
x:19 [binder, in Undecidability.Shared.Libs.DLW.Utils.seteq]
X:19 [binder, in Complexity.Complexity.PolyTimeComputable]
x:19 [binder, in Undecidability.L.Functions.Encoding]
x:19 [binder, in Undecidability.Synthetic.ReducibilityFacts]
X:19 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.CC]
x:19 [binder, in Complexity.NP.TM.TMGenNP_fixed_mTM]
x:190 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
x:190 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:190 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:190 [binder, in Complexity.NP.TM.LM_to_mTM]
x:191 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:191 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
x:191 [binder, in Complexity.NP.TM.LM_to_mTM]
x:192 [binder, in Undecidability.L.Prelim.ARS]
x:192 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
X:192 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:192 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:192 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
x:192 [binder, in Complexity.NP.TM.LM_to_mTM]
X:193 [binder, in Undecidability.L.Tactics.ComputableTime]
x:193 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:193 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
X:193 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
x:193 [binder, in Complexity.NP.TM.LM_to_mTM]
X:194 [binder, in Undecidability.L.Prelim.ARS]
X:194 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
x:194 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:194 [binder, in Undecidability.TM.Compound.MoveToSymbol]
x:194 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
x:194 [binder, in Complexity.NP.TM.LM_to_mTM]
X:194 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
x:195 [binder, in Undecidability.L.Tactics.ComputableTime]
x:195 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:195 [binder, in Complexity.NP.TM.LM_to_mTM]
x:196 [binder, in Undecidability.L.Prelim.ARS]
x:196 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:196 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
x:196 [binder, in Complexity.NP.TM.LM_to_mTM]
x:197 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
X:197 [binder, in Complexity.L.TM.TMflatComp]
x:197 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
x:197 [binder, in Undecidability.TM.Code.Copy]
x:197 [binder, in Complexity.NP.TM.LM_to_mTM]
X:198 [binder, in Undecidability.L.Prelim.ARS]
x:198 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
x:198 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:198 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:198 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
X:198 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
x:198 [binder, in Undecidability.TM.Util.TM_facts]
x:198 [binder, in Complexity.NP.TM.LM_to_mTM]
X:199 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:199 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:199 [binder, in Complexity.NP.TM.LM_to_mTM]
x:2 [binder, in Undecidability.Shared.Libs.PSL.Numbers]
x:2 [binder, in Undecidability.L.Prelim.ARS]
x:2 [binder, in Complexity.L.Datatypes.LBinNums]
x:2 [binder, in Undecidability.Shared.FilterFacts]
x:2 [binder, in Undecidability.TM.Code.BinNumbers.PosMultTM]
X:2 [binder, in Complexity.TM.PrettyBounds.UnivBounds]
X:2 [binder, in Complexity.TM.Code.Decode]
x:2 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
X:2 [binder, in Undecidability.TM.Code.List.Cons_constant]
x:2 [binder, in Undecidability.Shared.Libs.PSL.Lists.Filter]
x:2 [binder, in Undecidability.Shared.FinTypeEquiv]
X:2 [binder, in Complexity.TM.Code.DecodeList]
x:2 [binder, in Undecidability.Shared.Libs.DLW.Utils.interval]
x:2 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
x:2 [binder, in Undecidability.Shared.embed_nat]
x:2 [binder, in Complexity.L.Functions.BinNumsSub]
x:2 [binder, in Complexity.Complexity.UpToCPoly]
X:2 [binder, in Undecidability.L.Datatypes.LFinType]
x:2 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicFinTypes]
x:2 [binder, in Complexity.L.AbstractMachines.Computable.Lookup]
x:2 [binder, in Undecidability.TM.Hoare.HoareTacticsView]
x:2 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
X:2 [binder, in Undecidability.TM.Code.Code]
x:2 [binder, in Undecidability.Synthetic.Infinite]
X:2 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.Cardinality]
x:2 [binder, in Complexity.Complexity.Monotonic]
x:2 [binder, in Undecidability.L.Datatypes.LNat]
x:2 [binder, in Undecidability.TM.Code.BinNumbers.PosAddTM]
X:2 [binder, in Undecidability.TM.Hoare.HoareExamples]
x:2 [binder, in Complexity.TM.PrettyBounds.PrettyBounds]
x:2 [binder, in Complexity.L.Functions.BinNumsAdd]
x:20 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
x:20 [binder, in Complexity.L.AbstractMachines.Computable.EvalForTime]
x:20 [binder, in Complexity.NP.L.GenNP_is_hard]
X:20 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
x:20 [binder, in Undecidability.L.Util.L_facts]
x:20 [binder, in Undecidability.Shared.FilterFacts]
x:20 [binder, in Complexity.HierarchyTheorem.TimeHierarchyTheorem]
X:20 [binder, in Undecidability.L.Datatypes.List.List_basics]
x:20 [binder, in Undecidability.L.Datatypes.LSum]
x:20 [binder, in Undecidability.TM.PrettyBounds.SizeBounds]
x:20 [binder, in Undecidability.Synthetic.EnumerabilityFacts]
x:20 [binder, in Undecidability.L.Prelim.LoopSum]
x:20 [binder, in Undecidability.Shared.Libs.PSL.Lists.Filter]
x:20 [binder, in Complexity.Complexity.Subtypes]
x:20 [binder, in Complexity.L.AbstractMachines.Computable.UnivDecTime]
x:20 [binder, in Undecidability.L.Datatypes.LVector]
x:20 [binder, in Complexity.NP.L.GenNPBool]
X:20 [binder, in Complexity.L.TM.TMflatComp]
X:20 [binder, in Undecidability.L.Datatypes.List.List_nat]
x:20 [binder, in Complexity.Libs.UniformHomomorphisms]
X:20 [binder, in Complexity.Libs.CookPrelim.PolyBounds]
X:20 [binder, in Undecidability.TM.Univ.LowLevel]
X:20 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_base]
x:20 [binder, in Undecidability.Synthetic.MoreEnumerabilityFacts]
X:20 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TM_single]
x:20 [binder, in Complexity.Complexity.SpaceBoundsTime]
X:20 [binder, in Undecidability.Synthetic.ListEnumerabilityFacts]
x:20 [binder, in Undecidability.TM.Code.Copy]
x:20 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
x:20 [binder, in Undecidability.Synthetic.DecidabilityFacts]
x:20 [binder, in Undecidability.Shared.Libs.PSL.Vectors.VectorDupfree]
x:20 [binder, in Undecidability.L.Tactics.ComputableTactics]
x:20 [binder, in Undecidability.Synthetic.Infinite]
x:20 [binder, in Complexity.Complexity.Monotonic]
x:20 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
X:20 [binder, in Undecidability.TM.Code.CasePair]
x:20 [binder, in Complexity.NP.L.GenNP]
X:20 [binder, in Undecidability.L.Functions.Encoding]
x:20 [binder, in Undecidability.Synthetic.ReducibilityFacts]
x:20 [binder, in Undecidability.TM.Code.BinNumbers.PosAddTM]
X:20 [binder, in Undecidability.TM.Hoare.HoareExamples]
x:20 [binder, in Complexity.NP.TM.LM_to_mTM]
x:20 [binder, in Complexity.L.Functions.BinNumsAdd]
x:200 [binder, in Undecidability.L.Prelim.ARS]
x:200 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:200 [binder, in Undecidability.TM.Compound.Compare]
X:200 [binder, in Undecidability.TM.Code.Copy]
x:200 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
x:200 [binder, in Complexity.NP.TM.LM_to_mTM]
x:201 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
x:201 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:201 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
x:201 [binder, in Undecidability.TM.Compound.Compare]
x:201 [binder, in Complexity.NP.TM.LM_to_mTM]
X:202 [binder, in Undecidability.L.Prelim.ARS]
X:202 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
x:202 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:202 [binder, in Undecidability.TM.Compound.Compare]
x:202 [binder, in Undecidability.TM.Code.Copy]
x:202 [binder, in Complexity.NP.TM.LM_to_mTM]
X:202 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
X:203 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
x:203 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:203 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:203 [binder, in Undecidability.TM.Compound.Compare]
x:203 [binder, in Complexity.NP.TM.LM_to_mTM]
X:204 [binder, in Undecidability.L.Prelim.ARS]
x:204 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:204 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
x:204 [binder, in Complexity.NP.TM.LM_to_mTM]
x:205 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:205 [binder, in Undecidability.TM.Code.Copy]
x:205 [binder, in Complexity.NP.TM.LM_to_mTM]
X:206 [binder, in Undecidability.L.Prelim.ARS]
x:206 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:206 [binder, in Complexity.NP.TM.LM_to_mTM]
X:206 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
x:207 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:207 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:207 [binder, in Complexity.L.TM.TMunflatten]
x:207 [binder, in Undecidability.TM.Util.TM_facts]
x:207 [binder, in Complexity.NP.TM.LM_to_mTM]
x:208 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:208 [binder, in Undecidability.TM.Code.Copy]
x:208 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
x:208 [binder, in Complexity.NP.TM.LM_to_mTM]
X:209 [binder, in Undecidability.L.Prelim.ARS]
x:209 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
x:209 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:209 [binder, in Complexity.NP.TM.LM_to_mTM]
X:209 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
x:21 [binder, in Undecidability.L.Prelim.ARS]
X:21 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
x:21 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_quotient]
x:21 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_dec]
x:21 [binder, in Complexity.NP.L.GenNP_is_hard]
x:21 [binder, in Undecidability.L.Util.L_facts]
x:21 [binder, in Undecidability.Shared.Libs.PSL.Lists.Removal]
x:21 [binder, in Undecidability.Shared.Libs.PSL.Retracts]
x:21 [binder, in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
x:21 [binder, in Undecidability.TM.PrettyBounds.SizeBounds]
x:21 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
x:21 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_nat_facts]
X:21 [binder, in Complexity.Complexity.Subtypes]
x:21 [binder, in Undecidability.L.Datatypes.LVector]
x:21 [binder, in Undecidability.L.Complexity.UpToC]
x:21 [binder, in Complexity.TM.PrettyBounds.BaseCodeSpace]
x:21 [binder, in Complexity.NP.L.GenNPBool]
x:21 [binder, in Undecidability.Shared.Libs.DLW.Utils.list_bool]
x:21 [binder, in Undecidability.TM.Code.WriteValue]
x:21 [binder, in Complexity.L.Functions.BinNumsSub]
x:21 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
x:21 [binder, in Undecidability.TM.Code.CaseSum]
x:21 [binder, in Undecidability.L.Datatypes.LFinType]
X:21 [binder, in Undecidability.L.Functions.EqBool]
X:21 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.Arbitrary]
X:21 [binder, in Undecidability.Synthetic.Definitions]
x:21 [binder, in Undecidability.TM.Util.Relations]
x:21 [binder, in Undecidability.Synthetic.DecidabilityFacts]
x:21 [binder, in Undecidability.L.Tactics.ComputableTactics]
x:21 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
x:21 [binder, in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
x:21 [binder, in Undecidability.L.Computability.Synthetic]
x:21 [binder, in Complexity.Complexity.Monotonic]
x:21 [binder, in Complexity.TM.Single.DecodeTape]
x:21 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
x:21 [binder, in Undecidability.TM.PrettyBounds.MaxList]
X:21 [binder, in Undecidability.Synthetic.ReducibilityFacts]
x:210 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:210 [binder, in Complexity.NP.TM.LM_to_mTM]
x:210 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
x:211 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
X:211 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
x:211 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
x:211 [binder, in Complexity.NP.TM.LM_to_mTM]
X:212 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
x:212 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:212 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
x:212 [binder, in Undecidability.TM.Code.Copy]
x:212 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
x:212 [binder, in Complexity.NP.TM.LM_to_mTM]
x:213 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:213 [binder, in Complexity.NP.TM.LM_to_mTM]
X:213 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
x:214 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:214 [binder, in Undecidability.TM.Compound.Compare]
x:214 [binder, in Undecidability.TM.Util.TM_facts]
x:214 [binder, in Complexity.NP.TM.LM_to_mTM]
x:214 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
x:215 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:215 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:215 [binder, in Undecidability.TM.Compound.Compare]
x:215 [binder, in Undecidability.TM.Code.Copy]
x:215 [binder, in Complexity.NP.TM.LM_to_mTM]
x:216 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:216 [binder, in Undecidability.TM.Compound.Compare]
x:216 [binder, in Complexity.NP.TM.LM_to_mTM]
X:217 [binder, in Undecidability.L.Prelim.ARS]
X:217 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
X:217 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
x:217 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:217 [binder, in Undecidability.TM.Compound.Compare]
X:217 [binder, in Undecidability.TM.Code.Copy]
x:217 [binder, in Complexity.NP.TM.LM_to_mTM]
X:217 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
x:218 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:218 [binder, in Undecidability.TM.Util.TM_facts]
x:218 [binder, in Complexity.NP.TM.LM_to_mTM]
x:218 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
x:219 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:219 [binder, in Undecidability.TM.Code.Copy]
x:219 [binder, in Complexity.NP.TM.LM_to_mTM]
x:22 [binder, in Undecidability.Shared.Libs.PSL.Numbers]
x:22 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_dec]
x:22 [binder, in Complexity.NP.L.GenNP_is_hard]
X:22 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
x:22 [binder, in Undecidability.L.Util.L_facts]
X:22 [binder, in Undecidability.L.Complexity.UpToCNary]
X:22 [binder, in Undecidability.L.Tactics.ComputableTime]
x:22 [binder, in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
x:22 [binder, in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
x:22 [binder, in Undecidability.TM.PrettyBounds.SizeBounds]
x:22 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
X:22 [binder, in Undecidability.TM.Util.VectorPrelim]
x:22 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
X:22 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
x:22 [binder, in Undecidability.Shared.Libs.DLW.Utils.interval]
x:22 [binder, in Complexity.TM.Single.EncodeTapesInvariants]
x:22 [binder, in Complexity.L.Functions.IterupN]
X:22 [binder, in Undecidability.L.Datatypes.LVector]
X:22 [binder, in Undecidability.L.Complexity.UpToC]
x:22 [binder, in Complexity.NP.L.GenNPBool]
x:22 [binder, in Complexity.Libs.UniformHomomorphisms]
X:22 [binder, in Undecidability.L.TM.TapeFuns]
x:22 [binder, in Complexity.Complexity.UpToCPoly]
x:22 [binder, in Undecidability.L.Computability.Decidability]
x:22 [binder, in Undecidability.L.Datatypes.List.List_eqb]
x:22 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TM_single]
x:22 [binder, in Complexity.Complexity.SpaceBoundsTime]
x:22 [binder, in Undecidability.Shared.Libs.DLW.Wf.wf_finite]
x:22 [binder, in Undecidability.Synthetic.DecidabilityFacts]
X:22 [binder, in Undecidability.Shared.Libs.PSL.Vectors.VectorDupfree]
X:22 [binder, in Undecidability.Shared.Dec]
x:22 [binder, in Undecidability.Shared.Libs.PSL.Lists.Cardinality]
x:22 [binder, in Undecidability.L.Functions.FinTypeLookup]
x:22 [binder, in Complexity.Complexity.Definitions]
x:22 [binder, in Complexity.Complexity.Monotonic]
x:22 [binder, in Undecidability.Shared.Libs.DLW.Utils.seteq]
x:22 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
x:22 [binder, in Undecidability.TM.Code.CasePair]
x:22 [binder, in Undecidability.L.Computability.Computability]
x:22 [binder, in Undecidability.TM.Code.BinNumbers.PosAddTM]
X:22 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.CompoundFinTypes]
X:22 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
x:22 [binder, in Complexity.L.Functions.BinNumsAdd]
x:220 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
X:220 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
x:220 [binder, in Complexity.NP.TM.LM_to_mTM]
x:221 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:221 [binder, in Undecidability.TM.Util.TM_facts]
x:221 [binder, in Complexity.NP.TM.LM_to_mTM]
x:222 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
X:222 [binder, in Undecidability.TM.Code.Copy]
x:222 [binder, in Complexity.NP.TM.LM_to_mTM]
x:2220 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
x:2221 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
X:223 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
x:223 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:223 [binder, in Complexity.NP.TM.LM_to_mTM]
X:224 [binder, in Undecidability.L.Prelim.ARS]
x:224 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:224 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:224 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
x:224 [binder, in Undecidability.TM.Util.TM_facts]
x:224 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
x:224 [binder, in Complexity.NP.TM.LM_to_mTM]
x:225 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
X:225 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
x:225 [binder, in Undecidability.TM.Code.Copy]
x:225 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
x:225 [binder, in Complexity.NP.TM.LM_to_mTM]
X:226 [binder, in Undecidability.L.Prelim.ARS]
X:226 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:226 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
X:226 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
x:226 [binder, in Complexity.NP.TM.LM_to_mTM]
x:227 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:227 [binder, in Undecidability.TM.Util.TM_facts]
x:227 [binder, in Complexity.NP.TM.LM_to_mTM]
x:228 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:228 [binder, in Complexity.NP.TM.LM_to_mTM]
x:229 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
X:229 [binder, in Undecidability.TM.Code.Copy]
x:229 [binder, in Complexity.NP.TM.LM_to_mTM]
x:23 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
x:23 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_dec]
X:23 [binder, in Undecidability.TM.Compound.TMTac]
x:23 [binder, in Undecidability.TM.Code.CaseList]
x:23 [binder, in Undecidability.Shared.Libs.PSL.Lists.Removal]
X:23 [binder, in Undecidability.L.Datatypes.List.List_basics]
X:23 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
X:23 [binder, in Complexity.TM.PrettyBounds.UnivBounds]
X:23 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
x:23 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
X:23 [binder, in Undecidability.TM.PrettyBounds.SizeBounds]
X:23 [binder, in Undecidability.TM.Code.List.Length]
x:23 [binder, in Undecidability.L.Prelim.LoopSum]
x:23 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
x:23 [binder, in Undecidability.Shared.Libs.DLW.Utils.quotient]
x:23 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_nat_facts]
x:23 [binder, in Complexity.L.AbstractMachines.Computable.UnivDecTime]
x:23 [binder, in Undecidability.Shared.Libs.DLW.Wf.acc_irr]
x:23 [binder, in Complexity.TM.PrettyBounds.BaseCodeSpace]
x:23 [binder, in Undecidability.L.Datatypes.List.List_nat]
x:23 [binder, in Undecidability.TM.Univ.LowLevel]
x:23 [binder, in Complexity.L.Functions.BinNumsSub]
x:23 [binder, in Complexity.Complexity.ONotationIsAppropriate]
X:23 [binder, in Complexity.Complexity.UpToCPoly]
x:23 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.Arbitrary]
X:23 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
X:23 [binder, in Undecidability.TM.Util.Relations]
X:23 [binder, in Undecidability.Synthetic.ListEnumerabilityFacts]
x:23 [binder, in Undecidability.Synthetic.DecidabilityFacts]
x:23 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
X:23 [binder, in Undecidability.L.Computability.Synthetic]
X:23 [binder, in Undecidability.Shared.ListAutomation]
X:23 [binder, in Complexity.Complexity.Definitions]
X:23 [binder, in Undecidability.TM.Univ.LookupAssociativeListTM]
x:23 [binder, in Complexity.Complexity.Monotonic]
X:23 [binder, in Undecidability.L.Functions.Decoding]
X:23 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler]
x:23 [binder, in Undecidability.TM.Hoare.HoareExamples]
x:23 [binder, in Undecidability.L.Functions.Size]
X:23 [binder, in Undecidability.L.Prelim.MoreList]
x:230 [binder, in Undecidability.L.Prelim.ARS]
x:230 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:230 [binder, in Undecidability.TM.Util.TM_facts]
x:230 [binder, in Complexity.NP.TM.LM_to_mTM]
X:231 [binder, in Undecidability.L.Prelim.ARS]
x:231 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:231 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
X:231 [binder, in Undecidability.TM.Hoare.HoareRegister]
x:231 [binder, in Complexity.NP.TM.LM_to_mTM]
X:231 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
x:232 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:232 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:232 [binder, in Undecidability.TM.Code.Copy]
x:232 [binder, in Complexity.NP.TM.LM_to_mTM]
x:232 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
x:233 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:233 [binder, in Complexity.NP.TM.LM_to_mTM]
x:234 [binder, in Undecidability.L.Prelim.ARS]
x:234 [binder, in Undecidability.L.Util.L_facts]
x:234 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:234 [binder, in Undecidability.TM.Util.TM_facts]
x:234 [binder, in Complexity.NP.TM.LM_to_mTM]
x:235 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
X:235 [binder, in Undecidability.TM.Code.Copy]
x:235 [binder, in Complexity.NP.TM.LM_to_mTM]
X:236 [binder, in Undecidability.L.Prelim.ARS]
x:236 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:236 [binder, in Complexity.NP.TM.LM_to_mTM]
x:237 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:237 [binder, in Undecidability.TM.Util.TM_facts]
X:237 [binder, in Undecidability.TM.Hoare.HoareLogic]
x:237 [binder, in Complexity.NP.TM.LM_to_mTM]
x:238 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:238 [binder, in Undecidability.TM.Code.Copy]
x:238 [binder, in Complexity.NP.TM.LM_to_mTM]
x:239 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:239 [binder, in Complexity.NP.TM.LM_to_mTM]
x:24 [binder, in Undecidability.Shared.Libs.PSL.Numbers]
x:24 [binder, in Complexity.Libs.Pigeonhole]
X:24 [binder, in Undecidability.L.Prelim.ARS]
x:24 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
x:24 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_quotient]
x:24 [binder, in Undecidability.L.Util.L_facts]
x:24 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
x:24 [binder, in Undecidability.L.Tactics.ComputableTime]
X:24 [binder, in Undecidability.Shared.Libs.PSL.EqDec]
x:24 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:24 [binder, in Undecidability.TM.Hoare.HoareLegacy]
X:24 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
x:24 [binder, in Undecidability.Synthetic.EnumerabilityFacts]
x:24 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
X:24 [binder, in Complexity.L.Functions.IterupN]
x:24 [binder, in Complexity.Libs.UniformHomomorphisms]
X:24 [binder, in Complexity.Libs.CookPrelim.PolyBounds]
x:24 [binder, in Complexity.Complexity.ONotationIsAppropriate]
X:24 [binder, in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
x:24 [binder, in Undecidability.TM.Code.NatSub]
x:24 [binder, in Undecidability.Synthetic.MoreEnumerabilityFacts]
x:24 [binder, in Undecidability.Synthetic.Definitions]
x:24 [binder, in Undecidability.TM.Code.Copy]
X:24 [binder, in Undecidability.Synthetic.DecidabilityFacts]
X:24 [binder, in Undecidability.Shared.Dec]
x:24 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
x:24 [binder, in Undecidability.L.Functions.Encoding]
x:24 [binder, in Undecidability.TM.Code.BinNumbers.PosAddTM]
x:24 [binder, in Undecidability.TM.Code.List.App]
x:24 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.CompoundFinTypes]
x:24 [binder, in Complexity.L.Functions.BinNumsAdd]
x:240 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:240 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:240 [binder, in Complexity.NP.TM.LM_to_mTM]
x:241 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:241 [binder, in Undecidability.TM.Hoare.HoareLogic]
x:241 [binder, in Complexity.NP.TM.LM_to_mTM]
x:242 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
X:242 [binder, in Undecidability.TM.Code.Copy]
x:242 [binder, in Undecidability.TM.Hoare.HoareLogic]
x:242 [binder, in Complexity.NP.TM.LM_to_mTM]
x:243 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
x:243 [binder, in Undecidability.L.Tactics.Extract]
x:243 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:243 [binder, in Undecidability.TM.Hoare.HoareRegister]
x:243 [binder, in Complexity.NP.TM.LM_to_mTM]
x:244 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
x:244 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:244 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
x:244 [binder, in Complexity.NP.TM.LM_to_mTM]
X:245 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
x:245 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:245 [binder, in Undecidability.TM.Code.Copy]
x:245 [binder, in Complexity.NP.TM.LM_to_mTM]
x:246 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:246 [binder, in Undecidability.TM.Hoare.HoareRegister]
x:246 [binder, in Complexity.NP.TM.LM_to_mTM]
X:246 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
x:247 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
X:247 [binder, in Undecidability.TM.Hoare.HoareLogic]
x:247 [binder, in Complexity.NP.TM.LM_to_mTM]
x:248 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
X:248 [binder, in Undecidability.TM.Code.Copy]
x:248 [binder, in Complexity.NP.TM.LM_to_mTM]
x:249 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:249 [binder, in Complexity.NP.TM.LM_to_mTM]
X:25 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
x:25 [binder, in Undecidability.Shared.Libs.PSL.FCI]
X:25 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_dec]
x:25 [binder, in Undecidability.Shared.FilterFacts]
x:25 [binder, in Undecidability.L.Functions.LoopSum]
X:25 [binder, in Undecidability.Shared.Libs.PSL.EqDec]
X:25 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
x:25 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:25 [binder, in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
x:25 [binder, in Undecidability.TM.Hoare.HoareLegacy]
x:25 [binder, in Undecidability.TM.PrettyBounds.SizeBounds]
X:25 [binder, in Undecidability.TM.Util.VectorPrelim]
x:25 [binder, in Undecidability.TM.Code.NatTM]
X:25 [binder, in Undecidability.Synthetic.EnumerabilityFacts]
X:25 [binder, in Undecidability.L.Prelim.LoopSum]
x:25 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
x:25 [binder, in Undecidability.Shared.Libs.PSL.Lists.Filter]
x:25 [binder, in Undecidability.Shared.Libs.DLW.Utils.interval]
x:25 [binder, in Complexity.TM.PrettyBounds.BaseCodeSpace]
x:25 [binder, in Complexity.NP.SAT.SAT_inNP]
x:25 [binder, in Complexity.NP.L.LMGenNP]
x:25 [binder, in Undecidability.Shared.Libs.DLW.Utils.list_bool]
x:25 [binder, in Complexity.L.Functions.BinNumsSub]
x:25 [binder, in Complexity.Complexity.ONotationIsAppropriate]
x:25 [binder, in Undecidability.L.Functions.EqBool]
x:25 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.Arbitrary]
x:25 [binder, in Undecidability.Synthetic.MoreEnumerabilityFacts]
x:25 [binder, in Undecidability.Shared.Libs.PSL.Lists.Power]
x:25 [binder, in Undecidability.Synthetic.ListEnumerabilityFacts]
x:25 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
x:25 [binder, in Undecidability.TM.L.Eval]
x:25 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
x:25 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
x:25 [binder, in Undecidability.Shared.Libs.DLW.Utils.seteq]
x:25 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
X:25 [binder, in Undecidability.TM.Code.CasePair]
x:25 [binder, in Undecidability.Synthetic.ReducibilityFacts]
x:25 [binder, in Complexity.L.AbstractMachines.Computable.LargestVar]
X:25 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.CompoundFinTypes]
x:25 [binder, in Complexity.L.Functions.BinNumsAdd]
x:250 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:250 [binder, in Complexity.NP.TM.LM_to_mTM]
x:251 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:251 [binder, in Undecidability.TM.Code.Copy]
x:251 [binder, in Complexity.NP.TM.LM_to_mTM]
X:251 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
x:252 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:252 [binder, in Complexity.L.TM.TMflatComp]
x:252 [binder, in Undecidability.TM.Hoare.HoareLogic]
x:252 [binder, in Complexity.NP.TM.LM_to_mTM]
x:253 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:253 [binder, in Undecidability.TM.Hoare.HoareLogic]
x:253 [binder, in Complexity.NP.TM.LM_to_mTM]
x:254 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:254 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:254 [binder, in Complexity.L.TM.TMflatComp]
x:254 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
x:254 [binder, in Complexity.NP.TM.LM_to_mTM]
x:255 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
X:255 [binder, in Undecidability.TM.Code.Copy]
x:255 [binder, in Complexity.NP.TM.LM_to_mTM]
x:256 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:256 [binder, in Complexity.NP.TM.LM_to_mTM]
X:256 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
X:257 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
x:257 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:257 [binder, in Complexity.NP.TM.LM_to_mTM]
x:258 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:258 [binder, in Undecidability.TM.Code.Copy]
X:258 [binder, in Undecidability.TM.Hoare.HoareLogic]
x:258 [binder, in Complexity.NP.TM.LM_to_mTM]
x:259 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:259 [binder, in Complexity.NP.TM.LM_to_mTM]
X:26 [binder, in Undecidability.TM.L.CompilerBoolFuns.NaryApp]
x:26 [binder, in Undecidability.Shared.Libs.PSL.Lists.Removal]
x:26 [binder, in Complexity.HierarchyTheorem.TimeHierarchyTheorem]
x:26 [binder, in Undecidability.Shared.Libs.DLW.Utils.prime]
x:26 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:26 [binder, in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
X:26 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
x:26 [binder, in Undecidability.Shared.FinTypeEquiv]
x:26 [binder, in Complexity.L.AbstractMachines.Computable.UnivDecTime]
x:26 [binder, in Undecidability.L.Complexity.UpToC]
x:26 [binder, in Complexity.L.AbstractMachines.FlatPro.Computable.Compile]
X:26 [binder, in Undecidability.TM.Univ.LowLevel]
x:26 [binder, in Complexity.L.Functions.BinNumsSub]
X:26 [binder, in Complexity.Complexity.UpToCPoly]
x:26 [binder, in Complexity.L.TM.TMunflatten]
x:26 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_base]
X:26 [binder, in Undecidability.Synthetic.Definitions]
X:26 [binder, in Complexity.NP.TM.M_multi2mono]
x:26 [binder, in Undecidability.Shared.Libs.DLW.Wf.wf_finite]
x:26 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
x:26 [binder, in Undecidability.Synthetic.DecidabilityFacts]
x:26 [binder, in Undecidability.L.TM.TMEncoding]
X:26 [binder, in Undecidability.Shared.Dec]
x:26 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
x:26 [binder, in Undecidability.TM.Code.Code]
x:26 [binder, in Undecidability.L.Datatypes.LNat]
x:26 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
x:26 [binder, in Undecidability.TM.PrettyBounds.MaxList]
X:26 [binder, in Complexity.Complexity.NP]
x:26 [binder, in Complexity.L.Functions.BinNumsAdd]
X:26 [binder, in Undecidability.TM.Compound.WriteString]
x:260 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:260 [binder, in Complexity.NP.TM.LM_to_mTM]
x:261 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
X:261 [binder, in Undecidability.TM.Code.Copy]
x:261 [binder, in Complexity.NP.TM.LM_to_mTM]
X:261 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
x:262 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:262 [binder, in Undecidability.TM.Hoare.HoareLogic]
x:262 [binder, in Complexity.NP.TM.LM_to_mTM]
X:263 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
x:263 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:263 [binder, in Undecidability.TM.Hoare.HoareLogic]
x:263 [binder, in Complexity.NP.TM.LM_to_mTM]
X:264 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:264 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:264 [binder, in Complexity.L.TM.TMflatComp]
x:264 [binder, in Undecidability.TM.Code.Copy]
x:264 [binder, in Complexity.NP.TM.LM_to_mTM]
X:2647 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
x:265 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:265 [binder, in Complexity.NP.TM.LM_to_mTM]
X:2655 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
x:266 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:266 [binder, in Complexity.L.TM.TMflatComp]
x:266 [binder, in Complexity.NP.TM.LM_to_mTM]
X:266 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
x:267 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:267 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
x:267 [binder, in Complexity.NP.TM.LM_to_mTM]
X:2673 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
X:268 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:268 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
X:268 [binder, in Undecidability.TM.Code.Copy]
X:268 [binder, in Undecidability.TM.Hoare.HoareLogic]
x:268 [binder, in Complexity.NP.TM.LM_to_mTM]
x:269 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
x:269 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:269 [binder, in Complexity.NP.TM.LM_to_mTM]
X:269 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
X:2690 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
X:2697 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
x:27 [binder, in Undecidability.L.Prelim.ARS]
x:27 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
x:27 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_dec]
X:27 [binder, in Undecidability.TM.Code.CaseList]
X:27 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
X:27 [binder, in Undecidability.L.Datatypes.List.List_basics]
x:27 [binder, in Undecidability.L.Functions.LoopSum]
X:27 [binder, in Undecidability.Shared.Libs.PSL.EqDec]
x:27 [binder, in Complexity.TM.Code.Decode]
x:27 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
x:27 [binder, in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
X:27 [binder, in Undecidability.Synthetic.EnumerabilityFacts]
x:27 [binder, in Undecidability.Shared.FinTypeEquiv]
x:27 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.VectorFin]
X:27 [binder, in Undecidability.L.Complexity.UpToC]
x:27 [binder, in Complexity.TM.PrettyBounds.BaseCodeSpace]
x:27 [binder, in Complexity.NP.L.GenNPBool]
x:27 [binder, in Complexity.Libs.UniformHomomorphisms]
x:27 [binder, in Undecidability.TM.Code.WriteValue]
x:27 [binder, in Complexity.L.Functions.BinNumsSub]
x:27 [binder, in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
X:27 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_base]
X:27 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.Arbitrary]
x:27 [binder, in Undecidability.L.Functions.UnboundIteration]
x:27 [binder, in Undecidability.TM.Util.Relations]
X:27 [binder, in Undecidability.Synthetic.ListEnumerabilityFacts]
x:27 [binder, in Undecidability.TM.Code.Copy]
x:27 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
x:27 [binder, in Undecidability.TM.L.Eval]
x:27 [binder, in Undecidability.L.Tactics.Reflection]
X:27 [binder, in Undecidability.Synthetic.DecidabilityFacts]
x:27 [binder, in Undecidability.L.TM.TMEncoding]
x:27 [binder, in Undecidability.Shared.Libs.PSL.Vectors.VectorDupfree]
x:27 [binder, in Undecidability.Shared.Libs.PSL.Lists.Cardinality]
x:27 [binder, in Undecidability.TM.Code.Code]
x:27 [binder, in Undecidability.L.Computability.Synthetic]
x:27 [binder, in Undecidability.L.Functions.FinTypeLookup]
X:27 [binder, in Undecidability.Shared.ListAutomation]
X:27 [binder, in Undecidability.L.Datatypes.List.List_fold]
x:27 [binder, in Undecidability.TM.Univ.LookupAssociativeListTM]
x:27 [binder, in Undecidability.L.Functions.Decoding]
x:27 [binder, in Undecidability.TM.Code.CasePair]
X:27 [binder, in Undecidability.TM.Hoare.HoareExamples]
X:27 [binder, in Undecidability.TM.Code.List.App]
x:27 [binder, in Complexity.TM.PrettyBounds.PrettyBounds]
x:27 [binder, in Undecidability.L.Prelim.MoreList]
x:270 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
x:270 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:270 [binder, in Complexity.NP.TM.LM_to_mTM]
x:270 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
x:271 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:271 [binder, in Undecidability.TM.Code.Copy]
x:271 [binder, in Complexity.NP.TM.LM_to_mTM]
x:272 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:272 [binder, in Complexity.NP.TM.LM_to_mTM]
x:273 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:273 [binder, in Undecidability.TM.Hoare.HoareLogic]
x:273 [binder, in Complexity.NP.TM.LM_to_mTM]
x:274 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
X:274 [binder, in Undecidability.TM.Code.Copy]
x:274 [binder, in Undecidability.TM.Hoare.HoareLogic]
x:274 [binder, in Complexity.NP.TM.LM_to_mTM]
x:275 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:275 [binder, in Complexity.NP.TM.LM_to_mTM]
X:275 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
x:276 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:276 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:276 [binder, in Complexity.NP.TM.LM_to_mTM]
x:277 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:277 [binder, in Undecidability.TM.Code.Copy]
x:277 [binder, in Complexity.NP.TM.LM_to_mTM]
x:278 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:278 [binder, in Complexity.NP.TM.LM_to_mTM]
x:2788 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
x:279 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:279 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
x:279 [binder, in Complexity.NP.TM.LM_to_mTM]
X:279 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
x:28 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
x:28 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_quotient]
x:28 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
x:28 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_dec]
x:28 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
x:28 [binder, in Undecidability.L.Complexity.UpToCNary]
x:28 [binder, in Complexity.TM.PrettyBounds.UnivBounds]
x:28 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
x:28 [binder, in Undecidability.Shared.FinTypeEquiv]
x:28 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
x:28 [binder, in Complexity.Complexity.Subtypes]
X:28 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
X:28 [binder, in Complexity.Libs.CookPrelim.PolyBounds]
x:28 [binder, in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
x:28 [binder, in Undecidability.TM.Code.NatSub]
x:28 [binder, in Undecidability.L.Functions.UnboundIteration]
x:28 [binder, in Complexity.NP.TM.M_multi2mono]
X:28 [binder, in Complexity.L.TM.TMflatFun]
x:28 [binder, in Undecidability.TM.L.Eval]
X:28 [binder, in Undecidability.Synthetic.DecidabilityFacts]
X:28 [binder, in Undecidability.Shared.Dec]
x:28 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
x:28 [binder, in Complexity.Complexity.Definitions]
x:28 [binder, in Undecidability.L.Datatypes.LNat]
X:28 [binder, in Undecidability.L.Tactics.Computable]
x:28 [binder, in Undecidability.L.Functions.Size]
X:28 [binder, in Undecidability.L.Prelim.MoreList]
x:280 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:280 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:280 [binder, in Complexity.NP.TM.LM_to_mTM]
x:281 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
X:281 [binder, in Undecidability.TM.Code.Copy]
x:281 [binder, in Complexity.NP.TM.LM_to_mTM]
x:282 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:282 [binder, in Complexity.NP.TM.LM_to_mTM]
x:283 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:283 [binder, in Complexity.NP.TM.LM_to_mTM]
X:283 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
x:284 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:284 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:284 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
x:284 [binder, in Undecidability.TM.Code.Copy]
x:284 [binder, in Complexity.NP.TM.LM_to_mTM]
x:285 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:285 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
x:285 [binder, in Complexity.NP.TM.LM_to_mTM]
x:286 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:286 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
x:286 [binder, in Complexity.NP.TM.LM_to_mTM]
x:287 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
X:287 [binder, in Undecidability.TM.Code.Copy]
x:287 [binder, in Complexity.NP.TM.LM_to_mTM]
X:287 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
x:288 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:288 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:288 [binder, in Complexity.NP.TM.LM_to_mTM]
x:289 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:289 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
x:289 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
x:289 [binder, in Complexity.NP.TM.LM_to_mTM]
X:29 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
x:29 [binder, in Complexity.TM.PrettyBounds.BaseCode]
x:29 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_dec]
x:29 [binder, in Undecidability.TM.Code.CaseList]
X:29 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
x:29 [binder, in Undecidability.Shared.FilterFacts]
x:29 [binder, in Undecidability.Shared.Libs.PSL.Lists.Removal]
X:29 [binder, in Undecidability.L.Tactics.ComputableTime]
x:29 [binder, in Undecidability.Synthetic.EnumerabilityFacts]
x:29 [binder, in Undecidability.L.Prelim.LoopSum]
x:29 [binder, in Undecidability.Shared.Libs.PSL.Lists.Position]
x:29 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
x:29 [binder, in Undecidability.Shared.Libs.PSL.Lists.Filter]
x:29 [binder, in Undecidability.Shared.FinTypeEquiv]
X:29 [binder, in Complexity.Complexity.Subtypes]
x:29 [binder, in Complexity.TM.Single.EncodeTapesInvariants]
x:29 [binder, in Complexity.L.Functions.IterupN]
x:29 [binder, in Undecidability.TM.Code.BinNumbers.NTM]
x:29 [binder, in Complexity.L.AbstractMachines.Computable.UnivDecTime]
x:29 [binder, in Undecidability.TM.Univ.LowLevel]
x:29 [binder, in Complexity.L.Functions.BinNumsSub]
x:29 [binder, in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
X:29 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.SingleTMGenNP]
x:29 [binder, in Undecidability.L.Tactics.Lbeta_nonrefl]
x:29 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.Arbitrary]
x:29 [binder, in Undecidability.Synthetic.MoreEnumerabilityFacts]
X:29 [binder, in Undecidability.Synthetic.Definitions]
x:29 [binder, in Undecidability.L.Functions.UnboundIteration]
X:29 [binder, in Undecidability.TM.Util.Relations]
x:29 [binder, in Undecidability.Shared.Libs.DLW.Wf.wf_finite]
X:29 [binder, in Undecidability.Synthetic.ListEnumerabilityFacts]
X:29 [binder, in Undecidability.Shared.Libs.PSL.Vectors.VectorDupfree]
X:29 [binder, in Undecidability.L.Tactics.ComputableTactics]
X:29 [binder, in Undecidability.Shared.Dec]
X:29 [binder, in Undecidability.TM.Lifting.LiftTapes]
x:29 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
X:29 [binder, in Complexity.Complexity.Definitions]
x:29 [binder, in Undecidability.L.Functions.Decoding]
x:29 [binder, in Undecidability.TM.PrettyBounds.MaxList]
x:29 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
X:29 [binder, in Undecidability.TM.Compound.WriteString]
x:290 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:290 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:290 [binder, in Complexity.L.TM.TMflatComp]
x:290 [binder, in Undecidability.TM.Code.Copy]
x:290 [binder, in Complexity.NP.TM.LM_to_mTM]
X:290 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
X:2901 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
x:2902 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
x:291 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:291 [binder, in Complexity.L.TM.TMflatComp]
x:291 [binder, in Complexity.NP.TM.LM_to_mTM]
X:2914 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
x:292 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:292 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
x:292 [binder, in Complexity.NP.TM.LM_to_mTM]
X:2923 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
X:2926 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
x:293 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:293 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:293 [binder, in Complexity.NP.TM.LM_to_mTM]
X:294 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
x:294 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
X:294 [binder, in Undecidability.TM.Code.Copy]
x:294 [binder, in Complexity.NP.TM.LM_to_mTM]
X:294 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
x:295 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:295 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:295 [binder, in Complexity.NP.TM.LM_to_mTM]
X:2951 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
x:296 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:296 [binder, in Complexity.NP.TM.LM_to_mTM]
x:297 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:297 [binder, in Undecidability.TM.Code.Copy]
x:297 [binder, in Complexity.NP.TM.LM_to_mTM]
x:298 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:298 [binder, in Complexity.NP.TM.LM_to_mTM]
X:298 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
x:299 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:299 [binder, in Complexity.NP.TM.LM_to_mTM]
x:3 [binder, in Undecidability.Shared.Libs.PSL.Numbers]
x:3 [binder, in Undecidability.L.Prelim.ARS]
X:3 [binder, in Complexity.TM.PrettyBounds.BaseCode]
x:3 [binder, in Undecidability.TM.Compound.TMTac]
x:3 [binder, in Complexity.L.Datatypes.LBinNums]
x:3 [binder, in Complexity.NP.L.GenNP_is_hard]
x:3 [binder, in Undecidability.Shared.Libs.PSL.Lists.Removal]
x:3 [binder, in Undecidability.Synthetic.SemiDecidabilityFacts]
x:3 [binder, in Undecidability.TM.Single.StepTM]
X:3 [binder, in Undecidability.Shared.Libs.PSL.Prelim]
x:3 [binder, in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisUnfoldClos]
x:3 [binder, in Undecidability.L.Tactics.LClos]
x:3 [binder, in Undecidability.Synthetic.EnumerabilityFacts]
x:3 [binder, in Undecidability.TM.Code.BinNumbers.EncodeBinNumbers]
x:3 [binder, in Undecidability.Shared.Libs.DLW.Wf.acc_irr]
x:3 [binder, in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisStep]
X:3 [binder, in Complexity.NP.L.LMGenNP]
x:3 [binder, in Undecidability.TM.Code.CodeTM]
X:3 [binder, in Undecidability.TM.Code.WriteValue]
x:3 [binder, in Complexity.Complexity.UpToCPoly]
x:3 [binder, in Undecidability.L.Datatypes.LFinType]
X:3 [binder, in Undecidability.Synthetic.Undecidability]
x:3 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicFinTypes]
x:3 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_base]
x:3 [binder, in Undecidability.TM.Compound.Compare]
X:3 [binder, in Complexity.Libs.CookPrelim.Tactics]
X:3 [binder, in Undecidability.Synthetic.MoreEnumerabilityFacts]
x:3 [binder, in Undecidability.Synthetic.Definitions]
X:3 [binder, in Undecidability.TM.Util.Relations]
x:3 [binder, in Undecidability.Shared.Libs.DLW.Wf.wf_finite]
x:3 [binder, in Complexity.TM.Single.DecodeTapes]
x:3 [binder, in Undecidability.L.Tactics.Reflection]
x:3 [binder, in Undecidability.Synthetic.DecidabilityFacts]
x:3 [binder, in Undecidability.L.Tactics.ComputableTactics]
x:3 [binder, in Complexity.L.Functions.BinNumsCompare]
X:3 [binder, in Undecidability.TM.Lifting.LiftTapes]
x:3 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
x:3 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatTCC_to_FlatCC]
x:3 [binder, in Undecidability.TM.PrettyBounds.MaxList]
X:3 [binder, in Undecidability.L.Computability.Computability]
x:3 [binder, in Undecidability.TM.Code.ProgrammingTools]
x:30 [binder, in Complexity.Libs.Pigeonhole]
x:30 [binder, in Undecidability.Shared.Libs.PSL.FCI]
x:30 [binder, in Undecidability.TM.Code.BinNumbers.PosMultTM]
x:30 [binder, in Undecidability.L.Tactics.LClos]
X:30 [binder, in Undecidability.Synthetic.EnumerabilityFacts]
x:30 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
x:30 [binder, in Undecidability.Shared.FinTypeEquiv]
x:30 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_nat_facts]
x:30 [binder, in Complexity.Libs.UniformHomomorphisms]
x:30 [binder, in Complexity.L.AbstractMachines.FlatPro.Computable.Compile]
x:30 [binder, in Undecidability.Shared.Libs.DLW.Utils.list_bool]
x:30 [binder, in Undecidability.TM.Code.WriteValue]
X:30 [binder, in Complexity.Complexity.UpToCPoly]
x:30 [binder, in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
X:30 [binder, in Undecidability.L.Functions.EqBool]
x:30 [binder, in Undecidability.Synthetic.MoreEnumerabilityFacts]
x:30 [binder, in Undecidability.L.Functions.UnboundIteration]
X:30 [binder, in Complexity.NP.TM.M_multi2mono]
x:30 [binder, in Undecidability.TM.Code.Copy]
x:30 [binder, in Undecidability.Synthetic.DecidabilityFacts]
X:30 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
X:30 [binder, in Undecidability.Shared.Libs.PSL.Lists.Cardinality]
x:30 [binder, in Undecidability.L.Functions.FinTypeLookup]
X:30 [binder, in Undecidability.L.Functions.Decoding]
x:30 [binder, in Undecidability.L.Datatypes.LNat]
x:30 [binder, in Complexity.Complexity.PolyTimeComputable]
X:30 [binder, in Undecidability.Shared.Libs.DLW.Vec.pos]
x:30 [binder, in Undecidability.L.Tactics.Computable]
x:30 [binder, in Undecidability.TM.Hoare.HoareExamples]
x:30 [binder, in Complexity.L.AbstractMachines.Computable.LargestVar]
x:300 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:300 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
X:300 [binder, in Undecidability.TM.Code.Copy]
x:300 [binder, in Complexity.NP.TM.LM_to_mTM]
x:301 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:301 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
x:301 [binder, in Complexity.NP.TM.LM_to_mTM]
x:302 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:302 [binder, in Complexity.NP.TM.LM_to_mTM]
x:3026 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
x:303 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:303 [binder, in Undecidability.TM.Code.Copy]
x:303 [binder, in Complexity.NP.TM.LM_to_mTM]
X:303 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
X:3039 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
x:304 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:304 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:304 [binder, in Complexity.NP.TM.LM_to_mTM]
x:305 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:305 [binder, in Complexity.NP.TM.LM_to_mTM]
X:3054 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
x:306 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
x:306 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:306 [binder, in Complexity.NP.TM.LM_to_mTM]
X:3060 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
X:3069 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
x:307 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:307 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
X:307 [binder, in Undecidability.TM.Code.Copy]
x:307 [binder, in Complexity.NP.TM.LM_to_mTM]
X:307 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
x:308 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:308 [binder, in Complexity.NP.TM.LM_to_mTM]
X:3083 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
X:3088 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
x:309 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:309 [binder, in Complexity.NP.TM.LM_to_mTM]
X:3094 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
X:3098 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
x:31 [binder, in Undecidability.L.Prelim.ARS]
x:31 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
x:31 [binder, in Undecidability.Shared.Libs.PSL.FCI]
x:31 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
x:31 [binder, in Undecidability.TM.Code.BinNumbers.PosMultTM]
X:31 [binder, in Undecidability.L.Datatypes.List.List_basics]
X:31 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
x:31 [binder, in Undecidability.L.Tactics.ComputableTime]
x:31 [binder, in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
X:31 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
x:31 [binder, in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
x:31 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
x:31 [binder, in Undecidability.Shared.Libs.DLW.Utils.quotient]
x:31 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_nat_facts]
x:31 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
x:31 [binder, in Undecidability.Shared.Libs.DLW.Utils.interval]
x:31 [binder, in Undecidability.L.Complexity.UpToC]
x:31 [binder, in Undecidability.L.Datatypes.List.List_nat]
x:31 [binder, in Undecidability.Shared.Libs.DLW.Utils.list_bool]
x:31 [binder, in Undecidability.TM.Univ.LowLevel]
x:31 [binder, in Complexity.L.Functions.BinNumsSub]
x:31 [binder, in Undecidability.Shared.Libs.DLW.Utils.php]
x:31 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.SingleTMGenNP]
x:31 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_base]
x:31 [binder, in Undecidability.TM.Code.NatSub]
x:31 [binder, in Undecidability.L.Computability.Decidability]
x:31 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.Arbitrary]
X:31 [binder, in Undecidability.Synthetic.MoreEnumerabilityFacts]
x:31 [binder, in Undecidability.Shared.Libs.DLW.Wf.wf_finite]
x:31 [binder, in Undecidability.TM.L.Eval]
X:31 [binder, in Complexity.TM.Single.DecodeTapes]
x:31 [binder, in Undecidability.Synthetic.DecidabilityFacts]
x:31 [binder, in Undecidability.L.TM.TMEncoding]
x:31 [binder, in Undecidability.L.Tactics.ComputableTactics]
x:31 [binder, in Undecidability.Shared.Dec]
x:31 [binder, in Undecidability.Synthetic.Infinite]
x:31 [binder, in Complexity.TM.PrettyBounds.PrettyBounds]
x:310 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:310 [binder, in Undecidability.TM.Code.Copy]
x:310 [binder, in Complexity.NP.TM.LM_to_mTM]
x:310 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
X:3102 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
X:3108 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
x:311 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:311 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:311 [binder, in Complexity.NP.TM.LM_to_mTM]
x:312 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:312 [binder, in Complexity.NP.TM.LM_to_mTM]
x:312 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
X:3121 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
x:313 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
X:313 [binder, in Undecidability.TM.Code.Copy]
x:313 [binder, in Complexity.NP.TM.LM_to_mTM]
X:313 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
x:314 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:314 [binder, in Complexity.NP.TM.LM_to_mTM]
x:315 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:315 [binder, in Complexity.NP.TM.LM_to_mTM]
X:3159 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
x:316 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:316 [binder, in Undecidability.TM.Code.Copy]
x:316 [binder, in Complexity.NP.TM.LM_to_mTM]
X:3168 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
x:317 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:317 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:317 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
x:317 [binder, in Complexity.NP.TM.LM_to_mTM]
X:3176 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
x:318 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
X:318 [binder, in Undecidability.TM.Hoare.HoareLogic]
x:318 [binder, in Complexity.NP.TM.LM_to_mTM]
X:3186 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
x:319 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:319 [binder, in Complexity.NP.TM.LM_to_mTM]
X:3197 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
x:3198 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
x:32 [binder, in Undecidability.TM.Combinators.Combinators]
x:32 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
x:32 [binder, in Undecidability.Shared.Libs.PSL.FCI]
X:32 [binder, in Undecidability.TM.Code.CaseList]
x:32 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
x:32 [binder, in Undecidability.Shared.Libs.PSL.Lists.Removal]
X:32 [binder, in Undecidability.Shared.Libs.PSL.EqDec]
x:32 [binder, in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
X:32 [binder, in Undecidability.TM.Util.VectorPrelim]
X:32 [binder, in Undecidability.TM.Code.List.Length]
x:32 [binder, in Undecidability.Shared.Libs.PSL.Lists.Position]
x:32 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
x:32 [binder, in Undecidability.Shared.Libs.DLW.Utils.interval]
x:32 [binder, in Complexity.L.AbstractMachines.Computable.UnivDecTime]
X:32 [binder, in Undecidability.L.Complexity.UpToC]
x:32 [binder, in Complexity.TM.PrettyBounds.BaseCodeSpace]
X:32 [binder, in Complexity.Libs.CookPrelim.PolyBounds]
X:32 [binder, in Undecidability.TM.Code.CompareValue]
X:32 [binder, in Undecidability.TM.Univ.LowLevel]
x:32 [binder, in Undecidability.TM.Code.WriteValue]
X:32 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_base]
X:32 [binder, in Undecidability.L.Datatypes.List.List_eqb]
x:32 [binder, in Undecidability.TM.Code.Copy]
x:32 [binder, in Undecidability.Synthetic.DecidabilityFacts]
x:32 [binder, in Undecidability.L.Datatypes.List.List_in]
x:32 [binder, in Undecidability.L.TM.TMEncoding]
X:32 [binder, in Undecidability.TM.Lifting.LiftTapes]
x:32 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
x:32 [binder, in Undecidability.Shared.ListAutomation]
x:32 [binder, in Undecidability.L.Datatypes.LNat]
X:32 [binder, in Complexity.Complexity.PolyTimeComputable]
x:32 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
x:32 [binder, in Complexity.Complexity.NP]
x:32 [binder, in Undecidability.Synthetic.ReducibilityFacts]
x:32 [binder, in Undecidability.L.Prelim.MoreList]
X:320 [binder, in Undecidability.TM.Single.StepTM]
x:320 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:320 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
X:320 [binder, in Undecidability.TM.Code.Copy]
x:320 [binder, in Complexity.NP.TM.LM_to_mTM]
X:320 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
X:3205 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
x:3206 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
x:321 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:321 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:321 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
x:321 [binder, in Complexity.NP.TM.LM_to_mTM]
x:322 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:322 [binder, in Complexity.NP.TM.LM_to_mTM]
X:3220 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
x:323 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:323 [binder, in Undecidability.TM.Code.Copy]
x:323 [binder, in Undecidability.TM.Hoare.HoareLogic]
x:323 [binder, in Complexity.NP.TM.LM_to_mTM]
x:3230 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
x:324 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
X:324 [binder, in Undecidability.TM.Code.Copy]
x:324 [binder, in Undecidability.TM.Hoare.HoareLogic]
x:324 [binder, in Complexity.NP.TM.LM_to_mTM]
x:325 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:325 [binder, in Undecidability.L.Tactics.Reflection]
x:325 [binder, in Complexity.NP.TM.LM_to_mTM]
x:326 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
X:326 [binder, in Undecidability.TM.Hoare.HoareCombinators]
x:326 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
x:326 [binder, in Complexity.NP.TM.LM_to_mTM]
X:326 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
x:327 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:327 [binder, in Complexity.NP.TM.LM_to_mTM]
x:328 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:328 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
X:328 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
x:328 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
x:328 [binder, in Complexity.NP.TM.LM_to_mTM]
x:329 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
X:329 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
X:329 [binder, in Undecidability.TM.Hoare.HoareLogic]
x:329 [binder, in Complexity.NP.TM.LM_to_mTM]
X:329 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
x:33 [binder, in Undecidability.Shared.Libs.PSL.Numbers]
x:33 [binder, in Undecidability.TM.Combinators.Combinators]
x:33 [binder, in Undecidability.L.Prelim.ARS]
X:33 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
X:33 [binder, in Complexity.TM.PrettyBounds.BaseCode]
x:33 [binder, in Undecidability.Shared.Libs.PSL.FCI]
x:33 [binder, in Undecidability.Shared.FilterFacts]
x:33 [binder, in Undecidability.TM.Code.BinNumbers.PosMultTM]
x:33 [binder, in Undecidability.L.Complexity.UpToCNary]
X:33 [binder, in Complexity.TM.PrettyBounds.UnivBounds]
x:33 [binder, in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
X:33 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
x:33 [binder, in Undecidability.Shared.Libs.PSL.Lists.Filter]
x:33 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
X:33 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
x:33 [binder, in Undecidability.Shared.Libs.DLW.Utils.interval]
x:33 [binder, in Complexity.Libs.UniformHomomorphisms]
X:33 [binder, in Complexity.Complexity.UpToCPoly]
X:33 [binder, in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
x:33 [binder, in Undecidability.TM.Util.Relations]
X:33 [binder, in Complexity.NP.TM.M_multi2mono]
x:33 [binder, in Undecidability.TM.L.Eval]
X:33 [binder, in Undecidability.Synthetic.DecidabilityFacts]
x:33 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
X:33 [binder, in Undecidability.TM.Univ.LookupAssociativeListTM]
x:33 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
X:33 [binder, in Undecidability.TM.Hoare.HoareExamples]
x:33 [binder, in Undecidability.L.Functions.Size]
x:33 [binder, in Complexity.TM.PrettyBounds.PrettyBounds]
X:33 [binder, in Undecidability.L.Prelim.MoreList]
x:330 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:330 [binder, in Undecidability.TM.Code.Copy]
x:330 [binder, in Undecidability.TM.Hoare.HoareCombinators]
x:330 [binder, in Complexity.NP.TM.LM_to_mTM]
x:331 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:331 [binder, in Undecidability.TM.Hoare.HoareCombinators]
x:331 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
x:331 [binder, in Complexity.NP.TM.LM_to_mTM]
x:332 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:332 [binder, in Complexity.NP.TM.LM_to_mTM]
x:333 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:333 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
x:333 [binder, in Complexity.NP.TM.LM_to_mTM]
x:334 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
X:334 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
x:334 [binder, in Complexity.NP.TM.LM_to_mTM]
X:334 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
x:335 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
X:335 [binder, in Undecidability.TM.Code.Copy]
x:335 [binder, in Undecidability.TM.Hoare.HoareLogic]
x:335 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
x:335 [binder, in Complexity.NP.TM.LM_to_mTM]
x:336 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:336 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
x:336 [binder, in Undecidability.TM.Hoare.HoareLogic]
x:336 [binder, in Complexity.NP.TM.LM_to_mTM]
x:337 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:337 [binder, in Undecidability.TM.Hoare.HoareCombinators]
x:337 [binder, in Complexity.NP.TM.LM_to_mTM]
x:338 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:338 [binder, in Complexity.NP.TM.LM_to_mTM]
x:339 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:339 [binder, in Complexity.NP.TM.LM_to_mTM]
x:339 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
x:34 [binder, in Undecidability.TM.Combinators.Combinators]
x:34 [binder, in Undecidability.TM.Code.CaseList]
X:34 [binder, in Undecidability.L.Tactics.Lrewrite]
X:34 [binder, in Undecidability.Shared.Libs.PSL.EqDec]
x:34 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
X:34 [binder, in Undecidability.Synthetic.EnumerabilityFacts]
x:34 [binder, in Undecidability.L.Prelim.LoopSum]
X:34 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_nat_facts]
x:34 [binder, in Undecidability.TM.Util.Prelim]
x:34 [binder, in Undecidability.Shared.Libs.DLW.Utils.interval]
x:34 [binder, in Complexity.L.Functions.IterupN]
x:34 [binder, in Undecidability.TM.Code.BinNumbers.NTM]
x:34 [binder, in Complexity.NP.SAT.SAT_inNP]
x:34 [binder, in Undecidability.L.Datatypes.List.List_extra]
x:34 [binder, in Complexity.L.AbstractMachines.FlatPro.Computable.Compile]
x:34 [binder, in Undecidability.Shared.Libs.DLW.Utils.php]
X:34 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.Arbitrary]
x:34 [binder, in Undecidability.Synthetic.MoreEnumerabilityFacts]
x:34 [binder, in Undecidability.Synthetic.Definitions]
x:34 [binder, in Undecidability.TM.L.Eval]
x:34 [binder, in Undecidability.Shared.Libs.PSL.Vectors.VectorDupfree]
X:34 [binder, in Complexity.Complexity.Definitions]
x:34 [binder, in Undecidability.L.Datatypes.LNat]
X:34 [binder, in Undecidability.L.Tactics.Computable]
x:340 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:340 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:340 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
x:340 [binder, in Complexity.NP.TM.LM_to_mTM]
x:341 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:341 [binder, in Undecidability.TM.Code.Copy]
X:341 [binder, in Undecidability.TM.Hoare.HoareLogic]
x:341 [binder, in Undecidability.TM.Hoare.HoareCombinators]
x:341 [binder, in Complexity.NP.TM.LM_to_mTM]
x:342 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:342 [binder, in Complexity.NP.TM.LM_to_mTM]
X:343 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
x:343 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:343 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
x:343 [binder, in Complexity.NP.TM.LM_to_mTM]
x:344 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:344 [binder, in Complexity.NP.TM.LM_to_mTM]
x:345 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:345 [binder, in Complexity.NP.TM.LM_to_mTM]
x:346 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:346 [binder, in Undecidability.TM.Hoare.HoareLogic]
x:346 [binder, in Undecidability.TM.Hoare.HoareCombinators]
x:346 [binder, in Complexity.NP.TM.LM_to_mTM]
x:347 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
X:347 [binder, in Undecidability.TM.Code.Copy]
x:347 [binder, in Undecidability.TM.Hoare.HoareLogic]
x:347 [binder, in Complexity.NP.TM.LM_to_mTM]
x:348 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:348 [binder, in Complexity.NP.TM.LM_to_mTM]
x:349 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:349 [binder, in Complexity.NP.TM.LM_to_mTM]
X:35 [binder, in Undecidability.Shared.Libs.PSL.Numbers]
x:35 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
x:35 [binder, in Complexity.TM.PrettyBounds.BaseCode]
x:35 [binder, in Complexity.TM.Code.Decode]
X:35 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
x:35 [binder, in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
X:35 [binder, in Undecidability.L.Prelim.LoopSum]
X:35 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
x:35 [binder, in Undecidability.L.Datatypes.List.List_extra]
X:35 [binder, in Complexity.Libs.CookPrelim.PolyBounds]
x:35 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_upto]
X:35 [binder, in Complexity.L.TM.TMunflatten]
x:35 [binder, in Undecidability.TM.Code.NatSub]
X:35 [binder, in Undecidability.Synthetic.Definitions]
x:35 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
x:35 [binder, in Undecidability.Synthetic.ListEnumerabilityFacts]
x:35 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
x:35 [binder, in Undecidability.L.Tactics.ComputableTactics]
x:35 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
x:35 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
x:35 [binder, in Undecidability.TM.Code.Code]
x:35 [binder, in Undecidability.Shared.ListAutomation]
x:35 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
X:35 [binder, in Undecidability.Shared.Libs.DLW.Vec.pos]
X:35 [binder, in Undecidability.TM.Code.CasePair]
x:35 [binder, in Complexity.L.AbstractMachines.Computable.LargestVar]
x:35 [binder, in Complexity.TM.PrettyBounds.PrettyBounds]
x:350 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:350 [binder, in Complexity.NP.TM.LM_to_mTM]
x:351 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:351 [binder, in Undecidability.TM.Hoare.HoareCombinators]
x:351 [binder, in Complexity.NP.TM.LM_to_mTM]
x:352 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
X:352 [binder, in Undecidability.TM.Hoare.HoareLogic]
x:352 [binder, in Complexity.NP.TM.LM_to_mTM]
X:353 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:353 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:353 [binder, in Undecidability.TM.Code.Copy]
x:353 [binder, in Complexity.NP.TM.LM_to_mTM]
x:354 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:354 [binder, in Complexity.NP.TM.LM_to_mTM]
x:355 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:355 [binder, in Complexity.NP.TM.LM_to_mTM]
x:356 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:356 [binder, in Undecidability.TM.Hoare.HoareCombinators]
x:356 [binder, in Complexity.NP.TM.LM_to_mTM]
x:357 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:357 [binder, in Complexity.NP.TM.LM_to_mTM]
X:3578 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
x:358 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
X:358 [binder, in Undecidability.TM.Code.Copy]
x:358 [binder, in Complexity.NP.TM.LM_to_mTM]
x:359 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:359 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:359 [binder, in Undecidability.TM.Hoare.HoareLogic]
x:359 [binder, in Complexity.NP.TM.LM_to_mTM]
X:3593 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
x:36 [binder, in Undecidability.L.Prelim.ARS]
x:36 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
x:36 [binder, in Complexity.L.AbstractMachines.Computable.EvalForTime]
x:36 [binder, in Undecidability.L.Tactics.Lrewrite]
x:36 [binder, in Complexity.NP.SAT.FSAT.FormulaEncoding]
x:36 [binder, in Undecidability.Shared.Libs.PSL.Lists.Removal]
X:36 [binder, in Undecidability.L.Datatypes.LOptions]
X:36 [binder, in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
X:36 [binder, in Undecidability.Shared.Libs.PSL.EqDec]
x:36 [binder, in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
x:36 [binder, in Undecidability.L.Tactics.GenEncode]
x:36 [binder, in Undecidability.Shared.Libs.PSL.Lists.Position]
x:36 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
x:36 [binder, in Undecidability.Shared.Libs.DLW.Utils.quotient]
x:36 [binder, in Undecidability.TM.Util.Prelim]
x:36 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
x:36 [binder, in Undecidability.L.Complexity.UpToC]
X:36 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_upto]
x:36 [binder, in Undecidability.L.Functions.EqBool]
X:36 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_base]
x:36 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.Arbitrary]
x:36 [binder, in Undecidability.Shared.Libs.PSL.Lists.Power]
x:36 [binder, in Undecidability.TM.L.Eval]
x:36 [binder, in Undecidability.Synthetic.DecidabilityFacts]
x:36 [binder, in Undecidability.L.Tactics.ComputableTactics]
X:36 [binder, in Undecidability.Shared.Dec]
x:36 [binder, in Undecidability.TM.Code.Code]
x:36 [binder, in Undecidability.L.Computability.Synthetic]
x:36 [binder, in Undecidability.Synthetic.Infinite]
x:36 [binder, in Undecidability.L.Tactics.Computable]
X:36 [binder, in Complexity.Complexity.NP]
x:36 [binder, in Undecidability.TM.Hoare.HoareExamples]
x:360 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:360 [binder, in Undecidability.TM.Hoare.HoareLogic]
x:360 [binder, in Complexity.NP.TM.LM_to_mTM]
x:3607 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
x:3608 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
x:3609 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
X:361 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:361 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:361 [binder, in Undecidability.TM.Hoare.HoareCombinators]
x:361 [binder, in Complexity.NP.TM.LM_to_mTM]
x:3610 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
x:362 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:362 [binder, in Complexity.NP.TM.LM_to_mTM]
X:3626 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
x:363 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:363 [binder, in Complexity.NP.TM.LM_to_mTM]
x:3634 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
x:3635 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
x:3636 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
x:3637 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
X:3638 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
X:364 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
x:364 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:364 [binder, in Undecidability.TM.Code.Copy]
x:364 [binder, in Complexity.NP.TM.LM_to_mTM]
X:3643 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
X:3646 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
X:365 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:365 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:365 [binder, in Complexity.NP.TM.LM_to_mTM]
X:3651 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
X:3654 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
x:366 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:366 [binder, in Complexity.NP.TM.LM_to_mTM]
x:367 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
X:367 [binder, in Undecidability.TM.Hoare.HoareCombinators]
x:367 [binder, in Complexity.NP.TM.LM_to_mTM]
X:368 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
x:368 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:368 [binder, in Complexity.NP.TM.LM_to_mTM]
X:3687 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
X:369 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:369 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:369 [binder, in Undecidability.TM.Util.TM_facts]
x:369 [binder, in Complexity.NP.TM.LM_to_mTM]
X:3690 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
X:3699 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
x:37 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
x:37 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
x:37 [binder, in Complexity.Complexity.ONotation]
x:37 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
X:37 [binder, in Undecidability.TM.Code.List.Nth]
x:37 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
x:37 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:37 [binder, in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
x:37 [binder, in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
x:37 [binder, in Undecidability.L.Prelim.LoopSum]
x:37 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
X:37 [binder, in Undecidability.Shared.Libs.PSL.Lists.Filter]
x:37 [binder, in Undecidability.Shared.Libs.DLW.Utils.quotient]
x:37 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
x:37 [binder, in Complexity.Complexity.Subtypes]
x:37 [binder, in Complexity.TM.Single.EncodeTapesInvariants]
X:37 [binder, in Undecidability.L.Complexity.UpToC]
x:37 [binder, in Complexity.Complexity.ONotationIsAppropriate]
X:37 [binder, in Complexity.Complexity.UpToCPoly]
x:37 [binder, in Undecidability.L.Functions.UnboundIteration]
X:37 [binder, in Undecidability.TM.Util.Relations]
x:37 [binder, in Undecidability.TM.Code.Copy]
x:37 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
x:37 [binder, in Undecidability.TM.L.Eval]
x:37 [binder, in Undecidability.L.Tactics.Reflection]
x:37 [binder, in Undecidability.Synthetic.DecidabilityFacts]
x:37 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
x:37 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
X:37 [binder, in Undecidability.TM.Code.Code]
x:37 [binder, in Undecidability.Shared.Libs.DLW.Vec.pos]
x:37 [binder, in Undecidability.TM.Code.CasePair]
X:37 [binder, in Undecidability.TM.Hoare.HoareExamples]
X:37 [binder, in Undecidability.TM.Single.EncodeTapes]
x:370 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
X:370 [binder, in Undecidability.TM.Code.Copy]
x:370 [binder, in Complexity.NP.TM.LM_to_mTM]
x:3702 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
x:371 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:371 [binder, in Undecidability.TM.Hoare.HoareCombinators]
x:371 [binder, in Complexity.NP.TM.LM_to_mTM]
x:372 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:372 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:372 [binder, in Complexity.NP.TM.LM_to_mTM]
x:373 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:373 [binder, in Undecidability.TM.Hoare.HoareCombinators]
x:373 [binder, in Complexity.NP.TM.LM_to_mTM]
x:374 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:374 [binder, in Complexity.NP.TM.LM_to_mTM]
x:375 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:375 [binder, in Complexity.NP.TM.LM_to_mTM]
X:376 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:376 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:376 [binder, in Undecidability.TM.Code.Copy]
x:376 [binder, in Complexity.NP.TM.LM_to_mTM]
x:377 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:377 [binder, in Undecidability.TM.Hoare.HoareCombinators]
x:377 [binder, in Complexity.NP.TM.LM_to_mTM]
x:378 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:378 [binder, in Complexity.NP.TM.LM_to_mTM]
x:379 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:379 [binder, in Complexity.NP.TM.LM_to_mTM]
x:38 [binder, in Undecidability.Shared.Libs.PSL.Numbers]
x:38 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
X:38 [binder, in Complexity.TM.PrettyBounds.BaseCode]
x:38 [binder, in Undecidability.Shared.Libs.PSL.FCI]
x:38 [binder, in Complexity.Complexity.ONotation]
x:38 [binder, in Undecidability.L.Complexity.UpToCNary]
X:38 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
x:38 [binder, in Complexity.TM.PrettyBounds.UnivBounds]
X:38 [binder, in Undecidability.Shared.Libs.PSL.EqDec]
X:38 [binder, in Undecidability.TM.Util.VectorPrelim]
x:38 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
x:38 [binder, in Undecidability.TM.Compound.MoveToSymbol]
x:38 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_nat_facts]
x:38 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
X:38 [binder, in Complexity.Libs.CookPrelim.PolyBounds]
x:38 [binder, in Complexity.L.AbstractMachines.FlatPro.Computable.Compile]
x:38 [binder, in Undecidability.TM.Code.WriteValue]
x:38 [binder, in Complexity.Complexity.ONotationIsAppropriate]
X:38 [binder, in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
x:38 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_base]
x:38 [binder, in Undecidability.L.Tactics.Lbeta_nonrefl]
x:38 [binder, in Undecidability.TM.Code.NatSub]
x:38 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.Arbitrary]
X:38 [binder, in Undecidability.Synthetic.MoreEnumerabilityFacts]
x:38 [binder, in Undecidability.TM.Code.ChangeAlphabet]
X:38 [binder, in Undecidability.Synthetic.ListEnumerabilityFacts]
x:38 [binder, in Complexity.TM.Single.DecodeTapes]
x:38 [binder, in Undecidability.Synthetic.DecidabilityFacts]
X:38 [binder, in Undecidability.Shared.Dec]
X:38 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
x:38 [binder, in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
x:38 [binder, in Undecidability.Shared.ListAutomation]
x:38 [binder, in Undecidability.TM.Univ.LookupAssociativeListTM]
X:38 [binder, in Undecidability.L.Functions.Decoding]
x:38 [binder, in Undecidability.L.Datatypes.LNat]
X:38 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.CC]
X:38 [binder, in Undecidability.TM.Code.List.App]
x:38 [binder, in Undecidability.L.Functions.Size]
x:38 [binder, in Complexity.TM.PrettyBounds.PrettyBounds]
x:380 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
X:380 [binder, in Undecidability.TM.Code.Copy]
x:380 [binder, in Complexity.NP.TM.LM_to_mTM]
x:381 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:381 [binder, in Complexity.NP.TM.LM_to_mTM]
x:382 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:382 [binder, in Complexity.NP.TM.LM_to_mTM]
x:383 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:383 [binder, in Complexity.NP.TM.LM_to_mTM]
X:384 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:384 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:384 [binder, in Undecidability.TM.Code.Copy]
X:384 [binder, in Undecidability.TM.Hoare.HoareCombinators]
x:384 [binder, in Complexity.NP.TM.LM_to_mTM]
x:385 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:385 [binder, in Complexity.NP.TM.LM_to_mTM]
x:386 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:386 [binder, in Complexity.NP.TM.LM_to_mTM]
x:387 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:387 [binder, in Complexity.NP.TM.LM_to_mTM]
x:388 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
X:388 [binder, in Undecidability.TM.Code.Copy]
x:388 [binder, in Complexity.NP.TM.LM_to_mTM]
x:389 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:389 [binder, in Complexity.NP.TM.LM_to_mTM]
x:39 [binder, in Undecidability.Shared.Libs.PSL.Numbers]
x:39 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
x:39 [binder, in Undecidability.Shared.Libs.PSL.Lists.Removal]
x:39 [binder, in Undecidability.Shared.Libs.DLW.Utils.prime]
X:39 [binder, in Undecidability.Shared.Libs.PSL.EqDec]
x:39 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:39 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
X:39 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
x:39 [binder, in Complexity.Complexity.Subtypes]
x:39 [binder, in Complexity.NP.SAT.SAT_inNP]
x:39 [binder, in Undecidability.TM.Univ.LowLevel]
x:39 [binder, in Undecidability.L.Functions.EqBool]
X:39 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.Arbitrary]
X:39 [binder, in Complexity.L.TM.TMflatten]
x:39 [binder, in Undecidability.TM.Code.Copy]
X:39 [binder, in Undecidability.Synthetic.DecidabilityFacts]
x:39 [binder, in Undecidability.Shared.Libs.PSL.Vectors.VectorDupfree]
x:39 [binder, in Undecidability.TM.Code.Code]
x:39 [binder, in Undecidability.L.Computability.Synthetic]
x:39 [binder, in Undecidability.Synthetic.Infinite]
X:39 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
x:390 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:390 [binder, in Undecidability.TM.Hoare.HoareCombinators]
x:390 [binder, in Complexity.NP.TM.LM_to_mTM]
x:391 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
x:391 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:391 [binder, in Undecidability.TM.Hoare.HoareCombinators]
x:391 [binder, in Complexity.NP.TM.LM_to_mTM]
X:392 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:392 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:392 [binder, in Undecidability.TM.Code.Copy]
x:392 [binder, in Complexity.NP.TM.LM_to_mTM]
x:393 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:393 [binder, in Undecidability.TM.Util.TM_facts]
x:393 [binder, in Complexity.NP.TM.LM_to_mTM]
x:394 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:394 [binder, in Complexity.NP.TM.LM_to_mTM]
x:395 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
x:395 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
X:395 [binder, in Undecidability.TM.Code.Copy]
x:395 [binder, in Complexity.NP.TM.LM_to_mTM]
x:396 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:396 [binder, in Complexity.NP.TM.LM_to_mTM]
x:397 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:397 [binder, in Undecidability.TM.Hoare.HoareCombinators]
x:397 [binder, in Complexity.NP.TM.LM_to_mTM]
x:398 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
x:398 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:398 [binder, in Complexity.NP.TM.LM_to_mTM]
x:399 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:399 [binder, in Undecidability.TM.Code.Copy]
x:399 [binder, in Complexity.NP.TM.LM_to_mTM]
x:4 [binder, in Complexity.Libs.Pigeonhole]
x:4 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
x:4 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_dec]
x:4 [binder, in Undecidability.TM.Compound.TMTac]
x:4 [binder, in Undecidability.L.Complexity.UpToCNary]
X:4 [binder, in Undecidability.TM.Single.StepTM]
x:4 [binder, in Complexity.L.Datatypes.LDepPair]
X:4 [binder, in Undecidability.Shared.Libs.PSL.EqDec]
x:4 [binder, in Complexity.TM.Code.Decode]
x:4 [binder, in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
X:4 [binder, in Undecidability.TM.Hoare.HoareLegacy]
X:4 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
x:4 [binder, in Undecidability.Shared.Libs.DLW.Utils.quotient]
x:4 [binder, in Undecidability.L.Datatypes.Lists]
x:4 [binder, in Complexity.Complexity.Subtypes]
x:4 [binder, in Complexity.L.Functions.IterupN]
x:4 [binder, in Undecidability.L.Prelim.MoreBase]
x:4 [binder, in Undecidability.L.Tactics.ComputableDemo]
x:4 [binder, in Undecidability.Shared.Libs.DLW.Wf.wf_incl]
X:4 [binder, in Undecidability.L.Datatypes.LVector]
X:4 [binder, in Complexity.L.TM.TMflatComp]
X:4 [binder, in Undecidability.L.Datatypes.List.List_nat]
x:4 [binder, in Complexity.Complexity.UpToCPoly]
x:4 [binder, in Undecidability.Shared.Libs.DLW.Utils.php]
x:4 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicFinTypes]
x:4 [binder, in Undecidability.L.Functions.EqBool]
X:4 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
X:4 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_base]
x:4 [binder, in Undecidability.L.Datatypes.List.List_eqb]
X:4 [binder, in Undecidability.Synthetic.InformativeDefinitions]
x:4 [binder, in Undecidability.Shared.Libs.PSL.Lists.Dupfree]
x:4 [binder, in Complexity.TM.Single.DecodeTapes]
x:4 [binder, in Undecidability.L.Functions.EnumInt]
X:4 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
x:4 [binder, in Undecidability.Synthetic.Infinite]
x:4 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatTCC_to_FlatCC]
X:4 [binder, in Undecidability.Shared.ListAutomation]
x:4 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.Cardinality]
x:4 [binder, in Undecidability.Shared.Libs.DLW.Utils.seteq]
x:4 [binder, in Undecidability.TM.PrettyBounds.MaxList]
X:4 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler]
X:4 [binder, in Undecidability.L.Functions.Encoding]
x:4 [binder, in Undecidability.TM.Code.ProgrammingTools]
x:4 [binder, in Undecidability.TM.Hoare.HoareExamples]
x:4 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.FiniteFunction]
X:4 [binder, in Undecidability.L.AbstractMachines.LargestVar]
x:40 [binder, in Complexity.Libs.Pigeonhole]
x:40 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
x:40 [binder, in Complexity.TM.PrettyBounds.BaseCode]
x:40 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
x:40 [binder, in Complexity.L.AbstractMachines.Computable.EvalForTime]
X:40 [binder, in Undecidability.L.Tactics.Lrewrite]
x:40 [binder, in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
x:40 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
x:40 [binder, in Undecidability.TM.Compound.MoveToSymbol]
x:40 [binder, in Undecidability.Shared.Libs.DLW.Utils.quotient]
x:40 [binder, in Complexity.Complexity.Subtypes]
x:40 [binder, in Undecidability.TM.Code.BinNumbers.NTM]
X:40 [binder, in Complexity.Libs.UniformHomomorphisms]
x:40 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_upto]
x:40 [binder, in Undecidability.TM.Code.CaseSum]
X:40 [binder, in Complexity.Complexity.SpaceBoundsTime]
x:40 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachine]
x:40 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
x:40 [binder, in Undecidability.TM.Code.ChangeAlphabet]
X:40 [binder, in Undecidability.Synthetic.ListEnumerabilityFacts]
x:40 [binder, in Undecidability.L.Tactics.ComputableTactics]
X:40 [binder, in Undecidability.Shared.Dec]
x:40 [binder, in Undecidability.L.Datatypes.LNat]
x:40 [binder, in Undecidability.L.Tactics.Computable]
x:40 [binder, in Complexity.L.AbstractMachines.Computable.LargestVar]
X:400 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:400 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:400 [binder, in Complexity.NP.TM.LM_to_mTM]
x:401 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:401 [binder, in Undecidability.TM.Hoare.HoareCombinators]
x:401 [binder, in Complexity.NP.TM.LM_to_mTM]
x:402 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:402 [binder, in Complexity.NP.TM.LM_to_mTM]
x:403 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
X:403 [binder, in Undecidability.TM.Code.Copy]
x:403 [binder, in Complexity.NP.TM.LM_to_mTM]
x:404 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:404 [binder, in Undecidability.TM.Hoare.HoareCombinators]
x:404 [binder, in Complexity.NP.TM.LM_to_mTM]
x:405 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:405 [binder, in Complexity.NP.TM.LM_to_mTM]
x:406 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
x:406 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:406 [binder, in Complexity.NP.TM.LM_to_mTM]
x:407 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:407 [binder, in Undecidability.TM.Code.Copy]
x:407 [binder, in Undecidability.TM.Hoare.HoareCombinators]
x:407 [binder, in Complexity.NP.TM.LM_to_mTM]
X:408 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:408 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:408 [binder, in Complexity.NP.TM.LM_to_mTM]
x:409 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:409 [binder, in Complexity.NP.TM.LM_to_mTM]
X:41 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
x:41 [binder, in Undecidability.Shared.Libs.PSL.FCI]
x:41 [binder, in Undecidability.Shared.Libs.PSL.Lists.Removal]
x:41 [binder, in Undecidability.L.Datatypes.List.List_basics]
X:41 [binder, in Undecidability.L.Computability.Enum]
x:41 [binder, in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
x:41 [binder, in Undecidability.Shared.Libs.PSL.EqDec]
X:41 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:41 [binder, in Undecidability.TM.Util.VectorPrelim]
X:41 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
x:41 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
X:41 [binder, in Complexity.Complexity.Subtypes]
x:41 [binder, in Undecidability.L.Complexity.UpToC]
x:41 [binder, in Complexity.TM.PrettyBounds.BaseCodeSpace]
X:41 [binder, in Complexity.Libs.CookPrelim.PolyBounds]
X:41 [binder, in Complexity.Complexity.UpToCPoly]
x:41 [binder, in Undecidability.Shared.Libs.DLW.Utils.php]
X:41 [binder, in Complexity.L.TM.TMunflatten]
x:41 [binder, in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
x:41 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.Arbitrary]
x:41 [binder, in Undecidability.TM.Util.Relations]
x:41 [binder, in Undecidability.TM.Code.Copy]
X:41 [binder, in Undecidability.L.Tactics.ComputableTactics]
X:41 [binder, in Undecidability.Shared.Dec]
x:41 [binder, in Undecidability.L.Computability.Synthetic]
x:41 [binder, in Undecidability.Synthetic.Infinite]
x:41 [binder, in Undecidability.Shared.ListAutomation]
X:41 [binder, in Complexity.Complexity.Definitions]
X:41 [binder, in Complexity.L.AbstractMachines.FunctionalDefinitions]
x:41 [binder, in Undecidability.L.Datatypes.LNat]
x:41 [binder, in Undecidability.TM.PrettyBounds.MaxList]
x:41 [binder, in Complexity.TM.PrettyBounds.PrettyBounds]
X:410 [binder, in Undecidability.TM.Single.StepTM]
x:410 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:410 [binder, in Complexity.NP.TM.LM_to_mTM]
x:411 [binder, in Undecidability.TM.Single.StepTM]
x:411 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:411 [binder, in Complexity.NP.TM.LM_to_mTM]
x:412 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:412 [binder, in Undecidability.TM.Hoare.HoareCombinators]
x:412 [binder, in Complexity.NP.TM.LM_to_mTM]
x:413 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:413 [binder, in Complexity.NP.TM.LM_to_mTM]
x:414 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:414 [binder, in Complexity.NP.TM.LM_to_mTM]
x:415 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:415 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:415 [binder, in Undecidability.TM.Hoare.HoareCombinators]
x:415 [binder, in Complexity.NP.TM.LM_to_mTM]
x:416 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:416 [binder, in Complexity.NP.TM.LM_to_mTM]
x:417 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
X:417 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:417 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:417 [binder, in Complexity.NP.TM.LM_to_mTM]
x:418 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:418 [binder, in Complexity.NP.TM.LM_to_mTM]
x:419 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:419 [binder, in Complexity.NP.TM.LM_to_mTM]
x:42 [binder, in Undecidability.L.Prelim.ARS]
X:42 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
x:42 [binder, in Complexity.L.AbstractMachines.Computable.EvalForTime]
x:42 [binder, in Undecidability.Shared.Libs.PSL.FCI]
x:42 [binder, in Undecidability.L.Tactics.Lrewrite]
x:42 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
x:42 [binder, in Complexity.TM.Code.Decode]
X:42 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
x:42 [binder, in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
x:42 [binder, in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
x:42 [binder, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
x:42 [binder, in Undecidability.L.Tactics.LClos]
X:42 [binder, in Undecidability.TM.Util.VectorPrelim]
x:42 [binder, in Undecidability.Synthetic.EnumerabilityFacts]
x:42 [binder, in Undecidability.Shared.Libs.PSL.Lists.Filter]
x:42 [binder, in Undecidability.TM.Compound.MoveToSymbol]
x:42 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
x:42 [binder, in Undecidability.Shared.Libs.DLW.Utils.interval]
X:42 [binder, in Undecidability.L.Tactics.ComputableDemo]
X:42 [binder, in Undecidability.L.Complexity.UpToC]
x:42 [binder, in Complexity.NP.L.GenNPBool]
x:42 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_upto]
x:42 [binder, in Complexity.L.AbstractMachines.FlatPro.Computable.Compile]
x:42 [binder, in Undecidability.TM.Code.WriteValue]
x:42 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
x:42 [binder, in Complexity.Complexity.ONotationIsAppropriate]
X:42 [binder, in Undecidability.L.Functions.EqBool]
X:42 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_base]
x:42 [binder, in Undecidability.Synthetic.MoreEnumerabilityFacts]
x:42 [binder, in Undecidability.L.Functions.UnboundIteration]
x:42 [binder, in Undecidability.TM.Code.ChangeAlphabet]
x:42 [binder, in Complexity.TM.Single.DecodeTapes]
x:42 [binder, in Undecidability.Synthetic.DecidabilityFacts]
x:42 [binder, in Undecidability.Shared.Libs.PSL.Vectors.VectorDupfree]
x:42 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
x:42 [binder, in Undecidability.TM.Code.Code]
X:42 [binder, in Undecidability.TM.Univ.LookupAssociativeListTM]
X:42 [binder, in Undecidability.TM.Code.CasePair]
x:42 [binder, in Undecidability.L.Tactics.Computable]
x:42 [binder, in Undecidability.Synthetic.ReducibilityFacts]
X:42 [binder, in Undecidability.TM.Single.EncodeTapes]
x:420 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:420 [binder, in Undecidability.TM.Hoare.HoareCombinators]
x:420 [binder, in Complexity.NP.TM.LM_to_mTM]
x:421 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:421 [binder, in Complexity.NP.TM.LM_to_mTM]
x:422 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:422 [binder, in Complexity.NP.TM.LM_to_mTM]
x:423 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:423 [binder, in Undecidability.TM.Hoare.HoareCombinators]
x:423 [binder, in Complexity.NP.TM.LM_to_mTM]
x:424 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:424 [binder, in Complexity.NP.TM.LM_to_mTM]
x:425 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:425 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:425 [binder, in Complexity.NP.TM.LM_to_mTM]
X:426 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:426 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:426 [binder, in Complexity.NP.TM.LM_to_mTM]
x:427 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:427 [binder, in Complexity.NP.TM.LM_to_mTM]
x:428 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:428 [binder, in Complexity.NP.TM.LM_to_mTM]
x:429 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
X:429 [binder, in Undecidability.TM.Hoare.HoareCombinators]
x:429 [binder, in Complexity.NP.TM.LM_to_mTM]
x:43 [binder, in Undecidability.L.Prelim.ARS]
X:43 [binder, in Complexity.TM.PrettyBounds.BaseCode]
x:43 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
x:43 [binder, in Undecidability.Shared.Libs.PSL.Lists.Removal]
x:43 [binder, in Undecidability.Shared.Libs.DLW.Utils.prime]
x:43 [binder, in Undecidability.L.Complexity.UpToCNary]
X:43 [binder, in Complexity.TM.PrettyBounds.UnivBounds]
X:43 [binder, in Undecidability.L.Tactics.ComputableTime]
x:43 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
x:43 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
X:43 [binder, in Undecidability.Synthetic.EnumerabilityFacts]
x:43 [binder, in Undecidability.Shared.Libs.DLW.Utils.quotient]
x:43 [binder, in Undecidability.Shared.Libs.DLW.Utils.interval]
x:43 [binder, in Complexity.TM.Single.EncodeTapesInvariants]
X:43 [binder, in Complexity.L.TM.CompCode]
x:43 [binder, in Complexity.NP.L.GenNPBool]
x:43 [binder, in Undecidability.TM.Code.CompareValue]
x:43 [binder, in Undecidability.TM.Code.WriteValue]
x:43 [binder, in Undecidability.Shared.Libs.DLW.Utils.php]
x:43 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.Arbitrary]
x:43 [binder, in Complexity.TM.Single.DecodeTapes]
x:43 [binder, in Undecidability.Synthetic.DecidabilityFacts]
X:43 [binder, in Undecidability.Shared.Dec]
X:43 [binder, in Undecidability.TM.Lifting.LiftTapes]
x:43 [binder, in Undecidability.L.Computability.Synthetic]
x:43 [binder, in Undecidability.Synthetic.Infinite]
x:43 [binder, in Complexity.Complexity.PolyTimeComputable]
x:43 [binder, in Undecidability.Synthetic.ReducibilityFacts]
x:43 [binder, in Undecidability.TM.Hoare.HoareExamples]
x:43 [binder, in Undecidability.L.Functions.Size]
X:43 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
x:430 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:430 [binder, in Complexity.NP.TM.LM_to_mTM]
x:431 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:431 [binder, in Complexity.NP.TM.LM_to_mTM]
x:432 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:432 [binder, in Complexity.NP.TM.LM_to_mTM]
x:433 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:433 [binder, in Complexity.NP.TM.LM_to_mTM]
x:434 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:434 [binder, in Complexity.NP.TM.LM_to_mTM]
x:435 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:435 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:435 [binder, in Undecidability.TM.Hoare.HoareCombinators]
x:435 [binder, in Complexity.NP.TM.LM_to_mTM]
x:436 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:436 [binder, in Complexity.NP.TM.LM_to_mTM]
X:437 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:437 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:437 [binder, in Undecidability.TM.Hoare.HoareCombinators]
x:437 [binder, in Complexity.NP.TM.LM_to_mTM]
x:438 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:438 [binder, in Complexity.NP.TM.LM_to_mTM]
x:439 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:439 [binder, in Complexity.NP.TM.LM_to_mTM]
x:44 [binder, in Complexity.Libs.Pigeonhole]
x:44 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
x:44 [binder, in Undecidability.TM.L.CompilerBoolFuns.NaryApp]
x:44 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:44 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
x:44 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
x:44 [binder, in Undecidability.Shared.Libs.DLW.Utils.interval]
x:44 [binder, in Complexity.TM.PrettyBounds.BaseCodeSpace]
x:44 [binder, in Complexity.Libs.UniformHomomorphisms]
x:44 [binder, in Undecidability.Shared.Libs.DLW.Utils.php]
x:44 [binder, in Undecidability.L.Functions.UnboundIteration]
x:44 [binder, in Complexity.TM.Single.DecodeTapes]
x:44 [binder, in Undecidability.Synthetic.DecidabilityFacts]
x:44 [binder, in Undecidability.TM.Lifting.LiftTapes]
x:44 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
x:44 [binder, in Undecidability.L.Complexity.GenericNary]
X:44 [binder, in Undecidability.TM.Code.Code]
X:44 [binder, in Undecidability.L.Functions.Decoding]
x:44 [binder, in Undecidability.TM.Code.CasePair]
x:44 [binder, in Complexity.Complexity.NP]
X:44 [binder, in Complexity.NP.TM.LM_to_mTM]
x:44 [binder, in Complexity.TM.PrettyBounds.PrettyBounds]
x:440 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:440 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:440 [binder, in Complexity.NP.TM.LM_to_mTM]
X:441 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:441 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:441 [binder, in Undecidability.TM.Hoare.HoareCombinators]
x:441 [binder, in Complexity.NP.TM.LM_to_mTM]
x:442 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:442 [binder, in Complexity.NP.TM.LM_to_mTM]
x:443 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:443 [binder, in Complexity.NP.TM.LM_to_mTM]
x:444 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:444 [binder, in Complexity.NP.TM.LM_to_mTM]
X:445 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:445 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:445 [binder, in Complexity.NP.TM.LM_to_mTM]
x:446 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:446 [binder, in Complexity.NP.TM.LM_to_mTM]
x:447 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:447 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:447 [binder, in Complexity.NP.TM.LM_to_mTM]
x:448 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
X:448 [binder, in Undecidability.TM.Hoare.HoareCombinators]
x:448 [binder, in Complexity.NP.TM.LM_to_mTM]
X:449 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:449 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:449 [binder, in Complexity.NP.TM.LM_to_mTM]
x:45 [binder, in Complexity.TM.PrettyBounds.BaseCode]
x:45 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
X:45 [binder, in Undecidability.TM.Code.List.Nth]
x:45 [binder, in Undecidability.L.Computability.Enum]
x:45 [binder, in Undecidability.L.Tactics.ComputableTime]
x:45 [binder, in Complexity.TM.Code.Decode]
X:45 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
x:45 [binder, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
X:45 [binder, in Undecidability.TM.Code.List.Length]
X:45 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
x:45 [binder, in Undecidability.Shared.Libs.DLW.Utils.quotient]
x:45 [binder, in Undecidability.Shared.Libs.DLW.Utils.interval]
x:45 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_upto]
X:45 [binder, in Complexity.Complexity.UpToCPoly]
x:45 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_base]
X:45 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.Arbitrary]
X:45 [binder, in Undecidability.TM.Util.Relations]
X:45 [binder, in Complexity.L.TM.TMflatten]
x:45 [binder, in Undecidability.TM.Code.ChangeAlphabet]
x:45 [binder, in Complexity.TM.Single.DecodeTapes]
X:45 [binder, in Undecidability.Synthetic.DecidabilityFacts]
X:45 [binder, in Undecidability.L.Tactics.ComputableTactics]
X:45 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
x:45 [binder, in Undecidability.L.Computability.Synthetic]
x:45 [binder, in Undecidability.Synthetic.Infinite]
x:45 [binder, in Undecidability.L.Datatypes.LNat]
X:45 [binder, in Undecidability.Synthetic.ReducibilityFacts]
x:45 [binder, in Complexity.L.AbstractMachines.Computable.LargestVar]
x:45 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
x:450 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:450 [binder, in Complexity.NP.TM.LM_to_mTM]
x:451 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:451 [binder, in Complexity.NP.TM.LM_to_mTM]
X:452 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:452 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:452 [binder, in Complexity.NP.TM.LM_to_mTM]
x:453 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:453 [binder, in Complexity.NP.TM.LM_to_mTM]
x:454 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:454 [binder, in Complexity.NP.TM.LM_to_mTM]
x:455 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:455 [binder, in Complexity.NP.TM.LM_to_mTM]
x:456 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:456 [binder, in Complexity.NP.TM.LM_to_mTM]
x:457 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:457 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:457 [binder, in Undecidability.TM.Hoare.HoareCombinators]
x:457 [binder, in Complexity.NP.TM.LM_to_mTM]
X:458 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:458 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:458 [binder, in Complexity.NP.TM.LM_to_mTM]
x:459 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:459 [binder, in Undecidability.TM.Hoare.HoareCombinators]
x:459 [binder, in Complexity.NP.TM.LM_to_mTM]
x:46 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
x:46 [binder, in Undecidability.Shared.Libs.PSL.Lists.Removal]
x:46 [binder, in Undecidability.TM.Code.BinNumbers.PosMultTM]
X:46 [binder, in Undecidability.Shared.Libs.PSL.EqDec]
x:46 [binder, in Complexity.TM.Code.Decode]
x:46 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
x:46 [binder, in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
X:46 [binder, in Undecidability.TM.Util.VectorPrelim]
X:46 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
x:46 [binder, in Undecidability.L.Complexity.UpToC]
x:46 [binder, in Complexity.TM.PrettyBounds.BaseCodeSpace]
X:46 [binder, in Complexity.Libs.CookPrelim.PolyBounds]
x:46 [binder, in Complexity.L.AbstractMachines.FlatPro.Computable.Compile]
x:46 [binder, in Undecidability.TM.Code.CompareValue]
x:46 [binder, in Undecidability.TM.Code.CaseSum]
X:46 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_base]
x:46 [binder, in Undecidability.TM.Code.NatSub]
x:46 [binder, in Complexity.NP.TM.M_multi2mono]
x:46 [binder, in Undecidability.Synthetic.ListEnumerabilityFacts]
x:46 [binder, in Undecidability.TM.Code.Copy]
x:46 [binder, in Complexity.TM.Single.DecodeTapes]
x:46 [binder, in Undecidability.L.Tactics.Reflection]
X:46 [binder, in Undecidability.Synthetic.DecidabilityFacts]
x:46 [binder, in Undecidability.Shared.Libs.PSL.Vectors.VectorDupfree]
x:46 [binder, in Complexity.Complexity.NP]
X:46 [binder, in Undecidability.TM.Single.EncodeTapes]
x:460 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:460 [binder, in Complexity.NP.TM.LM_to_mTM]
x:461 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:461 [binder, in Complexity.NP.TM.LM_to_mTM]
x:462 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:462 [binder, in Complexity.NP.TM.LM_to_mTM]
x:463 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
X:463 [binder, in Undecidability.TM.Hoare.HoareRegister]
x:463 [binder, in Undecidability.TM.Hoare.HoareCombinators]
x:463 [binder, in Complexity.NP.TM.LM_to_mTM]
X:464 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:464 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:464 [binder, in Complexity.NP.TM.LM_to_mTM]
x:465 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:465 [binder, in Complexity.NP.TM.LM_to_mTM]
x:466 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:466 [binder, in Complexity.NP.TM.LM_to_mTM]
x:467 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:467 [binder, in Complexity.NP.TM.LM_to_mTM]
x:468 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:468 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:468 [binder, in Complexity.NP.TM.LM_to_mTM]
X:469 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:469 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:469 [binder, in Complexity.NP.TM.LM_to_mTM]
x:47 [binder, in Complexity.Libs.Pigeonhole]
x:47 [binder, in Undecidability.L.Prelim.ARS]
x:47 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
x:47 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_quotient]
X:47 [binder, in Complexity.TM.Code.Decode]
x:47 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
X:47 [binder, in Undecidability.Synthetic.EnumerabilityFacts]
x:47 [binder, in Undecidability.Shared.Libs.DLW.Code.compiler]
x:47 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
X:47 [binder, in Undecidability.L.Complexity.UpToC]
x:47 [binder, in Undecidability.TM.Code.CodeTM]
X:47 [binder, in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
x:47 [binder, in Undecidability.L.Functions.EqBool]
x:47 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.Arbitrary]
x:47 [binder, in Undecidability.TM.Code.ChangeAlphabet]
X:47 [binder, in Undecidability.Synthetic.DecidabilityFacts]
x:47 [binder, in Undecidability.Synthetic.Infinite]
X:47 [binder, in Undecidability.Shared.ListAutomation]
x:47 [binder, in Undecidability.TM.Univ.LookupAssociativeListTM]
X:47 [binder, in Complexity.L.AbstractMachines.FunctionalDefinitions]
x:47 [binder, in Undecidability.L.Datatypes.LNat]
x:47 [binder, in Complexity.Complexity.PolyTimeComputable]
x:470 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:470 [binder, in Complexity.NP.TM.LM_to_mTM]
x:471 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:471 [binder, in Complexity.NP.TM.LM_to_mTM]
x:472 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:472 [binder, in Undecidability.TM.Hoare.HoareRegister]
x:472 [binder, in Complexity.NP.TM.LM_to_mTM]
x:473 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:473 [binder, in Undecidability.TM.Hoare.HoareRegister]
x:473 [binder, in Complexity.NP.TM.LM_to_mTM]
x:474 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:474 [binder, in Complexity.NP.TM.LM_to_mTM]
x:475 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:475 [binder, in Complexity.NP.TM.LM_to_mTM]
x:476 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:476 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:476 [binder, in Undecidability.TM.Hoare.HoareRegister]
x:476 [binder, in Complexity.NP.TM.LM_to_mTM]
x:477 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:477 [binder, in Complexity.NP.TM.LM_to_mTM]
x:478 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:478 [binder, in Complexity.NP.TM.LM_to_mTM]
x:479 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:479 [binder, in Complexity.NP.TM.LM_to_mTM]
x:48 [binder, in Undecidability.Shared.Libs.PSL.Numbers]
x:48 [binder, in Complexity.Libs.Pigeonhole]
x:48 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
X:48 [binder, in Complexity.TM.PrettyBounds.BaseCode]
x:48 [binder, in Undecidability.Shared.Libs.PSL.Lists.Removal]
x:48 [binder, in Undecidability.L.Complexity.UpToCNary]
x:48 [binder, in Complexity.TM.PrettyBounds.UnivBounds]
X:48 [binder, in Undecidability.Shared.Libs.PSL.EqDec]
X:48 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
x:48 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:48 [binder, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
x:48 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
X:48 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
x:48 [binder, in Complexity.TM.PrettyBounds.BaseCodeSpace]
X:48 [binder, in Complexity.L.TM.TMflatComp]
x:48 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_upto]
X:48 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.Arbitrary]
x:48 [binder, in Undecidability.L.Functions.UnboundIteration]
X:48 [binder, in Undecidability.Shared.ListAutomation]
x:48 [binder, in Complexity.Complexity.PolyTimeComputable]
x:48 [binder, in Undecidability.Shared.Libs.DLW.Vec.pos]
x:48 [binder, in Undecidability.TM.Code.CasePair]
X:48 [binder, in Undecidability.TM.Hoare.HoareExamples]
x:48 [binder, in Undecidability.L.Functions.Size]
X:48 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
x:48 [binder, in Complexity.TM.PrettyBounds.PrettyBounds]
x:480 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:480 [binder, in Complexity.NP.TM.LM_to_mTM]
x:481 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:481 [binder, in Complexity.NP.TM.LM_to_mTM]
x:482 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:482 [binder, in Complexity.NP.TM.LM_to_mTM]
x:483 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:483 [binder, in Complexity.NP.TM.LM_to_mTM]
x:484 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:484 [binder, in Complexity.NP.TM.LM_to_mTM]
x:485 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:485 [binder, in Complexity.NP.TM.LM_to_mTM]
x:486 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:486 [binder, in Complexity.NP.TM.LM_to_mTM]
x:487 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:487 [binder, in Complexity.NP.TM.LM_to_mTM]
x:488 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:488 [binder, in Complexity.NP.TM.LM_to_mTM]
x:489 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:489 [binder, in Complexity.NP.TM.LM_to_mTM]
x:49 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
x:49 [binder, in Undecidability.TM.Code.CaseList]
x:49 [binder, in Undecidability.TM.Hoare.HoareTactics]
x:49 [binder, in Undecidability.L.Computability.Enum]
x:49 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
x:49 [binder, in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
x:49 [binder, in Undecidability.Shared.Libs.PSL.Lists.Position]
x:49 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
x:49 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
x:49 [binder, in Complexity.Complexity.Subtypes]
x:49 [binder, in Undecidability.L.Tactics.ComputableDemo]
X:49 [binder, in Complexity.Complexity.UpToCPoly]
x:49 [binder, in Complexity.L.TM.TMunflatten]
X:49 [binder, in Undecidability.L.Functions.EqBool]
x:49 [binder, in Undecidability.TM.Util.Relations]
X:49 [binder, in Undecidability.Synthetic.ListEnumerabilityFacts]
X:49 [binder, in Undecidability.Synthetic.DecidabilityFacts]
X:49 [binder, in Undecidability.L.Datatypes.List.List_in]
x:49 [binder, in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
x:49 [binder, in Undecidability.TM.Code.Code]
x:49 [binder, in Undecidability.TM.Univ.LookupAssociativeListTM]
X:49 [binder, in Complexity.Complexity.PolyTimeComputable]
x:49 [binder, in Undecidability.L.Tactics.Computable]
x:49 [binder, in Complexity.Complexity.NP]
X:49 [binder, in Undecidability.Synthetic.ReducibilityFacts]
X:49 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
x:490 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:490 [binder, in Complexity.NP.TM.LM_to_mTM]
x:491 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:491 [binder, in Complexity.NP.TM.LM_to_mTM]
x:492 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:492 [binder, in Complexity.NP.TM.LM_to_mTM]
x:493 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:493 [binder, in Complexity.NP.TM.LM_to_mTM]
x:494 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:494 [binder, in Complexity.NP.TM.LM_to_mTM]
x:495 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:495 [binder, in Complexity.NP.TM.LM_to_mTM]
x:496 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:496 [binder, in Complexity.NP.TM.LM_to_mTM]
x:497 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:497 [binder, in Complexity.NP.TM.LM_to_mTM]
x:498 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:498 [binder, in Complexity.NP.TM.LM_to_mTM]
x:499 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:499 [binder, in Complexity.NP.TM.LM_to_mTM]
X:5 [binder, in Undecidability.Shared.Libs.PSL.Numbers]
x:5 [binder, in Undecidability.L.Prelim.ARS]
x:5 [binder, in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
x:5 [binder, in Complexity.NP.L.GenNP_is_hard]
x:5 [binder, in Undecidability.Shared.Libs.PSL.Lists.Removal]
x:5 [binder, in Complexity.Complexity.EncodableP]
x:5 [binder, in Undecidability.Synthetic.SemiDecidabilityFacts]
X:5 [binder, in Undecidability.L.Datatypes.List.List_basics]
x:5 [binder, in Undecidability.L.Complexity.UpToCNary]
x:5 [binder, in Undecidability.Shared.Libs.PSL.Prelim]
x:5 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
x:5 [binder, in Complexity.L.Datatypes.LDepPair]
x:5 [binder, in Undecidability.Shared.Libs.PSL.Retracts]
x:5 [binder, in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
x:5 [binder, in Undecidability.TM.Code.List.Cons_constant]
x:5 [binder, in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
x:5 [binder, in Undecidability.L.Prelim.LoopSum]
X:5 [binder, in Undecidability.Shared.FinTypeEquiv]
X:5 [binder, in Undecidability.L.Datatypes.Lists]
x:5 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
X:5 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
x:5 [binder, in Complexity.Complexity.Subtypes]
x:5 [binder, in Undecidability.Shared.FinTypeForallExists]
X:5 [binder, in Complexity.Libs.CookPrelim.PolyBounds]
x:5 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_upto]
x:5 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
X:5 [binder, in Undecidability.L.Datatypes.LFinType]
x:5 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicFinTypes]
X:5 [binder, in Undecidability.TM.Hoare.HoareRegister]
x:5 [binder, in Undecidability.TM.Code.NatSub]
x:5 [binder, in Undecidability.Shared.Libs.PSL.Bijection]
x:5 [binder, in Complexity.L.AbstractMachines.Computable.Lookup]
X:5 [binder, in Complexity.TM.Compound.MoveToSymbol_niceSpec]
x:5 [binder, in Undecidability.Shared.Libs.DLW.Wf.wf_finite]
X:5 [binder, in Undecidability.Synthetic.ListEnumerabilityFacts]
x:5 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
x:5 [binder, in Complexity.TM.Single.DecodeTapes]
x:5 [binder, in Undecidability.L.TM.TMEncoding]
x:5 [binder, in Undecidability.L.Tactics.ComputableTactics]
X:5 [binder, in Undecidability.Shared.Dec]
x:5 [binder, in Complexity.L.Functions.BinNumsCompare]
x:5 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
x:5 [binder, in Undecidability.Shared.Libs.PSL.Lists.Cardinality]
x:5 [binder, in Undecidability.L.Functions.FinTypeLookup]
x:5 [binder, in Undecidability.Shared.ListAutomation]
X:5 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.Cardinality]
x:5 [binder, in Undecidability.L.Functions.Decoding]
X:5 [binder, in Complexity.Complexity.NP]
x:5 [binder, in Complexity.NP.SAT.CookLevin.Reductions.CC_to_BinaryCC]
x:5 [binder, in Undecidability.TM.Code.BinNumbers.PosAddTM]
x:5 [binder, in Complexity.TM.PrettyBounds.PrettyBounds]
x:50 [binder, in Complexity.Libs.Pigeonhole]
X:50 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
x:50 [binder, in Undecidability.TM.Hoare.HoareTactics]
X:50 [binder, in Undecidability.Shared.Libs.PSL.EqDec]
x:50 [binder, in Complexity.TM.Code.Decode]
x:50 [binder, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
x:50 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
x:50 [binder, in Undecidability.L.Tactics.LClos]
X:50 [binder, in Undecidability.TM.Util.VectorPrelim]
x:50 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
x:50 [binder, in Undecidability.Shared.Libs.DLW.Utils.quotient]
x:50 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
x:50 [binder, in Complexity.L.TM.CompCode]
X:50 [binder, in Undecidability.L.Complexity.UpToC]
x:50 [binder, in Undecidability.TM.Code.CodeTM]
x:50 [binder, in Complexity.Libs.CookPrelim.PolyBounds]
x:50 [binder, in Undecidability.TM.Code.CompareValue]
x:50 [binder, in Complexity.L.TM.TMunflatten]
x:50 [binder, in Undecidability.TM.Code.NatSub]
x:50 [binder, in Complexity.L.AbstractMachines.Computable.LargestVar]
X:50 [binder, in Complexity.NP.TM.LM_to_mTM]
X:50 [binder, in Undecidability.TM.Code.BinNumbers.PosShiftTM]
x:500 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:500 [binder, in Complexity.NP.TM.LM_to_mTM]
x:501 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:501 [binder, in Complexity.NP.TM.LM_to_mTM]
x:502 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:502 [binder, in Complexity.NP.TM.LM_to_mTM]
x:503 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:503 [binder, in Complexity.NP.TM.LM_to_mTM]
x:504 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:504 [binder, in Complexity.NP.TM.LM_to_mTM]
x:505 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:505 [binder, in Complexity.NP.TM.LM_to_mTM]
x:506 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:506 [binder, in Complexity.NP.TM.LM_to_mTM]
x:507 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:507 [binder, in Complexity.NP.TM.LM_to_mTM]
x:508 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:508 [binder, in Complexity.NP.TM.LM_to_mTM]
x:509 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:509 [binder, in Complexity.NP.TM.LM_to_mTM]
x:51 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
X:51 [binder, in Undecidability.Shared.Libs.PSL.EqDec]
X:51 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
x:51 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
X:51 [binder, in Undecidability.Synthetic.EnumerabilityFacts]
x:51 [binder, in Undecidability.Shared.Libs.PSL.Lists.Position]
x:51 [binder, in Undecidability.Shared.Libs.DLW.Utils.quotient]
x:51 [binder, in Complexity.Complexity.Subtypes]
x:51 [binder, in Undecidability.Shared.Libs.DLW.Code.compiler]
x:51 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
X:51 [binder, in Complexity.Libs.CookPrelim.PolyBounds]
x:51 [binder, in Complexity.L.TM.TMunflatten]
X:51 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
x:51 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.Arbitrary]
x:51 [binder, in Undecidability.L.Functions.UnboundIteration]
x:51 [binder, in Undecidability.TM.Code.ChangeAlphabet]
X:51 [binder, in Undecidability.Synthetic.DecidabilityFacts]
x:51 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
X:51 [binder, in Undecidability.Shared.ListAutomation]
x:51 [binder, in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
x:51 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
x:510 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:510 [binder, in Complexity.NP.TM.LM_to_mTM]
x:511 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:511 [binder, in Complexity.NP.TM.LM_to_mTM]
x:512 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:512 [binder, in Complexity.NP.TM.LM_to_mTM]
x:513 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:513 [binder, in Complexity.NP.TM.LM_to_mTM]
x:514 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:514 [binder, in Complexity.NP.TM.LM_to_mTM]
x:515 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:515 [binder, in Complexity.NP.TM.LM_to_mTM]
x:516 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:516 [binder, in Complexity.NP.TM.LM_to_mTM]
x:517 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:517 [binder, in Complexity.NP.TM.LM_to_mTM]
x:518 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:518 [binder, in Complexity.NP.TM.LM_to_mTM]
x:519 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:519 [binder, in Complexity.NP.TM.LM_to_mTM]
x:52 [binder, in Undecidability.Shared.Libs.PSL.Numbers]
x:52 [binder, in Undecidability.L.Prelim.ARS]
x:52 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
x:52 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_quotient]
x:52 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
x:52 [binder, in Complexity.L.AbstractMachines.Computable.EvalForTime]
x:52 [binder, in Undecidability.Shared.Libs.PSL.Lists.Removal]
x:52 [binder, in Undecidability.TM.Code.BinNumbers.PosMultTM]
X:52 [binder, in Complexity.TM.PrettyBounds.UnivBounds]
x:52 [binder, in Complexity.L.AbstractMachines.UnfoldTailRec]
X:52 [binder, in Undecidability.L.Tactics.ComputableTime]
x:52 [binder, in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
x:52 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
x:52 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
x:52 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
x:52 [binder, in Undecidability.Shared.Libs.DLW.Utils.quotient]
x:52 [binder, in Complexity.Complexity.Subtypes]
x:52 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_upto]
x:52 [binder, in Complexity.L.TM.TMunflatten]
X:52 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
X:52 [binder, in Complexity.L.TM.TMflatten]
X:52 [binder, in Undecidability.Synthetic.DecidabilityFacts]
x:52 [binder, in Undecidability.Shared.Libs.PSL.Vectors.VectorDupfree]
x:52 [binder, in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
x:52 [binder, in Undecidability.Synthetic.Infinite]
X:52 [binder, in Undecidability.Shared.ListAutomation]
X:52 [binder, in Undecidability.L.Functions.Decoding]
x:52 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
x:52 [binder, in Undecidability.TM.PrettyBounds.MaxList]
x:52 [binder, in Complexity.Complexity.NP]
X:52 [binder, in Undecidability.TM.Single.EncodeTapes]
X:52 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
X:52 [binder, in Complexity.TM.PrettyBounds.PrettyBounds]
x:52 [binder, in Undecidability.TM.Code.BinNumbers.PosShiftTM]
x:520 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:520 [binder, in Complexity.NP.TM.LM_to_mTM]
x:521 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:521 [binder, in Complexity.NP.TM.LM_to_mTM]
x:522 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:522 [binder, in Complexity.NP.TM.LM_to_mTM]
x:523 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:523 [binder, in Complexity.NP.TM.LM_to_mTM]
x:524 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:524 [binder, in Complexity.NP.TM.LM_to_mTM]
x:525 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:525 [binder, in Complexity.NP.TM.LM_to_mTM]
x:526 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:526 [binder, in Complexity.NP.TM.LM_to_mTM]
x:527 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:527 [binder, in Complexity.NP.TM.LM_to_mTM]
x:528 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:528 [binder, in Complexity.NP.TM.LM_to_mTM]
x:529 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:529 [binder, in Complexity.NP.TM.LM_to_mTM]
x:53 [binder, in Complexity.Libs.Pigeonhole]
x:53 [binder, in Undecidability.L.Prelim.ARS]
x:53 [binder, in Complexity.TM.PrettyBounds.BaseCode]
x:53 [binder, in Complexity.Complexity.ONotation]
x:53 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
X:53 [binder, in Undecidability.L.Datatypes.List.List_basics]
x:53 [binder, in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
X:53 [binder, in Undecidability.Shared.Libs.PSL.EqDec]
x:53 [binder, in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
X:53 [binder, in Undecidability.Synthetic.EnumerabilityFacts]
x:53 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
X:53 [binder, in Complexity.Complexity.Subtypes]
x:53 [binder, in Undecidability.Shared.Libs.DLW.Code.compiler]
x:53 [binder, in Undecidability.L.Complexity.UpToC]
x:53 [binder, in Undecidability.TM.Code.CompareValue]
x:53 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
X:53 [binder, in Complexity.Complexity.UpToCPoly]
X:53 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_base]
x:53 [binder, in Undecidability.TM.Code.NatSub]
x:53 [binder, in Undecidability.L.Datatypes.List.List_eqb]
X:53 [binder, in Undecidability.TM.Util.Relations]
x:53 [binder, in Undecidability.L.Complexity.GenericNary]
X:53 [binder, in Undecidability.Shared.ListAutomation]
x:53 [binder, in Complexity.L.AbstractMachines.FunctionalDefinitions]
X:53 [binder, in Undecidability.TM.Code.CasePair]
x:53 [binder, in Complexity.Complexity.NP]
X:53 [binder, in Undecidability.Synthetic.ReducibilityFacts]
x:530 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:530 [binder, in Complexity.NP.TM.LM_to_mTM]
x:531 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:531 [binder, in Complexity.NP.TM.LM_to_mTM]
x:532 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:532 [binder, in Complexity.NP.TM.LM_to_mTM]
x:533 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:533 [binder, in Complexity.NP.TM.LM_to_mTM]
x:534 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:534 [binder, in Complexity.NP.TM.LM_to_mTM]
x:535 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:535 [binder, in Complexity.NP.TM.LM_to_mTM]
x:536 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:536 [binder, in Complexity.NP.TM.LM_to_mTM]
x:537 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:537 [binder, in Complexity.NP.TM.LM_to_mTM]
x:538 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:538 [binder, in Complexity.NP.TM.LM_to_mTM]
x:539 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:539 [binder, in Complexity.NP.TM.LM_to_mTM]
x:54 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
x:54 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_quotient]
x:54 [binder, in Undecidability.L.Tactics.ComputableTime]
X:54 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
x:54 [binder, in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
X:54 [binder, in Undecidability.TM.Util.VectorPrelim]
x:54 [binder, in Undecidability.Shared.Libs.PSL.Lists.Position]
x:54 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
x:54 [binder, in Complexity.L.TM.CompCode]
X:54 [binder, in Undecidability.L.Complexity.UpToC]
X:54 [binder, in Complexity.L.TM.TMflatComp]
x:54 [binder, in Undecidability.TM.Code.CodeTM]
x:54 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_upto]
x:54 [binder, in Undecidability.Shared.Libs.DLW.Utils.php]
x:54 [binder, in Undecidability.L.Functions.EqBool]
x:54 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
X:54 [binder, in Complexity.NP.TM.M_multi2mono]
x:54 [binder, in Undecidability.TM.Code.ChangeAlphabet]
x:54 [binder, in Complexity.TM.Single.DecodeTapes]
x:54 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
x:54 [binder, in Undecidability.Shared.ListAutomation]
x:54 [binder, in Complexity.Complexity.NP]
x:54 [binder, in Undecidability.TM.Hoare.HoareExamples]
X:54 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
x:540 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:540 [binder, in Complexity.NP.TM.LM_to_mTM]
x:541 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:541 [binder, in Complexity.NP.TM.LM_to_mTM]
x:542 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:543 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:544 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:545 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:546 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
X:546 [binder, in Complexity.NP.TM.LM_to_mTM]
x:547 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:548 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:549 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:55 [binder, in Undecidability.Shared.Libs.PSL.Numbers]
x:55 [binder, in Complexity.Libs.Pigeonhole]
x:55 [binder, in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
x:55 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
x:55 [binder, in Undecidability.TM.Code.CaseList]
x:55 [binder, in Complexity.Complexity.ONotation]
x:55 [binder, in Undecidability.L.Complexity.UpToCNary]
x:55 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
x:55 [binder, in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
X:55 [binder, in Undecidability.TM.Code.List.Length]
x:55 [binder, in Undecidability.Shared.Libs.DLW.Utils.quotient]
x:55 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
X:55 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.Arbitrary]
X:55 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
X:55 [binder, in Undecidability.Synthetic.ListEnumerabilityFacts]
x:55 [binder, in Undecidability.TM.Code.Copy]
x:55 [binder, in Complexity.TM.Single.DecodeTapes]
X:55 [binder, in Undecidability.Shared.Libs.PSL.Vectors.VectorDupfree]
x:55 [binder, in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
X:55 [binder, in Undecidability.Shared.ListAutomation]
X:55 [binder, in Complexity.Complexity.Definitions]
x:55 [binder, in Undecidability.Shared.Libs.DLW.Code.subcode]
x:55 [binder, in Undecidability.TM.Code.CasePair]
X:55 [binder, in Complexity.NP.TM.LM_to_mTM]
x:550 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:551 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:552 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:552 [binder, in Complexity.NP.TM.LM_to_mTM]
x:553 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:553 [binder, in Complexity.NP.TM.LM_to_mTM]
x:554 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:554 [binder, in Complexity.NP.TM.LM_to_mTM]
x:555 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
X:555 [binder, in Complexity.NP.TM.LM_to_mTM]
x:556 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:557 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:558 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:559 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:56 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
x:56 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_quotient]
X:56 [binder, in Undecidability.L.Tactics.Extract]
x:56 [binder, in Complexity.TM.PrettyBounds.UnivBounds]
x:56 [binder, in Undecidability.Shared.Libs.DLW.Utils.quotient]
x:56 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
X:56 [binder, in Complexity.Complexity.UpToCPoly]
x:56 [binder, in Undecidability.Shared.Libs.DLW.Utils.php]
X:56 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
x:56 [binder, in Undecidability.TM.Util.Relations]
x:56 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
x:56 [binder, in Undecidability.Synthetic.Infinite]
x:56 [binder, in Undecidability.Shared.ListAutomation]
X:56 [binder, in Undecidability.TM.Univ.LookupAssociativeListTM]
x:56 [binder, in Complexity.Complexity.NP]
x:56 [binder, in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
x:560 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:561 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:562 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:563 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:563 [binder, in Complexity.NP.TM.LM_to_mTM]
x:564 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:564 [binder, in Complexity.NP.TM.LM_to_mTM]
x:565 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:565 [binder, in Complexity.NP.TM.LM_to_mTM]
x:566 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:566 [binder, in Complexity.NP.TM.LM_to_mTM]
x:567 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:568 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:569 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:57 [binder, in Undecidability.Shared.Libs.PSL.Numbers]
x:57 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
X:57 [binder, in Complexity.TM.PrettyBounds.BaseCode]
x:57 [binder, in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
x:57 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
x:57 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
x:57 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
x:57 [binder, in Undecidability.TM.Code.CodeTM]
X:57 [binder, in Complexity.Libs.CookPrelim.PolyBounds]
x:57 [binder, in Undecidability.TM.Code.CompareValue]
x:57 [binder, in Undecidability.TM.Code.CaseSum]
X:57 [binder, in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
X:57 [binder, in Complexity.L.TM.TMflatten]
x:57 [binder, in Undecidability.TM.Code.ChangeAlphabet]
X:57 [binder, in Undecidability.Synthetic.ListEnumerabilityFacts]
x:57 [binder, in Undecidability.L.Complexity.GenericNary]
x:57 [binder, in Undecidability.L.Computability.Synthetic]
x:57 [binder, in Undecidability.Synthetic.Infinite]
X:57 [binder, in Undecidability.Shared.ListAutomation]
x:57 [binder, in Complexity.Complexity.PolyTimeComputable]
x:57 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
x:57 [binder, in Undecidability.L.Tactics.Computable]
x:570 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:571 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:571 [binder, in Complexity.NP.TM.LM_to_mTM]
x:572 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:572 [binder, in Complexity.NP.TM.LM_to_mTM]
x:573 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:573 [binder, in Complexity.NP.TM.LM_to_mTM]
x:574 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:574 [binder, in Complexity.NP.TM.LM_to_mTM]
x:575 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:575 [binder, in Complexity.NP.TM.LM_to_mTM]
x:576 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:576 [binder, in Complexity.NP.TM.LM_to_mTM]
x:577 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:577 [binder, in Complexity.NP.TM.LM_to_mTM]
x:578 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:578 [binder, in Complexity.NP.TM.LM_to_mTM]
x:579 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
X:579 [binder, in Complexity.NP.TM.LM_to_mTM]
x:58 [binder, in Complexity.Libs.Pigeonhole]
X:58 [binder, in Undecidability.TM.Code.CaseList]
x:58 [binder, in Complexity.Complexity.ONotation]
X:58 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
X:58 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
x:58 [binder, in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
X:58 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
X:58 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_base]
x:58 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.Arbitrary]
x:58 [binder, in Undecidability.L.Functions.UnboundIteration]
X:58 [binder, in Undecidability.TM.Util.Relations]
X:58 [binder, in Undecidability.Synthetic.ListEnumerabilityFacts]
x:58 [binder, in Undecidability.L.Tactics.Reflection]
x:58 [binder, in Undecidability.Synthetic.Infinite]
x:58 [binder, in Undecidability.Shared.ListAutomation]
X:58 [binder, in Undecidability.L.Functions.Decoding]
X:58 [binder, in Complexity.Complexity.PolyTimeComputable]
x:58 [binder, in Undecidability.TM.Code.CasePair]
X:58 [binder, in Complexity.Complexity.NP]
X:58 [binder, in Undecidability.TM.Single.EncodeTapes]
X:58 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
x:58 [binder, in Complexity.TM.PrettyBounds.PrettyBounds]
x:580 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:581 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:582 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:583 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:583 [binder, in Complexity.NP.TM.LM_to_mTM]
x:584 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:584 [binder, in Complexity.NP.TM.LM_to_mTM]
x:585 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:585 [binder, in Complexity.NP.TM.LM_to_mTM]
x:586 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:586 [binder, in Complexity.NP.TM.LM_to_mTM]
x:587 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:588 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:589 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:59 [binder, in Undecidability.L.Prelim.ARS]
x:59 [binder, in Complexity.TM.PrettyBounds.BaseCode]
x:59 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_quotient]
x:59 [binder, in Undecidability.Shared.Libs.PSL.Retracts]
x:59 [binder, in Undecidability.L.Tactics.Extract]
x:59 [binder, in Undecidability.L.Tactics.ComputableTime]
X:59 [binder, in Complexity.TM.Code.Decode]
x:59 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
x:59 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:59 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
x:59 [binder, in Undecidability.L.Tactics.LClos]
x:59 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
x:59 [binder, in Undecidability.L.Complexity.UpToC]
X:59 [binder, in Complexity.Complexity.UpToCPoly]
x:59 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.Arbitrary]
x:59 [binder, in Undecidability.TM.Code.ChangeAlphabet]
X:59 [binder, in Undecidability.Synthetic.ListEnumerabilityFacts]
x:59 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
x:59 [binder, in Undecidability.Synthetic.Infinite]
X:59 [binder, in Undecidability.Shared.ListAutomation]
x:59 [binder, in Undecidability.TM.Compound.Shift]
x:59 [binder, in Undecidability.TM.PrettyBounds.MaxList]
x:590 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:591 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:592 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:593 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:594 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:595 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:596 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:597 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:598 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:599 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:6 [binder, in Complexity.Libs.Pigeonhole]
X:6 [binder, in Complexity.NP.SAT.CookLevin.Reductions.TCC_to_CC]
x:6 [binder, in Undecidability.TM.Code.BinNumbers.PosMultTM]
x:6 [binder, in Undecidability.Shared.Libs.PSL.Prelim]
X:6 [binder, in Complexity.TM.PrettyBounds.UnivBounds]
X:6 [binder, in Undecidability.Shared.Libs.PSL.EqDec]
x:6 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
X:6 [binder, in Undecidability.TM.Util.VectorPrelim]
x:6 [binder, in Complexity.L.AbstractMachines.Computable.Unfolding]
x:6 [binder, in Undecidability.Synthetic.EnumerabilityFacts]
x:6 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
x:6 [binder, in Undecidability.Shared.FinTypeEquiv]
X:6 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_nat_facts]
x:6 [binder, in Undecidability.TM.Code.BinNumbers.EncodeBinNumbers]
x:6 [binder, in Undecidability.Shared.Libs.DLW.Utils.interval]
x:6 [binder, in Undecidability.Shared.FinTypeForallExists]
x:6 [binder, in Undecidability.Shared.Libs.DLW.Wf.acc_irr]
x:6 [binder, in Undecidability.L.Complexity.UpToC]
X:6 [binder, in Complexity.L.TM.TapeDecode]
x:6 [binder, in Complexity.NP.L.GenNPBool]
x:6 [binder, in Undecidability.TM.Code.WriteValue]
X:6 [binder, in Complexity.Complexity.UpToCPoly]
x:6 [binder, in Undecidability.L.Datatypes.LFinType]
x:6 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_base]
X:6 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.Arbitrary]
x:6 [binder, in Undecidability.Synthetic.MoreEnumerabilityFacts]
X:6 [binder, in Undecidability.Synthetic.Definitions]
x:6 [binder, in Complexity.TM.Compound.MoveToSymbol_niceSpec]
x:6 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
x:6 [binder, in Undecidability.Shared.Libs.PSL.Vectors.VectorDupfree]
x:6 [binder, in Complexity.L.Functions.BinNumsCompare]
x:6 [binder, in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
X:6 [binder, in Undecidability.TM.Code.Code]
x:6 [binder, in Undecidability.L.Computability.Synthetic]
x:6 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.Cardinality]
x:6 [binder, in Undecidability.L.Datatypes.LNat]
x:6 [binder, in Undecidability.L.Complexity.LinDecode.LTD_def]
x:6 [binder, in Undecidability.L.Functions.Equality]
x:6 [binder, in Undecidability.L.Computability.Scott]
x:60 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
x:60 [binder, in Undecidability.TM.Code.CaseList]
x:60 [binder, in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
x:60 [binder, in Undecidability.L.Complexity.UpToC]
X:60 [binder, in Complexity.Libs.CookPrelim.PolyBounds]
x:60 [binder, in Undecidability.Shared.Libs.DLW.Utils.php]
X:60 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
X:60 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.Arbitrary]
x:60 [binder, in Undecidability.L.Functions.UnboundIteration]
x:60 [binder, in Undecidability.TM.Code.Copy]
X:60 [binder, in Undecidability.Shared.Libs.PSL.Vectors.VectorDupfree]
x:60 [binder, in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
x:60 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
x:60 [binder, in Undecidability.L.Computability.Synthetic]
x:60 [binder, in Undecidability.Shared.ListAutomation]
x:60 [binder, in Undecidability.TM.PrettyBounds.MaxList]
X:60 [binder, in Undecidability.TM.Code.CasePair]
X:60 [binder, in Undecidability.TM.Hoare.HoareExamples]
X:60 [binder, in Complexity.TM.PrettyBounds.PrettyBounds]
x:600 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:601 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:602 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:603 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:604 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:605 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:606 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:607 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:608 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:609 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:61 [binder, in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
x:61 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_quotient]
x:61 [binder, in Complexity.Complexity.ONotation]
x:61 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
x:61 [binder, in Undecidability.L.Complexity.UpToCNary]
X:61 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
x:61 [binder, in Undecidability.L.Tactics.Extract]
x:61 [binder, in Undecidability.L.Computability.Enum]
x:61 [binder, in Undecidability.L.Tactics.ComputableTime]
X:61 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
x:61 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:61 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:61 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
x:61 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
X:61 [binder, in Undecidability.L.Complexity.UpToC]
x:61 [binder, in Complexity.L.TM.TMflatComp]
x:61 [binder, in Undecidability.TM.Code.CodeTM]
x:61 [binder, in Undecidability.TM.Util.Relations]
x:61 [binder, in Complexity.L.TM.TMflatten]
x:61 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
X:61 [binder, in Undecidability.Shared.ListAutomation]
x:61 [binder, in Undecidability.TM.Univ.LookupAssociativeListTM]
X:61 [binder, in Complexity.Complexity.NP]
x:61 [binder, in Complexity.NP.TM.LM_to_mTM]
x:610 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:611 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:612 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:613 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:613 [binder, in Complexity.NP.TM.LM_to_mTM]
x:614 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:614 [binder, in Complexity.NP.TM.LM_to_mTM]
x:615 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:615 [binder, in Complexity.NP.TM.LM_to_mTM]
x:616 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:617 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:618 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:619 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:62 [binder, in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
x:62 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_quotient]
X:62 [binder, in Undecidability.TM.Code.CaseList]
x:62 [binder, in Complexity.Complexity.ONotation]
x:62 [binder, in Undecidability.L.Complexity.UpToCNary]
x:62 [binder, in Undecidability.L.Tactics.Extract]
X:62 [binder, in Complexity.TM.PrettyBounds.UnivBounds]
x:62 [binder, in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
x:62 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
x:62 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:62 [binder, in Undecidability.L.Computability.Seval]
x:62 [binder, in Undecidability.L.Tactics.GenEncode]
x:62 [binder, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
x:62 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
x:62 [binder, in Complexity.Complexity.Subtypes]
x:62 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
X:62 [binder, in Complexity.Complexity.UpToCPoly]
x:62 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.Arbitrary]
x:62 [binder, in Undecidability.L.Functions.UnboundIteration]
x:62 [binder, in Complexity.NP.TM.M_multi2mono]
X:62 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
x:62 [binder, in Undecidability.TM.Code.ChangeAlphabet]
x:62 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
x:62 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
X:62 [binder, in Undecidability.L.Computability.Synthetic]
X:62 [binder, in Undecidability.Shared.ListAutomation]
x:62 [binder, in Complexity.Complexity.Definitions]
x:62 [binder, in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
x:62 [binder, in Undecidability.TM.Code.CasePair]
x:62 [binder, in Undecidability.L.Tactics.Computable]
X:62 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
x:620 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:621 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:622 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:623 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:624 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:625 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:626 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:626 [binder, in Complexity.NP.TM.LM_to_mTM]
x:627 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:627 [binder, in Complexity.NP.TM.LM_to_mTM]
x:628 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:628 [binder, in Complexity.NP.TM.LM_to_mTM]
x:629 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:629 [binder, in Complexity.NP.TM.LM_to_mTM]
x:63 [binder, in Undecidability.L.Prelim.ARS]
x:63 [binder, in Complexity.Complexity.ONotation]
x:63 [binder, in Undecidability.L.Tactics.Extract]
x:63 [binder, in Undecidability.L.Computability.Seval]
X:63 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
X:63 [binder, in Undecidability.L.Datatypes.LVector]
x:63 [binder, in Undecidability.TM.Code.CodeTM]
X:63 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_base]
x:63 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.Arbitrary]
x:63 [binder, in Complexity.NP.TM.M_multi2mono]
x:63 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
x:63 [binder, in Undecidability.L.Complexity.GenericNary]
x:63 [binder, in Undecidability.Synthetic.Infinite]
X:63 [binder, in Undecidability.L.Functions.FinTypeLookup]
X:63 [binder, in Undecidability.L.Functions.Decoding]
x:63 [binder, in Undecidability.TM.PrettyBounds.MaxList]
x:63 [binder, in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
X:63 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
x:630 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:630 [binder, in Complexity.NP.TM.LM_to_mTM]
x:631 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:631 [binder, in Complexity.NP.TM.LM_to_mTM]
x:632 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:632 [binder, in Complexity.NP.TM.LM_to_mTM]
x:633 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:634 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:635 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:635 [binder, in Complexity.NP.TM.LM_to_mTM]
x:636 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:636 [binder, in Complexity.NP.TM.LM_to_mTM]
x:637 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:638 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:639 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:64 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
x:64 [binder, in Complexity.TM.PrettyBounds.BaseCode]
x:64 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_quotient]
x:64 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
x:64 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
x:64 [binder, in Undecidability.L.Computability.Seval]
x:64 [binder, in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
x:64 [binder, in Complexity.Libs.CookPrelim.PolyBounds]
x:64 [binder, in Undecidability.Shared.Libs.DLW.Utils.php]
X:64 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.Arbitrary]
x:64 [binder, in Undecidability.L.Functions.UnboundIteration]
X:64 [binder, in Undecidability.TM.Util.Relations]
X:64 [binder, in Undecidability.Synthetic.ListEnumerabilityFacts]
x:64 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
x:64 [binder, in Complexity.Complexity.NP]
X:64 [binder, in Complexity.NP.TM.LM_to_mTM]
x:640 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:641 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:642 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:643 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:65 [binder, in Undecidability.Shared.Libs.PSL.Retracts]
x:65 [binder, in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
X:65 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
x:65 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:65 [binder, in Undecidability.L.Computability.Seval]
x:65 [binder, in Undecidability.L.Tactics.LClos]
x:65 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
X:65 [binder, in Undecidability.Shared.Libs.DLW.Utils.quotient]
x:65 [binder, in Complexity.Complexity.Subtypes]
x:65 [binder, in Undecidability.L.Complexity.UpToC]
X:65 [binder, in Complexity.Libs.CookPrelim.PolyBounds]
X:65 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
X:65 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_base]
x:65 [binder, in Undecidability.Shared.Libs.PSL.Vectors.VectorDupfree]
x:65 [binder, in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
x:65 [binder, in Undecidability.L.Computability.Synthetic]
x:65 [binder, in Complexity.Complexity.NP]
x:65 [binder, in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
X:65 [binder, in Complexity.NP.TM.LM_to_mTM]
x:65 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.FiniteFunction]
x:66 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_quotient]
x:66 [binder, in Complexity.Complexity.ONotation]
x:66 [binder, in Complexity.TM.PrettyBounds.UnivBounds]
x:66 [binder, in Complexity.TM.Code.Decode]
x:66 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
X:66 [binder, in Undecidability.TM.Code.List.Length]
x:66 [binder, in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
X:66 [binder, in Undecidability.L.Complexity.UpToC]
x:66 [binder, in Complexity.TM.PrettyBounds.BaseCodeSpace]
x:66 [binder, in Undecidability.TM.Code.CodeTM]
x:66 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.Arbitrary]
x:66 [binder, in Undecidability.L.Functions.UnboundIteration]
X:66 [binder, in Undecidability.Synthetic.ListEnumerabilityFacts]
x:66 [binder, in Undecidability.L.Tactics.Reflection]
X:66 [binder, in Complexity.Complexity.Definitions]
X:66 [binder, in Undecidability.TM.Univ.LookupAssociativeListTM]
x:66 [binder, in Complexity.Complexity.PolyTimeComputable]
x:66 [binder, in Undecidability.TM.PrettyBounds.MaxList]
x:66 [binder, in Undecidability.TM.Hoare.HoareExamples]
X:67 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
x:67 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_quotient]
x:67 [binder, in Complexity.L.AbstractMachines.Computable.EvalForTime]
x:67 [binder, in Undecidability.L.Complexity.UpToCNary]
x:67 [binder, in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
x:67 [binder, in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
x:67 [binder, in Complexity.Complexity.Subtypes]
X:67 [binder, in Complexity.Complexity.UpToCPoly]
x:67 [binder, in Undecidability.Shared.Libs.DLW.Utils.php]
X:67 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_base]
x:67 [binder, in Complexity.NP.TM.M_multi2mono]
x:67 [binder, in Undecidability.TM.Code.ChangeAlphabet]
x:67 [binder, in Undecidability.TM.Code.Copy]
x:67 [binder, in Undecidability.L.Complexity.GenericNary]
X:67 [binder, in Undecidability.L.Computability.Synthetic]
x:67 [binder, in Undecidability.TM.Compound.Shift]
X:67 [binder, in Complexity.Complexity.PolyTimeComputable]
x:67 [binder, in Complexity.Complexity.NP]
X:67 [binder, in Complexity.NP.TM.LM_to_mTM]
X:67 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
x:68 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_quotient]
x:68 [binder, in Complexity.Complexity.ONotation]
X:68 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
x:68 [binder, in Undecidability.L.Tactics.ComputableTime]
x:68 [binder, in Complexity.TM.Code.Decode]
X:68 [binder, in Undecidability.Shared.Libs.DLW.Utils.quotient]
x:68 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
X:68 [binder, in Complexity.TM.PrettyBounds.BaseCodeSpace]
x:68 [binder, in Undecidability.TM.Code.CaseSum]
X:68 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
x:68 [binder, in Undecidability.L.Functions.UnboundIteration]
x:68 [binder, in Undecidability.TM.Util.Relations]
x:68 [binder, in Undecidability.Synthetic.ListEnumerabilityFacts]
x:68 [binder, in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
x:68 [binder, in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
x:68 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
x:68 [binder, in Complexity.TM.PrettyBounds.PrettyBounds]
x:69 [binder, in Undecidability.L.Prelim.ARS]
x:69 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_quotient]
x:69 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
x:69 [binder, in Undecidability.L.Computability.Enum]
X:69 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
X:69 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:69 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:69 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
X:69 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
x:69 [binder, in Undecidability.TM.Code.CodeTM]
x:69 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
X:69 [binder, in Complexity.Complexity.PolyTimeComputable]
x:69 [binder, in Undecidability.TM.PrettyBounds.MaxList]
X:69 [binder, in Undecidability.TM.Code.CasePair]
x:69 [binder, in Complexity.Complexity.NP]
x:69 [binder, in Complexity.NP.TM.LM_to_mTM]
X:7 [binder, in Undecidability.L.Prelim.ARS]
x:7 [binder, in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
x:7 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
x:7 [binder, in Undecidability.Shared.Libs.PSL.FCI]
x:7 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_dec]
X:7 [binder, in Undecidability.TM.Compound.TMTac]
x:7 [binder, in Complexity.NP.L.GenNP_is_hard]
x:7 [binder, in Undecidability.Synthetic.InformativeReducibilityFacts]
x:7 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
X:7 [binder, in Complexity.Complexity.EncodableP]
X:7 [binder, in Undecidability.Synthetic.SemiDecidabilityFacts]
X:7 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds_Loop]
x:7 [binder, in Undecidability.L.Tactics.Extract]
x:7 [binder, in Undecidability.L.Tactics.ComputableTime]
x:7 [binder, in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
X:7 [binder, in Undecidability.L.Datatypes.LSum]
x:7 [binder, in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
X:7 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
X:7 [binder, in Undecidability.Shared.Libs.DLW.Utils.quotient]
x:7 [binder, in Undecidability.TM.Code.CaseBool]
x:7 [binder, in Undecidability.L.Datatypes.Lists]
X:7 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
x:7 [binder, in Undecidability.TM.Code.BinNumbers.EncodeBinNumbers]
X:7 [binder, in Complexity.Complexity.Subtypes]
x:7 [binder, in Complexity.L.Functions.IterupN]
x:7 [binder, in Complexity.L.AbstractMachines.Computable.UnivDecTime]
x:7 [binder, in Undecidability.Shared.Libs.DLW.Code.compiler]
x:7 [binder, in Undecidability.L.Datatypes.LVector]
x:7 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_upto]
X:7 [binder, in Undecidability.TM.Code.CompareValue]
x:7 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
x:7 [binder, in Undecidability.Synthetic.Undecidability]
X:7 [binder, in Undecidability.L.Functions.EqBool]
X:7 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_base]
x:7 [binder, in Undecidability.TM.Code.NatSub]
x:7 [binder, in Undecidability.TM.L.Alphabets]
x:7 [binder, in Complexity.Complexity.SpaceBoundsTime]
X:7 [binder, in Undecidability.Synthetic.InformativeDefinitions]
x:7 [binder, in Undecidability.Shared.Libs.PSL.Lists.Dupfree]
x:7 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
x:7 [binder, in Undecidability.L.Tactics.Reflection]
x:7 [binder, in Undecidability.L.Datatypes.List.List_in]
x:7 [binder, in Undecidability.L.Tactics.ComputableTactics]
X:7 [binder, in Undecidability.Shared.Dec]
x:7 [binder, in Complexity.L.Functions.BinNumsCompare]
x:7 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
x:7 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
x:7 [binder, in Undecidability.Shared.Libs.PSL.Lists.Cardinality]
x:7 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.Cardinality]
x:7 [binder, in Complexity.Complexity.Definitions]
x:7 [binder, in Complexity.Complexity.Monotonic]
x:7 [binder, in Undecidability.Shared.Libs.DLW.Utils.seteq]
x:7 [binder, in Complexity.TM.Single.DecodeTape]
X:7 [binder, in Undecidability.TM.Code.CasePair]
x:7 [binder, in Complexity.NP.SAT.CookLevin.Reductions.CC_to_BinaryCC]
x:7 [binder, in Undecidability.Synthetic.ReducibilityFacts]
X:7 [binder, in Undecidability.TM.Hoare.HoareExamples]
x:70 [binder, in Undecidability.L.Prelim.ARS]
x:70 [binder, in Undecidability.Shared.Libs.PSL.Retracts]
x:70 [binder, in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
x:70 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:70 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
x:70 [binder, in Complexity.TM.PrettyBounds.BaseCodeSpace]
X:70 [binder, in Undecidability.TM.Util.Relations]
x:70 [binder, in Undecidability.TM.Code.ChangeAlphabet]
x:70 [binder, in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
x:70 [binder, in Undecidability.TM.Univ.LookupAssociativeListTM]
x:70 [binder, in Complexity.NP.TM.LM_to_mTM]
X:71 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
x:71 [binder, in Complexity.Complexity.ONotation]
X:71 [binder, in Complexity.TM.PrettyBounds.UnivBounds]
x:71 [binder, in Undecidability.L.Computability.Enum]
x:71 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:71 [binder, in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
x:71 [binder, in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
x:71 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
x:71 [binder, in Undecidability.L.Complexity.UpToC]
x:71 [binder, in Complexity.Complexity.UpToCPoly]
X:71 [binder, in Undecidability.Synthetic.ListEnumerabilityFacts]
X:71 [binder, in Undecidability.L.Computability.Synthetic]
X:71 [binder, in Complexity.Complexity.PolyTimeComputable]
x:71 [binder, in Undecidability.TM.Code.CasePair]
X:71 [binder, in Undecidability.TM.Hoare.HoareExamples]
x:72 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
x:72 [binder, in Complexity.Complexity.ONotation]
X:72 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
x:72 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:72 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
X:72 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
x:72 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
x:72 [binder, in Undecidability.L.Complexity.UpToC]
x:72 [binder, in Undecidability.TM.Code.CodeTM]
X:72 [binder, in Complexity.Complexity.UpToCPoly]
X:72 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
X:72 [binder, in Undecidability.TM.Util.Relations]
x:72 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
x:72 [binder, in Undecidability.TM.PrettyBounds.MaxList]
X:72 [binder, in Complexity.Complexity.NP]
x:73 [binder, in Undecidability.L.Prelim.ARS]
x:73 [binder, in Complexity.L.AbstractMachines.Computable.EvalForTime]
x:73 [binder, in Complexity.Complexity.ONotation]
x:73 [binder, in Undecidability.L.Complexity.UpToCNary]
x:73 [binder, in Undecidability.TM.Code.BinNumbers.PosDefinitions]
X:73 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
x:73 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:73 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:73 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
x:73 [binder, in Undecidability.L.Datatypes.LVector]
x:73 [binder, in Undecidability.L.Complexity.UpToC]
x:73 [binder, in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
X:73 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_base]
X:73 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
x:73 [binder, in Undecidability.Synthetic.ListEnumerabilityFacts]
x:73 [binder, in Undecidability.TM.Code.Copy]
x:73 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
x:73 [binder, in Undecidability.L.Complexity.GenericNary]
x:73 [binder, in Complexity.Complexity.Definitions]
x:74 [binder, in Complexity.TM.PrettyBounds.BaseCode]
x:74 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
x:74 [binder, in Undecidability.L.Complexity.UpToCNary]
x:74 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:74 [binder, in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
x:74 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
x:74 [binder, in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
x:74 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
x:74 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
x:74 [binder, in Undecidability.L.Complexity.UpToC]
X:74 [binder, in Complexity.TM.PrettyBounds.BaseCodeSpace]
x:74 [binder, in Undecidability.TM.Code.CodeTM]
x:74 [binder, in Complexity.Libs.CookPrelim.PolyBounds]
x:74 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
x:74 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
x:74 [binder, in Complexity.Complexity.PolyTimeComputable]
X:75 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
x:75 [binder, in Complexity.TM.PrettyBounds.UnivBounds]
x:75 [binder, in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
x:75 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
X:75 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:75 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:75 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
x:75 [binder, in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
x:75 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
x:75 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
X:75 [binder, in Undecidability.L.Datatypes.LVector]
X:75 [binder, in Undecidability.L.Complexity.UpToC]
x:75 [binder, in Complexity.L.TM.TMflatComp]
x:75 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
X:75 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_base]
X:75 [binder, in Undecidability.Synthetic.ListEnumerabilityFacts]
x:75 [binder, in Undecidability.L.Tactics.Reflection]
x:75 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
x:75 [binder, in Undecidability.TM.Univ.LookupAssociativeListTM]
X:75 [binder, in Complexity.Complexity.PolyTimeComputable]
x:75 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
x:75 [binder, in Undecidability.TM.Code.CasePair]
x:75 [binder, in Complexity.NP.TM.LM_to_mTM]
x:76 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
x:76 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:76 [binder, in Undecidability.L.Tactics.GenEncode]
x:76 [binder, in Undecidability.TM.Util.Prelim]
x:76 [binder, in Complexity.TM.PrettyBounds.BaseCodeSpace]
x:76 [binder, in Undecidability.TM.Code.CodeTM]
x:76 [binder, in Complexity.Complexity.UpToCPoly]
x:76 [binder, in Complexity.L.TM.TMunflatten]
X:76 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
x:76 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
X:76 [binder, in Complexity.NP.Clique.kSAT_to_Clique]
x:76 [binder, in Undecidability.L.Computability.Synthetic]
x:76 [binder, in Undecidability.Synthetic.Infinite]
x:77 [binder, in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
x:77 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
x:77 [binder, in Undecidability.L.Complexity.UpToCNary]
X:77 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
x:77 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:77 [binder, in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
x:77 [binder, in Undecidability.L.Tactics.GenEncode]
X:77 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
x:77 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
X:77 [binder, in Complexity.Complexity.UpToCPoly]
x:77 [binder, in Complexity.L.TM.TMunflatten]
X:77 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_base]
X:77 [binder, in Undecidability.TM.Util.Relations]
x:77 [binder, in Undecidability.Synthetic.ListEnumerabilityFacts]
X:77 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
x:77 [binder, in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
x:77 [binder, in Undecidability.TM.Hoare.HoareExamples]
x:77 [binder, in Complexity.NP.TM.LM_to_mTM]
X:77 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
x:77 [binder, in Complexity.TM.PrettyBounds.PrettyBounds]
x:78 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
x:78 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
x:78 [binder, in Undecidability.L.Tactics.ComputableTime]
x:78 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
X:78 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
x:78 [binder, in Undecidability.L.Complexity.UpToC]
x:78 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
x:78 [binder, in Undecidability.Shared.Libs.DLW.Utils.php]
x:78 [binder, in Complexity.L.TM.TMunflatten]
x:78 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
x:78 [binder, in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
x:78 [binder, in Complexity.Complexity.Definitions]
x:78 [binder, in Complexity.Complexity.PolyTimeComputable]
x:78 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
X:78 [binder, in Complexity.TM.PrettyBounds.PrettyBounds]
X:79 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
x:79 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:79 [binder, in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
X:79 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
x:79 [binder, in Complexity.L.TM.CompCode]
x:79 [binder, in Undecidability.L.Complexity.UpToC]
X:79 [binder, in Complexity.TM.PrettyBounds.BaseCodeSpace]
x:79 [binder, in Complexity.L.TM.TMflatComp]
x:79 [binder, in Undecidability.TM.Code.CodeTM]
x:79 [binder, in Complexity.L.TM.TMunflatten]
x:79 [binder, in Complexity.NP.Clique.kSAT_to_Clique]
x:79 [binder, in Undecidability.Synthetic.Infinite]
x:79 [binder, in Undecidability.TM.Univ.LookupAssociativeListTM]
x:79 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
x:79 [binder, in Complexity.NP.TM.LM_to_mTM]
x:8 [binder, in Undecidability.Shared.Libs.PSL.Numbers]
x:8 [binder, in Undecidability.Shared.Libs.PSL.FCI]
x:8 [binder, in Complexity.NP.L.CanEnumTerm_def]
x:8 [binder, in Undecidability.Synthetic.InformativeReducibilityFacts]
x:8 [binder, in Undecidability.Shared.Libs.PSL.Lists.Removal]
X:8 [binder, in Undecidability.TM.Code.List.Nth]
x:8 [binder, in Undecidability.L.Functions.LoopSum]
X:8 [binder, in Undecidability.Shared.Libs.PSL.EqDec]
x:8 [binder, in Complexity.L.TM.TMflatEnc]
X:8 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
x:8 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:8 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
X:8 [binder, in Undecidability.TM.Code.List.Length]
X:8 [binder, in Undecidability.L.Prelim.LoopSum]
x:8 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
x:8 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
X:8 [binder, in Undecidability.TM.Code.BinNumbers.EncodeBinNumbers]
x:8 [binder, in Undecidability.Shared.FinTypeForallExists]
X:8 [binder, in Undecidability.L.Datatypes.LVector]
X:8 [binder, in Undecidability.L.Complexity.UpToC]
x:8 [binder, in Complexity.TM.PrettyBounds.BaseCodeSpace]
x:8 [binder, in Complexity.NP.L.GenNPBool]
X:8 [binder, in Undecidability.L.Datatypes.List.List_nat]
x:8 [binder, in Undecidability.TM.Code.CodeTM]
x:8 [binder, in Complexity.Libs.UniformHomomorphisms]
x:8 [binder, in Undecidability.Shared.embed_nat]
x:8 [binder, in Undecidability.TM.Univ.LowLevel]
x:8 [binder, in Undecidability.Synthetic.Undecidability]
X:8 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
X:8 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_base]
x:8 [binder, in Complexity.Libs.CookPrelim.Tactics]
x:8 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.Arbitrary]
x:8 [binder, in Complexity.Complexity.SpaceBoundsTime]
x:8 [binder, in Undecidability.TM.Util.Relations]
X:8 [binder, in Undecidability.Shared.Libs.PSL.Vectors.VectorDupfree]
X:8 [binder, in Undecidability.TM.Lifting.LiftTapes]
x:8 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
x:8 [binder, in Undecidability.TM.Code.Code]
X:8 [binder, in Undecidability.L.Computability.Synthetic]
X:8 [binder, in Undecidability.Synthetic.Infinite]
X:8 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.Cardinality]
x:8 [binder, in Undecidability.TM.Univ.LookupAssociativeListTM]
x:8 [binder, in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
x:8 [binder, in Undecidability.L.Functions.Decoding]
x:8 [binder, in Undecidability.L.Datatypes.LNat]
x:8 [binder, in Undecidability.TM.PrettyBounds.MaxList]
x:8 [binder, in Undecidability.Synthetic.ReducibilityFacts]
x:8 [binder, in Undecidability.L.Computability.Scott]
x:80 [binder, in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
x:80 [binder, in Undecidability.L.Prelim.ARS]
X:80 [binder, in Complexity.TM.PrettyBounds.UnivBounds]
x:80 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
x:80 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:80 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:80 [binder, in Undecidability.TM.Util.Prelim]
x:80 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
x:80 [binder, in Undecidability.L.Complexity.UpToC]
X:80 [binder, in Complexity.Libs.CookPrelim.PolyBounds]
X:80 [binder, in Complexity.L.TM.TMunflatten]
X:80 [binder, in Undecidability.Synthetic.ListEnumerabilityFacts]
X:80 [binder, in Undecidability.L.Computability.Synthetic]
x:80 [binder, in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
X:80 [binder, in Complexity.Complexity.PolyTimeComputable]
x:80 [binder, in Undecidability.TM.PrettyBounds.MaxList]
x:81 [binder, in Undecidability.Shared.Libs.DLW.Utils.prime]
X:81 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
x:81 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
X:81 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
X:81 [binder, in Undecidability.L.Complexity.UpToC]
x:81 [binder, in Complexity.TM.PrettyBounds.BaseCodeSpace]
x:81 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
x:81 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
x:81 [binder, in Undecidability.L.Complexity.GenericNary]
x:81 [binder, in Complexity.NP.Clique.kSAT_to_Clique]
X:81 [binder, in Undecidability.TM.Code.Code]
x:81 [binder, in Undecidability.Synthetic.Infinite]
x:81 [binder, in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
x:81 [binder, in Complexity.Complexity.NP]
x:81 [binder, in Complexity.NP.TM.LM_to_mTM]
X:82 [binder, in Undecidability.TM.Single.StepTM]
X:82 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
X:82 [binder, in Undecidability.L.Tactics.Extract]
x:82 [binder, in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
x:82 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
X:82 [binder, in Undecidability.TM.Util.Prelim]
x:82 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
X:82 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
x:82 [binder, in Undecidability.TM.Code.CodeTM]
x:82 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
X:82 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
X:82 [binder, in Undecidability.TM.Util.Relations]
x:82 [binder, in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
x:82 [binder, in Complexity.Complexity.Definitions]
X:82 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
X:83 [binder, in Undecidability.TM.Code.CaseList]
x:83 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
X:83 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
x:83 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:83 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
x:83 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
x:83 [binder, in Undecidability.L.Datatypes.LVector]
X:83 [binder, in Undecidability.Synthetic.ListEnumerabilityFacts]
x:83 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
x:83 [binder, in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
x:83 [binder, in Undecidability.TM.Univ.LookupAssociativeListTM]
x:83 [binder, in Undecidability.TM.PrettyBounds.MaxList]
x:83 [binder, in Undecidability.TM.Code.CasePair]
X:83 [binder, in Complexity.Complexity.NP]
X:83 [binder, in Complexity.NP.TM.LM_to_mTM]
x:84 [binder, in Undecidability.L.Prelim.ARS]
x:84 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
x:84 [binder, in Undecidability.L.Complexity.UpToCNary]
x:84 [binder, in Complexity.TM.PrettyBounds.UnivBounds]
x:84 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:84 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
X:84 [binder, in Complexity.TM.PrettyBounds.BaseCodeSpace]
x:84 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
X:84 [binder, in Undecidability.TM.Hoare.HoareRegister]
X:84 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_base]
x:84 [binder, in Undecidability.L.Tactics.Reflection]
X:84 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
x:84 [binder, in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
x:84 [binder, in Undecidability.L.Computability.Synthetic]
x:84 [binder, in Complexity.Complexity.PolyTimeComputable]
x:84 [binder, in Undecidability.TM.Code.CasePair]
x:85 [binder, in Undecidability.L.Tactics.ComputableTime]
x:85 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:85 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
x:85 [binder, in Undecidability.L.Datatypes.LVector]
x:85 [binder, in Undecidability.L.Complexity.UpToC]
x:85 [binder, in Undecidability.Shared.Libs.DLW.Utils.php]
x:85 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
X:85 [binder, in Undecidability.Synthetic.ListEnumerabilityFacts]
x:85 [binder, in Undecidability.TM.Code.Copy]
X:85 [binder, in Undecidability.L.Computability.Synthetic]
x:85 [binder, in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
x:85 [binder, in Complexity.Complexity.PolyTimeComputable]
x:85 [binder, in Undecidability.TM.PrettyBounds.MaxList]
X:859 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
x:86 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
x:86 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
X:86 [binder, in Undecidability.L.Tactics.Extract]
X:86 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
x:86 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
X:86 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
x:86 [binder, in Undecidability.L.Complexity.UpToC]
x:86 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
X:86 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
X:86 [binder, in Complexity.Complexity.UpToCPoly]
x:86 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
X:86 [binder, in Undecidability.TM.Code.Code]
x:86 [binder, in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
X:86 [binder, in Complexity.Complexity.Definitions]
X:86 [binder, in Complexity.Complexity.PolyTimeComputable]
X:86 [binder, in Undecidability.TM.PrettyBounds.MaxList]
x:86 [binder, in Complexity.TM.PrettyBounds.PrettyBounds]
x:869 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
X:87 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
x:87 [binder, in Undecidability.L.Complexity.UpToCNary]
x:87 [binder, in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
x:87 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
x:87 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:87 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:87 [binder, in Undecidability.TM.Util.Prelim]
X:87 [binder, in Undecidability.L.Datatypes.LVector]
x:87 [binder, in Undecidability.L.Complexity.UpToC]
x:87 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_base]
x:87 [binder, in Undecidability.TM.Code.Copy]
x:87 [binder, in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
x:87 [binder, in Undecidability.TM.Util.TM_facts]
X:87 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
X:87 [binder, in Complexity.TM.PrettyBounds.PrettyBounds]
x:88 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
x:88 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:88 [binder, in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
x:88 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
X:88 [binder, in Undecidability.Shared.Libs.DLW.Utils.php]
x:88 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
x:88 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_base]
X:88 [binder, in Undecidability.TM.Util.Relations]
X:88 [binder, in Undecidability.Synthetic.ListEnumerabilityFacts]
x:88 [binder, in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
x:88 [binder, in Undecidability.TM.Univ.LookupAssociativeListTM]
x:89 [binder, in Undecidability.L.Prelim.ARS]
X:89 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
X:89 [binder, in Complexity.TM.PrettyBounds.UnivBounds]
x:89 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:89 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:89 [binder, in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
x:89 [binder, in Undecidability.L.Complexity.UpToC]
x:89 [binder, in Complexity.TM.PrettyBounds.BaseCodeSpace]
x:89 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
X:89 [binder, in Complexity.Complexity.UpToCPoly]
X:89 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
x:89 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_base]
x:89 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
x:891 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
x:9 [binder, in Undecidability.Shared.Libs.PSL.Numbers]
X:9 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
x:9 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_quotient]
x:9 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_dec]
x:9 [binder, in Complexity.NP.L.GenNP_is_hard]
x:9 [binder, in Undecidability.Synthetic.InformativeReducibilityFacts]
X:9 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
x:9 [binder, in Undecidability.TM.Code.BinNumbers.PosMultTM]
x:9 [binder, in Undecidability.L.Datatypes.LOptions]
x:9 [binder, in Undecidability.TM.Code.BinNumbers.PosDefinitions]
x:9 [binder, in Undecidability.L.Computability.Enum]
x:9 [binder, in Complexity.L.TM.TMflatEnc]
x:9 [binder, in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
x:9 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
X:9 [binder, in Undecidability.TM.Util.VectorPrelim]
X:9 [binder, in Undecidability.Synthetic.EnumerabilityFacts]
x:9 [binder, in Undecidability.TM.Code.CaseFin]
X:9 [binder, in Undecidability.L.Datatypes.Lists]
X:9 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
x:9 [binder, in Complexity.TM.Single.EncodeTapesInvariants]
X:9 [binder, in Complexity.L.Functions.IterupN]
X:9 [binder, in Complexity.Complexity.LinTimeDecodable]
x:9 [binder, in Undecidability.Shared.Libs.DLW.Wf.wf_incl]
x:9 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
X:9 [binder, in Undecidability.L.Complexity.UpToC]
X:9 [binder, in Complexity.L.TM.TapeDecode]
x:9 [binder, in Complexity.L.TM.TMflatComp]
X:9 [binder, in Complexity.Libs.CookPrelim.PolyBounds]
x:9 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
X:9 [binder, in Undecidability.L.Datatypes.LFinType]
X:9 [binder, in Undecidability.TM.Hoare.HoareRegister]
x:9 [binder, in Undecidability.TM.Code.NatSub]
x:9 [binder, in Complexity.Libs.CookPrelim.Tactics]
x:9 [binder, in Undecidability.L.Functions.Ackermann]
X:9 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.Arbitrary]
x:9 [binder, in Undecidability.L.Datatypes.List.List_eqb]
x:9 [binder, in Undecidability.Synthetic.Definitions]
x:9 [binder, in Undecidability.L.Functions.UnboundIteration]
x:9 [binder, in Undecidability.L.Tactics.ComputableTactics]
X:9 [binder, in Undecidability.Shared.Dec]
x:9 [binder, in Complexity.L.Functions.BinNumsCompare]
x:9 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
x:9 [binder, in Undecidability.Shared.Libs.PSL.Lists.Cardinality]
x:9 [binder, in Undecidability.TM.Code.Code]
x:9 [binder, in Complexity.Complexity.Definitions]
x:9 [binder, in Complexity.Complexity.Monotonic]
x:9 [binder, in Complexity.Complexity.PolyTimeComputable]
x:9 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
x:9 [binder, in Undecidability.TM.PrettyBounds.MaxList]
x:9 [binder, in Complexity.NP.SAT.CookLevin.Reductions.CC_to_BinaryCC]
x:9 [binder, in Undecidability.Synthetic.ReducibilityFacts]
x:9 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.FiniteFunction]
x:9 [binder, in Undecidability.L.Computability.Scott]
x:9 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.CompoundFinTypes]
x:9 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.DepPairs]
x:90 [binder, in Undecidability.L.Complexity.UpToCNary]
X:90 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
x:90 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
X:90 [binder, in Undecidability.L.Datatypes.LVector]
X:90 [binder, in Undecidability.L.Complexity.UpToC]
x:90 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
X:90 [binder, in Undecidability.L.Computability.Synthetic]
x:90 [binder, in Undecidability.TM.Util.TM_facts]
x:90 [binder, in Complexity.Complexity.PolyTimeComputable]
x:90 [binder, in Undecidability.TM.PrettyBounds.MaxList]
x:90 [binder, in Complexity.Complexity.NP]
x:90 [binder, in Complexity.NP.TM.LM_to_mTM]
X:91 [binder, in Undecidability.TM.Single.StepTM]
x:91 [binder, in Undecidability.L.Tactics.Extract]
X:91 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:91 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:91 [binder, in Undecidability.L.Tactics.LClos]
x:91 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
x:91 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_base]
x:91 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
x:91 [binder, in Undecidability.TM.Code.Copy]
x:91 [binder, in Complexity.Complexity.PolyTimeComputable]
X:91 [binder, in Complexity.Complexity.NP]
x:91 [binder, in Complexity.NP.TM.LM_to_mTM]
X:915 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
x:92 [binder, in Complexity.TM.PrettyBounds.BaseCode]
x:92 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:92 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:92 [binder, in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
X:92 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
x:92 [binder, in Complexity.Complexity.UpToCPoly]
x:92 [binder, in Undecidability.Shared.Libs.DLW.Utils.php]
x:92 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_base]
x:92 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
x:92 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
X:92 [binder, in Undecidability.L.Computability.Synthetic]
X:92 [binder, in Complexity.Complexity.Definitions]
X:92 [binder, in Complexity.Complexity.PolyTimeComputable]
x:92 [binder, in Complexity.NP.TM.LM_to_mTM]
X:92 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
X:92 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
x:93 [binder, in Undecidability.L.Complexity.UpToCNary]
x:93 [binder, in Complexity.TM.PrettyBounds.UnivBounds]
x:93 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:93 [binder, in Undecidability.TM.Code.CodeTM]
X:93 [binder, in Complexity.Libs.CookPrelim.PolyBounds]
x:93 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
X:93 [binder, in Complexity.Complexity.UpToCPoly]
x:93 [binder, in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
x:93 [binder, in Undecidability.TM.Util.TM_facts]
x:93 [binder, in Undecidability.TM.Univ.LookupAssociativeListTM]
x:93 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler]
x:93 [binder, in Complexity.NP.TM.LM_to_mTM]
x:93 [binder, in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
x:93 [binder, in Complexity.TM.PrettyBounds.PrettyBounds]
X:94 [binder, in Undecidability.TM.Code.CaseList]
x:94 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:94 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
X:94 [binder, in Undecidability.L.Datatypes.LVector]
x:94 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_base]
X:94 [binder, in Undecidability.TM.Util.Relations]
x:94 [binder, in Undecidability.Synthetic.ListEnumerabilityFacts]
x:94 [binder, in Complexity.Complexity.NP]
x:94 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler]
x:94 [binder, in Complexity.NP.TM.LM_to_mTM]
x:95 [binder, in Complexity.TM.PrettyBounds.UnivBounds]
x:95 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:95 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
x:95 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
x:95 [binder, in Complexity.TM.PrettyBounds.BaseCodeSpace]
x:95 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
X:95 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_base]
X:95 [binder, in Undecidability.Synthetic.ListEnumerabilityFacts]
x:95 [binder, in Undecidability.TM.Code.Copy]
x:95 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
x:95 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
x:95 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
x:95 [binder, in Undecidability.TM.Code.Code]
X:95 [binder, in Undecidability.L.Computability.Synthetic]
x:95 [binder, in Complexity.Complexity.NP]
X:95 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
x:96 [binder, in Undecidability.TM.Code.CaseList]
X:96 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
X:96 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:96 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:96 [binder, in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
X:96 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
x:96 [binder, in Undecidability.TM.Code.CodeTM]
x:96 [binder, in Complexity.Complexity.UpToCPoly]
X:96 [binder, in Undecidability.Shared.Libs.DLW.Utils.php]
x:96 [binder, in Complexity.Complexity.PolyTimeComputable]
x:96 [binder, in Complexity.Complexity.NP]
X:97 [binder, in Undecidability.TM.Single.StepTM]
X:97 [binder, in Complexity.TM.PrettyBounds.UnivBounds]
x:97 [binder, in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
x:97 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:97 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:97 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
X:97 [binder, in Undecidability.TM.Util.Prelim]
X:97 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
x:97 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
X:97 [binder, in Complexity.Complexity.UpToCPoly]
X:97 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_base]
X:97 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
X:97 [binder, in Undecidability.Synthetic.ListEnumerabilityFacts]
x:97 [binder, in Undecidability.TM.Univ.LookupAssociativeListTM]
x:97 [binder, in Complexity.Complexity.PolyTimeComputable]
x:97 [binder, in Complexity.Complexity.NP]
X:97 [binder, in Complexity.NP.TM.LM_to_mTM]
x:98 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
x:98 [binder, in Complexity.L.TM.CompCode]
x:98 [binder, in Complexity.TM.PrettyBounds.BaseCodeSpace]
x:98 [binder, in Undecidability.Shared.Libs.DLW.Utils.sorting]
X:98 [binder, in Undecidability.TM.Util.Relations]
x:98 [binder, in Complexity.L.AbstractMachines.AbstractHeapMachine]
x:98 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
x:98 [binder, in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
x:98 [binder, in Undecidability.TM.Util.TM_facts]
X:98 [binder, in Complexity.Complexity.Definitions]
x:98 [binder, in Complexity.TM.Single.DecodeTape]
X:98 [binder, in Complexity.Complexity.PolyTimeComputable]
X:98 [binder, in Complexity.Complexity.NP]
X:98 [binder, in Complexity.NP.TM.LM_to_mTM]
X:98 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
x:99 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
x:99 [binder, in Complexity.TM.PrettyBounds.UnivBounds]
x:99 [binder, in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
x:99 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
X:99 [binder, in Complexity.NP.SAT.SAT_inNP]
x:99 [binder, in Undecidability.Shared.Libs.DLW.Utils.sorting]
X:99 [binder, in Undecidability.Synthetic.ListEnumerabilityFacts]
x:99 [binder, in Undecidability.TM.Code.Copy]
x:99 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
x:99 [binder, in Undecidability.L.Computability.Synthetic]
x:99 [binder, in Undecidability.L.Tactics.Computable]
X:99 [binder, in Complexity.NP.TM.LM_to_mTM]
x:993 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
x:998 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]

Y

yExt:82 [binder, in Undecidability.L.Tactics.Computable]
yExt:91 [binder, in Undecidability.L.Tactics.Computable]
yInt:136 [binder, in Undecidability.L.Tactics.ComputableTime]
Yint:156 [binder, in Complexity.Libs.CookPrelim.PolyBounds]
yInt:18 [binder, in Undecidability.L.Tactics.ComputableTime]
Yint:21 [binder, in Undecidability.L.Datatypes.List.List_extra]
Yint:256 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
yInt:98 [binder, in Undecidability.L.Tactics.ComputableTime]
ymid:108 [binder, in Undecidability.TM.Hoare.HoareCombinators]
ymid:113 [binder, in Undecidability.TM.Hoare.HoareCombinators]
ymid:132 [binder, in Undecidability.TM.Hoare.HoareCombinators]
ymid:155 [binder, in Undecidability.TM.Hoare.HoareCombinators]
ymid:157 [binder, in Undecidability.TM.Hoare.HoareCombinators]
ymid:158 [binder, in Undecidability.TM.Combinators.StateWhile]
ymid:160 [binder, in Undecidability.TM.Hoare.HoareCombinators]
ymid:173 [binder, in Undecidability.TM.Hoare.HoareCombinators]
ymid:52 [binder, in Undecidability.TM.Combinators.While]
ymid:65 [binder, in Undecidability.TM.Combinators.While]
ymid:91 [binder, in Undecidability.TM.Combinators.While]
yout:10 [binder, in Undecidability.TM.Hoare.HoareLogic]
yout:100 [binder, in Undecidability.TM.Hoare.HoareExamples]
yout:102 [binder, in Undecidability.TM.Hoare.HoareExamples]
yout:106 [binder, in Undecidability.TM.Hoare.HoareLogic]
yout:11 [binder, in Undecidability.TM.L.Transcode.Boollist_to_Enc]
yout:11 [binder, in Undecidability.TM.Code.CaseBool]
yout:11 [binder, in Undecidability.TM.Code.CaseSum]
yout:11 [binder, in Undecidability.TM.Compound.Compare]
yout:11 [binder, in Undecidability.TM.Code.BinNumbers.PosShiftTM]
yout:111 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
yout:111 [binder, in Undecidability.TM.Hoare.HoareCombinators]
yout:113 [binder, in Undecidability.TM.Code.CaseList]
yout:113 [binder, in Undecidability.TM.Code.List.Nth]
yout:116 [binder, in Undecidability.TM.Code.List.Nth]
yout:116 [binder, in Undecidability.TM.Univ.LowLevel]
yout:116 [binder, in Undecidability.TM.Hoare.HoareLogic]
yout:118 [binder, in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
yout:12 [binder, in Undecidability.TM.Code.List.Concat_Repeat]
yout:127 [binder, in Undecidability.TM.Hoare.HoareLogic]
yout:127 [binder, in Undecidability.TM.Hoare.HoareExamples]
yout:13 [binder, in Undecidability.TM.Code.List.Length]
yout:132 [binder, in Undecidability.TM.Univ.LookupAssociativeListTM]
yout:137 [binder, in Undecidability.TM.Combinators.StateWhile]
yout:139 [binder, in Undecidability.TM.Hoare.HoareRegister]
yout:14 [binder, in Undecidability.TM.Univ.Univ]
yout:142 [binder, in Undecidability.TM.Combinators.StateWhile]
yout:145 [binder, in Undecidability.TM.Hoare.HoareRegister]
yout:147 [binder, in Undecidability.TM.Hoare.HoareLogic]
yout:15 [binder, in Complexity.TM.Code.Decode]
yout:15 [binder, in Undecidability.TM.Lifting.LiftAlphabet]
yout:15 [binder, in Undecidability.TM.Hoare.HoareLegacy]
yout:15 [binder, in Undecidability.TM.Code.CaseFin]
yout:154 [binder, in Undecidability.TM.Univ.LookupAssociativeListTM]
yout:162 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
yout:163 [binder, in Undecidability.TM.Hoare.HoareRegister]
yout:163 [binder, in Undecidability.TM.Hoare.HoareExamples]
yout:168 [binder, in Undecidability.TM.Hoare.HoareRegister]
yout:17 [binder, in Undecidability.TM.Code.BinNumbers.NTM]
yout:18 [binder, in Undecidability.TM.Code.BinNumbers.PosMultTM]
yout:18 [binder, in Undecidability.TM.Combinators.SequentialComposition]
yout:18 [binder, in Undecidability.TM.Univ.Univ]
yout:19 [binder, in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
yout:201 [binder, in Undecidability.TM.Single.StepTM]
yout:207 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
yout:209 [binder, in Undecidability.TM.Hoare.HoareCombinators]
yout:211 [binder, in Undecidability.TM.Single.StepTM]
yout:22 [binder, in Undecidability.TM.L.CaseCom]
yout:228 [binder, in Undecidability.TM.Single.StepTM]
yout:24 [binder, in Complexity.TM.Code.Decode]
yout:24 [binder, in Undecidability.TM.Code.CompareValue]
yout:249 [binder, in Undecidability.TM.Single.StepTM]
yout:25 [binder, in Complexity.TM.Code.DecodeList]
yout:250 [binder, in Undecidability.TM.Hoare.HoareLogic]
yout:257 [binder, in Undecidability.TM.Single.StepTM]
yout:26 [binder, in Undecidability.TM.Combinators.SequentialComposition]
yout:26 [binder, in Undecidability.TM.L.HeapInterpreter.LookupTM]
yout:266 [binder, in Undecidability.TM.Hoare.HoareExamples]
yout:27 [binder, in Undecidability.TM.L.CaseCom]
yout:27 [binder, in Undecidability.TM.Compound.Multi]
yout:27 [binder, in Undecidability.TM.Code.BinNumbers.PosShiftTM]
yout:271 [binder, in Undecidability.TM.Hoare.HoareLogic]
yout:272 [binder, in Undecidability.TM.Hoare.HoareRegister]
yout:28 [binder, in Undecidability.TM.Code.CaseNat]
yout:281 [binder, in Undecidability.TM.Single.StepTM]
yout:282 [binder, in Undecidability.TM.Hoare.HoareExamples]
yout:288 [binder, in Undecidability.TM.Hoare.HoareLogic]
yout:29 [binder, in Undecidability.TM.Code.List.Nth]
yout:290 [binder, in Undecidability.TM.Hoare.HoareCombinators]
yout:295 [binder, in Undecidability.TM.Hoare.HoareLogic]
yout:3 [binder, in Undecidability.TM.Code.BinNumbers.PosIncrementTM]
yout:3 [binder, in Undecidability.TM.Code.NatTM]
yout:30 [binder, in Undecidability.TM.L.Transcode.Boollist_to_Enc]
yout:30 [binder, in Undecidability.TM.Code.List.Rev]
yout:301 [binder, in Undecidability.TM.Hoare.HoareRegister]
yout:302 [binder, in Undecidability.TM.Single.StepTM]
yout:31 [binder, in Undecidability.TM.Hoare.HoareCombinators]
yout:312 [binder, in Undecidability.TM.Hoare.HoareLogic]
yout:319 [binder, in Undecidability.TM.Hoare.HoareCombinators]
yout:32 [binder, in Undecidability.TM.Code.CaseSum]
yout:333 [binder, in Undecidability.TM.Hoare.HoareLogic]
yout:335 [binder, in Undecidability.TM.Hoare.HoareCombinators]
yout:338 [binder, in Undecidability.TM.Hoare.HoareCombinators]
yout:344 [binder, in Undecidability.TM.Hoare.HoareCombinators]
yout:349 [binder, in Undecidability.TM.Hoare.HoareCombinators]
yout:354 [binder, in Undecidability.TM.Hoare.HoareCombinators]
yout:357 [binder, in Undecidability.TM.Hoare.HoareLogic]
yout:359 [binder, in Undecidability.TM.Hoare.HoareCombinators]
yout:37 [binder, in Undecidability.TM.Code.BinNumbers.PosShiftTM]
yout:374 [binder, in Undecidability.TM.Hoare.HoareCombinators]
yout:376 [binder, in Undecidability.TM.Hoare.HoareLogic]
yout:376 [binder, in Undecidability.TM.Hoare.HoareCombinators]
yout:38 [binder, in Undecidability.TM.Code.CaseList]
yout:38 [binder, in Undecidability.TM.Code.BinNumbers.NTM]
yout:384 [binder, in Undecidability.TM.Hoare.HoareLogic]
yout:395 [binder, in Undecidability.TM.Hoare.HoareCombinators]
yout:398 [binder, in Undecidability.TM.Hoare.HoareCombinators]
yout:4 [binder, in Undecidability.TM.Code.BinNumbers.PosCompareTM]
yout:4 [binder, in Undecidability.TM.Code.BinNumbers.PosShiftTM]
yout:403 [binder, in Undecidability.TM.Single.StepTM]
yout:403 [binder, in Undecidability.TM.Hoare.HoareLogic]
yout:408 [binder, in Undecidability.TM.Hoare.HoareRegister]
yout:41 [binder, in Undecidability.TM.Combinators.While]
yout:410 [binder, in Undecidability.TM.Hoare.HoareCombinators]
yout:418 [binder, in Undecidability.TM.Hoare.HoareCombinators]
yout:42 [binder, in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
yout:427 [binder, in Undecidability.TM.Hoare.HoareRegister]
yout:431 [binder, in Undecidability.TM.Single.StepTM]
yout:438 [binder, in Undecidability.TM.Hoare.HoareCombinators]
yout:44 [binder, in Undecidability.TM.L.HeapInterpreter.LookupTM]
yout:440 [binder, in Undecidability.TM.Hoare.HoareCombinators]
yout:45 [binder, in Undecidability.TM.Combinators.While]
yout:45 [binder, in Undecidability.TM.Code.BinNumbers.PosShiftTM]
yout:46 [binder, in Undecidability.TM.Univ.Univ]
yout:460 [binder, in Undecidability.TM.Hoare.HoareCombinators]
yout:462 [binder, in Undecidability.TM.Hoare.HoareCombinators]
yout:463 [binder, in Undecidability.TM.Single.StepTM]
yout:470 [binder, in Undecidability.TM.Hoare.HoareRegister]
yout:479 [binder, in Undecidability.TM.Single.StepTM]
yout:48 [binder, in Undecidability.TM.Code.BinNumbers.PosAddTM]
yout:483 [binder, in Undecidability.TM.Hoare.HoareRegister]
yout:484 [binder, in Undecidability.TM.Hoare.HoareRegister]
yout:49 [binder, in Undecidability.TM.Code.BinNumbers.PosCompareTM]
yout:49 [binder, in Undecidability.TM.Code.CompareValue]
yout:49 [binder, in Undecidability.TM.Compound.Compare]
yout:49 [binder, in Undecidability.TM.L.HeapInterpreter.StepTM]
yout:492 [binder, in Undecidability.TM.Hoare.HoareRegister]
yout:493 [binder, in Undecidability.TM.Hoare.HoareRegister]
yout:5 [binder, in Undecidability.TM.Code.CaseNat]
yout:5 [binder, in Undecidability.TM.Code.CaseBool]
yout:5 [binder, in Undecidability.TM.L.CaseCom]
yout:5 [binder, in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
yout:50 [binder, in Undecidability.TM.Code.BinNumbers.PosMultTM]
yout:502 [binder, in Undecidability.TM.Hoare.HoareRegister]
yout:503 [binder, in Undecidability.TM.Hoare.HoareRegister]
yout:504 [binder, in Undecidability.TM.Hoare.HoareRegister]
yout:509 [binder, in Undecidability.TM.Single.StepTM]
yout:51 [binder, in Undecidability.TM.Code.List.Rev]
yout:51 [binder, in Undecidability.TM.Univ.LookupAssociativeListTM]
yout:514 [binder, in Undecidability.TM.Hoare.HoareRegister]
yout:515 [binder, in Undecidability.TM.Hoare.HoareRegister]
yout:516 [binder, in Undecidability.TM.Hoare.HoareRegister]
yout:52 [binder, in Undecidability.TM.Code.CompareValue]
yout:524 [binder, in Undecidability.TM.Hoare.HoareRegister]
yout:525 [binder, in Undecidability.TM.Hoare.HoareRegister]
yout:53 [binder, in Undecidability.TM.Univ.Univ]
yout:534 [binder, in Undecidability.TM.Hoare.HoareRegister]
yout:535 [binder, in Undecidability.TM.Hoare.HoareRegister]
yout:54 [binder, in Undecidability.TM.Hoare.HoareCombinators]
yout:546 [binder, in Undecidability.TM.Hoare.HoareRegister]
yout:547 [binder, in Undecidability.TM.Hoare.HoareRegister]
yout:548 [binder, in Undecidability.TM.Hoare.HoareRegister]
yout:55 [binder, in Undecidability.TM.Code.List.Nth]
yout:56 [binder, in Undecidability.TM.Code.CompareValue]
yout:560 [binder, in Undecidability.TM.Hoare.HoareRegister]
yout:561 [binder, in Undecidability.TM.Hoare.HoareRegister]
yout:562 [binder, in Undecidability.TM.Hoare.HoareRegister]
yout:57 [binder, in Undecidability.TM.Code.BinNumbers.PosShiftTM]
yout:572 [binder, in Undecidability.TM.Hoare.HoareRegister]
yout:573 [binder, in Undecidability.TM.Hoare.HoareRegister]
yout:584 [binder, in Undecidability.TM.Hoare.HoareRegister]
yout:585 [binder, in Undecidability.TM.Hoare.HoareRegister]
yout:59 [binder, in Undecidability.TM.Code.NatTM]
yout:59 [binder, in Undecidability.TM.Code.CompareValue]
yout:6 [binder, in Undecidability.TM.Compound.Shift]
yout:62 [binder, in Undecidability.TM.Combinators.Switch]
yout:62 [binder, in Undecidability.TM.Code.BinNumbers.PosShiftTM]
yout:63 [binder, in Undecidability.TM.Code.CaseSum]
yout:65 [binder, in Undecidability.TM.Univ.LowLevel]
yout:66 [binder, in Undecidability.TM.L.HeapInterpreter.LookupTM]
yout:67 [binder, in Undecidability.TM.Code.BinNumbers.PosShiftTM]
yout:7 [binder, in Undecidability.TM.Code.CaseFin]
yout:7 [binder, in Undecidability.TM.Compound.CopySymbols]
yout:7 [binder, in Undecidability.TM.Hoare.HoareMult]
yout:71 [binder, in Undecidability.TM.Combinators.Switch]
yout:71 [binder, in Undecidability.TM.Code.BinNumbers.PosCompareTM]
yout:73 [binder, in Undecidability.TM.Code.CaseList]
yout:74 [binder, in Undecidability.TM.Combinators.While]
yout:75 [binder, in Undecidability.TM.Code.CaseSum]
yout:75 [binder, in Undecidability.TM.Hoare.HoareCombinators]
yout:77 [binder, in Undecidability.TM.Code.BinNumbers.PosCompareTM]
yout:77 [binder, in Undecidability.TM.Univ.LookupAssociativeListTM]
yout:78 [binder, in Undecidability.TM.Combinators.While]
yout:80 [binder, in Undecidability.TM.Hoare.HoareMult]
yout:83 [binder, in Undecidability.TM.Code.BinNumbers.PosShiftTM]
yout:89 [binder, in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
yout:9 [binder, in Undecidability.TM.Hoare.HoareLegacy]
yout:9 [binder, in Undecidability.TM.Compound.MoveToSymbol]
yout:9 [binder, in Undecidability.TM.Code.List.Rev]
yout:92 [binder, in Undecidability.TM.Hoare.HoareLogic]
yout:93 [binder, in Undecidability.TM.Code.BinNumbers.PosShiftTM]
yout:98 [binder, in Undecidability.TM.Hoare.HoareCombinators]
yout:98 [binder, in Undecidability.TM.Hoare.HoareExamples]
ys':55 [binder, in Complexity.TM.Code.Decode]
ys1:151 [binder, in Undecidability.TM.Code.Code]
ys1:9 [binder, in Undecidability.TM.Code.CompareValue]
ys2:10 [binder, in Undecidability.TM.Code.CompareValue]
ys2:152 [binder, in Undecidability.TM.Code.Code]
ys:10 [binder, in Undecidability.TM.Code.BinNumbers.EncodeBinNumbers]
ys:102 [binder, in Undecidability.TM.Compound.Compare]
ys:105 [binder, in Undecidability.TM.Compound.Compare]
ys:108 [binder, in Complexity.TM.PrettyBounds.UnivBounds]
ys:112 [binder, in Complexity.TM.PrettyBounds.UnivBounds]
ys:12 [binder, in Undecidability.TM.Code.List.Rev]
ys:142 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
ys:148 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
ys:15 [binder, in Undecidability.TM.Code.CompareValue]
ys:179 [binder, in Undecidability.TM.Code.Code]
ys:183 [binder, in Undecidability.TM.Code.Code]
ys:19 [binder, in Complexity.L.TM.TMflatComp]
ys:193 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
ys:196 [binder, in Undecidability.TM.Code.Code]
ys:203 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
ys:211 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
ys:219 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
ys:230 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
ys:24 [binder, in Undecidability.TM.Code.List.Rev]
ys:24 [binder, in Complexity.L.TM.TMflatComp]
ys:241 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
ys:251 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
ys:31 [binder, in Undecidability.TM.Util.VectorPrelim]
ys:33 [binder, in Undecidability.TM.Code.List.Rev]
ys:33 [binder, in Complexity.L.TM.TMflatFun]
ys:34 [binder, in Undecidability.TM.Code.List.App]
ys:44 [binder, in Undecidability.TM.Util.VectorPrelim]
ys:44 [binder, in Undecidability.TM.Code.List.Rev]
ys:44 [binder, in Undecidability.TM.Code.List.App]
ys:46 [binder, in Undecidability.TM.Code.List.Rev]
ys:47 [binder, in Undecidability.TM.Code.List.App]
ys:53 [binder, in Complexity.TM.Code.Decode]
ys:58 [binder, in Undecidability.TM.Util.VectorPrelim]
ys:58 [binder, in Complexity.NP.TM.M_multi2mono]
ys:60 [binder, in Complexity.TM.PrettyBounds.BaseCodeSpace]
ys:64 [binder, in Undecidability.TM.Code.List.App]
ys:7 [binder, in Undecidability.TM.Single.StepTM]
ys:8 [binder, in Complexity.L.TM.TMflatComp]
ys:89 [binder, in Undecidability.TM.Compound.Compare]
ys:9 [binder, in Undecidability.TM.Code.List.App]
yTime:19 [binder, in Undecidability.L.Tactics.ComputableTime]
yT:11 [binder, in Undecidability.L.Datatypes.LNat]
yT:137 [binder, in Undecidability.L.Tactics.ComputableTime]
yT:21 [binder, in Undecidability.L.Datatypes.LNat]
yT:5 [binder, in Undecidability.L.Datatypes.LNat]
yT:97 [binder, in Undecidability.L.Tactics.ComputableTime]
y_res:53 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
y_res:44 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
y'':21 [binder, in Undecidability.TM.Hoare.HoareCombinators]
y'':43 [binder, in Undecidability.TM.Hoare.HoareCombinators]
y'':65 [binder, in Undecidability.TM.Hoare.HoareCombinators]
y'':87 [binder, in Undecidability.TM.Hoare.HoareCombinators]
y':1002 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
y':101 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
y':109 [binder, in Complexity.L.TM.TMflatComp]
y':110 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
y':116 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
y':122 [binder, in Complexity.L.TM.TMunflatten]
y':122 [binder, in Undecidability.TM.Combinators.StateWhile]
y':143 [binder, in Undecidability.L.Prelim.ARS]
y':143 [binder, in Complexity.L.TM.TMunflatten]
y':145 [binder, in Complexity.L.TM.TMunflatten]
y':147 [binder, in Complexity.L.TM.TMunflatten]
y':153 [binder, in Complexity.L.TM.TMflatComp]
y':170 [binder, in Complexity.L.TM.TMflatComp]
y':179 [binder, in Complexity.L.TM.TMflatComp]
y':19 [binder, in Undecidability.TM.Hoare.HoareCombinators]
y':20 [binder, in Undecidability.L.Functions.EqBool]
y':25 [binder, in Undecidability.TM.Univ.LowLevel]
y':34 [binder, in Undecidability.L.Tactics.ComputableTactics]
Y':35 [binder, in Undecidability.TM.Univ.LowLevel]
Y':4 [binder, in Undecidability.TM.Univ.LowLevel]
y':41 [binder, in Undecidability.TM.Hoare.HoareCombinators]
Y':429 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
y':45 [binder, in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
y':45 [binder, in Undecidability.Shared.Libs.PSL.Lists.Position]
y':46 [binder, in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
y':48 [binder, in Complexity.Complexity.NP]
y':51 [binder, in Complexity.Complexity.NP]
y':54 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
y':56 [binder, in Undecidability.Shared.Libs.PSL.Lists.Position]
y':62 [binder, in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
y':63 [binder, in Undecidability.TM.Hoare.HoareCombinators]
y':67 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
y':69 [binder, in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
y':74 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
y':75 [binder, in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
y':84 [binder, in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
y':85 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
y':85 [binder, in Undecidability.TM.Hoare.HoareCombinators]
y':99 [binder, in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
y':997 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
y1:12 [binder, in Undecidability.L.Datatypes.LProd]
y1:15 [binder, in Undecidability.TM.Univ.LowLevel]
y1:19 [binder, in Undecidability.L.Datatypes.LProd]
y1:2 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
Y1:20 [binder, in Complexity.Complexity.PolyTimeComputable]
y1:21 [binder, in Complexity.TM.PrettyBounds.PrettyBounds]
y1:22 [binder, in Undecidability.L.Prelim.ARS]
Y1:33 [binder, in Complexity.Complexity.PolyTimeComputable]
y1:344 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
y1:40 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds_Loop]
y1:5 [binder, in Undecidability.TM.Code.CompareValue]
y1:5 [binder, in Undecidability.TM.Code.Copy]
y1:7 [binder, in Undecidability.L.Functions.Equality]
y1:93 [binder, in Undecidability.TM.Code.Code]
y2:14 [binder, in Undecidability.L.Datatypes.LProd]
y2:16 [binder, in Undecidability.TM.Univ.LowLevel]
y2:20 [binder, in Undecidability.L.Datatypes.LProd]
Y2:21 [binder, in Complexity.Complexity.PolyTimeComputable]
y2:22 [binder, in Complexity.TM.PrettyBounds.PrettyBounds]
y2:23 [binder, in Undecidability.L.Prelim.ARS]
y2:3 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
Y2:34 [binder, in Complexity.Complexity.PolyTimeComputable]
y2:346 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
y2:41 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds_Loop]
y2:6 [binder, in Undecidability.TM.Code.CompareValue]
y2:6 [binder, in Undecidability.TM.Code.Copy]
y2:94 [binder, in Undecidability.TM.Code.Code]
y3:4 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
y4:5 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
y:1 [binder, in Undecidability.TM.Hoare.HoareTactics]
y:1 [binder, in Undecidability.Shared.embed_nat]
y:1 [binder, in Undecidability.L.Tactics.ComputableTactics]
y:10 [binder, in Undecidability.Shared.Libs.PSL.Numbers]
y:10 [binder, in Undecidability.TM.Code.BinNumbers.PosMultTM]
y:10 [binder, in Undecidability.L.Datatypes.LOptions]
y:10 [binder, in Undecidability.TM.Hoare.HoareTactics]
y:10 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
y:10 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
Y:10 [binder, in Complexity.Complexity.LinTimeDecodable]
y:10 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
y:10 [binder, in Complexity.L.TM.TMflatComp]
y:10 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
y:10 [binder, in Undecidability.TM.Code.NatSub]
y:10 [binder, in Undecidability.L.Functions.Ackermann]
y:10 [binder, in Undecidability.L.Datatypes.List.List_eqb]
y:10 [binder, in Undecidability.L.Functions.UnboundIteration]
y:10 [binder, in Undecidability.TM.Util.Relations]
y:10 [binder, in Complexity.L.Functions.BinNumsCompare]
y:10 [binder, in Undecidability.L.Datatypes.LNat]
y:10 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
y:10 [binder, in Undecidability.TM.L.Transcode.Enc_to_Boollist]
y:10 [binder, in Undecidability.TM.Code.List.App]
y:10 [binder, in Undecidability.TM.Hoare.HoareStdLib]
y:100 [binder, in Undecidability.TM.Code.CaseList]
y:100 [binder, in Complexity.Libs.CookPrelim.PolyBounds]
y:1004 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
y:101 [binder, in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
y:101 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
y:101 [binder, in Undecidability.L.Complexity.UpToC]
Y:101 [binder, in Undecidability.TM.Util.Relations]
y:101 [binder, in Undecidability.TM.Hoare.HoareExamples]
y:1013 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
y:1016 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
Y:102 [binder, in Complexity.L.TM.TMflatComp]
y:102 [binder, in Undecidability.TM.Code.CodeTM]
y:102 [binder, in Complexity.Libs.CookPrelim.PolyBounds]
y:102 [binder, in Undecidability.Shared.Libs.DLW.Utils.php]
y:102 [binder, in Undecidability.L.Computability.Synthetic]
Y:103 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
y:103 [binder, in Undecidability.L.Complexity.UpToCNary]
y:103 [binder, in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
y:103 [binder, in Complexity.L.TM.CompCode]
y:103 [binder, in Undecidability.L.Complexity.UpToC]
Y:103 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
y:103 [binder, in Complexity.TM.PrettyBounds.PrettyBounds]
Y:104 [binder, in Undecidability.TM.Util.Prelim]
y:104 [binder, in Undecidability.L.Complexity.UpToC]
Y:104 [binder, in Undecidability.Shared.Libs.DLW.Utils.php]
y:104 [binder, in Undecidability.L.Computability.Synthetic]
y:104 [binder, in Undecidability.TM.L.HeapInterpreter.LookupTM]
Y:105 [binder, in Complexity.TM.PrettyBounds.BaseCode]
y:105 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
y:105 [binder, in Undecidability.TM.Code.CodeTM]
y:105 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
y:105 [binder, in Undecidability.TM.Hoare.HoareMult]
Y:105 [binder, in Complexity.NP.TM.LM_to_mTM]
Y:106 [binder, in Undecidability.TM.Single.StepTM]
Y:106 [binder, in Complexity.TM.PrettyBounds.UnivBounds]
y:106 [binder, in Undecidability.TM.Hoare.HoareExamples]
y:106 [binder, in Complexity.TM.PrettyBounds.PrettyBounds]
y:107 [binder, in Undecidability.L.Complexity.UpToCNary]
Y:108 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
y:108 [binder, in Complexity.L.TM.TMflatComp]
Y:108 [binder, in Undecidability.TM.Util.Relations]
y:108 [binder, in Undecidability.TM.Univ.LookupAssociativeListTM]
Y:109 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
y:109 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
y:109 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
y:109 [binder, in Undecidability.TM.Hoare.HoareExamples]
Y:11 [binder, in Undecidability.L.Datatypes.List.List_basics]
y:11 [binder, in Undecidability.TM.Hoare.HoareTactics]
y:11 [binder, in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
y:11 [binder, in Undecidability.Shared.Libs.DLW.Utils.quotient]
y:11 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_upto]
y:11 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
y:11 [binder, in Undecidability.Synthetic.MoreEnumerabilityFacts]
Y:11 [binder, in Undecidability.Synthetic.InformativeDefinitions]
Y:11 [binder, in Undecidability.Shared.Libs.PSL.Lists.Dupfree]
y:11 [binder, in Undecidability.Shared.Libs.DLW.Wf.wf_finite]
Y:11 [binder, in Complexity.Complexity.PolyTimeComputable]
Y:110 [binder, in Complexity.TM.PrettyBounds.UnivBounds]
y:110 [binder, in Undecidability.Shared.Libs.DLW.Utils.php]
Y:110 [binder, in Complexity.NP.TM.LM_to_mTM]
y:111 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
y:111 [binder, in Undecidability.TM.Hoare.HoareMult]
y:112 [binder, in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
Y:112 [binder, in Undecidability.Shared.Libs.DLW.Utils.php]
Y:112 [binder, in Undecidability.L.Tactics.Computable]
y:112 [binder, in Undecidability.TM.Hoare.HoareExamples]
y:113 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
Y:113 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
Y:113 [binder, in Complexity.L.TM.TMflatComp]
y:113 [binder, in Undecidability.TM.Univ.LookupAssociativeListTM]
y:113 [binder, in Undecidability.TM.Hoare.HoareExamples]
Y:114 [binder, in Complexity.TM.PrettyBounds.UnivBounds]
y:114 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
Y:114 [binder, in Complexity.Libs.CookPrelim.PolyBounds]
Y:114 [binder, in Complexity.L.TM.TMunflatten]
y:114 [binder, in Undecidability.TM.Util.Relations]
Y:114 [binder, in Complexity.Complexity.NP]
y:115 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
Y:115 [binder, in Undecidability.Synthetic.ListEnumerabilityFacts]
y:115 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
y:115 [binder, in Undecidability.TM.Hoare.HoareExamples]
y:115 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
Y:117 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
Y:117 [binder, in Undecidability.Shared.Libs.DLW.Utils.php]
y:117 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
y:117 [binder, in Undecidability.TM.Hoare.HoareExamples]
y:118 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
y:118 [binder, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
y:118 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
y:118 [binder, in Undecidability.L.Tactics.LClos]
y:118 [binder, in Undecidability.Synthetic.ListEnumerabilityFacts]
Y:118 [binder, in Undecidability.L.Tactics.Computable]
y:119 [binder, in Undecidability.TM.Hoare.HoareExamples]
y:12 [binder, in Undecidability.Shared.Libs.PSL.Numbers]
y:12 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_quotient]
y:12 [binder, in Undecidability.Synthetic.InformativeReducibilityFacts]
y:12 [binder, in Undecidability.TM.Hoare.HoareTactics]
y:12 [binder, in Undecidability.L.Prelim.LoopSum]
y:12 [binder, in Undecidability.TM.Code.BinNumbers.EncodeBinNumbers]
Y:12 [binder, in Complexity.L.ComparisonTimeBoundDerivation]
Y:12 [binder, in Undecidability.L.Datatypes.LVector]
y:12 [binder, in Undecidability.TM.Code.CompareValue]
y:12 [binder, in Undecidability.TM.Code.NatSub]
Y:12 [binder, in Undecidability.TM.Util.Relations]
y:12 [binder, in Complexity.L.Functions.BinNumsCompare]
Y:12 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
y:12 [binder, in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
Y:12 [binder, in Undecidability.Synthetic.Infinite]
y:12 [binder, in Undecidability.TM.Basic.Duo]
y:12 [binder, in Undecidability.L.Computability.Computability]
y:12 [binder, in Undecidability.Synthetic.ReducibilityFacts]
y:12 [binder, in Complexity.L.Functions.BinNumsAdd]
y:120 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
y:120 [binder, in Complexity.L.TM.TMunflatten]
y:120 [binder, in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
y:121 [binder, in Undecidability.L.Tactics.LClos]
y:121 [binder, in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
y:121 [binder, in Undecidability.TM.Combinators.StateWhile]
y:121 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
Y:122 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
Y:122 [binder, in Undecidability.Synthetic.ListEnumerabilityFacts]
y:122 [binder, in Undecidability.TM.Hoare.HoareExamples]
y:123 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
y:123 [binder, in Undecidability.L.Tactics.LClos]
y:123 [binder, in Complexity.L.TM.TMflatComp]
y:123 [binder, in Undecidability.Shared.Libs.DLW.Utils.php]
y:123 [binder, in Undecidability.TM.Code.Code]
y:124 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
y:124 [binder, in Undecidability.Synthetic.ListEnumerabilityFacts]
y:125 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
Y:125 [binder, in Undecidability.Shared.Libs.DLW.Utils.php]
Y:125 [binder, in Undecidability.TM.Univ.LookupAssociativeListTM]
y:126 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
y:126 [binder, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
y:126 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
Y:126 [binder, in Complexity.L.TM.TMflatComp]
Y:126 [binder, in Complexity.L.TM.TMunflatten]
y:128 [binder, in Undecidability.TM.Code.Code]
y:129 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
y:129 [binder, in Undecidability.Shared.Libs.DLW.Utils.php]
y:129 [binder, in Undecidability.TM.Hoare.HoareRegister]
y:13 [binder, in Undecidability.TM.Code.BinNumbers.PosMultTM]
y:13 [binder, in Undecidability.TM.Hoare.HoareTactics]
Y:13 [binder, in Complexity.TM.PrettyBounds.UnivBounds]
Y:13 [binder, in Undecidability.TM.Util.VectorPrelim]
Y:13 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
y:13 [binder, in Undecidability.L.Tactics.ComputableDemo]
y:13 [binder, in Undecidability.L.Functions.EqBool]
y:13 [binder, in Undecidability.Shared.Libs.PSL.Bijection]
y:13 [binder, in Undecidability.L.Datatypes.LNat]
y:13 [binder, in Undecidability.L.Computability.Computability]
y:130 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
y:130 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
Y:131 [binder, in Undecidability.Shared.Libs.DLW.Utils.php]
y:132 [binder, in Complexity.L.TM.CompCode]
y:132 [binder, in Undecidability.TM.Util.Relations]
y:132 [binder, in Undecidability.TM.Hoare.HoareMult]
y:132 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
y:133 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
y:134 [binder, in Undecidability.TM.Hoare.HoareRegister]
Y:134 [binder, in Complexity.Complexity.NP]
y:135 [binder, in Undecidability.L.Tactics.ComputableTime]
Y:135 [binder, in Complexity.L.TM.TMunflatten]
y:136 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
Y:136 [binder, in Undecidability.L.Tactics.Computable]
y:137 [binder, in Complexity.L.TM.TMflatComp]
y:137 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
y:137 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
y:138 [binder, in Undecidability.TM.Util.Relations]
y:138 [binder, in Undecidability.TM.Hoare.HoareMult]
Y:139 [binder, in Complexity.L.TM.TMflatComp]
Y:139 [binder, in Complexity.Complexity.NP]
y:139 [binder, in Undecidability.TM.Hoare.HoareExamples]
y:14 [binder, in Undecidability.Shared.Libs.PSL.Numbers]
y:14 [binder, in Undecidability.TM.Combinators.Combinators]
y:14 [binder, in Undecidability.L.Prelim.ARS]
y:14 [binder, in Undecidability.Synthetic.InformativeReducibilityFacts]
y:14 [binder, in Undecidability.TM.Hoare.HoareTactics]
y:14 [binder, in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
Y:14 [binder, in Undecidability.Shared.Libs.DLW.Utils.quotient]
y:14 [binder, in Complexity.L.Functions.BinNumsCompare]
Y:14 [binder, in Undecidability.L.Datatypes.List.List_fold]
y:14 [binder, in Complexity.Complexity.NP]
y:14 [binder, in Complexity.TM.PrettyBounds.PrettyBounds]
y:14 [binder, in Complexity.L.Functions.BinNumsAdd]
y:140 [binder, in Undecidability.L.Prelim.ARS]
y:141 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
y:141 [binder, in Complexity.L.TM.TMunflatten]
y:142 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
y:142 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
y:143 [binder, in Undecidability.TM.Util.Relations]
y:143 [binder, in Undecidability.TM.Hoare.HoareExamples]
y:144 [binder, in Undecidability.Shared.Libs.DLW.Utils.php]
y:146 [binder, in Undecidability.L.Prelim.ARS]
y:146 [binder, in Undecidability.TM.Util.Relations]
Y:146 [binder, in Undecidability.TM.Univ.LookupAssociativeListTM]
y:147 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
y:148 [binder, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
y:148 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
y:149 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
y:149 [binder, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
Y:149 [binder, in Complexity.L.TM.TMunflatten]
Y:149 [binder, in Undecidability.L.Tactics.Computable]
y:149 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
y:15 [binder, in Undecidability.L.Util.L_facts]
y:15 [binder, in Undecidability.TM.Code.BinNumbers.PosMultTM]
y:15 [binder, in Undecidability.TM.Hoare.HoareTactics]
y:15 [binder, in Undecidability.Shared.Libs.DLW.Utils.sorting]
Y:15 [binder, in Undecidability.L.Functions.EqBool]
y:15 [binder, in Undecidability.TM.Code.NatSub]
y:15 [binder, in Undecidability.Shared.Libs.PSL.Lists.Dupfree]
y:15 [binder, in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
Y:15 [binder, in Undecidability.TM.Univ.LookupAssociativeListTM]
y:15 [binder, in Undecidability.L.Computability.Computability]
y:150 [binder, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
y:150 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
y:150 [binder, in Undecidability.TM.Hoare.HoareExamples]
y:151 [binder, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
y:151 [binder, in Undecidability.Shared.Libs.DLW.Utils.php]
y:152 [binder, in Undecidability.L.Prelim.ARS]
Y:152 [binder, in Undecidability.L.Tactics.ComputableTime]
y:152 [binder, in Complexity.L.TM.TMflatComp]
Y:154 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
y:154 [binder, in Undecidability.TM.Hoare.HoareExamples]
Y:155 [binder, in Complexity.L.TM.TMflatComp]
y:155 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
y:157 [binder, in Undecidability.L.Prelim.ARS]
y:158 [binder, in Undecidability.TM.Hoare.HoareRegister]
y:16 [binder, in Complexity.Libs.Pigeonhole]
y:16 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_quotient]
y:16 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
y:16 [binder, in Undecidability.TM.Hoare.HoareTactics]
y:16 [binder, in Undecidability.Shared.Libs.PSL.Retracts]
Y:16 [binder, in Undecidability.L.Functions.LoopSum]
Y:16 [binder, in Undecidability.L.Prelim.LoopSum]
y:16 [binder, in Undecidability.TM.Code.BinNumbers.EncodeBinNumbers]
y:16 [binder, in Complexity.L.TM.CompCode]
y:16 [binder, in Undecidability.Synthetic.MoreEnumerabilityFacts]
y:16 [binder, in Undecidability.TM.Util.Relations]
y:16 [binder, in Undecidability.Shared.Libs.DLW.Wf.wf_finite]
y:16 [binder, in Undecidability.L.TM.TMEncoding]
y:16 [binder, in Complexity.L.Functions.BinNumsCompare]
y:16 [binder, in Undecidability.TM.Code.BinNumbers.PosAddTM]
y:16 [binder, in Complexity.L.Functions.BinNumsAdd]
y:16 [binder, in Undecidability.TM.Code.BinNumbers.PosShiftTM]
y:160 [binder, in Undecidability.L.Prelim.ARS]
y:160 [binder, in Undecidability.TM.Hoare.HoareRegister]
y:161 [binder, in Undecidability.Shared.Libs.DLW.Utils.php]
y:161 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
y:162 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
Y:163 [binder, in Undecidability.L.Tactics.ComputableTime]
y:164 [binder, in Undecidability.Shared.Libs.DLW.Utils.php]
y:165 [binder, in Complexity.L.TM.TMflatComp]
y:167 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
y:167 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
y:168 [binder, in Complexity.L.TM.TMflatComp]
y:169 [binder, in Undecidability.TM.Code.Copy]
y:17 [binder, in Undecidability.TM.Combinators.Combinators]
y:17 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_dec]
y:17 [binder, in Undecidability.TM.Hoare.HoareTactics]
y:17 [binder, in Undecidability.L.Tactics.ComputableTime]
y:17 [binder, in Undecidability.L.Datatypes.LSum]
y:17 [binder, in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
y:17 [binder, in Undecidability.Shared.Libs.DLW.Utils.quotient]
y:17 [binder, in Undecidability.L.Tactics.ComputableDemo]
y:17 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
y:17 [binder, in Undecidability.Shared.Libs.DLW.Utils.sorting]
y:17 [binder, in Undecidability.Shared.Libs.PSL.Bijection]
Y:17 [binder, in Undecidability.Shared.Dec]
y:17 [binder, in Undecidability.L.Datatypes.LNat]
y:17 [binder, in Undecidability.TM.Basic.Duo]
y:17 [binder, in Complexity.Complexity.NP]
y:17 [binder, in Undecidability.L.Computability.Computability]
Y:17 [binder, in Undecidability.Synthetic.ReducibilityFacts]
Y:170 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
y:172 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
y:173 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
Y:174 [binder, in Undecidability.L.Tactics.ComputableTime]
y:174 [binder, in Complexity.L.TM.TMflatComp]
y:174 [binder, in Undecidability.TM.Code.Copy]
y:174 [binder, in Undecidability.TM.Hoare.HoareExamples]
y:175 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
y:176 [binder, in Undecidability.TM.Hoare.HoareLogic]
y:176 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
y:177 [binder, in Undecidability.L.Tactics.ComputableTime]
y:177 [binder, in Complexity.L.TM.TMflatComp]
y:178 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
y:178 [binder, in Undecidability.TM.Hoare.HoareExamples]
y:18 [binder, in Undecidability.L.Datatypes.LProd]
y:18 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_quotient]
y:18 [binder, in Undecidability.TM.Hoare.HoareTactics]
y:18 [binder, in Undecidability.Shared.Libs.PSL.Retracts]
y:18 [binder, in Complexity.TM.PrettyBounds.UnivBounds]
Y:18 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
y:18 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
y:18 [binder, in Undecidability.L.Functions.UnboundIteration]
Y:18 [binder, in Undecidability.TM.Util.Relations]
y:18 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
y:18 [binder, in Complexity.L.Functions.BinNumsCompare]
Y:18 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
y:18 [binder, in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
y:18 [binder, in Undecidability.TM.Code.BinNumbers.PosAddTM]
y:18 [binder, in Complexity.TM.PrettyBounds.PrettyBounds]
y:18 [binder, in Undecidability.TM.Code.BinNumbers.PosShiftTM]
y:181 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
y:181 [binder, in Undecidability.TM.Hoare.HoareRegister]
y:182 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
y:182 [binder, in Undecidability.TM.Code.Copy]
y:183 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
y:183 [binder, in Complexity.L.TM.TMflatComp]
y:183 [binder, in Undecidability.TM.Hoare.HoareRegister]
y:183 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
Y:185 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
Y:186 [binder, in Complexity.L.TM.TMflatComp]
y:186 [binder, in Undecidability.TM.Code.Copy]
Y:188 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
y:189 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
Y:189 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
Y:19 [binder, in Undecidability.L.Prelim.ARS]
y:19 [binder, in Complexity.L.Datatypes.LBinNums]
y:19 [binder, in Undecidability.TM.Hoare.HoareTactics]
y:19 [binder, in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
y:19 [binder, in Undecidability.L.Functions.EqBool]
Y:19 [binder, in Undecidability.Shared.Dec]
y:19 [binder, in Undecidability.L.Computability.Computability]
Y:190 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
y:191 [binder, in Undecidability.TM.Hoare.HoareExamples]
y:192 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
y:193 [binder, in Undecidability.L.Prelim.ARS]
Y:193 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
y:194 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
Y:194 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
y:195 [binder, in Undecidability.TM.Hoare.HoareExamples]
Y:195 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
y:197 [binder, in Undecidability.L.Prelim.ARS]
y:197 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
Y:198 [binder, in Complexity.L.TM.TMflatComp]
Y:2 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
Y:2 [binder, in Undecidability.Shared.Libs.PSL.Prelim]
y:2 [binder, in Undecidability.TM.Hoare.HoareTactics]
Y:2 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
Y:2 [binder, in Undecidability.L.Prelim.LoopSum]
Y:2 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
Y:2 [binder, in Complexity.Complexity.LinTimeDecodable]
Y:2 [binder, in Undecidability.TM.Code.CompareValue]
Y:2 [binder, in Undecidability.TM.Util.Relations]
Y:2 [binder, in Complexity.L.TM.TMflatten]
Y:2 [binder, in Undecidability.TM.Code.Copy]
y:2 [binder, in Undecidability.Synthetic.DecidabilityFacts]
y:2 [binder, in Undecidability.L.Tactics.ComputableTactics]
y:2 [binder, in Complexity.L.Functions.BinNumsCompare]
Y:2 [binder, in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
Y:2 [binder, in Complexity.Complexity.PolyTimeComputable]
y:2 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
y:2 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
y:2 [binder, in Complexity.L.AbstractMachines.Computable.LargestVar]
y:20 [binder, in Undecidability.TM.Hoare.HoareTactics]
Y:20 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
y:20 [binder, in Undecidability.Shared.Libs.DLW.Wf.acc_irr]
y:20 [binder, in Undecidability.Shared.Libs.DLW.Utils.php]
y:20 [binder, in Undecidability.Shared.Libs.DLW.Wf.wf_finite]
y:20 [binder, in Undecidability.TM.L.Eval]
y:20 [binder, in Undecidability.L.Datatypes.LNat]
Y:200 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
y:200 [binder, in Undecidability.TM.Hoare.HoareLogic]
y:201 [binder, in Undecidability.L.Prelim.ARS]
y:202 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
y:202 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
Y:203 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
y:21 [binder, in Undecidability.TM.Hoare.HoareTactics]
y:21 [binder, in Undecidability.L.Datatypes.LSum]
y:21 [binder, in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
y:21 [binder, in Undecidability.L.Prelim.LoopSum]
y:21 [binder, in Undecidability.L.Tactics.ComputableDemo]
Y:21 [binder, in Complexity.L.TM.TMflatComp]
y:21 [binder, in Complexity.Libs.UniformHomomorphisms]
Y:21 [binder, in Undecidability.TM.Univ.LowLevel]
Y:21 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_base]
y:21 [binder, in Undecidability.TM.L.Eval]
y:21 [binder, in Undecidability.Shared.Libs.PSL.Vectors.VectorDupfree]
y:21 [binder, in Undecidability.TM.Lifting.LiftTapes]
y:21 [binder, in Undecidability.TM.Code.BinNumbers.PosAddTM]
y:21 [binder, in Complexity.L.Functions.BinNumsAdd]
y:210 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
y:211 [binder, in Undecidability.TM.Hoare.HoareLogic]
y:217 [binder, in Undecidability.TM.Hoare.HoareExamples]
y:219 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
y:22 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_quotient]
y:22 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
y:22 [binder, in Undecidability.Shared.Libs.PSL.Lists.Removal]
y:22 [binder, in Undecidability.TM.Code.CaseNat]
y:22 [binder, in Undecidability.TM.Hoare.HoareTactics]
y:22 [binder, in Undecidability.Shared.Libs.PSL.Retracts]
Y:22 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
Y:22 [binder, in Complexity.Complexity.Subtypes]
y:22 [binder, in Complexity.L.Functions.BinNumsSub]
y:22 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
Y:22 [binder, in Undecidability.L.Functions.EqBool]
y:22 [binder, in Undecidability.TM.Util.Relations]
y:22 [binder, in Undecidability.TM.L.Eval]
y:22 [binder, in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
y:222 [binder, in Undecidability.TM.Hoare.HoareExamples]
y:223 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
y:223 [binder, in Undecidability.TM.Hoare.HoareLogic]
y:224 [binder, in Undecidability.TM.Hoare.HoareCombinators]
y:226 [binder, in Undecidability.TM.Hoare.HoareCombinators]
Y:227 [binder, in Undecidability.L.Prelim.ARS]
Y:227 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
y:227 [binder, in Undecidability.TM.Hoare.HoareCombinators]
y:228 [binder, in Undecidability.TM.Hoare.HoareCombinators]
y:23 [binder, in Undecidability.L.Util.L_facts]
Y:23 [binder, in Undecidability.L.Complexity.UpToCNary]
y:23 [binder, in Undecidability.TM.Hoare.HoareTactics]
y:23 [binder, in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
y:23 [binder, in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
Y:23 [binder, in Undecidability.L.Datatypes.LVector]
y:23 [binder, in Undecidability.TM.Code.NatSub]
y:23 [binder, in Undecidability.L.Datatypes.List.List_eqb]
y:23 [binder, in Undecidability.Shared.Libs.DLW.Wf.wf_finite]
y:23 [binder, in Undecidability.TM.L.Eval]
Y:23 [binder, in Undecidability.Shared.Libs.PSL.Vectors.VectorDupfree]
Y:23 [binder, in Undecidability.Shared.Dec]
y:23 [binder, in Undecidability.Shared.Libs.DLW.Utils.seteq]
y:23 [binder, in Undecidability.L.Computability.Computability]
Y:23 [binder, in Undecidability.Synthetic.ReducibilityFacts]
y:23 [binder, in Undecidability.TM.Code.BinNumbers.PosAddTM]
Y:23 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.CompoundFinTypes]
y:23 [binder, in Complexity.L.Functions.BinNumsAdd]
y:232 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
y:235 [binder, in Undecidability.L.Prelim.ARS]
y:239 [binder, in Undecidability.TM.Hoare.HoareExamples]
y:24 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_dec]
y:24 [binder, in Undecidability.Shared.Libs.PSL.Lists.Removal]
y:24 [binder, in Undecidability.TM.Code.BinNumbers.PosMultTM]
Y:24 [binder, in Undecidability.L.Datatypes.List.List_basics]
y:24 [binder, in Undecidability.TM.Hoare.HoareTactics]
Y:24 [binder, in Complexity.TM.PrettyBounds.UnivBounds]
y:24 [binder, in Undecidability.L.Prelim.LoopSum]
y:24 [binder, in Undecidability.Shared.Libs.DLW.Utils.quotient]
y:24 [binder, in Undecidability.L.Datatypes.List.List_nat]
y:24 [binder, in Undecidability.TM.Univ.LowLevel]
y:24 [binder, in Complexity.L.Functions.BinNumsSub]
Y:24 [binder, in Undecidability.TM.Util.Relations]
y:24 [binder, in Undecidability.TM.L.Eval]
Y:24 [binder, in Undecidability.TM.Univ.LookupAssociativeListTM]
y:241 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
y:241 [binder, in Undecidability.TM.Hoare.HoareRegister]
y:244 [binder, in Undecidability.TM.Hoare.HoareRegister]
y:244 [binder, in Undecidability.TM.Hoare.HoareExamples]
Y:247 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
Y:25 [binder, in Undecidability.L.Prelim.ARS]
y:25 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_quotient]
y:25 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
y:25 [binder, in Undecidability.TM.Hoare.HoareTactics]
y:25 [binder, in Complexity.Libs.UniformHomomorphisms]
y:25 [binder, in Undecidability.TM.Code.CaseSum]
y:25 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_base]
Y:25 [binder, in Undecidability.Shared.Dec]
y:25 [binder, in Undecidability.TM.Hoare.HoareMult]
y:25 [binder, in Undecidability.TM.Code.BinNumbers.PosAddTM]
y:253 [binder, in Complexity.L.TM.TMflatComp]
y:255 [binder, in Complexity.L.TM.TMflatComp]
y:257 [binder, in Undecidability.TM.Hoare.HoareRegister]
Y:258 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
y:258 [binder, in Undecidability.TM.Hoare.HoareRegister]
y:26 [binder, in Undecidability.Shared.Libs.PSL.Numbers]
y:26 [binder, in Undecidability.TM.Code.CaseNat]
y:26 [binder, in Undecidability.TM.Hoare.HoareTactics]
Y:26 [binder, in Undecidability.Shared.Libs.PSL.EqDec]
Y:26 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
Y:26 [binder, in Undecidability.TM.Util.VectorPrelim]
Y:26 [binder, in Undecidability.L.Prelim.LoopSum]
y:26 [binder, in Complexity.Complexity.Subtypes]
y:26 [binder, in Complexity.NP.SAT.SAT_inNP]
y:26 [binder, in Undecidability.TM.L.Eval]
y:26 [binder, in Undecidability.Synthetic.ReducibilityFacts]
Y:26 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.CompoundFinTypes]
y:263 [binder, in Undecidability.TM.Hoare.HoareCombinators]
Y:264 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
y:265 [binder, in Complexity.L.TM.TMflatComp]
y:267 [binder, in Complexity.L.TM.TMflatComp]
y:27 [binder, in Undecidability.Shared.Libs.PSL.Lists.Removal]
y:27 [binder, in Undecidability.TM.Code.BinNumbers.PosMultTM]
y:27 [binder, in Undecidability.Shared.Libs.DLW.Utils.prime]
y:27 [binder, in Undecidability.TM.Hoare.HoareTactics]
Y:27 [binder, in Undecidability.TM.Univ.LowLevel]
y:27 [binder, in Undecidability.TM.Code.NatSub]
Y:27 [binder, in Undecidability.Shared.Dec]
y:27 [binder, in Undecidability.L.Datatypes.LNat]
y:27 [binder, in Complexity.L.Functions.BinNumsAdd]
y:271 [binder, in Undecidability.TM.Hoare.HoareRegister]
y:273 [binder, in Undecidability.TM.Hoare.HoareRegister]
y:274 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
y:276 [binder, in Undecidability.TM.Hoare.HoareCombinators]
y:28 [binder, in Undecidability.L.Prelim.ARS]
y:28 [binder, in Undecidability.TM.Hoare.HoareTactics]
Y:28 [binder, in Undecidability.Shared.Libs.PSL.EqDec]
y:28 [binder, in Complexity.L.Functions.BinNumsSub]
Y:28 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_base]
y:28 [binder, in Undecidability.TM.Util.Relations]
y:28 [binder, in Undecidability.Shared.Libs.PSL.Vectors.VectorDupfree]
Y:28 [binder, in Undecidability.L.Datatypes.List.List_fold]
y:28 [binder, in Complexity.TM.PrettyBounds.PrettyBounds]
y:281 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
y:285 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
y:285 [binder, in Undecidability.TM.Hoare.HoareRegister]
y:286 [binder, in Undecidability.TM.Hoare.HoareRegister]
y:287 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
y:29 [binder, in Undecidability.Shared.Libs.PSL.Numbers]
y:29 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_quotient]
y:29 [binder, in Undecidability.TM.Hoare.HoareTactics]
y:29 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
y:29 [binder, in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
y:29 [binder, in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
y:29 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
Y:29 [binder, in Complexity.L.TM.TMflatFun]
y:29 [binder, in Undecidability.TM.Univ.LookupAssociativeListTM]
y:29 [binder, in Undecidability.L.Datatypes.LNat]
y:290 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
Y:2915 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
y:292 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
y:292 [binder, in Undecidability.TM.Hoare.HoareCombinators]
Y:2927 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
y:294 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
Y:295 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
Y:2952 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
y:299 [binder, in Undecidability.TM.Hoare.HoareExamples]
y:3 [binder, in Undecidability.TM.Code.BinNumbers.PosMultTM]
y:3 [binder, in Undecidability.TM.Hoare.HoareTactics]
y:3 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
Y:3 [binder, in Undecidability.TM.Univ.LowLevel]
y:3 [binder, in Complexity.L.Functions.BinNumsSub]
y:3 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
y:3 [binder, in Undecidability.TM.Code.BinNumbers.PosAddTM]
y:3 [binder, in Complexity.TM.PrettyBounds.PrettyBounds]
y:30 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_quotient]
y:30 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_dec]
y:30 [binder, in Undecidability.TM.Hoare.HoareTactics]
y:30 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
y:30 [binder, in Undecidability.L.Prelim.LoopSum]
Y:30 [binder, in Complexity.Complexity.Subtypes]
y:30 [binder, in Undecidability.TM.Code.BinNumbers.NTM]
y:30 [binder, in Undecidability.TM.Univ.LowLevel]
y:30 [binder, in Complexity.L.Functions.BinNumsSub]
y:30 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_base]
y:30 [binder, in Undecidability.TM.Code.NatSub]
Y:30 [binder, in Undecidability.Synthetic.Definitions]
Y:30 [binder, in Undecidability.TM.Util.Relations]
y:30 [binder, in Undecidability.TM.L.Eval]
Y:30 [binder, in Undecidability.Shared.Dec]
y:30 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
y:30 [binder, in Undecidability.TM.Hoare.HoareMult]
y:30 [binder, in Undecidability.TM.PrettyBounds.MaxList]
y:30 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
y:300 [binder, in Undecidability.TM.Hoare.HoareRegister]
y:302 [binder, in Undecidability.TM.Hoare.HoareRegister]
y:304 [binder, in Undecidability.TM.Hoare.HoareExamples]
Y:3040 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
y:305 [binder, in Undecidability.TM.Hoare.HoareCombinators]
Y:3055 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
y:306 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
y:306 [binder, in Undecidability.TM.Hoare.HoareCombinators]
Y:3061 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
y:307 [binder, in Undecidability.TM.Hoare.HoareCombinators]
Y:3070 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
y:308 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
y:308 [binder, in Undecidability.TM.Hoare.HoareCombinators]
y:309 [binder, in Undecidability.TM.Hoare.HoareCombinators]
y:31 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_quotient]
y:31 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
y:31 [binder, in Undecidability.TM.Hoare.HoareTactics]
Y:31 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
Y:31 [binder, in Undecidability.L.Functions.Decoding]
y:31 [binder, in Undecidability.L.Datatypes.LNat]
y:31 [binder, in Complexity.Complexity.PolyTimeComputable]
y:31 [binder, in Complexity.Complexity.NP]
Y:3103 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Y:3109 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Y:3122 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
y:313 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
Y:3160 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Y:3169 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Y:3177 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Y:3187 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
y:32 [binder, in Undecidability.Shared.Libs.PSL.Numbers]
y:32 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
y:32 [binder, in Undecidability.TM.Code.BinNumbers.PosMultTM]
y:32 [binder, in Undecidability.TM.Hoare.HoareTactics]
y:32 [binder, in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
y:32 [binder, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
y:32 [binder, in Complexity.Libs.CookPrelim.FlatFinTypes]
Y:32 [binder, in Undecidability.Synthetic.MoreEnumerabilityFacts]
y:32 [binder, in Undecidability.Shared.Libs.DLW.Wf.wf_finite]
y:32 [binder, in Undecidability.TM.L.Eval]
Y:32 [binder, in Complexity.TM.Single.DecodeTapes]
y:32 [binder, in Undecidability.Shared.Dec]
y:32 [binder, in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
y:32 [binder, in Undecidability.TM.Combinators.SequentialComposition]
y:32 [binder, in Undecidability.TM.L.Transcode.Enc_to_Boollist]
y:32 [binder, in Complexity.TM.PrettyBounds.PrettyBounds]
y:32 [binder, in Undecidability.TM.Code.BinNumbers.PosShiftTM]
y:321 [binder, in Undecidability.TM.Hoare.HoareExamples]
Y:325 [binder, in Undecidability.TM.Code.Copy]
y:326 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
y:326 [binder, in Undecidability.TM.Hoare.HoareExamples]
Y:329 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
y:329 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
y:33 [binder, in Undecidability.TM.Hoare.HoareTactics]
Y:33 [binder, in Undecidability.Shared.Libs.PSL.EqDec]
y:33 [binder, in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
y:33 [binder, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
Y:33 [binder, in Undecidability.TM.Util.VectorPrelim]
y:33 [binder, in Complexity.TM.PrettyBounds.BaseCodeSpace]
y:33 [binder, in Undecidability.L.Tactics.ComputableTactics]
y:33 [binder, in Undecidability.L.Datatypes.LNat]
y:331 [binder, in Undecidability.TM.Code.Copy]
y:332 [binder, in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
y:333 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
Y:335 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
Y:336 [binder, in Undecidability.TM.Code.Copy]
y:336 [binder, in Undecidability.Shared.Libs.DLW.Code.sss]
y:337 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
y:337 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
y:338 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
y:34 [binder, in Undecidability.Shared.Libs.PSL.Numbers]
y:34 [binder, in Undecidability.L.Prelim.ARS]
y:34 [binder, in Undecidability.TM.Code.BinNumbers.PosMultTM]
y:34 [binder, in Undecidability.TM.Hoare.HoareTactics]
Y:34 [binder, in Complexity.TM.PrettyBounds.UnivBounds]
Y:34 [binder, in Undecidability.TM.Univ.LowLevel]
y:34 [binder, in Undecidability.TM.Code.NatSub]
y:34 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
Y:34 [binder, in Undecidability.TM.Univ.LookupAssociativeListTM]
y:34 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
y:34 [binder, in Complexity.TM.PrettyBounds.PrettyBounds]
y:34 [binder, in Undecidability.TM.Code.BinNumbers.PosShiftTM]
y:341 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
y:342 [binder, in Undecidability.TM.Code.Copy]
y:344 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Y:348 [binder, in Undecidability.TM.Code.Copy]
y:35 [binder, in Undecidability.TM.Hoare.HoareTactics]
Y:35 [binder, in Undecidability.Shared.Libs.PSL.EqDec]
y:35 [binder, in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
Y:35 [binder, in Undecidability.Synthetic.EnumerabilityFacts]
y:35 [binder, in Undecidability.TM.Code.BinNumbers.NTM]
y:35 [binder, in Undecidability.Synthetic.MoreEnumerabilityFacts]
y:35 [binder, in Undecidability.TM.Util.Relations]
Y:354 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
y:354 [binder, in Undecidability.TM.Code.Copy]
y:354 [binder, in Undecidability.TM.Hoare.HoareExamples]
Y:359 [binder, in Undecidability.TM.Code.Copy]
Y:3594 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
y:36 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_quotient]
y:36 [binder, in Undecidability.TM.Hoare.HoareTactics]
Y:36 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
y:36 [binder, in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
Y:36 [binder, in Undecidability.Synthetic.Definitions]
y:36 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
y:36 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
y:36 [binder, in Undecidability.Shared.Libs.PSL.Vectors.VectorDupfree]
y:36 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
y:36 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
y:36 [binder, in Undecidability.TM.L.Transcode.Enc_to_Boollist]
y:36 [binder, in Complexity.TM.PrettyBounds.PrettyBounds]
y:360 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
y:360 [binder, in Undecidability.TM.Util.TM_facts]
y:360 [binder, in Undecidability.TM.Hoare.HoareExamples]
Y:362 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
Y:3627 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Y:365 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
y:365 [binder, in Undecidability.TM.Code.Copy]
Y:366 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
y:37 [binder, in Undecidability.L.Prelim.ARS]
y:37 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_quotient]
y:37 [binder, in Undecidability.TM.Hoare.HoareTactics]
Y:37 [binder, in Undecidability.Shared.Libs.PSL.EqDec]
y:37 [binder, in Undecidability.L.Functions.EqBool]
y:37 [binder, in Undecidability.TM.Code.NatSub]
y:37 [binder, in Undecidability.L.Tactics.ComputableTactics]
y:37 [binder, in Undecidability.L.Computability.Synthetic]
Y:37 [binder, in Complexity.Complexity.NP]
Y:370 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
Y:371 [binder, in Undecidability.TM.Code.Copy]
y:372 [binder, in Undecidability.TM.Hoare.HoareCombinators]
y:374 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
y:375 [binder, in Undecidability.TM.Hoare.HoareRegister]
y:376 [binder, in Undecidability.TM.Hoare.HoareRegister]
Y:377 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
y:377 [binder, in Undecidability.TM.Code.Copy]
y:378 [binder, in Undecidability.TM.Hoare.HoareCombinators]
y:38 [binder, in Undecidability.TM.Hoare.HoareTactics]
y:38 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
Y:38 [binder, in Undecidability.Shared.Libs.PSL.Lists.Filter]
y:38 [binder, in Undecidability.TM.Code.CaseSum]
Y:38 [binder, in Undecidability.TM.Util.Relations]
y:38 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
y:38 [binder, in Undecidability.L.Tactics.ComputableTactics]
Y:38 [binder, in Undecidability.TM.Code.Code]
y:38 [binder, in Undecidability.Shared.Libs.DLW.Vec.pos]
Y:38 [binder, in Undecidability.TM.Hoare.HoareExamples]
y:381 [binder, in Undecidability.TM.Hoare.HoareExamples]
Y:385 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
y:387 [binder, in Undecidability.TM.Hoare.HoareExamples]
y:39 [binder, in Undecidability.TM.Hoare.HoareTactics]
y:39 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
y:39 [binder, in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
y:39 [binder, in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
Y:39 [binder, in Undecidability.Synthetic.MoreEnumerabilityFacts]
y:39 [binder, in Undecidability.L.Tactics.ComputableTactics]
Y:39 [binder, in Undecidability.Shared.Dec]
y:39 [binder, in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
Y:39 [binder, in Undecidability.L.Functions.Decoding]
y:39 [binder, in Complexity.TM.PrettyBounds.PrettyBounds]
y:390 [binder, in Undecidability.TM.Hoare.HoareRegister]
y:391 [binder, in Undecidability.TM.Hoare.HoareRegister]
Y:393 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
y:4 [binder, in Undecidability.Shared.Libs.PSL.Numbers]
y:4 [binder, in Undecidability.L.Prelim.ARS]
y:4 [binder, in Undecidability.TM.Hoare.HoareTactics]
y:4 [binder, in Undecidability.L.Datatypes.LFinType]
Y:4 [binder, in Undecidability.TM.Util.Relations]
y:4 [binder, in Complexity.L.Functions.BinNumsCompare]
y:4 [binder, in Undecidability.L.Datatypes.LNat]
y:40 [binder, in Undecidability.Shared.Libs.PSL.Numbers]
y:40 [binder, in Undecidability.Shared.Libs.PSL.Lists.Removal]
y:40 [binder, in Undecidability.Shared.Libs.DLW.Utils.prime]
y:40 [binder, in Undecidability.TM.Hoare.HoareTactics]
Y:40 [binder, in Undecidability.Shared.Libs.PSL.EqDec]
y:40 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
y:40 [binder, in Undecidability.TM.Univ.LowLevel]
y:40 [binder, in Undecidability.L.Functions.EqBool]
Y:40 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
Y:401 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
y:404 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
y:407 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
y:407 [binder, in Undecidability.TM.Hoare.HoareRegister]
Y:409 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
y:409 [binder, in Undecidability.TM.Hoare.HoareRegister]
y:41 [binder, in Undecidability.TM.Hoare.HoareTactics]
y:41 [binder, in Complexity.TM.Code.Decode]
y:41 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
y:41 [binder, in Undecidability.Synthetic.EnumerabilityFacts]
y:41 [binder, in Undecidability.TM.Basic.Mono]
y:41 [binder, in Undecidability.TM.Code.BinNumbers.NTM]
Y:41 [binder, in Complexity.Libs.UniformHomomorphisms]
y:41 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_upto]
y:41 [binder, in Undecidability.Synthetic.MoreEnumerabilityFacts]
y:41 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
y:416 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
y:418 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
Y:418 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
y:42 [binder, in Undecidability.Shared.Libs.PSL.Numbers]
y:42 [binder, in Undecidability.TM.Code.BinNumbers.PosMultTM]
y:42 [binder, in Undecidability.TM.Hoare.HoareTactics]
y:42 [binder, in Undecidability.Shared.Libs.PSL.EqDec]
Y:42 [binder, in Complexity.Complexity.Subtypes]
y:42 [binder, in Complexity.TM.PrettyBounds.BaseCodeSpace]
y:42 [binder, in Undecidability.TM.Util.Relations]
Y:42 [binder, in Undecidability.L.Tactics.ComputableTactics]
Y:42 [binder, in Undecidability.Shared.Dec]
y:42 [binder, in Undecidability.L.Computability.Synthetic]
y:42 [binder, in Undecidability.L.Datatypes.LNat]
y:42 [binder, in Complexity.TM.PrettyBounds.PrettyBounds]
y:424 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
y:426 [binder, in Undecidability.TM.Hoare.HoareRegister]
Y:427 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
y:428 [binder, in Undecidability.TM.Hoare.HoareRegister]
y:43 [binder, in Undecidability.TM.Hoare.HoareTactics]
y:43 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
y:43 [binder, in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
y:43 [binder, in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
Y:43 [binder, in Undecidability.L.Tactics.ComputableDemo]
y:43 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_upto]
y:43 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
y:43 [binder, in Undecidability.TM.Code.Code]
Y:43 [binder, in Undecidability.TM.Univ.LookupAssociativeListTM]
y:43 [binder, in Complexity.Complexity.NP]
y:436 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
y:436 [binder, in Undecidability.TM.Hoare.HoareCombinators]
y:44 [binder, in Undecidability.Shared.Libs.PSL.Numbers]
y:44 [binder, in Undecidability.L.Prelim.ARS]
y:44 [binder, in Undecidability.Shared.Libs.PSL.Lists.Removal]
y:44 [binder, in Undecidability.Shared.Libs.DLW.Utils.prime]
y:44 [binder, in Undecidability.TM.Hoare.HoareTactics]
Y:44 [binder, in Complexity.TM.PrettyBounds.UnivBounds]
Y:44 [binder, in Undecidability.Synthetic.EnumerabilityFacts]
y:44 [binder, in Undecidability.Shared.Libs.PSL.Lists.Position]
Y:44 [binder, in Complexity.L.TM.CompCode]
y:44 [binder, in Undecidability.TM.Code.CompareValue]
y:44 [binder, in Undecidability.L.Computability.Synthetic]
y:44 [binder, in Complexity.Complexity.PolyTimeComputable]
y:44 [binder, in Undecidability.TM.Hoare.HoareExamples]
Y:44 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
y:442 [binder, in Undecidability.TM.Hoare.HoareCombinators]
y:45 [binder, in Complexity.Libs.Pigeonhole]
y:45 [binder, in Undecidability.TM.Code.BinNumbers.PosMultTM]
y:45 [binder, in Undecidability.TM.Hoare.HoareTactics]
y:45 [binder, in Undecidability.TM.Code.NatSub]
y:45 [binder, in Undecidability.TM.Lifting.LiftTapes]
y:45 [binder, in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
Y:45 [binder, in Undecidability.TM.Code.Code]
Y:45 [binder, in Undecidability.L.Functions.Decoding]
y:45 [binder, in Complexity.Complexity.PolyTimeComputable]
y:45 [binder, in Complexity.TM.PrettyBounds.PrettyBounds]
Y:453 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
y:458 [binder, in Undecidability.TM.Hoare.HoareCombinators]
y:46 [binder, in Undecidability.TM.Hoare.HoareTactics]
y:46 [binder, in Undecidability.TM.Basic.Mono]
y:46 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_upto]
Y:46 [binder, in Undecidability.TM.Util.Relations]
Y:46 [binder, in Undecidability.L.Tactics.ComputableTactics]
y:46 [binder, in Undecidability.L.Computability.Synthetic]
y:46 [binder, in Undecidability.L.Datatypes.LNat]
y:46 [binder, in Complexity.Complexity.PolyTimeComputable]
Y:46 [binder, in Undecidability.Synthetic.ReducibilityFacts]
y:464 [binder, in Undecidability.TM.Hoare.HoareCombinators]
y:47 [binder, in Undecidability.TM.Code.BinNumbers.PosMultTM]
y:47 [binder, in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
y:47 [binder, in Undecidability.TM.Code.CompareValue]
Y:47 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_base]
y:47 [binder, in Undecidability.TM.Code.Code]
y:47 [binder, in Undecidability.TM.Hoare.HoareMult]
y:47 [binder, in Undecidability.L.Computability.Synthetic]
y:47 [binder, in Complexity.Complexity.NP]
y:474 [binder, in Undecidability.TM.Hoare.HoareRegister]
y:48 [binder, in Undecidability.L.Prelim.ARS]
y:48 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_quotient]
Y:48 [binder, in Complexity.TM.Code.Decode]
y:48 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
Y:48 [binder, in Undecidability.Synthetic.DecidabilityFacts]
y:48 [binder, in Undecidability.L.Computability.Synthetic]
y:48 [binder, in Undecidability.Synthetic.Infinite]
y:48 [binder, in Undecidability.L.Datatypes.LNat]
Y:49 [binder, in Undecidability.Shared.Libs.PSL.EqDec]
y:49 [binder, in Complexity.TM.PrettyBounds.BaseCodeSpace]
Y:49 [binder, in Complexity.L.TM.TMflatComp]
y:49 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_upto]
y:49 [binder, in Undecidability.TM.Code.NatSub]
y:49 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
y:49 [binder, in Undecidability.TM.Code.CasePair]
y:49 [binder, in Undecidability.TM.L.Transcode.Enc_to_Boollist]
Y:49 [binder, in Undecidability.TM.Hoare.HoareExamples]
y:49 [binder, in Complexity.TM.PrettyBounds.PrettyBounds]
y:5 [binder, in Undecidability.TM.Hoare.HoareTactics]
y:5 [binder, in Undecidability.Synthetic.EnumerabilityFacts]
y:5 [binder, in Undecidability.Shared.Libs.DLW.Utils.quotient]
y:5 [binder, in Undecidability.L.Tactics.ComputableDemo]
Y:5 [binder, in Complexity.L.TM.TMflatComp]
y:5 [binder, in Complexity.Complexity.UpToCPoly]
Y:5 [binder, in Undecidability.Synthetic.Undecidability]
y:5 [binder, in Undecidability.L.Functions.EqBool]
Y:5 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
Y:5 [binder, in Undecidability.L.Functions.Encoding]
y:5 [binder, in Complexity.L.Functions.BinNumsAdd]
Y:5 [binder, in Undecidability.L.AbstractMachines.LargestVar]
y:50 [binder, in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
y:50 [binder, in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
y:50 [binder, in Undecidability.TM.Util.Relations]
Y:50 [binder, in Undecidability.Synthetic.DecidabilityFacts]
y:50 [binder, in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
Y:50 [binder, in Complexity.Complexity.PolyTimeComputable]
y:50 [binder, in Complexity.Complexity.NP]
Y:50 [binder, in Undecidability.Synthetic.ReducibilityFacts]
y:51 [binder, in Complexity.Libs.Pigeonhole]
y:51 [binder, in Undecidability.L.Prelim.ARS]
Y:51 [binder, in Complexity.TM.PrettyBounds.BaseCode]
y:51 [binder, in Complexity.L.TM.CompCode]
y:51 [binder, in Undecidability.TM.Code.CompareValue]
Y:52 [binder, in Undecidability.Shared.Libs.PSL.EqDec]
y:52 [binder, in Complexity.TM.Code.Decode]
y:52 [binder, in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
y:52 [binder, in Undecidability.Shared.Libs.PSL.Lists.Position]
y:52 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
y:52 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_base]
y:52 [binder, in Undecidability.TM.Code.NatSub]
y:52 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
y:52 [binder, in Undecidability.TM.Hoare.HoareMult]
y:52 [binder, in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
y:53 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_quotient]
y:53 [binder, in Undecidability.TM.Code.BinNumbers.PosMultTM]
Y:53 [binder, in Complexity.TM.PrettyBounds.UnivBounds]
y:53 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
y:53 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
y:53 [binder, in Undecidability.Shared.Libs.DLW.Utils.quotient]
y:53 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_upto]
y:53 [binder, in Undecidability.Shared.Libs.PSL.Vectors.VectorDupfree]
y:53 [binder, in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
y:53 [binder, in Undecidability.Synthetic.Infinite]
y:53 [binder, in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
Y:53 [binder, in Undecidability.L.Functions.Decoding]
y:53 [binder, in Undecidability.TM.L.Transcode.Enc_to_Boollist]
y:53 [binder, in Undecidability.TM.Code.BinNumbers.PosShiftTM]
y:54 [binder, in Complexity.TM.PrettyBounds.BaseCode]
y:54 [binder, in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
Y:54 [binder, in Complexity.Complexity.Subtypes]
y:54 [binder, in Undecidability.TM.Code.CompareValue]
y:54 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
Y:54 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_base]
y:54 [binder, in Undecidability.L.Datatypes.List.List_eqb]
y:54 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
Y:54 [binder, in Undecidability.Synthetic.ReducibilityFacts]
Y:547 [binder, in Complexity.NP.TM.LM_to_mTM]
y:55 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_quotient]
y:55 [binder, in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
y:55 [binder, in Undecidability.Shared.Libs.PSL.Lists.Position]
y:55 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
y:55 [binder, in Complexity.L.TM.CompCode]
Y:55 [binder, in Complexity.L.TM.TMflatComp]
y:55 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_upto]
y:55 [binder, in Complexity.L.TM.TMflat]
y:55 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
y:55 [binder, in Undecidability.TM.PrettyBounds.MaxList]
y:55 [binder, in Undecidability.TM.Hoare.HoareExamples]
y:56 [binder, in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
y:56 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
y:56 [binder, in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
y:56 [binder, in Undecidability.L.Computability.Synthetic]
Y:56 [binder, in Complexity.Complexity.Definitions]
y:56 [binder, in Undecidability.TM.PrettyBounds.MaxList]
Y:56 [binder, in Complexity.NP.TM.LM_to_mTM]
y:57 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_quotient]
y:57 [binder, in Undecidability.TM.Util.Relations]
Y:57 [binder, in Undecidability.TM.Univ.LookupAssociativeListTM]
y:58 [binder, in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
y:58 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
y:58 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
y:58 [binder, in Undecidability.TM.Code.CompareValue]
Y:580 [binder, in Complexity.NP.TM.LM_to_mTM]
y:59 [binder, in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
y:59 [binder, in Undecidability.Shared.Libs.DLW.Utils.quotient]
y:59 [binder, in Undecidability.TM.Code.CaseSum]
Y:59 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_base]
y:59 [binder, in Undecidability.L.Computability.Synthetic]
Y:59 [binder, in Complexity.Complexity.PolyTimeComputable]
y:6 [binder, in Undecidability.L.Prelim.ARS]
y:6 [binder, in Undecidability.TM.Hoare.HoareTactics]
y:6 [binder, in Undecidability.Shared.Libs.PSL.Retracts]
y:6 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
y:6 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_upto]
y:6 [binder, in Undecidability.TM.Code.NatSub]
y:6 [binder, in Complexity.NP.TM.M_LM2TM]
y:6 [binder, in Undecidability.Shared.Libs.DLW.Wf.wf_finite]
y:6 [binder, in Undecidability.L.TM.TMEncoding]
y:6 [binder, in Undecidability.TM.Code.BinNumbers.PosAddTM]
y:60 [binder, in Undecidability.L.Prelim.ARS]
y:60 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_quotient]
y:60 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
y:60 [binder, in Undecidability.Shared.Libs.DLW.Utils.quotient]
y:60 [binder, in Undecidability.TM.Code.NatSub]
y:61 [binder, in Undecidability.Shared.Libs.DLW.Utils.quotient]
y:61 [binder, in Undecidability.TM.Code.NatSub]
y:61 [binder, in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
y:61 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
Y:61 [binder, in Undecidability.TM.Hoare.HoareExamples]
Y:62 [binder, in Complexity.TM.PrettyBounds.BaseCode]
y:62 [binder, in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
y:62 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
y:62 [binder, in Complexity.L.TM.TMflatComp]
y:62 [binder, in Undecidability.TM.Hoare.HoareCombinators]
y:62 [binder, in Complexity.TM.PrettyBounds.PrettyBounds]
y:63 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_quotient]
Y:63 [binder, in Complexity.TM.PrettyBounds.UnivBounds]
Y:63 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
y:63 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
y:63 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
y:64 [binder, in Undecidability.L.Prelim.ARS]
y:64 [binder, in Undecidability.TM.Code.List.Nth]
y:64 [binder, in Undecidability.L.Tactics.Extract]
Y:64 [binder, in Undecidability.Shared.Libs.DLW.Utils.quotient]
Y:64 [binder, in Undecidability.L.Datatypes.LVector]
Y:64 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_base]
Y:64 [binder, in Undecidability.L.Functions.FinTypeLookup]
y:65 [binder, in Complexity.TM.PrettyBounds.BaseCode]
y:65 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_quotient]
y:65 [binder, in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
Y:65 [binder, in Undecidability.TM.Util.Relations]
y:66 [binder, in Complexity.TM.PrettyBounds.BaseCode]
Y:66 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
Y:66 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_base]
y:66 [binder, in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
y:67 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
y:67 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
Y:67 [binder, in Undecidability.Shared.Libs.DLW.Utils.quotient]
Y:67 [binder, in Complexity.Complexity.Definitions]
Y:67 [binder, in Undecidability.TM.Univ.LookupAssociativeListTM]
y:67 [binder, in Complexity.TM.Single.DecodeTape]
y:67 [binder, in Undecidability.TM.Hoare.HoareExamples]
Y:68 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_base]
Y:68 [binder, in Complexity.Complexity.PolyTimeComputable]
y:69 [binder, in Undecidability.TM.Code.List.Nth]
y:69 [binder, in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
y:69 [binder, in Undecidability.Shared.Libs.DLW.Utils.php]
y:69 [binder, in Undecidability.TM.Util.Relations]
y:69 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
y:7 [binder, in Undecidability.Shared.Libs.PSL.Lists.Removal]
y:7 [binder, in Undecidability.TM.Code.BinNumbers.PosMultTM]
y:7 [binder, in Undecidability.TM.Hoare.HoareTactics]
y:7 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
y:7 [binder, in Undecidability.Shared.embed_nat]
y:7 [binder, in Undecidability.TM.Univ.LowLevel]
y:7 [binder, in Undecidability.L.Datatypes.LFinType]
y:7 [binder, in Complexity.NP.TM.M_multi2mono]
y:7 [binder, in Undecidability.L.Datatypes.LNat]
y:7 [binder, in Complexity.L.Functions.BinNumsAdd]
Y:70 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
Y:70 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
Y:70 [binder, in Undecidability.Shared.Libs.DLW.Utils.quotient]
y:70 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
Y:70 [binder, in Complexity.Complexity.PolyTimeComputable]
y:71 [binder, in Undecidability.L.Prelim.ARS]
y:71 [binder, in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
y:71 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
Y:71 [binder, in Undecidability.TM.Util.Relations]
y:71 [binder, in Complexity.TM.PrettyBounds.PrettyBounds]
Y:72 [binder, in Complexity.TM.PrettyBounds.UnivBounds]
y:72 [binder, in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
Y:72 [binder, in Undecidability.L.Computability.Synthetic]
Y:72 [binder, in Complexity.Complexity.PolyTimeComputable]
Y:72 [binder, in Undecidability.TM.Hoare.HoareExamples]
y:72 [binder, in Undecidability.TM.Code.BinNumbers.PosShiftTM]
Y:73 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
y:73 [binder, in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
y:73 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
Y:73 [binder, in Undecidability.TM.Util.Relations]
Y:73 [binder, in Complexity.Complexity.NP]
y:74 [binder, in Undecidability.L.Prelim.ARS]
y:74 [binder, in Undecidability.TM.Code.BinNumbers.PosDefinitions]
y:74 [binder, in Undecidability.Shared.Libs.PSL.Retracts]
Y:74 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
y:74 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
y:74 [binder, in Undecidability.L.Datatypes.LVector]
Y:74 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_base]
y:74 [binder, in Undecidability.TM.Hoare.HoareCombinators]
y:74 [binder, in Undecidability.TM.Code.BinNumbers.PosShiftTM]
y:75 [binder, in Undecidability.TM.Util.Prelim]
y:75 [binder, in Complexity.Libs.CookPrelim.PolyBounds]
y:75 [binder, in Undecidability.TM.L.HeapInterpreter.LookupTM]
y:76 [binder, in Undecidability.L.Complexity.UpToCNary]
y:76 [binder, in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
y:76 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
Y:76 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_base]
Y:76 [binder, in Complexity.Complexity.PolyTimeComputable]
y:77 [binder, in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
y:77 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
Y:77 [binder, in Complexity.NP.Clique.kSAT_to_Clique]
y:77 [binder, in Undecidability.L.Computability.Synthetic]
y:77 [binder, in Complexity.TM.Single.DecodeTape]
y:78 [binder, in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
Y:78 [binder, in Undecidability.TM.Util.Relations]
y:78 [binder, in Undecidability.TM.Hoare.HoareExamples]
y:79 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
y:79 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
y:79 [binder, in Undecidability.TM.Util.Prelim]
y:79 [binder, in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
y:79 [binder, in Complexity.Complexity.Definitions]
Y:8 [binder, in Undecidability.L.Prelim.ARS]
y:8 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
Y:8 [binder, in Complexity.Complexity.EncodableP]
y:8 [binder, in Undecidability.TM.Hoare.HoareTactics]
y:8 [binder, in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
Y:8 [binder, in Undecidability.L.Datatypes.LSum]
y:8 [binder, in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
y:8 [binder, in Undecidability.Synthetic.EnumerabilityFacts]
Y:8 [binder, in Undecidability.Shared.Libs.DLW.Utils.quotient]
y:8 [binder, in Complexity.TM.Code.DecodeList]
Y:8 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
Y:8 [binder, in Complexity.Complexity.Subtypes]
y:8 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_upto]
y:8 [binder, in Undecidability.Shared.Libs.PSL.Bijection]
y:8 [binder, in Complexity.L.Functions.BinNumsCompare]
y:8 [binder, in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
y:8 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
y:8 [binder, in Undecidability.Shared.Libs.DLW.Utils.seteq]
Y:8 [binder, in Undecidability.L.Computability.Computability]
y:8 [binder, in Complexity.TM.PrettyBounds.PrettyBounds]
y:80 [binder, in Undecidability.L.Complexity.UpToCNary]
y:80 [binder, in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
y:80 [binder, in Complexity.L.TM.CompCode]
y:80 [binder, in Complexity.NP.Clique.kSAT_to_Clique]
y:81 [binder, in Undecidability.L.Prelim.ARS]
Y:81 [binder, in Complexity.TM.PrettyBounds.UnivBounds]
y:81 [binder, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
y:81 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
y:81 [binder, in Complexity.TM.Single.DecodeTape]
y:81 [binder, in Undecidability.TM.L.HeapInterpreter.LookupTM]
y:81 [binder, in Undecidability.L.Tactics.Computable]
y:82 [binder, in Undecidability.Shared.Libs.DLW.Utils.prime]
Y:82 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
y:82 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
y:82 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
y:82 [binder, in Complexity.NP.Clique.kSAT_to_Clique]
y:83 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
y:83 [binder, in Undecidability.L.Complexity.UpToCNary]
Y:83 [binder, in Undecidability.TM.Single.StepTM]
Y:83 [binder, in Undecidability.TM.Util.Prelim]
Y:83 [binder, in Undecidability.TM.Util.Relations]
y:83 [binder, in Undecidability.TM.Hoare.HoareExamples]
y:84 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
y:84 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
y:84 [binder, in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
y:84 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
y:84 [binder, in Undecidability.L.Datatypes.LVector]
Y:84 [binder, in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
y:84 [binder, in Undecidability.TM.Hoare.HoareCombinators]
Y:84 [binder, in Complexity.Complexity.NP]
Y:84 [binder, in Complexity.NP.TM.LM_to_mTM]
y:84 [binder, in Complexity.TM.PrettyBounds.PrettyBounds]
y:85 [binder, in Undecidability.L.Prelim.ARS]
y:85 [binder, in Undecidability.TM.Code.CaseList]
y:85 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
y:85 [binder, in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
y:85 [binder, in Undecidability.TM.Code.CasePair]
y:86 [binder, in Undecidability.L.Complexity.UpToCNary]
y:86 [binder, in Undecidability.TM.Code.List.Nth]
y:86 [binder, in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
y:86 [binder, in Undecidability.L.Datatypes.LVector]
Y:86 [binder, in Complexity.TM.PrettyBounds.BaseCodeSpace]
y:86 [binder, in Undecidability.TM.Univ.LookupAssociativeListTM]
y:86 [binder, in Undecidability.TM.Hoare.HoareExamples]
y:87 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
y:87 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
Y:87 [binder, in Undecidability.TM.Code.Code]
Y:87 [binder, in Complexity.Complexity.Definitions]
Y:87 [binder, in Complexity.Complexity.PolyTimeComputable]
Y:88 [binder, in Complexity.TM.PrettyBounds.UnivSpaceBounds]
Y:88 [binder, in Complexity.TM.PrettyBounds.PrettyBounds]
y:88 [binder, in Undecidability.TM.Code.BinNumbers.PosShiftTM]
y:89 [binder, in Undecidability.L.Complexity.UpToCNary]
y:89 [binder, in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
y:89 [binder, in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
Y:89 [binder, in Undecidability.Shared.Libs.DLW.Utils.php]
Y:89 [binder, in Undecidability.TM.Util.Relations]
y:89 [binder, in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
y:9 [binder, in Undecidability.Shared.Libs.PSL.Lists.Removal]
y:9 [binder, in Undecidability.TM.Hoare.HoareTactics]
Y:9 [binder, in Undecidability.Shared.Libs.PSL.EqDec]
Y:9 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
Y:9 [binder, in Undecidability.L.Prelim.LoopSum]
y:9 [binder, in Undecidability.Shared.Libs.DLW.Wf.acc_irr]
y:9 [binder, in Undecidability.TM.Combinators.SequentialComposition]
y:9 [binder, in Complexity.L.Functions.BinNumsAdd]
y:90 [binder, in Undecidability.L.Prelim.ARS]
y:90 [binder, in Undecidability.TM.Code.CaseList]
Y:90 [binder, in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
Y:90 [binder, in Complexity.TM.PrettyBounds.UnivBounds]
y:90 [binder, in Complexity.TM.PrettyBounds.BaseCodeSpace]
y:90 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
y:90 [binder, in Undecidability.L.Tactics.Computable]
y:90 [binder, in Undecidability.TM.Hoare.HoareExamples]
y:90 [binder, in Undecidability.TM.Code.BinNumbers.PosShiftTM]
y:91 [binder, in Undecidability.TM.Code.List.Nth]
Y:91 [binder, in Undecidability.L.Complexity.UpToC]
y:91 [binder, in Undecidability.TM.Univ.LookupAssociativeListTM]
y:92 [binder, in Undecidability.L.Complexity.UpToCNary]
Y:92 [binder, in Undecidability.TM.Single.StepTM]
y:92 [binder, in Undecidability.TM.Hoare.HoareExamples]
y:93 [binder, in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
y:93 [binder, in Undecidability.L.Complexity.UpToC]
y:93 [binder, in Undecidability.Shared.Libs.DLW.Utils.php]
y:93 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
Y:93 [binder, in Complexity.Complexity.Definitions]
Y:93 [binder, in Complexity.Complexity.PolyTimeComputable]
y:93 [binder, in Undecidability.TM.Hoare.HoareExamples]
y:94 [binder, in Undecidability.TM.Code.CodeTM]
y:94 [binder, in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
y:94 [binder, in Complexity.TM.PrettyBounds.PrettyBounds]
y:95 [binder, in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
Y:95 [binder, in Undecidability.TM.Util.Relations]
Y:96 [binder, in Undecidability.L.Complexity.UpToCNary]
y:96 [binder, in Undecidability.L.Tactics.ComputableTime]
y:96 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
y:96 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
y:96 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
y:96 [binder, in Undecidability.TM.Code.Code]
y:96 [binder, in Undecidability.TM.Hoare.HoareExamples]
y:97 [binder, in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
y:97 [binder, in Undecidability.L.Complexity.UpToC]
y:97 [binder, in Undecidability.TM.Code.CodeTM]
Y:97 [binder, in Undecidability.Shared.Libs.DLW.Utils.php]
y:97 [binder, in Undecidability.TM.Hoare.HoareCombinators]
y:98 [binder, in Undecidability.L.Complexity.UpToCNary]
Y:98 [binder, in Undecidability.TM.Single.StepTM]
Y:98 [binder, in Undecidability.TM.Util.Prelim]
y:98 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
y:98 [binder, in Undecidability.L.Computability.Synthetic]
y:98 [binder, in Undecidability.TM.L.HeapInterpreter.LookupTM]
y:99 [binder, in Undecidability.TM.Combinators.While]
y:99 [binder, in Complexity.L.TM.CompCode]
Y:99 [binder, in Undecidability.TM.Util.Relations]
y:99 [binder, in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
Y:99 [binder, in Complexity.Complexity.PolyTimeComputable]
Y:99 [binder, in Complexity.Complexity.NP]
y:99 [binder, in Undecidability.TM.Hoare.HoareExamples]
Y:99 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
y:994 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
y:999 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]

Z

z [abbreviation, in Undecidability.Shared.Libs.DLW.Utils.sums]
z [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Zero [abbreviation, in Undecidability.Shared.Libs.DLW.Utils.list_bool]
Zero [abbreviation, in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
zflat [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
zflat_poly [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
zflat_time_bound [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
zflat_time [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
zflat_z_eq [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
zipWith [definition, in Complexity.L.TM.TMflatFun]
zipWith_length [lemma, in Complexity.L.TM.TMflatComp]
zipWith_time_const [lemma, in Complexity.L.TM.TMflatComp]
zipWith_time [definition, in Complexity.L.TM.TMflatComp]
Zmult_monoid [lemma, in Undecidability.Shared.Libs.DLW.Utils.sums]
zPflat [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
zPflat_poly [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
zPflat_time_bound [lemma, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
zPflat_time [definition, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
zPflat_zP_eq [lemma, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Zplus_monoid [lemma, in Undecidability.Shared.Libs.DLW.Utils.sums]
Z__case:97 [binder, in Undecidability.L.Complexity.UpToCNary]
Z__case:92 [binder, in Undecidability.L.Complexity.UpToC]
z' [definition, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
z':102 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
z':111 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
z':86 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
z1:62 [binder, in Undecidability.TM.Util.Relations]
z2:63 [binder, in Undecidability.TM.Util.Relations]
z:10 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
Z:100 [binder, in Complexity.Complexity.NP]
z:102 [binder, in Undecidability.L.Complexity.UpToC]
Z:102 [binder, in Undecidability.TM.Util.Relations]
z:104 [binder, in Undecidability.L.Complexity.UpToCNary]
z:105 [binder, in Undecidability.L.Complexity.UpToCNary]
z:105 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
z:106 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
z:108 [binder, in Undecidability.L.Complexity.UpToCNary]
Z:109 [binder, in Undecidability.TM.Util.Relations]
z:11 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
z:11 [binder, in Undecidability.L.Tactics.ComputableTactics]
z:113 [binder, in Undecidability.TM.Util.Relations]
Z:115 [binder, in Complexity.Libs.CookPrelim.PolyBounds]
z:118 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
z:12 [binder, in Undecidability.L.Tactics.ComputableTactics]
Z:12 [binder, in Complexity.Complexity.PolyTimeComputable]
z:12 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
z:120 [binder, in Complexity.Complexity.NP]
z:120 [binder, in Undecidability.TM.Hoare.HoareExamples]
z:122 [binder, in Complexity.Complexity.NP]
z:123 [binder, in Complexity.Complexity.NP]
z:123 [binder, in Undecidability.TM.Hoare.HoareExamples]
z:126 [binder, in Complexity.Complexity.NP]
z:13 [binder, in Undecidability.L.Prelim.ARS]
z:133 [binder, in Undecidability.TM.Util.Relations]
z:133 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
z:134 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
z:138 [binder, in Undecidability.Shared.Libs.DLW.Utils.sums]
z:139 [binder, in Undecidability.TM.Util.Relations]
Z:14 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
z:141 [binder, in Undecidability.L.Prelim.ARS]
z:144 [binder, in Undecidability.TM.Util.Relations]
z:147 [binder, in Undecidability.L.Prelim.ARS]
z:15 [binder, in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
z:156 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
z:16 [binder, in Undecidability.L.Tactics.ComputableDemo]
z:168 [binder, in Complexity.Libs.CookPrelim.MorePrelim]
Z:188 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
z:19 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_quotient]
Z:19 [binder, in Undecidability.L.Functions.UnboundIteration]
Z:191 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
Z:194 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
Z:195 [binder, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
z:20 [binder, in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
Z:204 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
z:217 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
z:219 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
z:22 [binder, in Undecidability.L.Tactics.ComputableDemo]
Z:22 [binder, in Complexity.Complexity.PolyTimeComputable]
z:23 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
z:24 [binder, in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
Z:24 [binder, in Undecidability.L.Datatypes.LVector]
z:26 [binder, in Undecidability.L.Functions.UnboundIteration]
Z:27 [binder, in Undecidability.TM.Util.VectorPrelim]
z:28 [binder, in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
Z:2916 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Z:2928 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Z:2953 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Z:3 [binder, in Complexity.Complexity.PolyTimeComputable]
z:3 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
Z:30 [binder, in Complexity.L.TM.TMflatFun]
Z:3041 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Z:3056 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Z:3062 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Z:3071 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Z:31 [binder, in Undecidability.TM.Util.Relations]
Z:3104 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Z:3110 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Z:3123 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Z:3161 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Z:3170 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Z:3178 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Z:3188 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
z:32 [binder, in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
z:33 [binder, in Undecidability.Shared.Libs.DLW.Wf.wf_finite]
z:34 [binder, in Undecidability.TM.Util.Relations]
Z:35 [binder, in Complexity.Complexity.PolyTimeComputable]
Z:3595 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Z:3628 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
z:37 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
z:37 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
z:38 [binder, in Undecidability.L.Prelim.ARS]
z:4 [binder, in Undecidability.Shared.Libs.PSL.Lists.Removal]
z:4 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
z:40 [binder, in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
z:40 [binder, in Undecidability.TM.PrettyBounds.MaxList]
z:408 [binder, in Undecidability.Shared.Libs.DLW.Vec.vec]
Z:410 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
Z:419 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
z:42 [binder, in Complexity.NP.TM.mTM_to_singleTapeTM]
z:45 [binder, in Undecidability.L.Prelim.ARS]
Z:5 [binder, in Undecidability.TM.Util.Relations]
Z:50 [binder, in Complexity.L.TM.TMflatComp]
z:50 [binder, in Complexity.TM.PrettyBounds.PrettyBounds]
Z:51 [binder, in Complexity.Complexity.PolyTimeComputable]
z:52 [binder, in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
z:54 [binder, in Undecidability.Shared.Libs.PSL.Numbers]
Z:54 [binder, in Undecidability.TM.Util.Relations]
Z:56 [binder, in Complexity.L.TM.TMflatComp]
z:58 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_quotient]
Z:59 [binder, in Undecidability.TM.Util.Relations]
z:6 [binder, in Complexity.TM.PrettyBounds.M2MBounds]
z:6 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
z:6 [binder, in Undecidability.L.Tactics.ComputableDemo]
z:6 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
Z:60 [binder, in Complexity.Complexity.PolyTimeComputable]
z:62 [binder, in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
z:63 [binder, in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
z:63 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
z:63 [binder, in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
z:63 [binder, in Complexity.TM.PrettyBounds.PrettyBounds]
Z:65 [binder, in Undecidability.L.Datatypes.LVector]
z:66 [binder, in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
z:66 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
z:67 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
z:68 [binder, in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
z:68 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
z:68 [binder, in Undecidability.TM.PrettyBounds.MaxList]
z:7 [binder, in Undecidability.Shared.Libs.DLW.Wf.wf_finite]
z:7 [binder, in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
z:70 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
z:71 [binder, in Undecidability.Shared.Libs.DLW.Utils.fin_base]
z:72 [binder, in Undecidability.L.Prelim.ARS]
z:72 [binder, in Complexity.TM.PrettyBounds.PrettyBounds]
z:75 [binder, in Undecidability.L.Prelim.ARS]
z:75 [binder, in Undecidability.L.Complexity.UpToCNary]
z:79 [binder, in Undecidability.L.Complexity.UpToCNary]
z:79 [binder, in Complexity.TM.PrettyBounds.PrettyBounds]
z:8 [binder, in Undecidability.Shared.Libs.DLW.Utils.gcd]
z:81 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
z:82 [binder, in Undecidability.L.Prelim.ARS]
z:82 [binder, in Undecidability.TM.PrettyBounds.MaxList]
z:83 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
Z:84 [binder, in Undecidability.TM.Util.Prelim]
z:85 [binder, in Undecidability.Shared.Libs.PSL.Retracts]
z:86 [binder, in Undecidability.L.Prelim.ARS]
Z:88 [binder, in Undecidability.TM.Code.Code]
z:89 [binder, in Complexity.TM.PrettyBounds.PrettyBounds]
Z:9 [binder, in Undecidability.L.Prelim.ARS]
z:9 [binder, in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
z:9 [binder, in Undecidability.TM.Util.Relations]
z:91 [binder, in Undecidability.L.Prelim.ARS]
z:94 [binder, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
z:94 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
z:95 [binder, in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
z:96 [binder, in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
z:97 [binder, in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
z:98 [binder, in Undecidability.L.Complexity.UpToC]
z:98 [binder, in Complexity.TM.PrettyBounds.PrettyBounds]
z:99 [binder, in Undecidability.L.Complexity.UpToC]

_

_term_concat [lemma, in Undecidability.L.Datatypes.List.List_basics]
_term_rev_concat [lemma, in Undecidability.L.Datatypes.List.List_basics]
_term_encode_tape [definition, in Complexity.L.TM.CompCode]
_term_sat_verifierb [lemma, in Complexity.NP.SAT.SAT_inNP]
_term_evalCnf [lemma, in Complexity.NP.SAT.SAT_inNP]
_term_evalClause [lemma, in Complexity.NP.SAT.SAT_inNP]
_term_forallb [lemma, in Complexity.NP.SAT.SAT_inNP]
_term_existsb [lemma, in Complexity.NP.SAT.SAT_inNP]
_term_evalLiteral [lemma, in Complexity.NP.SAT.SAT_inNP]
_term_evalVar [lemma, in Complexity.NP.SAT.SAT_inNP]
_term_list_in_decb [lemma, in Complexity.NP.SAT.SAT_inNP]
_eqb_spec [projection, in Undecidability.L.Functions.EqBool]
_eqb_spec [constructor, in Undecidability.L.Functions.EqBool]
_flag_DisableWarning [definition, in Undecidability.TM.Lifting.LiftTapes]
_Flag_DisableWarning [definition, in Undecidability.TM.Lifting.LiftTapes]

other

_ / _ (cc_scope) [notation, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
{ _ , _ , _ } (cc_scope) [notation, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
_ >[( _ )] _ (LClos) [notation, in Undecidability.L.Tactics.LClos]
_ ~~ _ (positive_scope) [notation, in Undecidability.TM.Code.BinNumbers.PosDefinitions]
SpecFalse (spec_scope) [notation, in Undecidability.TM.Hoare.HoareRegister]
_ ^+ (type_scope) [notation, in Undecidability.TM.Code.CodeTM]
_ nel _ [notation, in Complexity.Libs.Pigeonhole]
_ ∈o _ [notation, in Complexity.Complexity.ONotation]
_ ∈O _ [notation, in Complexity.Complexity.ONotation]
_ ⇓(<= _ ) _ [notation, in Undecidability.L.Util.L_facts]
_ >(<= _ ) _ [notation, in Undecidability.L.Util.L_facts]
_ ⇓( _ ) _ [notation, in Undecidability.L.Util.L_facts]
_ ⇓ _ [notation, in Undecidability.L.Util.L_facts]
_ == _ [notation, in Undecidability.L.Util.L_facts]
_ >* _ [notation, in Undecidability.L.Util.L_facts]
_ >( _ ) _ [notation, in Undecidability.L.Util.L_facts]
_ ≻ _ [notation, in Undecidability.L.Util.L_facts]
_ [ _ / _ ] [notation, in Undecidability.Shared.Libs.DLW.Vec.vec]
_ #> _ [notation, in Undecidability.Shared.Libs.DLW.Vec.vec]
_ ## _ [notation, in Undecidability.Shared.Libs.DLW.Vec.vec]
_ .[ _ ] [notation, in Undecidability.L.Computability.Enum]
_ <p _ [notation, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
_ ~p _ [notation, in Undecidability.Shared.Libs.DLW.Utils.utils_list]
_ ⇓ _ _ [notation, in Undecidability.L.Computability.Seval]
_ ⇡ _ [notation, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
_ ⇣ _ [notation, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
_ ⊕ _ [notation, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
_ ↑ _ [notation, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
_ ↓ _ [notation, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
_ ⟂ _ [notation, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
_ ≂ _ [notation, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
_ ⪯ _ [notation, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
_ ⪦ _ [notation, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
_ ≲ _ [notation, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
_ ≲ _ [notation, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
_ .[ _ ] [notation, in Undecidability.Shared.Libs.PSL.Lists.Position]
_ === _ [notation, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
_ <<= _ [notation, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
_ el _ [notation, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
_ >> _ [notation, in Undecidability.TM.Util.Prelim]
_ ↑ _ [notation, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
_ ↓ _ [notation, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
_ ⟂ _ [notation, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
_ ≂ _ [notation, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
_ ⪯ _ [notation, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
_ ⪦ _ [notation, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
_ <=c _ [notation, in Undecidability.L.Complexity.UpToC]
_ @>> _ [notation, in Undecidability.TM.Code.CodeTM]
_ @> _ [notation, in Undecidability.TM.Code.CodeTM]
_ >>> _ [notation, in Undecidability.TM.Code.CodeTM]
_ ≂( ; _ ) _ [notation, in Undecidability.TM.Code.CodeTM]
_ ≂( _ ; _ ) _ [notation, in Undecidability.TM.Code.CodeTM]
_ ≂ _ [notation, in Undecidability.TM.Code.CodeTM]
_ ≂( _ ) _ [notation, in Undecidability.TM.Code.CodeTM]
_ ≃( ; _ ) _ [notation, in Undecidability.TM.Code.CodeTM]
_ ≃( _ ; _ ) _ [notation, in Undecidability.TM.Code.CodeTM]
_ ≃ _ [notation, in Undecidability.TM.Code.CodeTM]
_ ≃( _ ) _ [notation, in Undecidability.TM.Code.CodeTM]
_ ~p _ [notation, in Undecidability.Shared.Libs.DLW.Utils.php]
_ ∨ _ [notation, in Complexity.NP.SAT.FSAT.FSAT]
_ ∧ _ [notation, in Complexity.NP.SAT.FSAT.FSAT]
_ ≃≃ _ [notation, in Undecidability.TM.Hoare.HoareRegister]
_ ⪯ _ [notation, in Undecidability.Synthetic.Definitions]
_ ||_ _ [notation, in Undecidability.TM.Util.Relations]
_ |_ _ [notation, in Undecidability.TM.Util.Relations]
_ =2 _ [notation, in Undecidability.TM.Util.Relations]
_ <<=2 _ [notation, in Undecidability.TM.Util.Relations]
_ ⊂ _ [notation, in Undecidability.TM.Util.Relations]
_ ∩ _ [notation, in Undecidability.TM.Util.Relations]
_ ∪ _ [notation, in Undecidability.TM.Util.Relations]
_ ∘ _ [notation, in Undecidability.TM.Util.Relations]
_ ⪯ᵢ _ [notation, in Undecidability.Synthetic.InformativeDefinitions]
_ ⇑ _ [notation, in Undecidability.TM.Code.ChangeAlphabet]
_ $ _ [notation, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
_ @ _ [notation, in Undecidability.TM.Lifting.LiftTapes]
_ === _ [notation, in Undecidability.Shared.ListAutomation]
_ ;; _ [notation, in Undecidability.TM.Combinators.SequentialComposition]
_ ↓ _ [notation, in Undecidability.TM.Util.TM_facts]
_ ⊨c( _ ) _ [notation, in Undecidability.TM.Util.TM_facts]
_ ⊨ _ [notation, in Undecidability.TM.Util.TM_facts]
_ ∈Timeo _ [notation, in Complexity.Complexity.Definitions]
_ ∈TimeO _ [notation, in Complexity.Complexity.Definitions]
_ ⊆ _ [notation, in Undecidability.Shared.Libs.DLW.Utils.seteq]
_ ≡ _ [notation, in Undecidability.Shared.Libs.DLW.Utils.seteq]
_ ~p _ [notation, in Undecidability.Shared.Libs.DLW.Utils.seteq]
_ <sc _ [notation, in Undecidability.Shared.Libs.DLW.Code.subcode]
_ ~> _ [notation, in Undecidability.L.Tactics.Computable]
_ ⪯p _ [notation, in Complexity.Complexity.NP]
_ >>= _ [notation, in Complexity.Libs.CookPrelim.MorePrelim]
_ <=( _ ) _ [notation, in Complexity.TM.PrettyBounds.PrettyBounds]
computableTime' _ [notation, in Undecidability.L.Tactics.ComputableTime]
do _ <- _ ; _ [notation, in Complexity.Libs.CookPrelim.MorePrelim]
eq_dec _ [notation, in Undecidability.Shared.Libs.PSL.EqDec]
eq_dec _ [notation, in Undecidability.Shared.Dec]
Fin0 [notation, in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin1 [notation, in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin10 [notation, in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin11 [notation, in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin12 [notation, in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin13 [notation, in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin14 [notation, in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin15 [notation, in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin16 [notation, in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin17 [notation, in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin18 [notation, in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin19 [notation, in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin2 [notation, in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin20 [notation, in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin21 [notation, in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin22 [notation, in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin23 [notation, in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin24 [notation, in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin25 [notation, in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin26 [notation, in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin27 [notation, in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin28 [notation, in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin29 [notation, in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin3 [notation, in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin30 [notation, in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin31 [notation, in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin32 [notation, in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin33 [notation, in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin34 [notation, in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin35 [notation, in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin36 [notation, in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin37 [notation, in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin38 [notation, in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin39 [notation, in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin4 [notation, in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin40 [notation, in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin41 [notation, in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin42 [notation, in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin43 [notation, in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin44 [notation, in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin45 [notation, in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin46 [notation, in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin47 [notation, in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin48 [notation, in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin49 [notation, in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin5 [notation, in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin50 [notation, in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin51 [notation, in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin52 [notation, in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin53 [notation, in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin54 [notation, in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin55 [notation, in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin56 [notation, in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin57 [notation, in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin58 [notation, in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin59 [notation, in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin6 [notation, in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin60 [notation, in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin61 [notation, in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin62 [notation, in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin63 [notation, in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin64 [notation, in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin65 [notation, in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin66 [notation, in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin67 [notation, in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin68 [notation, in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin69 [notation, in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin7 [notation, in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin70 [notation, in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin71 [notation, in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin72 [notation, in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin73 [notation, in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin74 [notation, in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin75 [notation, in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin76 [notation, in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin77 [notation, in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin78 [notation, in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin79 [notation, in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin8 [notation, in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin80 [notation, in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin81 [notation, in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin82 [notation, in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin83 [notation, in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin84 [notation, in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin85 [notation, in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin86 [notation, in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin87 [notation, in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin88 [notation, in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin89 [notation, in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin9 [notation, in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin90 [notation, in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin91 [notation, in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin92 [notation, in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin93 [notation, in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin94 [notation, in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin95 [notation, in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin96 [notation, in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin97 [notation, in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin98 [notation, in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin99 [notation, in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
if! _ is _ then _ else _ [notation, in Undecidability.Synthetic.EnumerabilityFacts]
Subtype _ [notation, in Undecidability.Shared.Libs.PSL.FiniteTypes.Arbitrary]
! _ [notation, in Undecidability.L.Tactics.Computable]
# _ [notation, in Undecidability.L.Util.L_facts]
( _ ; _ ) [notation, in Undecidability.TM.Util.TM_facts]
| _ | [notation, in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
¬ _ [notation, in Complexity.NP.SAT.FSAT.FSAT]
↑ _ [notation, in Undecidability.L.Tactics.Extract]
⇧ [notation, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
∑ [notation, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
∑ [notation, in Undecidability.Shared.Libs.DLW.Utils.sorting]
∑ [notation, in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
≃( _ ; _ ) _ [notation, in Undecidability.TM.Hoare.HoareRegister]
≃( _ ) _ [notation, in Undecidability.TM.Hoare.HoareRegister]
≃≃( _ , _ ) [notation, in Undecidability.TM.Hoare.HoareRegister]
≃≃( _ ) [notation, in Undecidability.TM.Hoare.HoareRegister]
⋀ [ _ , .. , _ , _ ] [notation, in Complexity.NP.SAT.FSAT.FSAT]
⋁ [ _ , .. , _ , _ ] [notation, in Complexity.NP.SAT.FSAT.FSAT]
⋂_ _ _ [notation, in Undecidability.TM.Util.Relations]
⋃_ _ _ [notation, in Undecidability.TM.Util.Relations]
⟘ [notation, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
⟘ [notation, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
⟙ [notation, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
⟙ [notation, in Undecidability.Shared.Libs.DLW.Utils.bool_list]
⟦ _ ⟧ [notation, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
⟬ _ ⟭ [notation, in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
Σ [definition, in Undecidability.TM.L.CompilerBoolFuns.Compiler]
Σ__X:1 [binder, in Undecidability.TM.Code.List.Cons_constant]
Σ:1 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
Σ:1 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_nat_facts]
Σ:1 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
Σ:10 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
Σ:110 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
Σ:12 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
Σ:17 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
Σ:19 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
Σ:22 [binder, in Complexity.TM.Code.DecodeList]
Σ:25 [binder, in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
Σ:30 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
Σ:31 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
Σ:36 [binder, in Undecidability.TM.TM]
Σ:36 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
Σ:404 [binder, in Undecidability.TM.Util.TM_facts]
Σ:43 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
Σ:43 [binder, in Undecidability.TM.TM]
Σ:44 [binder, in Undecidability.TM.TM]
Σ:44 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
Σ:47 [binder, in Undecidability.TM.TM]
Σ:49 [binder, in Undecidability.TM.TM]
Σ:51 [binder, in Undecidability.TM.TM]
Σ:55 [binder, in Undecidability.TM.TM]
Σ:59 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
Σ:6 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
Σ:65 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
Σ:72 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
Σ:8 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler]
Σ:97 [binder, in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
γ1:1004 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1011 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1029 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1037 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1045 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1051 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1058 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1065 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1105 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1112 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1119 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1137 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1145 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1153 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1159 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1166 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1173 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1191 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1199 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1207 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1213 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1220 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1227 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1243 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1250 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1257 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1264 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1271 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1278 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1288 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1295 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1302 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1309 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1316 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1323 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1333 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1340 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1347 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1354 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1361 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1368 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1388 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1396 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1404 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1435 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1443 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1451 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:146 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
γ1:1482 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1490 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1498 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1525 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1533 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1541 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:156 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
γ1:1572 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1580 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1588 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1618 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1626 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1634 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:164 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
γ1:1659 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1667 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1675 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1698 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1706 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1714 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1737 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1745 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1753 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1788 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1795 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1802 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1816 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1823 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1830 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1836 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1843 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1850 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1864 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1871 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1878 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1884 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1891 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1898 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1911 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1918 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1925 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1932 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1939 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1946 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1956 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1963 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1970 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1977 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1983 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1989 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1995 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:2043 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:2075 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:208 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:2108 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:2119 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:214 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:2141 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:2152 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:2173 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:2183 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:220 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:2203 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:2213 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:2226 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:2235 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:2244 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:226 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:2280 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:2289 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:2298 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:2306 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:2314 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:232 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:2322 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:2354 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:2362 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:2370 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:2378 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:238 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:2386 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:2394 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:2426 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:2434 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:2442 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:2449 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:2456 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:2463 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:2491 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:2498 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:2505 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:2527 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:2550 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:2556 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:2562 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:2568 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:2574 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:2580 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:2586 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:2593 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:2624 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:2631 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:3281 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:3291 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:3301 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:3313 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:3323 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:3333 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:3345 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:3355 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:3365 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:3375 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:3383 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:3391 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:3401 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:3409 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:3417 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:3427 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:3435 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:3443 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:3455 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:3465 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:3475 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:3484 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:3493 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:3502 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:3510 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:3518 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:3526 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:3553 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:3560 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:3566 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:359 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:369 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:379 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:402 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:411 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:420 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:445 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:455 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:465 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:490 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:500 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:510 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:533 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:542 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:551 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:576 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:586 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:596 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:620 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:630 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:640 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:663 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:673 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:683 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:706 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:716 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:726 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:766 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:773 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:780 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:802 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:811 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:820 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:826 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:833 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:840 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:862 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:871 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:880 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:886 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:893 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:900 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:943 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:950 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:957 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:975 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:983 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:991 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:997 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1005 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1012 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1052 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1059 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1066 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1083 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1091 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1099 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1106 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1113 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1120 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1138 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1146 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1154 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1160 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1167 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1174 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1214 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1221 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1228 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1244 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1251 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1258 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1265 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1272 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1279 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1289 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1296 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1303 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1310 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1317 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1324 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1334 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1341 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1348 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1355 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1362 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1369 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1389 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1397 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1405 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1436 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1444 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1452 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:147 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
γ2:1483 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1491 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1499 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1526 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1534 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1542 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:157 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
γ2:1573 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1581 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1589 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1619 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1627 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1635 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:165 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
γ2:1660 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1668 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1676 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1699 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1707 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1715 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1738 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1746 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1754 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1768 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1775 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1782 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1789 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1796 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1803 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1817 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1824 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1831 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1837 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1844 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1851 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1885 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1892 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1899 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1912 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1919 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1926 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1933 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1940 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1947 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1957 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1964 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1971 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1978 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1984 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1990 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1996 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:2011 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:2044 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:209 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:2097 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:2120 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:2130 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:215 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:2153 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:2163 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:2184 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:2193 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:221 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:2214 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:2227 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:2236 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:2245 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:2253 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:2262 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:227 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:2271 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:2307 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:2315 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:2323 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:233 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:2330 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:2338 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:2346 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:2379 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:2387 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:239 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:2395 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:2402 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:2410 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:2418 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:2450 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:2457 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:2464 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:2470 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:2477 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:2484 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:2528 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:2551 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:2557 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:2563 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:2569 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:2575 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:2581 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:2587 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:2594 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:2625 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:2632 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:3282 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:3292 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:3302 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:3314 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:3324 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:3334 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:3346 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:3356 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:3366 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:3376 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:3384 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:3392 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:3402 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:3410 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:3418 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:3428 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:3436 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:3444 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:3456 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:3466 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:3476 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:3485 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:3494 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:3503 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:3511 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:3519 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:3527 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:3554 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:3561 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:3567 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:360 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:370 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:380 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:403 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:412 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:421 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:446 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:456 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:466 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:491 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:501 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:511 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:534 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:543 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:552 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:577 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:587 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:597 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:621 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:631 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:641 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:664 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:674 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:684 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:707 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:717 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:727 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:742 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:751 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:760 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:767 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:774 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:781 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:803 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:812 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:821 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:827 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:834 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:841 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:887 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:894 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:901 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:921 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:929 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:937 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:944 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:951 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:958 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:976 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:984 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:992 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:998 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1006 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1013 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1030 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1038 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1046 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1053 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1060 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1067 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1084 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1092 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1100 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1107 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1114 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1121 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1161 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1168 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1175 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1192 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1200 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1208 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1215 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1222 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1229 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1245 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1252 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1259 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1266 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1273 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1280 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1290 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1297 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1304 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1311 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1318 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1325 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1335 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1342 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1349 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1356 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1363 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1370 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1390 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1398 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1406 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1437 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1445 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1453 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:148 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
γ3:1484 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1492 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1500 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1527 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1535 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1543 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1574 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:158 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
γ3:1582 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1590 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1620 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1628 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1636 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:166 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
γ3:1661 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1669 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1677 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1700 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1708 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1716 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1739 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1747 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1755 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1769 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1776 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1783 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1790 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1797 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1804 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1838 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1845 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1852 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1865 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1872 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1879 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1886 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1893 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1900 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1913 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1920 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1927 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1934 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1941 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1948 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1958 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1965 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1972 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1979 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1985 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1991 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1997 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:2012 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:2076 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:2098 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:210 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:2109 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:2131 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:2142 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:216 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:2164 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:2174 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:2194 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:2204 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:222 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:2254 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:2263 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:2272 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:228 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:2281 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:2290 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:2299 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:2331 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:2339 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:234 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:2347 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:2355 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:2363 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:2371 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:240 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:2403 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:2411 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:2419 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:2427 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:2435 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:2443 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:2471 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:2478 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:2485 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:2492 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:2499 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:2506 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:2529 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:2552 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:2558 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:2564 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:2570 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:2576 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:2582 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:2588 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:2595 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:2626 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:2633 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:3283 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:3293 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:3303 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:3315 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:3325 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:3335 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:3347 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:3357 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:3367 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:3377 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:3385 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:3393 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:3403 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:3411 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:3419 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:3429 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:3437 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:3445 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:3457 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:3467 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:3477 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:3486 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:3495 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:3504 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:3512 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:3520 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:3528 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:3555 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:3562 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:3568 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:361 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:371 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:381 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:404 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:413 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:422 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:447 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:457 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:467 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:492 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:502 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:512 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:535 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:544 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:553 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:578 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:588 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:598 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:622 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:632 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:642 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:665 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:675 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:685 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:708 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:718 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:728 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:743 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:752 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:761 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:768 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:775 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:782 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:828 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:835 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:842 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:863 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:872 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:881 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:888 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:895 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:902 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:922 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:930 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:938 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:945 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:952 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:959 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:999 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1000 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1007 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1014 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1031 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1039 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1047 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1054 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1061 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1068 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1085 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1093 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1101 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1108 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1115 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1122 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1139 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1147 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1155 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1162 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1169 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1176 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1193 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1201 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1209 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1216 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1223 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1230 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1246 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1253 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1260 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1267 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1274 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1281 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1291 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1298 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1305 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1312 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1319 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1326 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1336 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1343 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1350 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1357 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1364 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1371 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1391 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1399 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1407 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1438 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1446 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1454 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1485 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:149 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
γ4:1493 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1501 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1528 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1536 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1544 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1575 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1583 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:159 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
γ4:1591 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1621 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1629 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1637 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1662 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:167 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
γ4:1670 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1678 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1701 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1709 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1717 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1740 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1748 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1756 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1770 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1777 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1784 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1791 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1798 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1805 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1818 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1825 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1832 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1839 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1846 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1853 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1866 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1873 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1880 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1887 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1894 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1901 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1914 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1921 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1928 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1935 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1942 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1949 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1959 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1966 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1973 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1980 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1986 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1992 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1998 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:2013 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:2045 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:2077 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:2099 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:211 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:2110 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:2121 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:2132 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:2143 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:2154 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:2165 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:217 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:2175 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:2185 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:2195 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:2205 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:2215 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:2228 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:223 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:2237 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:2246 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:2255 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:2264 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:2273 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:2282 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:229 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:2291 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:2300 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:2308 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:2316 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:2324 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:2332 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:2340 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:2348 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:235 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:2356 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:2364 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:2372 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:2380 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:2388 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:2396 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:2404 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:241 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:2412 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:2420 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:2428 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:2436 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:2444 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:2451 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:2458 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:2465 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:2472 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:2479 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:2486 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:2493 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:2500 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:2507 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:2530 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:2553 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:2559 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:2565 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:2571 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:2577 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:2583 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:2589 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:2596 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:2627 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:2634 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:3284 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:3294 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:3304 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:3316 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:3326 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:3336 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:3348 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:3358 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:3368 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:3378 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:3386 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:3394 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:3404 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:3412 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:3420 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:3430 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:3438 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:3446 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:3458 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:3468 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:3478 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:3487 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:3496 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:3505 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:3513 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:3521 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:3529 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:3556 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:3563 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:3569 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:362 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:372 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:382 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:405 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:414 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:423 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:448 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:458 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:468 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:493 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:503 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:513 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:536 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:545 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:554 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:579 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:589 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:599 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:623 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:633 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:643 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:666 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:676 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:686 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:709 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:719 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:729 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:744 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:753 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:762 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:769 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:776 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:783 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:804 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:813 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:822 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:829 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:836 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:843 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:864 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:873 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:882 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:889 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:896 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:903 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:923 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:931 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:939 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:946 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:953 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:960 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:977 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:985 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:993 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1001 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1008 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1015 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1032 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1040 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1048 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1055 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1062 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1069 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1086 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1094 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1102 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1109 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1116 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1123 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1140 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1148 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1156 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1163 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1170 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1177 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1194 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1202 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1210 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1217 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1224 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1231 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1247 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1254 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1261 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1268 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1275 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1282 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1292 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1299 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1306 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1313 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1320 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1327 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1337 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1344 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1351 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1358 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1365 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1372 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1392 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1400 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1408 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1439 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1447 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1455 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1486 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1494 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:150 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
γ5:1502 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1529 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1537 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1545 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1576 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1584 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1592 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:160 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
γ5:1622 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1630 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1638 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1663 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1671 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1679 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:168 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
γ5:1702 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1710 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1718 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1741 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1749 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1757 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1771 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1778 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1785 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1792 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1799 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1806 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1819 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1826 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1833 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1840 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1847 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1854 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1867 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1874 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1881 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1888 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1895 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1902 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1915 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1922 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1929 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1936 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1943 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1950 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1960 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1967 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1974 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1981 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1987 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1993 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1999 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:2014 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:2046 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:2078 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:2100 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:2111 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:212 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:2122 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:2133 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:2144 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:2155 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:2166 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:2176 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:218 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:2186 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:2196 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:2206 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:2216 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:2229 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:2238 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:224 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:2247 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:2256 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:2265 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:2274 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:2283 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:2292 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:230 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:2301 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:2309 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:2317 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:2325 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:2333 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:2341 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:2349 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:2357 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:236 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:2365 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:2373 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:2381 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:2389 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:2397 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:2405 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:2413 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:242 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:2421 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:2429 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:2437 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:2445 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:2452 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:2459 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:2466 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:2473 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:2480 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:2487 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:2494 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:2501 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:2508 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:2531 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:2554 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:2560 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:2566 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:2572 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:2578 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:2584 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:2590 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:2597 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:2628 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:2635 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:3285 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:3295 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:3305 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:3317 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:3327 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:3337 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:3349 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:3359 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:3369 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:3379 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:3387 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:3395 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:3405 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:3413 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:3421 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:3431 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:3439 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:3447 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:3459 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:3469 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:3479 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:3488 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:3497 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:3506 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:3514 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:3522 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:3530 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:3557 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:3564 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:3570 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:363 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:373 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:383 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:406 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:415 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:424 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:449 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:459 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:469 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:494 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:504 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:514 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:537 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:546 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:555 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:580 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:590 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:600 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:624 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:634 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:644 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:667 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:677 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:687 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:710 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:720 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:730 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:745 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:754 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:763 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:770 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:777 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:784 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:805 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:814 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:823 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:830 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:837 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:844 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:865 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:874 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:883 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:890 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:897 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:904 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:924 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:932 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:940 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:947 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:954 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:961 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:978 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:986 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:994 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1002 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1009 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1016 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1033 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1041 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1049 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1056 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1063 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1070 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1087 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1095 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1103 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1110 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1117 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1124 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1141 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1149 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1157 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1164 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1171 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1178 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1195 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1203 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1211 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1218 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1225 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1232 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1248 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1255 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1262 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1269 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1276 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1283 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1293 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1300 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1307 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1314 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1321 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1328 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1338 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1345 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1352 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1359 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1366 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1373 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1393 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1401 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1409 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1440 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1448 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1456 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1487 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1495 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1503 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:151 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
γ6:1530 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1538 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1546 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1577 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1585 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1593 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:161 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
γ6:1623 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1631 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1639 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1664 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1672 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1680 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:169 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
γ6:1703 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1711 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1719 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1742 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1750 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1758 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1772 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1779 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1786 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1793 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1800 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1807 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1820 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1827 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1834 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1841 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1848 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1855 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1868 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1875 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1882 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1889 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1896 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1903 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1916 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1923 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1930 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1937 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1944 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1951 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1961 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1968 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1975 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1982 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1988 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1994 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:2000 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:2015 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:2047 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:2079 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:2101 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:2112 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:2123 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:213 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:2134 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:2145 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:2156 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:2167 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:2177 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:2187 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:219 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:2197 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:2207 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:2217 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:2230 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:2239 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:2248 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:225 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:2257 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:2266 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:2275 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:2284 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:2293 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:2302 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:231 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:2310 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:2318 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:2326 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:2334 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:2342 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:2350 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:2358 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:2366 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:237 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:2374 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:2382 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:2390 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:2398 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:2406 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:2414 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:2422 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:243 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:2430 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:2438 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:2446 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:2453 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:2460 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:2467 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:2474 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:2481 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:2488 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:2495 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:2502 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:2509 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:2532 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:2555 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:2561 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:2567 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:2573 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:2579 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:2585 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:2591 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:2598 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:2629 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:2636 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:3286 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:3296 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:3306 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:3318 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:3328 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:3338 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:3350 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:3360 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:3370 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:3380 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:3388 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:3396 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:3406 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:3414 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:3422 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:3432 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:3440 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:3448 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:3460 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:3470 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:3480 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:3489 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:3498 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:3507 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:3515 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:3523 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:3531 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:3558 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:3565 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:3571 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:364 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:374 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:384 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:407 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:416 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:425 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:450 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:460 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:470 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:495 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:505 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:515 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:538 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:547 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:556 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:581 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:591 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:601 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:625 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:635 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:645 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:668 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:678 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:688 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:711 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:721 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:731 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:746 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:755 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:764 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:771 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:778 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:785 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:806 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:815 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:824 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:831 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:838 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:845 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:866 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:875 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:884 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:891 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:898 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:905 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:925 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:933 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:941 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:948 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:955 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:962 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:979 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:987 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:995 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ:2533 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ:2536 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ:2538 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ:3229 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
δ:21 [binder, in Undecidability.Shared.Libs.DLW.Code.subcode]
ε:21 [binder, in Complexity.Complexity.ONotationIsAppropriate]
η:2534 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
ρ:20 [binder, in Undecidability.Shared.Libs.DLW.Code.subcode]
σ1:114 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
σ1:1429 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ1:1458 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ1:1566 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ1:1595 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ1:172 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ1:178 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ1:180 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ1:183 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ1:187 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ1:189 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ1:192 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ1:2803 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ1:2805 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ1:2806 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ1:2811 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ1:2814 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ1:2817 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ1:2820 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ1:2821 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ1:2823 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ1:2825 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ1:2826 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ1:295 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ2:115 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
σ2:1430 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ2:1459 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ2:1567 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ2:1596 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ2:173 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ2:181 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ2:184 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ2:190 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ2:193 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ2:2807 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ2:2812 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ2:2815 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ2:2818 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ2:2824 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ2:2827 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ3:116 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
σ3:174 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ3:185 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ3:194 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ3:2813 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ4:117 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
σ4:175 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ5:118 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
σ6:119 [binder, in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
σ:100 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ:1383 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ:1411 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ:1424 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ:1462 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ:1477 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ:1506 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ:1521 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ:1549 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ:156 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ:1561 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ:1599 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ:1614 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ:1642 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ:1690 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ:1722 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ:1729 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ:1761 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ:2102 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ:2113 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ:2124 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ:2135 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ:2146 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ:2157 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ:263 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ:267 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ:271 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ:276 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ:2798 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ:2801 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ:2809 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ:281 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ:2829 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ:2830 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ:2833 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ:2860 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ:2871 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ:288 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ:2881 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ:2894 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ:3028 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ:303 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ:3453 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ:3463 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ:3473 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ:3482 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ:3491 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ:3500 [binder, in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ:740 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
σ:750 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
σ:751 [binder, in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]

---

Notation Index

A

_ =2 _ [in Undecidability.L.Prelim.ARS]
_ <=2 _ [in Undecidability.L.Prelim.ARS]
_ =1 _ [in Undecidability.L.Prelim.ARS]
_ <=1 _ [in Undecidability.L.Prelim.ARS]

B

_ div _ [in Undecidability.Shared.Libs.DLW.Utils.gcd]
∑ [in Undecidability.Shared.Libs.DLW.Utils.sums]
_ ⊗ _ [in Undecidability.Shared.Libs.DLW.Utils.sums]
_ ⊕ _ [in Undecidability.Shared.Libs.DLW.Utils.sums]
_ <d _ [in Undecidability.Shared.Libs.DLW.Utils.binomial]

C

_ ⋈ _ [in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
_ /Y/ _ ↓ [in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
_ /Y/ _ ~~> _ [in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
_ /Y/ _ ->> _ [in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
_ /Y/ _ -+> _ [in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
_ /Y/ _ -[ _ ]-> _ [in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
_ /Y/ _ -1> _ [in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
_ /X/ _ ↓ [in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
_ /X/ _ ~~> _ [in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
_ /X/ _ ->> _ [in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
_ /X/ _ -+> _ [in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
_ /X/ _ -[ _ ]-> _ [in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
_ /X/ _ -1> _ [in Undecidability.Shared.Libs.DLW.Code.compiler_correction]

D

_ div _ [in Undecidability.Shared.Libs.DLW.Utils.gcd]

E

⟨ _ , _ ⟩ [in Undecidability.Shared.embed_nat]
_ ≈ _ [in Undecidability.Shared.Libs.DLW.Utils.quotient]

F

_ <<= _ [in Undecidability.Shared.FilterFacts]
_ el _ [in Undecidability.Shared.FilterFacts]
_ ⇝ _ [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
_ ⇝{ _ } _ (cc_scope) [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
_ ≃c _ (cc_scope) [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
_ ≃c ( _ , _ , _ ) (cc_scope) [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
|_| (cc_scope) [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
↑ _ (polscope) [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
↓ _ (polscope) [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
∘ _ (polscope) [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
_ $ _ [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
_ ⇝( _ ) _ [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
_ ▷(≤ _ ) _ [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
_ ▷( _ ) _ [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
_ ≻( _ ) _ [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
_ ⇝ _ [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
_ ≻ _ [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
_ ≃t( _ , _ ) _ [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
_ ≃t( _ ) _ [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
_ ≃t _ [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
! _ [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
# [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
% _ [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
~ _ [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
_ ≃( ; _ ) _ [in Undecidability.TM.Code.CodeTM]
_ ≂( _ ; _ ) _ [in Undecidability.TM.Code.CodeTM]
_ ≂ _ [in Undecidability.TM.Code.CodeTM]
_ ≂( _ ) _ [in Undecidability.TM.Code.CodeTM]
_ ≃( ; _ ) _ [in Undecidability.TM.Code.CodeTM]
_ ≃( _ ; _ ) _ [in Undecidability.TM.Code.CodeTM]
_ ≃ _ [in Undecidability.TM.Code.CodeTM]
_ ≃( _ ) _ [in Undecidability.TM.Code.CodeTM]
_ ^+ (type_scope) [in Undecidability.TM.Code.CodeTM]
V _ [in Undecidability.TM.Util.Relations]

G

_ div _ [in Undecidability.Shared.Libs.DLW.Utils.gcd]

H

λ _ .. _ , _ [in Undecidability.L.Util.L_facts]
[ L_HOAS _ ] [in Undecidability.L.Util.L_facts]
!! _ [in Undecidability.L.Util.L_facts]

L

_ ≻lm _ [in Undecidability.L.Complexity.ResourceMeasures]
_ <<= _ [in Undecidability.Shared.ListAutomation]
_ el _ [in Undecidability.Shared.ListAutomation]
( _ × _ × .. × _ ) [in Undecidability.Shared.ListAutomation]
[ _ | _ ∈ _ ] [in Undecidability.Shared.ListAutomation]
[ _ | _ ∈ _ , _ ] [in Undecidability.Shared.ListAutomation]

M

f' [in Undecidability.TM.Code.ChangeAlphabet]
g' [in Undecidability.TM.Code.ChangeAlphabet]
_ ⊕ _ [in Undecidability.Shared.Libs.DLW.Utils.sums]
∑ [in Undecidability.Shared.Libs.DLW.Utils.sums]

N

∑ [in Undecidability.Shared.Libs.DLW.Utils.sums]

P

_ <d _ [in Undecidability.Shared.Libs.DLW.Utils.prime]

R

_ ⪯ₘ _ (reduction_chain) [in Undecidability.Synthetic.ReducibilityFacts]
⎩ _ ⎭ [in Undecidability.Synthetic.ReducibilityFacts]
_ ^+ (type_scope) [in Undecidability.TM.Hoare.HoareRegister]
∑ [in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
∑ [in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
_ <<= _ [in Complexity.Libs.Pigeonhole]

S

_ ⊨c( _ ) _ [in Undecidability.TM.Util.TM_facts]
_ ↓ _ [in Undecidability.TM.Util.TM_facts]
_ ⊨ _ [in Undecidability.TM.Util.TM_facts]
_ ⊆ _ [in Undecidability.Shared.Libs.DLW.Utils.seteq]
_ ≡ _ [in Undecidability.Shared.Libs.DLW.Utils.seteq]
_ // _ -]] _ [in Undecidability.Shared.Libs.DLW.Code.sss]
_ // _ ↓ [in Undecidability.Shared.Libs.DLW.Code.sss]
_ // _ ~~> _ [in Undecidability.Shared.Libs.DLW.Code.sss]
_ // _ ->> _ [in Undecidability.Shared.Libs.DLW.Code.sss]
_ // _ -+> _ [in Undecidability.Shared.Libs.DLW.Code.sss]
_ // _ -[ _ ]-> _ [in Undecidability.Shared.Libs.DLW.Code.sss]
_ // _ :1> _ [in Undecidability.Shared.Libs.DLW.Code.sss]
_ ⟬ _ ⦒ _ [in Undecidability.Shared.Libs.DLW.Code.sss]
_ // _ -1> _ [in Undecidability.Shared.Libs.DLW.Code.sss]
_ <sc _ [in Undecidability.Shared.Libs.DLW.Code.subcode]
_ subs _ [in Complexity.Libs.CookPrelim.MorePrelim]
Mf _ [in Undecidability.TM.Combinators.Switch]
p2 _ [in Undecidability.TM.Combinators.Switch]

T

_ ▷(≤ _ ) _ [in Complexity.NP.SAT.CookLevin.Subproblems.TM_single]
_ ▷( _ ) _ [in Complexity.NP.SAT.CookLevin.Subproblems.TM_single]
_ ≻( _ ) _ [in Complexity.NP.SAT.CookLevin.Subproblems.TM_single]
_ ≻ _ [in Complexity.NP.SAT.CookLevin.Subproblems.TM_single]
_ ≃ _ [in Undecidability.TM.Single.StepTM]

U

castState _ [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
ContainsState_size _ _ [in Undecidability.TM.Univ.Univ]
ContainsState _ [in Undecidability.TM.Univ.Univ]
ContainsTrans_size _ _ [in Undecidability.TM.Univ.Univ]
ContainsTrans _ [in Undecidability.TM.Univ.Univ]

V

_ [@ _ ] (vector_scope) [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
[ | _ ; _ ; .. ; _ | ] (vector_scope) [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
[ | _ | ] (vector_scope) [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
_ ::: _ (vector_scope) [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
[ | | ] (vector_scope) [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]

other

_ / _ (cc_scope) [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
{ _ , _ , _ } (cc_scope) [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
_ >[( _ )] _ (LClos) [in Undecidability.L.Tactics.LClos]
_ ~~ _ (positive_scope) [in Undecidability.TM.Code.BinNumbers.PosDefinitions]
SpecFalse (spec_scope) [in Undecidability.TM.Hoare.HoareRegister]
_ ^+ (type_scope) [in Undecidability.TM.Code.CodeTM]
_ nel _ [in Complexity.Libs.Pigeonhole]
_ ∈o _ [in Complexity.Complexity.ONotation]
_ ∈O _ [in Complexity.Complexity.ONotation]
_ ⇓(<= _ ) _ [in Undecidability.L.Util.L_facts]
_ >(<= _ ) _ [in Undecidability.L.Util.L_facts]
_ ⇓( _ ) _ [in Undecidability.L.Util.L_facts]
_ ⇓ _ [in Undecidability.L.Util.L_facts]
_ == _ [in Undecidability.L.Util.L_facts]
_ >* _ [in Undecidability.L.Util.L_facts]
_ >( _ ) _ [in Undecidability.L.Util.L_facts]
_ ≻ _ [in Undecidability.L.Util.L_facts]
_ [ _ / _ ] [in Undecidability.Shared.Libs.DLW.Vec.vec]
_ #> _ [in Undecidability.Shared.Libs.DLW.Vec.vec]
_ ## _ [in Undecidability.Shared.Libs.DLW.Vec.vec]
_ .[ _ ] [in Undecidability.L.Computability.Enum]
_ <p _ [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
_ ~p _ [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
_ ⇓ _ _ [in Undecidability.L.Computability.Seval]
_ ⇡ _ [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
_ ⇣ _ [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
_ ⊕ _ [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
_ ↑ _ [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
_ ↓ _ [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
_ ⟂ _ [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
_ ≂ _ [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
_ ⪯ _ [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
_ ⪦ _ [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
_ ≲ _ [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
_ ≲ _ [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
_ .[ _ ] [in Undecidability.Shared.Libs.PSL.Lists.Position]
_ === _ [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
_ <<= _ [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
_ el _ [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
_ >> _ [in Undecidability.TM.Util.Prelim]
_ ↑ _ [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
_ ↓ _ [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
_ ⟂ _ [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
_ ≂ _ [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
_ ⪯ _ [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
_ ⪦ _ [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
_ <=c _ [in Undecidability.L.Complexity.UpToC]
_ @>> _ [in Undecidability.TM.Code.CodeTM]
_ @> _ [in Undecidability.TM.Code.CodeTM]
_ >>> _ [in Undecidability.TM.Code.CodeTM]
_ ≂( ; _ ) _ [in Undecidability.TM.Code.CodeTM]
_ ≂( _ ; _ ) _ [in Undecidability.TM.Code.CodeTM]
_ ≂ _ [in Undecidability.TM.Code.CodeTM]
_ ≂( _ ) _ [in Undecidability.TM.Code.CodeTM]
_ ≃( ; _ ) _ [in Undecidability.TM.Code.CodeTM]
_ ≃( _ ; _ ) _ [in Undecidability.TM.Code.CodeTM]
_ ≃ _ [in Undecidability.TM.Code.CodeTM]
_ ≃( _ ) _ [in Undecidability.TM.Code.CodeTM]
_ ~p _ [in Undecidability.Shared.Libs.DLW.Utils.php]
_ ∨ _ [in Complexity.NP.SAT.FSAT.FSAT]
_ ∧ _ [in Complexity.NP.SAT.FSAT.FSAT]
_ ≃≃ _ [in Undecidability.TM.Hoare.HoareRegister]
_ ⪯ _ [in Undecidability.Synthetic.Definitions]
_ ||_ _ [in Undecidability.TM.Util.Relations]
_ |_ _ [in Undecidability.TM.Util.Relations]
_ =2 _ [in Undecidability.TM.Util.Relations]
_ <<=2 _ [in Undecidability.TM.Util.Relations]
_ ⊂ _ [in Undecidability.TM.Util.Relations]
_ ∩ _ [in Undecidability.TM.Util.Relations]
_ ∪ _ [in Undecidability.TM.Util.Relations]
_ ∘ _ [in Undecidability.TM.Util.Relations]
_ ⪯ᵢ _ [in Undecidability.Synthetic.InformativeDefinitions]
_ ⇑ _ [in Undecidability.TM.Code.ChangeAlphabet]
_ $ _ [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
_ @ _ [in Undecidability.TM.Lifting.LiftTapes]
_ === _ [in Undecidability.Shared.ListAutomation]
_ ;; _ [in Undecidability.TM.Combinators.SequentialComposition]
_ ↓ _ [in Undecidability.TM.Util.TM_facts]
_ ⊨c( _ ) _ [in Undecidability.TM.Util.TM_facts]
_ ⊨ _ [in Undecidability.TM.Util.TM_facts]
_ ∈Timeo _ [in Complexity.Complexity.Definitions]
_ ∈TimeO _ [in Complexity.Complexity.Definitions]
_ ⊆ _ [in Undecidability.Shared.Libs.DLW.Utils.seteq]
_ ≡ _ [in Undecidability.Shared.Libs.DLW.Utils.seteq]
_ ~p _ [in Undecidability.Shared.Libs.DLW.Utils.seteq]
_ <sc _ [in Undecidability.Shared.Libs.DLW.Code.subcode]
_ ~> _ [in Undecidability.L.Tactics.Computable]
_ ⪯p _ [in Complexity.Complexity.NP]
_ >>= _ [in Complexity.Libs.CookPrelim.MorePrelim]
_ <=( _ ) _ [in Complexity.TM.PrettyBounds.PrettyBounds]
computableTime' _ [in Undecidability.L.Tactics.ComputableTime]
do _ <- _ ; _ [in Complexity.Libs.CookPrelim.MorePrelim]
eq_dec _ [in Undecidability.Shared.Libs.PSL.EqDec]
eq_dec _ [in Undecidability.Shared.Dec]
Fin0 [in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin1 [in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin10 [in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin11 [in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin12 [in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin13 [in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin14 [in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin15 [in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin16 [in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin17 [in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin18 [in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin19 [in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin2 [in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin20 [in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin21 [in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin22 [in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin23 [in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin24 [in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin25 [in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin26 [in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin27 [in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin28 [in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin29 [in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin3 [in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin30 [in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin31 [in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin32 [in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin33 [in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin34 [in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin35 [in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin36 [in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin37 [in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin38 [in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin39 [in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin4 [in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin40 [in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin41 [in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin42 [in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin43 [in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin44 [in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin45 [in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin46 [in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin47 [in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin48 [in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin49 [in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin5 [in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin50 [in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin51 [in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin52 [in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin53 [in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin54 [in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin55 [in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin56 [in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin57 [in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin58 [in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin59 [in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin6 [in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin60 [in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin61 [in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin62 [in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin63 [in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin64 [in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin65 [in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin66 [in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin67 [in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin68 [in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin69 [in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin7 [in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin70 [in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin71 [in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin72 [in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin73 [in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin74 [in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin75 [in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin76 [in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin77 [in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin78 [in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin79 [in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin8 [in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin80 [in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin81 [in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin82 [in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin83 [in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin84 [in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin85 [in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin86 [in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin87 [in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin88 [in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin89 [in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin9 [in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin90 [in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin91 [in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin92 [in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin93 [in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin94 [in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin95 [in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin96 [in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin97 [in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin98 [in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
Fin99 [in Undecidability.Shared.Libs.PSL.Vectors.FinNotation]
if! _ is _ then _ else _ [in Undecidability.Synthetic.EnumerabilityFacts]
Subtype _ [in Undecidability.Shared.Libs.PSL.FiniteTypes.Arbitrary]
! _ [in Undecidability.L.Tactics.Computable]
# _ [in Undecidability.L.Util.L_facts]
( _ ; _ ) [in Undecidability.TM.Util.TM_facts]
| _ | [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
¬ _ [in Complexity.NP.SAT.FSAT.FSAT]
↑ _ [in Undecidability.L.Tactics.Extract]
⇧ [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
∑ [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
∑ [in Undecidability.Shared.Libs.DLW.Utils.sorting]
∑ [in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
≃( _ ; _ ) _ [in Undecidability.TM.Hoare.HoareRegister]
≃( _ ) _ [in Undecidability.TM.Hoare.HoareRegister]
≃≃( _ , _ ) [in Undecidability.TM.Hoare.HoareRegister]
≃≃( _ ) [in Undecidability.TM.Hoare.HoareRegister]
⋀ [ _ , .. , _ , _ ] [in Complexity.NP.SAT.FSAT.FSAT]
⋁ [ _ , .. , _ , _ ] [in Complexity.NP.SAT.FSAT.FSAT]
⋂_ _ _ [in Undecidability.TM.Util.Relations]
⋃_ _ _ [in Undecidability.TM.Util.Relations]
⟘ [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
⟘ [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
⟙ [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
⟙ [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
⟦ _ ⟧ [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
⟬ _ ⟭ [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]

---

Binder Index

A

aa:57 [in Undecidability.Shared.Libs.DLW.Utils.php]
aa:79 [in Undecidability.Shared.Libs.DLW.Utils.php]
acc':14 [in Undecidability.Shared.Libs.DLW.Utils.utils_string]
acc':8 [in Undecidability.Shared.Libs.DLW.Utils.utils_string]
acc:11 [in Undecidability.L.TM.TapeFuns]
acc:12 [in Undecidability.Shared.Libs.DLW.Utils.utils_string]
acc:124 [in Complexity.Libs.CookPrelim.PolyBounds]
acc:126 [in Complexity.Libs.CookPrelim.PolyBounds]
acc:129 [in Complexity.Libs.CookPrelim.PolyBounds]
acc:16 [in Complexity.L.TM.TMflatten]
acc:17 [in Undecidability.L.TM.TapeFuns]
acc:19 [in Undecidability.L.TM.TapeFuns]
acc:20 [in Undecidability.L.Datatypes.List.List_fold]
acc:218 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
acc:22 [in Complexity.L.TM.TMflatten]
acc:220 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
acc:228 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
acc:234 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
acc:26 [in Complexity.L.TM.TMflatten]
acc:26 [in Undecidability.L.Datatypes.List.List_fold]
acc:3097 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
acc:34 [in Undecidability.L.Datatypes.List.List_fold]
acc:39 [in Undecidability.L.Datatypes.List.List_fold]
acc:55 [in Undecidability.L.Datatypes.List.List_basics]
acc:55 [in Complexity.Libs.CookPrelim.PolyBounds]
acc:58 [in Complexity.NP.SAT.SAT_inNP]
acc:6 [in Undecidability.Shared.Libs.DLW.Utils.utils_string]
acc:60 [in Undecidability.L.Datatypes.List.List_basics]
acc:61 [in Complexity.NP.SAT.SAT_inNP]
acc:62 [in Undecidability.L.Datatypes.List.List_basics]
acc:7 [in Undecidability.L.TM.TapeFuns]
actions:262 [in Undecidability.TM.Util.TM_facts]
actions:45 [in Complexity.L.TM.TMflatFun]
actions:52 [in Undecidability.TM.Util.TM_facts]
actions:8 [in Undecidability.L.TM.TMinL.TMinL_extract]
acts:119 [in Complexity.TM.PrettyBounds.M2MBounds]
acts:127 [in Complexity.TM.PrettyBounds.M2MBounds]
acts:133 [in Undecidability.TM.Univ.LowLevel]
acts:135 [in Complexity.TM.PrettyBounds.M2MBounds]
acts:142 [in Complexity.TM.PrettyBounds.M2MBounds]
acts:146 [in Complexity.TM.PrettyBounds.M2MBounds]
acts:150 [in Complexity.TM.PrettyBounds.M2MBounds]
acts:150 [in Undecidability.TM.Univ.LowLevel]
acts:159 [in Complexity.TM.PrettyBounds.M2MBounds]
acts:169 [in Complexity.TM.PrettyBounds.M2MBounds]
acts:18 [in Undecidability.TM.Combinators.Mirror]
acts:197 [in Complexity.TM.PrettyBounds.M2MBounds]
acts:204 [in Complexity.TM.PrettyBounds.M2MBounds]
acts:211 [in Complexity.TM.PrettyBounds.M2MBounds]
acts:219 [in Complexity.TM.PrettyBounds.M2MBounds]
acts:226 [in Complexity.TM.PrettyBounds.M2MBounds]
acts:234 [in Complexity.TM.PrettyBounds.M2MBounds]
acts:242 [in Complexity.TM.PrettyBounds.M2MBounds]
acts:275 [in Complexity.TM.PrettyBounds.M2MBounds]
acts:38 [in Undecidability.TM.Univ.Univ]
acts:39 [in Complexity.L.TM.TMflatFun]
acts:4 [in Undecidability.TM.Combinators.Mirror]
acts:492 [in Undecidability.TM.Single.StepTM]
acts:498 [in Undecidability.TM.Single.StepTM]
act:102 [in Complexity.TM.PrettyBounds.M2MBounds]
act:107 [in Complexity.TM.PrettyBounds.M2MBounds]
act:107 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
act:112 [in Complexity.TM.PrettyBounds.M2MBounds]
act:112 [in Undecidability.TM.Lifting.LiftTapes]
act:115 [in Complexity.TM.PrettyBounds.M2MBounds]
act:116 [in Undecidability.TM.Lifting.LiftTapes]
act:129 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
act:13 [in Complexity.NP.SAT.CookLevin.Subproblems.TM_single]
act:130 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
act:142 [in Undecidability.TM.Univ.LowLevel]
act:16 [in Undecidability.TM.Combinators.Mirror]
act:162 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
act:172 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
act:194 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
act:2 [in Undecidability.TM.Hoare.HoareStdLib]
act:25 [in Undecidability.TM.Univ.Univ]
act:258 [in Complexity.TM.PrettyBounds.M2MBounds]
act:293 [in Complexity.TM.PrettyBounds.M2MBounds]
act:297 [in Complexity.TM.PrettyBounds.M2MBounds]
act:47 [in Undecidability.TM.Lifting.LiftAlphabet]
act:472 [in Undecidability.TM.Single.StepTM]
act:50 [in Undecidability.TM.Lifting.LiftAlphabet]
act:656 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
act:660 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
act:68 [in Complexity.L.TM.TMflatten]
act:9 [in Undecidability.TM.Combinators.Mirror]
act:90 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
act:96 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
ac:7 [in Complexity.NP.SAT.CookLevin.Subproblems.TM_single]
Afin:3143 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Aflat:3147 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
akk:13 [in Complexity.L.AbstractMachines.FunctionalDefinitions]
akk:20 [in Complexity.L.AbstractMachines.FunctionalDefinitions]
akk:27 [in Complexity.L.AbstractMachines.FunctionalDefinitions]
akk:44 [in Complexity.L.AbstractMachines.FunctionalDefinitions]
akk:6 [in Complexity.L.AbstractMachines.FunctionalDefinitions]
allenv:3120 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
allEnv:3174 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
allEnv:3192 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
allEnv:380 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
allEnv:383 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
alpha:11 [in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
alpha:14 [in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
alpha:15 [in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisStep]
alpha:17 [in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
alpha:18 [in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisStep]
alpha:2 [in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisUnfoldClos]
alpha:2 [in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisStep]
alpha:3 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
alpha:4 [in Complexity.L.AbstractMachines.Computable.Lookup]
alpha:4 [in Complexity.L.AbstractMachines.AbstractHeapMachine]
alpha:7 [in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
alpha:8 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
alpha:97 [in Complexity.L.AbstractMachines.AbstractHeapMachine]
Apprec:54 [in Undecidability.L.Complexity.GenericNary]
Apprec:58 [in Undecidability.L.Complexity.GenericNary]
args:100 [in Undecidability.L.Tactics.Extract]
args:132 [in Undecidability.L.Tactics.Extract]
args:137 [in Undecidability.L.Tactics.Extract]
args:23 [in Undecidability.L.Tactics.GenEncode]
args:39 [in Undecidability.L.Tactics.GenEncode]
aT:5 [in Undecidability.L.Datatypes.List.List_enc]
AT:7 [in Undecidability.L.Datatypes.List.List_enc]
aT:72 [in Complexity.NP.TM.LM_to_mTM]
AT:74 [in Complexity.NP.TM.LM_to_mTM]
A_int:67 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
A_j:111 [in Undecidability.L.Tactics.Extract]
A_j:8 [in Undecidability.L.Tactics.GenEncode]
a':105 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
A':111 [in Undecidability.Shared.Libs.PSL.Retracts]
a':112 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
a':118 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
a':125 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
A':126 [in Undecidability.Shared.Libs.PSL.Retracts]
a':131 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
a':138 [in Complexity.Libs.CookPrelim.FlatFinTypes]
a':138 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
a':139 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
a':139 [in Complexity.Libs.CookPrelim.FlatFinTypes]
a':140 [in Complexity.Libs.CookPrelim.FlatFinTypes]
a':144 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
A':144 [in Undecidability.Shared.Libs.PSL.Retracts]
a':152 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
a':155 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
a':169 [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
a':203 [in Undecidability.L.Tactics.Extract]
a':207 [in Undecidability.L.Tactics.Extract]
a':23 [in Complexity.L.AbstractMachines.AbstractHeapMachine]
a':230 [in Undecidability.L.Tactics.Extract]
A':26 [in Undecidability.L.Tactics.Extract]
A':2664 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
A':2683 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a':2685 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
A':2704 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a':2707 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a':31 [in Complexity.L.AbstractMachines.AbstractHeapMachine]
a':34 [in Undecidability.Shared.Libs.PSL.FiniteTypes.FiniteFunction]
a':365 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
a':3653 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a':3667 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a':3674 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a':40 [in Undecidability.TM.Util.Prelim]
a':41 [in Undecidability.L.Functions.FinTypeLookup]
a':44 [in Undecidability.TM.Util.Prelim]
a':52 [in Undecidability.L.Functions.FinTypeLookup]
a':58 [in Complexity.L.TM.TMunflatten]
a':6 [in Complexity.NP.SAT.SharedSAT]
a':77 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
a':9 [in Complexity.NP.SAT.SharedSAT]
A':90 [in Undecidability.Shared.Libs.PSL.Retracts]
a':90 [in Complexity.L.TM.TMunflatten]
a':91 [in Complexity.Libs.CookPrelim.MorePrelim]
A':99 [in Undecidability.Shared.Libs.PSL.Retracts]
a':99 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
A0:6 [in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
a1:107 [in Complexity.Libs.CookPrelim.MorePrelim]
a1:15 [in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
A1:20 [in Undecidability.Shared.Libs.PSL.Lists.Dupfree]
a1:21 [in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
A1:21 [in Undecidability.Shared.Libs.PSL.Lists.Dupfree]
A1:26 [in Complexity.Libs.Pigeonhole]
A1:29 [in Complexity.Libs.Pigeonhole]
a1:3 [in Undecidability.TM.Code.CasePair]
A1:3 [in Complexity.NP.SAT.CookLevin.Reductions.CC_to_BinaryCC]
a1:3 [in Undecidability.TM.Code.List.App]
a1:30 [in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
a1:36 [in Complexity.Complexity.SpaceBoundsTime]
A1:38 [in Complexity.Complexity.SpaceBoundsTime]
a1:39 [in Complexity.NP.SAT.SAT]
A1:4 [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
A1:40 [in Undecidability.Shared.Libs.PSL.Lists.Dupfree]
a1:42 [in Complexity.NP.SAT.SAT]
a1:45 [in Complexity.NP.SAT.SAT]
a1:53 [in Undecidability.TM.Util.Prelim]
a1:57 [in Undecidability.TM.Util.Prelim]
A1:7 [in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
A1:7 [in Undecidability.Shared.Libs.DLW.Wf.acc_irr]
a1:79 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
a1:99 [in Undecidability.TM.Lifting.LiftTapes]
a2:100 [in Undecidability.TM.Lifting.LiftTapes]
a2:108 [in Complexity.Libs.CookPrelim.MorePrelim]
a2:16 [in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
a2:22 [in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
A2:22 [in Undecidability.Shared.Libs.PSL.Lists.Dupfree]
A2:27 [in Complexity.Libs.Pigeonhole]
A2:31 [in Complexity.Libs.Pigeonhole]
a2:31 [in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
a2:37 [in Complexity.Complexity.SpaceBoundsTime]
A2:39 [in Complexity.Complexity.SpaceBoundsTime]
a2:4 [in Undecidability.TM.Code.CasePair]
a2:4 [in Undecidability.TM.Code.List.App]
a2:40 [in Complexity.NP.SAT.SAT]
A2:41 [in Undecidability.Shared.Libs.PSL.Lists.Dupfree]
a2:43 [in Complexity.NP.SAT.SAT]
a2:46 [in Complexity.NP.SAT.SAT]
a2:54 [in Undecidability.TM.Util.Prelim]
a2:60 [in Undecidability.TM.Util.Prelim]
A2:8 [in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
A2:8 [in Undecidability.Shared.Libs.DLW.Wf.acc_irr]
a2:80 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
A3:32 [in Complexity.Libs.Pigeonhole]
A3:42 [in Undecidability.Shared.Libs.PSL.Lists.Dupfree]
a3:55 [in Undecidability.TM.Util.Prelim]
a3:58 [in Undecidability.TM.Util.Prelim]
a:1 [in Undecidability.TM.Code.BinNumbers.PosMultTM]
A:1 [in Complexity.L.Datatypes.LDepPair]
A:1 [in Undecidability.L.Computability.Enum]
a:1 [in Complexity.NP.SAT.SharedSAT]
a:1 [in Undecidability.TM.PrettyBounds.SizeBounds]
A:1 [in Complexity.L.AbstractMachines.Computable.Shared]
A:1 [in Complexity.TM.Single.EncodeTapesInvariants]
A:1 [in Undecidability.L.Prelim.MoreBase]
A:1 [in Complexity.L.TM.CompCode]
A:1 [in Undecidability.L.Datatypes.List.List_extra]
A:1 [in Complexity.L.TM.TMunflatten]
a:1 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
a:1 [in Complexity.Libs.CookPrelim.Tactics]
A:1 [in Undecidability.TM.Hoare.HoareTacticsView]
A:1 [in Undecidability.L.Functions.EnumInt]
a:1 [in Undecidability.TM.Hoare.HoareMult]
A:1 [in Undecidability.L.Computability.Synthetic]
a:1 [in Complexity.NP.SAT.SAT]
A:1 [in Undecidability.TM.Code.CasePair]
a:1 [in Undecidability.TM.Code.BinNumbers.PosAddTM]
A:1 [in Undecidability.TM.Code.List.App]
A:1 [in Undecidability.Shared.Libs.PSL.FiniteTypes.FiniteFunction]
A:10 [in Undecidability.Shared.Libs.PSL.Lists.Removal]
A:10 [in Undecidability.L.Complexity.UpToCNary]
A:10 [in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
a:10 [in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisUnfoldClos]
A:10 [in Undecidability.Shared.Libs.PSL.Lists.Position]
A:10 [in Undecidability.Shared.Libs.PSL.Inhabited]
a:10 [in Complexity.L.AbstractMachines.UnfoldHeap]
A:10 [in Undecidability.L.Datatypes.List.List_nat]
a:10 [in Complexity.L.AbstractMachines.AbstractHeapMachine]
A:10 [in Undecidability.Shared.Libs.PSL.Lists.Cardinality]
a:10 [in Undecidability.TM.Hoare.HoareMult]
A:10 [in Undecidability.L.Prelim.MoreList]
a:100 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
a:1006 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
a:1009 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
A:101 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
a:101 [in Complexity.Libs.CookPrelim.PolyBounds]
a:101 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
a:101 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:1019 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
a:102 [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
a:102 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
a:102 [in Complexity.L.AbstractMachines.AbstractHeapMachine]
a:102 [in Undecidability.TM.L.HeapInterpreter.LookupTM]
a:103 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
A:103 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
a:104 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
a:104 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
a:104 [in Complexity.Libs.CookPrelim.MorePrelim]
a:1042 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
a:1044 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
a:105 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
A:105 [in Complexity.L.TM.CompCode]
a:106 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
a:106 [in Undecidability.TM.L.HeapInterpreter.StepTM]
a:106 [in Complexity.NP.SAT.CookLevin.Subproblems.CC]
a:1067 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
A:107 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
A:107 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
a:107 [in Undecidability.TM.L.HeapInterpreter.LookupTM]
a:1082 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:109 [in Undecidability.L.Tactics.Extract]
a:109 [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
a:109 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
A:109 [in Complexity.L.TM.CompCode]
a:109 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
a:1090 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:1098 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
A:11 [in Complexity.Libs.Pigeonhole]
A:11 [in Undecidability.TM.Compound.TMTac]
A:11 [in Undecidability.Shared.FilterFacts]
a:11 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
A:11 [in Undecidability.Shared.Libs.PSL.Lists.Removal]
a:11 [in Undecidability.TM.Code.BinNumbers.PosMultTM]
A:11 [in Complexity.NP.L.CanEnumTerm]
A:11 [in Undecidability.L.Tactics.LClos]
A:11 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
A:11 [in Undecidability.Shared.Libs.PSL.Lists.Filter]
A:11 [in Undecidability.Shared.Libs.PSL.Inhabited]
A:11 [in Undecidability.Shared.Libs.PSL.FiniteTypes.VectorFin]
A:11 [in Complexity.L.TM.TMflatComp]
A:11 [in Undecidability.L.Datatypes.List.List_extra]
A:11 [in Undecidability.L.Functions.EnumInt]
A:11 [in Undecidability.Shared.Libs.PSL.Lists.Cardinality]
A:11 [in Undecidability.Shared.Libs.PSL.FiniteTypes.Cardinality]
A:11 [in Undecidability.TM.Code.List.App]
A:11 [in Undecidability.Shared.Libs.PSL.FiniteTypes.FiniteFunction]
a:11 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
A:110 [in Undecidability.Shared.Libs.PSL.Retracts]
a:110 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
a:111 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
a:111 [in Complexity.Libs.CookPrelim.FlatFinTypes]
a:111 [in Undecidability.TM.L.HeapInterpreter.LookupTM]
a:111 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
A:112 [in Undecidability.L.Tactics.Extract]
A:112 [in Complexity.Libs.CookPrelim.FlatFinTypes]
a:112 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
a:1127 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:1129 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:113 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
a:1131 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:1136 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
A:114 [in Undecidability.L.Tactics.LClos]
a:114 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
a:114 [in Complexity.NP.SAT.CookLevin.Subproblems.CC]
a:1144 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:115 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
a:1152 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:116 [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
a:116 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
A:116 [in Undecidability.L.Tactics.LClos]
a:116 [in Complexity.Libs.CookPrelim.FlatFinTypes]
a:116 [in Undecidability.TM.L.HeapInterpreter.StepTM]
a:116 [in Undecidability.TM.L.HeapInterpreter.LookupTM]
a:117 [in Complexity.L.ComparisonTimeBoundDerivation]
a:117 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
a:118 [in Complexity.NP.SAT.CookLevin.Subproblems.CC]
A:118 [in Complexity.Libs.CookPrelim.MorePrelim]
a:1181 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:1183 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:1185 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:119 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
a:119 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
a:119 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
a:1190 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:1198 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:12 [in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
A:12 [in Undecidability.Shared.Libs.PSL.FCI]
A:12 [in Undecidability.TM.Compound.TMTac]
A:12 [in Undecidability.L.Datatypes.LOptions]
A:12 [in Complexity.L.AbstractMachines.FlatPro.Computable.Decompile]
A:12 [in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
A:12 [in Undecidability.Shared.Libs.PSL.Lists.Position]
a:12 [in Undecidability.TM.Util.Prelim]
A:12 [in Undecidability.Shared.Libs.PSL.Inhabited]
a:12 [in Complexity.NP.SAT.FSAT.FSAT]
A:12 [in Undecidability.Shared.Libs.PSL.Lists.Power]
a:12 [in Undecidability.TM.L.HeapInterpreter.StepTM]
A:12 [in Undecidability.Shared.Libs.PSL.Lists.Dupfree]
A:120 [in Undecidability.L.Tactics.LClos]
a:120 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
a:120 [in Complexity.L.ComparisonTimeBoundDerivation]
a:1206 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:121 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
a:121 [in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
a:122 [in Complexity.TM.PrettyBounds.UnivBounds]
a:122 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
A:122 [in Undecidability.L.Tactics.LClos]
a:122 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
a:122 [in Complexity.Libs.CookPrelim.MorePrelim]
A:123 [in Undecidability.L.Tactics.Extract]
a:123 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
a:123 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
a:123 [in Complexity.Libs.CookPrelim.MorePrelim]
a:1235 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:1237 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:1239 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:124 [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
A:124 [in Undecidability.L.Tactics.LClos]
a:124 [in Complexity.NP.SAT.SAT_inNP]
a:124 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
A:125 [in Undecidability.Shared.Libs.PSL.Retracts]
A:125 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
a:125 [in Undecidability.TM.Hoare.HoareExamples]
A:126 [in Undecidability.L.Tactics.LClos]
a:126 [in Complexity.NP.Clique.kSAT_to_Clique]
a:127 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
A:127 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
a:127 [in Complexity.NP.SAT.SAT_inNP]
a:127 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
A:127 [in Complexity.Libs.CookPrelim.MorePrelim]
a:128 [in Undecidability.L.Tactics.LClos]
a:128 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
a:128 [in Complexity.L.ComparisonTimeBoundDerivation]
A:129 [in Undecidability.L.Tactics.LClos]
a:129 [in Undecidability.TM.Hoare.HoareExamples]
a:13 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
A:13 [in Undecidability.Shared.Libs.PSL.Lists.Removal]
a:13 [in Undecidability.TM.Code.NatTM]
a:13 [in Complexity.L.ComparisonTimeBoundDerivation]
a:13 [in Complexity.NP.SAT.FSAT.FSAT]
A:13 [in Undecidability.L.Datatypes.List.List_eqb]
A:13 [in Undecidability.L.Tactics.ComputableTactics]
a:13 [in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
A:13 [in Undecidability.L.Complexity.GenericNary]
A:13 [in Undecidability.Shared.Libs.PSL.Lists.Cardinality]
a:13 [in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
A:13 [in Undecidability.L.Tactics.Computable]
A:13 [in Undecidability.Shared.Libs.PSL.FiniteTypes.CompoundFinTypes]
a:13 [in Complexity.Libs.CookPrelim.MorePrelim]
A:13 [in Undecidability.L.Prelim.MoreList]
a:130 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
A:130 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
A:130 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
a:131 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
a:131 [in Undecidability.TM.Hoare.HoareExamples]
a:131 [in Complexity.NP.Clique.kSAT_to_FlatClique]
a:132 [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
A:132 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
a:132 [in Complexity.L.ComparisonTimeBoundDerivation]
A:133 [in Undecidability.L.Tactics.LClos]
a:133 [in Complexity.NP.SAT.CookLevin.Subproblems.CC]
a:134 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
A:134 [in Complexity.L.TM.CompCode]
a:134 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
a:134 [in Complexity.L.AbstractMachines.AbstractHeapMachine]
a:134 [in Undecidability.TM.Hoare.HoareExamples]
a:135 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
A:135 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
a:135 [in Complexity.NP.SAT.SAT_inNP]
a:135 [in Undecidability.TM.L.HeapInterpreter.StepTM]
a:135 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
A:136 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
a:136 [in Complexity.L.AbstractMachines.AbstractHeapMachine]
a:136 [in Complexity.NP.Clique.kSAT_to_Clique]
a:137 [in Complexity.Libs.CookPrelim.FlatFinTypes]
a:137 [in Complexity.Libs.CookPrelim.PolyBounds]
a:137 [in Undecidability.TM.Hoare.HoareExamples]
a:137 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
a:138 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
a:138 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
A:138 [in Complexity.L.TM.CompCode]
a:138 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
a:138 [in Complexity.L.AbstractMachines.AbstractHeapMachine]
a:138 [in Complexity.Libs.CookPrelim.MorePrelim]
a:139 [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
a:139 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
a:139 [in Complexity.NP.SAT.SAT_inNP]
A:14 [in Complexity.Libs.Pigeonhole]
A:14 [in Undecidability.Shared.Libs.PSL.FCI]
A:14 [in Undecidability.Shared.FilterFacts]
A:14 [in Undecidability.L.Complexity.UpToCNary]
A:14 [in Complexity.NP.L.CanEnumTerm]
a:14 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
a:14 [in Undecidability.TM.Combinators.Switch]
A:14 [in Undecidability.Shared.Libs.PSL.Lists.Filter]
a:14 [in Undecidability.L.Datatypes.List.List_in]
a:14 [in Undecidability.TM.Hoare.HoareMult]
A:14 [in Undecidability.Shared.ListAutomation]
a:14 [in Complexity.NP.SAT.SAT]
a:14 [in Undecidability.TM.Code.BinNumbers.PosAddTM]
a:14 [in Undecidability.Shared.Libs.PSL.FiniteTypes.FiniteFunction]
A:14 [in Undecidability.L.Prelim.MoreList]
A:140 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
A:140 [in Undecidability.TM.Compound.Compare]
a:140 [in Undecidability.TM.L.HeapInterpreter.StepTM]
a:140 [in Complexity.Libs.CookPrelim.MorePrelim]
a:141 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
a:141 [in Complexity.L.AbstractMachines.AbstractHeapMachine]
a:141 [in Undecidability.TM.Hoare.HoareExamples]
a:141 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
A:142 [in Undecidability.L.Tactics.Extract]
A:142 [in Complexity.TM.PrettyBounds.UnivBounds]
a:142 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
a:142 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
A:143 [in Undecidability.Shared.Libs.PSL.Retracts]
a:143 [in Undecidability.L.Tactics.Extract]
a:143 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
a:143 [in Complexity.L.AbstractMachines.AbstractHeapMachine]
a:144 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
a:144 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
a:144 [in Undecidability.TM.L.HeapInterpreter.StepTM]
a:144 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
a:145 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
a:145 [in Complexity.L.AbstractMachines.AbstractHeapMachine]
a:145 [in Undecidability.TM.Hoare.HoareExamples]
A:146 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
a:146 [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
a:146 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
a:147 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
a:148 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
a:148 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
a:148 [in Undecidability.Shared.Libs.DLW.Utils.php]
a:148 [in Undecidability.TM.Hoare.HoareExamples]
a:149 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
a:149 [in Complexity.Libs.CookPrelim.FlatFinTypes]
a:149 [in Complexity.Libs.CookPrelim.PolyBounds]
a:15 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
A:15 [in Complexity.L.AbstractMachines.FlatPro.Computable.Decompile]
A:15 [in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
a:15 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
a:15 [in Complexity.L.ComparisonTimeBoundDerivation]
a:15 [in Undecidability.Shared.Libs.PSL.FiniteTypes.VectorFin]
a:15 [in Complexity.NP.SAT.SAT_inNP]
a:15 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
A:15 [in Undecidability.Shared.Libs.PSL.Lists.Power]
a:15 [in Undecidability.TM.Combinators.StateWhile]
A:15 [in Undecidability.L.Complexity.GenericNary]
A:15 [in Undecidability.Shared.Libs.PSL.Lists.Cardinality]
a:15 [in Undecidability.L.Functions.FinTypeLookup]
A:15 [in Undecidability.Shared.Libs.PSL.FiniteTypes.Cardinality]
a:150 [in Complexity.L.ComparisonTimeBoundDerivation]
a:150 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
A:151 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
A:151 [in Complexity.L.AbstractMachines.AbstractHeapMachine]
a:152 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
a:152 [in Complexity.Libs.CookPrelim.FlatFinTypes]
a:152 [in Complexity.L.ComparisonTimeBoundDerivation]
a:152 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
a:152 [in Undecidability.TM.L.HeapInterpreter.StepTM]
a:152 [in Undecidability.TM.Hoare.HoareExamples]
A:153 [in Undecidability.L.Tactics.Extract]
a:153 [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
A:154 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
a:154 [in Undecidability.L.Tactics.Extract]
a:154 [in Complexity.L.ComparisonTimeBoundDerivation]
a:154 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
a:154 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
a:155 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
a:155 [in Complexity.L.TM.TMunflatten]
A:155 [in Undecidability.TM.Code.Code]
a:155 [in Undecidability.TM.Hoare.HoareExamples]
a:156 [in Complexity.L.ComparisonTimeBoundDerivation]
a:156 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
a:157 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
a:157 [in Undecidability.TM.L.HeapInterpreter.StepTM]
A:157 [in Undecidability.TM.Code.Code]
a:157 [in Undecidability.TM.Hoare.HoareExamples]
a:158 [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
a:158 [in Undecidability.Shared.Libs.DLW.Utils.php]
A:159 [in Undecidability.L.Tactics.Extract]
a:159 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
a:159 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
A:16 [in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
A:16 [in Undecidability.Shared.Libs.PSL.Lists.Removal]
A:16 [in Undecidability.L.Datatypes.LOptions]
a:16 [in Complexity.L.AbstractMachines.UnfoldTailRec]
a:16 [in Undecidability.TM.Combinators.Switch]
a:16 [in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
A:16 [in Undecidability.Shared.Libs.PSL.Lists.Position]
a:16 [in Undecidability.TM.Util.Prelim]
A:16 [in Undecidability.Shared.Libs.PSL.Inhabited]
a:16 [in Complexity.NP.SAT.FSAT.FSAT]
a:16 [in Complexity.L.AbstractMachines.AbstractHeapMachine]
A:16 [in Undecidability.Shared.ListAutomation]
A:16 [in Undecidability.Shared.Libs.PSL.FiniteTypes.FiniteFunction]
A:16 [in Undecidability.Shared.Libs.PSL.FiniteTypes.CompoundFinTypes]
A:16 [in Complexity.Libs.CookPrelim.MorePrelim]
a:160 [in Undecidability.L.Tactics.Extract]
a:160 [in Undecidability.TM.Hoare.HoareExamples]
a:161 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
a:161 [in Complexity.Libs.CookPrelim.FlatFinTypes]
a:162 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
a:162 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
a:162 [in Undecidability.Shared.Libs.DLW.Utils.sums]
A:164 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
a:164 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
a:164 [in Complexity.Libs.CookPrelim.FlatFinTypes]
a:165 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
a:165 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
a:166 [in Undecidability.TM.Hoare.HoareExamples]
a:167 [in Complexity.L.TM.TMunflatten]
a:167 [in Undecidability.TM.L.HeapInterpreter.StepTM]
a:168 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
a:168 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
a:168 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
a:169 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
a:169 [in Complexity.L.TM.TMunflatten]
a:169 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
a:169 [in Undecidability.TM.Hoare.HoareExamples]
a:17 [in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
A:17 [in Undecidability.Shared.Libs.PSL.FCI]
A:17 [in Undecidability.L.Tactics.LClos]
A:17 [in Complexity.TM.Single.EncodeTapesInvariants]
A:17 [in Undecidability.Shared.Libs.PSL.FiniteTypes.VectorFin]
A:17 [in Undecidability.L.Datatypes.List.List_nat]
a:17 [in Undecidability.L.AbstractMachines.FlatPro.UnfoldClos]
a:17 [in Undecidability.TM.L.HeapInterpreter.StepTM]
a:17 [in Complexity.L.TM.TMflatten]
A:17 [in Undecidability.Shared.Libs.PSL.Lists.Dupfree]
a:17 [in Undecidability.TM.L.HeapInterpreter.LookupTM]
A:170 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
a:171 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
a:171 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
a:172 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
a:172 [in Undecidability.TM.Hoare.HoareExamples]
a:173 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
a:174 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
a:175 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
a:175 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
A:175 [in Complexity.Libs.CookPrelim.MorePrelim]
A:176 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
a:176 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
a:176 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
a:176 [in Undecidability.TM.Hoare.HoareExamples]
A:177 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
A:177 [in Undecidability.TM.Hoare.HoareLogic]
a:178 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
a:178 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
a:178 [in Complexity.L.TM.TMunflatten]
a:179 [in Complexity.L.TM.TMunflatten]
A:18 [in Undecidability.Shared.FilterFacts]
a:18 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
A:18 [in Undecidability.L.Complexity.UpToCNary]
A:18 [in Complexity.NP.L.CanEnumTerm]
a:18 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
a:18 [in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisUnfoldClos]
a:18 [in Undecidability.L.Tactics.LClos]
A:18 [in Undecidability.Shared.Libs.PSL.Lists.Filter]
a:18 [in Complexity.L.ComparisonTimeBoundDerivation]
A:18 [in Undecidability.Shared.Libs.PSL.Inhabited]
A:18 [in Complexity.L.TM.CompCode]
a:18 [in Complexity.L.AbstractMachines.UnfoldHeap]
a:18 [in Complexity.Complexity.UpToCPoly]
a:18 [in Complexity.NP.SAT.FSAT.FSAT]
a:18 [in Undecidability.L.Datatypes.List.List_in]
A:18 [in Undecidability.Shared.Libs.PSL.Lists.Cardinality]
a:180 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
a:180 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
a:180 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
a:180 [in Undecidability.Shared.Libs.DLW.Utils.sums]
a:180 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
a:180 [in Undecidability.TM.Hoare.HoareExamples]
A:180 [in Complexity.Libs.CookPrelim.MorePrelim]
a:181 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
a:181 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
a:183 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
a:183 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
a:183 [in Complexity.L.ComparisonTimeBoundDerivation]
a:183 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
a:183 [in Undecidability.Shared.Libs.DLW.Utils.sums]
a:183 [in Undecidability.TM.L.HeapInterpreter.StepTM]
a:183 [in Undecidability.TM.Hoare.HoareExamples]
a:184 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
a:185 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
a:185 [in Complexity.L.TM.TMunflatten]
a:186 [in Complexity.L.ComparisonTimeBoundDerivation]
A:186 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
a:186 [in Undecidability.TM.Hoare.HoareExamples]
A:186 [in Complexity.Libs.CookPrelim.MorePrelim]
a:187 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
a:187 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
a:187 [in Complexity.L.TM.TMunflatten]
a:187 [in Undecidability.TM.L.HeapInterpreter.StepTM]
a:189 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
a:189 [in Undecidability.TM.Hoare.HoareExamples]
A:19 [in Complexity.Libs.Pigeonhole]
A:19 [in Undecidability.Shared.Libs.PSL.Lists.Removal]
a:19 [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
a:19 [in Undecidability.L.Tactics.LClos]
a:19 [in Undecidability.TM.Util.Prelim]
a:19 [in Complexity.TM.Single.EncodeTapesInvariants]
a:19 [in Undecidability.Shared.Libs.DLW.Utils.crt]
a:19 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
A:19 [in Undecidability.Shared.Libs.PSL.Lists.Power]
A:19 [in Undecidability.Shared.Libs.PSL.Lists.Dupfree]
a:19 [in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
A:19 [in Undecidability.Shared.Libs.PSL.Lists.Cardinality]
a:19 [in Undecidability.TM.Hoare.HoareMult]
a:19 [in Undecidability.TM.Code.BinNumbers.PosAddTM]
a:19 [in Undecidability.Shared.Libs.PSL.FiniteTypes.FiniteFunction]
a:190 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
A:190 [in Complexity.Libs.CookPrelim.MorePrelim]
A:191 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
a:192 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
a:192 [in Complexity.L.TM.TMunflatten]
a:192 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
a:192 [in Complexity.Libs.CookPrelim.MorePrelim]
a:193 [in Undecidability.TM.Hoare.HoareExamples]
a:194 [in Complexity.L.ComparisonTimeBoundDerivation]
a:194 [in Complexity.L.TM.TMunflatten]
a:194 [in Undecidability.TM.L.HeapInterpreter.StepTM]
a:196 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
A:196 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
A:196 [in Complexity.Libs.CookPrelim.MorePrelim]
a:197 [in Undecidability.TM.Hoare.HoareExamples]
A:198 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
a:198 [in Complexity.L.ComparisonTimeBoundDerivation]
a:199 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
A:2 [in Undecidability.Shared.Libs.PSL.Lists.Removal]
a:2 [in Complexity.L.TM.TMflatEnc]
A:2 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
A:2 [in Undecidability.L.Datatypes.List.List_nat]
A:2 [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
A:2 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
A:2 [in Undecidability.Shared.Libs.PSL.Lists.Cardinality]
a:2 [in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
A:2 [in Complexity.NP.SAT.CookLevin.Reductions.CC_to_BinaryCC]
a:2 [in Undecidability.Shared.Libs.PSL.FiniteTypes.DepPairs]
A:20 [in Complexity.Libs.Pigeonhole]
a:20 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
a:20 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds_Loop]
A:20 [in Undecidability.L.Computability.Enum]
a:20 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
A:20 [in Undecidability.L.Tactics.LClos]
a:20 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
A:20 [in Undecidability.Shared.Libs.PSL.Lists.Position]
A:20 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
a:20 [in Complexity.L.ComparisonTimeBoundDerivation]
a:20 [in Complexity.NP.SAT.SAT_inNP]
a:20 [in Complexity.NP.SAT.FSAT.FSAT]
a:20 [in Undecidability.L.Datatypes.List.List_in]
A:20 [in Undecidability.Shared.Libs.PSL.Lists.Cardinality]
A:20 [in Undecidability.Shared.ListAutomation]
a:20 [in Complexity.NP.SAT.SAT]
a:20 [in Undecidability.TM.L.HeapInterpreter.LookupTM]
A:20 [in Complexity.Libs.CookPrelim.MorePrelim]
a:200 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
a:200 [in Undecidability.TM.Hoare.HoareExamples]
a:202 [in Undecidability.L.Tactics.Extract]
a:202 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
a:202 [in Undecidability.TM.Hoare.HoareExamples]
a:203 [in Undecidability.Shared.Libs.DLW.Utils.sums]
A:203 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
a:204 [in Undecidability.TM.Util.TM_facts]
a:206 [in Undecidability.L.Tactics.Extract]
a:206 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
A:206 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
a:206 [in Undecidability.TM.Hoare.HoareExamples]
a:208 [in Complexity.Libs.CookPrelim.MorePrelim]
a:209 [in Complexity.L.TM.TMflatComp]
A:21 [in Complexity.Libs.Pigeonhole]
A:21 [in Undecidability.Shared.FilterFacts]
a:21 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
A:21 [in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
a:21 [in Undecidability.L.Tactics.LClos]
A:21 [in Undecidability.Shared.Libs.PSL.Lists.Filter]
a:21 [in Undecidability.TM.Util.Prelim]
a:21 [in Complexity.Libs.CookPrelim.FlatFinTypes]
A:21 [in Undecidability.Shared.Libs.PSL.Inhabited]
A:21 [in Undecidability.Shared.Libs.PSL.FiniteTypes.VectorFin]
a:21 [in Undecidability.Shared.Libs.DLW.Utils.fin_upto]
A:21 [in Undecidability.Shared.Libs.PSL.Lists.Power]
A:21 [in Undecidability.TM.Code.ChangeAlphabet]
a:21 [in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
a:21 [in Undecidability.L.Tactics.Computable]
A:210 [in Undecidability.Shared.Libs.DLW.Vec.vec]
a:210 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
a:211 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
a:211 [in Undecidability.TM.Hoare.HoareExamples]
a:212 [in Complexity.L.TM.TMflatComp]
A:212 [in Complexity.Libs.CookPrelim.MorePrelim]
A:214 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
a:215 [in Undecidability.TM.Hoare.HoareExamples]
A:216 [in Undecidability.Shared.Libs.DLW.Vec.vec]
A:22 [in Complexity.Libs.Pigeonhole]
A:22 [in Undecidability.Shared.Libs.PSL.FCI]
a:22 [in Undecidability.L.Datatypes.LOptions]
A:22 [in Undecidability.L.Tactics.Extract]
A:22 [in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
A:22 [in Undecidability.L.Tactics.LClos]
A:22 [in Undecidability.Shared.Libs.PSL.Lists.Position]
A:22 [in Complexity.L.TM.CompCode]
a:22 [in Complexity.NP.SAT.SAT_inNP]
a:22 [in Complexity.L.AbstractMachines.AbstractHeapMachine]
a:22 [in Undecidability.L.Datatypes.LNat]
A:22 [in Undecidability.Shared.Libs.PSL.FiniteTypes.FiniteFunction]
a:220 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
a:220 [in Undecidability.TM.Hoare.HoareExamples]
A:222 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
A:222 [in Complexity.Libs.CookPrelim.MorePrelim]
a:2223 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:2232 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:224 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
a:2241 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:225 [in Undecidability.TM.L.HeapInterpreter.StepTM]
a:225 [in Undecidability.TM.Hoare.HoareExamples]
a:2250 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:2259 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:2268 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
A:227 [in Undecidability.Shared.Libs.DLW.Vec.vec]
A:227 [in Complexity.Libs.CookPrelim.MorePrelim]
a:2277 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:2286 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:229 [in Undecidability.L.Tactics.Extract]
a:229 [in Undecidability.TM.Hoare.HoareExamples]
a:2295 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
A:23 [in Complexity.Libs.Pigeonhole]
a:23 [in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
a:23 [in Undecidability.TM.Code.BinNumbers.PosMultTM]
a:23 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
A:23 [in Undecidability.L.Datatypes.LSum]
a:23 [in Undecidability.L.Tactics.LClos]
a:23 [in Complexity.Libs.CookPrelim.FlatFinTypes]
a:23 [in Complexity.L.ComparisonTimeBoundDerivation]
a:23 [in Undecidability.Shared.Libs.PSL.FiniteTypes.VectorFin]
a:23 [in Complexity.L.AbstractMachines.UnfoldHeap]
a:23 [in Undecidability.Shared.Libs.DLW.Utils.fin_upto]
a:23 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
a:23 [in Complexity.NP.SAT.FSAT.FSAT]
A:23 [in Undecidability.Shared.Libs.PSL.Lists.Power]
a:23 [in Undecidability.TM.L.HeapInterpreter.StepTM]
A:23 [in Undecidability.Shared.Libs.PSL.Lists.Cardinality]
a:23 [in Undecidability.TM.Hoare.HoareMult]
a:23 [in Undecidability.TM.Util.TM_facts]
a:23 [in Complexity.NP.SAT.SAT]
a:23 [in Undecidability.TM.L.HeapInterpreter.LookupTM]
a:231 [in Undecidability.TM.L.HeapInterpreter.StepTM]
a:232 [in Undecidability.Shared.Libs.DLW.Utils.sums]
A:233 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
a:233 [in Undecidability.TM.Hoare.HoareExamples]
a:235 [in Undecidability.Shared.Libs.DLW.Vec.vec]
A:235 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
A:236 [in Undecidability.L.Tactics.Extract]
a:236 [in Undecidability.Shared.Libs.DLW.Utils.sums]
a:237 [in Undecidability.L.Tactics.Extract]
a:237 [in Undecidability.TM.Hoare.HoareExamples]
a:2376 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:2384 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
A:239 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
a:2392 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
A:24 [in Undecidability.Shared.Libs.PSL.FCI]
A:24 [in Undecidability.Shared.FilterFacts]
a:24 [in Undecidability.Shared.Libs.PSL.Retracts]
A:24 [in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
a:24 [in Undecidability.L.Tactics.LClos]
A:24 [in Undecidability.Shared.Libs.PSL.Lists.Filter]
A:24 [in Undecidability.Shared.Libs.PSL.Inhabited]
A:24 [in Undecidability.L.Tactics.ComputableDemo]
A:24 [in Complexity.Complexity.SpaceBoundsTime]
A:24 [in Undecidability.Shared.Libs.PSL.Lists.Dupfree]
a:24 [in Undecidability.Shared.ListAutomation]
a:24 [in Undecidability.L.Datatypes.LNat]
A:240 [in Undecidability.L.Tactics.Extract]
a:2400 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:2408 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:241 [in Undecidability.L.Tactics.Extract]
a:2416 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
A:242 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
a:242 [in Undecidability.TM.Hoare.HoareExamples]
a:2424 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:243 [in Complexity.Libs.CookPrelim.MorePrelim]
a:2432 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
A:244 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
a:2440 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:247 [in Undecidability.TM.Hoare.HoareExamples]
A:248 [in Undecidability.Shared.Libs.DLW.Vec.vec]
a:248 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
a:248 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
A:249 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
A:25 [in Complexity.Libs.Pigeonhole]
A:25 [in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
a:25 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
A:25 [in Undecidability.Shared.Libs.PSL.Lists.Removal]
a:25 [in Complexity.L.AbstractMachines.UnfoldTailRec]
a:25 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
a:25 [in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisUnfoldClos]
a:25 [in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
A:25 [in Undecidability.L.Tactics.LClos]
a:25 [in Undecidability.TM.Util.Prelim]
a:25 [in Undecidability.Shared.Libs.DLW.Utils.fin_upto]
a:25 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
A:25 [in Undecidability.L.Datatypes.List.List_eqb]
A:25 [in Undecidability.Shared.Libs.PSL.Lists.Dupfree]
A:25 [in Undecidability.Shared.Libs.PSL.Lists.Cardinality]
A:25 [in Undecidability.Shared.ListAutomation]
a:25 [in Undecidability.Shared.Libs.PSL.FiniteTypes.FiniteFunction]
a:25 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
a:251 [in Undecidability.TM.Hoare.HoareExamples]
a:252 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
A:253 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
a:254 [in Undecidability.Shared.Libs.DLW.Vec.vec]
a:2540 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:255 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
a:255 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
a:255 [in Undecidability.TM.Hoare.HoareExamples]
a:257 [in Undecidability.TM.Hoare.HoareExamples]
a:259 [in Undecidability.TM.Hoare.HoareExamples]
a:26 [in Undecidability.TM.Code.BinNumbers.PosMultTM]
a:26 [in Undecidability.L.Tactics.LClos]
A:26 [in Undecidability.Shared.Libs.PSL.Lists.Position]
a:26 [in Complexity.L.ComparisonTimeBoundDerivation]
A:26 [in Undecidability.L.Datatypes.List.List_extra]
a:26 [in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisStep]
A:26 [in Undecidability.Shared.Libs.PSL.Lists.Power]
a:26 [in Undecidability.TM.L.HeapInterpreter.StepTM]
A:26 [in Undecidability.Shared.Libs.PSL.Lists.Dupfree]
a:26 [in Complexity.NP.SAT.SAT]
a:26 [in Complexity.Libs.CookPrelim.MorePrelim]
A:261 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
a:263 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
A:265 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
a:265 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
A:2657 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:267 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
A:2676 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:2678 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:268 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
a:2691 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
A:2698 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:27 [in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
A:27 [in Undecidability.L.Datatypes.LSum]
A:27 [in Undecidability.L.Tactics.LClos]
A:27 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
a:27 [in Complexity.Libs.CookPrelim.FlatFinTypes]
a:27 [in Complexity.Libs.CookPrelim.PolyBounds]
a:27 [in Undecidability.Shared.Libs.DLW.Utils.fin_upto]
a:270 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
A:2701 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
A:2702 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:2705 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:271 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
a:272 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
a:273 [in Complexity.Libs.CookPrelim.MorePrelim]
a:278 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
A:28 [in Complexity.Libs.Pigeonhole]
a:28 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
A:28 [in Undecidability.Shared.FilterFacts]
A:28 [in Undecidability.Shared.Libs.PSL.Lists.Removal]
a:28 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
A:28 [in Undecidability.Shared.Libs.PSL.Lists.Filter]
a:28 [in Undecidability.Shared.Libs.DLW.Utils.crt]
A:28 [in Undecidability.L.Tactics.ComputableDemo]
A:28 [in Undecidability.L.Datatypes.List.List_nat]
a:28 [in Complexity.NP.SAT.SAT_inNP]
a:28 [in Undecidability.L.TM.TapeFuns]
a:28 [in Undecidability.Shared.Libs.DLW.Utils.fin_upto]
a:28 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
a:28 [in Undecidability.L.Functions.EqBool]
A:28 [in Undecidability.Shared.Libs.PSL.Lists.Power]
A:28 [in Undecidability.Shared.Libs.PSL.Lists.Cardinality]
a:28 [in Undecidability.TM.Hoare.HoareMult]
a:28 [in Undecidability.Shared.ListAutomation]
A:28 [in Undecidability.Shared.Libs.PSL.FiniteTypes.FiniteFunction]
a:281 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
a:29 [in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
A:29 [in Undecidability.Shared.Libs.PSL.FCI]
a:29 [in Complexity.Libs.CookPrelim.FlatFinTypes]
a:29 [in Complexity.L.AbstractMachines.UnfoldHeap]
a:29 [in Undecidability.Shared.Libs.DLW.Utils.fin_upto]
a:29 [in Undecidability.Shared.Libs.DLW.Utils.sums]
a:29 [in Undecidability.TM.TM]
A:29 [in Undecidability.Shared.Libs.PSL.Lists.Dupfree]
A:29 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
A:29 [in Undecidability.Shared.ListAutomation]
a:29 [in Undecidability.TM.Util.TM_facts]
a:29 [in Complexity.NP.SAT.SAT]
a:29 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
A:3 [in Undecidability.L.Datatypes.List.List_basics]
A:3 [in Complexity.L.AbstractMachines.FlatPro.Computable.Decompile]
A:3 [in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
a:3 [in Complexity.NP.SAT.SharedSAT]
A:3 [in Complexity.L.AbstractMachines.Computable.Shared]
A:3 [in Undecidability.Shared.Libs.PSL.Lists.Position]
a:3 [in Undecidability.TM.Combinators.Mirror]
a:3 [in Undecidability.Shared.Libs.DLW.Utils.interval]
a:3 [in Undecidability.L.Prelim.MoreBase]
a:3 [in Complexity.NP.SAT.FSAT.FSAT]
a:3 [in Undecidability.TM.L.Alphabets]
a:3 [in Complexity.NP.SAT.CookLevin.Subproblems.TM_single]
A:3 [in Complexity.L.TM.TMflatten]
A:3 [in Undecidability.L.Functions.EnumInt]
a:3 [in Undecidability.L.Datatypes.List.List_in]
a:3 [in Undecidability.L.Computability.Synthetic]
A:3 [in Undecidability.Shared.Libs.PSL.FiniteTypes.Cardinality]
A:3 [in Undecidability.Shared.Libs.PSL.FiniteTypes.CompoundFinTypes]
A:30 [in Undecidability.Shared.Libs.PSL.Lists.Removal]
a:30 [in Undecidability.Shared.Libs.PSL.Retracts]
a:30 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
A:30 [in Undecidability.L.Datatypes.List.List_extra]
a:30 [in Undecidability.Shared.Libs.DLW.Utils.fin_upto]
a:30 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
A:30 [in Undecidability.L.Datatypes.List.List_eqb]
A:30 [in Undecidability.Shared.Libs.PSL.Lists.Power]
a:30 [in Complexity.L.AbstractMachines.AbstractHeapMachine]
A:30 [in Undecidability.Shared.Libs.PSL.Lists.Dupfree]
a:3029 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:3034 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:3048 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:308 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
a:31 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
a:31 [in Complexity.L.AbstractMachines.UnfoldTailRec]
A:31 [in Undecidability.L.Tactics.GenEncode]
A:31 [in Complexity.L.TM.CompCode]
a:31 [in Undecidability.Shared.Libs.DLW.Utils.fin_upto]
a:31 [in Undecidability.TM.L.HeapInterpreter.StepTM]
A:31 [in Undecidability.Shared.Libs.PSL.Lists.Dupfree]
A:31 [in Undecidability.L.Tactics.Reflection]
A:31 [in Undecidability.Shared.ListAutomation]
a:31 [in Undecidability.TM.Univ.Univ]
a:31 [in Undecidability.Shared.Libs.PSL.FiniteTypes.FiniteFunction]
a:3133 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:314 [in Complexity.Libs.CookPrelim.MorePrelim]
A:3199 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:32 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
A:32 [in Undecidability.Shared.FilterFacts]
A:32 [in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
A:32 [in Undecidability.Shared.Libs.PSL.Lists.Filter]
a:32 [in Complexity.NP.SAT.SAT_inNP]
A:32 [in Undecidability.L.TM.TapeFuns]
A:32 [in Undecidability.L.AbstractMachines.FlatPro.Programs]
a:32 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
A:32 [in Undecidability.L.Functions.FinTypeLookup]
a:32 [in Complexity.NP.SAT.SAT]
a:3202 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
A:3207 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:3221 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:3227 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:3279 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:3289 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:3299 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
A:33 [in Complexity.Libs.Pigeonhole]
a:33 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
A:33 [in Undecidability.Shared.Libs.PSL.Lists.Removal]
a:33 [in Undecidability.Shared.Libs.DLW.Utils.crt]
A:33 [in Undecidability.L.Datatypes.List.List_nat]
A:33 [in Undecidability.Shared.Libs.PSL.Lists.Power]
A:33 [in Undecidability.Shared.Libs.PSL.Lists.Dupfree]
a:33 [in Undecidability.L.Datatypes.List.List_in]
a:33 [in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
a:33 [in Undecidability.TM.Hoare.HoareMult]
A:33 [in Undecidability.Shared.ListAutomation]
a:33 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
a:33 [in Complexity.Libs.CookPrelim.MorePrelim]
a:330 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:3311 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:3321 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:333 [in Complexity.Libs.CookPrelim.MorePrelim]
a:3331 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
A:334 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:3343 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:3353 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:3363 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
A:338 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
A:34 [in Undecidability.Shared.Libs.PSL.FCI]
a:34 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
A:34 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
A:34 [in Undecidability.Synthetic.Infinite]
a:34 [in Undecidability.TM.L.HeapInterpreter.LookupTM]
a:34 [in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
A:342 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:349 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:35 [in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
a:35 [in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisUnfoldClos]
A:35 [in Complexity.L.TM.CompCode]
A:35 [in Undecidability.L.Tactics.ComputableDemo]
a:35 [in Complexity.L.AbstractMachines.UnfoldHeap]
A:35 [in Undecidability.L.Datatypes.LVector]
a:35 [in Complexity.NP.SAT.SAT_inNP]
A:35 [in Undecidability.L.Datatypes.List.List_eqb]
A:35 [in Complexity.Complexity.SpaceBoundsTime]
A:35 [in Undecidability.Shared.Libs.PSL.Lists.Dupfree]
a:35 [in Complexity.NP.SAT.SAT]
a:353 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
a:356 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
a:357 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
A:36 [in Complexity.Libs.Pigeonhole]
a:36 [in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
A:36 [in Undecidability.Shared.FilterFacts]
A:36 [in Undecidability.L.Tactics.LClos]
A:36 [in Undecidability.Shared.Libs.PSL.Lists.Filter]
a:36 [in Undecidability.TM.L.HeapInterpreter.StepTM]
a:36 [in Complexity.L.AbstractMachines.AbstractHeapMachine]
A:36 [in Undecidability.Shared.Libs.PSL.Lists.Dupfree]
A:36 [in Undecidability.Shared.ListAutomation]
a:36 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
a:36 [in Complexity.Libs.CookPrelim.MorePrelim]
a:363 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
a:3644 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:3647 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:3652 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:3655 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:367 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:3670 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:3673 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:368 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
a:3688 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
A:3689 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
A:3691 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:3692 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
A:37 [in Complexity.Libs.Pigeonhole]
a:37 [in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
a:37 [in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
A:37 [in Undecidability.Shared.Libs.PSL.FCI]
A:37 [in Undecidability.Shared.Libs.PSL.Lists.Removal]
a:37 [in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisUnfoldClos]
a:37 [in Undecidability.TM.Util.VectorPrelim]
A:37 [in Complexity.L.TM.CompCode]
a:37 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
A:37 [in Undecidability.Shared.Libs.PSL.Lists.Power]
A:37 [in Undecidability.Shared.Libs.PSL.Lists.Dupfree]
a:37 [in Undecidability.L.Datatypes.List.List_in]
A:37 [in Undecidability.Shared.Dec]
a:37 [in Undecidability.TM.Hoare.HoareMult]
a:37 [in Undecidability.L.Functions.FinTypeLookup]
A:3700 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:3701 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:372 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
a:377 [in Undecidability.TM.Single.StepTM]
a:377 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
A:38 [in Complexity.Libs.Pigeonhole]
A:38 [in Undecidability.Shared.Libs.PSL.Lists.Removal]
a:38 [in Complexity.NP.SAT.SAT_inNP]
a:38 [in Undecidability.L.TM.TapeFuns]
a:38 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
A:38 [in Undecidability.Shared.Libs.PSL.Lists.Dupfree]
A:38 [in Undecidability.L.Tactics.Reflection]
A:38 [in Undecidability.Synthetic.Infinite]
a:38 [in Complexity.NP.SAT.SAT]
a:38 [in Complexity.Libs.CookPrelim.MorePrelim]
a:384 [in Undecidability.TM.Single.StepTM]
a:386 [in Undecidability.TM.Single.StepTM]
a:388 [in Undecidability.TM.Single.StepTM]
A:39 [in Complexity.Libs.Pigeonhole]
A:39 [in Undecidability.Shared.Libs.PSL.FCI]
a:39 [in Undecidability.L.Tactics.LClos]
a:39 [in Undecidability.TM.Util.Prelim]
a:39 [in Complexity.Libs.UniformHomomorphisms]
a:39 [in Complexity.L.AbstractMachines.AbstractHeapMachine]
a:39 [in Undecidability.Shared.Libs.PSL.Lists.Dupfree]
A:39 [in Undecidability.Shared.ListAutomation]
a:39 [in Undecidability.TM.L.HeapInterpreter.LookupTM]
a:39 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
a:392 [in Undecidability.TM.Single.StepTM]
a:394 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
A:394 [in Undecidability.TM.Util.TM_facts]
a:395 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
a:399 [in Undecidability.TM.Single.StepTM]
a:4 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
A:4 [in Undecidability.Shared.FilterFacts]
A:4 [in Complexity.NP.L.CanEnumTerm]
A:4 [in Undecidability.Shared.Libs.PSL.Lists.Filter]
a:4 [in Undecidability.TM.Util.Prelim]
A:4 [in Undecidability.Shared.Libs.PSL.Inhabited]
a:4 [in Complexity.L.AbstractMachines.UnfoldHeap]
a:4 [in Complexity.Libs.CookPrelim.PolyBounds]
a:4 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
a:4 [in Complexity.Libs.CookPrelim.Tactics]
A:4 [in Complexity.TM.Compound.MoveToSymbol_niceSpec]
A:4 [in Undecidability.Synthetic.ListEnumerabilityFacts]
a:4 [in Undecidability.L.Datatypes.List.List_enc]
a:4 [in Undecidability.TM.Hoare.HoareMult]
a:4 [in Complexity.NP.SAT.SAT]
a:4 [in Undecidability.TM.Code.BinNumbers.PosAddTM]
A:40 [in Undecidability.Shared.Libs.PSL.FCI]
A:40 [in Undecidability.L.Tactics.LClos]
a:40 [in Complexity.NP.SAT.SAT_inNP]
a:40 [in Undecidability.Shared.Libs.DLW.Utils.sums]
a:40 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
A:40 [in Undecidability.Shared.Libs.PSL.Lists.Power]
A:40 [in Undecidability.TM.Code.Code]
a:40 [in Complexity.NP.SAT.CookLevin.Subproblems.CC]
a:401 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:402 [in Undecidability.TM.Util.TM_facts]
a:406 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
a:41 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
a:41 [in Undecidability.TM.Code.BinNumbers.PosMultTM]
a:41 [in Undecidability.Shared.Libs.PSL.Retracts]
A:41 [in Undecidability.L.Tactics.Extract]
a:41 [in Complexity.L.AbstractMachines.UnfoldTailRec]
a:41 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
A:41 [in Undecidability.Shared.Libs.PSL.Lists.Filter]
A:41 [in Complexity.Libs.CookPrelim.FlatFinTypes]
A:41 [in Complexity.L.TM.CompCode]
a:41 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
a:41 [in Complexity.NP.SAT.SAT_inNP]
A:41 [in Undecidability.L.AbstractMachines.FlatPro.Programs]
A:41 [in Undecidability.L.Datatypes.List.List_eqb]
a:41 [in Undecidability.TM.L.HeapInterpreter.StepTM]
a:41 [in Undecidability.L.Datatypes.List.List_in]
a:41 [in Undecidability.TM.Hoare.HoareMult]
A:41 [in Undecidability.Shared.Libs.PSL.FiniteTypes.FiniteFunction]
a:410 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:416 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
a:419 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:42 [in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
A:42 [in Undecidability.Shared.Libs.PSL.Lists.Removal]
A:42 [in Undecidability.L.Computability.Enum]
A:42 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
a:42 [in Undecidability.TM.Util.Prelim]
a:42 [in Undecidability.Shared.Libs.DLW.Utils.crt]
a:42 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
a:42 [in Complexity.NP.Clique.kSAT_to_Clique]
A:42 [in Undecidability.Shared.ListAutomation]
A:42 [in Complexity.Libs.CookPrelim.MorePrelim]
A:43 [in Complexity.Libs.Pigeonhole]
a:43 [in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
a:43 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
a:43 [in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisUnfoldClos]
a:43 [in Undecidability.TM.Code.NatTM]
a:43 [in Complexity.Libs.CookPrelim.FlatFinTypes]
a:43 [in Complexity.NP.SAT.SAT_inNP]
A:43 [in Undecidability.Shared.Libs.PSL.Lists.Power]
A:43 [in Complexity.Complexity.SpaceBoundsTime]
A:43 [in Complexity.L.AbstractMachines.FunctionalDefinitions]
a:435 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:438 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
a:44 [in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
a:44 [in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
a:44 [in Undecidability.TM.Code.BinNumbers.PosMultTM]
A:44 [in Undecidability.L.Tactics.Extract]
A:44 [in Undecidability.L.Computability.Enum]
A:44 [in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
a:44 [in Complexity.L.ComparisonTimeBoundDerivation]
a:44 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
A:44 [in Undecidability.L.Datatypes.List.List_eqb]
a:44 [in Complexity.L.AbstractMachines.AbstractHeapMachine]
a:44 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
A:44 [in Undecidability.L.Functions.FinTypeLookup]
A:44 [in Undecidability.Shared.ListAutomation]
a:44 [in Complexity.NP.SAT.CookLevin.Subproblems.CC]
a:44 [in Undecidability.Shared.Libs.PSL.FiniteTypes.FiniteFunction]
a:440 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
a:443 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
A:45 [in Undecidability.Shared.Libs.PSL.Lists.Removal]
a:45 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
A:45 [in Complexity.Libs.CookPrelim.FlatFinTypes]
a:45 [in Complexity.NP.SAT.SAT_inNP]
a:45 [in Complexity.Libs.CookPrelim.PolyBounds]
a:45 [in Undecidability.TM.L.HeapInterpreter.StepTM]
a:45 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
a:45 [in Undecidability.TM.Hoare.HoareMult]
a:453 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
A:46 [in Complexity.Libs.Pigeonhole]
a:46 [in Undecidability.Shared.Libs.DLW.Utils.prime]
a:46 [in Undecidability.Shared.Libs.PSL.Retracts]
A:46 [in Undecidability.L.Tactics.LClos]
a:46 [in Complexity.L.ComparisonTimeBoundDerivation]
a:46 [in Undecidability.L.Datatypes.LVector]
a:46 [in Undecidability.Shared.Libs.DLW.Utils.list_bool]
a:46 [in Undecidability.TM.Univ.LowLevel]
a:46 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
A:46 [in Undecidability.L.AbstractMachines.FlatPro.Programs]
A:46 [in Undecidability.TM.Code.Code]
a:463 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:467 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
a:47 [in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
A:47 [in Undecidability.Shared.Libs.PSL.Lists.Removal]
A:47 [in Undecidability.L.Computability.Enum]
A:47 [in Undecidability.Shared.Libs.PSL.EqDec]
A:47 [in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
A:47 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
a:47 [in Complexity.Libs.CookPrelim.FlatFinTypes]
a:47 [in Undecidability.L.Datatypes.List.List_eqb]
A:47 [in Undecidability.Shared.Libs.PSL.Lists.Power]
a:47 [in Undecidability.TM.L.HeapInterpreter.LookupTM]
a:47 [in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
a:47 [in Complexity.NP.SAT.CookLevin.Subproblems.CC]
a:48 [in Complexity.NP.SAT.SAT_inNP]
a:48 [in Complexity.Complexity.UpToCPoly]
a:48 [in Complexity.L.TM.TMunflatten]
A:48 [in Undecidability.Shared.Libs.PSL.Lists.Power]
a:480 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:488 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
A:49 [in Complexity.Libs.Pigeonhole]
a:49 [in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
A:49 [in Undecidability.Shared.Libs.PSL.Lists.Removal]
a:49 [in Undecidability.TM.Util.Prelim]
a:49 [in Undecidability.Shared.Libs.DLW.Utils.crt]
a:49 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
A:49 [in Undecidability.Shared.Libs.PSL.FiniteTypes.Arbitrary]
a:49 [in Undecidability.L.Functions.FinTypeLookup]
A:49 [in Undecidability.Shared.ListAutomation]
A:49 [in Complexity.L.AbstractMachines.FunctionalDefinitions]
a:49 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
a:498 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
A:5 [in Complexity.Libs.Pigeonhole]
a:5 [in Complexity.NP.SAT.SharedSAT]
a:5 [in Undecidability.TM.Code.NatTM]
A:5 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
A:5 [in Complexity.L.TM.CompCode]
A:5 [in Complexity.L.TM.TMunflatten]
A:5 [in Undecidability.L.Datatypes.List.List_eqb]
A:5 [in Undecidability.Shared.Libs.PSL.Lists.Power]
a:5 [in Complexity.L.TM.TMflatten]
A:5 [in Undecidability.Shared.Libs.PSL.Lists.Dupfree]
a:5 [in Undecidability.TM.L.HeapInterpreter.LookupTM]
A:5 [in Undecidability.Shared.Libs.PSL.FiniteTypes.FiniteFunction]
a:5 [in Undecidability.Shared.Libs.PSL.FiniteTypes.CompoundFinTypes]
A:50 [in Undecidability.Shared.Libs.PSL.Lists.Removal]
a:50 [in Undecidability.Shared.Libs.PSL.Retracts]
A:50 [in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
a:50 [in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisUnfoldClos]
a:50 [in Undecidability.Shared.Libs.DLW.Utils.list_bool]
A:50 [in Undecidability.L.Datatypes.List.List_eqb]
A:50 [in Undecidability.Shared.Libs.PSL.Lists.Power]
A:50 [in Complexity.Complexity.SpaceBoundsTime]
a:50 [in Undecidability.TM.Hoare.HoareMult]
a:50 [in Complexity.NP.SAT.CookLevin.Subproblems.CC]
a:508 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:51 [in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
A:51 [in Undecidability.L.Tactics.Extract]
A:51 [in Complexity.Libs.CookPrelim.FlatFinTypes]
a:51 [in Undecidability.L.Datatypes.LVector]
a:51 [in Complexity.TM.Single.DecodeTapes]
A:51 [in Undecidability.Synthetic.Infinite]
A:51 [in Undecidability.Shared.Libs.PSL.FiniteTypes.FiniteFunction]
A:52 [in Complexity.Libs.Pigeonhole]
A:52 [in Undecidability.L.Tactics.Extract]
a:52 [in Complexity.L.ComparisonTimeBoundDerivation]
A:52 [in Complexity.TM.PrettyBounds.BaseCodeSpace]
a:52 [in Complexity.NP.SAT.SAT_inNP]
a:52 [in Complexity.TM.Single.DecodeTapes]
A:52 [in Undecidability.L.Tactics.Reflection]
a:52 [in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
a:525 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:53 [in Undecidability.L.Tactics.Extract]
A:53 [in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
a:53 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
a:53 [in Complexity.Libs.CookPrelim.FlatFinTypes]
a:53 [in Undecidability.Shared.Libs.DLW.Utils.list_bool]
a:53 [in Complexity.TM.Single.DecodeTapes]
a:532 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
A:54 [in Complexity.Libs.Pigeonhole]
A:54 [in Undecidability.L.Computability.Enum]
a:54 [in Complexity.L.ComparisonTimeBoundDerivation]
a:54 [in Complexity.NP.SAT.SAT_inNP]
a:54 [in Undecidability.TM.L.HeapInterpreter.StepTM]
a:54 [in Undecidability.Shared.Libs.PSL.FiniteTypes.FiniteFunction]
a:541 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:55 [in Undecidability.Shared.Libs.PSL.Retracts]
a:55 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
a:55 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
a:55 [in Undecidability.L.Tactics.Reflection]
a:55 [in Undecidability.TM.Hoare.HoareMult]
A:55 [in Undecidability.L.Functions.FinTypeLookup]
A:55 [in Undecidability.TM.Util.TM_facts]
a:550 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
A:56 [in Complexity.Libs.Pigeonhole]
A:56 [in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
A:56 [in Undecidability.L.Tactics.GenEncode]
A:56 [in Undecidability.L.Tactics.LClos]
A:56 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
a:56 [in Complexity.L.ComparisonTimeBoundDerivation]
A:56 [in Undecidability.L.Tactics.Reflection]
A:56 [in Undecidability.Shared.Libs.PSL.FiniteTypes.FiniteFunction]
a:56 [in Complexity.Libs.CookPrelim.MorePrelim]
a:566 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
A:57 [in Complexity.Libs.Pigeonhole]
a:57 [in Undecidability.Shared.Libs.PSL.Retracts]
a:57 [in Undecidability.L.Tactics.LClos]
A:57 [in Complexity.Libs.CookPrelim.FlatFinTypes]
A:57 [in Complexity.L.TM.CompCode]
a:57 [in Undecidability.TM.Univ.LowLevel]
A:57 [in Undecidability.Shared.Libs.PSL.FiniteTypes.Arbitrary]
a:57 [in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
a:57 [in Complexity.NP.SAT.CookLevin.Subproblems.CC]
a:574 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:58 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
a:58 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
a:58 [in Undecidability.TM.L.HeapInterpreter.LookupTM]
a:58 [in Undecidability.TM.Univ.Univ]
a:584 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
A:59 [in Complexity.Libs.Pigeonhole]
A:59 [in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
A:59 [in Undecidability.L.Tactics.GenEncode]
A:59 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
a:59 [in Complexity.Libs.CookPrelim.FlatFinTypes]
a:59 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
a:59 [in Complexity.L.AbstractMachines.AbstractHeapMachine]
a:59 [in Complexity.NP.Clique.kSAT_to_Clique]
a:59 [in Undecidability.TM.Hoare.HoareMult]
a:59 [in Undecidability.Shared.Libs.DLW.Code.subcode]
A:59 [in Undecidability.TM.L.CompilerBoolFuns.Compiler]
a:594 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
A:6 [in Undecidability.Shared.Libs.PSL.FCI]
A:6 [in Undecidability.Shared.FilterFacts]
A:6 [in Undecidability.Shared.Libs.PSL.Lists.Removal]
A:6 [in Undecidability.L.Complexity.UpToCNary]
a:6 [in Undecidability.L.Tactics.GenEncode]
A:6 [in Undecidability.Shared.Libs.PSL.Lists.Filter]
a:6 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
a:6 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
a:6 [in Complexity.Libs.CookPrelim.Tactics]
a:6 [in Undecidability.TM.L.HeapInterpreter.StepTM]
A:6 [in Undecidability.L.Datatypes.List.List_enc]
A:6 [in Undecidability.Shared.Libs.PSL.Lists.Cardinality]
A:6 [in Undecidability.L.Functions.FinTypeLookup]
A:6 [in Undecidability.Shared.ListAutomation]
a:6 [in Complexity.NP.SAT.SAT]
a:6 [in Undecidability.Shared.Libs.PSL.FiniteTypes.DepPairs]
a:60 [in Undecidability.TM.L.CompilerBoolFuns.NaryApp]
A:60 [in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
A:60 [in Undecidability.L.Tactics.LClos]
A:60 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
a:60 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
a:60 [in Undecidability.L.Datatypes.LVector]
A:60 [in Complexity.Complexity.SpaceBoundsTime]
A:60 [in Undecidability.Synthetic.Infinite]
a:60 [in Undecidability.L.Functions.FinTypeLookup]
a:60 [in Complexity.Libs.CookPrelim.MorePrelim]
a:61 [in Undecidability.L.Tactics.LClos]
A:61 [in Complexity.Libs.CookPrelim.FlatFinTypes]
A:61 [in Complexity.L.TM.CompCode]
a:61 [in Complexity.TM.PrettyBounds.BaseCodeSpace]
A:61 [in Undecidability.Shared.Libs.PSL.FiniteTypes.Arbitrary]
A:61 [in Undecidability.Synthetic.Infinite]
A:61 [in Undecidability.TM.Util.TM_facts]
a:61 [in Complexity.NP.SAT.CookLevin.Subproblems.CC]
a:611 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:618 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
A:62 [in Undecidability.L.Tactics.LClos]
a:62 [in Complexity.L.ComparisonTimeBoundDerivation]
a:62 [in Undecidability.L.Datatypes.LVector]
A:62 [in Undecidability.L.Tactics.Reflection]
A:62 [in Undecidability.Synthetic.Infinite]
a:628 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:63 [in Undecidability.Shared.Libs.PSL.Retracts]
a:63 [in Undecidability.L.Tactics.LClos]
A:63 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
a:63 [in Complexity.Libs.CookPrelim.FlatFinTypes]
A:63 [in Complexity.TM.PrettyBounds.BaseCodeSpace]
a:63 [in Complexity.NP.Clique.kSAT_to_Clique]
a:63 [in Undecidability.TM.Hoare.HoareMult]
a:63 [in Undecidability.TM.L.HeapInterpreter.LookupTM]
a:63 [in Undecidability.Shared.Libs.PSL.FiniteTypes.FiniteFunction]
a:638 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
A:64 [in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
a:64 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
a:64 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
a:64 [in Complexity.Libs.CookPrelim.MorePrelim]
a:646 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
A:65 [in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
a:65 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
A:65 [in Undecidability.Shared.Libs.PSL.FiniteTypes.Arbitrary]
a:65 [in Undecidability.TM.Hoare.HoareMult]
a:654 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:66 [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
A:66 [in Undecidability.L.Tactics.LClos]
A:66 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
a:66 [in Undecidability.TM.Util.Prelim]
a:66 [in Complexity.L.ComparisonTimeBoundDerivation]
a:66 [in Complexity.Complexity.UpToCPoly]
a:66 [in Complexity.L.TM.TMunflatten]
a:66 [in Complexity.NP.SAT.CookLevin.Subproblems.CC]
a:661 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:665 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
a:67 [in Undecidability.L.Tactics.Extract]
a:67 [in Complexity.L.TM.TMunflatten]
a:671 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
A:68 [in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
a:68 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
A:68 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
a:68 [in Complexity.Libs.CookPrelim.PolyBounds]
a:68 [in Complexity.NP.SAT.CookLevin.Subproblems.CC]
a:68 [in Complexity.Libs.CookPrelim.MorePrelim]
a:681 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:69 [in Undecidability.TM.Util.Prelim]
a:69 [in Complexity.L.TM.TMflatComp]
a:69 [in Undecidability.TM.L.HeapInterpreter.StepTM]
a:69 [in Undecidability.TM.L.HeapInterpreter.LookupTM]
a:697 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
A:7 [in Complexity.Libs.Pigeonhole]
A:7 [in Undecidability.L.Tactics.LClos]
A:7 [in Undecidability.Shared.Libs.PSL.Lists.Position]
a:7 [in Undecidability.Shared.Libs.DLW.Utils.interval]
A:7 [in Undecidability.Shared.Libs.PSL.Inhabited]
A:7 [in Undecidability.L.Datatypes.List.List_extra]
a:7 [in Complexity.NP.SAT.FSAT.FSAT]
A:7 [in Undecidability.Shared.Libs.PSL.FiniteTypes.Arbitrary]
A:7 [in Undecidability.Shared.ListAutomation]
a:7 [in Undecidability.TM.Univ.Univ]
A:7 [in Undecidability.L.Prelim.MoreList]
a:70 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
A:70 [in Complexity.NP.L.CanEnumTerm]
A:70 [in Undecidability.L.Tactics.GenEncode]
a:70 [in Complexity.Libs.CookPrelim.PolyBounds]
a:704 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:71 [in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
a:71 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
a:71 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
a:71 [in Undecidability.TM.L.HeapInterpreter.StepTM]
a:71 [in Complexity.NP.SAT.CookLevin.Subproblems.CC]
a:71 [in Complexity.NP.TM.LM_to_mTM]
a:71 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
a:714 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
A:72 [in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
A:72 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
a:72 [in Undecidability.TM.Util.Prelim]
A:72 [in Complexity.L.TM.TMflatComp]
A:72 [in Undecidability.L.Tactics.Reflection]
A:72 [in Complexity.Libs.CookPrelim.MorePrelim]
a:724 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
A:73 [in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
A:73 [in Complexity.Libs.CookPrelim.FlatFinTypes]
a:73 [in Complexity.L.AbstractMachines.AbstractHeapMachine]
a:73 [in Undecidability.L.Tactics.Reflection]
a:73 [in Undecidability.TM.L.HeapInterpreter.LookupTM]
a:73 [in Undecidability.Shared.Libs.DLW.Code.subcode]
A:73 [in Complexity.NP.TM.LM_to_mTM]
a:73 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
A:74 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
a:74 [in Complexity.Libs.CookPrelim.FlatFinTypes]
a:74 [in Complexity.L.TM.TMunflatten]
a:74 [in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
a:740 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:749 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:75 [in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
a:75 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
A:75 [in Complexity.NP.L.CanEnumTerm]
a:75 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
a:758 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
A:76 [in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
a:76 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
A:76 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
A:76 [in Complexity.L.TM.TMflatComp]
a:76 [in Complexity.Libs.CookPrelim.PolyBounds]
A:76 [in Undecidability.L.Tactics.Reflection]
a:76 [in Complexity.NP.SAT.CookLevin.Subproblems.CC]
a:76 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
a:77 [in Complexity.TM.PrettyBounds.BaseCode]
a:77 [in Undecidability.TM.Univ.LowLevel]
a:77 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
a:77 [in Undecidability.TM.L.HeapInterpreter.StepTM]
a:77 [in Undecidability.L.Tactics.Reflection]
A:78 [in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
a:78 [in Complexity.L.TM.TMflatComp]
a:78 [in Complexity.Libs.CookPrelim.PolyBounds]
A:78 [in Undecidability.L.Tactics.Reflection]
a:78 [in Undecidability.Shared.Libs.DLW.Code.subcode]
a:788 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:79 [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
a:79 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
a:79 [in Undecidability.L.Tactics.Reflection]
a:79 [in Undecidability.TM.L.HeapInterpreter.LookupTM]
a:79 [in Complexity.NP.SAT.CookLevin.Subproblems.CC]
a:791 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:794 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
A:8 [in Complexity.Libs.Pigeonhole]
A:8 [in Undecidability.Shared.FilterFacts]
a:8 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
a:8 [in Undecidability.TM.Code.BinNumbers.PosMultTM]
A:8 [in Undecidability.L.Computability.Enum]
a:8 [in Complexity.NP.SAT.SharedSAT]
A:8 [in Undecidability.Shared.Libs.PSL.Lists.Filter]
a:8 [in Undecidability.L.AbstractMachines.FlatPro.UnfoldClos]
a:8 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
A:8 [in Undecidability.Shared.Libs.PSL.Lists.Dupfree]
A:8 [in Undecidability.L.Complexity.GenericNary]
A:8 [in Undecidability.Shared.Libs.PSL.Lists.Cardinality]
a:8 [in Complexity.NP.SAT.SAT]
a:8 [in Undecidability.Shared.Libs.PSL.FiniteTypes.FiniteFunction]
A:80 [in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
A:80 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
a:80 [in Undecidability.Shared.Libs.DLW.Utils.sums]
a:80 [in Complexity.Complexity.UpToCPoly]
a:80 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:800 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:809 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
A:81 [in Undecidability.L.Datatypes.LVector]
a:81 [in Undecidability.TM.Univ.LowLevel]
a:818 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
A:82 [in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
A:82 [in Complexity.L.TM.CompCode]
a:82 [in Undecidability.TM.Univ.LowLevel]
a:82 [in Complexity.Complexity.UpToCPoly]
a:82 [in Undecidability.Shared.Libs.DLW.Code.subcode]
A:83 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
a:83 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
a:83 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
A:83 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
a:83 [in Undecidability.TM.Univ.LowLevel]
A:83 [in Complexity.L.TM.TMunflatten]
a:83 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
A:84 [in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
a:84 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
a:84 [in Complexity.L.ComparisonTimeBoundDerivation]
a:84 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
a:84 [in Undecidability.TM.L.HeapInterpreter.LookupTM]
a:84 [in Complexity.Libs.CookPrelim.MorePrelim]
a:848 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
A:85 [in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
a:85 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
A:85 [in Undecidability.L.Tactics.Reflection]
a:851 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:854 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:86 [in Undecidability.Shared.Libs.PSL.Retracts]
a:86 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
a:86 [in Complexity.L.ComparisonTimeBoundDerivation]
A:86 [in Complexity.L.TM.CompCode]
a:86 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
a:86 [in Undecidability.Shared.Libs.DLW.Utils.php]
a:86 [in Complexity.L.TM.TMunflatten]
A:86 [in Undecidability.L.Tactics.Reflection]
a:860 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
a:860 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:869 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
A:87 [in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
a:87 [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
a:87 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
A:87 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
a:87 [in Complexity.Complexity.UpToCPoly]
a:87 [in Complexity.NP.SAT.CookLevin.Subproblems.CC]
a:87 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
a:878 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
A:88 [in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
A:88 [in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
a:88 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
a:88 [in Complexity.L.ComparisonTimeBoundDerivation]
a:88 [in Undecidability.TM.Univ.LowLevel]
a:88 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:88 [in Complexity.NP.Clique.kSAT_to_Clique]
a:88 [in Undecidability.TM.L.HeapInterpreter.LookupTM]
A:89 [in Undecidability.Shared.Libs.PSL.Retracts]
a:89 [in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
A:89 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
a:89 [in Complexity.NP.SAT.CookLevin.Subproblems.CC]
a:89 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
a:89 [in Complexity.Libs.CookPrelim.MorePrelim]
A:9 [in Complexity.Libs.Pigeonhole]
a:9 [in Undecidability.L.Datatypes.LProd]
A:9 [in Undecidability.Shared.Libs.PSL.FCI]
A:9 [in Complexity.NP.L.CanEnumTerm]
A:9 [in Undecidability.L.Tactics.GenEncode]
A:9 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
a:9 [in Undecidability.TM.Util.Prelim]
a:9 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
A:9 [in Undecidability.Shared.Libs.PSL.Lists.Power]
A:9 [in Undecidability.Shared.Libs.PSL.Lists.Dupfree]
A:9 [in Undecidability.Synthetic.ListEnumerabilityFacts]
A:9 [in Undecidability.Synthetic.Infinite]
a:9 [in Undecidability.Shared.ListAutomation]
A:9 [in Undecidability.Shared.Libs.PSL.FiniteTypes.Cardinality]
a:9 [in Undecidability.TM.Univ.Univ]
a:90 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
A:90 [in Undecidability.L.Tactics.LClos]
a:90 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
a:90 [in Complexity.L.ComparisonTimeBoundDerivation]
a:90 [in Undecidability.TM.Compound.Compare]
a:908 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:91 [in Complexity.TM.PrettyBounds.M2MBounds]
a:91 [in Complexity.NP.SAT.SAT_inNP]
a:91 [in Undecidability.Shared.Libs.DLW.Utils.sums]
a:91 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
a:91 [in Undecidability.L.Tactics.Reflection]
a:911 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:914 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:92 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
A:92 [in Undecidability.L.Tactics.LClos]
A:92 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
a:92 [in Complexity.Libs.CookPrelim.FlatFinTypes]
a:92 [in Undecidability.TM.L.HeapInterpreter.LookupTM]
a:93 [in Complexity.NP.SAT.SAT_inNP]
a:94 [in Undecidability.Shared.Libs.DLW.Utils.php]
a:95 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
a:95 [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
a:95 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
A:95 [in Undecidability.L.Tactics.LClos]
a:95 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
a:95 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
A:95 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
a:95 [in Complexity.NP.SAT.SAT_inNP]
a:95 [in Undecidability.TM.Compound.Compare]
a:95 [in Complexity.NP.SAT.CookLevin.Subproblems.CC]
a:96 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
a:96 [in Undecidability.TM.Lifting.LiftTapes]
a:96 [in Undecidability.TM.L.HeapInterpreter.LookupTM]
a:96 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
a:964 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
a:97 [in Complexity.TM.PrettyBounds.M2MBounds]
a:97 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
a:97 [in Complexity.NP.SAT.SAT_inNP]
a:975 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
A:98 [in Undecidability.Shared.Libs.PSL.Retracts]
A:98 [in Complexity.TM.PrettyBounds.UnivBounds]
a:98 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
a:98 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
A:98 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
a:98 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
a:98 [in Undecidability.TM.Compound.Compare]
a:98 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
a:99 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
a:99 [in Complexity.Complexity.UpToCPoly]
a:99 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]

B

bas:231 [in Undecidability.Shared.Libs.DLW.Vec.vec]
bb:58 [in Undecidability.Shared.Libs.DLW.Utils.php]
bb:80 [in Undecidability.Shared.Libs.DLW.Utils.php]
beta:100 [in Complexity.L.AbstractMachines.AbstractHeapMachine]
beta:108 [in Complexity.L.AbstractMachines.AbstractHeapMachine]
beta:12 [in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisUnfoldClos]
beta:27 [in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisStep]
beta:5 [in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisUnfoldClos]
beta:5 [in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisStep]
Bfin:3144 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Bflat:3148 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
bitsx:15 [in Undecidability.TM.Code.BinNumbers.PosShiftTM]
bitsx:22 [in Undecidability.TM.Code.BinNumbers.PosMultTM]
bitsx:31 [in Undecidability.TM.Code.BinNumbers.PosShiftTM]
bitsx:40 [in Undecidability.TM.Code.BinNumbers.PosMultTM]
bitsx:71 [in Undecidability.TM.Code.BinNumbers.PosShiftTM]
bitsx:87 [in Undecidability.TM.Code.BinNumbers.PosShiftTM]
bits0:17 [in Undecidability.TM.Code.BinNumbers.PosCompareTM]
bits0:43 [in Undecidability.TM.Code.BinNumbers.PosPointers]
bits0:52 [in Undecidability.TM.Code.BinNumbers.PosAddTM]
bits0:53 [in Undecidability.TM.Code.BinNumbers.PosCompareTM]
bits0:59 [in Undecidability.TM.Code.BinNumbers.PosCompareTM]
bits0:8 [in Undecidability.TM.Code.BinNumbers.PosCompareTM]
bits0:85 [in Undecidability.TM.Code.BinNumbers.PosAddTM]
bits1:11 [in Undecidability.TM.Code.BinNumbers.PosCompareTM]
bits1:22 [in Undecidability.TM.Code.BinNumbers.PosCompareTM]
bits1:23 [in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
bits1:32 [in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
bits1:38 [in Undecidability.TM.Code.BinNumbers.PosDefinitions]
bits1:46 [in Undecidability.TM.Code.BinNumbers.PosPointers]
bits1:55 [in Undecidability.TM.Code.BinNumbers.PosAddTM]
bits1:56 [in Undecidability.TM.Code.BinNumbers.PosCompareTM]
bits1:59 [in Undecidability.TM.Code.BinNumbers.PosAddTM]
bits1:64 [in Undecidability.TM.Code.BinNumbers.PosCompareTM]
bits1:88 [in Undecidability.TM.Code.BinNumbers.PosAddTM]
bits1:92 [in Undecidability.TM.Code.BinNumbers.PosAddTM]
bits2:26 [in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
bits2:39 [in Undecidability.TM.Code.BinNumbers.PosDefinitions]
bits2:39 [in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
bits:10 [in Undecidability.TM.Code.BinNumbers.PosDefinitions]
bits:13 [in Undecidability.TM.Code.BinNumbers.PosIncrementTM]
bits:14 [in Undecidability.TM.Code.BinNumbers.PosIncrementTM]
bits:15 [in Undecidability.TM.Code.BinNumbers.PosDefinitions]
bits:17 [in Undecidability.TM.Code.BinNumbers.PosDefinitions]
bits:18 [in Undecidability.TM.Code.BinNumbers.PosDefinitions]
bits:20 [in Undecidability.TM.Code.BinNumbers.PosIncrementTM]
bits:21 [in Undecidability.TM.Code.BinNumbers.PosDefinitions]
bits:23 [in Undecidability.TM.Code.BinNumbers.PosDefinitions]
bits:25 [in Undecidability.TM.Code.BinNumbers.PosDefinitions]
bits:26 [in Undecidability.TM.Code.BinNumbers.PosDefinitions]
bits:27 [in Undecidability.TM.Code.BinNumbers.PosDefinitions]
bits:28 [in Undecidability.TM.Code.BinNumbers.PosAddTM]
bits:30 [in Undecidability.TM.Code.BinNumbers.PosAddTM]
bits:34 [in Undecidability.TM.Code.BinNumbers.PosDefinitions]
bits:35 [in Undecidability.TM.Code.BinNumbers.PosDefinitions]
bits:36 [in Undecidability.TM.Code.BinNumbers.PosDefinitions]
bits:40 [in Undecidability.TM.Code.BinNumbers.PosAddTM]
bits:53 [in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
bits:7 [in Undecidability.TM.Code.BinNumbers.PosIncrementTM]
bits:74 [in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
bits:80 [in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
bits:87 [in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
bits:9 [in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
bit:1 [in Undecidability.TM.Code.BinNumbers.PosShiftTM]
bit:22 [in Undecidability.TM.Code.BinNumbers.PosDefinitions]
bit:24 [in Undecidability.TM.Code.BinNumbers.PosDefinitions]
bit:7 [in Undecidability.TM.Code.BinNumbers.PosShiftTM]
bit:8 [in Undecidability.TM.Code.BinNumbers.PosShiftTM]
body:107 [in Undecidability.L.Tactics.Extract]
body:23 [in Undecidability.L.Complexity.GenericNary]
body:27 [in Undecidability.L.Complexity.GenericNary]
body:30 [in Undecidability.L.Tactics.GenEncode]
body:30 [in Undecidability.L.Complexity.GenericNary]
body:35 [in Undecidability.L.Complexity.GenericNary]
body:38 [in Undecidability.L.Complexity.GenericNary]
body:43 [in Undecidability.L.Complexity.GenericNary]
body:76 [in Undecidability.L.Complexity.GenericNary]
boundL:22 [in Undecidability.L.Functions.LoopSum]
boundL:32 [in Undecidability.L.Functions.UnboundIteration]
boundR:23 [in Undecidability.L.Functions.LoopSum]
boundR:33 [in Undecidability.L.Functions.UnboundIteration]
bpr:103 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
bpr:106 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
bpr:110 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
bpr:115 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
bpr:119 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
bpr:120 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
bpr:127 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
bpr:133 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
bpr:139 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
bpr:144 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
bpr:150 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
bpr:155 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
bpr:157 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
bpr:160 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
bpr:162 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
bpr:165 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
bpr:167 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
bpr:168 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
bpr:172 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
bpr:173 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
bpr:175 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
bpr:176 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
bpr:183 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
bpr:189 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
bpr:195 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
bpr:200 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
bpr:206 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
bpr:211 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
bpr:215 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
bpr:219 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
bpr:224 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
bpr:228 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
bpr:231 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
bpr:234 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
bpr:237 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
bpr:239 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
bpr:241 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
bpr:243 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
bpr:246 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
bpr:248 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
bpr:251 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
bpr:255 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
bpr:256 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
bpr:258 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
bpr:259 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
bpr:262 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
bpr:265 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
bpr:268 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
bpr:272 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
bpr:273 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
bpr:83 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
bpr:84 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
bpr:85 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
bpr:86 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
bs:10 [in Complexity.NP.L.CanEnumTerm]
bs:10 [in Complexity.NP.TM.M_LM2TM]
bs:102 [in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
bs:106 [in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
bs:11 [in Complexity.NP.TM.M_LM2TM]
bs:110 [in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
bs:113 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
bs:119 [in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
bs:12 [in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
bs:124 [in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
bs:128 [in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
bs:13 [in Undecidability.TM.L.Transcode.Boollist_to_Enc]
bs:13 [in Complexity.NP.L.CanEnumTerm]
bs:13 [in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
bs:13 [in Undecidability.TM.L.Transcode.Enc_to_Boollist]
bs:136 [in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
bs:138 [in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
bs:139 [in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
bs:14 [in Undecidability.TM.L.Transcode.Enc_to_Boollist]
bs:140 [in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
bs:15 [in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
bs:16 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
bs:17 [in Complexity.NP.L.CanEnumTerm]
bs:19 [in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
bs:19 [in Undecidability.TM.L.Transcode.Enc_to_Boollist]
bs:2 [in Undecidability.TM.L.Transcode.BoollistEnc]
bs:20 [in Undecidability.TM.L.Transcode.Boollist_to_Enc]
bs:21 [in Complexity.NP.TM.M_LM2TM]
bs:21 [in Undecidability.TM.L.Transcode.Enc_to_Boollist]
bs:22 [in Complexity.NP.TM.M_LM2TM]
bs:22 [in Complexity.TM.Single.DecodeTape]
bs:24 [in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
bs:24 [in Complexity.NP.TM.M_LM2TM]
bs:24 [in Undecidability.TM.L.Transcode.Enc_to_Boollist]
bs:25 [in Complexity.NP.TM.M_LM2TM]
bs:25 [in Undecidability.TM.L.Transcode.Enc_to_Boollist]
bs:26 [in Complexity.TM.Code.DecodeList]
bs:26 [in Complexity.TM.Single.DecodeTape]
bs:26 [in Complexity.NP.TM.LM_to_mTM]
bs:27 [in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
bs:27 [in Complexity.TM.Single.DecodeTape]
bs:27 [in Undecidability.TM.L.Transcode.Enc_to_Boollist]
bs:3 [in Complexity.NP.L.CanEnumTerm]
bs:3 [in Undecidability.TM.L.Transcode.BoollistEnc]
bs:30 [in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
bs:30 [in Undecidability.TM.L.Transcode.Enc_to_Boollist]
bs:31 [in Complexity.TM.Single.DecodeTape]
bs:32 [in Undecidability.TM.L.Transcode.Boollist_to_Enc]
bs:32 [in Complexity.NP.TM.LM_to_mTM]
bs:33 [in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
bs:33 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
bs:33 [in Complexity.TM.Single.DecodeTape]
bs:33 [in Undecidability.TM.L.CompilerBoolFuns.Compiler]
bs:34 [in Undecidability.TM.L.Transcode.Enc_to_Boollist]
bs:36 [in Complexity.TM.Single.DecodeTape]
bs:37 [in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
bs:38 [in Undecidability.TM.L.Transcode.Enc_to_Boollist]
bs:39 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
bs:39 [in Complexity.TM.Single.DecodeTape]
bs:40 [in Complexity.NP.TM.LM_to_mTM]
bs:41 [in Undecidability.TM.L.Transcode.Boollist_to_Enc]
bs:41 [in Complexity.TM.Single.DecodeTape]
bs:41 [in Undecidability.TM.L.Transcode.Enc_to_Boollist]
bs:42 [in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
bs:44 [in Undecidability.TM.L.Transcode.Boollist_to_Enc]
bs:44 [in Undecidability.TM.L.Transcode.Enc_to_Boollist]
bs:45 [in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
bs:46 [in Undecidability.TM.L.Transcode.Boollist_to_Enc]
bs:47 [in Undecidability.TM.L.Transcode.Enc_to_Boollist]
bs:48 [in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
bs:5 [in Undecidability.TM.L.Transcode.Enc_to_Boollist]
bs:51 [in Undecidability.TM.L.Transcode.Enc_to_Boollist]
bs:53 [in Complexity.L.AbstractMachines.FlatPro.Computable.Compile]
bs:54 [in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
bs:54 [in Complexity.L.AbstractMachines.FlatPro.Computable.Compile]
bs:55 [in Undecidability.TM.L.Transcode.Enc_to_Boollist]
bs:56 [in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
bs:56 [in Undecidability.TM.L.CompilerBoolFuns.Compiler]
bs:57 [in Undecidability.TM.L.CompilerBoolFuns.Compiler]
bs:58 [in Undecidability.TM.L.Transcode.Enc_to_Boollist]
bs:588 [in Complexity.NP.TM.LM_to_mTM]
bs:592 [in Complexity.NP.TM.LM_to_mTM]
bs:6 [in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
bs:6 [in Undecidability.TM.L.Transcode.BoollistEnc]
bs:60 [in Complexity.NP.L.CanEnumTerm]
bs:60 [in Undecidability.TM.L.Transcode.Enc_to_Boollist]
bs:62 [in Complexity.NP.L.CanEnumTerm]
bs:62 [in Undecidability.TM.L.Transcode.Enc_to_Boollist]
bs:63 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
bs:64 [in Complexity.TM.Single.DecodeTape]
bs:65 [in Undecidability.TM.L.CompilerBoolFuns.Compiler]
bs:66 [in Undecidability.TM.L.CompilerBoolFuns.Compiler]
bs:68 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
bs:69 [in Complexity.NP.L.CanEnumTerm]
bs:69 [in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
bs:69 [in Complexity.TM.Single.DecodeTape]
bs:7 [in Undecidability.TM.L.Transcode.Boollist_to_Enc]
bs:7 [in Undecidability.TM.L.Transcode.Enc_to_Boollist]
bs:7 [in Undecidability.TM.L.Transcode.BoollistEnc]
bs:71 [in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
bs:72 [in Undecidability.TM.L.CompilerBoolFuns.Compiler]
bs:74 [in Complexity.NP.L.CanEnumTerm]
bs:76 [in Complexity.NP.L.CanEnumTerm]
bs:76 [in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
bs:77 [in Complexity.NP.L.CanEnumTerm]
bs:77 [in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
bs:8 [in Complexity.NP.L.CanEnumTerm]
bs:8 [in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
bs:80 [in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
bs:84 [in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
bs:92 [in Undecidability.TM.L.CompilerBoolFuns.Compiler]
bs:93 [in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
bs:98 [in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
bs:98 [in Undecidability.TM.L.CompilerBoolFuns.Compiler]
bx:14 [in Undecidability.TM.Code.BinNumbers.PosShiftTM]
bx:21 [in Undecidability.TM.Code.BinNumbers.PosMultTM]
bx:30 [in Undecidability.TM.Code.BinNumbers.PosShiftTM]
bx:39 [in Undecidability.TM.Code.BinNumbers.PosMultTM]
bx:70 [in Undecidability.TM.Code.BinNumbers.PosShiftTM]
bx:86 [in Undecidability.TM.Code.BinNumbers.PosShiftTM]
B_int:68 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
b__R:7 [in Complexity.TM.Single.EncodeTapesInvariants]
b__L:6 [in Complexity.TM.Single.EncodeTapesInvariants]
B':101 [in Undecidability.Shared.Libs.PSL.Retracts]
B':113 [in Undecidability.Shared.Libs.PSL.Retracts]
B':128 [in Undecidability.Shared.Libs.PSL.Retracts]
b':14 [in Undecidability.TM.Util.Prelim]
B':146 [in Undecidability.Shared.Libs.PSL.Retracts]
b':15 [in Undecidability.TM.Code.BinNumbers.PosPointers]
b':157 [in Complexity.L.TM.TMunflatten]
b':180 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
b':189 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
b':21 [in Undecidability.Shared.Libs.PSL.FiniteTypes.FiniteFunction]
B':2665 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
B':2684 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b':2686 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b':27 [in Complexity.TM.Single.EncodeTapesInvariants]
b':2708 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b':28 [in Undecidability.TM.Code.BinNumbers.PosPointers]
b':3650 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b':38 [in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
b':40 [in Undecidability.L.Functions.FinTypeLookup]
b':43 [in Undecidability.TM.Util.Prelim]
b':48 [in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
b':66 [in Complexity.Libs.CookPrelim.MorePrelim]
B':70 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
b':75 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
b':79 [in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
b':83 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
b':86 [in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
b':89 [in Complexity.L.TM.TMunflatten]
B':92 [in Undecidability.Shared.Libs.PSL.Retracts]
b0:16 [in Undecidability.TM.Code.BinNumbers.PosCompareTM]
b0:42 [in Undecidability.TM.Code.BinNumbers.PosPointers]
b0:49 [in Undecidability.TM.Code.BinNumbers.PosPointers]
b0:51 [in Undecidability.TM.Code.BinNumbers.PosAddTM]
b0:52 [in Undecidability.TM.Code.BinNumbers.PosCompareTM]
b0:58 [in Undecidability.TM.Code.BinNumbers.PosCompareTM]
b0:7 [in Undecidability.TM.Code.BinNumbers.PosCompareTM]
b0:84 [in Undecidability.TM.Code.BinNumbers.PosAddTM]
b1:10 [in Undecidability.TM.Code.BinNumbers.PosCompareTM]
b1:11 [in Complexity.TM.Code.DecodeList]
b1:11 [in Undecidability.Synthetic.DecidabilityFacts]
b1:12 [in Complexity.NP.SAT.SAT]
b1:14 [in Complexity.NP.Clique.kSAT_to_FlatClique]
b1:15 [in Complexity.NP.Clique.kSAT_to_Clique]
b1:17 [in Complexity.TM.Single.DecodeTapes]
b1:18 [in Complexity.NP.SAT.SAT]
b1:21 [in Undecidability.TM.Code.BinNumbers.PosCompareTM]
b1:22 [in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
b1:31 [in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
b1:34 [in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
b1:35 [in Undecidability.Shared.Libs.PSL.FiniteTypes.FiniteFunction]
b1:42 [in Undecidability.L.Functions.FinTypeLookup]
b1:45 [in Undecidability.TM.Code.BinNumbers.PosPointers]
b1:5 [in Undecidability.TM.Code.CasePair]
b1:5 [in Undecidability.TM.Code.List.App]
b1:51 [in Undecidability.TM.Code.BinNumbers.PosPointers]
b1:53 [in Undecidability.L.Functions.FinTypeLookup]
b1:54 [in Undecidability.TM.Code.BinNumbers.PosAddTM]
b1:55 [in Undecidability.TM.Code.BinNumbers.PosCompareTM]
b1:58 [in Undecidability.TM.Code.BinNumbers.PosAddTM]
b1:59 [in Complexity.L.TM.TMunflatten]
b1:63 [in Undecidability.TM.Code.BinNumbers.PosCompareTM]
b1:7 [in Undecidability.Synthetic.DecidabilityFacts]
b1:70 [in Complexity.Libs.CookPrelim.MorePrelim]
b1:87 [in Undecidability.TM.Code.BinNumbers.PosAddTM]
b1:91 [in Complexity.L.TM.TMunflatten]
b1:91 [in Undecidability.TM.Code.BinNumbers.PosAddTM]
b2:12 [in Undecidability.Synthetic.DecidabilityFacts]
b2:13 [in Complexity.NP.SAT.SAT]
b2:16 [in Complexity.NP.Clique.kSAT_to_FlatClique]
b2:17 [in Complexity.NP.Clique.kSAT_to_Clique]
b2:19 [in Complexity.NP.SAT.SAT]
b2:25 [in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
b2:36 [in Undecidability.Shared.Libs.PSL.FiniteTypes.FiniteFunction]
b2:38 [in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
b2:43 [in Undecidability.L.Functions.FinTypeLookup]
b2:54 [in Undecidability.L.Functions.FinTypeLookup]
b2:6 [in Undecidability.TM.Code.CasePair]
b2:6 [in Undecidability.TM.Code.List.App]
b2:60 [in Complexity.L.TM.TMunflatten]
b2:71 [in Complexity.Libs.CookPrelim.MorePrelim]
b2:8 [in Undecidability.Synthetic.DecidabilityFacts]
b2:92 [in Complexity.L.TM.TMunflatten]
b:1 [in Undecidability.L.Datatypes.LBool]
b:1 [in Undecidability.TM.L.Transcode.BoollistEnc]
b:10 [in Undecidability.L.Datatypes.LProd]
B:10 [in Undecidability.Shared.Libs.PSL.FCI]
b:10 [in Undecidability.Shared.Libs.PSL.Prelim]
B:10 [in Undecidability.Shared.Libs.PSL.Lists.Dupfree]
B:100 [in Undecidability.Shared.Libs.PSL.Retracts]
b:100 [in Complexity.Complexity.UpToCPoly]
b:1007 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
b:101 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
b:101 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
b:1010 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
b:1019 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
B:102 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
b:102 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
b:102 [in Undecidability.TM.L.HeapInterpreter.StepTM]
b:1020 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
b:1021 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:1023 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:1028 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:103 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
b:103 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
b:1036 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
B:104 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
b:1043 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
b:1044 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:1045 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
b:105 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
b:106 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
B:106 [in Complexity.L.TM.CompCode]
b:1068 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
b:107 [in Complexity.NP.SAT.CookLevin.Subproblems.CC]
b:1073 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:1075 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:1077 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
B:108 [in Undecidability.L.Tactics.Extract]
B:108 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
b:108 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
b:109 [in Complexity.TM.Single.DecodeTape]
B:11 [in Undecidability.L.Complexity.UpToCNary]
b:11 [in Undecidability.Shared.Libs.PSL.Prelim]
b:11 [in Undecidability.TM.Combinators.If]
b:11 [in Undecidability.TM.Code.NatSub]
b:11 [in Undecidability.TM.Hoare.HoareMult]
b:11 [in Complexity.NP.SAT.SAT]
b:11 [in Undecidability.TM.L.HeapInterpreter.LookupTM]
B:11 [in Undecidability.L.Prelim.MoreList]
B:110 [in Complexity.L.TM.CompCode]
b:110 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
B:112 [in Undecidability.Shared.Libs.PSL.Retracts]
b:112 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
b:113 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
b:115 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
b:115 [in Complexity.NP.SAT.CookLevin.Subproblems.CC]
b:117 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
b:119 [in Complexity.NP.SAT.CookLevin.Subproblems.CC]
B:12 [in Complexity.Libs.Pigeonhole]
b:12 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
B:12 [in Undecidability.L.Computability.Enum]
b:12 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
B:12 [in Complexity.L.TM.TMflatComp]
b:12 [in Complexity.L.Functions.BinNumsSub]
b:12 [in Undecidability.TM.Combinators.If]
b:12 [in Complexity.TM.Single.DecodeTapes]
B:12 [in Undecidability.L.TM.TMEncoding]
b:12 [in Undecidability.TM.Code.Code]
B:12 [in Undecidability.Shared.Libs.PSL.FiniteTypes.Cardinality]
B:12 [in Undecidability.TM.Code.List.App]
B:12 [in Undecidability.Shared.Libs.PSL.FiniteTypes.FiniteFunction]
b:120 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
b:120 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
b:122 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
b:122 [in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
b:123 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
b:123 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
b:124 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
b:124 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
b:124 [in Undecidability.TM.Hoare.HoareExamples]
b:124 [in Complexity.Libs.CookPrelim.MorePrelim]
b:126 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
B:127 [in Undecidability.Shared.Libs.PSL.Retracts]
b:128 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
b:128 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
B:13 [in Complexity.Libs.Pigeonhole]
B:13 [in Undecidability.L.Datatypes.LOptions]
b:13 [in Undecidability.TM.Code.BinNumbers.PosDefinitions]
b:13 [in Undecidability.TM.Util.Prelim]
b:13 [in Undecidability.L.Computability.Por]
b:130 [in Undecidability.TM.Hoare.HoareExamples]
B:131 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
b:132 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
b:132 [in Undecidability.TM.Hoare.HoareExamples]
b:132 [in Complexity.NP.Clique.kSAT_to_FlatClique]
B:133 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
b:133 [in Undecidability.TM.Hoare.HoareExamples]
b:133 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
b:134 [in Complexity.NP.SAT.CookLevin.Subproblems.CC]
B:135 [in Complexity.L.TM.CompCode]
b:136 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
b:136 [in Undecidability.TM.Hoare.HoareExamples]
b:138 [in Complexity.Libs.CookPrelim.PolyBounds]
B:139 [in Complexity.L.TM.CompCode]
b:139 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
b:139 [in Complexity.L.AbstractMachines.AbstractHeapMachine]
b:139 [in Complexity.Libs.CookPrelim.MorePrelim]
B:14 [in Undecidability.Shared.Libs.PSL.Lists.Removal]
b:14 [in Undecidability.Shared.Libs.PSL.Prelim]
b:14 [in Undecidability.TM.Code.NatTM]
B:14 [in Undecidability.Shared.Libs.PSL.Lists.Position]
b:14 [in Undecidability.TM.Code.BinNumbers.PosPointers]
b:14 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
B:14 [in Undecidability.L.Tactics.ComputableTactics]
B:14 [in Undecidability.Shared.Libs.PSL.Lists.Cardinality]
b:14 [in Undecidability.L.Functions.FinTypeLookup]
b:140 [in Undecidability.TM.Hoare.HoareExamples]
b:141 [in Complexity.TM.PrettyBounds.UnivBounds]
B:141 [in Undecidability.TM.Compound.Compare]
b:141 [in Complexity.Libs.CookPrelim.MorePrelim]
B:143 [in Complexity.TM.PrettyBounds.UnivBounds]
b:143 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
b:144 [in Undecidability.TM.Hoare.HoareExamples]
b:144 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
B:145 [in Undecidability.Shared.Libs.PSL.Retracts]
b:145 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
b:145 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
b:146 [in Complexity.L.AbstractMachines.AbstractHeapMachine]
b:147 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
b:147 [in Undecidability.TM.Hoare.HoareExamples]
b:148 [in Complexity.Libs.CookPrelim.FlatFinTypes]
b:149 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
B:15 [in Undecidability.Shared.FilterFacts]
B:15 [in Undecidability.L.Complexity.UpToCNary]
b:15 [in Undecidability.Shared.Libs.PSL.Prelim]
b:15 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
B:15 [in Undecidability.Shared.Libs.PSL.Lists.Filter]
b:15 [in Undecidability.Synthetic.DecidabilityFacts]
b:15 [in Undecidability.L.Datatypes.List.List_in]
b:15 [in Undecidability.TM.Hoare.HoareMult]
b:15 [in Undecidability.Shared.Libs.PSL.FiniteTypes.FiniteFunction]
B:15 [in Undecidability.L.Prelim.MoreList]
b:150 [in Complexity.Libs.CookPrelim.PolyBounds]
b:150 [in Undecidability.Shared.Libs.DLW.Utils.php]
b:151 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
b:151 [in Undecidability.TM.Hoare.HoareExamples]
b:153 [in Complexity.Libs.CookPrelim.FlatFinTypes]
b:153 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
b:153 [in Undecidability.Shared.Libs.DLW.Utils.sums]
B:155 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
b:155 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
b:156 [in Complexity.L.TM.TMunflatten]
b:156 [in Undecidability.TM.Hoare.HoareExamples]
b:157 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
b:157 [in Undecidability.Shared.Libs.DLW.Utils.sums]
b:158 [in Undecidability.TM.Hoare.HoareExamples]
b:16 [in Complexity.L.AbstractMachines.Computable.UnivDecTime]
b:16 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
B:16 [in Undecidability.Shared.Libs.PSL.Lists.Cardinality]
B:16 [in Undecidability.Shared.Libs.PSL.FiniteTypes.Cardinality]
b:16 [in Undecidability.L.Computability.Por]
B:16 [in Undecidability.L.Prelim.MoreList]
b:160 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
b:160 [in Undecidability.Shared.Libs.DLW.Utils.php]
b:160 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
b:161 [in Undecidability.TM.Hoare.HoareExamples]
b:163 [in Complexity.Libs.CookPrelim.FlatFinTypes]
b:163 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
b:163 [in Undecidability.Shared.Libs.DLW.Utils.sums]
B:165 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
b:165 [in Complexity.Libs.CookPrelim.FlatFinTypes]
b:165 [in Undecidability.TM.Hoare.HoareExamples]
b:166 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
b:166 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
b:167 [in Undecidability.TM.Hoare.HoareExamples]
b:168 [in Undecidability.TM.Hoare.HoareExamples]
b:169 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
b:169 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
B:17 [in Undecidability.Shared.Libs.PSL.Lists.Removal]
B:17 [in Undecidability.L.Datatypes.LOptions]
b:17 [in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
b:17 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
b:17 [in Undecidability.TM.Util.Prelim]
B:17 [in Undecidability.Shared.Libs.PSL.Inhabited]
b:17 [in Undecidability.L.Functions.EqBool]
B:17 [in Undecidability.L.TM.TMEncoding]
B:17 [in Undecidability.Shared.ListAutomation]
B:17 [in Undecidability.Shared.Libs.PSL.FiniteTypes.Cardinality]
b:17 [in Complexity.NP.SAT.SAT]
B:17 [in Undecidability.Shared.Libs.PSL.FiniteTypes.FiniteFunction]
B:17 [in Complexity.Libs.CookPrelim.MorePrelim]
b:170 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
B:171 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
b:171 [in Undecidability.TM.Hoare.HoareExamples]
b:172 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
b:174 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
b:175 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
b:175 [in Undecidability.TM.Hoare.HoareExamples]
b:176 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
B:176 [in Complexity.Libs.CookPrelim.MorePrelim]
B:177 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
b:177 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
B:178 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
b:179 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
b:179 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
b:179 [in Undecidability.TM.Hoare.HoareExamples]
B:18 [in Complexity.TM.Single.EncodeTapesInvariants]
b:18 [in Undecidability.TM.Code.NatSub]
b:18 [in Undecidability.TM.Hoare.HoareMult]
b:18 [in Complexity.NP.Clique.kSAT_to_FlatClique]
b:18 [in Complexity.L.Functions.BinNumsAdd]
b:181 [in Undecidability.Shared.Libs.DLW.Utils.sums]
b:181 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
B:181 [in Complexity.Libs.CookPrelim.MorePrelim]
b:182 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
b:182 [in Undecidability.TM.Hoare.HoareExamples]
b:184 [in Undecidability.Shared.Libs.DLW.Utils.sums]
b:185 [in Undecidability.TM.Hoare.HoareExamples]
b:186 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
B:187 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
B:187 [in Complexity.Libs.CookPrelim.MorePrelim]
b:188 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
b:188 [in Undecidability.TM.Hoare.HoareExamples]
B:19 [in Undecidability.L.Complexity.UpToCNary]
b:19 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
b:19 [in Undecidability.TM.Code.BinNumbers.PosIncrementTM]
B:19 [in Undecidability.Shared.Libs.PSL.Inhabited]
B:19 [in Complexity.L.TM.CompCode]
b:19 [in Undecidability.TM.Code.BinNumbers.PosPointers]
b:19 [in Undecidability.L.Datatypes.List.List_in]
b:19 [in Complexity.L.Functions.BinNumsAdd]
b:190 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
B:191 [in Complexity.Libs.CookPrelim.MorePrelim]
b:192 [in Undecidability.TM.Hoare.HoareExamples]
b:193 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
b:193 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
b:193 [in Complexity.Libs.CookPrelim.MorePrelim]
b:196 [in Undecidability.TM.Hoare.HoareExamples]
B:197 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
b:197 [in Undecidability.TM.L.HeapInterpreter.StepTM]
B:197 [in Complexity.Libs.CookPrelim.MorePrelim]
B:199 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
b:199 [in Undecidability.TM.Hoare.HoareExamples]
b:2 [in Undecidability.TM.Code.BinNumbers.PosDefinitions]
b:2 [in Undecidability.L.Datatypes.LBool]
B:2 [in Undecidability.L.Computability.Enum]
B:2 [in Complexity.L.TM.CompCode]
b:2 [in Complexity.Libs.CookPrelim.Tactics]
B:2 [in Undecidability.L.Functions.EnumInt]
b:2 [in Undecidability.TM.Hoare.HoareMult]
B:2 [in Undecidability.TM.Code.CasePair]
B:2 [in Undecidability.TM.Code.List.App]
B:2 [in Undecidability.Shared.Libs.PSL.FiniteTypes.FiniteFunction]
B:20 [in Undecidability.Shared.Libs.PSL.Lists.Removal]
B:20 [in Undecidability.Shared.Libs.PSL.Inhabited]
b:20 [in Complexity.TM.Single.EncodeTapesInvariants]
b:20 [in Undecidability.Shared.Libs.DLW.Utils.crt]
b:20 [in Complexity.L.Functions.BinNumsSub]
b:20 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
B:20 [in Undecidability.L.TM.TMEncoding]
b:20 [in Undecidability.L.Computability.Computability]
b:20 [in Undecidability.Shared.Libs.PSL.FiniteTypes.FiniteFunction]
b:200 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
b:201 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
b:203 [in Undecidability.TM.Hoare.HoareExamples]
b:204 [in Undecidability.Shared.Libs.DLW.Utils.sums]
B:207 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
b:207 [in Undecidability.TM.Hoare.HoareExamples]
B:21 [in Undecidability.L.Computability.Enum]
b:21 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
b:21 [in Undecidability.L.Datatypes.List.List_in]
B:21 [in Undecidability.Shared.Libs.PSL.Lists.Cardinality]
B:21 [in Undecidability.Shared.ListAutomation]
b:21 [in Complexity.NP.SAT.SAT]
B:21 [in Complexity.Libs.CookPrelim.MorePrelim]
b:210 [in Undecidability.TM.Hoare.HoareExamples]
b:211 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
b:214 [in Undecidability.TM.Hoare.HoareExamples]
b:214 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
B:215 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
b:219 [in Undecidability.TM.Hoare.HoareExamples]
b:22 [in Undecidability.TM.Util.Prelim]
b:22 [in Complexity.Libs.CookPrelim.FlatFinTypes]
B:22 [in Undecidability.Shared.Libs.PSL.Inhabited]
B:22 [in Undecidability.Shared.Libs.PSL.FiniteTypes.VectorFin]
b:22 [in Undecidability.TM.Combinators.If]
B:22 [in Undecidability.TM.Code.ChangeAlphabet]
b:22 [in Undecidability.TM.Hoare.HoareMult]
b:221 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
b:2224 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
B:223 [in Complexity.Libs.CookPrelim.MorePrelim]
b:2233 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:224 [in Undecidability.TM.Hoare.HoareExamples]
b:2242 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:225 [in Undecidability.TM.Hoare.HoareCombinators]
b:2251 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:2260 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:2269 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:2278 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
B:228 [in Undecidability.Shared.Libs.DLW.Vec.vec]
b:228 [in Undecidability.TM.Hoare.HoareExamples]
b:2287 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:2296 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:23 [in Undecidability.L.Datatypes.LOptions]
b:23 [in Undecidability.Shared.Libs.PSL.Retracts]
b:23 [in Complexity.TM.Single.EncodeTapesInvariants]
B:23 [in Complexity.L.TM.CompCode]
B:23 [in Undecidability.L.TM.TMEncoding]
b:23 [in Undecidability.L.Datatypes.LNat]
B:23 [in Undecidability.Shared.Libs.PSL.FiniteTypes.FiniteFunction]
b:2304 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:2312 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:232 [in Undecidability.TM.Hoare.HoareExamples]
b:2320 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:2328 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:233 [in Undecidability.Shared.Libs.DLW.Utils.sums]
b:2336 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
B:234 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
b:2344 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:2352 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:236 [in Undecidability.Shared.Libs.DLW.Vec.vec]
B:236 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
b:236 [in Undecidability.TM.Hoare.HoareExamples]
b:2360 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:2368 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
B:24 [in Undecidability.L.Datatypes.LSum]
b:24 [in Complexity.Libs.CookPrelim.FlatFinTypes]
b:24 [in Undecidability.Shared.Libs.PSL.FiniteTypes.VectorFin]
b:24 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
B:24 [in Undecidability.Shared.Libs.PSL.Lists.Cardinality]
b:241 [in Undecidability.TM.Hoare.HoareExamples]
b:244 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
B:245 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
b:246 [in Undecidability.TM.Hoare.HoareExamples]
b:247 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
B:249 [in Undecidability.Shared.Libs.DLW.Vec.vec]
b:249 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
B:25 [in Undecidability.Shared.Libs.PSL.Inhabited]
B:25 [in Undecidability.L.Tactics.ComputableDemo]
b:25 [in Undecidability.L.Datatypes.LNat]
b:250 [in Undecidability.TM.Hoare.HoareExamples]
b:251 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
b:255 [in Undecidability.Shared.Libs.DLW.Vec.vec]
b:256 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
b:256 [in Undecidability.TM.Hoare.HoareExamples]
b:258 [in Undecidability.TM.Hoare.HoareExamples]
b:26 [in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
b:26 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
b:26 [in Undecidability.TM.Util.Prelim]
b:26 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
b:26 [in Undecidability.TM.Code.NatSub]
B:26 [in Undecidability.L.Datatypes.List.List_eqb]
b:26 [in Complexity.TM.Single.DecodeTapes]
B:26 [in Undecidability.Shared.Libs.PSL.Lists.Cardinality]
B:26 [in Undecidability.Shared.ListAutomation]
b:260 [in Undecidability.TM.Hoare.HoareExamples]
B:262 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
b:262 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
b:264 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
B:2658 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
B:266 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
b:266 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
B:2677 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:2679 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:269 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
b:2692 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
B:2699 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:27 [in Undecidability.TM.Code.BinNumbers.PosPointers]
B:27 [in Undecidability.L.Datatypes.List.List_extra]
b:27 [in Undecidability.TM.Hoare.HoareMult]
b:27 [in Complexity.Libs.CookPrelim.MorePrelim]
b:2700 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
B:2703 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:2706 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:273 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
b:28 [in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
b:28 [in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
B:28 [in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
B:28 [in Undecidability.L.Datatypes.LSum]
B:28 [in Undecidability.L.TM.TMEncoding]
b:282 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
b:29 [in Undecidability.Shared.Libs.DLW.Utils.crt]
B:29 [in Undecidability.L.Tactics.ComputableDemo]
b:29 [in Complexity.NP.SAT.SAT_inNP]
b:29 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
b:29 [in Undecidability.L.Functions.EqBool]
B:29 [in Undecidability.Shared.Libs.PSL.Lists.Cardinality]
B:29 [in Undecidability.Shared.Libs.PSL.FiniteTypes.FiniteFunction]
b:3 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
b:3 [in Undecidability.TM.Code.BinNumbers.PosDefinitions]
b:3 [in Complexity.L.TM.TMflatEnc]
B:3 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
b:3 [in Undecidability.TM.Compound.CopySymbols]
B:3 [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
b:3 [in Undecidability.TM.Code.NatSub]
b:3 [in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
b:30 [in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
b:30 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
b:30 [in Complexity.Libs.CookPrelim.FlatFinTypes]
b:30 [in Undecidability.Shared.Libs.DLW.Utils.sums]
B:30 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
b:3030 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:3035 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:3049 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
B:31 [in Undecidability.Shared.Libs.PSL.Lists.Removal]
b:31 [in Undecidability.Shared.Libs.PSL.EqDec]
B:31 [in Undecidability.L.Datatypes.List.List_extra]
b:31 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
B:31 [in Undecidability.L.Datatypes.List.List_eqb]
B:31 [in Undecidability.Shared.Libs.PSL.Lists.Power]
b:31 [in Undecidability.TM.Code.BinNumbers.PosAddTM]
b:3134 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:32 [in Undecidability.TM.Code.BinNumbers.PosDefinitions]
B:32 [in Complexity.L.TM.CompCode]
b:32 [in Undecidability.TM.Combinators.If]
b:32 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
B:32 [in Undecidability.Shared.Libs.PSL.Lists.Dupfree]
b:32 [in Undecidability.TM.Hoare.HoareMult]
b:32 [in Undecidability.Shared.Libs.PSL.FiniteTypes.FiniteFunction]
B:3200 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:3203 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
B:3208 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:3222 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:323 [in Complexity.Libs.CookPrelim.MorePrelim]
b:3280 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:3290 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:33 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
b:33 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
B:33 [in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
b:33 [in Complexity.NP.SAT.SAT_inNP]
b:33 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
B:33 [in Undecidability.L.TM.TMEncoding]
B:33 [in Undecidability.L.Functions.FinTypeLookup]
b:3300 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:3312 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:332 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:3322 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:3332 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:3344 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
B:335 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:3354 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:3364 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
B:339 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
B:34 [in Undecidability.Shared.Libs.PSL.Lists.Removal]
b:34 [in Undecidability.Shared.Libs.DLW.Utils.crt]
B:34 [in Undecidability.Shared.Libs.PSL.Lists.Power]
B:34 [in Undecidability.Shared.Libs.PSL.Lists.Dupfree]
b:34 [in Undecidability.L.Datatypes.List.List_in]
b:34 [in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
B:34 [in Undecidability.Shared.ListAutomation]
b:34 [in Complexity.Libs.CookPrelim.MorePrelim]
b:35 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
B:35 [in Undecidability.Synthetic.Infinite]
b:35 [in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
b:35 [in Undecidability.TM.Code.BinNumbers.PosAddTM]
b:350 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:354 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
b:358 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:36 [in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
b:36 [in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisUnfoldClos]
B:36 [in Complexity.L.TM.CompCode]
B:36 [in Undecidability.L.Tactics.ComputableDemo]
B:36 [in Undecidability.L.Datatypes.LVector]
B:36 [in Undecidability.L.Datatypes.List.List_eqb]
b:36 [in Undecidability.TM.Hoare.HoareMult]
b:364 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
b:3645 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:3648 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:368 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:369 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
B:37 [in Undecidability.Shared.ListAutomation]
b:373 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
b:378 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:38 [in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
B:38 [in Undecidability.L.Tactics.Extract]
b:38 [in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisUnfoldClos]
B:38 [in Complexity.L.TM.CompCode]
b:38 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
b:38 [in Undecidability.TM.Code.BinNumbers.PosPointers]
B:38 [in Undecidability.Shared.Libs.PSL.Lists.Power]
b:38 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
b:38 [in Undecidability.L.Datatypes.List.List_in]
b:38 [in Undecidability.L.Functions.FinTypeLookup]
b:39 [in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
B:39 [in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
b:39 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
B:395 [in Undecidability.TM.Util.TM_facts]
b:398 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
B:4 [in Undecidability.L.Datatypes.List.List_basics]
b:4 [in Undecidability.TM.Code.BinNumbers.PosDefinitions]
b:4 [in Undecidability.L.Datatypes.LBool]
B:4 [in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
b:4 [in Undecidability.TM.Compound.MoveToSymbol]
b:4 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_nat_facts]
b:4 [in Undecidability.Shared.Libs.DLW.Utils.interval]
b:4 [in Undecidability.L.Computability.Decidability]
b:4 [in Undecidability.Synthetic.Definitions]
B:4 [in Complexity.L.TM.TMflatten]
b:4 [in Undecidability.L.Datatypes.List.List_in]
b:4 [in Undecidability.Shared.Dec]
b:4 [in Undecidability.L.Computability.MuRec]
b:4 [in Undecidability.TM.L.Transcode.Enc_to_Boollist]
B:4 [in Undecidability.Shared.Libs.PSL.FiniteTypes.CompoundFinTypes]
b:40 [in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
b:40 [in Undecidability.TM.Code.List.Concat_Repeat]
b:40 [in Undecidability.Shared.Libs.PSL.Retracts]
b:40 [in Undecidability.TM.Code.NatTM]
b:40 [in Undecidability.TM.Code.NatSub]
b:40 [in Undecidability.TM.Hoare.HoareMult]
B:40 [in Undecidability.Shared.ListAutomation]
b:403 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
b:403 [in Undecidability.TM.Util.TM_facts]
b:41 [in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
b:41 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
B:41 [in Undecidability.Shared.Libs.PSL.Lists.Power]
b:41 [in Complexity.NP.SAT.CookLevin.Subproblems.CC]
b:42 [in Undecidability.Shared.Libs.PSL.Retracts]
B:42 [in Complexity.Libs.CookPrelim.FlatFinTypes]
B:42 [in Complexity.L.TM.CompCode]
b:42 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
B:42 [in Undecidability.L.Datatypes.List.List_eqb]
b:42 [in Undecidability.L.Datatypes.List.List_in]
b:42 [in Undecidability.TM.Code.BinNumbers.PosAddTM]
B:42 [in Undecidability.Shared.Libs.PSL.FiniteTypes.FiniteFunction]
b:43 [in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
B:43 [in Undecidability.L.Computability.Enum]
B:43 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
b:43 [in Undecidability.Shared.Libs.DLW.Utils.crt]
b:43 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
B:43 [in Undecidability.Shared.ListAutomation]
b:436 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:44 [in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
b:44 [in Undecidability.TM.Code.BinNumbers.PosDefinitions]
b:44 [in Undecidability.TM.Code.NatTM]
b:44 [in Complexity.Libs.CookPrelim.FlatFinTypes]
b:44 [in Undecidability.TM.Hoare.HoareMult]
b:44 [in Undecidability.TM.Code.BinNumbers.PosAddTM]
b:444 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:45 [in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
b:45 [in Undecidability.Shared.Libs.PSL.Retracts]
b:45 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
B:45 [in Undecidability.L.Datatypes.List.List_eqb]
B:45 [in Undecidability.L.Functions.FinTypeLookup]
B:45 [in Undecidability.Shared.ListAutomation]
b:45 [in Complexity.NP.SAT.CookLevin.Subproblems.CC]
b:454 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:46 [in Undecidability.TM.Code.List.Concat_Repeat]
B:46 [in Complexity.Libs.CookPrelim.FlatFinTypes]
b:46 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
b:46 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
b:46 [in Undecidability.Shared.Libs.PSL.FiniteTypes.FiniteFunction]
b:464 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:47 [in Undecidability.Shared.Libs.DLW.Utils.prime]
b:47 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
b:47 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
b:47 [in Undecidability.Shared.Libs.DLW.Utils.list_bool]
b:47 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
B:47 [in Undecidability.L.AbstractMachines.FlatPro.Programs]
b:48 [in Undecidability.TM.Code.BinNumbers.PosDefinitions]
B:48 [in Undecidability.L.Computability.Enum]
b:48 [in Complexity.Libs.CookPrelim.FlatFinTypes]
b:48 [in Undecidability.TM.Code.NatSub]
b:48 [in Undecidability.L.Datatypes.List.List_eqb]
b:48 [in Complexity.NP.SAT.CookLevin.Subproblems.CC]
b:481 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:489 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:49 [in Undecidability.Shared.Libs.PSL.Retracts]
b:49 [in Complexity.TM.Single.DecodeTapes]
b:49 [in Undecidability.TM.Hoare.HoareMult]
b:499 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
B:5 [in Undecidability.L.Tactics.GenEncode]
B:5 [in Undecidability.Shared.Libs.PSL.Inhabited]
b:5 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
b:5 [in Undecidability.Synthetic.DecidabilityFacts]
b:5 [in Undecidability.TM.Hoare.HoareMult]
b:5 [in Undecidability.TM.L.Transcode.BoollistEnc]
b:50 [in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
b:50 [in Undecidability.TM.Code.BinNumbers.PosDefinitions]
b:50 [in Undecidability.Shared.Libs.DLW.Utils.crt]
b:50 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
b:50 [in Undecidability.L.Functions.FinTypeLookup]
B:50 [in Undecidability.Shared.ListAutomation]
b:50 [in Complexity.NP.SAT.SAT]
b:50 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
b:509 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
B:51 [in Undecidability.Shared.Libs.PSL.Lists.Removal]
b:51 [in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisUnfoldClos]
b:51 [in Undecidability.Shared.Libs.DLW.Utils.list_bool]
B:51 [in Undecidability.L.Datatypes.List.List_eqb]
B:51 [in Undecidability.Shared.Libs.PSL.Lists.Power]
b:51 [in Complexity.NP.SAT.CookLevin.Subproblems.CC]
b:52 [in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
B:52 [in Complexity.Libs.CookPrelim.FlatFinTypes]
b:52 [in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
B:52 [in Undecidability.Shared.Libs.PSL.FiniteTypes.FiniteFunction]
B:53 [in Complexity.TM.PrettyBounds.BaseCodeSpace]
b:53 [in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
b:54 [in Complexity.Libs.CookPrelim.FlatFinTypes]
b:54 [in Undecidability.Shared.Libs.DLW.Utils.list_bool]
b:54 [in Undecidability.TM.Hoare.HoareMult]
b:55 [in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
B:55 [in Undecidability.L.Computability.Enum]
b:56 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
B:56 [in Undecidability.L.Functions.FinTypeLookup]
B:56 [in Undecidability.TM.Util.TM_facts]
b:567 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
B:57 [in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
b:57 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
b:57 [in Complexity.Libs.CookPrelim.MorePrelim]
b:575 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:58 [in Complexity.L.AbstractMachines.UnfoldTailRec]
B:58 [in Complexity.Libs.CookPrelim.FlatFinTypes]
B:58 [in Complexity.L.TM.CompCode]
b:58 [in Undecidability.TM.Hoare.HoareMult]
b:58 [in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
b:58 [in Complexity.NP.SAT.CookLevin.Subproblems.CC]
B:58 [in Undecidability.Shared.Libs.PSL.FiniteTypes.FiniteFunction]
b:585 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:59 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
b:59 [in Complexity.NP.TM.M_multi2mono]
b:595 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:6 [in Undecidability.TM.Code.BinNumbers.PosIncrementTM]
b:6 [in Undecidability.TM.Code.NatTM]
B:6 [in Complexity.L.TM.CompCode]
b:6 [in Complexity.L.TM.TMflatten]
B:6 [in Undecidability.Shared.Libs.PSL.FiniteTypes.FiniteFunction]
b:6 [in Undecidability.Shared.Libs.PSL.FiniteTypes.CompoundFinTypes]
B:60 [in Complexity.Libs.Pigeonhole]
b:60 [in Complexity.Libs.CookPrelim.FlatFinTypes]
b:60 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
b:61 [in Complexity.L.AbstractMachines.UnfoldTailRec]
B:61 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
b:61 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
b:61 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
b:61 [in Complexity.Libs.CookPrelim.MorePrelim]
b:612 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:619 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:62 [in Undecidability.TM.Code.BinNumbers.PosDefinitions]
B:62 [in Complexity.Libs.CookPrelim.FlatFinTypes]
B:62 [in Complexity.L.TM.CompCode]
b:62 [in Complexity.TM.PrettyBounds.BaseCodeSpace]
b:62 [in Undecidability.L.Functions.FinTypeLookup]
B:62 [in Undecidability.TM.Util.TM_facts]
b:62 [in Complexity.NP.SAT.CookLevin.Subproblems.CC]
b:629 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:639 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:64 [in Complexity.TM.Code.Decode]
B:64 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
b:64 [in Complexity.Libs.CookPrelim.FlatFinTypes]
b:64 [in Undecidability.TM.Hoare.HoareMult]
b:65 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
b:65 [in Complexity.Libs.CookPrelim.MorePrelim]
b:655 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
B:66 [in Undecidability.L.Tactics.Extract]
b:66 [in Undecidability.TM.Hoare.HoareMult]
b:662 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:67 [in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
B:67 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
b:67 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
b:67 [in Complexity.NP.SAT.CookLevin.Subproblems.CC]
b:672 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:68 [in Undecidability.L.Tactics.Extract]
b:682 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:69 [in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
b:69 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
B:69 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
b:69 [in Complexity.Libs.CookPrelim.PolyBounds]
b:69 [in Complexity.NP.SAT.CookLevin.Subproblems.CC]
b:69 [in Complexity.Libs.CookPrelim.MorePrelim]
b:698 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
B:7 [in Undecidability.L.Complexity.UpToCNary]
b:7 [in Undecidability.Shared.Libs.PSL.Prelim]
b:7 [in Complexity.NP.SAT.SAT_inNP]
b:7 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
b:7 [in Undecidability.TM.Combinators.If]
b:7 [in Complexity.Libs.CookPrelim.Tactics]
b:7 [in Undecidability.L.Computability.MuRec]
b:705 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:71 [in Undecidability.TM.Code.BinNumbers.PosDefinitions]
B:71 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
b:71 [in Complexity.Libs.CookPrelim.PolyBounds]
b:715 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:72 [in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
B:72 [in Undecidability.L.Computability.Enum]
b:72 [in Complexity.NP.SAT.CookLevin.Subproblems.CC]
b:725 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:73 [in Complexity.TM.Single.DecodeTape]
b:73 [in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
B:73 [in Complexity.Libs.CookPrelim.MorePrelim]
b:74 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
b:74 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
b:741 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
B:75 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
b:75 [in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
b:750 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:759 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:76 [in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
b:77 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
B:77 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
b:77 [in Complexity.Libs.CookPrelim.PolyBounds]
b:77 [in Complexity.NP.SAT.CookLevin.Subproblems.CC]
b:78 [in Complexity.TM.PrettyBounds.BaseCode]
b:78 [in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
b:789 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
B:79 [in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
b:79 [in Complexity.Libs.CookPrelim.PolyBounds]
b:792 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:795 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:8 [in Undecidability.TM.L.Transcode.Boollist_to_Enc]
b:8 [in Undecidability.Shared.Libs.PSL.Prelim]
b:8 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
b:8 [in Undecidability.TM.Code.BinNumbers.PosDefinitions]
b:8 [in Undecidability.Shared.Libs.DLW.Utils.interval]
B:8 [in Undecidability.Shared.Libs.PSL.Inhabited]
b:8 [in Complexity.L.AbstractMachines.AbstractHeapMachine]
b:8 [in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
b:80 [in Complexity.NP.SAT.CookLevin.Subproblems.CC]
b:801 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:81 [in Undecidability.Shared.Libs.DLW.Utils.sums]
b:81 [in Complexity.Complexity.UpToCPoly]
b:81 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:81 [in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
b:810 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:819 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:82 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
B:82 [in Undecidability.L.Datatypes.LVector]
b:82 [in Undecidability.TM.L.HeapInterpreter.StepTM]
B:83 [in Complexity.L.TM.CompCode]
b:83 [in Complexity.Complexity.UpToCPoly]
B:84 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
B:84 [in Complexity.L.TM.TMunflatten]
b:84 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
b:849 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
B:85 [in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
b:85 [in Complexity.Libs.CookPrelim.MorePrelim]
b:852 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:855 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:86 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
b:861 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
b:861 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:87 [in Undecidability.Shared.Libs.PSL.Retracts]
B:87 [in Complexity.L.TM.CompCode]
b:87 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
b:87 [in Complexity.L.TM.TMunflatten]
b:87 [in Undecidability.TM.L.HeapInterpreter.StepTM]
B:87 [in Undecidability.L.Tactics.Reflection]
b:870 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:879 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:88 [in Complexity.Complexity.UpToCPoly]
b:88 [in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
b:88 [in Complexity.NP.SAT.CookLevin.Subproblems.CC]
b:89 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:89 [in Complexity.NP.Clique.kSAT_to_Clique]
b:89 [in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
B:9 [in Undecidability.Shared.FilterFacts]
b:9 [in Undecidability.Shared.Libs.PSL.Prelim]
B:9 [in Undecidability.Shared.Libs.PSL.Lists.Filter]
b:9 [in Undecidability.TM.Code.CaseBool]
b:9 [in Undecidability.L.Tactics.ComputableDemo]
b:9 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
b:9 [in Undecidability.TM.Hoare.HoareMult]
b:90 [in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
B:90 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
b:90 [in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
b:90 [in Complexity.NP.SAT.CookLevin.Subproblems.CC]
b:90 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
b:90 [in Complexity.Libs.CookPrelim.MorePrelim]
b:909 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
B:91 [in Undecidability.Shared.Libs.PSL.Retracts]
b:91 [in Undecidability.TM.Compound.Compare]
b:91 [in Complexity.TM.Single.DecodeTape]
b:912 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:915 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:92 [in Undecidability.Shared.Libs.DLW.Utils.sums]
b:920 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:928 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
B:93 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
b:93 [in Complexity.Libs.CookPrelim.FlatFinTypes]
b:936 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:95 [in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
B:96 [in Undecidability.L.Tactics.LClos]
b:96 [in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
b:96 [in Complexity.NP.SAT.CookLevin.Subproblems.CC]
b:965 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
b:965 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:967 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:969 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:97 [in Undecidability.TM.L.HeapInterpreter.StepTM]
b:97 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
b:974 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:976 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
b:982 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
b:99 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
b:99 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
B:99 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
b:99 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
b:99 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
b:99 [in Complexity.TM.PrettyBounds.PrettyBounds]
b:990 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]

C

cardp:25 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
cardp:7 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
cardsFin:62 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
cardsFin:98 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
cardsFlat:63 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
cardsFlat:99 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
cards1:107 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
cards2:108 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
cards:103 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
cards:375 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
cards:378 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
cards:388 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
cards:393 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
cards:40 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
cards:453 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
cards:467 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
cards:474 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
cards:482 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
cards:554 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
cards:64 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
cards:69 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
cards:76 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
cards:83 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
card':3600 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
card':60 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
card:10 [in Complexity.NP.SAT.CookLevin.Subproblems.BinaryCC]
card:100 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
card:102 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
card:104 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
card:105 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
card:106 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
card:121 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
card:13 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
card:13 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
card:132 [in Complexity.NP.SAT.CookLevin.Subproblems.CC]
card:14 [in Complexity.NP.SAT.CookLevin.Subproblems.CC]
card:15 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
card:157 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
card:162 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
card:164 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
card:166 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
card:18 [in Complexity.NP.SAT.CookLevin.Subproblems.CC]
card:192 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
card:196 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
card:200 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
card:205 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
card:21 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
card:21 [in Complexity.NP.SAT.CookLevin.Subproblems.CC]
card:23 [in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
card:24 [in Complexity.NP.SAT.CookLevin.Subproblems.CC]
card:25 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
card:26 [in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
card:29 [in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
card:3184 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
card:3194 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
card:33 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
card:34 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
card:340 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
card:343 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
card:346 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
card:351 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
card:355 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
card:358 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
card:361 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
card:366 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
card:372 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
card:39 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
card:39 [in Complexity.NP.SAT.CookLevin.Subproblems.CC]
card:42 [in Complexity.NP.SAT.CookLevin.Subproblems.CC]
card:44 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
card:46 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
card:46 [in Complexity.NP.SAT.CookLevin.Subproblems.CC]
card:48 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
card:49 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
card:49 [in Complexity.NP.SAT.CookLevin.Subproblems.CC]
card:5 [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
card:5 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
card:50 [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
card:52 [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
card:55 [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
card:57 [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
card:57 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
card:59 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
card:65 [in Complexity.NP.SAT.CookLevin.Subproblems.CC]
card:68 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
card:7 [in Complexity.NP.SAT.CookLevin.Reductions.TCC_to_CC]
card:70 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
card:78 [in Complexity.NP.SAT.CookLevin.Subproblems.CC]
card:8 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
card:83 [in Complexity.NP.SAT.CookLevin.Subproblems.CC]
card:87 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
card:9 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
card:9 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
card:90 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
card:92 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
card:93 [in Complexity.NP.SAT.CookLevin.Subproblems.CC]
card:97 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
card:97 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
carry:13 [in Undecidability.TM.Code.BinNumbers.PosAddTM]
carry:32 [in Undecidability.TM.Code.BinNumbers.PosAddTM]
carry:34 [in Undecidability.TM.Code.BinNumbers.PosAddTM]
carry:41 [in Undecidability.TM.Code.BinNumbers.PosAddTM]
carry:43 [in Undecidability.TM.Code.BinNumbers.PosAddTM]
carry:45 [in Undecidability.TM.Code.BinNumbers.PosAddTM]
carry:62 [in Undecidability.TM.Code.BinNumbers.PosAddTM]
carry:68 [in Undecidability.TM.Code.BinNumbers.PosAddTM]
carry:79 [in Undecidability.TM.Code.BinNumbers.PosAddTM]
carry:95 [in Undecidability.TM.Code.BinNumbers.PosAddTM]
cases:17 [in Undecidability.L.Tactics.GenEncode]
cases:94 [in Undecidability.L.Tactics.Extract]
cases:94 [in Undecidability.L.Complexity.UpToC]
cases:99 [in Undecidability.L.Complexity.UpToCNary]
cast:138 [in Undecidability.L.Tactics.Computable]
cast:142 [in Undecidability.L.Tactics.Computable]
cast:144 [in Undecidability.L.Tactics.Computable]
cast:151 [in Undecidability.L.Tactics.Computable]
cast:166 [in Undecidability.L.Tactics.ComputableTime]
cast:44 [in Undecidability.L.Tactics.ComputableTactics]
cast:48 [in Undecidability.L.Tactics.ComputableTactics]
cA:57 [in Undecidability.Shared.Libs.PSL.FiniteTypes.FiniteFunction]
cB:59 [in Undecidability.Shared.Libs.PSL.FiniteTypes.FiniteFunction]
cc:59 [in Undecidability.Shared.Libs.DLW.Utils.php]
cc:81 [in Undecidability.Shared.Libs.DLW.Utils.php]
cert:12 [in Complexity.NP.SAT.CookLevin.Subproblems.SingleTMGenNP]
cert:27 [in Complexity.NP.SAT.CookLevin.Subproblems.SingleTMGenNP]
cert:2785 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
cert:2786 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
cert:2787 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
cert:2792 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
cert:2794 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
cert:29 [in Complexity.NP.TM.TMGenNP_fixed_mTM]
cfg:14 [in Undecidability.L.TM.TMinL.TMinL_extract]
cfg:21 [in Undecidability.L.TM.TMinL]
Cfin:3145 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Cflat:3149 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
checkFor:1 [in Complexity.L.AbstractMachines.Computable.EvalForTimeBool]
checkFor:7 [in Complexity.L.AbstractMachines.Computable.EvalForTimeBool]
ci':65 [in Complexity.NP.Clique.kSAT_to_Clique]
ci1:111 [in Complexity.NP.Clique.kSAT_to_Clique]
ci1:26 [in Complexity.NP.Clique.kSAT_to_Clique]
ci1:30 [in Complexity.NP.Clique.kSAT_to_FlatClique]
ci1:34 [in Complexity.NP.Clique.kSAT_to_FlatClique]
ci2:112 [in Complexity.NP.Clique.kSAT_to_Clique]
ci2:28 [in Complexity.NP.Clique.kSAT_to_Clique]
ci2:28 [in Complexity.NP.Clique.kSAT_to_FlatClique]
ci2:36 [in Complexity.NP.Clique.kSAT_to_FlatClique]
ci:10 [in Complexity.NP.Clique.kSAT_to_FlatClique]
ci:106 [in Complexity.NP.Clique.kSAT_to_Clique]
ci:117 [in Complexity.NP.Clique.kSAT_to_Clique]
ci:122 [in Complexity.NP.Clique.kSAT_to_Clique]
ci:38 [in Complexity.NP.Clique.kSAT_to_FlatClique]
ci:4 [in Complexity.NP.Clique.kSAT_to_FlatClique]
ci:47 [in Complexity.NP.Clique.kSAT_to_Clique]
ci:57 [in Complexity.NP.Clique.kSAT_to_Clique]
ci:61 [in Complexity.NP.Clique.kSAT_to_Clique]
ci:64 [in Complexity.NP.Clique.kSAT_to_Clique]
ci:7 [in Complexity.NP.Clique.kSAT_to_FlatClique]
ci:78 [in Complexity.NP.Clique.kSAT_to_FlatClique]
ci:85 [in Complexity.NP.Clique.kSAT_to_Clique]
ci:88 [in Complexity.NP.Clique.kSAT_to_FlatClique]
ci:91 [in Complexity.NP.Clique.kSAT_to_FlatClique]
ci:95 [in Complexity.NP.Clique.kSAT_to_FlatClique]
ci:98 [in Complexity.NP.Clique.kSAT_to_FlatClique]
class:11 [in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
cls:15 [in Undecidability.Shared.Libs.DLW.Utils.quotient]
cl:56 [in Complexity.NP.SAT.SAT]
cl:87 [in Complexity.NP.Clique.kSAT_to_Clique]
cn:55 [in Complexity.NP.SAT.SAT]
code:49 [in Undecidability.TM.Code.ChangeAlphabet]
computableTime:33 [in Undecidability.L.Tactics.ComputableTime]
com:1 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
conf:293 [in Undecidability.TM.Util.TM_facts]
cst:84 [in Undecidability.L.Complexity.GenericNary]
cs:14 [in Undecidability.TM.Code.List.Concat_Repeat]
cs:21 [in Undecidability.TM.Code.List.Concat_Repeat]
cs:27 [in Undecidability.TM.Code.List.Concat_Repeat]
cs:469 [in Undecidability.TM.Single.StepTM]
cs:55 [in Undecidability.TM.Code.List.Concat_Repeat]
ctr_types:131 [in Undecidability.L.Tactics.Extract]
ctr_types:38 [in Undecidability.L.Tactics.GenEncode]
Ctx:127 [in Undecidability.TM.Hoare.HoareRegister]
Ctx:465 [in Undecidability.TM.Hoare.HoareRegister]
curSize:11 [in Complexity.L.AbstractMachines.FunctionalDefinitions]
curSize:21 [in Complexity.L.AbstractMachines.FunctionalDefinitions]
curSize:28 [in Complexity.L.AbstractMachines.FunctionalDefinitions]
curSize:30 [in Complexity.L.AbstractMachines.FunctionalDefinitions]
curSize:35 [in Complexity.L.AbstractMachines.FunctionalDefinitions]
curSize:61 [in Complexity.L.AbstractMachines.FunctionalDefinitions]
curSize:7 [in Complexity.L.AbstractMachines.FunctionalDefinitions]
cX:10 [in Undecidability.TM.Hoare.HoareRegister]
cX:102 [in Undecidability.TM.Code.List.Nth]
cX:106 [in Complexity.TM.PrettyBounds.BaseCode]
cX:106 [in Undecidability.TM.Code.Copy]
cX:107 [in Undecidability.TM.Code.List.Nth]
cX:11 [in Complexity.TM.PrettyBounds.BaseCode]
cX:11 [in Undecidability.TM.Code.WriteValue]
cX:112 [in Complexity.TM.PrettyBounds.BaseCode]
cX:112 [in Undecidability.TM.Code.Copy]
cX:117 [in Complexity.TM.PrettyBounds.BaseCode]
cX:118 [in Undecidability.TM.Code.Copy]
cX:12 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds_Loop]
cX:12 [in Undecidability.TM.Code.List.Cons_constant]
cX:122 [in Complexity.TM.PrettyBounds.BaseCode]
cX:126 [in Undecidability.TM.Univ.LookupAssociativeListTM]
cX:132 [in Complexity.TM.PrettyBounds.BaseCode]
cX:132 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
cX:137 [in Undecidability.TM.Code.Copy]
cX:138 [in Complexity.TM.PrettyBounds.BaseCode]
cX:14 [in Complexity.TM.PrettyBounds.UnivBounds]
cX:146 [in Undecidability.TM.Code.Copy]
cX:147 [in Undecidability.TM.Univ.LookupAssociativeListTM]
cX:15 [in Undecidability.TM.Hoare.HoareExamples]
cX:16 [in Undecidability.TM.Univ.LookupAssociativeListTM]
cX:161 [in Undecidability.TM.Code.Copy]
cX:166 [in Undecidability.TM.Code.Copy]
cX:17 [in Complexity.TM.PrettyBounds.BaseCode]
cX:17 [in Undecidability.TM.PrettyBounds.SizeBounds]
cX:17 [in Undecidability.TM.Hoare.HoareRegister]
cX:179 [in Undecidability.TM.Code.Copy]
cX:18 [in Complexity.NP.TM.LM_to_mTM]
cX:19 [in Undecidability.TM.Code.List.Nth]
cX:19 [in Undecidability.TM.Code.WriteValue]
cX:201 [in Undecidability.TM.Code.Copy]
cX:21 [in Undecidability.TM.Code.CasePair]
cX:21 [in Undecidability.TM.Hoare.HoareExamples]
cX:211 [in Undecidability.TM.Code.Copy]
cX:218 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
cX:218 [in Undecidability.TM.Code.Copy]
cX:223 [in Undecidability.TM.Code.Copy]
cX:230 [in Undecidability.TM.Code.Copy]
cX:236 [in Undecidability.TM.Code.Copy]
cX:24 [in Complexity.TM.PrettyBounds.BaseCode]
cX:24 [in Undecidability.TM.Code.List.Length]
cX:243 [in Undecidability.TM.Code.Copy]
cX:246 [in Complexity.TM.PrettyBounds.M2MBounds]
cX:249 [in Undecidability.TM.Code.Copy]
cX:25 [in Complexity.TM.PrettyBounds.UnivBounds]
cX:25 [in Undecidability.TM.Univ.LookupAssociativeListTM]
cX:256 [in Undecidability.TM.Code.Copy]
cX:26 [in Undecidability.TM.Code.CasePair]
cX:262 [in Undecidability.TM.Code.Copy]
cX:269 [in Undecidability.TM.Code.Copy]
cX:275 [in Undecidability.TM.Code.Copy]
cX:28 [in Undecidability.TM.Code.CaseList]
cX:28 [in Undecidability.TM.Hoare.HoareExamples]
cX:28 [in Undecidability.TM.Code.List.App]
cX:282 [in Undecidability.TM.Code.Copy]
cX:288 [in Undecidability.TM.Code.Copy]
cX:29 [in Undecidability.TM.Code.WriteValue]
cX:295 [in Undecidability.TM.Code.Copy]
cX:3 [in Complexity.TM.PrettyBounds.UnivBounds]
cX:3 [in Undecidability.TM.Code.List.Cons_constant]
cX:3 [in Complexity.TM.Code.DecodeList]
cX:3 [in Undecidability.TM.Hoare.HoareExamples]
cX:301 [in Undecidability.TM.Code.Copy]
cX:308 [in Undecidability.TM.Code.Copy]
cX:314 [in Undecidability.TM.Code.Copy]
cX:321 [in Undecidability.TM.Code.Copy]
cX:328 [in Undecidability.TM.Code.Copy]
cX:33 [in Undecidability.TM.Code.CaseList]
cX:33 [in Undecidability.TM.Code.List.Length]
cX:33 [in Undecidability.TM.Code.CompareValue]
cX:337 [in Undecidability.TM.Code.Copy]
cX:34 [in Complexity.TM.PrettyBounds.BaseCode]
cX:34 [in Undecidability.TM.Hoare.HoareExamples]
cX:349 [in Undecidability.TM.Code.Copy]
cX:35 [in Complexity.TM.PrettyBounds.UnivBounds]
cX:35 [in Undecidability.TM.Univ.LookupAssociativeListTM]
cX:36 [in Undecidability.TM.Code.CasePair]
cX:360 [in Undecidability.TM.Code.Copy]
cX:372 [in Undecidability.TM.Code.Copy]
cX:38 [in Undecidability.TM.Code.List.Nth]
cX:381 [in Undecidability.TM.Code.Copy]
cX:389 [in Undecidability.TM.Code.Copy]
cX:39 [in Complexity.TM.PrettyBounds.BaseCode]
cX:39 [in Undecidability.TM.Code.List.App]
cX:396 [in Undecidability.TM.Code.Copy]
cX:4 [in Complexity.TM.PrettyBounds.BaseCode]
cX:4 [in Undecidability.TM.Code.WriteValue]
cX:404 [in Undecidability.TM.Code.Copy]
cX:41 [in Undecidability.TM.Hoare.HoareExamples]
cX:43 [in Undecidability.TM.Code.CasePair]
cX:44 [in Complexity.TM.PrettyBounds.BaseCode]
cX:44 [in Undecidability.TM.Univ.LookupAssociativeListTM]
cX:45 [in Complexity.TM.PrettyBounds.UnivBounds]
cX:46 [in Undecidability.TM.Code.List.Nth]
cX:46 [in Undecidability.TM.Code.List.Length]
cX:49 [in Complexity.TM.PrettyBounds.BaseCode]
cX:50 [in Undecidability.TM.Hoare.HoareExamples]
cX:54 [in Complexity.TM.PrettyBounds.UnivBounds]
cX:54 [in Undecidability.TM.Code.CasePair]
cX:54 [in Complexity.NP.TM.LM_to_mTM]
cX:56 [in Undecidability.TM.Code.List.Length]
cX:561 [in Complexity.NP.TM.LM_to_mTM]
cX:58 [in Complexity.TM.PrettyBounds.BaseCode]
cX:58 [in Undecidability.TM.Univ.LookupAssociativeListTM]
cX:59 [in Undecidability.TM.Code.CaseList]
cX:6 [in Undecidability.TM.Hoare.HoareRegister]
cX:60 [in Complexity.TM.Code.Decode]
cX:61 [in Undecidability.TM.Code.CasePair]
cX:62 [in Undecidability.TM.Hoare.HoareExamples]
cX:63 [in Undecidability.TM.Code.CaseList]
cX:64 [in Complexity.TM.PrettyBounds.UnivBounds]
cX:67 [in Undecidability.TM.Code.List.Length]
cX:68 [in Undecidability.TM.Univ.LookupAssociativeListTM]
cX:69 [in Complexity.TM.PrettyBounds.BaseCodeSpace]
cX:7 [in Complexity.TM.PrettyBounds.UnivBounds]
cX:7 [in Undecidability.TM.Code.Code]
cX:70 [in Undecidability.TM.Code.CasePair]
cX:73 [in Complexity.TM.PrettyBounds.UnivBounds]
cX:73 [in Undecidability.TM.Hoare.HoareExamples]
cX:75 [in Complexity.TM.PrettyBounds.BaseCodeSpace]
cX:8 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds_Loop]
cX:8 [in Undecidability.TM.Hoare.HoareExamples]
cX:80 [in Complexity.TM.PrettyBounds.BaseCodeSpace]
cX:82 [in Complexity.TM.PrettyBounds.UnivBounds]
cX:84 [in Undecidability.TM.Code.CaseList]
cX:87 [in Complexity.TM.PrettyBounds.BaseCodeSpace]
cX:9 [in Undecidability.TM.Code.List.Nth]
cX:9 [in Undecidability.TM.Code.List.Length]
cX:91 [in Complexity.TM.PrettyBounds.UnivBounds]
cX:95 [in Undecidability.TM.Code.CaseList]
cX:98 [in Undecidability.TM.Code.Copy]
cY:107 [in Complexity.TM.PrettyBounds.BaseCode]
cY:127 [in Undecidability.TM.Univ.LookupAssociativeListTM]
cY:148 [in Undecidability.TM.Univ.LookupAssociativeListTM]
cY:15 [in Complexity.TM.PrettyBounds.UnivBounds]
cY:167 [in Undecidability.TM.Code.Copy]
cY:17 [in Undecidability.TM.Univ.LookupAssociativeListTM]
cY:180 [in Undecidability.TM.Code.Copy]
cY:26 [in Complexity.TM.PrettyBounds.UnivBounds]
cY:26 [in Undecidability.TM.Univ.LookupAssociativeListTM]
cY:329 [in Undecidability.TM.Code.Copy]
cY:338 [in Undecidability.TM.Code.Copy]
cY:350 [in Undecidability.TM.Code.Copy]
cY:36 [in Complexity.TM.PrettyBounds.UnivBounds]
cY:36 [in Undecidability.TM.Univ.LookupAssociativeListTM]
cY:361 [in Undecidability.TM.Code.Copy]
cY:373 [in Undecidability.TM.Code.Copy]
cY:42 [in Undecidability.TM.Hoare.HoareExamples]
cY:45 [in Undecidability.TM.Univ.LookupAssociativeListTM]
cY:46 [in Complexity.TM.PrettyBounds.UnivBounds]
cY:51 [in Undecidability.TM.Hoare.HoareExamples]
cY:52 [in Complexity.TM.PrettyBounds.BaseCode]
cY:55 [in Complexity.TM.PrettyBounds.UnivBounds]
cY:59 [in Undecidability.TM.Univ.LookupAssociativeListTM]
cY:63 [in Complexity.TM.PrettyBounds.BaseCode]
cY:63 [in Undecidability.TM.Hoare.HoareExamples]
cY:65 [in Complexity.TM.PrettyBounds.UnivBounds]
cY:69 [in Undecidability.TM.Univ.LookupAssociativeListTM]
cY:74 [in Complexity.TM.PrettyBounds.UnivBounds]
cY:74 [in Undecidability.TM.Hoare.HoareExamples]
cY:83 [in Complexity.TM.PrettyBounds.UnivBounds]
cY:88 [in Complexity.TM.PrettyBounds.BaseCodeSpace]
cY:92 [in Complexity.TM.PrettyBounds.UnivBounds]
c__inv:46 [in Complexity.Complexity.ONotation]
c_M:386 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
c_M:265 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
c':101 [in Complexity.TM.Single.DecodeTape]
C':103 [in Undecidability.Shared.Libs.PSL.Retracts]
c':105 [in Complexity.TM.Single.DecodeTape]
c':108 [in Complexity.TM.PrettyBounds.PrettyBounds]
C':115 [in Undecidability.Shared.Libs.PSL.Retracts]
C':130 [in Undecidability.Shared.Libs.PSL.Retracts]
C':148 [in Undecidability.Shared.Libs.PSL.Retracts]
c':16 [in Complexity.NP.L.GenNP]
C':19 [in Undecidability.L.Functions.EnumInt]
c':20 [in Complexity.NP.L.LMGenNP]
c':25 [in Undecidability.L.AbstractMachines.FlatPro.Programs]
c':26 [in Complexity.TM.PrettyBounds.PrettyBounds]
c':2666 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
c':2687 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
c':30 [in Complexity.TM.PrettyBounds.PrettyBounds]
c':4 [in Complexity.NP.SAT.CookLevin.Reductions.TMGenNP_fixed_singleTapeTM_to_FlatFunSingleTMGenNP]
c':47 [in Complexity.TM.PrettyBounds.PrettyBounds]
c':483 [in Undecidability.TM.Single.StepTM]
c':55 [in Complexity.L.TM.TMflatFun]
c':63 [in Complexity.L.TM.TMflat]
c':65 [in Complexity.L.TM.TMflatFun]
c':68 [in Undecidability.L.Complexity.UpToC]
c':69 [in Complexity.L.TM.TMflat]
c':70 [in Undecidability.L.Complexity.UpToCNary]
c':82 [in Complexity.L.TM.TMflatComp]
c':83 [in Complexity.L.TM.TMflatFun]
C':94 [in Undecidability.Shared.Libs.PSL.Retracts]
c0:11 [in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisStep]
c0:2 [in Complexity.TM.PrettyBounds.M2MBounds]
c0:20 [in Complexity.TM.PrettyBounds.M2MBounds]
c0:23 [in Complexity.L.AbstractMachines.AbstractSubstMachine]
c0:32 [in Complexity.L.TM.TMflatComp]
c0:33 [in Complexity.L.TM.TMflatComp]
c0:40 [in Complexity.NP.SAT.CookLevin.Subproblems.SingleTMGenNP]
c0:82 [in Complexity.L.TM.TMflatFun]
c1:100 [in Complexity.TM.PrettyBounds.PrettyBounds]
c1:11 [in Undecidability.L.TM.TMinL.TMinL_extract]
c1:11 [in Complexity.TM.PrettyBounds.PrettyBounds]
c1:117 [in Undecidability.TM.Lifting.LiftTapes]
c1:118 [in Undecidability.TM.Lifting.LiftTapes]
c1:12 [in Undecidability.TM.Combinators.Mirror]
c1:12 [in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisStep]
c1:121 [in Undecidability.TM.Lifting.LiftTapes]
c1:124 [in Undecidability.TM.Lifting.LiftTapes]
c1:132 [in Undecidability.TM.Lifting.LiftTapes]
c1:15 [in Undecidability.TM.Combinators.While]
c1:15 [in Complexity.TM.PrettyBounds.PrettyBounds]
c1:175 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
c1:184 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
c1:19 [in Complexity.TM.PrettyBounds.PrettyBounds]
c1:190 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
c1:193 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
c1:21 [in Undecidability.TM.Combinators.While]
c1:21 [in Complexity.TM.PrettyBounds.M2MBounds]
c1:21 [in Undecidability.TM.Combinators.Mirror]
c1:24 [in Undecidability.TM.Combinators.Mirror]
c1:25 [in Undecidability.TM.Combinators.While]
C1:27 [in Complexity.NP.SAT.SAT]
c1:3 [in Complexity.TM.PrettyBounds.M2MBounds]
c1:30 [in Undecidability.TM.Combinators.While]
c1:34 [in Undecidability.TM.Combinators.While]
c1:34 [in Undecidability.TM.Combinators.StateWhile]
c1:36 [in Undecidability.TM.Combinators.Switch]
c1:3614 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
c1:39 [in Undecidability.TM.Combinators.StateWhile]
c1:47 [in Undecidability.TM.Combinators.Switch]
c1:5 [in Undecidability.TM.Compound.Compare]
c1:54 [in Undecidability.TM.Lifting.LiftAlphabet]
c1:56 [in Complexity.TM.PrettyBounds.PrettyBounds]
c1:58 [in Undecidability.TM.Combinators.StateWhile]
c1:6 [in Complexity.TM.PrettyBounds.PrettyBounds]
c1:63 [in Complexity.NP.SAT.SAT]
c1:65 [in Complexity.TM.PrettyBounds.PrettyBounds]
c1:67 [in Undecidability.TM.Combinators.StateWhile]
c1:7 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
C1:72 [in Complexity.NP.SAT.SAT]
c1:73 [in Undecidability.TM.Combinators.StateWhile]
c1:74 [in Complexity.TM.PrettyBounds.PrettyBounds]
c1:81 [in Complexity.TM.PrettyBounds.PrettyBounds]
c1:91 [in Complexity.TM.PrettyBounds.PrettyBounds]
c1:99 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
c2':134 [in Undecidability.TM.Lifting.LiftTapes]
c2':42 [in Undecidability.TM.Combinators.Switch]
c2:100 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
c2:101 [in Complexity.TM.PrettyBounds.PrettyBounds]
c2:119 [in Undecidability.TM.Lifting.LiftTapes]
c2:12 [in Undecidability.L.TM.TMinL.TMinL_extract]
c2:12 [in Complexity.TM.PrettyBounds.PrettyBounds]
c2:122 [in Undecidability.TM.Lifting.LiftTapes]
c2:125 [in Undecidability.TM.Lifting.LiftTapes]
c2:13 [in Undecidability.TM.Combinators.Mirror]
c2:13 [in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisStep]
c2:133 [in Undecidability.TM.Lifting.LiftTapes]
c2:16 [in Complexity.TM.PrettyBounds.PrettyBounds]
c2:176 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
c2:185 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
c2:19 [in Undecidability.TM.Combinators.While]
c2:194 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
c2:20 [in Complexity.TM.PrettyBounds.PrettyBounds]
c2:22 [in Undecidability.TM.Combinators.While]
c2:22 [in Complexity.TM.PrettyBounds.M2MBounds]
c2:22 [in Undecidability.TM.Combinators.Mirror]
c2:25 [in Undecidability.TM.Combinators.Mirror]
c2:26 [in Undecidability.TM.Combinators.While]
C2:28 [in Complexity.NP.SAT.SAT]
c2:31 [in Undecidability.TM.Combinators.While]
c2:35 [in Undecidability.TM.Combinators.While]
c2:35 [in Undecidability.TM.Combinators.StateWhile]
c2:3615 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
c2:37 [in Undecidability.TM.Combinators.Switch]
c2:39 [in Undecidability.TM.Combinators.Switch]
c2:4 [in Complexity.TM.PrettyBounds.M2MBounds]
c2:48 [in Undecidability.TM.Combinators.StateWhile]
c2:49 [in Undecidability.TM.Combinators.Switch]
c2:54 [in Undecidability.TM.Combinators.StateWhile]
c2:55 [in Undecidability.TM.Lifting.LiftAlphabet]
c2:57 [in Complexity.TM.PrettyBounds.PrettyBounds]
c2:6 [in Undecidability.TM.Compound.Compare]
c2:60 [in Undecidability.TM.Combinators.StateWhile]
c2:64 [in Complexity.NP.SAT.SAT]
c2:66 [in Complexity.TM.PrettyBounds.PrettyBounds]
c2:68 [in Undecidability.TM.Combinators.StateWhile]
c2:7 [in Complexity.TM.PrettyBounds.PrettyBounds]
C2:73 [in Complexity.NP.SAT.SAT]
c2:74 [in Undecidability.TM.Combinators.StateWhile]
c2:75 [in Complexity.TM.PrettyBounds.PrettyBounds]
c2:8 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
c2:82 [in Complexity.TM.PrettyBounds.PrettyBounds]
c2:92 [in Complexity.TM.PrettyBounds.PrettyBounds]
c3:16 [in Undecidability.TM.Combinators.While]
c3:195 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
c3:32 [in Undecidability.TM.Combinators.While]
c3:49 [in Undecidability.TM.Combinators.StateWhile]
c3:5 [in Complexity.TM.PrettyBounds.M2MBounds]
c3:55 [in Undecidability.TM.Combinators.StateWhile]
c3:59 [in Undecidability.TM.Combinators.StateWhile]
c3:69 [in Undecidability.TM.Combinators.StateWhile]
c3:9 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
c4:10 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
c:1 [in Complexity.TM.PrettyBounds.BaseCode]
c:1 [in Complexity.L.TM.TMflatComp]
c:1 [in Complexity.L.Functions.BinNumsSub]
c:1 [in Complexity.L.AbstractMachines.AbstractSubstMachine]
c:1 [in Complexity.TM.PrettyBounds.PrettyBounds]
c:1 [in Complexity.L.Functions.BinNumsAdd]
c:10 [in Complexity.Complexity.ONotation]
c:10 [in Complexity.NP.L.GenNP_is_hard]
c:10 [in Undecidability.TM.Combinators.Mirror]
c:10 [in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisStep]
c:10 [in Undecidability.TM.Combinators.StateWhile]
c:10 [in Undecidability.L.Complexity.GenericNary]
c:10 [in Undecidability.L.TM.TMinL.TMinL_extract]
c:100 [in Complexity.TM.PrettyBounds.BaseCode]
c:100 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c:101 [in Undecidability.TM.Hoare.HoareMult]
c:101 [in Undecidability.TM.Code.BinNumbers.PosAddTM]
c:102 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
C:102 [in Undecidability.Shared.Libs.PSL.Retracts]
c:102 [in Undecidability.Shared.Libs.DLW.Utils.fin_base]
c:102 [in Complexity.Complexity.PolyTimeComputable]
c:103 [in Undecidability.Shared.Libs.DLW.Utils.fin_base]
c:104 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
c:105 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
C:105 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
c:106 [in Complexity.L.AbstractMachines.AbstractHeapMachine]
c:107 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
c:107 [in Undecidability.TM.Hoare.HoareMult]
c:107 [in Complexity.TM.PrettyBounds.PrettyBounds]
c:108 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c:108 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
C:108 [in Complexity.NP.SAT.CookLevin.Subproblems.CC]
c:109 [in Complexity.TM.PrettyBounds.PrettyBounds]
c:11 [in Undecidability.TM.Combinators.While]
c:11 [in Undecidability.TM.Combinators.Mirror]
c:11 [in Complexity.NP.L.GenNPBool]
c:11 [in Undecidability.L.Datatypes.List.List_fold]
c:110 [in Undecidability.TM.Code.NatTM]
c:112 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c:113 [in Undecidability.TM.Lifting.LiftTapes]
c:113 [in Undecidability.TM.Hoare.HoareMult]
c:114 [in Complexity.TM.PrettyBounds.BaseCode]
C:114 [in Undecidability.Shared.Libs.PSL.Retracts]
c:115 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
c:116 [in Complexity.TM.PrettyBounds.M2MBounds]
c:116 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c:116 [in Undecidability.TM.Code.NatTM]
c:118 [in Complexity.TM.PrettyBounds.UnivBounds]
C:118 [in Complexity.L.ComparisonTimeBoundDerivation]
c:118 [in Undecidability.TM.Hoare.HoareMult]
c:119 [in Complexity.TM.PrettyBounds.BaseCode]
c:119 [in Complexity.TM.PrettyBounds.UnivBounds]
c:119 [in Undecidability.TM.Code.NatTM]
c:12 [in Undecidability.TM.Combinators.While]
c:12 [in Complexity.TM.Code.DecodeList]
C:12 [in Complexity.NP.SAT.CookLevin.Subproblems.BinaryCC]
c:12 [in Complexity.Complexity.ONotationIsAppropriate]
c:12 [in Complexity.L.TM.TMflatten]
c:12 [in Undecidability.TM.Compound.Shift]
c:120 [in Complexity.TM.PrettyBounds.UnivBounds]
c:121 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
C:121 [in Complexity.L.ComparisonTimeBoundDerivation]
c:121 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
c:123 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
c:123 [in Undecidability.TM.Hoare.HoareMult]
c:124 [in Complexity.TM.PrettyBounds.M2MBounds]
c:124 [in Complexity.TM.PrettyBounds.BaseCode]
c:124 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c:124 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
c:124 [in Complexity.L.ComparisonTimeBoundDerivation]
C:124 [in Complexity.NP.Clique.kSAT_to_Clique]
c:125 [in Complexity.TM.PrettyBounds.BaseCode]
C:125 [in Complexity.NP.SAT.SAT_inNP]
C:125 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
c:125 [in Complexity.Libs.CookPrelim.MorePrelim]
c:126 [in Complexity.TM.PrettyBounds.BaseCode]
c:126 [in Undecidability.TM.Code.NatTM]
c:127 [in Complexity.TM.PrettyBounds.BaseCode]
c:127 [in Undecidability.TM.L.HeapInterpreter.StepTM]
c:128 [in Complexity.TM.PrettyBounds.BaseCode]
c:128 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
C:128 [in Complexity.NP.SAT.SAT_inNP]
c:128 [in Undecidability.TM.Lifting.LiftTapes]
c:128 [in Undecidability.TM.Hoare.HoareMult]
c:129 [in Complexity.TM.PrettyBounds.BaseCode]
C:129 [in Undecidability.Shared.Libs.PSL.Retracts]
c:129 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
c:129 [in Undecidability.TM.Lifting.LiftTapes]
c:13 [in Undecidability.TM.Combinators.While]
c:13 [in Complexity.TM.PrettyBounds.BaseCode]
c:13 [in Complexity.NP.L.GenNP_is_hard]
c:13 [in Undecidability.TM.Code.List.Cons_constant]
c:13 [in Complexity.NP.L.GenNPBool]
C:13 [in Complexity.L.TM.TMflatComp]
C:13 [in Complexity.NP.SAT.SAT_inNP]
c:13 [in Complexity.L.TM.TMflatten]
c:13 [in Complexity.TM.Compound.MoveToSymbol_niceSpec]
C:13 [in Undecidability.Shared.Libs.PSL.FiniteTypes.Cardinality]
c:13 [in Complexity.NP.L.GenNP]
c:130 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
C:130 [in Complexity.L.ComparisonTimeBoundDerivation]
c:131 [in Complexity.TM.PrettyBounds.UnivBounds]
c:131 [in Complexity.NP.SAT.SAT_inNP]
c:132 [in Complexity.TM.PrettyBounds.M2MBounds]
c:133 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
C:133 [in Undecidability.L.Tactics.Extract]
c:134 [in Complexity.TM.PrettyBounds.UnivBounds]
c:134 [in Undecidability.TM.Hoare.HoareMult]
c:135 [in Complexity.TM.PrettyBounds.BaseCode]
C:136 [in Complexity.L.ComparisonTimeBoundDerivation]
c:137 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
C:137 [in Complexity.NP.SAT.SAT_inNP]
c:138 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c:14 [in Complexity.TM.PrettyBounds.BaseCode]
c:14 [in Complexity.Complexity.ONotation]
c:14 [in Complexity.NP.L.GenNP_is_hard]
c:14 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds_Loop]
c:14 [in Complexity.NP.SAT.CookLevin.Subproblems.TM_single]
c:14 [in Undecidability.L.TM.TMEncoding]
c:14 [in Undecidability.L.Complexity.GenericNary]
c:14 [in Complexity.Complexity.Monotonic]
c:14 [in Undecidability.TM.Compound.Shift]
c:140 [in Complexity.TM.PrettyBounds.UnivBounds]
c:140 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
c:140 [in Undecidability.TM.Hoare.HoareMult]
c:142 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c:142 [in Complexity.Complexity.PolyTimeComputable]
c:143 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
c:143 [in Undecidability.TM.Compound.MoveToSymbol]
c:145 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c:145 [in Undecidability.TM.Hoare.HoareMult]
c:146 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
c:146 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
C:147 [in Undecidability.Shared.Libs.PSL.Retracts]
c:149 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c:15 [in Complexity.NP.L.GenNP_is_hard]
C:15 [in Complexity.NP.SAT.kSAT]
C:15 [in Undecidability.L.Tactics.ComputableTactics]
c:150 [in Complexity.TM.PrettyBounds.UnivBounds]
c:152 [in Undecidability.Shared.Libs.DLW.Utils.php]
c:154 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c:155 [in Complexity.TM.PrettyBounds.UnivBounds]
c:158 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
c:159 [in Complexity.TM.PrettyBounds.UnivBounds]
c:16 [in Complexity.NP.L.GenNP_is_hard]
c:16 [in Undecidability.L.AbstractMachines.FlatPro.Programs]
C:16 [in Complexity.NP.SAT.SAT]
c:160 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
c:161 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c:161 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
c:162 [in Undecidability.Shared.Libs.DLW.Utils.php]
c:163 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
c:164 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c:164 [in Complexity.TM.PrettyBounds.UnivBounds]
c:164 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
c:166 [in Complexity.TM.PrettyBounds.M2MBounds]
c:167 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c:167 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
c:167 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
c:169 [in Complexity.TM.PrettyBounds.UnivBounds]
C:17 [in Complexity.NP.SAT.SAT_inNP]
c:17 [in Complexity.NP.L.LMGenNP]
c:17 [in Complexity.Complexity.ONotationIsAppropriate]
c:17 [in Complexity.NP.SAT.CookLevin.Subproblems.TM_single]
c:17 [in Complexity.NP.L.GenNP]
c:170 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
c:170 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
c:170 [in Undecidability.Shared.Libs.DLW.Vec.pos]
c:173 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
c:174 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
c:175 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c:179 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
C:179 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
c:18 [in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
c:18 [in Complexity.Complexity.ONotation]
c:18 [in Undecidability.L.Datatypes.List.List_basics]
c:18 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds_Loop]
c:18 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
c:18 [in Complexity.L.AbstractMachines.AbstractSubstMachine]
c:18 [in Undecidability.L.Complexity.GenericNary]
C:18 [in Undecidability.Shared.ListAutomation]
C:18 [in Undecidability.Shared.Libs.PSL.FiniteTypes.Cardinality]
C:18 [in Complexity.Libs.CookPrelim.MorePrelim]
c:180 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
c:180 [in Undecidability.TM.Compound.MoveToSymbol]
c:183 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c:183 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
C:184 [in Complexity.L.ComparisonTimeBoundDerivation]
c:185 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
C:187 [in Complexity.L.ComparisonTimeBoundDerivation]
C:188 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
c:19 [in Complexity.TM.PrettyBounds.BaseCode]
c:19 [in Undecidability.TM.Combinators.Mirror]
C:19 [in Complexity.L.AbstractMachines.AbstractSubstMachine]
c:190 [in Complexity.L.ComparisonTimeBoundDerivation]
c:191 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
C:192 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
c:193 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
c:194 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
C:196 [in Complexity.L.ComparisonTimeBoundDerivation]
c:198 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
C:198 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
c:2 [in Complexity.NP.L.LMGenNP]
C:2 [in Complexity.L.AbstractMachines.AbstractSubstMachine]
c:20 [in Complexity.TM.PrettyBounds.BaseCode]
c:20 [in Complexity.TM.PrettyBounds.UnivBounds]
c:202 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
c:205 [in Undecidability.Shared.Libs.DLW.Utils.sums]
C:209 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
c:21 [in Complexity.TM.PrettyBounds.BaseCode]
C:21 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
c:21 [in Complexity.NP.TM.mTM_to_singleTapeTM]
C:21 [in Complexity.NP.SAT.kSAT]
c:21 [in Complexity.TM.Single.DecodeTapes]
c:210 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
c:216 [in Undecidability.TM.Single.StepTM]
c:216 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
c:22 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds_Loop]
c:22 [in Complexity.NP.TM.mTM_to_singleTapeTM]
c:22 [in Undecidability.TM.Combinators.Switch]
c:22 [in Complexity.L.TM.TMflatComp]
c:22 [in Complexity.NP.L.LMGenNP]
c:22 [in Complexity.TM.Single.DecodeTapes]
c:22 [in Undecidability.TM.Combinators.StateWhile]
C:22 [in Undecidability.Shared.ListAutomation]
c:22 [in Complexity.NP.SAT.CookLevin.Subproblems.CC]
c:221 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
C:23 [in Complexity.NP.SAT.kSAT]
C:23 [in Undecidability.Shared.Libs.PSL.Inhabited]
c:23 [in Complexity.NP.L.GenNPBool]
c:23 [in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisStep]
c:23 [in Complexity.NP.SAT.CookLevin.Subproblems.TM_single]
C:23 [in Undecidability.TM.Code.ChangeAlphabet]
c:231 [in Complexity.TM.PrettyBounds.M2MBounds]
c:232 [in Complexity.L.TM.TMunflatten]
c:239 [in Complexity.TM.PrettyBounds.M2MBounds]
c:24 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds_Loop]
c:24 [in Undecidability.TM.Combinators.Switch]
C:24 [in Complexity.L.AbstractMachines.AbstractSubstMachine]
c:24 [in Complexity.NP.SAT.CookLevin.Subproblems.TM_single]
c:24 [in Undecidability.TM.Combinators.StateWhile]
C:24 [in Complexity.NP.SAT.SAT]
c:25 [in Complexity.NP.SAT.CookLevin.Subproblems.TM_single]
c:25 [in Complexity.TM.PrettyBounds.PrettyBounds]
c:250 [in Complexity.TM.PrettyBounds.M2MBounds]
C:250 [in Undecidability.Shared.Libs.DLW.Vec.vec]
c:259 [in Complexity.TM.PrettyBounds.M2MBounds]
c:26 [in Undecidability.TM.Combinators.Switch]
C:26 [in Complexity.NP.SAT.kSAT]
C:26 [in Undecidability.Shared.Libs.PSL.Inhabited]
c:26 [in Complexity.L.TM.TMflatComp]
C:26 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
c:26 [in Undecidability.TM.Combinators.StateWhile]
c:26 [in Undecidability.TM.Code.BinNumbers.PosAddTM]
c:260 [in Undecidability.TM.Util.TM_facts]
c:262 [in Undecidability.TM.Hoare.HoareExamples]
c:265 [in Undecidability.TM.Util.TM_facts]
c:2659 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
c:268 [in Undecidability.TM.Single.StepTM]
c:2680 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
c:269 [in Undecidability.TM.Hoare.HoareExamples]
c:2693 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
c:27 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
c:27 [in Undecidability.TM.Code.BinNumbers.PosAddTM]
c:273 [in Undecidability.TM.Hoare.HoareExamples]
c:273 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
c:276 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
c:276 [in Undecidability.TM.Hoare.HoareExamples]
c:2782 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
c:2783 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
c:28 [in Undecidability.TM.Combinators.Switch]
c:28 [in Complexity.TM.Single.EncodeTapesInvariants]
c:28 [in Complexity.NP.L.GenNPBool]
c:28 [in Complexity.L.TM.TMflatComp]
c:280 [in Undecidability.TM.Hoare.HoareExamples]
c:281 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
c:282 [in Complexity.TM.PrettyBounds.M2MBounds]
c:285 [in Undecidability.TM.Hoare.HoareExamples]
c:286 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
c:29 [in Complexity.TM.PrettyBounds.M2MBounds]
c:29 [in Undecidability.TM.Combinators.Switch]
c:29 [in Undecidability.TM.Combinators.StateWhile]
c:29 [in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
c:29 [in Undecidability.TM.Code.BinNumbers.PosAddTM]
c:29 [in Complexity.TM.PrettyBounds.PrettyBounds]
c:290 [in Undecidability.TM.Hoare.HoareExamples]
c:291 [in Undecidability.TM.Hoare.HoareExamples]
c:292 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
c:2935 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
c:2937 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
c:2939 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
c:2941 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
c:2943 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
c:2945 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
c:2947 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
c:2949 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
c:295 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
c:295 [in Undecidability.TM.Hoare.HoareExamples]
c:2958 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
c:2961 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
c:2964 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
c:2967 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
c:2972 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
c:2975 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
c:298 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
c:2980 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
c:2983 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
c:2987 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
c:2997 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
c:3 [in Complexity.Complexity.ONotation]
c:3 [in Complexity.L.TM.TMflatComp]
C:3 [in Complexity.NP.SAT.SAT_inNP]
c:3 [in Complexity.Complexity.ONotationIsAppropriate]
c:3 [in Complexity.NP.SAT.CookLevin.Subproblems.SingleTMGenNP]
C:3 [in Complexity.NP.Clique.kSAT_to_Clique]
c:30 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds_Loop]
c:30 [in Complexity.TM.PrettyBounds.UnivBounds]
c:30 [in Undecidability.TM.Combinators.Switch]
c:30 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
c:30 [in Complexity.L.TM.TMflatComp]
c:30 [in Undecidability.L.Prelim.MoreList]
c:300 [in Undecidability.TM.Hoare.HoareExamples]
c:3000 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
c:3003 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
c:3008 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
c:3011 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
c:3016 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
c:3019 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
c:3023 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
c:303 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
c:3033 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
c:305 [in Undecidability.TM.Hoare.HoareExamples]
c:3050 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
c:3059 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
c:3065 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
c:3068 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
c:309 [in Undecidability.TM.Hoare.HoareExamples]
c:31 [in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
c:31 [in Complexity.TM.PrettyBounds.BaseCode]
c:31 [in Undecidability.TM.Combinators.Switch]
C:31 [in Complexity.NP.SAT.SAT]
c:313 [in Undecidability.TM.Hoare.HoareExamples]
c:3135 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
c:317 [in Undecidability.TM.Hoare.HoareExamples]
c:32 [in Complexity.TM.PrettyBounds.M2MBounds]
c:32 [in Complexity.NP.L.GenNPBool]
c:32 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
c:322 [in Complexity.TM.PrettyBounds.M2MBounds]
c:322 [in Undecidability.TM.Hoare.HoareExamples]
c:324 [in Complexity.Libs.CookPrelim.MorePrelim]
c:327 [in Undecidability.TM.Hoare.HoareExamples]
c:33 [in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
c:33 [in Undecidability.Shared.Libs.PSL.Retracts]
c:33 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
c:331 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
c:331 [in Undecidability.TM.Hoare.HoareExamples]
c:337 [in Undecidability.TM.Hoare.HoareExamples]
c:338 [in Complexity.TM.PrettyBounds.M2MBounds]
c:34 [in Undecidability.TM.TM]
c:34 [in Undecidability.L.Prelim.MoreList]
c:342 [in Undecidability.TM.Hoare.HoareExamples]
c:345 [in Undecidability.TM.Hoare.HoareExamples]
c:35 [in Complexity.TM.PrettyBounds.M2MBounds]
C:35 [in Undecidability.Shared.Libs.PSL.Lists.Removal]
c:35 [in Complexity.NP.TM.mTM_to_singleTapeTM]
c:35 [in Complexity.L.TM.TMflatComp]
c:35 [in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
c:350 [in Undecidability.TM.Hoare.HoareExamples]
c:356 [in Undecidability.TM.Hoare.HoareExamples]
c:36 [in Complexity.TM.PrettyBounds.BaseCode]
c:36 [in Complexity.Complexity.ONotation]
c:36 [in Complexity.NP.TM.mTM_to_singleTapeTM]
c:36 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
c:362 [in Undecidability.TM.Hoare.HoareExamples]
c:367 [in Undecidability.TM.Hoare.HoareExamples]
c:37 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds_Loop]
C:37 [in Undecidability.L.Datatypes.LVector]
c:37 [in Complexity.NP.L.GenNPBool]
c:37 [in Undecidability.Shared.Libs.PSL.Vectors.VectorDupfree]
c:37 [in Complexity.TM.PrettyBounds.PrettyBounds]
c:372 [in Undecidability.TM.Hoare.HoareExamples]
c:377 [in Undecidability.TM.Hoare.HoareExamples]
c:38 [in Complexity.TM.PrettyBounds.M2MBounds]
c:38 [in Undecidability.L.Complexity.UpToC]
c:383 [in Undecidability.TM.Hoare.HoareExamples]
c:389 [in Undecidability.TM.Hoare.HoareExamples]
c:39 [in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
c:39 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
c:39 [in Undecidability.L.Prelim.MoreList]
c:392 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
c:394 [in Undecidability.TM.Hoare.HoareExamples]
c:395 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
C:396 [in Undecidability.TM.Util.TM_facts]
c:4 [in Complexity.NP.SAT.CookLevin]
c:4 [in Complexity.NP.L.GenNP_is_hard]
c:4 [in Complexity.L.TM.TMflatEnc]
c:4 [in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisUnfoldClos]
c:4 [in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisStep]
c:4 [in Undecidability.L.TM.TMinL.TMinL_extract]
c:4 [in Complexity.Complexity.Monotonic]
c:4 [in Complexity.TM.PrettyBounds.PrettyBounds]
c:40 [in Undecidability.L.Complexity.UpToCNary]
c:40 [in Complexity.TM.PrettyBounds.UnivBounds]
C:40 [in Undecidability.L.Tactics.GenEncode]
c:40 [in Complexity.TM.PrettyBounds.PrettyBounds]
c:400 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
c:405 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
c:409 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
c:41 [in Complexity.TM.PrettyBounds.BaseCode]
c:41 [in Complexity.TM.Single.EncodeTapesInvariants]
c:41 [in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
c:41 [in Undecidability.TM.Code.BinNumbers.PosShiftTM]
c:416 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
c:42 [in Complexity.Complexity.ONotation]
c:42 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
c:42 [in Undecidability.TM.Combinators.StateWhile]
c:43 [in Undecidability.L.Tactics.LClos]
c:43 [in Undecidability.L.Complexity.UpToC]
c:43 [in Complexity.NP.SAT.CookLevin.Subproblems.TM_single]
c:43 [in Undecidability.TM.SBTM]
c:43 [in Complexity.L.TM.TMflatFun]
c:43 [in Complexity.TM.PrettyBounds.PrettyBounds]
c:43 [in Undecidability.L.Prelim.MoreList]
c:433 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
c:435 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
c:44 [in Undecidability.TM.Combinators.StateWhile]
C:44 [in Complexity.NP.SAT.SAT]
c:45 [in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
c:45 [in Undecidability.Shared.Libs.DLW.Utils.fin_quotient]
c:45 [in Undecidability.L.Complexity.UpToCNary]
C:45 [in Complexity.L.ComparisonTimeBoundDerivation]
c:45 [in Complexity.L.TM.TMflatComp]
c:45 [in Complexity.NP.SAT.FSAT.FSAT]
c:458 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
c:46 [in Complexity.TM.PrettyBounds.BaseCode]
C:46 [in Undecidability.Shared.ListAutomation]
c:46 [in Complexity.TM.PrettyBounds.PrettyBounds]
c:466 [in Undecidability.TM.Single.StepTM]
c:47 [in Complexity.TM.PrettyBounds.M2MBounds]
c:47 [in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
C:47 [in Complexity.L.ComparisonTimeBoundDerivation]
c:47 [in Complexity.L.AbstractMachines.FlatPro.Computable.Compile]
c:48 [in Undecidability.Shared.Libs.DLW.Utils.prime]
c:48 [in Undecidability.TM.Lifting.LiftAlphabet]
c:48 [in Undecidability.L.Complexity.UpToC]
c:482 [in Undecidability.TM.Single.StepTM]
c:49 [in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
c:49 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
c:49 [in Complexity.L.AbstractMachines.FlatPro.Computable.Compile]
C:5 [in Complexity.NP.SAT.kSAT]
c:5 [in Complexity.NP.L.GenNPBool]
c:5 [in Undecidability.L.TM.TMinL.TMinL_extract]
C:5 [in Complexity.NP.SAT.SAT]
c:50 [in Undecidability.L.Complexity.UpToCNary]
c:50 [in Undecidability.Shared.Libs.DLW.Utils.fin_upto]
c:51 [in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
c:51 [in Undecidability.Shared.Libs.DLW.Utils.fin_upto]
c:51 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
c:51 [in Complexity.TM.PrettyBounds.PrettyBounds]
c:52 [in Undecidability.TM.Compound.Shift]
c:52 [in Complexity.NP.SAT.SAT]
c:53 [in Undecidability.TM.Lifting.LiftAlphabet]
C:53 [in Complexity.L.ComparisonTimeBoundDerivation]
c:54 [in Complexity.Complexity.ONotation]
C:54 [in Complexity.TM.PrettyBounds.BaseCodeSpace]
c:54 [in Complexity.L.TM.TMflatFun]
C:54 [in Complexity.NP.Clique.kSAT_to_Clique]
c:54 [in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
c:55 [in Complexity.TM.PrettyBounds.BaseCode]
C:55 [in Complexity.NP.SAT.SAT_inNP]
c:56 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
c:56 [in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
c:568 [in Complexity.NP.TM.LM_to_mTM]
c:57 [in Undecidability.Shared.Libs.DLW.Utils.fin_base]
c:57 [in Complexity.L.TM.TMflatFun]
c:58 [in Complexity.TM.PrettyBounds.M2MBounds]
c:58 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
c:58 [in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
c:58 [in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
c:58 [in Complexity.NP.SAT.SAT]
c:59 [in Complexity.TM.PrettyBounds.UnivBounds]
c:59 [in Undecidability.L.Tactics.Reflection]
c:6 [in Complexity.NP.L.GenNP_is_hard]
c:6 [in Complexity.TM.Code.DecodeBool]
c:6 [in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
c:6 [in Undecidability.L.TM.TMinL.TMinL_extract]
c:60 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
C:60 [in Complexity.NP.SAT.SAT_inNP]
c:60 [in Complexity.TM.Single.DecodeTape]
c:61 [in Undecidability.TM.Code.NatTM]
c:61 [in Undecidability.TM.Univ.LowLevel]
c:61 [in Complexity.TM.Single.DecodeTape]
c:61 [in Complexity.NP.SAT.SAT]
c:62 [in Complexity.TM.PrettyBounds.M2MBounds]
c:62 [in Undecidability.L.Complexity.UpToC]
c:62 [in Undecidability.Shared.Libs.DLW.Utils.fin_base]
c:62 [in Complexity.TM.Single.DecodeTape]
c:63 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
C:63 [in Undecidability.TM.Util.TM_facts]
c:64 [in Undecidability.L.Complexity.UpToCNary]
c:64 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
C:64 [in Complexity.NP.SAT.SAT_inNP]
c:64 [in Complexity.L.TM.TMflatFun]
c:64 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
c:65 [in Complexity.Complexity.ONotation]
c:66 [in Complexity.Libs.CookPrelim.PolyBounds]
c:66 [in Complexity.NP.TM.M_multi2mono]
c:67 [in Undecidability.L.Complexity.UpToC]
c:68 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
c:68 [in Complexity.TM.PrettyBounds.UnivBounds]
C:68 [in Complexity.NP.SAT.SAT_inNP]
c:68 [in Undecidability.TM.Univ.LowLevel]
c:68 [in Complexity.L.TM.TMflat]
c:68 [in Complexity.NP.SAT.SAT]
c:69 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
c:69 [in Undecidability.L.Complexity.UpToCNary]
c:7 [in Complexity.TM.PrettyBounds.BaseCode]
c:7 [in Undecidability.Shared.Libs.DLW.Utils.fin_quotient]
c:7 [in Complexity.NP.L.GenNPBool]
c:7 [in Complexity.NP.L.GenNP]
c:70 [in Complexity.TM.Code.Decode]
c:70 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
c:70 [in Complexity.NP.TM.M_multi2mono]
c:70 [in Undecidability.TM.Hoare.HoareMult]
C:70 [in Complexity.NP.SAT.SAT]
c:71 [in Complexity.TM.PrettyBounds.BaseCode]
c:71 [in Complexity.TM.Code.Decode]
c:71 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
c:72 [in Undecidability.L.Functions.FinTypeLookup]
c:73 [in Complexity.TM.PrettyBounds.BaseCode]
c:73 [in Undecidability.TM.Code.NatTM]
c:73 [in Undecidability.L.Functions.FinTypeLookup]
c:74 [in Complexity.TM.PrettyBounds.M2MBounds]
c:74 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
C:74 [in Complexity.NP.SAT.SAT_inNP]
c:74 [in Undecidability.TM.Hoare.HoareMult]
c:74 [in Undecidability.L.Functions.FinTypeLookup]
c:76 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c:76 [in Complexity.NP.SAT.SAT_inNP]
c:76 [in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
c:77 [in Complexity.TM.PrettyBounds.M2MBounds]
c:77 [in Complexity.TM.PrettyBounds.UnivBounds]
c:77 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
c:77 [in Complexity.NP.SAT.SAT_inNP]
c:78 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
C:78 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
c:78 [in Complexity.NP.SAT.SAT_inNP]
c:78 [in Complexity.Complexity.UpToCPoly]
c:78 [in Complexity.L.TM.TMflatFun]
c:78 [in Undecidability.TM.Hoare.HoareMult]
c:79 [in Complexity.TM.PrettyBounds.BaseCode]
c:79 [in Complexity.NP.SAT.SAT_inNP]
c:8 [in Complexity.TM.PrettyBounds.BaseCode]
c:8 [in Complexity.NP.L.GenNP_is_hard]
C:8 [in Complexity.NP.SAT.kSAT]
c:8 [in Complexity.NP.SAT.CookLevin.Subproblems.BinaryCC]
C:8 [in Complexity.NP.SAT.SAT_inNP]
c:8 [in Complexity.NP.SAT.CookLevin.Subproblems.SingleTMGenNP]
C:8 [in Complexity.NP.Clique.kSAT_to_Clique]
c:80 [in Complexity.TM.PrettyBounds.BaseCode]
c:80 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
c:80 [in Undecidability.TM.Code.NatTM]
c:80 [in Complexity.NP.SAT.SAT_inNP]
c:80 [in Undecidability.Shared.Libs.DLW.Utils.fin_base]
c:80 [in Undecidability.L.Complexity.GenericNary]
c:81 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c:81 [in Undecidability.TM.Code.BinNumbers.PosCompareTM]
c:81 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
c:81 [in Complexity.L.TM.TMflatComp]
c:81 [in Complexity.NP.SAT.SAT_inNP]
c:82 [in Undecidability.Shared.Libs.DLW.Utils.fin_base]
c:83 [in Complexity.TM.PrettyBounds.M2MBounds]
c:83 [in Complexity.TM.PrettyBounds.BaseCode]
c:83 [in Undecidability.TM.Hoare.HoareMult]
c:84 [in Complexity.L.TM.TMflatComp]
c:85 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
C:85 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
c:86 [in Complexity.TM.PrettyBounds.UnivBounds]
c:86 [in Complexity.Libs.CookPrelim.MorePrelim]
c:87 [in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
c:88 [in Complexity.TM.PrettyBounds.M2MBounds]
c:88 [in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
c:88 [in Undecidability.TM.Hoare.HoareMult]
c:89 [in Complexity.TM.PrettyBounds.BaseCode]
c:89 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c:89 [in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
c:9 [in Complexity.TM.PrettyBounds.UnivBounds]
c:9 [in Undecidability.L.Prelim.MoreBase]
c:9 [in Complexity.NP.L.GenNPBool]
c:9 [in Complexity.NP.L.LMGenNP]
c:9 [in Complexity.NP.SAT.CookLevin.Reductions.TMGenNP_fixed_singleTapeTM_to_FlatFunSingleTMGenNP]
c:9 [in Complexity.NP.SAT.CookLevin.Subproblems.TM_single]
c:9 [in Undecidability.L.TM.TMinL.TMinL_extract]
c:9 [in Undecidability.TM.Compound.Shift]
C:9 [in Complexity.NP.SAT.SAT]
c:90 [in Complexity.TM.PrettyBounds.BaseCode]
c:90 [in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
c:90 [in Complexity.NP.Clique.kSAT_to_Clique]
c:91 [in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
c:92 [in Complexity.TM.Single.DecodeTape]
c:93 [in Complexity.TM.PrettyBounds.BaseCode]
C:93 [in Undecidability.Shared.Libs.PSL.Retracts]
c:93 [in Undecidability.TM.Hoare.HoareMult]
c:94 [in Complexity.TM.PrettyBounds.M2MBounds]
c:95 [in Complexity.TM.PrettyBounds.BaseCode]
c:95 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c:96 [in Undecidability.TM.Hoare.HoareMult]

D

decP:340 [in Undecidability.TM.Hoare.HoareRegister]
decX:113 [in Undecidability.TM.Code.Code]
decX:138 [in Undecidability.TM.Code.Code]
decX:168 [in Undecidability.TM.Code.Code]
decX:68 [in Undecidability.TM.Code.Code]
decY:114 [in Undecidability.TM.Code.Code]
decY:69 [in Undecidability.TM.Code.Code]
def':120 [in Undecidability.L.Tactics.Extract]
def':147 [in Undecidability.L.Tactics.Extract]
def2:151 [in Undecidability.L.Tactics.Extract]
def:100 [in Undecidability.TM.Util.Prelim]
def:121 [in Undecidability.L.Tactics.Extract]
def:152 [in Undecidability.L.Tactics.Extract]
def:158 [in Undecidability.L.Tactics.Extract]
def:26 [in Undecidability.Shared.Libs.PSL.FiniteTypes.FiniteFunction]
def:33 [in Undecidability.Shared.Libs.PSL.FiniteTypes.FiniteFunction]
def:332 [in Complexity.Libs.CookPrelim.MorePrelim]
def:39 [in Undecidability.L.Functions.FinTypeLookup]
def:45 [in Undecidability.Shared.Libs.PSL.FiniteTypes.FiniteFunction]
def:51 [in Complexity.NP.Clique.kSAT_to_Clique]
def:51 [in Undecidability.L.Functions.FinTypeLookup]
def:55 [in Undecidability.Shared.Libs.PSL.FiniteTypes.FiniteFunction]
def:61 [in Undecidability.L.Functions.FinTypeLookup]
def:64 [in Undecidability.Shared.Libs.PSL.FiniteTypes.FiniteFunction]
def:85 [in Undecidability.TM.Lifting.LiftTapes]
def:88 [in Complexity.L.TM.TMunflatten]
def:89 [in Undecidability.TM.Lifting.LiftTapes]
devil:215 [in Undecidability.Shared.Libs.DLW.Vec.vec]
devil:226 [in Undecidability.Shared.Libs.DLW.Vec.vec]
Dfin:3146 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Dflat:3150 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
dir:2010 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
dir:2042 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
dir:2074 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
domain:1 [in Undecidability.TM.Code.List.Concat_Repeat]
domain:1 [in Undecidability.L.Complexity.GenericNary]
domain:19 [in Undecidability.L.Complexity.GenericNary]
domain:24 [in Undecidability.L.Complexity.UpToCNary]
domain:29 [in Undecidability.L.Complexity.UpToCNary]
domain:34 [in Undecidability.L.Complexity.UpToCNary]
domain:39 [in Undecidability.L.Complexity.UpToCNary]
domain:44 [in Undecidability.L.Complexity.UpToCNary]
domain:48 [in Undecidability.L.Complexity.GenericNary]
domain:49 [in Undecidability.L.Complexity.UpToCNary]
domain:5 [in Undecidability.L.Complexity.GenericNary]
domain:52 [in Undecidability.L.Complexity.UpToCNary]
domain:56 [in Undecidability.L.Complexity.UpToCNary]
domain:63 [in Undecidability.L.Complexity.UpToCNary]
domain:68 [in Undecidability.L.Complexity.UpToCNary]
domain:74 [in Undecidability.L.Complexity.GenericNary]
domain:78 [in Undecidability.L.Complexity.GenericNary]
domain:79 [in Complexity.Complexity.PolyTimeComputable]
domain:82 [in Undecidability.L.Complexity.GenericNary]
domain:85 [in Undecidability.L.Complexity.GenericNary]
domain:9 [in Undecidability.L.Complexity.GenericNary]
domain:95 [in Undecidability.L.Complexity.UpToCNary]
doSplit:173 [in Undecidability.L.Tactics.Extract]
dst:626 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
dst:632 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
ds:17 [in Undecidability.L.Complexity.GenericNary]
ds:41 [in Undecidability.L.Complexity.GenericNary]
ds:70 [in Undecidability.L.Complexity.GenericNary]
D':105 [in Undecidability.Shared.Libs.PSL.Retracts]
D':117 [in Undecidability.Shared.Libs.PSL.Retracts]
D':132 [in Undecidability.Shared.Libs.PSL.Retracts]
D':150 [in Undecidability.Shared.Libs.PSL.Retracts]
d':2667 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
d':2688 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
d':3 [in Complexity.TM.Compound.MoveToSymbol_niceSpec]
d':40 [in Undecidability.L.Complexity.GenericNary]
d':69 [in Undecidability.L.Complexity.GenericNary]
d1:178 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
d1:182 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
d1:297 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
d2:180 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
d2:184 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
d2:299 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
d:10 [in Undecidability.Shared.Libs.PSL.EqDec]
d:10 [in Undecidability.Shared.Dec]
d:100 [in Complexity.L.TM.TMunflatten]
D:104 [in Undecidability.Shared.Libs.PSL.Retracts]
D:110 [in Undecidability.TM.Util.TM_facts]
D:112 [in Undecidability.TM.Util.TM_facts]
D:116 [in Undecidability.Shared.Libs.PSL.Retracts]
D:12 [in Undecidability.Shared.Libs.PSL.FiniteTypes.Arbitrary]
d:124 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
d:13 [in Undecidability.Shared.Libs.PSL.EqDec]
D:131 [in Undecidability.Shared.Libs.PSL.Retracts]
D:133 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
d:14 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
D:149 [in Undecidability.Shared.Libs.PSL.Retracts]
d:15 [in Undecidability.Shared.Libs.PSL.EqDec]
d:16 [in Undecidability.L.Tactics.GenEncode]
d:16 [in Undecidability.L.Datatypes.List.List_nat]
d:16 [in Undecidability.L.Functions.EqBool]
d:16 [in Undecidability.L.Complexity.GenericNary]
D:17 [in Undecidability.Shared.Libs.PSL.FiniteTypes.Arbitrary]
d:18 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
D:180 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
D:189 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
D:19 [in Complexity.Libs.CookPrelim.MorePrelim]
D:199 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
d:2 [in Complexity.TM.Compound.MoveToSymbol_niceSpec]
d:20 [in Undecidability.Shared.Libs.DLW.Utils.utils_string]
d:20 [in Complexity.L.TM.TMunflatten]
d:20 [in Undecidability.Shared.Libs.DLW.Code.sss]
D:204 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
d:21 [in Undecidability.Shared.Libs.PSL.EqDec]
d:21 [in Undecidability.L.Functions.FinTypeLookup]
d:22 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
d:23 [in Undecidability.Shared.Libs.PSL.EqDec]
D:24 [in Undecidability.Shared.Libs.PSL.FiniteTypes.Arbitrary]
d:2660 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
d:2681 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
d:2694 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
d:27 [in Undecidability.L.Functions.EqBool]
d:3 [in Undecidability.Shared.Libs.PSL.EqDec]
d:3 [in Undecidability.Shared.Dec]
D:30 [in Undecidability.Shared.Libs.PSL.FiniteTypes.Arbitrary]
d:3036 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
d:3051 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
d:31 [in Undecidability.L.Functions.FinTypeLookup]
d:3136 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
d:32 [in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
d:328 [in Undecidability.TM.Single.StepTM]
d:33 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
d:333 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
d:335 [in Undecidability.TM.Single.StepTM]
d:338 [in Undecidability.TM.Single.StepTM]
d:34 [in Complexity.L.TM.TMunflatten]
d:340 [in Undecidability.TM.Single.StepTM]
d:344 [in Undecidability.TM.Single.StepTM]
d:350 [in Undecidability.TM.Single.StepTM]
d:352 [in Undecidability.TM.Single.StepTM]
D:36 [in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
d:36 [in Undecidability.L.Complexity.GenericNary]
d:368 [in Undecidability.TM.Single.StepTM]
d:37 [in Complexity.L.TM.TMunflatten]
D:37 [in Undecidability.Shared.Libs.PSL.FiniteTypes.Arbitrary]
d:374 [in Undecidability.TM.Single.StepTM]
d:376 [in Undecidability.TM.Single.StepTM]
D:38 [in Undecidability.TM.Util.TM_facts]
d:383 [in Undecidability.TM.Single.StepTM]
d:385 [in Undecidability.TM.Single.StepTM]
d:387 [in Undecidability.TM.Single.StepTM]
d:39 [in Undecidability.L.Complexity.GenericNary]
d:391 [in Undecidability.TM.Single.StepTM]
d:398 [in Undecidability.TM.Single.StepTM]
d:40 [in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
d:40 [in Complexity.L.TM.TMunflatten]
d:414 [in Undecidability.TM.Single.StepTM]
D:42 [in Undecidability.Shared.Libs.PSL.FiniteTypes.Arbitrary]
D:45 [in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
d:46 [in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
d:5 [in Undecidability.Shared.Libs.PSL.EqDec]
d:5 [in Complexity.L.TM.TMflatEnc]
d:5 [in Undecidability.Synthetic.Infinite]
d:50 [in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
d:51 [in Undecidability.TM.Lifting.LiftAlphabet]
d:51 [in Complexity.Complexity.SpaceBoundsTime]
D:52 [in Undecidability.Shared.Libs.PSL.FiniteTypes.Arbitrary]
d:52 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
D:53 [in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
D:55 [in Complexity.TM.PrettyBounds.BaseCodeSpace]
d:59 [in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
d:6 [in Undecidability.Shared.Dec]
d:64 [in Undecidability.L.Complexity.GenericNary]
d:65 [in Undecidability.L.Tactics.GenEncode]
d:68 [in Undecidability.L.Complexity.GenericNary]
d:69 [in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
d:7 [in Undecidability.Shared.Libs.PSL.EqDec]
d:7 [in Undecidability.L.Functions.FinTypeLookup]
d:71 [in Undecidability.L.Tactics.GenEncode]
d:71 [in Undecidability.L.Functions.FinTypeLookup]
d:75 [in Undecidability.L.Tactics.GenEncode]
d:79 [in Complexity.TM.PrettyBounds.M2MBounds]
d:8 [in Undecidability.Shared.Dec]
d:85 [in Complexity.TM.PrettyBounds.M2MBounds]
d:887 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
d:90 [in Complexity.TM.PrettyBounds.M2MBounds]
d:91 [in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
d:96 [in Complexity.TM.PrettyBounds.M2MBounds]

E

effectiveMove:2025 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
effectiveMove:2057 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
effectiveMove:2087 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
ele:110 [in Complexity.Libs.CookPrelim.PolyBounds]
ele:127 [in Complexity.Libs.CookPrelim.PolyBounds]
ele:130 [in Complexity.Libs.CookPrelim.PolyBounds]
elm:5 [in Undecidability.L.Datatypes.List.List_fold]
encn:47 [in Undecidability.L.Tactics.GenEncode]
encode:11 [in Complexity.TM.Code.Decode]
encode:3 [in Complexity.TM.Code.Decode]
envFinList:3138 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
envFinList:3210 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
envFin:3032 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
envFin:3067 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
envFin:3079 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
envFin:3140 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
envFin:3141 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
envFlatList:3137 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
envFlatList:3209 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
envFlat:3031 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
envFlat:3066 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
envFlat:3078 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
envFlat:3139 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
envFlat:3142 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
envList:3260 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
envList:3265 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
envList:3268 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
envList:3599 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
envList:3633 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
envs:350 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
envs:354 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
envs:364 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
envs:371 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
envs:374 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
envs:377 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
envs:387 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
envs:392 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
envs:395 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
envs:464 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
envs:472 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
envs:479 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
envs:483 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
envs:500 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
envs:521 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
envs:542 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
envs:561 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
envs:567 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
envs:572 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
envs:576 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
envs:587 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
envs:600 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
envs:613 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
envs:707 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
envs:710 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
envs:714 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
envs:768 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
envs:771 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
envs:775 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
env:104 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
env:107 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
env:107 [in Complexity.Libs.CookPrelim.PolyBounds]
env:109 [in Complexity.Libs.CookPrelim.PolyBounds]
env:111 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
env:115 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
env:119 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
env:123 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
env:125 [in Complexity.Libs.CookPrelim.PolyBounds]
env:127 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
env:128 [in Complexity.Libs.CookPrelim.PolyBounds]
env:131 [in Complexity.Libs.CookPrelim.PolyBounds]
env:132 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
env:137 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
env:139 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
env:144 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
env:148 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
env:152 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
env:156 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
env:160 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
env:163 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
env:166 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
env:170 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
env:174 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
env:178 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
env:182 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
env:185 [in Undecidability.L.Tactics.Extract]
env:186 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
env:191 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
env:195 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
env:199 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
env:203 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
env:210 [in Undecidability.L.Tactics.Extract]
env:2930 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
env:2957 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
env:2960 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
env:2963 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
env:2966 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
env:2971 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
env:2974 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
env:2979 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
env:2982 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
env:2986 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
env:2996 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
env:2999 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
env:3002 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
env:3007 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
env:3010 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
env:3015 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
env:3018 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
env:3022 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
env:3045 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
env:3058 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
env:306 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
env:3064 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
env:3075 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
env:3167 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
env:3185 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
env:3195 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
env:3243 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
env:3245 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
env:3248 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
env:3253 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
env:341 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
env:344 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
env:347 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
env:352 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
env:3603 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
env:3605 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
env:399 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
env:401 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
env:405 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
env:407 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
env:412 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
env:414 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
env:422 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
env:424 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
env:49 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
env:51 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
env:52 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
env:55 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
env:59 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
env:62 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
env:77 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
env:80 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
env:84 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
env:88 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
env:94 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
env:99 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
eqbA:34 [in Undecidability.L.Functions.FinTypeLookup]
eqbA:46 [in Undecidability.L.Functions.FinTypeLookup]
eqbA:57 [in Undecidability.L.Functions.FinTypeLookup]
eqbCompT:53 [in Undecidability.L.Functions.EqBool]
eqbT:21 [in Undecidability.L.Datatypes.LOptions]
eqbT:34 [in Undecidability.L.Datatypes.List.List_eqb]
eqbT:40 [in Undecidability.L.Datatypes.List.List_eqb]
eqbT:43 [in Undecidability.L.Datatypes.List.List_eqb]
eqbT:49 [in Undecidability.L.Datatypes.List.List_eqb]
eqbT:80 [in Undecidability.L.Datatypes.LVector]
eqbX:103 [in Complexity.L.TM.TMflatComp]
eqbX:115 [in Complexity.L.TM.TMunflatten]
eqbX:127 [in Complexity.L.TM.TMunflatten]
eqbX:136 [in Complexity.L.TM.TMunflatten]
eqbX:143 [in Complexity.L.ComparisonTimeBoundDerivation]
eqbX:150 [in Complexity.L.TM.TMunflatten]
eqbX:24 [in Undecidability.L.Datatypes.List.List_in]
eqbX:3 [in Complexity.L.ComparisonTimeBoundDerivation]
eqbX:3 [in Undecidability.L.Functions.FinTypeLookup]
eqbX:51 [in Undecidability.L.Datatypes.List.List_in]
eqbX:67 [in Undecidability.L.Functions.FinTypeLookup]
eqbX:77 [in Complexity.L.ComparisonTimeBoundDerivation]
eqbX:84 [in Complexity.NP.SAT.SAT_inNP]
eqbx:91 [in Undecidability.L.Datatypes.LVector]
eqbY:104 [in Complexity.L.TM.TMflatComp]
eqbY:116 [in Complexity.L.TM.TMunflatten]
eqbY:128 [in Complexity.L.TM.TMunflatten]
eqbY:137 [in Complexity.L.TM.TMunflatten]
eqbY:151 [in Complexity.L.TM.TMunflatten]
eqB:12 [in Undecidability.L.Complexity.UpToCNary]
eqb:134 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
eqB:16 [in Undecidability.L.Complexity.UpToCNary]
eqb:2 [in Undecidability.L.Functions.EqBool]
eqB:20 [in Undecidability.L.Complexity.UpToCNary]
eqb:20 [in Undecidability.L.Datatypes.LOptions]
eqb:21 [in Undecidability.L.Complexity.UpToCNary]
eqb:23 [in Undecidability.L.Functions.EqBool]
eqb:26 [in Undecidability.L.Datatypes.List.List_nat]
eqb:3 [in Undecidability.L.Datatypes.List.List_eqb]
eqb:32 [in Undecidability.L.Functions.EqBool]
eqb:44 [in Undecidability.L.Functions.EqBool]
eqb:51 [in Undecidability.L.Functions.EqBool]
eqb:79 [in Undecidability.L.Datatypes.LVector]
eqB:8 [in Undecidability.L.Complexity.UpToCNary]
eqb:8 [in Undecidability.L.Functions.EqBool]
eqdec:17 [in Complexity.Libs.Pigeonhole]
eqdec:31 [in Complexity.Libs.CookPrelim.MorePrelim]
eqT:15 [in Undecidability.L.Datatypes.List.List_eqb]
eq__start:46 [in Complexity.L.TM.TMflat]
eq__states:44 [in Complexity.L.TM.TMflat]
eq__sig:43 [in Complexity.L.TM.TMflat]
eq__tapes:42 [in Complexity.L.TM.TMflat]
eq:14 [in Undecidability.L.Datatypes.List.List_eqb]
err:84 [in Undecidability.L.Tactics.Extract]
err:88 [in Undecidability.L.Tactics.Extract]
es:161 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
es:170 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
evalTime:25 [in Undecidability.L.Tactics.ComputableTime]
evalTime:32 [in Undecidability.L.Tactics.ComputableTime]
evalTime:42 [in Undecidability.L.Tactics.ComputableTime]
extractCaseEtaExpand:219 [in Undecidability.L.Tactics.Extract]
E':119 [in Undecidability.Shared.Libs.PSL.Retracts]
E':134 [in Undecidability.Shared.Libs.PSL.Retracts]
E':152 [in Undecidability.Shared.Libs.PSL.Retracts]
e':2668 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
e':2689 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
E':43 [in Undecidability.L.Tactics.GenEncode]
e':73 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
e':9 [in Undecidability.TM.L.HeapInterpreter.LookupTM]
e1:139 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
e1:3037 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
e1:3081 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
e1:34 [in Complexity.NP.Clique.FlatUGraph]
e1:36 [in Complexity.NP.Clique.FlatUGraph]
e2:3038 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
e2:3082 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
e2:35 [in Complexity.NP.Clique.FlatUGraph]
e2:37 [in Complexity.NP.Clique.FlatUGraph]
E:1 [in Complexity.NP.Clique.FlatUGraph]
E:100 [in Complexity.TM.PrettyBounds.UnivBounds]
e:100 [in Complexity.NP.Clique.FlatClique]
E:103 [in Complexity.NP.Clique.FlatClique]
e:104 [in Complexity.NP.Clique.FlatClique]
E:105 [in Complexity.NP.Clique.FlatClique]
E:106 [in Complexity.NP.Clique.FlatClique]
E:107 [in Complexity.NP.Clique.FlatClique]
E:108 [in Complexity.NP.Clique.FlatClique]
e:11 [in Undecidability.Shared.Libs.PSL.EqDec]
E:11 [in Undecidability.L.Tactics.GenEncode]
E:110 [in Complexity.NP.Clique.FlatClique]
e:113 [in Complexity.NP.Clique.FlatClique]
E:114 [in Undecidability.L.Tactics.Extract]
E:115 [in Complexity.NP.Clique.FlatClique]
e:116 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
E:117 [in Complexity.NP.Clique.FlatClique]
E:118 [in Undecidability.Shared.Libs.PSL.Retracts]
E:12 [in Complexity.NP.Clique.FlatUGraph]
E:120 [in Complexity.NP.Clique.FlatClique]
e:121 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
E:123 [in Complexity.NP.Clique.FlatClique]
e:13 [in Complexity.NP.Clique.FlatUGraph]
E:133 [in Undecidability.Shared.Libs.PSL.Retracts]
e:14 [in Undecidability.TM.L.HeapInterpreter.LookupTM]
e:143 [in Complexity.Libs.CookPrelim.FlatFinTypes]
e:149 [in Complexity.L.ComparisonTimeBoundDerivation]
e:15 [in Complexity.NP.Clique.FlatUGraph]
E:15 [in Complexity.NP.Clique.FlatClique]
E:151 [in Undecidability.Shared.Libs.PSL.Retracts]
e:16 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
e:162 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
e:165 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
e:166 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
e:169 [in Complexity.Libs.CookPrelim.FlatFinTypes]
e:171 [in Complexity.Libs.CookPrelim.FlatFinTypes]
e:174 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
e:174 [in Complexity.Libs.CookPrelim.FlatFinTypes]
e:175 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
E:19 [in Complexity.NP.Clique.FlatUGraph]
e:19 [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
e:19 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
e:2 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
e:20 [in Complexity.NP.Clique.FlatUGraph]
E:200 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
E:22 [in Complexity.NP.Clique.FlatClique]
e:22 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
e:228 [in Complexity.L.TM.TMflatComp]
e:238 [in Complexity.Libs.CookPrelim.MorePrelim]
e:24 [in Complexity.NP.Clique.FlatUGraph]
E:24 [in Complexity.NP.Clique.FlatClique]
e:242 [in Complexity.Libs.CookPrelim.MorePrelim]
e:250 [in Complexity.Libs.CookPrelim.MorePrelim]
e:2547 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
e:2661 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
e:2682 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
e:2695 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
e:2789 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
E:28 [in Complexity.NP.Clique.FlatUGraph]
e:28 [in Undecidability.L.Datatypes.List.List_in]
e:2959 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
e:303 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
e:3052 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
e:307 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
E:31 [in Complexity.NP.Clique.FlatUGraph]
e:312 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
e:312 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
e:318 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
e:319 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
e:33 [in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
e:34 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
e:346 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
e:36 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
e:367 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
e:376 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
E:38 [in Complexity.NP.Clique.FlatUGraph]
e:39 [in Complexity.NP.Clique.FlatUGraph]
e:390 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
e:397 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
e:4 [in Complexity.Libs.CookPrelim.FlatFinTypes]
E:4 [in Complexity.NP.Clique.FlatClique]
e:40 [in Undecidability.Shared.Libs.PSL.Lists.Position]
e:41 [in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
e:41 [in Complexity.NP.Clique.FlatUGraph]
E:42 [in Undecidability.Shared.Libs.PSL.Lists.Position]
E:42 [in Complexity.NP.Clique.FlatUGraph]
e:424 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
e:43 [in Undecidability.Shared.Libs.PSL.Retracts]
E:44 [in Undecidability.L.Tactics.GenEncode]
E:44 [in Complexity.NP.Clique.FlatUGraph]
e:447 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
E:46 [in Complexity.NP.Clique.FlatClique]
e:465 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
e:465 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
e:47 [in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
e:47 [in Complexity.NP.Clique.FlatClique]
E:48 [in Complexity.NP.Clique.FlatClique]
e:489 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
e:49 [in Complexity.NP.Clique.FlatClique]
e:5 [in Complexity.NP.Clique.FlatUGraph]
E:50 [in Complexity.NP.Clique.FlatClique]
E:53 [in Complexity.NP.Clique.FlatUGraph]
E:53 [in Complexity.NP.Clique.FlatClique]
E:56 [in Complexity.NP.Clique.FlatClique]
e:562 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
E:58 [in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
e:580 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
e:6 [in Complexity.L.TM.TMflatEnc]
e:60 [in Undecidability.L.Tactics.GenEncode]
E:60 [in Complexity.NP.Clique.FlatClique]
E:63 [in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
E:64 [in Complexity.NP.Clique.FlatClique]
E:66 [in Complexity.NP.Clique.FlatClique]
e:69 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
e:7 [in Complexity.L.ComparisonTimeBoundDerivation]
E:70 [in Complexity.NP.Clique.FlatClique]
e:716 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
E:73 [in Complexity.NP.Clique.FlatUGraph]
E:75 [in Complexity.NP.Clique.FlatClique]
e:76 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
e:777 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
e:78 [in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
E:79 [in Complexity.NP.Clique.FlatClique]
E:8 [in Complexity.NP.Clique.FlatUGraph]
e:800 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
e:83 [in Complexity.L.ComparisonTimeBoundDerivation]
e:84 [in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
e:84 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
e:85 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
e:87 [in Complexity.Libs.CookPrelim.PolyBounds]
e:9 [in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
e:9 [in Complexity.NP.Clique.FlatUGraph]
e:90 [in Complexity.NP.SAT.SAT_inNP]
E:95 [in Complexity.NP.Clique.FlatClique]
e:96 [in Complexity.NP.Clique.FlatClique]
E:99 [in Complexity.NP.Clique.FlatClique]
e:99 [in Complexity.L.AbstractMachines.AbstractHeapMachine]

F

fcards:110 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
fcards:70 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
fcards:77 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
fcards:84 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
fExt:68 [in Undecidability.L.Tactics.Computable]
fExt:72 [in Undecidability.L.Tactics.Computable]
fExt:80 [in Undecidability.L.Tactics.Computable]
fExt:89 [in Undecidability.L.Tactics.Computable]
fE:70 [in Complexity.NP.Clique.FlatUGraph]
fg:3706 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
finalRes:26 [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
finalRes:72 [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
final:102 [in Undecidability.TM.Univ.LowLevel]
final:11 [in Undecidability.TM.Univ.Univ]
final:123 [in Undecidability.TM.Univ.LowLevel]
final:227 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
final:34 [in Complexity.NP.SAT.CookLevin.Subproblems.CC]
final:63 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
final:75 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
final:87 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
final:91 [in Undecidability.TM.Univ.LowLevel]
final:92 [in Undecidability.TM.Univ.LowLevel]
final:98 [in Undecidability.TM.Univ.LowLevel]
fincards:125 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
finenv:3216 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
finEnv:3668 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
finEnv:3671 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
finEnv:3680 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
finE:56 [in Complexity.NP.Clique.FlatUGraph]
finE:76 [in Complexity.NP.Clique.FlatUGraph]
finL:3676 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
finp:2858 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
finp:2861 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
finp:2868 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
finp:2872 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
finp:2877 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
finp:2882 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
finp:2890 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
finp:2895 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
finStr':101 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
finStr':65 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
finStr:100 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
finStr:64 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
fInt:103 [in Undecidability.L.Tactics.ComputableTime]
fInt:109 [in Undecidability.L.Tactics.ComputableTime]
fInt:117 [in Undecidability.L.Tactics.ComputableTime]
fInt:122 [in Undecidability.L.Tactics.ComputableTime]
fInt:133 [in Undecidability.L.Tactics.ComputableTime]
fInt:15 [in Undecidability.L.Tactics.ComputableTime]
fInt:27 [in Undecidability.L.Tactics.Computable]
fInt:50 [in Undecidability.L.Tactics.ComputableTime]
fInt:93 [in Undecidability.L.Tactics.ComputableTime]
finV:49 [in Complexity.NP.Clique.FlatUGraph]
finV:50 [in Complexity.NP.Clique.FlatUGraph]
finV:55 [in Complexity.NP.Clique.FlatUGraph]
finV:75 [in Complexity.NP.Clique.FlatUGraph]
fin':79 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
fin':82 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
fin1:3641 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
fin2:3642 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
fin:103 [in Complexity.Libs.CookPrelim.FlatFinTypes]
fin:78 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
fin:81 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
fin:98 [in Complexity.Libs.CookPrelim.FlatFinTypes]
fixed:1115 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
fixed:1122 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
fixed:802 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
fixed:804 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
fixed:807 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
fixed:810 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
fixed:813 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
fixed:817 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
fixed:820 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
fixed:823 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
fixed:827 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
fixed:837 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
fixed:841 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
fixed:854 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
fixed:858 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
fixed:876 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
fixed:881 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
fixed:949 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
fixed:953 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
fixed:958 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
fixed:963 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
flatcardp:24 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
flatcards:39 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
flatcards:63 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
flatcard:32 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
flatcard:43 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
flatcard:47 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
flatcard:56 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
flatcard:67 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
flatcard:71 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
flatenv:3217 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
flatEnv:3669 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
flatEnv:3672 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
flatEnv:3679 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
flatfinal:74 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
flatFixedInput_compat:2992 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
flatFixedInput:845 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
flatFixedInput:849 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
flatL:3675 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
flatStr':103 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
flatStr':67 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
flatStr:102 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
flatStr:66 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
flatTM_TM_compat:2990 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
flatTM:675 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
flatTM:681 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
flatTM:743 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
flatTM:745 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
flatTM:844 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
flatTM:848 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
flat1:3639 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
flat2:3640 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
flat:104 [in Complexity.Libs.CookPrelim.FlatFinTypes]
flat:99 [in Complexity.Libs.CookPrelim.FlatFinTypes]
fNonZero:43 [in Complexity.Complexity.ONotationIsAppropriate]
fpr:122 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
fpr:13 [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
fpr:138 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
fpr:14 [in Complexity.NP.SAT.CookLevin.Subproblems.BinaryCC]
fpr:14 [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
fpr:140 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
fpr:158 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
fpr:168 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
fpr:170 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
fpr:18 [in Complexity.NP.SAT.CookLevin.Reductions.FlatTCC_to_FlatCC]
fpr:180 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
fpr:185 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
fpr:19 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
fpr:19 [in Complexity.NP.SAT.CookLevin.Reductions.FlatTCC_to_FlatCC]
fpr:23 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
fpr:270 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
fpr:33 [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
fpr:36 [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
fpr:43 [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
fpr:45 [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
fpr:47 [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
fpr:49 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
fpr:49 [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
fpr:51 [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
fpr:51 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
fpr:52 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
fpr:53 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
fpr:54 [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
fpr:54 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
fpr:56 [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
fpr:58 [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
fpr:60 [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
fpr:62 [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
fpr:63 [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
fpr:64 [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
fpr:66 [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
fpr:68 [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
fpr:69 [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
fpr:70 [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
fpr:71 [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
fpr:73 [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
fpr:76 [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
fpr:77 [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
fpr:78 [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
fpr:80 [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
fpr:82 [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
fpr:84 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
fpr:95 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
fs1:113 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
fs1:121 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
fs1:128 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
fs1:73 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
fs1:79 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
fs1:87 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
fs2:114 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
fs2:122 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
fs2:129 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
fs2:74 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
fs2:80 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
fs2:88 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
fs:115 [in Undecidability.TM.Hoare.HoareRegister]
fs:128 [in Undecidability.TM.Hoare.HoareRegister]
fs:136 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
fs:157 [in Undecidability.TM.Hoare.HoareRegister]
fs:180 [in Undecidability.TM.Hoare.HoareRegister]
fs:94 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
fTime:16 [in Undecidability.L.Tactics.ComputableTime]
ftpr:1 [in Complexity.NP.SAT.CookLevin.Reductions.FlatTCC_to_FlatCC]
ftpr:100 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
ftpr:19 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
ftpr:2 [in Complexity.NP.SAT.CookLevin.Reductions.FlatTCC_to_FlatCC]
ftpr:20 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
ftpr:96 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
ftpr:98 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
fT':192 [in Undecidability.L.Tactics.ComputableTime]
fT':197 [in Undecidability.L.Tactics.ComputableTime]
fT:100 [in Complexity.L.ComparisonTimeBoundDerivation]
fT:105 [in Undecidability.L.Tactics.ComputableTime]
fT:105 [in Complexity.Libs.CookPrelim.PolyBounds]
fT:107 [in Complexity.NP.SAT.SAT_inNP]
fT:111 [in Undecidability.L.Tactics.ComputableTime]
fT:112 [in Complexity.L.ComparisonTimeBoundDerivation]
fT:118 [in Undecidability.L.Tactics.ComputableTime]
fT:119 [in Complexity.NP.SAT.SAT_inNP]
fT:123 [in Undecidability.L.Tactics.ComputableTime]
fT:13 [in Undecidability.L.Functions.LoopSum]
fT:134 [in Undecidability.L.Tactics.ComputableTime]
fT:14 [in Undecidability.L.Datatypes.List.List_basics]
fT:14 [in Complexity.Complexity.Definitions]
fT:144 [in Undecidability.L.Tactics.ComputableTime]
fT:149 [in Undecidability.L.Tactics.ComputableTime]
fT:154 [in Undecidability.L.Tactics.ComputableTime]
fT:157 [in Undecidability.L.Tactics.ComputableTime]
fT:158 [in Undecidability.L.Tactics.ComputableTime]
fT:165 [in Undecidability.L.Tactics.ComputableTime]
fT:166 [in Complexity.L.ComparisonTimeBoundDerivation]
fT:17 [in Undecidability.L.Datatypes.LVector]
fT:17 [in Complexity.L.TM.TMflatComp]
fT:171 [in Undecidability.L.Tactics.ComputableTime]
fT:175 [in Undecidability.L.Tactics.ComputableTime]
fT:178 [in Complexity.L.ComparisonTimeBoundDerivation]
fT:191 [in Undecidability.L.Tactics.ComputableTime]
fT:196 [in Undecidability.L.Tactics.ComputableTime]
fT:20 [in Undecidability.L.Functions.LoopSum]
fT:20 [in Complexity.Complexity.Definitions]
fT:226 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
fT:232 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
fT:24 [in Undecidability.L.Datatypes.List.List_fold]
fT:25 [in Undecidability.L.TM.TapeFuns]
fT:27 [in Complexity.Complexity.Definitions]
fT:3 [in Undecidability.L.Tactics.ComputableDemo]
fT:3 [in Undecidability.L.Datatypes.List.List_fold]
fT:30 [in Complexity.L.ComparisonTimeBoundDerivation]
fT:33 [in Undecidability.L.Tactics.ComputableDemo]
fT:35 [in Complexity.L.ComparisonTimeBoundDerivation]
fT:35 [in Undecidability.L.TM.TapeFuns]
fT:37 [in Complexity.L.ComparisonTimeBoundDerivation]
fT:38 [in Undecidability.L.Datatypes.List.List_fold]
fT:4 [in Undecidability.L.Tactics.ComputableTactics]
fT:4 [in Complexity.Complexity.Definitions]
fT:40 [in Undecidability.L.Tactics.ComputableDemo]
fT:42 [in Complexity.L.ComparisonTimeBoundDerivation]
fT:46 [in Undecidability.L.Tactics.ComputableTime]
fT:47 [in Undecidability.L.Tactics.ComputableDemo]
fT:49 [in Complexity.L.ComparisonTimeBoundDerivation]
fT:51 [in Undecidability.L.Tactics.ComputableTime]
fT:55 [in Undecidability.L.Tactics.ComputableTime]
fT:59 [in Complexity.L.ComparisonTimeBoundDerivation]
fT:6 [in Undecidability.L.Datatypes.List.List_basics]
fT:6 [in Undecidability.L.Functions.LoopSum]
fT:6 [in Complexity.L.TM.TMflatComp]
fT:69 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
fT:69 [in Undecidability.L.Tactics.ComputableTime]
fT:69 [in Undecidability.L.Datatypes.LVector]
fT:7 [in Undecidability.L.Datatypes.List.List_fold]
fT:73 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
fT:79 [in Undecidability.L.Tactics.ComputableTime]
fT:95 [in Undecidability.L.Tactics.ComputableTime]
fuel':34 [in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisUnfoldClos]
fuel':39 [in Complexity.L.AbstractMachines.UnfoldTailRec]
fuel':49 [in Complexity.L.AbstractMachines.Computable.EvalForTime]
fuel:10 [in Complexity.HierarchyTheorem.TimeHierarchyTheorem]
fuel:10 [in Complexity.L.AbstractMachines.Computable.EvalForTimeBool]
fuel:14 [in Complexity.HierarchyTheorem.TimeHierarchyTheorem]
fuel:15 [in Undecidability.L.AbstractMachines.FlatPro.UnfoldClos]
fuel:16 [in Complexity.HierarchyTheorem.TimeHierarchyTheorem]
fuel:187 [in Undecidability.L.Tactics.Extract]
fuel:2 [in Complexity.L.AbstractMachines.Computable.EvalForTimeBool]
fuel:2 [in Complexity.L.AbstractMachines.UnfoldHeap]
fuel:20 [in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
fuel:21 [in Complexity.L.AbstractMachines.Computable.EvalForTime]
fuel:22 [in Complexity.L.AbstractMachines.UnfoldTailRec]
fuel:23 [in Complexity.L.AbstractMachines.Computable.EvalForTime]
fuel:24 [in Undecidability.L.Functions.UnboundIteration]
fuel:25 [in Complexity.L.AbstractMachines.Computable.EvalForTime]
fuel:33 [in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisUnfoldClos]
fuel:33 [in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
fuel:37 [in Complexity.L.AbstractMachines.UnfoldTailRec]
fuel:37 [in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
fuel:39 [in Complexity.L.AbstractMachines.Computable.EvalForTime]
fuel:39 [in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
fuel:41 [in Complexity.L.AbstractMachines.Computable.EvalForTime]
fuel:44 [in Complexity.L.AbstractMachines.Computable.EvalForTime]
fuel:44 [in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
fuel:45 [in Complexity.L.AbstractMachines.UnfoldTailRec]
fuel:48 [in Complexity.L.AbstractMachines.Computable.EvalForTime]
fuel:49 [in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisUnfoldClos]
fuel:49 [in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
fuel:50 [in Complexity.L.AbstractMachines.Computable.EvalForTime]
fuel:6 [in Complexity.L.AbstractMachines.Computable.EvalForTimeBool]
fuel:61 [in Complexity.L.AbstractMachines.Computable.EvalForTime]
fuel:7 [in Complexity.L.AbstractMachines.Computable.EvalForTime]
fuel:72 [in Undecidability.L.Tactics.Extract]
fuel:8 [in Complexity.HierarchyTheorem.TimeHierarchyTheorem]
fuel:9 [in Complexity.L.AbstractMachines.Computable.EvalForTime]
fuel:9 [in Complexity.L.AbstractMachines.Computable.EvalForTimeBool]
fV:69 [in Complexity.NP.Clique.FlatUGraph]
fyTime:20 [in Undecidability.L.Tactics.ComputableTime]
f__c:52 [in Complexity.NP.TM.mTM_to_singleTapeTM]
f__c:51 [in Complexity.NP.TM.mTM_to_singleTapeTM]
f__size:122 [in Complexity.Libs.CookPrelim.PolyBounds]
f__arg:121 [in Complexity.Libs.CookPrelim.PolyBounds]
f__bound:106 [in Complexity.Libs.CookPrelim.PolyBounds]
f__step:431 [in Undecidability.TM.Hoare.HoareCombinators]
f__loop:430 [in Undecidability.TM.Hoare.HoareCombinators]
f':1 [in Undecidability.TM.Code.ProgrammingTools]
f':112 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
f':115 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
f':117 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
f':12 [in Complexity.Complexity.Subtypes]
f':12 [in Complexity.L.TM.TMflat]
F':136 [in Undecidability.Shared.Libs.PSL.Retracts]
f':143 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
f':152 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
F':154 [in Undecidability.Shared.Libs.PSL.Retracts]
f':154 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
f':158 [in Complexity.Libs.CookPrelim.FlatFinTypes]
f':184 [in Undecidability.L.Tactics.ComputableTime]
f':19 [in Complexity.Complexity.ONotation]
f':2 [in Undecidability.TM.Code.ProgrammingTools]
f':21 [in Complexity.Complexity.ONotation]
f':21 [in Undecidability.L.Functions.UnboundIteration]
f':2669 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
f':27 [in Complexity.HierarchyTheorem.TimeHierarchyTheorem]
f':31 [in Complexity.L.TM.TMflat]
f':33 [in Complexity.Complexity.Definitions]
f':38 [in Complexity.Complexity.Definitions]
f':44 [in Complexity.Complexity.Definitions]
f':70 [in Undecidability.L.Complexity.UpToC]
f':72 [in Undecidability.L.Complexity.UpToCNary]
f':81 [in Complexity.Complexity.Definitions]
f':98 [in Undecidability.L.Tactics.Computable]
f0:24 [in Complexity.TM.PrettyBounds.M2MBounds]
f0:25 [in Undecidability.TM.Combinators.Switch]
f0:5 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
f0:52 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
f0:7 [in Complexity.TM.PrettyBounds.M2MBounds]
f0:82 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
f1:10 [in Complexity.NP.SAT.FSAT.FSAT]
f1:10 [in Complexity.Complexity.Monotonic]
F1:10 [in Undecidability.Shared.Libs.PSL.FiniteTypes.CompoundFinTypes]
f1:100 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
F1:101 [in Undecidability.TM.Hoare.HoareCombinators]
f1:109 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
f1:11 [in Complexity.Complexity.ONotation]
f1:116 [in Undecidability.TM.Code.CodeTM]
F1:116 [in Undecidability.TM.Hoare.HoareCombinators]
F1:12 [in Undecidability.TM.Hoare.HoareCombinators]
f1:122 [in Complexity.NP.SAT.CookLevin.Subproblems.CC]
F1:125 [in Undecidability.TM.Hoare.HoareCombinators]
f1:125 [in Complexity.NP.SAT.CookLevin.Subproblems.CC]
f1:13 [in Undecidability.L.Prelim.MoreBase]
f1:13 [in Complexity.Complexity.Monotonic]
f1:132 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
F1:135 [in Undecidability.TM.Hoare.HoareCombinators]
f1:14 [in Complexity.NP.SAT.FSAT.FSAT]
f1:142 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
F1:144 [in Undecidability.TM.Hoare.HoareCombinators]
f1:15 [in Complexity.Complexity.ONotation]
F1:163 [in Undecidability.TM.Hoare.HoareCombinators]
f1:17 [in Complexity.Complexity.Monotonic]
F1:176 [in Undecidability.TM.Hoare.HoareCombinators]
F1:23 [in Undecidability.TM.Hoare.HoareCombinators]
f1:24 [in Complexity.Complexity.ONotation]
f1:24 [in Undecidability.L.Complexity.UpToC]
f1:25 [in Complexity.TM.PrettyBounds.M2MBounds]
F1:256 [in Undecidability.TM.Hoare.HoareCombinators]
f1:26 [in Undecidability.L.Complexity.UpToCNary]
F1:266 [in Undecidability.TM.Hoare.HoareCombinators]
f1:27 [in Complexity.NP.SAT.FSAT.FSAT]
f1:27 [in Complexity.Complexity.PolyTimeComputable]
F1:279 [in Undecidability.TM.Hoare.HoareCombinators]
f1:28 [in Undecidability.TM.L.CompilerBoolFuns.NaryApp]
f1:28 [in Undecidability.Shared.Libs.PSL.Retracts]
F1:28 [in Undecidability.Shared.Libs.PSL.FiniteTypes.VectorFin]
f1:29 [in Undecidability.L.Complexity.UpToC]
f1:29 [in Complexity.NP.SAT.FSAT.FSAT]
F1:295 [in Undecidability.TM.Hoare.HoareCombinators]
f1:30 [in Complexity.Complexity.ONotation]
f1:31 [in Undecidability.L.Complexity.UpToCNary]
f1:31 [in Complexity.NP.SAT.FSAT.FSAT]
f1:33 [in Complexity.NP.SAT.FSAT.FSAT]
F1:33 [in Undecidability.TM.Hoare.HoareCombinators]
f1:34 [in Undecidability.L.Complexity.UpToC]
f1:36 [in Undecidability.L.Complexity.UpToCNary]
f1:36 [in Undecidability.Synthetic.EnumerabilityFacts]
f1:3677 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
f1:4 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
f1:40 [in Complexity.Complexity.PolyTimeComputable]
f1:42 [in Complexity.NP.Clique.kSAT_to_FlatClique]
f1:45 [in Undecidability.Synthetic.EnumerabilityFacts]
F1:45 [in Undecidability.TM.Hoare.HoareCombinators]
f1:47 [in Complexity.Libs.CookPrelim.PolyBounds]
f1:5 [in Complexity.Complexity.Monotonic]
f1:53 [in Complexity.NP.SAT.FSAT.FSAT]
F1:55 [in Undecidability.L.Complexity.UpToC]
f1:55 [in Complexity.NP.SAT.FSAT.FSAT]
f1:550 [in Complexity.NP.TM.LM_to_mTM]
f1:56 [in Complexity.Complexity.ONotation]
F1:56 [in Undecidability.TM.Hoare.HoareCombinators]
F1:57 [in Undecidability.L.Complexity.UpToCNary]
f1:57 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
f1:57 [in Undecidability.L.Complexity.UpToC]
f1:59 [in Complexity.Complexity.ONotation]
f1:59 [in Undecidability.L.Complexity.UpToCNary]
f1:6 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
f1:6 [in Complexity.Complexity.ONotation]
f1:61 [in Complexity.Libs.CookPrelim.PolyBounds]
F1:67 [in Undecidability.TM.Hoare.HoareCombinators]
f1:68 [in Undecidability.Shared.Libs.PSL.Retracts]
f1:68 [in Complexity.Complexity.UpToCPoly]
f1:69 [in Complexity.Complexity.ONotation]
f1:73 [in Complexity.Complexity.UpToCPoly]
F1:77 [in Undecidability.TM.Hoare.HoareCombinators]
f1:79 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
f1:8 [in Complexity.TM.PrettyBounds.M2MBounds]
f1:8 [in Complexity.NP.SAT.FSAT.FSAT]
f1:86 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
f1:87 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
f1:87 [in Undecidability.TM.PrettyBounds.MaxList]
F1:89 [in Undecidability.TM.Hoare.HoareCombinators]
f1:93 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
f2:101 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
F2:102 [in Undecidability.TM.Hoare.HoareCombinators]
f2:11 [in Complexity.NP.SAT.FSAT.FSAT]
f2:11 [in Complexity.Complexity.Monotonic]
F2:11 [in Undecidability.Shared.Libs.PSL.FiniteTypes.CompoundFinTypes]
f2:110 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
f2:117 [in Undecidability.TM.Code.CodeTM]
F2:117 [in Undecidability.TM.Hoare.HoareCombinators]
f2:123 [in Complexity.NP.SAT.CookLevin.Subproblems.CC]
F2:126 [in Undecidability.TM.Hoare.HoareCombinators]
f2:126 [in Complexity.NP.SAT.CookLevin.Subproblems.CC]
F2:13 [in Undecidability.TM.Hoare.HoareCombinators]
f2:133 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
F2:136 [in Undecidability.TM.Hoare.HoareCombinators]
f2:14 [in Undecidability.L.Prelim.MoreBase]
f2:143 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
F2:145 [in Undecidability.TM.Hoare.HoareCombinators]
f2:15 [in Complexity.NP.SAT.FSAT.FSAT]
F2:164 [in Undecidability.TM.Hoare.HoareCombinators]
F2:177 [in Undecidability.TM.Hoare.HoareCombinators]
f2:18 [in Complexity.Complexity.Monotonic]
F2:24 [in Undecidability.TM.Hoare.HoareCombinators]
f2:25 [in Complexity.Complexity.ONotation]
f2:25 [in Undecidability.L.Complexity.UpToC]
F2:257 [in Undecidability.TM.Hoare.HoareCombinators]
f2:26 [in Complexity.TM.PrettyBounds.M2MBounds]
F2:267 [in Undecidability.TM.Hoare.HoareCombinators]
f2:27 [in Undecidability.L.Complexity.UpToCNary]
f2:28 [in Complexity.NP.SAT.FSAT.FSAT]
f2:28 [in Complexity.Complexity.PolyTimeComputable]
F2:280 [in Undecidability.TM.Hoare.HoareCombinators]
f2:29 [in Undecidability.TM.L.CompilerBoolFuns.NaryApp]
f2:29 [in Undecidability.Shared.Libs.PSL.Retracts]
F2:29 [in Undecidability.Shared.Libs.PSL.FiniteTypes.VectorFin]
F2:296 [in Undecidability.TM.Hoare.HoareCombinators]
f2:30 [in Undecidability.L.Complexity.UpToC]
f2:30 [in Complexity.NP.SAT.FSAT.FSAT]
f2:31 [in Complexity.Complexity.ONotation]
f2:32 [in Undecidability.L.Complexity.UpToCNary]
f2:32 [in Complexity.NP.SAT.FSAT.FSAT]
f2:34 [in Complexity.NP.SAT.FSAT.FSAT]
F2:34 [in Undecidability.TM.Hoare.HoareCombinators]
f2:35 [in Undecidability.L.Complexity.UpToC]
f2:3678 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
f2:37 [in Undecidability.L.Complexity.UpToCNary]
f2:37 [in Undecidability.Synthetic.EnumerabilityFacts]
f2:41 [in Complexity.Complexity.PolyTimeComputable]
f2:43 [in Complexity.NP.Clique.kSAT_to_FlatClique]
f2:46 [in Undecidability.Synthetic.EnumerabilityFacts]
F2:46 [in Undecidability.TM.Hoare.HoareCombinators]
f2:48 [in Complexity.Libs.CookPrelim.PolyBounds]
f2:5 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
f2:54 [in Complexity.NP.SAT.FSAT.FSAT]
f2:551 [in Complexity.NP.TM.LM_to_mTM]
F2:56 [in Undecidability.L.Complexity.UpToC]
f2:56 [in Complexity.NP.SAT.FSAT.FSAT]
f2:57 [in Complexity.Complexity.ONotation]
F2:57 [in Undecidability.TM.Hoare.HoareCombinators]
F2:58 [in Undecidability.L.Complexity.UpToCNary]
f2:58 [in Undecidability.L.Complexity.UpToC]
f2:6 [in Complexity.Complexity.Monotonic]
f2:60 [in Complexity.Complexity.ONotation]
f2:60 [in Undecidability.L.Complexity.UpToCNary]
f2:62 [in Complexity.Libs.CookPrelim.PolyBounds]
f2:64 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
F2:68 [in Undecidability.TM.Hoare.HoareCombinators]
f2:69 [in Undecidability.Shared.Libs.PSL.Retracts]
f2:69 [in Complexity.Complexity.UpToCPoly]
f2:7 [in Complexity.Complexity.ONotation]
f2:70 [in Complexity.Complexity.ONotation]
f2:74 [in Complexity.Complexity.UpToCPoly]
F2:78 [in Undecidability.TM.Hoare.HoareCombinators]
f2:80 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
f2:87 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
f2:88 [in Undecidability.TM.PrettyBounds.MaxList]
f2:9 [in Complexity.TM.PrettyBounds.M2MBounds]
f2:9 [in Complexity.NP.SAT.FSAT.FSAT]
F2:90 [in Undecidability.TM.Hoare.HoareCombinators]
f2:94 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
f2:94 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
f3:10 [in Complexity.TM.PrettyBounds.M2MBounds]
f:1 [in Complexity.Complexity.ONotation]
F:1 [in Undecidability.Shared.FinTypeForallExists]
f:1 [in Complexity.Complexity.ONotationIsAppropriate]
F:1 [in Undecidability.Shared.Libs.PSL.FiniteTypes.Cardinality]
f:1 [in Complexity.Complexity.Monotonic]
f:1 [in Undecidability.TM.L.CompilerBoolFuns.Compiler]
F:1 [in Undecidability.Shared.Libs.PSL.FiniteTypes.DepPairs]
f:10 [in Undecidability.Synthetic.EnumerabilityFacts]
f:10 [in Undecidability.L.Prelim.LoopSum]
f:10 [in Undecidability.Shared.Libs.PSL.FiniteTypes.DepPairs]
f:10 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
f:100 [in Undecidability.Shared.Libs.DLW.Vec.vec]
f:100 [in Undecidability.L.Complexity.UpToCNary]
f:100 [in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
F:101 [in Undecidability.L.Complexity.UpToCNary]
f:101 [in Complexity.NP.TM.LM_to_mTM]
f:102 [in Undecidability.L.Tactics.ComputableTime]
f:102 [in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
f:102 [in Complexity.Libs.CookPrelim.MorePrelim]
f:104 [in Undecidability.Shared.Libs.DLW.Utils.sorting]
f:104 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
f:104 [in Undecidability.TM.Util.Relations]
f:105 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
f:105 [in Undecidability.TM.Util.Prelim]
F:105 [in Undecidability.TM.Hoare.HoareRegister]
f:105 [in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
f:106 [in Complexity.NP.SAT.SAT_inNP]
f:106 [in Undecidability.TM.Code.Code]
f:107 [in Undecidability.Shared.Libs.DLW.Utils.sorting]
f:107 [in Complexity.L.TM.TMunflatten]
f:108 [in Undecidability.TM.Single.StepTM]
f:108 [in Undecidability.L.Tactics.ComputableTime]
f:108 [in Complexity.NP.TM.LM_to_mTM]
f:109 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
f:1098 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
F:11 [in Undecidability.Shared.FinTypeForallExists]
f:11 [in Complexity.L.TM.TMflat]
f:11 [in Undecidability.L.Functions.EqBool]
f:11 [in Undecidability.Shared.Libs.PSL.Bijection]
f:11 [in Complexity.Complexity.SpaceBoundsTime]
f:11 [in Undecidability.L.Computability.Synthetic]
f:11 [in Complexity.Libs.CookPrelim.MorePrelim]
f:110 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
f:110 [in Undecidability.TM.Code.Code]
F:110 [in Undecidability.TM.Hoare.HoareLogic]
f:1102 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
f:111 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
f:111 [in Complexity.L.ComparisonTimeBoundDerivation]
f:111 [in Undecidability.Shared.Libs.DLW.Utils.sorting]
f:113 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
f:113 [in Complexity.NP.TM.LM_to_mTM]
f:114 [in Undecidability.L.Tactics.ComputableTime]
f:114 [in Undecidability.Shared.Libs.DLW.Utils.sums]
f:114 [in Complexity.Complexity.PolyTimeComputable]
f:114 [in Undecidability.L.Tactics.Computable]
f:115 [in Complexity.L.TM.CompCode]
f:116 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
f:118 [in Complexity.NP.SAT.SAT_inNP]
f:118 [in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
F:12 [in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
f:12 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
f:12 [in Undecidability.L.Functions.LoopSum]
f:12 [in Complexity.TM.Code.Decode]
f:12 [in Undecidability.Synthetic.Definitions]
f:12 [in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
f:12 [in Undecidability.Shared.Libs.PSL.FiniteTypes.DepPairs]
f:12 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
F:120 [in Undecidability.TM.Hoare.HoareRegister]
f:120 [in Undecidability.TM.Util.Relations]
F:120 [in Undecidability.TM.Hoare.HoareLogic]
f:121 [in Undecidability.L.Tactics.ComputableTime]
f:121 [in Undecidability.TM.Code.CodeTM]
f:121 [in Complexity.L.TM.TMunflatten]
f:121 [in Undecidability.L.Tactics.Computable]
f:123 [in Complexity.L.ComparisonTimeBoundDerivation]
f:123 [in Complexity.Complexity.PolyTimeComputable]
f:124 [in Undecidability.Shared.Libs.DLW.Utils.sorting]
f:124 [in Undecidability.TM.Util.Relations]
f:126 [in Complexity.Libs.CookPrelim.FlatFinTypes]
f:128 [in Undecidability.L.Tactics.Extract]
f:128 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
f:129 [in Undecidability.L.Tactics.ComputableTime]
f:129 [in Undecidability.Synthetic.ListEnumerabilityFacts]
f:13 [in Undecidability.L.Tactics.Extract]
f:13 [in Complexity.L.Functions.IterupN]
f:13 [in Complexity.NP.SAT.CookLevin.Subproblems.SingleTMGenNP]
f:13 [in Undecidability.Shared.Libs.PSL.Lists.Dupfree]
f:13 [in Undecidability.Synthetic.Infinite]
f:13 [in Undecidability.TM.Code.List.App]
f:13 [in Undecidability.Shared.Libs.PSL.FiniteTypes.FiniteFunction]
f:13 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
f:130 [in Complexity.NP.SAT.SAT_inNP]
f:130 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
f:131 [in Complexity.L.TM.TMunflatten]
F:131 [in Undecidability.TM.Hoare.HoareLogic]
f:132 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
f:132 [in Complexity.Libs.CookPrelim.FlatFinTypes]
F:132 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
f:132 [in Undecidability.Synthetic.ListEnumerabilityFacts]
f:132 [in Complexity.Complexity.PolyTimeComputable]
f:133 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
F:135 [in Undecidability.Shared.Libs.PSL.Retracts]
f:135 [in Undecidability.Synthetic.ListEnumerabilityFacts]
f:137 [in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
f:139 [in Undecidability.L.Tactics.Computable]
f:14 [in Undecidability.L.Tactics.ComputableTime]
f:14 [in Undecidability.TM.Util.VectorPrelim]
f:14 [in Undecidability.Synthetic.EnumerabilityFacts]
f:14 [in Complexity.Complexity.Subtypes]
F:14 [in Undecidability.L.Complexity.UpToC]
f:14 [in Complexity.Complexity.ONotationIsAppropriate]
f:14 [in Undecidability.Shared.Libs.PSL.Bijection]
f:14 [in Undecidability.Synthetic.Definitions]
f:14 [in Complexity.L.TM.TMflatten]
f:14 [in Undecidability.Synthetic.InformativeDefinitions]
f:14 [in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
F:14 [in Undecidability.TM.Hoare.HoareLogic]
f:140 [in Undecidability.Synthetic.ListEnumerabilityFacts]
F:140 [in Undecidability.TM.Hoare.HoareLogic]
f:141 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
f:141 [in Complexity.Complexity.PolyTimeComputable]
f:142 [in Complexity.L.TM.CompCode]
f:142 [in Complexity.L.TM.TMunflatten]
f:144 [in Complexity.TM.PrettyBounds.UnivBounds]
f:144 [in Undecidability.Shared.Libs.DLW.Utils.sums]
f:145 [in Undecidability.L.Tactics.Computable]
f:15 [in Undecidability.L.Datatypes.LProd]
f:15 [in Undecidability.TM.Hoare.HoareStdLib]
f:15 [in Undecidability.Shared.Libs.PSL.FiniteTypes.DepPairs]
f:150 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
F:151 [in Undecidability.TM.Hoare.HoareRegister]
f:152 [in Undecidability.L.Tactics.Computable]
F:153 [in Undecidability.Shared.Libs.PSL.Retracts]
f:153 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
f:154 [in Complexity.L.TM.TMunflatten]
f:155 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
f:155 [in Undecidability.Shared.Libs.DLW.Utils.sums]
f:156 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
f:156 [in Complexity.Libs.CookPrelim.FlatFinTypes]
f:157 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
f:158 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
f:159 [in Undecidability.Shared.Libs.DLW.Utils.sums]
f:16 [in Undecidability.L.TM.TMinL]
f:16 [in Undecidability.L.Datatypes.LVector]
f:16 [in Undecidability.Shared.Libs.PSL.Bijection]
f:16 [in Undecidability.L.Computability.Synthetic]
F:16 [in Undecidability.L.Datatypes.List.List_fold]
f:16 [in Complexity.Complexity.PolyTimeComputable]
f:161 [in Complexity.L.TM.TMunflatten]
f:163 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
f:165 [in Complexity.L.ComparisonTimeBoundDerivation]
f:166 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
f:166 [in Complexity.L.TM.TMflatComp]
f:167 [in Undecidability.L.Tactics.ComputableTime]
f:169 [in Complexity.L.TM.TMflatComp]
f:17 [in Undecidability.L.Util.L_facts]
f:17 [in Undecidability.TM.Combinators.Switch]
f:17 [in Undecidability.Shared.Libs.DLW.Utils.sums]
f:17 [in Complexity.NP.SAT.FSAT.FSAT]
f:17 [in Undecidability.L.Tactics.Lbeta_nonrefl]
f:17 [in Undecidability.Synthetic.Infinite]
f:17 [in Undecidability.L.Datatypes.List.List_fold]
f:17 [in Undecidability.L.Prelim.MoreList]
F:170 [in Undecidability.TM.Hoare.HoareLogic]
f:171 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
f:171 [in Complexity.Libs.CookPrelim.MorePrelim]
f:172 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
f:172 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
f:172 [in Undecidability.Shared.Libs.DLW.Utils.sums]
f:172 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
f:173 [in Complexity.L.TM.TMunflatten]
F:173 [in Undecidability.TM.Hoare.HoareRegister]
f:175 [in Complexity.L.TM.TMflatComp]
f:177 [in Complexity.L.ComparisonTimeBoundDerivation]
f:178 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
f:178 [in Complexity.L.TM.TMflatComp]
f:18 [in Undecidability.Shared.Libs.PSL.Numbers]
f:18 [in Complexity.L.Functions.IterupN]
f:18 [in Complexity.L.TM.TMflatten]
f:18 [in Complexity.TM.Compound.MoveToSymbol_niceSpec]
f:18 [in Undecidability.TM.Hoare.HoareCombinators]
f:18 [in Undecidability.Shared.Libs.PSL.FiniteTypes.FiniteFunction]
f:18 [in Complexity.NP.TM.TMGenNP_fixed_mTM]
f:180 [in Undecidability.TM.Hoare.HoareLogic]
f:181 [in Undecidability.Shared.Libs.DLW.Vec.vec]
f:183 [in Undecidability.Shared.Libs.DLW.Vec.vec]
f:183 [in Undecidability.L.Tactics.ComputableTime]
f:184 [in Undecidability.Shared.Libs.DLW.Vec.vec]
f:184 [in Complexity.L.TM.TMflatComp]
F:185 [in Undecidability.TM.Hoare.HoareLogic]
f:186 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
f:187 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
F:188 [in Undecidability.TM.Hoare.HoareLogic]
F:188 [in Undecidability.TM.Hoare.HoareCombinators]
f:189 [in Undecidability.L.Prelim.ARS]
f:189 [in Complexity.TM.PrettyBounds.M2MBounds]
f:189 [in Complexity.L.ComparisonTimeBoundDerivation]
f:19 [in Undecidability.L.Functions.LoopSum]
F:19 [in Undecidability.L.Complexity.UpToC]
f:19 [in Complexity.Complexity.ONotationIsAppropriate]
F:19 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
f:19 [in Undecidability.Shared.Libs.PSL.Bijection]
f:19 [in Undecidability.Synthetic.DecidabilityFacts]
f:19 [in Undecidability.Shared.Libs.PSL.Vectors.VectorDupfree]
f:19 [in Undecidability.L.Tactics.Computable]
F:19 [in Undecidability.Shared.Libs.PSL.FiniteTypes.CompoundFinTypes]
f:190 [in Undecidability.Shared.Libs.DLW.Vec.vec]
f:192 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
f:194 [in Undecidability.Shared.Libs.DLW.Vec.vec]
f:195 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
f:195 [in Undecidability.TM.Util.TM_facts]
F:195 [in Undecidability.TM.Hoare.HoareLogic]
f:196 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
F:197 [in Undecidability.TM.Hoare.HoareCombinators]
f:198 [in Complexity.L.TM.TMunflatten]
f:199 [in Undecidability.Shared.Libs.DLW.Vec.vec]
f:2 [in Undecidability.TM.Code.List.Concat_Repeat]
f:2 [in Undecidability.L.Complexity.UpToCNary]
F:2 [in Undecidability.TM.Hoare.HoareLegacy]
f:2 [in Complexity.TM.Single.EncodeTapesInvariants]
f:2 [in Undecidability.L.Tactics.ComputableDemo]
f:2 [in Undecidability.L.Complexity.UpToC]
f:2 [in Complexity.L.TM.TMflatComp]
F:2 [in Complexity.NP.TM.M_multi2mono]
f:2 [in Complexity.Libs.CookPrelim.MorePrelim]
f:20 [in Undecidability.L.Tactics.ComputableDemo]
f:20 [in Undecidability.L.Complexity.UpToC]
f:20 [in Undecidability.Synthetic.Definitions]
f:20 [in Undecidability.TM.Code.Code]
f:20 [in Undecidability.L.Computability.Synthetic]
f:20 [in Undecidability.TM.L.Transcode.Enc_to_Boollist]
f:20 [in Undecidability.TM.L.CompilerBoolFuns.Compiler]
f:200 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
f:201 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
f:201 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
F:201 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
f:201 [in Undecidability.TM.Util.TM_facts]
f:202 [in Complexity.L.TM.TMunflatten]
F:203 [in Undecidability.TM.Hoare.HoareLogic]
f:205 [in Undecidability.Shared.Libs.DLW.Vec.vec]
f:207 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
f:207 [in Complexity.L.TM.TMflatComp]
f:208 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
f:208 [in Undecidability.Shared.Libs.DLW.Utils.sums]
F:21 [in Undecidability.Shared.FinTypeEquiv]
f:21 [in Undecidability.TM.Code.CodeTM]
f:21 [in Complexity.NP.SAT.FSAT.FSAT]
f:21 [in Undecidability.Shared.Libs.PSL.Bijection]
f:210 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
f:210 [in Undecidability.TM.Util.TM_facts]
f:212 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
f:212 [in Undecidability.Shared.Libs.DLW.Utils.sums]
f:213 [in Complexity.L.TM.TMunflatten]
F:213 [in Undecidability.TM.Hoare.HoareCombinators]
f:213 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
f:214 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
F:214 [in Undecidability.TM.Hoare.HoareLogic]
f:215 [in Undecidability.Shared.Libs.DLW.Utils.sums]
f:216 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
F:217 [in Undecidability.TM.Hoare.HoareLogic]
f:219 [in Undecidability.Shared.Libs.DLW.Utils.sums]
f:22 [in Undecidability.L.Prelim.LoopSum]
f:22 [in Undecidability.Shared.Libs.DLW.Utils.sums]
f:22 [in Complexity.L.TM.TMunflatten]
f:22 [in Complexity.NP.SAT.FSAT.FSAT]
f:22 [in Undecidability.Shared.Libs.DLW.Utils.fin_base]
f:22 [in Undecidability.Shared.Libs.PSL.Bijection]
f:22 [in Undecidability.Synthetic.Definitions]
f:22 [in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
F:22 [in Undecidability.TM.Hoare.HoareLogic]
f:22 [in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
f:222 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
f:224 [in Complexity.Libs.CookPrelim.MorePrelim]
f:225 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
f:225 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
f:225 [in Undecidability.Shared.Libs.DLW.Utils.sums]
F:226 [in Undecidability.TM.Hoare.HoareLogic]
f:228 [in Undecidability.L.Prelim.ARS]
f:228 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
f:229 [in Complexity.L.TM.TMflatComp]
f:23 [in Undecidability.L.Datatypes.LProd]
f:23 [in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
f:23 [in Undecidability.TM.Combinators.Switch]
f:23 [in Undecidability.Shared.FinTypeEquiv]
f:23 [in Complexity.L.Functions.IterupN]
F:23 [in Undecidability.L.Complexity.UpToC]
f:23 [in Undecidability.Shared.Libs.DLW.Utils.sums]
f:23 [in Undecidability.TM.Combinators.If]
f:23 [in Complexity.TM.Compound.MoveToSymbol_niceSpec]
f:23 [in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
f:23 [in Undecidability.L.Datatypes.List.List_fold]
f:231 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
f:231 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
f:231 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
F:231 [in Undecidability.TM.Hoare.HoareCombinators]
F:232 [in Undecidability.TM.Hoare.HoareRegister]
f:233 [in Complexity.L.TM.TMflatComp]
F:235 [in Undecidability.TM.Hoare.HoareLogic]
f:236 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
f:237 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
f:237 [in Complexity.L.TM.TMflatComp]
f:238 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
f:24 [in Undecidability.L.TM.TapeFuns]
f:24 [in Undecidability.TM.Code.ChangeAlphabet]
f:24 [in Undecidability.Synthetic.ListEnumerabilityFacts]
f:24 [in Undecidability.L.Prelim.MoreList]
f:240 [in Complexity.L.TM.TMflatComp]
f:242 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
F:244 [in Undecidability.TM.Hoare.HoareCombinators]
F:245 [in Undecidability.TM.Hoare.HoareLogic]
f:245 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
f:246 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
f:248 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
F:248 [in Undecidability.TM.Hoare.HoareRegister]
f:248 [in Complexity.Libs.CookPrelim.MorePrelim]
F:25 [in Undecidability.L.Complexity.UpToCNary]
f:25 [in Complexity.L.TM.TMflatComp]
f:25 [in Undecidability.TM.Code.CodeTM]
f:25 [in Undecidability.Shared.Libs.DLW.Utils.sums]
f:25 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
f:25 [in Undecidability.Shared.Libs.PSL.Vectors.VectorDupfree]
f:25 [in Undecidability.L.Complexity.GenericNary]
f:25 [in Complexity.Complexity.NP]
F:250 [in Undecidability.TM.Util.TM_facts]
F:252 [in Complexity.TM.PrettyBounds.M2MBounds]
F:256 [in Undecidability.TM.Hoare.HoareLogic]
f:257 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
f:259 [in Undecidability.Shared.Libs.DLW.Vec.vec]
f:259 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
f:26 [in Undecidability.L.Datatypes.LOptions]
F:26 [in Complexity.L.Functions.IterupN]
f:26 [in Complexity.L.TM.CompCode]
f:26 [in Undecidability.L.Tactics.Computable]
F:260 [in Undecidability.TM.Hoare.HoareRegister]
F:261 [in Complexity.TM.PrettyBounds.M2MBounds]
f:261 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
f:264 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
f:264 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
f:265 [in Undecidability.Shared.Libs.DLW.Vec.vec]
F:266 [in Undecidability.TM.Hoare.HoareLogic]
f:2662 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
f:267 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
f:27 [in Undecidability.TM.Combinators.Combinators]
f:27 [in Undecidability.TM.Combinators.While]
f:27 [in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
f:27 [in Undecidability.TM.Combinators.Switch]
f:27 [in Complexity.Complexity.Subtypes]
f:27 [in Complexity.L.TM.TMflatComp]
F:272 [in Undecidability.TM.Util.TM_facts]
f:274 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
F:275 [in Undecidability.TM.Hoare.HoareRegister]
F:275 [in Undecidability.TM.Util.TM_facts]
F:277 [in Undecidability.TM.Hoare.HoareLogic]
f:2793 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
f:2795 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
F:28 [in Undecidability.L.Complexity.UpToC]
f:28 [in Complexity.Libs.UniformHomomorphisms]
f:28 [in Undecidability.Shared.Libs.DLW.Utils.sums]
f:28 [in Complexity.NP.SAT.CookLevin.Subproblems.SingleTMGenNP]
f:28 [in Undecidability.Synthetic.Definitions]
f:28 [in Undecidability.Synthetic.ListEnumerabilityFacts]
F:28 [in Undecidability.TM.Hoare.HoareLogic]
F:282 [in Undecidability.TM.Util.TM_facts]
f:283 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
F:284 [in Complexity.TM.PrettyBounds.M2MBounds]
F:284 [in Undecidability.TM.Hoare.HoareLogic]
f:286 [in Complexity.L.TM.TMflatComp]
F:288 [in Undecidability.TM.Hoare.HoareRegister]
f:29 [in Undecidability.TM.Util.VectorPrelim]
f:29 [in Undecidability.Shared.Libs.DLW.Utils.fin_base]
f:29 [in Undecidability.L.Computability.Decidability]
f:29 [in Undecidability.L.Complexity.GenericNary]
f:29 [in Undecidability.L.Prelim.MoreList]
f:290 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
F:291 [in Undecidability.TM.Hoare.HoareLogic]
f:293 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
f:294 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
f:295 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
f:296 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
f:298 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
F:299 [in Undecidability.TM.Hoare.HoareLogic]
F:3 [in Undecidability.TM.Code.List.Concat_Repeat]
f:3 [in Undecidability.Shared.Libs.PSL.Retracts]
f:3 [in Undecidability.Shared.Libs.DLW.Utils.quotient]
f:3 [in Undecidability.Shared.Libs.PSL.Bijection]
f:3 [in Undecidability.Synthetic.InformativeDefinitions]
f:3 [in Undecidability.Shared.Libs.PSL.FiniteTypes.FiniteFunction]
f:3 [in Undecidability.Shared.Libs.PSL.FiniteTypes.DepPairs]
f:30 [in Undecidability.TM.Combinators.Combinators]
F:30 [in Undecidability.L.Complexity.UpToCNary]
f:30 [in Complexity.L.Functions.IterupN]
f:30 [in Complexity.L.TM.TMunflatten]
f:30 [in Complexity.L.TM.TMflat]
f:30 [in Undecidability.Synthetic.ListEnumerabilityFacts]
f:30 [in Undecidability.TM.Hoare.HoareCombinators]
f:303 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
f:304 [in Undecidability.TM.Hoare.HoareCombinators]
F:305 [in Undecidability.TM.Util.TM_facts]
f:3053 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
f:306 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
F:307 [in Undecidability.TM.Hoare.HoareLogic]
f:308 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
f:31 [in Undecidability.L.Prelim.LoopSum]
F:31 [in Complexity.L.Functions.IterupN]
f:31 [in Undecidability.Shared.Libs.DLW.Utils.sums]
f:31 [in Undecidability.Synthetic.Definitions]
f:31 [in Complexity.L.TM.TMflatFun]
f:31 [in Undecidability.L.Datatypes.List.List_fold]
f:311 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
F:312 [in Undecidability.TM.Util.TM_facts]
F:312 [in Undecidability.TM.Hoare.HoareCombinators]
f:313 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
F:316 [in Undecidability.TM.Hoare.HoareLogic]
f:316 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
f:318 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
F:319 [in Undecidability.TM.Util.TM_facts]
f:319 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
f:32 [in Undecidability.L.Tactics.ComputableDemo]
f:32 [in Complexity.NP.TM.TMGenNP]
f:32 [in Complexity.Complexity.Definitions]
f:32 [in Undecidability.TM.L.CompilerBoolFuns.Compiler]
F:323 [in Undecidability.TM.Hoare.HoareRegister]
F:323 [in Undecidability.TM.Hoare.HoareCombinators]
f:323 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
F:324 [in Complexity.TM.PrettyBounds.M2MBounds]
f:324 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
f:325 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
F:325 [in Undecidability.TM.Util.TM_facts]
F:327 [in Undecidability.TM.Hoare.HoareLogic]
f:327 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
f:328 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
f:33 [in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
f:33 [in Undecidability.L.Datatypes.LSum]
F:33 [in Undecidability.L.Complexity.UpToC]
f:33 [in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
f:330 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
f:331 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
F:331 [in Undecidability.TM.Util.TM_facts]
f:331 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
F:333 [in Undecidability.TM.Hoare.HoareRegister]
f:333 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
f:334 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
f:335 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
f:336 [in Complexity.Libs.CookPrelim.MorePrelim]
F:338 [in Undecidability.TM.Util.TM_facts]
f:339 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
F:339 [in Undecidability.TM.Hoare.HoareLogic]
f:34 [in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
f:34 [in Complexity.L.ComparisonTimeBoundDerivation]
f:34 [in Undecidability.L.TM.TapeFuns]
f:34 [in Undecidability.Shared.Libs.DLW.Utils.sorting]
f:34 [in Undecidability.Shared.Libs.DLW.Utils.sums]
f:34 [in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
F:340 [in Complexity.TM.PrettyBounds.M2MBounds]
F:343 [in Undecidability.TM.Util.TM_facts]
f:345 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
f:345 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
f:349 [in Undecidability.Shared.Libs.DLW.Vec.vec]
F:35 [in Undecidability.L.Complexity.UpToCNary]
f:35 [in Undecidability.TM.Lifting.LiftAlphabet]
f:35 [in Undecidability.TM.Util.VectorPrelim]
f:35 [in Complexity.L.Functions.IterupN]
f:35 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
f:35 [in Complexity.NP.SAT.FSAT.FSAT]
f:35 [in Undecidability.TM.Combinators.If]
f:35 [in Complexity.TM.Single.DecodeTapes]
F:350 [in Undecidability.TM.Hoare.HoareLogic]
f:350 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
F:351 [in Undecidability.TM.Util.TM_facts]
f:352 [in Undecidability.Shared.Libs.DLW.Vec.vec]
f:352 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
f:353 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
f:354 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
f:355 [in Undecidability.Shared.Libs.DLW.Vec.vec]
f:356 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
f:357 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
f:358 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
f:359 [in Undecidability.Shared.Libs.DLW.Vec.vec]
f:359 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
f:36 [in Undecidability.TM.Combinators.While]
f:36 [in Undecidability.L.Prelim.LoopSum]
f:36 [in Complexity.Complexity.Subtypes]
f:36 [in Undecidability.Shared.Libs.DLW.Utils.sums]
f:36 [in Complexity.Complexity.ONotationIsAppropriate]
f:3601 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
f:361 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
F:363 [in Undecidability.TM.Hoare.HoareLogic]
F:364 [in Undecidability.TM.Hoare.HoareRegister]
F:364 [in Undecidability.TM.Hoare.HoareCombinators]
f:366 [in Undecidability.Shared.Libs.DLW.Vec.vec]
f:37 [in Undecidability.TM.Univ.LowLevel]
f:37 [in Complexity.NP.SAT.FSAT.FSAT]
f:37 [in Complexity.L.TM.TMflatten]
f:37 [in Undecidability.L.Datatypes.List.List_fold]
f:37 [in Complexity.Complexity.Definitions]
F:371 [in Undecidability.TM.Hoare.HoareLogic]
f:3710 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
f:374 [in Undecidability.Shared.Libs.DLW.Vec.vec]
f:375 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
F:375 [in Undecidability.TM.Util.TM_facts]
F:378 [in Undecidability.TM.Hoare.HoareRegister]
f:379 [in Undecidability.Shared.Libs.DLW.Vec.vec]
F:379 [in Undecidability.TM.Hoare.HoareLogic]
f:38 [in Complexity.L.TM.TMflatten]
F:381 [in Undecidability.TM.Hoare.HoareCombinators]
f:383 [in Undecidability.Shared.Libs.DLW.Vec.vec]
f:385 [in Undecidability.TM.Hoare.HoareCombinators]
f:387 [in Undecidability.Shared.Libs.DLW.Vec.vec]
F:388 [in Undecidability.TM.Util.TM_facts]
F:388 [in Undecidability.TM.Hoare.HoareLogic]
f:39 [in Complexity.Complexity.ONotation]
f:39 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
f:39 [in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
f:39 [in Undecidability.L.Tactics.ComputableDemo]
f:39 [in Undecidability.L.Complexity.UpToC]
f:39 [in Undecidability.Shared.Libs.DLW.Utils.sorting]
f:39 [in Complexity.Complexity.ONotationIsAppropriate]
f:39 [in Complexity.NP.SAT.FSAT.FSAT]
f:39 [in Undecidability.Synthetic.Definitions]
F:39 [in Undecidability.TM.Util.Relations]
f:39 [in Complexity.Complexity.Definitions]
F:393 [in Undecidability.TM.Hoare.HoareRegister]
f:395 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
f:397 [in Undecidability.Shared.Libs.DLW.Vec.vec]
f:397 [in Undecidability.TM.Util.TM_facts]
F:397 [in Undecidability.TM.Hoare.HoareLogic]
f:4 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
f:4 [in Undecidability.L.Prelim.LoopSum]
f:4 [in Complexity.NP.SAT.FSAT.FSAT]
f:4 [in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
f:4 [in Undecidability.Shared.Libs.PSL.FiniteTypes.DepPairs]
f:40 [in Undecidability.Shared.Libs.PSL.Lists.Filter]
f:40 [in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
F:40 [in Undecidability.L.Complexity.UpToC]
F:40 [in Undecidability.TM.Hoare.HoareLogic]
f:40 [in Undecidability.TM.Hoare.HoareCombinators]
F:41 [in Undecidability.L.Complexity.UpToCNary]
f:41 [in Undecidability.L.Tactics.ComputableTime]
f:41 [in Complexity.L.ComparisonTimeBoundDerivation]
f:41 [in Undecidability.Shared.Libs.DLW.Utils.crt]
f:41 [in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
f:41 [in Undecidability.TM.Code.Code]
f:41 [in Complexity.Libs.CookPrelim.MorePrelim]
f:411 [in Undecidability.Shared.Libs.DLW.Vec.vec]
F:411 [in Undecidability.TM.Hoare.HoareRegister]
f:412 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
f:415 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
f:42 [in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
f:42 [in Undecidability.L.Complexity.UpToCNary]
f:42 [in Complexity.NP.TM.TMGenNP]
f:42 [in Complexity.L.TM.TMflatComp]
f:42 [in Undecidability.Shared.Libs.DLW.Utils.sums]
f:42 [in Complexity.NP.SAT.FSAT.FSAT]
f:42 [in Complexity.L.AbstractMachines.FunctionalDefinitions]
f:421 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
f:423 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
F:426 [in Undecidability.TM.Hoare.HoareCombinators]
f:43 [in Undecidability.L.Datatypes.List.List_basics]
f:43 [in Complexity.NP.SAT.CookLevin.Subproblems.SingleTMGenNP]
f:43 [in Undecidability.TM.Util.Relations]
f:43 [in Complexity.Complexity.Definitions]
f:431 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
f:44 [in Complexity.Complexity.ONotation]
f:44 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
f:44 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
f:44 [in Undecidability.L.Complexity.UpToC]
f:44 [in Complexity.L.TM.TMflatComp]
f:44 [in Complexity.NP.SAT.FSAT.FSAT]
f:44 [in Undecidability.TM.Util.Relations]
F:445 [in Undecidability.TM.Hoare.HoareCombinators]
f:446 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
f:449 [in Undecidability.TM.Hoare.HoareCombinators]
f:45 [in Undecidability.TM.L.Transcode.Boollist_to_Enc]
F:45 [in Undecidability.L.Complexity.UpToC]
f:45 [in Undecidability.Shared.Libs.DLW.Utils.sorting]
f:45 [in Undecidability.TM.Univ.LowLevel]
f:45 [in Undecidability.Shared.Libs.DLW.Utils.sums]
f:454 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
f:459 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
F:46 [in Undecidability.L.Complexity.UpToCNary]
f:46 [in Undecidability.L.Tactics.ComputableDemo]
f:46 [in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
f:46 [in Complexity.Libs.CookPrelim.MorePrelim]
F:462 [in Undecidability.TM.Hoare.HoareRegister]
f:464 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
f:47 [in Undecidability.L.Complexity.UpToCNary]
f:47 [in Complexity.NP.SAT.FSAT.FSAT]
F:47 [in Undecidability.TM.Util.Relations]
f:471 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
F:477 [in Undecidability.TM.Hoare.HoareRegister]
f:48 [in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
f:48 [in Undecidability.L.Datatypes.List.List_basics]
f:48 [in Undecidability.Synthetic.EnumerabilityFacts]
f:48 [in Complexity.Complexity.Subtypes]
f:48 [in Undecidability.Shared.Libs.DLW.Utils.crt]
f:48 [in Undecidability.TM.Code.Code]
f:48 [in Complexity.Complexity.Definitions]
f:48 [in Complexity.L.AbstractMachines.FunctionalDefinitions]
f:48 [in Undecidability.L.Tactics.Computable]
F:485 [in Undecidability.TM.Hoare.HoareRegister]
f:49 [in Complexity.Complexity.ONotation]
f:49 [in Undecidability.L.Tactics.ComputableTime]
F:49 [in Undecidability.L.Complexity.UpToC]
F:49 [in Undecidability.TM.Hoare.HoareLogic]
F:494 [in Undecidability.TM.Hoare.HoareRegister]
f:5 [in Undecidability.L.TM.TMinL]
f:5 [in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
f:5 [in Undecidability.L.Functions.LoopSum]
f:5 [in Complexity.L.Functions.IterupN]
f:5 [in Undecidability.Shared.Libs.DLW.Code.compiler]
f:5 [in Undecidability.TM.Univ.LowLevel]
f:5 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
f:5 [in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
F:5 [in Undecidability.TM.Hoare.HoareLogic]
F:5 [in Undecidability.Shared.Libs.PSL.FiniteTypes.DepPairs]
f:50 [in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
f:50 [in Complexity.NP.SAT.FSAT.FSAT]
f:50 [in Complexity.Libs.CookPrelim.MorePrelim]
F:505 [in Undecidability.TM.Hoare.HoareRegister]
f:51 [in Complexity.Complexity.ONotation]
F:51 [in Undecidability.L.Complexity.UpToCNary]
f:51 [in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
F:51 [in Undecidability.L.Complexity.UpToC]
f:51 [in Complexity.L.TM.TMflatComp]
f:51 [in Undecidability.Shared.Libs.DLW.Utils.sums]
f:51 [in Undecidability.TM.Util.Relations]
F:517 [in Undecidability.TM.Hoare.HoareRegister]
f:52 [in Undecidability.TM.Combinators.Switch]
f:52 [in Undecidability.Synthetic.EnumerabilityFacts]
f:52 [in Undecidability.L.Complexity.UpToC]
f:52 [in Undecidability.L.Datatypes.List.List_eqb]
f:52 [in Undecidability.TM.Util.Relations]
f:52 [in Undecidability.L.Complexity.GenericNary]
F:526 [in Undecidability.TM.Hoare.HoareRegister]
F:53 [in Undecidability.L.Complexity.UpToCNary]
f:53 [in Undecidability.TM.Combinators.Switch]
f:53 [in Complexity.Complexity.Definitions]
f:53 [in Undecidability.TM.Hoare.HoareCombinators]
f:53 [in Undecidability.Shared.Libs.PSL.FiniteTypes.FiniteFunction]
f:53 [in Complexity.Libs.CookPrelim.MorePrelim]
F:536 [in Undecidability.TM.Hoare.HoareRegister]
f:54 [in Undecidability.L.Complexity.UpToCNary]
f:54 [in Undecidability.Synthetic.EnumerabilityFacts]
f:54 [in Undecidability.Shared.Libs.DLW.Utils.sums]
f:54 [in Complexity.TM.PrettyBounds.PrettyBounds]
F:549 [in Undecidability.TM.Hoare.HoareRegister]
f:55 [in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
f:55 [in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
f:55 [in Undecidability.L.Datatypes.List.List_eqb]
f:55 [in Complexity.Complexity.PolyTimeComputable]
f:55 [in Complexity.Libs.CookPrelim.MorePrelim]
f:56 [in Undecidability.Shared.Libs.PSL.Retracts]
f:56 [in Complexity.TM.PrettyBounds.BaseCodeSpace]
f:56 [in Complexity.L.TM.TMunflatten]
f:56 [in Undecidability.L.Complexity.GenericNary]
F:56 [in Undecidability.TM.Hoare.HoareLogic]
f:56 [in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
f:56 [in Undecidability.L.Tactics.Computable]
F:563 [in Undecidability.TM.Hoare.HoareRegister]
f:57 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
f:57 [in Complexity.NP.SAT.FSAT.FSAT]
f:57 [in Undecidability.TM.Util.TM_facts]
F:574 [in Undecidability.TM.Hoare.HoareRegister]
f:58 [in Complexity.L.TM.TMflatComp]
f:58 [in Complexity.NP.SAT.FSAT.FSAT]
f:58 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
f:58 [in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
f:58 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
f:58 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
f:59 [in Undecidability.Shared.Libs.DLW.Utils.sums]
f:59 [in Complexity.NP.SAT.FSAT.FSAT]
f:59 [in Undecidability.L.Complexity.GenericNary]
f:59 [in Complexity.Complexity.Definitions]
f:59 [in Complexity.NP.TM.LM_to_mTM]
f:59 [in Complexity.Libs.CookPrelim.MorePrelim]
f:6 [in Undecidability.Shared.Libs.PSL.Numbers]
f:6 [in Undecidability.Shared.Libs.PSL.Bijection]
f:6 [in Undecidability.Synthetic.InformativeDefinitions]
f:6 [in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
f:6 [in Undecidability.L.Datatypes.List.List_fold]
f:6 [in Undecidability.TM.L.Transcode.Enc_to_Boollist]
f:6 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
f:6 [in Complexity.Libs.CookPrelim.MorePrelim]
f:60 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
f:60 [in Complexity.NP.SAT.FSAT.FSAT]
f:60 [in Undecidability.Shared.Libs.PSL.FiniteTypes.FiniteFunction]
f:61 [in Complexity.Complexity.Subtypes]
f:61 [in Complexity.NP.SAT.FSAT.FSAT]
f:61 [in Undecidability.TM.Code.Code]
f:61 [in Undecidability.TM.L.Transcode.Enc_to_Boollist]
f:61 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
f:62 [in Undecidability.Shared.Libs.PSL.Retracts]
f:62 [in Complexity.NP.SAT.FSAT.FSAT]
f:62 [in Undecidability.L.Complexity.GenericNary]
f:62 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
f:63 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
f:63 [in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
f:63 [in Undecidability.TM.Combinators.Switch]
f:63 [in Undecidability.L.Complexity.UpToC]
f:63 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
F:63 [in Undecidability.TM.Hoare.HoareLogic]
f:64 [in Complexity.Complexity.ONotation]
F:64 [in Undecidability.L.Complexity.UpToC]
f:64 [in Undecidability.TM.Util.TM_facts]
f:64 [in Complexity.Complexity.PolyTimeComputable]
f:65 [in Undecidability.L.Complexity.UpToCNary]
f:65 [in Undecidability.TM.Util.Prelim]
f:65 [in Undecidability.Shared.Libs.DLW.Utils.sorting]
f:65 [in Complexity.NP.SAT.FSAT.FSAT]
f:65 [in Undecidability.TM.Code.Code]
F:66 [in Undecidability.L.Complexity.UpToCNary]
f:66 [in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
f:66 [in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
f:66 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
f:66 [in Undecidability.L.Complexity.GenericNary]
f:66 [in Undecidability.L.Tactics.Computable]
f:67 [in Complexity.Complexity.ONotation]
f:67 [in Undecidability.L.Tactics.ComputableTime]
f:67 [in Complexity.L.TM.CompCode]
f:67 [in Complexity.NP.SAT.FSAT.FSAT]
f:67 [in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
f:67 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
f:68 [in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
f:68 [in Undecidability.TM.Util.Prelim]
f:68 [in Undecidability.Shared.Libs.DLW.Utils.sums]
f:69 [in Undecidability.L.Complexity.UpToC]
f:69 [in Undecidability.Shared.Libs.DLW.Utils.sorting]
f:7 [in Undecidability.L.Datatypes.LProd]
f:7 [in Complexity.L.TM.TMflatEnc]
f:7 [in Undecidability.TM.Combinators.Switch]
f:7 [in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
f:7 [in Complexity.Complexity.ONotationIsAppropriate]
f:7 [in Undecidability.Synthetic.Definitions]
f:7 [in Complexity.Complexity.PolyTimeComputable]
F:7 [in Undecidability.TM.Hoare.HoareStdLib]
f:7 [in Undecidability.Shared.Libs.PSL.FiniteTypes.FiniteFunction]
f:7 [in Undecidability.Shared.Libs.PSL.FiniteTypes.DepPairs]
f:7 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
f:70 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
f:70 [in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
f:70 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
f:70 [in Undecidability.L.Functions.FinTypeLookup]
f:70 [in Complexity.Complexity.Definitions]
F:70 [in Undecidability.TM.Hoare.HoareLogic]
f:70 [in Undecidability.TM.PrettyBounds.MaxList]
f:71 [in Undecidability.L.Complexity.UpToCNary]
f:71 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
f:71 [in Undecidability.TM.Util.Prelim]
f:71 [in Undecidability.Shared.Libs.DLW.Utils.sums]
f:71 [in Undecidability.L.Tactics.Computable]
f:72 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
f:72 [in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
f:72 [in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
f:72 [in Undecidability.L.Complexity.GenericNary]
f:73 [in Undecidability.TM.Combinators.Switch]
f:73 [in Undecidability.Shared.Libs.DLW.Utils.sorting]
f:73 [in Complexity.Complexity.PolyTimeComputable]
f:74 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
f:74 [in Undecidability.TM.Util.Prelim]
f:74 [in Complexity.Libs.CookPrelim.MorePrelim]
F:75 [in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
f:75 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
f:75 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
F:75 [in Undecidability.TM.Hoare.HoareLogic]
f:76 [in Undecidability.L.Complexity.UpToC]
f:76 [in Undecidability.Shared.Libs.DLW.Utils.sorting]
F:77 [in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
f:77 [in Undecidability.L.Tactics.ComputableTime]
f:77 [in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
F:77 [in Undecidability.L.Complexity.UpToC]
f:77 [in Complexity.Complexity.PolyTimeComputable]
f:78 [in Undecidability.TM.Combinators.Switch]
f:78 [in Undecidability.TM.Util.Prelim]
f:78 [in Undecidability.L.Tactics.Computable]
f:79 [in Undecidability.TM.Combinators.Switch]
f:79 [in Undecidability.Shared.Libs.DLW.Utils.sorting]
f:8 [in Undecidability.L.Util.L_facts]
f:8 [in Undecidability.TM.Combinators.Switch]
f:8 [in Complexity.NP.TM.TMGenNP]
f:8 [in Complexity.Complexity.UpToCPoly]
F:8 [in Undecidability.L.Datatypes.LFinType]
f:8 [in Undecidability.TM.Code.NatSub]
f:8 [in Complexity.TM.Compound.MoveToSymbol_niceSpec]
f:8 [in Complexity.Complexity.Monotonic]
f:8 [in Complexity.Complexity.NP]
f:8 [in Undecidability.TM.Hoare.HoareStdLib]
f:8 [in Undecidability.Shared.Libs.PSL.FiniteTypes.DepPairs]
f:8 [in Complexity.Libs.CookPrelim.MorePrelim]
f:80 [in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
f:80 [in Complexity.Complexity.Definitions]
f:81 [in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
f:81 [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
F:81 [in Undecidability.TM.Hoare.HoareLogic]
F:82 [in Undecidability.L.Complexity.UpToC]
f:82 [in Undecidability.Shared.Libs.DLW.Utils.sorting]
f:83 [in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
f:83 [in Complexity.Complexity.PolyTimeComputable]
f:84 [in Undecidability.TM.Single.StepTM]
f:85 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
f:86 [in Undecidability.TM.Util.Prelim]
F:86 [in Undecidability.TM.Hoare.HoareLogic]
f:86 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
f:868 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
f:87 [in Undecidability.L.Complexity.GenericNary]
f:88 [in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
f:88 [in Undecidability.L.Complexity.UpToC]
f:88 [in Undecidability.Shared.Libs.DLW.Utils.sorting]
f:88 [in Undecidability.L.Tactics.Reflection]
f:88 [in Undecidability.L.Tactics.Computable]
f:88 [in Complexity.NP.TM.LM_to_mTM]
f:89 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
f:89 [in Undecidability.TM.Code.Code]
f:89 [in Complexity.Complexity.NP]
f:892 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
f:897 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
f:9 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
f:9 [in Undecidability.Shared.Libs.PSL.Bijection]
f:9 [in Undecidability.Synthetic.InformativeDefinitions]
f:9 [in Complexity.L.TM.TMflatFun]
f:9 [in Undecidability.L.Datatypes.List.List_fold]
f:90 [in Undecidability.L.Tactics.Extract]
f:90 [in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
f:90 [in Complexity.L.TM.CompCode]
f:90 [in Undecidability.Shared.Libs.DLW.Utils.php]
f:90 [in Complexity.Complexity.Definitions]
F:91 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
f:92 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
f:92 [in Undecidability.L.Tactics.ComputableTime]
f:93 [in Undecidability.TM.Single.StepTM]
f:94 [in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
f:95 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
f:95 [in Undecidability.L.Complexity.UpToC]
f:95 [in Undecidability.Shared.Libs.DLW.Utils.sorting]
f:96 [in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
F:96 [in Undecidability.L.Complexity.UpToC]
f:96 [in Undecidability.Shared.Libs.DLW.Utils.sums]
f:96 [in Complexity.Complexity.Definitions]
F:96 [in Undecidability.TM.Hoare.HoareLogic]
F:97 [in Undecidability.TM.Hoare.HoareRegister]
f:97 [in Undecidability.L.Tactics.Computable]
f:98 [in Undecidability.Shared.Libs.DLW.Vec.vec]
f:98 [in Complexity.Libs.CookPrelim.PolyBounds]
f:99 [in Undecidability.TM.Single.StepTM]
f:99 [in Undecidability.TM.Util.Prelim]
f:99 [in Complexity.L.ComparisonTimeBoundDerivation]

G

gamma:194 [in Undecidability.TM.Util.TM_facts]
generate:2956 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
generate:3164 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
generate:3173 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
generate:3181 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
generate:3191 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
gNonZero:11 [in Complexity.Complexity.ONotationIsAppropriate]
gT:28 [in Undecidability.L.Datatypes.LVector]
gT:42 [in Undecidability.L.Datatypes.LVector]
G':156 [in Undecidability.Shared.Libs.PSL.Retracts]
g':2670 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
G0:32 [in Complexity.NP.SAT.CookLevin.Subproblems.CC]
g1:26 [in Complexity.Complexity.ONotation]
g1:27 [in Undecidability.Shared.Libs.DLW.Utils.interval]
g1:31 [in Undecidability.Shared.Libs.PSL.Retracts]
g1:32 [in Complexity.Complexity.ONotation]
g1:38 [in Undecidability.Shared.Libs.DLW.Utils.interval]
g1:72 [in Undecidability.Shared.Libs.PSL.Retracts]
g2:27 [in Complexity.Complexity.ONotation]
g2:29 [in Undecidability.Shared.Libs.DLW.Utils.interval]
g2:32 [in Undecidability.Shared.Libs.PSL.Retracts]
g2:33 [in Complexity.Complexity.ONotation]
g2:40 [in Undecidability.Shared.Libs.DLW.Utils.interval]
g2:73 [in Undecidability.Shared.Libs.PSL.Retracts]
G:1 [in Complexity.NP.Clique.FlatClique]
G:10 [in Complexity.NP.Clique.FlatUGraph]
g:10 [in Undecidability.Shared.Libs.PSL.Bijection]
g:10 [in Undecidability.TM.L.HeapInterpreter.LookupTM]
g:101 [in Undecidability.TM.L.HeapInterpreter.StepTM]
g:103 [in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
g:103 [in Undecidability.Shared.Libs.DLW.Utils.sorting]
g:108 [in Undecidability.Shared.Libs.DLW.Utils.sorting]
G:11 [in Complexity.NP.Clique.FlatClique]
g:11 [in Undecidability.L.Computability.Computability]
g:112 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
g:112 [in Undecidability.Shared.Libs.DLW.Utils.sorting]
g:115 [in Undecidability.Shared.Libs.DLW.Utils.sorting]
g:115 [in Complexity.Complexity.PolyTimeComputable]
g:116 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
g:116 [in Complexity.L.TM.CompCode]
g:12 [in Complexity.Complexity.ONotation]
G:121 [in Complexity.NP.Clique.FlatClique]
G:124 [in Complexity.NP.Clique.FlatClique]
g:124 [in Complexity.Complexity.PolyTimeComputable]
g:125 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
g:125 [in Undecidability.Shared.Libs.DLW.Utils.sorting]
G:126 [in Complexity.NP.Clique.FlatClique]
G:128 [in Complexity.NP.Clique.FlatClique]
g:13 [in Complexity.L.AbstractMachines.Computable.EvalForTime]
g:130 [in Undecidability.Shared.Libs.DLW.Utils.sorting]
g:131 [in Undecidability.TM.L.HeapInterpreter.StepTM]
G:132 [in Complexity.NP.Clique.FlatClique]
g:133 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
g:133 [in Complexity.Complexity.PolyTimeComputable]
G:138 [in Complexity.NP.Clique.FlatClique]
G:14 [in Complexity.NP.Clique.FlatUGraph]
g:140 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
G:142 [in Complexity.NP.Clique.FlatClique]
g:147 [in Complexity.L.AbstractMachines.AbstractHeapMachine]
g:149 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
g:15 [in Complexity.Complexity.ONotationIsAppropriate]
g:15 [in Undecidability.Shared.Libs.PSL.Bijection]
g:153 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
G:155 [in Undecidability.Shared.Libs.PSL.Retracts]
g:158 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
g:16 [in Undecidability.L.Datatypes.LProd]
g:16 [in Complexity.Complexity.ONotation]
g:16 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds_Loop]
g:16 [in Complexity.NP.Clique.Clique]
g:16 [in Undecidability.TM.Hoare.HoareStdLib]
g:162 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
g:165 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
g:166 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
g:168 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
g:169 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
g:17 [in Complexity.Complexity.PolyTimeComputable]
g:170 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
g:174 [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
g:176 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
g:176 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
g:180 [in Undecidability.TM.L.HeapInterpreter.StepTM]
g:181 [in Undecidability.TM.Hoare.HoareLogic]
g:181 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
g:187 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
g:187 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
G:19 [in Complexity.NP.Clique.FlatClique]
g:19 [in Complexity.TM.Compound.MoveToSymbol_niceSpec]
g:191 [in Undecidability.Shared.Libs.DLW.Vec.vec]
g:192 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
g:193 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
g:194 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
g:195 [in Undecidability.Shared.Libs.DLW.Vec.vec]
g:196 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
g:196 [in Undecidability.TM.Util.TM_facts]
g:197 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
g:2 [in Complexity.Complexity.ONotation]
g:2 [in Complexity.Complexity.ONotationIsAppropriate]
g:20 [in Complexity.Complexity.ONotationIsAppropriate]
g:20 [in Undecidability.Shared.Libs.PSL.Bijection]
g:202 [in Undecidability.TM.Util.TM_facts]
g:202 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
g:206 [in Undecidability.Shared.Libs.DLW.Vec.vec]
g:210 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
g:216 [in Undecidability.Shared.Libs.DLW.Utils.sums]
g:22 [in Complexity.Complexity.ONotation]
g:227 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
g:23 [in Undecidability.Shared.Libs.PSL.Bijection]
g:234 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
g:237 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
g:24 [in Undecidability.L.Datatypes.LProd]
g:24 [in Undecidability.Shared.FinTypeEquiv]
g:24 [in Complexity.TM.Compound.MoveToSymbol_niceSpec]
g:240 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
g:243 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
g:249 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
g:25 [in Complexity.L.AbstractMachines.AbstractHeapMachine]
g:25 [in Undecidability.TM.Code.ChangeAlphabet]
g:25 [in Undecidability.L.Prelim.MoreList]
g:251 [in Undecidability.Shared.Libs.DLW.Vec.vec]
g:261 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
g:2663 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
g:27 [in Undecidability.Shared.Libs.DLW.Utils.sorting]
g:28 [in Complexity.HierarchyTheorem.TimeHierarchyTheorem]
g:28 [in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
g:284 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
G:29 [in Complexity.NP.Clique.FlatUGraph]
G:29 [in Complexity.NP.Clique.FlatClique]
g:29 [in Complexity.Complexity.PolyTimeComputable]
g:3 [in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
g:3 [in Undecidability.L.Complexity.UpToCNary]
g:3 [in Undecidability.L.Complexity.UpToC]
g:30 [in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
g:30 [in Undecidability.Shared.Libs.DLW.Utils.interval]
G:32 [in Complexity.NP.Clique.FlatClique]
g:32 [in Complexity.L.AbstractMachines.AbstractHeapMachine]
g:34 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
g:34 [in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
g:34 [in Undecidability.L.Datatypes.LSum]
g:34 [in Complexity.TM.Single.DecodeTapes]
g:340 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
G:35 [in Complexity.NP.Clique.FlatClique]
g:369 [in Undecidability.Shared.Libs.DLW.Vec.vec]
g:37 [in Undecidability.Shared.Libs.DLW.Utils.sums]
g:38 [in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
g:38 [in Undecidability.TM.Univ.LowLevel]
g:386 [in Undecidability.TM.Hoare.HoareCombinators]
g:398 [in Undecidability.TM.Util.TM_facts]
g:4 [in Undecidability.Shared.Libs.PSL.Retracts]
g:4 [in Undecidability.Shared.Libs.PSL.Bijection]
g:40 [in Complexity.Complexity.ONotation]
g:40 [in Complexity.Complexity.ONotationIsAppropriate]
g:40 [in Complexity.Complexity.Definitions]
g:41 [in Undecidability.Shared.Libs.DLW.Utils.interval]
g:41 [in Undecidability.L.Datatypes.LVector]
g:41 [in Complexity.L.AbstractMachines.AbstractHeapMachine]
g:42 [in Complexity.Complexity.PolyTimeComputable]
g:427 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
g:432 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
g:44 [in Undecidability.Shared.Libs.DLW.Utils.sorting]
g:449 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
g:45 [in Complexity.Complexity.ONotation]
g:45 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
G:45 [in Complexity.NP.Clique.FlatUGraph]
g:450 [in Undecidability.TM.Hoare.HoareCombinators]
g:46 [in Undecidability.Shared.Libs.DLW.Utils.sums]
g:50 [in Complexity.Complexity.ONotation]
g:50 [in Complexity.L.AbstractMachines.AbstractHeapMachine]
g:51 [in Undecidability.Shared.Libs.DLW.Vec.vec]
g:51 [in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
g:51 [in Undecidability.Shared.Libs.DLW.Utils.sorting]
g:54 [in Undecidability.Shared.Libs.DLW.Vec.vec]
g:54 [in Complexity.L.AbstractMachines.AbstractHeapMachine]
g:55 [in Complexity.L.AbstractMachines.Computable.EvalForTime]
g:55 [in Complexity.TM.PrettyBounds.PrettyBounds]
g:56 [in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
g:56 [in Complexity.Complexity.PolyTimeComputable]
g:56 [in Undecidability.TM.L.HeapInterpreter.LookupTM]
g:57 [in Complexity.TM.PrettyBounds.BaseCodeSpace]
g:58 [in Undecidability.Shared.Libs.PSL.Retracts]
g:59 [in Undecidability.Shared.Libs.DLW.Utils.sorting]
g:6 [in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
g:6 [in Undecidability.TM.Univ.LowLevel]
g:60 [in Complexity.NP.TM.LM_to_mTM]
g:63 [in Complexity.L.AbstractMachines.AbstractHeapMachine]
g:64 [in Undecidability.Shared.Libs.PSL.Retracts]
g:64 [in Complexity.TM.PrettyBounds.PrettyBounds]
g:65 [in Complexity.Complexity.PolyTimeComputable]
g:66 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
g:67 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
g:67 [in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
g:67 [in Complexity.NP.Clique.FlatUGraph]
g:68 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
g:68 [in Complexity.L.TM.CompCode]
g:69 [in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
g:69 [in Complexity.L.AbstractMachines.AbstractHeapMachine]
g:7 [in Undecidability.Shared.Libs.PSL.Bijection]
g:70 [in Undecidability.Shared.Libs.DLW.Utils.sorting]
g:71 [in Complexity.NP.Clique.FlatUGraph]
G:72 [in Complexity.NP.Clique.FlatUGraph]
g:73 [in Complexity.TM.PrettyBounds.PrettyBounds]
g:76 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
G:76 [in Complexity.NP.Clique.FlatClique]
g:8 [in Undecidability.L.Datatypes.LProd]
g:8 [in Complexity.Complexity.ONotation]
g:8 [in Complexity.Complexity.ONotationIsAppropriate]
G:8 [in Complexity.NP.Clique.FlatClique]
g:8 [in Complexity.Complexity.PolyTimeComputable]
g:80 [in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
G:80 [in Complexity.NP.Clique.FlatClique]
g:81 [in Undecidability.TM.L.HeapInterpreter.StepTM]
g:81 [in Complexity.L.AbstractMachines.AbstractHeapMachine]
g:82 [in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
G:83 [in Undecidability.L.Complexity.UpToC]
g:83 [in Undecidability.Shared.Libs.DLW.Utils.sorting]
G:83 [in Complexity.NP.Clique.FlatClique]
g:83 [in Complexity.TM.PrettyBounds.PrettyBounds]
g:85 [in Undecidability.TM.Util.Prelim]
g:86 [in Undecidability.Shared.Libs.DLW.Utils.sorting]
G:86 [in Complexity.NP.Clique.FlatClique]
g:86 [in Undecidability.TM.L.HeapInterpreter.StepTM]
G:88 [in Undecidability.L.Complexity.GenericNary]
G:89 [in Complexity.NP.Clique.FlatClique]
g:89 [in Undecidability.L.Tactics.Reflection]
g:89 [in Complexity.NP.TM.LM_to_mTM]
g:9 [in Complexity.TM.Compound.MoveToSymbol_niceSpec]
g:9 [in Undecidability.TM.L.Eval]
g:90 [in Undecidability.TM.Code.Code]
g:91 [in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
g:92 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
g:92 [in Complexity.L.AbstractMachines.AbstractHeapMachine]
G:93 [in Complexity.NP.Clique.FlatClique]
g:95 [in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
g:96 [in Undecidability.TM.L.HeapInterpreter.StepTM]

H

halt':98 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
halt:119 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
halt:121 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
halt:92 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
halt:95 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
haveSeenMark:19 [in Complexity.TM.Single.DecodeTape]
haveSeenMark:24 [in Complexity.TM.Single.DecodeTape]
haveSeenSymbol:18 [in Complexity.TM.Single.DecodeTape]
haveSeenSymbol:25 [in Complexity.TM.Single.DecodeTape]
HCards:55 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
HCards:92 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
Hclique:75 [in Complexity.NP.Clique.kSAT_to_Clique]
Hcl:15 [in Undecidability.TM.L.Eval]
Hcl:7 [in Undecidability.TM.L.Eval]
Hcmp:59 [in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
Hcomplete:48 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
Hcomplete:72 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
Hcomplete:83 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
Hconc:37 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
Hconc:61 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
Hdec:25 [in Undecidability.L.Functions.Decoding]
HDec:51 [in Undecidability.TM.Single.StepTM]
HDec:54 [in Undecidability.TM.Single.StepTM]
Hdec:65 [in Undecidability.L.Functions.Decoding]
Hdec:8 [in Complexity.L.TM.TapeDecode]
hd:64 [in Complexity.NP.TM.M_multi2mono]
hd:68 [in Complexity.NP.TM.M_multi2mono]
Helem1:28 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
Helem2:29 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
Helem3:30 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
HeqbComp:84 [in Complexity.Libs.CookPrelim.PolyBounds]
HFinal:56 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
HFinal:93 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
Hfx:38 [in Complexity.Complexity.Subtypes]
Hfx:64 [in Complexity.Complexity.Subtypes]
Hf:50 [in Undecidability.L.Tactics.Computable]
Hf:58 [in Undecidability.L.Tactics.Computable]
Hf:63 [in Undecidability.L.Tactics.Computable]
Hf:71 [in Undecidability.L.Tactics.ComputableTime]
Hf:81 [in Undecidability.L.Tactics.ComputableTime]
Hf:87 [in Undecidability.L.Tactics.ComputableTime]
Hinitial:65 [in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
HInit:54 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
HInit:91 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
Hi:18 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
Hi:29 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
Hi:32 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
Hi:7 [in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
Hj:15 [in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
Hj:18 [in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
Hkcnf:3 [in Complexity.NP.Clique.kSAT_to_FlatClique]
Hkgt:48 [in Complexity.NP.Clique.kSAT_to_FlatClique]
HLastStep:139 [in Undecidability.TM.Combinators.StateWhile]
HLastStep:144 [in Undecidability.TM.Combinators.StateWhile]
HLastStep:76 [in Undecidability.TM.Combinators.While]
HLastStep:80 [in Undecidability.TM.Combinators.While]
Hm:163 [in Undecidability.Shared.Libs.DLW.Vec.pos]
Hn:202 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
Hn:205 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
HOffset:89 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
HPQ:8 [in Undecidability.Shared.Libs.DLW.Utils.fin_dec]
Hprem:36 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
Hprem:60 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
HP:115 [in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
HP:181 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
HQ:6 [in Undecidability.Shared.Libs.DLW.Utils.fin_dec]
Hreg:7 [in Complexity.L.TM.TapeDecode]
HR':9 [in Complexity.NP.TM.LM_to_mTM]
HR:100 [in Undecidability.L.Computability.Seval]
HR:113 [in Undecidability.L.Computability.Seval]
Hr:13 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_nat_facts]
HR:16 [in Undecidability.TM.L.Eval]
Hr:18 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_nat_facts]
Hr:58 [in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
Hr:7 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_nat_facts]
HR:8 [in Undecidability.TM.L.Eval]
HR:99 [in Undecidability.L.Complexity.ResourceMeasures]
HSigma:53 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
HSigma:88 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
Hsound:45 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
Hsound:69 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
Hsound:80 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
HStar:138 [in Undecidability.TM.Combinators.StateWhile]
HStar:75 [in Undecidability.TM.Combinators.While]
Hsteps:57 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
HSteps:94 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
hs_num:125 [in Undecidability.L.Tactics.Extract]
hs_num:95 [in Undecidability.L.Tactics.Extract]
hs_num:33 [in Undecidability.L.Tactics.GenEncode]
hs_num:18 [in Undecidability.L.Tactics.GenEncode]
hs2:46 [in Undecidability.L.Tactics.Extract]
HS:107 [in Undecidability.L.Computability.Seval]
HS:119 [in Undecidability.L.Computability.Seval]
hs:45 [in Undecidability.L.Tactics.Extract]
HT':11 [in Complexity.NP.TM.LM_to_mTM]
HT:156 [in Undecidability.TM.Combinators.StateWhile]
Ht:64 [in Complexity.L.TM.TMflat]
HT:89 [in Undecidability.TM.Combinators.While]
HWidth:90 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
HXeq:83 [in Complexity.Libs.CookPrelim.PolyBounds]
HX:113 [in Complexity.L.TM.CompCode]
HX:114 [in Complexity.L.TM.TMflatComp]
Hx:12 [in Undecidability.L.Datatypes.List.List_basics]
Hx:12 [in Undecidability.L.Datatypes.List.List_nat]
HX:127 [in Complexity.L.TM.TMflatComp]
Hx:138 [in Complexity.L.TM.TMunflatten]
HX:140 [in Complexity.L.TM.TMflatComp]
HX:141 [in Complexity.L.TM.CompCode]
Hx:152 [in Complexity.L.TM.TMunflatten]
HX:156 [in Complexity.L.TM.TMflatComp]
Hx:16 [in Complexity.Complexity.Subtypes]
HX:187 [in Complexity.L.TM.TMflatComp]
HX:19 [in Undecidability.L.Datatypes.LOptions]
Hx:193 [in Undecidability.Shared.Libs.DLW.Vec.vec]
HX:199 [in Complexity.L.TM.TMflatComp]
Hx:216 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
Hx:225 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
Hx:24 [in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
Hx:25 [in Undecidability.L.Datatypes.List.List_basics]
HX:25 [in Complexity.L.TM.CompCode]
Hx:27 [in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
Hx:29 [in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
HX:31 [in Undecidability.L.Datatypes.LSum]
HX:33 [in Undecidability.L.Datatypes.List.List_eqb]
Hx:36 [in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
Hx:44 [in Undecidability.L.Tactics.ComputableDemo]
Hx:5 [in Undecidability.L.Datatypes.List.List_nat]
Hx:51 [in Undecidability.L.Tactics.Computable]
Hx:54 [in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
Hx:59 [in Undecidability.L.Tactics.Computable]
Hx:6 [in Complexity.L.Datatypes.LDepPair]
Hx:60 [in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
Hx:63 [in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
HX:65 [in Complexity.L.TM.CompCode]
Hx:65 [in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
Hx:72 [in Undecidability.L.Tactics.ComputableTime]
HX:73 [in Undecidability.L.Computability.Synthetic]
Hx:82 [in Undecidability.L.Tactics.ComputableTime]
HX:89 [in Complexity.L.TM.CompCode]
Hx:90 [in Undecidability.Shared.Libs.DLW.Utils.fin_base]
Hx:93 [in Undecidability.Shared.Libs.DLW.Utils.fin_base]
Hx:970 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
Hx:983 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
HY:114 [in Complexity.L.TM.CompCode]
HY:115 [in Complexity.L.TM.TMflatComp]
HY:128 [in Complexity.L.TM.TMflatComp]
Hy:13 [in Undecidability.L.Datatypes.List.List_basics]
Hy:139 [in Complexity.L.TM.TMunflatten]
HY:141 [in Complexity.L.TM.TMflatComp]
Hy:153 [in Complexity.L.TM.TMunflatten]
HY:157 [in Complexity.L.TM.TMflatComp]
HY:188 [in Complexity.L.TM.TMflatComp]
HY:200 [in Complexity.L.TM.TMflatComp]
Hy:21 [in Undecidability.Shared.Libs.DLW.Wf.acc_irr]
Hy:26 [in Undecidability.L.Datatypes.List.List_basics]
HY:32 [in Undecidability.L.Datatypes.LSum]
Hy:45 [in Undecidability.L.Tactics.ComputableDemo]
HY:66 [in Complexity.L.TM.CompCode]
HY:74 [in Undecidability.L.Computability.Synthetic]
Hy:984 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
Hz:218 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
Hz:220 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
Hz:69 [in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
Hz:71 [in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
H__neq:141 [in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
H__neq:135 [in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
H__neq:68 [in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
h_unifHom:32 [in Complexity.Libs.UniformHomomorphisms]
H_sat:41 [in Complexity.NP.Clique.kSAT_to_Clique]
h'':16 [in Complexity.Libs.UniformHomomorphisms]
H':10 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
H':103 [in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
H':112 [in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
h':12 [in Complexity.Libs.UniformHomomorphisms]
H':124 [in Complexity.L.TM.CompCode]
H':128 [in Undecidability.TM.L.HeapInterpreter.StepTM]
H':13 [in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
H':14 [in Complexity.L.AbstractMachines.Computable.Unfolding]
h':14 [in Complexity.Libs.UniformHomomorphisms]
H':146 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
H':15 [in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
h':15 [in Complexity.Libs.UniformHomomorphisms]
H':151 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
H':157 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
H':171 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
H':189 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
H':193 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
H':2 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
H':20 [in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
H':202 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
H':21 [in Complexity.L.AbstractMachines.Computable.Unfolding]
H':211 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
H':211 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
H':216 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
H':220 [in Undecidability.TM.L.HeapInterpreter.StepTM]
H':228 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
h':245 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
h':247 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
h':249 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
h':2602 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
h':2607 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
h':2612 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
h':285 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
h':292 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
H':3 [in Complexity.L.AbstractMachines.AbstractHeapMachine]
h':300 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
h':308 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
h':315 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
H':32 [in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
h':322 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
H':38 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
H':38 [in Complexity.L.AbstractMachines.AbstractHeapMachine]
H':41 [in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
H':41 [in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
H':42 [in Undecidability.L.Datatypes.LSum]
H':43 [in Complexity.L.AbstractMachines.AbstractHeapMachine]
H':46 [in Undecidability.L.Functions.EqBool]
H':46 [in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
H':49 [in Complexity.L.AbstractMachines.AbstractHeapMachine]
H':5 [in Complexity.NP.TM.LM_to_mTM]
H':53 [in Complexity.L.AbstractMachines.AbstractHeapMachine]
H':6 [in Undecidability.L.Datatypes.LProd]
H':6 [in Undecidability.L.Datatypes.LSum]
H':6 [in Complexity.L.AbstractMachines.AbstractHeapMachine]
H':63 [in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
H':65 [in Complexity.L.AbstractMachines.AbstractHeapMachine]
H':68 [in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
H':69 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
H':7 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
H':70 [in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
H':75 [in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
H':76 [in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
H':76 [in Complexity.L.TM.CompCode]
H':79 [in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
H':82 [in Complexity.L.AbstractMachines.AbstractHeapMachine]
H':84 [in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
H':93 [in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
H0:10 [in Complexity.Complexity.EncodableP]
H0:10 [in Undecidability.L.Datatypes.LSum]
H0:10 [in Complexity.Complexity.Subtypes]
H0:10 [in Undecidability.L.Functions.FinTypeLookup]
H0:101 [in Complexity.Complexity.PolyTimeComputable]
H0:106 [in Complexity.L.TM.TMflatComp]
H0:107 [in Complexity.NP.TM.LM_to_mTM]
H0:11 [in Undecidability.L.Functions.Encoding]
H0:112 [in Complexity.NP.TM.LM_to_mTM]
H0:117 [in Complexity.Libs.CookPrelim.PolyBounds]
H0:118 [in Complexity.L.TM.CompCode]
H0:118 [in Complexity.L.TM.TMflatComp]
H0:118 [in Complexity.L.TM.TMunflatten]
H0:130 [in Complexity.L.TM.TMunflatten]
H0:131 [in Complexity.L.TM.TMflatComp]
H0:14 [in Undecidability.L.Datatypes.LVector]
H0:14 [in Complexity.Complexity.PolyTimeComputable]
H0:141 [in Complexity.Complexity.NP]
H0:144 [in Complexity.L.TM.TMflatComp]
H0:15 [in Complexity.Complexity.EncodableP]
H0:15 [in Complexity.L.TM.TMflatComp]
H0:160 [in Complexity.L.TM.TMflatComp]
H0:18 [in Complexity.Complexity.EncodableP]
H0:18 [in Undecidability.L.Functions.LoopSum]
H0:19 [in Undecidability.L.Functions.Decoding]
H0:191 [in Complexity.L.TM.TMflatComp]
H0:203 [in Complexity.L.TM.TMflatComp]
H0:24 [in Complexity.Complexity.PolyTimeComputable]
H0:26 [in Undecidability.L.Datatypes.LProd]
H0:26 [in Undecidability.L.Datatypes.LVector]
h0:286 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
H0:29 [in Undecidability.L.Datatypes.LProd]
h0:293 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
H0:3 [in Complexity.L.TM.TapeDecode]
H0:3 [in Undecidability.L.Complexity.LinDecode.LTD_def]
H0:30 [in Undecidability.L.Datatypes.List.List_fold]
h0:301 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
h0:309 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
h0:316 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
h0:323 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
H0:33 [in Undecidability.L.Functions.Decoding]
H0:36 [in Undecidability.L.Datatypes.LSum]
H0:37 [in Complexity.Complexity.PolyTimeComputable]
H0:39 [in Undecidability.L.Datatypes.LVector]
H0:39 [in Complexity.Complexity.NP]
H0:4 [in Undecidability.L.Functions.LoopSum]
H0:4 [in Undecidability.L.Functions.UnboundIteration]
H0:4 [in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
H0:41 [in Undecidability.L.Functions.Decoding]
H0:47 [in Undecidability.L.Functions.Decoding]
H0:5 [in Complexity.Complexity.PolyTimeComputable]
H0:53 [in Complexity.Complexity.PolyTimeComputable]
H0:53 [in Complexity.NP.TM.LM_to_mTM]
H0:549 [in Complexity.NP.TM.LM_to_mTM]
H0:55 [in Undecidability.L.Functions.Decoding]
H0:559 [in Complexity.NP.TM.LM_to_mTM]
H0:58 [in Complexity.Complexity.Definitions]
H0:582 [in Complexity.NP.TM.LM_to_mTM]
H0:59 [in Undecidability.L.Datatypes.List.List_eqb]
H0:60 [in Undecidability.L.Functions.Decoding]
H0:62 [in Complexity.Complexity.PolyTimeComputable]
H0:67 [in Undecidability.L.Datatypes.LVector]
H0:69 [in Undecidability.L.Functions.FinTypeLookup]
H0:69 [in Complexity.Complexity.Definitions]
H0:70 [in Complexity.L.TM.CompCode]
H0:75 [in Complexity.Complexity.NP]
H0:89 [in Undecidability.L.Complexity.ResourceMeasures]
H0:89 [in Complexity.Complexity.Definitions]
H0:89 [in Complexity.Complexity.PolyTimeComputable]
H0:95 [in Complexity.Complexity.Definitions]
H0:95 [in Complexity.Complexity.PolyTimeComputable]
H0:980 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
H1:101 [in Complexity.Complexity.Definitions]
H1:11 [in Undecidability.L.Functions.FinTypeLookup]
H1:11 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
H1:118 [in Complexity.Libs.CookPrelim.PolyBounds]
H1:12 [in Undecidability.Shared.Libs.DLW.Wf.acc_irr]
H1:12 [in Complexity.L.TM.TapeDecode]
H1:13 [in Complexity.Complexity.LinTimeDecodable]
H1:136 [in Complexity.Complexity.NP]
H1:15 [in Complexity.Complexity.PolyTimeComputable]
H1:16 [in Complexity.L.TM.TMflatComp]
H1:16 [in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
h1:162 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
h1:177 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
H1:18 [in Undecidability.Shared.Libs.DLW.Wf.acc_irr]
h1:182 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
H1:23 [in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
H1:24 [in Undecidability.Shared.Libs.DLW.Wf.acc_irr]
H1:25 [in Undecidability.TM.Single.StepTM]
H1:25 [in Complexity.Complexity.PolyTimeComputable]
H1:27 [in Undecidability.L.Datatypes.LVector]
H1:3 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
H1:37 [in Undecidability.TM.Single.StepTM]
H1:38 [in Complexity.Complexity.PolyTimeComputable]
H1:39 [in Undecidability.Shared.Libs.DLW.Utils.fin_base]
H1:4 [in Undecidability.L.Complexity.LinDecode.LTDlist]
H1:40 [in Undecidability.L.Datatypes.LVector]
H1:40 [in Complexity.Complexity.NP]
H1:44 [in Undecidability.TM.Single.EncodeTapes]
H1:49 [in Undecidability.TM.Single.EncodeTapes]
H1:5 [in Complexity.Complexity.LinTimeDecodable]
H1:54 [in Complexity.Complexity.PolyTimeComputable]
H1:55 [in Undecidability.TM.Single.EncodeTapes]
H1:560 [in Complexity.NP.TM.LM_to_mTM]
H1:6 [in Complexity.Complexity.PolyTimeComputable]
H1:63 [in Complexity.Complexity.PolyTimeComputable]
H1:68 [in Undecidability.L.Datatypes.LVector]
H1:7 [in Undecidability.L.Functions.UnboundIteration]
H1:80 [in Undecidability.TM.Single.StepTM]
H1:87 [in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
H1:974 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
H1:98 [in Undecidability.L.Datatypes.LVector]
H2:12 [in Complexity.Complexity.EncodableP]
H2:12 [in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
H2:12 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
H2:121 [in Complexity.L.TM.TMflatComp]
H2:13 [in Undecidability.Shared.Libs.DLW.Wf.acc_irr]
H2:134 [in Complexity.L.TM.TMflatComp]
H2:147 [in Complexity.L.TM.TMflatComp]
H2:163 [in Complexity.L.TM.TMflatComp]
h2:163 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
h2:178 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
H2:18 [in Undecidability.L.Functions.FinTypeLookup]
h2:183 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
H2:19 [in Undecidability.Shared.Libs.DLW.Wf.acc_irr]
H2:194 [in Complexity.L.TM.TMflatComp]
H2:20 [in Undecidability.L.Functions.UnboundIteration]
H2:206 [in Complexity.L.TM.TMflatComp]
h2:245 [in Undecidability.Shared.Libs.DLW.Vec.vec]
H2:25 [in Undecidability.Shared.Libs.DLW.Wf.acc_irr]
H2:26 [in Undecidability.TM.Single.StepTM]
H2:26 [in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
H2:26 [in Complexity.Complexity.PolyTimeComputable]
H2:32 [in Undecidability.L.Datatypes.LProd]
H2:35 [in Undecidability.L.Functions.Decoding]
H2:38 [in Undecidability.TM.Single.StepTM]
H2:39 [in Complexity.Complexity.PolyTimeComputable]
H2:4 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
H2:40 [in Undecidability.Shared.Libs.DLW.Utils.fin_base]
H2:43 [in Undecidability.L.Functions.Decoding]
H2:49 [in Undecidability.L.Functions.Decoding]
H2:50 [in Undecidability.TM.Single.EncodeTapes]
H2:56 [in Undecidability.TM.Single.EncodeTapes]
H2:57 [in Undecidability.L.Functions.Decoding]
H2:81 [in Undecidability.TM.Single.StepTM]
H2:988 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
H3:25 [in Undecidability.L.Functions.UnboundIteration]
H4:16 [in Complexity.Complexity.LinTimeDecodable]
H4:8 [in Complexity.Complexity.LinTimeDecodable]
H4:992 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
H:1 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
H:1 [in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisUnfoldClos]
H:1 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
H:1 [in Complexity.L.AbstractMachines.Computable.UnivDecTime]
H:1 [in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisStep]
H:1 [in Complexity.L.AbstractMachines.AbstractHeapMachine]
H:10 [in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
H:10 [in Complexity.L.TM.CompCode]
H:10 [in Undecidability.Shared.Libs.DLW.Wf.acc_irr]
h:10 [in Complexity.Libs.UniformHomomorphisms]
H:10 [in Complexity.Libs.CookPrelim.PolyBounds]
H:10 [in Undecidability.L.Functions.Encoding]
H:100 [in Complexity.NP.SAT.SAT_inNP]
H:100 [in Undecidability.TM.L.HeapInterpreter.StepTM]
H:100 [in Complexity.Complexity.PolyTimeComputable]
H:100 [in Complexity.NP.TM.LM_to_mTM]
H:101 [in Complexity.L.AbstractMachines.AbstractHeapMachine]
h:101 [in Complexity.Libs.CookPrelim.MorePrelim]
H:103 [in Complexity.L.ComparisonTimeBoundDerivation]
H:104 [in Complexity.NP.SAT.SAT_inNP]
H:105 [in Complexity.L.ComparisonTimeBoundDerivation]
H:105 [in Complexity.L.TM.TMflatComp]
H:105 [in Undecidability.TM.L.HeapInterpreter.StepTM]
H:105 [in Complexity.L.AbstractMachines.AbstractHeapMachine]
H:106 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
H:106 [in Complexity.Complexity.PolyTimeComputable]
H:106 [in Complexity.NP.TM.LM_to_mTM]
h:107 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
H:107 [in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
H:108 [in Undecidability.L.Computability.Synthetic]
H:109 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
H:109 [in Complexity.L.ComparisonTimeBoundDerivation]
H:11 [in Undecidability.TM.L.Eval]
H:11 [in Complexity.L.AbstractMachines.Computable.HeapMachine]
H:110 [in Complexity.NP.SAT.SAT_inNP]
H:111 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
h:111 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
H:111 [in Undecidability.L.Computability.Synthetic]
H:111 [in Complexity.NP.TM.LM_to_mTM]
H:112 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
H:112 [in Complexity.NP.SAT.SAT_inNP]
H:113 [in Complexity.Complexity.PolyTimeComputable]
H:113 [in Undecidability.L.Tactics.Computable]
H:115 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
H:115 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
H:115 [in Complexity.L.ComparisonTimeBoundDerivation]
H:115 [in Undecidability.TM.L.HeapInterpreter.StepTM]
h:115 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
H:115 [in Undecidability.TM.L.HeapInterpreter.LookupTM]
H:116 [in Complexity.NP.SAT.SAT_inNP]
H:116 [in Complexity.Libs.CookPrelim.PolyBounds]
h:116 [in Undecidability.Shared.Libs.DLW.Utils.sorting]
H:117 [in Complexity.L.TM.CompCode]
H:117 [in Complexity.L.TM.TMunflatten]
H:118 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
H:12 [in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
H:12 [in Complexity.L.AbstractMachines.Computable.EvalForTime]
H:12 [in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
H:12 [in Undecidability.L.Datatypes.List.List_extra]
H:12 [in Complexity.L.AbstractMachines.AbstractHeapMachine]
H:12 [in Undecidability.Shared.Dec]
H:12 [in Undecidability.Shared.ListAutomation]
H:120 [in Undecidability.L.Tactics.Computable]
H:121 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
H:121 [in Complexity.L.TM.CompCode]
H:122 [in Complexity.NP.SAT.SAT_inNP]
H:122 [in Complexity.Complexity.PolyTimeComputable]
H:123 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
H:124 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
h:125 [in Undecidability.TM.Compound.Shift]
H:126 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
H:126 [in Complexity.L.TM.CompCode]
h:126 [in Undecidability.Shared.Libs.DLW.Utils.sorting]
H:127 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
H:127 [in Undecidability.Shared.Libs.DLW.Vec.pos]
h:128 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
H:129 [in Complexity.L.TM.TMunflatten]
H:129 [in Undecidability.Shared.Libs.DLW.Vec.pos]
H:13 [in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisUnfoldClos]
H:13 [in Undecidability.Shared.FinTypeEquiv]
H:13 [in Undecidability.L.Datatypes.LVector]
H:13 [in Complexity.Libs.CookPrelim.PolyBounds]
H:13 [in Complexity.Complexity.PolyTimeComputable]
H:130 [in Undecidability.Synthetic.ListEnumerabilityFacts]
h:131 [in Undecidability.Shared.Libs.DLW.Utils.sorting]
H:131 [in Complexity.Complexity.PolyTimeComputable]
H:132 [in Complexity.Complexity.NP]
H:133 [in Undecidability.TM.L.HeapInterpreter.StepTM]
H:133 [in Undecidability.Shared.Libs.DLW.Vec.pos]
H:134 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
H:134 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
H:135 [in Undecidability.Shared.Libs.DLW.Vec.pos]
H:138 [in Undecidability.TM.L.HeapInterpreter.StepTM]
H:14 [in Complexity.L.AbstractMachines.Computable.EvalForTime]
H:14 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
H:14 [in Complexity.NP.L.CanEnumTerm_def]
H:14 [in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
H:14 [in Complexity.L.TM.TMflatComp]
H:14 [in Undecidability.Shared.Dec]
H:14 [in Undecidability.L.Computability.Synthetic]
H:140 [in Complexity.Complexity.PolyTimeComputable]
H:140 [in Complexity.Complexity.NP]
H:141 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
H:142 [in Complexity.L.ComparisonTimeBoundDerivation]
H:143 [in Complexity.L.TM.CompCode]
H:143 [in Undecidability.TM.L.HeapInterpreter.StepTM]
H:143 [in Undecidability.Synthetic.ListEnumerabilityFacts]
H:143 [in Undecidability.Shared.Libs.DLW.Vec.pos]
H:144 [in Complexity.Libs.CookPrelim.PolyBounds]
H:145 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
H:145 [in Complexity.Complexity.NP]
H:146 [in Complexity.L.TM.CompCode]
H:146 [in Undecidability.Shared.Libs.DLW.Vec.pos]
H:148 [in Complexity.L.TM.CompCode]
H:148 [in Complexity.Libs.CookPrelim.PolyBounds]
H:15 [in Complexity.L.AbstractMachines.UnfoldTailRec]
H:15 [in Undecidability.L.Datatypes.List.List_fold]
H:15 [in Undecidability.Shared.Libs.DLW.Vec.pos]
H:150 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
H:150 [in Undecidability.TM.L.HeapInterpreter.StepTM]
H:152 [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
H:155 [in Complexity.Complexity.NP]
H:156 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
H:156 [in Undecidability.TM.L.HeapInterpreter.StepTM]
H:157 [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
H:159 [in Complexity.L.ComparisonTimeBoundDerivation]
H:16 [in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
H:16 [in Undecidability.L.Datatypes.Lists]
H:16 [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
H:16 [in Complexity.Complexity.UpToCPoly]
H:16 [in Undecidability.L.Datatypes.LFinType]
H:16 [in Undecidability.TM.L.HeapInterpreter.LookupTM]
H:160 [in Complexity.Libs.CookPrelim.FlatFinTypes]
H:163 [in Complexity.L.ComparisonTimeBoundDerivation]
H:164 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
H:166 [in Undecidability.TM.L.HeapInterpreter.StepTM]
H:167 [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
H:168 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
H:169 [in Complexity.L.ComparisonTimeBoundDerivation]
H:17 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds_Loop]
H:17 [in Undecidability.L.Functions.LoopSum]
H:17 [in Undecidability.Shared.Libs.PSL.EqDec]
H:17 [in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
H:17 [in Complexity.Libs.CookPrelim.PolyBounds]
H:17 [in Complexity.L.AbstractMachines.AbstractHeapMachine]
H:17 [in Undecidability.L.Functions.Encoding]
H:170 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
H:171 [in Complexity.L.ComparisonTimeBoundDerivation]
H:173 [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
H:175 [in Complexity.L.ComparisonTimeBoundDerivation]
H:176 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
H:177 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
H:18 [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
H:18 [in Undecidability.L.Datatypes.List.List_nat]
H:18 [in Undecidability.L.Functions.EqBool]
H:18 [in Undecidability.L.Tactics.Lbeta_nonrefl]
H:18 [in Complexity.L.AbstractMachines.AbstractHeapMachine]
H:18 [in Undecidability.L.TM.TMEncoding]
H:18 [in Undecidability.L.Computability.Synthetic]
H:181 [in Complexity.L.ComparisonTimeBoundDerivation]
H:182 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
H:182 [in Undecidability.TM.L.HeapInterpreter.StepTM]
H:186 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
H:186 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
H:186 [in Undecidability.TM.L.HeapInterpreter.StepTM]
H:189 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
H:19 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
H:19 [in Undecidability.Shared.Libs.PSL.EqDec]
H:19 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
h:19 [in Complexity.Libs.UniformHomomorphisms]
H:19 [in Complexity.L.AbstractMachines.Computable.HeapMachine]
H:19 [in Undecidability.TM.L.HeapInterpreter.LookupTM]
H:192 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
H:193 [in Undecidability.TM.L.HeapInterpreter.StepTM]
H:194 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
H:195 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
H:198 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
H:2 [in Complexity.Complexity.EncodableP]
H:2 [in Complexity.L.AbstractMachines.Computable.Unfolding]
H:2 [in Undecidability.L.Datatypes.Lists]
H:2 [in Complexity.L.ComparisonTimeBoundDerivation]
H:2 [in Undecidability.L.Prelim.MoreBase]
H:2 [in Undecidability.L.Datatypes.LVector]
H:2 [in Complexity.Libs.CookPrelim.PolyBounds]
H:2 [in Undecidability.L.Datatypes.List.List_fold]
H:2 [in Undecidability.L.Functions.Decoding]
H:20 [in Undecidability.TM.Util.VectorPrelim]
H:20 [in Complexity.Complexity.UpToCPoly]
H:20 [in Undecidability.L.Datatypes.LFinType]
H:20 [in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
H:201 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
H:202 [in Undecidability.TM.L.HeapInterpreter.StepTM]
H:203 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
H:205 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
H:205 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
H:208 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
H:209 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
H:21 [in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisUnfoldClos]
H:21 [in Complexity.Libs.CookPrelim.PolyBounds]
H:21 [in Undecidability.L.TM.TMEncoding]
H:210 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
H:211 [in Undecidability.TM.L.HeapInterpreter.StepTM]
H:212 [in Undecidability.Shared.Libs.DLW.Vec.vec]
H:214 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
H:219 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
H:22 [in Undecidability.TM.L.HeapInterpreter.LookupTM]
h:220 [in Undecidability.Shared.Libs.DLW.Vec.vec]
H:222 [in Undecidability.Shared.Libs.DLW.Vec.vec]
H:224 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
H:225 [in Undecidability.Shared.Libs.DLW.Vec.vec]
H:226 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
H:229 [in Undecidability.TM.L.HeapInterpreter.StepTM]
H:23 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
h:23 [in Complexity.Libs.UniformHomomorphisms]
H:23 [in Undecidability.L.TM.TapeFuns]
H:23 [in Undecidability.L.Datatypes.List.List_in]
H:23 [in Complexity.Complexity.PolyTimeComputable]
H:23 [in Complexity.Complexity.NP]
H:23 [in Undecidability.L.Functions.Encoding]
H:234 [in Undecidability.TM.L.HeapInterpreter.StepTM]
H:235 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
H:238 [in Undecidability.TM.L.HeapInterpreter.StepTM]
h:239 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
H:24 [in Complexity.L.AbstractMachines.UnfoldTailRec]
H:24 [in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
H:24 [in Complexity.Complexity.UpToCPoly]
H:24 [in Undecidability.L.Functions.EqBool]
H:24 [in Undecidability.L.TM.TMEncoding]
H:24 [in Undecidability.L.Computability.Synthetic]
H:24 [in Undecidability.L.Functions.Decoding]
H:241 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
H:241 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
H:242 [in Undecidability.TM.L.HeapInterpreter.StepTM]
h:244 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
h:246 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
H:247 [in Undecidability.TM.L.HeapInterpreter.StepTM]
h:248 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
H:25 [in Undecidability.L.Datatypes.LProd]
h:25 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
H:25 [in Complexity.L.Functions.IterupN]
H:25 [in Undecidability.L.Datatypes.LVector]
H:25 [in Complexity.Libs.CookPrelim.PolyBounds]
H:253 [in Undecidability.Shared.Libs.DLW.Vec.vec]
h:2546 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
H:26 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
h:26 [in Complexity.Libs.UniformHomomorphisms]
H:26 [in Complexity.L.AbstractMachines.AbstractHeapMachine]
h:2601 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
h:2606 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
h:2611 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
h:262 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
H:27 [in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
H:27 [in Undecidability.L.Datatypes.LOptions]
H:27 [in Complexity.L.TM.CompCode]
H:27 [in Complexity.NP.SAT.SAT_inNP]
H:27 [in Complexity.Complexity.UpToCPoly]
H:27 [in Complexity.Complexity.NP]
H:28 [in Undecidability.L.Datatypes.List.List_basics]
H:28 [in Undecidability.TM.Single.StepTM]
H:28 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds_Loop]
h:28 [in Undecidability.Shared.Libs.DLW.Utils.sorting]
h:282 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
h:289 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
H:29 [in Complexity.L.ComparisonTimeBoundDerivation]
H:29 [in Undecidability.TM.L.Eval]
H:29 [in Undecidability.L.TM.TMEncoding]
H:29 [in Undecidability.L.Computability.Synthetic]
H:29 [in Undecidability.L.Functions.FinTypeLookup]
H:29 [in Undecidability.L.Datatypes.List.List_fold]
h:297 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
H:3 [in Undecidability.L.Datatypes.LOptions]
H:3 [in Undecidability.L.Functions.LoopSum]
h:3 [in Complexity.Libs.UniformHomomorphisms]
H:3 [in Complexity.L.AbstractMachines.Computable.Lookup]
H:3 [in Undecidability.L.Functions.UnboundIteration]
H:3 [in Undecidability.L.Datatypes.List.List_enc]
H:3 [in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
H:3 [in Complexity.L.AbstractMachines.Computable.HeapMachine]
H:3 [in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
H:30 [in Undecidability.L.Datatypes.LOptions]
H:30 [in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
H:30 [in Complexity.L.TM.CompCode]
h:305 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
h:3092 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
H:31 [in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
H:31 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
H:31 [in Undecidability.TM.Single.StepTM]
H:31 [in Complexity.Libs.CookPrelim.PolyBounds]
H:31 [in Complexity.Complexity.UpToCPoly]
h:312 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
h:319 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
H:32 [in Undecidability.L.Datatypes.List.List_basics]
H:32 [in Complexity.L.AbstractMachines.UnfoldHeap]
H:32 [in Undecidability.L.Datatypes.List.List_nat]
h:3223 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
H:33 [in Undecidability.TM.Single.StepTM]
H:33 [in Undecidability.L.TM.TapeFuns]
H:33 [in Undecidability.L.Functions.EqBool]
H:33 [in Complexity.L.AbstractMachines.AbstractHeapMachine]
H:33 [in Undecidability.TM.L.HeapInterpreter.LookupTM]
H:34 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds_Loop]
H:34 [in Complexity.L.AbstractMachines.UnfoldTailRec]
H:34 [in Complexity.Libs.CookPrelim.PolyBounds]
H:34 [in Complexity.Complexity.UpToCPoly]
H:34 [in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
H:34 [in Undecidability.L.TM.TMEncoding]
H:34 [in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
H:35 [in Undecidability.L.Tactics.Lrewrite]
H:35 [in Undecidability.TM.Single.StepTM]
H:35 [in Undecidability.L.Datatypes.LOptions]
H:35 [in Undecidability.L.Datatypes.LSum]
H:35 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_nat_facts]
H:35 [in Undecidability.TM.L.Eval]
H:35 [in Undecidability.L.Functions.FinTypeLookup]
H:36 [in Complexity.Libs.CookPrelim.PolyBounds]
H:36 [in Complexity.Complexity.PolyTimeComputable]
H:37 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
H:37 [in Undecidability.L.Datatypes.LOptions]
H:37 [in Complexity.L.AbstractMachines.AbstractHeapMachine]
H:37 [in Undecidability.L.TM.TMEncoding]
H:37 [in Undecidability.L.Tactics.Computable]
H:38 [in Undecidability.L.Datatypes.LVector]
H:38 [in Complexity.Complexity.UpToCPoly]
H:38 [in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
H:38 [in Undecidability.TM.L.HeapInterpreter.LookupTM]
H:38 [in Complexity.Complexity.NP]
H:39 [in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisUnfoldClos]
H:39 [in Undecidability.L.Datatypes.LSum]
H:39 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
H:39 [in Complexity.Libs.CookPrelim.PolyBounds]
H:39 [in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
H:39 [in Complexity.NP.Clique.FlatClique]
h:39 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
H:4 [in Undecidability.L.Functions.FinTypeLookup]
H:4 [in Complexity.Complexity.PolyTimeComputable]
H:4 [in Undecidability.TM.L.HeapInterpreter.LookupTM]
H:40 [in Undecidability.TM.Single.StepTM]
H:40 [in Undecidability.L.TM.TMEncoding]
H:41 [in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
H:41 [in Complexity.Complexity.ONotation]
H:41 [in Undecidability.L.Tactics.Lrewrite]
h:42 [in Complexity.Libs.UniformHomomorphisms]
H:42 [in Complexity.Libs.CookPrelim.PolyBounds]
H:42 [in Complexity.Complexity.UpToCPoly]
H:42 [in Complexity.L.AbstractMachines.AbstractHeapMachine]
h:428 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
H:43 [in Complexity.L.AbstractMachines.UnfoldTailRec]
H:43 [in Undecidability.L.Tactics.ComputableTactics]
H:43 [in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
H:43 [in Undecidability.L.Tactics.Computable]
H:44 [in Undecidability.TM.L.HeapInterpreter.StepTM]
H:45 [in Undecidability.L.Functions.EqBool]
H:45 [in Complexity.NP.TM.LM_to_mTM]
h:455 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
h:457 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
H:46 [in Complexity.Complexity.UpToCPoly]
H:46 [in Undecidability.TM.SBTM]
H:46 [in Undecidability.TM.L.HeapInterpreter.LookupTM]
H:47 [in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
H:47 [in Undecidability.TM.Single.StepTM]
H:47 [in Complexity.L.AbstractMachines.UnfoldTailRec]
H:47 [in Undecidability.L.Tactics.ComputableTactics]
H:47 [in Undecidability.L.Functions.FinTypeLookup]
H:48 [in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
H:48 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
H:48 [in Complexity.L.AbstractMachines.AbstractHeapMachine]
H:49 [in Complexity.TM.Code.Decode]
H:49 [in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
H:49 [in Complexity.Complexity.Definitions]
H:5 [in Undecidability.L.Datatypes.LProd]
H:5 [in Undecidability.L.Datatypes.LSum]
H:5 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
H:5 [in Undecidability.L.Datatypes.LVector]
h:5 [in Complexity.Libs.CookPrelim.Tactics]
H:5 [in Complexity.L.AbstractMachines.AbstractHeapMachine]
H:5 [in Undecidability.L.Computability.Computability]
H:50 [in Complexity.Complexity.Subtypes]
H:50 [in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
h:50 [in Complexity.L.TM.TMflatten]
H:50 [in Undecidability.L.Datatypes.List.List_in]
H:52 [in Complexity.Libs.CookPrelim.PolyBounds]
H:52 [in Complexity.Complexity.UpToCPoly]
H:52 [in Undecidability.L.Functions.EqBool]
H:52 [in Complexity.L.AbstractMachines.AbstractHeapMachine]
H:52 [in Complexity.Complexity.PolyTimeComputable]
H:52 [in Complexity.NP.TM.LM_to_mTM]
H:53 [in Complexity.L.AbstractMachines.UnfoldTailRec]
H:53 [in Undecidability.TM.L.HeapInterpreter.StepTM]
H:54 [in Undecidability.L.Datatypes.List.List_basics]
H:54 [in Complexity.Complexity.Definitions]
H:548 [in Complexity.NP.TM.LM_to_mTM]
H:55 [in Complexity.Complexity.UpToCPoly]
h:55 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
H:558 [in Complexity.NP.TM.LM_to_mTM]
H:56 [in Complexity.L.AbstractMachines.Computable.EvalForTime]
H:56 [in Complexity.L.AbstractMachines.UnfoldTailRec]
H:56 [in Undecidability.L.Tactics.ComputableTime]
H:56 [in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
H:56 [in Undecidability.L.Datatypes.List.List_eqb]
H:57 [in Undecidability.TM.Single.StepTM]
H:57 [in Complexity.Complexity.UpToCPoly]
H:57 [in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
H:57 [in Complexity.Complexity.Definitions]
H:57 [in Undecidability.TM.L.HeapInterpreter.LookupTM]
H:58 [in Undecidability.L.Functions.FinTypeLookup]
H:581 [in Complexity.NP.TM.LM_to_mTM]
H:59 [in Complexity.L.AbstractMachines.UnfoldTailRec]
H:59 [in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
H:59 [in Complexity.Complexity.NP]
H:6 [in Complexity.L.AbstractMachines.UnfoldTailRec]
H:6 [in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisUnfoldClos]
H:6 [in Undecidability.L.Datatypes.Lists]
h:6 [in Complexity.Libs.UniformHomomorphisms]
H:6 [in Complexity.Libs.CookPrelim.PolyBounds]
H:6 [in Undecidability.Synthetic.Infinite]
H:6 [in Complexity.Complexity.NP]
H:60 [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
H:60 [in Complexity.Complexity.UpToCPoly]
H:60 [in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
H:61 [in Complexity.Complexity.PolyTimeComputable]
H:62 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
H:62 [in Undecidability.L.Tactics.ComputableTime]
H:62 [in Complexity.L.AbstractMachines.AbstractHeapMachine]
H:62 [in Complexity.L.AbstractMachines.FunctionalDefinitions]
H:62 [in Undecidability.TM.L.HeapInterpreter.LookupTM]
H:62 [in Complexity.Complexity.NP]
H:62 [in Undecidability.TM.Single.EncodeTapes]
H:63 [in Complexity.Complexity.Subtypes]
H:63 [in Complexity.Complexity.UpToCPoly]
H:64 [in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
H:64 [in Undecidability.L.Functions.Decoding]
H:65 [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
h:65 [in Undecidability.TM.Compound.Shift]
H:66 [in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
H:66 [in Undecidability.L.Datatypes.LVector]
h:66 [in Undecidability.Shared.Libs.DLW.Utils.sorting]
H:67 [in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
H:68 [in Undecidability.L.Computability.Synthetic]
H:68 [in Undecidability.L.Functions.FinTypeLookup]
H:68 [in Complexity.Complexity.Definitions]
H:69 [in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
H:69 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
H:69 [in Complexity.L.TM.CompCode]
h:7 [in Complexity.Libs.UniformHomomorphisms]
H:7 [in Complexity.Complexity.UpToCPoly]
H:70 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
H:70 [in Complexity.L.AbstractMachines.AbstractHeapMachine]
H:71 [in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
H:73 [in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
H:73 [in Complexity.L.ComparisonTimeBoundDerivation]
H:73 [in Complexity.L.TM.CompCode]
H:74 [in Complexity.Complexity.NP]
H:75 [in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
H:76 [in Undecidability.L.Datatypes.LVector]
H:76 [in Undecidability.TM.L.HeapInterpreter.StepTM]
H:76 [in Complexity.L.AbstractMachines.AbstractHeapMachine]
H:77 [in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
H:78 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
h:79 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
H:798 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
H:8 [in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
H:8 [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
H:8 [in Undecidability.Shared.FinTypeEquiv]
H:80 [in Undecidability.TM.L.HeapInterpreter.StepTM]
H:81 [in Complexity.Libs.CookPrelim.PolyBounds]
H:81 [in Undecidability.L.Computability.Synthetic]
H:82 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
H:83 [in Complexity.NP.SAT.SAT_inNP]
H:84 [in Undecidability.L.Complexity.UpToC]
H:85 [in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
H:85 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
H:85 [in Undecidability.TM.L.HeapInterpreter.StepTM]
H:86 [in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
H:87 [in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
h:87 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
H:88 [in Complexity.Complexity.Definitions]
H:88 [in Complexity.Complexity.PolyTimeComputable]
H:883 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
H:89 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
H:89 [in Complexity.L.TM.TMflatComp]
H:9 [in Undecidability.L.Datatypes.LSum]
H:9 [in Complexity.L.AbstractMachines.Computable.Unfolding]
H:9 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
H:9 [in Complexity.Complexity.Subtypes]
H:9 [in Undecidability.L.Datatypes.LVector]
H:9 [in Undecidability.L.Datatypes.List.List_nat]
H:9 [in Undecidability.L.Functions.EqBool]
H:9 [in Complexity.L.AbstractMachines.AbstractHeapMachine]
H:9 [in Undecidability.L.TM.TMEncoding]
H:9 [in Undecidability.L.Computability.Synthetic]
H:9 [in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
H:90 [in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
H:91 [in Complexity.L.TM.CompCode]
H:91 [in Undecidability.L.Computability.Synthetic]
H:91 [in Complexity.Complexity.Definitions]
H:92 [in Undecidability.L.Datatypes.LVector]
H:93 [in Complexity.L.ComparisonTimeBoundDerivation]
H:93 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
H:93 [in Complexity.L.AbstractMachines.AbstractHeapMachine]
H:93 [in Undecidability.L.Computability.Synthetic]
H:94 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
H:94 [in Complexity.L.TM.CompCode]
H:94 [in Complexity.Libs.CookPrelim.PolyBounds]
H:94 [in Complexity.Complexity.UpToCPoly]
H:94 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
H:94 [in Complexity.Complexity.Definitions]
H:94 [in Complexity.Complexity.PolyTimeComputable]
h:94 [in Complexity.Libs.CookPrelim.MorePrelim]
H:95 [in Undecidability.L.Datatypes.LVector]
H:95 [in Undecidability.TM.L.HeapInterpreter.StepTM]
H:96 [in Complexity.L.AbstractMachines.AbstractHeapMachine]
H:96 [in Undecidability.L.Computability.Synthetic]
H:968 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
H:97 [in Complexity.L.ComparisonTimeBoundDerivation]
H:97 [in Complexity.Complexity.Definitions]
h:97 [in Complexity.Libs.CookPrelim.MorePrelim]
H:979 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
H:98 [in Complexity.Complexity.UpToCPoly]
H:98 [in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
H:99 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
H:99 [in Complexity.L.TM.TMflatComp]

I

iconf:124 [in Undecidability.TM.Combinators.StateWhile]
iconf:319 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
iconf:325 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
iconf:59 [in Undecidability.TM.Lifting.LiftAlphabet]
If:30 [in Undecidability.L.Computability.Decidability]
IHApp:34 [in Undecidability.L.Tactics.LClos]
IHApp:50 [in Undecidability.L.Tactics.Reflection]
IHApp:54 [in Undecidability.L.Tactics.LClos]
IHApp:70 [in Undecidability.L.Tactics.Reflection]
IHClos:37 [in Undecidability.L.Tactics.LClos]
IHClos:53 [in Undecidability.L.Tactics.Reflection]
IHClos:58 [in Undecidability.L.Tactics.LClos]
IHClos:74 [in Undecidability.L.Tactics.Reflection]
IHCons:41 [in Undecidability.L.Tactics.LClos]
IHCons:57 [in Undecidability.L.Tactics.Reflection]
IHNil:38 [in Undecidability.L.Tactics.LClos]
IHNil:54 [in Undecidability.L.Tactics.Reflection]
IHn:4 [in Undecidability.Shared.Libs.PSL.FiniteTypes.Arbitrary]
IHVar:31 [in Undecidability.L.Tactics.LClos]
IHVar:47 [in Undecidability.L.Tactics.Reflection]
IHVar:51 [in Undecidability.L.Tactics.LClos]
IHVar:67 [in Undecidability.L.Tactics.Reflection]
ii:174 [in Undecidability.Shared.Libs.DLW.Code.sss]
ii:194 [in Undecidability.Shared.Libs.DLW.Code.sss]
ii:197 [in Undecidability.Shared.Libs.DLW.Code.sss]
ii:204 [in Undecidability.Shared.Libs.DLW.Code.sss]
ii:32 [in Undecidability.Shared.Libs.DLW.Code.sss]
indcards:229 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
index__comp:5 [in Complexity.NP.SAT.CookLevin]
index':27 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
index1:51 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
index2:52 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
index:22 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
index:26 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
index:47 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
ind:43 [in Undecidability.L.Tactics.Extract]
ind:49 [in Undecidability.L.Tactics.Extract]
inF:313 [in Undecidability.TM.Hoare.HoareCombinators]
inF:324 [in Undecidability.TM.Hoare.HoareCombinators]
inF:365 [in Undecidability.TM.Hoare.HoareCombinators]
inF:382 [in Undecidability.TM.Hoare.HoareCombinators]
inF:427 [in Undecidability.TM.Hoare.HoareCombinators]
inF:446 [in Undecidability.TM.Hoare.HoareCombinators]
inhX:356 [in Undecidability.TM.Hoare.HoareLogic]
inh_A:14 [in Undecidability.Shared.Libs.PSL.Inhabited]
inh_B:9 [in Undecidability.Shared.Libs.PSL.Inhabited]
inh_a:6 [in Undecidability.Shared.Libs.PSL.Inhabited]
init__R:26 [in Complexity.TM.Single.EncodeTapesInvariants]
init:115 [in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
init:117 [in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
init:121 [in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
init:122 [in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
init:50 [in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
init:53 [in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
init:58 [in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
init:60 [in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
init:64 [in Undecidability.TM.Lifting.LiftTapes]
init:76 [in Undecidability.TM.Lifting.LiftTapes]
init:81 [in Undecidability.TM.Lifting.LiftTapes]
input:309 [in Undecidability.TM.Util.TM_facts]
input:50 [in Complexity.NP.SAT.SAT_inNP]
inp:7 [in Complexity.NP.SAT.CookLevin.Subproblems.SingleTMGenNP]
inst:37 [in Undecidability.L.Tactics.Lrewrite]
inst:44 [in Undecidability.L.Tactics.Lrewrite]
intX:2 [in Undecidability.L.Datatypes.List.List_basics]
intX:2 [in Undecidability.L.Datatypes.LOptions]
intX:2 [in Undecidability.L.Datatypes.List.List_eqb]
intX:2 [in Undecidability.L.Datatypes.List.List_enc]
intX:207 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
intX:21 [in Undecidability.L.Datatypes.List.List_nat]
intX:224 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
intX:3 [in Undecidability.L.Datatypes.LProd]
intX:328 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
intX:37 [in Undecidability.L.Datatypes.List.List_basics]
intX:91 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
intY:4 [in Undecidability.L.Datatypes.LProd]
INV:433 [in Undecidability.TM.Hoare.HoareCombinators]
isBorder:55 [in Complexity.NP.TM.M_multi2mono]
iterT:40 [in Undecidability.L.Functions.UnboundIteration]
iterT:46 [in Undecidability.L.Functions.UnboundIteration]
i':14 [in Undecidability.Shared.Libs.PSL.Vectors.Fin]
i':15 [in Undecidability.Shared.Libs.PSL.Vectors.Fin]
i':190 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
i':200 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
i':209 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
i':27 [in Undecidability.Shared.Libs.PSL.Vectors.Fin]
i':3 [in Undecidability.Shared.Libs.PSL.Vectors.Fin]
i':31 [in Complexity.L.AbstractMachines.Computable.EvalForTime]
i':31 [in Undecidability.Shared.Libs.PSL.Vectors.Fin]
i':35 [in Complexity.L.AbstractMachines.Computable.EvalForTime]
i':35 [in Undecidability.Shared.Libs.PSL.Vectors.Fin]
i':39 [in Undecidability.Shared.Libs.PSL.Vectors.Fin]
i':50 [in Undecidability.L.Tactics.Lrewrite]
i':58 [in Complexity.L.AbstractMachines.Computable.EvalForTime]
i':59 [in Complexity.L.AbstractMachines.Computable.EvalForTime]
i':63 [in Undecidability.TM.Single.StepTM]
i':66 [in Undecidability.TM.Single.StepTM]
i':77 [in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
i1:15 [in Undecidability.TM.Combinators.SequentialComposition]
i1:18 [in Undecidability.Shared.Libs.PSL.Vectors.Fin]
i1:19 [in Undecidability.TM.Combinators.If]
i1:22 [in Undecidability.Shared.Libs.PSL.Vectors.Fin]
i1:24 [in Undecidability.TM.Combinators.SequentialComposition]
i1:25 [in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
i1:26 [in Undecidability.Shared.Libs.DLW.Utils.interval]
i1:30 [in Undecidability.TM.Combinators.If]
I1:339 [in Undecidability.TM.Code.Copy]
I1:351 [in Undecidability.TM.Code.Copy]
I1:362 [in Undecidability.TM.Code.Copy]
i1:37 [in Undecidability.Shared.Libs.DLW.Utils.interval]
I1:374 [in Undecidability.TM.Code.Copy]
i1:38 [in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
I1:382 [in Undecidability.TM.Code.Copy]
i1:386 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
I1:390 [in Undecidability.TM.Code.Copy]
I1:397 [in Undecidability.TM.Code.Copy]
I1:405 [in Undecidability.TM.Code.Copy]
i1:43 [in Undecidability.TM.Single.StepTM]
i1:51 [in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
I1:52 [in Undecidability.TM.Hoare.HoareExamples]
i1:54 [in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
i1:59 [in Undecidability.TM.Combinators.Switch]
i1:63 [in Undecidability.Shared.Libs.DLW.Utils.sums]
I1:64 [in Undecidability.TM.Hoare.HoareExamples]
i1:66 [in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
i1:69 [in Undecidability.TM.Combinators.Switch]
i1:72 [in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
I1:75 [in Undecidability.TM.Hoare.HoareExamples]
i1:77 [in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
i1:81 [in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
i1:85 [in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
i1:91 [in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
i2:16 [in Undecidability.TM.Combinators.SequentialComposition]
i2:19 [in Undecidability.Shared.Libs.PSL.Vectors.Fin]
i2:20 [in Undecidability.TM.Combinators.If]
i2:23 [in Undecidability.Shared.Libs.PSL.Vectors.Fin]
i2:27 [in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
i2:27 [in Undecidability.TM.Combinators.SequentialComposition]
i2:28 [in Undecidability.Shared.Libs.DLW.Utils.interval]
i2:34 [in Undecidability.TM.Combinators.If]
I2:340 [in Undecidability.TM.Code.Copy]
I2:352 [in Undecidability.TM.Code.Copy]
I2:363 [in Undecidability.TM.Code.Copy]
I2:375 [in Undecidability.TM.Code.Copy]
I2:383 [in Undecidability.TM.Code.Copy]
i2:388 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
i2:39 [in Undecidability.Shared.Libs.DLW.Utils.interval]
I2:391 [in Undecidability.TM.Code.Copy]
I2:398 [in Undecidability.TM.Code.Copy]
i2:40 [in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
I2:406 [in Undecidability.TM.Code.Copy]
i2:44 [in Undecidability.TM.Single.StepTM]
I2:53 [in Undecidability.TM.Hoare.HoareExamples]
i2:58 [in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
i2:60 [in Undecidability.TM.Combinators.Switch]
i2:65 [in Undecidability.Shared.Libs.DLW.Utils.sums]
I2:65 [in Undecidability.TM.Hoare.HoareExamples]
i2:68 [in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
i2:72 [in Undecidability.TM.Combinators.Switch]
I2:76 [in Undecidability.TM.Hoare.HoareExamples]
i2:79 [in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
i2:83 [in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
i2:88 [in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
i2:96 [in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
i3:33 [in Undecidability.TM.Combinators.If]
i:1 [in Undecidability.TM.Compound.TMTac]
i:1 [in Undecidability.Shared.Libs.DLW.Utils.interval]
i:10 [in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
i:10 [in Complexity.L.Functions.IterupN]
i:10 [in Undecidability.Shared.Libs.DLW.Utils.sorting]
i:10 [in Complexity.NP.SAT.CookLevin.Subproblems.SingleTMGenNP]
i:10 [in Undecidability.L.Tactics.Lbeta]
i:100 [in Complexity.Libs.CookPrelim.MorePrelim]
i:101 [in Undecidability.Shared.Libs.DLW.Utils.sorting]
i:101 [in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
i:103 [in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
i:104 [in Undecidability.TM.Single.StepTM]
i:104 [in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
i:105 [in Undecidability.Shared.Libs.DLW.Utils.sorting]
i:105 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
i:105 [in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
i:105 [in Complexity.Libs.CookPrelim.MorePrelim]
i:106 [in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
i:107 [in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
i:108 [in Undecidability.L.Tactics.LClos]
i:108 [in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
i:108 [in Complexity.NP.Clique.kSAT_to_Clique]
i:109 [in Undecidability.Shared.Libs.DLW.Utils.sorting]
i:109 [in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
i:11 [in Undecidability.TM.Single.StepTM]
i:11 [in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
i:11 [in Undecidability.Shared.Libs.PSL.Lists.Position]
i:110 [in Undecidability.L.Tactics.Extract]
i:111 [in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
i:113 [in Undecidability.Shared.Libs.DLW.Utils.sorting]
i:113 [in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
i:113 [in Undecidability.Shared.Libs.DLW.Vec.pos]
i:116 [in Undecidability.L.Tactics.ComputableTime]
i:117 [in Undecidability.TM.Hoare.HoareRegister]
i:118 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
i:118 [in Undecidability.TM.Code.CodeTM]
i:119 [in Undecidability.Shared.Libs.DLW.Utils.sorting]
i:12 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
i:12 [in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
i:12 [in Undecidability.Shared.Libs.DLW.Utils.interval]
i:12 [in Undecidability.Shared.Libs.DLW.Utils.sorting]
I:12 [in Undecidability.TM.Code.WriteValue]
i:12 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
i:120 [in Complexity.TM.PrettyBounds.M2MBounds]
i:120 [in Undecidability.Shared.Libs.DLW.Utils.sorting]
i:120 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
i:121 [in Undecidability.Shared.Libs.DLW.Utils.sorting]
I:122 [in Undecidability.TM.Code.CodeTM]
i:122 [in Undecidability.Shared.Libs.DLW.Utils.sorting]
i:123 [in Undecidability.TM.Code.NatTM]
i:123 [in Undecidability.TM.Util.Relations]
i:123 [in Undecidability.TM.Lifting.LiftTapes]
i:124 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
i:125 [in Undecidability.TM.Single.StepTM]
i:127 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
i:127 [in Undecidability.Shared.Libs.DLW.Utils.sorting]
i:127 [in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
i:127 [in Undecidability.TM.Lifting.LiftTapes]
i:128 [in Complexity.TM.PrettyBounds.M2MBounds]
i:128 [in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
i:129 [in Undecidability.TM.Single.StepTM]
i:129 [in Undecidability.TM.L.HeapInterpreter.StepTM]
I:13 [in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
i:13 [in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
i:13 [in Undecidability.Shared.Libs.PSL.Lists.Position]
i:13 [in Undecidability.Shared.Libs.PSL.Vectors.Fin]
i:13 [in Complexity.L.TM.TMunflatten]
i:130 [in Undecidability.L.Tactics.Extract]
i:130 [in Undecidability.TM.L.HeapInterpreter.StepTM]
i:133 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
i:133 [in Undecidability.TM.Code.NatTM]
i:133 [in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
i:135 [in Undecidability.TM.Single.StepTM]
i:135 [in Undecidability.Shared.Libs.DLW.Utils.sorting]
i:136 [in Complexity.TM.PrettyBounds.M2MBounds]
i:137 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
i:137 [in Undecidability.Shared.Libs.DLW.Vec.pos]
i:139 [in Undecidability.L.Tactics.Extract]
i:14 [in Undecidability.TM.Single.StepTM]
i:14 [in Undecidability.Shared.Libs.DLW.Code.compiler]
i:14 [in Complexity.NP.TM.M_LM2TM]
i:14 [in Complexity.Complexity.SpaceBoundsTime]
i:14 [in Undecidability.TM.Code.Code]
i:14 [in Undecidability.TM.Combinators.SequentialComposition]
i:140 [in Undecidability.TM.Single.StepTM]
i:140 [in Undecidability.TM.Code.NatTM]
i:142 [in Undecidability.Shared.Libs.DLW.Vec.pos]
i:143 [in Undecidability.L.Util.L_facts]
i:143 [in Undecidability.TM.Lifting.LiftTapes]
i:144 [in Undecidability.TM.Lifting.LiftTapes]
i:145 [in Undecidability.L.Util.L_facts]
i:145 [in Undecidability.L.Tactics.Extract]
i:145 [in Undecidability.Shared.Libs.DLW.Utils.sums]
i:145 [in Undecidability.TM.Lifting.LiftTapes]
i:147 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
i:148 [in Undecidability.TM.Lifting.LiftTapes]
i:15 [in Complexity.L.AbstractMachines.Computable.EvalForTime]
i:15 [in Complexity.L.Functions.IterupN]
i:15 [in Complexity.NP.Clique.Clique]
i:15 [in Complexity.Complexity.SpaceBoundsTime]
i:15 [in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
i:151 [in Complexity.TM.PrettyBounds.M2MBounds]
i:151 [in Undecidability.L.Util.L_facts]
i:153 [in Undecidability.TM.L.HeapInterpreter.StepTM]
i:154 [in Undecidability.TM.Lifting.LiftTapes]
i:156 [in Undecidability.Shared.Libs.DLW.Vec.vec]
i:156 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
i:156 [in Undecidability.Shared.Libs.DLW.Utils.sums]
i:156 [in Undecidability.Shared.Libs.DLW.Code.sss]
i:157 [in Undecidability.L.Util.L_facts]
i:159 [in Undecidability.Shared.Libs.DLW.Vec.vec]
i:159 [in Undecidability.TM.Lifting.LiftTapes]
i:16 [in Undecidability.TM.Single.StepTM]
i:16 [in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
i:16 [in Undecidability.Shared.FinTypeEquiv]
i:16 [in Undecidability.Shared.Libs.DLW.Utils.interval]
i:16 [in Undecidability.Shared.Libs.PSL.Vectors.VectorDupfree]
i:16 [in Undecidability.TM.Code.Code]
i:16 [in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
i:16 [in Undecidability.TM.L.CompilerBoolFuns.Compiler]
I:16 [in Undecidability.TM.Hoare.HoareExamples]
i:160 [in Complexity.TM.PrettyBounds.M2MBounds]
i:160 [in Undecidability.Shared.Libs.DLW.Utils.sums]
i:160 [in Undecidability.TM.Lifting.LiftTapes]
i:161 [in Undecidability.L.Util.L_facts]
i:163 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
i:164 [in Undecidability.Shared.Libs.DLW.Utils.sums]
i:164 [in Undecidability.TM.Lifting.LiftTapes]
i:165 [in Undecidability.Shared.Libs.DLW.Utils.sums]
i:165 [in Undecidability.TM.Lifting.LiftTapes]
i:166 [in Undecidability.Shared.Libs.DLW.Utils.sums]
i:166 [in Undecidability.TM.Lifting.LiftTapes]
i:167 [in Undecidability.Shared.Libs.DLW.Utils.sums]
i:167 [in Undecidability.TM.Lifting.LiftTapes]
i:168 [in Undecidability.Shared.Libs.DLW.Utils.sums]
i:168 [in Undecidability.TM.Lifting.LiftTapes]
i:169 [in Undecidability.Shared.Libs.DLW.Utils.sums]
i:169 [in Undecidability.TM.Lifting.LiftTapes]
I:17 [in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
i:17 [in Undecidability.L.Tactics.Lrewrite]
i:17 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
i:17 [in Undecidability.TM.Lifting.LiftTapes]
I:17 [in Complexity.TM.Single.DecodeTape]
i:17 [in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
i:17 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
i:17 [in Undecidability.Shared.Libs.DLW.Code.subcode]
i:170 [in Complexity.TM.PrettyBounds.M2MBounds]
i:170 [in Undecidability.L.Util.L_facts]
i:170 [in Undecidability.Shared.Libs.DLW.Utils.sums]
i:170 [in Undecidability.TM.Lifting.LiftTapes]
i:171 [in Undecidability.L.Util.L_facts]
i:171 [in Undecidability.TM.Lifting.LiftTapes]
i:171 [in Undecidability.Shared.Libs.DLW.Code.sss]
i:172 [in Undecidability.L.Util.L_facts]
i:173 [in Undecidability.L.Util.L_facts]
i:174 [in Undecidability.L.Util.L_facts]
i:174 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
i:174 [in Undecidability.TM.Lifting.LiftTapes]
i:175 [in Undecidability.TM.Lifting.LiftTapes]
i:176 [in Undecidability.TM.Univ.Univ]
i:177 [in Undecidability.TM.Univ.Univ]
i:179 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
i:18 [in Undecidability.TM.Single.StepTM]
i:18 [in Undecidability.Shared.Libs.DLW.Utils.interval]
i:18 [in Undecidability.TM.Combinators.If]
i:18 [in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
i:18 [in Undecidability.Shared.Libs.DLW.Code.sss]
i:181 [in Undecidability.TM.L.HeapInterpreter.StepTM]
i:186 [in Undecidability.L.Util.L_facts]
i:186 [in Undecidability.TM.Univ.Univ]
i:189 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
i:19 [in Complexity.L.AbstractMachines.Computable.UnivDecTime]
i:19 [in Undecidability.Shared.Libs.DLW.Code.compiler]
i:19 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
i:19 [in Undecidability.Shared.Libs.DLW.Code.subcode]
i:19 [in Undecidability.TM.L.CompilerBoolFuns.Compiler]
I:19 [in Complexity.NP.TM.LM_to_mTM]
i:19 [in Undecidability.L.Prelim.MoreList]
i:191 [in Undecidability.L.Util.L_facts]
i:193 [in Undecidability.TM.Hoare.HoareRegister]
i:194 [in Complexity.TM.PrettyBounds.M2MBounds]
i:196 [in Undecidability.L.Util.L_facts]
i:198 [in Complexity.TM.PrettyBounds.M2MBounds]
i:199 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
i:2 [in Undecidability.TM.Compound.TMTac]
i:2 [in Complexity.L.Functions.IterupN]
i:2 [in Undecidability.Shared.Libs.PSL.FiniteTypes.VectorFin]
i:2 [in Undecidability.Shared.Libs.PSL.Vectors.Fin]
i:20 [in Undecidability.TM.Single.StepTM]
i:20 [in Undecidability.Shared.FinTypeEquiv]
i:20 [in Undecidability.Shared.Libs.DLW.Utils.interval]
i:20 [in Complexity.L.Functions.IterupN]
I:20 [in Undecidability.TM.Code.WriteValue]
i:20 [in Complexity.NP.TM.M_LM2TM]
i:20 [in Complexity.NP.TM.M_multi2mono]
i:20 [in Undecidability.L.Prelim.MoreList]
i:202 [in Undecidability.L.Util.L_facts]
i:202 [in Undecidability.TM.Hoare.HoareRegister]
i:205 [in Complexity.TM.PrettyBounds.M2MBounds]
i:205 [in Undecidability.L.Tactics.Extract]
i:208 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
i:209 [in Undecidability.L.Tactics.Extract]
i:209 [in Undecidability.Shared.Libs.DLW.Utils.sums]
i:21 [in Undecidability.TM.Lifting.LiftAlphabet]
i:21 [in Undecidability.L.Prelim.MoreList]
i:210 [in Undecidability.TM.Hoare.HoareRegister]
i:212 [in Complexity.TM.PrettyBounds.M2MBounds]
i:213 [in Undecidability.Shared.Libs.DLW.Utils.sums]
i:215 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
i:215 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
i:216 [in Undecidability.L.Tactics.Extract]
i:216 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
i:216 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
i:217 [in Undecidability.Shared.Libs.DLW.Utils.sums]
i:218 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
i:22 [in Undecidability.L.Tactics.GenEncode]
i:22 [in Complexity.L.AbstractMachines.Computable.UnivDecTime]
i:22 [in Complexity.NP.TM.M_multi2mono]
I:22 [in Undecidability.TM.Hoare.HoareExamples]
i:22 [in Undecidability.L.Prelim.MoreList]
i:220 [in Complexity.TM.PrettyBounds.M2MBounds]
i:220 [in Undecidability.Shared.Libs.DLW.Utils.sums]
i:220 [in Undecidability.TM.Hoare.HoareRegister]
i:221 [in Undecidability.Shared.Libs.DLW.Utils.sums]
i:221 [in Undecidability.TM.L.HeapInterpreter.StepTM]
i:222 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
i:222 [in Undecidability.Shared.Libs.DLW.Utils.sums]
i:222 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
i:223 [in Undecidability.TM.L.HeapInterpreter.StepTM]
i:223 [in Undecidability.Shared.Libs.DLW.Code.sss]
i:224 [in Undecidability.TM.L.HeapInterpreter.StepTM]
I:224 [in Undecidability.TM.Code.Copy]
i:226 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
i:226 [in Undecidability.Shared.Libs.DLW.Utils.sums]
i:227 [in Complexity.TM.PrettyBounds.M2MBounds]
i:227 [in Undecidability.Shared.Libs.DLW.Utils.sums]
i:228 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
i:228 [in Undecidability.Shared.Libs.DLW.Utils.sums]
i:229 [in Undecidability.Shared.Libs.DLW.Utils.sums]
i:23 [in Undecidability.Shared.Libs.DLW.Utils.interval]
i:23 [in Undecidability.Shared.Libs.DLW.Code.compiler]
i:23 [in Undecidability.Shared.Libs.DLW.Utils.crt]
i:23 [in Complexity.NP.TM.M_multi2mono]
i:23 [in Undecidability.TM.Combinators.SequentialComposition]
i:23 [in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
i:23 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
i:230 [in Undecidability.Shared.Libs.DLW.Utils.sums]
i:231 [in Undecidability.Shared.Libs.DLW.Utils.sums]
I:231 [in Undecidability.TM.Code.Copy]
i:232 [in Undecidability.L.Tactics.Extract]
i:233 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
i:235 [in Complexity.TM.PrettyBounds.M2MBounds]
i:235 [in Undecidability.Shared.Libs.DLW.Utils.sums]
I:235 [in Undecidability.TM.Hoare.HoareRegister]
i:237 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
I:237 [in Undecidability.TM.Code.Copy]
i:238 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
i:238 [in Undecidability.Shared.Libs.DLW.Utils.sums]
i:239 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
I:24 [in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
i:24 [in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
i:24 [in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
i:24 [in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
i:24 [in Complexity.Libs.CookPrelim.MorePrelim]
i:240 [in Undecidability.Shared.Libs.DLW.Utils.sums]
i:241 [in Undecidability.Shared.Libs.DLW.Utils.sums]
i:242 [in Undecidability.Shared.Libs.DLW.Utils.sums]
i:244 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
i:244 [in Undecidability.Shared.Libs.DLW.Utils.sums]
I:244 [in Undecidability.TM.Code.Copy]
i:248 [in Undecidability.TM.L.HeapInterpreter.StepTM]
i:25 [in Undecidability.TM.L.CompilerBoolFuns.NaryApp]
i:25 [in Undecidability.L.Tactics.Lrewrite]
i:25 [in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
i:25 [in Undecidability.Shared.FinTypeEquiv]
i:25 [in Complexity.L.AbstractMachines.Computable.UnivDecTime]
i:25 [in Undecidability.TM.Lifting.LiftTapes]
i:25 [in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
i:25 [in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
i:25 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
i:250 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
I:250 [in Undecidability.TM.Code.Copy]
i:251 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
I:251 [in Undecidability.TM.Hoare.HoareRegister]
I:257 [in Undecidability.TM.Code.Copy]
i:26 [in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
i:26 [in Undecidability.Shared.Libs.DLW.Utils.crt]
i:26 [in Undecidability.Shared.Libs.PSL.Vectors.Fin]
i:26 [in Complexity.NP.TM.M_LM2TM]
i:26 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
i:26 [in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
i:263 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
I:263 [in Undecidability.TM.Hoare.HoareRegister]
I:263 [in Undecidability.TM.Code.Copy]
i:264 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
i:265 [in Undecidability.TM.Single.StepTM]
i:265 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
i:27 [in Undecidability.TM.Compound.TMTac]
i:27 [in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
i:27 [in Complexity.L.Functions.IterupN]
i:27 [in Undecidability.Shared.Libs.DLW.Code.compiler]
i:27 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
i:27 [in Complexity.NP.TM.M_LM2TM]
i:27 [in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
i:27 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
i:27 [in Undecidability.Shared.Libs.DLW.Code.sss]
I:270 [in Undecidability.TM.Code.Copy]
i:271 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
i:272 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
i:273 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
i:275 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
I:276 [in Undecidability.TM.Code.Copy]
i:277 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
I:278 [in Undecidability.TM.Hoare.HoareRegister]
i:279 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
i:28 [in Complexity.L.AbstractMachines.Computable.EvalForTime]
i:28 [in Undecidability.TM.Compound.TMTac]
i:28 [in Complexity.L.AbstractMachines.Computable.UnivDecTime]
i:28 [in Undecidability.TM.Hoare.HoareRegister]
i:28 [in Complexity.NP.TM.M_LM2TM]
i:28 [in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
I:283 [in Undecidability.TM.Code.Copy]
i:283 [in Undecidability.Shared.Libs.DLW.Code.sss]
i:285 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
i:2850 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
i:2854 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
i:286 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
i:2863 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
i:287 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
i:2874 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
i:2884 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
I:289 [in Undecidability.TM.Code.Copy]
i:2897 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
i:29 [in Undecidability.TM.Compound.TMTac]
i:29 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds_Loop]
i:29 [in Undecidability.TM.Combinators.If]
i:29 [in Complexity.NP.TM.M_LM2TM]
I:29 [in Undecidability.TM.Hoare.HoareExamples]
i:290 [in Undecidability.Shared.Libs.DLW.Code.sss]
I:291 [in Undecidability.TM.Hoare.HoareRegister]
I:296 [in Undecidability.TM.Code.Copy]
i:3 [in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
i:3 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
i:30 [in Undecidability.TM.L.CompilerBoolFuns.NaryApp]
i:30 [in Undecidability.Shared.Libs.PSL.Vectors.Fin]
i:30 [in Complexity.NP.TM.M_LM2TM]
i:30 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
I:302 [in Undecidability.TM.Code.Copy]
I:307 [in Undecidability.TM.Hoare.HoareRegister]
i:308 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
I:309 [in Undecidability.TM.Code.Copy]
i:31 [in Complexity.L.AbstractMachines.Computable.UnivDecTime]
i:31 [in Complexity.L.TM.TMunflatten]
i:31 [in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
i:313 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
I:314 [in Undecidability.TM.Hoare.HoareRegister]
i:315 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
I:315 [in Undecidability.TM.Code.Copy]
i:32 [in Undecidability.L.Prelim.LoopSum]
i:32 [in Complexity.L.Functions.IterupN]
i:32 [in Undecidability.Shared.Libs.DLW.Code.compiler]
i:32 [in Undecidability.Shared.Libs.DLW.Utils.sums]
i:320 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
i:321 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
I:321 [in Undecidability.TM.Hoare.HoareRegister]
I:322 [in Undecidability.TM.Code.Copy]
i:326 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
i:33 [in Undecidability.TM.Hoare.HoareRegister]
I:331 [in Undecidability.TM.Hoare.HoareRegister]
i:332 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
i:335 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
i:336 [in Undecidability.TM.Util.TM_facts]
i:339 [in Undecidability.TM.Hoare.HoareRegister]
i:34 [in Complexity.L.AbstractMachines.Computable.EvalForTime]
i:34 [in Undecidability.Shared.Libs.PSL.Vectors.Fin]
i:34 [in Undecidability.TM.Lifting.LiftTapes]
i:341 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
i:341 [in Undecidability.TM.Hoare.HoareRegister]
i:342 [in Undecidability.TM.Hoare.HoareRegister]
i:343 [in Undecidability.TM.Hoare.HoareRegister]
i:347 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
I:349 [in Undecidability.TM.Hoare.HoareRegister]
i:35 [in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
i:35 [in Undecidability.Shared.Libs.PSL.Lists.Position]
i:35 [in Undecidability.Shared.Libs.DLW.Utils.sorting]
I:35 [in Undecidability.TM.Hoare.HoareExamples]
i:352 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
i:355 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
I:356 [in Undecidability.TM.Hoare.HoareRegister]
I:36 [in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
i:36 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds_Loop]
i:36 [in Undecidability.Shared.Libs.DLW.Code.compiler]
i:36 [in Complexity.L.TM.TMunflatten]
i:36 [in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
i:36 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
i:362 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
i:366 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
I:367 [in Undecidability.TM.Hoare.HoareRegister]
i:37 [in Undecidability.L.Tactics.Extract]
i:37 [in Undecidability.L.Tactics.GenEncode]
i:37 [in Undecidability.Shared.Libs.DLW.Utils.sorting]
i:37 [in Undecidability.TM.Hoare.HoareRegister]
i:37 [in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
i:37 [in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
i:37 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
i:37 [in Undecidability.Shared.Libs.DLW.Code.subcode]
i:370 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
i:372 [in Undecidability.Shared.Libs.DLW.Vec.vec]
i:377 [in Undecidability.Shared.Libs.DLW.Vec.vec]
i:377 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
i:379 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
i:38 [in Undecidability.Shared.Libs.PSL.Vectors.Fin]
i:38 [in Undecidability.Shared.Libs.DLW.Utils.sums]
i:38 [in Complexity.L.TM.TMunflatten]
i:38 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
I:38 [in Undecidability.TM.Lifting.LiftTapes]
i:38 [in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
i:38 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
i:381 [in Undecidability.Shared.Libs.DLW.Vec.vec]
I:381 [in Undecidability.TM.Hoare.HoareRegister]
i:383 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
i:385 [in Undecidability.Shared.Libs.DLW.Vec.vec]
i:39 [in Undecidability.Shared.Libs.PSL.Lists.Position]
i:39 [in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
i:39 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
i:391 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
i:392 [in Undecidability.Shared.Libs.DLW.Vec.vec]
i:392 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
i:393 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
i:396 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
I:396 [in Undecidability.TM.Hoare.HoareRegister]
i:398 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
i:399 [in Undecidability.Shared.Libs.DLW.Vec.vec]
i:4 [in Complexity.L.AbstractMachines.Computable.EvalForTime]
i:4 [in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
i:4 [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
i:4 [in Undecidability.Shared.embed_nat]
i:4 [in Complexity.Complexity.SpaceBoundsTime]
I:4 [in Undecidability.TM.Lifting.LiftTapes]
i:4 [in Undecidability.Shared.Libs.DLW.Code.sss]
i:40 [in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
i:40 [in Undecidability.Shared.Libs.DLW.Code.subcode]
i:400 [in Undecidability.TM.Single.StepTM]
i:404 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
i:406 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
i:408 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
i:41 [in Undecidability.TM.Single.StepTM]
i:41 [in Undecidability.TM.Lifting.LiftTapes]
i:41 [in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
i:411 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
i:412 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
i:413 [in Undecidability.TM.Single.StepTM]
I:414 [in Undecidability.TM.Hoare.HoareRegister]
i:415 [in Undecidability.TM.Single.StepTM]
i:416 [in Undecidability.TM.Single.StepTM]
i:417 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
i:418 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
i:419 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
i:42 [in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
i:42 [in Undecidability.TM.Code.NatTM]
i:42 [in Undecidability.Shared.Libs.DLW.Utils.sorting]
i:42 [in Undecidability.TM.Hoare.HoareRegister]
i:42 [in Undecidability.TM.Lifting.LiftTapes]
i:420 [in Undecidability.TM.Single.StepTM]
i:420 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
i:427 [in Undecidability.TM.Single.StepTM]
i:428 [in Undecidability.TM.Single.StepTM]
i:429 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
i:43 [in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
i:43 [in Undecidability.Shared.Libs.DLW.Utils.sums]
i:43 [in Undecidability.L.Functions.UnboundIteration]
i:43 [in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
i:43 [in Complexity.NP.SAT.CookLevin.Subproblems.CC]
i:430 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
i:431 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
i:432 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
i:434 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
i:436 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
i:437 [in Undecidability.TM.Single.StepTM]
i:437 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
i:438 [in Undecidability.TM.Single.StepTM]
i:439 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
i:44 [in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
i:44 [in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
i:44 [in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
i:441 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
i:442 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
i:443 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
i:444 [in Undecidability.TM.Single.StepTM]
i:444 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
I:449 [in Undecidability.TM.Hoare.HoareRegister]
i:45 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
i:45 [in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
i:450 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
i:451 [in Undecidability.TM.Single.StepTM]
i:451 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
i:453 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
i:454 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
I:455 [in Undecidability.TM.Hoare.HoareRegister]
i:456 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
i:458 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
i:459 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
i:46 [in Undecidability.TM.Single.StepTM]
i:46 [in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
i:46 [in Undecidability.Shared.Libs.DLW.Utils.sorting]
i:46 [in Complexity.NP.Clique.kSAT_to_Clique]
i:46 [in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
i:460 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
i:461 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
i:463 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
i:468 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
i:469 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
i:47 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
i:47 [in Undecidability.Shared.Libs.DLW.Utils.sums]
i:47 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
i:47 [in Undecidability.TM.Hoare.HoareRegister]
i:470 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
i:471 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
i:473 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
i:48 [in Undecidability.TM.Util.VectorPrelim]
i:48 [in Undecidability.Shared.Libs.DLW.Utils.sums]
i:48 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
I:48 [in Undecidability.TM.Lifting.LiftTapes]
i:48 [in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
i:49 [in Undecidability.L.Tactics.Lrewrite]
i:49 [in Undecidability.Shared.Libs.DLW.Utils.sorting]
i:49 [in Undecidability.TM.Lifting.LiftTapes]
i:49 [in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
i:5 [in Undecidability.L.Tactics.Extract]
I:5 [in Complexity.TM.Code.DecodeList]
i:5 [in Undecidability.Shared.Libs.DLW.Utils.interval]
I:5 [in Undecidability.TM.Code.WriteValue]
I:5 [in Complexity.TM.Code.DecodeBool]
i:5 [in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
i:5 [in Undecidability.Shared.Libs.DLW.Code.subcode]
i:5 [in Undecidability.Shared.Libs.DLW.Vec.pos]
i:5 [in Undecidability.TM.Code.ProgrammingTools]
i:50 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
i:50 [in Undecidability.TM.Single.StepTM]
i:50 [in Undecidability.L.Tactics.Extract]
i:50 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
i:50 [in Undecidability.L.Functions.UnboundIteration]
i:50 [in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
i:50 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
i:52 [in Undecidability.TM.Util.VectorPrelim]
i:52 [in Undecidability.Shared.Libs.DLW.Utils.sums]
i:52 [in Complexity.NP.Clique.kSAT_to_Clique]
i:53 [in Complexity.L.AbstractMachines.Computable.EvalForTime]
i:53 [in Undecidability.TM.Single.StepTM]
I:53 [in Undecidability.TM.Lifting.LiftTapes]
i:54 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
i:54 [in Undecidability.Shared.Libs.PSL.Vectors.VectorDupfree]
i:54 [in Undecidability.TM.Lifting.LiftTapes]
i:54 [in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
i:54 [in Complexity.NP.SAT.CookLevin.Subproblems.CC]
i:55 [in Undecidability.L.Tactics.Lrewrite]
i:55 [in Undecidability.Shared.Libs.DLW.Utils.sums]
i:55 [in Complexity.NP.Clique.kSAT_to_Clique]
i:55 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
i:56 [in Undecidability.TM.Single.StepTM]
i:56 [in Undecidability.Shared.Libs.DLW.Utils.sorting]
i:57 [in Undecidability.Shared.Libs.DLW.Code.subcode]
i:58 [in Undecidability.TM.Combinators.Switch]
i:58 [in Undecidability.Shared.Libs.PSL.Vectors.VectorDupfree]
I:58 [in Undecidability.TM.Lifting.LiftTapes]
i:58 [in Undecidability.TM.L.CompilerBoolFuns.Compiler]
i:59 [in Undecidability.TM.Single.StepTM]
i:59 [in Undecidability.TM.Lifting.LiftTapes]
i:59 [in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
i:59 [in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
i:6 [in Undecidability.L.Tactics.Lrewrite]
i:6 [in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
i:6 [in Complexity.L.Functions.IterupN]
i:6 [in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
i:6 [in Undecidability.TM.Code.ProgrammingTools]
i:60 [in Undecidability.Shared.Libs.DLW.Utils.sums]
i:60 [in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
i:60 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
i:61 [in Undecidability.L.Tactics.Lrewrite]
I:61 [in Complexity.TM.Code.Decode]
i:61 [in Complexity.NP.TM.M_multi2mono]
i:61 [in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
i:62 [in Undecidability.TM.Single.StepTM]
i:62 [in Undecidability.Shared.Libs.DLW.Utils.sorting]
i:62 [in Undecidability.Shared.Libs.DLW.Utils.sums]
i:62 [in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
i:62 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
i:63 [in Undecidability.Shared.Libs.DLW.Utils.sorting]
I:63 [in Undecidability.TM.Lifting.LiftTapes]
i:63 [in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
i:63 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
i:63 [in Undecidability.Shared.Libs.DLW.Code.subcode]
i:64 [in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
i:64 [in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
I:64 [in Undecidability.Shared.Libs.DLW.Code.subcode]
i:65 [in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
i:65 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
i:65 [in Undecidability.TM.Single.StepTM]
i:66 [in Undecidability.TM.L.HeapInterpreter.StepTM]
i:66 [in Undecidability.TM.Lifting.LiftTapes]
i:66 [in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
i:66 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
i:67 [in Undecidability.Shared.Libs.DLW.Utils.sorting]
i:67 [in Undecidability.TM.L.HeapInterpreter.StepTM]
i:67 [in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
i:67 [in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
i:68 [in Undecidability.TM.Single.StepTM]
i:68 [in Undecidability.TM.Combinators.Switch]
i:68 [in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
i:68 [in Undecidability.Shared.Libs.DLW.Code.subcode]
i:69 [in Undecidability.Shared.Libs.DLW.Utils.sums]
i:69 [in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
i:69 [in Complexity.NP.Clique.kSAT_to_Clique]
i:69 [in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
I:69 [in Undecidability.Shared.Libs.DLW.Code.subcode]
i:7 [in Undecidability.L.Tactics.GenEncode]
i:7 [in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
i:7 [in Undecidability.Shared.Libs.DLW.Code.subcode]
i:7 [in Undecidability.TM.L.CompilerBoolFuns.Compiler]
i:70 [in Undecidability.TM.Single.StepTM]
i:70 [in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
i:71 [in Undecidability.Shared.Libs.DLW.Utils.sorting]
i:71 [in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
i:71 [in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
i:71 [in Undecidability.Shared.Libs.DLW.Code.subcode]
i:72 [in Undecidability.Shared.Libs.DLW.Utils.sums]
i:72 [in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
i:72 [in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
i:72 [in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
i:73 [in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
i:73 [in Undecidability.L.Tactics.GenEncode]
i:73 [in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
i:74 [in Undecidability.TM.Single.StepTM]
i:74 [in Undecidability.L.Tactics.Extract]
i:74 [in Undecidability.Shared.Libs.DLW.Utils.sorting]
i:74 [in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
I:75 [in Undecidability.TM.Lifting.LiftTapes]
i:76 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
i:76 [in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
i:76 [in Undecidability.Shared.Libs.DLW.Code.subcode]
i:77 [in Undecidability.TM.Single.StepTM]
i:77 [in Undecidability.Shared.Libs.DLW.Utils.sorting]
i:78 [in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
i:78 [in Undecidability.L.Tactics.LClos]
i:78 [in Undecidability.TM.Lifting.LiftTapes]
i:78 [in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
i:79 [in Undecidability.TM.Single.StepTM]
i:79 [in Undecidability.TM.L.HeapInterpreter.StepTM]
i:8 [in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
i:8 [in Undecidability.Shared.Libs.PSL.Vectors.Fin]
i:8 [in Complexity.L.TM.TMunflatten]
I:8 [in Complexity.TM.Single.DecodeTapes]
i:80 [in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
i:80 [in Undecidability.Shared.Libs.DLW.Utils.sorting]
I:80 [in Undecidability.TM.Lifting.LiftTapes]
i:80 [in Undecidability.Shared.Libs.DLW.Code.subcode]
i:80 [in Complexity.Libs.CookPrelim.MorePrelim]
i:81 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
i:81 [in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
i:81 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
i:83 [in Undecidability.TM.Lifting.LiftTapes]
i:83 [in Complexity.Libs.CookPrelim.MorePrelim]
i:84 [in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
i:84 [in Undecidability.Shared.Libs.DLW.Utils.sorting]
I:84 [in Undecidability.TM.Lifting.LiftTapes]
i:84 [in Undecidability.Shared.Libs.DLW.Code.subcode]
i:85 [in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
I:85 [in Undecidability.Shared.Libs.DLW.Code.subcode]
I:87 [in Undecidability.TM.Lifting.LiftTapes]
i:88 [in Complexity.Libs.CookPrelim.MorePrelim]
i:9 [in Undecidability.TM.Single.StepTM]
i:9 [in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
i:9 [in Undecidability.Shared.FinTypeEquiv]
i:9 [in Undecidability.Shared.Libs.DLW.Utils.interval]
i:9 [in Undecidability.L.Complexity.ResourceMeasures]
i:9 [in Undecidability.Shared.Libs.DLW.Utils.binomial]
I:9 [in Undecidability.TM.Lifting.LiftTapes]
i:9 [in Undecidability.Shared.Libs.DLW.Code.subcode]
I:9 [in Undecidability.TM.Hoare.HoareExamples]
i:9 [in Undecidability.Shared.Libs.DLW.Code.sss]
i:90 [in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
i:90 [in Undecidability.TM.Lifting.LiftTapes]
i:91 [in Undecidability.Shared.Libs.DLW.Utils.sorting]
i:92 [in Complexity.NP.Clique.kSAT_to_Clique]
i:92 [in Complexity.NP.SAT.CookLevin.Subproblems.CC]
i:93 [in Undecidability.Shared.Libs.DLW.Utils.sorting]
i:93 [in Complexity.Libs.CookPrelim.MorePrelim]
i:94 [in Complexity.NP.Clique.kSAT_to_Clique]
i:95 [in Undecidability.L.Complexity.ResourceMeasures]
i:95 [in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
i:96 [in Complexity.NP.Clique.kSAT_to_Clique]
i:96 [in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
i:96 [in Complexity.Libs.CookPrelim.MorePrelim]
i:97 [in Undecidability.Shared.Libs.DLW.Utils.sums]
i:98 [in Undecidability.Shared.Libs.DLW.Utils.sums]
i:99 [in Undecidability.L.Tactics.Extract]
i:99 [in Complexity.NP.Clique.kSAT_to_Clique]

J

j':2763 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
j1:387 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
j1:64 [in Undecidability.Shared.Libs.DLW.Utils.sums]
j1:78 [in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
j1:82 [in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
j2:389 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
j2:66 [in Undecidability.Shared.Libs.DLW.Utils.sums]
j2:80 [in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
j2:84 [in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
j2:94 [in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
j:10 [in Undecidability.Shared.Libs.DLW.Utils.interval]
j:10 [in Undecidability.L.Complexity.ResourceMeasures]
j:100 [in Complexity.NP.SAT.CookLevin.Subproblems.CC]
j:101 [in Complexity.NP.SAT.CookLevin.Subproblems.CC]
j:102 [in Undecidability.Shared.Libs.DLW.Utils.sorting]
j:102 [in Complexity.NP.SAT.CookLevin.Subproblems.CC]
j:103 [in Complexity.NP.SAT.CookLevin.Subproblems.CC]
j:104 [in Complexity.NP.SAT.CookLevin.Subproblems.CC]
j:106 [in Complexity.Libs.CookPrelim.MorePrelim]
j:109 [in Undecidability.L.Tactics.LClos]
j:11 [in Undecidability.L.Tactics.Lbeta]
j:110 [in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
j:112 [in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
j:127 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
j:13 [in Undecidability.Shared.Libs.DLW.Utils.interval]
j:13 [in Undecidability.Shared.Libs.DLW.Utils.sorting]
j:136 [in Undecidability.Shared.Libs.DLW.Utils.sorting]
j:144 [in Undecidability.L.Util.L_facts]
j:16 [in Undecidability.Shared.Libs.DLW.Code.compiler]
j:18 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
j:187 [in Undecidability.L.Util.L_facts]
j:19 [in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
j:191 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
j:192 [in Undecidability.L.Util.L_facts]
j:197 [in Undecidability.L.Util.L_facts]
j:20 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
j:203 [in Undecidability.L.Util.L_facts]
j:21 [in Undecidability.Shared.Libs.DLW.Utils.interval]
j:21 [in Undecidability.Shared.Libs.DLW.Utils.sorting]
j:216 [in Undecidability.L.Util.L_facts]
j:217 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
j:22 [in Undecidability.Shared.Libs.DLW.Code.compiler]
j:22 [in Undecidability.Shared.Libs.DLW.Utils.sorting]
j:221 [in Undecidability.L.Util.L_facts]
j:23 [in Undecidability.Shared.Libs.DLW.Utils.sorting]
j:24 [in Undecidability.Shared.Libs.DLW.Utils.interval]
j:24 [in Undecidability.Shared.Libs.DLW.Utils.crt]
j:24 [in Undecidability.Shared.Libs.DLW.Utils.sorting]
j:24 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
j:245 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
j:25 [in Undecidability.Shared.Libs.DLW.Code.compiler]
j:25 [in Undecidability.Shared.Libs.DLW.Utils.sorting]
j:25 [in Complexity.Libs.CookPrelim.MorePrelim]
j:252 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
j:26 [in Undecidability.Shared.Libs.DLW.Utils.sorting]
j:266 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
j:2671 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
j:2672 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
j:27 [in Undecidability.Shared.Libs.DLW.Utils.crt]
j:27 [in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
j:2760 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
j:28 [in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
j:2849 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
j:2853 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
j:2862 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
j:2873 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
j:2883 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
j:2896 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
j:29 [in Undecidability.Shared.Libs.DLW.Code.compiler]
j:29 [in Undecidability.Shared.Libs.DLW.Utils.sorting]
j:29 [in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
j:30 [in Undecidability.Shared.Libs.DLW.Utils.sorting]
j:30 [in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
j:31 [in Undecidability.Shared.Libs.DLW.Utils.sorting]
j:31 [in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
j:314 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
j:32 [in Undecidability.Shared.Libs.DLW.Utils.sorting]
j:322 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
j:336 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
j:342 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
j:35 [in Undecidability.Shared.Libs.DLW.Code.compiler]
j:352 [in Undecidability.TM.Hoare.HoareRegister]
j:353 [in Undecidability.TM.Hoare.HoareRegister]
j:36 [in Undecidability.Shared.Libs.DLW.Utils.sorting]
j:367 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
j:371 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
j:378 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
j:38 [in Undecidability.Shared.Libs.DLW.Code.compiler]
j:384 [in Undecidability.Shared.Libs.DLW.Vec.vec]
j:384 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
j:397 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
j:399 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
j:4 [in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
j:40 [in Undecidability.Shared.Libs.DLW.Utils.sorting]
j:409 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
j:42 [in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
j:421 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
j:43 [in Undecidability.Shared.Libs.DLW.Code.compiler]
j:43 [in Undecidability.Shared.Libs.DLW.Utils.sorting]
j:433 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
j:435 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
j:452 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
j:46 [in Undecidability.Shared.Libs.DLW.Code.compiler]
j:472 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
j:474 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
j:49 [in Undecidability.Shared.Libs.DLW.Code.compiler]
j:49 [in Undecidability.Shared.Libs.DLW.Utils.sums]
j:5 [in Undecidability.L.Tactics.LClos_Eval]
j:50 [in Undecidability.Shared.Libs.DLW.Code.compiler]
j:50 [in Undecidability.Shared.Libs.DLW.Utils.sorting]
j:50 [in Undecidability.TM.Lifting.LiftTapes]
j:55 [in Undecidability.Shared.Libs.DLW.Code.compiler]
j:55 [in Undecidability.TM.Lifting.LiftTapes]
j:56 [in Undecidability.L.Tactics.Lrewrite]
j:56 [in Undecidability.Shared.Libs.DLW.Code.compiler]
j:56 [in Undecidability.Shared.Libs.DLW.Utils.sums]
j:57 [in Undecidability.Shared.Libs.DLW.Utils.sorting]
j:59 [in Undecidability.Shared.Libs.PSL.Vectors.VectorDupfree]
j:60 [in Undecidability.Shared.Libs.DLW.Code.subcode]
j:61 [in Undecidability.Shared.Libs.DLW.Utils.sums]
j:62 [in Undecidability.L.Tactics.Lrewrite]
j:64 [in Undecidability.Shared.Libs.DLW.Utils.sorting]
j:65 [in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
j:65 [in Undecidability.Shared.Libs.DLW.Code.subcode]
J:66 [in Undecidability.Shared.Libs.DLW.Code.subcode]
j:7 [in Undecidability.L.Tactics.Lrewrite]
j:70 [in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
j:72 [in Undecidability.Shared.Libs.DLW.Code.subcode]
j:73 [in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
j:75 [in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
j:77 [in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
j:77 [in Undecidability.Shared.Libs.DLW.Code.subcode]
j:79 [in Undecidability.L.Tactics.LClos]
j:79 [in Undecidability.TM.Lifting.LiftTapes]
j:81 [in Undecidability.Shared.Libs.DLW.Code.subcode]
j:81 [in Complexity.Libs.CookPrelim.MorePrelim]
j:92 [in Undecidability.Shared.Libs.DLW.Utils.sorting]
j:94 [in Complexity.NP.SAT.CookLevin.Subproblems.CC]
j:96 [in Undecidability.L.Complexity.ResourceMeasures]
j:96 [in Undecidability.Shared.Libs.DLW.Utils.sorting]
j:97 [in Undecidability.Shared.Libs.DLW.Utils.sorting]
j:97 [in Complexity.NP.SAT.CookLevin.Subproblems.CC]
j:98 [in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
j:98 [in Undecidability.L.Tactics.Reflection]
j:98 [in Complexity.NP.SAT.CookLevin.Subproblems.CC]
j:99 [in Undecidability.Shared.Libs.DLW.Utils.sums]
j:99 [in Complexity.NP.SAT.CookLevin.Subproblems.CC]

K

key:137 [in Undecidability.TM.Univ.LowLevel]
kn:503 [in Undecidability.TM.Single.StepTM]
k_M:475 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
k_MU:472 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
k_M':431 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
k_M:430 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
k_M':421 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
k_M:387 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
k_M:381 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
k_M:315 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
k_Univ:270 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
k_M:266 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
k_M:258 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
k__steps:81 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
k__steps:53 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
k__sim:17 [in Complexity.NP.TM.M_multi2mono]
k__steps:97 [in Undecidability.TM.L.CompilerBoolFuns.Compiler]
k__LM:604 [in Complexity.NP.TM.LM_to_mTM]
k__LM:599 [in Complexity.NP.TM.LM_to_mTM]
k__LM:38 [in Complexity.NP.TM.LM_to_mTM]
k':104 [in Undecidability.TM.Hoare.HoareLogic]
k':11 [in Complexity.NP.L.LMGenNP]
k':1113 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
k':1120 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
k':117 [in Undecidability.TM.Univ.Univ]
k':124 [in Undecidability.TM.Univ.Univ]
k':128 [in Undecidability.TM.Univ.Univ]
k':132 [in Undecidability.L.Tactics.ComputableTime]
k':132 [in Undecidability.TM.Univ.Univ]
k':136 [in Undecidability.TM.Univ.Univ]
k':137 [in Undecidability.TM.Hoare.HoareLogic]
k':140 [in Undecidability.TM.Lifting.LiftTapes]
k':140 [in Undecidability.TM.Univ.Univ]
k':144 [in Undecidability.TM.Univ.Univ]
k':148 [in Undecidability.TM.Univ.Univ]
k':15 [in Complexity.L.AbstractMachines.Computable.HeapMachine]
k':152 [in Undecidability.TM.Univ.Univ]
k':156 [in Undecidability.TM.Univ.Univ]
k':16 [in Complexity.NP.TM.M_multi2mono]
k':160 [in Undecidability.TM.Univ.Univ]
k':165 [in Undecidability.L.Util.L_facts]
k':169 [in Undecidability.L.Util.L_facts]
k':17 [in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
k':18 [in Complexity.TM.Code.DecodeList]
k':18 [in Complexity.L.AbstractMachines.Computable.HeapMachine]
k':183 [in Undecidability.TM.Univ.Univ]
k':185 [in Undecidability.TM.Hoare.HoareRegister]
k':187 [in Undecidability.TM.Hoare.HoareRegister]
k':2 [in Complexity.NP.SAT.CookLevin.Subproblems.SingleTMGenNP]
k':214 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
k':215 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
k':218 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
k':219 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
k':23 [in Undecidability.TM.Combinators.While]
k':288 [in Undecidability.Shared.Libs.DLW.Code.sss]
k':303 [in Undecidability.TM.Util.TM_facts]
k':317 [in Undecidability.TM.Util.TM_facts]
k':323 [in Undecidability.TM.Util.TM_facts]
k':37 [in Undecidability.TM.Hoare.HoareLogic]
k':399 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
k':404 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
k':408 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
k':412 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
k':414 [in Undecidability.TM.Hoare.HoareCombinators]
k':417 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
k':422 [in Undecidability.TM.Hoare.HoareCombinators]
k':44 [in Undecidability.TM.L.CompilerBoolFuns.Compiler]
k':50 [in Undecidability.TM.Combinators.StateWhile]
k':50 [in Undecidability.TM.L.CompilerBoolFuns.Compiler]
k':517 [in Undecidability.TM.Single.StepTM]
k':53 [in Complexity.NP.TM.M_multi2mono]
k':56 [in Undecidability.TM.Util.VectorPrelim]
k':57 [in Undecidability.L.Functions.UnboundIteration]
k':6 [in Complexity.NP.SAT.CookLevin.Subproblems.SingleTMGenNP]
k':69 [in Undecidability.Shared.Libs.DLW.Code.sss]
k':7 [in Complexity.L.AbstractMachines.Computable.Lookup]
k':75 [in Undecidability.Shared.Libs.DLW.Code.sss]
k':79 [in Complexity.TM.Code.Decode]
k':801 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
k':803 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
k':806 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
k':809 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
k':812 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
k':816 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
k':819 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
k':822 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
k':826 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
k':835 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
k':839 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
k':843 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
k':847 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
k':85 [in Complexity.L.AbstractMachines.AbstractHeapMachine]
k':852 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
k':856 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
k':86 [in Complexity.L.AbstractMachines.AbstractHeapMachine]
k':866 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
k':874 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
k':879 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
k':947 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
k':951 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
k':956 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
k':961 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
k0:23 [in Undecidability.L.TM.TMinL]
k0:24 [in Undecidability.L.TM.TMinL]
k0:54 [in Undecidability.L.Functions.UnboundIteration]
k1:10 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
k1:10 [in Undecidability.TM.Util.Prelim]
k1:112 [in Undecidability.TM.Combinators.StateWhile]
k1:140 [in Undecidability.TM.Util.Relations]
k1:152 [in Undecidability.TM.Hoare.HoareCombinators]
k1:157 [in Undecidability.TM.Combinators.StateWhile]
k1:17 [in Undecidability.TM.Combinators.While]
k1:171 [in Undecidability.TM.Hoare.HoareCombinators]
k1:184 [in Undecidability.TM.Hoare.HoareCombinators]
k1:200 [in Complexity.Libs.CookPrelim.MorePrelim]
k1:205 [in Undecidability.L.Util.L_facts]
k1:205 [in Undecidability.TM.Hoare.HoareCombinators]
k1:206 [in Undecidability.TM.Hoare.HoareLogic]
k1:208 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
k1:214 [in Undecidability.Shared.Libs.DLW.Code.sss]
k1:218 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
k1:221 [in Undecidability.TM.Hoare.HoareCombinators]
k1:224 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
k1:229 [in Undecidability.TM.Hoare.HoareLogic]
k1:23 [in Undecidability.TM.Util.Prelim]
k1:239 [in Undecidability.TM.Hoare.HoareCombinators]
k1:252 [in Undecidability.TM.Hoare.HoareCombinators]
k1:274 [in Undecidability.TM.Hoare.HoareCombinators]
k1:28 [in Undecidability.TM.Combinators.While]
k1:287 [in Undecidability.TM.Hoare.HoareCombinators]
k1:30 [in Undecidability.TM.Combinators.SequentialComposition]
k1:303 [in Undecidability.TM.Hoare.HoareCombinators]
k1:33 [in Undecidability.TM.Combinators.While]
k1:34 [in Undecidability.TM.Combinators.Switch]
k1:39 [in Undecidability.TM.Combinators.If]
k1:46 [in Undecidability.TM.Combinators.Switch]
k1:51 [in Undecidability.TM.Combinators.While]
k1:51 [in Undecidability.TM.Util.Prelim]
k1:59 [in Undecidability.TM.Util.Prelim]
k1:6 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
k1:61 [in Undecidability.TM.Combinators.While]
k1:61 [in Undecidability.TM.Combinators.StateWhile]
k1:63 [in Undecidability.TM.Combinators.StateWhile]
k1:65 [in Complexity.Libs.CookPrelim.FlatFinTypes]
k1:76 [in Undecidability.TM.Combinators.Switch]
k1:79 [in Complexity.L.AbstractMachines.AbstractHeapMachine]
k1:90 [in Undecidability.TM.Combinators.While]
k1:91 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
k1:98 [in Undecidability.TM.Combinators.StateWhile]
k2':159 [in Undecidability.TM.Hoare.HoareCombinators]
k2':41 [in Undecidability.TM.Combinators.Switch]
k22':216 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
k22':217 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
k22':87 [in Complexity.L.AbstractMachines.AbstractHeapMachine]
k22':88 [in Complexity.L.AbstractMachines.AbstractHeapMachine]
k2:103 [in Undecidability.TM.Combinators.StateWhile]
k2:11 [in Undecidability.TM.Util.Prelim]
k2:117 [in Undecidability.TM.Combinators.StateWhile]
k2:13 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
k2:141 [in Undecidability.TM.Util.Relations]
k2:153 [in Undecidability.TM.Hoare.HoareCombinators]
k2:161 [in Undecidability.TM.Combinators.StateWhile]
k2:172 [in Undecidability.TM.Hoare.HoareCombinators]
k2:18 [in Undecidability.TM.Combinators.While]
k2:185 [in Undecidability.TM.Hoare.HoareCombinators]
k2:201 [in Complexity.Libs.CookPrelim.MorePrelim]
k2:206 [in Undecidability.L.Util.L_facts]
k2:206 [in Undecidability.TM.Hoare.HoareCombinators]
k2:207 [in Undecidability.TM.Hoare.HoareLogic]
k2:209 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
k2:215 [in Undecidability.Shared.Libs.DLW.Code.sss]
k2:219 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
k2:222 [in Undecidability.TM.Hoare.HoareCombinators]
k2:225 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
k2:230 [in Undecidability.TM.Hoare.HoareLogic]
k2:24 [in Undecidability.TM.Util.Prelim]
k2:240 [in Undecidability.TM.Hoare.HoareCombinators]
k2:253 [in Undecidability.TM.Hoare.HoareCombinators]
k2:275 [in Undecidability.TM.Hoare.HoareCombinators]
k2:288 [in Undecidability.TM.Hoare.HoareCombinators]
k2:29 [in Undecidability.TM.Combinators.While]
k2:31 [in Undecidability.TM.Combinators.SequentialComposition]
k2:35 [in Undecidability.TM.Combinators.Switch]
k2:38 [in Undecidability.TM.Combinators.Switch]
k2:40 [in Undecidability.TM.Combinators.If]
k2:48 [in Undecidability.TM.Combinators.Switch]
k2:52 [in Undecidability.TM.Util.Prelim]
k2:55 [in Undecidability.TM.Combinators.While]
k2:61 [in Undecidability.TM.Util.Prelim]
k2:62 [in Undecidability.TM.Combinators.StateWhile]
k2:63 [in Undecidability.TM.Combinators.While]
k2:64 [in Undecidability.TM.Combinators.StateWhile]
k2:66 [in Complexity.Libs.CookPrelim.FlatFinTypes]
k2:7 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
k2:77 [in Undecidability.TM.Combinators.Switch]
k2:80 [in Complexity.L.AbstractMachines.AbstractHeapMachine]
k2:92 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
k2:94 [in Undecidability.TM.Combinators.While]
k3:207 [in Undecidability.TM.Hoare.HoareCombinators]
k3:223 [in Undecidability.TM.Hoare.HoareCombinators]
k3:241 [in Undecidability.TM.Hoare.HoareCombinators]
k3:41 [in Undecidability.TM.Combinators.If]
k:1 [in Undecidability.TM.L.CompilerBoolFuns.NaryApp]
k:1 [in Undecidability.TM.L.CompilerBoolFuns.LComp_to_TMComp]
k:1 [in Complexity.NP.SAT.kSAT]
k:1 [in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
k:1 [in Undecidability.L.Functions.Proc]
k:1 [in Complexity.NP.SAT.kSAT_to_SAT]
k:10 [in Complexity.NP.SAT.CookLevin.Reductions.TCC_to_CC]
k:10 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
k:10 [in Complexity.Libs.CookPrelim.FlatFinTypes]
k:10 [in Undecidability.L.Datatypes.List.List_extra]
k:10 [in Undecidability.Shared.Libs.DLW.Utils.list_bool]
k:10 [in Complexity.NP.Clique.FlatClique]
k:10 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
k:10 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
k:10 [in Undecidability.TM.Hoare.HoareCombinators]
k:10 [in Complexity.Libs.CookPrelim.MorePrelim]
k:100 [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
k:100 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
k:100 [in Undecidability.L.Complexity.ResourceMeasures]
k:100 [in Undecidability.TM.Univ.LowLevel]
k:100 [in Undecidability.Shared.Libs.DLW.Code.sss]
k:100 [in Complexity.NP.Clique.kSAT_to_FlatClique]
k:101 [in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
k:101 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
k:102 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
k:102 [in Undecidability.TM.Univ.Univ]
k:1029 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
k:103 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
k:103 [in Undecidability.L.Tactics.Reflection]
k:1032 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
k:104 [in Undecidability.L.Util.L_facts]
k:104 [in Undecidability.L.Tactics.LClos_Eval]
k:104 [in Complexity.NP.Clique.kSAT_to_FlatClique]
k:1047 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
k:105 [in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
k:105 [in Undecidability.L.Util.L_facts]
k:105 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
k:105 [in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
k:105 [in Complexity.NP.SAT.CookLevin.Subproblems.CC]
k:1050 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
k:1052 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
k:1055 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
k:1057 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
k:106 [in Undecidability.L.Tactics.LClos_Eval]
k:106 [in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
k:106 [in Complexity.TM.Single.DecodeTape]
k:107 [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
k:108 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
k:108 [in Undecidability.L.Tactics.LClos_Eval]
k:108 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
k:108 [in Complexity.NP.Clique.kSAT_to_FlatClique]
k:109 [in Undecidability.TM.Code.Copy]
k:11 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_nat_facts]
k:11 [in Complexity.L.AbstractMachines.UnfoldHeap]
k:11 [in Undecidability.L.Complexity.ResourceMeasures]
k:11 [in Complexity.NP.Clique.Clique]
k:11 [in Complexity.NP.SAT.CookLevin.Subproblems.BinaryCC]
k:11 [in Complexity.L.AbstractMachines.AbstractHeapMachine]
k:11 [in Undecidability.TM.Lifting.LiftTapes]
k:110 [in Undecidability.L.Tactics.LClos]
k:110 [in Undecidability.TM.Hoare.HoareRegister]
k:110 [in Undecidability.TM.Univ.Univ]
k:111 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
k:111 [in Undecidability.L.Tactics.LClos_Eval]
k:111 [in Undecidability.TM.Combinators.StateWhile]
k:111 [in Complexity.NP.Clique.kSAT_to_FlatClique]
k:113 [in Undecidability.TM.Code.NatTM]
k:113 [in Complexity.NP.Clique.kSAT_to_FlatClique]
k:114 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
k:114 [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
k:114 [in Complexity.Libs.CookPrelim.FlatFinTypes]
k:114 [in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
k:114 [in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
k:114 [in Undecidability.TM.Util.TM_facts]
k:114 [in Undecidability.TM.L.HeapInterpreter.LookupTM]
k:115 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
k:115 [in Undecidability.TM.Code.Copy]
k:115 [in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
k:116 [in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
k:116 [in Complexity.NP.Clique.kSAT_to_FlatClique]
k:117 [in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
k:118 [in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
k:118 [in Complexity.NP.Clique.kSAT_to_FlatClique]
k:12 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
k:12 [in Complexity.NP.SAT.kSAT]
k:12 [in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
k:12 [in Undecidability.L.Tactics.Lbeta]
k:12 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
k:12 [in Complexity.NP.SAT.kSAT_to_SAT]
k:12 [in Undecidability.L.Functions.Size]
k:12 [in Complexity.L.AbstractMachines.LambdaDepth]
k:120 [in Undecidability.TM.Lifting.LiftTapes]
k:120 [in Complexity.NP.Clique.kSAT_to_FlatClique]
k:121 [in Undecidability.TM.Compound.MoveToSymbol]
k:121 [in Undecidability.TM.Code.Copy]
k:122 [in Undecidability.L.Prelim.ARS]
k:122 [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
k:122 [in Complexity.Libs.CookPrelim.FlatFinTypes]
k:122 [in Undecidability.TM.Hoare.HoareLogic]
k:122 [in Complexity.NP.Clique.kSAT_to_FlatClique]
k:123 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
k:123 [in Undecidability.TM.Combinators.StateWhile]
k:124 [in Complexity.NP.Clique.kSAT_to_FlatClique]
k:125 [in Complexity.Libs.CookPrelim.FlatFinTypes]
k:125 [in Undecidability.TM.Compound.CopySymbols]
k:125 [in Undecidability.TM.Univ.LowLevel]
k:126 [in Undecidability.TM.Lifting.LiftTapes]
k:126 [in Complexity.NP.Clique.kSAT_to_FlatClique]
k:127 [in Undecidability.TM.Code.List.Nth]
k:127 [in Complexity.NP.Clique.FlatClique]
k:129 [in Undecidability.Shared.Libs.DLW.Utils.sorting]
k:129 [in Complexity.NP.Clique.kSAT_to_FlatClique]
k:13 [in Complexity.NP.Clique.Clique]
k:13 [in Complexity.L.AbstractMachines.FlatPro.Computable.Compile]
k:13 [in Complexity.NP.TM.M_LM2TM]
k:13 [in Complexity.L.AbstractMachines.AbstractHeapMachine]
k:13 [in Undecidability.TM.L.Eval]
k:13 [in Undecidability.L.TM.TMinL.TMinL_extract]
k:13 [in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
k:13 [in Complexity.NP.TM.LM_to_mTM]
k:130 [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
k:130 [in Undecidability.TM.Code.NatTM]
k:130 [in Undecidability.TM.Util.Relations]
k:130 [in Undecidability.TM.Compound.Shift]
k:131 [in Undecidability.L.Tactics.ComputableTime]
k:131 [in Complexity.NP.Clique.FlatClique]
k:131 [in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
k:131 [in Undecidability.TM.Lifting.LiftTapes]
k:132 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
k:133 [in Undecidability.TM.Hoare.HoareLogic]
k:133 [in Undecidability.Shared.Libs.DLW.Code.sss]
k:134 [in Complexity.NP.Clique.kSAT_to_FlatClique]
k:135 [in Undecidability.L.Prelim.ARS]
k:136 [in Complexity.NP.Clique.kSAT_to_FlatClique]
k:137 [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
k:137 [in Undecidability.TM.Code.NatTM]
k:137 [in Complexity.NP.Clique.FlatClique]
k:137 [in Undecidability.TM.Lifting.LiftTapes]
k:138 [in Complexity.NP.Clique.kSAT_to_Clique]
k:138 [in Complexity.NP.Clique.kSAT_to_FlatClique]
k:14 [in Undecidability.TM.Combinators.While]
k:14 [in Undecidability.TM.L.CompilerBoolFuns.NaryApp]
k:14 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
k:14 [in Complexity.NP.SAT.kSAT]
k:14 [in Complexity.Libs.CookPrelim.FlatFinTypes]
k:14 [in Undecidability.Shared.Libs.DLW.Utils.list_bool]
k:14 [in Complexity.L.AbstractMachines.Computable.HeapMachine]
k:14 [in Complexity.NP.L.GenNP]
k:14 [in Complexity.L.AbstractMachines.Computable.LargestVar]
k:14 [in Complexity.Libs.CookPrelim.MorePrelim]
k:14 [in Complexity.L.AbstractMachines.LambdaDepth]
k:140 [in Complexity.NP.Clique.kSAT_to_Clique]
k:140 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
k:140 [in Complexity.NP.Clique.kSAT_to_FlatClique]
k:141 [in Complexity.NP.Clique.FlatClique]
k:142 [in Undecidability.L.Prelim.ARS]
k:142 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
k:142 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
k:142 [in Undecidability.TM.Hoare.HoareLogic]
k:143 [in Undecidability.Shared.Libs.DLW.Utils.sums]
k:143 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
k:144 [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
k:145 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
k:146 [in Undecidability.Shared.Libs.DLW.Utils.sums]
k:147 [in Undecidability.TM.L.HeapInterpreter.StepTM]
k:148 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
k:149 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
k:149 [in Undecidability.Shared.Libs.DLW.Utils.sums]
k:149 [in Undecidability.TM.Code.Copy]
k:149 [in Undecidability.Shared.Libs.DLW.Code.sss]
k:15 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
k:15 [in Undecidability.TM.Code.List.Cons_constant]
k:15 [in Undecidability.TM.Util.Prelim]
k:15 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
k:15 [in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
k:15 [in Complexity.NP.TM.M_multi2mono]
k:15 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
k:15 [in Undecidability.L.TM.TMinL.TMinL_extract]
k:15 [in Complexity.NP.SAT.CookLevin.Subproblems.CC]
k:151 [in Undecidability.Shared.Libs.DLW.Utils.sums]
k:151 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
k:151 [in Undecidability.TM.Hoare.HoareCombinators]
k:154 [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
k:155 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
k:155 [in Undecidability.TM.Combinators.StateWhile]
k:156 [in Undecidability.TM.Univ.LookupAssociativeListTM]
k:157 [in Complexity.Libs.CookPrelim.FlatFinTypes]
k:158 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
k:158 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
k:159 [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
k:159 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
k:16 [in Undecidability.TM.Combinators.Combinators]
k:16 [in Complexity.NP.SAT.kSAT]
k:16 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_nat_facts]
k:16 [in Undecidability.Shared.Libs.DLW.Utils.seteq]
k:16 [in Undecidability.Shared.Libs.DLW.Code.sss]
k:162 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
k:163 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
k:164 [in Undecidability.L.Util.L_facts]
k:165 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
k:168 [in Undecidability.L.Util.L_facts]
k:17 [in Undecidability.L.TM.TMinL]
k:17 [in Complexity.L.AbstractMachines.UnfoldTailRec]
k:17 [in Complexity.TM.Code.DecodeList]
k:17 [in Complexity.L.AbstractMachines.Computable.UnivDecTime]
k:17 [in Complexity.NP.Clique.Clique]
k:17 [in Complexity.NP.TM.M_LM2TM]
k:17 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
k:17 [in Complexity.L.AbstractMachines.Computable.HeapMachine]
k:170 [in Undecidability.TM.Hoare.HoareCombinators]
k:173 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
k:173 [in Undecidability.TM.Univ.Univ]
k:174 [in Complexity.TM.PrettyBounds.UnivBounds]
k:175 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
k:176 [in Undecidability.TM.Hoare.HoareRegister]
k:178 [in Complexity.Libs.CookPrelim.MorePrelim]
k:179 [in Undecidability.TM.Univ.Univ]
k:18 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
k:18 [in Complexity.NP.SAT.kSAT]
k:18 [in Undecidability.L.Prelim.LoopSum]
k:18 [in Undecidability.TM.Util.Prelim]
k:18 [in Complexity.Libs.CookPrelim.FlatFinTypes]
k:18 [in Complexity.NP.L.LMGenNP]
k:18 [in Undecidability.L.AbstractMachines.FlatPro.UnfoldClos]
k:18 [in Undecidability.L.AbstractMachines.FlatPro.Programs]
k:18 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
k:18 [in Complexity.L.AbstractMachines.FunctionalDefinitions]
k:18 [in Complexity.NP.L.GenNP]
k:180 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
k:181 [in Complexity.TM.PrettyBounds.M2MBounds]
k:183 [in Undecidability.TM.Hoare.HoareCombinators]
k:183 [in Complexity.Libs.CookPrelim.MorePrelim]
k:184 [in Undecidability.TM.Code.Copy]
k:184 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
k:185 [in Undecidability.Shared.Libs.DLW.Utils.sums]
k:188 [in Undecidability.Shared.Libs.DLW.Utils.sums]
k:19 [in Undecidability.TM.L.Transcode.Boollist_to_Enc]
k:19 [in Undecidability.Shared.Libs.DLW.Utils.prime]
k:19 [in Undecidability.TM.Lifting.LiftAlphabet]
k:19 [in Complexity.L.AbstractMachines.UnfoldHeap]
k:19 [in Undecidability.L.Tactics.LClos_Eval]
k:190 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
k:190 [in Undecidability.Shared.Libs.DLW.Utils.sums]
k:190 [in Undecidability.TM.L.HeapInterpreter.StepTM]
k:192 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
k:198 [in Undecidability.L.Util.L_facts]
k:2 [in Undecidability.L.Tactics.Lbeta_nonrefl]
k:20 [in Undecidability.TM.Combinators.While]
k:20 [in Undecidability.TM.L.CompilerBoolFuns.NaryApp]
k:20 [in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisUnfoldClos]
k:20 [in Complexity.NP.SAT.kSAT]
k:20 [in Undecidability.TM.Combinators.Mirror]
k:20 [in Undecidability.TM.Util.Prelim]
k:20 [in Undecidability.TM.L.HeapInterpreter.StepTM]
k:20 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
k:204 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
k:204 [in Undecidability.TM.Code.Copy]
k:204 [in Undecidability.TM.Hoare.HoareCombinators]
k:205 [in Undecidability.Shared.Libs.DLW.Code.sss]
k:206 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
k:207 [in Undecidability.Shared.Libs.DLW.Utils.sums]
k:21 [in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
k:21 [in Complexity.TM.Code.Decode]
k:21 [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
k:21 [in Complexity.TM.Code.DecodeList]
k:211 [in Undecidability.L.Util.L_facts]
k:211 [in Undecidability.Shared.Libs.DLW.Utils.sums]
k:211 [in Undecidability.Shared.Libs.DLW.Code.sss]
k:212 [in Undecidability.L.Tactics.Extract]
k:214 [in Undecidability.TM.Code.Copy]
k:215 [in Undecidability.L.Util.L_facts]
k:216 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
k:219 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
k:219 [in Undecidability.TM.Hoare.HoareLogic]
k:22 [in Undecidability.L.TM.TMinL]
k:22 [in Complexity.NP.SAT.kSAT]
k:22 [in Undecidability.TM.Code.List.Rev]
k:22 [in Undecidability.Shared.Libs.DLW.Utils.list_bool]
k:22 [in Complexity.L.AbstractMachines.AbstractSubstMachine]
k:22 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
k:220 [in Undecidability.L.Util.L_facts]
k:220 [in Undecidability.TM.Hoare.HoareCombinators]
k:222 [in Undecidability.TM.Single.StepTM]
k:222 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
k:222 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
k:223 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
k:223 [in Undecidability.Shared.Libs.DLW.Utils.sums]
k:225 [in Undecidability.L.Util.L_facts]
k:229 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
k:229 [in Undecidability.Shared.Libs.DLW.Code.sss]
K:23 [in Undecidability.Shared.Libs.DLW.Utils.fin_quotient]
k:23 [in Undecidability.TM.Hoare.HoareLegacy]
k:23 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
k:23 [in Undecidability.TM.Combinators.Mirror]
k:23 [in Undecidability.L.Complexity.ResourceMeasures]
k:23 [in Complexity.NP.L.LMGenNP]
k:23 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
k:23 [in Complexity.NP.SAT.CookLevin.Subproblems.CC]
k:231 [in Undecidability.L.Util.L_facts]
k:233 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
k:235 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
k:238 [in Undecidability.TM.Hoare.HoareCombinators]
k:24 [in Undecidability.TM.Combinators.While]
k:24 [in Undecidability.TM.L.CompilerBoolFuns.NaryApp]
k:24 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
k:24 [in Undecidability.TM.L.Transcode.Boollist_to_Enc]
k:24 [in Complexity.NP.SAT.kSAT]
k:24 [in Undecidability.L.Complexity.ResourceMeasures]
k:24 [in Undecidability.L.AbstractMachines.FlatPro.Programs]
k:24 [in Complexity.L.AbstractMachines.AbstractHeapMachine]
k:240 [in Undecidability.L.Prelim.ARS]
k:241 [in Undecidability.TM.Single.StepTM]
k:244 [in Undecidability.TM.L.HeapInterpreter.StepTM]
k:25 [in Undecidability.TM.L.Transcode.Boollist_to_Enc]
k:25 [in Undecidability.L.TM.TMinL]
k:25 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
k:25 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_nat_facts]
k:25 [in Complexity.Libs.CookPrelim.FlatFinTypes]
k:25 [in Undecidability.L.L]
k:25 [in Complexity.L.AbstractMachines.FunctionalDefinitions]
k:25 [in Undecidability.Shared.Libs.DLW.Code.sss]
k:25 [in Complexity.NP.SAT.CookLevin.Subproblems.CC]
k:251 [in Undecidability.TM.Hoare.HoareCombinators]
k:253 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
k:26 [in Undecidability.TM.Code.List.Concat_Repeat]
k:26 [in Undecidability.L.TM.TMinL]
k:26 [in Complexity.L.AbstractMachines.UnfoldTailRec]
k:26 [in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisUnfoldClos]
k:26 [in Complexity.Libs.CookPrelim.FlatFinTypes]
k:26 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
k:26 [in Undecidability.Shared.Libs.DLW.Utils.list_bool]
k:260 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
k:260 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
k:260 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
k:269 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
k:27 [in Undecidability.TM.L.CompilerBoolFuns.NaryApp]
k:27 [in Undecidability.TM.Hoare.HoareLegacy]
k:27 [in Complexity.NP.SAT.kSAT]
k:27 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
k:27 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
k:27 [in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
k:270 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
k:270 [in Undecidability.Shared.Libs.DLW.Code.sss]
k:271 [in Complexity.TM.PrettyBounds.M2MBounds]
k:272 [in Undecidability.TM.Single.StepTM]
k:273 [in Undecidability.TM.Hoare.HoareCombinators]
k:274 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
k:274 [in Undecidability.L.Tactics.Reflection]
k:276 [in Undecidability.L.Tactics.Reflection]
k:277 [in Undecidability.Shared.Libs.DLW.Code.sss]
k:278 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
k:278 [in Undecidability.L.Tactics.Reflection]
k:278 [in Complexity.Libs.CookPrelim.MorePrelim]
k:279 [in Undecidability.TM.Util.TM_facts]
k:28 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
k:28 [in Undecidability.TM.Code.List.Length]
k:28 [in Undecidability.L.Prelim.LoopSum]
k:28 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_nat_facts]
k:28 [in Complexity.Libs.CookPrelim.FlatFinTypes]
k:28 [in Undecidability.L.AbstractMachines.FlatPro.Programs]
k:28 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
k:28 [in Undecidability.TM.Lifting.LiftTapes]
k:28 [in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
k:28 [in Complexity.NP.TM.LM_to_mTM]
k:280 [in Complexity.Libs.CookPrelim.MorePrelim]
k:281 [in Complexity.TM.PrettyBounds.M2MBounds]
k:281 [in Undecidability.TM.Hoare.HoareRegister]
k:282 [in Complexity.L.TM.TMflatComp]
k:283 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
k:284 [in Undecidability.Shared.Libs.DLW.Code.sss]
k:284 [in Complexity.Libs.CookPrelim.MorePrelim]
k:285 [in Complexity.L.TM.TMflatComp]
k:286 [in Undecidability.TM.Hoare.HoareCombinators]
k:287 [in Undecidability.L.Tactics.Reflection]
k:288 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
k:289 [in Complexity.TM.PrettyBounds.M2MBounds]
k:289 [in Complexity.L.TM.TMflatComp]
k:29 [in Undecidability.TM.Combinators.Combinators]
k:29 [in Complexity.Libs.UniformHomomorphisms]
k:29 [in Undecidability.L.TM.TapeFuns]
k:291 [in Undecidability.Shared.Libs.DLW.Code.sss]
k:292 [in Undecidability.TM.Util.TM_facts]
k:294 [in Undecidability.TM.Single.StepTM]
k:296 [in Undecidability.Shared.Libs.DLW.Code.sss]
k:298 [in Undecidability.TM.Hoare.HoareRegister]
k:3 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
k:3 [in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
k:3 [in Undecidability.TM.L.CompilerBoolFuns.LComp_to_TMComp]
k:3 [in Complexity.Libs.CookPrelim.FlatFinTypes]
k:30 [in Complexity.NP.SAT.kSAT]
k:30 [in Complexity.L.AbstractMachines.UnfoldHeap]
k:30 [in Complexity.L.AbstractMachines.AbstractSubstMachine]
k:30 [in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
k:30 [in Complexity.TM.Single.DecodeTapes]
k:30 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
k:300 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
k:302 [in Undecidability.TM.Util.TM_facts]
k:302 [in Undecidability.TM.Hoare.HoareCombinators]
k:303 [in Complexity.TM.PrettyBounds.M2MBounds]
k:305 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
k:308 [in Undecidability.TM.Util.TM_facts]
k:309 [in Undecidability.TM.Single.StepTM]
k:31 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
k:31 [in Complexity.L.TM.TMflatComp]
k:31 [in Complexity.NP.Clique.FlatClique]
k:31 [in Undecidability.TM.Combinators.StateWhile]
k:311 [in Complexity.TM.PrettyBounds.M2MBounds]
k:316 [in Undecidability.TM.Util.TM_facts]
k:318 [in Undecidability.TM.Single.StepTM]
k:319 [in Complexity.TM.PrettyBounds.M2MBounds]
k:32 [in Undecidability.TM.L.CompilerBoolFuns.NaryApp]
k:32 [in Complexity.L.AbstractMachines.UnfoldTailRec]
k:32 [in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
k:32 [in Complexity.L.AbstractMachines.FunctionalDefinitions]
k:32 [in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
k:321 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
k:321 [in Undecidability.TM.Hoare.HoareLogic]
k:322 [in Undecidability.TM.Util.TM_facts]
k:328 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
k:329 [in Complexity.TM.PrettyBounds.M2MBounds]
k:329 [in Undecidability.TM.Util.TM_facts]
k:33 [in Complexity.L.AbstractMachines.Computable.EvalForTime]
k:33 [in Complexity.L.AbstractMachines.UnfoldHeap]
k:33 [in Undecidability.Shared.Libs.DLW.Utils.list_bool]
k:33 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
k:33 [in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
k:332 [in Undecidability.TM.Hoare.HoareLogic]
k:334 [in Undecidability.TM.Hoare.HoareRegister]
k:335 [in Undecidability.TM.Util.TM_facts]
k:337 [in Complexity.TM.PrettyBounds.M2MBounds]
k:34 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
k:34 [in Undecidability.TM.Combinators.Mirror]
k:34 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
k:34 [in Complexity.NP.Clique.FlatClique]
k:34 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
k:34 [in Complexity.L.AbstractMachines.AbstractHeapMachine]
k:34 [in Complexity.NP.TM.LM_to_mTM]
k:341 [in Undecidability.TM.Util.TM_facts]
k:344 [in Undecidability.TM.Hoare.HoareLogic]
k:345 [in Complexity.TM.PrettyBounds.M2MBounds]
k:346 [in Undecidability.TM.Single.StepTM]
k:347 [in Undecidability.TM.Util.TM_facts]
k:35 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds_Loop]
k:35 [in Undecidability.Shared.Libs.DLW.Utils.interval]
k:35 [in Undecidability.TM.Hoare.HoareLogic]
k:355 [in Undecidability.TM.Hoare.HoareLogic]
k:359 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
k:36 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_nat_facts]
k:36 [in Complexity.L.TM.TMflatComp]
k:36 [in Complexity.L.TM.TMflatten]
k:36 [in Undecidability.TM.Combinators.StateWhile]
k:36 [in Complexity.NP.TM.LM_to_mTM]
k:360 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
k:361 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
k:363 [in Undecidability.TM.Util.TM_facts]
k:367 [in Undecidability.TM.Util.TM_facts]
k:367 [in Undecidability.TM.Hoare.HoareLogic]
k:37 [in Undecidability.TM.Combinators.Mirror]
k:37 [in Complexity.Libs.CookPrelim.FlatFinTypes]
k:37 [in Undecidability.TM.Code.CompareValue]
k:37 [in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
k:37 [in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
k:37 [in Complexity.L.AbstractMachines.FunctionalDefinitions]
k:37 [in Undecidability.TM.Hoare.HoareCombinators]
k:37 [in Complexity.NP.SAT.CookLevin.Subproblems.CC]
k:375 [in Undecidability.TM.Hoare.HoareLogic]
k:38 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
k:38 [in Undecidability.TM.Util.Prelim]
k:38 [in Undecidability.TM.L.HeapInterpreter.StepTM]
k:383 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
k:383 [in Undecidability.TM.Hoare.HoareLogic]
k:384 [in Undecidability.TM.Hoare.HoareRegister]
k:385 [in Undecidability.TM.Util.TM_facts]
k:389 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
k:39 [in Complexity.TM.Code.Decode]
k:39 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_nat_facts]
k:39 [in Undecidability.L.TM.TapeFuns]
k:39 [in Undecidability.TM.Code.CasePair]
k:391 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
k:392 [in Undecidability.TM.Util.TM_facts]
k:393 [in Undecidability.TM.Hoare.HoareLogic]
k:394 [in Undecidability.TM.Single.StepTM]
k:394 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
k:397 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
k:4 [in Complexity.L.AbstractMachines.UnfoldTailRec]
k:4 [in Complexity.NP.TM.TMGenNP]
k:4 [in Undecidability.Shared.Libs.DLW.Utils.list_bool]
k:4 [in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
k:4 [in Complexity.L.AbstractMachines.FunctionalDefinitions]
k:4 [in Complexity.L.AbstractMachines.LambdaDepth]
k:40 [in Undecidability.TM.L.Transcode.Boollist_to_Enc]
k:40 [in Undecidability.L.Complexity.ResourceMeasures]
k:40 [in Undecidability.TM.Single.EncodeTapes]
k:402 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
k:402 [in Undecidability.TM.Hoare.HoareLogic]
k:403 [in Undecidability.TM.Hoare.HoareCombinators]
k:406 [in Undecidability.TM.Hoare.HoareCombinators]
k:407 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
k:41 [in Undecidability.TM.L.CompilerBoolFuns.NaryApp]
k:41 [in Undecidability.L.Util.L_facts]
k:41 [in Undecidability.TM.Util.Prelim]
k:41 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
k:41 [in Complexity.L.TM.TMflatten]
k:41 [in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
k:411 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
k:414 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
k:419 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
k:42 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds_Loop]
k:42 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
k:42 [in Complexity.L.AbstractMachines.UnfoldTailRec]
k:42 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
k:42 [in Undecidability.TM.Code.List.Rev]
k:42 [in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
k:42 [in Undecidability.TM.Hoare.HoareLogic]
k:42 [in Undecidability.TM.Code.List.App]
k:422 [in Undecidability.TM.Single.StepTM]
k:424 [in Undecidability.TM.Hoare.HoareRegister]
k:426 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
k:43 [in Undecidability.L.Util.L_facts]
k:43 [in Undecidability.TM.Combinators.Switch]
k:43 [in Undecidability.L.Complexity.ResourceMeasures]
k:43 [in Complexity.Libs.UniformHomomorphisms]
k:43 [in Undecidability.Shared.Libs.DLW.Utils.list_bool]
k:43 [in Complexity.L.AbstractMachines.AbstractSubstMachine]
k:44 [in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisUnfoldClos]
k:44 [in Complexity.Libs.CookPrelim.PolyBounds]
k:446 [in Undecidability.TM.Single.StepTM]
k:45 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds_Loop]
k:45 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
k:45 [in Undecidability.Shared.Libs.DLW.Utils.list_bool]
k:45 [in Complexity.Complexity.SpaceBoundsTime]
k:45 [in Undecidability.TM.Combinators.StateWhile]
k:45 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
k:450 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
k:458 [in Undecidability.TM.Single.StepTM]
k:46 [in Undecidability.TM.Code.CaseList]
k:46 [in Undecidability.L.Util.L_facts]
k:46 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
k:46 [in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
k:46 [in Undecidability.L.Datatypes.List.List_eqb]
k:46 [in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
k:47 [in Undecidability.TM.L.CompilerBoolFuns.NaryApp]
k:47 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_nat_facts]
k:47 [in Complexity.L.TM.TMflatComp]
k:47 [in Undecidability.Shared.Libs.DLW.Utils.sorting]
k:47 [in Complexity.L.TM.TMflatten]
k:47 [in Complexity.L.AbstractMachines.AbstractHeapMachine]
k:474 [in Undecidability.TM.Single.StepTM]
k:479 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
k:48 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
k:48 [in Undecidability.TM.Code.NatTM]
k:48 [in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
k:48 [in Complexity.Complexity.SpaceBoundsTime]
k:48 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
k:484 [in Undecidability.TM.Single.StepTM]
k:488 [in Undecidability.TM.Single.StepTM]
k:488 [in Undecidability.TM.Hoare.HoareRegister]
k:49 [in Undecidability.L.Util.L_facts]
k:49 [in Complexity.Libs.CookPrelim.FlatFinTypes]
k:49 [in Undecidability.L.Functions.UnboundIteration]
k:49 [in Undecidability.TM.Hoare.HoareCombinators]
k:49 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
k:49 [in Complexity.NP.Clique.kSAT_to_FlatClique]
k:495 [in Undecidability.TM.Single.StepTM]
k:5 [in Undecidability.TM.L.CompilerBoolFuns.NaryApp]
k:5 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_nat_facts]
k:5 [in Undecidability.TM.Util.Prelim]
k:5 [in Undecidability.Shared.Libs.PSL.FiniteTypes.VectorFin]
k:5 [in Complexity.L.AbstractMachines.UnfoldHeap]
k:5 [in Complexity.NP.Clique.Clique]
k:5 [in Complexity.NP.L.LMGenNP]
k:5 [in Undecidability.TM.L.Eval]
k:50 [in Undecidability.TM.Combinators.While]
k:50 [in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
k:50 [in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
k:501 [in Undecidability.TM.Single.StepTM]
k:509 [in Undecidability.TM.Hoare.HoareRegister]
k:51 [in Undecidability.TM.L.CompilerBoolFuns.NaryApp]
k:51 [in Undecidability.L.Util.L_facts]
k:51 [in Undecidability.TM.Code.List.Length]
k:51 [in Complexity.NP.TM.M_multi2mono]
k:51 [in Undecidability.TM.Combinators.StateWhile]
k:51 [in Undecidability.TM.Hoare.HoareLogic]
k:51 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
k:51 [in Complexity.NP.Clique.kSAT_to_FlatClique]
k:515 [in Undecidability.TM.Single.StepTM]
k:52 [in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
k:52 [in Undecidability.TM.Code.CaseList]
k:52 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
k:53 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
k:53 [in Complexity.Complexity.SpaceBoundsTime]
k:53 [in Undecidability.TM.L.CompilerBoolFuns.Compiler]
k:53 [in Complexity.NP.Clique.kSAT_to_FlatClique]
k:530 [in Undecidability.TM.Hoare.HoareRegister]
k:54 [in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
k:54 [in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
k:54 [in Undecidability.TM.Code.List.Concat_Repeat]
k:54 [in Undecidability.L.Util.L_facts]
k:54 [in Undecidability.TM.Code.NatTM]
k:54 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
k:54 [in Undecidability.Shared.Libs.DLW.Utils.sorting]
k:55 [in Undecidability.TM.Util.VectorPrelim]
k:55 [in Complexity.Libs.CookPrelim.FlatFinTypes]
k:55 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
k:55 [in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
k:55 [in Complexity.NP.Clique.kSAT_to_FlatClique]
k:553 [in Undecidability.TM.Hoare.HoareRegister]
k:56 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
k:56 [in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
k:56 [in Undecidability.TM.Lifting.LiftAlphabet]
k:56 [in Undecidability.TM.Util.Prelim]
k:56 [in Undecidability.TM.Combinators.StateWhile]
k:57 [in Complexity.L.AbstractMachines.Computable.EvalForTime]
k:57 [in Undecidability.TM.L.CompilerBoolFuns.NaryApp]
k:57 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
k:57 [in Complexity.L.AbstractMachines.AbstractHeapMachine]
k:57 [in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
k:57 [in Undecidability.TM.Code.CasePair]
k:578 [in Undecidability.TM.Hoare.HoareRegister]
k:58 [in Undecidability.L.Util.L_facts]
k:58 [in Undecidability.TM.Lifting.LiftAlphabet]
k:58 [in Undecidability.Shared.Libs.DLW.Utils.quotient]
k:58 [in Undecidability.Shared.Libs.DLW.Utils.sums]
k:58 [in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
k:58 [in Complexity.Complexity.SpaceBoundsTime]
k:58 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
k:58 [in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
k:58 [in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
k:58 [in Undecidability.TM.Hoare.HoareLogic]
k:58 [in Complexity.NP.Clique.kSAT_to_FlatClique]
k:59 [in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
k:59 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
k:59 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
k:59 [in Complexity.L.TM.TMflatten]
k:59 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
k:6 [in Undecidability.L.TM.TMinL]
k:6 [in Complexity.NP.SAT.kSAT]
k:6 [in Undecidability.Shared.Libs.DLW.Utils.list_bool]
k:6 [in Complexity.L.AbstractMachines.Computable.Lookup]
k:6 [in Undecidability.L.Functions.Proc]
k:6 [in Complexity.L.AbstractMachines.Computable.HeapMachine]
k:60 [in Undecidability.TM.Combinators.While]
k:60 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
k:60 [in Undecidability.L.Util.L_facts]
k:60 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
k:60 [in Undecidability.TM.Code.List.Rev]
k:60 [in Undecidability.TM.Util.TM_facts]
k:60 [in Undecidability.TM.Code.List.App]
k:61 [in Undecidability.TM.L.CompilerBoolFuns.NaryApp]
k:61 [in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
k:61 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
k:61 [in Undecidability.TM.Single.EncodeTapes]
k:62 [in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
k:62 [in Complexity.L.AbstractMachines.Computable.EvalForTime]
k:62 [in Undecidability.TM.Univ.Univ]
k:62 [in Undecidability.TM.L.CompilerBoolFuns.Compiler]
k:63 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
k:63 [in Complexity.Complexity.SpaceBoundsTime]
k:63 [in Complexity.L.TM.TMflatFun]
k:64 [in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
k:64 [in Undecidability.TM.Lifting.LiftAlphabet]
k:64 [in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
k:64 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
k:64 [in Undecidability.TM.Single.EncodeTapes]
k:65 [in Complexity.Complexity.UpToCPoly]
k:65 [in Undecidability.TM.Hoare.HoareLogic]
k:66 [in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
k:67 [in Undecidability.TM.Code.CaseList]
k:67 [in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
k:67 [in Complexity.Complexity.SpaceBoundsTime]
k:68 [in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
k:68 [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
k:68 [in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
k:68 [in Complexity.L.AbstractMachines.AbstractHeapMachine]
k:68 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
k:68 [in Undecidability.TM.Util.TM_facts]
k:68 [in Undecidability.Shared.Libs.DLW.Code.sss]
k:69 [in Undecidability.L.Util.L_facts]
k:69 [in Undecidability.TM.Compound.MoveToSymbol]
k:69 [in Undecidability.L.Complexity.ResourceMeasures]
k:69 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
k:69 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
k:7 [in Complexity.Libs.CookPrelim.FlatFinTypes]
k:7 [in Undecidability.Shared.Libs.PSL.FiniteTypes.VectorFin]
k:7 [in Undecidability.L.Tactics.Lbeta_nonrefl]
k:7 [in Complexity.NP.Clique.FlatClique]
k:70 [in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
k:70 [in Undecidability.TM.Code.List.Length]
k:70 [in Undecidability.TM.Compound.CopySymbols]
k:70 [in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
k:70 [in Undecidability.TM.Combinators.StateWhile]
k:70 [in Complexity.TM.Single.DecodeTape]
k:72 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
k:72 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
k:72 [in Undecidability.L.Datatypes.LVector]
k:72 [in Undecidability.TM.Univ.Univ]
k:72 [in Undecidability.Shared.Libs.DLW.Code.sss]
k:73 [in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
k:73 [in Undecidability.TM.L.HeapInterpreter.StepTM]
k:73 [in Undecidability.TM.Code.CasePair]
k:73 [in Undecidability.TM.L.CompilerBoolFuns.Compiler]
k:73 [in Complexity.NP.SAT.CookLevin.Subproblems.CC]
k:74 [in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
k:74 [in Undecidability.TM.Compound.Shift]
k:75 [in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
k:75 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
k:75 [in Complexity.NP.Clique.kSAT_to_FlatClique]
k:76 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
k:76 [in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
k:76 [in Undecidability.TM.Hoare.HoareLogic]
k:77 [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
k:77 [in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
k:77 [in Complexity.L.AbstractMachines.AbstractHeapMachine]
k:77 [in Complexity.L.TM.TMflatFun]
k:78 [in Complexity.TM.Code.Decode]
k:79 [in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
k:79 [in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
k:79 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
k:8 [in Complexity.NP.SAT.CookLevin]
k:8 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
k:8 [in Undecidability.L.Tactics.Lrewrite]
k:8 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
k:8 [in Undecidability.TM.Util.Prelim]
k:8 [in Undecidability.Shared.Libs.DLW.Utils.list_bool]
k:8 [in Undecidability.L.L]
k:8 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
k:8 [in Complexity.L.AbstractMachines.Computable.HeapMachine]
k:8 [in Complexity.L.AbstractMachines.LambdaDepth]
k:80 [in Undecidability.L.Complexity.ResourceMeasures]
k:80 [in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
k:80 [in Undecidability.Shared.Libs.DLW.Code.sss]
k:80 [in Complexity.NP.Clique.kSAT_to_FlatClique]
k:81 [in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
k:81 [in Undecidability.TM.Hoare.HoareCombinators]
k:82 [in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
k:82 [in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
k:83 [in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
k:83 [in Undecidability.Shared.Libs.DLW.Code.sss]
k:84 [in Undecidability.L.Util.L_facts]
k:84 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
k:84 [in Undecidability.Shared.Libs.DLW.Utils.php]
k:84 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
k:84 [in Complexity.TM.Single.DecodeTape]
k:84 [in Complexity.NP.SAT.CookLevin.Subproblems.CC]
k:84 [in Complexity.NP.Clique.kSAT_to_FlatClique]
k:85 [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
k:85 [in Complexity.L.TM.TMflatComp]
k:85 [in Undecidability.TM.Compound.Compare]
k:85 [in Complexity.NP.Clique.FlatClique]
k:86 [in Undecidability.L.Complexity.ResourceMeasures]
k:86 [in Complexity.TM.Single.DecodeTape]
k:863 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
k:865 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
k:87 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
k:870 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
k:88 [in Undecidability.TM.Combinators.While]
k:88 [in Complexity.NP.Clique.FlatClique]
k:88 [in Complexity.TM.Single.DecodeTape]
k:89 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
k:89 [in Complexity.L.AbstractMachines.AbstractHeapMachine]
k:89 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
k:9 [in Undecidability.TM.L.CompilerBoolFuns.NaryApp]
k:9 [in Complexity.NP.SAT.kSAT]
k:9 [in Complexity.NP.SAT.CookLevin.Subproblems.BinaryCC]
k:9 [in Undecidability.L.AbstractMachines.FlatPro.UnfoldClos]
k:9 [in Complexity.NP.TM.TMGenNP_fixed_mTM]
k:91 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
k:91 [in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
k:91 [in Complexity.NP.SAT.CookLevin.Subproblems.CC]
k:92 [in Complexity.NP.Clique.FlatClique]
k:93 [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
k:93 [in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
k:93 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
k:93 [in Undecidability.TM.Hoare.HoareCombinators]
k:94 [in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
k:95 [in Undecidability.Shared.Libs.DLW.Utils.sums]
k:95 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
k:96 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
k:96 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
k:96 [in Undecidability.Shared.Libs.DLW.Code.sss]
k:97 [in Undecidability.L.Complexity.ResourceMeasures]
k:97 [in Undecidability.TM.Combinators.StateWhile]
k:98 [in Undecidability.TM.Code.CaseList]
k:98 [in Undecidability.TM.Lifting.LiftTapes]
k:98 [in Undecidability.TM.Hoare.HoareLogic]
k:99 [in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
k:99 [in Undecidability.TM.L.HeapInterpreter.StepTM]
k:99 [in Undecidability.TM.L.CompilerBoolFuns.Compiler]

L

largestVar:12 [in Complexity.HierarchyTheorem.TimeHierarchyTheorem]
largestVar:30 [in Complexity.L.AbstractMachines.Computable.Unfolding]
largestVar:4 [in Complexity.L.AbstractMachines.Computable.EvalForTimeBool]
largestVar:8 [in Complexity.L.AbstractMachines.Computable.Unfolding]
lb:15 [in Undecidability.Shared.Libs.DLW.Utils.list_bool]
lb:23 [in Undecidability.Shared.Libs.DLW.Utils.list_bool]
lb:27 [in Undecidability.Shared.Libs.DLW.Utils.list_bool]
lb:3 [in Undecidability.Shared.Libs.DLW.Utils.list_bool]
lb:34 [in Undecidability.Shared.Libs.DLW.Utils.list_bool]
lb:7 [in Undecidability.Shared.Libs.DLW.Utils.list_bool]
lc:17 [in Undecidability.Shared.Libs.DLW.Utils.list_bool]
lc:29 [in Undecidability.Shared.Libs.DLW.Utils.list_bool]
lengthH:29 [in Complexity.L.AbstractMachines.Computable.Unfolding]
lengthH:7 [in Complexity.L.AbstractMachines.Computable.Unfolding]
len1:27 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
len1:64 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
len2:28 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
len2:302 [in Complexity.Libs.CookPrelim.MorePrelim]
len2:65 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
len:12 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
len:15 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
len:15 [in Undecidability.L.Datatypes.List.List_extra]
len:17 [in Undecidability.L.Datatypes.List.List_extra]
len:20 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
len:23 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
len:292 [in Complexity.Libs.CookPrelim.MorePrelim]
len:43 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
len:7 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
lf:238 [in Complexity.L.TM.TMflatComp]
lf:241 [in Complexity.L.TM.TMflatComp]
lhs:176 [in Undecidability.L.Tactics.Extract]
lhs:51 [in Undecidability.L.Tactics.GenEncode]
listcards:230 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
list_enumerator__T0:133 [in Undecidability.Synthetic.ListEnumerabilityFacts]
lits:134 [in Complexity.NP.Clique.kSAT_to_Clique]
li':67 [in Complexity.NP.Clique.kSAT_to_Clique]
li1:113 [in Complexity.NP.Clique.kSAT_to_Clique]
li1:27 [in Complexity.NP.Clique.kSAT_to_Clique]
li1:29 [in Complexity.NP.Clique.kSAT_to_FlatClique]
li1:35 [in Complexity.NP.Clique.kSAT_to_FlatClique]
li2:114 [in Complexity.NP.Clique.kSAT_to_Clique]
li2:27 [in Complexity.NP.Clique.kSAT_to_FlatClique]
li2:29 [in Complexity.NP.Clique.kSAT_to_Clique]
li2:37 [in Complexity.NP.Clique.kSAT_to_FlatClique]
li:105 [in Complexity.NP.Clique.kSAT_to_Clique]
li:109 [in Complexity.NP.Clique.kSAT_to_Clique]
li:118 [in Complexity.NP.Clique.kSAT_to_Clique]
li:121 [in Complexity.NP.Clique.kSAT_to_Clique]
li:150 [in Undecidability.Shared.Libs.DLW.Code.sss]
li:39 [in Complexity.NP.Clique.kSAT_to_FlatClique]
li:48 [in Complexity.NP.Clique.kSAT_to_Clique]
li:5 [in Complexity.NP.Clique.kSAT_to_FlatClique]
li:58 [in Complexity.NP.Clique.kSAT_to_Clique]
li:62 [in Complexity.NP.Clique.kSAT_to_Clique]
li:66 [in Complexity.NP.Clique.kSAT_to_Clique]
li:79 [in Complexity.NP.Clique.kSAT_to_FlatClique]
li:8 [in Complexity.NP.Clique.kSAT_to_FlatClique]
li:84 [in Complexity.NP.Clique.kSAT_to_Clique]
li:89 [in Complexity.NP.Clique.kSAT_to_FlatClique]
li:9 [in Complexity.NP.Clique.kSAT_to_FlatClique]
li:92 [in Complexity.NP.Clique.kSAT_to_FlatClique]
li:96 [in Complexity.NP.Clique.kSAT_to_FlatClique]
li:99 [in Complexity.NP.Clique.kSAT_to_FlatClique]
ll':407 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
ll:100 [in Undecidability.Shared.Libs.DLW.Utils.php]
ll:107 [in Undecidability.Shared.Libs.DLW.Utils.php]
ll:113 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
ll:115 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
ll:119 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
ll:12 [in Undecidability.Shared.Libs.DLW.Code.compiler]
ll:122 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
ll:124 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
ll:124 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
ll:126 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
ll:128 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
ll:131 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
ll:141 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
ll:15 [in Undecidability.Shared.Libs.DLW.Code.compiler]
ll:157 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
ll:16 [in Undecidability.Shared.Libs.DLW.Utils.fin_upto]
ll:162 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
ll:189 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
ll:20 [in Undecidability.Shared.Libs.DLW.Code.compiler]
ll:22 [in Undecidability.Shared.Libs.DLW.Wf.wf_incl]
ll:228 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
ll:231 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
ll:234 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
ll:24 [in Undecidability.Shared.Libs.DLW.Code.compiler]
ll:243 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
ll:252 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
ll:256 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
ll:259 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
ll:266 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
ll:28 [in Undecidability.Shared.Libs.DLW.Code.compiler]
ll:296 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
ll:302 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
ll:309 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
ll:325 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
ll:33 [in Undecidability.Shared.Libs.DLW.Code.compiler]
ll:330 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
ll:335 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
ll:342 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
ll:37 [in Undecidability.Shared.Libs.DLW.Code.compiler]
ll:396 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
ll:404 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
ll:413 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
ll:42 [in Undecidability.Shared.Libs.DLW.Code.compiler]
ll:423 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
ll:433 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
ll:439 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
ll:44 [in Undecidability.Shared.Libs.DLW.Code.compiler]
ll:443 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
ll:448 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
ll:451 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
ll:456 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
ll:467 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
ll:472 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
ll:52 [in Undecidability.Shared.Libs.DLW.Code.compiler]
ll:53 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
ll:60 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
ll:62 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
ll:72 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
ll:8 [in Undecidability.Shared.Libs.DLW.Wf.wf_incl]
lnk:23 [in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
lnk:5 [in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
lnk:82 [in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
ln:11 [in Undecidability.Shared.Libs.DLW.Utils.list_bool]
ln:16 [in Undecidability.Shared.Libs.DLW.Utils.list_bool]
ln:19 [in Undecidability.Shared.Libs.DLW.Utils.list_bool]
ln:24 [in Undecidability.Shared.Libs.DLW.Utils.list_bool]
ln:28 [in Undecidability.Shared.Libs.DLW.Utils.list_bool]
ln:35 [in Undecidability.Shared.Libs.DLW.Utils.list_bool]
ln:36 [in Undecidability.Shared.Libs.DLW.Utils.list_bool]
lower:14 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
lower:19 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
lower:22 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
lp:10 [in Undecidability.TM.Code.BinNumbers.PosPointers]
lp:13 [in Undecidability.TM.Code.BinNumbers.PosPointers]
lp:18 [in Undecidability.TM.Code.BinNumbers.PosPointers]
lp:2 [in Undecidability.TM.Code.BinNumbers.PosPointers]
lp:23 [in Undecidability.TM.Code.BinNumbers.PosPointers]
lp:26 [in Undecidability.TM.Code.BinNumbers.PosPointers]
lP:479 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
lp:7 [in Undecidability.TM.Code.BinNumbers.PosPointers]
lQ:480 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
lst:22 [in Undecidability.TM.Univ.LowLevel]
lst:28 [in Undecidability.TM.Univ.LowLevel]
lst:36 [in Undecidability.TM.Univ.LowLevel]
ls':126 [in Undecidability.TM.Compound.Shift]
ls':152 [in Undecidability.TM.Compound.MoveToSymbol]
ls':159 [in Undecidability.TM.Compound.MoveToSymbol]
ls':179 [in Undecidability.TM.Util.TM_facts]
ls':188 [in Undecidability.TM.Compound.MoveToSymbol]
ls':189 [in Undecidability.TM.Util.TM_facts]
ls':193 [in Undecidability.TM.Compound.MoveToSymbol]
ls':34 [in Undecidability.TM.Code.Copy]
ls':42 [in Undecidability.TM.Code.Copy]
ls':68 [in Undecidability.TM.Code.Copy]
ls':72 [in Undecidability.TM.Code.Copy]
ls1:118 [in Undecidability.TM.Compound.Compare]
ls1:137 [in Undecidability.TM.Compound.Compare]
ls1:157 [in Undecidability.TM.Compound.Compare]
ls1:168 [in Undecidability.TM.Compound.Compare]
ls1:186 [in Undecidability.TM.Compound.Compare]
ls1:196 [in Undecidability.TM.Compound.Compare]
ls1:210 [in Undecidability.TM.Compound.Compare]
ls1:220 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
ls2:120 [in Undecidability.TM.Compound.Compare]
ls2:138 [in Undecidability.TM.Compound.Compare]
ls2:159 [in Undecidability.TM.Compound.Compare]
ls2:170 [in Undecidability.TM.Compound.Compare]
ls2:187 [in Undecidability.TM.Compound.Compare]
ls2:197 [in Undecidability.TM.Compound.Compare]
ls2:211 [in Undecidability.TM.Compound.Compare]
ls2:221 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
ls:102 [in Undecidability.TM.Single.StepTM]
ls:103 [in Undecidability.TM.Util.TM_facts]
ls:11 [in Undecidability.TM.SBTM]
ls:116 [in Undecidability.TM.Compound.Shift]
ls:12 [in Undecidability.TM.Code.CaseList]
ls:121 [in Undecidability.TM.Compound.Shift]
ls:13 [in Complexity.TM.PrettyBounds.M2MBounds]
ls:130 [in Undecidability.TM.Compound.MoveToSymbol]
ls:136 [in Undecidability.TM.Compound.MoveToSymbol]
ls:14 [in Undecidability.TM.Code.Copy]
ls:151 [in Undecidability.TM.Compound.MoveToSymbol]
ls:157 [in Undecidability.TM.Compound.MoveToSymbol]
ls:16 [in Undecidability.TM.Util.TM_facts]
ls:167 [in Undecidability.TM.Compound.MoveToSymbol]
ls:17 [in Complexity.TM.PrettyBounds.M2MBounds]
ls:172 [in Undecidability.TM.Compound.MoveToSymbol]
ls:177 [in Undecidability.TM.Util.TM_facts]
ls:179 [in Undecidability.TM.Single.StepTM]
ls:186 [in Undecidability.TM.Util.TM_facts]
ls:187 [in Undecidability.TM.Compound.MoveToSymbol]
ls:188 [in Undecidability.TM.Single.StepTM]
ls:19 [in Undecidability.TM.Util.TM_facts]
ls:192 [in Undecidability.TM.Compound.MoveToSymbol]
ls:21 [in Undecidability.TM.Code.CaseList]
ls:21 [in Undecidability.TM.Code.Copy]
ls:213 [in Undecidability.TM.Util.TM_facts]
ls:217 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
ls:217 [in Undecidability.TM.Util.TM_facts]
ls:22 [in Undecidability.TM.Util.TM_facts]
ls:220 [in Undecidability.TM.Util.TM_facts]
ls:223 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
ls:225 [in Undecidability.TM.Util.TM_facts]
ls:228 [in Undecidability.TM.Util.TM_facts]
ls:229 [in Undecidability.TM.Util.TM_facts]
ls:235 [in Undecidability.TM.Util.TM_facts]
ls:238 [in Undecidability.TM.Util.TM_facts]
ls:2643 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
ls:28 [in Undecidability.TM.Util.TM_facts]
ls:287 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
ls:3 [in Undecidability.TM.SBTM]
ls:302 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
ls:317 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
ls:32 [in Undecidability.TM.Code.BinNumbers.PosPointers]
ls:33 [in Undecidability.TM.Code.Copy]
ls:363 [in Undecidability.TM.Single.StepTM]
ls:40 [in Undecidability.TM.Code.Copy]
ls:47 [in Undecidability.TM.Code.CaseList]
ls:5 [in Undecidability.TM.Code.BinNumbers.PosPointers]
ls:52 [in Undecidability.TM.Code.Copy]
ls:52 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
ls:53 [in Undecidability.TM.Code.CaseList]
ls:55 [in Undecidability.TM.Compound.Shift]
ls:57 [in Undecidability.TM.Code.Copy]
ls:59 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
ls:61 [in Undecidability.TM.Compound.Shift]
ls:66 [in Undecidability.TM.Code.Copy]
ls:66 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
ls:7 [in Undecidability.TM.SBTM]
ls:71 [in Undecidability.TM.Code.Copy]
ls:87 [in Undecidability.TM.Single.StepTM]
ls:92 [in Undecidability.TM.Util.TM_facts]
ls:96 [in Undecidability.TM.Single.StepTM]
lT:15 [in Undecidability.L.Datatypes.List.List_nat]
lt:269 [in Complexity.L.TM.TMflatComp]
lT:886 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
lx:127 [in Undecidability.Shared.Libs.DLW.Utils.php]
lX:2 [in Undecidability.Shared.Libs.DLW.Utils.fin_base]
lX:5 [in Undecidability.Shared.Libs.DLW.Utils.fin_base]
lx:9 [in Undecidability.Shared.Libs.DLW.Code.compiler]
ly:128 [in Undecidability.Shared.Libs.DLW.Utils.php]
l__r:44 [in Complexity.L.TM.TMunflatten]
l__r:28 [in Complexity.L.TM.TMunflatten]
l__r:17 [in Complexity.L.TM.TMunflatten]
l__r:11 [in Complexity.L.TM.TMunflatten]
l_i:121 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
l_:28 [in Undecidability.TM.Combinators.StateWhile]
l_i:64 [in Undecidability.TM.L.CompilerBoolFuns.Compiler]
l_i:54 [in Undecidability.TM.L.CompilerBoolFuns.Compiler]
l'':133 [in Complexity.Libs.CookPrelim.PolyBounds]
l'':135 [in Complexity.Libs.CookPrelim.PolyBounds]
l':10 [in Undecidability.Shared.ListAutomation]
l':101 [in Complexity.Libs.CookPrelim.FlatFinTypes]
l':105 [in Undecidability.L.Tactics.Extract]
l':105 [in Complexity.Libs.CookPrelim.FlatFinTypes]
l':109 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
l':132 [in Complexity.Libs.CookPrelim.PolyBounds]
l':134 [in Complexity.Libs.CookPrelim.PolyBounds]
l':134 [in Undecidability.TM.Combinators.StateWhile]
l':139 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
l':149 [in Complexity.L.TM.TMflatComp]
l':149 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
l':15 [in Complexity.Libs.CookPrelim.PolyBounds]
l':178 [in Undecidability.TM.Util.TM_facts]
l':19 [in Complexity.Libs.CookPrelim.PolyBounds]
l':23 [in Complexity.Libs.CookPrelim.PolyBounds]
l':24 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_nat_facts]
l':25 [in Undecidability.Shared.Libs.PSL.Numbers]
l':26 [in Complexity.L.AbstractMachines.Computable.Unfolding]
l':28 [in Undecidability.Shared.Libs.PSL.Numbers]
l':28 [in Undecidability.L.Tactics.GenEncode]
l':29 [in Complexity.Complexity.UpToCPoly]
l':30 [in Undecidability.TM.Combinators.StateWhile]
l':3085 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
l':3090 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
l':31 [in Undecidability.Shared.Libs.PSL.Numbers]
l':31 [in Undecidability.Shared.Libs.PSL.Lists.Position]
l':3101 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
l':33 [in Undecidability.TM.Combinators.StateWhile]
l':34 [in Undecidability.Shared.Libs.PSL.Lists.Position]
l':343 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
l':36 [in Complexity.Complexity.UpToCPoly]
l':38 [in Undecidability.Shared.Libs.PSL.Lists.Position]
l':38 [in Undecidability.TM.Combinators.StateWhile]
L':38 [in Undecidability.Synthetic.ReducibilityFacts]
l':40 [in Complexity.Complexity.UpToCPoly]
l':42 [in Complexity.L.TM.TMflatten]
l':44 [in Complexity.Complexity.UpToCPoly]
L':44 [in Undecidability.Synthetic.ReducibilityFacts]
l':47 [in Undecidability.L.Prelim.MoreList]
l':48 [in Complexity.L.TM.TMflatten]
l':57 [in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
l':59 [in Complexity.Libs.CookPrelim.PolyBounds]
l':71 [in Complexity.Libs.CookPrelim.FlatFinTypes]
l':8 [in Complexity.Libs.CookPrelim.PolyBounds]
l':82 [in Undecidability.TM.Combinators.StateWhile]
l0:3091 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
l0:49 [in Complexity.L.TM.TMflatten]
l1:102 [in Undecidability.TM.Combinators.StateWhile]
l1:107 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
l1:115 [in Complexity.NP.Clique.kSAT_to_Clique]
l1:116 [in Undecidability.TM.Combinators.StateWhile]
l1:12 [in Complexity.NP.Clique.kSAT_to_FlatClique]
l1:120 [in Complexity.Libs.CookPrelim.FlatFinTypes]
l1:128 [in Complexity.NP.Clique.kSAT_to_Clique]
l1:13 [in Complexity.NP.Clique.kSAT_to_Clique]
l1:130 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
l1:136 [in Undecidability.Shared.Libs.DLW.Utils.php]
l1:137 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
l1:140 [in Complexity.Libs.CookPrelim.PolyBounds]
l1:140 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
l1:148 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
l1:151 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
l1:152 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
l1:154 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
l1:157 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
l1:158 [in Complexity.Libs.CookPrelim.PolyBounds]
l1:168 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
l1:17 [in Undecidability.TM.Combinators.StateWhile]
l1:177 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
l1:183 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
l1:19 [in Complexity.NP.Clique.kSAT_to_FlatClique]
l1:20 [in Undecidability.TM.Combinators.StateWhile]
l1:208 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
l1:210 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
l1:213 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
l1:215 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
l1:22 [in Undecidability.L.Datatypes.List.List_extra]
l1:221 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
l1:24 [in Undecidability.L.Datatypes.List.List_extra]
l1:248 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
l1:25 [in Complexity.TM.PrettyBounds.BaseCode]
l1:257 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
l1:259 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
l1:26 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
l1:26 [in Undecidability.Shared.Libs.DLW.Utils.php]
l1:26 [in Undecidability.TM.Code.ChangeAlphabet]
l1:260 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
l1:267 [in Complexity.Libs.CookPrelim.MorePrelim]
l1:269 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
l1:27 [in Complexity.TM.PrettyBounds.BaseCode]
l1:272 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
l1:276 [in Complexity.Libs.CookPrelim.MorePrelim]
l1:29 [in Undecidability.L.Datatypes.LVector]
l1:29 [in Complexity.Libs.CookPrelim.PolyBounds]
l1:29 [in Undecidability.Shared.Libs.DLW.Utils.php]
l1:296 [in Complexity.Libs.CookPrelim.MorePrelim]
l1:300 [in Complexity.Libs.CookPrelim.MorePrelim]
l1:305 [in Complexity.Libs.CookPrelim.MorePrelim]
l1:3093 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
l1:3112 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
l1:3125 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
l1:32 [in Complexity.NP.Clique.kSAT_to_Clique]
l1:327 [in Complexity.Libs.CookPrelim.MorePrelim]
l1:35 [in Complexity.Libs.UniformHomomorphisms]
l1:36 [in Complexity.NP.Clique.kSAT_to_Clique]
l1:37 [in Complexity.Libs.UniformHomomorphisms]
l1:379 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
l1:390 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
l1:41 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
l1:43 [in Undecidability.L.Datatypes.LVector]
l1:43 [in Complexity.NP.Clique.kSAT_to_Clique]
l1:448 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
l1:47 [in Undecidability.TM.Combinators.StateWhile]
l1:48 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
l1:50 [in Complexity.Complexity.UpToCPoly]
l1:51 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
l1:51 [in Complexity.L.TM.TMflatten]
l1:52 [in Complexity.L.TM.TMflatComp]
l1:55 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
l1:55 [in Undecidability.L.Datatypes.LVector]
l1:57 [in Undecidability.L.Datatypes.LVector]
l1:59 [in Complexity.L.TM.TMflatComp]
l1:6 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
l1:60 [in Complexity.NP.Clique.kSAT_to_FlatClique]
l1:61 [in Complexity.Libs.Pigeonhole]
l1:62 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
l1:63 [in Complexity.Libs.Pigeonhole]
l1:64 [in Complexity.NP.Clique.kSAT_to_FlatClique]
l1:66 [in Undecidability.TM.Combinators.StateWhile]
l1:68 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
l1:70 [in Undecidability.L.Datatypes.LVector]
L1:78 [in Complexity.Libs.CookPrelim.FlatFinTypes]
l1:79 [in Undecidability.Shared.Libs.DLW.Utils.prime]
l1:80 [in Complexity.Libs.CookPrelim.FlatFinTypes]
l1:80 [in Undecidability.TM.Combinators.StateWhile]
l1:82 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
L1:83 [in Complexity.Libs.CookPrelim.FlatFinTypes]
l1:84 [in Undecidability.TM.Code.Code]
l1:88 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
l1:88 [in Complexity.Libs.CookPrelim.FlatFinTypes]
l1:89 [in Complexity.Libs.CookPrelim.PolyBounds]
l1:9 [in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
l1:90 [in Complexity.Complexity.UpToCPoly]
l1:92 [in Undecidability.TM.Compound.Compare]
l1:93 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
l1:96 [in Undecidability.TM.Compound.Compare]
l1:98 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
l1:99 [in Undecidability.TM.Compound.Compare]
l2:10 [in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
l2:100 [in Undecidability.TM.Compound.Compare]
l2:100 [in Undecidability.TM.Combinators.StateWhile]
l2:108 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
l2:114 [in Undecidability.TM.Combinators.StateWhile]
l2:116 [in Complexity.NP.Clique.kSAT_to_Clique]
l2:121 [in Complexity.Libs.CookPrelim.FlatFinTypes]
l2:129 [in Complexity.NP.Clique.kSAT_to_Clique]
l2:13 [in Complexity.NP.Clique.kSAT_to_FlatClique]
l2:131 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
l2:137 [in Undecidability.Shared.Libs.DLW.Utils.php]
l2:138 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
l2:14 [in Complexity.NP.Clique.kSAT_to_Clique]
l2:141 [in Complexity.Libs.CookPrelim.PolyBounds]
l2:141 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
l2:145 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
l2:149 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
l2:152 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
l2:153 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
l2:155 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
l2:158 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
l2:159 [in Complexity.Libs.CookPrelim.PolyBounds]
l2:171 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
l2:178 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
l2:187 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
l2:20 [in Complexity.NP.Clique.kSAT_to_FlatClique]
l2:209 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
l2:211 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
l2:214 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
l2:216 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
l2:222 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
l2:23 [in Undecidability.L.Datatypes.List.List_extra]
l2:249 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
l2:25 [in Undecidability.L.Datatypes.List.List_extra]
l2:258 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
l2:26 [in Complexity.TM.PrettyBounds.BaseCode]
l2:260 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
l2:261 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
l2:268 [in Complexity.Libs.CookPrelim.MorePrelim]
l2:27 [in Undecidability.Shared.Libs.DLW.Utils.php]
l2:27 [in Undecidability.TM.Code.ChangeAlphabet]
l2:270 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
l2:273 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
l2:277 [in Complexity.Libs.CookPrelim.MorePrelim]
l2:28 [in Complexity.TM.PrettyBounds.BaseCode]
l2:297 [in Complexity.Libs.CookPrelim.MorePrelim]
l2:30 [in Undecidability.L.Datatypes.LVector]
l2:30 [in Complexity.Libs.CookPrelim.PolyBounds]
l2:30 [in Undecidability.Shared.Libs.DLW.Utils.php]
l2:301 [in Complexity.Libs.CookPrelim.MorePrelim]
l2:306 [in Complexity.Libs.CookPrelim.MorePrelim]
l2:3113 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
l2:3126 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
l2:328 [in Complexity.Libs.CookPrelim.MorePrelim]
l2:33 [in Complexity.NP.Clique.kSAT_to_Clique]
l2:36 [in Complexity.Libs.UniformHomomorphisms]
l2:37 [in Complexity.NP.Clique.kSAT_to_Clique]
l2:38 [in Complexity.Libs.UniformHomomorphisms]
l2:380 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
l2:391 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
l2:42 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
l2:44 [in Undecidability.L.Datatypes.LVector]
l2:44 [in Complexity.NP.Clique.kSAT_to_Clique]
l2:449 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
l2:49 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
l2:51 [in Complexity.Complexity.UpToCPoly]
l2:52 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
l2:53 [in Complexity.L.TM.TMflatComp]
l2:53 [in Undecidability.TM.Combinators.StateWhile]
l2:56 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
l2:56 [in Undecidability.L.Datatypes.LVector]
l2:58 [in Undecidability.L.Datatypes.LVector]
l2:60 [in Complexity.L.TM.TMflatComp]
l2:61 [in Complexity.NP.Clique.kSAT_to_FlatClique]
l2:62 [in Complexity.Libs.Pigeonhole]
l2:63 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
l2:64 [in Complexity.Libs.Pigeonhole]
l2:65 [in Complexity.NP.Clique.kSAT_to_FlatClique]
l2:69 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
l2:7 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
l2:71 [in Undecidability.L.Datatypes.LVector]
l2:72 [in Undecidability.TM.Combinators.StateWhile]
L2:79 [in Complexity.Libs.CookPrelim.FlatFinTypes]
l2:80 [in Undecidability.Shared.Libs.DLW.Utils.prime]
l2:81 [in Complexity.Libs.CookPrelim.FlatFinTypes]
l2:83 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
L2:84 [in Complexity.Libs.CookPrelim.FlatFinTypes]
l2:85 [in Undecidability.TM.Code.Code]
l2:86 [in Undecidability.TM.Combinators.StateWhile]
l2:89 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
l2:89 [in Complexity.Libs.CookPrelim.FlatFinTypes]
l2:90 [in Complexity.Libs.CookPrelim.PolyBounds]
l2:91 [in Complexity.Complexity.UpToCPoly]
l2:93 [in Undecidability.TM.Compound.Compare]
l2:94 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
l2:97 [in Undecidability.TM.Compound.Compare]
l2:99 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
l3:250 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
l3:3114 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
l3:3127 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
l3:94 [in Undecidability.TM.Compound.Compare]
l4:3115 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
l4:3128 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
l:1 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
l:1 [in Complexity.L.AbstractMachines.FlatPro.Computable.Decompile]
l:1 [in Complexity.NP.SAT.SAT_inNP]
l:1 [in Undecidability.Shared.Libs.DLW.Utils.list_bool]
l:1 [in Complexity.L.AbstractMachines.Computable.Lookup]
l:1 [in Undecidability.L.Prelim.StringBase]
l:10 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
l:10 [in Complexity.L.AbstractMachines.FlatPro.Computable.Decompile]
l:10 [in Undecidability.TM.PrettyBounds.SizeBounds]
l:10 [in Complexity.L.ComparisonTimeBoundDerivation]
l:10 [in Complexity.TM.Single.EncodeTapesInvariants]
l:10 [in Undecidability.Shared.Libs.DLW.Wf.wf_incl]
l:10 [in Complexity.NP.SAT.SAT_inNP]
L:10 [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
l:10 [in Undecidability.Shared.Libs.DLW.Utils.fin_base]
l:10 [in Undecidability.L.Datatypes.List.List_in]
l:10 [in Undecidability.L.Datatypes.List.List_fold]
l:10 [in Complexity.NP.SAT.SAT]
l:100 [in Complexity.Libs.CookPrelim.FlatFinTypes]
L:100 [in Complexity.NP.Clique.kSAT_to_Clique]
l:1008 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
L:101 [in Complexity.L.ComparisonTimeBoundDerivation]
l:101 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
l:101 [in Undecidability.L.Tactics.Reflection]
l:101 [in Undecidability.Shared.Libs.DLW.Vec.pos]
l:1011 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
l:1014 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
l:1017 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
l:102 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
l:1021 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
l:1022 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
l:1025 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
l:1027 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
l:103 [in Undecidability.Shared.Libs.DLW.Vec.vec]
l:103 [in Undecidability.TM.Code.List.Nth]
l:103 [in Undecidability.L.Tactics.LClos_Eval]
l:103 [in Complexity.Libs.CookPrelim.PolyBounds]
l:104 [in Undecidability.L.Tactics.Extract]
l:104 [in Undecidability.TM.Combinators.StateWhile]
L:104 [in Complexity.NP.Clique.kSAT_to_Clique]
l:104 [in Undecidability.Shared.Libs.DLW.Vec.pos]
l:1041 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
l:105 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
l:105 [in Undecidability.TM.Combinators.StateWhile]
l:106 [in Undecidability.Shared.Libs.DLW.Vec.vec]
l:106 [in Complexity.Libs.CookPrelim.FlatFinTypes]
l:107 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
l:107 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
l:1077 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
l:108 [in Undecidability.TM.Code.List.Nth]
L:108 [in Complexity.NP.SAT.SAT_inNP]
l:108 [in Complexity.Libs.CookPrelim.PolyBounds]
l:1081 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
l:1086 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
l:109 [in Undecidability.Shared.Libs.DLW.Vec.vec]
l:109 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
l:109 [in Undecidability.TM.Combinators.StateWhile]
l:1090 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
l:1094 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
l:11 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
l:11 [in Undecidability.TM.Code.List.Nth]
l:11 [in Undecidability.L.Tactics.Extract]
l:11 [in Undecidability.L.Datatypes.LSum]
l:11 [in Complexity.L.TM.CompCode]
l:11 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
l:11 [in Complexity.Libs.CookPrelim.PolyBounds]
l:11 [in Undecidability.Shared.Libs.DLW.Utils.php]
l:11 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
L:11 [in Undecidability.Synthetic.ListEnumerabilityFacts]
l:11 [in Undecidability.Shared.Libs.DLW.Utils.seteq]
l:110 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
l:1107 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
l:112 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
l:112 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
l:112 [in Complexity.Libs.CookPrelim.PolyBounds]
L:113 [in Complexity.L.ComparisonTimeBoundDerivation]
l:114 [in Undecidability.Shared.Libs.DLW.Utils.php]
l:114 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
l:115 [in Undecidability.L.Tactics.Extract]
l:115 [in Complexity.Libs.CookPrelim.FlatFinTypes]
l:115 [in Undecidability.TM.Compound.Shift]
l:117 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
l:118 [in Undecidability.TM.Code.List.Nth]
L:118 [in Complexity.Libs.CookPrelim.FlatFinTypes]
l:118 [in Undecidability.TM.Combinators.StateWhile]
l:119 [in Complexity.Libs.CookPrelim.FlatFinTypes]
l:119 [in Undecidability.TM.Combinators.StateWhile]
l:119 [in Complexity.NP.Clique.kSAT_to_Clique]
l:12 [in Undecidability.Shared.Libs.DLW.Utils.fin_dec]
l:12 [in Undecidability.Shared.FinTypeEquiv]
l:12 [in Complexity.TM.Single.EncodeTapesInvariants]
l:12 [in Undecidability.L.Complexity.ResourceMeasures]
l:12 [in Undecidability.L.Datatypes.List.List_in]
l:12 [in Undecidability.L.Datatypes.List.List_fold]
l:12 [in Undecidability.Shared.Libs.DLW.Utils.seteq]
L:120 [in Complexity.NP.SAT.SAT_inNP]
l:120 [in Undecidability.Shared.Libs.DLW.Utils.php]
l:120 [in Undecidability.TM.Combinators.StateWhile]
L:120 [in Complexity.NP.Clique.kSAT_to_Clique]
l:121 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
l:122 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
l:123 [in Undecidability.L.Prelim.ARS]
l:123 [in Complexity.Libs.CookPrelim.PolyBounds]
l:124 [in Undecidability.TM.Compound.Shift]
l:125 [in Complexity.L.ComparisonTimeBoundDerivation]
l:125 [in Complexity.NP.Clique.kSAT_to_Clique]
l:126 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
l:127 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
l:127 [in Complexity.Libs.CookPrelim.FlatFinTypes]
l:127 [in Complexity.L.TM.CompCode]
l:127 [in Complexity.NP.Clique.kSAT_to_Clique]
l:128 [in Undecidability.TM.Code.List.Nth]
L:128 [in Complexity.Libs.CookPrelim.FlatFinTypes]
l:129 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
l:13 [in Complexity.L.AbstractMachines.FlatPro.Computable.Decompile]
l:13 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
l:13 [in Undecidability.L.Tactics.GenEncode]
l:13 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
l:13 [in Undecidability.L.Datatypes.List.List_extra]
l:13 [in Complexity.Libs.UniformHomomorphisms]
l:13 [in Complexity.NP.Clique.FlatClique]
l:13 [in Undecidability.L.Functions.FinTypeLookup]
l:130 [in Complexity.NP.Clique.FlatClique]
L:130 [in Complexity.NP.Clique.kSAT_to_Clique]
l:131 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
l:131 [in Undecidability.TM.Combinators.StateWhile]
l:132 [in Complexity.NP.SAT.SAT_inNP]
l:133 [in Complexity.Libs.CookPrelim.FlatFinTypes]
l:133 [in Undecidability.Shared.Libs.DLW.Utils.php]
l:133 [in Undecidability.TM.Combinators.StateWhile]
L:134 [in Complexity.Libs.CookPrelim.FlatFinTypes]
l:134 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
l:134 [in Complexity.NP.Clique.FlatClique]
l:134 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
l:135 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
l:135 [in Complexity.L.TM.TMflatComp]
l:135 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
l:135 [in Complexity.NP.Clique.kSAT_to_Clique]
l:136 [in Undecidability.L.Prelim.ARS]
l:136 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
l:136 [in Undecidability.L.Tactics.LClos]
l:136 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
l:136 [in Complexity.NP.Clique.FlatClique]
l:137 [in Undecidability.L.Tactics.LClos]
l:137 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
l:138 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
l:138 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
l:138 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
l:14 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
l:14 [in Complexity.TM.Single.EncodeTapesInvariants]
L:14 [in Complexity.NP.Clique.Clique]
l:14 [in Undecidability.L.Datatypes.List.List_nat]
l:14 [in Complexity.Libs.CookPrelim.PolyBounds]
l:14 [in Undecidability.Shared.Libs.DLW.Utils.fin_base]
l:14 [in Complexity.NP.Clique.FlatClique]
l:14 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
l:14 [in Undecidability.Shared.Libs.DLW.Utils.seteq]
l:14 [in Undecidability.TM.Code.List.App]
l:140 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
l:140 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
l:140 [in Complexity.NP.Clique.FlatClique]
l:140 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
l:141 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
l:141 [in Undecidability.TM.Combinators.StateWhile]
l:142 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
l:143 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
l:145 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
l:145 [in Complexity.Libs.CookPrelim.PolyBounds]
l:146 [in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
l:146 [in Complexity.Libs.CookPrelim.FlatFinTypes]
L:146 [in Complexity.L.ComparisonTimeBoundDerivation]
l:146 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
L:147 [in Complexity.Libs.CookPrelim.FlatFinTypes]
l:147 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
l:147 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
l:148 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
L:148 [in Complexity.L.ComparisonTimeBoundDerivation]
l:148 [in Complexity.L.TM.TMflatComp]
l:149 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
l:149 [in Complexity.L.TM.CompCode]
l:149 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
L:15 [in Undecidability.Shared.Libs.PSL.Numbers]
l:15 [in Undecidability.TM.Code.CaseList]
l:15 [in Undecidability.L.Datatypes.List.List_basics]
l:15 [in Undecidability.Shared.FinTypeEquiv]
l:15 [in Complexity.TM.Single.EncodeTapesInvariants]
l:15 [in Undecidability.Shared.Libs.DLW.Wf.wf_incl]
l:15 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
l:15 [in Undecidability.Shared.Libs.DLW.Utils.fin_upto]
l:15 [in Undecidability.Shared.Libs.DLW.Code.subcode]
l:151 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
l:151 [in Complexity.L.TM.CompCode]
l:152 [in Complexity.L.TM.CompCode]
l:152 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
l:152 [in Undecidability.TM.Combinators.StateWhile]
l:152 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
l:153 [in Complexity.L.TM.CompCode]
l:153 [in Undecidability.TM.Combinators.StateWhile]
l:154 [in Undecidability.L.Util.L_facts]
l:154 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
l:155 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
l:156 [in Undecidability.Shared.Libs.DLW.Utils.php]
l:156 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
l:157 [in Complexity.L.ComparisonTimeBoundDerivation]
l:157 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
l:158 [in Undecidability.L.Util.L_facts]
l:158 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
l:159 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
l:16 [in Complexity.TM.PrettyBounds.M2MBounds]
l:16 [in Undecidability.L.Tactics.Extract]
l:16 [in Undecidability.TM.Code.List.Cons_constant]
l:16 [in Undecidability.Shared.Libs.DLW.Utils.utils_string]
l:16 [in Complexity.NP.SAT.SAT_inNP]
l:16 [in Undecidability.Shared.Libs.DLW.Utils.php]
L:16 [in Undecidability.Synthetic.ListEnumerabilityFacts]
l:160 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
l:162 [in Undecidability.TM.Lifting.LiftTapes]
l:163 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
l:165 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
L:167 [in Complexity.L.ComparisonTimeBoundDerivation]
l:167 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
l:169 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
l:169 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
l:17 [in Undecidability.Shared.Libs.PSL.Numbers]
l:17 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
l:17 [in Undecidability.TM.Code.List.Cons_constant]
l:17 [in Undecidability.L.Datatypes.Lists]
l:17 [in Complexity.Complexity.UpToCPoly]
l:17 [in Undecidability.L.Datatypes.List.List_eqb]
l:17 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
l:17 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
l:17 [in Undecidability.Shared.Libs.DLW.Utils.seteq]
l:17 [in Undecidability.Shared.Libs.DLW.Code.sss]
l:170 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
l:171 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
l:172 [in Complexity.Libs.CookPrelim.MorePrelim]
l:176 [in Complexity.Libs.CookPrelim.FlatFinTypes]
l:176 [in Undecidability.TM.Code.Code]
l:176 [in Undecidability.TM.Util.TM_facts]
l:177 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
l:179 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
l:179 [in Complexity.Libs.CookPrelim.FlatFinTypes]
L:179 [in Complexity.L.ComparisonTimeBoundDerivation]
l:179 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
l:18 [in Undecidability.TM.PrettyBounds.SizeBounds]
l:18 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
l:18 [in Complexity.NP.Clique.Clique]
l:18 [in Undecidability.L.Datatypes.LVector]
l:18 [in Complexity.Libs.CookPrelim.PolyBounds]
l:18 [in Undecidability.Shared.Libs.DLW.Wf.wf_finite]
l:18 [in Undecidability.L.Functions.Encoding]
l:182 [in Complexity.Libs.CookPrelim.FlatFinTypes]
l:182 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
l:183 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
l:185 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
l:186 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
l:187 [in Undecidability.TM.Single.StepTM]
l:188 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
l:188 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
l:189 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
l:19 [in Undecidability.Shared.Libs.PSL.Numbers]
l:19 [in Undecidability.Shared.FinTypeEquiv]
l:19 [in Undecidability.Shared.Libs.DLW.Utils.php]
l:19 [in Undecidability.L.Datatypes.List.List_fold]
l:191 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
l:191 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
l:191 [in Complexity.L.ComparisonTimeBoundDerivation]
l:192 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
l:193 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
l:195 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
l:195 [in Complexity.L.TM.TMflatComp]
l:195 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
l:197 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
l:197 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
l:197 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
l:198 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
l:198 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
L:2 [in Undecidability.L.Tactics.GenEncode]
l:2 [in Undecidability.Shared.Libs.DLW.Wf.wf_incl]
l:2 [in Complexity.NP.Clique.Clique]
l:2 [in Undecidability.Shared.Libs.DLW.Utils.php]
l:2 [in Complexity.NP.Clique.FlatClique]
L:2 [in Undecidability.Synthetic.ListEnumerabilityFacts]
l:2 [in Complexity.NP.SAT.SAT]
l:20 [in Undecidability.TM.Code.List.Nth]
l:20 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_nat_facts]
l:20 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
l:20 [in Complexity.NP.Clique.FlatClique]
l:20 [in Complexity.L.TM.TMflatten]
l:20 [in Undecidability.L.Functions.FinTypeLookup]
l:20 [in Undecidability.Shared.Libs.DLW.Utils.seteq]
l:20 [in Undecidability.TM.Compound.WriteString]
l:200 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
l:202 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
l:202 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
l:203 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
l:203 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
l:203 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
l:203 [in Complexity.Libs.CookPrelim.MorePrelim]
l:204 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
l:206 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
l:206 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
l:207 [in Complexity.Libs.CookPrelim.MorePrelim]
l:208 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
l:209 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
l:21 [in Undecidability.Shared.Libs.PSL.Numbers]
L:21 [in Undecidability.L.Tactics.GenEncode]
l:21 [in Complexity.L.ComparisonTimeBoundDerivation]
l:21 [in Undecidability.Shared.Libs.DLW.Wf.wf_incl]
l:21 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
l:21 [in Complexity.Complexity.UpToCPoly]
l:21 [in Undecidability.TM.Combinators.StateWhile]
l:213 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
l:213 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
l:214 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
l:215 [in Complexity.Libs.CookPrelim.MorePrelim]
l:217 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
l:218 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
l:219 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
l:22 [in Undecidability.TM.L.Transcode.Boollist_to_Enc]
l:22 [in Undecidability.L.Datatypes.List.List_basics]
l:22 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_nat_facts]
l:22 [in Complexity.Libs.CookPrelim.PolyBounds]
L:22 [in Undecidability.Synthetic.ListEnumerabilityFacts]
l:22 [in Undecidability.L.Tactics.Reflection]
l:220 [in Complexity.Libs.CookPrelim.MorePrelim]
l:221 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
l:222 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
l:222 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
l:226 [in Complexity.Libs.CookPrelim.MorePrelim]
l:227 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
l:227 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
l:228 [in Complexity.Libs.CookPrelim.MorePrelim]
l:23 [in Undecidability.Shared.Libs.PSL.Numbers]
l:23 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
l:23 [in Undecidability.Shared.Libs.DLW.Wf.wf_incl]
l:23 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
l:23 [in Complexity.L.TM.TMunflatten]
l:23 [in Undecidability.TM.Combinators.StateWhile]
l:23 [in Undecidability.L.Functions.FinTypeLookup]
l:23 [in Complexity.Libs.CookPrelim.MorePrelim]
l:233 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
l:233 [in Complexity.Libs.CookPrelim.MorePrelim]
l:235 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
l:235 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
l:237 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
l:237 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
l:239 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
l:24 [in Undecidability.TM.Code.CaseList]
l:24 [in Complexity.L.ComparisonTimeBoundDerivation]
l:24 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
l:24 [in Undecidability.Shared.Libs.DLW.Utils.php]
l:24 [in Complexity.L.TM.TMflatten]
l:24 [in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
l:24 [in Undecidability.Shared.Libs.DLW.Utils.seteq]
l:24 [in Undecidability.Shared.Libs.PSL.FiniteTypes.FiniteFunction]
l:241 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
l:242 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
l:244 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
l:245 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
l:247 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
l:25 [in Complexity.L.AbstractMachines.Computable.Unfolding]
l:25 [in Complexity.Complexity.UpToCPoly]
l:25 [in Complexity.NP.Clique.FlatClique]
l:25 [in Undecidability.Shared.Libs.DLW.Wf.wf_finite]
l:25 [in Undecidability.TM.Combinators.StateWhile]
l:25 [in Undecidability.L.Datatypes.List.List_fold]
l:25 [in Complexity.NP.SAT.SAT]
l:250 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
l:253 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
l:255 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
l:255 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
l:257 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
l:258 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
l:259 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
l:26 [in Undecidability.Shared.Libs.DLW.Utils.fin_quotient]
l:26 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
l:26 [in Complexity.Libs.CookPrelim.PolyBounds]
l:26 [in Undecidability.Shared.Libs.DLW.Utils.seteq]
l:26 [in Undecidability.Shared.Libs.DLW.Code.sss]
l:26 [in Undecidability.L.Prelim.MoreList]
l:262 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
l:265 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
l:2696 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
l:27 [in Undecidability.L.Tactics.GenEncode]
l:27 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
l:27 [in Complexity.L.ComparisonTimeBoundDerivation]
l:27 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
l:27 [in Complexity.L.AbstractMachines.AbstractSubstMachine]
l:27 [in Undecidability.L.Datatypes.List.List_in]
l:27 [in Undecidability.TM.Combinators.StateWhile]
l:27 [in Undecidability.Shared.Libs.DLW.Utils.seteq]
l:271 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
l:272 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
l:272 [in Complexity.Libs.CookPrelim.MorePrelim]
l:2725 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
l:273 [in Undecidability.L.Tactics.Reflection]
l:2746 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
l:2753 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
l:277 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
l:28 [in Undecidability.Shared.Libs.PSL.Lists.Position]
l:28 [in Complexity.Complexity.UpToCPoly]
l:282 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
l:282 [in Complexity.Libs.CookPrelim.MorePrelim]
l:286 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
l:286 [in Complexity.Libs.CookPrelim.MorePrelim]
l:289 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
l:289 [in Complexity.Libs.CookPrelim.MorePrelim]
l:29 [in Undecidability.L.Datatypes.List.List_basics]
l:29 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
l:29 [in Undecidability.TM.Combinators.Mirror]
l:29 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
l:29 [in Complexity.NP.SAT.CookLevin.Subproblems.TM_single]
l:29 [in Complexity.L.TM.TMflatten]
l:29 [in Undecidability.Shared.Libs.DLW.Utils.seteq]
l:291 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
l:2924 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
l:293 [in Complexity.Libs.CookPrelim.MorePrelim]
l:294 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
l:299 [in Undecidability.L.Tactics.Reflection]
l:3 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
l:3 [in Undecidability.Shared.FinTypeEquiv]
l:3 [in Undecidability.L.Datatypes.Lists]
l:3 [in Complexity.TM.Single.EncodeTapesInvariants]
L:3 [in Undecidability.Shared.FinTypeForallExists]
l:3 [in Complexity.Libs.CookPrelim.PolyBounds]
l:3 [in Complexity.L.TM.TMunflatten]
l:3 [in Undecidability.L.Functions.Encoding]
l:3 [in Undecidability.TM.Compound.WriteString]
l:30 [in Complexity.TM.PrettyBounds.BaseCode]
l:30 [in Undecidability.TM.Code.List.Concat_Repeat]
l:30 [in Undecidability.TM.Lifting.LiftAlphabet]
l:30 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
l:30 [in Undecidability.Shared.Libs.PSL.Lists.Position]
l:30 [in Complexity.TM.Single.EncodeTapesInvariants]
l:30 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
l:30 [in Complexity.NP.Clique.FlatClique]
l:30 [in Undecidability.L.AbstractMachines.FlatPro.Programs]
l:30 [in Complexity.NP.SAT.CookLevin.Subproblems.TM_single]
L:30 [in Undecidability.Shared.Libs.PSL.FiniteTypes.FiniteFunction]
l:303 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
l:304 [in Undecidability.L.Tactics.Reflection]
l:308 [in Complexity.Libs.CookPrelim.MorePrelim]
l:3084 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
l:3089 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
l:309 [in Undecidability.L.Tactics.Reflection]
l:3095 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
l:3099 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
l:31 [in Complexity.L.ComparisonTimeBoundDerivation]
l:31 [in Complexity.TM.Single.EncodeTapesInvariants]
l:31 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
l:31 [in Undecidability.L.Datatypes.List.List_in]
l:31 [in Undecidability.Shared.Libs.DLW.Utils.seteq]
l:31 [in Undecidability.L.Prelim.MoreList]
l:310 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
l:3165 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
l:3182 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
l:319 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
l:32 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
l:32 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
l:32 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_nat_facts]
l:32 [in Complexity.TM.Single.EncodeTapesInvariants]
l:32 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
l:32 [in Undecidability.Shared.Libs.DLW.Utils.fin_upto]
l:32 [in Complexity.Complexity.UpToCPoly]
l:32 [in Undecidability.Shared.Libs.DLW.Utils.php]
l:32 [in Undecidability.TM.Combinators.StateWhile]
l:32 [in Complexity.Libs.CookPrelim.MorePrelim]
l:3224 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
l:329 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
l:329 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
l:33 [in Undecidability.L.Datatypes.List.List_basics]
l:33 [in Undecidability.Shared.Libs.PSL.Lists.Position]
l:33 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_nat_facts]
l:33 [in Complexity.TM.Single.EncodeTapesInvariants]
l:33 [in Complexity.Libs.CookPrelim.PolyBounds]
l:33 [in Undecidability.Shared.Libs.DLW.Utils.fin_base]
l:33 [in Complexity.NP.Clique.FlatClique]
l:33 [in Complexity.L.TM.TMflatten]
l:33 [in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
l:33 [in Undecidability.L.Datatypes.List.List_fold]
l:33 [in Undecidability.Shared.Libs.DLW.Utils.seteq]
l:33 [in Complexity.NP.SAT.CookLevin.Subproblems.CC]
l:330 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
l:330 [in Complexity.Libs.CookPrelim.MorePrelim]
l:331 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
l:333 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
l:334 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
l:337 [in Complexity.Libs.CookPrelim.MorePrelim]
l:338 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
l:339 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
l:34 [in Undecidability.TM.Code.List.Concat_Repeat]
l:34 [in Undecidability.TM.L.Transcode.Boollist_to_Enc]
l:34 [in Undecidability.L.Datatypes.List.List_basics]
l:34 [in Complexity.Libs.UniformHomomorphisms]
l:34 [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
l:348 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
l:349 [in Undecidability.TM.Util.TM_facts]
l:35 [in Undecidability.L.Datatypes.List.List_basics]
l:35 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
l:35 [in Complexity.Complexity.UpToCPoly]
l:35 [in Undecidability.Shared.Libs.DLW.Utils.php]
l:35 [in Complexity.L.TM.TMflatten]
l:35 [in Complexity.Libs.CookPrelim.MorePrelim]
l:35 [in Undecidability.L.Prelim.MoreList]
l:357 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
l:357 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
l:3579 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
l:3580 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
l:3582 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
l:3586 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
l:3598 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
l:36 [in Undecidability.TM.L.Transcode.Boollist_to_Enc]
l:36 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
l:36 [in Complexity.L.ComparisonTimeBoundDerivation]
l:36 [in Complexity.NP.Clique.FlatClique]
L:36 [in Undecidability.L.Functions.FinTypeLookup]
l:360 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
l:369 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
l:37 [in Undecidability.TM.Code.List.Concat_Repeat]
l:37 [in Undecidability.TM.L.Transcode.Boollist_to_Enc]
l:37 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
l:37 [in Undecidability.Shared.Libs.PSL.Lists.Position]
l:37 [in Complexity.Libs.CookPrelim.PolyBounds]
l:37 [in Undecidability.Shared.Libs.DLW.Utils.fin_upto]
l:37 [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
l:37 [in Undecidability.Shared.Libs.DLW.Utils.list_bool]
l:37 [in Undecidability.TM.Code.WriteValue]
l:37 [in Undecidability.TM.Combinators.StateWhile]
l:37 [in Complexity.Libs.CookPrelim.MorePrelim]
l:3703 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
l:373 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
l:38 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
l:38 [in Undecidability.L.Datatypes.LOptions]
l:38 [in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
l:38 [in Complexity.L.ComparisonTimeBoundDerivation]
l:38 [in Undecidability.L.AbstractMachines.FlatPro.Programs]
l:387 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
l:39 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
l:39 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
l:39 [in Complexity.Complexity.UpToCPoly]
l:4 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
l:4 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
l:4 [in Undecidability.Shared.Libs.DLW.Utils.fin_upto]
l:4 [in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
l:4 [in Undecidability.L.Datatypes.List.List_fold]
l:4 [in Complexity.TM.Single.DecodeTape]
l:40 [in Undecidability.TM.Code.CaseList]
l:40 [in Undecidability.L.Datatypes.List.List_basics]
l:40 [in Undecidability.TM.Code.List.Nth]
l:40 [in Complexity.Libs.CookPrelim.PolyBounds]
l:40 [in Undecidability.Shared.Libs.DLW.Utils.list_bool]
l:40 [in Undecidability.Shared.Libs.DLW.Utils.php]
l:40 [in Complexity.NP.Clique.FlatClique]
l:40 [in Complexity.L.TM.TMflatten]
l:40 [in Undecidability.TM.Combinators.StateWhile]
l:40 [in Undecidability.L.Datatypes.List.List_fold]
l:41 [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
L:41 [in Complexity.NP.Clique.FlatClique]
l:41 [in Complexity.NP.SAT.CookLevin.Subproblems.TM_single]
l:41 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
l:41 [in Undecidability.TM.Combinators.StateWhile]
l:41 [in Complexity.NP.SAT.SAT]
l:42 [in Undecidability.TM.Code.List.Concat_Repeat]
l:42 [in Undecidability.TM.L.Transcode.Boollist_to_Enc]
l:42 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
l:42 [in Undecidability.Shared.Libs.DLW.Utils.php]
L:42 [in Complexity.NP.Clique.FlatClique]
l:42 [in Undecidability.L.AbstractMachines.FlatPro.Programs]
l:42 [in Undecidability.L.Prelim.MoreList]
l:43 [in Undecidability.TM.Code.List.Concat_Repeat]
l:43 [in Complexity.L.ComparisonTimeBoundDerivation]
l:43 [in Complexity.Libs.CookPrelim.PolyBounds]
l:43 [in Complexity.Complexity.UpToCPoly]
l:43 [in Complexity.NP.Clique.FlatClique]
l:43 [in Undecidability.TM.Combinators.StateWhile]
l:43 [in Undecidability.Shared.Libs.DLW.Code.subcode]
L:43 [in Undecidability.Shared.Libs.PSL.FiniteTypes.FiniteFunction]
l:44 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
l:44 [in Undecidability.L.Datatypes.List.List_basics]
l:44 [in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
l:44 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
l:44 [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
l:44 [in Undecidability.Shared.Libs.DLW.Utils.list_bool]
l:44 [in Complexity.NP.Clique.FlatClique]
l:44 [in Undecidability.L.AbstractMachines.FlatPro.Programs]
l:44 [in Undecidability.L.Datatypes.List.List_in]
l:44 [in Undecidability.L.Prelim.MoreList]
l:45 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
l:45 [in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
l:45 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
l:45 [in Undecidability.Shared.Libs.DLW.Utils.php]
L:45 [in Complexity.NP.Clique.FlatClique]
L:45 [in Complexity.NP.Clique.kSAT_to_Clique]
l:46 [in Undecidability.L.Tactics.GenEncode]
l:46 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
l:46 [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
l:46 [in Undecidability.Shared.Libs.DLW.Utils.php]
l:46 [in Complexity.L.TM.TMflatten]
l:46 [in Undecidability.TM.Combinators.StateWhile]
l:46 [in Undecidability.L.Prelim.MoreList]
l:461 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
l:47 [in Undecidability.TM.Code.List.Nth]
l:47 [in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
l:47 [in Complexity.Complexity.UpToCPoly]
l:47 [in Undecidability.L.Datatypes.List.List_in]
l:47 [in Undecidability.Shared.Libs.DLW.Code.subcode]
l:478 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
l:48 [in Undecidability.TM.Code.List.Concat_Repeat]
l:48 [in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
l:48 [in Undecidability.L.Tactics.ComputableDemo]
l:48 [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
l:48 [in Undecidability.Shared.Libs.DLW.Utils.list_bool]
l:48 [in Undecidability.Shared.Libs.DLW.Utils.php]
l:48 [in Undecidability.Shared.Libs.DLW.Utils.fin_base]
l:48 [in Undecidability.L.Datatypes.List.List_in]
L:48 [in Undecidability.L.Functions.FinTypeLookup]
l:48 [in Undecidability.L.Prelim.MoreList]
l:49 [in Undecidability.TM.Code.List.Concat_Repeat]
l:49 [in Undecidability.L.Datatypes.List.List_basics]
l:49 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
l:49 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
l:49 [in Complexity.Libs.CookPrelim.PolyBounds]
l:49 [in Complexity.NP.SAT.SAT]
l:5 [in Complexity.NP.SAT.SAT_inNP]
l:5 [in Undecidability.Shared.Libs.DLW.Utils.php]
l:5 [in Undecidability.Shared.Libs.DLW.Utils.seteq]
l:5 [in Complexity.TM.Single.DecodeTape]
l:50 [in Undecidability.Shared.Libs.DLW.Utils.fin_quotient]
l:50 [in Undecidability.TM.Code.CaseList]
l:50 [in Complexity.L.ComparisonTimeBoundDerivation]
l:50 [in Undecidability.Shared.Libs.DLW.Utils.php]
l:51 [in Undecidability.Shared.Libs.DLW.Utils.prime]
l:51 [in Complexity.NP.SAT.CookLevin.Subproblems.TM_single]
l:51 [in Undecidability.Shared.Libs.DLW.Code.subcode]
l:52 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
l:52 [in Undecidability.Shared.Libs.DLW.Utils.list_bool]
l:52 [in Undecidability.Shared.Libs.DLW.Utils.php]
l:52 [in Undecidability.TM.Combinators.StateWhile]
l:53 [in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
l:53 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
l:53 [in Complexity.Libs.CookPrelim.PolyBounds]
l:53 [in Complexity.L.TM.TMflatten]
l:53 [in Complexity.NP.Clique.kSAT_to_Clique]
l:53 [in Complexity.NP.SAT.SAT]
l:53 [in Complexity.TM.PrettyBounds.PrettyBounds]
l:54 [in Undecidability.Shared.Libs.DLW.Utils.prime]
l:54 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
l:54 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
l:54 [in Complexity.Libs.CookPrelim.PolyBounds]
l:54 [in Complexity.Complexity.UpToCPoly]
l:54 [in Undecidability.L.Datatypes.List.List_in]
l:55 [in Undecidability.Shared.Libs.DLW.Utils.prime]
l:55 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
l:55 [in Undecidability.Shared.Libs.DLW.Utils.list_bool]
l:55 [in Undecidability.Shared.Libs.DLW.Utils.fin_base]
l:56 [in Undecidability.TM.Code.CaseList]
l:56 [in Undecidability.Shared.Libs.DLW.Utils.prime]
l:56 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
l:56 [in Complexity.Libs.CookPrelim.PolyBounds]
l:56 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
l:56 [in Complexity.L.TM.TMflatFun]
l:56 [in Undecidability.Shared.Libs.DLW.Code.subcode]
l:57 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
l:57 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
l:57 [in Undecidability.L.Datatypes.List.List_in]
l:57 [in Undecidability.TM.Combinators.StateWhile]
l:57 [in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
l:58 [in Complexity.Libs.CookPrelim.PolyBounds]
l:58 [in Undecidability.Shared.Libs.DLW.Utils.list_bool]
l:58 [in Complexity.Complexity.UpToCPoly]
l:58 [in Complexity.L.TM.TMflatten]
l:59 [in Undecidability.TM.Code.List.Concat_Repeat]
l:59 [in Undecidability.Shared.Libs.DLW.Utils.prime]
l:59 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
l:59 [in Undecidability.Shared.Libs.DLW.Utils.list_bool]
l:59 [in Complexity.NP.Clique.FlatClique]
L:59 [in Undecidability.L.Functions.FinTypeLookup]
l:6 [in Complexity.L.ComparisonTimeBoundDerivation]
l:6 [in Complexity.NP.Clique.Clique]
l:6 [in Undecidability.L.Datatypes.List.List_nat]
l:6 [in Complexity.L.TM.TMunflatten]
L:6 [in Undecidability.Synthetic.ListEnumerabilityFacts]
l:6 [in Undecidability.L.Datatypes.List.List_in]
l:6 [in Undecidability.TM.Combinators.StateWhile]
l:6 [in Complexity.NP.Clique.kSAT_to_FlatClique]
l:60 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
l:60 [in Complexity.L.ComparisonTimeBoundDerivation]
L:60 [in Complexity.L.TM.TMflatten]
L:60 [in Undecidability.Synthetic.ListEnumerabilityFacts]
l:61 [in Undecidability.Shared.Libs.DLW.Utils.prime]
l:61 [in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
l:61 [in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
l:61 [in Undecidability.Shared.Libs.DLW.Utils.list_bool]
l:61 [in Complexity.Complexity.UpToCPoly]
l:61 [in Complexity.TM.PrettyBounds.PrettyBounds]
l:62 [in Undecidability.Shared.Libs.DLW.Utils.prime]
l:62 [in Undecidability.Shared.Libs.DLW.Utils.list_bool]
l:62 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
l:63 [in Undecidability.TM.Code.List.Concat_Repeat]
l:63 [in Undecidability.L.Datatypes.List.List_basics]
l:63 [in Complexity.NP.L.CanEnumTerm]
l:63 [in Complexity.Libs.CookPrelim.PolyBounds]
l:63 [in Complexity.NP.Clique.FlatClique]
L:63 [in Undecidability.L.Computability.Synthetic]
l:64 [in Undecidability.TM.Code.CaseList]
l:64 [in Complexity.NP.L.CanEnumTerm]
l:64 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
l:64 [in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
l:64 [in Undecidability.Shared.Libs.DLW.Utils.list_bool]
l:64 [in Complexity.Complexity.UpToCPoly]
l:64 [in Complexity.L.AbstractMachines.AbstractHeapMachine]
l:65 [in Undecidability.Shared.Libs.DLW.Utils.prime]
l:65 [in Undecidability.L.Datatypes.List.List_basics]
l:65 [in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
l:65 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
l:65 [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
l:65 [in Undecidability.Shared.Libs.DLW.Utils.list_bool]
l:65 [in Undecidability.Shared.Libs.DLW.Utils.php]
l:65 [in Complexity.NP.Clique.FlatClique]
L:65 [in Undecidability.Synthetic.ListEnumerabilityFacts]
l:65 [in Undecidability.TM.Combinators.StateWhile]
l:66 [in Undecidability.TM.Code.List.Concat_Repeat]
l:66 [in Undecidability.L.Datatypes.List.List_basics]
l:66 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
l:66 [in Undecidability.Shared.Libs.DLW.Utils.list_bool]
l:66 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
l:67 [in Undecidability.L.Datatypes.List.List_basics]
l:67 [in Complexity.NP.TM.mTM_to_singleTapeTM]
l:67 [in Complexity.Libs.CookPrelim.PolyBounds]
l:67 [in Undecidability.Shared.Libs.DLW.Utils.list_bool]
L:67 [in Undecidability.Synthetic.ListEnumerabilityFacts]
l:67 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
l:67 [in Undecidability.TM.Single.EncodeTapes]
l:670 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
l:679 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
l:68 [in Undecidability.TM.Code.CaseList]
l:68 [in Undecidability.L.Datatypes.List.List_basics]
l:68 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
l:68 [in Complexity.NP.TM.mTM_to_singleTapeTM]
l:68 [in Undecidability.Shared.Libs.DLW.Utils.php]
l:685 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
l:69 [in Undecidability.Shared.Libs.DLW.Utils.prime]
l:69 [in Undecidability.Shared.Libs.DLW.Utils.list_bool]
l:69 [in Complexity.NP.Clique.FlatClique]
l:7 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
l:7 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
l:7 [in Undecidability.Shared.FinTypeEquiv]
l:7 [in Complexity.L.TM.CompCode]
l:7 [in Undecidability.Shared.Libs.DLW.Wf.wf_incl]
l:7 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
l:7 [in Complexity.Libs.CookPrelim.PolyBounds]
l:7 [in Undecidability.TM.Combinators.StateWhile]
l:70 [in Undecidability.L.Datatypes.List.List_basics]
l:70 [in Complexity.Libs.CookPrelim.FlatFinTypes]
l:70 [in Complexity.Complexity.UpToCPoly]
L:70 [in Complexity.NP.Clique.kSAT_to_Clique]
L:70 [in Undecidability.L.Computability.Synthetic]
l:70 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
l:71 [in Undecidability.L.Datatypes.List.List_basics]
l:71 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
l:71 [in Undecidability.TM.Combinators.StateWhile]
l:72 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
l:72 [in Undecidability.Shared.Libs.DLW.Utils.prime]
l:72 [in Undecidability.L.Datatypes.List.List_basics]
l:72 [in Undecidability.Shared.Libs.DLW.Utils.php]
L:72 [in Undecidability.Synthetic.ListEnumerabilityFacts]
l:73 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
l:73 [in Undecidability.Shared.Libs.DLW.Utils.list_bool]
L:73 [in Complexity.NP.Clique.kSAT_to_Clique]
l:73 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
l:74 [in Complexity.L.ComparisonTimeBoundDerivation]
l:74 [in Complexity.L.TM.TMflatComp]
l:74 [in Undecidability.Shared.Libs.DLW.Utils.php]
l:74 [in Complexity.NP.Clique.FlatClique]
l:74 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
l:74 [in Undecidability.Shared.Libs.DLW.Code.subcode]
l:75 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
l:75 [in Complexity.Libs.CookPrelim.FlatFinTypes]
l:75 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
l:75 [in Complexity.Complexity.UpToCPoly]
l:75 [in Complexity.Libs.CookPrelim.MorePrelim]
l:76 [in Undecidability.Shared.Libs.DLW.Utils.prime]
L:76 [in Complexity.Libs.CookPrelim.FlatFinTypes]
l:76 [in Complexity.L.ComparisonTimeBoundDerivation]
l:76 [in Undecidability.Shared.Libs.DLW.Utils.php]
L:76 [in Undecidability.Synthetic.ListEnumerabilityFacts]
l:76 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
l:77 [in Undecidability.L.Computability.Seval]
l:77 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
l:77 [in Undecidability.Shared.Libs.DLW.Utils.list_bool]
l:77 [in Complexity.NP.Clique.FlatClique]
l:77 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
l:78 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
l:78 [in Undecidability.Shared.Libs.DLW.Utils.list_bool]
l:78 [in Undecidability.TM.Combinators.StateWhile]
l:79 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
l:79 [in Undecidability.Shared.Libs.DLW.Utils.list_bool]
l:79 [in Complexity.Complexity.UpToCPoly]
l:79 [in Undecidability.Shared.Libs.DLW.Utils.fin_base]
l:8 [in Undecidability.TM.Code.List.Cons_constant]
l:8 [in Undecidability.L.Datatypes.Lists]
l:8 [in Undecidability.L.Prelim.MoreBase]
l:8 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
l:8 [in Undecidability.Shared.ListAutomation]
l:8 [in Undecidability.L.Datatypes.List.List_fold]
L:80 [in Complexity.L.ComparisonTimeBoundDerivation]
l:81 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
l:81 [in Complexity.NP.Clique.FlatClique]
l:82 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
L:82 [in Complexity.L.ComparisonTimeBoundDerivation]
l:82 [in Undecidability.Shared.Libs.DLW.Utils.php]
l:82 [in Complexity.L.TM.TMunflatten]
L:82 [in Undecidability.Synthetic.ListEnumerabilityFacts]
l:83 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
l:83 [in Undecidability.L.Tactics.LClos]
L:83 [in Complexity.NP.Clique.kSAT_to_Clique]
l:83 [in Undecidability.Shared.Libs.DLW.Code.subcode]
l:84 [in Complexity.NP.Clique.FlatClique]
L:84 [in Undecidability.Synthetic.ListEnumerabilityFacts]
l:84 [in Undecidability.TM.Combinators.StateWhile]
l:85 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
l:85 [in Complexity.Libs.CookPrelim.FlatFinTypes]
L:85 [in Complexity.L.TM.TMunflatten]
l:86 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
l:86 [in Complexity.Libs.CookPrelim.PolyBounds]
l:86 [in Undecidability.Shared.Libs.DLW.Utils.fin_base]
L:86 [in Undecidability.Synthetic.ListEnumerabilityFacts]
l:86 [in Undecidability.Shared.Libs.DLW.Code.subcode]
l:864 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
l:867 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
l:87 [in Undecidability.L.Tactics.LClos]
L:87 [in Complexity.Libs.CookPrelim.FlatFinTypes]
L:87 [in Complexity.NP.SAT.SAT_inNP]
l:87 [in Complexity.NP.Clique.FlatClique]
l:88 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
l:88 [in Undecidability.TM.Combinators.StateWhile]
l:885 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
l:89 [in Undecidability.TM.Code.CaseList]
l:89 [in Undecidability.L.Computability.Seval]
l:89 [in Undecidability.L.Datatypes.LVector]
L:89 [in Complexity.NP.SAT.SAT_inNP]
l:890 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
l:893 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
l:898 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
l:9 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
l:9 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
L:9 [in Complexity.NP.Clique.Clique]
l:9 [in Complexity.Libs.UniformHomomorphisms]
l:9 [in Undecidability.Shared.Libs.DLW.Utils.fin_upto]
l:9 [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
l:9 [in Complexity.NP.Clique.FlatClique]
l:9 [in Undecidability.L.AbstractMachines.FlatPro.Programs]
l:9 [in Undecidability.TM.Combinators.StateWhile]
l:9 [in Undecidability.Shared.Libs.DLW.Utils.seteq]
l:90 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
l:90 [in Complexity.NP.Clique.FlatClique]
l:90 [in Undecidability.L.Tactics.Reflection]
l:90 [in Undecidability.TM.Combinators.StateWhile]
l:91 [in Complexity.L.ComparisonTimeBoundDerivation]
l:91 [in Undecidability.Shared.Libs.DLW.Utils.php]
l:91 [in Undecidability.TM.Combinators.StateWhile]
l:917 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
l:92 [in Undecidability.L.Computability.Seval]
l:92 [in Complexity.Libs.CookPrelim.PolyBounds]
l:93 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
l:93 [in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
L:93 [in Undecidability.Synthetic.ListEnumerabilityFacts]
l:94 [in Complexity.NP.Clique.FlatClique]
l:94 [in Undecidability.TM.Combinators.StateWhile]
l:94 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
l:95 [in Complexity.Complexity.UpToCPoly]
l:95 [in Undecidability.TM.Combinators.StateWhile]
l:96 [in Undecidability.L.Computability.Seval]
l:96 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
L:96 [in Undecidability.Synthetic.ListEnumerabilityFacts]
l:97 [in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
L:97 [in Complexity.NP.Clique.kSAT_to_Clique]
L:98 [in Undecidability.L.Tactics.Extract]
l:98 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
l:98 [in Undecidability.L.Complexity.ResourceMeasures]
l:98 [in Complexity.NP.SAT.SAT_inNP]
L:98 [in Undecidability.Synthetic.ListEnumerabilityFacts]
l:99 [in Undecidability.TM.Code.CaseList]
l:99 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
l:99 [in Complexity.Libs.CookPrelim.PolyBounds]
l:99 [in Undecidability.Shared.Libs.DLW.Utils.php]

M

marked:4 [in Undecidability.TM.Single.EncodeTapes]
marked:5 [in Undecidability.TM.Single.EncodeTapes]
maxDepth:16 [in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisUnfoldClos]
maxDepth:24 [in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisUnfoldClos]
maxDepth:42 [in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisUnfoldClos]
maxDepth:9 [in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisUnfoldClos]
maxPro:14 [in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisUnfoldClos]
maxPro:22 [in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisUnfoldClos]
maxPro:40 [in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisUnfoldClos]
maxPro:7 [in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisUnfoldClos]
maxSize:10 [in Complexity.NP.TM.TMGenNP]
maxSize:10 [in Complexity.NP.L.GenNP]
maxSize:11 [in Complexity.NP.TM.mTM_to_singleTapeTM]
maxSize:12 [in Complexity.NP.TM.mTM_to_singleTapeTM]
maxSize:13 [in Complexity.NP.L.LMGenNP]
maxSize:14 [in Complexity.NP.TM.mTM_to_singleTapeTM]
maxSize:14 [in Complexity.NP.TM.TMGenNP_fixed_mTM]
maxSize:15 [in Complexity.NP.SAT.CookLevin.Subproblems.SingleTMGenNP]
maxSize:18 [in Complexity.NP.TM.mTM_to_singleTapeTM]
maxSize:18 [in Complexity.NP.TM.TMGenNP]
maxSize:2 [in Complexity.NP.L.GenNPBool]
maxSize:23 [in Complexity.NP.SAT.CookLevin.Subproblems.SingleTMGenNP]
maxSize:24 [in Complexity.NP.TM.TMGenNP]
maxSize:25 [in Complexity.NP.L.GenNPBool]
maxSize:26 [in Complexity.NP.TM.TMGenNP_fixed_mTM]
maxSize:27 [in Complexity.NP.TM.mTM_to_singleTapeTM]
maxSize:30 [in Complexity.NP.L.GenNPBool]
maxSize:31 [in Complexity.NP.TM.mTM_to_singleTapeTM]
maxSize:34 [in Complexity.NP.TM.TMGenNP]
maxSize:34 [in Complexity.NP.L.GenNPBool]
maxSize:39 [in Complexity.NP.L.GenNPBool]
maxSize:4 [in Complexity.NP.TM.L_to_LM]
maxSize:4 [in Complexity.NP.L.GenNP]
maxSize:45 [in Complexity.NP.TM.TMGenNP]
maxSize:5 [in Complexity.NP.TM.TMGenNP_fixed_mTM]
maxSize:50 [in Complexity.NP.TM.TMGenNP]
maxSize:51 [in Complexity.NP.SAT.CookLevin.Subproblems.SingleTMGenNP]
maxSize:587 [in Complexity.NP.TM.LM_to_mTM]
maxSize:591 [in Complexity.NP.TM.LM_to_mTM]
maxSize:597 [in Complexity.NP.TM.LM_to_mTM]
maxSize:6 [in Complexity.NP.L.LMGenNP]
maxSize:602 [in Complexity.NP.TM.LM_to_mTM]
maxSize:606 [in Complexity.NP.TM.LM_to_mTM]
maxSize:610 [in Complexity.NP.TM.LM_to_mTM]
maxSize:616 [in Complexity.NP.TM.LM_to_mTM]
maxSize:620 [in Complexity.NP.TM.LM_to_mTM]
maxSize:8 [in Complexity.NP.TM.L_to_LM]
maxVar':13 [in Complexity.L.AbstractMachines.Computable.HeapMachine]
maxVar':19 [in Complexity.HierarchyTheorem.TimeHierarchyTheorem]
maxVar':61 [in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
maxVar':66 [in Complexity.L.AbstractMachines.Computable.EvalForTime]
maxVar:12 [in Complexity.L.AbstractMachines.Computable.UnivDecTime]
maxVar:12 [in Complexity.L.AbstractMachines.Computable.HeapMachine]
maxVar:15 [in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisUnfoldClos]
maxVar:16 [in Complexity.L.AbstractMachines.Computable.HeapMachine]
maxVar:18 [in Complexity.HierarchyTheorem.TimeHierarchyTheorem]
maxVar:23 [in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisUnfoldClos]
maxVar:24 [in Complexity.HierarchyTheorem.TimeHierarchyTheorem]
maxVar:41 [in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisUnfoldClos]
maxVar:46 [in Complexity.L.AbstractMachines.Computable.EvalForTime]
maxVar:5 [in Complexity.L.AbstractMachines.Computable.HeapMachine]
maxVar:60 [in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
maxVar:65 [in Complexity.L.AbstractMachines.Computable.EvalForTime]
maxVar:66 [in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
maxVar:71 [in Complexity.L.AbstractMachines.Computable.EvalForTime]
maxVar:8 [in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisUnfoldClos]
max:11 [in Complexity.L.Functions.IterupN]
max:16 [in Complexity.L.Functions.IterupN]
max:21 [in Complexity.L.Functions.IterupN]
max:28 [in Complexity.L.Functions.IterupN]
max:3 [in Complexity.L.Functions.IterupN]
max:33 [in Complexity.L.Functions.IterupN]
mA:61 [in Undecidability.Shared.Libs.PSL.FiniteTypes.FiniteFunction]
mb:11 [in Undecidability.TM.Code.BinNumbers.PosPointers]
mb:24 [in Undecidability.TM.Code.BinNumbers.PosPointers]
mb:3 [in Undecidability.TM.Code.BinNumbers.PosPointers]
mB:62 [in Undecidability.Shared.Libs.PSL.FiniteTypes.FiniteFunction]
mb:8 [in Undecidability.TM.Code.BinNumbers.PosPointers]
mflat:3684 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
minSucc:152 [in Undecidability.TM.Single.StepTM]
min:151 [in Undecidability.TM.Single.StepTM]
mm':399 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
mm:108 [in Undecidability.Shared.Libs.DLW.Utils.php]
mm:120 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
mm:13 [in Undecidability.Shared.Libs.DLW.Code.compiler]
mm:21 [in Undecidability.Shared.Libs.DLW.Code.compiler]
mm:297 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
mm:34 [in Undecidability.Shared.Libs.DLW.Code.compiler]
mm:397 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
mm:405 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
mm:414 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
mm:422 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
mm:434 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
mm:444 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
mm:45 [in Undecidability.Shared.Libs.DLW.Code.compiler]
mm:54 [in Undecidability.Shared.Libs.DLW.Code.compiler]
modpath:61 [in Undecidability.L.Tactics.GenEncode]
mout:2027 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
mout:2059 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
mout:2089 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
mtch:42 [in Undecidability.L.Tactics.GenEncode]
mt:270 [in Complexity.L.TM.TMflatComp]
mu:8 [in Undecidability.L.Computability.MuRec]
mv:49 [in Undecidability.TM.Util.TM_facts]
M__multi:4 [in Complexity.NP.TM.M_multi2mono]
M'_final:482 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
m':102 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
m':103 [in Undecidability.TM.Hoare.HoareMult]
M':106 [in Complexity.L.TM.TMunflatten]
m':108 [in Undecidability.TM.Code.NatTM]
m':109 [in Undecidability.TM.Hoare.HoareMult]
M':112 [in Complexity.L.TM.TMunflatten]
m':114 [in Undecidability.TM.Code.NatTM]
m':114 [in Undecidability.L.Complexity.ResourceMeasures]
m':117 [in Undecidability.TM.Code.NatTM]
m':118 [in Undecidability.L.Complexity.ResourceMeasures]
m':124 [in Undecidability.TM.Code.NatTM]
m':125 [in Undecidability.TM.Hoare.HoareMult]
m':13 [in Undecidability.TM.L.CompilerBoolFuns.Compiler]
m':130 [in Undecidability.TM.Hoare.HoareMult]
m':136 [in Undecidability.TM.Hoare.HoareMult]
M':15 [in Complexity.NP.TM.TMGenNP]
m':172 [in Undecidability.L.Prelim.ARS]
m':190 [in Undecidability.TM.Util.TM_facts]
M':20 [in Complexity.NP.SAT.CookLevin.Subproblems.SingleTMGenNP]
m':2009 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m':2036 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m':2041 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m':2069 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m':2073 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m':2104 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m':2115 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m':2126 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m':2137 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m':2148 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m':2159 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m':2169 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m':2179 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m':2189 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m':2199 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
M':22 [in Complexity.NP.TM.TMGenNP]
m':2209 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m':2219 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m':25 [in Undecidability.TM.L.CompilerBoolFuns.Compiler]
m':264 [in Undecidability.TM.Hoare.HoareExamples]
m':267 [in Undecidability.TM.Hoare.HoareExamples]
m':271 [in Undecidability.TM.Hoare.HoareExamples]
m':274 [in Undecidability.TM.Hoare.HoareExamples]
m':278 [in Undecidability.TM.Hoare.HoareExamples]
m':28 [in Undecidability.L.Complexity.ResourceMeasures]
m':283 [in Undecidability.TM.Hoare.HoareExamples]
m':288 [in Undecidability.TM.Hoare.HoareExamples]
m':293 [in Undecidability.TM.Hoare.HoareExamples]
m':297 [in Undecidability.TM.Hoare.HoareExamples]
M':30 [in Complexity.NP.TM.TMGenNP]
m':302 [in Undecidability.TM.Hoare.HoareExamples]
m':315 [in Undecidability.TM.Hoare.HoareExamples]
m':319 [in Undecidability.TM.Hoare.HoareExamples]
m':324 [in Undecidability.TM.Hoare.HoareExamples]
m':3252 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m':3258 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m':33 [in Undecidability.L.Complexity.ResourceMeasures]
m':335 [in Undecidability.TM.Hoare.HoareExamples]
m':340 [in Undecidability.TM.Hoare.HoareExamples]
m':345 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
m':347 [in Undecidability.TM.Hoare.HoareExamples]
m':352 [in Undecidability.TM.Hoare.HoareExamples]
m':358 [in Undecidability.TM.Hoare.HoareExamples]
m':374 [in Undecidability.TM.Hoare.HoareExamples]
m':379 [in Undecidability.TM.Hoare.HoareExamples]
m':385 [in Undecidability.TM.Hoare.HoareExamples]
M':39 [in Complexity.L.TM.TMflat]
M':40 [in Complexity.NP.TM.TMGenNP]
m':421 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
m':428 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
m':44 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_nat_facts]
m':457 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
m':463 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
m':471 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
m':478 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
m':488 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
M':49 [in Complexity.NP.TM.M_multi2mono]
m':494 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
m':499 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
m':505 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
m':510 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
m':515 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
m':52 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_nat_facts]
m':52 [in Complexity.L.AbstractMachines.AbstractSubstMachine]
M':52 [in Complexity.L.TM.TMflatFun]
m':520 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
m':526 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
m':531 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
m':536 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
m':541 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
m':547 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
m':552 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
m':62 [in Undecidability.TM.Code.NatTM]
m':62 [in Undecidability.Shared.Libs.DLW.Utils.php]
M':62 [in Complexity.L.TM.TMflatFun]
m':66 [in Undecidability.Shared.Libs.DLW.Utils.php]
m':68 [in Undecidability.L.Tactics.GenEncode]
m':68 [in Undecidability.TM.Hoare.HoareMult]
M':69 [in Complexity.L.TM.TMflatFun]
m':7 [in Undecidability.L.Prelim.MoreBase]
m':71 [in Undecidability.TM.Code.NatTM]
m':71 [in Undecidability.Shared.Libs.DLW.Utils.php]
m':72 [in Undecidability.TM.Hoare.HoareMult]
m':76 [in Undecidability.TM.Hoare.HoareMult]
m':81 [in Undecidability.TM.Code.NatTM]
M':81 [in Complexity.L.TM.TMflatFun]
m':81 [in Undecidability.TM.Hoare.HoareMult]
m':86 [in Undecidability.TM.Hoare.HoareMult]
m':91 [in Undecidability.TM.Hoare.HoareMult]
m':98 [in Undecidability.TM.Hoare.HoareMult]
m0:2091 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m0:2092 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m1:106 [in Undecidability.L.Complexity.ResourceMeasures]
m1:13 [in Undecidability.Shared.Libs.DLW.Utils.php]
m1:134 [in Undecidability.Shared.Libs.DLW.Utils.php]
m1:1431 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m1:1460 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m1:1613 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m1:1641 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m1:184 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
m1:185 [in Undecidability.L.Prelim.ARS]
m1:198 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m1:2029 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m1:2062 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m1:22 [in Undecidability.Shared.Libs.DLW.Utils.php]
m1:2513 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m1:2518 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m1:2523 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m1:2804 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m1:2816 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m1:2819 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m1:2822 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m1:351 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m1:3535 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m1:3540 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m1:3545 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m1:382 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
m1:386 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m1:388 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
m1:395 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m1:427 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m1:437 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m1:472 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m1:482 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m1:517 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m1:52 [in Undecidability.L.Complexity.ResourceMeasures]
m1:526 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m1:558 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m1:56 [in Undecidability.Shared.Libs.DLW.Utils.list_bool]
m1:568 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m1:59 [in Undecidability.L.Computability.Enum]
m1:603 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m1:613 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m1:647 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m1:656 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m1:690 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m1:699 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m1:733 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m1:8 [in Undecidability.Shared.Libs.DLW.Utils.php]
m2:109 [in Undecidability.L.Complexity.ResourceMeasures]
m2:135 [in Undecidability.Shared.Libs.DLW.Utils.php]
m2:14 [in Undecidability.Shared.Libs.DLW.Utils.php]
m2:186 [in Undecidability.L.Prelim.ARS]
m2:186 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
m2:199 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m2:23 [in Undecidability.Shared.Libs.DLW.Utils.php]
m2:2514 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m2:2519 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m2:2524 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m2:272 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
m2:296 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m2:352 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m2:3536 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m2:3541 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m2:3546 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m2:383 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
m2:387 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m2:389 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
m2:396 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m2:428 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m2:438 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m2:473 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m2:483 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m2:518 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m2:527 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m2:53 [in Undecidability.L.Complexity.ResourceMeasures]
m2:559 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m2:569 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m2:57 [in Undecidability.Shared.Libs.DLW.Utils.list_bool]
m2:60 [in Undecidability.L.Computability.Enum]
m2:604 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m2:614 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m2:648 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m2:657 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m2:691 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m2:700 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m2:734 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m2:9 [in Undecidability.Shared.Libs.DLW.Utils.php]
m3:110 [in Undecidability.L.Complexity.ResourceMeasures]
m3:187 [in Undecidability.L.Prelim.ARS]
m3:200 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m3:2061 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m3:353 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m3:388 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m3:397 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m3:429 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m3:439 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m3:474 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m3:484 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m3:519 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m3:528 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m3:54 [in Undecidability.L.Complexity.ResourceMeasures]
m3:560 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m3:570 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m3:605 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m4:2030 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
M:1 [in Complexity.L.TM.TMflatEnc]
M:1 [in Complexity.NP.SAT.CookLevin.Reductions.TMGenNP_fixed_singleTapeTM_to_FlatFunSingleTMGenNP]
m:1 [in Undecidability.L.TM.TMEncoding]
m:1 [in Undecidability.TM.Lifting.LiftTapes]
m:1 [in Complexity.L.AbstractMachines.FunctionalDefinitions]
M:1 [in Undecidability.L.Computability.Scott]
m:10 [in Undecidability.Shared.Libs.DLW.Utils.crt]
m:10 [in Undecidability.Shared.FinTypeForallExists]
m:10 [in Complexity.Complexity.SpaceBoundsTime]
m:10 [in Undecidability.TM.SBTM]
m:10 [in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
m:100 [in Undecidability.TM.Code.NatTM]
m:100 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
m:102 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
m:102 [in Undecidability.Shared.Libs.DLW.Vec.pos]
m:103 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
m:103 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
m:104 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
M:104 [in Undecidability.TM.Univ.LowLevel]
m:105 [in Undecidability.Shared.Libs.DLW.Vec.pos]
m:106 [in Undecidability.L.Prelim.ARS]
m:106 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
m:106 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
M:107 [in Undecidability.TM.Univ.LowLevel]
m:107 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
M:107 [in Undecidability.TM.Univ.Univ]
m:108 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
M:108 [in Complexity.L.TM.TMunflatten]
M:109 [in Complexity.L.TM.TMunflatten]
m:11 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
m:11 [in Undecidability.Shared.Libs.DLW.Wf.wf_incl]
M:11 [in Complexity.NP.TM.TMGenNP]
m:11 [in Undecidability.L.Functions.Ackermann]
m:110 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
m:111 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
m:111 [in Undecidability.L.Complexity.ResourceMeasures]
M:111 [in Undecidability.TM.Univ.LowLevel]
m:113 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
m:113 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
m:113 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
M:114 [in Undecidability.TM.Univ.Univ]
m:115 [in Undecidability.L.Complexity.ResourceMeasures]
m:115 [in Undecidability.Shared.Libs.DLW.Utils.php]
m:115 [in Undecidability.TM.Hoare.HoareMult]
m:116 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
m:117 [in Undecidability.TM.Compound.Shift]
m:118 [in Undecidability.L.Prelim.ARS]
m:118 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
M:118 [in Undecidability.TM.Univ.LowLevel]
m:119 [in Undecidability.TM.Code.CodeTM]
M:12 [in Undecidability.L.TM.TMinL]
m:12 [in Undecidability.Shared.Libs.PSL.Vectors.Fin]
m:12 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
m:12 [in Undecidability.Shared.Libs.DLW.Utils.php]
m:12 [in Complexity.L.TM.TMunflatten]
M:12 [in Undecidability.L.Computability.Rice]
m:120 [in Undecidability.TM.Hoare.HoareMult]
m:121 [in Undecidability.Shared.Libs.DLW.Utils.php]
m:121 [in Undecidability.TM.Compound.Compare]
m:122 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
m:122 [in Undecidability.TM.Compound.Shift]
M:124 [in Complexity.TM.PrettyBounds.UnivBounds]
M:124 [in Undecidability.TM.Hoare.HoareRegister]
m:126 [in Undecidability.L.Prelim.ARS]
M:126 [in Complexity.TM.PrettyBounds.UnivBounds]
M:126 [in Undecidability.TM.Univ.LowLevel]
m:126 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m:127 [in Undecidability.TM.Code.NatTM]
m:127 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
m:128 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
M:128 [in Undecidability.TM.Univ.LowLevel]
M:129 [in Complexity.TM.PrettyBounds.UnivBounds]
M:13 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
m:13 [in Undecidability.Shared.Libs.DLW.Utils.seteq]
m:130 [in Undecidability.L.Prelim.ARS]
m:130 [in Complexity.Libs.CookPrelim.MorePrelim]
m:131 [in Undecidability.TM.Code.NatTM]
m:132 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
m:133 [in Undecidability.TM.Compound.MoveToSymbol]
m:134 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
m:134 [in Undecidability.TM.Code.NatTM]
m:134 [in Undecidability.TM.Compound.Compare]
m:134 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m:135 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
m:135 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
m:135 [in Undecidability.TM.Univ.LowLevel]
M:136 [in Undecidability.TM.Univ.LowLevel]
m:137 [in Undecidability.TM.Compound.MoveToSymbol]
m:137 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
m:137 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
m:1379 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
M:138 [in Complexity.TM.PrettyBounds.UnivBounds]
m:138 [in Undecidability.TM.Code.NatTM]
m:138 [in Undecidability.Synthetic.ListEnumerabilityFacts]
m:1384 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m:14 [in Complexity.TM.PrettyBounds.M2MBounds]
m:14 [in Undecidability.L.Functions.Ackermann]
m:14 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
m:14 [in Undecidability.Synthetic.ListEnumerabilityFacts]
M:140 [in Undecidability.TM.Univ.LowLevel]
m:1412 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m:1414 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m:142 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
m:142 [in Undecidability.TM.Hoare.HoareMult]
m:143 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
m:143 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
M:144 [in Undecidability.TM.Univ.LowLevel]
M:145 [in Undecidability.TM.Univ.LowLevel]
m:146 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
M:146 [in Complexity.TM.PrettyBounds.UnivBounds]
m:146 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
M:146 [in Undecidability.TM.Univ.LowLevel]
m:147 [in Undecidability.TM.Hoare.HoareMult]
m:1471 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m:1476 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m:148 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
M:149 [in Complexity.TM.PrettyBounds.UnivBounds]
m:149 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
m:149 [in Undecidability.TM.Hoare.HoareMult]
m:15 [in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
m:15 [in Undecidability.L.Computability.Enum]
m:15 [in Undecidability.TM.Code.Copy]
m:15 [in Complexity.L.AbstractMachines.FunctionalDefinitions]
m:15 [in Undecidability.Shared.Libs.DLW.Utils.seteq]
m:15 [in Undecidability.L.Datatypes.LNat]
M:15 [in Undecidability.TM.Univ.Univ]
m:150 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
m:150 [in Complexity.L.AbstractMachines.AbstractHeapMachine]
m:1505 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m:1509 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m:151 [in Undecidability.TM.Hoare.HoareMult]
m:151 [in Undecidability.Shared.Libs.DLW.Vec.pos]
m:1516 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
M:152 [in Complexity.TM.PrettyBounds.UnivBounds]
m:152 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
M:152 [in Undecidability.TM.Univ.LowLevel]
m:152 [in Undecidability.TM.Lifting.LiftTapes]
m:1520 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m:153 [in Undecidability.TM.Hoare.HoareMult]
m:153 [in Complexity.Libs.CookPrelim.MorePrelim]
m:154 [in Undecidability.TM.Compound.MoveToSymbol]
M:154 [in Undecidability.TM.Univ.LowLevel]
M:154 [in Undecidability.TM.Hoare.HoareRegister]
m:154 [in Undecidability.Shared.Libs.DLW.Vec.pos]
m:1548 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m:155 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
m:1551 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m:156 [in Undecidability.TM.Lifting.LiftTapes]
m:1568 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
M:157 [in Complexity.TM.PrettyBounds.UnivBounds]
M:157 [in Undecidability.TM.Univ.LowLevel]
m:157 [in Undecidability.Shared.Libs.DLW.Utils.php]
m:158 [in Undecidability.Shared.Libs.DLW.Vec.pos]
m:159 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
m:159 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
m:1597 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m:16 [in Undecidability.Shared.Libs.DLW.Wf.wf_incl]
M:16 [in Complexity.NP.TM.TMGenNP]
m:16 [in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
M:16 [in Undecidability.L.Computability.Acceptability]
m:160 [in Undecidability.TM.Compound.MoveToSymbol]
m:160 [in Undecidability.TM.Compound.Compare]
m:1608 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
M:161 [in Complexity.TM.PrettyBounds.UnivBounds]
m:161 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
m:162 [in Undecidability.Shared.Libs.DLW.Vec.pos]
m:163 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
m:164 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
m:1644 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m:165 [in Undecidability.Shared.Libs.DLW.Vec.vec]
m:165 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
m:165 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
m:165 [in Complexity.Libs.CookPrelim.MorePrelim]
m:1651 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m:1655 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m:166 [in Undecidability.L.Prelim.ARS]
M:166 [in Complexity.TM.PrettyBounds.UnivBounds]
m:166 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
m:167 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
m:167 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
M:167 [in Undecidability.TM.Univ.Univ]
m:1682 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m:1684 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m:169 [in Undecidability.TM.Compound.MoveToSymbol]
m:169 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
m:1691 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m:17 [in Undecidability.Shared.Libs.PSL.Vectors.Fin]
m:17 [in Undecidability.Shared.Libs.DLW.Utils.php]
M:17 [in Complexity.NP.SAT.CookLevin.Subproblems.SingleTMGenNP]
m:17 [in Undecidability.L.Functions.Ackermann]
m:171 [in Undecidability.L.Prelim.ARS]
M:171 [in Complexity.TM.PrettyBounds.UnivBounds]
m:171 [in Undecidability.TM.Compound.Compare]
m:171 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
m:1723 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m:173 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
m:173 [in Undecidability.TM.Compound.MoveToSymbol]
m:1730 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m:175 [in Complexity.TM.PrettyBounds.M2MBounds]
m:1762 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
M:177 [in Undecidability.TM.Hoare.HoareRegister]
m:178 [in Undecidability.L.Prelim.ARS]
m:179 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
m:18 [in Undecidability.Shared.Libs.PSL.Lists.Position]
m:18 [in Undecidability.TM.SBTM]
M:18 [in Undecidability.L.Computability.Acceptability]
m:18 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m:18 [in Undecidability.Shared.Libs.DLW.Utils.seteq]
m:18 [in Undecidability.TM.L.CompilerBoolFuns.Compiler]
m:180 [in Undecidability.TM.Single.StepTM]
m:180 [in Complexity.L.TM.TMunflatten]
M:180 [in Undecidability.TM.Univ.Univ]
m:183 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
m:185 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
m:185 [in Undecidability.TM.Compound.Compare]
m:187 [in Undecidability.TM.Util.TM_facts]
m:189 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
m:189 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
m:19 [in Undecidability.L.Computability.Enum]
m:19 [in Undecidability.TM.Code.NatTM]
m:19 [in Undecidability.Synthetic.EnumerabilityFacts]
m:19 [in Undecidability.Shared.FinTypeForallExists]
m:19 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
M:19 [in Complexity.NP.TM.TMGenNP]
m:19 [in Undecidability.Synthetic.ListEnumerabilityFacts]
M:19 [in Undecidability.L.Computability.Acceptability]
m:190 [in Undecidability.TM.Compound.MoveToSymbol]
m:192 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
m:195 [in Undecidability.TM.Compound.MoveToSymbol]
m:195 [in Undecidability.TM.Compound.Compare]
m:196 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
m:199 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
M:2 [in Complexity.NP.SAT.CookLevin]
m:2 [in Undecidability.Shared.Libs.DLW.Utils.list_bool]
m:2 [in Undecidability.Shared.Libs.DLW.Utils.sums]
m:2 [in Undecidability.TM.SBTM]
m:2 [in Complexity.L.AbstractMachines.AbstractHeapMachine]
M:2 [in Undecidability.L.Computability.Rice]
m:2 [in Undecidability.Shared.Libs.DLW.Vec.pos]
M:20 [in Undecidability.L.TM.TMinL]
M:20 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
m:20 [in Undecidability.Shared.Libs.DLW.Wf.wf_incl]
m:20 [in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
m:20 [in Undecidability.L.Functions.Ackermann]
m:20 [in Undecidability.Shared.Libs.PSL.FiniteTypes.CompoundFinTypes]
m:200 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
m:2008 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m:202 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
M:203 [in Complexity.L.TM.TMunflatten]
m:204 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
M:204 [in Complexity.L.TM.TMunflatten]
m:2040 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m:206 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
m:207 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
m:2072 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
M:208 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
m:209 [in Undecidability.TM.Compound.Compare]
m:2096 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
M:21 [in Undecidability.TM.Hoare.HoareLegacy]
m:21 [in Undecidability.Shared.Libs.PSL.Lists.Position]
m:21 [in Undecidability.Shared.Libs.PSL.Vectors.Fin]
m:21 [in Undecidability.Shared.Libs.DLW.Utils.php]
m:21 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m:21 [in Undecidability.Shared.Libs.DLW.Utils.seteq]
M:21 [in Undecidability.TM.Univ.Univ]
m:21 [in Undecidability.TM.L.CompilerBoolFuns.Compiler]
m:210 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
m:2107 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m:211 [in Undecidability.L.Prelim.ARS]
m:2118 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
M:212 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
m:2129 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m:2140 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m:215 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
m:2151 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m:2162 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
M:217 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
m:2172 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m:218 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
m:2182 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m:2192 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
M:22 [in Undecidability.TM.Combinators.Combinators]
m:22 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
m:22 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
m:22 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
m:22 [in Undecidability.TM.Code.Copy]
M:22 [in Undecidability.L.Computability.Rice]
m:22 [in Undecidability.TM.L.CompilerBoolFuns.Compiler]
m:2202 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m:221 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
m:2212 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m:223 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
M:223 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
m:223 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
M:226 [in Undecidability.L.Tactics.Extract]
m:227 [in Undecidability.L.Util.L_facts]
m:228 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
M:228 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
m:23 [in Undecidability.Synthetic.EnumerabilityFacts]
m:23 [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
M:23 [in Undecidability.TM.TM]
m:23 [in Complexity.L.AbstractMachines.FunctionalDefinitions]
M:231 [in Complexity.L.TM.TMunflatten]
m:232 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
M:233 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
m:233 [in Undecidability.TM.Hoare.HoareRegister]
m:234 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
m:236 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
M:239 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
m:239 [in Undecidability.TM.Util.TM_facts]
m:24 [in Undecidability.Shared.Libs.PSL.Lists.Position]
m:24 [in Undecidability.Shared.Libs.PSL.Vectors.Fin]
m:24 [in Undecidability.Shared.Libs.DLW.Wf.wf_incl]
M:24 [in Undecidability.TM.SBTM]
m:24 [in Complexity.NP.TM.M_multi2mono]
m:24 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
M:24 [in Complexity.NP.TM.TMGenNP_fixed_mTM]
m:241 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
M:244 [in Complexity.L.TM.TMflatComp]
M:244 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
m:245 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
m:247 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
m:249 [in Undecidability.TM.Hoare.HoareRegister]
m:25 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
M:25 [in Complexity.NP.TM.TMGenNP]
m:25 [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
m:25 [in Undecidability.Shared.Libs.DLW.Utils.php]
M:25 [in Complexity.NP.SAT.CookLevin.Subproblems.SingleTMGenNP]
m:25 [in Complexity.NP.TM.M_multi2mono]
M:250 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
m:2515 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
M:252 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
M:252 [in Undecidability.TM.Util.TM_facts]
m:2520 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m:2525 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m:253 [in Undecidability.TM.Hoare.HoareExamples]
m:2537 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m:254 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
M:254 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
m:257 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
M:259 [in Undecidability.TM.Util.TM_facts]
m:26 [in Undecidability.TM.Code.NatTM]
M:261 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
m:261 [in Undecidability.TM.Hoare.HoareRegister]
M:264 [in Undecidability.TM.Util.TM_facts]
M:267 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
M:267 [in Undecidability.TM.Util.TM_facts]
M:268 [in Complexity.TM.PrettyBounds.M2MBounds]
M:269 [in Undecidability.TM.Util.TM_facts]
m:27 [in Complexity.TM.PrettyBounds.M2MBounds]
m:27 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
m:27 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
m:27 [in Undecidability.TM.Code.NatTM]
m:27 [in Undecidability.L.Complexity.ResourceMeasures]
m:27 [in Complexity.Complexity.ONotationIsAppropriate]
m:271 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
M:272 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
M:275 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
m:276 [in Undecidability.TM.Hoare.HoareRegister]
M:278 [in Complexity.TM.PrettyBounds.M2MBounds]
m:28 [in Undecidability.Shared.Libs.PSL.Vectors.Fin]
m:28 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
m:28 [in Undecidability.Shared.Libs.DLW.Utils.seteq]
M:28 [in Undecidability.TM.Univ.Univ]
M:280 [in Complexity.L.TM.TMflatComp]
M:280 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
m:2802 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m:2808 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m:281 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
m:281 [in Complexity.Libs.CookPrelim.MorePrelim]
m:2810 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m:2828 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
M:283 [in Complexity.L.TM.TMflatComp]
m:2831 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m:2832 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
M:285 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
m:285 [in Complexity.Libs.CookPrelim.MorePrelim]
M:287 [in Complexity.L.TM.TMflatComp]
m:288 [in Complexity.Libs.CookPrelim.MorePrelim]
m:289 [in Undecidability.TM.Hoare.HoareRegister]
M:289 [in Undecidability.TM.Util.TM_facts]
M:29 [in Complexity.L.TM.TMflatComp]
m:29 [in Complexity.Complexity.ONotationIsAppropriate]
m:29 [in Undecidability.L.L]
m:29 [in Complexity.L.AbstractMachines.FunctionalDefinitions]
m:291 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
m:291 [in Complexity.Libs.CookPrelim.MorePrelim]
M:294 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
M:295 [in Undecidability.TM.Util.TM_facts]
m:295 [in Complexity.Libs.CookPrelim.MorePrelim]
M:2955 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
M:297 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
M:299 [in Undecidability.TM.Util.TM_facts]
m:299 [in Complexity.Libs.CookPrelim.MorePrelim]
M:3 [in Undecidability.L.TM.TMinL]
m:3 [in Undecidability.Shared.Libs.DLW.Wf.wf_incl]
m:3 [in Undecidability.Shared.Libs.DLW.Utils.php]
M:3 [in Complexity.NP.TM.TMGenNP_fixed_mTM]
m:30 [in Undecidability.L.Computability.Enum]
m:30 [in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
m:30 [in Undecidability.TM.Code.NatTM]
m:30 [in Undecidability.Shared.Libs.DLW.Utils.quotient]
m:30 [in Undecidability.Shared.Libs.DLW.Utils.seteq]
m:30 [in Undecidability.TM.Single.EncodeTapes]
M:300 [in Complexity.TM.PrettyBounds.M2MBounds]
m:301 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
M:302 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
m:303 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
m:303 [in Undecidability.TM.Hoare.HoareRegister]
m:304 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m:304 [in Complexity.Libs.CookPrelim.MorePrelim]
M:3043 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m:307 [in Undecidability.TM.Hoare.HoareExamples]
M:3073 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
M:308 [in Complexity.TM.PrettyBounds.M2MBounds]
m:309 [in Undecidability.TM.Hoare.HoareRegister]
m:31 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
m:31 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
m:31 [in Complexity.Complexity.ONotationIsAppropriate]
m:311 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m:311 [in Undecidability.TM.Hoare.HoareExamples]
M:316 [in Complexity.TM.PrettyBounds.M2MBounds]
m:316 [in Undecidability.TM.Hoare.HoareRegister]
M:3163 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
M:3172 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
M:318 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
M:3180 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
M:3190 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m:32 [in Undecidability.Shared.Libs.PSL.Vectors.Fin]
m:32 [in Undecidability.L.Complexity.ResourceMeasures]
m:32 [in Complexity.L.TM.TMflatten]
m:32 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
m:32 [in Undecidability.Shared.Libs.DLW.Utils.seteq]
M:32 [in Undecidability.TM.Univ.Univ]
m:323 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
M:324 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
M:324 [in Undecidability.TM.Hoare.HoareRegister]
m:3244 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m:3251 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m:3257 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m:326 [in Undecidability.TM.Hoare.HoareRegister]
m:327 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
m:3270 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m:3274 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m:328 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
m:329 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
m:329 [in Undecidability.TM.Hoare.HoareExamples]
m:33 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
m:33 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
m:33 [in Complexity.Complexity.ONotationIsAppropriate]
M:33 [in Complexity.L.TM.TMunflatten]
m:33 [in Undecidability.TM.TM]
m:33 [in Undecidability.TM.SBTM]
M:33 [in Undecidability.L.Computability.Rice]
m:331 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
M:332 [in Undecidability.TM.Util.TM_facts]
m:333 [in Undecidability.TM.Hoare.HoareExamples]
M:334 [in Complexity.TM.PrettyBounds.M2MBounds]
M:335 [in Undecidability.TM.Hoare.HoareRegister]
m:336 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
m:337 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
M:34 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
m:34 [in Undecidability.TM.Code.NatTM]
M:34 [in Complexity.L.TM.TMflatComp]
m:34 [in Complexity.L.TM.TMflatten]
m:34 [in Complexity.L.AbstractMachines.FunctionalDefinitions]
m:34 [in Undecidability.Shared.Libs.DLW.Utils.seteq]
M:34 [in Undecidability.TM.Univ.Univ]
m:344 [in Undecidability.TM.Hoare.HoareRegister]
M:344 [in Undecidability.TM.Util.TM_facts]
m:3452 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m:3462 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m:3472 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
M:35 [in Complexity.NP.TM.TMGenNP]
m:35 [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
m:35 [in Undecidability.Shared.Libs.DLW.Utils.fin_base]
m:35 [in Complexity.L.AbstractMachines.AbstractSubstMachine]
m:35 [in Undecidability.TM.Code.Copy]
m:35 [in Undecidability.TM.Util.TM_facts]
m:350 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
m:353 [in Undecidability.TM.Single.StepTM]
m:3537 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m:354 [in Undecidability.TM.Hoare.HoareRegister]
m:3542 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m:3547 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m:3552 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m:358 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
M:3597 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m:36 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
m:36 [in Undecidability.Shared.Libs.PSL.Vectors.Fin]
m:36 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
m:36 [in Undecidability.Shared.Libs.DLW.Utils.php]
m:36 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
m:36 [in Undecidability.TM.Lifting.LiftTapes]
m:3624 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
M:3630 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m:364 [in Undecidability.TM.Single.StepTM]
m:364 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
m:364 [in Undecidability.TM.Hoare.HoareExamples]
m:365 [in Undecidability.TM.Hoare.HoareRegister]
m:3658 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m:3664 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m:3666 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m:368 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
m:3683 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m:369 [in Undecidability.TM.Single.StepTM]
m:369 [in Undecidability.TM.Hoare.HoareExamples]
m:37 [in Undecidability.L.Computability.Enum]
M:37 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
M:37 [in Undecidability.TM.SBTM]
m:37 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
m:3705 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
M:372 [in Undecidability.TM.Util.TM_facts]
m:375 [in Undecidability.TM.Single.StepTM]
m:375 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
m:379 [in Undecidability.TM.Hoare.HoareRegister]
m:38 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
M:38 [in Complexity.L.TM.TMflat]
M:38 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
M:38 [in Undecidability.TM.TM]
m:381 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
M:383 [in Undecidability.TM.Util.TM_facts]
M:389 [in Undecidability.TM.Util.TM_facts]
m:39 [in Undecidability.Shared.Libs.DLW.Utils.quotient]
M:39 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
M:39 [in Undecidability.TM.Univ.Univ]
m:391 [in Undecidability.TM.Hoare.HoareExamples]
m:394 [in Undecidability.TM.Hoare.HoareRegister]
m:396 [in Undecidability.TM.Hoare.HoareExamples]
m:398 [in Undecidability.TM.Hoare.HoareExamples]
M:4 [in Complexity.NP.TM.mTM_to_singleTapeTM]
m:4 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
m:4 [in Undecidability.L.Functions.Ackermann]
m:40 [in Undecidability.Synthetic.EnumerabilityFacts]
m:40 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
M:40 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
M:40 [in Complexity.NP.TM.M_multi2mono]
m:40 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
m:40 [in Undecidability.Shared.Libs.DLW.Vec.pos]
m:400 [in Undecidability.TM.Hoare.HoareExamples]
m:402 [in Undecidability.TM.Hoare.HoareExamples]
m:404 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
m:404 [in Undecidability.TM.Hoare.HoareExamples]
M:406 [in Undecidability.TM.Util.TM_facts]
m:407 [in Undecidability.TM.Hoare.HoareExamples]
m:408 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
m:409 [in Undecidability.TM.Hoare.HoareExamples]
m:41 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
M:41 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
M:41 [in Undecidability.TM.SBTM]
m:412 [in Undecidability.TM.Hoare.HoareRegister]
m:42 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_nat_facts]
M:42 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
M:42 [in Complexity.NP.SAT.CookLevin.Subproblems.TM_single]
m:42 [in Undecidability.Shared.Libs.DLW.Code.subcode]
M:42 [in Undecidability.TM.Univ.Univ]
m:420 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
m:425 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
m:427 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
M:43 [in Complexity.L.TM.TMflatComp]
M:43 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
m:43 [in Undecidability.TM.Code.Copy]
m:448 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
m:45 [in Undecidability.TM.Code.NatTM]
M:45 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
m:45 [in Undecidability.Synthetic.ListEnumerabilityFacts]
m:45 [in Undecidability.Shared.Libs.DLW.Vec.pos]
m:456 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
m:46 [in Undecidability.Shared.Libs.DLW.Utils.quotient]
M:46 [in Complexity.NP.TM.TMGenNP]
M:46 [in Complexity.L.TM.TMflatComp]
M:46 [in Undecidability.TM.TM]
m:46 [in Undecidability.TM.Lifting.LiftTapes]
m:46 [in Undecidability.Shared.Libs.DLW.Code.subcode]
m:462 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
m:466 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
m:47 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
m:47 [in Undecidability.Shared.Libs.DLW.Utils.quotient]
m:47 [in Undecidability.Shared.Libs.DLW.Utils.php]
m:47 [in Complexity.L.AbstractMachines.AbstractSubstMachine]
M:47 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
m:47 [in Undecidability.TM.Single.EncodeTapes]
m:470 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
m:477 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
M:48 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
M:48 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
M:48 [in Undecidability.TM.SBTM]
m:487 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
m:49 [in Undecidability.TM.Code.NatTM]
m:49 [in Undecidability.Shared.Libs.DLW.Utils.list_bool]
m:49 [in Undecidability.Shared.Libs.DLW.Utils.php]
M:49 [in Complexity.NP.SAT.CookLevin.Subproblems.SingleTMGenNP]
m:49 [in Undecidability.Shared.Libs.DLW.Utils.fin_base]
m:49 [in Complexity.Complexity.SpaceBoundsTime]
m:493 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
m:498 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
m:5 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
M:5 [in Complexity.NP.TM.TMGenNP]
m:5 [in Undecidability.Shared.embed_nat]
m:5 [in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
m:5 [in Undecidability.L.Prelim.MoreList]
m:50 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
m:50 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
m:50 [in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
m:50 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
m:50 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_nat_facts]
m:50 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
M:50 [in Undecidability.TM.Univ.Univ]
m:504 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
m:509 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
m:51 [in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
m:51 [in Undecidability.TM.Code.NatTM]
M:51 [in Complexity.NP.TM.TMGenNP]
m:51 [in Undecidability.Shared.Libs.DLW.Utils.php]
m:51 [in Complexity.L.AbstractMachines.AbstractSubstMachine]
m:51 [in Undecidability.TM.Lifting.LiftTapes]
m:51 [in Undecidability.Shared.Libs.DLW.Vec.pos]
m:514 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
m:519 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
m:52 [in Undecidability.L.Datatypes.LNat]
m:525 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
m:53 [in Undecidability.L.Util.L_facts]
m:53 [in Undecidability.L.Computability.Enum]
m:53 [in Undecidability.Shared.Libs.DLW.Utils.php]
m:53 [in Undecidability.TM.Code.Copy]
m:53 [in Undecidability.Shared.Libs.DLW.Vec.pos]
m:530 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
m:535 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
m:54 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
m:54 [in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
m:54 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
M:54 [in Undecidability.TM.TM]
m:54 [in Undecidability.Synthetic.ListEnumerabilityFacts]
m:54 [in Complexity.L.AbstractMachines.FunctionalDefinitions]
m:54 [in Undecidability.TM.Single.EncodeTapes]
m:540 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
m:546 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
m:55 [in Undecidability.TM.Code.NatTM]
m:55 [in Undecidability.L.Complexity.ResourceMeasures]
m:55 [in Undecidability.Shared.Libs.DLW.Utils.php]
m:55 [in Undecidability.Shared.Libs.DLW.Vec.pos]
m:551 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
m:56 [in Undecidability.L.Util.L_facts]
m:56 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
m:56 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
m:56 [in Undecidability.Shared.Libs.DLW.Utils.fin_base]
m:56 [in Complexity.Complexity.SpaceBoundsTime]
m:56 [in Undecidability.TM.Lifting.LiftTapes]
m:56 [in Undecidability.TM.Compound.Shift]
m:57 [in Undecidability.Shared.Libs.DLW.Utils.prime]
m:57 [in Undecidability.L.Tactics.GenEncode]
m:57 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
m:57 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
m:58 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
m:58 [in Undecidability.L.Complexity.ResourceMeasures]
M:58 [in Complexity.L.TM.TMflatFun]
m:58 [in Undecidability.TM.Code.Copy]
m:58 [in Undecidability.Shared.Libs.DLW.Vec.pos]
m:58 [in Undecidability.Shared.Libs.DLW.Code.sss]
m:59 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
m:59 [in Complexity.Complexity.SpaceBoundsTime]
M:59 [in Undecidability.TM.Univ.Univ]
M:6 [in Undecidability.TM.Hoare.HoareLegacy]
m:6 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
m:6 [in Undecidability.L.Prelim.MoreBase]
m:6 [in Undecidability.Shared.Libs.DLW.Wf.wf_incl]
m:6 [in Undecidability.L.Datatypes.LVector]
m:6 [in Undecidability.Shared.Libs.DLW.Utils.php]
m:6 [in Undecidability.TM.SBTM]
m:6 [in Undecidability.TM.Lifting.LiftTapes]
m:6 [in Undecidability.Shared.Libs.DLW.Utils.seteq]
M:6 [in Undecidability.TM.PrettyBounds.MaxList]
m:6 [in Undecidability.L.Computability.Computability]
m:60 [in Undecidability.Shared.Libs.DLW.Utils.list_bool]
m:61 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
m:61 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
m:61 [in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
m:61 [in Undecidability.Shared.Libs.DLW.Utils.php]
M:61 [in Complexity.L.TM.TMflatFun]
m:61 [in Undecidability.TM.Lifting.LiftTapes]
m:61 [in Undecidability.TM.Hoare.HoareMult]
m:61 [in Undecidability.Shared.Libs.DLW.Vec.pos]
m:62 [in Undecidability.L.Complexity.ResourceMeasures]
m:62 [in Undecidability.TM.Compound.Shift]
m:625 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
m:63 [in Undecidability.Shared.Libs.DLW.Utils.prime]
M:63 [in Complexity.L.TM.TMflatComp]
m:63 [in Undecidability.Shared.Libs.DLW.Utils.list_bool]
m:63 [in Undecidability.Shared.Libs.DLW.Utils.php]
m:631 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
m:635 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
m:64 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
m:64 [in Undecidability.Shared.Libs.DLW.Vec.pos]
m:641 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
m:65 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
m:65 [in Undecidability.L.Complexity.ResourceMeasures]
m:65 [in Complexity.L.TM.TMflatComp]
m:65 [in Complexity.Complexity.SpaceBoundsTime]
m:650 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
m:655 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
m:659 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
m:66 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
m:66 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
m:66 [in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
m:66 [in Undecidability.L.Tactics.GenEncode]
m:66 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
M:66 [in Complexity.L.TM.TMflatComp]
m:66 [in Undecidability.L.Computability.Synthetic]
m:663 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
m:668 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
m:67 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
m:67 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
m:67 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
M:67 [in Undecidability.TM.Univ.Univ]
m:674 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
m:677 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
m:68 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
m:68 [in Undecidability.L.Complexity.ResourceMeasures]
m:68 [in Complexity.L.TM.TMflatComp]
m:68 [in Complexity.L.TM.TMunflatten]
M:68 [in Complexity.L.TM.TMflatFun]
m:683 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
m:69 [in Complexity.Complexity.SpaceBoundsTime]
m:69 [in Undecidability.TM.Code.Copy]
m:690 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
m:698 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
m:7 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
m:7 [in Undecidability.Shared.Libs.DLW.Utils.sorting]
m:7 [in Complexity.L.AbstractMachines.AbstractHeapMachine]
m:70 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
m:70 [in Undecidability.Shared.Libs.DLW.Utils.prime]
m:70 [in Undecidability.Shared.Libs.DLW.Utils.list_bool]
m:70 [in Undecidability.Shared.Libs.DLW.Utils.php]
M:70 [in Complexity.L.TM.TMunflatten]
m:70 [in Complexity.NP.SAT.CookLevin.Subproblems.CC]
m:702 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
m:71 [in Undecidability.Synthetic.Infinite]
m:72 [in Undecidability.L.Complexity.ResourceMeasures]
M:72 [in Complexity.L.TM.TMflatFun]
m:73 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
m:73 [in Complexity.Libs.CookPrelim.PolyBounds]
m:73 [in Undecidability.Shared.Libs.DLW.Utils.php]
m:73 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
m:73 [in Undecidability.Synthetic.Infinite]
m:734 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
m:737 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
m:74 [in Undecidability.L.Complexity.ResourceMeasures]
m:74 [in Undecidability.Shared.Libs.DLW.Utils.list_bool]
m:74 [in Undecidability.TM.Univ.LowLevel]
m:74 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
m:74 [in Undecidability.TM.Code.Copy]
m:75 [in Undecidability.L.Computability.Enum]
m:75 [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
m:75 [in Undecidability.Shared.Libs.DLW.Utils.php]
m:75 [in Complexity.L.TM.TMunflatten]
M:75 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
m:75 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
M:75 [in Complexity.L.TM.TMflatFun]
m:76 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
m:76 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
m:76 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
m:76 [in Undecidability.L.Complexity.ResourceMeasures]
m:77 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
m:77 [in Undecidability.Shared.Libs.DLW.Utils.php]
m:78 [in Undecidability.L.Datatypes.LVector]
m:78 [in Undecidability.Synthetic.Infinite]
m:79 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
m:79 [in Undecidability.L.Computability.Enum]
m:79 [in Undecidability.TM.L.CompilerBoolFuns.Compiler]
m:8 [in Undecidability.Shared.Libs.PSL.Lists.Position]
m:8 [in Undecidability.TM.TM]
m:8 [in Undecidability.L.Functions.Ackermann]
m:8 [in Undecidability.Synthetic.ListEnumerabilityFacts]
m:80 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
m:80 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
M:80 [in Complexity.L.TM.TMflatComp]
m:80 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
m:80 [in Undecidability.Shared.Libs.DLW.Vec.pos]
m:82 [in Undecidability.L.Computability.Enum]
m:82 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
m:82 [in Undecidability.Shared.Libs.DLW.Vec.pos]
M:83 [in Complexity.L.TM.TMflatComp]
m:83 [in Undecidability.Shared.Libs.DLW.Utils.php]
m:84 [in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
m:84 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
m:85 [in Complexity.Complexity.UpToCPoly]
m:85 [in Undecidability.TM.L.CompilerBoolFuns.Compiler]
m:87 [in Undecidability.Shared.Libs.DLW.Vec.pos]
m:872 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
m:89 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
m:89 [in Undecidability.TM.Util.Prelim]
m:89 [in Undecidability.L.Computability.Synthetic]
m:89 [in Undecidability.Shared.Libs.DLW.Code.sss]
M:9 [in Undecidability.TM.Combinators.Combinators]
m:9 [in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
m:9 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
m:90 [in Undecidability.TM.Code.NatTM]
m:90 [in Undecidability.Shared.Libs.DLW.Vec.pos]
m:91 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
m:91 [in Undecidability.TM.L.CompilerBoolFuns.Compiler]
m:92 [in Undecidability.TM.Util.Prelim]
m:922 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
m:928 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
m:93 [in Undecidability.Shared.Libs.DLW.Vec.pos]
m:934 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
m:94 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
m:95 [in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
m:97 [in Undecidability.Shared.Libs.DLW.Vec.pos]
M:99 [in Undecidability.TM.Univ.Univ]

N

name:10 [in Undecidability.L.Tactics.GenEncode]
name:113 [in Undecidability.L.Tactics.Extract]
name:116 [in Undecidability.L.Tactics.Extract]
newSymbols:130 [in Undecidability.TM.Single.StepTM]
news:261 [in Undecidability.TM.Util.TM_facts]
news:44 [in Complexity.L.TM.TMflatFun]
news:7 [in Undecidability.L.TM.TMinL.TMinL_extract]
nextState:24 [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
nfVar:57 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
nf':135 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
nf':146 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
nf':150 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
nf':154 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
nf':216 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
nf':220 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
nf':249 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
nf':261 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
nf':287 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
nf':300 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
nf':305 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
nf':310 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
nf':66 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
nf:134 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
nf:145 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
nf:149 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
nf:153 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
nf:215 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
nf:219 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
nf:246 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
nf:260 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
nf:286 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
nf:299 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
nf:304 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
nf:309 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
nf:349 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
nf:63 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
nm:208 [in Undecidability.L.Tactics.Extract]
nm:239 [in Undecidability.L.Tactics.Extract]
nm:246 [in Undecidability.L.Tactics.Extract]
norm:20 [in Undecidability.Shared.Libs.PSL.FiniteTypes.Arbitrary]
num:127 [in Undecidability.L.Tactics.Extract]
num:138 [in Undecidability.L.Tactics.Extract]
num:148 [in Undecidability.L.Tactics.Extract]
num:247 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
num:249 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
num:35 [in Undecidability.L.Tactics.GenEncode]
N'':72 [in Complexity.NP.Clique.kSAT_to_Clique]
n':104 [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
n':111 [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
n':115 [in Undecidability.TM.Single.StepTM]
n':119 [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
n':127 [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
n':13 [in Complexity.L.AbstractMachines.UnfoldHeap]
n':134 [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
n':14 [in Undecidability.L.Prelim.LoopSum]
n':14 [in Undecidability.L.Computability.MuRec]
n':141 [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
n':149 [in Undecidability.L.Prelim.ARS]
n':161 [in Undecidability.TM.Lifting.LiftTapes]
n':17 [in Complexity.L.Datatypes.LBinNums]
n':178 [in Undecidability.L.Util.L_facts]
n':182 [in Undecidability.L.Util.L_facts]
n':186 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
n':19 [in Undecidability.L.Computability.MuRec]
n':196 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
n':20 [in Undecidability.L.Computability.MuRec]
n':205 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
n':21 [in Complexity.NP.TM.M_multi2mono]
n':216 [in Undecidability.L.Prelim.ARS]
n':22 [in Undecidability.L.Computability.MuRec]
n':23 [in Complexity.Complexity.ONotation]
n':25 [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
n':25 [in Undecidability.L.Computability.MuRec]
n':27 [in Complexity.NP.TM.M_multi2mono]
n':28 [in Undecidability.L.Functions.LoopSum]
n':28 [in Complexity.L.AbstractMachines.Computable.Unfolding]
n':28 [in Undecidability.L.Computability.MuRec]
n':2842 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
n':2845 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
n':2848 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
n':29 [in Undecidability.L.Computability.MuRec]
n':31 [in Complexity.NP.TM.M_multi2mono]
n':32 [in Undecidability.Synthetic.Infinite]
n':34 [in Complexity.NP.TM.M_multi2mono]
n':38 [in Undecidability.L.Functions.UnboundIteration]
n':47 [in Undecidability.TM.Util.VectorPrelim]
n':48 [in Undecidability.L.Functions.EqBool]
n':48 [in Complexity.NP.TM.M_multi2mono]
n':49 [in Undecidability.TM.Single.StepTM]
n':5 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
n':50 [in Undecidability.Synthetic.Infinite]
n':51 [in Undecidability.TM.Util.VectorPrelim]
n':52 [in Undecidability.TM.Single.StepTM]
n':55 [in Undecidability.L.Functions.EqBool]
n':6 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
N':68 [in Complexity.NP.Clique.kSAT_to_Clique]
n':7 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
n':71 [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
n':72 [in Complexity.NP.TM.M_multi2mono]
n':74 [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
n':75 [in Undecidability.TM.Single.StepTM]
n':77 [in Undecidability.L.Datatypes.LVector]
n':8 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
n':82 [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
n':9 [in Complexity.L.AbstractMachines.Computable.Lookup]
n':90 [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
n':97 [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
n0:14 [in Complexity.L.AbstractMachines.Computable.UnivDecTime]
n0:18 [in Undecidability.L.Computability.MuRec]
n0:20 [in Complexity.Complexity.ONotation]
n0:21 [in Undecidability.L.Computability.MuRec]
n0:27 [in Undecidability.L.Computability.MuRec]
n0:3 [in Undecidability.Shared.Libs.PSL.FiniteTypes.Arbitrary]
n0:3 [in Undecidability.L.Computability.Por]
n0:34 [in Undecidability.L.Functions.UnboundIteration]
n0:4 [in Complexity.Complexity.ONotation]
n0:41 [in Complexity.Complexity.ONotationIsAppropriate]
n0:47 [in Complexity.Complexity.ONotation]
n0:5 [in Complexity.Complexity.ONotationIsAppropriate]
n0:5 [in Undecidability.Shared.Libs.PSL.FiniteTypes.Arbitrary]
n0:53 [in Undecidability.L.Computability.Synthetic]
n0:85 [in Complexity.Complexity.Definitions]
n0:88 [in Undecidability.L.Datatypes.LVector]
n0:9 [in Complexity.Complexity.ONotationIsAppropriate]
N1:10 [in Complexity.NP.SAT.kSAT]
n1:107 [in Undecidability.TM.Single.StepTM]
n1:11 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n1:17 [in Undecidability.L.Computability.Enum]
n1:18 [in Undecidability.TM.Util.VectorPrelim]
n1:219 [in Undecidability.L.Prelim.ARS]
n1:230 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
n1:244 [in Complexity.Libs.CookPrelim.MorePrelim]
n1:275 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n1:280 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n1:284 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n1:289 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n1:294 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n1:299 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n1:308 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n1:3116 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
n1:3129 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
n1:313 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n1:3151 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
n1:3155 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
n1:318 [in Complexity.Libs.CookPrelim.MorePrelim]
n1:319 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n1:323 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
N1:33 [in Complexity.NP.SAT.SAT]
n1:4 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n1:4 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
n1:41 [in Undecidability.Shared.Libs.DLW.Utils.quotient]
n1:43 [in Undecidability.TM.Single.EncodeTapes]
n1:44 [in Complexity.NP.Clique.kSAT_to_FlatClique]
n1:57 [in Undecidability.L.Computability.Enum]
n1:6 [in Complexity.NP.Clique.kSAT_to_Clique]
n1:61 [in Undecidability.Shared.Libs.PSL.Vectors.VectorDupfree]
N1:62 [in Complexity.NP.SAT.SAT_inNP]
N1:74 [in Complexity.NP.SAT.SAT]
n1:77 [in Undecidability.L.Computability.Enum]
n1:8 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n1:97 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
N2:11 [in Complexity.NP.SAT.kSAT]
n2:12 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n2:18 [in Undecidability.L.Computability.Enum]
n2:19 [in Undecidability.TM.Util.VectorPrelim]
n2:220 [in Undecidability.L.Prelim.ARS]
n2:232 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
n2:245 [in Complexity.Libs.CookPrelim.MorePrelim]
n2:276 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n2:281 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n2:285 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n2:290 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n2:295 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n2:300 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n2:309 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n2:3117 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
n2:3130 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
n2:314 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n2:3152 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
n2:3156 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
n2:319 [in Complexity.Libs.CookPrelim.MorePrelim]
n2:320 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n2:324 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
N2:34 [in Complexity.NP.SAT.SAT]
n2:42 [in Undecidability.Shared.Libs.DLW.Utils.quotient]
n2:45 [in Complexity.NP.Clique.kSAT_to_FlatClique]
n2:5 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n2:5 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
n2:58 [in Undecidability.L.Computability.Enum]
n2:62 [in Undecidability.Shared.Libs.PSL.Vectors.VectorDupfree]
N2:63 [in Complexity.NP.SAT.SAT_inNP]
n2:7 [in Complexity.NP.Clique.kSAT_to_Clique]
n2:72 [in Undecidability.L.Tactics.GenEncode]
N2:75 [in Complexity.NP.SAT.SAT]
n2:78 [in Undecidability.L.Computability.Enum]
n2:9 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n2:98 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
n3:277 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n3:282 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n3:286 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n3:291 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n3:296 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n3:301 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n3:310 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n3:3118 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
n3:3131 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
n3:315 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n3:3153 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
n3:3157 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
n3:321 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n3:325 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n3:64 [in Undecidability.L.Tactics.GenEncode]
n3:74 [in Undecidability.L.Tactics.GenEncode]
n4:278 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n4:283 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n4:287 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n4:292 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n4:297 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n4:302 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n4:311 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n4:3119 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
n4:3132 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
n4:3154 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
n4:3158 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
n4:316 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n4:322 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n4:326 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n4:67 [in Undecidability.L.Tactics.GenEncode]
n:1 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:1 [in Undecidability.L.Tactics.Extract]
n:1 [in Undecidability.TM.Code.BinNumbers.NTM]
n:1 [in Undecidability.Shared.Libs.PSL.FiniteTypes.VectorFin]
n:1 [in Undecidability.Shared.Libs.PSL.Vectors.Fin]
n:1 [in Undecidability.Shared.Libs.DLW.Utils.utils_string]
n:1 [in Complexity.TM.PrettyBounds.BaseCodeSpace]
n:1 [in Undecidability.L.Datatypes.LTerm]
n:1 [in Undecidability.Shared.Libs.DLW.Utils.binomial]
n:1 [in Undecidability.L.Functions.Ackermann]
n:1 [in Undecidability.Shared.Libs.PSL.FiniteTypes.Arbitrary]
n:1 [in Complexity.Complexity.SpaceBoundsTime]
N:1 [in Complexity.NP.Clique.kSAT_to_Clique]
n:1 [in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
n:1 [in Undecidability.Shared.Libs.DLW.Vec.pos]
n:1 [in Undecidability.L.Functions.Encoding]
n:1 [in Undecidability.L.Prelim.MoreList]
n:10 [in Complexity.L.Datatypes.LBinNums]
n:10 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
n:10 [in Undecidability.L.Util.L_facts]
n:10 [in Undecidability.TM.Single.StepTM]
n:10 [in Undecidability.TM.Code.List.Nth]
n:10 [in Undecidability.L.Computability.Enum]
n:10 [in Undecidability.TM.Util.VectorPrelim]
n:10 [in Undecidability.L.Prelim.MoreBase]
n:10 [in Undecidability.L.Tactics.LClos_Eval]
n:10 [in Undecidability.L.Datatypes.LVector]
n:10 [in Undecidability.Shared.Libs.DLW.Utils.binomial]
n:10 [in Complexity.Complexity.ONotationIsAppropriate]
n:10 [in Complexity.L.TM.TMflat]
n:10 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
n:10 [in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
n:10 [in Complexity.TM.Single.DecodeTapes]
n:10 [in Undecidability.L.Functions.EnumInt]
n:10 [in Complexity.NP.SAT.CookLevin.Reductions.FlatTCC_to_FlatCC]
n:10 [in Undecidability.TM.L.CaseCom]
n:10 [in Undecidability.L.Computability.MuRec]
n:10 [in Complexity.NP.SAT.kSAT_to_SAT]
n:10 [in Complexity.NP.SAT.CookLevin.Reductions.CC_to_BinaryCC]
n:100 [in Undecidability.TM.Single.StepTM]
n:100 [in Undecidability.Shared.Libs.DLW.Utils.sorting]
n:100 [in Undecidability.TM.Hoare.HoareCombinators]
n:101 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:101 [in Undecidability.Shared.Libs.DLW.Vec.vec]
n:101 [in Undecidability.L.Computability.Seval]
n:101 [in Undecidability.L.Tactics.LClos]
n:101 [in Undecidability.TM.Code.NatTM]
n:101 [in Undecidability.L.Tactics.LClos_Eval]
n:101 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
n:101 [in Undecidability.TM.L.HeapInterpreter.LookupTM]
N:101 [in Complexity.NP.Clique.kSAT_to_FlatClique]
n:1018 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:102 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:102 [in Undecidability.L.Tactics.Extract]
n:102 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
n:102 [in Undecidability.TM.Hoare.HoareMult]
n:1026 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:1028 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:103 [in Complexity.L.AbstractMachines.AbstractHeapMachine]
n:103 [in Undecidability.Shared.Libs.DLW.Vec.pos]
n:103 [in Undecidability.TM.Hoare.HoareExamples]
n:103 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:1031 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:1034 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:1039 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:104 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
n:104 [in Undecidability.TM.Code.List.Nth]
n:104 [in Complexity.Libs.CookPrelim.PolyBounds]
n:104 [in Complexity.L.TM.TMunflatten]
n:104 [in Undecidability.Synthetic.ListEnumerabilityFacts]
n:104 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
n:1046 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:1049 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:105 [in Undecidability.L.Prelim.ARS]
n:105 [in Complexity.TM.PrettyBounds.BaseCodeSpace]
n:105 [in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
n:105 [in Undecidability.Shared.Libs.DLW.Utils.fin_base]
n:105 [in Undecidability.L.Tactics.Reflection]
n:105 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
N:105 [in Complexity.NP.Clique.kSAT_to_FlatClique]
n:1051 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:1053 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:1054 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:1056 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:1059 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:106 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
n:106 [in Undecidability.Shared.Libs.DLW.Utils.sorting]
n:106 [in Undecidability.TM.Hoare.HoareRegister]
n:106 [in Undecidability.TM.L.HeapInterpreter.LookupTM]
n:106 [in Undecidability.Shared.Libs.DLW.Vec.pos]
n:1064 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:1069 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:107 [in Undecidability.Shared.Libs.DLW.Vec.vec]
n:107 [in Complexity.NP.Clique.kSAT_to_FlatClique]
n:1071 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:1075 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:1079 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:108 [in Undecidability.L.Computability.Seval]
n:108 [in Undecidability.TM.Hoare.HoareMult]
n:108 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
n:1082 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:1084 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:1088 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:109 [in Complexity.TM.PrettyBounds.BaseCode]
n:109 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:109 [in Undecidability.TM.Code.List.Nth]
n:109 [in Undecidability.TM.Code.NatTM]
n:109 [in Complexity.NP.Clique.FlatClique]
n:109 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
n:109 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
n:109 [in Undecidability.Synthetic.ListEnumerabilityFacts]
n:109 [in Undecidability.TM.Hoare.HoareLogic]
n:109 [in Undecidability.Shared.Libs.DLW.Vec.pos]
N:109 [in Complexity.NP.Clique.kSAT_to_FlatClique]
n:1092 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:1096 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:11 [in Undecidability.Shared.Libs.PSL.Numbers]
n:11 [in Complexity.L.Datatypes.LBinNums]
n:11 [in Undecidability.Shared.Libs.DLW.Vec.vec]
n:11 [in Undecidability.Shared.Libs.DLW.Utils.prime]
n:11 [in Undecidability.L.Functions.LoopSum]
n:11 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
n:11 [in Complexity.L.AbstractMachines.Computable.Unfolding]
n:11 [in Undecidability.Shared.Libs.PSL.Vectors.Fin]
n:11 [in Undecidability.Shared.Libs.DLW.Utils.utils_string]
N:11 [in Complexity.NP.SAT.SAT_inNP]
n:11 [in Undecidability.Shared.Libs.DLW.Utils.binomial]
n:11 [in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
n:11 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
n:11 [in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
n:11 [in Complexity.NP.SAT.kSAT_to_SAT]
n:110 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
n:110 [in Undecidability.L.Tactics.LClos_Eval]
n:110 [in Undecidability.Shared.Libs.DLW.Utils.sorting]
n:110 [in Undecidability.L.Tactics.Reflection]
n:110 [in Complexity.NP.Clique.kSAT_to_Clique]
n:110 [in Undecidability.TM.L.HeapInterpreter.LookupTM]
n:110 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:1100 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:1103 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:1105 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:111 [in Undecidability.Shared.Libs.DLW.Vec.vec]
n:111 [in Undecidability.TM.Code.List.Nth]
n:111 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
n:111 [in Undecidability.L.Tactics.LClos]
n:111 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
n:111 [in Complexity.Libs.CookPrelim.PolyBounds]
n:111 [in Complexity.L.TM.TMunflatten]
n:111 [in Undecidability.Shared.Libs.DLW.Vec.pos]
n:1110 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:1118 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:112 [in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
N:112 [in Complexity.NP.Clique.kSAT_to_FlatClique]
n:1123 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:113 [in Complexity.Libs.CookPrelim.FlatFinTypes]
n:113 [in Undecidability.Shared.Libs.DLW.Utils.sums]
n:113 [in Undecidability.TM.Hoare.HoareRegister]
n:114 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
n:114 [in Undecidability.Shared.Libs.DLW.Utils.sorting]
n:114 [in Undecidability.TM.Hoare.HoareRegister]
n:114 [in Undecidability.TM.Hoare.HoareMult]
N:114 [in Complexity.NP.Clique.kSAT_to_FlatClique]
n:115 [in Undecidability.Shared.Libs.DLW.Vec.vec]
n:115 [in Undecidability.TM.Code.NatTM]
n:115 [in Undecidability.TM.Code.CodeTM]
n:115 [in Undecidability.TM.Hoare.HoareCombinators]
n:115 [in Complexity.NP.Clique.kSAT_to_FlatClique]
n:116 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
n:116 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
n:116 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
n:116 [in Undecidability.Shared.Libs.DLW.Utils.sums]
n:116 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
n:116 [in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
n:116 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:117 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:117 [in Complexity.Complexity.PolyTimeComputable]
n:117 [in Undecidability.TM.L.HeapInterpreter.LookupTM]
n:117 [in Undecidability.Shared.Libs.DLW.Vec.pos]
N:117 [in Complexity.NP.Clique.kSAT_to_FlatClique]
n:117 [in Complexity.Libs.CookPrelim.MorePrelim]
n:118 [in Complexity.TM.PrettyBounds.M2MBounds]
n:118 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:118 [in Undecidability.TM.Code.NatTM]
n:118 [in Undecidability.TM.Hoare.HoareRegister]
n:118 [in Complexity.NP.Clique.FlatClique]
n:118 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
n:118 [in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
n:118 [in Complexity.Complexity.PolyTimeComputable]
n:119 [in Undecidability.TM.Code.List.Nth]
n:119 [in Undecidability.Synthetic.ListEnumerabilityFacts]
n:119 [in Undecidability.TM.Hoare.HoareMult]
n:119 [in Undecidability.TM.Hoare.HoareLogic]
n:119 [in Complexity.Complexity.PolyTimeComputable]
n:119 [in Undecidability.Shared.Libs.DLW.Vec.pos]
N:119 [in Complexity.NP.Clique.kSAT_to_FlatClique]
n:12 [in Undecidability.TM.Single.StepTM]
n:12 [in Undecidability.Shared.Libs.PSL.Prelim]
n:12 [in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
n:12 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
n:12 [in Complexity.L.AbstractMachines.Computable.Unfolding]
n:12 [in Undecidability.Synthetic.EnumerabilityFacts]
n:12 [in Undecidability.Shared.Libs.PSL.FiniteTypes.VectorFin]
n:12 [in Complexity.L.AbstractMachines.UnfoldHeap]
n:12 [in Undecidability.Shared.Libs.DLW.Wf.wf_incl]
n:12 [in Undecidability.Shared.embed_nat]
n:12 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
n:12 [in Undecidability.Synthetic.MoreEnumerabilityFacts]
n:12 [in Complexity.Complexity.SpaceBoundsTime]
n:12 [in Undecidability.L.Functions.UnboundIteration]
n:12 [in Undecidability.Shared.Libs.DLW.Wf.wf_finite]
n:12 [in Complexity.NP.SAT.CookLevin.Reductions.FlatTCC_to_FlatCC]
n:12 [in Undecidability.L.Computability.MuRec]
n:12 [in Undecidability.Shared.Libs.DLW.Vec.pos]
n:12 [in Complexity.Libs.CookPrelim.MorePrelim]
n:120 [in Undecidability.Shared.Libs.DLW.Vec.vec]
n:120 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
n:120 [in Undecidability.TM.Code.CodeTM]
n:120 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
n:120 [in Undecidability.Synthetic.ListEnumerabilityFacts]
n:120 [in Complexity.Complexity.PolyTimeComputable]
n:121 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
n:121 [in Undecidability.TM.Single.StepTM]
n:121 [in Undecidability.Shared.Libs.DLW.Vec.pos]
N:121 [in Complexity.NP.Clique.kSAT_to_FlatClique]
n:122 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
n:122 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
n:122 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:123 [in Undecidability.TM.Single.StepTM]
n:123 [in Undecidability.Shared.Libs.DLW.Utils.sorting]
N:123 [in Complexity.NP.Clique.kSAT_to_FlatClique]
n:124 [in Undecidability.Shared.Libs.DLW.Vec.vec]
n:124 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
n:124 [in Undecidability.TM.Hoare.HoareMult]
n:124 [in Undecidability.TM.Hoare.HoareCombinators]
n:124 [in Undecidability.Shared.Libs.DLW.Code.sss]
n:125 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:125 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
n:125 [in Undecidability.TM.Code.NatTM]
n:125 [in Complexity.NP.Clique.FlatClique]
N:125 [in Complexity.NP.Clique.kSAT_to_FlatClique]
n:126 [in Complexity.TM.PrettyBounds.M2MBounds]
n:126 [in Undecidability.Synthetic.ListEnumerabilityFacts]
n:126 [in Complexity.Complexity.PolyTimeComputable]
n:126 [in Complexity.Libs.CookPrelim.MorePrelim]
n:127 [in Undecidability.TM.Single.StepTM]
n:127 [in Undecidability.Synthetic.ListEnumerabilityFacts]
n:127 [in Complexity.Complexity.PolyTimeComputable]
N:127 [in Complexity.NP.Clique.kSAT_to_FlatClique]
n:128 [in Undecidability.Shared.Libs.DLW.Vec.vec]
n:128 [in Undecidability.TM.Code.NatTM]
n:128 [in Undecidability.Shared.Libs.DLW.Utils.sorting]
n:128 [in Complexity.Complexity.PolyTimeComputable]
n:128 [in Complexity.NP.Clique.kSAT_to_FlatClique]
n:129 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
n:129 [in Undecidability.TM.Code.List.Nth]
n:129 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
N:129 [in Complexity.L.ComparisonTimeBoundDerivation]
n:129 [in Undecidability.TM.Hoare.HoareMult]
n:129 [in Complexity.Complexity.PolyTimeComputable]
n:129 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:129 [in Complexity.Libs.CookPrelim.MorePrelim]
n:13 [in Undecidability.Shared.Libs.PSL.Numbers]
n:13 [in Complexity.Complexity.ONotation]
n:13 [in Complexity.L.Datatypes.LBinNums]
n:13 [in Undecidability.Shared.Libs.DLW.Utils.prime]
n:13 [in Undecidability.L.TM.TMinL]
n:13 [in Undecidability.TM.Single.StepTM]
n:13 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
n:13 [in Undecidability.L.Computability.Seval]
N:13 [in Complexity.NP.SAT.kSAT]
n:13 [in Undecidability.L.Prelim.LoopSum]
n:13 [in Complexity.Libs.CookPrelim.FlatFinTypes]
n:13 [in Undecidability.Shared.Libs.PSL.Inhabited]
N:13 [in Undecidability.Shared.FinTypeForallExists]
n:13 [in Undecidability.L.Datatypes.List.List_nat]
n:13 [in Undecidability.Shared.embed_nat]
n:13 [in Complexity.Complexity.ONotationIsAppropriate]
n:13 [in Complexity.Complexity.SpaceBoundsTime]
n:13 [in Undecidability.Synthetic.ListEnumerabilityFacts]
n:13 [in Undecidability.L.TM.TMEncoding]
n:13 [in Undecidability.Shared.Libs.PSL.Vectors.VectorDupfree]
n:13 [in Undecidability.TM.Code.Code]
n:13 [in Complexity.NP.SAT.CookLevin.Reductions.FlatTCC_to_FlatCC]
n:13 [in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
n:13 [in Undecidability.TM.Hoare.HoareLogic]
n:13 [in Undecidability.L.Computability.MuRec]
n:13 [in Undecidability.TM.L.HeapInterpreter.LookupTM]
n:13 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
n:130 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
n:130 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
n:130 [in Undecidability.TM.Hoare.HoareLogic]
N:130 [in Complexity.NP.Clique.kSAT_to_FlatClique]
n:131 [in Undecidability.L.Prelim.ARS]
n:131 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
N:131 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:132 [in Undecidability.Shared.Libs.DLW.Vec.vec]
n:132 [in Undecidability.TM.Code.NatTM]
n:132 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
n:133 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
n:133 [in Undecidability.TM.Single.StepTM]
N:133 [in Complexity.L.ComparisonTimeBoundDerivation]
n:133 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
n:133 [in Complexity.NP.Clique.kSAT_to_FlatClique]
n:134 [in Complexity.TM.PrettyBounds.M2MBounds]
n:134 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:134 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
n:134 [in Undecidability.TM.Hoare.HoareCombinators]
n:135 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:135 [in Undecidability.TM.Code.NatTM]
n:135 [in Complexity.NP.Clique.FlatClique]
n:135 [in Undecidability.TM.Hoare.HoareMult]
n:135 [in Complexity.Complexity.PolyTimeComputable]
N:135 [in Complexity.NP.Clique.kSAT_to_FlatClique]
n:136 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
N:136 [in Complexity.NP.SAT.SAT_inNP]
n:136 [in Undecidability.Synthetic.ListEnumerabilityFacts]
n:136 [in Complexity.Complexity.PolyTimeComputable]
n:136 [in Undecidability.Shared.Libs.DLW.Vec.pos]
n:136 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:137 [in Undecidability.Shared.Libs.DLW.Vec.vec]
n:137 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
n:137 [in Undecidability.Synthetic.ListEnumerabilityFacts]
n:137 [in Complexity.Complexity.PolyTimeComputable]
N:137 [in Complexity.NP.Clique.kSAT_to_FlatClique]
n:137 [in Complexity.Libs.CookPrelim.MorePrelim]
n:138 [in Undecidability.TM.Single.StepTM]
n:138 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
n:138 [in Undecidability.TM.Lifting.LiftTapes]
n:138 [in Complexity.Complexity.PolyTimeComputable]
n:138 [in Undecidability.Shared.Libs.DLW.Vec.pos]
n:139 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
n:139 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
n:139 [in Undecidability.TM.Code.NatTM]
n:139 [in Complexity.L.ComparisonTimeBoundDerivation]
n:139 [in Undecidability.TM.Lifting.LiftTapes]
N:139 [in Complexity.NP.Clique.kSAT_to_Clique]
n:139 [in Undecidability.TM.Hoare.HoareLogic]
N:139 [in Complexity.NP.Clique.kSAT_to_FlatClique]
n:139 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:14 [in Complexity.L.Datatypes.LBinNums]
n:14 [in Undecidability.Shared.Libs.DLW.Vec.vec]
n:14 [in Undecidability.L.Computability.Enum]
n:14 [in Complexity.NP.TM.TMGenNP]
N:14 [in Complexity.NP.SAT.SAT_inNP]
n:14 [in Undecidability.L.Datatypes.List.List_extra]
n:14 [in Undecidability.Shared.embed_nat]
n:14 [in Undecidability.L.Tactics.Reflection]
n:14 [in Complexity.NP.SAT.CookLevin.Reductions.FlatTCC_to_FlatCC]
n:14 [in Undecidability.L.Datatypes.LNat]
n:14 [in Undecidability.TM.Hoare.HoareCombinators]
n:140 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
n:140 [in Undecidability.L.Tactics.Extract]
n:140 [in Complexity.L.ComparisonTimeBoundDerivation]
N:140 [in Complexity.NP.SAT.SAT_inNP]
n:140 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:141 [in Complexity.TM.PrettyBounds.M2MBounds]
n:141 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:141 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
n:141 [in Undecidability.Synthetic.ListEnumerabilityFacts]
n:141 [in Undecidability.TM.Lifting.LiftTapes]
N:141 [in Complexity.NP.Clique.kSAT_to_Clique]
n:141 [in Undecidability.TM.Hoare.HoareMult]
n:141 [in Undecidability.Shared.Libs.DLW.Vec.pos]
n:141 [in Complexity.NP.Clique.kSAT_to_FlatClique]
n:142 [in Complexity.Libs.CookPrelim.FlatFinTypes]
n:142 [in Undecidability.Shared.Libs.DLW.Utils.sums]
n:142 [in Complexity.NP.Clique.kSAT_to_FlatClique]
n:143 [in Undecidability.TM.Single.StepTM]
n:143 [in Undecidability.TM.Hoare.HoareCombinators]
n:143 [in Complexity.NP.Clique.kSAT_to_FlatClique]
n:144 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
n:144 [in Undecidability.L.Tactics.Extract]
n:144 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
n:144 [in Complexity.NP.Clique.FlatClique]
n:144 [in Undecidability.Shared.Libs.DLW.Vec.pos]
n:145 [in Complexity.TM.PrettyBounds.M2MBounds]
n:145 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
n:145 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
n:145 [in Complexity.NP.SAT.SAT_inNP]
n:145 [in Complexity.Libs.CookPrelim.MorePrelim]
n:146 [in Undecidability.TM.Single.StepTM]
n:146 [in Complexity.NP.SAT.SAT_inNP]
n:146 [in Undecidability.TM.Lifting.LiftTapes]
n:146 [in Undecidability.TM.Hoare.HoareMult]
n:147 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
n:147 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
n:147 [in Undecidability.TM.Util.Relations]
n:147 [in Undecidability.Shared.Libs.DLW.Vec.pos]
n:148 [in Undecidability.L.Prelim.ARS]
n:148 [in Undecidability.Shared.Libs.DLW.Vec.pos]
N:148 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:149 [in Complexity.TM.PrettyBounds.M2MBounds]
n:149 [in Undecidability.TM.Single.StepTM]
n:149 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
n:149 [in Undecidability.TM.Hoare.HoareRegister]
n:149 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
n:15 [in Undecidability.TM.Code.List.Concat_Repeat]
n:15 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
n:15 [in Undecidability.TM.Single.StepTM]
n:15 [in Undecidability.TM.Code.CaseNat]
n:15 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
n:15 [in Undecidability.TM.Util.VectorPrelim]
n:15 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_nat_facts]
n:15 [in Undecidability.Shared.Libs.PSL.Inhabited]
n:15 [in Undecidability.L.Datatypes.LVector]
n:15 [in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
n:15 [in Undecidability.TM.Code.Code]
n:15 [in Complexity.NP.SAT.CookLevin.Reductions.FlatTCC_to_FlatCC]
n:15 [in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
n:15 [in Undecidability.L.Computability.MuRec]
N:15 [in Complexity.NP.SAT.SAT]
n:15 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
n:150 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:150 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
n:150 [in Undecidability.TM.Hoare.HoareMult]
n:150 [in Undecidability.TM.Hoare.HoareLogic]
n:150 [in Undecidability.Shared.Libs.DLW.Vec.pos]
n:151 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:151 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
n:151 [in Undecidability.TM.Lifting.LiftTapes]
n:152 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
n:152 [in Undecidability.TM.Hoare.HoareMult]
N:152 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:152 [in Complexity.Libs.CookPrelim.MorePrelim]
n:153 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
n:153 [in Undecidability.Shared.Libs.DLW.Vec.pos]
n:154 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
n:154 [in Undecidability.Shared.Libs.DLW.Utils.sums]
n:154 [in Undecidability.TM.Hoare.HoareMult]
n:155 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
n:155 [in Undecidability.TM.Lifting.LiftTapes]
n:156 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
n:156 [in Undecidability.Shared.Libs.DLW.Vec.pos]
N:156 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:157 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
n:157 [in Complexity.Libs.CookPrelim.PolyBounds]
n:157 [in Undecidability.TM.Hoare.HoareLogic]
n:157 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:158 [in Complexity.TM.PrettyBounds.M2MBounds]
n:158 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:158 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
n:158 [in Undecidability.Shared.Libs.DLW.Utils.sums]
n:158 [in Undecidability.TM.L.HeapInterpreter.StepTM]
n:158 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:159 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:159 [in Complexity.L.TM.TMunflatten]
n:159 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
n:159 [in Undecidability.TM.Code.Code]
n:159 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:159 [in Complexity.Libs.CookPrelim.MorePrelim]
n:16 [in Undecidability.Shared.Libs.PSL.FCI]
n:16 [in Undecidability.TM.Compound.TMTac]
n:16 [in Undecidability.TM.L.CompilerBoolFuns.NaryApp]
n:16 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
n:16 [in Complexity.L.Datatypes.LBinNums]
n:16 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
n:16 [in Undecidability.L.Computability.Seval]
n:16 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
n:16 [in Undecidability.TM.Code.List.Length]
n:16 [in Undecidability.Shared.FinTypeForallExists]
n:16 [in Undecidability.Shared.Libs.PSL.Vectors.Fin]
n:16 [in Undecidability.Shared.Libs.DLW.Utils.binomial]
n:16 [in Undecidability.L.AbstractMachines.FlatPro.UnfoldClos]
n:16 [in Undecidability.Shared.Libs.DLW.Utils.sums]
n:16 [in Complexity.Complexity.ONotationIsAppropriate]
n:16 [in Complexity.L.TM.TMunflatten]
n:16 [in Complexity.Complexity.SpaceBoundsTime]
n:16 [in Undecidability.L.Functions.UnboundIteration]
n:16 [in Complexity.L.TM.TMflatFun]
n:16 [in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
n:16 [in Undecidability.L.Functions.EnumInt]
n:16 [in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
n:16 [in Complexity.NP.SAT.CookLevin.Reductions.FlatTCC_to_FlatCC]
n:16 [in Undecidability.L.Computability.Computability]
n:160 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
n:160 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
n:160 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
n:160 [in Undecidability.Shared.Libs.DLW.Vec.pos]
n:160 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:161 [in Undecidability.Shared.Libs.DLW.Vec.vec]
n:161 [in Undecidability.L.Tactics.Extract]
n:161 [in Undecidability.Shared.Libs.DLW.Utils.sums]
n:161 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:162 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
n:162 [in Undecidability.TM.Hoare.HoareLogic]
n:162 [in Undecidability.TM.Hoare.HoareCombinators]
n:162 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:163 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
n:163 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:164 [in Undecidability.Shared.Libs.DLW.Vec.vec]
n:164 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
n:164 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
n:164 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
n:164 [in Undecidability.Shared.Libs.DLW.Vec.pos]
n:164 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:164 [in Complexity.Libs.CookPrelim.MorePrelim]
n:165 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:165 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:166 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
n:166 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
n:166 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:167 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
n:167 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
n:167 [in Undecidability.TM.Hoare.HoareLogic]
n:167 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:168 [in Complexity.TM.PrettyBounds.M2MBounds]
n:168 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:168 [in Undecidability.TM.L.HeapInterpreter.StepTM]
n:168 [in Undecidability.TM.Util.TM_facts]
n:168 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
n:168 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:169 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
n:169 [in Undecidability.TM.Hoare.HoareLogic]
n:169 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:17 [in Undecidability.L.Prelim.ARS]
n:17 [in Complexity.Complexity.ONotation]
n:17 [in Undecidability.Shared.Libs.DLW.Utils.prime]
n:17 [in Undecidability.TM.Single.StepTM]
N:17 [in Complexity.NP.SAT.kSAT]
n:17 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
n:17 [in Complexity.Libs.CookPrelim.FlatFinTypes]
n:17 [in Complexity.L.ComparisonTimeBoundDerivation]
n:17 [in Undecidability.Shared.Libs.DLW.Utils.utils_string]
n:17 [in Undecidability.Shared.Libs.DLW.Utils.binomial]
n:17 [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
n:17 [in Complexity.Complexity.SpaceBoundsTime]
n:17 [in Undecidability.Synthetic.Definitions]
N:17 [in Undecidability.L.Computability.Acceptability]
n:17 [in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
n:17 [in Undecidability.TM.Code.Code]
n:17 [in Undecidability.L.Computability.MuRec]
n:17 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
n:17 [in Undecidability.TM.L.CompilerBoolFuns.Compiler]
n:170 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
n:170 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
n:170 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:171 [in Undecidability.Shared.Libs.DLW.Utils.sums]
n:171 [in Complexity.L.TM.TMunflatten]
n:171 [in Undecidability.TM.Hoare.HoareRegister]
n:171 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
n:171 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
n:171 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:172 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:172 [in Undecidability.Shared.Libs.DLW.Vec.vec]
n:172 [in Complexity.Libs.CookPrelim.FlatFinTypes]
n:172 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:173 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
n:173 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:174 [in Complexity.TM.PrettyBounds.M2MBounds]
n:174 [in Undecidability.Shared.Libs.DLW.Utils.sums]
n:174 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
n:174 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:175 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
n:175 [in Undecidability.TM.Hoare.HoareCombinators]
n:175 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:176 [in Undecidability.Shared.Libs.DLW.Vec.vec]
n:176 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
n:176 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:177 [in Undecidability.L.Util.L_facts]
n:177 [in Undecidability.Shared.Libs.DLW.Utils.sums]
n:177 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:178 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
n:178 [in Undecidability.Shared.Libs.DLW.Utils.sums]
n:178 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:179 [in Complexity.TM.PrettyBounds.M2MBounds]
n:179 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
n:179 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:18 [in Undecidability.Shared.Libs.DLW.Vec.vec]
n:18 [in Undecidability.TM.Hoare.HoareLegacy]
n:18 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
n:18 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
n:18 [in Complexity.L.AbstractMachines.Computable.Unfolding]
n:18 [in Undecidability.Synthetic.EnumerabilityFacts]
n:18 [in Complexity.L.AbstractMachines.Computable.UnivDecTime]
n:18 [in Undecidability.Shared.Libs.PSL.FiniteTypes.VectorFin]
n:18 [in Undecidability.Shared.FinTypeForallExists]
N:18 [in Complexity.NP.SAT.SAT_inNP]
n:18 [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
n:18 [in Complexity.NP.SAT.CookLevin.Reductions.TMGenNP_fixed_singleTapeTM_to_FlatFunSingleTMGenNP]
n:18 [in Complexity.Complexity.ONotationIsAppropriate]
n:18 [in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
n:18 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
n:18 [in Complexity.TM.Single.DecodeTapes]
n:18 [in Undecidability.L.Tactics.Reflection]
n:18 [in Undecidability.Shared.Libs.PSL.Vectors.VectorDupfree]
n:18 [in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
n:18 [in Undecidability.TM.L.HeapInterpreter.LookupTM]
n:18 [in Undecidability.L.Computability.Computability]
n:18 [in Undecidability.L.Prelim.MoreList]
n:180 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:180 [in Complexity.Libs.CookPrelim.FlatFinTypes]
n:180 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
n:180 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:181 [in Undecidability.L.Util.L_facts]
n:181 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:182 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
n:182 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:183 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:184 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:184 [in Undecidability.TM.L.HeapInterpreter.StepTM]
n:184 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
n:184 [in Undecidability.TM.Hoare.HoareLogic]
n:184 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:185 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
n:185 [in Undecidability.Shared.Libs.DLW.Vec.vec]
n:185 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
n:185 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:186 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
n:186 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
n:186 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
n:186 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:187 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
n:187 [in Undecidability.Shared.Libs.DLW.Utils.sums]
n:187 [in Undecidability.TM.Hoare.HoareLogic]
n:187 [in Undecidability.TM.Hoare.HoareCombinators]
n:187 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:188 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:188 [in Undecidability.Shared.Libs.DLW.Vec.vec]
n:188 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
n:188 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
n:188 [in Undecidability.TM.L.HeapInterpreter.StepTM]
n:188 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
n:188 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:189 [in Undecidability.TM.Hoare.HoareRegister]
n:189 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:19 [in Undecidability.L.TM.TMinL]
n:19 [in Undecidability.TM.Single.StepTM]
n:19 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
N:19 [in Complexity.NP.SAT.kSAT]
n:19 [in Complexity.L.AbstractMachines.Computable.Unfolding]
n:19 [in Undecidability.L.Prelim.LoopSum]
n:19 [in Undecidability.TM.Code.BinNumbers.EncodeBinNumbers]
n:19 [in Undecidability.Shared.Libs.DLW.Wf.wf_incl]
n:19 [in Undecidability.L.Datatypes.List.List_nat]
N:19 [in Complexity.NP.SAT.SAT_inNP]
n:19 [in Undecidability.Shared.Libs.DLW.Utils.binomial]
n:19 [in Complexity.Complexity.SpaceBoundsTime]
n:19 [in Complexity.NP.TM.M_multi2mono]
n:19 [in Undecidability.L.TM.TMEncoding]
n:190 [in Complexity.TM.PrettyBounds.M2MBounds]
n:190 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
n:190 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:191 [in Undecidability.L.Prelim.ARS]
n:191 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
n:191 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
n:191 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:192 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:193 [in Undecidability.L.Tactics.Extract]
n:193 [in Undecidability.TM.Code.Code]
n:193 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
n:193 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:194 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
n:194 [in Undecidability.TM.Hoare.HoareLogic]
n:194 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:195 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
n:195 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
N:195 [in Complexity.L.ComparisonTimeBoundDerivation]
n:195 [in Undecidability.TM.L.HeapInterpreter.StepTM]
n:195 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
n:195 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:196 [in Complexity.TM.PrettyBounds.M2MBounds]
n:196 [in Undecidability.Shared.Libs.DLW.Vec.vec]
n:196 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
n:196 [in Complexity.L.TM.TMunflatten]
n:196 [in Undecidability.TM.Hoare.HoareCombinators]
n:196 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:197 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:197 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
n:197 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
n:197 [in Undecidability.TM.Hoare.HoareRegister]
n:197 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:198 [in Undecidability.Shared.Libs.DLW.Utils.sums]
n:198 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
n:198 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:199 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
N:199 [in Complexity.L.ComparisonTimeBoundDerivation]
n:199 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:2 [in Undecidability.L.Functions.Eval]
n:2 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:2 [in Undecidability.Shared.Libs.DLW.Vec.vec]
n:2 [in Undecidability.L.TM.TMinL]
n:2 [in Complexity.NP.TM.mTM_to_singleTapeTM]
n:2 [in Complexity.L.AbstractMachines.Computable.Shared]
n:2 [in Undecidability.TM.Util.VectorPrelim]
n:2 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_nat_facts]
n:2 [in Complexity.Libs.CookPrelim.FlatFinTypes]
n:2 [in Undecidability.TM.Code.BinNumbers.NTM]
n:2 [in Undecidability.L.Functions.Subst]
n:2 [in Complexity.NP.TM.TMGenNP]
n:2 [in Complexity.L.TM.TMunflatten]
n:2 [in Undecidability.Shared.Libs.PSL.FiniteTypes.Arbitrary]
n:2 [in Complexity.TM.Single.DecodeTapes]
n:2 [in Undecidability.L.TM.TMEncoding]
n:2 [in Undecidability.Shared.Libs.PSL.Vectors.VectorDupfree]
n:2 [in Undecidability.TM.Lifting.LiftTapes]
n:2 [in Complexity.NP.Clique.kSAT_to_Clique]
n:2 [in Undecidability.TM.Util.TM_facts]
n:2 [in Undecidability.TM.Hoare.HoareLogic]
n:2 [in Undecidability.TM.Hoare.HoareCombinators]
N:2 [in Complexity.NP.SAT.kSAT_to_SAT]
n:2 [in Complexity.NP.TM.TMGenNP_fixed_mTM]
n:20 [in Undecidability.TM.Compound.TMTac]
n:20 [in Undecidability.L.Tactics.Extract]
n:20 [in Undecidability.TM.Code.NatTM]
n:20 [in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
n:20 [in Complexity.Libs.CookPrelim.FlatFinTypes]
n:20 [in Undecidability.Shared.Libs.PSL.Vectors.Fin]
n:20 [in Undecidability.L.Tactics.LClos_Eval]
n:20 [in Undecidability.Shared.Libs.DLW.Utils.binomial]
n:20 [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
n:20 [in Undecidability.Shared.Libs.DLW.Utils.sums]
n:20 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
n:20 [in Undecidability.L.Functions.EnumInt]
n:20 [in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
n:20 [in Complexity.NP.SAT.CookLevin.Reductions.FlatTCC_to_FlatCC]
n:20 [in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
n:200 [in Undecidability.Shared.Libs.DLW.Vec.vec]
n:200 [in Complexity.L.TM.TMunflatten]
n:200 [in Undecidability.TM.Code.Code]
n:200 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:201 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:201 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
n:201 [in Undecidability.TM.Code.Code]
n:201 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
n:201 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:202 [in Undecidability.Shared.Libs.DLW.Utils.sums]
n:202 [in Undecidability.TM.Code.Code]
n:202 [in Undecidability.TM.Hoare.HoareLogic]
n:202 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:203 [in Complexity.TM.PrettyBounds.M2MBounds]
n:203 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
n:203 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:204 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
n:204 [in Undecidability.L.Tactics.Extract]
n:204 [in Complexity.L.ComparisonTimeBoundDerivation]
n:204 [in Undecidability.TM.Hoare.HoareRegister]
n:204 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
n:204 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:205 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
n:205 [in Complexity.L.ComparisonTimeBoundDerivation]
n:205 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
n:205 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:206 [in Undecidability.Shared.Libs.DLW.Utils.sums]
n:206 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:207 [in Undecidability.Shared.Libs.DLW.Vec.vec]
n:207 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
n:207 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
n:207 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:208 [in Undecidability.L.Prelim.ARS]
n:208 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
n:208 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:209 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
n:209 [in Complexity.L.TM.TMunflatten]
n:209 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
n:209 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:21 [in Undecidability.Shared.Libs.PSL.FCI]
n:21 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
n:21 [in Undecidability.Shared.Libs.DLW.Vec.vec]
n:21 [in Undecidability.TM.Single.StepTM]
n:21 [in Undecidability.TM.Code.List.Nth]
n:21 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
n:21 [in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
n:21 [in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
n:21 [in Undecidability.TM.Code.BinNumbers.EncodeBinNumbers]
n:21 [in Complexity.L.AbstractMachines.Computable.UnivDecTime]
N:21 [in Complexity.NP.SAT.SAT_inNP]
n:21 [in Undecidability.L.TM.TapeFuns]
n:21 [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
n:21 [in Undecidability.L.AbstractMachines.FlatPro.UnfoldClos]
n:21 [in Undecidability.Shared.Libs.DLW.Utils.sums]
n:21 [in Complexity.L.TM.TMunflatten]
n:21 [in Undecidability.Synthetic.MoreEnumerabilityFacts]
n:21 [in Complexity.Complexity.SpaceBoundsTime]
n:21 [in Undecidability.Shared.Libs.DLW.Wf.wf_finite]
n:21 [in Complexity.L.TM.TMflatFun]
n:21 [in Undecidability.Synthetic.Infinite]
n:21 [in Complexity.NP.SAT.CookLevin.Reductions.FlatTCC_to_FlatCC]
n:21 [in Undecidability.TM.Hoare.HoareLogic]
n:21 [in Undecidability.TM.L.HeapInterpreter.LookupTM]
n:21 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
n:21 [in Undecidability.Shared.Libs.PSL.FiniteTypes.CompoundFinTypes]
n:210 [in Complexity.TM.PrettyBounds.M2MBounds]
n:210 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
n:210 [in Undecidability.Shared.Libs.DLW.Utils.sums]
n:210 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:211 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:212 [in Undecidability.L.Prelim.ARS]
n:212 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:212 [in Undecidability.TM.Hoare.HoareRegister]
n:212 [in Undecidability.TM.Hoare.HoareCombinators]
n:212 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:213 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
n:213 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
n:213 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
n:213 [in Undecidability.TM.Hoare.HoareLogic]
n:214 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
n:214 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
n:214 [in Undecidability.Shared.Libs.DLW.Utils.sums]
n:214 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
n:216 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
n:216 [in Complexity.L.TM.TMunflatten]
n:216 [in Undecidability.TM.Hoare.HoareLogic]
n:216 [in Complexity.Libs.CookPrelim.MorePrelim]
n:217 [in Undecidability.Shared.Libs.DLW.Vec.vec]
n:217 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
n:218 [in Complexity.TM.PrettyBounds.M2MBounds]
n:218 [in Complexity.L.TM.TMflatComp]
n:218 [in Undecidability.Shared.Libs.DLW.Utils.sums]
n:218 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
N:218 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:219 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
n:219 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
n:22 [in Undecidability.TM.Code.List.Concat_Repeat]
n:22 [in Undecidability.L.Computability.Seval]
n:22 [in Undecidability.Synthetic.EnumerabilityFacts]
n:22 [in Undecidability.Shared.FinTypeEquiv]
n:22 [in Undecidability.TM.Code.BinNumbers.EncodeBinNumbers]
n:22 [in Undecidability.Shared.Libs.DLW.Utils.crt]
n:22 [in Undecidability.Shared.Libs.DLW.Utils.binomial]
n:22 [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
n:22 [in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
n:22 [in Undecidability.L.L]
n:22 [in Undecidability.TM.Hoare.HoareRegister]
n:22 [in Undecidability.L.TM.TMEncoding]
n:22 [in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
n:22 [in Undecidability.L.Computability.Synthetic]
n:22 [in Complexity.NP.SAT.CookLevin.Reductions.FlatTCC_to_FlatCC]
n:22 [in Undecidability.Shared.Libs.DLW.Vec.pos]
n:22 [in Undecidability.L.Functions.Size]
n:220 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
n:220 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
n:221 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
n:221 [in Complexity.Libs.CookPrelim.MorePrelim]
n:222 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
N:222 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:223 [in Undecidability.L.Tactics.Extract]
n:223 [in Complexity.L.TM.TMunflatten]
n:223 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
n:223 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:224 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
n:224 [in Undecidability.Shared.Libs.DLW.Utils.sums]
n:224 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:225 [in Complexity.TM.PrettyBounds.M2MBounds]
n:225 [in Undecidability.TM.Hoare.HoareLogic]
n:225 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:225 [in Complexity.Libs.CookPrelim.MorePrelim]
n:226 [in Undecidability.L.Util.L_facts]
n:226 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
n:226 [in Complexity.L.TM.TMflatComp]
n:226 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:227 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:227 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
n:227 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:228 [in Complexity.L.TM.TMunflatten]
n:228 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:229 [in Undecidability.Shared.Libs.DLW.Vec.vec]
n:229 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:229 [in Complexity.Libs.CookPrelim.MorePrelim]
n:23 [in Undecidability.Shared.Libs.PSL.FCI]
n:23 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
n:23 [in Undecidability.Shared.Libs.DLW.Vec.vec]
n:23 [in Undecidability.TM.Single.StepTM]
n:23 [in Complexity.L.AbstractMachines.UnfoldTailRec]
n:23 [in Undecidability.TM.Util.VectorPrelim]
n:23 [in Undecidability.Shared.Libs.PSL.Lists.Position]
n:23 [in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
n:23 [in Complexity.NP.Clique.FlatUGraph]
n:23 [in Undecidability.L.Tactics.ComputableDemo]
n:23 [in Undecidability.Shared.Libs.DLW.Utils.binomial]
n:23 [in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
n:23 [in Undecidability.TM.Hoare.HoareRegister]
n:23 [in Complexity.Complexity.SpaceBoundsTime]
n:23 [in Complexity.TM.Single.DecodeTapes]
n:23 [in Undecidability.TM.L.Transcode.Enc_to_Boollist]
n:230 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
n:230 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
n:230 [in Undecidability.TM.Hoare.HoareCombinators]
n:230 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:231 [in Undecidability.L.Tactics.Extract]
n:231 [in Complexity.L.TM.TMflatComp]
n:231 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:232 [in Undecidability.L.Util.L_facts]
n:232 [in Undecidability.Shared.Libs.DLW.Vec.vec]
n:232 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
n:232 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:233 [in Undecidability.L.Prelim.ARS]
n:233 [in Complexity.TM.PrettyBounds.M2MBounds]
n:233 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:233 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:234 [in Undecidability.Shared.Libs.DLW.Utils.sums]
n:234 [in Undecidability.TM.Hoare.HoareRegister]
n:234 [in Undecidability.TM.Hoare.HoareLogic]
n:234 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:235 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
n:235 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
n:235 [in Complexity.L.TM.TMflatComp]
n:235 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:236 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:236 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
n:236 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:237 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
n:237 [in Undecidability.Shared.Libs.DLW.Utils.sums]
n:237 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:237 [in Complexity.Libs.CookPrelim.MorePrelim]
n:238 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:238 [in Undecidability.Shared.Libs.DLW.Vec.vec]
n:238 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:239 [in Undecidability.Shared.Libs.DLW.Utils.sums]
n:239 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:24 [in Undecidability.TM.Compound.TMTac]
n:24 [in Undecidability.TM.Single.StepTM]
n:24 [in Undecidability.TM.Code.CaseNat]
n:24 [in Undecidability.L.Computability.Enum]
n:24 [in Undecidability.L.Functions.LoopSum]
n:24 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
n:24 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
n:24 [in Undecidability.TM.Code.BinNumbers.EncodeBinNumbers]
n:24 [in Complexity.L.AbstractMachines.Computable.UnivDecTime]
n:24 [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
n:24 [in Undecidability.Shared.Libs.DLW.Utils.sums]
n:24 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
n:24 [in Undecidability.TM.Hoare.HoareRegister]
n:24 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
n:24 [in Undecidability.Shared.Libs.PSL.Vectors.VectorDupfree]
n:24 [in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
n:24 [in Undecidability.TM.L.CaseCom]
n:24 [in Undecidability.L.Computability.MuRec]
n:24 [in Undecidability.TM.L.HeapInterpreter.LookupTM]
n:24 [in Undecidability.TM.L.CompilerBoolFuns.Compiler]
n:24 [in Complexity.L.AbstractMachines.Computable.LargestVar]
n:240 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:240 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
n:240 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
n:240 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:241 [in Complexity.TM.PrettyBounds.M2MBounds]
n:241 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
n:241 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:241 [in Complexity.Libs.CookPrelim.MorePrelim]
n:242 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:242 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:243 [in Undecidability.Shared.Libs.DLW.Utils.sums]
n:243 [in Undecidability.TM.Hoare.HoareCombinators]
n:243 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:244 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
n:244 [in Undecidability.TM.Hoare.HoareLogic]
n:245 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
n:246 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:246 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
n:246 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
n:247 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
n:248 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
N:248 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:249 [in Complexity.Libs.CookPrelim.MorePrelim]
n:25 [in Undecidability.L.Computability.Seval]
n:25 [in Undecidability.TM.Lifting.LiftAlphabet]
n:25 [in Undecidability.L.Tactics.GenEncode]
N:25 [in Complexity.NP.SAT.kSAT]
n:25 [in Undecidability.Shared.Libs.DLW.Utils.quotient]
n:25 [in Complexity.L.ComparisonTimeBoundDerivation]
n:25 [in Undecidability.TM.Code.BinNumbers.NTM]
n:25 [in Undecidability.Shared.Libs.DLW.Utils.crt]
n:25 [in Undecidability.Shared.Libs.PSL.Vectors.Fin]
n:25 [in Undecidability.Shared.Libs.DLW.Wf.wf_incl]
n:25 [in Undecidability.Shared.Libs.DLW.Utils.utils_string]
n:25 [in Undecidability.Shared.Libs.DLW.Utils.binomial]
n:25 [in Complexity.L.AbstractMachines.FlatPro.Computable.Compile]
n:25 [in Undecidability.Synthetic.Definitions]
n:25 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
n:25 [in Undecidability.L.TM.TMEncoding]
n:25 [in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
n:25 [in Undecidability.TM.L.CaseCom]
n:25 [in Undecidability.TM.Hoare.HoareCombinators]
n:250 [in Undecidability.TM.Hoare.HoareRegister]
n:250 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
n:250 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
n:250 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:251 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:251 [in Undecidability.TM.Util.TM_facts]
n:251 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:252 [in Undecidability.Shared.Libs.DLW.Vec.vec]
n:252 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
n:252 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
n:252 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:253 [in Complexity.TM.PrettyBounds.M2MBounds]
n:253 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:253 [in Complexity.Libs.CookPrelim.MorePrelim]
n:254 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
n:254 [in Undecidability.TM.Util.TM_facts]
n:254 [in Undecidability.TM.Hoare.HoareExamples]
n:254 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:255 [in Undecidability.TM.Hoare.HoareLogic]
n:255 [in Undecidability.TM.Hoare.HoareCombinators]
n:255 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:256 [in Undecidability.Shared.Libs.DLW.Vec.vec]
n:256 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
n:256 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
n:256 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:257 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
n:258 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
n:258 [in Undecidability.TM.Util.TM_facts]
N:258 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:258 [in Complexity.Libs.CookPrelim.MorePrelim]
n:26 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:26 [in Undecidability.L.Util.L_facts]
n:26 [in Undecidability.TM.Code.List.Nth]
n:26 [in Undecidability.L.Functions.LoopSum]
n:26 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
n:26 [in Undecidability.L.Computability.Seval]
n:26 [in Complexity.L.AbstractMachines.UnfoldHeap]
n:26 [in Undecidability.Shared.Libs.DLW.Utils.sums]
n:26 [in Complexity.Complexity.ONotationIsAppropriate]
n:26 [in Undecidability.Synthetic.MoreEnumerabilityFacts]
n:26 [in Undecidability.Synthetic.ListEnumerabilityFacts]
n:26 [in Undecidability.Synthetic.Infinite]
n:26 [in Undecidability.L.Computability.MuRec]
n:260 [in Undecidability.Shared.Libs.DLW.Vec.vec]
n:260 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
n:260 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
n:262 [in Complexity.TM.PrettyBounds.M2MBounds]
n:262 [in Undecidability.TM.Hoare.HoareRegister]
n:263 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
n:263 [in Undecidability.TM.Util.TM_facts]
n:263 [in Undecidability.TM.Hoare.HoareExamples]
n:263 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:264 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
n:265 [in Undecidability.TM.Hoare.HoareLogic]
n:265 [in Undecidability.TM.Hoare.HoareCombinators]
n:266 [in Complexity.TM.PrettyBounds.M2MBounds]
n:266 [in Undecidability.Shared.Libs.DLW.Vec.vec]
n:266 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
n:266 [in Undecidability.TM.Util.TM_facts]
N:266 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:267 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
n:268 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
n:268 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
n:268 [in Undecidability.TM.Util.TM_facts]
n:268 [in Undecidability.TM.Hoare.HoareExamples]
n:269 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
n:269 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
N:269 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:27 [in Undecidability.Shared.Libs.PSL.Numbers]
n:27 [in Undecidability.TM.Single.StepTM]
n:27 [in Undecidability.L.Computability.Enum]
n:27 [in Complexity.L.AbstractMachines.Computable.Unfolding]
n:27 [in Undecidability.Shared.Libs.PSL.Lists.Position]
n:27 [in Complexity.NP.Clique.FlatUGraph]
n:27 [in Complexity.L.AbstractMachines.Computable.UnivDecTime]
n:27 [in Complexity.L.AbstractMachines.UnfoldHeap]
n:27 [in Undecidability.Shared.Libs.DLW.Utils.utils_string]
n:27 [in Undecidability.Shared.Libs.DLW.Utils.binomial]
n:27 [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
n:27 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
n:27 [in Undecidability.TM.Hoare.HoareLogic]
n:27 [in Undecidability.Shared.Libs.DLW.Vec.pos]
n:27 [in Undecidability.L.Functions.Size]
n:270 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
n:270 [in Undecidability.L.Tactics.Reflection]
n:271 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:271 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
n:272 [in Complexity.L.TM.TMflatComp]
n:272 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
n:272 [in Undecidability.TM.Hoare.HoareExamples]
n:273 [in Undecidability.TM.Util.TM_facts]
n:274 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
n:274 [in Undecidability.TM.Util.TM_facts]
n:274 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
n:275 [in Complexity.L.TM.TMflatComp]
n:275 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
n:275 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
n:275 [in Undecidability.TM.Hoare.HoareExamples]
n:276 [in Complexity.TM.PrettyBounds.M2MBounds]
n:276 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
n:276 [in Undecidability.TM.Hoare.HoareLogic]
n:277 [in Undecidability.TM.Hoare.HoareRegister]
n:277 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
n:277 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
n:278 [in Complexity.L.TM.TMflatComp]
n:278 [in Undecidability.TM.Hoare.HoareCombinators]
n:279 [in Undecidability.TM.Hoare.HoareExamples]
n:28 [in Undecidability.TM.Code.List.Concat_Repeat]
n:28 [in Complexity.Complexity.ONotation]
n:28 [in Undecidability.Shared.Libs.DLW.Vec.vec]
n:28 [in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
N:28 [in Complexity.NP.SAT.kSAT]
n:28 [in Undecidability.TM.Util.VectorPrelim]
n:28 [in Undecidability.TM.Code.NatTM]
n:28 [in Complexity.Complexity.ONotationIsAppropriate]
n:28 [in Complexity.L.TM.TMflatten]
n:28 [in Complexity.TM.Single.DecodeTapes]
n:28 [in Undecidability.TM.Compound.WriteString]
n:281 [in Undecidability.TM.Util.TM_facts]
n:282 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
n:283 [in Undecidability.TM.Hoare.HoareLogic]
n:2834 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
n:2838 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
n:2839 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
n:284 [in Undecidability.L.Tactics.Reflection]
n:284 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
n:284 [in Undecidability.TM.Hoare.HoareExamples]
n:2841 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
n:2844 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
n:2847 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
n:285 [in Complexity.TM.PrettyBounds.M2MBounds]
n:2857 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
n:287 [in Undecidability.TM.Util.TM_facts]
n:2870 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
n:2879 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
n:288 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:288 [in Undecidability.TM.Util.TM_facts]
n:288 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
n:2888 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
n:289 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
n:289 [in Undecidability.TM.Hoare.HoareExamples]
N:289 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:2892 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
n:29 [in Complexity.Complexity.ONotation]
n:29 [in Complexity.HierarchyTheorem.TimeHierarchyTheorem]
n:29 [in Undecidability.TM.Single.StepTM]
n:29 [in Complexity.L.AbstractMachines.UnfoldTailRec]
n:29 [in Undecidability.L.Computability.Enum]
n:29 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
n:29 [in Complexity.NP.SAT.kSAT]
n:29 [in Undecidability.Shared.Libs.DLW.Utils.quotient]
n:29 [in Undecidability.Shared.Libs.PSL.Vectors.Fin]
n:29 [in Complexity.NP.TM.TMGenNP]
n:29 [in Undecidability.Shared.Libs.DLW.Utils.binomial]
n:29 [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
n:29 [in Complexity.L.AbstractMachines.FlatPro.Computable.Compile]
n:29 [in Undecidability.TM.Hoare.HoareRegister]
n:29 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
n:29 [in Undecidability.Synthetic.Infinite]
n:29 [in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
n:29 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
n:29 [in Complexity.L.AbstractMachines.Computable.LargestVar]
n:290 [in Undecidability.TM.Hoare.HoareRegister]
n:290 [in Undecidability.TM.Hoare.HoareLogic]
n:290 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
n:2903 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
n:291 [in Complexity.TM.PrettyBounds.M2MBounds]
n:291 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
n:2913 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
n:292 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
n:292 [in Undecidability.TM.Hoare.HoareExamples]
N:292 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:2925 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
n:293 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
n:294 [in Undecidability.TM.Util.TM_facts]
n:294 [in Undecidability.TM.Hoare.HoareCombinators]
n:294 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
n:295 [in Complexity.TM.PrettyBounds.M2MBounds]
n:296 [in Undecidability.L.Tactics.Reflection]
n:296 [in Undecidability.TM.Hoare.HoareExamples]
n:297 [in Undecidability.Shared.Libs.DLW.Vec.vec]
n:298 [in Undecidability.TM.Util.TM_facts]
n:298 [in Undecidability.TM.Hoare.HoareLogic]
n:299 [in Complexity.TM.PrettyBounds.M2MBounds]
n:2993 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
n:3 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
n:3 [in Complexity.HierarchyTheorem.TimeHierarchyTheorem]
n:3 [in Undecidability.TM.Hoare.HoareLegacy]
n:3 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
n:3 [in Undecidability.L.Prelim.LoopSum]
n:3 [in Undecidability.Shared.Libs.PSL.FiniteTypes.VectorFin]
n:3 [in Undecidability.Shared.Libs.DLW.Utils.utils_string]
n:3 [in Undecidability.L.Datatypes.LVector]
n:3 [in Complexity.TM.PrettyBounds.BaseCodeSpace]
n:3 [in Undecidability.L.Datatypes.List.List_nat]
n:3 [in Undecidability.L.Datatypes.List.List_extra]
n:3 [in Undecidability.Shared.Libs.DLW.Utils.sorting]
n:3 [in Undecidability.L.L]
n:3 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
n:3 [in Complexity.NP.TM.M_multi2mono]
n:3 [in Undecidability.Synthetic.ListEnumerabilityFacts]
n:3 [in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
n:3 [in Undecidability.L.AbstractMachines.FlatPro.ProgramsDef]
n:3 [in Undecidability.L.Computability.MuRec]
N:3 [in Complexity.NP.SAT.kSAT_to_SAT]
n:3 [in Undecidability.Shared.Libs.DLW.Vec.pos]
n:3 [in Complexity.Libs.CookPrelim.MorePrelim]
n:30 [in Undecidability.Shared.Libs.PSL.Numbers]
n:30 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
n:30 [in Complexity.HierarchyTheorem.TimeHierarchyTheorem]
n:30 [in Undecidability.Shared.Libs.DLW.Utils.prime]
n:30 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
n:30 [in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
n:30 [in Undecidability.TM.Code.List.Length]
n:30 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
n:30 [in Complexity.L.AbstractMachines.Computable.UnivDecTime]
n:30 [in Undecidability.Shared.Libs.DLW.Utils.crt]
n:30 [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
n:30 [in Complexity.Complexity.ONotationIsAppropriate]
n:30 [in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
n:30 [in Undecidability.L.TM.TMEncoding]
n:30 [in Undecidability.Shared.Libs.PSL.Vectors.VectorDupfree]
n:30 [in Undecidability.TM.Lifting.LiftTapes]
n:30 [in Undecidability.Synthetic.Infinite]
n:30 [in Undecidability.L.Computability.MuRec]
N:30 [in Complexity.NP.SAT.SAT]
n:300 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
n:301 [in Undecidability.Shared.Libs.DLW.Vec.vec]
n:301 [in Undecidability.L.Tactics.Reflection]
n:301 [in Undecidability.TM.Hoare.HoareExamples]
n:302 [in Undecidability.Shared.Libs.DLW.Vec.vec]
n:302 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
N:302 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:3027 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
n:303 [in Undecidability.Shared.Libs.DLW.Vec.vec]
n:304 [in Undecidability.TM.Hoare.HoareRegister]
n:304 [in Undecidability.TM.Util.TM_facts]
n:305 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:305 [in Undecidability.Shared.Libs.DLW.Vec.vec]
n:305 [in Undecidability.TM.Single.StepTM]
n:305 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
n:306 [in Undecidability.L.Tactics.Reflection]
n:306 [in Undecidability.TM.Hoare.HoareLogic]
n:306 [in Undecidability.TM.Hoare.HoareExamples]
n:307 [in Complexity.TM.PrettyBounds.M2MBounds]
N:307 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:309 [in Complexity.Libs.CookPrelim.MorePrelim]
n:3096 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
n:31 [in Undecidability.TM.Code.List.Concat_Repeat]
n:31 [in Undecidability.TM.L.CompilerBoolFuns.NaryApp]
n:31 [in Complexity.HierarchyTheorem.TimeHierarchyTheorem]
n:31 [in Undecidability.Shared.Libs.DLW.Utils.prime]
n:31 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
n:31 [in Undecidability.L.Computability.Seval]
N:31 [in Complexity.NP.SAT.kSAT]
n:31 [in Undecidability.Synthetic.EnumerabilityFacts]
n:31 [in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
n:31 [in Undecidability.Shared.Libs.DLW.Utils.crt]
n:31 [in Undecidability.Shared.Libs.DLW.Utils.binomial]
n:31 [in Undecidability.L.L]
n:31 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
n:31 [in Undecidability.Shared.Libs.DLW.Vec.pos]
n:31 [in Undecidability.TM.Compound.WriteString]
n:310 [in Undecidability.Shared.Libs.DLW.Vec.vec]
n:310 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
n:310 [in Undecidability.TM.Hoare.HoareRegister]
n:310 [in Undecidability.TM.Hoare.HoareExamples]
n:3100 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
n:311 [in Undecidability.L.Tactics.Reflection]
n:311 [in Undecidability.TM.Util.TM_facts]
n:311 [in Undecidability.TM.Hoare.HoareCombinators]
n:311 [in Complexity.Libs.CookPrelim.MorePrelim]
N:312 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:313 [in Undecidability.Shared.Libs.DLW.Vec.vec]
n:314 [in Undecidability.TM.Hoare.HoareExamples]
n:314 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:315 [in Complexity.TM.PrettyBounds.M2MBounds]
n:315 [in Undecidability.TM.Hoare.HoareLogic]
n:315 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:317 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:317 [in Undecidability.Shared.Libs.DLW.Vec.vec]
n:317 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
n:317 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
n:317 [in Undecidability.TM.Hoare.HoareRegister]
n:317 [in Undecidability.L.Tactics.Reflection]
n:317 [in Complexity.Libs.CookPrelim.MorePrelim]
n:318 [in Undecidability.TM.Util.TM_facts]
n:318 [in Undecidability.TM.Hoare.HoareExamples]
N:318 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:32 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:32 [in Complexity.HierarchyTheorem.TimeHierarchyTheorem]
n:32 [in Undecidability.Shared.Libs.DLW.Utils.prime]
n:32 [in Undecidability.L.Computability.Enum]
n:32 [in Complexity.NP.SAT.kSAT]
n:32 [in Undecidability.Synthetic.EnumerabilityFacts]
n:32 [in Undecidability.Shared.Libs.DLW.Utils.quotient]
n:32 [in Undecidability.Shared.Libs.DLW.Utils.binomial]
n:32 [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
n:32 [in Complexity.Complexity.ONotationIsAppropriate]
n:32 [in Complexity.L.TM.TMunflatten]
n:32 [in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
n:32 [in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
n:32 [in Undecidability.L.Functions.Size]
n:3201 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
n:3204 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
n:321 [in Undecidability.Shared.Libs.DLW.Vec.vec]
N:321 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:322 [in Undecidability.L.Tactics.Reflection]
n:322 [in Undecidability.TM.Hoare.HoareCombinators]
n:322 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:323 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
n:323 [in Undecidability.TM.Hoare.HoareExamples]
n:324 [in Undecidability.Shared.Libs.DLW.Vec.vec]
n:324 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
n:324 [in Undecidability.TM.Util.TM_facts]
n:325 [in Complexity.TM.PrettyBounds.M2MBounds]
n:325 [in Undecidability.Shared.Libs.DLW.Vec.vec]
n:325 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:326 [in Undecidability.TM.Hoare.HoareLogic]
n:327 [in Undecidability.Shared.Libs.DLW.Vec.vec]
n:327 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
n:327 [in Undecidability.TM.Hoare.HoareRegister]
n:328 [in Undecidability.TM.Hoare.HoareExamples]
n:329 [in Undecidability.Shared.Libs.DLW.Vec.vec]
n:33 [in Complexity.HierarchyTheorem.TimeHierarchyTheorem]
n:33 [in Undecidability.Synthetic.EnumerabilityFacts]
n:33 [in Undecidability.Shared.Libs.PSL.Vectors.Fin]
n:33 [in Undecidability.Shared.Libs.DLW.Utils.sorting]
n:33 [in Complexity.L.AbstractMachines.FlatPro.Computable.Compile]
n:33 [in Undecidability.Shared.Libs.DLW.Utils.sums]
n:33 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
n:33 [in Undecidability.Shared.Libs.PSL.Vectors.VectorDupfree]
n:33 [in Undecidability.TM.Lifting.LiftTapes]
n:33 [in Undecidability.Synthetic.Infinite]
n:33 [in Undecidability.TM.Hoare.HoareLogic]
n:33 [in Undecidability.TM.Single.EncodeTapes]
n:330 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
n:330 [in Undecidability.TM.Util.TM_facts]
n:331 [in Complexity.Libs.CookPrelim.MorePrelim]
n:332 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
n:332 [in Undecidability.TM.Hoare.HoareExamples]
n:332 [in Undecidability.Shared.Libs.DLW.Code.sss]
n:332 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:333 [in Complexity.TM.PrettyBounds.M2MBounds]
n:333 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
n:334 [in Undecidability.Shared.Libs.DLW.Code.sss]
n:336 [in Undecidability.TM.Hoare.HoareExamples]
n:337 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:337 [in Undecidability.TM.Hoare.HoareRegister]
n:337 [in Undecidability.TM.Util.TM_facts]
n:338 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
n:338 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
n:338 [in Undecidability.TM.Hoare.HoareLogic]
n:338 [in Undecidability.Shared.Libs.DLW.Code.sss]
n:34 [in Undecidability.TM.L.CompilerBoolFuns.NaryApp]
n:34 [in Complexity.Complexity.ONotation]
n:34 [in Complexity.HierarchyTheorem.TimeHierarchyTheorem]
n:34 [in Undecidability.TM.Single.StepTM]
n:34 [in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
n:34 [in Undecidability.L.Computability.Seval]
n:34 [in Undecidability.TM.Util.VectorPrelim]
n:34 [in Complexity.Libs.CookPrelim.FlatFinTypes]
n:34 [in Undecidability.L.Datatypes.LVector]
n:34 [in Complexity.Complexity.ONotationIsAppropriate]
n:34 [in Undecidability.TM.Hoare.HoareRegister]
n:34 [in Undecidability.Synthetic.ListEnumerabilityFacts]
n:34 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
n:34 [in Complexity.L.AbstractMachines.Computable.LargestVar]
n:341 [in Complexity.TM.PrettyBounds.M2MBounds]
n:341 [in Undecidability.TM.Hoare.HoareExamples]
n:342 [in Undecidability.TM.Util.TM_facts]
n:344 [in Undecidability.Shared.Libs.DLW.Vec.vec]
n:344 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
n:345 [in Undecidability.TM.Hoare.HoareRegister]
n:346 [in Undecidability.TM.Hoare.HoareExamples]
N:348 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:349 [in Undecidability.TM.Hoare.HoareLogic]
n:35 [in Undecidability.TM.Code.List.Concat_Repeat]
n:35 [in Undecidability.Shared.Libs.PSL.FCI]
n:35 [in Complexity.Complexity.ONotation]
n:35 [in Complexity.HierarchyTheorem.TimeHierarchyTheorem]
n:35 [in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
n:35 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
n:35 [in Undecidability.TM.Code.NatTM]
n:35 [in Undecidability.Shared.Libs.DLW.Utils.quotient]
n:35 [in Undecidability.Shared.Libs.DLW.Utils.sums]
n:35 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
n:35 [in Undecidability.L.TM.TMEncoding]
n:35 [in Undecidability.L.Datatypes.LNat]
n:35 [in Undecidability.TM.Hoare.HoareCombinators]
n:35 [in Undecidability.TM.L.HeapInterpreter.LookupTM]
n:350 [in Undecidability.TM.Util.TM_facts]
n:351 [in Undecidability.Shared.Libs.DLW.Vec.vec]
n:351 [in Undecidability.TM.Hoare.HoareExamples]
n:351 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:353 [in Undecidability.Shared.Libs.DLW.Vec.vec]
n:355 [in Undecidability.TM.Hoare.HoareRegister]
n:355 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:356 [in Undecidability.Shared.Libs.DLW.Vec.vec]
n:357 [in Undecidability.TM.Hoare.HoareExamples]
n:36 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:36 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
n:36 [in Undecidability.TM.Single.StepTM]
n:36 [in Undecidability.L.Tactics.Extract]
n:36 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
n:36 [in Complexity.Libs.CookPrelim.FlatFinTypes]
n:36 [in Undecidability.Synthetic.MoreEnumerabilityFacts]
n:36 [in Undecidability.L.Functions.UnboundIteration]
n:36 [in Undecidability.Synthetic.ListEnumerabilityFacts]
N:36 [in Complexity.NP.SAT.SAT]
n:36 [in Undecidability.Shared.Libs.DLW.Vec.pos]
n:36 [in Undecidability.TM.Single.EncodeTapes]
n:36 [in Undecidability.L.Prelim.MoreList]
n:360 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:362 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:362 [in Undecidability.TM.Hoare.HoareLogic]
n:363 [in Undecidability.TM.Hoare.HoareCombinators]
n:363 [in Undecidability.TM.Hoare.HoareExamples]
n:365 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:366 [in Undecidability.TM.Hoare.HoareRegister]
n:367 [in Undecidability.Shared.Libs.DLW.Vec.vec]
n:368 [in Undecidability.TM.Hoare.HoareExamples]
n:3693 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
n:3694 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
n:37 [in Undecidability.Shared.Libs.DLW.Vec.vec]
n:37 [in Complexity.HierarchyTheorem.TimeHierarchyTheorem]
n:37 [in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
n:37 [in Undecidability.L.Computability.Seval]
n:37 [in Undecidability.Shared.Libs.PSL.Vectors.Fin]
n:37 [in Complexity.L.AbstractMachines.FlatPro.Computable.Compile]
n:37 [in Complexity.L.TM.TMflat]
n:37 [in Undecidability.TM.TM]
n:37 [in Undecidability.Synthetic.MoreEnumerabilityFacts]
n:37 [in Undecidability.Synthetic.ListEnumerabilityFacts]
n:37 [in Complexity.TM.Single.DecodeTapes]
n:37 [in Undecidability.TM.Lifting.LiftTapes]
N:37 [in Complexity.NP.SAT.SAT]
n:37 [in Undecidability.L.Functions.Size]
n:370 [in Undecidability.TM.Util.TM_facts]
n:370 [in Undecidability.TM.Hoare.HoareLogic]
n:373 [in Undecidability.Shared.Libs.DLW.Vec.vec]
n:373 [in Undecidability.TM.Util.TM_facts]
n:373 [in Undecidability.TM.Hoare.HoareExamples]
n:374 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
n:378 [in Undecidability.Shared.Libs.DLW.Vec.vec]
n:378 [in Undecidability.TM.Hoare.HoareLogic]
n:378 [in Undecidability.TM.Hoare.HoareExamples]
n:38 [in Undecidability.TM.Code.List.Concat_Repeat]
n:38 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
n:38 [in Undecidability.Synthetic.EnumerabilityFacts]
n:38 [in Undecidability.Shared.Libs.DLW.Utils.quotient]
n:38 [in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
n:38 [in Undecidability.Shared.Libs.DLW.Utils.sorting]
n:38 [in Undecidability.TM.Hoare.HoareRegister]
n:38 [in Complexity.L.TM.TMflatFun]
n:38 [in Undecidability.Shared.Libs.PSL.Vectors.VectorDupfree]
n:38 [in Undecidability.TM.Single.EncodeTapes]
n:380 [in Undecidability.TM.Hoare.HoareRegister]
n:380 [in Undecidability.TM.Hoare.HoareCombinators]
n:382 [in Undecidability.Shared.Libs.DLW.Vec.vec]
n:382 [in Undecidability.TM.Util.TM_facts]
n:384 [in Undecidability.TM.Hoare.HoareExamples]
n:385 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:386 [in Undecidability.Shared.Libs.DLW.Vec.vec]
n:387 [in Undecidability.TM.Util.TM_facts]
n:387 [in Undecidability.TM.Hoare.HoareLogic]
n:389 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:389 [in Undecidability.Shared.Libs.DLW.Vec.vec]
n:39 [in Undecidability.Shared.Libs.DLW.Vec.vec]
n:39 [in Undecidability.TM.Single.StepTM]
n:39 [in Undecidability.TM.Code.List.Nth]
n:39 [in Undecidability.L.Computability.Enum]
n:39 [in Undecidability.TM.Util.VectorPrelim]
n:39 [in Undecidability.Synthetic.EnumerabilityFacts]
n:39 [in Complexity.NP.TM.TMGenNP]
n:39 [in Complexity.L.TM.TMflatComp]
n:39 [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
n:39 [in Undecidability.Shared.Libs.DLW.Utils.sums]
n:39 [in Complexity.L.TM.TMunflatten]
n:39 [in Complexity.NP.SAT.CookLevin.Subproblems.TM_single]
n:39 [in Complexity.NP.TM.M_multi2mono]
n:39 [in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
n:39 [in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
n:39 [in Undecidability.TM.Hoare.HoareLogic]
n:39 [in Undecidability.L.Datatypes.LNat]
n:39 [in Undecidability.Shared.Libs.DLW.Vec.pos]
n:39 [in Undecidability.Synthetic.ReducibilityFacts]
n:39 [in Complexity.L.AbstractMachines.Computable.LargestVar]
n:390 [in Undecidability.TM.Hoare.HoareExamples]
n:393 [in Undecidability.Shared.Libs.DLW.Vec.vec]
n:394 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
n:395 [in Undecidability.TM.Hoare.HoareRegister]
n:395 [in Undecidability.TM.Hoare.HoareExamples]
n:396 [in Undecidability.Shared.Libs.DLW.Vec.vec]
n:396 [in Undecidability.TM.Hoare.HoareLogic]
n:399 [in Undecidability.TM.Util.TM_facts]
n:399 [in Undecidability.TM.Hoare.HoareExamples]
n:4 [in Undecidability.L.Functions.Eval]
n:4 [in Complexity.L.Datatypes.LBinNums]
n:4 [in Undecidability.Shared.Libs.DLW.Vec.vec]
n:4 [in Undecidability.Shared.Libs.DLW.Utils.prime]
n:4 [in Undecidability.Synthetic.SemiDecidabilityFacts]
n:4 [in Undecidability.TM.PrettyBounds.SizeBounds]
n:4 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
N:4 [in Complexity.NP.SAT.kSAT]
n:4 [in Undecidability.Synthetic.EnumerabilityFacts]
n:4 [in Complexity.NP.Clique.FlatUGraph]
n:4 [in Undecidability.Shared.Libs.PSL.FiniteTypes.VectorFin]
N:4 [in Undecidability.Shared.FinTypeForallExists]
N:4 [in Complexity.NP.SAT.SAT_inNP]
n:4 [in Undecidability.Shared.Libs.DLW.Utils.binomial]
n:4 [in Undecidability.Shared.Libs.DLW.Utils.sorting]
n:4 [in Complexity.Complexity.ONotationIsAppropriate]
n:4 [in Complexity.L.TM.TMunflatten]
n:4 [in Undecidability.L.Tactics.Lbeta]
n:4 [in Complexity.L.TM.TMflatFun]
n:4 [in Complexity.NP.Clique.kSAT_to_Clique]
n:4 [in Undecidability.TM.Hoare.HoareLogic]
n:4 [in Complexity.NP.SAT.kSAT_to_SAT]
n:4 [in Undecidability.L.Computability.Por]
n:4 [in Undecidability.L.Prelim.MoreList]
n:40 [in Undecidability.L.Computability.Seval]
n:40 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
n:40 [in Undecidability.TM.Code.List.Length]
n:40 [in Complexity.Libs.CookPrelim.FlatFinTypes]
n:40 [in Complexity.NP.Clique.FlatUGraph]
n:40 [in Undecidability.Shared.Libs.DLW.Utils.crt]
n:40 [in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
n:40 [in Undecidability.L.Computability.Synthetic]
n:40 [in Undecidability.Synthetic.Infinite]
n:40 [in Undecidability.TM.L.HeapInterpreter.LookupTM]
n:40 [in Undecidability.L.Prelim.MoreList]
n:401 [in Undecidability.TM.Hoare.HoareExamples]
n:403 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:403 [in Undecidability.TM.Hoare.HoareExamples]
n:405 [in Undecidability.TM.Util.TM_facts]
n:405 [in Undecidability.TM.Hoare.HoareExamples]
n:408 [in Undecidability.TM.Hoare.HoareExamples]
n:409 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:41 [in Undecidability.Shared.Libs.PSL.Numbers]
n:41 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:41 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
n:41 [in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
n:41 [in Undecidability.Shared.Libs.PSL.Lists.Position]
n:41 [in Undecidability.Shared.Libs.DLW.Utils.sorting]
n:41 [in Complexity.L.AbstractMachines.FlatPro.Computable.Compile]
n:41 [in Undecidability.Shared.Libs.DLW.Utils.sums]
n:41 [in Undecidability.L.Functions.UnboundIteration]
n:41 [in Complexity.TM.Single.DecodeTapes]
n:41 [in Undecidability.L.TM.TMEncoding]
n:41 [in Undecidability.Shared.Libs.PSL.Vectors.VectorDupfree]
n:41 [in Undecidability.Shared.Libs.DLW.Code.subcode]
n:41 [in Undecidability.L.Prelim.MoreList]
n:410 [in Undecidability.Shared.Libs.DLW.Vec.vec]
n:410 [in Undecidability.TM.Hoare.HoareExamples]
n:411 [in Undecidability.TM.Util.TM_facts]
n:413 [in Undecidability.TM.Hoare.HoareRegister]
n:414 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
n:417 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:42 [in Undecidability.L.Util.L_facts]
n:42 [in Undecidability.Shared.Libs.DLW.Vec.vec]
n:42 [in Undecidability.Shared.Libs.DLW.Utils.prime]
n:42 [in Undecidability.TM.Single.StepTM]
N:42 [in Complexity.NP.SAT.SAT_inNP]
n:42 [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
n:42 [in Undecidability.TM.TM]
n:42 [in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
n:42 [in Undecidability.Synthetic.Infinite]
n:42 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
n:42 [in Undecidability.L.Functions.Size]
n:422 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
n:425 [in Undecidability.TM.Hoare.HoareCombinators]
n:429 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:43 [in Undecidability.Shared.Libs.PSL.Numbers]
n:43 [in Complexity.Complexity.ONotation]
n:43 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
n:43 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
n:43 [in Complexity.NP.Clique.FlatUGraph]
n:43 [in Complexity.L.TM.TMunflatten]
n:43 [in Complexity.NP.SAT.FSAT.FSAT]
n:43 [in Undecidability.TM.Hoare.HoareRegister]
n:43 [in Undecidability.Synthetic.MoreEnumerabilityFacts]
n:43 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
n:43 [in Undecidability.Synthetic.ListEnumerabilityFacts]
n:43 [in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
n:43 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
n:432 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:436 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:44 [in Undecidability.TM.Code.List.Concat_Repeat]
n:44 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
n:44 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
n:44 [in Undecidability.Shared.Libs.DLW.Vec.vec]
n:44 [in Undecidability.Shared.Libs.DLW.Utils.quotient]
N:44 [in Complexity.NP.SAT.SAT_inNP]
n:44 [in Undecidability.Shared.Libs.DLW.Utils.sums]
n:44 [in Undecidability.Synthetic.MoreEnumerabilityFacts]
n:44 [in Complexity.NP.SAT.CookLevin.Subproblems.TM_single]
n:44 [in Undecidability.Synthetic.ListEnumerabilityFacts]
n:44 [in Undecidability.Shared.Libs.PSL.Vectors.VectorDupfree]
n:44 [in Undecidability.Synthetic.Infinite]
n:44 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
n:44 [in Undecidability.Shared.Libs.DLW.Vec.pos]
n:44 [in Complexity.L.AbstractMachines.Computable.LargestVar]
n:44 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:440 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:444 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:444 [in Undecidability.TM.Hoare.HoareCombinators]
n:445 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
n:446 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:45 [in Undecidability.TM.Single.StepTM]
n:45 [in Undecidability.L.Computability.Seval]
n:45 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
n:45 [in Undecidability.TM.Util.VectorPrelim]
n:45 [in Complexity.L.AbstractMachines.FlatPro.Computable.Compile]
n:45 [in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
n:45 [in Complexity.Complexity.Definitions]
n:45 [in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
n:45 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
n:45 [in Undecidability.Shared.Libs.DLW.Code.subcode]
n:45 [in Undecidability.L.Prelim.MoreList]
n:454 [in Undecidability.TM.Hoare.HoareRegister]
n:46 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
n:46 [in Undecidability.TM.Code.NatTM]
N:46 [in Complexity.NP.SAT.SAT_inNP]
n:46 [in Complexity.L.TM.TMunflatten]
n:46 [in Complexity.NP.SAT.FSAT.FSAT]
n:46 [in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
n:46 [in Undecidability.Synthetic.Infinite]
n:46 [in Complexity.Complexity.Definitions]
n:46 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
n:46 [in Undecidability.Shared.Libs.DLW.Code.sss]
n:46 [in Complexity.NP.TM.LM_to_mTM]
n:460 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
n:463 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
n:47 [in Undecidability.Shared.Libs.PSL.Numbers]
n:47 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
n:47 [in Undecidability.Shared.Libs.DLW.Utils.crt]
n:47 [in Undecidability.L.Functions.UnboundIteration]
n:47 [in Complexity.L.TM.TMflatFun]
n:47 [in Undecidability.Synthetic.ListEnumerabilityFacts]
n:47 [in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
n:47 [in Complexity.TM.Single.DecodeTapes]
n:47 [in Undecidability.Shared.Libs.PSL.Vectors.VectorDupfree]
n:47 [in Undecidability.TM.Lifting.LiftTapes]
n:47 [in Complexity.Complexity.Definitions]
n:47 [in Undecidability.TM.Hoare.HoareCombinators]
N:47 [in Complexity.NP.SAT.SAT]
n:47 [in Complexity.NP.TM.LM_to_mTM]
n:47 [in Undecidability.L.Functions.Size]
n:48 [in Undecidability.TM.L.CompilerBoolFuns.NaryApp]
n:48 [in Complexity.Complexity.ONotation]
n:48 [in Undecidability.Shared.Libs.DLW.Vec.vec]
n:48 [in Undecidability.TM.Code.List.Nth]
n:48 [in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
n:48 [in Undecidability.L.Computability.Seval]
n:48 [in Undecidability.L.Tactics.GenEncode]
n:48 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
n:48 [in Undecidability.Shared.Libs.DLW.Utils.quotient]
n:48 [in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
n:48 [in Undecidability.Shared.Libs.DLW.Utils.sorting]
n:48 [in Undecidability.Synthetic.ListEnumerabilityFacts]
n:48 [in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
n:48 [in Undecidability.TM.Hoare.HoareLogic]
n:48 [in Undecidability.TM.L.HeapInterpreter.LookupTM]
n:48 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
n:48 [in Complexity.NP.TM.LM_to_mTM]
n:48 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:48 [in Undecidability.TM.Single.EncodeTapes]
n:480 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:484 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:49 [in Undecidability.L.Computability.Seval]
n:49 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
n:49 [in Undecidability.Synthetic.EnumerabilityFacts]
n:49 [in Undecidability.Shared.Libs.DLW.Utils.quotient]
N:49 [in Complexity.NP.SAT.SAT_inNP]
n:49 [in Complexity.L.TM.TMflat]
n:49 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
n:49 [in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
n:49 [in Undecidability.L.Computability.Synthetic]
n:49 [in Undecidability.Synthetic.Infinite]
n:49 [in Complexity.L.AbstractMachines.Computable.LargestVar]
n:49 [in Complexity.NP.TM.LM_to_mTM]
n:5 [in Complexity.Complexity.ONotation]
n:5 [in Complexity.L.Datatypes.LBinNums]
n:5 [in Undecidability.L.Util.L_facts]
n:5 [in Complexity.HierarchyTheorem.TimeHierarchyTheorem]
n:5 [in Undecidability.Shared.Libs.DLW.Utils.prime]
n:5 [in Undecidability.TM.Single.StepTM]
n:5 [in Undecidability.L.Computability.Enum]
n:5 [in Undecidability.L.Computability.Seval]
n:5 [in Undecidability.Shared.Libs.DLW.Wf.wf_incl]
n:5 [in Undecidability.Shared.Libs.DLW.Utils.utils_string]
n:5 [in Undecidability.Shared.Libs.DLW.Utils.binomial]
n:5 [in Undecidability.L.TM.TapeFuns]
n:5 [in Undecidability.Shared.Libs.DLW.Utils.sorting]
n:5 [in Complexity.Complexity.SpaceBoundsTime]
n:5 [in Undecidability.L.Functions.EnumInt]
n:5 [in Undecidability.Shared.Libs.PSL.Vectors.VectorDupfree]
N:5 [in Complexity.NP.Clique.kSAT_to_Clique]
n:5 [in Undecidability.TM.Hoare.HoareCombinators]
n:5 [in Complexity.NP.SAT.kSAT_to_SAT]
n:5 [in Undecidability.TM.L.CompilerBoolFuns.Compiler]
n:50 [in Undecidability.TM.Code.List.Concat_Repeat]
n:50 [in Undecidability.TM.Code.NatTM]
n:50 [in Undecidability.Shared.Libs.DLW.Utils.sums]
n:50 [in Undecidability.TM.TM]
n:50 [in Undecidability.Shared.Libs.PSL.Vectors.VectorDupfree]
n:50 [in Undecidability.L.Computability.Synthetic]
n:50 [in Undecidability.TM.Util.TM_facts]
n:50 [in Complexity.Complexity.Definitions]
n:50 [in Undecidability.Shared.Libs.DLW.Code.subcode]
n:50 [in Undecidability.Shared.Libs.DLW.Vec.pos]
N:50 [in Complexity.NP.Clique.kSAT_to_FlatClique]
n:51 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
n:51 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
n:51 [in Complexity.L.ComparisonTimeBoundDerivation]
n:51 [in Complexity.TM.PrettyBounds.BaseCodeSpace]
N:51 [in Complexity.NP.SAT.SAT_inNP]
n:51 [in Undecidability.TM.Hoare.HoareRegister]
n:51 [in Complexity.L.TM.TMflatFun]
n:51 [in Complexity.Complexity.Definitions]
n:51 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:52 [in Undecidability.TM.L.CompilerBoolFuns.NaryApp]
n:52 [in Complexity.Complexity.ONotation]
n:52 [in Undecidability.TM.Code.BinNumbers.PosDefinitions]
n:52 [in Undecidability.L.Computability.Enum]
n:52 [in Undecidability.L.Computability.Seval]
n:52 [in Undecidability.TM.Code.NatTM]
n:52 [in Undecidability.Shared.Libs.DLW.Utils.crt]
n:52 [in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
n:52 [in Undecidability.TM.TM]
n:52 [in Undecidability.Synthetic.ListEnumerabilityFacts]
n:52 [in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
n:52 [in Undecidability.TM.Lifting.LiftTapes]
n:52 [in Complexity.Complexity.Definitions]
n:52 [in Undecidability.Shared.Libs.DLW.Vec.pos]
N:52 [in Complexity.NP.Clique.kSAT_to_FlatClique]
n:53 [in Undecidability.Shared.Libs.PSL.Numbers]
n:53 [in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
n:53 [in Undecidability.Shared.Libs.DLW.Vec.vec]
n:53 [in Undecidability.TM.Code.List.Nth]
n:53 [in Undecidability.TM.Code.List.Length]
n:53 [in Undecidability.Shared.Libs.DLW.Utils.crt]
N:53 [in Complexity.NP.SAT.SAT_inNP]
n:53 [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
n:53 [in Undecidability.Shared.Libs.DLW.Utils.sums]
n:53 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
n:53 [in Undecidability.Synthetic.ListEnumerabilityFacts]
n:53 [in Undecidability.TM.Util.TM_facts]
n:53 [in Undecidability.TM.Single.EncodeTapes]
n:54 [in Undecidability.Shared.Libs.DLW.Utils.quotient]
n:54 [in Complexity.L.TM.TMunflatten]
n:54 [in Complexity.L.TM.TMflat]
n:54 [in Complexity.L.TM.TMflatten]
n:54 [in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
n:54 [in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
n:54 [in Undecidability.Synthetic.Infinite]
n:54 [in Undecidability.L.Datatypes.LNat]
n:54 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
n:54 [in Undecidability.Shared.Libs.DLW.Code.subcode]
n:54 [in Undecidability.Shared.Libs.DLW.Vec.pos]
N:54 [in Complexity.NP.Clique.kSAT_to_FlatClique]
n:54 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:55 [in Undecidability.TM.Code.BinNumbers.PosMultTM]
n:55 [in Undecidability.TM.Single.StepTM]
n:55 [in Undecidability.L.Tactics.GenEncode]
n:55 [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
N:55 [in Complexity.L.ComparisonTimeBoundDerivation]
n:55 [in Undecidability.Shared.Libs.DLW.Utils.sorting]
n:55 [in Undecidability.Synthetic.Infinite]
n:55 [in Undecidability.TM.Hoare.HoareLogic]
n:55 [in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
n:56 [in Undecidability.TM.Code.List.Concat_Repeat]
n:56 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
n:56 [in Undecidability.Shared.Libs.DLW.Vec.vec]
n:56 [in Undecidability.L.Computability.Enum]
n:56 [in Undecidability.TM.Code.NatTM]
n:56 [in Undecidability.TM.TM]
n:56 [in Complexity.TM.Single.DecodeTapes]
n:56 [in Undecidability.Shared.Libs.PSL.Vectors.VectorDupfree]
n:56 [in Undecidability.L.Datatypes.LNat]
n:56 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
N:56 [in Complexity.NP.Clique.kSAT_to_FlatClique]
n:56 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:567 [in Complexity.NP.TM.LM_to_mTM]
n:57 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:57 [in Undecidability.TM.Code.List.Nth]
n:57 [in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
n:57 [in Undecidability.Shared.Libs.DLW.Utils.quotient]
N:57 [in Complexity.L.ComparisonTimeBoundDerivation]
n:57 [in Undecidability.Shared.Libs.DLW.Utils.sums]
n:57 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
n:57 [in Undecidability.TM.Hoare.HoareRegister]
n:57 [in Undecidability.TM.Lifting.LiftTapes]
n:57 [in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
n:57 [in Undecidability.Shared.Libs.DLW.Vec.pos]
n:57 [in Undecidability.Shared.Libs.DLW.Code.sss]
n:57 [in Complexity.NP.Clique.kSAT_to_FlatClique]
n:573 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:577 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:58 [in Undecidability.Shared.Libs.PSL.Numbers]
n:58 [in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
n:58 [in Undecidability.TM.Code.List.Concat_Repeat]
n:58 [in Undecidability.TM.L.CompilerBoolFuns.NaryApp]
n:58 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:58 [in Undecidability.Shared.Libs.DLW.Utils.prime]
n:58 [in Undecidability.TM.Single.StepTM]
n:58 [in Undecidability.TM.Code.BinNumbers.PosDefinitions]
n:58 [in Complexity.TM.Code.Decode]
n:58 [in Undecidability.L.Tactics.GenEncode]
n:58 [in Undecidability.Shared.Libs.DLW.Utils.sorting]
n:58 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
n:58 [in Undecidability.TM.Util.TM_facts]
n:58 [in Undecidability.L.Datatypes.LNat]
n:58 [in Undecidability.TM.Hoare.HoareCombinators]
n:59 [in Undecidability.Shared.Libs.PSL.Numbers]
n:59 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
n:59 [in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
N:59 [in Complexity.NP.SAT.SAT_inNP]
n:59 [in Complexity.L.TM.TMflat]
n:59 [in Undecidability.L.Functions.UnboundIteration]
n:59 [in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
n:59 [in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
n:59 [in Undecidability.TM.L.HeapInterpreter.LookupTM]
n:59 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
N:59 [in Complexity.NP.Clique.kSAT_to_FlatClique]
n:59 [in Undecidability.TM.Single.EncodeTapes]
n:6 [in Complexity.NP.SAT.CookLevin]
n:6 [in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
n:6 [in Undecidability.TM.L.CompilerBoolFuns.NaryApp]
n:6 [in Complexity.L.Datatypes.LBinNums]
n:6 [in Complexity.HierarchyTheorem.TimeHierarchyTheorem]
n:6 [in Undecidability.Synthetic.SemiDecidabilityFacts]
n:6 [in Undecidability.L.Tactics.Extract]
n:6 [in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
n:6 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
n:6 [in Undecidability.Shared.Libs.DLW.Utils.quotient]
n:6 [in Complexity.Libs.CookPrelim.FlatFinTypes]
n:6 [in Undecidability.TM.Code.BinNumbers.NTM]
n:6 [in Undecidability.Shared.Libs.DLW.Code.compiler]
n:6 [in Undecidability.Shared.Libs.PSL.FiniteTypes.VectorFin]
n:6 [in Undecidability.Shared.Libs.DLW.Utils.binomial]
n:6 [in Undecidability.Shared.embed_nat]
n:6 [in Undecidability.Shared.Libs.DLW.Utils.sorting]
n:6 [in Complexity.Complexity.ONotationIsAppropriate]
n:6 [in Undecidability.TM.Util.TM_facts]
n:6 [in Undecidability.L.Computability.MuRec]
n:6 [in Undecidability.TM.L.HeapInterpreter.LookupTM]
n:6 [in Complexity.NP.SAT.kSAT_to_SAT]
n:6 [in Undecidability.L.Prelim.MoreList]
n:60 [in Undecidability.Shared.Libs.PSL.Numbers]
n:60 [in Complexity.L.TM.TMflatFun]
n:60 [in Undecidability.L.Datatypes.LNat]
n:60 [in Undecidability.Shared.Libs.DLW.Vec.pos]
n:61 [in Undecidability.L.Prelim.ARS]
n:61 [in Undecidability.TM.Single.StepTM]
n:61 [in Undecidability.TM.Code.List.Nth]
n:61 [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
n:61 [in Complexity.L.ComparisonTimeBoundDerivation]
n:61 [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
n:61 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
n:61 [in Undecidability.L.Functions.UnboundIteration]
n:61 [in Undecidability.Synthetic.ListEnumerabilityFacts]
n:61 [in Undecidability.L.Datatypes.LNat]
n:62 [in Undecidability.TM.Code.List.Concat_Repeat]
n:62 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
n:62 [in Undecidability.L.Util.L_facts]
n:62 [in Undecidability.L.Computability.Enum]
n:62 [in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
n:62 [in Undecidability.TM.Lifting.LiftTapes]
n:62 [in Undecidability.TM.Hoare.HoareMult]
n:62 [in Undecidability.TM.Hoare.HoareLogic]
n:62 [in Undecidability.L.Datatypes.LNat]
n:62 [in Complexity.NP.TM.LM_to_mTM]
n:624 [in Complexity.NP.TM.LM_to_mTM]
n:625 [in Complexity.NP.TM.LM_to_mTM]
n:63 [in Complexity.TM.PrettyBounds.M2MBounds]
n:63 [in Undecidability.L.Computability.Enum]
n:63 [in Undecidability.TM.Code.NatTM]
N:63 [in Complexity.L.ComparisonTimeBoundDerivation]
n:63 [in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
n:63 [in Undecidability.L.Functions.UnboundIteration]
n:63 [in Undecidability.Shared.Libs.DLW.Vec.pos]
n:63 [in Complexity.NP.TM.LM_to_mTM]
n:63 [in Undecidability.TM.Single.EncodeTapes]
n:64 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:64 [in Undecidability.TM.Single.StepTM]
n:64 [in Undecidability.TM.Code.BinNumbers.PosDefinitions]
n:64 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
n:64 [in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
n:64 [in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
n:64 [in Undecidability.Synthetic.Infinite]
n:64 [in Undecidability.TM.L.HeapInterpreter.LookupTM]
n:65 [in Undecidability.L.Prelim.ARS]
n:65 [in Undecidability.TM.Code.List.Concat_Repeat]
n:65 [in Undecidability.Shared.Libs.DLW.Vec.vec]
n:65 [in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
N:65 [in Complexity.L.ComparisonTimeBoundDerivation]
n:65 [in Complexity.NP.SAT.SAT_inNP]
n:65 [in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
n:65 [in Undecidability.L.Functions.UnboundIteration]
n:65 [in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
n:65 [in Undecidability.TM.Util.TM_facts]
N:65 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:652 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:66 [in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
n:66 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
n:66 [in Undecidability.TM.Code.BinNumbers.PosDefinitions]
n:66 [in Undecidability.TM.Code.List.Nth]
n:66 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
N:66 [in Complexity.NP.SAT.SAT_inNP]
n:66 [in Complexity.NP.SAT.FSAT.FSAT]
n:66 [in Complexity.NP.TM.LM_to_mTM]
n:67 [in Undecidability.TM.Single.StepTM]
n:67 [in Complexity.NP.SAT.SAT_inNP]
n:67 [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
n:67 [in Undecidability.Shared.Libs.DLW.Utils.sums]
n:67 [in Complexity.L.TM.TMflat]
n:67 [in Undecidability.TM.Hoare.HoareRegister]
n:67 [in Undecidability.L.Functions.UnboundIteration]
n:67 [in Complexity.L.TM.TMflatFun]
n:67 [in Undecidability.Synthetic.Infinite]
n:68 [in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
n:68 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
n:68 [in Undecidability.L.Computability.Seval]
n:68 [in Complexity.L.ComparisonTimeBoundDerivation]
n:68 [in Undecidability.Shared.Libs.DLW.Utils.sorting]
n:68 [in Undecidability.Shared.Libs.DLW.Utils.list_bool]
n:68 [in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
n:68 [in Undecidability.Synthetic.Infinite]
n:68 [in Undecidability.TM.L.HeapInterpreter.LookupTM]
N:68 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:687 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:69 [in Undecidability.TM.Single.StepTM]
n:69 [in Undecidability.L.Tactics.Extract]
n:69 [in Undecidability.L.Tactics.GenEncode]
n:69 [in Complexity.NP.SAT.SAT_inNP]
n:69 [in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
n:69 [in Undecidability.Synthetic.ListEnumerabilityFacts]
n:69 [in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
n:69 [in Undecidability.TM.Hoare.HoareMult]
n:69 [in Undecidability.Synthetic.Infinite]
n:69 [in Undecidability.TM.Hoare.HoareLogic]
n:69 [in Undecidability.TM.Hoare.HoareCombinators]
n:69 [in Complexity.NP.SAT.SAT]
n:696 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:7 [in Complexity.NP.SAT.CookLevin]
n:7 [in Undecidability.L.Functions.Eval]
n:7 [in Complexity.HierarchyTheorem.TimeHierarchyTheorem]
n:7 [in Undecidability.Shared.Libs.DLW.Utils.prime]
n:7 [in Undecidability.L.TM.TMinL]
n:7 [in Undecidability.TM.Code.CaseNat]
n:7 [in Undecidability.L.Functions.LoopSum]
n:7 [in Undecidability.L.Computability.Seval]
n:7 [in Undecidability.TM.PrettyBounds.SizeBounds]
N:7 [in Complexity.NP.SAT.kSAT]
n:7 [in Undecidability.TM.Util.VectorPrelim]
n:7 [in Undecidability.Synthetic.EnumerabilityFacts]
n:7 [in Complexity.NP.Clique.FlatUGraph]
n:7 [in Undecidability.TM.Code.BinNumbers.NTM]
n:7 [in Undecidability.Shared.FinTypeForallExists]
n:7 [in Undecidability.L.Datatypes.List.List_nat]
n:7 [in Undecidability.Shared.Libs.DLW.Utils.binomial]
n:7 [in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
n:7 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
n:7 [in Undecidability.L.Functions.Ackermann]
n:7 [in Undecidability.Synthetic.MoreEnumerabilityFacts]
n:7 [in Undecidability.Synthetic.ListEnumerabilityFacts]
n:7 [in Undecidability.TM.Lifting.LiftTapes]
n:7 [in Undecidability.L.Computability.Synthetic]
n:7 [in Undecidability.Synthetic.Infinite]
N:7 [in Complexity.NP.SAT.SAT]
n:7 [in Complexity.NP.SAT.kSAT_to_SAT]
n:7 [in Undecidability.Shared.Libs.DLW.Vec.pos]
n:7 [in Undecidability.L.Computability.Computability]
n:7 [in Complexity.Libs.CookPrelim.MorePrelim]
n:70 [in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
n:70 [in Undecidability.Shared.Libs.DLW.Vec.vec]
n:70 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
n:70 [in Undecidability.L.Computability.Enum]
n:70 [in Complexity.L.ComparisonTimeBoundDerivation]
n:70 [in Complexity.L.TM.TMflatComp]
n:70 [in Undecidability.Shared.Libs.DLW.Utils.sums]
n:70 [in Undecidability.TM.Hoare.HoareRegister]
n:70 [in Complexity.L.TM.TMflatten]
n:70 [in Undecidability.Synthetic.ListEnumerabilityFacts]
n:70 [in Undecidability.Synthetic.Infinite]
n:70 [in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
n:70 [in Complexity.Complexity.NP]
n:70 [in Complexity.TM.PrettyBounds.PrettyBounds]
n:71 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
n:71 [in Undecidability.TM.Single.StepTM]
n:71 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
n:71 [in Undecidability.TM.Code.List.Nth]
n:71 [in Undecidability.Shared.Libs.DLW.Utils.quotient]
n:71 [in Complexity.L.ComparisonTimeBoundDerivation]
n:71 [in Complexity.L.TM.TMflatComp]
N:71 [in Complexity.NP.SAT.SAT_inNP]
n:71 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
n:71 [in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
N:71 [in Complexity.NP.SAT.SAT]
n:71 [in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
n:71 [in Complexity.Complexity.NP]
n:711 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:715 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:72 [in Complexity.TM.PrettyBounds.BaseCode]
n:72 [in Undecidability.TM.Single.StepTM]
n:72 [in Undecidability.L.Computability.Seval]
n:72 [in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
n:72 [in Undecidability.TM.Code.NatTM]
n:72 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
n:72 [in Undecidability.Shared.Libs.DLW.Utils.quotient]
n:72 [in Complexity.NP.SAT.SAT_inNP]
n:72 [in Complexity.Libs.CookPrelim.PolyBounds]
n:72 [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
n:72 [in Undecidability.Shared.Libs.DLW.Utils.sorting]
n:72 [in Complexity.L.TM.TMunflatten]
n:72 [in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
n:72 [in Undecidability.Synthetic.Infinite]
n:72 [in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
n:72 [in Undecidability.TM.L.HeapInterpreter.LookupTM]
n:72 [in Complexity.NP.Clique.kSAT_to_FlatClique]
n:725 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:73 [in Undecidability.TM.Single.StepTM]
n:73 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
n:73 [in Undecidability.Shared.Libs.DLW.Utils.sums]
n:73 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
n:73 [in Complexity.NP.Clique.FlatClique]
n:73 [in Complexity.L.TM.TMflatten]
n:73 [in Undecidability.TM.Hoare.HoareMult]
n:74 [in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
n:74 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
n:74 [in Undecidability.L.Computability.Enum]
n:74 [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
n:74 [in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
n:74 [in Complexity.L.TM.TMflatFun]
n:74 [in Undecidability.Synthetic.ListEnumerabilityFacts]
n:74 [in Undecidability.Synthetic.Infinite]
n:74 [in Undecidability.TM.Hoare.HoareLogic]
n:74 [in Undecidability.Shared.Libs.DLW.Vec.pos]
n:74 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:747 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:75 [in Undecidability.Shared.Libs.DLW.Vec.vec]
n:75 [in Undecidability.Shared.Libs.DLW.Utils.prime]
n:75 [in Undecidability.TM.Code.List.Nth]
n:75 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
N:75 [in Complexity.NP.SAT.SAT_inNP]
n:75 [in Undecidability.Shared.Libs.DLW.Utils.sorting]
n:75 [in Undecidability.Synthetic.Infinite]
n:752 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:758 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:76 [in Complexity.TM.PrettyBounds.BaseCode]
n:76 [in Undecidability.TM.Single.StepTM]
n:76 [in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
n:76 [in Undecidability.Shared.Libs.DLW.Utils.list_bool]
n:76 [in Undecidability.Shared.Libs.DLW.Utils.sums]
N:76 [in Complexity.NP.Clique.kSAT_to_FlatClique]
n:76 [in Complexity.Libs.CookPrelim.MorePrelim]
n:77 [in Undecidability.Shared.Libs.DLW.Utils.prime]
n:77 [in Complexity.L.TM.TMflatComp]
n:77 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
n:77 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
n:77 [in Undecidability.TM.Hoare.HoareMult]
n:77 [in Undecidability.Synthetic.Infinite]
n:77 [in Undecidability.Shared.Libs.DLW.Vec.pos]
n:772 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:776 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:78 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
n:78 [in Undecidability.Shared.Libs.DLW.Utils.prime]
n:78 [in Undecidability.TM.Single.StepTM]
n:78 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
n:78 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
n:78 [in Undecidability.Shared.Libs.DLW.Utils.sorting]
n:78 [in Undecidability.Shared.Libs.DLW.Utils.fin_base]
n:78 [in Undecidability.Synthetic.ListEnumerabilityFacts]
n:78 [in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
n:78 [in Undecidability.L.Computability.Synthetic]
n:78 [in Undecidability.TM.L.HeapInterpreter.LookupTM]
n:784 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:79 [in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
n:79 [in Undecidability.TM.Code.List.Nth]
n:79 [in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
n:79 [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
n:79 [in Undecidability.Shared.Libs.DLW.Utils.sums]
n:79 [in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
n:79 [in Undecidability.Synthetic.ListEnumerabilityFacts]
n:79 [in Undecidability.L.Computability.Synthetic]
n:79 [in Undecidability.TM.Hoare.HoareCombinators]
n:79 [in Undecidability.Shared.Libs.DLW.Vec.pos]
n:790 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:792 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:795 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:799 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:8 [in Undecidability.TM.Compound.TMTac]
n:8 [in Complexity.L.Datatypes.LBinNums]
n:8 [in Undecidability.Shared.Libs.DLW.Vec.vec]
n:8 [in Undecidability.TM.Single.StepTM]
n:8 [in Undecidability.Shared.Libs.PSL.FiniteTypes.VectorFin]
n:8 [in Undecidability.Shared.Libs.DLW.Utils.binomial]
n:8 [in Complexity.L.AbstractMachines.Computable.Lookup]
n:8 [in Undecidability.L.Functions.EnumInt]
n:8 [in Undecidability.TM.Hoare.HoareCombinators]
n:8 [in Undecidability.TM.L.HeapInterpreter.LookupTM]
N:8 [in Complexity.NP.SAT.kSAT_to_SAT]
n:80 [in Undecidability.Shared.Libs.DLW.Vec.vec]
n:80 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
n:80 [in Undecidability.Shared.Libs.DLW.Utils.list_bool]
n:80 [in Complexity.L.TM.TMflatFun]
n:80 [in Undecidability.Synthetic.Infinite]
n:80 [in Undecidability.TM.Hoare.HoareLogic]
n:80 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
n:805 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:81 [in Undecidability.L.Computability.Enum]
n:81 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
n:81 [in Undecidability.L.Computability.Seval]
n:81 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
n:81 [in Undecidability.Shared.Libs.DLW.Utils.sorting]
n:81 [in Complexity.L.TM.TMunflatten]
n:81 [in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
n:81 [in Undecidability.Shared.Libs.DLW.Vec.pos]
n:81 [in Undecidability.TM.L.CompilerBoolFuns.Compiler]
N:81 [in Complexity.NP.Clique.kSAT_to_FlatClique]
n:814 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:82 [in Complexity.TM.PrettyBounds.BaseCode]
n:82 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:82 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
n:82 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
n:82 [in Undecidability.TM.Code.NatTM]
n:82 [in Complexity.NP.Clique.FlatClique]
n:82 [in Undecidability.TM.Hoare.HoareMult]
n:82 [in Undecidability.Synthetic.Infinite]
n:824 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:829 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:83 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:83 [in Undecidability.TM.Code.List.Nth]
n:83 [in Undecidability.L.Computability.Seval]
n:83 [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
n:83 [in Undecidability.Shared.Libs.DLW.Utils.sums]
n:83 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
n:83 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
n:83 [in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
n:83 [in Undecidability.Synthetic.Infinite]
n:83 [in Complexity.Complexity.Definitions]
n:83 [in Undecidability.TM.L.HeapInterpreter.LookupTM]
n:83 [in Undecidability.Shared.Libs.DLW.Vec.pos]
n:83 [in Complexity.NP.Clique.kSAT_to_FlatClique]
n:831 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:833 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:84 [in Undecidability.L.Computability.Enum]
n:84 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
n:84 [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
n:84 [in Complexity.Complexity.UpToCPoly]
n:84 [in Complexity.L.AbstractMachines.AbstractHeapMachine]
n:84 [in Complexity.Complexity.Definitions]
n:84 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:85 [in Complexity.TM.PrettyBounds.BaseCode]
n:85 [in Undecidability.TM.Single.StepTM]
n:85 [in Undecidability.L.Computability.Enum]
n:85 [in Complexity.Libs.CookPrelim.PolyBounds]
n:85 [in Undecidability.Shared.Libs.DLW.Utils.sorting]
n:85 [in Undecidability.Shared.Libs.DLW.Utils.sums]
n:85 [in Undecidability.Shared.Libs.DLW.Utils.fin_base]
n:85 [in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
n:85 [in Undecidability.TM.Hoare.HoareLogic]
n:85 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
N:85 [in Complexity.NP.Clique.kSAT_to_FlatClique]
n:85 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:850 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:86 [in Undecidability.Shared.Libs.DLW.Vec.vec]
n:862 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:87 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:87 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
n:87 [in Undecidability.Shared.Libs.DLW.Utils.sorting]
n:87 [in Undecidability.Shared.Libs.DLW.Utils.php]
n:87 [in Undecidability.TM.Hoare.HoareRegister]
n:87 [in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
n:87 [in Undecidability.TM.Hoare.HoareMult]
n:87 [in Undecidability.L.Computability.Synthetic]
n:87 [in Undecidability.TM.L.HeapInterpreter.LookupTM]
n:87 [in Undecidability.TM.L.CompilerBoolFuns.Compiler]
n:87 [in Complexity.NP.TM.LM_to_mTM]
N:87 [in Complexity.NP.Clique.kSAT_to_FlatClique]
n:871 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:877 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:88 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
n:88 [in Undecidability.TM.Code.List.Nth]
n:88 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
n:88 [in Undecidability.TM.Util.Prelim]
n:88 [in Complexity.Libs.CookPrelim.PolyBounds]
n:88 [in Undecidability.Shared.Libs.DLW.Utils.sums]
n:88 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
n:88 [in Undecidability.L.Computability.Synthetic]
n:88 [in Undecidability.Shared.Libs.DLW.Vec.pos]
n:88 [in Undecidability.Shared.Libs.DLW.Code.sss]
n:884 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:89 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
n:9 [in Undecidability.L.Functions.Eval]
n:9 [in Complexity.Complexity.ONotation]
n:9 [in Complexity.L.Datatypes.LBinNums]
n:9 [in Undecidability.Shared.Libs.DLW.Utils.prime]
n:9 [in Undecidability.L.TM.TMinL]
n:9 [in Complexity.L.AbstractMachines.FlatPro.Computable.Decompile]
n:9 [in Undecidability.Shared.Libs.DLW.Utils.crt]
n:9 [in Undecidability.Shared.Libs.PSL.FiniteTypes.VectorFin]
n:9 [in Undecidability.Shared.FinTypeForallExists]
n:9 [in Undecidability.L.Datatypes.List.List_extra]
n:9 [in Complexity.Complexity.SpaceBoundsTime]
n:9 [in Undecidability.Shared.Libs.DLW.Wf.wf_finite]
n:9 [in Complexity.TM.Single.DecodeTapes]
n:9 [in Undecidability.Shared.Libs.PSL.Vectors.VectorDupfree]
n:9 [in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
N:9 [in Complexity.NP.SAT.kSAT_to_SAT]
n:9 [in Undecidability.Shared.Libs.DLW.Vec.pos]
n:9 [in Undecidability.TM.L.Transcode.Enc_to_Boollist]
n:9 [in Complexity.Libs.CookPrelim.MorePrelim]
n:9 [in Undecidability.L.AbstractMachines.LargestVar]
n:90 [in Undecidability.Shared.Libs.DLW.Vec.vec]
n:90 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
n:90 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
n:90 [in Undecidability.Synthetic.ListEnumerabilityFacts]
N:90 [in Complexity.NP.Clique.kSAT_to_FlatClique]
n:91 [in Undecidability.TM.Code.NatTM]
n:91 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
n:91 [in Complexity.Libs.CookPrelim.PolyBounds]
n:91 [in Complexity.NP.Clique.FlatClique]
n:91 [in Undecidability.TM.Hoare.HoareCombinators]
n:91 [in Undecidability.TM.L.HeapInterpreter.LookupTM]
n:91 [in Undecidability.Shared.Libs.DLW.Vec.pos]
n:91 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
n:913 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:92 [in Undecidability.TM.Hoare.HoareRegister]
n:92 [in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
n:92 [in Undecidability.TM.Hoare.HoareMult]
n:93 [in Undecidability.TM.Code.List.Nth]
n:93 [in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
n:93 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
n:93 [in Undecidability.TM.Util.Prelim]
n:93 [in Undecidability.L.Datatypes.LVector]
n:93 [in Complexity.NP.Clique.kSAT_to_FlatClique]
n:931 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:939 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:94 [in Undecidability.Shared.Libs.DLW.Vec.vec]
n:94 [in Undecidability.TM.Single.StepTM]
n:94 [in Complexity.Libs.CookPrelim.FlatFinTypes]
n:94 [in Undecidability.Shared.Libs.DLW.Utils.sorting]
n:94 [in Undecidability.Shared.Libs.DLW.Utils.sums]
n:94 [in Undecidability.Shared.Libs.DLW.Vec.pos]
n:94 [in Undecidability.TM.Hoare.HoareExamples]
N:94 [in Complexity.NP.Clique.kSAT_to_FlatClique]
n:943 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:944 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:95 [in Undecidability.Shared.Libs.DLW.Utils.php]
n:95 [in Complexity.L.AbstractMachines.AbstractHeapMachine]
n:95 [in Undecidability.TM.Hoare.HoareLogic]
n:95 [in Undecidability.TM.L.HeapInterpreter.LookupTM]
n:95 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
n:95 [in Complexity.NP.TM.LM_to_mTM]
n:954 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:959 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
n:96 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
n:96 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
n:96 [in Undecidability.Shared.Libs.DLW.Utils.fin_base]
n:96 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
n:96 [in Complexity.NP.TM.LM_to_mTM]
n:97 [in Undecidability.Shared.Libs.DLW.Vec.vec]
n:97 [in Undecidability.TM.Code.List.Nth]
n:97 [in Undecidability.L.Tactics.LClos]
n:97 [in Complexity.L.TM.TMflatComp]
n:97 [in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
n:97 [in Undecidability.TM.Hoare.HoareMult]
N:97 [in Complexity.NP.Clique.kSAT_to_FlatClique]
n:98 [in Undecidability.L.Computability.Seval]
n:98 [in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
n:98 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
n:98 [in Undecidability.Shared.Libs.DLW.Vec.pos]
n:99 [in Undecidability.Shared.Libs.DLW.Vec.vec]
n:99 [in Undecidability.L.Datatypes.LVector]
n:99 [in Complexity.TM.PrettyBounds.BaseCodeSpace]
n:99 [in Complexity.L.TM.TMunflatten]
n:99 [in Undecidability.TM.Hoare.HoareRegister]
n:99 [in Undecidability.Shared.Libs.DLW.Utils.fin_base]

O

ob:53 [in Undecidability.Shared.Libs.PSL.Retracts]
oconf':61 [in Undecidability.TM.Lifting.LiftAlphabet]
oconf:174 [in Undecidability.TM.Univ.Univ]
oconf:320 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
oconf:60 [in Undecidability.TM.Lifting.LiftAlphabet]
ostate:326 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
otapes:327 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
outc:280 [in Undecidability.TM.Util.TM_facts]
outc:310 [in Undecidability.TM.Util.TM_facts]
outc:362 [in Undecidability.TM.Util.TM_facts]
outc:368 [in Undecidability.TM.Util.TM_facts]
outc:40 [in Undecidability.TM.Combinators.Switch]
outc:45 [in Undecidability.TM.Combinators.Switch]
outc:504 [in Undecidability.TM.Single.StepTM]
out:7 [in Complexity.NP.TM.LM_to_mTM]
out:8 [in Complexity.TM.Code.DecodeBool]
o1:19 [in Complexity.NP.Clique.kSAT_to_Clique]
o1:21 [in Complexity.NP.Clique.kSAT_to_FlatClique]
o1:25 [in Complexity.NP.Clique.kSAT_to_FlatClique]
o1:30 [in Complexity.NP.Clique.kSAT_to_Clique]
o1:66 [in Complexity.NP.Clique.kSAT_to_FlatClique]
o1:70 [in Complexity.NP.Clique.kSAT_to_FlatClique]
o1:73 [in Complexity.NP.Clique.kSAT_to_FlatClique]
o2:20 [in Complexity.NP.Clique.kSAT_to_Clique]
o2:22 [in Complexity.NP.Clique.kSAT_to_FlatClique]
o2:26 [in Complexity.NP.Clique.kSAT_to_FlatClique]
o2:31 [in Complexity.NP.Clique.kSAT_to_Clique]
o2:67 [in Complexity.NP.Clique.kSAT_to_FlatClique]
o2:71 [in Complexity.NP.Clique.kSAT_to_FlatClique]
o2:74 [in Complexity.NP.Clique.kSAT_to_FlatClique]
o:101 [in Undecidability.TM.Util.Prelim]
o:11 [in Undecidability.TM.Code.CaseNat]
o:11 [in Undecidability.TM.Compound.MoveToSymbol]
o:113 [in Complexity.TM.PrettyBounds.BaseCode]
o:13 [in Undecidability.TM.SBTM]
o:143 [in Undecidability.TM.Code.Code]
o:145 [in Undecidability.TM.Code.Code]
o:147 [in Undecidability.TM.Code.Code]
o:17 [in Undecidability.TM.Code.CaseSum]
o:186 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
o:19 [in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
o:199 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
o:20 [in Undecidability.TM.Compound.Multi]
o:34 [in Undecidability.TM.Code.CaseSum]
o:42 [in Undecidability.TM.Code.CaseSum]
o:44 [in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
o:622 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
o:67 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
o:71 [in Undecidability.TM.Code.CaseSum]
o:73 [in Undecidability.TM.Code.CaseSum]
o:74 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
o:79 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
o:8 [in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
o:80 [in Complexity.TM.PrettyBounds.PrettyBounds]
o:83 [in Undecidability.L.Tactics.Extract]
o:84 [in Undecidability.TM.L.CompilerBoolFuns.Compiler]
o:87 [in Undecidability.L.Tactics.Extract]
o:9 [in Undecidability.TM.Compound.CopySymbols]
o:90 [in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
o:92 [in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]

P

padding:27 [in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
padding:40 [in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
params:20 [in Undecidability.L.Tactics.GenEncode]
Params:73 [in Undecidability.L.Tactics.Extract]
params:77 [in Undecidability.L.Tactics.Extract]
params:97 [in Undecidability.L.Tactics.Extract]
pat:10 [in Undecidability.TM.Hoare.HoareLegacy]
pat:10 [in Undecidability.TM.Compound.MoveToSymbol]
pat:10 [in Undecidability.TM.Code.List.Rev]
pat:10 [in Undecidability.TM.Code.BinNumbers.NTM]
pat:10 [in Complexity.NP.TM.L_to_LM]
pat:100 [in Undecidability.L.Computability.Synthetic]
pat:103 [in Undecidability.L.Tactics.Extract]
pat:103 [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
pat:103 [in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
pat:103 [in Undecidability.TM.Univ.LookupAssociativeListTM]
pat:103 [in Undecidability.TM.L.HeapInterpreter.LookupTM]
pat:104 [in Undecidability.TM.Hoare.HoareMult]
pat:105 [in Undecidability.TM.Code.BinNumbers.PosAddTM]
pat:107 [in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
pat:107 [in Complexity.NP.Clique.kSAT_to_Clique]
pat:107 [in Undecidability.TM.Univ.LookupAssociativeListTM]
pat:108 [in Undecidability.TM.L.HeapInterpreter.LookupTM]
pat:11 [in Undecidability.TM.Combinators.Switch]
pat:11 [in Undecidability.TM.Basic.Mono]
pat:11 [in Undecidability.TM.Hoare.HoareLogic]
pat:11 [in Complexity.NP.Clique.kSAT_to_FlatClique]
pat:110 [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
pat:110 [in Undecidability.TM.Lifting.LiftTapes]
pat:110 [in Undecidability.TM.Hoare.HoareMult]
pat:110 [in Undecidability.TM.Code.BinNumbers.PosAddTM]
pat:111 [in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
pat:111 [in Complexity.L.TM.TMflatComp]
pat:112 [in Undecidability.TM.L.HeapInterpreter.StepTM]
pat:112 [in Undecidability.TM.Univ.LookupAssociativeListTM]
pat:112 [in Undecidability.TM.Hoare.HoareCombinators]
pat:112 [in Undecidability.TM.L.HeapInterpreter.LookupTM]
pat:115 [in Undecidability.TM.Util.Relations]
pat:116 [in Undecidability.TM.Hoare.HoareMult]
pat:117 [in Undecidability.TM.Code.List.Nth]
pat:117 [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
pat:117 [in Undecidability.TM.Univ.LowLevel]
pat:117 [in Undecidability.TM.Univ.LookupAssociativeListTM]
pat:117 [in Undecidability.TM.Hoare.HoareLogic]
pat:119 [in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
pat:12 [in Undecidability.TM.L.Transcode.Boollist_to_Enc]
pat:12 [in Complexity.NP.TM.TMGenNP]
pat:12 [in Undecidability.TM.Code.CaseSum]
pat:12 [in Undecidability.TM.Compound.Compare]
pat:12 [in Complexity.NP.Clique.FlatClique]
pat:12 [in Undecidability.TM.SBTM]
pat:12 [in Complexity.NP.L.GenNP]
pat:12 [in Undecidability.TM.L.CompilerBoolFuns.Compiler]
pat:12 [in Undecidability.TM.Code.BinNumbers.PosShiftTM]
pat:120 [in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
pat:121 [in Undecidability.TM.Hoare.HoareMult]
pat:121 [in Undecidability.TM.Univ.LookupAssociativeListTM]
pat:123 [in Complexity.NP.Clique.kSAT_to_Clique]
pat:124 [in Complexity.L.TM.TMunflatten]
pat:125 [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
pat:125 [in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
pat:125 [in Undecidability.TM.Code.Code]
pat:125 [in Complexity.Complexity.NP]
pat:126 [in Undecidability.TM.Hoare.HoareMult]
pat:126 [in Undecidability.TM.Hoare.HoareExamples]
pat:127 [in Undecidability.TM.Univ.Univ]
pat:128 [in Undecidability.TM.Hoare.HoareLogic]
pat:128 [in Complexity.Complexity.NP]
pat:129 [in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
pat:129 [in Complexity.NP.Clique.FlatClique]
pat:13 [in Undecidability.TM.Code.List.Concat_Repeat]
pat:13 [in Undecidability.TM.Code.BinNumbers.NTM]
pat:13 [in Undecidability.TM.Combinators.StateWhile]
pat:13 [in Undecidability.TM.Basic.Duo]
pat:131 [in Undecidability.TM.Univ.LowLevel]
pat:131 [in Undecidability.TM.Hoare.HoareMult]
pat:131 [in Undecidability.TM.Univ.Univ]
pat:133 [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
pat:133 [in Complexity.NP.Clique.FlatClique]
pat:133 [in Undecidability.TM.Univ.LookupAssociativeListTM]
pat:135 [in Undecidability.TM.Univ.Univ]
pat:135 [in Undecidability.TM.Hoare.HoareExamples]
pat:137 [in Undecidability.TM.Hoare.HoareMult]
pat:138 [in Undecidability.TM.Hoare.HoareExamples]
pat:139 [in Complexity.NP.Clique.FlatClique]
pat:139 [in Undecidability.TM.Univ.Univ]
pat:14 [in Undecidability.TM.Code.List.Length]
pat:14 [in Complexity.L.TM.TMunflatten]
pat:14 [in Undecidability.TM.Code.NatSub]
pat:140 [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
pat:140 [in Undecidability.TM.Hoare.HoareRegister]
pat:142 [in Undecidability.TM.Hoare.HoareExamples]
pat:143 [in Complexity.NP.Clique.FlatClique]
pat:143 [in Undecidability.TM.Hoare.HoareMult]
pat:143 [in Undecidability.TM.Univ.Univ]
pat:145 [in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
pat:146 [in Undecidability.TM.Hoare.HoareRegister]
pat:146 [in Undecidability.TM.Hoare.HoareExamples]
pat:147 [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
pat:147 [in Undecidability.TM.Univ.Univ]
pat:148 [in Undecidability.TM.Hoare.HoareMult]
pat:149 [in Undecidability.TM.Hoare.HoareExamples]
pat:15 [in Undecidability.L.TM.TMinL]
pat:15 [in Complexity.NP.L.LMGenNP]
pat:151 [in Undecidability.TM.Univ.Univ]
pat:153 [in Undecidability.TM.Hoare.HoareExamples]
pat:155 [in Undecidability.TM.Univ.Univ]
pat:159 [in Undecidability.TM.Univ.Univ]
pat:16 [in Complexity.TM.Code.Decode]
pat:16 [in Complexity.NP.TM.mTM_to_singleTapeTM]
pat:16 [in Undecidability.TM.Lifting.LiftAlphabet]
pat:16 [in Undecidability.TM.Hoare.HoareLegacy]
pat:16 [in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
pat:16 [in Complexity.L.AbstractMachines.Computable.Unfolding]
pat:16 [in Undecidability.L.Functions.FinTypeLookup]
pat:16 [in Complexity.NP.TM.TMGenNP_fixed_mTM]
pat:163 [in Undecidability.TM.L.HeapInterpreter.StepTM]
pat:163 [in Undecidability.TM.Univ.Univ]
pat:164 [in Undecidability.TM.Hoare.HoareRegister]
pat:166 [in Complexity.L.TM.TMunflatten]
pat:166 [in Undecidability.TM.Univ.Univ]
pat:169 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
pat:169 [in Undecidability.TM.Hoare.HoareRegister]
pat:17 [in Undecidability.TM.Code.BinNumbers.PosIncrementTM]
pat:17 [in Undecidability.TM.Code.NatSub]
pat:170 [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
pat:170 [in Undecidability.TM.Hoare.HoareExamples]
pat:172 [in Complexity.L.TM.TMflatComp]
pat:173 [in Undecidability.TM.Hoare.HoareExamples]
pat:177 [in Undecidability.TM.Hoare.HoareExamples]
pat:18 [in Undecidability.TM.Basic.Mono]
pat:18 [in Undecidability.TM.Code.BinNumbers.NTM]
pat:18 [in Complexity.NP.SAT.CookLevin.Subproblems.SingleTMGenNP]
pat:18 [in Undecidability.TM.Basic.Duo]
pat:181 [in Complexity.L.TM.TMflatComp]
pat:181 [in Undecidability.TM.Hoare.HoareExamples]
pat:184 [in Undecidability.TM.Hoare.HoareExamples]
pat:187 [in Undecidability.TM.Hoare.HoareExamples]
pat:19 [in Undecidability.TM.Code.BinNumbers.PosMultTM]
pat:19 [in Undecidability.TM.Code.CaseNat]
pat:190 [in Undecidability.TM.Hoare.HoareExamples]
pat:194 [in Undecidability.TM.Hoare.HoareExamples]
pat:198 [in Undecidability.TM.Hoare.HoareExamples]
pat:20 [in Complexity.NP.TM.mTM_to_singleTapeTM]
pat:20 [in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
pat:20 [in Complexity.NP.TM.TMGenNP]
pat:20 [in Undecidability.TM.Hoare.HoareMult]
pat:20 [in Complexity.TM.Single.DecodeTape]
pat:20 [in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
pat:201 [in Undecidability.TM.Hoare.HoareExamples]
pat:202 [in Undecidability.TM.Single.StepTM]
pat:208 [in Undecidability.TM.L.HeapInterpreter.StepTM]
pat:21 [in Undecidability.L.Functions.Size]
pat:212 [in Undecidability.TM.Single.StepTM]
pat:212 [in Undecidability.TM.Hoare.HoareExamples]
pat:216 [in Undecidability.TM.Hoare.HoareExamples]
pat:22 [in Undecidability.TM.Lifting.LiftTapes]
pat:22 [in Complexity.L.AbstractMachines.Computable.HeapMachine]
pat:221 [in Undecidability.TM.Hoare.HoareExamples]
pat:224 [in Undecidability.L.Tactics.Extract]
pat:224 [in Complexity.L.TM.TMflatComp]
pat:226 [in Undecidability.TM.Hoare.HoareExamples]
pat:229 [in Undecidability.TM.Single.StepTM]
pat:23 [in Complexity.L.AbstractMachines.Computable.Unfolding]
pat:23 [in Complexity.L.AbstractMachines.Computable.LargestVar]
pat:230 [in Undecidability.TM.Hoare.HoareExamples]
pat:234 [in Undecidability.TM.Hoare.HoareExamples]
pat:237 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
pat:238 [in Undecidability.TM.Hoare.HoareExamples]
pat:24 [in Undecidability.TM.Code.BinNumbers.PosIncrementTM]
pat:24 [in Undecidability.TM.Code.BinNumbers.NTM]
pat:24 [in Complexity.L.AbstractMachines.FlatPro.Computable.Compile]
pat:24 [in Undecidability.TM.Hoare.HoareMult]
pat:243 [in Undecidability.TM.Hoare.HoareExamples]
pat:248 [in Undecidability.TM.Hoare.HoareExamples]
pat:25 [in Complexity.TM.Code.Decode]
pat:25 [in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
pat:25 [in Undecidability.TM.Code.CompareValue]
pat:25 [in Complexity.L.TM.TMunflatten]
pat:25 [in Undecidability.TM.Code.NatSub]
pat:250 [in Undecidability.TM.Single.StepTM]
pat:252 [in Undecidability.TM.Hoare.HoareExamples]
pat:258 [in Undecidability.TM.Single.StepTM]
pat:26 [in Undecidability.L.Tactics.GenEncode]
pat:26 [in Complexity.NP.TM.TMGenNP]
pat:26 [in Complexity.NP.SAT.CookLevin.Subproblems.SingleTMGenNP]
pat:26 [in Undecidability.L.Functions.Size]
pat:265 [in Undecidability.TM.Hoare.HoareExamples]
pat:267 [in Undecidability.TM.Single.StepTM]
pat:27 [in Complexity.TM.Single.DecodeTapes]
pat:28 [in Undecidability.TM.Code.BinNumbers.PosCompareTM]
pat:28 [in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
pat:28 [in Undecidability.TM.Code.BinNumbers.NTM]
pat:28 [in Complexity.L.AbstractMachines.FlatPro.Computable.Compile]
pat:28 [in Undecidability.TM.L.Transcode.Enc_to_Boollist]
pat:28 [in Undecidability.TM.Compound.Multi]
pat:28 [in Complexity.L.AbstractMachines.Computable.LargestVar]
pat:28 [in Complexity.NP.TM.TMGenNP_fixed_mTM]
pat:28 [in Undecidability.TM.Code.BinNumbers.PosShiftTM]
pat:282 [in Undecidability.TM.Single.StepTM]
pat:29 [in Complexity.L.AbstractMachines.Computable.EvalForTime]
pat:29 [in Undecidability.TM.Code.NatSub]
pat:29 [in Undecidability.TM.Hoare.HoareMult]
pat:294 [in Undecidability.TM.Hoare.HoareExamples]
pat:298 [in Undecidability.TM.Hoare.HoareExamples]
pat:3 [in Undecidability.Shared.embed_nat]
pat:3 [in Undecidability.L.Functions.Size]
pat:30 [in Complexity.NP.TM.mTM_to_singleTapeTM]
pat:30 [in Undecidability.TM.Combinators.Mirror]
pat:303 [in Undecidability.TM.Single.StepTM]
pat:303 [in Undecidability.TM.Hoare.HoareExamples]
pat:308 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
pat:308 [in Undecidability.TM.Hoare.HoareExamples]
pat:31 [in Undecidability.TM.L.Transcode.Boollist_to_Enc]
pat:31 [in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
pat:31 [in Undecidability.TM.Code.List.Rev]
pat:31 [in Undecidability.TM.L.Transcode.Enc_to_Boollist]
pat:31 [in Undecidability.L.Functions.Size]
pat:31 [in Complexity.NP.Clique.kSAT_to_FlatClique]
pat:312 [in Undecidability.TM.Hoare.HoareExamples]
pat:316 [in Undecidability.TM.Hoare.HoareExamples]
pat:32 [in Undecidability.TM.Code.List.Concat_Repeat]
pat:32 [in Complexity.L.AbstractMachines.Computable.EvalForTime]
pat:32 [in Complexity.L.AbstractMachines.FlatPro.Computable.Compile]
pat:32 [in Undecidability.TM.Code.NatSub]
pat:320 [in Undecidability.TM.Hoare.HoareExamples]
pat:325 [in Undecidability.TM.Hoare.HoareExamples]
pat:33 [in Undecidability.TM.Code.BinNumbers.NTM]
pat:33 [in Undecidability.TM.Code.CaseSum]
pat:33 [in Complexity.NP.TM.M_LM2TM]
pat:33 [in Complexity.Complexity.NP]
pat:33 [in Complexity.L.AbstractMachines.Computable.LargestVar]
pat:330 [in Undecidability.TM.Hoare.HoareExamples]
pat:334 [in Undecidability.TM.Hoare.HoareExamples]
pat:34 [in Complexity.NP.TM.mTM_to_singleTapeTM]
pat:34 [in Undecidability.TM.Code.BinNumbers.PosCompareTM]
pat:34 [in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
pat:34 [in Undecidability.TM.Hoare.HoareMult]
pat:345 [in Undecidability.TM.Hoare.HoareCombinators]
pat:348 [in Undecidability.TM.Hoare.HoareExamples]
pat:35 [in Undecidability.TM.Code.WriteValue]
pat:35 [in Undecidability.TM.TM]
pat:35 [in Undecidability.TM.L.Transcode.Enc_to_Boollist]
pat:350 [in Undecidability.TM.Hoare.HoareCombinators]
pat:353 [in Undecidability.TM.Hoare.HoareExamples]
pat:355 [in Undecidability.TM.Hoare.HoareCombinators]
pat:359 [in Undecidability.TM.Hoare.HoareExamples]
pat:36 [in Undecidability.TM.Code.List.Concat_Repeat]
pat:36 [in Undecidability.TM.Basic.Mono]
pat:36 [in Complexity.NP.TM.TMGenNP]
pat:36 [in Complexity.NP.L.GenNPBool]
pat:36 [in Complexity.L.AbstractMachines.FlatPro.Computable.Compile]
pat:36 [in Undecidability.TM.Code.NatSub]
pat:36 [in Undecidability.TM.Util.Relations]
pat:36 [in Undecidability.L.Functions.Size]
pat:360 [in Undecidability.TM.Hoare.HoareCombinators]
pat:361 [in Undecidability.TM.Util.TM_facts]
pat:365 [in Undecidability.TM.Hoare.HoareExamples]
pat:37 [in Undecidability.TM.Code.BinNumbers.PosMultTM]
pat:37 [in Complexity.NP.TM.M_LM2TM]
pat:370 [in Undecidability.TM.Hoare.HoareExamples]
pat:375 [in Undecidability.TM.Hoare.HoareExamples]
pat:38 [in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
pat:38 [in Undecidability.TM.SBTM]
pat:38 [in Undecidability.TM.Hoare.HoareMult]
pat:38 [in Undecidability.TM.Code.BinNumbers.PosAddTM]
pat:38 [in Complexity.L.AbstractMachines.Computable.LargestVar]
pat:38 [in Undecidability.TM.Code.BinNumbers.PosShiftTM]
pat:380 [in Undecidability.TM.Hoare.HoareExamples]
pat:386 [in Undecidability.TM.Hoare.HoareExamples]
pat:39 [in Undecidability.TM.Code.List.Concat_Repeat]
pat:39 [in Undecidability.TM.Code.CaseList]
pat:39 [in Undecidability.TM.Code.BinNumbers.NTM]
pat:39 [in Undecidability.TM.Code.NatSub]
pat:39 [in Undecidability.TM.L.Transcode.Enc_to_Boollist]
pat:392 [in Undecidability.TM.Hoare.HoareExamples]
pat:397 [in Undecidability.TM.Hoare.HoareExamples]
pat:4 [in Undecidability.TM.Basic.Null]
pat:4 [in Undecidability.TM.Code.BinNumbers.PosIncrementTM]
pat:4 [in Undecidability.TM.Code.NatTM]
pat:4 [in Complexity.L.AbstractMachines.Computable.Unfolding]
pat:4 [in Complexity.L.AbstractMachines.Computable.UnivDecTime]
pat:4 [in Complexity.NP.L.GenNPBool]
pat:4 [in Undecidability.L.AbstractMachines.FlatPro.UnfoldClos]
pat:4 [in Complexity.L.AbstractMachines.FlatPro.Computable.Compile]
pat:4 [in Undecidability.TM.Code.NatSub]
pat:4 [in Undecidability.TM.SBTM]
pat:4 [in Undecidability.Synthetic.DecidabilityFacts]
pat:40 [in Complexity.NP.TM.mTM_to_singleTapeTM]
pat:40 [in Complexity.L.AbstractMachines.FlatPro.Computable.Compile]
pat:40 [in Complexity.L.AbstractMachines.AbstractSubstMachine]
pat:40 [in Complexity.NP.TM.M_LM2TM]
pat:404 [in Undecidability.TM.Single.StepTM]
pat:41 [in Undecidability.TM.Code.BinNumbers.PosCompareTM]
pat:41 [in Complexity.NP.L.GenNPBool]
pat:41 [in Undecidability.L.Functions.Size]
pat:411 [in Undecidability.TM.Hoare.HoareCombinators]
pat:415 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
pat:419 [in Undecidability.TM.Hoare.HoareCombinators]
pat:42 [in Undecidability.TM.Basic.Mono]
pat:42 [in Undecidability.TM.Hoare.HoareMult]
pat:42 [in Undecidability.TM.L.Transcode.Enc_to_Boollist]
pat:424 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
pat:43 [in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
pat:43 [in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
pat:43 [in Complexity.NP.TM.M_LM2TM]
pat:43 [in Complexity.NP.TM.M_multi2mono]
pat:43 [in Complexity.L.AbstractMachines.Computable.LargestVar]
pat:432 [in Undecidability.TM.Single.StepTM]
pat:44 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds_Loop]
pat:44 [in Complexity.L.AbstractMachines.FlatPro.Computable.Compile]
pat:45 [in Undecidability.TM.Code.List.Concat_Repeat]
pat:45 [in Complexity.NP.TM.mTM_to_singleTapeTM]
pat:45 [in Undecidability.TM.Lifting.LiftAlphabet]
pat:45 [in Undecidability.TM.L.HeapInterpreter.LookupTM]
pat:45 [in Undecidability.TM.L.Transcode.Enc_to_Boollist]
pat:45 [in Complexity.Complexity.NP]
pat:46 [in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
pat:46 [in Complexity.NP.TM.M_LM2TM]
pat:46 [in Undecidability.L.Complexity.GenericNary]
pat:46 [in Undecidability.TM.Hoare.HoareMult]
pat:46 [in Undecidability.L.Functions.Size]
pat:46 [in Undecidability.TM.Code.BinNumbers.PosShiftTM]
pat:464 [in Undecidability.TM.Single.StepTM]
pat:47 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds_Loop]
pat:47 [in Undecidability.TM.Basic.Mono]
pat:47 [in Complexity.NP.TM.TMGenNP]
pat:47 [in Undecidability.TM.Code.NatSub]
pat:48 [in Undecidability.TM.TM]
pat:48 [in Undecidability.TM.L.Transcode.Enc_to_Boollist]
pat:48 [in Complexity.L.AbstractMachines.Computable.LargestVar]
pat:480 [in Undecidability.TM.Single.StepTM]
pat:49 [in Complexity.L.AbstractMachines.UnfoldTailRec]
pat:49 [in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
pat:49 [in Undecidability.TM.SBTM]
pat:49 [in Undecidability.TM.Code.BinNumbers.PosAddTM]
pat:5 [in Complexity.L.AbstractMachines.Computable.EvalForTime]
pat:5 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
pat:5 [in Undecidability.TM.Code.BinNumbers.PosCompareTM]
pat:5 [in Undecidability.TM.Code.BinNumbers.NTM]
pat:5 [in Complexity.L.AbstractMachines.Computable.LargestVar]
pat:5 [in Undecidability.TM.Code.BinNumbers.PosShiftTM]
pat:50 [in Undecidability.TM.Code.BinNumbers.PosCompareTM]
pat:50 [in Undecidability.TM.Compound.Compare]
pat:50 [in Undecidability.TM.L.HeapInterpreter.StepTM]
pat:50 [in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
pat:51 [in Undecidability.TM.Code.List.Concat_Repeat]
pat:51 [in Undecidability.TM.Code.BinNumbers.PosMultTM]
pat:51 [in Undecidability.TM.Code.NatSub]
pat:51 [in Undecidability.TM.Hoare.HoareMult]
pat:510 [in Undecidability.TM.Single.StepTM]
pat:52 [in Undecidability.TM.Code.List.Rev]
pat:52 [in Complexity.NP.TM.TMGenNP]
pat:52 [in Undecidability.TM.L.Transcode.Enc_to_Boollist]
pat:54 [in Undecidability.TM.Code.NatSub]
pat:56 [in Undecidability.TM.Hoare.HoareMult]
pat:56 [in Undecidability.TM.L.Transcode.Enc_to_Boollist]
pat:57 [in Complexity.NP.SAT.SAT_inNP]
pat:57 [in Undecidability.TM.TM]
pat:57 [in Complexity.L.AbstractMachines.FunctionalDefinitions]
pat:58 [in Undecidability.L.Computability.Synthetic]
pat:58 [in Undecidability.TM.Code.BinNumbers.PosShiftTM]
pat:59 [in Undecidability.TM.Code.List.Nth]
pat:59 [in Undecidability.TM.L.Transcode.Enc_to_Boollist]
pat:59 [in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
pat:6 [in Undecidability.TM.Code.CaseNat]
pat:6 [in Undecidability.TM.Code.CaseBool]
pat:6 [in Complexity.Complexity.Subtypes]
pat:6 [in Complexity.NP.TM.TMGenNP]
pat:6 [in Complexity.NP.TM.L_to_LM]
pat:6 [in Undecidability.TM.L.CaseCom]
pat:6 [in Complexity.NP.L.GenNP]
pat:6 [in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
pat:60 [in Undecidability.TM.Code.List.Concat_Repeat]
pat:60 [in Undecidability.TM.Code.NatTM]
pat:60 [in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
pat:60 [in Undecidability.TM.Hoare.HoareMult]
pat:608 [in Complexity.NP.TM.LM_to_mTM]
pat:61 [in Undecidability.L.Computability.Synthetic]
pat:612 [in Complexity.NP.TM.LM_to_mTM]
pat:619 [in Complexity.NP.TM.LM_to_mTM]
pat:623 [in Complexity.NP.TM.LM_to_mTM]
pat:63 [in Undecidability.TM.Code.List.Nth]
pat:63 [in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
pat:63 [in Undecidability.TM.Code.BinNumbers.PosShiftTM]
pat:64 [in Undecidability.TM.Code.List.Concat_Repeat]
pat:65 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
pat:65 [in Complexity.TM.Code.Decode]
pat:65 [in Complexity.L.AbstractMachines.FunctionalDefinitions]
pat:65 [in Undecidability.TM.Code.BinNumbers.PosAddTM]
pat:66 [in Complexity.Complexity.Subtypes]
pat:66 [in Undecidability.TM.Univ.LowLevel]
pat:67 [in Undecidability.TM.Code.List.Concat_Repeat]
pat:68 [in Undecidability.TM.Code.List.Nth]
pat:68 [in Complexity.Complexity.Subtypes]
pat:68 [in Complexity.TM.Single.DecodeTape]
pat:68 [in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
pat:68 [in Undecidability.TM.Code.BinNumbers.PosShiftTM]
pat:7 [in Undecidability.TM.Combinators.While]
pat:7 [in Complexity.NP.TM.M_LM2TM]
pat:7 [in Undecidability.TM.Basic.Duo]
pat:7 [in Undecidability.TM.Compound.Shift]
pat:7 [in Complexity.NP.TM.TMGenNP_fixed_mTM]
pat:70 [in Undecidability.TM.L.HeapInterpreter.LookupTM]
pat:71 [in Undecidability.TM.Code.BinNumbers.PosAddTM]
pat:72 [in Undecidability.TM.Code.BinNumbers.PosCompareTM]
pat:73 [in Undecidability.TM.Code.List.Nth]
pat:74 [in Undecidability.TM.Code.CaseList]
pat:74 [in Complexity.TM.Single.DecodeTape]
pat:74 [in Undecidability.TM.L.HeapInterpreter.LookupTM]
pat:75 [in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
pat:75 [in Undecidability.TM.Univ.LowLevel]
pat:76 [in Undecidability.TM.Code.BinNumbers.PosAddTM]
pat:77 [in Undecidability.TM.Code.List.Nth]
pat:77 [in Undecidability.TM.Util.Prelim]
pat:78 [in Undecidability.L.Complexity.UpToCNary]
pat:78 [in Undecidability.TM.Code.BinNumbers.PosCompareTM]
pat:78 [in Complexity.TM.Single.DecodeTape]
pat:78 [in Undecidability.TM.Univ.Univ]
pat:8 [in Complexity.L.AbstractMachines.UnfoldTailRec]
pat:8 [in Undecidability.TM.Code.CaseFin]
pat:8 [in Complexity.L.Functions.IterupN]
pat:8 [in Undecidability.TM.Compound.CopySymbols]
pat:8 [in Complexity.NP.L.LMGenNP]
pat:8 [in Undecidability.TM.SBTM]
pat:8 [in Complexity.NP.TM.M_multi2mono]
pat:80 [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
pat:80 [in Undecidability.TM.L.HeapInterpreter.LookupTM]
pat:81 [in Undecidability.TM.Code.List.Nth]
pat:81 [in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
pat:81 [in Undecidability.TM.Util.Prelim]
pat:81 [in Undecidability.TM.Univ.LookupAssociativeListTM]
pat:82 [in Undecidability.L.Complexity.UpToCNary]
pat:82 [in Complexity.TM.Single.DecodeTape]
pat:82 [in Undecidability.TM.Univ.Univ]
pat:82 [in Undecidability.TM.Code.BinNumbers.PosAddTM]
pat:84 [in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
pat:84 [in Undecidability.TM.Code.BinNumbers.PosShiftTM]
pat:85 [in Undecidability.L.Complexity.UpToCNary]
pat:85 [in Undecidability.TM.Code.List.Nth]
pat:85 [in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
pat:85 [in Undecidability.TM.Univ.LookupAssociativeListTM]
pat:85 [in Undecidability.TM.L.HeapInterpreter.LookupTM]
pat:86 [in Complexity.NP.Clique.kSAT_to_Clique]
pat:86 [in Undecidability.TM.Univ.Univ]
pat:88 [in Undecidability.L.Complexity.UpToCNary]
pat:88 [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
pat:89 [in Undecidability.TM.L.HeapInterpreter.LookupTM]
pat:9 [in Complexity.TM.Code.DecodeList]
pat:9 [in Undecidability.Shared.embed_nat]
pat:9 [in Undecidability.TM.Univ.LowLevel]
pat:90 [in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
pat:90 [in Undecidability.TM.Code.List.Nth]
pat:90 [in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
pat:90 [in Undecidability.TM.Univ.LookupAssociativeListTM]
pat:90 [in Undecidability.TM.Univ.Univ]
pat:91 [in Undecidability.L.Complexity.UpToCNary]
pat:924 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
pat:93 [in Undecidability.TM.L.HeapInterpreter.LookupTM]
pat:93 [in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
pat:94 [in Undecidability.L.Complexity.UpToCNary]
pat:94 [in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
pat:94 [in Undecidability.TM.Univ.Univ]
pat:94 [in Undecidability.TM.Code.BinNumbers.PosShiftTM]
pat:95 [in Undecidability.TM.Code.List.Nth]
pat:95 [in Undecidability.TM.Univ.LookupAssociativeListTM]
pat:96 [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
pat:97 [in Undecidability.TM.L.HeapInterpreter.LookupTM]
pat:98 [in Undecidability.TM.Univ.Univ]
pat:98 [in Undecidability.TM.Code.BinNumbers.PosAddTM]
pat:99 [in Undecidability.TM.Code.List.Nth]
pat:99 [in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
pat:99 [in Undecidability.TM.Hoare.HoareMult]
pat:99 [in Undecidability.TM.Univ.LookupAssociativeListTM]
Pdec:117 [in Undecidability.Shared.Libs.DLW.Utils.fin_base]
Pdec:5 [in Undecidability.Shared.Libs.DLW.Utils.fin_dec]
phi:112 [in Undecidability.L.Tactics.Reflection]
phi:13 [in Undecidability.L.Tactics.Reflection]
phi:15 [in Undecidability.L.Tactics.Reflection]
phi:17 [in Undecidability.L.Tactics.Reflection]
phi:21 [in Undecidability.L.Tactics.Reflection]
phi:271 [in Undecidability.L.Tactics.Reflection]
phi:283 [in Undecidability.L.Tactics.Reflection]
phi:286 [in Undecidability.L.Tactics.Reflection]
phi:289 [in Undecidability.L.Tactics.Reflection]
phi:290 [in Undecidability.L.Tactics.Reflection]
phi:292 [in Undecidability.L.Tactics.Reflection]
phi:294 [in Undecidability.L.Tactics.Reflection]
phi:297 [in Undecidability.L.Tactics.Reflection]
phi:302 [in Undecidability.L.Tactics.Reflection]
phi:307 [in Undecidability.L.Tactics.Reflection]
phi:316 [in Undecidability.L.Tactics.Reflection]
phi:319 [in Undecidability.L.Tactics.Reflection]
phi:32 [in Undecidability.L.Tactics.Reflection]
phi:80 [in Undecidability.L.Tactics.Reflection]
phi:82 [in Undecidability.L.Tactics.Reflection]
phi:9 [in Undecidability.L.Tactics.Reflection]
phi:92 [in Undecidability.L.Tactics.Reflection]
Pirr:41 [in Undecidability.Shared.Libs.DLW.Utils.fin_base]
Pl:29 [in Undecidability.L.Tactics.LClos]
Pl:45 [in Undecidability.L.Tactics.Reflection]
pM1:103 [in Undecidability.TM.Hoare.HoareCombinators]
pM1:118 [in Undecidability.TM.Hoare.HoareCombinators]
pM1:127 [in Undecidability.TM.Hoare.HoareCombinators]
pM1:137 [in Undecidability.TM.Hoare.HoareCombinators]
pM1:146 [in Undecidability.TM.Hoare.HoareCombinators]
pM1:165 [in Undecidability.TM.Hoare.HoareCombinators]
pM1:178 [in Undecidability.TM.Hoare.HoareCombinators]
pM1:189 [in Undecidability.TM.Hoare.HoareCombinators]
pM1:198 [in Undecidability.TM.Hoare.HoareCombinators]
pM1:214 [in Undecidability.TM.Hoare.HoareCombinators]
pM1:232 [in Undecidability.TM.Hoare.HoareCombinators]
pM1:245 [in Undecidability.TM.Hoare.HoareCombinators]
pM1:258 [in Undecidability.TM.Hoare.HoareCombinators]
pM1:268 [in Undecidability.TM.Hoare.HoareCombinators]
pM1:281 [in Undecidability.TM.Hoare.HoareCombinators]
pM1:297 [in Undecidability.TM.Hoare.HoareCombinators]
pM2:104 [in Undecidability.TM.Hoare.HoareCombinators]
pM2:119 [in Undecidability.TM.Hoare.HoareCombinators]
pM2:128 [in Undecidability.TM.Hoare.HoareCombinators]
pM2:138 [in Undecidability.TM.Hoare.HoareCombinators]
pM2:147 [in Undecidability.TM.Hoare.HoareCombinators]
pM2:166 [in Undecidability.TM.Hoare.HoareCombinators]
pM2:179 [in Undecidability.TM.Hoare.HoareCombinators]
pM2:190 [in Undecidability.TM.Hoare.HoareCombinators]
pM2:199 [in Undecidability.TM.Hoare.HoareCombinators]
pM2:215 [in Undecidability.TM.Hoare.HoareCombinators]
pM2:233 [in Undecidability.TM.Hoare.HoareCombinators]
pM2:246 [in Undecidability.TM.Hoare.HoareCombinators]
pM2:259 [in Undecidability.TM.Hoare.HoareCombinators]
pM2:269 [in Undecidability.TM.Hoare.HoareCombinators]
pM2:282 [in Undecidability.TM.Hoare.HoareCombinators]
pM2:298 [in Undecidability.TM.Hoare.HoareCombinators]
pM3:191 [in Undecidability.TM.Hoare.HoareCombinators]
pM3:200 [in Undecidability.TM.Hoare.HoareCombinators]
pM3:216 [in Undecidability.TM.Hoare.HoareCombinators]
pM3:234 [in Undecidability.TM.Hoare.HoareCombinators]
pM3:247 [in Undecidability.TM.Hoare.HoareCombinators]
pM:103 [in Undecidability.TM.Hoare.HoareRegister]
pM:111 [in Undecidability.TM.Hoare.HoareRegister]
pM:112 [in Undecidability.TM.Hoare.HoareLogic]
pM:123 [in Undecidability.TM.Hoare.HoareLogic]
pM:134 [in Undecidability.TM.Hoare.HoareLogic]
pM:143 [in Undecidability.TM.Hoare.HoareLogic]
pM:16 [in Undecidability.TM.Hoare.HoareLogic]
pM:17 [in Undecidability.TM.Hoare.HoareCombinators]
pM:175 [in Undecidability.TM.Hoare.HoareLogic]
pM:192 [in Undecidability.TM.Hoare.HoareLogic]
pM:199 [in Undecidability.TM.Hoare.HoareLogic]
pM:21 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
pM:210 [in Undecidability.TM.Hoare.HoareLogic]
pM:222 [in Undecidability.TM.Hoare.HoareLogic]
pM:232 [in Undecidability.TM.Hoare.HoareLogic]
pM:236 [in Undecidability.TM.Hoare.HoareLogic]
pM:24 [in Undecidability.TM.Hoare.HoareLogic]
pM:240 [in Undecidability.TM.Hoare.HoareRegister]
pM:246 [in Undecidability.TM.Hoare.HoareLogic]
pM:254 [in Complexity.TM.PrettyBounds.M2MBounds]
pM:256 [in Undecidability.TM.Hoare.HoareRegister]
pM:257 [in Undecidability.TM.Hoare.HoareLogic]
pM:263 [in Complexity.TM.PrettyBounds.M2MBounds]
pM:267 [in Undecidability.TM.Hoare.HoareLogic]
pM:270 [in Undecidability.TM.Hoare.HoareRegister]
pM:276 [in Undecidability.TM.Util.TM_facts]
pM:278 [in Undecidability.TM.Hoare.HoareLogic]
pM:283 [in Undecidability.TM.Util.TM_facts]
pM:284 [in Undecidability.TM.Hoare.HoareRegister]
pM:285 [in Undecidability.TM.Hoare.HoareLogic]
pM:286 [in Complexity.TM.PrettyBounds.M2MBounds]
pM:29 [in Undecidability.TM.Hoare.HoareCombinators]
pM:292 [in Undecidability.TM.Hoare.HoareLogic]
pM:299 [in Undecidability.TM.Hoare.HoareRegister]
pM:30 [in Undecidability.TM.Hoare.HoareLogic]
pM:300 [in Undecidability.TM.Hoare.HoareLogic]
pM:306 [in Undecidability.TM.Util.TM_facts]
pM:308 [in Undecidability.TM.Hoare.HoareLogic]
pM:309 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
pM:313 [in Undecidability.TM.Util.TM_facts]
pM:314 [in Undecidability.TM.Hoare.HoareCombinators]
pM:317 [in Undecidability.TM.Hoare.HoareLogic]
pM:320 [in Undecidability.TM.Util.TM_facts]
pM:325 [in Undecidability.TM.Hoare.HoareCombinators]
pM:326 [in Complexity.TM.PrettyBounds.M2MBounds]
pM:326 [in Undecidability.TM.Util.TM_facts]
pM:328 [in Undecidability.TM.Hoare.HoareLogic]
pM:333 [in Undecidability.TM.Util.TM_facts]
pM:339 [in Undecidability.TM.Util.TM_facts]
pM:340 [in Undecidability.TM.Hoare.HoareLogic]
pM:342 [in Complexity.TM.PrettyBounds.M2MBounds]
pM:345 [in Undecidability.TM.Util.TM_facts]
pM:351 [in Undecidability.TM.Hoare.HoareLogic]
pM:352 [in Undecidability.TM.Util.TM_facts]
pM:364 [in Undecidability.TM.Hoare.HoareLogic]
pM:366 [in Undecidability.TM.Hoare.HoareCombinators]
pM:372 [in Undecidability.TM.Hoare.HoareRegister]
pM:372 [in Undecidability.TM.Hoare.HoareLogic]
pM:376 [in Undecidability.TM.Util.TM_facts]
pM:380 [in Undecidability.TM.Hoare.HoareLogic]
pM:383 [in Undecidability.TM.Hoare.HoareCombinators]
pM:387 [in Undecidability.TM.Hoare.HoareRegister]
pM:389 [in Undecidability.TM.Hoare.HoareLogic]
pM:39 [in Undecidability.TM.Hoare.HoareCombinators]
pM:390 [in Undecidability.TM.Util.TM_facts]
pM:398 [in Undecidability.TM.Hoare.HoareLogic]
pM:406 [in Undecidability.TM.Hoare.HoareRegister]
pM:425 [in Undecidability.TM.Hoare.HoareRegister]
pM:428 [in Undecidability.TM.Hoare.HoareCombinators]
pM:43 [in Undecidability.TM.Hoare.HoareLogic]
pM:447 [in Undecidability.TM.Hoare.HoareCombinators]
pM:467 [in Undecidability.TM.Hoare.HoareRegister]
pM:480 [in Undecidability.TM.Hoare.HoareRegister]
pM:489 [in Undecidability.TM.Hoare.HoareRegister]
pM:498 [in Undecidability.TM.Hoare.HoareRegister]
pM:510 [in Undecidability.TM.Hoare.HoareRegister]
pM:52 [in Undecidability.TM.Hoare.HoareLogic]
pM:52 [in Undecidability.TM.Hoare.HoareCombinators]
pM:521 [in Undecidability.TM.Hoare.HoareRegister]
pM:531 [in Undecidability.TM.Hoare.HoareRegister]
pM:540 [in Undecidability.TM.Hoare.HoareRegister]
pM:554 [in Undecidability.TM.Hoare.HoareRegister]
pM:567 [in Undecidability.TM.Hoare.HoareRegister]
pM:579 [in Undecidability.TM.Hoare.HoareRegister]
pM:59 [in Undecidability.TM.Hoare.HoareLogic]
pM:61 [in Undecidability.TM.Hoare.HoareCombinators]
pM:66 [in Undecidability.TM.Hoare.HoareLogic]
pM:71 [in Undecidability.TM.Hoare.HoareLogic]
pM:73 [in Undecidability.TM.Hoare.HoareCombinators]
pM:77 [in Undecidability.TM.Hoare.HoareLogic]
pM:82 [in Undecidability.TM.Hoare.HoareLogic]
pM:83 [in Undecidability.TM.Hoare.HoareCombinators]
pM:88 [in Undecidability.TM.Hoare.HoareLogic]
pM:96 [in Undecidability.TM.Hoare.HoareCombinators]
pM:99 [in Undecidability.TM.Hoare.HoareLogic]
POST:434 [in Undecidability.TM.Hoare.HoareCombinators]
predT:97 [in Complexity.Libs.CookPrelim.PolyBounds]
pred:2637 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
pred:2648 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
pred:2674 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
prefInj:73 [in Complexity.TM.Code.Decode]
preprocessT:23 [in Undecidability.L.Functions.UnboundIteration]
preprocess:22 [in Undecidability.L.Functions.UnboundIteration]
PRE:432 [in Undecidability.TM.Hoare.HoareCombinators]
pr:137 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
pr:139 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
pr:14 [in Complexity.NP.SAT.CookLevin.Reductions.CC_to_BinaryCC]
pr:15 [in Complexity.NP.SAT.CookLevin.Reductions.CC_to_BinaryCC]
pr:26 [in Complexity.NP.SAT.CookLevin.Subproblems.CC]
pr:27 [in Complexity.NP.SAT.CookLevin.Subproblems.CC]
pr:3697 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
pr:50 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
pr:85 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
pr:96 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
Ps:101 [in Undecidability.TM.Hoare.HoareRegister]
Ps:108 [in Undecidability.TM.Hoare.HoareRegister]
Ps:30 [in Undecidability.TM.Hoare.HoareRegister]
Ps:39 [in Undecidability.TM.Hoare.HoareRegister]
Ps:44 [in Undecidability.TM.Hoare.HoareRegister]
Ps:58 [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
Ps:74 [in Undecidability.TM.Hoare.HoareRegister]
Ps:79 [in Undecidability.TM.Hoare.HoareRegister]
Ps:81 [in Undecidability.TM.Hoare.HoareRegister]
Ps:83 [in Undecidability.TM.Hoare.HoareRegister]
Ps:89 [in Undecidability.TM.Hoare.HoareRegister]
Ps:95 [in Undecidability.TM.Hoare.HoareRegister]
pT:27 [in Undecidability.L.TM.TapeFuns]
pT:37 [in Undecidability.L.TM.TapeFuns]
pT:39 [in Undecidability.L.Datatypes.List.List_basics]
pT:889 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
Pv:31 [in Undecidability.TM.Hoare.HoareRegister]
Pv:40 [in Undecidability.TM.Hoare.HoareRegister]
Pv:45 [in Undecidability.TM.Hoare.HoareRegister]
px:13 [in Undecidability.TM.Code.BinNumbers.PosShiftTM]
px:17 [in Undecidability.TM.Code.BinNumbers.PosShiftTM]
px:20 [in Undecidability.TM.Code.BinNumbers.PosMultTM]
px:25 [in Undecidability.TM.Code.BinNumbers.PosMultTM]
px:26 [in Undecidability.Shared.Libs.PSL.FiniteTypes.Arbitrary]
px:29 [in Undecidability.TM.Code.BinNumbers.PosShiftTM]
px:33 [in Undecidability.TM.Code.BinNumbers.PosShiftTM]
px:38 [in Undecidability.TM.Code.BinNumbers.PosMultTM]
px:43 [in Undecidability.TM.Code.BinNumbers.PosMultTM]
px:69 [in Undecidability.TM.Code.BinNumbers.PosShiftTM]
px:73 [in Undecidability.TM.Code.BinNumbers.PosShiftTM]
px:85 [in Undecidability.TM.Code.BinNumbers.PosShiftTM]
px:89 [in Undecidability.TM.Code.BinNumbers.PosShiftTM]
Px:97 [in Complexity.TM.PrettyBounds.PrettyBounds]
Py:96 [in Complexity.TM.PrettyBounds.PrettyBounds]
p_dec:14 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
P__dec:21 [in Complexity.Complexity.Definitions]
P__dec:15 [in Complexity.Complexity.Definitions]
P':101 [in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
p':104 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p':119 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
P':123 [in Undecidability.TM.Hoare.HoareRegister]
P':125 [in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
p':125 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p':132 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p':1421 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p':1426 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p':1464 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p':1466 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p':1473 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p':1479 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p':1508 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p':1511 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
P':153 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
P':153 [in Undecidability.TM.Hoare.HoareRegister]
p':153 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p':1558 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
P':156 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
p':1563 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
P':159 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
p':1601 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p':1603 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p':1610 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p':1646 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
P':174 [in Undecidability.TM.Hoare.HoareRegister]
P':201 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
p':203 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p':2033 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p':2034 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p':2035 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p':2037 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p':205 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p':2065 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p':2066 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p':2067 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p':2068 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
P':207 [in Undecidability.TM.Hoare.HoareRegister]
P':215 [in Undecidability.TM.Hoare.HoareRegister]
P':227 [in Undecidability.TM.Hoare.HoareRegister]
P':227 [in Undecidability.TM.L.HeapInterpreter.StepTM]
P':23 [in Undecidability.L.Tactics.ComputableTactics]
P':236 [in Undecidability.TM.Hoare.HoareRegister]
p':251 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
P':252 [in Undecidability.TM.Hoare.HoareRegister]
p':259 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
P':26 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
P':264 [in Undecidability.TM.Hoare.HoareRegister]
P':27 [in Undecidability.L.Tactics.ComputableTactics]
p':274 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
P':279 [in Undecidability.TM.Hoare.HoareRegister]
p':279 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
P':292 [in Undecidability.TM.Hoare.HoareRegister]
P':312 [in Undecidability.TM.Hoare.HoareRegister]
P':319 [in Undecidability.TM.Hoare.HoareRegister]
P':329 [in Undecidability.TM.Hoare.HoareRegister]
p':33 [in Undecidability.L.Complexity.GenericNary]
P':348 [in Undecidability.TM.Hoare.HoareRegister]
P':360 [in Undecidability.TM.Hoare.HoareRegister]
P':368 [in Undecidability.TM.Hoare.HoareRegister]
P':382 [in Undecidability.TM.Hoare.HoareRegister]
P':397 [in Undecidability.TM.Hoare.HoareRegister]
P':415 [in Undecidability.TM.Hoare.HoareRegister]
P':442 [in Undecidability.TM.Hoare.HoareRegister]
P':446 [in Undecidability.TM.Hoare.HoareRegister]
P':451 [in Undecidability.TM.Hoare.HoareCombinators]
P':464 [in Undecidability.TM.Hoare.HoareRegister]
p':47 [in Undecidability.L.Complexity.GenericNary]
P':478 [in Undecidability.TM.Hoare.HoareRegister]
P':486 [in Undecidability.TM.Hoare.HoareRegister]
P':497 [in Undecidability.TM.Hoare.HoareRegister]
P':508 [in Undecidability.TM.Hoare.HoareRegister]
P':520 [in Undecidability.TM.Hoare.HoareRegister]
P':529 [in Undecidability.TM.Hoare.HoareRegister]
P':539 [in Undecidability.TM.Hoare.HoareRegister]
P':54 [in Undecidability.L.AbstractMachines.FlatPro.Programs]
P':552 [in Undecidability.TM.Hoare.HoareRegister]
P':566 [in Undecidability.TM.Hoare.HoareRegister]
P':577 [in Undecidability.TM.Hoare.HoareRegister]
P':64 [in Undecidability.TM.L.HeapInterpreter.StepTM]
P':7 [in Complexity.L.AbstractMachines.AbstractSubstMachine]
p':99 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p0:106 [in Undecidability.TM.Code.BinNumbers.PosAddTM]
p0:111 [in Undecidability.TM.Code.BinNumbers.PosAddTM]
p0:15 [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
p0:15 [in Undecidability.TM.Code.BinNumbers.PosCompareTM]
p0:19 [in Undecidability.TM.Code.BinNumbers.PosCompareTM]
p0:23 [in Undecidability.TM.Code.BinNumbers.PosCompareTM]
P0:25 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds_Loop]
P0:31 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds_Loop]
p0:39 [in Undecidability.TM.Code.BinNumbers.PosShiftTM]
p0:41 [in Undecidability.TM.Code.BinNumbers.PosPointers]
P0:43 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds_Loop]
P0:46 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds_Loop]
P0:48 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
p0:48 [in Undecidability.TM.Code.BinNumbers.PosPointers]
P0:495 [in Undecidability.TM.Hoare.HoareRegister]
p0:50 [in Undecidability.TM.Code.BinNumbers.PosAddTM]
P0:506 [in Undecidability.TM.Hoare.HoareRegister]
p0:51 [in Undecidability.TM.Code.BinNumbers.PosCompareTM]
P0:518 [in Undecidability.TM.Hoare.HoareRegister]
P0:527 [in Undecidability.TM.Hoare.HoareRegister]
p0:53 [in Undecidability.TM.Code.BinNumbers.PosPointers]
P0:537 [in Undecidability.TM.Hoare.HoareRegister]
P0:550 [in Undecidability.TM.Hoare.HoareRegister]
P0:56 [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
p0:56 [in Undecidability.TM.Code.BinNumbers.PosAddTM]
P0:564 [in Undecidability.TM.Hoare.HoareRegister]
p0:57 [in Undecidability.TM.Code.BinNumbers.PosCompareTM]
P0:575 [in Undecidability.TM.Hoare.HoareRegister]
p0:6 [in Undecidability.TM.Code.BinNumbers.PosCompareTM]
p0:60 [in Undecidability.TM.Code.BinNumbers.PosAddTM]
p0:61 [in Undecidability.TM.Code.BinNumbers.PosCompareTM]
p0:65 [in Undecidability.TM.Code.BinNumbers.PosCompareTM]
p0:73 [in Undecidability.TM.Code.BinNumbers.PosCompareTM]
P0:78 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
p0:79 [in Undecidability.TM.Code.BinNumbers.PosCompareTM]
p0:83 [in Undecidability.TM.Code.BinNumbers.PosAddTM]
p0:89 [in Undecidability.TM.Code.BinNumbers.PosAddTM]
P0:93 [in Undecidability.TM.Hoare.HoareRegister]
p0:93 [in Undecidability.TM.Code.BinNumbers.PosAddTM]
p0:95 [in Undecidability.TM.Code.BinNumbers.PosShiftTM]
p0:99 [in Undecidability.TM.Code.BinNumbers.PosAddTM]
p1:100 [in Undecidability.TM.Code.BinNumbers.PosAddTM]
p1:100 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
p1:102 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
p1:106 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
p1:107 [in Undecidability.TM.Code.BinNumbers.PosAddTM]
p1:111 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
p1:112 [in Undecidability.TM.Code.BinNumbers.PosAddTM]
p1:113 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
p1:119 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
p1:126 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
P1:13 [in Undecidability.Synthetic.DecidabilityFacts]
p1:14 [in Undecidability.L.Functions.EnumInt]
P1:151 [in Undecidability.TM.Hoare.HoareLogic]
P1:158 [in Undecidability.TM.Hoare.HoareLogic]
P1:163 [in Undecidability.TM.Hoare.HoareLogic]
P1:171 [in Undecidability.TM.Hoare.HoareLogic]
p1:18 [in Undecidability.TM.Code.BinNumbers.PosCompareTM]
p1:185 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
p1:187 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
P1:189 [in Undecidability.TM.Hoare.HoareLogic]
p1:194 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
p1:199 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
p1:20 [in Undecidability.TM.Code.BinNumbers.PosCompareTM]
P1:204 [in Undecidability.TM.Hoare.HoareLogic]
p1:21 [in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
P1:227 [in Undecidability.TM.Hoare.HoareLogic]
p1:229 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
p1:24 [in Undecidability.TM.Code.BinNumbers.PosCompareTM]
p1:30 [in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
P1:301 [in Undecidability.TM.Hoare.HoareLogic]
p1:32 [in Undecidability.Shared.Libs.PSL.FiniteTypes.Arbitrary]
p1:36 [in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
p1:3612 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
P1:390 [in Undecidability.TM.Hoare.HoareLogic]
p1:40 [in Undecidability.TM.Code.BinNumbers.PosShiftTM]
p1:41 [in Undecidability.TM.Code.BinNumbers.PosDefinitions]
p1:42 [in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
p1:44 [in Undecidability.TM.Code.BinNumbers.PosPointers]
p1:50 [in Undecidability.TM.Code.BinNumbers.PosPointers]
p1:51 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
p1:53 [in Undecidability.TM.Code.BinNumbers.PosAddTM]
p1:54 [in Undecidability.TM.Code.BinNumbers.PosCompareTM]
p1:54 [in Undecidability.TM.Code.BinNumbers.PosPointers]
p1:57 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
p1:57 [in Undecidability.TM.Code.BinNumbers.PosAddTM]
p1:60 [in Undecidability.TM.Code.BinNumbers.PosCompareTM]
p1:61 [in Undecidability.TM.Code.BinNumbers.PosAddTM]
p1:62 [in Undecidability.TM.Code.BinNumbers.PosCompareTM]
p1:66 [in Undecidability.TM.Code.BinNumbers.PosCompareTM]
p1:66 [in Complexity.NP.SAT.SAT]
p1:67 [in Undecidability.L.Computability.Enum]
p1:74 [in Undecidability.TM.Code.BinNumbers.PosCompareTM]
p1:75 [in Undecidability.TM.Code.BinNumbers.PosDefinitions]
p1:80 [in Undecidability.TM.Code.BinNumbers.PosCompareTM]
p1:81 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
p1:86 [in Undecidability.TM.Code.BinNumbers.PosAddTM]
p1:9 [in Undecidability.TM.Code.BinNumbers.PosCompareTM]
P1:9 [in Undecidability.Synthetic.DecidabilityFacts]
p1:90 [in Undecidability.TM.Code.BinNumbers.PosAddTM]
p1:94 [in Undecidability.TM.Code.BinNumbers.PosAddTM]
p1:96 [in Undecidability.TM.Code.BinNumbers.PosShiftTM]
P2:10 [in Undecidability.Synthetic.DecidabilityFacts]
p2:101 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
p2:103 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
p2:107 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
p2:112 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
p2:114 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
p2:120 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
p2:127 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
P2:14 [in Undecidability.Synthetic.DecidabilityFacts]
p2:15 [in Undecidability.L.Functions.EnumInt]
P2:152 [in Undecidability.TM.Hoare.HoareLogic]
P2:159 [in Undecidability.TM.Hoare.HoareLogic]
P2:164 [in Undecidability.TM.Hoare.HoareLogic]
P2:172 [in Undecidability.TM.Hoare.HoareLogic]
p2:186 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
p2:188 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
P2:190 [in Undecidability.TM.Hoare.HoareLogic]
p2:195 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
p2:200 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
P2:205 [in Undecidability.TM.Hoare.HoareLogic]
P2:228 [in Undecidability.TM.Hoare.HoareLogic]
p2:230 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
p2:24 [in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
P2:302 [in Undecidability.TM.Hoare.HoareLogic]
p2:33 [in Undecidability.Shared.Libs.PSL.FiniteTypes.Arbitrary]
p2:33 [in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
p2:3613 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p2:37 [in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
P2:391 [in Undecidability.TM.Hoare.HoareLogic]
p2:42 [in Undecidability.TM.Code.BinNumbers.PosDefinitions]
p2:43 [in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
p2:52 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
p2:58 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
p2:67 [in Complexity.NP.SAT.SAT]
p2:68 [in Undecidability.L.Computability.Enum]
p2:76 [in Undecidability.TM.Code.BinNumbers.PosDefinitions]
p2:82 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
p:1 [in Undecidability.Shared.Libs.PSL.Numbers]
p:1 [in Undecidability.Shared.Libs.DLW.Utils.prime]
p:1 [in Undecidability.TM.Code.BinNumbers.PosDefinitions]
P:1 [in Complexity.NP.L.CanEnumTerm]
p:1 [in Undecidability.Synthetic.Infinite]
p:1 [in Undecidability.Shared.ListAutomation]
p:1 [in Undecidability.L.Tactics.Lproc]
p:10 [in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
P:10 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
p:10 [in Undecidability.Shared.FilterFacts]
p:10 [in Undecidability.Shared.Libs.DLW.Utils.prime]
p:10 [in Undecidability.TM.Code.BinNumbers.PosIncrementTM]
P:10 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
p:10 [in Undecidability.Shared.Libs.PSL.Lists.Filter]
p:10 [in Undecidability.TM.Basic.Mono]
p:10 [in Undecidability.Shared.Libs.PSL.FiniteTypes.Arbitrary]
P:10 [in Undecidability.L.Computability.Synthetic]
P:10 [in Undecidability.L.AbstractMachines.FlatPro.ProgramsDef]
P:10 [in Undecidability.Shared.Libs.DLW.Code.subcode]
p:10 [in Undecidability.Shared.Libs.DLW.Vec.pos]
P:100 [in Undecidability.TM.Hoare.HoareRegister]
p:1000 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
p:1005 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
P:101 [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
p:101 [in Complexity.NP.SAT.SAT_inNP]
p:101 [in Undecidability.Shared.Libs.DLW.Utils.fin_base]
p:101 [in Undecidability.Synthetic.ListEnumerabilityFacts]
p:101 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
P:101 [in Undecidability.Shared.Libs.DLW.Code.sss]
P:1017 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:102 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
p:102 [in Complexity.NP.Clique.kSAT_to_FlatClique]
P:103 [in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
p:103 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
P:104 [in Undecidability.L.Tactics.ComputableTime]
P:104 [in Complexity.Complexity.NP]
P:104 [in Undecidability.Shared.Libs.DLW.Code.sss]
P:105 [in Undecidability.TM.Hoare.HoareCombinators]
p:105 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
p:106 [in Complexity.L.ComparisonTimeBoundDerivation]
p:106 [in Complexity.NP.Clique.kSAT_to_FlatClique]
P:107 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
P:107 [in Undecidability.TM.Hoare.HoareRegister]
P:107 [in Undecidability.TM.L.HeapInterpreter.StepTM]
p:107 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
P:1071 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:108 [in Complexity.TM.PrettyBounds.BaseCode]
P:108 [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
p:108 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
p:108 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
P:108 [in Undecidability.Shared.Libs.DLW.Code.sss]
p:109 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:109 [in Undecidability.L.Computability.Synthetic]
P:11 [in Complexity.L.AbstractMachines.FlatPro.Computable.Decompile]
P:11 [in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisUnfoldClos]
P:11 [in Complexity.Complexity.Subtypes]
P:11 [in Undecidability.L.AbstractMachines.FlatPro.UnfoldClos]
p:11 [in Complexity.NP.SAT.CookLevin.Reductions.TMGenNP_fixed_singleTapeTM_to_FlatFunSingleTMGenNP]
P:11 [in Complexity.L.AbstractMachines.AbstractSubstMachine]
P:11 [in Undecidability.L.AbstractMachines.FlatPro.Programs]
P:11 [in Undecidability.TM.L.HeapInterpreter.StepTM]
P:11 [in Undecidability.Synthetic.Definitions]
p:11 [in Undecidability.L.Computability.Acceptability]
P:11 [in Undecidability.Shared.Dec]
P:11 [in Undecidability.Shared.ListAutomation]
P:11 [in Undecidability.Shared.Libs.DLW.Code.subcode]
P:11 [in Complexity.L.AbstractMachines.LambdaDepth]
p:110 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
P:110 [in Undecidability.L.Tactics.ComputableTime]
p:110 [in Undecidability.Shared.Libs.DLW.Vec.pos]
p:110 [in Complexity.NP.Clique.kSAT_to_FlatClique]
P:111 [in Undecidability.L.Computability.Seval]
p:111 [in Undecidability.TM.Util.Relations]
P:111 [in Undecidability.TM.Hoare.HoareLogic]
p:1116 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
P:112 [in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
p:112 [in Undecidability.L.Computability.Synthetic]
p:112 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
p:112 [in Undecidability.Shared.Libs.DLW.Vec.pos]
P:112 [in Undecidability.Shared.Libs.DLW.Code.sss]
p:1124 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
P:1125 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:113 [in Complexity.NP.SAT.SAT_inNP]
p:113 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
P:113 [in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
p:113 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
p:114 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
p:114 [in Undecidability.Shared.Libs.DLW.Vec.vec]
p:114 [in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
p:114 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
P:115 [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
P:115 [in Undecidability.Shared.Libs.DLW.Utils.fin_base]
P:115 [in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
p:116 [in Complexity.L.ComparisonTimeBoundDerivation]
p:116 [in Undecidability.Synthetic.ListEnumerabilityFacts]
P:116 [in Undecidability.Shared.Libs.DLW.Code.sss]
P:117 [in Undecidability.TM.L.HeapInterpreter.StepTM]
p:117 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
P:117 [in Complexity.Complexity.NP]
P:1179 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:118 [in Undecidability.Shared.Libs.DLW.Vec.vec]
p:118 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:118 [in Undecidability.Shared.Libs.DLW.Vec.pos]
P:119 [in Undecidability.Shared.Libs.DLW.Utils.fin_base]
p:119 [in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
p:12 [in Undecidability.Shared.Libs.DLW.Utils.prime]
p:12 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
P:12 [in Undecidability.Shared.FinTypeForallExists]
p:12 [in Undecidability.Shared.Libs.DLW.Utils.binomial]
P:12 [in Undecidability.L.Computability.Decidability]
P:12 [in Undecidability.Synthetic.InformativeDefinitions]
p:12 [in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
P:120 [in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
p:120 [in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
P:120 [in Undecidability.TM.Hoare.HoareCombinators]
p:120 [in Undecidability.Shared.Libs.DLW.Vec.pos]
P:120 [in Undecidability.Shared.Libs.DLW.Code.sss]
P:121 [in Undecidability.TM.Hoare.HoareLogic]
p:121 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
P:122 [in Undecidability.TM.Hoare.HoareRegister]
P:123 [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
p:123 [in Complexity.NP.SAT.SAT_inNP]
p:123 [in Undecidability.Synthetic.ListEnumerabilityFacts]
P:123 [in Undecidability.Shared.Libs.DLW.Code.sss]
P:1233 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:124 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:125 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
P:126 [in Undecidability.Shared.Libs.DLW.Utils.php]
p:126 [in Undecidability.TM.Code.Code]
p:127 [in Complexity.L.ComparisonTimeBoundDerivation]
P:127 [in Undecidability.Shared.Libs.DLW.Code.sss]
P:1284 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
P:129 [in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
p:129 [in Undecidability.TM.Code.Code]
P:129 [in Undecidability.TM.Hoare.HoareCombinators]
p:129 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
p:13 [in Undecidability.Shared.FilterFacts]
p:13 [in Undecidability.Shared.Libs.PSL.Lists.Filter]
p:13 [in Undecidability.Shared.Libs.DLW.Utils.crt]
P:13 [in Undecidability.Shared.Libs.DLW.Utils.fin_base]
p:13 [in Undecidability.L.Functions.EnumInt]
P:13 [in Undecidability.Shared.Dec]
p:13 [in Undecidability.L.Computability.Rice]
P:13 [in Complexity.Complexity.Definitions]
p:13 [in Undecidability.Shared.Libs.DLW.Vec.pos]
P:13 [in Undecidability.Shared.Libs.DLW.Code.sss]
p:130 [in Undecidability.Shared.Libs.DLW.Vec.vec]
P:131 [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
p:131 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
P:131 [in Undecidability.Shared.Libs.DLW.Code.sss]
P:132 [in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
P:132 [in Undecidability.TM.Hoare.HoareLogic]
P:1329 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:133 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
P:133 [in Complexity.Complexity.NP]
p:134 [in Complexity.L.ComparisonTimeBoundDerivation]
p:134 [in Complexity.NP.SAT.SAT_inNP]
P:134 [in Undecidability.TM.L.HeapInterpreter.StepTM]
p:135 [in Undecidability.Shared.Libs.DLW.Vec.vec]
P:136 [in Undecidability.Shared.Libs.DLW.Code.sss]
p:137 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:137 [in Complexity.NP.Clique.kSAT_to_Clique]
P:1374 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
P:138 [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
P:138 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
p:138 [in Complexity.L.ComparisonTimeBoundDerivation]
p:138 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
p:1380 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:1385 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
P:139 [in Undecidability.TM.L.HeapInterpreter.StepTM]
P:139 [in Undecidability.TM.Hoare.HoareCombinators]
p:139 [in Undecidability.Shared.Libs.DLW.Vec.pos]
p:14 [in Undecidability.Shared.Libs.DLW.Utils.prime]
p:14 [in Undecidability.TM.Code.BinNumbers.PosDefinitions]
P:14 [in Complexity.L.AbstractMachines.FlatPro.Computable.Decompile]
P:14 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
p:14 [in Undecidability.Shared.Libs.DLW.Utils.crt]
P:14 [in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisStep]
P:14 [in Complexity.NP.L.LMGenNP]
p:14 [in Complexity.NP.SAT.CookLevin.Reductions.TMGenNP_fixed_singleTapeTM_to_FlatFunSingleTMGenNP]
P:14 [in Undecidability.L.Functions.EqBool]
P:14 [in Undecidability.L.Computability.Acceptability]
p:14 [in Undecidability.L.Computability.Rice]
p:140 [in Undecidability.Shared.Libs.DLW.Vec.vec]
P:140 [in Undecidability.Shared.Libs.DLW.Code.sss]
p:141 [in Complexity.NP.SAT.SAT_inNP]
P:141 [in Undecidability.TM.Hoare.HoareLogic]
p:141 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
P:1410 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:1413 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:1415 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:142 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
p:142 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
P:142 [in Undecidability.TM.Lifting.LiftTapes]
P:142 [in Complexity.Complexity.NP]
p:1420 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:1425 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:1432 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
P:144 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
p:144 [in Complexity.NP.SAT.SAT_inNP]
P:144 [in Undecidability.Shared.Libs.DLW.Code.sss]
P:145 [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
P:145 [in Undecidability.TM.L.HeapInterpreter.StepTM]
p:145 [in Undecidability.Synthetic.ListEnumerabilityFacts]
p:145 [in Undecidability.Shared.Libs.DLW.Vec.pos]
P:1457 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:146 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:1461 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:1463 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:1465 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
P:147 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
p:147 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
P:147 [in Complexity.Complexity.NP]
p:1472 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:1478 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
P:148 [in Undecidability.TM.Hoare.HoareCombinators]
p:149 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
p:149 [in Undecidability.Shared.Libs.DLW.Vec.pos]
p:15 [in Undecidability.Shared.Libs.PSL.FiniteTypes.Arbitrary]
P:15 [in Undecidability.Synthetic.Definitions]
p:15 [in Undecidability.L.Computability.Synthetic]
P:15 [in Undecidability.TM.Hoare.HoareLogic]
P:15 [in Undecidability.TM.Hoare.HoareCombinators]
P:150 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
P:150 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
P:1504 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:1507 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:151 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
P:151 [in Undecidability.TM.L.HeapInterpreter.StepTM]
p:151 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
P:151 [in Undecidability.Shared.Libs.DLW.Code.sss]
p:1510 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:1517 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
P:152 [in Undecidability.TM.Hoare.HoareRegister]
p:152 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:152 [in Undecidability.Shared.Libs.DLW.Vec.pos]
p:1522 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
P:154 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
P:1547 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:155 [in Undecidability.Shared.Libs.DLW.Vec.pos]
P:155 [in Undecidability.Shared.Libs.DLW.Code.sss]
p:1550 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:1552 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:1557 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:156 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
P:156 [in Complexity.Complexity.NP]
p:1562 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:1569 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
P:157 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
p:157 [in Undecidability.Shared.Libs.DLW.Vec.pos]
P:158 [in Undecidability.TM.Lifting.LiftTapes]
P:159 [in Undecidability.TM.L.HeapInterpreter.StepTM]
p:159 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
P:1594 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:1598 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:16 [in Undecidability.Shared.FilterFacts]
p:16 [in Undecidability.TM.Code.BinNumbers.PosDefinitions]
P:16 [in Undecidability.Shared.Libs.PSL.EqDec]
p:16 [in Undecidability.Synthetic.EnumerabilityFacts]
p:16 [in Undecidability.Shared.Libs.PSL.Lists.Filter]
p:16 [in Undecidability.Shared.Libs.DLW.Utils.crt]
p:16 [in Complexity.NP.SAT.CookLevin.Reductions.TMGenNP_fixed_singleTapeTM_to_FlatFunSingleTMGenNP]
P:16 [in Undecidability.TM.L.HeapInterpreter.StepTM]
p:16 [in Undecidability.Shared.Libs.PSL.Lists.Dupfree]
P:16 [in Undecidability.Synthetic.DecidabilityFacts]
p:16 [in Undecidability.Synthetic.ReducibilityFacts]
p:160 [in Complexity.L.ComparisonTimeBoundDerivation]
p:160 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
P:160 [in Undecidability.Shared.Libs.DLW.Code.sss]
p:1600 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:1602 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:1609 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
P:161 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
p:161 [in Undecidability.Shared.Libs.DLW.Vec.pos]
p:1615 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:162 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
P:163 [in Undecidability.TM.Lifting.LiftTapes]
P:164 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
p:164 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:164 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
P:164 [in Undecidability.Shared.Libs.DLW.Code.sss]
P:1640 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:1643 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:1645 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:1652 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:1656 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:166 [in Undecidability.Shared.Libs.DLW.Vec.pos]
P:167 [in Undecidability.TM.Hoare.HoareCombinators]
P:167 [in Undecidability.Shared.Libs.DLW.Code.sss]
P:168 [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
p:168 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:168 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
p:168 [in Undecidability.Shared.Libs.DLW.Vec.pos]
P:1681 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:1683 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:1685 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
P:169 [in Undecidability.TM.L.HeapInterpreter.StepTM]
p:1692 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:1695 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
P:17 [in Undecidability.TM.Compound.TMTac]
p:17 [in Undecidability.Synthetic.EnumerabilityFacts]
P:17 [in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisStep]
P:17 [in Undecidability.Shared.Libs.DLW.Utils.fin_base]
P:17 [in Undecidability.L.AbstractMachines.FlatPro.Programs]
p:17 [in Undecidability.Synthetic.ListEnumerabilityFacts]
p:17 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
P:17 [in Undecidability.L.Tactics.ComputableTactics]
P:17 [in Complexity.L.AbstractMachines.FunctionalDefinitions]
P:170 [in Undecidability.Shared.Libs.DLW.Code.sss]
p:171 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
P:171 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
p:171 [in Undecidability.Shared.Libs.DLW.Vec.pos]
p:172 [in Complexity.L.ComparisonTimeBoundDerivation]
P:1720 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:1721 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:1724 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:1731 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:1734 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:174 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
p:174 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
P:175 [in Undecidability.TM.Hoare.HoareRegister]
P:1759 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:176 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
p:176 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:1760 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:1763 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
P:177 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
p:177 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
P:177 [in Undecidability.Shared.Libs.DLW.Code.sss]
p:179 [in Undecidability.Shared.Libs.DLW.Utils.sums]
p:179 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
P:179 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
p:179 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
p:18 [in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
p:18 [in Undecidability.Shared.Libs.DLW.Utils.prime]
P:18 [in Undecidability.Shared.Libs.PSL.EqDec]
p:18 [in Undecidability.TM.Code.BinNumbers.PosIncrementTM]
p:18 [in Undecidability.Shared.Libs.DLW.Utils.binomial]
p:18 [in Undecidability.TM.Univ.LowLevel]
p:18 [in Undecidability.Synthetic.MoreEnumerabilityFacts]
P:18 [in Complexity.NP.TM.M_LM2TM]
p:18 [in Undecidability.Synthetic.DecidabilityFacts]
P:18 [in Undecidability.Shared.Libs.DLW.Code.subcode]
P:180 [in Undecidability.TM.Hoare.HoareCombinators]
P:180 [in Undecidability.Shared.Libs.DLW.Code.sss]
P:1808 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:181 [in Undecidability.Shared.Libs.DLW.Code.sss]
P:182 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
p:182 [in Complexity.L.ComparisonTimeBoundDerivation]
p:182 [in Undecidability.Shared.Libs.DLW.Utils.sums]
p:182 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
P:184 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
P:184 [in Undecidability.Shared.Libs.DLW.Code.sss]
P:185 [in Undecidability.TM.L.HeapInterpreter.StepTM]
p:185 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
p:185 [in Undecidability.Shared.Libs.DLW.Code.sss]
P:1856 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:186 [in Undecidability.Shared.Libs.DLW.Utils.sums]
p:186 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:188 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:189 [in Undecidability.Shared.Libs.DLW.Utils.sums]
P:189 [in Undecidability.Shared.Libs.DLW.Code.sss]
P:19 [in Undecidability.Shared.Libs.DLW.Utils.fin_dec]
p:19 [in Undecidability.Shared.FilterFacts]
P:19 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds_Loop]
P:19 [in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisUnfoldClos]
p:19 [in Undecidability.Shared.Libs.PSL.Lists.Filter]
P:19 [in Undecidability.Shared.Libs.PSL.FiniteTypes.Arbitrary]
P:19 [in Undecidability.Synthetic.Definitions]
P:19 [in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
p:19 [in Undecidability.L.Computability.Synthetic]
P:19 [in Complexity.Complexity.Definitions]
p:190 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
P:1904 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:191 [in Undecidability.Shared.Libs.DLW.Utils.sums]
p:191 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:192 [in Undecidability.Shared.Libs.DLW.Utils.sums]
P:192 [in Undecidability.TM.Hoare.HoareRegister]
P:192 [in Undecidability.TM.Hoare.HoareCombinators]
P:192 [in Undecidability.Shared.Libs.DLW.Code.sss]
p:193 [in Complexity.L.ComparisonTimeBoundDerivation]
P:194 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
P:194 [in Undecidability.TM.Hoare.HoareRegister]
p:195 [in Undecidability.Shared.Libs.DLW.Utils.sums]
P:195 [in Undecidability.TM.Hoare.HoareRegister]
p:195 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
P:195 [in Undecidability.Shared.Libs.DLW.Code.sss]
P:1952 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:196 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
P:196 [in Undecidability.TM.L.HeapInterpreter.StepTM]
P:196 [in Undecidability.TM.Hoare.HoareLogic]
p:198 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
p:198 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
P:198 [in Undecidability.Shared.Libs.DLW.Code.sss]
p:199 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
p:199 [in Undecidability.Shared.Libs.DLW.Utils.sums]
P:2 [in Undecidability.Shared.Libs.DLW.Utils.fin_dec]
p:2 [in Undecidability.Synthetic.SemiDecidabilityFacts]
P:2 [in Complexity.NP.L.CanEnumTerm]
P:2 [in Complexity.L.AbstractMachines.FlatPro.Computable.Decompile]
P:2 [in Undecidability.Shared.Libs.PSL.EqDec]
p:2 [in Undecidability.Synthetic.EnumerabilityFacts]
P:2 [in Undecidability.Shared.FinTypeForallExists]
p:2 [in Undecidability.Synthetic.Undecidability]
P:2 [in Undecidability.L.Computability.Decidability]
p:2 [in Undecidability.Synthetic.MoreEnumerabilityFacts]
P:2 [in Undecidability.Synthetic.Definitions]
P:2 [in Undecidability.Synthetic.InformativeDefinitions]
P:2 [in Undecidability.Shared.Dec]
p:2 [in Undecidability.Shared.ListAutomation]
p:2 [in Undecidability.L.Tactics.Lproc]
P:2 [in Undecidability.Shared.Libs.DLW.Code.subcode]
p:20 [in Undecidability.Shared.Libs.PSL.Numbers]
p:20 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
p:20 [in Undecidability.Shared.Libs.DLW.Utils.prime]
P:20 [in Undecidability.Shared.Libs.PSL.EqDec]
P:20 [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
p:20 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
P:20 [in Undecidability.Shared.Dec]
p:200 [in Complexity.L.ComparisonTimeBoundDerivation]
P:200 [in Undecidability.TM.Hoare.HoareRegister]
P:2001 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
P:201 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
p:201 [in Undecidability.Shared.Libs.DLW.Utils.sums]
p:201 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
P:201 [in Undecidability.TM.Hoare.HoareCombinators]
p:202 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
P:202 [in Undecidability.Shared.Libs.DLW.Code.sss]
p:203 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
p:203 [in Complexity.L.ComparisonTimeBoundDerivation]
p:204 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:204 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
p:205 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
P:206 [in Undecidability.TM.Hoare.HoareRegister]
p:206 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
P:206 [in Undecidability.Shared.Libs.DLW.Code.sss]
p:208 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
P:209 [in Undecidability.Shared.Libs.DLW.Code.sss]
P:21 [in Undecidability.TM.Compound.TMTac]
p:21 [in Undecidability.Shared.Libs.DLW.Utils.prime]
P:21 [in Undecidability.L.Functions.LoopSum]
p:21 [in Undecidability.TM.Code.BinNumbers.PosIncrementTM]
P:21 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
p:21 [in Undecidability.Synthetic.EnumerabilityFacts]
p:21 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
p:21 [in Undecidability.Shared.Libs.DLW.Utils.binomial]
p:21 [in Undecidability.Synthetic.ListEnumerabilityFacts]
P:21 [in Complexity.Complexity.NP]
P:21 [in Undecidability.Shared.Libs.DLW.Code.sss]
p:210 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
P:211 [in Undecidability.Shared.Libs.DLW.Vec.vec]
p:211 [in Complexity.Libs.CookPrelim.MorePrelim]
P:212 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
p:212 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
p:212 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
P:214 [in Undecidability.TM.Hoare.HoareRegister]
p:214 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
P:217 [in Undecidability.TM.Hoare.HoareCombinators]
p:217 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
P:217 [in Undecidability.Shared.Libs.DLW.Code.sss]
P:218 [in Undecidability.TM.Hoare.HoareLogic]
P:219 [in Undecidability.Shared.Libs.DLW.Vec.vec]
p:22 [in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
p:22 [in Undecidability.Shared.FilterFacts]
p:22 [in Undecidability.Shared.Libs.DLW.Utils.prime]
P:22 [in Undecidability.Shared.Libs.PSL.EqDec]
P:22 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
p:22 [in Undecidability.Shared.Libs.PSL.Lists.Filter]
P:22 [in Complexity.L.AbstractMachines.UnfoldHeap]
p:22 [in Undecidability.Shared.Libs.PSL.FiniteTypes.Arbitrary]
P:22 [in Undecidability.TM.L.HeapInterpreter.StepTM]
P:22 [in Undecidability.L.Tactics.ComputableTactics]
P:22 [in Undecidability.Shared.Libs.DLW.Code.subcode]
p:22 [in Undecidability.Synthetic.ReducibilityFacts]
P:22 [in Complexity.NP.TM.LM_to_mTM]
p:221 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
p:221 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
P:222 [in Undecidability.Shared.Libs.DLW.Code.sss]
p:223 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
P:224 [in Undecidability.Shared.Libs.DLW.Vec.vec]
p:225 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
P:226 [in Undecidability.Shared.Libs.DLW.Code.sss]
p:227 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
p:228 [in Undecidability.Shared.Libs.DLW.Code.sss]
p:229 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
p:23 [in Undecidability.Shared.Libs.DLW.Utils.prime]
P:23 [in Undecidability.Shared.Libs.DLW.Utils.fin_base]
P:23 [in Undecidability.L.Computability.Decidability]
P:23 [in Undecidability.Synthetic.Definitions]
p:23 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:23 [in Complexity.NP.Clique.kSAT_to_Clique]
p:23 [in Undecidability.L.Computability.Rice]
P:23 [in Undecidability.TM.Hoare.HoareLogic]
P:23 [in Undecidability.Shared.Libs.DLW.Code.subcode]
P:230 [in Undecidability.Shared.Libs.DLW.Vec.vec]
P:232 [in Undecidability.TM.L.HeapInterpreter.StepTM]
P:234 [in Undecidability.Shared.Libs.DLW.Code.sss]
P:235 [in Undecidability.TM.Hoare.HoareCombinators]
p:235 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
P:236 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
P:237 [in Undecidability.TM.Hoare.HoareRegister]
P:238 [in Undecidability.TM.Hoare.HoareLogic]
P:238 [in Undecidability.Shared.Libs.DLW.Code.sss]
p:239 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
p:24 [in Undecidability.Shared.Libs.DLW.Utils.binomial]
P:24 [in Undecidability.L.Computability.Decidability]
p:24 [in Undecidability.L.Computability.Rice]
P:24 [in Complexity.L.AbstractMachines.FunctionalDefinitions]
P:24 [in Undecidability.Shared.Libs.DLW.Vec.pos]
P:24 [in Complexity.Complexity.NP]
P:24 [in Complexity.NP.TM.LM_to_mTM]
p:240 [in Undecidability.Shared.Libs.DLW.Code.sss]
p:243 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
p:246 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
P:248 [in Undecidability.TM.Hoare.HoareLogic]
P:248 [in Undecidability.TM.Hoare.HoareCombinators]
P:25 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
p:25 [in Undecidability.Shared.Libs.DLW.Utils.prime]
p:25 [in Undecidability.TM.Code.BinNumbers.PosIncrementTM]
p:25 [in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
P:25 [in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisStep]
P:25 [in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
p:25 [in Undecidability.Synthetic.DecidabilityFacts]
p:25 [in Undecidability.L.Computability.Synthetic]
P:25 [in Complexity.Complexity.Definitions]
P:25 [in Undecidability.Shared.Libs.DLW.Code.subcode]
P:25 [in Undecidability.Shared.Libs.DLW.Vec.pos]
p:250 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:251 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
p:2516 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:252 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
p:2521 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:2526 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
P:253 [in Undecidability.TM.Hoare.HoareRegister]
p:254 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
p:2541 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:2544 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:256 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
p:257 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
p:258 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
P:259 [in Undecidability.TM.Hoare.HoareLogic]
p:259 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
p:26 [in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
P:26 [in Undecidability.Shared.Libs.DLW.Utils.fin_dec]
p:26 [in Undecidability.Shared.FilterFacts]
p:26 [in Undecidability.Synthetic.EnumerabilityFacts]
p:26 [in Undecidability.Shared.Libs.PSL.Lists.Filter]
p:26 [in Undecidability.Shared.Libs.DLW.Utils.binomial]
p:26 [in Undecidability.L.TM.TapeFuns]
p:26 [in Complexity.L.AbstractMachines.AbstractSubstMachine]
P:26 [in Undecidability.L.Computability.Decidability]
P:26 [in Complexity.Complexity.SpaceBoundsTime]
p:26 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
P:26 [in Undecidability.L.Tactics.ComputableTactics]
P:26 [in Undecidability.TM.Hoare.HoareCombinators]
p:26 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
p:26 [in Undecidability.Shared.Libs.DLW.Vec.pos]
P:260 [in Undecidability.TM.Hoare.HoareCombinators]
p:2603 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:2608 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:2613 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:262 [in Undecidability.Shared.Libs.DLW.Vec.vec]
p:262 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
P:265 [in Undecidability.TM.Hoare.HoareRegister]
P:265 [in Undecidability.Shared.Libs.DLW.Code.sss]
p:2656 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:266 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:268 [in Undecidability.Shared.Libs.DLW.Vec.vec]
P:269 [in Undecidability.TM.Hoare.HoareLogic]
P:269 [in Undecidability.Shared.Libs.DLW.Code.sss]
P:27 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
P:27 [in Complexity.Complexity.SpaceBoundsTime]
P:27 [in Undecidability.Synthetic.Definitions]
P:27 [in Undecidability.Shared.Libs.DLW.Code.subcode]
p:27 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
p:27 [in Undecidability.Shared.Libs.PSL.FiniteTypes.FiniteFunction]
p:270 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
P:270 [in Undecidability.TM.Hoare.HoareCombinators]
p:2710 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:272 [in Undecidability.Shared.Libs.DLW.Vec.vec]
p:275 [in Undecidability.Shared.Libs.DLW.Vec.vec]
p:275 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
P:275 [in Undecidability.Shared.Libs.DLW.Code.sss]
p:276 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
p:277 [in Undecidability.Shared.Libs.DLW.Vec.vec]
P:279 [in Undecidability.TM.Hoare.HoareLogic]
p:279 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
p:28 [in Undecidability.Shared.Libs.DLW.Utils.prime]
p:28 [in Undecidability.TM.Code.BinNumbers.PosDefinitions]
P:28 [in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisUnfoldClos]
P:28 [in Undecidability.L.Tactics.LClos]
p:28 [in Undecidability.Synthetic.EnumerabilityFacts]
p:28 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
p:28 [in Undecidability.Shared.Libs.DLW.Utils.binomial]
P:28 [in Undecidability.L.Computability.Decidability]
p:28 [in Undecidability.Shared.Libs.PSL.FiniteTypes.Arbitrary]
P:28 [in Undecidability.Shared.Libs.DLW.Vec.pos]
P:28 [in Complexity.Complexity.NP]
P:280 [in Undecidability.TM.Hoare.HoareRegister]
P:282 [in Undecidability.Shared.Libs.DLW.Code.sss]
p:283 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
P:283 [in Undecidability.TM.Hoare.HoareCombinators]
p:283 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
P:286 [in Undecidability.TM.Hoare.HoareLogic]
p:288 [in Undecidability.Shared.Libs.DLW.Vec.vec]
p:2889 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
P:289 [in Undecidability.Shared.Libs.DLW.Code.sss]
p:29 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
P:29 [in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
P:29 [in Undecidability.Shared.Libs.PSL.EqDec]
p:29 [in Undecidability.Synthetic.DecidabilityFacts]
P:29 [in Undecidability.TM.Hoare.HoareLogic]
P:29 [in Undecidability.Shared.Libs.DLW.Code.subcode]
p:29 [in Undecidability.Shared.Libs.DLW.Vec.pos]
p:290 [in Undecidability.Shared.Libs.DLW.Vec.vec]
p:290 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:292 [in Undecidability.Shared.Libs.DLW.Vec.vec]
P:293 [in Undecidability.TM.Hoare.HoareRegister]
P:293 [in Undecidability.TM.Hoare.HoareLogic]
P:295 [in Undecidability.Shared.Libs.DLW.Code.sss]
p:2969 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:297 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
p:2977 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:298 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
P:299 [in Undecidability.TM.Hoare.HoareCombinators]
P:299 [in Undecidability.Shared.Libs.DLW.Code.sss]
p:2994 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:2995 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
P:3 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
p:3 [in Undecidability.Shared.FilterFacts]
p:3 [in Undecidability.Shared.Libs.DLW.Utils.prime]
P:3 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds_Loop]
P:3 [in Complexity.L.Datatypes.LDepPair]
p:3 [in Undecidability.Shared.Libs.PSL.Lists.Filter]
P:3 [in Complexity.Complexity.Subtypes]
P:3 [in Undecidability.Shared.Libs.DLW.Utils.fin_upto]
P:3 [in Undecidability.L.AbstractMachines.FlatPro.Programs]
P:3 [in Undecidability.L.Computability.Acceptability]
p:3 [in Undecidability.Synthetic.Infinite]
p:3 [in Undecidability.L.Computability.Rice]
p:3 [in Undecidability.Shared.ListAutomation]
P:3 [in Complexity.Complexity.Definitions]
P:3 [in Complexity.L.AbstractMachines.FunctionalDefinitions]
P:3 [in Undecidability.TM.Hoare.HoareCombinators]
P:3 [in Undecidability.Shared.Libs.DLW.Code.subcode]
P:3 [in Undecidability.TM.Hoare.HoareStdLib]
p:30 [in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
p:30 [in Undecidability.Shared.FilterFacts]
p:30 [in Undecidability.Shared.Libs.PSL.Lists.Filter]
p:30 [in Undecidability.Shared.Libs.DLW.Utils.binomial]
p:30 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
P:30 [in Complexity.NP.TM.LM_to_mTM]
p:300 [in Undecidability.Shared.Libs.DLW.Vec.vec]
p:3005 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:3013 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
P:302 [in Undecidability.Shared.Libs.DLW.Code.sss]
p:3025 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:304 [in Undecidability.Shared.Libs.DLW.Vec.vec]
P:306 [in Undecidability.TM.Hoare.HoareRegister]
p:306 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
P:306 [in Undecidability.Shared.Libs.DLW.Code.sss]
P:309 [in Undecidability.TM.Hoare.HoareLogic]
p:31 [in Undecidability.TM.Code.BinNumbers.PosDefinitions]
p:31 [in Undecidability.TM.Code.BinNumbers.PosPointers]
p:31 [in Complexity.L.AbstractMachines.AbstractSubstMachine]
P:31 [in Undecidability.L.AbstractMachines.FlatPro.Programs]
P:31 [in Undecidability.L.Functions.UnboundIteration]
p:31 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
P:31 [in Complexity.Complexity.Definitions]
P:31 [in Complexity.L.AbstractMachines.FunctionalDefinitions]
P:31 [in Undecidability.Shared.Libs.DLW.Code.subcode]
p:31 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
p:31 [in Undecidability.TM.Code.CasePair]
P:31 [in Undecidability.Shared.Libs.DLW.Code.sss]
P:310 [in Undecidability.Shared.Libs.DLW.Code.sss]
p:312 [in Undecidability.Shared.Libs.DLW.Vec.vec]
P:313 [in Undecidability.TM.Hoare.HoareRegister]
p:313 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:315 [in Undecidability.Shared.Libs.DLW.Vec.vec]
P:315 [in Undecidability.TM.Hoare.HoareCombinators]
P:319 [in Undecidability.TM.Hoare.HoareLogic]
p:32 [in Undecidability.Shared.Libs.DLW.Vec.vec]
p:32 [in Undecidability.Shared.Libs.DLW.Utils.list_bool]
P:32 [in Complexity.L.AbstractMachines.AbstractSubstMachine]
P:32 [in Undecidability.Synthetic.Definitions]
p:32 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
P:32 [in Undecidability.Shared.Libs.DLW.Code.subcode]
P:32 [in Undecidability.Shared.Libs.DLW.Vec.pos]
P:320 [in Undecidability.TM.Hoare.HoareRegister]
p:320 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:326 [in Undecidability.Shared.Libs.DLW.Vec.vec]
p:326 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
P:327 [in Undecidability.TM.Hoare.HoareCombinators]
p:33 [in Undecidability.Shared.Libs.DLW.Vec.vec]
p:33 [in Undecidability.Shared.Libs.DLW.Utils.prime]
p:33 [in Undecidability.TM.Code.BinNumbers.PosDefinitions]
P:33 [in Complexity.Complexity.Subtypes]
p:33 [in Undecidability.Shared.Libs.DLW.Utils.binomial]
p:33 [in Undecidability.Synthetic.MoreEnumerabilityFacts]
p:33 [in Undecidability.Shared.Libs.DLW.Vec.pos]
p:33 [in Undecidability.TM.Code.BinNumbers.PosAddTM]
P:330 [in Undecidability.TM.Hoare.HoareRegister]
P:330 [in Undecidability.TM.Hoare.HoareLogic]
p:331 [in Undecidability.Shared.Libs.DLW.Vec.vec]
p:336 [in Undecidability.Shared.Libs.DLW.Vec.vec]
P:338 [in Undecidability.TM.Hoare.HoareRegister]
p:34 [in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
p:34 [in Undecidability.Shared.FilterFacts]
p:34 [in Undecidability.Shared.Libs.PSL.Lists.Filter]
p:34 [in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
p:34 [in Undecidability.TM.Code.BinNumbers.PosPointers]
p:34 [in Complexity.L.TM.TMflat]
P:34 [in Undecidability.Shared.Libs.DLW.Utils.fin_base]
p:34 [in Undecidability.Synthetic.DecidabilityFacts]
p:34 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:34 [in Undecidability.L.Computability.Rice]
P:34 [in Undecidability.TM.Hoare.HoareLogic]
p:34 [in Undecidability.Shared.Libs.DLW.Vec.pos]
P:342 [in Undecidability.TM.Hoare.HoareLogic]
P:347 [in Undecidability.TM.Hoare.HoareRegister]
P:35 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
p:35 [in Undecidability.Shared.Libs.DLW.Vec.vec]
p:35 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
p:35 [in Undecidability.Shared.Libs.DLW.Utils.crt]
P:35 [in Undecidability.TM.Hoare.HoareRegister]
P:35 [in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
p:35 [in Undecidability.Shared.Libs.PSL.FiniteTypes.Arbitrary]
p:35 [in Undecidability.L.Computability.Rice]
P:35 [in Undecidability.Shared.Libs.DLW.Code.subcode]
P:35 [in Undecidability.Shared.Libs.DLW.Code.sss]
p:350 [in Undecidability.Shared.Libs.DLW.Vec.vec]
P:353 [in Undecidability.TM.Hoare.HoareLogic]
p:3538 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:354 [in Undecidability.Shared.Libs.DLW.Vec.vec]
p:354 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:3543 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:3548 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
P:359 [in Undecidability.TM.Hoare.HoareRegister]
p:36 [in Undecidability.Shared.Libs.PSL.FCI]
p:36 [in Undecidability.Shared.Libs.DLW.Vec.vec]
P:36 [in Complexity.HierarchyTheorem.TimeHierarchyTheorem]
p:36 [in Undecidability.Shared.Libs.DLW.Utils.crt]
p:36 [in Undecidability.TM.Code.BinNumbers.PosPointers]
p:36 [in Undecidability.L.TM.TapeFuns]
p:36 [in Complexity.NP.SAT.FSAT.FSAT]
P:36 [in Complexity.L.AbstractMachines.AbstractSubstMachine]
P:36 [in Complexity.Complexity.Definitions]
P:36 [in Complexity.L.AbstractMachines.FunctionalDefinitions]
P:36 [in Undecidability.TM.Hoare.HoareCombinators]
p:360 [in Undecidability.Shared.Libs.DLW.Vec.vec]
p:361 [in Undecidability.Shared.Libs.DLW.Vec.vec]
p:362 [in Undecidability.Shared.Libs.DLW.Vec.vec]
p:363 [in Undecidability.Shared.Libs.DLW.Vec.vec]
P:365 [in Undecidability.TM.Hoare.HoareLogic]
P:368 [in Undecidability.TM.Hoare.HoareCombinators]
P:369 [in Undecidability.TM.Hoare.HoareRegister]
p:37 [in Undecidability.Shared.Libs.PSL.Numbers]
p:37 [in Undecidability.Shared.Libs.DLW.Utils.prime]
p:37 [in Undecidability.TM.Code.BinNumbers.PosDefinitions]
p:37 [in Undecidability.Shared.Libs.DLW.Utils.crt]
P:37 [in Undecidability.Shared.Libs.DLW.Utils.fin_base]
P:37 [in Undecidability.Synthetic.Definitions]
P:37 [in Complexity.NP.TM.LM_to_mTM]
p:37 [in Undecidability.Shared.Libs.PSL.FiniteTypes.FiniteFunction]
p:370 [in Undecidability.Shared.Libs.DLW.Vec.vec]
P:373 [in Undecidability.TM.Hoare.HoareLogic]
p:38 [in Undecidability.Shared.Libs.DLW.Utils.fin_quotient]
p:38 [in Undecidability.L.Datatypes.List.List_basics]
P:38 [in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
p:38 [in Undecidability.Shared.Libs.DLW.Utils.crt]
P:38 [in Undecidability.Shared.Libs.DLW.Code.subcode]
p:38 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
p:38 [in Undecidability.Shared.Libs.PSL.FiniteTypes.FiniteFunction]
p:380 [in Undecidability.Shared.Libs.DLW.Vec.vec]
P:381 [in Undecidability.TM.Hoare.HoareLogic]
P:383 [in Undecidability.TM.Hoare.HoareRegister]
P:385 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
P:387 [in Undecidability.TM.Hoare.HoareCombinators]
p:388 [in Undecidability.Shared.Libs.DLW.Vec.vec]
p:389 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:39 [in Undecidability.Shared.Libs.DLW.Utils.fin_quotient]
p:39 [in Undecidability.Shared.Libs.PSL.Lists.Filter]
p:39 [in Undecidability.Shared.Libs.DLW.Utils.crt]
P:39 [in Undecidability.L.Functions.UnboundIteration]
p:39 [in Undecidability.Synthetic.ListEnumerabilityFacts]
p:39 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
p:39 [in Undecidability.TM.Code.BinNumbers.PosAddTM]
P:39 [in Undecidability.Shared.Libs.DLW.Code.sss]
p:39 [in Undecidability.Shared.Libs.PSL.FiniteTypes.FiniteFunction]
P:398 [in Undecidability.TM.Hoare.HoareRegister]
p:398 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
P:399 [in Undecidability.TM.Hoare.HoareLogic]
p:4 [in Undecidability.Shared.Libs.PSL.Prelim]
p:4 [in Undecidability.Synthetic.Undecidability]
p:4 [in Undecidability.Synthetic.MoreEnumerabilityFacts]
p:4 [in Undecidability.L.Computability.Rice]
P:4 [in Undecidability.Shared.Libs.DLW.Code.subcode]
p:40 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
p:40 [in Undecidability.TM.Code.BinNumbers.PosDefinitions]
P:40 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
P:40 [in Undecidability.L.AbstractMachines.FlatPro.Programs]
p:40 [in Undecidability.Shared.Libs.PSL.FiniteTypes.Arbitrary]
p:40 [in Undecidability.Synthetic.MoreEnumerabilityFacts]
p:40 [in Undecidability.Synthetic.DecidabilityFacts]
p:40 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:40 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
p:40 [in Undecidability.TM.Code.CasePair]
p:40 [in Undecidability.Shared.Libs.PSL.FiniteTypes.FiniteFunction]
p:41 [in Undecidability.Shared.Libs.DLW.Vec.vec]
p:41 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
P:41 [in Undecidability.TM.Hoare.HoareLogic]
P:41 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
p:41 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
p:41 [in Undecidability.Shared.Libs.DLW.Vec.pos]
P:41 [in Complexity.Complexity.NP]
p:413 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
p:414 [in Undecidability.Shared.Libs.DLW.Vec.vec]
p:415 [in Undecidability.Shared.Libs.DLW.Vec.vec]
P:416 [in Undecidability.TM.Hoare.HoareRegister]
P:42 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
p:42 [in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
P:42 [in Complexity.Complexity.Definitions]
p:42 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
P:42 [in Undecidability.Shared.Libs.DLW.Code.sss]
P:426 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:43 [in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
p:43 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
p:43 [in Undecidability.TM.Code.BinNumbers.PosDefinitions]
P:43 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
p:43 [in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
P:43 [in Undecidability.Shared.Libs.DLW.Utils.fin_base]
p:43 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:43 [in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
p:43 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
P:43 [in Complexity.NP.TM.LM_to_mTM]
p:430 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:44 [in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
p:44 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
p:44 [in Undecidability.Shared.Libs.DLW.Utils.crt]
P:44 [in Undecidability.Shared.Libs.DLW.Utils.fin_upto]
P:44 [in Complexity.L.AbstractMachines.AbstractSubstMachine]
P:44 [in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
P:44 [in Undecidability.L.Tactics.Reflection]
p:440 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
P:442 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
P:443 [in Undecidability.TM.Hoare.HoareRegister]
P:445 [in Undecidability.TM.Hoare.HoareRegister]
P:446 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
p:45 [in Undecidability.Shared.Libs.DLW.Utils.prime]
p:45 [in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
p:45 [in Undecidability.Shared.Libs.DLW.Utils.crt]
P:45 [in Undecidability.L.AbstractMachines.FlatPro.Programs]
P:45 [in Undecidability.L.Functions.UnboundIteration]
p:45 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
P:450 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
P:450 [in Undecidability.TM.Hoare.HoareRegister]
P:454 [in Undecidability.TM.Hoare.HoareCombinators]
P:455 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
P:456 [in Undecidability.TM.Hoare.HoareRegister]
p:46 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
p:46 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
P:46 [in Complexity.Complexity.Subtypes]
p:46 [in Undecidability.Shared.Libs.DLW.Utils.crt]
p:46 [in Undecidability.Shared.Libs.PSL.FiniteTypes.Arbitrary]
P:46 [in Undecidability.TM.L.HeapInterpreter.StepTM]
p:46 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
P:462 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
p:462 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
P:465 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
P:466 [in Undecidability.TM.Hoare.HoareRegister]
p:47 [in Undecidability.Shared.Libs.DLW.Vec.vec]
p:47 [in Undecidability.TM.Code.BinNumbers.PosDefinitions]
P:47 [in Undecidability.Shared.Libs.DLW.Utils.fin_upto]
P:47 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
p:47 [in Undecidability.Synthetic.ReducibilityFacts]
p:47 [in Undecidability.Shared.Libs.PSL.FiniteTypes.FiniteFunction]
p:47 [in Undecidability.TM.Code.BinNumbers.PosShiftTM]
P:470 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
P:471 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:475 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
P:479 [in Undecidability.TM.Hoare.HoareRegister]
p:48 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
P:48 [in Undecidability.TM.Hoare.HoareRegister]
P:48 [in Undecidability.TM.Hoare.HoareCombinators]
p:48 [in Undecidability.Shared.Libs.PSL.FiniteTypes.FiniteFunction]
p:485 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
P:487 [in Undecidability.TM.Hoare.HoareRegister]
p:49 [in Undecidability.Shared.Libs.DLW.Utils.prime]
p:49 [in Undecidability.TM.Code.BinNumbers.PosDefinitions]
P:49 [in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
P:49 [in Undecidability.L.Tactics.LClos]
p:49 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:49 [in Undecidability.Shared.Libs.PSL.Vectors.VectorDupfree]
p:49 [in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
P:49 [in Undecidability.Shared.Libs.DLW.Code.subcode]
p:49 [in Undecidability.Shared.Libs.DLW.Vec.pos]
p:49 [in Undecidability.Shared.Libs.PSL.FiniteTypes.FiniteFunction]
P:496 [in Undecidability.TM.Hoare.HoareRegister]
p:5 [in Undecidability.Shared.FilterFacts]
P:5 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds_Loop]
p:5 [in Undecidability.TM.Code.BinNumbers.PosDefinitions]
p:5 [in Undecidability.TM.Code.BinNumbers.PosIncrementTM]
P:5 [in Undecidability.TM.Hoare.HoareLegacy]
p:5 [in Undecidability.Shared.Libs.PSL.Lists.Filter]
P:5 [in Undecidability.L.Prelim.MoreBase]
P:5 [in Undecidability.L.Computability.Decidability]
P:5 [in Undecidability.TM.L.HeapInterpreter.StepTM]
P:5 [in Undecidability.Synthetic.Definitions]
P:5 [in Undecidability.Synthetic.InformativeDefinitions]
P:5 [in Complexity.L.AbstractMachines.LambdaDepth]
p:50 [in Undecidability.L.Prelim.ARS]
p:50 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
P:50 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
p:50 [in Undecidability.Shared.Libs.PSL.FiniteTypes.Arbitrary]
p:50 [in Undecidability.Synthetic.ListEnumerabilityFacts]
p:50 [in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
P:50 [in Complexity.L.AbstractMachines.FunctionalDefinitions]
P:50 [in Undecidability.TM.Hoare.HoareLogic]
P:50 [in Undecidability.Shared.Libs.DLW.Code.sss]
p:50 [in Undecidability.Shared.Libs.PSL.FiniteTypes.FiniteFunction]
P:507 [in Undecidability.TM.Hoare.HoareRegister]
p:51 [in Undecidability.Shared.Libs.PSL.Numbers]
p:51 [in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
p:51 [in Undecidability.TM.Code.BinNumbers.PosDefinitions]
p:51 [in Undecidability.Shared.Libs.DLW.Utils.crt]
p:51 [in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
p:51 [in Undecidability.Synthetic.ReducibilityFacts]
P:516 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
P:519 [in Undecidability.TM.Hoare.HoareRegister]
p:52 [in Undecidability.Shared.Libs.DLW.Vec.vec]
p:52 [in Undecidability.Shared.Libs.DLW.Utils.prime]
p:52 [in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
P:52 [in Undecidability.TM.Hoare.HoareRegister]
p:520 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
P:528 [in Undecidability.TM.Hoare.HoareRegister]
p:529 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:53 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
P:53 [in Complexity.L.AbstractMachines.AbstractSubstMachine]
P:53 [in Undecidability.L.AbstractMachines.FlatPro.Programs]
p:53 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
P:53 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
P:53 [in Undecidability.Shared.Libs.DLW.Code.subcode]
p:53 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
P:53 [in Undecidability.Shared.Libs.DLW.Code.sss]
P:538 [in Undecidability.TM.Hoare.HoareRegister]
p:54 [in Undecidability.TM.Code.BinNumbers.PosMultTM]
p:54 [in Complexity.L.AbstractMachines.UnfoldTailRec]
P:54 [in Undecidability.TM.Hoare.HoareRegister]
p:54 [in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
p:54 [in Undecidability.TM.Code.BinNumbers.PosShiftTM]
p:55 [in Undecidability.Shared.Libs.DLW.Vec.vec]
p:55 [in Undecidability.TM.Code.BinNumbers.PosDefinitions]
p:55 [in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
P:55 [in Undecidability.TM.L.HeapInterpreter.StepTM]
p:55 [in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
p:55 [in Undecidability.Synthetic.ReducibilityFacts]
P:551 [in Undecidability.TM.Hoare.HoareRegister]
P:557 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:56 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
p:56 [in Undecidability.Shared.Libs.PSL.FiniteTypes.Arbitrary]
p:56 [in Undecidability.Synthetic.ListEnumerabilityFacts]
p:56 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
p:56 [in Undecidability.Shared.Libs.DLW.Vec.pos]
P:56 [in Undecidability.Shared.Libs.DLW.Code.sss]
p:561 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
P:565 [in Undecidability.TM.Hoare.HoareRegister]
p:57 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
p:57 [in Undecidability.TM.Code.BinNumbers.PosDefinitions]
p:57 [in Complexity.L.AbstractMachines.UnfoldTailRec]
P:57 [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
P:57 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
p:57 [in Complexity.L.TM.TMflatComp]
P:57 [in Undecidability.TM.Hoare.HoareLogic]
p:57 [in Complexity.NP.SAT.SAT]
p:571 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
P:576 [in Undecidability.TM.Hoare.HoareRegister]
p:58 [in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
P:58 [in Complexity.Complexity.Subtypes]
P:58 [in Complexity.TM.PrettyBounds.BaseCodeSpace]
P:58 [in Undecidability.Shared.Libs.DLW.Code.subcode]
p:59 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
P:59 [in Undecidability.TM.Hoare.HoareRegister]
P:59 [in Undecidability.TM.Hoare.HoareCombinators]
p:59 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
p:59 [in Undecidability.Shared.Libs.DLW.Vec.pos]
p:59 [in Undecidability.TM.Code.BinNumbers.PosShiftTM]
P:596 [in Complexity.NP.TM.LM_to_mTM]
p:6 [in Undecidability.Shared.Libs.DLW.Utils.prime]
p:6 [in Undecidability.TM.Code.BinNumbers.PosDefinitions]
P:6 [in Complexity.L.AbstractMachines.AbstractSubstMachine]
P:6 [in Complexity.Complexity.SpaceBoundsTime]
P:6 [in Undecidability.Synthetic.DecidabilityFacts]
P:6 [in Undecidability.TM.Hoare.HoareLogic]
P:6 [in Undecidability.TM.Hoare.HoareCombinators]
P:6 [in Undecidability.Shared.Libs.DLW.Code.subcode]
p:6 [in Undecidability.Shared.Libs.DLW.Vec.pos]
p:6 [in Undecidability.TM.Code.BinNumbers.PosShiftTM]
p:60 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
p:60 [in Undecidability.Shared.Libs.DLW.Vec.vec]
p:60 [in Undecidability.Shared.Libs.DLW.Utils.prime]
p:60 [in Complexity.L.AbstractMachines.UnfoldTailRec]
P:60 [in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
p:60 [in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
P:60 [in Undecidability.Shared.Libs.DLW.Utils.fin_base]
p:60 [in Complexity.NP.SAT.SAT]
P:60 [in Complexity.Complexity.NP]
p:60 [in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
P:601 [in Complexity.NP.TM.LM_to_mTM]
P:602 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:606 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
P:607 [in Complexity.NP.TM.LM_to_mTM]
p:61 [in Undecidability.TM.Code.BinNumbers.PosDefinitions]
P:61 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
P:611 [in Complexity.NP.TM.LM_to_mTM]
p:615 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
P:617 [in Complexity.NP.TM.LM_to_mTM]
p:62 [in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
P:62 [in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
p:62 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
p:62 [in Undecidability.Shared.Libs.DLW.Vec.pos]
p:62 [in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
P:62 [in Undecidability.Shared.Libs.DLW.Code.sss]
P:621 [in Complexity.NP.TM.LM_to_mTM]
p:63 [in Undecidability.Shared.Libs.DLW.Vec.vec]
p:63 [in Undecidability.TM.Code.BinNumbers.PosDefinitions]
p:63 [in Undecidability.L.Tactics.GenEncode]
P:63 [in Undecidability.TM.Hoare.HoareRegister]
P:63 [in Undecidability.L.AbstractMachines.FlatPro.Programs]
p:63 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
P:63 [in Complexity.Complexity.NP]
p:64 [in Undecidability.Shared.Libs.DLW.Utils.prime]
p:64 [in Complexity.L.ComparisonTimeBoundDerivation]
P:64 [in Complexity.TM.PrettyBounds.BaseCodeSpace]
p:64 [in Complexity.L.TM.TMflatten]
p:64 [in Undecidability.L.Computability.Synthetic]
P:64 [in Undecidability.TM.Hoare.HoareLogic]
p:64 [in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
p:64 [in Undecidability.TM.Code.BinNumbers.PosShiftTM]
P:646 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:649 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:65 [in Undecidability.TM.Code.BinNumbers.PosDefinitions]
P:65 [in Complexity.NP.L.CanEnumTerm]
P:65 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
P:65 [in Undecidability.TM.Hoare.HoareRegister]
P:65 [in Undecidability.L.Tactics.Reflection]
p:65 [in Complexity.NP.SAT.SAT]
p:65 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
p:65 [in Undecidability.Shared.Libs.DLW.Vec.pos]
P:65 [in Undecidability.Shared.Libs.DLW.Code.sss]
p:658 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:66 [in Undecidability.L.Computability.Enum]
P:66 [in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
p:66 [in Undecidability.TM.Code.CasePair]
p:66 [in Complexity.Complexity.NP]
p:67 [in Undecidability.Shared.Libs.DLW.Vec.vec]
p:67 [in Undecidability.TM.Code.BinNumbers.PosDefinitions]
P:67 [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
p:67 [in Complexity.L.ComparisonTimeBoundDerivation]
p:68 [in Undecidability.Shared.Libs.DLW.Utils.prime]
P:68 [in Complexity.NP.L.CanEnumTerm]
P:68 [in Undecidability.TM.L.HeapInterpreter.StepTM]
p:68 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
p:68 [in Complexity.Complexity.NP]
P:689 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:69 [in Complexity.L.ComparisonTimeBoundDerivation]
P:69 [in Undecidability.TM.Hoare.HoareRegister]
P:69 [in Undecidability.Shared.Libs.DLW.Utils.fin_base]
p:69 [in Undecidability.L.Computability.Synthetic]
p:69 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
p:69 [in Undecidability.Shared.Libs.DLW.Vec.pos]
p:69 [in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
p:692 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:7 [in Undecidability.Shared.Libs.PSL.Numbers]
p:7 [in Complexity.L.Datatypes.LBinNums]
p:7 [in Undecidability.Shared.FilterFacts]
p:7 [in Undecidability.TM.Code.BinNumbers.PosDefinitions]
p:7 [in Undecidability.Shared.Libs.PSL.Lists.Filter]
P:7 [in Complexity.NP.L.LMGenNP]
p:7 [in Undecidability.Shared.Libs.DLW.Utils.php]
P:7 [in Undecidability.L.Computability.Decidability]
P:7 [in Undecidability.L.AbstractMachines.FlatPro.Programs]
P:7 [in Complexity.Complexity.NP]
p:7 [in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
p:70 [in Undecidability.TM.Code.BinNumbers.PosDefinitions]
P:70 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
p:70 [in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
P:70 [in Undecidability.TM.L.HeapInterpreter.StepTM]
P:70 [in Undecidability.TM.Hoare.HoareCombinators]
p:70 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
p:701 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:71 [in Undecidability.Shared.Libs.DLW.Utils.prime]
P:71 [in Complexity.NP.L.CanEnumTerm]
P:71 [in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
p:71 [in Undecidability.Shared.Libs.DLW.Vec.pos]
P:71 [in Undecidability.Shared.Libs.DLW.Code.sss]
p:72 [in Undecidability.Shared.Libs.DLW.Vec.vec]
p:72 [in Undecidability.TM.Code.BinNumbers.PosDefinitions]
P:72 [in Complexity.NP.L.CanEnumTerm]
P:72 [in Undecidability.TM.Hoare.HoareRegister]
p:72 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
p:72 [in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
P:73 [in Complexity.NP.L.CanEnumTerm]
p:73 [in Undecidability.L.Computability.Enum]
P:73 [in Complexity.L.TM.TMflatComp]
p:73 [in Undecidability.Shared.Libs.DLW.Vec.pos]
P:732 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:735 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:74 [in Undecidability.TM.Code.CasePair]
P:75 [in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
p:75 [in Undecidability.L.Computability.Synthetic]
p:76 [in Undecidability.L.Computability.Enum]
p:76 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
P:76 [in Complexity.Complexity.NP]
p:77 [in Undecidability.Shared.Libs.DLW.Vec.vec]
p:77 [in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
P:77 [in Undecidability.Shared.Libs.DLW.Code.sss]
p:77 [in Complexity.NP.Clique.kSAT_to_FlatClique]
P:78 [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
P:78 [in Undecidability.TM.Hoare.HoareRegister]
P:78 [in Undecidability.TM.L.HeapInterpreter.StepTM]
p:78 [in Complexity.NP.Clique.kSAT_to_Clique]
p:78 [in Undecidability.Shared.Libs.DLW.Vec.pos]
p:78 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
P:786 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:8 [in Undecidability.Shared.Libs.DLW.Utils.prime]
p:8 [in Undecidability.Synthetic.SemiDecidabilityFacts]
P:8 [in Complexity.NP.TM.M_LM2TM]
P:8 [in Undecidability.Synthetic.Definitions]
P:8 [in Undecidability.Synthetic.InformativeDefinitions]
p:8 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
P:8 [in Undecidability.Shared.Libs.DLW.Code.subcode]
p:8 [in Undecidability.Shared.Libs.DLW.Vec.pos]
p:80 [in Undecidability.L.Computability.Enum]
P:80 [in Undecidability.TM.Hoare.HoareRegister]
P:80 [in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
P:80 [in Undecidability.TM.Hoare.HoareCombinators]
p:80 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
P:81 [in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
p:81 [in Undecidability.Synthetic.ListEnumerabilityFacts]
p:81 [in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
p:82 [in Undecidability.Shared.Libs.DLW.Vec.vec]
P:82 [in Undecidability.TM.Hoare.HoareRegister]
p:82 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:82 [in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
p:82 [in Undecidability.L.Computability.Synthetic]
P:82 [in Undecidability.Shared.Libs.DLW.Code.sss]
p:82 [in Complexity.NP.Clique.kSAT_to_FlatClique]
p:83 [in Undecidability.L.Computability.Enum]
P:83 [in Undecidability.TM.Hoare.HoareLogic]
p:83 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
p:83 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
p:84 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
P:846 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:85 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
p:85 [in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
p:86 [in Undecidability.L.Computability.Enum]
P:86 [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
p:86 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
p:86 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
p:86 [in Undecidability.Shared.Libs.DLW.Vec.pos]
p:86 [in Complexity.NP.Clique.kSAT_to_FlatClique]
p:87 [in Undecidability.L.Computability.Enum]
P:87 [in Undecidability.L.Complexity.ResourceMeasures]
p:87 [in Undecidability.Synthetic.ListEnumerabilityFacts]
P:87 [in Undecidability.TM.Hoare.HoareLogic]
p:87 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
p:87 [in Undecidability.TM.Code.CasePair]
P:87 [in Complexity.Complexity.NP]
P:87 [in Undecidability.Shared.Libs.DLW.Code.sss]
P:88 [in Undecidability.TM.Hoare.HoareRegister]
p:88 [in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
p:88 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
p:88 [in Undecidability.TM.Code.CasePair]
p:888 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
p:89 [in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
P:9 [in Undecidability.Shared.Libs.DLW.Utils.fin_base]
P:9 [in Undecidability.L.Computability.Decidability]
p:9 [in Undecidability.L.Computability.Acceptability]
P:9 [in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
P:9 [in Undecidability.L.Computability.MuRec]
P:9 [in Undecidability.TM.Hoare.HoareCombinators]
P:9 [in Complexity.Complexity.NP]
P:9 [in Undecidability.TM.Hoare.HoareStdLib]
P:9 [in Complexity.L.AbstractMachines.LambdaDepth]
p:90 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:90 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
P:906 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
P:91 [in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
p:91 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
p:916 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
p:92 [in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
P:92 [in Undecidability.TM.Hoare.HoareCombinators]
p:926 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
p:93 [in Complexity.L.TM.TMunflatten]
p:93 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
P:93 [in Complexity.Complexity.NP]
P:93 [in Undecidability.Shared.Libs.DLW.Code.sss]
p:930 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
P:94 [in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
P:94 [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
p:94 [in Undecidability.TM.Util.Prelim]
p:94 [in Complexity.L.ComparisonTimeBoundDerivation]
p:94 [in Complexity.L.TM.TMunflatten]
P:94 [in Undecidability.TM.Hoare.HoareRegister]
p:94 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:94 [in Undecidability.L.Computability.Synthetic]
p:94 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
p:94 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
p:94 [in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
p:95 [in Complexity.L.TM.TMunflatten]
p:95 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
p:96 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
p:96 [in Undecidability.Shared.Libs.DLW.Vec.vec]
p:96 [in Complexity.L.TM.TMunflatten]
p:96 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
p:96 [in Undecidability.Shared.Libs.DLW.Vec.pos]
P:963 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
P:97 [in Undecidability.L.Computability.Seval]
p:97 [in Undecidability.L.Computability.Synthetic]
P:97 [in Undecidability.TM.Hoare.HoareLogic]
P:97 [in Undecidability.Shared.Libs.DLW.Code.sss]
P:98 [in Undecidability.Shared.Libs.DLW.Utils.fin_base]
p:98 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
p:98 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
p:98 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
p:995 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]

Q

qflat:3682 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
qflat:3686 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
qi':182 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
qi:181 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
qm:2644 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
qm:60 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
qm:67 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
qout_M':429 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
qout_M:428 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
qout_M:314 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
qsym:7 [in Undecidability.TM.Combinators.Mirror]
qs:2766 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q_fin:330 [in Complexity.TM.PrettyBounds.M2MBounds]
q_fin:320 [in Complexity.TM.PrettyBounds.M2MBounds]
q_fin:312 [in Complexity.TM.PrettyBounds.M2MBounds]
q_fin:304 [in Complexity.TM.PrettyBounds.M2MBounds]
q_final:227 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
q_final:208 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
q_M:469 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
q_M':374 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
q_M':370 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
q_M':364 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
q_M':360 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
q_M':356 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
q_M':352 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
q_M:311 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
q_M:264 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
q_M:256 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
q''':154 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
q'':143 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
q'':151 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
q'':30 [in Undecidability.TM.TM]
q'':34 [in Undecidability.TM.SBTM]
q':1018 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Q':102 [in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
q':1020 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':1022 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':1027 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':1035 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':104 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
q':1043 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':105 [in Undecidability.TM.Univ.Univ]
q':1072 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':1074 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':1076 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':1081 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':1089 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':1097 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':111 [in Undecidability.TM.Lifting.LiftTapes]
q':112 [in Undecidability.TM.Univ.Univ]
q':1126 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':1128 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':1130 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':1135 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':1143 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':1151 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':1180 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':1182 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':1184 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':1189 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':119 [in Undecidability.TM.Univ.Univ]
q':1197 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':12 [in Complexity.NP.SAT.CookLevin.Subproblems.TM_single]
q':1205 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':122 [in Undecidability.TM.Univ.Univ]
q':123 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
q':1234 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':1236 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':1238 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Q':126 [in Undecidability.TM.Hoare.HoareRegister]
Q':126 [in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
q':128 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
q':13 [in Undecidability.TM.Combinators.Switch]
q':132 [in Undecidability.TM.Univ.LowLevel]
q':1378 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':1382 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':1387 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':1395 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':14 [in Undecidability.TM.Combinators.StateWhile]
q':140 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
q':1403 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':1419 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':1423 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':1428 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':143 [in Undecidability.TM.Univ.LowLevel]
q':1434 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':1442 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':1450 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':1470 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':1475 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':148 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
q':1481 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':1489 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':149 [in Undecidability.TM.Univ.LowLevel]
q':1497 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':15 [in Undecidability.TM.Combinators.Switch]
q':1515 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':1519 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Q':152 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
q':1524 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':1532 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':1540 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Q':155 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
q':1556 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Q':156 [in Undecidability.TM.Hoare.HoareRegister]
q':1560 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':1565 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':1571 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':1579 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Q':158 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
q':1587 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':1607 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':161 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
q':1612 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':1617 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':1625 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':1633 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':165 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
q':1650 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':1654 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':1658 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':1666 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':1674 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':168 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
q':168 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
q':1689 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':1694 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':1697 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':1705 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':1713 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':1728 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':1733 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':1736 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':1744 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':1752 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':1767 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':1774 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Q':178 [in Undecidability.TM.Hoare.HoareRegister]
q':1781 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':1809 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':1810 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':1811 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':1815 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':1822 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':1829 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':184 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
q':184 [in Undecidability.TM.Univ.Univ]
q':1857 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':1858 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':1859 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':1863 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':1870 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':1877 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':1905 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':1906 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':1907 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':2007 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':2039 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':2071 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':2103 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':2114 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':2125 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':2136 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':2147 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':2158 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':2168 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':2178 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':2188 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':2198 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':2208 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':2218 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':2225 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':2234 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':2243 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':2252 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':2261 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':2270 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':2279 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':2288 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':2297 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':2305 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':2313 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':2321 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':2329 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':2337 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':2345 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':2353 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':2361 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':2369 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':2377 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Q':238 [in Undecidability.TM.Hoare.HoareRegister]
q':2385 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':2393 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':24 [in Undecidability.TM.Univ.Univ]
q':2401 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':2409 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':2417 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':2425 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':2433 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':2441 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':2448 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':2455 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':2462 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':2469 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':2476 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':2483 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':2490 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':2497 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Q':25 [in Undecidability.L.Tactics.ComputableTactics]
q':2504 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Q':254 [in Undecidability.TM.Hoare.HoareRegister]
q':257 [in Complexity.TM.PrettyBounds.M2MBounds]
Q':266 [in Undecidability.TM.Hoare.HoareRegister]
q':2716 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':2730 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':2736 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':274 [in Complexity.TM.PrettyBounds.M2MBounds]
q':2744 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':2761 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':2772 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':2780 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':28 [in Undecidability.TM.TM]
Q':28 [in Undecidability.L.Tactics.ComputableTactics]
Q':28 [in Undecidability.TM.Hoare.HoareCombinators]
Q':282 [in Undecidability.TM.Hoare.HoareRegister]
Q':29 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
Q':294 [in Undecidability.TM.Hoare.HoareRegister]
q':31 [in Undecidability.TM.SBTM]
q':3247 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':3250 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':3256 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':3263 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':3278 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':3288 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':3298 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':33 [in Complexity.NP.SAT.CookLevin.Subproblems.TM_single]
q':33 [in Undecidability.TM.Univ.Univ]
q':3310 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':3320 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':3330 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':3342 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':3352 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':3362 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':3374 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':3382 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':3390 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':3400 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':3408 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':3416 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':3426 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':3434 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':3442 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':3454 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':3464 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':3474 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':348 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':3483 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':3492 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':3501 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':3509 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':3517 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':3525 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':356 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':366 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':37 [in Complexity.NP.SAT.CookLevin.Subproblems.TM_single]
q':37 [in Undecidability.TM.Univ.Univ]
Q':370 [in Undecidability.TM.Hoare.HoareRegister]
q':376 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Q':385 [in Undecidability.TM.Hoare.HoareRegister]
q':39 [in Undecidability.TM.SBTM]
q':393 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Q':399 [in Undecidability.TM.Hoare.HoareRegister]
q':40 [in Undecidability.TM.TM]
q':400 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':409 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':409 [in Undecidability.TM.Util.TM_facts]
q':411 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q':416 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
Q':417 [in Undecidability.TM.Hoare.HoareRegister]
q':418 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':419 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q':426 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q':434 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':44 [in Undecidability.TM.SBTM]
q':442 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':45 [in Complexity.NP.SAT.CookLevin.Subproblems.TM_single]
q':452 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Q':452 [in Undecidability.TM.Hoare.HoareCombinators]
q':455 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q':46 [in Undecidability.TM.Lifting.LiftAlphabet]
q':461 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q':462 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':467 [in Undecidability.TM.Single.StepTM]
Q':468 [in Undecidability.TM.Hoare.HoareRegister]
q':469 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q':47 [in Undecidability.TM.Univ.Univ]
q':471 [in Undecidability.TM.Single.StepTM]
q':476 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q':479 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Q':481 [in Undecidability.TM.Hoare.HoareRegister]
q':486 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q':487 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':49 [in Complexity.NP.SAT.CookLevin.Subproblems.TM_single]
Q':490 [in Undecidability.TM.Hoare.HoareRegister]
q':491 [in Undecidability.TM.Single.StepTM]
q':492 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q':497 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q':497 [in Undecidability.TM.Single.StepTM]
q':497 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Q':50 [in Undecidability.TM.Code.List.App]
Q':501 [in Undecidability.TM.Hoare.HoareRegister]
q':503 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q':507 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':508 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
Q':51 [in Undecidability.TM.Hoare.HoareCombinators]
q':513 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
Q':513 [in Undecidability.TM.Hoare.HoareRegister]
q':518 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q':524 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q':524 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':529 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q':531 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':534 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q':539 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q':54 [in Undecidability.TM.Univ.Univ]
Q':54 [in Undecidability.TM.Code.List.App]
q':540 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Q':543 [in Undecidability.TM.Hoare.HoareRegister]
q':545 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q':549 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':550 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q':556 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
Q':557 [in Undecidability.TM.Hoare.HoareRegister]
q':560 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q':565 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':566 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q':571 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q':573 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':579 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
Q':58 [in Undecidability.TM.Code.List.App]
q':583 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q':583 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':586 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q':590 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q':593 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q':593 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':596 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q':599 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q':6 [in Complexity.NP.SAT.CookLevin.Subproblems.TM_single]
q':603 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q':606 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q':609 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q':610 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':612 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q':616 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q':617 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':619 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
Q':62 [in Undecidability.TM.Code.List.App]
q':627 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':637 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':65 [in Undecidability.TM.Univ.Univ]
q':653 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':660 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':664 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q':669 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q':67 [in Complexity.L.TM.TMflatten]
q':670 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':678 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q':680 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':684 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
Q':69 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
q':696 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':703 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':713 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Q':72 [in Undecidability.TM.Hoare.HoareCombinators]
q':723 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':73 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
q':73 [in Undecidability.TM.Univ.Univ]
q':739 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':748 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':757 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':787 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':790 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':793 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':799 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':8 [in Undecidability.TM.Combinators.Mirror]
q':808 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':81 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
q':817 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':847 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':850 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':853 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':859 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Q':86 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
q':868 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':877 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':907 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':910 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':913 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':919 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':927 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':935 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Q':95 [in Undecidability.TM.Hoare.HoareCombinators]
q':964 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':966 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':968 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':97 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
q':973 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':981 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q':989 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q0:2095 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q0:2106 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q0:2117 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q0:2128 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q0:2139 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q0:2150 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q0:2161 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q0:2171 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q0:2181 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q0:2191 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q0:2201 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q0:2211 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Q0:499 [in Undecidability.TM.Hoare.HoareRegister]
Q0:511 [in Undecidability.TM.Hoare.HoareRegister]
Q0:522 [in Undecidability.TM.Hoare.HoareRegister]
Q0:532 [in Undecidability.TM.Hoare.HoareRegister]
Q0:541 [in Undecidability.TM.Hoare.HoareRegister]
Q0:555 [in Undecidability.TM.Hoare.HoareRegister]
Q0:568 [in Undecidability.TM.Hoare.HoareRegister]
Q0:580 [in Undecidability.TM.Hoare.HoareRegister]
q1:169 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
q1:172 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
Q1:173 [in Undecidability.TM.Hoare.HoareLogic]
Q1:197 [in Undecidability.TM.Hoare.HoareLogic]
Q1:208 [in Undecidability.TM.Hoare.HoareLogic]
Q1:220 [in Undecidability.TM.Hoare.HoareLogic]
Q1:310 [in Undecidability.TM.Hoare.HoareLogic]
Q1:400 [in Undecidability.TM.Hoare.HoareLogic]
q1:54 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
q1:57 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
q1:60 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
Q1:61 [in Undecidability.Shared.Libs.DLW.Code.subcode]
q2:170 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
q2:173 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
Q2:174 [in Undecidability.TM.Hoare.HoareLogic]
Q2:198 [in Undecidability.TM.Hoare.HoareLogic]
Q2:209 [in Undecidability.TM.Hoare.HoareLogic]
Q2:221 [in Undecidability.TM.Hoare.HoareLogic]
Q2:311 [in Undecidability.TM.Hoare.HoareLogic]
Q2:401 [in Undecidability.TM.Hoare.HoareLogic]
q2:55 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
q2:58 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
q2:61 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
Q2:62 [in Undecidability.Shared.Libs.DLW.Code.subcode]
q:10 [in Undecidability.TM.Combinators.While]
q:10 [in Undecidability.TM.Combinators.Switch]
q:10 [in Complexity.L.AbstractMachines.Computable.Unfolding]
Q:10 [in Undecidability.L.Computability.Decidability]
q:10 [in Complexity.NP.SAT.CookLevin.Subproblems.TM_single]
q:10 [in Undecidability.L.Computability.Acceptability]
Q:10 [in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
q:100 [in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
Q:100 [in Undecidability.TM.Hoare.HoareLogic]
q:100 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
q:100 [in Undecidability.TM.Univ.Univ]
q:1003 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:101 [in Undecidability.TM.Univ.LowLevel]
q:1010 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Q:102 [in Undecidability.TM.Hoare.HoareRegister]
q:102 [in Undecidability.Synthetic.ListEnumerabilityFacts]
q:102 [in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
q:102 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
q:1026 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:103 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
q:1034 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Q:104 [in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
q:104 [in Complexity.L.AbstractMachines.AbstractHeapMachine]
Q:104 [in Undecidability.TM.Hoare.HoareExamples]
q:1042 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:105 [in Undecidability.TM.Univ.LowLevel]
Q:105 [in Complexity.Complexity.NP]
q:1050 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:1057 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Q:106 [in Undecidability.TM.Hoare.HoareCombinators]
q:106 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
q:1064 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:107 [in Complexity.L.AbstractMachines.AbstractHeapMachine]
q:108 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
q:108 [in Undecidability.TM.Univ.LowLevel]
q:108 [in Undecidability.TM.Univ.Univ]
q:1080 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:1088 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Q:109 [in Undecidability.TM.Hoare.HoareRegister]
q:109 [in Undecidability.TM.Lifting.LiftTapes]
q:109 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
q:1096 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Q:11 [in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
q:11 [in Undecidability.Shared.Libs.DLW.Vec.pos]
Q:110 [in Undecidability.Shared.Libs.DLW.Utils.fin_base]
q:1104 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:1111 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:1118 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:112 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
q:112 [in Undecidability.TM.Univ.LowLevel]
Q:113 [in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
Q:113 [in Undecidability.TM.Hoare.HoareLogic]
q:1134 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:1142 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:115 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
q:1150 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:1158 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:116 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
q:116 [in Undecidability.TM.Univ.Univ]
q:1165 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:117 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
q:1172 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:118 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
q:118 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
Q:118 [in Complexity.Complexity.NP]
q:1188 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:119 [in Undecidability.TM.Univ.LowLevel]
q:1196 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:12 [in Undecidability.TM.Combinators.Combinators]
Q:12 [in Complexity.L.AbstractMachines.AbstractSubstMachine]
q:12 [in Undecidability.L.Computability.Acceptability]
q:12 [in Undecidability.TM.Combinators.StateWhile]
Q:12 [in Undecidability.Shared.Libs.DLW.Code.subcode]
q:12 [in Undecidability.TM.Univ.Univ]
q:120 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
q:1204 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Q:121 [in Undecidability.TM.Hoare.HoareCombinators]
q:1212 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:1219 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:122 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
q:122 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
q:1226 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Q:124 [in Undecidability.TM.Hoare.HoareLogic]
q:1242 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:1249 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Q:125 [in Undecidability.TM.Hoare.HoareRegister]
q:125 [in Undecidability.TM.Univ.Univ]
q:1256 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:126 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
q:126 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
q:1263 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:127 [in Complexity.TM.PrettyBounds.UnivBounds]
q:127 [in Undecidability.TM.Univ.LowLevel]
q:1270 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:1277 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Q:128 [in Undecidability.Shared.Libs.DLW.Code.sss]
q:1287 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:129 [in Undecidability.TM.Univ.LowLevel]
q:129 [in Undecidability.TM.Univ.Univ]
q:1294 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Q:13 [in Undecidability.Shared.Libs.DLW.Utils.fin_dec]
Q:13 [in Undecidability.L.Computability.Decidability]
Q:13 [in Undecidability.Synthetic.InformativeDefinitions]
q:130 [in Complexity.TM.PrettyBounds.UnivBounds]
Q:130 [in Undecidability.TM.Hoare.HoareCombinators]
q:130 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
q:1301 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:1308 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:1315 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Q:132 [in Undecidability.Shared.Libs.DLW.Code.sss]
q:1322 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:133 [in Undecidability.TM.Univ.Univ]
q:1332 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:1339 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:134 [in Undecidability.Shared.Libs.DLW.Utils.sorting]
q:134 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
q:1346 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Q:135 [in Undecidability.TM.Hoare.HoareLogic]
q:1353 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:1360 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:1367 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:137 [in Undecidability.TM.Univ.Univ]
Q:137 [in Complexity.Complexity.NP]
Q:137 [in Undecidability.Shared.Libs.DLW.Code.sss]
q:1377 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:138 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
q:1381 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:1386 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:139 [in Complexity.TM.PrettyBounds.UnivBounds]
q:139 [in Undecidability.TM.Univ.LowLevel]
q:139 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
q:1394 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:14 [in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
q:14 [in Undecidability.Shared.Libs.DLW.Vec.pos]
Q:140 [in Undecidability.TM.Hoare.HoareCombinators]
q:140 [in Undecidability.Shared.Libs.DLW.Vec.pos]
q:1402 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Q:141 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
q:141 [in Undecidability.TM.Univ.Univ]
Q:141 [in Undecidability.Shared.Libs.DLW.Code.sss]
q:1418 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:142 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
q:1422 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:1427 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Q:143 [in Complexity.Complexity.NP]
q:1433 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Q:144 [in Undecidability.TM.Hoare.HoareLogic]
q:1441 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:1449 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:145 [in Undecidability.TM.Univ.Univ]
Q:145 [in Undecidability.Shared.Libs.DLW.Code.sss]
q:146 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
q:1469 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:1474 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:148 [in Undecidability.TM.Univ.LowLevel]
q:148 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
q:1480 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:1488 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Q:149 [in Undecidability.TM.Hoare.HoareCombinators]
q:149 [in Undecidability.TM.Univ.Univ]
q:1496 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:15 [in Undecidability.Shared.Libs.DLW.Utils.crt]
q:15 [in Complexity.NP.SAT.CookLevin.Subproblems.TM_single]
Q:15 [in Undecidability.L.Computability.Acceptability]
q:15 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
q:150 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
q:150 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
Q:151 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
q:1514 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:1518 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:152 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
q:1523 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:153 [in Complexity.TM.PrettyBounds.UnivBounds]
q:153 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
q:153 [in Undecidability.TM.Univ.Univ]
q:1531 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:1539 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:154 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
Q:155 [in Undecidability.TM.Hoare.HoareRegister]
q:1555 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:1559 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:156 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
q:156 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
q:1564 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:157 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
q:157 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
q:157 [in Undecidability.TM.Univ.Univ]
q:1570 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:1578 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:158 [in Complexity.TM.PrettyBounds.UnivBounds]
q:1586 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:159 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
Q:16 [in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
q:16 [in Undecidability.TM.Combinators.StateWhile]
Q:16 [in Undecidability.TM.Hoare.HoareCombinators]
q:16 [in Undecidability.TM.Univ.Univ]
q:1606 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:161 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
q:161 [in Undecidability.TM.Univ.Univ]
Q:161 [in Undecidability.Shared.Libs.DLW.Code.sss]
q:1611 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:1616 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:162 [in Complexity.TM.PrettyBounds.UnivBounds]
q:1624 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:163 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
q:1632 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:164 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
q:1649 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:165 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
q:1653 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:1657 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:166 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
q:1665 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:167 [in Complexity.TM.PrettyBounds.UnivBounds]
q:167 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
q:167 [in Undecidability.Shared.Libs.DLW.Vec.pos]
q:1673 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Q:168 [in Undecidability.TM.Hoare.HoareCombinators]
q:1688 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:169 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
q:169 [in Undecidability.Shared.Libs.DLW.Vec.pos]
q:169 [in Undecidability.TM.Univ.Univ]
q:1693 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:1696 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:17 [in Undecidability.TM.Basic.Mono]
q:17 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
Q:17 [in Undecidability.TM.Hoare.HoareLogic]
q:1704 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:171 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
q:171 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
q:1712 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:172 [in Complexity.TM.PrettyBounds.UnivBounds]
q:172 [in Undecidability.Shared.Libs.DLW.Vec.pos]
q:1727 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:173 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
q:1732 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:1735 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:174 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
q:1743 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:175 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
q:1751 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:176 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
q:1766 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:1773 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:1780 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:1787 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Q:179 [in Undecidability.TM.Hoare.HoareRegister]
q:1794 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:18 [in Undecidability.TM.Combinators.Switch]
Q:18 [in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
q:18 [in Complexity.NP.SAT.CookLevin.Subproblems.TM_single]
Q:18 [in Undecidability.L.Tactics.ComputableTactics]
q:18 [in Undecidability.Synthetic.ReducibilityFacts]
q:180 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
q:1801 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Q:181 [in Undecidability.TM.Hoare.HoareCombinators]
q:1814 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:182 [in Undecidability.TM.Univ.Univ]
q:1821 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:1828 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:183 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
q:1835 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:1842 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:1849 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:186 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
q:186 [in Undecidability.Shared.Libs.DLW.Code.sss]
q:1862 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:1869 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:1876 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:1883 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:1890 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:1897 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Q:19 [in Undecidability.L.AbstractMachines.FlatPro.Programs]
q:19 [in Undecidability.Synthetic.MoreEnumerabilityFacts]
q:19 [in Undecidability.TM.Combinators.StateWhile]
Q:19 [in Complexity.L.AbstractMachines.FunctionalDefinitions]
q:19 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
Q:191 [in Undecidability.TM.Hoare.HoareLogic]
q:191 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
q:1910 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:1917 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:1924 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:193 [in Undecidability.Shared.Libs.DLW.Utils.sums]
Q:193 [in Undecidability.TM.Hoare.HoareCombinators]
q:1931 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:1938 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:1945 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:1955 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:196 [in Undecidability.Shared.Libs.DLW.Utils.sums]
q:1962 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:1969 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:1976 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:199 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
q:199 [in Undecidability.Shared.Libs.DLW.Code.sss]
q:2 [in Undecidability.Shared.Libs.DLW.Utils.prime]
Q:2 [in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
Q:20 [in Undecidability.Shared.Libs.DLW.Utils.fin_dec]
Q:20 [in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
q:20 [in Undecidability.TM.Combinators.Switch]
q:200 [in Undecidability.Shared.Libs.DLW.Utils.sums]
q:2002 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:2003 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:2004 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:2005 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:2006 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Q:202 [in Undecidability.TM.Hoare.HoareCombinators]
q:2038 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:205 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
q:206 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
q:207 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
q:2070 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:209 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
q:2094 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Q:21 [in Undecidability.Shared.Dec]
Q:210 [in Undecidability.Shared.Libs.DLW.Code.sss]
q:2105 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:211 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
q:2116 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:2127 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:213 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
q:2138 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:214 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
q:2149 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:215 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
q:216 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
q:2160 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:2170 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Q:218 [in Undecidability.TM.Hoare.HoareCombinators]
Q:218 [in Undecidability.Shared.Libs.DLW.Code.sss]
q:2180 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:219 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
q:2190 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Q:22 [in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
q:220 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
q:2200 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:2210 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:222 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
q:222 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
q:2222 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:2231 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:224 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
q:2240 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:2249 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:225 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
q:225 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
q:2258 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:226 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
q:2267 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Q:227 [in Undecidability.Shared.Libs.DLW.Code.sss]
q:2276 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:228 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
q:2285 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Q:229 [in Undecidability.TM.Hoare.HoareRegister]
q:2294 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:23 [in Undecidability.Shared.FilterFacts]
q:23 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
q:23 [in Undecidability.Shared.Libs.PSL.Lists.Filter]
q:23 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
q:23 [in Undecidability.TM.Univ.Univ]
q:2303 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:231 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
Q:231 [in Undecidability.TM.Hoare.HoareLogic]
q:2311 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:2319 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:2327 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:233 [in Undecidability.Shared.Libs.DLW.Code.sss]
q:2335 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:234 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
q:2343 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Q:235 [in Undecidability.Shared.Libs.DLW.Code.sss]
q:2351 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:2359 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:236 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
Q:236 [in Undecidability.TM.Hoare.HoareCombinators]
q:2367 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:2375 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:238 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
q:2383 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Q:239 [in Undecidability.TM.Hoare.HoareRegister]
Q:239 [in Undecidability.TM.Hoare.HoareLogic]
Q:239 [in Undecidability.Shared.Libs.DLW.Code.sss]
q:2391 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:2399 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:24 [in Undecidability.Shared.Libs.DLW.Utils.prime]
Q:24 [in Undecidability.Shared.Libs.DLW.Utils.fin_base]
q:24 [in Undecidability.TM.TM]
Q:24 [in Undecidability.L.Tactics.ComputableTactics]
Q:24 [in Undecidability.Shared.Libs.DLW.Code.subcode]
q:24 [in Undecidability.Synthetic.ReducibilityFacts]
q:2407 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:241 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
q:2415 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:242 [in Undecidability.L.Tactics.Extract]
q:242 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
q:2423 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:2431 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:2439 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:244 [in Undecidability.Shared.Libs.DLW.Code.sss]
q:2447 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:2454 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:246 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
q:2461 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:2468 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:2475 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:2482 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:2489 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Q:249 [in Undecidability.TM.Hoare.HoareLogic]
Q:249 [in Undecidability.TM.Hoare.HoareCombinators]
q:249 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
q:2496 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:25 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
Q:25 [in Undecidability.L.Computability.Decidability]
Q:25 [in Undecidability.TM.L.HeapInterpreter.StepTM]
Q:25 [in Undecidability.TM.Hoare.HoareLogic]
Q:250 [in Undecidability.Shared.Libs.DLW.Code.sss]
q:2503 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:2512 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:2517 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:2522 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:253 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
q:2535 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:2539 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:255 [in Complexity.TM.PrettyBounds.M2MBounds]
Q:255 [in Undecidability.TM.Hoare.HoareRegister]
q:255 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
q:258 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
q:2592 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:2599 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:26 [in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
Q:26 [in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
Q:26 [in Complexity.Complexity.Definitions]
Q:26 [in Complexity.L.AbstractMachines.FunctionalDefinitions]
Q:26 [in Undecidability.Shared.Libs.DLW.Code.subcode]
Q:260 [in Undecidability.TM.Hoare.HoareLogic]
Q:260 [in Undecidability.Shared.Libs.DLW.Code.sss]
Q:261 [in Undecidability.TM.Hoare.HoareCombinators]
q:2615 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:2616 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:2617 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:2618 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:2619 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:2620 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:2621 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:2622 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:2623 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:2630 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:2639 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:264 [in Complexity.TM.PrettyBounds.M2MBounds]
Q:267 [in Undecidability.TM.Hoare.HoareRegister]
q:269 [in Complexity.TM.PrettyBounds.M2MBounds]
Q:27 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
q:27 [in Undecidability.Shared.FilterFacts]
q:27 [in Undecidability.Shared.Libs.PSL.Lists.Filter]
Q:27 [in Undecidability.L.Computability.Decidability]
Q:27 [in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
q:27 [in Undecidability.TM.SBTM]
Q:27 [in Undecidability.TM.Hoare.HoareCombinators]
Q:270 [in Undecidability.TM.Hoare.HoareLogic]
Q:271 [in Undecidability.TM.Hoare.HoareCombinators]
q:2713 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:2720 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:2726 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:2732 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:2738 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:274 [in Undecidability.Shared.Libs.DLW.Code.sss]
q:2742 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:2750 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:2756 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Q:276 [in Undecidability.Shared.Libs.DLW.Code.sss]
q:2765 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:2767 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:277 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
q:2770 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:2776 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:279 [in Complexity.TM.PrettyBounds.M2MBounds]
Q:28 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
Q:28 [in Undecidability.Shared.Libs.DLW.Code.subcode]
q:28 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
Q:280 [in Undecidability.TM.Hoare.HoareLogic]
q:280 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
q:281 [in Undecidability.Shared.Libs.DLW.Code.sss]
Q:283 [in Undecidability.TM.Hoare.HoareRegister]
Q:284 [in Undecidability.TM.Hoare.HoareCombinators]
q:287 [in Complexity.TM.PrettyBounds.M2MBounds]
Q:287 [in Undecidability.TM.Hoare.HoareLogic]
q:288 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
q:289 [in Undecidability.Shared.Libs.DLW.Vec.vec]
q:29 [in Undecidability.Shared.Libs.DLW.Utils.prime]
q:29 [in Undecidability.TM.SBTM]
q:29 [in Undecidability.TM.Univ.Univ]
q:291 [in Undecidability.Shared.Libs.DLW.Vec.vec]
q:293 [in Undecidability.Shared.Libs.DLW.Vec.vec]
q:293 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
Q:294 [in Undecidability.TM.Hoare.HoareLogic]
q:295 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
Q:295 [in Undecidability.TM.Hoare.HoareRegister]
q:295 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
Q:3 [in Undecidability.Shared.Libs.DLW.Utils.fin_dec]
q:3 [in Undecidability.TM.Basic.Null]
q:3 [in Complexity.L.AbstractMachines.UnfoldTailRec]
Q:3 [in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
Q:30 [in Undecidability.Shared.Libs.PSL.EqDec]
Q:30 [in Undecidability.TM.L.HeapInterpreter.StepTM]
q:30 [in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
Q:30 [in Undecidability.Shared.Libs.DLW.Code.subcode]
Q:300 [in Undecidability.TM.Hoare.HoareCombinators]
q:301 [in Complexity.TM.PrettyBounds.M2MBounds]
Q:303 [in Undecidability.TM.Hoare.HoareLogic]
q:309 [in Complexity.TM.PrettyBounds.M2MBounds]
q:31 [in Undecidability.Shared.FilterFacts]
Q:31 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
q:31 [in Undecidability.Shared.Libs.PSL.Lists.Filter]
Q:31 [in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
q:31 [in Complexity.NP.SAT.CookLevin.Subproblems.TM_single]
Q:31 [in Undecidability.TM.Hoare.HoareLogic]
Q:311 [in Undecidability.Shared.Libs.DLW.Code.sss]
Q:316 [in Undecidability.TM.Hoare.HoareCombinators]
q:317 [in Complexity.TM.PrettyBounds.M2MBounds]
Q:320 [in Undecidability.TM.Hoare.HoareLogic]
q:3242 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:3246 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:3249 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Q:325 [in Undecidability.TM.Hoare.HoareRegister]
q:3255 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:3262 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:3266 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:3269 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:327 [in Complexity.TM.PrettyBounds.M2MBounds]
q:3272 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:3273 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:3277 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Q:328 [in Undecidability.TM.Hoare.HoareCombinators]
q:3287 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:3297 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Q:33 [in Undecidability.Synthetic.Definitions]
Q:33 [in Complexity.L.AbstractMachines.FunctionalDefinitions]
Q:33 [in Undecidability.Shared.Libs.DLW.Code.subcode]
q:3309 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Q:331 [in Undecidability.TM.Hoare.HoareLogic]
q:3319 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:3329 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:3341 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:335 [in Complexity.TM.PrettyBounds.M2MBounds]
q:3351 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Q:336 [in Undecidability.TM.Hoare.HoareRegister]
q:3361 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:337 [in Undecidability.Shared.Libs.DLW.Code.sss]
q:3373 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:3381 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:3389 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:3399 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Q:34 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
q:3407 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:3415 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:3425 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:343 [in Complexity.TM.PrettyBounds.M2MBounds]
Q:343 [in Undecidability.TM.Hoare.HoareLogic]
q:3433 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:3441 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:3451 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:3461 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:347 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:3471 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:3481 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:3490 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:3499 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:35 [in Undecidability.Shared.FilterFacts]
q:35 [in Undecidability.Shared.Libs.PSL.Lists.Filter]
Q:35 [in Complexity.Complexity.Subtypes]
q:35 [in Complexity.Complexity.ONotationIsAppropriate]
q:35 [in Complexity.NP.SAT.CookLevin.Subproblems.TM_single]
Q:35 [in Undecidability.TM.L.HeapInterpreter.StepTM]
q:35 [in Undecidability.Synthetic.DecidabilityFacts]
q:35 [in Undecidability.TM.Univ.Univ]
q:3508 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:3516 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:3524 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:3534 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:3539 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Q:354 [in Undecidability.TM.Hoare.HoareLogic]
q:3544 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:355 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:3551 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:3559 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Q:358 [in Undecidability.TM.Hoare.HoareRegister]
Q:36 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
Q:36 [in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
q:36 [in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
Q:36 [in Undecidability.Shared.Libs.DLW.Code.subcode]
Q:36 [in Undecidability.Shared.Libs.DLW.Code.sss]
q:3623 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:3625 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:3631 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:365 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:3657 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Q:366 [in Undecidability.TM.Hoare.HoareLogic]
q:3662 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:3663 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:3665 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:3681 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:3685 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Q:369 [in Undecidability.TM.Hoare.HoareCombinators]
q:3696 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:37 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
Q:37 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
q:3704 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Q:371 [in Undecidability.TM.Hoare.HoareRegister]
Q:374 [in Undecidability.TM.Hoare.HoareLogic]
q:375 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Q:38 [in Undecidability.Synthetic.Definitions]
Q:38 [in Complexity.L.AbstractMachines.FunctionalDefinitions]
Q:38 [in Undecidability.TM.Hoare.HoareCombinators]
Q:382 [in Undecidability.TM.Hoare.HoareLogic]
Q:386 [in Undecidability.TM.Hoare.HoareRegister]
Q:388 [in Undecidability.TM.Hoare.HoareCombinators]
q:39 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
Q:39 [in Undecidability.Shared.Libs.DLW.Code.subcode]
q:392 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Q:392 [in Undecidability.TM.Hoare.HoareLogic]
q:398 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q:399 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:4 [in Complexity.NP.SAT.CookLevin.Subproblems.TM_single]
Q:40 [in Undecidability.TM.L.HeapInterpreter.StepTM]
q:40 [in Undecidability.TM.Univ.Univ]
Q:400 [in Undecidability.TM.Hoare.HoareRegister]
q:402 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q:407 [in Undecidability.TM.Util.TM_facts]
q:408 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:41 [in Undecidability.Synthetic.DecidabilityFacts]
q:410 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q:415 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q:417 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:418 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
Q:418 [in Undecidability.TM.Hoare.HoareRegister]
q:42 [in Undecidability.TM.SBTM]
q:42 [in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
q:425 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q:43 [in Undecidability.L.Datatypes.LNat]
q:433 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:44 [in Undecidability.TM.Lifting.LiftAlphabet]
Q:44 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
Q:44 [in Undecidability.Shared.Libs.DLW.Utils.fin_base]
Q:44 [in Undecidability.TM.Hoare.HoareLogic]
q:44 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
q:44 [in Undecidability.TM.Univ.Univ]
q:441 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
q:441 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:444 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
Q:45 [in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
q:451 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:454 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q:455 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
Q:455 [in Undecidability.TM.Hoare.HoareCombinators]
q:460 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q:460 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
q:461 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:465 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
Q:466 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
q:468 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
Q:469 [in Undecidability.TM.Hoare.HoareRegister]
Q:47 [in Complexity.Complexity.Subtypes]
q:47 [in Complexity.NP.SAT.CookLevin.Subproblems.TM_single]
q:47 [in Undecidability.TM.SBTM]
q:47 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
q:475 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q:476 [in Undecidability.TM.Single.StepTM]
q:478 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:48 [in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
Q:48 [in Complexity.L.AbstractMachines.AbstractSubstMachine]
q:48 [in Undecidability.Synthetic.ReducibilityFacts]
Q:482 [in Undecidability.TM.Hoare.HoareRegister]
q:485 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q:485 [in Undecidability.TM.Single.StepTM]
q:486 [in Undecidability.TM.Single.StepTM]
q:486 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Q:49 [in Undecidability.TM.Code.List.App]
q:491 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
Q:491 [in Undecidability.TM.Hoare.HoareRegister]
q:493 [in Undecidability.TM.Single.StepTM]
q:496 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q:496 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:499 [in Undecidability.TM.Single.StepTM]
q:5 [in Undecidability.Synthetic.MoreEnumerabilityFacts]
q:50 [in Undecidability.Shared.Libs.DLW.Utils.prime]
Q:50 [in Undecidability.TM.Hoare.HoareCombinators]
Q:500 [in Undecidability.TM.Hoare.HoareRegister]
q:502 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q:505 [in Undecidability.TM.Single.StepTM]
q:506 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:507 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q:51 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
Q:51 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
q:512 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
Q:512 [in Undecidability.TM.Hoare.HoareRegister]
q:517 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q:52 [in Undecidability.TM.Univ.Univ]
q:52 [in Undecidability.Synthetic.ReducibilityFacts]
q:523 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
Q:523 [in Undecidability.TM.Hoare.HoareRegister]
q:523 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:528 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q:53 [in Undecidability.Shared.Libs.DLW.Utils.prime]
Q:53 [in Undecidability.TM.Hoare.HoareLogic]
Q:53 [in Undecidability.TM.Code.List.App]
q:530 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:533 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
Q:533 [in Undecidability.TM.Hoare.HoareRegister]
q:538 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q:539 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:54 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
Q:542 [in Undecidability.TM.Hoare.HoareRegister]
q:544 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q:548 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:549 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q:555 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
Q:556 [in Undecidability.TM.Hoare.HoareRegister]
q:559 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q:56 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:56 [in Undecidability.Synthetic.ReducibilityFacts]
q:564 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:565 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
Q:569 [in Undecidability.TM.Hoare.HoareRegister]
Q:57 [in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
q:57 [in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
Q:57 [in Undecidability.TM.Code.List.App]
q:570 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q:572 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:578 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
Q:58 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
Q:58 [in Undecidability.TM.Hoare.HoareRegister]
Q:581 [in Undecidability.TM.Hoare.HoareRegister]
q:582 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q:582 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:585 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q:589 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
Q:59 [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
q:592 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q:592 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:595 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q:598 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q:6 [in Undecidability.TM.Combinators.While]
q:6 [in Undecidability.Synthetic.Undecidability]
Q:60 [in Complexity.Complexity.Subtypes]
Q:60 [in Undecidability.TM.Hoare.HoareLogic]
Q:60 [in Undecidability.TM.Hoare.HoareCombinators]
q:602 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q:605 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q:608 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q:609 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Q:61 [in Undecidability.Shared.Libs.DLW.Utils.fin_base]
q:61 [in Undecidability.TM.Univ.Univ]
Q:61 [in Undecidability.TM.Code.List.App]
q:611 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q:615 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q:616 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:618 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
Q:62 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
q:624 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q:626 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Q:63 [in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
q:63 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
q:630 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q:634 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q:636 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:64 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
q:640 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
Q:65 [in Undecidability.TM.L.HeapInterpreter.StepTM]
q:65 [in Complexity.L.TM.TMflatten]
q:652 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:654 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q:658 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q:659 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:66 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
q:662 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q:667 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q:669 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Q:67 [in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
Q:67 [in Undecidability.TM.Hoare.HoareLogic]
Q:67 [in Undecidability.Shared.Libs.DLW.Code.subcode]
q:673 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q:676 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q:679 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Q:68 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
q:68 [in Undecidability.Shared.Libs.DLW.Vec.vec]
q:682 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q:689 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q:69 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:69 [in Undecidability.TM.Univ.Univ]
q:695 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:697 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
Q:7 [in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
Q:7 [in Undecidability.TM.Hoare.HoareLogic]
Q:70 [in Undecidability.Shared.Libs.DLW.Utils.fin_base]
q:70 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
q:701 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q:702 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:704 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q:706 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q:709 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
Q:71 [in Undecidability.TM.Hoare.HoareRegister]
Q:71 [in Undecidability.TM.Hoare.HoareCombinators]
q:712 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:713 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q:718 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q:72 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
Q:72 [in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
Q:72 [in Undecidability.TM.Hoare.HoareLogic]
q:720 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q:722 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q:722 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:724 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q:727 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q:729 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q:73 [in Undecidability.Shared.Libs.DLW.Vec.vec]
q:73 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:73 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
q:730 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q:733 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q:736 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q:738 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:739 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q:742 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q:744 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q:746 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q:747 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:749 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
Q:75 [in Undecidability.TM.Hoare.HoareRegister]
q:754 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q:756 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q:756 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:76 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:76 [in Undecidability.TM.Univ.Univ]
q:760 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q:761 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q:765 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q:765 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:767 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q:77 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
Q:77 [in Complexity.Complexity.NP]
q:770 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q:772 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:774 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q:779 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Q:78 [in Undecidability.TM.Hoare.HoareLogic]
q:79 [in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
q:798 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:8 [in Undecidability.TM.Combinators.While]
Q:8 [in Complexity.L.AbstractMachines.AbstractSubstMachine]
q:8 [in Undecidability.TM.Combinators.StateWhile]
q:80 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
q:80 [in Undecidability.TM.Univ.Univ]
q:807 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:81 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
q:816 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Q:82 [in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
Q:82 [in Undecidability.TM.Hoare.HoareCombinators]
q:825 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Q:83 [in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
q:83 [in Undecidability.L.Computability.Synthetic]
q:832 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:839 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:84 [in Undecidability.TM.Univ.Univ]
Q:85 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
q:858 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:867 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:876 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:88 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
q:88 [in Undecidability.TM.Univ.Univ]
Q:88 [in Complexity.Complexity.NP]
q:885 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Q:89 [in Undecidability.TM.Hoare.HoareLogic]
q:892 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:899 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Q:9 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
Q:90 [in Undecidability.TM.Hoare.HoareRegister]
q:90 [in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
q:903 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q:905 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q:907 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q:909 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
q:91 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
q:918 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Q:92 [in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
q:92 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
q:92 [in Undecidability.TM.Univ.Univ]
q:926 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:934 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:94 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
Q:94 [in Undecidability.TM.Hoare.HoareCombinators]
q:942 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:949 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:95 [in Undecidability.TM.Univ.LowLevel]
q:95 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
q:956 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Q:96 [in Undecidability.TM.Hoare.HoareRegister]
q:96 [in Undecidability.TM.Univ.Univ]
q:972 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:980 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:988 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
q:99 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
q:996 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]

R

range:2 [in Undecidability.L.Complexity.GenericNary]
range:20 [in Undecidability.L.Complexity.GenericNary]
range:34 [in Undecidability.L.Complexity.GenericNary]
range:37 [in Undecidability.L.Complexity.GenericNary]
range:42 [in Undecidability.L.Complexity.GenericNary]
range:49 [in Undecidability.L.Complexity.GenericNary]
range:61 [in Undecidability.L.Complexity.GenericNary]
range:65 [in Undecidability.L.Complexity.GenericNary]
range:71 [in Undecidability.L.Complexity.GenericNary]
range:75 [in Undecidability.L.Complexity.GenericNary]
range:79 [in Undecidability.L.Complexity.GenericNary]
range:83 [in Undecidability.L.Complexity.GenericNary]
range:86 [in Undecidability.L.Complexity.GenericNary]
readSymbols:116 [in Undecidability.TM.Single.StepTM]
readSymbols:122 [in Undecidability.TM.Single.StepTM]
readSymbols:124 [in Undecidability.TM.Single.StepTM]
readSymbols:128 [in Undecidability.TM.Single.StepTM]
readSymbols:134 [in Undecidability.TM.Single.StepTM]
readSymbols:139 [in Undecidability.TM.Single.StepTM]
readSymbols:266 [in Undecidability.TM.Single.StepTM]
Realises_M_checkX:74 [in Complexity.TM.Code.Decode]
Realises_M_checkX:72 [in Complexity.TM.Code.Decode]
recvec:237 [in Undecidability.Shared.Libs.DLW.Vec.vec]
red:117 [in Undecidability.L.Tactics.Extract]
red:21 [in Undecidability.L.Tactics.Extract]
reflb:9 [in Undecidability.L.Complexity.UpToCNary]
regD:81 [in Complexity.Complexity.PolyTimeComputable]
regX:101 [in Complexity.Complexity.NP]
regX:115 [in Complexity.Complexity.NP]
regX:57 [in Complexity.NP.TM.LM_to_mTM]
regX:68 [in Complexity.NP.TM.LM_to_mTM]
regX:82 [in Complexity.Complexity.PolyTimeComputable]
regX:85 [in Complexity.NP.TM.LM_to_mTM]
regX:92 [in Complexity.Complexity.NP]
regY:102 [in Complexity.Complexity.NP]
regY:116 [in Complexity.Complexity.NP]
RegY:4 [in Complexity.Complexity.NP]
regY:58 [in Complexity.NP.TM.LM_to_mTM]
regY:86 [in Complexity.NP.TM.LM_to_mTM]
regZ:103 [in Complexity.Complexity.NP]
reg__sig:3 [in Complexity.NP.SAT.CookLevin]
reg_A:2 [in Complexity.L.Datatypes.LDepPair]
reg_sig:2 [in Undecidability.L.TM.TapeFuns]
reg_sig:11 [in Undecidability.L.TM.TMEncoding]
reg_sig:8 [in Undecidability.L.TM.TMEncoding]
reg__Y:66 [in Undecidability.L.Functions.FinTypeLookup]
reg__X:65 [in Undecidability.L.Functions.FinTypeLookup]
Reg__X:3 [in Complexity.Complexity.NP]
ren:47 [in Undecidability.TM.L.CompilerBoolFuns.Compiler]
ren:49 [in Undecidability.TM.L.CompilerBoolFuns.Compiler]
ren:51 [in Undecidability.TM.L.CompilerBoolFuns.Compiler]
res':10 [in Complexity.NP.TM.TMGenNP_fixed_mTM]
res2:30 [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
res:1 [in Complexity.L.AbstractMachines.Computable.Unfolding]
res:1 [in Undecidability.L.Functions.Size]
res:10 [in Undecidability.L.AbstractMachines.FlatPro.Programs]
res:10 [in Undecidability.L.Functions.Size]
res:101 [in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
res:105 [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
res:105 [in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
res:109 [in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
res:11 [in Complexity.L.AbstractMachines.FlatPro.Computable.Compile]
res:112 [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
res:118 [in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
res:12 [in Complexity.L.AbstractMachines.Computable.LargestVar]
res:12 [in Complexity.NP.TM.TMGenNP_fixed_mTM]
res:120 [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
res:123 [in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
res:127 [in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
res:128 [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
res:13 [in Complexity.L.AbstractMachines.Computable.Unfolding]
res:135 [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
res:14 [in Undecidability.TM.L.Transcode.Boollist_to_Enc]
res:14 [in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
res:14 [in Undecidability.L.AbstractMachines.FlatPro.UnfoldClos]
res:142 [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
res:17 [in Complexity.HierarchyTheorem.TimeHierarchyTheorem]
res:17 [in Undecidability.L.Functions.FinTypeLookup]
res:170 [in Undecidability.L.Tactics.Extract]
res:18 [in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
res:181 [in Undecidability.L.Tactics.Extract]
res:183 [in Undecidability.L.Tactics.Extract]
res:19 [in Undecidability.L.Datatypes.List.List_eqb]
res:19 [in Undecidability.L.Functions.Size]
res:195 [in Undecidability.L.Tactics.Extract]
res:2 [in Undecidability.L.AbstractMachines.FlatPro.UnfoldClos]
res:2 [in Complexity.L.AbstractMachines.FlatPro.Computable.Compile]
res:20 [in Complexity.L.AbstractMachines.Computable.Unfolding]
res:21 [in Undecidability.TM.L.Transcode.Boollist_to_Enc]
res:21 [in Complexity.L.AbstractMachines.UnfoldTailRec]
res:21 [in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
res:21 [in Complexity.L.AbstractMachines.Computable.LargestVar]
res:22 [in Undecidability.TM.L.Transcode.Enc_to_Boollist]
res:23 [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
res:23 [in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
res:24 [in Undecidability.L.Functions.Size]
res:26 [in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
res:26 [in Undecidability.TM.L.Transcode.Enc_to_Boollist]
res:26 [in Complexity.L.AbstractMachines.Computable.LargestVar]
res:29 [in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
res:29 [in Undecidability.TM.L.Transcode.Enc_to_Boollist]
res:29 [in Undecidability.L.Functions.Size]
res:3 [in Complexity.L.AbstractMachines.Computable.LargestVar]
res:30 [in Undecidability.L.Datatypes.List.List_basics]
res:30 [in Undecidability.TM.Code.CompareValue]
res:30 [in Complexity.NP.TM.TMGenNP_fixed_mTM]
res:31 [in Complexity.L.AbstractMachines.Computable.LargestVar]
res:32 [in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisUnfoldClos]
res:32 [in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
res:33 [in Undecidability.TM.L.Transcode.Boollist_to_Enc]
res:33 [in Undecidability.TM.L.Transcode.Enc_to_Boollist]
res:34 [in Undecidability.L.Functions.Size]
res:35 [in Complexity.L.AbstractMachines.UnfoldTailRec]
res:36 [in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
res:36 [in Complexity.L.AbstractMachines.Computable.LargestVar]
res:37 [in Undecidability.TM.L.Transcode.Enc_to_Boollist]
res:39 [in Undecidability.L.Functions.Size]
res:40 [in Undecidability.TM.L.Transcode.Enc_to_Boollist]
res:41 [in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
res:41 [in Complexity.L.AbstractMachines.Computable.LargestVar]
res:42 [in Undecidability.L.Datatypes.List.List_basics]
res:43 [in Complexity.L.AbstractMachines.Computable.EvalForTime]
res:43 [in Undecidability.TM.L.Transcode.Enc_to_Boollist]
res:44 [in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
res:44 [in Undecidability.L.Functions.Size]
res:45 [in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
res:46 [in Complexity.L.AbstractMachines.UnfoldTailRec]
res:46 [in Undecidability.TM.L.Transcode.Enc_to_Boollist]
res:46 [in Complexity.L.AbstractMachines.Computable.LargestVar]
res:47 [in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
res:48 [in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisUnfoldClos]
res:5 [in Complexity.L.AbstractMachines.UnfoldTailRec]
res:50 [in Undecidability.L.Tactics.ComputableDemo]
res:50 [in Undecidability.TM.L.Transcode.Enc_to_Boollist]
res:51 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
res:52 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
res:54 [in Undecidability.TM.L.Transcode.Enc_to_Boollist]
res:57 [in Undecidability.TM.L.Transcode.Enc_to_Boollist]
res:70 [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
res:72 [in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
res:75 [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
res:79 [in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
res:79 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
res:8 [in Undecidability.TM.L.Transcode.Enc_to_Boollist]
res:80 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
res:83 [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
res:83 [in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
res:9 [in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
res:91 [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
res:92 [in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
res:96 [in Complexity.TM.Single.DecodeTape]
res:96 [in Undecidability.TM.L.CompilerBoolFuns.Compiler]
res:97 [in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
res:98 [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
retrAB:61 [in Undecidability.Shared.Libs.PSL.Retracts]
retrAB:67 [in Undecidability.Shared.Libs.PSL.Retracts]
retr__Pro:3 [in Undecidability.TM.L.Transcode.Boollist_to_Enc]
retr__list:2 [in Undecidability.TM.L.Transcode.Boollist_to_Enc]
retr__bools:23 [in Complexity.TM.Code.DecodeList]
retr__list:3 [in Complexity.NP.TM.M_LM2TM]
retr__LAM:2 [in Complexity.NP.TM.M_LM2TM]
retr_pro:3 [in Undecidability.TM.L.Eval]
retr_eval:2 [in Undecidability.TM.L.Eval]
retr__Pro:3 [in Undecidability.TM.L.Transcode.Enc_to_Boollist]
retr__list:2 [in Undecidability.TM.L.Transcode.Enc_to_Boollist]
retr_bools:40 [in Undecidability.TM.L.CompilerBoolFuns.Compiler]
retr_pro:39 [in Undecidability.TM.L.CompilerBoolFuns.Compiler]
retr1:106 [in Undecidability.Shared.Libs.PSL.Retracts]
retr1:120 [in Undecidability.Shared.Libs.PSL.Retracts]
retr1:137 [in Undecidability.Shared.Libs.PSL.Retracts]
retr1:157 [in Undecidability.Shared.Libs.PSL.Retracts]
retr1:34 [in Undecidability.Shared.Libs.PSL.Retracts]
retr1:76 [in Undecidability.Shared.Libs.PSL.Retracts]
retr1:95 [in Undecidability.Shared.Libs.PSL.Retracts]
retr2:107 [in Undecidability.Shared.Libs.PSL.Retracts]
retr2:121 [in Undecidability.Shared.Libs.PSL.Retracts]
retr2:138 [in Undecidability.Shared.Libs.PSL.Retracts]
retr2:158 [in Undecidability.Shared.Libs.PSL.Retracts]
retr2:35 [in Undecidability.Shared.Libs.PSL.Retracts]
retr2:77 [in Undecidability.Shared.Libs.PSL.Retracts]
retr2:96 [in Undecidability.Shared.Libs.PSL.Retracts]
retr3:108 [in Undecidability.Shared.Libs.PSL.Retracts]
retr3:122 [in Undecidability.Shared.Libs.PSL.Retracts]
retr3:139 [in Undecidability.Shared.Libs.PSL.Retracts]
retr3:159 [in Undecidability.Shared.Libs.PSL.Retracts]
retr3:97 [in Undecidability.Shared.Libs.PSL.Retracts]
retr4:109 [in Undecidability.Shared.Libs.PSL.Retracts]
retr4:123 [in Undecidability.Shared.Libs.PSL.Retracts]
retr4:140 [in Undecidability.Shared.Libs.PSL.Retracts]
retr4:160 [in Undecidability.Shared.Libs.PSL.Retracts]
retr5:124 [in Undecidability.Shared.Libs.PSL.Retracts]
retr5:141 [in Undecidability.Shared.Libs.PSL.Retracts]
retr5:161 [in Undecidability.Shared.Libs.PSL.Retracts]
retr6:142 [in Undecidability.Shared.Libs.PSL.Retracts]
retr6:162 [in Undecidability.Shared.Libs.PSL.Retracts]
retr7:163 [in Undecidability.Shared.Libs.PSL.Retracts]
retr:136 [in Undecidability.TM.Code.Code]
retr:166 [in Undecidability.TM.Code.Code]
retr:44 [in Undecidability.Shared.Libs.PSL.Retracts]
retr:48 [in Undecidability.Shared.Libs.PSL.Retracts]
retr:52 [in Undecidability.Shared.Libs.PSL.Retracts]
revArg:164 [in Undecidability.L.Tactics.Extract]
revQ:5 [in Complexity.L.AbstractMachines.FunctionalDefinitions]
rhs:177 [in Undecidability.L.Tactics.Extract]
Rl:146 [in Undecidability.Shared.Libs.DLW.Utils.php]
rpr:16 [in Undecidability.Shared.Libs.DLW.Utils.quotient]
rr:246 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
rs':132 [in Undecidability.TM.Compound.MoveToSymbol]
rs':140 [in Undecidability.TM.Compound.MoveToSymbol]
rs':171 [in Undecidability.TM.Compound.MoveToSymbol]
rs':176 [in Undecidability.TM.Compound.MoveToSymbol]
rs':18 [in Undecidability.TM.Code.Copy]
rs':184 [in Undecidability.TM.Util.TM_facts]
rs':191 [in Undecidability.TM.Util.TM_facts]
rs':25 [in Undecidability.TM.Code.Copy]
rs':56 [in Undecidability.TM.Code.Copy]
rs':61 [in Undecidability.TM.Code.Copy]
rs':66 [in Undecidability.TM.Compound.Shift]
rs1:111 [in Undecidability.TM.Compound.Compare]
rs1:119 [in Undecidability.TM.Compound.Compare]
rs1:145 [in Undecidability.TM.Compound.Compare]
rs1:158 [in Undecidability.TM.Compound.Compare]
rs1:169 [in Undecidability.TM.Compound.Compare]
rs1:178 [in Undecidability.TM.Compound.Compare]
rs1:188 [in Undecidability.TM.Compound.Compare]
rs1:198 [in Undecidability.TM.Compound.Compare]
rs1:212 [in Undecidability.TM.Compound.Compare]
rs2:112 [in Undecidability.TM.Compound.Compare]
rs2:122 [in Undecidability.TM.Compound.Compare]
rs2:146 [in Undecidability.TM.Compound.Compare]
rs2:161 [in Undecidability.TM.Compound.Compare]
rs2:172 [in Undecidability.TM.Compound.Compare]
rs2:179 [in Undecidability.TM.Compound.Compare]
rs2:189 [in Undecidability.TM.Compound.Compare]
rs2:199 [in Undecidability.TM.Compound.Compare]
rs2:213 [in Undecidability.TM.Compound.Compare]
rs:1 [in Undecidability.TM.SBTM]
rs:100 [in Undecidability.TM.Util.TM_facts]
rs:118 [in Undecidability.TM.Compound.Shift]
rs:123 [in Undecidability.TM.Compound.Shift]
rs:13 [in Undecidability.TM.Code.CaseList]
rs:13 [in Undecidability.TM.Util.TM_facts]
rs:131 [in Undecidability.TM.Compound.MoveToSymbol]
rs:135 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
rs:138 [in Undecidability.TM.Compound.MoveToSymbol]
rs:140 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
rs:144 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
rs:148 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
rs:15 [in Complexity.TM.PrettyBounds.M2MBounds]
rs:153 [in Undecidability.TM.Compound.MoveToSymbol]
rs:155 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
rs:16 [in Undecidability.TM.Code.BinNumbers.PosPointers]
rs:16 [in Undecidability.TM.Code.Copy]
rs:161 [in Undecidability.TM.Compound.MoveToSymbol]
rs:161 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
rs:170 [in Undecidability.TM.Compound.MoveToSymbol]
rs:174 [in Undecidability.TM.Single.StepTM]
rs:174 [in Undecidability.TM.Compound.MoveToSymbol]
rs:181 [in Undecidability.TM.Single.StepTM]
rs:182 [in Undecidability.TM.Util.TM_facts]
rs:188 [in Undecidability.TM.Util.TM_facts]
rs:19 [in Complexity.TM.PrettyBounds.M2MBounds]
rs:191 [in Undecidability.TM.Compound.MoveToSymbol]
rs:196 [in Undecidability.TM.Compound.MoveToSymbol]
rs:20 [in Undecidability.TM.Code.BinNumbers.PosPointers]
rs:21 [in Undecidability.TM.Util.TM_facts]
rs:215 [in Undecidability.TM.Util.TM_facts]
rs:219 [in Undecidability.TM.Util.TM_facts]
rs:22 [in Undecidability.TM.Code.CaseList]
rs:222 [in Undecidability.TM.Util.TM_facts]
rs:223 [in Undecidability.TM.Util.TM_facts]
rs:226 [in Undecidability.TM.Util.TM_facts]
rs:23 [in Undecidability.TM.Code.Copy]
rs:231 [in Undecidability.TM.Util.TM_facts]
rs:233 [in Undecidability.TM.Util.TM_facts]
rs:236 [in Undecidability.TM.Util.TM_facts]
rs:24 [in Undecidability.TM.Util.TM_facts]
rs:2645 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
rs:280 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
rs:29 [in Undecidability.TM.Code.BinNumbers.PosPointers]
rs:294 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
rs:30 [in Undecidability.TM.Util.TM_facts]
rs:310 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
rs:36 [in Undecidability.TM.Code.Copy]
rs:365 [in Undecidability.TM.Single.StepTM]
rs:39 [in Undecidability.TM.Code.BinNumbers.PosPointers]
rs:4 [in Undecidability.TM.Code.BinNumbers.PosPointers]
rs:4 [in Undecidability.TM.Code.CodeTM]
rs:44 [in Undecidability.TM.Code.Copy]
rs:48 [in Undecidability.TM.Code.CaseList]
rs:5 [in Undecidability.TM.SBTM]
rs:54 [in Undecidability.TM.Code.CaseList]
rs:54 [in Undecidability.TM.Code.Copy]
rs:57 [in Undecidability.TM.Compound.Shift]
rs:59 [in Undecidability.TM.Code.Copy]
rs:61 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
rs:63 [in Undecidability.TM.Compound.Shift]
rs:68 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
rs:68 [in Undecidability.TM.Compound.Shift]
rs:70 [in Undecidability.TM.Code.Copy]
rs:71 [in Undecidability.TM.Compound.Shift]
rs:75 [in Undecidability.TM.Code.Copy]
rs:89 [in Undecidability.TM.Util.TM_facts]
rs:9 [in Undecidability.TM.Code.CodeTM]
rs:9 [in Undecidability.TM.SBTM]
ruleList:3254 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
ruleList:3261 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
rules:3175 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
rules:3193 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
rules:3218 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
rules:381 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
rules:384 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
rules:396 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
rules:459 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
rules:558 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
rules:564 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
rules:569 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
rules:575 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
rule:204 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
rule:3046 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
rule:3076 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
rule:3080 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
rule:3166 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
rule:3183 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
rule:3196 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
rule:3211 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
rule:3604 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
rule:3606 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
RX:23 [in Complexity.Complexity.Subtypes]
Rx:26 [in Undecidability.L.Tactics.ComputableDemo]
Rx:30 [in Undecidability.L.Tactics.ComputableDemo]
RX:31 [in Complexity.Complexity.Subtypes]
Rx:37 [in Undecidability.L.Tactics.ComputableDemo]
RX:43 [in Complexity.Complexity.Subtypes]
RX:55 [in Complexity.Complexity.Subtypes]
Rx:6 [in Undecidability.L.AbstractMachines.LargestVar]
RX:85 [in Complexity.Complexity.NP]
RY:24 [in Complexity.Complexity.Subtypes]
Ry:27 [in Undecidability.L.Tactics.ComputableDemo]
Ry:31 [in Undecidability.L.Tactics.ComputableDemo]
RY:32 [in Complexity.Complexity.Subtypes]
Ry:38 [in Undecidability.L.Tactics.ComputableDemo]
RY:44 [in Complexity.Complexity.Subtypes]
RY:56 [in Complexity.Complexity.Subtypes]
Ry:7 [in Undecidability.L.AbstractMachines.LargestVar]
RY:86 [in Complexity.Complexity.NP]
Ry:9 [in Undecidability.L.Computability.Computability]
RY:96 [in Complexity.Libs.CookPrelim.PolyBounds]
R__cert:13 [in Complexity.NP.L.CanEnumTerm_def]
R__cert:2 [in Complexity.NP.L.CanEnumTerm_def]
R__cert:2 [in Complexity.NP.L.GenNP_is_hard]
R__sig:3 [in Complexity.NP.TM.mTM_to_singleTapeTM]
R__X:12 [in Undecidability.L.Datatypes.Lists]
R__edgesComplete:66 [in Complexity.NP.Clique.FlatUGraph]
R__edgesSound:63 [in Complexity.NP.Clique.FlatUGraph]
R__Y:46 [in Complexity.L.TM.CompCode]
R__X:45 [in Complexity.L.TM.CompCode]
R__X:4 [in Complexity.NP.L.LMGenNP]
R__halt:47 [in Complexity.L.TM.TMflat]
R__trans:45 [in Complexity.L.TM.TMflat]
R__halt:35 [in Complexity.L.TM.TMflat]
R_complete:28 [in Complexity.L.TM.TMflat]
R__sound:23 [in Complexity.L.TM.TMflat]
R__R:60 [in Complexity.NP.TM.M_multi2mono]
R__L:57 [in Complexity.NP.TM.M_multi2mono]
R__X:2 [in Complexity.NP.TM.L_to_LM]
R__cert:2 [in Complexity.NP.L.GenNP]
R':111 [in Undecidability.L.Prelim.ARS]
R':144 [in Complexity.Libs.CookPrelim.MorePrelim]
r':183 [in Undecidability.TM.Util.TM_facts]
R':209 [in Undecidability.TM.Hoare.HoareRegister]
R':217 [in Undecidability.TM.Hoare.HoareRegister]
R':268 [in Undecidability.TM.Hoare.HoareRegister]
R':285 [in Undecidability.TM.Util.TM_facts]
R':296 [in Undecidability.TM.Hoare.HoareRegister]
R':315 [in Undecidability.TM.Util.TM_facts]
r':347 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
R':4 [in Complexity.NP.TM.LM_to_mTM]
R':401 [in Undecidability.TM.Hoare.HoareRegister]
R':419 [in Undecidability.TM.Hoare.HoareRegister]
R':453 [in Undecidability.TM.Hoare.HoareCombinators]
R':8 [in Complexity.NP.TM.LM_to_mTM]
R1:10 [in Undecidability.TM.Combinators.SequentialComposition]
r1:110 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
r1:119 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
R1:13 [in Undecidability.TM.Combinators.If]
r1:132 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
R1:135 [in Complexity.Libs.CookPrelim.MorePrelim]
r1:139 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
r1:146 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
r1:154 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
r1:155 [in Undecidability.TM.Util.TM_facts]
r1:159 [in Undecidability.TM.Util.TM_facts]
r1:162 [in Undecidability.TM.Util.TM_facts]
r1:164 [in Undecidability.TM.Compound.MoveToSymbol]
r1:170 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
r1:177 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
r1:180 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
r1:181 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
r1:184 [in Undecidability.TM.Compound.MoveToSymbol]
R1:19 [in Undecidability.TM.Combinators.SequentialComposition]
r1:231 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
r1:238 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
R1:24 [in Undecidability.TM.Combinators.If]
r1:262 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
R1:28 [in Undecidability.TM.Combinators.SequentialComposition]
r1:296 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
R1:327 [in Undecidability.TM.Util.TM_facts]
R1:353 [in Undecidability.TM.Util.TM_facts]
R1:36 [in Undecidability.TM.Combinators.If]
r1:48 [in Undecidability.TM.Code.CodeTM]
r1:49 [in Undecidability.TM.Code.Copy]
R1:50 [in Undecidability.TM.Combinators.Switch]
r1:52 [in Undecidability.TM.Code.CodeTM]
R1:54 [in Undecidability.TM.Combinators.Switch]
r1:55 [in Undecidability.TM.Code.CodeTM]
r1:59 [in Undecidability.TM.Code.CodeTM]
R1:6 [in Undecidability.L.Functions.Encoding]
r1:63 [in Undecidability.TM.Code.Copy]
R1:64 [in Undecidability.TM.Combinators.Switch]
R1:7 [in Undecidability.TM.Combinators.SequentialComposition]
R1:74 [in Undecidability.TM.Combinators.Switch]
R1:74 [in Undecidability.TM.Util.Relations]
R1:79 [in Undecidability.TM.Util.Relations]
R1:8 [in Undecidability.TM.Combinators.If]
R1:84 [in Undecidability.TM.Util.Relations]
r1:84 [in Undecidability.Shared.Libs.DLW.Vec.pos]
r1:85 [in Undecidability.TM.Util.TM_facts]
R1:90 [in Undecidability.TM.Util.Relations]
r1:96 [in Undecidability.TM.Util.TM_facts]
r1:99 [in Undecidability.Shared.Libs.DLW.Vec.pos]
r2:100 [in Undecidability.Shared.Libs.DLW.Vec.pos]
r2:111 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
r2:120 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
r2:133 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
R2:136 [in Complexity.Libs.CookPrelim.MorePrelim]
r2:140 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
r2:147 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
r2:152 [in Undecidability.TM.Util.TM_facts]
r2:155 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
r2:156 [in Undecidability.TM.Util.TM_facts]
r2:163 [in Undecidability.TM.Util.TM_facts]
r2:166 [in Undecidability.TM.Compound.MoveToSymbol]
r2:173 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
r2:179 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
r2:182 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
r2:183 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
r2:186 [in Undecidability.TM.Compound.MoveToSymbol]
r2:233 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
r2:239 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
r2:263 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
R2:29 [in Undecidability.TM.Combinators.SequentialComposition]
r2:298 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
R2:328 [in Undecidability.TM.Util.TM_facts]
R2:354 [in Undecidability.TM.Util.TM_facts]
R2:37 [in Undecidability.TM.Combinators.If]
R2:51 [in Undecidability.TM.Combinators.Switch]
r2:51 [in Undecidability.TM.Code.Copy]
r2:65 [in Undecidability.TM.Code.Copy]
R2:7 [in Undecidability.L.Functions.Encoding]
R2:75 [in Undecidability.TM.Combinators.Switch]
R2:75 [in Undecidability.TM.Util.Relations]
R2:8 [in Undecidability.TM.Combinators.SequentialComposition]
R2:80 [in Undecidability.TM.Util.Relations]
R2:85 [in Undecidability.TM.Util.Relations]
r2:85 [in Undecidability.Shared.Libs.DLW.Vec.pos]
r2:86 [in Undecidability.TM.Util.TM_facts]
R2:9 [in Undecidability.TM.Combinators.If]
R2:91 [in Undecidability.TM.Util.Relations]
r2:97 [in Undecidability.TM.Util.TM_facts]
R3:10 [in Undecidability.TM.Combinators.If]
R3:38 [in Undecidability.TM.Combinators.If]
R3:76 [in Undecidability.TM.Util.Relations]
R3:81 [in Undecidability.TM.Util.Relations]
R3:86 [in Undecidability.TM.Util.Relations]
R3:92 [in Undecidability.TM.Util.Relations]
R4:87 [in Undecidability.TM.Util.Relations]
R4:93 [in Undecidability.TM.Util.Relations]
r:1 [in Undecidability.TM.Code.BinNumbers.PosCompareTM]
R:10 [in Undecidability.L.Prelim.ARS]
R:10 [in Complexity.Complexity.NP]
R:100 [in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
r:100 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
R:100 [in Undecidability.TM.L.CompilerBoolFuns.Compiler]
R:101 [in Undecidability.TM.Hoare.HoareLogic]
R:103 [in Undecidability.L.Prelim.ARS]
R:103 [in Undecidability.TM.Util.Relations]
r:103 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
R:104 [in Undecidability.L.Prelim.ARS]
r:104 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
R:104 [in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
R:105 [in Undecidability.Shared.Libs.DLW.Utils.php]
R:106 [in Complexity.Complexity.NP]
R:107 [in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
R:107 [in Undecidability.TM.Hoare.HoareCombinators]
r:107 [in Undecidability.Shared.Libs.DLW.Vec.pos]
R:109 [in Undecidability.L.Prelim.ARS]
r:11 [in Undecidability.TM.Hoare.HoareRegister]
r:11 [in Undecidability.TM.L.CompilerBoolFuns.Compiler]
R:110 [in Undecidability.TM.Util.Relations]
R:110 [in Complexity.Libs.CookPrelim.MorePrelim]
r:111 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
R:113 [in Undecidability.Shared.Libs.DLW.Utils.php]
R:115 [in Undecidability.L.Prelim.ARS]
R:116 [in Undecidability.L.Prelim.ARS]
R:116 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
r:116 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
R:117 [in Undecidability.L.Prelim.ARS]
R:117 [in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
R:118 [in Undecidability.Shared.Libs.DLW.Utils.php]
r:118 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
R:119 [in Undecidability.L.Tactics.Computable]
R:119 [in Complexity.Libs.CookPrelim.MorePrelim]
R:12 [in Undecidability.TM.Lifting.LiftAlphabet]
R:12 [in Complexity.Complexity.Definitions]
R:122 [in Undecidability.TM.Hoare.HoareCombinators]
R:125 [in Undecidability.L.Prelim.ARS]
R:128 [in Complexity.Libs.CookPrelim.MorePrelim]
R:129 [in Undecidability.L.Prelim.ARS]
R:13 [in Undecidability.TM.Combinators.Combinators]
R:13 [in Undecidability.Shared.Libs.DLW.Utils.quotient]
R:13 [in Undecidability.Shared.Libs.DLW.Utils.fin_upto]
R:13 [in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
R:13 [in Complexity.L.AbstractMachines.AbstractSubstMachine]
R:13 [in Undecidability.TM.Util.Relations]
R:13 [in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
R:130 [in Undecidability.TM.Lifting.LiftTapes]
r:130 [in Complexity.NP.SAT.CookLevin.Subproblems.CC]
R:131 [in Undecidability.TM.Hoare.HoareCombinators]
r:131 [in Complexity.NP.SAT.CookLevin.Subproblems.CC]
R:132 [in Undecidability.Shared.Libs.DLW.Utils.php]
R:136 [in Undecidability.TM.Lifting.LiftTapes]
R:137 [in Undecidability.L.Tactics.Computable]
R:138 [in Undecidability.L.Prelim.ARS]
R:14 [in Undecidability.Shared.Libs.DLW.Utils.fin_quotient]
R:141 [in Undecidability.TM.Hoare.HoareCombinators]
R:143 [in Complexity.Libs.CookPrelim.MorePrelim]
R:144 [in Undecidability.L.Prelim.ARS]
r:144 [in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
R:145 [in Undecidability.TM.Hoare.HoareLogic]
r:149 [in Undecidability.L.Tactics.Extract]
R:15 [in Undecidability.TM.Combinators.Combinators]
R:15 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
R:15 [in Undecidability.L.Functions.Encoding]
R:150 [in Undecidability.L.Prelim.ARS]
R:150 [in Undecidability.TM.Hoare.HoareCombinators]
R:150 [in Undecidability.L.Tactics.Computable]
R:151 [in Complexity.Libs.CookPrelim.MorePrelim]
R:153 [in Undecidability.L.Prelim.ARS]
R:153 [in Undecidability.L.Tactics.ComputableTime]
R:155 [in Undecidability.Shared.Libs.DLW.Utils.php]
r:156 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
R:158 [in Undecidability.L.Prelim.ARS]
R:158 [in Complexity.Libs.CookPrelim.MorePrelim]
R:16 [in Undecidability.L.Prelim.ARS]
r:16 [in Undecidability.L.Util.L_facts]
r:16 [in Undecidability.Shared.Libs.DLW.Code.subcode]
r:16 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
r:160 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
r:162 [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
R:163 [in Complexity.Libs.CookPrelim.MorePrelim]
R:164 [in Undecidability.L.Tactics.ComputableTime]
R:165 [in Undecidability.L.Tactics.Extract]
r:166 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
R:169 [in Undecidability.TM.Hoare.HoareCombinators]
R:17 [in Undecidability.L.Prelim.LoopSum]
R:17 [in Undecidability.Shared.Libs.DLW.Utils.fin_upto]
r:173 [in Undecidability.TM.Single.StepTM]
r:176 [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
R:179 [in Undecidability.L.Tactics.Extract]
R:179 [in Undecidability.TM.Hoare.HoareLogic]
r:18 [in Complexity.TM.PrettyBounds.M2MBounds]
r:18 [in Undecidability.TM.Hoare.HoareRegister]
R:18 [in Complexity.Complexity.Definitions]
r:181 [in Undecidability.TM.Util.TM_facts]
R:182 [in Undecidability.TM.Hoare.HoareCombinators]
R:19 [in Undecidability.TM.Util.Relations]
r:19 [in Undecidability.Shared.Libs.DLW.Code.sss]
R:191 [in Undecidability.TM.Hoare.HoareRegister]
R:194 [in Undecidability.TM.Hoare.HoareCombinators]
R:195 [in Undecidability.L.Prelim.ARS]
R:199 [in Undecidability.L.Prelim.ARS]
R:199 [in Undecidability.TM.Hoare.HoareRegister]
R:2 [in Undecidability.Shared.Libs.DLW.Utils.fin_quotient]
R:2 [in Undecidability.TM.L.CompilerBoolFuns.LComp_to_TMComp]
R:2 [in Undecidability.Shared.Libs.DLW.Utils.quotient]
R:2 [in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
R:2 [in Complexity.Complexity.Definitions]
R:2 [in Undecidability.L.Tactics.Computable]
R:20 [in Undecidability.L.Prelim.ARS]
R:20 [in Undecidability.Shared.Libs.DLW.Utils.fin_quotient]
r:20 [in Undecidability.Shared.Libs.DLW.Utils.list_bool]
R:20 [in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
R:203 [in Undecidability.L.Prelim.ARS]
R:203 [in Undecidability.TM.Hoare.HoareCombinators]
R:205 [in Undecidability.L.Prelim.ARS]
R:207 [in Undecidability.L.Prelim.ARS]
R:208 [in Undecidability.TM.Hoare.HoareRegister]
r:21 [in Undecidability.Shared.Libs.DLW.Utils.utils_string]
R:21 [in Undecidability.L.Functions.Encoding]
R:210 [in Undecidability.L.Prelim.ARS]
R:216 [in Undecidability.TM.Hoare.HoareRegister]
R:218 [in Undecidability.L.Prelim.ARS]
R:219 [in Undecidability.TM.Hoare.HoareCombinators]
r:219 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
R:22 [in Complexity.L.AbstractMachines.FunctionalDefinitions]
R:22 [in Complexity.Complexity.NP]
R:225 [in Undecidability.L.Prelim.ARS]
R:229 [in Undecidability.L.Prelim.ARS]
r:229 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
r:23 [in Undecidability.L.Tactics.Extract]
R:232 [in Undecidability.L.Prelim.ARS]
R:237 [in Undecidability.TM.Hoare.HoareCombinators]
r:237 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
R:24 [in Complexity.Complexity.Definitions]
r:241 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
r:245 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
r:25 [in Undecidability.TM.Code.BinNumbers.PosCompareTM]
R:25 [in Undecidability.TM.Util.Relations]
R:250 [in Undecidability.TM.Hoare.HoareCombinators]
r:252 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
R:26 [in Undecidability.TM.Combinators.Combinators]
R:26 [in Undecidability.L.Prelim.ARS]
R:26 [in Undecidability.TM.Combinators.Mirror]
R:26 [in Undecidability.L.L]
R:262 [in Undecidability.TM.Hoare.HoareCombinators]
r:267 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
R:269 [in Undecidability.TM.Hoare.HoareRegister]
R:27 [in Undecidability.Shared.Libs.DLW.Utils.fin_quotient]
r:27 [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
R:27 [in Undecidability.L.Prelim.LoopSum]
R:272 [in Undecidability.TM.Hoare.HoareCombinators]
R:277 [in Undecidability.TM.Util.TM_facts]
R:28 [in Undecidability.TM.Combinators.Combinators]
r:28 [in Undecidability.Shared.Libs.DLW.Code.sss]
R:284 [in Undecidability.TM.Util.TM_facts]
R:285 [in Undecidability.TM.Hoare.HoareCombinators]
R:29 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
R:296 [in Undecidability.Shared.Libs.DLW.Vec.vec]
R:297 [in Undecidability.TM.Hoare.HoareRegister]
R:30 [in Undecidability.L.Prelim.ARS]
R:30 [in Undecidability.L.Tactics.ComputableTactics]
R:30 [in Complexity.Complexity.Definitions]
r:30 [in Complexity.TM.Single.DecodeTape]
R:301 [in Undecidability.TM.Hoare.HoareCombinators]
r:304 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
r:3044 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
r:305 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
R:307 [in Undecidability.TM.Util.TM_facts]
r:3074 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
r:309 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
r:31 [in Undecidability.TM.Code.BinNumbers.PosCompareTM]
R:31 [in Undecidability.TM.Combinators.Mirror]
R:31 [in Undecidability.L.Functions.EqBool]
r:312 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
R:314 [in Undecidability.TM.Util.TM_facts]
r:316 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
R:317 [in Undecidability.TM.Hoare.HoareCombinators]
R:32 [in Undecidability.L.Prelim.ARS]
R:32 [in Undecidability.TM.Util.Relations]
R:32 [in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
R:321 [in Undecidability.TM.Util.TM_facts]
r:3225 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
r:3226 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
r:3259 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
r:3264 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
r:3267 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
R:329 [in Undecidability.TM.Hoare.HoareCombinators]
r:33 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
R:33 [in Undecidability.Shared.Libs.DLW.Utils.fin_upto]
r:33 [in Undecidability.Shared.Libs.DLW.Utils.php]
R:33 [in Complexity.TM.Single.DecodeTapes]
R:33 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
r:334 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
R:334 [in Undecidability.TM.Util.TM_facts]
R:34 [in Undecidability.Shared.Libs.DLW.Code.subcode]
R:340 [in Undecidability.TM.Util.TM_facts]
r:341 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
r:343 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
R:346 [in Undecidability.TM.Util.TM_facts]
R:35 [in Undecidability.L.Prelim.ARS]
R:35 [in Complexity.Complexity.Definitions]
r:352 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
R:355 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
R:36 [in Undecidability.TM.Combinators.Mirror]
r:3602 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
R:363 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
r:3632 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
R:367 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
R:370 [in Undecidability.TM.Hoare.HoareCombinators]
R:371 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
R:378 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
R:38 [in Undecidability.L.Tactics.Lrewrite]
R:38 [in Undecidability.Shared.Libs.DLW.Utils.fin_upto]
r:38 [in Complexity.TM.Single.DecodeTape]
R:386 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
R:389 [in Undecidability.TM.Hoare.HoareCombinators]
R:39 [in Undecidability.L.Prelim.ARS]
R:39 [in Undecidability.L.Tactics.Computable]
R:394 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
R:4 [in Undecidability.TM.L.CompilerBoolFuns.LComp_to_TMComp]
R:4 [in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
R:4 [in Undecidability.L.Computability.Computability]
R:40 [in Undecidability.Shared.Libs.DLW.Utils.fin_quotient]
r:40 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
R:40 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_nat_facts]
R:40 [in Undecidability.TM.Util.Relations]
R:40 [in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
R:40 [in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
R:402 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
R:402 [in Undecidability.TM.Hoare.HoareRegister]
R:41 [in Complexity.Complexity.SpaceBoundsTime]
R:411 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
R:42 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
R:42 [in Complexity.Complexity.NP]
R:420 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
R:420 [in Undecidability.TM.Hoare.HoareRegister]
R:43 [in Undecidability.L.Functions.EqBool]
r:43 [in Complexity.TM.Single.DecodeTape]
R:430 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
R:438 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
R:44 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
r:44 [in Undecidability.Shared.Libs.DLW.Code.subcode]
R:45 [in Undecidability.L.Tactics.Lrewrite]
r:45 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_nat_facts]
R:456 [in Undecidability.TM.Hoare.HoareCombinators]
R:46 [in Undecidability.L.Prelim.ARS]
r:46 [in Undecidability.TM.Code.BinNumbers.PosCompareTM]
r:46 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_nat_facts]
r:47 [in Undecidability.L.Datatypes.List.List_basics]
R:47 [in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
R:48 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_nat_facts]
R:48 [in Undecidability.TM.Util.Relations]
r:48 [in Undecidability.Shared.Libs.DLW.Code.subcode]
R:49 [in Undecidability.L.Prelim.ARS]
R:50 [in Undecidability.L.Functions.EqBool]
R:51 [in Undecidability.Shared.Libs.DLW.Utils.fin_quotient]
r:52 [in Undecidability.L.Datatypes.List.List_basics]
R:52 [in Undecidability.L.Functions.UnboundIteration]
r:52 [in Undecidability.Shared.Libs.DLW.Code.subcode]
R:55 [in Undecidability.L.Prelim.ARS]
R:55 [in Undecidability.TM.Util.Relations]
R:56 [in Undecidability.L.Prelim.ARS]
R:56 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
r:562 [in Complexity.NP.TM.LM_to_mTM]
R:57 [in Undecidability.L.Prelim.ARS]
R:57 [in Undecidability.TM.Lifting.LiftAlphabet]
R:58 [in Undecidability.L.Prelim.ARS]
R:58 [in Undecidability.L.Tactics.ComputableTime]
r:58 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
r:58 [in Undecidability.TM.Compound.Shift]
r:59 [in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
R:590 [in Complexity.NP.TM.LM_to_mTM]
R:594 [in Complexity.NP.TM.LM_to_mTM]
R:6 [in Undecidability.TM.Util.Relations]
R:60 [in Undecidability.TM.Util.Relations]
R:61 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
R:61 [in Undecidability.L.Tactics.Computable]
R:62 [in Undecidability.L.Prelim.ARS]
R:63 [in Undecidability.TM.Lifting.LiftAlphabet]
r:64 [in Undecidability.TM.Compound.Shift]
R:66 [in Undecidability.L.Prelim.ARS]
R:66 [in Undecidability.Shared.Libs.DLW.Utils.quotient]
R:66 [in Undecidability.TM.Util.Relations]
r:67 [in Undecidability.TM.Code.BinNumbers.PosCompareTM]
r:68 [in Undecidability.TM.Code.BinNumbers.PosCompareTM]
R:69 [in Undecidability.Shared.Libs.DLW.Utils.quotient]
r:7 [in Undecidability.TM.Hoare.HoareRegister]
R:70 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
r:71 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
r:71 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
R:73 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
r:73 [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
r:74 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
r:75 [in Undecidability.Shared.Libs.DLW.Code.subcode]
R:76 [in Undecidability.L.Prelim.ARS]
R:77 [in Undecidability.L.Prelim.ARS]
R:78 [in Undecidability.L.Prelim.ARS]
r:78 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
R:79 [in Undecidability.L.Prelim.ARS]
R:79 [in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
r:79 [in Undecidability.Shared.Libs.DLW.Code.subcode]
R:8 [in Undecidability.L.Tactics.Computable]
r:80 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
R:81 [in Undecidability.L.Tactics.Extract]
r:82 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
R:83 [in Undecidability.L.Prelim.ARS]
R:84 [in Undecidability.L.Tactics.ComputableTime]
R:85 [in Undecidability.TM.Hoare.HoareRegister]
R:86 [in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
R:87 [in Undecidability.L.Prelim.ARS]
R:88 [in Undecidability.L.Prelim.ARS]
r:89 [in Undecidability.Shared.Libs.DLW.Vec.pos]
r:896 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
R:9 [in Undecidability.Shared.Libs.DLW.Utils.quotient]
R:9 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
r:9 [in Undecidability.L.Prelim.StringBase]
R:90 [in Undecidability.TM.Hoare.HoareLogic]
r:90 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
r:901 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
R:92 [in Undecidability.L.Prelim.ARS]
r:92 [in Undecidability.Shared.Libs.DLW.Vec.pos]
R:93 [in Undecidability.L.Prelim.ARS]
r:93 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
r:93 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
R:94 [in Undecidability.L.Prelim.ARS]
R:95 [in Undecidability.L.Prelim.ARS]
r:95 [in Undecidability.Shared.Libs.DLW.Vec.pos]
R:96 [in Undecidability.L.Prelim.ARS]
R:96 [in Undecidability.TM.Util.Relations]
R:97 [in Undecidability.L.Prelim.ARS]
r:97 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
R:98 [in Undecidability.L.Prelim.ARS]
R:98 [in Undecidability.Shared.Libs.DLW.Utils.php]

S

sa:15 [in Undecidability.TM.Code.NatTM]
sa:7 [in Undecidability.TM.Code.NatTM]
sb:16 [in Undecidability.TM.Code.NatTM]
sb:8 [in Undecidability.TM.Code.NatTM]
sc:66 [in Undecidability.TM.Code.NatTM]
sc:85 [in Undecidability.TM.Code.NatTM]
seenMark:89 [in Complexity.TM.Single.DecodeTape]
seenSymbol:90 [in Complexity.TM.Single.DecodeTape]
sfin:21 [in Complexity.NP.SAT.CookLevin.Subproblems.SingleTMGenNP]
sf:109 [in Complexity.NP.SAT.CookLevin.Subproblems.CC]
sf:126 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
sf:13 [in Complexity.NP.SAT.CookLevin.Subproblems.BinaryCC]
sf:196 [in Complexity.L.TM.TMflatComp]
sf:210 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
sf:22 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
sf:239 [in Complexity.L.TM.TMflatComp]
sf:242 [in Complexity.L.TM.TMflatComp]
sf:27 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
sf:54 [in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
sf:55 [in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
sf:56 [in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
sf:73 [in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
sf:81 [in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
sf:82 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
sf:85 [in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
sigma':12 [in Complexity.NP.TM.M_LM2TM]
sigma':21 [in Complexity.NP.L.LMGenNP]
sigma':23 [in Complexity.NP.TM.M_LM2TM]
sigma':27 [in Complexity.NP.TM.LM_to_mTM]
sigma':33 [in Complexity.NP.TM.LM_to_mTM]
sigma':41 [in Complexity.NP.TM.LM_to_mTM]
sigma:1 [in Complexity.L.AbstractMachines.Computable.EvalForTime]
Sigma:1 [in Undecidability.L.TM.TMinL]
Sigma:1 [in Complexity.NP.SAT.CookLevin.Subproblems.CC]
Sigma:10 [in Undecidability.L.TM.TMinL]
sigma:10 [in Complexity.NP.L.LMGenNP]
sigma:11 [in Complexity.L.AbstractMachines.Computable.EvalForTime]
Sigma:14 [in Undecidability.L.TM.TMinL]
sigma:16 [in Complexity.L.AbstractMachines.Computable.EvalForTime]
sigma:19 [in Complexity.NP.L.LMGenNP]
sigma:207 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
sigma:221 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
sigma:232 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
sigma:239 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
sigma:24 [in Complexity.NP.L.LMGenNP]
sigma:3 [in Complexity.L.AbstractMachines.Computable.EvalForTime]
sigma:36 [in Undecidability.Shared.Libs.PSL.Numbers]
Sigma:47 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
Sigma:50 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
sigma:54 [in Complexity.L.AbstractMachines.Computable.EvalForTime]
sigma:56 [in Undecidability.Shared.Libs.PSL.Numbers]
Sigma:67 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
Sigma:72 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
sigma:78 [in Complexity.L.AbstractMachines.AbstractHeapMachine]
Sigma:8 [in Undecidability.L.TM.TMinL]
sigma:91 [in Complexity.L.AbstractMachines.AbstractHeapMachine]
sigM:11 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
sigM:119 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
sigM:121 [in Complexity.TM.PrettyBounds.UnivBounds]
sigM:123 [in Complexity.TM.PrettyBounds.UnivBounds]
sigM:123 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
sigM:125 [in Complexity.TM.PrettyBounds.UnivBounds]
sigM:128 [in Complexity.TM.PrettyBounds.UnivBounds]
sigM:132 [in Complexity.TM.PrettyBounds.UnivBounds]
sigM:135 [in Complexity.TM.PrettyBounds.UnivBounds]
sigM:137 [in Complexity.TM.PrettyBounds.UnivBounds]
sigM:145 [in Complexity.TM.PrettyBounds.UnivBounds]
sigM:148 [in Complexity.TM.PrettyBounds.UnivBounds]
sigM:151 [in Complexity.TM.PrettyBounds.UnivBounds]
sigM:156 [in Complexity.TM.PrettyBounds.UnivBounds]
sigM:160 [in Complexity.TM.PrettyBounds.UnivBounds]
sigM:165 [in Complexity.TM.PrettyBounds.UnivBounds]
sigM:18 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
sigM:316 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
sigM:322 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
sigM:41 [in Undecidability.TM.Univ.LowLevel]
sign:177 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
sign:179 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
sign:182 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
sigX:1 [in Complexity.TM.PrettyBounds.UnivBounds]
sigX:1 [in Complexity.TM.Code.DecodeList]
sigX:1 [in Undecidability.TM.Hoare.HoareExamples]
sigX:10 [in Complexity.TM.PrettyBounds.UnivBounds]
sigX:10 [in Undecidability.TM.Code.List.Cons_constant]
sigX:100 [in Undecidability.TM.Code.List.Nth]
sigX:102 [in Complexity.TM.PrettyBounds.BaseCode]
sigX:103 [in Undecidability.TM.Code.Code]
sigX:105 [in Undecidability.TM.Code.List.Nth]
sigX:105 [in Undecidability.TM.Code.Copy]
sigX:107 [in Undecidability.TM.Code.Code]
sigX:110 [in Complexity.TM.PrettyBounds.BaseCode]
sigX:111 [in Undecidability.TM.Code.Copy]
sigX:111 [in Undecidability.TM.Code.Code]
sigX:115 [in Complexity.TM.PrettyBounds.BaseCode]
sigX:115 [in Undecidability.TM.Code.Code]
sigX:117 [in Undecidability.TM.Code.Copy]
sigX:12 [in Undecidability.TM.Univ.LookupAssociativeListTM]
sigX:120 [in Complexity.TM.PrettyBounds.BaseCode]
sigX:122 [in Undecidability.TM.Univ.LookupAssociativeListTM]
sigX:13 [in Undecidability.TM.Hoare.HoareExamples]
sigX:130 [in Complexity.TM.PrettyBounds.BaseCode]
sigX:130 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
sigX:130 [in Undecidability.TM.Code.Code]
sigX:136 [in Complexity.TM.PrettyBounds.BaseCode]
sigX:137 [in Undecidability.TM.Code.Code]
sigX:139 [in Undecidability.TM.Code.Code]
sigX:143 [in Undecidability.TM.Univ.LookupAssociativeListTM]
sigX:15 [in Complexity.TM.PrettyBounds.BaseCode]
sigX:15 [in Undecidability.TM.Hoare.HoareRegister]
sigX:16 [in Undecidability.TM.PrettyBounds.SizeBounds]
sigX:16 [in Complexity.NP.TM.LM_to_mTM]
sigX:160 [in Undecidability.TM.Code.Copy]
sigX:160 [in Undecidability.TM.Code.Code]
sigX:164 [in Undecidability.TM.Code.Copy]
sigX:167 [in Undecidability.TM.Code.Code]
sigX:169 [in Undecidability.TM.Code.Code]
sigX:17 [in Undecidability.TM.Code.List.Nth]
sigX:17 [in Undecidability.TM.Code.WriteValue]
sigX:177 [in Undecidability.TM.Code.Copy]
sigX:19 [in Undecidability.TM.Code.CasePair]
sigX:19 [in Undecidability.TM.Hoare.HoareExamples]
sigX:199 [in Undecidability.TM.Code.Copy]
sigX:2 [in Complexity.TM.PrettyBounds.BaseCode]
sigX:2 [in Undecidability.TM.Code.WriteValue]
sigX:21 [in Complexity.TM.PrettyBounds.UnivBounds]
sigX:21 [in Undecidability.TM.Univ.LookupAssociativeListTM]
sigX:210 [in Undecidability.TM.Code.Copy]
sigX:216 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
sigX:216 [in Undecidability.TM.Code.Copy]
sigX:22 [in Undecidability.TM.Code.List.Length]
sigX:221 [in Undecidability.TM.Code.Copy]
sigX:228 [in Undecidability.TM.Code.Copy]
sigX:234 [in Undecidability.TM.Code.Copy]
sigX:24 [in Undecidability.TM.Code.CasePair]
sigX:241 [in Undecidability.TM.Code.Copy]
sigX:244 [in Complexity.TM.PrettyBounds.M2MBounds]
sigX:247 [in Undecidability.TM.Code.Copy]
sigX:254 [in Undecidability.TM.Code.Copy]
sigX:26 [in Undecidability.TM.Code.CaseList]
sigX:26 [in Undecidability.TM.Hoare.HoareExamples]
sigX:26 [in Undecidability.TM.Code.List.App]
sigX:260 [in Undecidability.TM.Code.Copy]
sigX:267 [in Undecidability.TM.Code.Copy]
sigX:273 [in Undecidability.TM.Code.Copy]
sigX:280 [in Undecidability.TM.Code.Copy]
sigX:286 [in Undecidability.TM.Code.Copy]
sigX:293 [in Undecidability.TM.Code.Copy]
sigX:299 [in Undecidability.TM.Code.Copy]
sigX:306 [in Undecidability.TM.Code.Copy]
sigX:31 [in Undecidability.TM.Code.CaseList]
sigX:31 [in Complexity.TM.PrettyBounds.UnivBounds]
sigX:31 [in Undecidability.TM.Code.List.Length]
sigX:31 [in Undecidability.TM.Code.CompareValue]
sigX:31 [in Undecidability.TM.Univ.LookupAssociativeListTM]
sigX:312 [in Undecidability.TM.Code.Copy]
sigX:319 [in Undecidability.TM.Code.Copy]
sigX:32 [in Complexity.TM.PrettyBounds.BaseCode]
sigX:32 [in Undecidability.TM.Hoare.HoareExamples]
sigX:326 [in Undecidability.TM.Code.Copy]
sigX:333 [in Undecidability.TM.Code.Copy]
sigX:34 [in Undecidability.TM.Code.CasePair]
sigX:345 [in Undecidability.TM.Code.Copy]
sigX:356 [in Undecidability.TM.Code.Copy]
sigX:36 [in Undecidability.TM.Code.List.Nth]
sigX:368 [in Undecidability.TM.Code.Copy]
sigX:37 [in Complexity.TM.PrettyBounds.BaseCode]
sigX:37 [in Undecidability.TM.Code.List.App]
sigX:379 [in Undecidability.TM.Code.Copy]
sigX:387 [in Undecidability.TM.Code.Copy]
sigX:39 [in Undecidability.TM.Hoare.HoareExamples]
sigX:394 [in Undecidability.TM.Code.Copy]
sigX:4 [in Undecidability.TM.Hoare.HoareRegister]
sigX:40 [in Undecidability.TM.Univ.LookupAssociativeListTM]
sigX:402 [in Undecidability.TM.Code.Copy]
sigX:41 [in Complexity.TM.PrettyBounds.UnivBounds]
sigX:41 [in Undecidability.TM.Code.CasePair]
sigX:42 [in Complexity.TM.PrettyBounds.BaseCode]
sigX:44 [in Undecidability.TM.Code.List.Nth]
sigX:44 [in Undecidability.TM.Code.List.Length]
sigX:46 [in Undecidability.TM.Hoare.HoareExamples]
sigX:47 [in Complexity.TM.PrettyBounds.BaseCode]
sigX:5 [in Complexity.TM.PrettyBounds.UnivBounds]
sigX:50 [in Complexity.TM.PrettyBounds.UnivBounds]
sigX:52 [in Undecidability.TM.Code.Code]
sigX:52 [in Undecidability.TM.Code.CasePair]
sigX:54 [in Undecidability.TM.Code.List.Length]
sigX:54 [in Undecidability.TM.Univ.LookupAssociativeListTM]
sigX:56 [in Complexity.TM.PrettyBounds.BaseCode]
sigX:57 [in Undecidability.TM.Code.CaseList]
sigX:58 [in Undecidability.TM.Code.Code]
sigX:58 [in Undecidability.TM.Hoare.HoareExamples]
sigX:59 [in Undecidability.TM.Code.CasePair]
sigX:6 [in Undecidability.TM.Hoare.HoareExamples]
sigX:60 [in Complexity.TM.PrettyBounds.UnivBounds]
sigX:61 [in Undecidability.TM.Code.CaseList]
sigX:62 [in Undecidability.TM.Code.Code]
sigX:64 [in Undecidability.TM.Univ.LookupAssociativeListTM]
sigX:65 [in Undecidability.TM.Code.List.Length]
sigX:66 [in Undecidability.TM.Code.Code]
sigX:67 [in Complexity.TM.PrettyBounds.BaseCodeSpace]
sigX:68 [in Undecidability.TM.Code.CasePair]
sigX:69 [in Complexity.TM.PrettyBounds.UnivBounds]
sigX:69 [in Undecidability.TM.Hoare.HoareExamples]
sigX:7 [in Undecidability.TM.Code.List.Nth]
sigX:7 [in Undecidability.TM.Code.List.Length]
sigX:70 [in Undecidability.TM.Code.Code]
sigX:73 [in Complexity.TM.PrettyBounds.BaseCodeSpace]
sigX:78 [in Complexity.TM.PrettyBounds.UnivBounds]
sigX:78 [in Complexity.TM.PrettyBounds.BaseCodeSpace]
sigX:8 [in Undecidability.TM.Hoare.HoareRegister]
sigX:82 [in Undecidability.TM.Code.CaseList]
sigX:83 [in Complexity.TM.PrettyBounds.BaseCodeSpace]
sigX:87 [in Complexity.TM.PrettyBounds.UnivBounds]
sigX:9 [in Complexity.TM.PrettyBounds.BaseCode]
sigX:9 [in Undecidability.TM.Code.WriteValue]
sigX:93 [in Undecidability.TM.Code.CaseList]
sigX:97 [in Undecidability.TM.Code.Copy]
sigX:97 [in Undecidability.TM.Code.Code]
sigY:103 [in Complexity.TM.PrettyBounds.BaseCode]
sigY:104 [in Undecidability.TM.Code.Code]
sigY:108 [in Undecidability.TM.Code.Code]
sigY:11 [in Complexity.TM.PrettyBounds.UnivBounds]
sigY:112 [in Undecidability.TM.Code.Code]
sigY:116 [in Undecidability.TM.Code.Code]
sigY:123 [in Undecidability.TM.Univ.LookupAssociativeListTM]
sigY:13 [in Undecidability.TM.Univ.LookupAssociativeListTM]
sigY:144 [in Undecidability.TM.Univ.LookupAssociativeListTM]
sigY:165 [in Undecidability.TM.Code.Copy]
sigY:178 [in Undecidability.TM.Code.Copy]
sigY:22 [in Complexity.TM.PrettyBounds.UnivBounds]
sigY:22 [in Undecidability.TM.Univ.LookupAssociativeListTM]
sigY:32 [in Complexity.TM.PrettyBounds.UnivBounds]
sigY:32 [in Undecidability.TM.Univ.LookupAssociativeListTM]
sigY:327 [in Undecidability.TM.Code.Copy]
sigY:334 [in Undecidability.TM.Code.Copy]
sigY:346 [in Undecidability.TM.Code.Copy]
sigY:357 [in Undecidability.TM.Code.Copy]
sigY:369 [in Undecidability.TM.Code.Copy]
sigY:40 [in Undecidability.TM.Hoare.HoareExamples]
sigY:41 [in Undecidability.TM.Univ.LookupAssociativeListTM]
sigY:42 [in Complexity.TM.PrettyBounds.UnivBounds]
sigY:47 [in Undecidability.TM.Hoare.HoareExamples]
sigY:50 [in Complexity.TM.PrettyBounds.BaseCode]
sigY:51 [in Complexity.TM.PrettyBounds.UnivBounds]
sigY:53 [in Undecidability.TM.Code.Code]
sigY:55 [in Undecidability.TM.Univ.LookupAssociativeListTM]
sigY:59 [in Undecidability.TM.Code.Code]
sigY:59 [in Undecidability.TM.Hoare.HoareExamples]
sigY:61 [in Complexity.TM.PrettyBounds.BaseCode]
sigY:61 [in Complexity.TM.PrettyBounds.UnivBounds]
sigY:63 [in Undecidability.TM.Code.Code]
sigY:65 [in Undecidability.TM.Univ.LookupAssociativeListTM]
sigY:67 [in Undecidability.TM.Code.Code]
sigY:70 [in Complexity.TM.PrettyBounds.UnivBounds]
sigY:70 [in Undecidability.TM.Hoare.HoareExamples]
sigY:71 [in Undecidability.TM.Code.Code]
sigY:79 [in Complexity.TM.PrettyBounds.UnivBounds]
sigY:85 [in Complexity.TM.PrettyBounds.BaseCodeSpace]
sigY:88 [in Complexity.TM.PrettyBounds.UnivBounds]
sigY:98 [in Undecidability.TM.Code.Code]
sig':105 [in Complexity.L.TM.TMunflatten]
sig':11 [in Undecidability.TM.PrettyBounds.SizeBounds]
sig':11 [in Undecidability.TM.Compound.WriteString]
sig':13 [in Undecidability.TM.PrettyBounds.SizeBounds]
sig':15 [in Undecidability.TM.Compound.WriteString]
sig':17 [in Complexity.TM.Compound.MoveToSymbol_niceSpec]
sig':20 [in Complexity.L.TM.TMflatFun]
sig':212 [in Complexity.L.TM.TMunflatten]
sig':22 [in Complexity.TM.Compound.MoveToSymbol_niceSpec]
sig':36 [in Complexity.L.TM.TMflat]
sig':39 [in Complexity.TM.Single.DecodeTapes]
sig':47 [in Complexity.NP.TM.M_multi2mono]
sig':50 [in Complexity.L.TM.TMflatFun]
sig':6 [in Undecidability.TM.Compound.WriteString]
sig':65 [in Undecidability.TM.Single.EncodeTapes]
sig':68 [in Undecidability.TM.Single.EncodeTapes]
sig':7 [in Complexity.TM.Compound.MoveToSymbol_niceSpec]
sig':71 [in Complexity.NP.TM.M_multi2mono]
sig':8 [in Complexity.L.TM.TMflatFun]
sig:1 [in Complexity.NP.SAT.CookLevin]
sig:1 [in Complexity.TM.PrettyBounds.M2MBounds]
sig:1 [in Complexity.TM.Code.Decode]
sig:1 [in Complexity.NP.TM.mTM_to_singleTapeTM]
sig:1 [in Undecidability.TM.Hoare.HoareLegacy]
sig:1 [in Complexity.NP.TM.TMGenNP]
sig:1 [in Undecidability.TM.Code.CodeTM]
sig:1 [in Undecidability.TM.Code.WriteValue]
sig:1 [in Complexity.NP.SAT.CookLevin.Subproblems.SingleTMGenNP]
sig:1 [in Complexity.NP.TM.M_multi2mono]
sig:1 [in Complexity.L.TM.TMflatFun]
sig:1 [in Complexity.TM.Single.DecodeTapes]
sig:1 [in Undecidability.TM.Code.Code]
sig:1 [in Undecidability.L.TM.TMinL.TMinL_extract]
sig:1 [in Undecidability.TM.Hoare.HoareLogic]
sig:1 [in Complexity.TM.Single.DecodeTape]
sig:1 [in Undecidability.TM.Hoare.HoareCombinators]
sig:1 [in Undecidability.TM.Hoare.HoareStdLib]
sig:1 [in Complexity.NP.TM.TMGenNP_fixed_mTM]
sig:1 [in Undecidability.TM.Single.EncodeTapes]
sig:10 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds_Loop]
sig:10 [in Undecidability.TM.Code.CodeTM]
sig:10 [in Complexity.L.TM.TMunflatten]
sig:10 [in Undecidability.TM.Single.EncodeTapes]
sig:100 [in Complexity.TM.PrettyBounds.M2MBounds]
sig:103 [in Complexity.TM.PrettyBounds.M2MBounds]
sig:1033 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
sig:1038 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
sig:104 [in Undecidability.TM.Hoare.HoareRegister]
sig:105 [in Complexity.TM.PrettyBounds.M2MBounds]
sig:1058 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
sig:1063 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
sig:1070 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
sig:1074 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
sig:1078 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
sig:108 [in Complexity.TM.PrettyBounds.M2MBounds]
sig:108 [in Undecidability.TM.Hoare.HoareLogic]
sig:1083 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
sig:1087 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
sig:1091 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
sig:1095 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
sig:1099 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
sig:11 [in Complexity.L.TM.TMflatFun]
sig:11 [in Undecidability.TM.Hoare.HoareCombinators]
sig:110 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
sig:110 [in Complexity.L.TM.TMunflatten]
sig:1104 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
sig:111 [in Undecidability.TM.Single.StepTM]
sig:112 [in Undecidability.TM.Hoare.HoareRegister]
sig:113 [in Complexity.TM.PrettyBounds.M2MBounds]
sig:114 [in Undecidability.TM.Hoare.HoareCombinators]
sig:117 [in Complexity.TM.PrettyBounds.M2MBounds]
sig:118 [in Undecidability.TM.Hoare.HoareLogic]
sig:119 [in Undecidability.TM.Hoare.HoareRegister]
sig:12 [in Undecidability.TM.Hoare.HoareLogic]
sig:12 [in Undecidability.TM.Hoare.HoareExamples]
sig:123 [in Undecidability.TM.Hoare.HoareCombinators]
sig:125 [in Complexity.TM.PrettyBounds.M2MBounds]
sig:125 [in Complexity.L.TM.CompCode]
sig:126 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
sig:129 [in Undecidability.TM.Hoare.HoareLogic]
sig:13 [in Complexity.NP.TM.TMGenNP]
sig:13 [in Undecidability.TM.Code.CodeTM]
sig:13 [in Undecidability.TM.Single.EncodeTapes]
sig:133 [in Complexity.TM.PrettyBounds.M2MBounds]
sig:133 [in Undecidability.TM.Hoare.HoareCombinators]
sig:134 [in Undecidability.TM.Code.Code]
sig:136 [in Undecidability.TM.Code.Copy]
sig:138 [in Undecidability.TM.Hoare.HoareLogic]
sig:14 [in Undecidability.TM.Hoare.HoareStdLib]
sig:140 [in Complexity.TM.PrettyBounds.M2MBounds]
sig:142 [in Undecidability.TM.Hoare.HoareCombinators]
sig:144 [in Complexity.TM.PrettyBounds.M2MBounds]
sig:145 [in Undecidability.TM.Code.Copy]
sig:148 [in Complexity.TM.PrettyBounds.M2MBounds]
sig:149 [in Undecidability.TM.Hoare.HoareLogic]
sig:15 [in Complexity.L.TM.TMunflatten]
sig:15 [in Complexity.L.TM.TMflatFun]
sig:15 [in Complexity.TM.Single.DecodeTape]
sig:15 [in Complexity.NP.TM.LM_to_mTM]
sig:150 [in Undecidability.TM.Hoare.HoareRegister]
sig:156 [in Undecidability.TM.Hoare.HoareLogic]
sig:157 [in Complexity.TM.PrettyBounds.M2MBounds]
sig:158 [in Complexity.L.TM.TMunflatten]
sig:16 [in Undecidability.TM.Code.WriteValue]
sig:16 [in Undecidability.TM.Single.EncodeTapes]
sig:161 [in Undecidability.TM.Hoare.HoareLogic]
sig:161 [in Undecidability.TM.Hoare.HoareCombinators]
sig:164 [in Undecidability.TM.Code.Code]
sig:166 [in Undecidability.TM.Hoare.HoareLogic]
sig:167 [in Complexity.TM.PrettyBounds.M2MBounds]
sig:168 [in Complexity.Libs.CookPrelim.FlatFinTypes]
sig:168 [in Undecidability.TM.Hoare.HoareLogic]
sig:17 [in Undecidability.TM.Hoare.HoareLegacy]
sig:17 [in Undecidability.TM.Code.CodeTM]
sig:170 [in Complexity.TM.PrettyBounds.UnivBounds]
sig:170 [in Complexity.Libs.CookPrelim.FlatFinTypes]
sig:170 [in Complexity.L.TM.TMunflatten]
sig:172 [in Undecidability.TM.Hoare.HoareRegister]
sig:172 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
sig:173 [in Complexity.Libs.CookPrelim.FlatFinTypes]
sig:174 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
sig:174 [in Undecidability.TM.Hoare.HoareCombinators]
sig:175 [in Complexity.Libs.CookPrelim.FlatFinTypes]
sig:176 [in Complexity.TM.PrettyBounds.M2MBounds]
sig:177 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
sig:178 [in Complexity.Libs.CookPrelim.FlatFinTypes]
sig:18 [in Undecidability.L.TM.TMinL]
sig:18 [in Undecidability.TM.Hoare.HoareExamples]
sig:183 [in Undecidability.TM.Hoare.HoareLogic]
sig:186 [in Undecidability.TM.Hoare.HoareLogic]
sig:186 [in Undecidability.TM.Hoare.HoareCombinators]
sig:188 [in Undecidability.TM.Hoare.HoareRegister]
sig:19 [in Complexity.L.TM.TMunflatten]
sig:19 [in Complexity.NP.SAT.CookLevin.Subproblems.SingleTMGenNP]
sig:19 [in Undecidability.TM.Single.EncodeTapes]
sig:192 [in Undecidability.TM.Util.TM_facts]
sig:193 [in Undecidability.TM.Hoare.HoareLogic]
sig:195 [in Complexity.TM.PrettyBounds.M2MBounds]
sig:195 [in Complexity.L.TM.TMunflatten]
sig:195 [in Undecidability.TM.Hoare.HoareCombinators]
sig:196 [in Undecidability.TM.Hoare.HoareRegister]
sig:199 [in Complexity.L.TM.TMunflatten]
sig:199 [in Undecidability.TM.Util.TM_facts]
sig:20 [in Undecidability.TM.Hoare.HoareLogic]
sig:20 [in Complexity.NP.TM.TMGenNP_fixed_mTM]
sig:201 [in Undecidability.TM.Hoare.HoareLogic]
sig:202 [in Complexity.TM.PrettyBounds.M2MBounds]
sig:203 [in Undecidability.TM.Hoare.HoareRegister]
sig:205 [in Complexity.L.TM.TMunflatten]
sig:205 [in Undecidability.TM.Util.TM_facts]
sig:208 [in Complexity.L.TM.TMflatComp]
sig:208 [in Complexity.L.TM.TMunflatten]
sig:208 [in Undecidability.TM.Util.TM_facts]
sig:209 [in Complexity.TM.PrettyBounds.M2MBounds]
sig:21 [in Complexity.TM.Single.EncodeTapesInvariants]
sig:21 [in Complexity.NP.TM.TMGenNP]
sig:21 [in Complexity.NP.TM.LM_to_mTM]
sig:211 [in Complexity.L.TM.TMflatComp]
sig:211 [in Complexity.L.TM.TMunflatten]
sig:211 [in Undecidability.TM.Hoare.HoareRegister]
sig:211 [in Undecidability.TM.Hoare.HoareCombinators]
sig:212 [in Undecidability.TM.Hoare.HoareLogic]
sig:213 [in Complexity.L.TM.TMflatComp]
sig:215 [in Complexity.L.TM.TMflatComp]
sig:215 [in Complexity.L.TM.TMunflatten]
sig:215 [in Undecidability.TM.Hoare.HoareLogic]
sig:217 [in Complexity.TM.PrettyBounds.M2MBounds]
sig:217 [in Complexity.L.TM.TMflatComp]
sig:219 [in Complexity.L.TM.TMunflatten]
sig:22 [in Undecidability.TM.Code.CodeTM]
sig:22 [in Undecidability.TM.Hoare.HoareCombinators]
sig:22 [in Undecidability.TM.Single.EncodeTapes]
sig:220 [in Undecidability.TM.Code.Copy]
sig:222 [in Complexity.L.TM.TMunflatten]
sig:224 [in Complexity.TM.PrettyBounds.M2MBounds]
sig:224 [in Undecidability.TM.Hoare.HoareLogic]
sig:225 [in Complexity.L.TM.TMflatComp]
sig:226 [in Complexity.L.TM.TMunflatten]
sig:227 [in Undecidability.TM.Code.Copy]
sig:229 [in Complexity.L.TM.TMunflatten]
sig:229 [in Undecidability.TM.Hoare.HoareCombinators]
sig:23 [in Complexity.NP.TM.TMGenNP_fixed_mTM]
sig:230 [in Complexity.L.TM.TMflatComp]
sig:230 [in Undecidability.TM.Hoare.HoareRegister]
sig:232 [in Complexity.TM.PrettyBounds.M2MBounds]
sig:233 [in Undecidability.TM.Code.Copy]
sig:233 [in Undecidability.TM.Hoare.HoareLogic]
sig:234 [in Complexity.L.TM.TMflatComp]
sig:240 [in Complexity.TM.PrettyBounds.M2MBounds]
sig:240 [in Undecidability.TM.Code.Copy]
sig:242 [in Undecidability.TM.Hoare.HoareCombinators]
sig:243 [in Undecidability.TM.Hoare.HoareLogic]
sig:245 [in Complexity.L.TM.TMflatComp]
sig:246 [in Undecidability.TM.Code.Copy]
sig:247 [in Complexity.L.TM.TMflatComp]
sig:247 [in Undecidability.TM.Hoare.HoareRegister]
sig:248 [in Complexity.TM.PrettyBounds.M2MBounds]
sig:25 [in Undecidability.TM.Hoare.HoareExamples]
sig:25 [in Undecidability.TM.Single.EncodeTapes]
sig:250 [in Complexity.L.TM.TMflatComp]
sig:251 [in Complexity.TM.PrettyBounds.M2MBounds]
sig:253 [in Undecidability.TM.Code.Copy]
sig:254 [in Undecidability.TM.Hoare.HoareLogic]
sig:254 [in Undecidability.TM.Hoare.HoareCombinators]
sig:256 [in Complexity.L.TM.TMflatComp]
sig:258 [in Complexity.L.TM.TMflatComp]
sig:259 [in Undecidability.TM.Hoare.HoareRegister]
sig:259 [in Undecidability.TM.Code.Copy]
sig:26 [in Undecidability.TM.Code.CodeTM]
sig:26 [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
sig:26 [in Undecidability.TM.Hoare.HoareLogic]
sig:260 [in Complexity.TM.PrettyBounds.M2MBounds]
sig:260 [in Complexity.L.TM.TMflatComp]
sig:262 [in Complexity.L.TM.TMflatComp]
sig:264 [in Undecidability.TM.Hoare.HoareLogic]
sig:264 [in Undecidability.TM.Hoare.HoareCombinators]
sig:266 [in Undecidability.TM.Code.Copy]
sig:267 [in Complexity.TM.PrettyBounds.M2MBounds]
sig:268 [in Complexity.L.TM.TMflatComp]
sig:271 [in Complexity.L.TM.TMflatComp]
sig:271 [in Undecidability.TM.Util.TM_facts]
sig:272 [in Undecidability.TM.Code.Copy]
sig:274 [in Complexity.L.TM.TMflatComp]
sig:274 [in Undecidability.TM.Hoare.HoareRegister]
sig:275 [in Undecidability.TM.Hoare.HoareLogic]
sig:277 [in Complexity.TM.PrettyBounds.M2MBounds]
sig:277 [in Complexity.L.TM.TMflatComp]
sig:277 [in Undecidability.TM.Hoare.HoareCombinators]
sig:279 [in Undecidability.TM.Code.Copy]
sig:28 [in Complexity.NP.TM.TMGenNP]
sig:28 [in Undecidability.TM.Code.CodeTM]
sig:28 [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
sig:28 [in Undecidability.TM.Code.WriteValue]
sig:28 [in Undecidability.TM.Single.EncodeTapes]
sig:282 [in Undecidability.TM.Hoare.HoareLogic]
sig:283 [in Complexity.TM.PrettyBounds.M2MBounds]
sig:285 [in Undecidability.TM.Code.Copy]
sig:286 [in Undecidability.TM.Util.TM_facts]
sig:287 [in Undecidability.TM.Hoare.HoareRegister]
sig:289 [in Undecidability.TM.Hoare.HoareLogic]
sig:29 [in Undecidability.TM.Single.EncodeTapes]
sig:290 [in Complexity.TM.PrettyBounds.M2MBounds]
sig:292 [in Undecidability.TM.Code.Copy]
sig:293 [in Undecidability.TM.Hoare.HoareCombinators]
sig:294 [in Complexity.TM.PrettyBounds.M2MBounds]
sig:297 [in Undecidability.TM.Hoare.HoareLogic]
sig:298 [in Complexity.TM.PrettyBounds.M2MBounds]
sig:298 [in Undecidability.TM.Code.Copy]
sig:3 [in Undecidability.TM.PrettyBounds.SizeBounds]
sig:3 [in Complexity.L.TM.TMflatFun]
sig:3 [in Complexity.TM.Code.DecodeBool]
sig:3 [in Undecidability.TM.Hoare.HoareLogic]
sig:30 [in Complexity.TM.PrettyBounds.M2MBounds]
sig:305 [in Undecidability.TM.Hoare.HoareRegister]
sig:305 [in Undecidability.TM.Code.Copy]
sig:305 [in Undecidability.TM.Hoare.HoareLogic]
sig:306 [in Complexity.TM.PrettyBounds.M2MBounds]
sig:31 [in Undecidability.TM.Code.CodeTM]
sig:31 [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
sig:31 [in Undecidability.TM.Hoare.HoareExamples]
sig:310 [in Undecidability.TM.Hoare.HoareCombinators]
sig:311 [in Undecidability.TM.Hoare.HoareRegister]
sig:311 [in Undecidability.TM.Code.Copy]
sig:314 [in Complexity.TM.PrettyBounds.M2MBounds]
sig:314 [in Undecidability.TM.Hoare.HoareLogic]
sig:318 [in Undecidability.TM.Hoare.HoareRegister]
sig:318 [in Undecidability.TM.Code.Copy]
sig:32 [in Complexity.NP.SAT.CookLevin.Subproblems.SingleTMGenNP]
sig:32 [in Undecidability.TM.Hoare.HoareLogic]
sig:32 [in Undecidability.TM.Hoare.HoareCombinators]
sig:32 [in Undecidability.TM.Single.EncodeTapes]
sig:321 [in Undecidability.TM.Hoare.HoareCombinators]
sig:323 [in Complexity.TM.PrettyBounds.M2MBounds]
sig:324 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
sig:325 [in Undecidability.TM.Hoare.HoareLogic]
sig:326 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
sig:328 [in Undecidability.TM.Hoare.HoareRegister]
sig:33 [in Complexity.TM.PrettyBounds.M2MBounds]
sig:332 [in Complexity.TM.PrettyBounds.M2MBounds]
sig:332 [in Undecidability.TM.Code.Copy]
sig:337 [in Undecidability.TM.Hoare.HoareLogic]
sig:339 [in Complexity.TM.PrettyBounds.M2MBounds]
sig:34 [in Complexity.TM.Single.EncodeTapesInvariants]
sig:34 [in Undecidability.TM.Code.CodeTM]
sig:34 [in Undecidability.TM.Compound.WriteString]
sig:344 [in Undecidability.TM.Code.Copy]
sig:346 [in Undecidability.TM.Hoare.HoareRegister]
sig:348 [in Undecidability.TM.Hoare.HoareLogic]
sig:35 [in Undecidability.TM.Single.EncodeTapes]
sig:355 [in Undecidability.TM.Code.Copy]
sig:357 [in Undecidability.TM.Hoare.HoareRegister]
sig:36 [in Complexity.TM.PrettyBounds.M2MBounds]
sig:36 [in Undecidability.TM.Code.CodeTM]
sig:36 [in Complexity.NP.SAT.CookLevin.Subproblems.SingleTMGenNP]
sig:36 [in Undecidability.L.TM.TMEncoding]
sig:361 [in Undecidability.TM.Hoare.HoareLogic]
sig:3611 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
sig:3616 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
sig:362 [in Undecidability.TM.Hoare.HoareCombinators]
sig:363 [in Undecidability.TM.Hoare.HoareRegister]
sig:367 [in Undecidability.TM.Code.Copy]
sig:369 [in Undecidability.TM.Hoare.HoareLogic]
sig:37 [in Complexity.L.TM.TMflatFun]
sig:37 [in Undecidability.TM.Compound.WriteString]
sig:371 [in Undecidability.TM.Util.TM_facts]
sig:374 [in Undecidability.TM.Util.TM_facts]
sig:377 [in Undecidability.TM.Hoare.HoareRegister]
sig:377 [in Undecidability.TM.Hoare.HoareLogic]
sig:378 [in Undecidability.TM.Code.Copy]
sig:379 [in Undecidability.TM.Hoare.HoareCombinators]
sig:38 [in Complexity.TM.Single.EncodeTapesInvariants]
sig:38 [in Complexity.NP.TM.TMGenNP]
sig:38 [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
sig:38 [in Complexity.NP.TM.M_multi2mono]
sig:38 [in Undecidability.TM.Hoare.HoareLogic]
sig:381 [in Undecidability.TM.Util.TM_facts]
sig:386 [in Undecidability.TM.Code.Copy]
sig:386 [in Undecidability.TM.Util.TM_facts]
sig:386 [in Undecidability.TM.Hoare.HoareLogic]
sig:39 [in Complexity.TM.PrettyBounds.M2MBounds]
sig:39 [in Undecidability.L.TM.TMEncoding]
sig:392 [in Undecidability.TM.Hoare.HoareRegister]
sig:393 [in Undecidability.TM.Code.Copy]
sig:395 [in Undecidability.TM.Hoare.HoareLogic]
sig:4 [in Complexity.TM.Single.EncodeTapesInvariants]
sig:4 [in Complexity.NP.SAT.CookLevin.Subproblems.SingleTMGenNP]
sig:4 [in Undecidability.TM.Hoare.HoareCombinators]
Sig:4 [in Complexity.NP.SAT.CookLevin.Reductions.CC_to_BinaryCC]
sig:40 [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
sig:40 [in Complexity.NP.SAT.CookLevin.Subproblems.TM_single]
sig:40 [in Undecidability.TM.Compound.WriteString]
sig:401 [in Undecidability.TM.Code.Copy]
sig:41 [in Complexity.TM.PrettyBounds.M2MBounds]
sig:41 [in Complexity.L.TM.TMflatComp]
sig:410 [in Undecidability.TM.Hoare.HoareRegister]
sig:42 [in Undecidability.TM.Univ.LowLevel]
sig:42 [in Complexity.L.TM.TMunflatten]
sig:424 [in Undecidability.TM.Hoare.HoareCombinators]
sig:43 [in Complexity.TM.PrettyBounds.M2MBounds]
sig:43 [in Undecidability.TM.Compound.WriteString]
sig:432 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
sig:44 [in Undecidability.TM.Hoare.HoareCombinators]
sig:443 [in Undecidability.TM.Hoare.HoareCombinators]
sig:447 [in Undecidability.TM.Hoare.HoareRegister]
sig:45 [in Complexity.TM.PrettyBounds.M2MBounds]
sig:45 [in Complexity.L.TM.TMunflatten]
sig:45 [in Undecidability.TM.Hoare.HoareExamples]
sig:452 [in Undecidability.TM.Hoare.HoareRegister]
sig:46 [in Complexity.L.TM.TMflatFun]
sig:47 [in Undecidability.TM.Hoare.HoareLogic]
sig:48 [in Complexity.TM.PrettyBounds.M2MBounds]
sig:48 [in Complexity.L.TM.TMflat]
sig:5 [in Undecidability.TM.Code.CodeTM]
sig:5 [in Undecidability.TM.Code.Code]
sig:5 [in Undecidability.TM.Hoare.HoareExamples]
sig:50 [in Complexity.TM.PrettyBounds.M2MBounds]
sig:51 [in Complexity.NP.TM.LM_to_mTM]
sig:53 [in Complexity.L.TM.TMunflatten]
sig:53 [in Complexity.L.TM.TMflat]
sig:54 [in Complexity.TM.PrettyBounds.M2MBounds]
sig:54 [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
sig:54 [in Undecidability.TM.Hoare.HoareLogic]
sig:55 [in Undecidability.TM.Hoare.HoareCombinators]
sig:556 [in Complexity.NP.TM.LM_to_mTM]
sig:56 [in Complexity.TM.Code.Decode]
sig:57 [in Undecidability.TM.Hoare.HoareExamples]
sig:58 [in Complexity.L.TM.TMflat]
sig:589 [in Complexity.NP.TM.LM_to_mTM]
sig:59 [in Complexity.TM.PrettyBounds.M2MBounds]
sig:59 [in Complexity.L.TM.TMflatFun]
sig:593 [in Complexity.NP.TM.LM_to_mTM]
sig:6 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds_Loop]
sig:6 [in Undecidability.TM.PrettyBounds.SizeBounds]
sig:6 [in Complexity.TM.Single.DecodeTapes]
sig:6 [in Complexity.TM.Single.DecodeTape]
Sig:6 [in Complexity.NP.SAT.CookLevin.Reductions.CC_to_BinaryCC]
sig:6 [in Undecidability.TM.Hoare.HoareStdLib]
sig:61 [in Undecidability.TM.Hoare.HoareLogic]
sig:64 [in Complexity.TM.PrettyBounds.M2MBounds]
sig:66 [in Complexity.L.TM.TMflat]
sig:66 [in Complexity.L.TM.TMflatFun]
sig:66 [in Undecidability.TM.Hoare.HoareCombinators]
sig:68 [in Complexity.TM.PrettyBounds.M2MBounds]
sig:68 [in Undecidability.TM.Hoare.HoareLogic]
sig:68 [in Undecidability.TM.Hoare.HoareExamples]
sig:69 [in Complexity.L.TM.TMflatten]
sig:7 [in Complexity.L.TM.TMunflatten]
sig:7 [in Complexity.L.TM.TMflatFun]
sig:7 [in Undecidability.TM.Hoare.HoareCombinators]
sig:70 [in Complexity.TM.PrettyBounds.M2MBounds]
sig:71 [in Complexity.L.TM.TMunflatten]
sig:72 [in Complexity.TM.PrettyBounds.M2MBounds]
sig:72 [in Complexity.L.TM.TMflatten]
sig:73 [in Undecidability.TM.Hoare.HoareLogic]
sig:75 [in Complexity.TM.PrettyBounds.M2MBounds]
sig:76 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
sig:76 [in Undecidability.TM.Hoare.HoareCombinators]
sig:78 [in Complexity.TM.PrettyBounds.M2MBounds]
sig:79 [in Complexity.L.TM.TMflatFun]
sig:79 [in Undecidability.TM.Hoare.HoareLogic]
sig:8 [in Complexity.TM.Code.Decode]
sig:8 [in Undecidability.TM.Code.WriteValue]
Sig:8 [in Complexity.NP.SAT.CookLevin.Reductions.CC_to_BinaryCC]
sig:8 [in Undecidability.TM.Single.EncodeTapes]
sig:84 [in Complexity.TM.PrettyBounds.M2MBounds]
sig:84 [in Undecidability.TM.Hoare.HoareLogic]
sig:86 [in Complexity.L.TM.TMflatComp]
sig:86 [in Undecidability.TM.Hoare.HoareRegister]
sig:88 [in Complexity.L.TM.TMflatComp]
sig:88 [in Undecidability.TM.Hoare.HoareCombinators]
sig:89 [in Complexity.TM.PrettyBounds.M2MBounds]
sig:9 [in Complexity.L.TM.CompCode]
sig:9 [in Complexity.L.TM.TMflat]
sig:9 [in Complexity.NP.SAT.CookLevin.Subproblems.SingleTMGenNP]
sig:9 [in Undecidability.TM.Single.EncodeTapes]
sig:91 [in Undecidability.TM.Hoare.HoareRegister]
sig:93 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
sig:94 [in Undecidability.TM.Hoare.HoareLogic]
sig:95 [in Complexity.TM.PrettyBounds.M2MBounds]
sig:98 [in Complexity.L.TM.TMflatComp]
sig:98 [in Complexity.L.TM.TMunflatten]
sig:98 [in Undecidability.TM.Hoare.HoareRegister]
sig:99 [in Undecidability.TM.Hoare.HoareCombinators]
sizeGt1':67 [in Complexity.TM.PrettyBounds.BaseCode]
sizeGt1:60 [in Complexity.TM.PrettyBounds.BaseCode]
sizeM:35 [in Complexity.NP.TM.M_LM2TM]
sizeM:38 [in Complexity.NP.TM.M_LM2TM]
sizeOfmTapes:28 [in Complexity.NP.TM.mTM_to_singleTapeTM]
sizeOfmTapes:32 [in Complexity.NP.TM.mTM_to_singleTapeTM]
sizeQ:16 [in Complexity.L.AbstractMachines.FunctionalDefinitions]
sizeQ:2 [in Complexity.L.AbstractMachines.FunctionalDefinitions]
size_X_ge1:96 [in Complexity.TM.PrettyBounds.UnivBounds]
size':23 [in Complexity.HierarchyTheorem.TimeHierarchyTheorem]
size':64 [in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
size':70 [in Complexity.L.AbstractMachines.Computable.EvalForTime]
size:122 [in Undecidability.TM.Univ.LowLevel]
size:124 [in Undecidability.TM.L.HeapInterpreter.StepTM]
size:13 [in Complexity.HierarchyTheorem.TimeHierarchyTheorem]
size:13 [in Complexity.L.AbstractMachines.Computable.UnivDecTime]
size:141 [in Undecidability.TM.Univ.LookupAssociativeListTM]
size:149 [in Complexity.L.AbstractMachines.AbstractHeapMachine]
size:16 [in Undecidability.TM.Code.List.Rev]
size:162 [in Undecidability.L.Prelim.ARS]
size:174 [in Undecidability.L.Prelim.ARS]
size:175 [in Undecidability.TM.Univ.Univ]
size:178 [in Undecidability.TM.L.HeapInterpreter.StepTM]
size:180 [in Undecidability.L.Prelim.ARS]
size:216 [in Undecidability.TM.L.HeapInterpreter.StepTM]
size:22 [in Complexity.HierarchyTheorem.TimeHierarchyTheorem]
size:25 [in Complexity.HierarchyTheorem.TimeHierarchyTheorem]
size:31 [in Complexity.NP.TM.M_LM2TM]
size:37 [in Undecidability.TM.Code.List.Rev]
size:41 [in Complexity.NP.TM.M_LM2TM]
size:43 [in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
size:44 [in Complexity.NP.TM.M_LM2TM]
size:47 [in Complexity.L.AbstractMachines.Computable.EvalForTime]
size:49 [in Undecidability.TM.Hoare.HoareRegister]
size:5 [in Complexity.L.AbstractMachines.Computable.EvalForTimeBool]
size:52 [in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
size:54 [in Undecidability.TM.L.HeapInterpreter.LookupTM]
size:55 [in Undecidability.TM.Hoare.HoareRegister]
size:57 [in Undecidability.TM.Code.List.Rev]
size:62 [in Undecidability.TM.L.HeapInterpreter.StepTM]
size:63 [in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
size:67 [in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
size:69 [in Complexity.L.AbstractMachines.Computable.EvalForTime]
size:72 [in Complexity.L.AbstractMachines.Computable.EvalForTime]
size:90 [in Undecidability.TM.Univ.LowLevel]
size:94 [in Undecidability.TM.L.HeapInterpreter.StepTM]
size:99 [in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
si:123 [in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
sm:102 [in Undecidability.TM.Code.NatTM]
sm:21 [in Undecidability.TM.Code.NatTM]
sm:64 [in Undecidability.TM.Code.NatTM]
sm:83 [in Undecidability.TM.Code.NatTM]
sm:92 [in Undecidability.TM.Code.NatTM]
sn:103 [in Undecidability.TM.Code.NatTM]
Sn:11 [in Undecidability.L.Computability.MuRec]
sn:16 [in Undecidability.TM.Code.CaseNat]
sn:20 [in Undecidability.TM.Code.CaseNat]
sn:22 [in Undecidability.TM.Code.NatTM]
sn:65 [in Undecidability.TM.Code.NatTM]
sn:8 [in Undecidability.TM.Code.CaseNat]
sn:84 [in Undecidability.TM.Code.NatTM]
sn:93 [in Undecidability.TM.Code.NatTM]
so:104 [in Undecidability.TM.Code.NatTM]
so:29 [in Undecidability.TM.Code.NatTM]
so:38 [in Undecidability.TM.Code.NatTM]
so:94 [in Undecidability.TM.Code.NatTM]
spaces:53 [in Undecidability.TM.Hoare.HoareRegister]
space:127 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
space:209 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
space:228 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
spec:12 [in Undecidability.TM.Hoare.HoareRegister]
spec:25 [in Undecidability.TM.Hoare.HoareRegister]
sr:123 [in Undecidability.TM.L.HeapInterpreter.StepTM]
sr:172 [in Undecidability.TM.Univ.Univ]
sr:215 [in Undecidability.TM.L.HeapInterpreter.StepTM]
sr:38 [in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
sr:61 [in Undecidability.TM.L.HeapInterpreter.StepTM]
ss'':405 [in Undecidability.TM.Hoare.HoareRegister]
ss'':423 [in Undecidability.TM.Hoare.HoareRegister]
ss':219 [in Undecidability.TM.Hoare.HoareRegister]
ss':351 [in Undecidability.TM.Hoare.HoareRegister]
ss':362 [in Undecidability.TM.Hoare.HoareRegister]
ss':374 [in Undecidability.TM.Hoare.HoareRegister]
ss':389 [in Undecidability.TM.Hoare.HoareRegister]
ss':404 [in Undecidability.TM.Hoare.HoareRegister]
ss':422 [in Undecidability.TM.Hoare.HoareRegister]
ss':545 [in Undecidability.TM.Hoare.HoareRegister]
ss':559 [in Undecidability.TM.Hoare.HoareRegister]
ss':571 [in Undecidability.TM.Hoare.HoareRegister]
ss':583 [in Undecidability.TM.Hoare.HoareRegister]
ss:10 [in Undecidability.TM.Code.CaseBool]
ss:10 [in Undecidability.TM.Univ.Univ]
ss:100 [in Undecidability.TM.Hoare.HoareMult]
ss:100 [in Undecidability.TM.Univ.LookupAssociativeListTM]
ss:100 [in Undecidability.TM.L.HeapInterpreter.LookupTM]
ss:104 [in Undecidability.TM.Univ.LookupAssociativeListTM]
ss:105 [in Undecidability.TM.L.HeapInterpreter.LookupTM]
ss:106 [in Undecidability.TM.Hoare.HoareMult]
ss:107 [in Undecidability.TM.Code.CaseList]
ss:108 [in Undecidability.TM.Code.CaseList]
ss:109 [in Undecidability.TM.Univ.LookupAssociativeListTM]
ss:109 [in Undecidability.TM.L.HeapInterpreter.LookupTM]
ss:11 [in Undecidability.TM.Hoare.HoareExamples]
ss:112 [in Undecidability.TM.Code.CaseList]
ss:112 [in Undecidability.TM.Code.List.Nth]
ss:112 [in Undecidability.TM.Hoare.HoareMult]
ss:114 [in Undecidability.TM.Univ.LookupAssociativeListTM]
ss:117 [in Undecidability.TM.Hoare.HoareMult]
ss:118 [in Undecidability.TM.Univ.LookupAssociativeListTM]
ss:122 [in Undecidability.TM.Hoare.HoareMult]
ss:127 [in Undecidability.TM.Hoare.HoareMult]
ss:13 [in Undecidability.TM.Univ.Univ]
ss:133 [in Undecidability.TM.Hoare.HoareMult]
ss:139 [in Undecidability.TM.Hoare.HoareMult]
ss:14 [in Undecidability.TM.Code.CaseFin]
ss:14 [in Undecidability.TM.Code.CaseSum]
ss:144 [in Undecidability.TM.Hoare.HoareMult]
ss:153 [in Undecidability.TM.Univ.LookupAssociativeListTM]
ss:155 [in Undecidability.TM.Hoare.HoareMult]
ss:16 [in Undecidability.TM.Hoare.HoareMult]
ss:162 [in Undecidability.TM.Hoare.HoareExamples]
ss:17 [in Undecidability.TM.Hoare.HoareMult]
ss:17 [in Undecidability.TM.Univ.Univ]
ss:18 [in Undecidability.TM.Code.List.Cons_constant]
ss:20 [in Undecidability.TM.Univ.Univ]
ss:201 [in Undecidability.TM.Hoare.HoareRegister]
ss:208 [in Undecidability.TM.Hoare.HoareExamples]
ss:209 [in Undecidability.TM.Hoare.HoareExamples]
ss:21 [in Undecidability.TM.Code.CaseNat]
ss:21 [in Undecidability.TM.Hoare.HoareMult]
ss:21 [in Undecidability.TM.L.CaseCom]
ss:213 [in Undecidability.TM.Hoare.HoareExamples]
ss:218 [in Undecidability.TM.Hoare.HoareRegister]
ss:218 [in Undecidability.TM.Hoare.HoareExamples]
ss:22 [in Undecidability.TM.Code.CaseSum]
ss:223 [in Undecidability.TM.Hoare.HoareExamples]
ss:226 [in Undecidability.TM.Code.Copy]
ss:227 [in Undecidability.TM.Hoare.HoareExamples]
ss:23 [in Undecidability.TM.Code.CaseNat]
ss:231 [in Undecidability.TM.Hoare.HoareExamples]
ss:235 [in Undecidability.TM.Hoare.HoareExamples]
ss:239 [in Undecidability.TM.Code.Copy]
ss:24 [in Undecidability.TM.Hoare.HoareExamples]
ss:240 [in Undecidability.TM.Hoare.HoareExamples]
ss:245 [in Undecidability.TM.Hoare.HoareExamples]
ss:249 [in Undecidability.TM.Hoare.HoareExamples]
ss:25 [in Undecidability.TM.L.HeapInterpreter.LookupTM]
ss:252 [in Undecidability.TM.Code.Copy]
ss:26 [in Undecidability.TM.Code.CaseSum]
ss:26 [in Undecidability.TM.Hoare.HoareMult]
ss:26 [in Undecidability.TM.L.CaseCom]
ss:261 [in Undecidability.TM.Hoare.HoareExamples]
ss:265 [in Undecidability.TM.Code.Copy]
ss:27 [in Undecidability.TM.Code.CaseNat]
ss:278 [in Undecidability.TM.Code.Copy]
ss:28 [in Undecidability.TM.Code.List.Nth]
ss:281 [in Undecidability.TM.Hoare.HoareExamples]
ss:291 [in Undecidability.TM.Code.Copy]
ss:304 [in Undecidability.TM.Code.Copy]
ss:308 [in Undecidability.TM.Hoare.HoareRegister]
ss:31 [in Undecidability.TM.Hoare.HoareMult]
ss:315 [in Undecidability.TM.Hoare.HoareRegister]
ss:317 [in Undecidability.TM.Code.Copy]
ss:322 [in Undecidability.TM.Hoare.HoareRegister]
ss:332 [in Undecidability.TM.Hoare.HoareRegister]
ss:343 [in Undecidability.TM.Code.Copy]
ss:343 [in Undecidability.TM.Hoare.HoareExamples]
ss:344 [in Undecidability.TM.Hoare.HoareExamples]
ss:349 [in Undecidability.TM.Hoare.HoareExamples]
ss:35 [in Undecidability.TM.Hoare.HoareMult]
ss:350 [in Undecidability.TM.Hoare.HoareRegister]
ss:355 [in Undecidability.TM.Hoare.HoareExamples]
ss:361 [in Undecidability.TM.Hoare.HoareRegister]
ss:361 [in Undecidability.TM.Hoare.HoareExamples]
ss:366 [in Undecidability.TM.Code.Copy]
ss:366 [in Undecidability.TM.Hoare.HoareExamples]
ss:371 [in Undecidability.TM.Hoare.HoareExamples]
ss:373 [in Undecidability.TM.Hoare.HoareRegister]
ss:376 [in Undecidability.TM.Hoare.HoareExamples]
ss:382 [in Undecidability.TM.Hoare.HoareExamples]
ss:385 [in Undecidability.TM.Code.Copy]
ss:388 [in Undecidability.TM.Hoare.HoareRegister]
ss:388 [in Undecidability.TM.Hoare.HoareExamples]
ss:39 [in Undecidability.TM.Hoare.HoareMult]
ss:393 [in Undecidability.TM.Hoare.HoareExamples]
ss:400 [in Undecidability.TM.Code.Copy]
ss:403 [in Undecidability.TM.Hoare.HoareRegister]
ss:406 [in Undecidability.TM.Hoare.HoareExamples]
ss:411 [in Undecidability.TM.Hoare.HoareExamples]
ss:421 [in Undecidability.TM.Hoare.HoareRegister]
ss:43 [in Undecidability.TM.Hoare.HoareMult]
ss:44 [in Undecidability.TM.Code.WriteValue]
ss:45 [in Undecidability.TM.Univ.Univ]
ss:457 [in Undecidability.TM.Hoare.HoareRegister]
ss:47 [in Undecidability.TM.Code.List.Rev]
ss:48 [in Undecidability.TM.Code.CompareValue]
ss:48 [in Undecidability.TM.Hoare.HoareMult]
ss:48 [in Undecidability.TM.Code.List.App]
ss:50 [in Undecidability.TM.Univ.LookupAssociativeListTM]
ss:53 [in Undecidability.TM.Hoare.HoareMult]
ss:54 [in Undecidability.TM.Code.List.Nth]
ss:544 [in Undecidability.TM.Hoare.HoareRegister]
ss:55 [in Undecidability.TM.Code.CompareValue]
ss:558 [in Undecidability.TM.Hoare.HoareRegister]
ss:56 [in Undecidability.TM.Code.List.Nth]
ss:56 [in Undecidability.TM.Hoare.HoareExamples]
ss:57 [in Undecidability.TM.Hoare.HoareMult]
ss:570 [in Undecidability.TM.Hoare.HoareRegister]
ss:58 [in Undecidability.TM.Code.CaseSum]
ss:582 [in Undecidability.TM.Hoare.HoareRegister]
ss:6 [in Undecidability.TM.Hoare.HoareMult]
ss:60 [in Undecidability.TM.Code.List.Nth]
ss:60 [in Undecidability.TM.Code.CaseSum]
ss:62 [in Undecidability.TM.Code.CaseSum]
ss:63 [in Undecidability.TM.Code.List.Rev]
ss:65 [in Undecidability.TM.Code.List.Nth]
ss:65 [in Undecidability.TM.L.HeapInterpreter.LookupTM]
ss:65 [in Undecidability.TM.Code.List.App]
ss:67 [in Undecidability.TM.Hoare.HoareMult]
ss:67 [in Undecidability.TM.L.HeapInterpreter.LookupTM]
ss:68 [in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
ss:69 [in Undecidability.TM.Code.CaseSum]
ss:70 [in Undecidability.TM.Code.List.Nth]
ss:70 [in Undecidability.TM.Code.CaseSum]
ss:70 [in Undecidability.TM.Univ.Univ]
ss:71 [in Undecidability.TM.L.HeapInterpreter.LookupTM]
ss:72 [in Undecidability.TM.Lifting.LiftTapes]
ss:74 [in Undecidability.TM.Code.List.Nth]
ss:74 [in Undecidability.TM.Code.CaseSum]
ss:75 [in Undecidability.TM.Univ.Univ]
ss:76 [in Undecidability.TM.Univ.LookupAssociativeListTM]
ss:77 [in Undecidability.TM.L.HeapInterpreter.LookupTM]
ss:78 [in Undecidability.TM.Code.List.Nth]
ss:78 [in Undecidability.TM.Univ.LookupAssociativeListTM]
ss:79 [in Undecidability.TM.Hoare.HoareMult]
ss:79 [in Undecidability.TM.Univ.Univ]
ss:82 [in Undecidability.TM.Code.List.Nth]
ss:82 [in Undecidability.TM.Univ.LookupAssociativeListTM]
ss:82 [in Undecidability.TM.L.HeapInterpreter.LookupTM]
ss:83 [in Undecidability.TM.Univ.Univ]
ss:86 [in Undecidability.TM.L.HeapInterpreter.LookupTM]
ss:86 [in Undecidability.TM.Code.CasePair]
ss:87 [in Undecidability.TM.Code.List.Nth]
ss:87 [in Undecidability.TM.Univ.LookupAssociativeListTM]
ss:87 [in Undecidability.TM.Univ.Univ]
ss:89 [in Undecidability.TM.Code.CasePair]
ss:89 [in Undecidability.TM.Hoare.HoareExamples]
ss:90 [in Undecidability.TM.L.HeapInterpreter.LookupTM]
ss:91 [in Undecidability.TM.Univ.Univ]
ss:91 [in Undecidability.TM.Hoare.HoareExamples]
ss:92 [in Undecidability.TM.Code.List.Nth]
ss:92 [in Undecidability.TM.Univ.LookupAssociativeListTM]
ss:94 [in Undecidability.TM.Hoare.HoareMult]
ss:94 [in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
ss:94 [in Undecidability.TM.L.HeapInterpreter.LookupTM]
ss:95 [in Undecidability.TM.Hoare.HoareMult]
ss:95 [in Undecidability.TM.Univ.Univ]
ss:96 [in Undecidability.TM.Code.List.Nth]
ss:96 [in Undecidability.TM.Univ.LookupAssociativeListTM]
ss:97 [in Undecidability.TM.Hoare.HoareExamples]
stack':106 [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
stack':113 [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
stack':121 [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
stack':129 [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
stack':136 [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
stack':143 [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
stack':22 [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
stack':31 [in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisUnfoldClos]
stack':47 [in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisUnfoldClos]
stack':69 [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
stack':76 [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
stack':84 [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
stack':92 [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
stack':99 [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
stack2:29 [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
stack:10 [in Complexity.L.AbstractMachines.FlatPro.Computable.Compile]
stack:11 [in Complexity.L.AbstractMachines.Computable.LargestVar]
stack:13 [in Undecidability.L.AbstractMachines.FlatPro.UnfoldClos]
stack:15 [in Complexity.L.AbstractMachines.Computable.Unfolding]
stack:17 [in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisUnfoldClos]
stack:2 [in Undecidability.L.Functions.Size]
stack:20 [in Complexity.L.AbstractMachines.UnfoldTailRec]
stack:20 [in Undecidability.L.Functions.Size]
stack:22 [in Complexity.L.AbstractMachines.Computable.Unfolding]
stack:22 [in Complexity.L.AbstractMachines.Computable.LargestVar]
stack:23 [in Complexity.L.AbstractMachines.FlatPro.Computable.Compile]
stack:25 [in Undecidability.L.Functions.Size]
stack:27 [in Complexity.L.AbstractMachines.FlatPro.Computable.Compile]
stack:27 [in Complexity.L.AbstractMachines.Computable.LargestVar]
stack:3 [in Complexity.L.AbstractMachines.Computable.Unfolding]
stack:3 [in Undecidability.L.AbstractMachines.FlatPro.UnfoldClos]
stack:3 [in Complexity.L.AbstractMachines.FlatPro.Computable.Compile]
stack:30 [in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisUnfoldClos]
stack:30 [in Undecidability.L.Functions.Size]
stack:31 [in Complexity.L.AbstractMachines.FlatPro.Computable.Compile]
stack:32 [in Complexity.L.AbstractMachines.Computable.LargestVar]
stack:33 [in Complexity.L.AbstractMachines.UnfoldTailRec]
stack:35 [in Complexity.L.AbstractMachines.FlatPro.Computable.Compile]
stack:35 [in Undecidability.L.Functions.Size]
stack:37 [in Complexity.L.AbstractMachines.Computable.LargestVar]
stack:39 [in Complexity.L.AbstractMachines.FlatPro.Computable.Compile]
stack:4 [in Complexity.L.AbstractMachines.Computable.LargestVar]
stack:40 [in Undecidability.L.Functions.Size]
stack:42 [in Complexity.L.AbstractMachines.Computable.LargestVar]
stack:43 [in Complexity.L.AbstractMachines.FlatPro.Computable.Compile]
stack:45 [in Undecidability.L.Functions.Size]
stack:47 [in Complexity.L.AbstractMachines.Computable.LargestVar]
stack:48 [in Complexity.L.AbstractMachines.UnfoldTailRec]
stack:7 [in Complexity.L.AbstractMachines.UnfoldTailRec]
stack:9 [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
stack:9 [in Undecidability.L.Functions.Size]
startA:10 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
startA:123 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
startA:136 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
startA:142 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
startA:147 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
startA:153 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
startA:18 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
startA:190 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
startA:23 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
startA:28 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
startA:3 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
startB:11 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
startB:124 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
startB:137 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
startB:143 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
startB:148 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
startB:154 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
startB:19 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
startB:24 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
startB:29 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
startB:4 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
start1:105 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
start1:80 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
start1:84 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
start1:96 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
start2:106 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
start2:81 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
start2:85 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
start2:97 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
start:13 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
start:16 [in Undecidability.L.Datatypes.List.List_extra]
start:180 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
start:187 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
start:193 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
start:194 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
start:199 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
start:204 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
start:210 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
start:213 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
start:217 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
start:221 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
start:226 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
start:229 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
start:232 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
start:235 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
start:238 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
start:240 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
start:240 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
start:242 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
start:244 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
start:247 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
start:249 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
start:252 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
start:258 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
start:261 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
start:30 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
start:34 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
start:35 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
start:36 [in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
start:37 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
start:4 [in Undecidability.L.TM.TMinL]
start:42 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
start:42 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
start:48 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
start:53 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
start:55 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
start:6 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
start:61 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
start:65 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
start:70 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
start:71 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
start:72 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
start:74 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
start:77 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
states:1035 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
states:1040 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
states:1060 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
states:1065 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
states:1072 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
states:1076 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
states:1080 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
states:1085 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
states:1089 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
states:1093 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
states:1097 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
states:1101 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
states:1106 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
states:160 [in Complexity.L.TM.TMunflatten]
states:172 [in Complexity.L.TM.TMunflatten]
states:18 [in Complexity.L.TM.TMunflatten]
states:197 [in Complexity.L.TM.TMunflatten]
states:201 [in Complexity.L.TM.TMunflatten]
states:219 [in Complexity.L.TM.TMflatComp]
states:227 [in Complexity.L.TM.TMflatComp]
states:232 [in Complexity.L.TM.TMflatComp]
states:236 [in Complexity.L.TM.TMflatComp]
states:29 [in Complexity.L.TM.TMunflatten]
states:37 [in Complexity.NP.SAT.CookLevin.Subproblems.SingleTMGenNP]
states:38 [in Complexity.L.TM.TMflatComp]
states:55 [in Complexity.L.TM.TMunflatten]
state:253 [in Undecidability.TM.Util.TM_facts]
stepindex:121 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
stepindex:134 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
stepindex:140 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
stepindex:16 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
stepindex:178 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
stepindex:191 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
stepindex:197 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
stepindex:202 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
stepindex:208 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
stepindex:40 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
stepi:128 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
stepi:145 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
stepi:151 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
stepi:185 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
steps__LM:39 [in Complexity.NP.TM.M_LM2TM]
steps__LM:36 [in Complexity.NP.TM.M_LM2TM]
steps__LM:19 [in Complexity.NP.TM.M_LM2TM]
steps:1 [in Complexity.NP.L.GenNPBool]
steps:111 [in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
steps:12 [in Complexity.NP.L.LMGenNP]
steps:13 [in Complexity.NP.TM.mTM_to_singleTapeTM]
steps:13 [in Complexity.NP.TM.TMGenNP_fixed_mTM]
steps:14 [in Complexity.NP.SAT.CookLevin.Subproblems.SingleTMGenNP]
steps:17 [in Complexity.NP.TM.mTM_to_singleTapeTM]
steps:17 [in Complexity.NP.TM.TMGenNP]
steps:22 [in Complexity.NP.SAT.CookLevin.Subproblems.SingleTMGenNP]
steps:228 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
steps:23 [in Complexity.NP.TM.TMGenNP]
steps:25 [in Complexity.NP.TM.TMGenNP_fixed_mTM]
steps:26 [in Complexity.NP.L.GenNPBool]
steps:29 [in Complexity.NP.TM.mTM_to_singleTapeTM]
steps:3 [in Complexity.NP.TM.TMGenNP]
steps:3 [in Complexity.NP.SAT.CookLevin.Reductions.TMGenNP_fixed_singleTapeTM_to_FlatFunSingleTMGenNP]
steps:3 [in Complexity.NP.TM.L_to_LM]
steps:3 [in Complexity.NP.L.GenNP]
steps:31 [in Complexity.NP.L.GenNPBool]
steps:32 [in Complexity.NP.TM.M_LM2TM]
steps:33 [in Complexity.NP.TM.mTM_to_singleTapeTM]
steps:33 [in Complexity.NP.TM.TMGenNP]
steps:33 [in Complexity.NP.L.GenNPBool]
steps:38 [in Complexity.NP.L.GenNPBool]
steps:4 [in Complexity.NP.TM.TMGenNP_fixed_mTM]
steps:42 [in Complexity.NP.TM.M_LM2TM]
steps:44 [in Complexity.NP.TM.TMGenNP]
steps:44 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
steps:45 [in Complexity.NP.TM.M_LM2TM]
steps:46 [in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
steps:49 [in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
steps:49 [in Complexity.NP.TM.TMGenNP]
steps:52 [in Complexity.NP.SAT.CookLevin.Subproblems.SingleTMGenNP]
steps:53 [in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
steps:595 [in Complexity.NP.TM.LM_to_mTM]
steps:600 [in Complexity.NP.TM.LM_to_mTM]
steps:605 [in Complexity.NP.TM.LM_to_mTM]
steps:609 [in Complexity.NP.TM.LM_to_mTM]
steps:618 [in Complexity.NP.TM.LM_to_mTM]
steps:622 [in Complexity.NP.TM.LM_to_mTM]
steps:7 [in Complexity.NP.TM.L_to_LM]
steps:70 [in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
steps:9 [in Complexity.NP.TM.TMGenNP]
steps:9 [in Complexity.NP.L.GenNP]
stepT:120 [in Complexity.Libs.CookPrelim.PolyBounds]
step:114 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
step:119 [in Complexity.Libs.CookPrelim.PolyBounds]
step:120 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
step:123 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
step:129 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
step:136 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
step:144 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
step:153 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
step:163 [in Undecidability.L.Prelim.ARS]
step:175 [in Undecidability.L.Prelim.ARS]
step:181 [in Undecidability.L.Prelim.ARS]
step:190 [in Undecidability.L.Prelim.ARS]
step:209 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
step:211 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
step:215 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
step:217 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
step:221 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
step:225 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
step:234 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
step:237 [in Undecidability.L.Prelim.ARS]
step:243 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
stop':190 [in Undecidability.TM.Compound.Compare]
stop':204 [in Undecidability.TM.Compound.Compare]
str'':20 [in Undecidability.TM.Code.ChangeAlphabet]
str':15 [in Undecidability.TM.Code.ChangeAlphabet]
str':18 [in Undecidability.TM.Code.BinNumbers.EncodeBinNumbers]
str':19 [in Undecidability.TM.Code.ChangeAlphabet]
str':50 [in Undecidability.TM.Code.ChangeAlphabet]
str':6 [in Undecidability.TM.Code.ChangeAlphabet]
str':8 [in Undecidability.TM.Code.ChangeAlphabet]
str1:10 [in Undecidability.TM.Code.Copy]
str1:124 [in Undecidability.TM.Compound.Compare]
str1:126 [in Undecidability.TM.Compound.MoveToSymbol]
str1:131 [in Undecidability.TM.Compound.Compare]
str1:143 [in Undecidability.TM.Compound.Compare]
str1:147 [in Undecidability.TM.Compound.MoveToSymbol]
str1:152 [in Undecidability.TM.Compound.Compare]
str1:163 [in Undecidability.TM.Compound.Compare]
str1:174 [in Undecidability.TM.Compound.Compare]
str1:181 [in Undecidability.TM.Compound.Compare]
str1:191 [in Undecidability.TM.Compound.Compare]
str1:205 [in Undecidability.TM.Compound.Compare]
str1:29 [in Undecidability.TM.Code.Copy]
str2:12 [in Undecidability.TM.Code.ChangeAlphabet]
str2:12 [in Undecidability.TM.Code.Copy]
str2:125 [in Undecidability.TM.Compound.Compare]
str2:127 [in Undecidability.TM.Compound.MoveToSymbol]
str2:132 [in Undecidability.TM.Compound.Compare]
str2:144 [in Undecidability.TM.Compound.Compare]
str2:148 [in Undecidability.TM.Compound.MoveToSymbol]
str2:153 [in Undecidability.TM.Compound.Compare]
str2:164 [in Undecidability.TM.Compound.Compare]
str2:17 [in Undecidability.TM.Code.ChangeAlphabet]
str2:175 [in Undecidability.TM.Compound.Compare]
str2:182 [in Undecidability.TM.Compound.Compare]
str2:192 [in Undecidability.TM.Compound.Compare]
str2:206 [in Undecidability.TM.Compound.Compare]
str2:31 [in Undecidability.TM.Code.Copy]
str3:126 [in Undecidability.TM.Compound.Compare]
str3:133 [in Undecidability.TM.Compound.Compare]
str3:18 [in Undecidability.TM.Code.ChangeAlphabet]
str:108 [in Undecidability.TM.Compound.Compare]
str:11 [in Undecidability.TM.Code.ChangeAlphabet]
str:115 [in Undecidability.TM.Compound.Compare]
str:13 [in Undecidability.TM.Compound.WriteString]
str:16 [in Undecidability.TM.Code.ChangeAlphabet]
str:17 [in Undecidability.TM.Compound.WriteString]
str:21 [in Undecidability.TM.Compound.WriteString]
str:22 [in Undecidability.TM.Compound.WriteString]
str:25 [in Undecidability.TM.Compound.WriteString]
str:35 [in Undecidability.TM.Compound.WriteString]
str:38 [in Undecidability.TM.Compound.WriteString]
str:41 [in Undecidability.TM.Compound.WriteString]
str:44 [in Undecidability.TM.Compound.WriteString]
str:48 [in Undecidability.TM.Code.ChangeAlphabet]
str:5 [in Undecidability.TM.Code.ChangeAlphabet]
str:7 [in Undecidability.TM.Code.ChangeAlphabet]
str:7 [in Undecidability.L.Prelim.StringBase]
str:8 [in Undecidability.TM.Compound.WriteString]
st__o:27 [in Complexity.L.TM.TMunflatten]
st':166 [in Undecidability.Shared.Libs.DLW.Code.sss]
st':169 [in Undecidability.Shared.Libs.DLW.Code.sss]
st':176 [in Undecidability.Shared.Libs.DLW.Code.sss]
st':179 [in Undecidability.Shared.Libs.DLW.Code.sss]
st':201 [in Undecidability.Shared.Libs.DLW.Code.sss]
st':208 [in Undecidability.Shared.Libs.DLW.Code.sss]
st':34 [in Undecidability.Shared.Libs.DLW.Code.sss]
st':38 [in Undecidability.Shared.Libs.DLW.Code.sss]
st1:10 [in Undecidability.Shared.Libs.DLW.Code.sss]
st1:102 [in Undecidability.Shared.Libs.DLW.Code.sss]
st1:105 [in Undecidability.Shared.Libs.DLW.Code.sss]
st1:109 [in Undecidability.Shared.Libs.DLW.Code.sss]
st1:113 [in Undecidability.Shared.Libs.DLW.Code.sss]
st1:117 [in Undecidability.Shared.Libs.DLW.Code.sss]
st1:121 [in Undecidability.Shared.Libs.DLW.Code.sss]
st1:125 [in Undecidability.Shared.Libs.DLW.Code.sss]
st1:129 [in Undecidability.Shared.Libs.DLW.Code.sss]
st1:134 [in Undecidability.Shared.Libs.DLW.Code.sss]
st1:138 [in Undecidability.Shared.Libs.DLW.Code.sss]
st1:14 [in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
st1:14 [in Undecidability.Shared.Libs.DLW.Code.sss]
st1:142 [in Undecidability.Shared.Libs.DLW.Code.sss]
st1:146 [in Undecidability.Shared.Libs.DLW.Code.sss]
st1:152 [in Undecidability.Shared.Libs.DLW.Code.sss]
st1:157 [in Undecidability.Shared.Libs.DLW.Code.sss]
st1:162 [in Undecidability.Shared.Libs.DLW.Code.sss]
st1:172 [in Undecidability.Shared.Libs.DLW.Code.sss]
st1:19 [in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
st1:212 [in Undecidability.Shared.Libs.DLW.Code.sss]
st1:219 [in Undecidability.Shared.Libs.DLW.Code.sss]
st1:224 [in Undecidability.Shared.Libs.DLW.Code.sss]
st1:230 [in Undecidability.Shared.Libs.DLW.Code.sss]
st1:237 [in Undecidability.Shared.Libs.DLW.Code.sss]
st1:241 [in Undecidability.Shared.Libs.DLW.Code.sss]
st1:249 [in Undecidability.Shared.Libs.DLW.Code.sss]
st1:258 [in Undecidability.Shared.Libs.DLW.Code.sss]
st1:263 [in Undecidability.Shared.Libs.DLW.Code.sss]
st1:266 [in Undecidability.Shared.Libs.DLW.Code.sss]
st1:271 [in Undecidability.Shared.Libs.DLW.Code.sss]
st1:278 [in Undecidability.Shared.Libs.DLW.Code.sss]
st1:285 [in Undecidability.Shared.Libs.DLW.Code.sss]
st1:29 [in Undecidability.Shared.Libs.DLW.Code.sss]
st1:292 [in Undecidability.Shared.Libs.DLW.Code.sss]
st1:297 [in Undecidability.Shared.Libs.DLW.Code.sss]
st1:300 [in Undecidability.Shared.Libs.DLW.Code.sss]
st1:303 [in Undecidability.Shared.Libs.DLW.Code.sss]
st1:308 [in Undecidability.Shared.Libs.DLW.Code.sss]
st1:40 [in Undecidability.Shared.Libs.DLW.Code.sss]
st1:45 [in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
st1:47 [in Undecidability.Shared.Libs.DLW.Code.sss]
st1:51 [in Undecidability.Shared.Libs.DLW.Code.sss]
st1:54 [in Undecidability.Shared.Libs.DLW.Code.sss]
st1:59 [in Undecidability.Shared.Libs.DLW.Code.sss]
st1:63 [in Undecidability.Shared.Libs.DLW.Code.sss]
st1:66 [in Undecidability.Shared.Libs.DLW.Code.sss]
st1:73 [in Undecidability.Shared.Libs.DLW.Code.sss]
st1:78 [in Undecidability.Shared.Libs.DLW.Code.sss]
st1:90 [in Undecidability.Shared.Libs.DLW.Code.sss]
st1:94 [in Undecidability.Shared.Libs.DLW.Code.sss]
st1:98 [in Undecidability.Shared.Libs.DLW.Code.sss]
st2:103 [in Undecidability.Shared.Libs.DLW.Code.sss]
st2:106 [in Undecidability.Shared.Libs.DLW.Code.sss]
st2:11 [in Undecidability.Shared.Libs.DLW.Code.sss]
st2:110 [in Undecidability.Shared.Libs.DLW.Code.sss]
st2:114 [in Undecidability.Shared.Libs.DLW.Code.sss]
st2:118 [in Undecidability.Shared.Libs.DLW.Code.sss]
st2:122 [in Undecidability.Shared.Libs.DLW.Code.sss]
st2:126 [in Undecidability.Shared.Libs.DLW.Code.sss]
st2:130 [in Undecidability.Shared.Libs.DLW.Code.sss]
st2:135 [in Undecidability.Shared.Libs.DLW.Code.sss]
st2:139 [in Undecidability.Shared.Libs.DLW.Code.sss]
st2:143 [in Undecidability.Shared.Libs.DLW.Code.sss]
st2:147 [in Undecidability.Shared.Libs.DLW.Code.sss]
st2:15 [in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
st2:15 [in Undecidability.Shared.Libs.DLW.Code.sss]
st2:153 [in Undecidability.Shared.Libs.DLW.Code.sss]
st2:158 [in Undecidability.Shared.Libs.DLW.Code.sss]
st2:163 [in Undecidability.Shared.Libs.DLW.Code.sss]
st2:173 [in Undecidability.Shared.Libs.DLW.Code.sss]
st2:20 [in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
st2:216 [in Undecidability.Shared.Libs.DLW.Code.sss]
st2:221 [in Undecidability.Shared.Libs.DLW.Code.sss]
st2:225 [in Undecidability.Shared.Libs.DLW.Code.sss]
st2:231 [in Undecidability.Shared.Libs.DLW.Code.sss]
st2:242 [in Undecidability.Shared.Libs.DLW.Code.sss]
st2:251 [in Undecidability.Shared.Libs.DLW.Code.sss]
st2:261 [in Undecidability.Shared.Libs.DLW.Code.sss]
st2:267 [in Undecidability.Shared.Libs.DLW.Code.sss]
st2:272 [in Undecidability.Shared.Libs.DLW.Code.sss]
st2:279 [in Undecidability.Shared.Libs.DLW.Code.sss]
st2:286 [in Undecidability.Shared.Libs.DLW.Code.sss]
st2:293 [in Undecidability.Shared.Libs.DLW.Code.sss]
st2:298 [in Undecidability.Shared.Libs.DLW.Code.sss]
st2:30 [in Undecidability.Shared.Libs.DLW.Code.sss]
st2:301 [in Undecidability.Shared.Libs.DLW.Code.sss]
st2:304 [in Undecidability.Shared.Libs.DLW.Code.sss]
st2:309 [in Undecidability.Shared.Libs.DLW.Code.sss]
st2:41 [in Undecidability.Shared.Libs.DLW.Code.sss]
st2:48 [in Undecidability.Shared.Libs.DLW.Code.sss]
st2:49 [in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
st2:52 [in Undecidability.Shared.Libs.DLW.Code.sss]
st2:55 [in Undecidability.Shared.Libs.DLW.Code.sss]
st2:60 [in Undecidability.Shared.Libs.DLW.Code.sss]
st2:64 [in Undecidability.Shared.Libs.DLW.Code.sss]
st2:70 [in Undecidability.Shared.Libs.DLW.Code.sss]
st2:76 [in Undecidability.Shared.Libs.DLW.Code.sss]
st2:81 [in Undecidability.Shared.Libs.DLW.Code.sss]
st2:92 [in Undecidability.Shared.Libs.DLW.Code.sss]
st2:95 [in Undecidability.Shared.Libs.DLW.Code.sss]
st2:99 [in Undecidability.Shared.Libs.DLW.Code.sss]
st3:107 [in Undecidability.Shared.Libs.DLW.Code.sss]
st3:111 [in Undecidability.Shared.Libs.DLW.Code.sss]
st3:115 [in Undecidability.Shared.Libs.DLW.Code.sss]
st3:119 [in Undecidability.Shared.Libs.DLW.Code.sss]
st3:148 [in Undecidability.Shared.Libs.DLW.Code.sss]
st3:159 [in Undecidability.Shared.Libs.DLW.Code.sss]
st3:213 [in Undecidability.Shared.Libs.DLW.Code.sss]
st3:220 [in Undecidability.Shared.Libs.DLW.Code.sss]
st3:232 [in Undecidability.Shared.Libs.DLW.Code.sss]
st3:243 [in Undecidability.Shared.Libs.DLW.Code.sss]
st3:259 [in Undecidability.Shared.Libs.DLW.Code.sss]
st3:264 [in Undecidability.Shared.Libs.DLW.Code.sss]
st3:268 [in Undecidability.Shared.Libs.DLW.Code.sss]
st3:273 [in Undecidability.Shared.Libs.DLW.Code.sss]
st3:280 [in Undecidability.Shared.Libs.DLW.Code.sss]
st3:287 [in Undecidability.Shared.Libs.DLW.Code.sss]
st3:305 [in Undecidability.Shared.Libs.DLW.Code.sss]
st3:49 [in Undecidability.Shared.Libs.DLW.Code.sss]
st3:61 [in Undecidability.Shared.Libs.DLW.Code.sss]
st3:67 [in Undecidability.Shared.Libs.DLW.Code.sss]
st3:74 [in Undecidability.Shared.Libs.DLW.Code.sss]
st3:79 [in Undecidability.Shared.Libs.DLW.Code.sss]
st3:91 [in Undecidability.Shared.Libs.DLW.Code.sss]
st:154 [in Undecidability.Shared.Libs.DLW.Code.sss]
st:165 [in Undecidability.Shared.Libs.DLW.Code.sss]
st:168 [in Undecidability.Shared.Libs.DLW.Code.sss]
st:175 [in Undecidability.Shared.Libs.DLW.Code.sss]
st:178 [in Undecidability.Shared.Libs.DLW.Code.sss]
st:18 [in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
st:19 [in Complexity.L.TM.TMflatFun]
st:193 [in Undecidability.Shared.Libs.DLW.Code.sss]
st:196 [in Undecidability.Shared.Libs.DLW.Code.sss]
st:200 [in Undecidability.Shared.Libs.DLW.Code.sss]
st:203 [in Undecidability.Shared.Libs.DLW.Code.sss]
st:207 [in Undecidability.Shared.Libs.DLW.Code.sss]
st:236 [in Undecidability.Shared.Libs.DLW.Code.sss]
st:24 [in Complexity.L.TM.TMunflatten]
st:243 [in Complexity.L.TM.TMflatComp]
st:247 [in Undecidability.Shared.Libs.DLW.Code.sss]
st:253 [in Undecidability.Shared.Libs.DLW.Code.sss]
st:254 [in Undecidability.TM.Single.StepTM]
st:256 [in Undecidability.Shared.Libs.DLW.Code.sss]
st:264 [in Undecidability.TM.Single.StepTM]
st:269 [in Undecidability.TM.Single.StepTM]
st:277 [in Undecidability.TM.Single.StepTM]
st:278 [in Undecidability.TM.Single.StepTM]
st:287 [in Undecidability.TM.Single.StepTM]
st:29 [in Complexity.L.TM.TMflat]
st:292 [in Undecidability.TM.Single.StepTM]
st:294 [in Undecidability.Shared.Libs.DLW.Code.sss]
st:299 [in Undecidability.TM.Single.StepTM]
st:307 [in Undecidability.Shared.Libs.DLW.Code.sss]
st:312 [in Undecidability.Shared.Libs.DLW.Code.sss]
st:33 [in Undecidability.Shared.Libs.DLW.Code.sss]
st:37 [in Undecidability.Shared.Libs.DLW.Code.sss]
st:40 [in Complexity.L.TM.TMflatComp]
st:45 [in Undecidability.Shared.Libs.DLW.Code.sss]
st:57 [in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
st:57 [in Complexity.L.TM.TMflat]
st:65 [in Complexity.L.TM.TMflat]
st:8 [in Complexity.L.TM.TMflat]
st:97 [in Complexity.L.TM.TMunflatten]
subs:2791 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
subs:36 [in Complexity.NP.SAT.CookLevin.Subproblems.CC]
subs:89 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
sx:13 [in Undecidability.TM.Code.List.Rev]
sx:143 [in Undecidability.TM.Code.Copy]
sx:163 [in Undecidability.TM.Code.Copy]
sx:175 [in Undecidability.TM.Code.Copy]
sx:28 [in Undecidability.TM.Code.CompareValue]
sx:34 [in Undecidability.TM.Code.List.Rev]
sx:36 [in Undecidability.TM.Code.NatTM]
symbols:145 [in Undecidability.TM.Single.StepTM]
symbols:148 [in Undecidability.TM.Single.StepTM]
symb:13 [in Undecidability.L.Complexity.UpToCNary]
sym_b:3 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
sym_s:2 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
sym:108 [in Undecidability.TM.Lifting.LiftTapes]
sym:16 [in Undecidability.TM.Basic.Mono]
sym:165 [in Undecidability.TM.Compound.MoveToSymbol]
sym:185 [in Undecidability.TM.Compound.MoveToSymbol]
sym:35 [in Undecidability.TM.Basic.Mono]
sym:43 [in Undecidability.TM.Lifting.LiftAlphabet]
sym:50 [in Undecidability.TM.Code.Copy]
sym:6 [in Undecidability.TM.Basic.Duo]
sym:64 [in Undecidability.TM.Code.Copy]
sym:66 [in Complexity.L.TM.TMflatten]
sy:14 [in Undecidability.TM.Code.List.Rev]
sy:170 [in Undecidability.TM.Code.Copy]
sy:176 [in Undecidability.TM.Code.Copy]
sy:29 [in Undecidability.TM.Code.CompareValue]
sy:35 [in Undecidability.TM.Code.List.Rev]
sy:37 [in Undecidability.TM.Code.NatTM]
sz:15 [in Undecidability.TM.Code.List.Rev]
sz:36 [in Undecidability.TM.Code.List.Rev]
s_Univ:457 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
s_Univ:445 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
s_Univ:426 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
s_Univ:376 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
s_Univ:372 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
s_Univ:366 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
s_Univ:358 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
s_Univ:312 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
s_Univ:248 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
s_Univ:238 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
s_Univ:227 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
s_Univ:221 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
s__f:6 [in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
s'':169 [in Undecidability.L.Tactics.Extract]
s'':2642 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s'':2646 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s'':2719 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s'':2724 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s'':2749 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s'':2755 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s'0:167 [in Undecidability.L.Tactics.Extract]
s':10 [in Undecidability.L.Tactics.Lrewrite]
s':100 [in Undecidability.L.Util.L_facts]
s':102 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
s':105 [in Undecidability.L.Complexity.ResourceMeasures]
s':11 [in Undecidability.L.AbstractMachines.FlatPro.ProgramsDef]
s':110 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
S':112 [in Undecidability.L.Prelim.ARS]
s':112 [in Complexity.L.AbstractMachines.AbstractHeapMachine]
s':113 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
s':115 [in Complexity.L.AbstractMachines.AbstractHeapMachine]
s':116 [in Complexity.L.AbstractMachines.AbstractHeapMachine]
s':117 [in Undecidability.L.Complexity.ResourceMeasures]
s':12 [in Undecidability.L.AbstractMachines.FlatPro.UnfoldClos]
s':125 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
s':126 [in Complexity.L.AbstractMachines.AbstractHeapMachine]
s':128 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
s':129 [in Undecidability.L.Util.L_facts]
s':136 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
s':14 [in Undecidability.L.Tactics.Lbeta]
s':15 [in Undecidability.L.Tactics.Lrewrite]
s':15 [in Complexity.L.AbstractMachines.AbstractHeapMachine]
s':156 [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
s':16 [in Complexity.L.TM.TMflat]
s':161 [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
s':163 [in Complexity.L.TM.TMunflatten]
s':168 [in Undecidability.L.Tactics.Extract]
s':169 [in Undecidability.L.Prelim.ARS]
s':175 [in Complexity.L.TM.TMunflatten]
s':178 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
s':182 [in Complexity.L.TM.TMunflatten]
s':189 [in Complexity.L.TM.TMunflatten]
s':19 [in Undecidability.L.Tactics.Lrewrite]
s':19 [in Complexity.L.AbstractMachines.UnfoldTailRec]
s':19 [in Undecidability.TM.L.Eval]
s':2 [in Undecidability.L.Tactics.Lrewrite]
s':20 [in Undecidability.L.Computability.Seval]
s':20 [in Undecidability.L.AbstractMachines.FlatPro.UnfoldClos]
s':20 [in Complexity.L.AbstractMachines.AbstractHeapMachine]
s':21 [in Complexity.L.AbstractMachines.UnfoldHeap]
s':21 [in Undecidability.L.Complexity.ResourceMeasures]
s':219 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
s':22 [in Undecidability.L.Tactics.Lrewrite]
s':22 [in Undecidability.Shared.Libs.DLW.Utils.utils_string]
s':22 [in Undecidability.L.Tactics.Lbeta_nonrefl]
s':221 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
s':221 [in Complexity.L.TM.TMflatComp]
s':223 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
s':229 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
s':232 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
s':234 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
s':24 [in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
s':24 [in Complexity.NP.L.GenNPBool]
s':2549 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s':26 [in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
s':26 [in Undecidability.L.Tactics.Lbeta_nonrefl]
s':26 [in Complexity.L.TM.TMflatFun]
s':2641 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s':2675 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s':2718 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s':2723 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s':2729 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s':2735 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s':2741 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s':2748 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s':2754 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s':2759 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s':2775 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s':2779 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s':28 [in Complexity.L.AbstractMachines.UnfoldTailRec]
s':28 [in Undecidability.L.Tactics.Lbeta_nonrefl]
s':28 [in Complexity.NP.SAT.CookLevin.Subproblems.TM_single]
s':28 [in Complexity.L.AbstractMachines.AbstractHeapMachine]
s':2852 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s':2856 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s':2865 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s':2867 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s':2876 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s':2887 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s':29 [in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisUnfoldClos]
s':29 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
s':29 [in Complexity.NP.L.GenNPBool]
s':2900 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s':2906 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s':3 [in Complexity.NP.L.GenNPBool]
s':30 [in Complexity.L.AbstractMachines.Computable.EvalForTime]
s':30 [in Undecidability.L.Complexity.ResourceMeasures]
s':300 [in Undecidability.L.Tactics.Reflection]
s':305 [in Undecidability.L.Tactics.Reflection]
s':31 [in Complexity.L.AbstractMachines.UnfoldHeap]
s':310 [in Undecidability.L.Tactics.Reflection]
s':32 [in Undecidability.L.Tactics.Lrewrite]
s':32 [in Undecidability.L.Tactics.Lbeta_nonrefl]
s':33 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
s':34 [in Complexity.Complexity.SpaceBoundsTime]
s':35 [in Complexity.NP.L.GenNPBool]
s':35 [in Complexity.NP.SAT.CookLevin.Subproblems.SingleTMGenNP]
s':35 [in Undecidability.L.Tactics.Lbeta_nonrefl]
s':37 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
s':38 [in Complexity.L.AbstractMachines.UnfoldTailRec]
s':38 [in Undecidability.L.Complexity.ResourceMeasures]
s':40 [in Complexity.NP.L.GenNPBool]
s':42 [in Complexity.NP.SAT.CookLevin.Subproblems.SingleTMGenNP]
s':44 [in Complexity.L.AbstractMachines.UnfoldTailRec]
s':44 [in Complexity.Complexity.SpaceBoundsTime]
s':46 [in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisUnfoldClos]
s':47 [in Undecidability.L.Computability.Seval]
s':48 [in Undecidability.L.Complexity.ResourceMeasures]
s':49 [in Undecidability.L.AbstractMachines.FlatPro.Programs]
s':5 [in Undecidability.L.Complexity.ResourceMeasures]
s':50 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
s':50 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
s':52 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
s':52 [in Undecidability.L.Tactics.Lrewrite]
s':52 [in Undecidability.L.AbstractMachines.FlatPro.Programs]
s':52 [in Complexity.Complexity.SpaceBoundsTime]
s':53 [in Undecidability.TM.Code.ChangeAlphabet]
s':55 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
s':56 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
s':57 [in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
s':58 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
s':6 [in Undecidability.L.Datatypes.LOptions]
s':60 [in Undecidability.L.Complexity.ResourceMeasures]
s':61 [in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
s':61 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
s':61 [in Complexity.Complexity.SpaceBoundsTime]
s':62 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
s':62 [in Complexity.Complexity.SpaceBoundsTime]
s':63 [in Complexity.L.TM.TMunflatten]
s':64 [in Undecidability.L.Tactics.Lrewrite]
s':65 [in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
s':66 [in Complexity.Complexity.SpaceBoundsTime]
s':71 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
s':72 [in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
s':75 [in Undecidability.L.Complexity.ResourceMeasures]
s':78 [in Undecidability.L.Complexity.ResourceMeasures]
s':79 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
s':79 [in Undecidability.L.Complexity.ResourceMeasures]
s':80 [in Undecidability.L.Util.L_facts]
s':80 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
s':81 [in Undecidability.L.Tactics.LClos]
s':82 [in Undecidability.L.Complexity.ResourceMeasures]
s':86 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
s':87 [in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
s':88 [in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
s':91 [in Undecidability.L.Complexity.ResourceMeasures]
s':92 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
s':95 [in Undecidability.L.Util.L_facts]
s':97 [in Undecidability.L.Util.L_facts]
s':99 [in Undecidability.L.Tactics.LClos]
s0':20 [in Complexity.L.TM.TMflat]
s0':26 [in Complexity.L.TM.TMflat]
s0':41 [in Complexity.NP.SAT.CookLevin.Subproblems.SingleTMGenNP]
s0:104 [in Complexity.TM.PrettyBounds.BaseCodeSpace]
s0:110 [in Complexity.TM.PrettyBounds.BaseCodeSpace]
s0:118 [in Undecidability.TM.L.HeapInterpreter.StepTM]
s0:118 [in Complexity.L.AbstractMachines.AbstractHeapMachine]
s0:120 [in Undecidability.TM.Code.List.Nth]
s0:120 [in Undecidability.TM.Univ.LowLevel]
s0:120 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
s0:121 [in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
s0:121 [in Complexity.L.AbstractMachines.AbstractHeapMachine]
s0:124 [in Complexity.L.AbstractMachines.AbstractHeapMachine]
s0:13 [in Undecidability.TM.L.HeapInterpreter.StepTM]
s0:136 [in Undecidability.TM.Univ.LookupAssociativeListTM]
s0:14 [in Undecidability.TM.Code.List.Nth]
s0:163 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
s0:17 [in Undecidability.TM.Code.List.Length]
s0:170 [in Undecidability.TM.L.HeapInterpreter.StepTM]
s0:181 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
s0:19 [in Undecidability.TM.Code.List.Cons_constant]
s0:19 [in Complexity.L.TM.TMflat]
s0:199 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
s0:2 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
s0:212 [in Undecidability.TM.L.HeapInterpreter.StepTM]
s0:225 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
s0:23 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
s0:23 [in Undecidability.TM.Code.CasePair]
s0:24 [in Complexity.L.TM.TMflat]
s0:24 [in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
s0:27 [in Undecidability.TM.Code.BinNumbers.PosCompareTM]
s0:30 [in Undecidability.TM.Code.CaseList]
s0:32 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
s0:32 [in Undecidability.TM.L.HeapInterpreter.StepTM]
s0:32 [in Undecidability.TM.PrettyBounds.MaxList]
s0:32 [in Undecidability.TM.Code.CasePair]
s0:33 [in Undecidability.TM.Code.BinNumbers.PosCompareTM]
s0:35 [in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
s0:35 [in Undecidability.TM.Code.List.App]
s0:36 [in Complexity.L.AbstractMachines.UnfoldTailRec]
s0:36 [in Undecidability.TM.Code.WriteValue]
s0:36 [in Undecidability.TM.PrettyBounds.MaxList]
s0:39 [in Complexity.NP.SAT.CookLevin.Subproblems.SingleTMGenNP]
s0:40 [in Undecidability.TM.Code.BinNumbers.PosCompareTM]
s0:41 [in Undecidability.TM.Code.CaseList]
s0:41 [in Undecidability.TM.Code.List.Length]
s0:43 [in Complexity.TM.PrettyBounds.BaseCodeSpace]
s0:446 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
s0:45 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
s0:47 [in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
s0:49 [in Undecidability.TM.L.HeapInterpreter.LookupTM]
s0:50 [in Undecidability.TM.Code.CasePair]
s0:54 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
s0:54 [in Undecidability.TM.Code.List.Rev]
s0:55 [in Undecidability.TM.Code.List.App]
s0:56 [in Undecidability.TM.L.HeapInterpreter.StepTM]
s0:58 [in Complexity.L.AbstractMachines.AbstractHeapMachine]
s0:61 [in Undecidability.TM.Code.List.Length]
s0:64 [in Undecidability.TM.Code.BinNumbers.PosAddTM]
s0:65 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
s0:70 [in Undecidability.TM.Code.BinNumbers.PosAddTM]
s0:71 [in Complexity.L.AbstractMachines.AbstractHeapMachine]
s0:75 [in Undecidability.TM.Code.BinNumbers.PosAddTM]
s0:8 [in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
s0:80 [in Undecidability.TM.L.CompilerBoolFuns.Compiler]
s0:86 [in Undecidability.TM.Code.CaseList]
s0:86 [in Undecidability.TM.L.CompilerBoolFuns.Compiler]
s0:88 [in Undecidability.TM.L.HeapInterpreter.StepTM]
s0:9 [in Undecidability.TM.Code.List.Cons_constant]
s0:91 [in Undecidability.TM.Code.CaseList]
s0:94 [in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
s0:96 [in Undecidability.TM.Univ.LowLevel]
s0:97 [in Complexity.TM.PrettyBounds.BaseCodeSpace]
s1':154 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
s1':172 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
s1':47 [in Complexity.NP.SAT.CookLevin.Subproblems.SingleTMGenNP]
s1:100 [in Complexity.TM.PrettyBounds.BaseCodeSpace]
s1:104 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
s1:106 [in Complexity.TM.PrettyBounds.BaseCodeSpace]
s1:106 [in Undecidability.TM.Code.CodeTM]
s1:107 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
s1:109 [in Undecidability.TM.Compound.Compare]
s1:11 [in Complexity.NP.SAT.CookLevin.Reductions.TCC_to_CC]
s1:111 [in Complexity.TM.PrettyBounds.BaseCodeSpace]
s1:111 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
s1:111 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
s1:113 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
s1:116 [in Undecidability.TM.Compound.Compare]
s1:117 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
s1:119 [in Undecidability.TM.L.HeapInterpreter.StepTM]
s1:120 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
s1:121 [in Undecidability.TM.Code.List.Nth]
s1:121 [in Undecidability.TM.Univ.LowLevel]
s1:122 [in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
s1:126 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
s1:13 [in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
s1:130 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
s1:132 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
s1:137 [in Undecidability.TM.Univ.LookupAssociativeListTM]
s1:139 [in Undecidability.TM.Code.Copy]
s1:14 [in Undecidability.TM.L.HeapInterpreter.StepTM]
s1:144 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
s1:144 [in Undecidability.TM.Code.Copy]
s1:148 [in Undecidability.TM.Compound.Compare]
s1:15 [in Undecidability.TM.Code.CodeTM]
s1:152 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
s1:153 [in Undecidability.TM.Code.Code]
s1:155 [in Undecidability.TM.Compound.Compare]
s1:16 [in Undecidability.TM.Code.List.Nth]
s1:16 [in Undecidability.TM.PrettyBounds.MaxList]
s1:166 [in Undecidability.TM.Compound.Compare]
s1:170 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
s1:170 [in Undecidability.TM.Univ.Univ]
s1:171 [in Undecidability.TM.L.HeapInterpreter.StepTM]
s1:176 [in Undecidability.TM.Compound.Compare]
s1:18 [in Undecidability.TM.Code.List.Length]
s1:182 [in Undecidability.Shared.Libs.DLW.Code.sss]
s1:183 [in Undecidability.TM.Compound.Compare]
s1:187 [in Undecidability.Shared.Libs.DLW.Code.sss]
s1:19 [in Undecidability.TM.PrettyBounds.MaxList]
s1:190 [in Undecidability.Shared.Libs.DLW.Code.sss]
s1:193 [in Undecidability.TM.Compound.Compare]
s1:2 [in Undecidability.L.Datatypes.LTerm]
s1:2 [in Undecidability.TM.L.CompilerBoolFuns.Compiler]
s1:207 [in Undecidability.TM.Compound.Compare]
s1:210 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
s1:213 [in Undecidability.TM.L.HeapInterpreter.StepTM]
s1:223 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
s1:229 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
s1:234 [in Complexity.Libs.CookPrelim.MorePrelim]
s1:24 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
s1:25 [in Undecidability.TM.Code.CaseList]
s1:25 [in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
s1:254 [in Complexity.Libs.CookPrelim.MorePrelim]
s1:259 [in Complexity.Libs.CookPrelim.MorePrelim]
s1:26 [in Undecidability.TM.Code.BinNumbers.PosCompareTM]
s1:262 [in Complexity.Libs.CookPrelim.MorePrelim]
s1:28 [in Undecidability.TM.Code.CasePair]
s1:3 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
s1:30 [in Undecidability.TM.Code.CodeTM]
s1:30 [in Undecidability.TM.Code.List.App]
s1:315 [in Complexity.Libs.CookPrelim.MorePrelim]
s1:32 [in Undecidability.TM.Code.BinNumbers.PosCompareTM]
s1:33 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
s1:33 [in Undecidability.TM.Code.CodeTM]
s1:33 [in Undecidability.TM.L.HeapInterpreter.StepTM]
s1:33 [in Undecidability.TM.PrettyBounds.MaxList]
s1:33 [in Undecidability.TM.Code.CasePair]
s1:35 [in Undecidability.TM.Code.CaseList]
s1:36 [in Complexity.L.AbstractMachines.UnfoldHeap]
s1:36 [in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
s1:36 [in Undecidability.TM.Code.List.App]
s1:3617 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s1:37 [in Undecidability.TM.PrettyBounds.MaxList]
s1:39 [in Undecidability.TM.Code.BinNumbers.PosCompareTM]
s1:40 [in Complexity.TM.Single.EncodeTapesInvariants]
s1:42 [in Undecidability.TM.Code.CaseList]
s1:42 [in Undecidability.TM.Code.List.Length]
s1:43 [in Undecidability.TM.PrettyBounds.MaxList]
s1:44 [in Complexity.NP.SAT.CookLevin.Subproblems.SingleTMGenNP]
s1:447 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
s1:45 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
s1:45 [in Complexity.TM.PrettyBounds.BaseCodeSpace]
s1:45 [in Undecidability.TM.Code.CasePair]
s1:46 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
s1:46 [in Undecidability.TM.PrettyBounds.MaxList]
s1:47 [in Complexity.TM.PrettyBounds.BaseCodeSpace]
s1:48 [in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
s1:5 [in Complexity.TM.PrettyBounds.SpaceBounds]
s1:50 [in Undecidability.TM.L.HeapInterpreter.LookupTM]
s1:51 [in Undecidability.TM.Code.CasePair]
s1:55 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
s1:55 [in Undecidability.TM.Code.List.Rev]
s1:56 [in Undecidability.TM.Code.List.App]
s1:57 [in Undecidability.TM.L.HeapInterpreter.StepTM]
s1:6 [in Undecidability.L.Computability.Acceptability]
s1:62 [in Undecidability.TM.Code.List.Length]
s1:63 [in Undecidability.TM.Code.BinNumbers.PosAddTM]
s1:66 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
s1:69 [in Undecidability.TM.Code.BinNumbers.PosAddTM]
s1:71 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
s1:74 [in Undecidability.TM.Code.BinNumbers.PosAddTM]
s1:78 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
s1:8 [in Complexity.NP.SAT.CookLevin.Reductions.TCC_to_CC]
s1:85 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
s1:86 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
s1:88 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
s1:89 [in Undecidability.TM.L.HeapInterpreter.StepTM]
s1:9 [in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
s1:91 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
s1:92 [in Undecidability.TM.Code.CaseList]
s1:94 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
s1:95 [in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
s1:97 [in Undecidability.TM.Univ.LowLevel]
s1:98 [in Undecidability.TM.Code.CodeTM]
s1:99 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
s2':155 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
s2':173 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
s2':48 [in Complexity.NP.SAT.CookLevin.Subproblems.SingleTMGenNP]
s2:100 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
s2:102 [in Complexity.TM.PrettyBounds.BaseCodeSpace]
s2:105 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
s2:105 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
s2:107 [in Complexity.TM.PrettyBounds.BaseCodeSpace]
s2:107 [in Undecidability.TM.Code.CodeTM]
s2:108 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
s2:110 [in Undecidability.TM.Compound.Compare]
s2:112 [in Complexity.TM.PrettyBounds.BaseCodeSpace]
s2:112 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
s2:112 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
s2:114 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
s2:117 [in Undecidability.TM.Compound.Compare]
s2:118 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
s2:12 [in Complexity.NP.SAT.CookLevin.Reductions.TCC_to_CC]
s2:120 [in Undecidability.TM.L.HeapInterpreter.StepTM]
s2:122 [in Undecidability.TM.Code.List.Nth]
s2:123 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
s2:124 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
s2:127 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
s2:131 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
s2:133 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
s2:138 [in Undecidability.TM.Univ.LookupAssociativeListTM]
s2:139 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
s2:14 [in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
s2:145 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
s2:147 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
s2:149 [in Undecidability.TM.Compound.Compare]
s2:15 [in Undecidability.TM.Code.List.Nth]
s2:15 [in Undecidability.TM.L.HeapInterpreter.StepTM]
s2:153 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
s2:154 [in Undecidability.TM.Code.Code]
s2:156 [in Undecidability.TM.Compound.Compare]
s2:16 [in Undecidability.TM.Code.CodeTM]
s2:166 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
s2:167 [in Undecidability.TM.Compound.Compare]
s2:17 [in Undecidability.TM.PrettyBounds.MaxList]
s2:171 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
s2:171 [in Undecidability.TM.Univ.Univ]
s2:172 [in Undecidability.TM.L.HeapInterpreter.StepTM]
s2:177 [in Undecidability.TM.Compound.Compare]
s2:183 [in Undecidability.Shared.Libs.DLW.Code.sss]
s2:184 [in Undecidability.TM.Compound.Compare]
s2:188 [in Undecidability.Shared.Libs.DLW.Code.sss]
s2:19 [in Undecidability.TM.Code.List.Length]
s2:191 [in Undecidability.Shared.Libs.DLW.Code.sss]
s2:194 [in Undecidability.TM.Compound.Compare]
s2:20 [in Undecidability.TM.PrettyBounds.MaxList]
s2:200 [in Undecidability.L.Tactics.Extract]
s2:208 [in Undecidability.TM.Compound.Compare]
s2:211 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
s2:214 [in Undecidability.TM.L.HeapInterpreter.StepTM]
s2:222 [in Undecidability.L.Tactics.Extract]
s2:224 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
s2:23 [in Undecidability.TM.Code.NatTM]
s2:230 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
s2:235 [in Complexity.Libs.CookPrelim.MorePrelim]
s2:25 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
s2:255 [in Complexity.Libs.CookPrelim.MorePrelim]
s2:26 [in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
s2:260 [in Complexity.Libs.CookPrelim.MorePrelim]
s2:263 [in Complexity.Libs.CookPrelim.MorePrelim]
s2:3 [in Undecidability.L.Datatypes.LTerm]
s2:3 [in Undecidability.TM.L.CompilerBoolFuns.Compiler]
s2:316 [in Complexity.Libs.CookPrelim.MorePrelim]
s2:34 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
s2:34 [in Undecidability.TM.L.HeapInterpreter.StepTM]
s2:3618 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s2:37 [in Complexity.L.AbstractMachines.UnfoldHeap]
s2:37 [in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
s2:42 [in Complexity.TM.Single.EncodeTapesInvariants]
s2:43 [in Undecidability.TM.Code.List.Length]
s2:44 [in Undecidability.TM.PrettyBounds.MaxList]
s2:448 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
s2:45 [in Complexity.NP.SAT.CookLevin.Subproblems.SingleTMGenNP]
s2:46 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
s2:47 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
s2:47 [in Undecidability.TM.PrettyBounds.MaxList]
s2:49 [in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
s2:51 [in Undecidability.TM.L.HeapInterpreter.LookupTM]
s2:56 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
s2:56 [in Undecidability.TM.Code.List.Rev]
s2:58 [in Undecidability.TM.L.HeapInterpreter.StepTM]
s2:6 [in Complexity.TM.PrettyBounds.SpaceBounds]
s2:63 [in Undecidability.TM.Code.List.Length]
s2:7 [in Undecidability.L.Computability.Acceptability]
s2:72 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
s2:81 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
s2:86 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
s2:87 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
s2:89 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
s2:9 [in Complexity.NP.SAT.CookLevin.Reductions.TCC_to_CC]
s2:90 [in Undecidability.TM.L.HeapInterpreter.StepTM]
s2:92 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
s2:95 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
s2:96 [in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
s2:99 [in Undecidability.TM.Code.CodeTM]
s3:105 [in Undecidability.TM.Code.NatTM]
s3:109 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
s3:114 [in Complexity.TM.PrettyBounds.BaseCodeSpace]
s3:121 [in Undecidability.TM.L.HeapInterpreter.StepTM]
s3:123 [in Undecidability.TM.Code.List.Nth]
s3:134 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
s3:139 [in Undecidability.TM.Univ.LookupAssociativeListTM]
s3:173 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
s3:173 [in Undecidability.TM.L.HeapInterpreter.StepTM]
s3:175 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
s3:193 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
s3:195 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
s3:212 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
s3:231 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
s3:24 [in Undecidability.TM.Code.NatTM]
s3:26 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
s3:31 [in Undecidability.TM.Code.NatTM]
s3:35 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
s3:3619 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s3:39 [in Undecidability.TM.Code.NatTM]
s3:449 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
s3:49 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
s3:50 [in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
s3:52 [in Undecidability.TM.L.HeapInterpreter.LookupTM]
s3:58 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
s3:59 [in Undecidability.TM.L.HeapInterpreter.StepTM]
s3:64 [in Undecidability.TM.Code.List.Length]
s3:67 [in Undecidability.TM.Code.NatTM]
s3:74 [in Undecidability.TM.Code.NatTM]
s3:86 [in Undecidability.TM.Code.NatTM]
s3:91 [in Undecidability.TM.L.HeapInterpreter.StepTM]
s3:95 [in Undecidability.TM.Code.NatTM]
s3:97 [in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
s4:106 [in Undecidability.TM.Code.NatTM]
s4:113 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
s4:122 [in Undecidability.TM.L.HeapInterpreter.StepTM]
s4:135 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
s4:140 [in Undecidability.TM.Univ.LookupAssociativeListTM]
s4:174 [in Undecidability.TM.L.HeapInterpreter.StepTM]
s4:197 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
s4:202 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
s4:213 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
s4:232 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
s4:450 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
s4:51 [in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
s4:53 [in Undecidability.TM.L.HeapInterpreter.LookupTM]
s4:60 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
s4:60 [in Undecidability.TM.L.HeapInterpreter.StepTM]
s4:68 [in Undecidability.TM.Code.NatTM]
s4:75 [in Undecidability.TM.Code.NatTM]
s4:87 [in Undecidability.TM.Code.NatTM]
s4:92 [in Undecidability.TM.L.HeapInterpreter.StepTM]
s4:96 [in Undecidability.TM.Code.NatTM]
s4:98 [in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
s5:107 [in Undecidability.TM.Code.NatTM]
s5:115 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
s5:136 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
s5:175 [in Undecidability.TM.L.HeapInterpreter.StepTM]
s5:214 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
s5:233 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
s5:451 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
s5:93 [in Undecidability.TM.L.HeapInterpreter.StepTM]
s5:97 [in Undecidability.TM.Code.NatTM]
s6:176 [in Undecidability.TM.L.HeapInterpreter.StepTM]
s7:177 [in Undecidability.TM.L.HeapInterpreter.StepTM]
s:1 [in Undecidability.L.Tactics.Lrewrite]
s:1 [in Undecidability.L.Util.L_facts]
s:1 [in Undecidability.L.Tactics.Lsimpl]
s:1 [in Undecidability.L.Computability.Seval]
s:1 [in Undecidability.L.Tactics.GenEncode]
s:1 [in Complexity.TM.PrettyBounds.SpaceBounds]
s:1 [in Undecidability.TM.Code.CaseBool]
s:1 [in Undecidability.L.Tactics.LClos_Eval]
s:1 [in Undecidability.L.Functions.Subst]
s:1 [in Complexity.NP.L.LMGenNP]
s:1 [in Complexity.L.AbstractMachines.FlatPro.Computable.Compile]
s:1 [in Undecidability.L.Computability.Fixpoints]
s:1 [in Undecidability.L.Tactics.Lbeta_nonrefl]
s:1 [in Undecidability.L.Tactics.Lbeta]
s:1 [in Undecidability.L.Computability.Acceptability]
s:1 [in Undecidability.L.Computability.Rice]
s:1 [in Complexity.L.AbstractMachines.Computable.HeapMachine]
s:1 [in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
s:1 [in Undecidability.L.Computability.Computability]
s:1 [in Undecidability.L.Functions.Equality]
s:1 [in Undecidability.L.Computability.Por]
s:1 [in Undecidability.L.AbstractMachines.LargestVar]
s:1 [in Complexity.L.AbstractMachines.LambdaDepth]
s:10 [in Undecidability.L.Functions.Eval]
s:10 [in Complexity.L.AbstractMachines.Computable.EvalForTime]
s:10 [in Undecidability.TM.L.CompilerBoolFuns.NaryApp]
s:10 [in Complexity.NP.TM.mTM_to_singleTapeTM]
s:10 [in Complexity.TM.PrettyBounds.SpaceBounds]
s:10 [in Undecidability.L.Tactics.LClos]
s:10 [in Undecidability.TM.Code.CaseFin]
s:10 [in Complexity.TM.PrettyBounds.BaseCodeSpace]
s:10 [in Undecidability.L.AbstractMachines.FlatPro.UnfoldClos]
s:10 [in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
s:10 [in Undecidability.TM.Code.ChangeAlphabet]
s:10 [in Undecidability.L.Tactics.Reflection]
s:10 [in Undecidability.L.Functions.Decoding]
s:10 [in Undecidability.L.AbstractMachines.LargestVar]
s:10 [in Complexity.L.AbstractMachines.LambdaDepth]
s:100 [in Undecidability.TM.Code.Copy]
s:101 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
s:101 [in Undecidability.L.Tactics.Extract]
s:101 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
s:101 [in Undecidability.L.Complexity.ResourceMeasures]
s:101 [in Undecidability.TM.Code.Code]
s:102 [in Undecidability.L.Util.L_facts]
s:102 [in Undecidability.L.Computability.Seval]
s:102 [in Undecidability.L.Tactics.LClos]
s:102 [in Undecidability.L.Tactics.LClos_Eval]
s:102 [in Undecidability.TM.Code.Code]
s:103 [in Undecidability.L.Complexity.ResourceMeasures]
s:103 [in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
s:103 [in Undecidability.TM.Code.Copy]
s:104 [in Undecidability.L.Complexity.ResourceMeasures]
s:104 [in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
s:105 [in Undecidability.L.Tactics.LClos]
S:106 [in Undecidability.Shared.Libs.DLW.Utils.php]
s:106 [in Undecidability.L.Tactics.Computable]
s:107 [in Undecidability.L.Prelim.ARS]
s:107 [in Undecidability.TM.Compound.Shift]
s:108 [in Undecidability.L.Util.L_facts]
s:108 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
s:108 [in Undecidability.Shared.Libs.DLW.Vec.pos]
s:109 [in Undecidability.L.Computability.Seval]
s:109 [in Undecidability.TM.Univ.LowLevel]
s:109 [in Complexity.L.AbstractMachines.AbstractHeapMachine]
S:11 [in Undecidability.L.Prelim.ARS]
s:11 [in Undecidability.L.Util.L_facts]
s:11 [in Complexity.HierarchyTheorem.TimeHierarchyTheorem]
s:11 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
s:11 [in Undecidability.TM.Code.BinNumbers.PosIncrementTM]
s:11 [in Complexity.L.AbstractMachines.Computable.UnivDecTime]
s:11 [in Complexity.L.AbstractMachines.Computable.EvalForTimeBool]
s:11 [in Undecidability.TM.Combinators.StateWhile]
s:11 [in Undecidability.TM.Compound.Shift]
s:11 [in Undecidability.TM.PrettyBounds.MaxList]
s:11 [in Complexity.NP.L.GenNP]
s:11 [in Undecidability.L.Functions.Size]
s:11 [in Undecidability.L.Computability.Por]
s:11 [in Undecidability.TM.Single.EncodeTapes]
s:11 [in Undecidability.L.AbstractMachines.LargestVar]
S:110 [in Undecidability.L.Prelim.ARS]
s:110 [in Undecidability.L.Util.L_facts]
s:110 [in Undecidability.TM.Compound.Shift]
s:111 [in Undecidability.L.Util.L_facts]
s:111 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
s:112 [in Undecidability.L.Computability.Seval]
s:112 [in Undecidability.L.Tactics.LClos_Eval]
s:112 [in Undecidability.L.Complexity.ResourceMeasures]
s:113 [in Undecidability.L.Prelim.ARS]
s:113 [in Undecidability.L.Util.L_facts]
s:113 [in Undecidability.L.Tactics.LClos]
s:113 [in Undecidability.TM.Univ.LowLevel]
s:113 [in Undecidability.L.Tactics.Reflection]
s:113 [in Undecidability.TM.Compound.Shift]
s:114 [in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
s:114 [in Undecidability.L.Computability.Seval]
s:114 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
s:114 [in Undecidability.TM.Compound.Shift]
s:115 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
s:115 [in Undecidability.L.Tactics.ComputableTime]
s:115 [in Undecidability.L.Tactics.LClos]
s:116 [in Undecidability.L.Util.L_facts]
s:116 [in Undecidability.L.Complexity.ResourceMeasures]
s:116 [in Undecidability.TM.Hoare.HoareRegister]
s:117 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
s:117 [in Complexity.L.AbstractMachines.AbstractHeapMachine]
s:118 [in Undecidability.L.Util.L_facts]
s:118 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
s:118 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
s:119 [in Undecidability.L.Prelim.ARS]
s:119 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
S:119 [in Undecidability.Shared.Libs.DLW.Utils.php]
s:119 [in Complexity.L.AbstractMachines.AbstractHeapMachine]
s:12 [in Undecidability.L.Functions.Eval]
s:12 [in Complexity.TM.PrettyBounds.BaseCodeSpace]
s:12 [in Undecidability.TM.Code.CodeTM]
s:12 [in Complexity.L.AbstractMachines.FlatPro.Computable.Compile]
s:12 [in Undecidability.L.Tactics.Lbeta_nonrefl]
s:12 [in Undecidability.TM.TM]
s:12 [in Undecidability.TM.L.Eval]
s:12 [in Undecidability.L.Prelim.StringBase]
s:12 [in Undecidability.L.AbstractMachines.FlatPro.ProgramsDef]
s:120 [in Undecidability.L.Computability.Seval]
s:120 [in Undecidability.TM.Compound.Shift]
s:121 [in Undecidability.L.Util.L_facts]
s:122 [in Complexity.L.AbstractMachines.AbstractHeapMachine]
s:123 [in Undecidability.L.Util.L_facts]
s:124 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
s:124 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
s:124 [in Complexity.NP.SAT.CookLevin.Subproblems.CC]
s:125 [in Undecidability.L.Util.L_facts]
s:125 [in Undecidability.L.Tactics.LClos]
s:125 [in Complexity.L.AbstractMachines.AbstractHeapMachine]
s:125 [in Undecidability.TM.Code.Copy]
s:126 [in Undecidability.TM.Single.StepTM]
s:127 [in Undecidability.L.Prelim.ARS]
s:127 [in Undecidability.L.Tactics.LClos]
s:127 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
s:127 [in Complexity.NP.SAT.CookLevin.Subproblems.CC]
s:128 [in Undecidability.L.Util.L_facts]
s:128 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
s:128 [in Undecidability.TM.Compound.Shift]
s:129 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
s:13 [in Complexity.NP.SAT.CookLevin.Reductions.TCC_to_CC]
s:13 [in Undecidability.L.Computability.Enum]
s:13 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
s:13 [in Undecidability.TM.Code.CaseSum]
s:13 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
s:13 [in Undecidability.L.Tactics.Lbeta]
s:13 [in Undecidability.TM.Code.ChangeAlphabet]
s:13 [in Undecidability.L.Computability.Acceptability]
s:13 [in Complexity.L.AbstractMachines.Computable.LargestVar]
s:13 [in Undecidability.L.Functions.Size]
s:13 [in Complexity.L.AbstractMachines.LambdaDepth]
s:130 [in Undecidability.L.Tactics.ComputableTime]
s:130 [in Undecidability.TM.Univ.LowLevel]
s:130 [in Undecidability.TM.Code.Copy]
s:131 [in Undecidability.L.Tactics.LClos]
s:132 [in Undecidability.L.Prelim.ARS]
s:132 [in Undecidability.L.Util.L_facts]
s:133 [in Undecidability.TM.Hoare.HoareRegister]
s:133 [in Complexity.L.AbstractMachines.AbstractHeapMachine]
s:133 [in Undecidability.TM.Code.Code]
s:134 [in Undecidability.L.Util.L_facts]
s:134 [in Undecidability.L.Tactics.Extract]
s:134 [in Undecidability.L.Tactics.LClos]
s:135 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
s:135 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
s:135 [in Complexity.L.AbstractMachines.AbstractHeapMachine]
s:135 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
s:136 [in Undecidability.L.Util.L_facts]
s:137 [in Complexity.L.AbstractMachines.AbstractHeapMachine]
s:138 [in Undecidability.L.Util.L_facts]
s:138 [in Undecidability.L.Tactics.LClos]
s:138 [in Undecidability.TM.Univ.LowLevel]
s:14 [in Undecidability.L.Functions.Eval]
s:14 [in Undecidability.L.Tactics.Lrewrite]
s:14 [in Undecidability.L.Computability.Seval]
s:14 [in Undecidability.L.Tactics.LClos]
s:14 [in Complexity.TM.PrettyBounds.BaseCodeSpace]
s:14 [in Complexity.L.AbstractMachines.FlatPro.Computable.Compile]
s:14 [in Undecidability.TM.Code.WriteValue]
s:14 [in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
s:14 [in Undecidability.L.L]
S:14 [in Undecidability.TM.Util.Relations]
s:14 [in Complexity.L.AbstractMachines.AbstractHeapMachine]
s:14 [in Undecidability.TM.Util.TM_facts]
s:14 [in Undecidability.L.Computability.Por]
s:14 [in Undecidability.L.Computability.Scott]
s:14 [in Undecidability.TM.Single.EncodeTapes]
s:140 [in Undecidability.L.Util.L_facts]
s:140 [in Undecidability.L.Tactics.LClos]
s:140 [in Complexity.L.AbstractMachines.AbstractHeapMachine]
s:141 [in Undecidability.L.Tactics.Extract]
s:141 [in Undecidability.TM.Hoare.HoareRegister]
s:142 [in Undecidability.L.Tactics.LClos]
s:142 [in Complexity.L.AbstractMachines.AbstractHeapMachine]
s:143 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
s:143 [in Undecidability.L.Tactics.ComputableTime]
s:143 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
s:144 [in Complexity.L.AbstractMachines.AbstractHeapMachine]
s:146 [in Undecidability.L.Util.L_facts]
s:147 [in Undecidability.TM.Hoare.HoareRegister]
s:148 [in Undecidability.L.Util.L_facts]
s:148 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
s:15 [in Complexity.HierarchyTheorem.TimeHierarchyTheorem]
s:15 [in Undecidability.Shared.Libs.PSL.Lists.Position]
s:15 [in Complexity.L.AbstractMachines.Computable.UnivDecTime]
s:15 [in Complexity.L.AbstractMachines.UnfoldHeap]
s:15 [in Undecidability.L.Tactics.LClos_Eval]
s:15 [in Undecidability.L.Complexity.ResourceMeasures]
s:15 [in Complexity.L.TM.TMflat]
s:15 [in Undecidability.L.L]
s:15 [in Undecidability.L.AbstractMachines.FlatPro.Programs]
s:15 [in Complexity.L.TM.TMflatten]
s:15 [in Undecidability.L.Computability.Rice]
s:15 [in Complexity.L.AbstractMachines.Computable.LargestVar]
s:151 [in Complexity.Libs.CookPrelim.FlatFinTypes]
s:152 [in Undecidability.L.Util.L_facts]
s:152 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
s:153 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
s:154 [in Complexity.Libs.CookPrelim.FlatFinTypes]
s:155 [in Undecidability.L.Util.L_facts]
s:155 [in Undecidability.L.Tactics.Extract]
s:155 [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
s:155 [in Undecidability.TM.Univ.LowLevel]
s:156 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
s:157 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
s:158 [in Undecidability.TM.Univ.LowLevel]
s:158 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
s:159 [in Undecidability.L.Util.L_facts]
s:159 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
s:159 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
s:159 [in Undecidability.TM.Hoare.HoareRegister]
s:16 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
s:16 [in Undecidability.L.Computability.Enum]
s:16 [in Undecidability.L.Tactics.LClos]
s:16 [in Complexity.NP.L.LMGenNP]
s:16 [in Complexity.L.AbstractMachines.FlatPro.Computable.Compile]
s:16 [in Complexity.NP.SAT.CookLevin.Subproblems.SingleTMGenNP]
s:16 [in Complexity.L.AbstractMachines.AbstractSubstMachine]
s:16 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
s:16 [in Undecidability.L.Tactics.Reflection]
s:16 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
s:16 [in Undecidability.TM.Compound.Multi]
s:160 [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
s:160 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
s:161 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
s:162 [in Undecidability.L.Util.L_facts]
s:163 [in Undecidability.L.Tactics.Extract]
s:163 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
s:163 [in Undecidability.TM.Code.Code]
s:165 [in Complexity.L.TM.TMunflatten]
s:165 [in Undecidability.TM.Hoare.HoareRegister]
s:166 [in Undecidability.L.Util.L_facts]
s:166 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
s:167 [in Undecidability.L.Prelim.ARS]
s:168 [in Undecidability.L.Prelim.ARS]
s:168 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
s:17 [in Undecidability.L.Functions.Eval]
s:17 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
s:17 [in Undecidability.L.Computability.Seval]
s:17 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
s:17 [in Undecidability.Shared.Libs.PSL.Lists.Position]
s:17 [in Undecidability.L.Complexity.ResourceMeasures]
s:17 [in Complexity.TM.PrettyBounds.BaseCodeSpace]
s:17 [in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
s:17 [in Complexity.L.AbstractMachines.AbstractSubstMachine]
s:17 [in Undecidability.TM.L.Eval]
s:17 [in Undecidability.TM.Util.TM_facts]
s:17 [in Undecidability.TM.Compound.Shift]
s:17 [in Undecidability.L.Functions.Size]
s:17 [in Undecidability.TM.Single.EncodeTapes]
s:170 [in Undecidability.TM.Hoare.HoareRegister]
s:172 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
s:173 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
s:174 [in Complexity.L.TM.TMunflatten]
s:175 [in Undecidability.L.Util.L_facts]
s:175 [in Undecidability.TM.Single.StepTM]
s:175 [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
s:176 [in Undecidability.L.Prelim.ARS]
s:177 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
s:177 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
s:178 [in Undecidability.L.Tactics.Extract]
s:178 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
s:179 [in Undecidability.L.Util.L_facts]
s:18 [in Undecidability.TM.Code.CaseList]
s:18 [in Undecidability.TM.L.CompilerBoolFuns.NaryApp]
s:18 [in Undecidability.L.Tactics.Lrewrite]
s:18 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
s:18 [in Undecidability.L.Tactics.Extract]
s:18 [in Complexity.L.AbstractMachines.UnfoldTailRec]
s:18 [in Undecidability.Shared.Libs.DLW.Utils.utils_string]
s:18 [in Undecidability.L.Tactics.LClos_Eval]
s:18 [in Complexity.L.AbstractMachines.FlatPro.Computable.Compile]
s:18 [in Undecidability.L.Functions.Size]
s:181 [in Complexity.L.TM.TMunflatten]
s:182 [in Undecidability.L.Prelim.ARS]
s:182 [in Undecidability.TM.Single.StepTM]
s:182 [in Undecidability.TM.Hoare.HoareRegister]
s:183 [in Undecidability.L.Util.L_facts]
s:183 [in Undecidability.TM.Single.StepTM]
s:184 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
s:184 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
s:186 [in Undecidability.L.Tactics.Extract]
s:188 [in Undecidability.L.Util.L_facts]
s:188 [in Complexity.L.TM.TMunflatten]
s:189 [in Undecidability.TM.Single.StepTM]
s:19 [in Undecidability.L.Functions.Eval]
s:19 [in Undecidability.TM.L.CompilerBoolFuns.NaryApp]
s:19 [in Undecidability.L.Util.L_facts]
s:19 [in Undecidability.L.Computability.Seval]
s:19 [in Undecidability.Shared.Libs.PSL.Lists.Position]
s:19 [in Undecidability.L.AbstractMachines.FlatPro.UnfoldClos]
s:19 [in Complexity.L.AbstractMachines.FlatPro.Computable.Compile]
s:19 [in Complexity.L.TM.TMflatten]
s:19 [in Complexity.L.AbstractMachines.AbstractHeapMachine]
s:19 [in Undecidability.L.Tactics.Reflection]
s:19 [in Undecidability.TM.L.CaseCom]
s:19 [in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
s:19 [in Complexity.L.AbstractMachines.Computable.LargestVar]
s:19 [in Undecidability.TM.Code.BinNumbers.PosShiftTM]
s:190 [in Undecidability.L.Tactics.ComputableTime]
s:190 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
s:190 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
s:193 [in Undecidability.L.Util.L_facts]
s:195 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
s:196 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
s:197 [in Undecidability.TM.Single.StepTM]
s:198 [in Undecidability.TM.Code.Copy]
s:199 [in Undecidability.L.Util.L_facts]
s:2 [in Undecidability.TM.L.CompilerBoolFuns.NaryApp]
s:2 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
s:2 [in Undecidability.TM.Basic.Null]
s:2 [in Undecidability.Shared.Libs.PSL.Lists.Position]
s:2 [in Complexity.TM.PrettyBounds.BaseCodeSpace]
s:2 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
s:2 [in Undecidability.L.Functions.Encoding]
s:20 [in Complexity.L.AbstractMachines.UnfoldHeap]
s:20 [in Undecidability.L.Complexity.ResourceMeasures]
s:20 [in Undecidability.TM.Code.CodeTM]
s:20 [in Complexity.L.AbstractMachines.FlatPro.Computable.Compile]
s:20 [in Undecidability.L.L]
s:20 [in Undecidability.TM.Hoare.HoareRegister]
s:20 [in Complexity.L.AbstractMachines.AbstractSubstMachine]
s:20 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
S:20 [in Undecidability.TM.Util.Relations]
s:20 [in Undecidability.TM.Util.TM_facts]
s:20 [in Undecidability.L.Functions.Decoding]
s:20 [in Undecidability.TM.Compound.Shift]
s:20 [in Complexity.L.AbstractMachines.Computable.LargestVar]
s:20 [in Undecidability.TM.Single.EncodeTapes]
s:200 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
s:201 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
s:204 [in Undecidability.L.Util.L_facts]
s:207 [in Undecidability.TM.Single.StepTM]
s:207 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
s:209 [in Undecidability.L.Util.L_facts]
s:209 [in Undecidability.TM.Code.Copy]
s:21 [in Undecidability.L.Tactics.Lrewrite]
s:21 [in Undecidability.L.Tactics.LClos_Eval]
s:21 [in Complexity.L.AbstractMachines.FlatPro.Computable.Compile]
s:21 [in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
s:21 [in Undecidability.L.Tactics.Lbeta_nonrefl]
s:21 [in Complexity.L.TM.TMflatten]
s:21 [in Complexity.NP.TM.TMGenNP_fixed_mTM]
s:21 [in Undecidability.TM.Code.BinNumbers.PosShiftTM]
s:211 [in Undecidability.L.Tactics.Extract]
s:212 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
s:212 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
s:213 [in Undecidability.L.Prelim.ARS]
s:214 [in Undecidability.L.Util.L_facts]
s:214 [in Complexity.L.TM.TMflatComp]
s:215 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
s:216 [in Complexity.L.TM.TMflatComp]
s:216 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
s:218 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
s:218 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
s:219 [in Undecidability.L.Util.L_facts]
s:22 [in Complexity.L.AbstractMachines.Computable.EvalForTime]
s:22 [in Undecidability.TM.L.CompilerBoolFuns.NaryApp]
s:22 [in Undecidability.L.Computability.Enum]
s:22 [in Complexity.TM.PrettyBounds.BaseCodeSpace]
s:22 [in Complexity.L.AbstractMachines.FlatPro.Computable.Compile]
s:22 [in Undecidability.TM.Code.WriteValue]
s:22 [in Undecidability.TM.Compound.Shift]
s:22 [in Undecidability.Shared.Libs.DLW.Code.sss]
s:220 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
s:220 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
s:220 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
s:220 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
s:221 [in Undecidability.L.Prelim.ARS]
s:222 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
s:223 [in Complexity.L.TM.TMflatComp]
s:224 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
s:224 [in Undecidability.L.Util.L_facts]
s:224 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
s:225 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
s:225 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
s:226 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
s:226 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
s:227 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
s:228 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
s:23 [in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
s:23 [in Undecidability.L.Computability.Seval]
s:23 [in Undecidability.L.AbstractMachines.FlatPro.Programs]
s:23 [in Complexity.L.TM.TMflatten]
s:23 [in Undecidability.L.Tactics.Reflection]
s:23 [in Undecidability.TM.PrettyBounds.MaxList]
s:23 [in Undecidability.TM.Single.EncodeTapes]
s:23 [in Undecidability.TM.Code.BinNumbers.PosShiftTM]
s:230 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
s:230 [in Undecidability.L.Util.L_facts]
s:230 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
s:231 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
s:231 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
s:233 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
s:233 [in Undecidability.L.Util.L_facts]
s:233 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
s:233 [in Complexity.L.TM.TMunflatten]
s:233 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
s:235 [in Undecidability.L.Util.L_facts]
s:235 [in Undecidability.TM.Single.StepTM]
s:236 [in Undecidability.L.Util.L_facts]
s:236 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
s:237 [in Undecidability.L.Util.L_facts]
s:238 [in Undecidability.L.Prelim.ARS]
s:238 [in Undecidability.L.Util.L_facts]
s:238 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
s:24 [in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
s:24 [in Complexity.L.AbstractMachines.Computable.EvalForTime]
s:24 [in Undecidability.L.Tactics.GenEncode]
s:24 [in Complexity.L.AbstractMachines.UnfoldHeap]
s:24 [in Complexity.TM.PrettyBounds.BaseCodeSpace]
s:24 [in Complexity.NP.SAT.CookLevin.Subproblems.SingleTMGenNP]
s:24 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
s:24 [in Complexity.L.TM.TMflatFun]
s:241 [in Undecidability.L.Util.L_facts]
s:241 [in Undecidability.TM.Util.TM_facts]
s:242 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
s:243 [in Undecidability.TM.Util.TM_facts]
s:245 [in Undecidability.TM.Single.StepTM]
s:245 [in Undecidability.TM.Util.TM_facts]
s:248 [in Undecidability.TM.Util.TM_facts]
s:25 [in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
s:25 [in Undecidability.L.Util.L_facts]
s:25 [in Undecidability.L.Computability.Enum]
s:25 [in Undecidability.Shared.Libs.PSL.Lists.Position]
s:25 [in Undecidability.L.Complexity.ResourceMeasures]
s:25 [in Undecidability.L.Tactics.Lbeta_nonrefl]
s:25 [in Complexity.Complexity.SpaceBoundsTime]
s:25 [in Complexity.L.TM.TMflatten]
s:25 [in Undecidability.L.Computability.Rice]
s:25 [in Undecidability.TM.Compound.Shift]
s:25 [in Undecidability.TM.PrettyBounds.MaxList]
s:252 [in Complexity.Libs.CookPrelim.MorePrelim]
s:253 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
s:253 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s:254 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
s:2548 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s:255 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s:257 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s:257 [in Complexity.Libs.CookPrelim.MorePrelim]
s:26 [in Complexity.L.AbstractMachines.Computable.EvalForTime]
s:26 [in Undecidability.L.Tactics.Lrewrite]
s:26 [in Complexity.TM.PrettyBounds.BaseCodeSpace]
s:26 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
S:26 [in Undecidability.TM.Util.Relations]
s:26 [in Undecidability.L.Computability.Synthetic]
s:26 [in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
s:261 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s:2638 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s:265 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s:267 [in Undecidability.Shared.Libs.DLW.Vec.vec]
s:269 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s:27 [in Complexity.L.AbstractMachines.Computable.EvalForTime]
s:27 [in Complexity.L.AbstractMachines.UnfoldTailRec]
s:27 [in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisUnfoldClos]
s:27 [in Undecidability.L.Datatypes.List.List_nat]
s:27 [in Undecidability.L.L]
s:27 [in Undecidability.L.Tactics.Lbeta_nonrefl]
s:27 [in Undecidability.L.AbstractMachines.FlatPro.Programs]
s:27 [in Complexity.NP.SAT.CookLevin.Subproblems.TM_single]
s:27 [in Complexity.L.TM.TMflatten]
s:27 [in Complexity.L.AbstractMachines.AbstractHeapMachine]
s:27 [in Undecidability.TM.Compound.Shift]
s:271 [in Complexity.Libs.CookPrelim.MorePrelim]
s:2712 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s:2715 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s:272 [in Undecidability.L.Tactics.Reflection]
s:2722 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s:2728 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s:273 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s:2734 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s:2740 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s:2747 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s:2752 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s:2758 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s:2764 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s:2769 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s:2774 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s:2778 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s:278 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s:2784 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s:2790 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s:28 [in Undecidability.L.Util.L_facts]
s:28 [in Undecidability.TM.Code.BinNumbers.PosMultTM]
s:28 [in Undecidability.L.Computability.Enum]
s:28 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
s:28 [in Complexity.L.AbstractMachines.UnfoldHeap]
s:28 [in Complexity.TM.PrettyBounds.BaseCodeSpace]
s:28 [in Complexity.L.AbstractMachines.AbstractSubstMachine]
s:28 [in Undecidability.L.Tactics.Reflection]
s:28 [in Undecidability.L.Computability.Rice]
s:28 [in Undecidability.TM.PrettyBounds.MaxList]
s:280 [in Undecidability.L.Tactics.Reflection]
s:2835 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s:2836 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s:2837 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s:2840 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s:2843 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s:2846 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s:285 [in Undecidability.L.Tactics.Reflection]
s:2851 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s:2855 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s:2859 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s:2864 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s:2866 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s:2869 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s:2875 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s:2878 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s:288 [in Undecidability.L.Tactics.Reflection]
s:2886 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s:2891 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s:2899 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s:29 [in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
s:29 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
s:29 [in Undecidability.L.Tactics.Extract]
s:29 [in Undecidability.L.Complexity.ResourceMeasures]
s:29 [in Undecidability.L.Computability.Rice]
s:29 [in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
s:29 [in Undecidability.TM.Compound.Shift]
s:2904 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s:2905 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s:291 [in Undecidability.L.Tactics.Reflection]
s:293 [in Undecidability.L.Tactics.Reflection]
s:295 [in Undecidability.L.Tactics.Reflection]
s:2970 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s:2978 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s:298 [in Undecidability.L.Tactics.Reflection]
s:2985 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s:3 [in Undecidability.L.Tactics.Lsimpl]
s:3 [in Undecidability.TM.Code.CaseFin]
s:3 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_nat_facts]
s:3 [in Complexity.L.AbstractMachines.Computable.EvalForTimeBool]
s:3 [in Complexity.L.AbstractMachines.UnfoldHeap]
s:3 [in Undecidability.L.Complexity.ResourceMeasures]
s:3 [in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
s:3 [in Undecidability.L.Computability.Fixpoints]
s:3 [in Undecidability.L.Computability.Decidability]
s:3 [in Undecidability.TM.Compound.Shift]
s:30 [in Undecidability.L.Tactics.Lrewrite]
s:30 [in Undecidability.L.Util.L_facts]
s:30 [in Complexity.L.AbstractMachines.UnfoldTailRec]
s:30 [in Undecidability.L.L]
s:30 [in Undecidability.L.Tactics.Reflection]
s:3006 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s:3014 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s:3021 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s:303 [in Undecidability.L.Tactics.Reflection]
s:308 [in Undecidability.L.Tactics.Reflection]
s:31 [in Undecidability.L.Util.L_facts]
s:31 [in Undecidability.L.Computability.Enum]
s:31 [in Undecidability.TM.Code.WriteValue]
s:31 [in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
s:31 [in Undecidability.L.Tactics.Lbeta_nonrefl]
s:31 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
s:31 [in Undecidability.L.Computability.Rice]
s:31 [in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
s:314 [in Undecidability.TM.Single.StepTM]
s:315 [in Undecidability.L.Tactics.Reflection]
s:318 [in Undecidability.L.Tactics.Reflection]
s:32 [in Undecidability.L.Util.L_facts]
s:32 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
s:32 [in Undecidability.L.Computability.Seval]
s:32 [in Undecidability.L.Tactics.LClos]
s:32 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
s:32 [in Complexity.Complexity.SpaceBoundsTime]
s:320 [in Undecidability.L.Tactics.Reflection]
s:324 [in Undecidability.L.Tactics.Reflection]
s:326 [in Undecidability.TM.Single.StepTM]
s:329 [in Undecidability.TM.Single.StepTM]
s:33 [in Undecidability.TM.L.CompilerBoolFuns.NaryApp]
s:33 [in Undecidability.L.Computability.Enum]
s:33 [in Undecidability.TM.Basic.Mono]
s:33 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
s:33 [in Complexity.Complexity.SpaceBoundsTime]
s:33 [in Undecidability.L.Tactics.Reflection]
s:336 [in Undecidability.TM.Single.StepTM]
s:339 [in Undecidability.TM.Single.StepTM]
s:34 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
s:34 [in Complexity.L.AbstractMachines.UnfoldHeap]
s:34 [in Undecidability.L.Complexity.ResourceMeasures]
s:34 [in Complexity.TM.PrettyBounds.BaseCodeSpace]
s:34 [in Complexity.NP.SAT.CookLevin.Subproblems.SingleTMGenNP]
s:34 [in Undecidability.L.Tactics.Lbeta_nonrefl]
s:34 [in Complexity.L.AbstractMachines.AbstractSubstMachine]
s:35 [in Undecidability.L.Computability.Seval]
s:35 [in Undecidability.L.Tactics.LClos]
s:35 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
s:35 [in Undecidability.TM.Code.CaseSum]
s:35 [in Complexity.L.AbstractMachines.AbstractHeapMachine]
s:35 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
s:35 [in Complexity.NP.SAT.CookLevin.Subproblems.CC]
s:351 [in Undecidability.TM.Single.StepTM]
S:356 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
s:359 [in Undecidability.TM.Single.StepTM]
s:36 [in Undecidability.L.Computability.Enum]
s:36 [in Complexity.TM.Single.EncodeTapesInvariants]
s:36 [in Undecidability.TM.Compound.CopySymbols]
s:36 [in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
s:36 [in Complexity.TM.Single.DecodeTapes]
s:36 [in Undecidability.L.Tactics.Reflection]
s:36 [in Undecidability.L.Computability.Rice]
s:36 [in Undecidability.L.Functions.Decoding]
s:366 [in Undecidability.TM.Single.StepTM]
s:3695 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s:37 [in Undecidability.TM.Basic.Mono]
s:37 [in Undecidability.L.Complexity.ResourceMeasures]
s:37 [in Complexity.L.TM.TMflatComp]
s:37 [in Undecidability.L.Tactics.Lbeta_nonrefl]
s:37 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
s:37 [in Undecidability.TM.Code.ChangeAlphabet]
s:38 [in Complexity.L.AbstractMachines.Computable.EvalForTime]
s:38 [in Undecidability.TM.L.CompilerBoolFuns.NaryApp]
s:38 [in Undecidability.L.Computability.Enum]
s:38 [in Undecidability.L.Tactics.ComputableTime]
s:38 [in Undecidability.L.Computability.Seval]
s:38 [in Undecidability.TM.Code.CodeTM]
s:38 [in Complexity.NP.SAT.CookLevin.Subproblems.SingleTMGenNP]
s:38 [in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
s:39 [in Undecidability.TM.Compound.CopySymbols]
s:39 [in Undecidability.L.AbstractMachines.FlatPro.Programs]
s:39 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
s:39 [in Undecidability.TM.PrettyBounds.MaxList]
s:4 [in Undecidability.L.Datatypes.LOptions]
s:4 [in Undecidability.L.Tactics.LClos]
s:4 [in Undecidability.L.Complexity.ResourceMeasures]
s:4 [in Complexity.TM.PrettyBounds.BaseCodeSpace]
s:4 [in Complexity.L.TM.TapeDecode]
s:4 [in Undecidability.L.Datatypes.LTerm]
s:4 [in Undecidability.L.L]
s:4 [in Undecidability.L.AbstractMachines.FlatPro.Programs]
s:4 [in Undecidability.TM.L.Eval]
s:4 [in Undecidability.L.Prelim.StringBase]
s:4 [in Undecidability.L.Tactics.Reflection]
s:4 [in Undecidability.L.AbstractMachines.FlatPro.ProgramsDef]
s:4 [in Undecidability.TM.Basic.Duo]
s:4 [in Undecidability.L.Computability.Scott]
s:40 [in Complexity.L.AbstractMachines.UnfoldTailRec]
s:40 [in Undecidability.L.Computability.Enum]
s:41 [in Complexity.NP.TM.mTM_to_singleTapeTM]
s:41 [in Undecidability.L.Computability.Seval]
s:41 [in Undecidability.L.Tactics.GenEncode]
s:41 [in Undecidability.L.Complexity.ResourceMeasures]
s:41 [in Complexity.L.AbstractMachines.AbstractSubstMachine]
s:41 [in Undecidability.L.Tactics.Reflection]
s:413 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
s:42 [in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
s:42 [in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
s:42 [in Complexity.Complexity.SpaceBoundsTime]
s:42 [in Undecidability.TM.Util.TM_facts]
s:43 [in Undecidability.TM.L.CompilerBoolFuns.NaryApp]
s:43 [in Undecidability.L.Computability.Seval]
s:43 [in Undecidability.L.AbstractMachines.FlatPro.Programs]
s:43 [in Undecidability.TM.Code.ChangeAlphabet]
s:438 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
s:44 [in Undecidability.L.Util.L_facts]
s:44 [in Undecidability.TM.Compound.MoveToSymbol]
s:44 [in Undecidability.TM.Util.TM_facts]
s:44 [in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
s:440 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
s:45 [in Complexity.L.AbstractMachines.Computable.EvalForTime]
s:45 [in Undecidability.TM.L.CompilerBoolFuns.NaryApp]
s:45 [in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisUnfoldClos]
s:45 [in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
s:45 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
s:45 [in Complexity.L.AbstractMachines.AbstractHeapMachine]
s:451 [in Undecidability.TM.Hoare.HoareRegister]
s:46 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
s:46 [in Complexity.NP.TM.mTM_to_singleTapeTM]
s:46 [in Undecidability.L.Computability.Seval]
s:46 [in Undecidability.L.Complexity.ResourceMeasures]
s:46 [in Complexity.NP.SAT.CookLevin.Subproblems.SingleTMGenNP]
s:46 [in Complexity.Complexity.SpaceBoundsTime]
s:46 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
s:46 [in Undecidability.TM.Util.TM_facts]
s:46 [in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
s:47 [in Undecidability.L.Tactics.Lrewrite]
s:47 [in Undecidability.L.Util.L_facts]
s:47 [in Undecidability.L.Complexity.ResourceMeasures]
s:47 [in Undecidability.TM.Code.CaseSum]
s:47 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s:47 [in Undecidability.TM.Compound.Shift]
s:48 [in Undecidability.L.Util.L_facts]
s:48 [in Undecidability.L.AbstractMachines.FlatPro.Programs]
s:48 [in Undecidability.L.Tactics.Reflection]
s:48 [in Undecidability.TM.PrettyBounds.MaxList]
s:49 [in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
s:49 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
s:49 [in Complexity.NP.TM.mTM_to_singleTapeTM]
s:49 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
s:49 [in Complexity.L.AbstractMachines.AbstractSubstMachine]
s:49 [in Undecidability.L.Datatypes.LNat]
s:5 [in Undecidability.TM.Combinators.While]
s:5 [in Undecidability.L.Functions.Eval]
s:5 [in Undecidability.L.Tactics.Lsimpl]
s:5 [in Undecidability.L.Datatypes.LTerm]
s:5 [in Complexity.NP.SAT.CookLevin.Subproblems.SingleTMGenNP]
s:5 [in Undecidability.L.AbstractMachines.FlatPro.Programs]
s:5 [in Undecidability.L.Tactics.Lbeta]
s:5 [in Undecidability.L.Functions.Proc]
s:5 [in Complexity.NP.TM.L_to_LM]
s:5 [in Undecidability.L.Computability.Rice]
s:5 [in Complexity.NP.L.GenNP]
s:5 [in Undecidability.Shared.Libs.DLW.Code.sss]
s:5 [in Undecidability.L.Computability.Por]
s:50 [in Undecidability.TM.L.CompilerBoolFuns.NaryApp]
s:50 [in Undecidability.L.Computability.Enum]
s:50 [in Complexity.NP.TM.mTM_to_singleTapeTM]
s:50 [in Undecidability.L.Computability.Seval]
s:50 [in Complexity.TM.PrettyBounds.BaseCodeSpace]
s:50 [in Undecidability.TM.Code.CaseSum]
s:50 [in Complexity.NP.SAT.CookLevin.Subproblems.SingleTMGenNP]
s:50 [in Undecidability.L.AbstractMachines.FlatPro.Programs]
s:50 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
s:50 [in Undecidability.L.Functions.Decoding]
s:51 [in Complexity.L.AbstractMachines.Computable.EvalForTime]
s:51 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
s:51 [in Undecidability.L.Tactics.Lrewrite]
s:51 [in Undecidability.TM.Code.CodeTM]
s:51 [in Complexity.L.AbstractMachines.FlatPro.Computable.Compile]
s:51 [in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
s:51 [in Undecidability.L.AbstractMachines.FlatPro.Programs]
s:51 [in Complexity.L.AbstractMachines.AbstractHeapMachine]
s:51 [in Undecidability.L.Tactics.Reflection]
s:51 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s:51 [in Undecidability.TM.Compound.Shift]
s:51 [in Undecidability.TM.PrettyBounds.MaxList]
s:52 [in Undecidability.L.Util.L_facts]
s:52 [in Undecidability.L.Tactics.GenEncode]
s:52 [in Undecidability.L.Tactics.LClos]
s:52 [in Complexity.L.AbstractMachines.FlatPro.Computable.Compile]
s:53 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
s:53 [in Undecidability.L.Computability.Seval]
s:53 [in Undecidability.TM.Univ.LowLevel]
s:53 [in Undecidability.TM.Compound.Shift]
s:54 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
s:54 [in Undecidability.L.Computability.Seval]
s:54 [in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
s:54 [in Complexity.Complexity.SpaceBoundsTime]
s:54 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
s:54 [in Undecidability.TM.Compound.Shift]
s:54 [in Undecidability.TM.PrettyBounds.MaxList]
s:55 [in Undecidability.L.Util.L_facts]
s:55 [in Undecidability.L.Tactics.LClos]
s:55 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
s:55 [in Complexity.L.AbstractMachines.AbstractHeapMachine]
s:55 [in Undecidability.TM.Code.ChangeAlphabet]
s:55 [in Undecidability.TM.L.CompilerBoolFuns.Compiler]
s:56 [in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
s:56 [in Undecidability.TM.L.CompilerBoolFuns.NaryApp]
s:56 [in Undecidability.L.Computability.Seval]
s:56 [in Undecidability.L.Complexity.ResourceMeasures]
s:56 [in Undecidability.TM.Univ.LowLevel]
s:56 [in Undecidability.TM.Code.Code]
s:57 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
s:57 [in Undecidability.L.Tactics.Lrewrite]
s:57 [in Undecidability.L.Util.L_facts]
s:57 [in Undecidability.L.Computability.Seval]
s:57 [in Complexity.Complexity.SpaceBoundsTime]
s:57 [in Undecidability.TM.Code.Code]
s:58 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
s:58 [in Undecidability.TM.Code.CodeTM]
s:58 [in Undecidability.TM.PrettyBounds.MaxList]
s:59 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
s:59 [in Undecidability.L.Computability.Seval]
s:59 [in Undecidability.L.Complexity.ResourceMeasures]
s:6 [in Undecidability.TM.Code.CaseList]
s:6 [in Undecidability.L.Util.L_facts]
s:6 [in Undecidability.L.Computability.Seval]
s:6 [in Undecidability.L.Tactics.LClos]
s:6 [in Undecidability.Shared.Libs.PSL.Lists.Position]
s:6 [in Undecidability.L.Datatypes.LTerm]
s:6 [in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
s:6 [in Undecidability.L.L]
s:6 [in Undecidability.L.Tactics.Lbeta_nonrefl]
s:6 [in Undecidability.L.AbstractMachines.FlatPro.Programs]
s:6 [in Undecidability.L.Tactics.Lbeta]
s:6 [in Undecidability.L.Tactics.Reflection]
s:6 [in Undecidability.L.Functions.Size]
s:6 [in Undecidability.TM.Single.EncodeTapes]
s:60 [in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
s:60 [in Complexity.L.AbstractMachines.Computable.EvalForTime]
s:60 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
s:60 [in Undecidability.TM.Univ.LowLevel]
s:60 [in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
s:60 [in Undecidability.TM.Hoare.HoareRegister]
s:60 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
s:60 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
s:60 [in Undecidability.TM.Code.ChangeAlphabet]
s:60 [in Undecidability.TM.Compound.Shift]
s:61 [in Undecidability.L.Util.L_facts]
s:61 [in Undecidability.TM.Code.CaseSum]
s:61 [in Undecidability.L.Functions.Decoding]
s:62 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
s:62 [in Complexity.L.TM.TMunflatten]
s:62 [in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
s:62 [in Undecidability.TM.PrettyBounds.MaxList]
s:63 [in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
s:63 [in Undecidability.L.Tactics.Lrewrite]
s:63 [in Undecidability.L.Complexity.ResourceMeasures]
s:63 [in Undecidability.TM.Code.CasePair]
s:63 [in Undecidability.TM.L.CompilerBoolFuns.Compiler]
s:64 [in Undecidability.L.Util.L_facts]
s:64 [in Undecidability.L.Tactics.LClos]
s:64 [in Undecidability.TM.Code.CodeTM]
s:64 [in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
s:64 [in Undecidability.L.AbstractMachines.FlatPro.Programs]
s:64 [in Complexity.Complexity.SpaceBoundsTime]
s:64 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
s:64 [in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
s:65 [in Undecidability.L.Util.L_facts]
s:65 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
s:65 [in Undecidability.L.Tactics.Extract]
s:65 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s:66 [in Undecidability.L.Computability.Seval]
s:66 [in Undecidability.L.Complexity.ResourceMeasures]
s:66 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
s:66 [in Complexity.L.AbstractMachines.AbstractHeapMachine]
s:66 [in Undecidability.TM.Code.ChangeAlphabet]
s:66 [in Undecidability.L.Functions.Decoding]
s:67 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
s:67 [in Undecidability.L.Tactics.Lrewrite]
s:67 [in Undecidability.L.Util.L_facts]
s:67 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
s:67 [in Undecidability.TM.Code.CodeTM]
S:67 [in Undecidability.TM.Util.Relations]
s:67 [in Undecidability.TM.Code.CasePair]
s:67 [in Undecidability.L.Tactics.Computable]
s:68 [in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
s:68 [in Complexity.Complexity.SpaceBoundsTime]
s:68 [in Undecidability.L.Tactics.Reflection]
s:68 [in Undecidability.L.Functions.Decoding]
s:69 [in Undecidability.TM.Code.CaseList]
s:69 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
s:69 [in Undecidability.L.Computability.Seval]
s:69 [in Undecidability.L.Tactics.LClos]
s:7 [in Complexity.NP.L.CanEnumTerm_def]
s:7 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
s:7 [in Complexity.NP.TM.mTM_to_singleTapeTM]
s:7 [in Undecidability.TM.Code.CodeTM]
s:7 [in Complexity.L.AbstractMachines.FlatPro.Computable.Compile]
s:7 [in Undecidability.L.L]
S:7 [in Undecidability.TM.Util.Relations]
s:7 [in Undecidability.L.Tactics.Lbeta]
s:7 [in Complexity.L.AbstractMachines.Computable.HeapMachine]
s:7 [in Undecidability.TM.PrettyBounds.MaxList]
s:7 [in Undecidability.L.Computability.Por]
s:7 [in Undecidability.TM.Single.EncodeTapes]
s:70 [in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
s:70 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
s:70 [in Undecidability.L.Util.L_facts]
s:70 [in Undecidability.L.Complexity.ResourceMeasures]
s:70 [in Undecidability.TM.Code.CodeTM]
s:71 [in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
s:71 [in Undecidability.L.Util.L_facts]
s:71 [in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
s:71 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
s:71 [in Undecidability.L.Tactics.Reflection]
s:71 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s:72 [in Complexity.TM.PrettyBounds.BaseCodeSpace]
s:72 [in Undecidability.TM.Univ.LowLevel]
s:72 [in Complexity.L.AbstractMachines.AbstractHeapMachine]
s:72 [in Undecidability.TM.Code.ChangeAlphabet]
s:72 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s:72 [in Undecidability.TM.Compound.Shift]
s:73 [in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
s:73 [in Undecidability.L.Computability.Seval]
s:73 [in Undecidability.L.Complexity.ResourceMeasures]
s:73 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
s:74 [in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
s:74 [in Undecidability.L.Util.L_facts]
s:74 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
s:74 [in Undecidability.L.Tactics.LClos]
s:74 [in Undecidability.TM.Code.ChangeAlphabet]
s:74 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s:75 [in Undecidability.L.Computability.Seval]
s:75 [in Undecidability.L.Tactics.LClos]
s:75 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s:75 [in Undecidability.TM.Compound.Shift]
s:75 [in Undecidability.TM.Code.BinNumbers.PosShiftTM]
s:76 [in Undecidability.TM.Code.CaseList]
s:76 [in Undecidability.L.Util.L_facts]
s:76 [in Undecidability.TM.Univ.LowLevel]
s:76 [in Undecidability.TM.Code.Code]
s:76 [in Undecidability.TM.Code.CasePair]
s:77 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
s:77 [in Undecidability.L.Complexity.ResourceMeasures]
s:77 [in Complexity.TM.PrettyBounds.BaseCodeSpace]
s:77 [in Undecidability.TM.Code.CodeTM]
s:77 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
s:77 [in Undecidability.TM.Compound.Shift]
s:77 [in Undecidability.TM.PrettyBounds.MaxList]
s:77 [in Undecidability.TM.Code.BinNumbers.PosShiftTM]
s:78 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
s:78 [in Undecidability.L.Computability.Seval]
s:78 [in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
s:78 [in Undecidability.TM.Code.Code]
s:79 [in Undecidability.L.Util.L_facts]
s:79 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
s:79 [in Undecidability.L.Tactics.Computable]
s:79 [in Undecidability.TM.Code.BinNumbers.PosShiftTM]
s:8 [in Complexity.L.AbstractMachines.Computable.EvalForTime]
s:8 [in Undecidability.TM.Code.CaseList]
s:8 [in Undecidability.TM.L.CompilerBoolFuns.NaryApp]
s:8 [in Undecidability.L.Computability.Seval]
s:8 [in Complexity.TM.PrettyBounds.SpaceBounds]
s:8 [in Undecidability.TM.Code.CaseBool]
s:8 [in Complexity.L.AbstractMachines.Computable.EvalForTimeBool]
s:8 [in Undecidability.L.AbstractMachines.FlatPro.Programs]
s:8 [in Undecidability.L.Prelim.StringBase]
s:8 [in Undecidability.L.Tactics.Reflection]
s:8 [in Undecidability.L.Functions.Proc]
s:8 [in Undecidability.TM.L.CaseCom]
s:8 [in Undecidability.TM.Basic.Duo]
s:8 [in Undecidability.TM.Compound.Shift]
s:8 [in Complexity.L.AbstractMachines.Computable.LargestVar]
s:80 [in Undecidability.L.Tactics.Extract]
s:80 [in Undecidability.L.Tactics.LClos]
s:80 [in Undecidability.TM.Code.CodeTM]
s:80 [in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
s:80 [in Undecidability.TM.Code.Code]
s:80 [in Undecidability.TM.Compound.Shift]
s:81 [in Undecidability.TM.Code.CaseList]
s:81 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
s:81 [in Undecidability.L.Complexity.ResourceMeasures]
s:81 [in Undecidability.TM.Code.Copy]
s:81 [in Undecidability.L.Tactics.Reflection]
s:82 [in Undecidability.L.Util.L_facts]
s:82 [in Complexity.TM.PrettyBounds.BaseCodeSpace]
s:82 [in Undecidability.TM.Compound.Shift]
s:83 [in Undecidability.Shared.Libs.PSL.Retracts]
s:83 [in Undecidability.TM.Code.CodeTM]
s:83 [in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
s:83 [in Undecidability.TM.Code.Copy]
s:83 [in Undecidability.L.Tactics.Reflection]
s:84 [in Undecidability.L.Tactics.LClos]
s:84 [in Undecidability.L.Complexity.ResourceMeasures]
s:84 [in Undecidability.TM.Univ.LowLevel]
s:84 [in Undecidability.Shared.Libs.DLW.Code.sss]
s:85 [in Undecidability.L.Util.L_facts]
s:85 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
s:85 [in Undecidability.TM.Compound.Shift]
s:86 [in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
s:86 [in Undecidability.TM.Code.Copy]
s:87 [in Undecidability.L.Util.L_facts]
s:87 [in Undecidability.L.Computability.Seval]
s:87 [in Undecidability.TM.Compound.Shift]
s:88 [in Undecidability.L.Tactics.LClos]
s:88 [in Undecidability.L.Complexity.ResourceMeasures]
s:88 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
s:88 [in Undecidability.TM.Code.Copy]
s:89 [in Undecidability.L.Util.L_facts]
s:89 [in Undecidability.TM.Univ.LowLevel]
s:89 [in Undecidability.TM.Compound.Shift]
s:9 [in Undecidability.L.Tactics.Lrewrite]
s:9 [in Complexity.HierarchyTheorem.TimeHierarchyTheorem]
s:9 [in Undecidability.TM.Combinators.Switch]
s:9 [in Undecidability.Shared.Libs.PSL.Lists.Position]
s:9 [in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
s:9 [in Complexity.L.AbstractMachines.UnfoldHeap]
s:9 [in Undecidability.L.Tactics.Lbeta_nonrefl]
s:9 [in Undecidability.L.Functions.EnumInt]
s:9 [in Undecidability.L.Functions.Proc]
s:9 [in Complexity.NP.TM.L_to_LM]
s:9 [in Undecidability.L.AbstractMachines.FlatPro.ProgramsDef]
s:9 [in Undecidability.L.Computability.Por]
s:90 [in Undecidability.L.Computability.Seval]
s:90 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
s:90 [in Undecidability.L.Complexity.ResourceMeasures]
s:90 [in Complexity.L.AbstractMachines.AbstractHeapMachine]
s:90 [in Complexity.TM.PrettyBounds.PrettyBounds]
s:91 [in Undecidability.L.Util.L_facts]
s:91 [in Complexity.TM.PrettyBounds.BaseCodeSpace]
s:92 [in Undecidability.TM.Code.Copy]
s:920 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
s:923 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
s:927 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
s:93 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
s:93 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
s:93 [in Undecidability.L.Tactics.LClos]
s:93 [in Undecidability.L.Tactics.Reflection]
s:933 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
s:94 [in Undecidability.L.Util.L_facts]
s:94 [in Undecidability.L.Computability.Seval]
s:94 [in Undecidability.L.Tactics.Reflection]
s:96 [in Undecidability.L.Util.L_facts]
s:96 [in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
s:96 [in Undecidability.TM.Code.Copy]
s:97 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
s:97 [in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
S:97 [in Undecidability.TM.Util.Relations]
s:98 [in Undecidability.L.Tactics.LClos]
s:98 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
s:99 [in Undecidability.L.Prelim.ARS]
s:99 [in Undecidability.L.Util.L_facts]
s:99 [in Undecidability.L.Computability.Seval]

T

tapes:113 [in Undecidability.TM.Util.TM_facts]
tapes:270 [in Undecidability.TM.Util.TM_facts]
tapes:384 [in Undecidability.TM.Util.TM_facts]
tapes:391 [in Undecidability.TM.Util.TM_facts]
tapes:54 [in Undecidability.TM.Util.TM_facts]
tapes:71 [in Undecidability.TM.Util.TM_facts]
tape':34 [in Complexity.NP.SAT.CookLevin.Subproblems.TM_single]
tape':38 [in Complexity.NP.SAT.CookLevin.Subproblems.TM_single]
tape':46 [in Complexity.NP.SAT.CookLevin.Subproblems.TM_single]
tape0:24 [in Complexity.TM.Code.DecodeList]
tape:32 [in Complexity.NP.SAT.CookLevin.Subproblems.TM_single]
tape:36 [in Complexity.NP.SAT.CookLevin.Subproblems.TM_single]
tape:49 [in Undecidability.TM.Lifting.LiftAlphabet]
tau:105 [in Undecidability.TM.Code.Code]
tau:109 [in Undecidability.TM.Code.Code]
tau:135 [in Undecidability.TM.Code.Code]
tau:14 [in Undecidability.L.Tactics.Computable]
tau:16 [in Complexity.TM.Single.DecodeTape]
tau:165 [in Undecidability.TM.Code.Code]
tau:18 [in Undecidability.TM.Code.CodeTM]
tau:193 [in Undecidability.TM.Util.TM_facts]
tau:200 [in Undecidability.TM.Util.TM_facts]
tau:209 [in Undecidability.TM.Util.TM_facts]
tau:23 [in Undecidability.TM.Code.CodeTM]
tau:4 [in Complexity.TM.Code.DecodeList]
tau:4 [in Complexity.TM.Code.DecodeBool]
tau:43 [in Undecidability.TM.Univ.LowLevel]
tau:448 [in Undecidability.TM.Hoare.HoareRegister]
tau:453 [in Undecidability.TM.Hoare.HoareRegister]
tau:557 [in Complexity.NP.TM.LM_to_mTM]
tau:57 [in Complexity.TM.Code.Decode]
tau:60 [in Undecidability.TM.Code.Code]
tau:64 [in Undecidability.TM.Code.Code]
tau:7 [in Complexity.TM.Single.DecodeTapes]
tau:9 [in Complexity.TM.Code.Decode]
Terminates_M_checkX:76 [in Complexity.TM.Code.Decode]
termT_f:16 [in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
Ter__X:15 [in Complexity.TM.Code.DecodeList]
ter:135 [in Undecidability.L.Tactics.Extract]
ter:34 [in Undecidability.TM.L.CompilerBoolFuns.Compiler]
ter:53 [in Undecidability.L.Tactics.GenEncode]
ter:54 [in Undecidability.L.Tactics.GenEncode]
tf:223 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
tf:228 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
tf:32 [in Undecidability.L.Datatypes.List.List_fold]
time:10 [in Undecidability.Shared.Libs.DLW.Utils.utils_string]
time:105 [in Complexity.NP.SAT.SAT_inNP]
time:110 [in Complexity.L.ComparisonTimeBoundDerivation]
time:117 [in Complexity.NP.SAT.SAT_inNP]
time:119 [in Complexity.L.ComparisonTimeBoundDerivation]
time:126 [in Complexity.NP.SAT.SAT_inNP]
time:131 [in Complexity.L.ComparisonTimeBoundDerivation]
time:137 [in Complexity.L.ComparisonTimeBoundDerivation]
time:138 [in Complexity.NP.SAT.SAT_inNP]
time:143 [in Complexity.NP.SAT.SAT_inNP]
time:147 [in Complexity.L.ComparisonTimeBoundDerivation]
time:15 [in Complexity.NP.TM.M_LM2TM]
time:150 [in Complexity.L.TM.CompCode]
time:151 [in Complexity.L.ComparisonTimeBoundDerivation]
time:155 [in Complexity.L.ComparisonTimeBoundDerivation]
time:164 [in Complexity.L.ComparisonTimeBoundDerivation]
time:17 [in Undecidability.TM.L.Transcode.Boollist_to_Enc]
time:176 [in Complexity.L.ComparisonTimeBoundDerivation]
time:185 [in Complexity.L.ComparisonTimeBoundDerivation]
time:197 [in Complexity.L.ComparisonTimeBoundDerivation]
time:202 [in Complexity.L.ComparisonTimeBoundDerivation]
time:23 [in Undecidability.TM.L.Transcode.Boollist_to_Enc]
time:24 [in Undecidability.TM.Code.List.Concat_Repeat]
time:33 [in Undecidability.TM.Code.List.Concat_Repeat]
time:34 [in Complexity.NP.TM.M_LM2TM]
time:35 [in Undecidability.TM.L.Transcode.Boollist_to_Enc]
time:38 [in Undecidability.TM.L.Transcode.Boollist_to_Enc]
time:4 [in Undecidability.Shared.Libs.DLW.Utils.utils_string]
time:43 [in Undecidability.TM.L.Transcode.Boollist_to_Enc]
time:52 [in Undecidability.TM.Code.List.Concat_Repeat]
time:61 [in Undecidability.TM.Code.List.Concat_Repeat]
time:61 [in Complexity.NP.L.CanEnumTerm]
time:64 [in Undecidability.L.Datatypes.List.List_basics]
time:69 [in Undecidability.L.Datatypes.List.List_basics]
time:81 [in Complexity.L.ComparisonTimeBoundDerivation]
time:85 [in Complexity.L.ComparisonTimeBoundDerivation]
time:88 [in Complexity.NP.SAT.SAT_inNP]
time:89 [in Complexity.L.ComparisonTimeBoundDerivation]
time:92 [in Complexity.NP.SAT.SAT_inNP]
time:94 [in Undecidability.L.Tactics.ComputableTime]
time:96 [in Complexity.NP.SAT.SAT_inNP]
time:98 [in Complexity.L.ComparisonTimeBoundDerivation]
tin:1 [in Undecidability.TM.Code.BinNumbers.PosIncrementTM]
tin:1 [in Undecidability.TM.Code.NatTM]
tin:1 [in Undecidability.TM.Code.NatSub]
tin:10 [in Undecidability.TM.Code.List.Concat_Repeat]
tin:10 [in Undecidability.TM.Code.CaseList]
tin:100 [in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
tin:100 [in Undecidability.TM.Compound.CopySymbols]
tin:101 [in Undecidability.TM.Code.Copy]
tin:103 [in Undecidability.TM.Hoare.HoareLogic]
tin:103 [in Undecidability.TM.Code.BinNumbers.PosAddTM]
tin:104 [in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
tin:105 [in Undecidability.TM.Hoare.HoareLogic]
tin:108 [in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
tin:108 [in Undecidability.TM.Code.Copy]
tin:108 [in Undecidability.TM.Compound.Shift]
tin:108 [in Undecidability.TM.Code.BinNumbers.PosAddTM]
tin:108 [in Undecidability.TM.Hoare.HoareExamples]
tin:109 [in Undecidability.TM.L.HeapInterpreter.StepTM]
tin:109 [in Undecidability.TM.Hoare.HoareCombinators]
tin:11 [in Undecidability.TM.Code.List.Length]
tin:11 [in Undecidability.TM.Code.NatTM]
tin:11 [in Undecidability.TM.Code.BinNumbers.NTM]
tin:110 [in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
tin:111 [in Undecidability.TM.Hoare.HoareExamples]
tin:112 [in Undecidability.TM.Code.NatTM]
tin:113 [in Undecidability.TM.L.HeapInterpreter.LookupTM]
tin:114 [in Undecidability.TM.Code.List.Nth]
tin:114 [in Undecidability.TM.Univ.LowLevel]
tin:114 [in Undecidability.TM.Code.Copy]
tin:114 [in Undecidability.TM.Hoare.HoareLogic]
tin:116 [in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
tin:117 [in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
tin:12 [in Undecidability.TM.Compound.CopySymbols]
tin:12 [in Complexity.NP.TM.LM_to_mTM]
tin:120 [in Undecidability.TM.Compound.MoveToSymbol]
tin:120 [in Undecidability.TM.Code.Copy]
tin:121 [in Undecidability.TM.Univ.Univ]
tin:122 [in Undecidability.TM.Code.NatTM]
tin:122 [in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
tin:123 [in Undecidability.TM.Code.Copy]
tin:124 [in Undecidability.TM.Compound.CopySymbols]
tin:124 [in Undecidability.TM.Univ.LowLevel]
tin:125 [in Undecidability.TM.Hoare.HoareLogic]
tin:126 [in Undecidability.TM.Code.List.Nth]
tin:126 [in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
tin:127 [in Undecidability.TM.Code.Copy]
tin:129 [in Undecidability.TM.Code.NatTM]
tin:129 [in Undecidability.TM.Compound.Shift]
tin:13 [in Undecidability.TM.Code.CaseNat]
tin:13 [in Complexity.TM.Code.Decode]
tin:13 [in Undecidability.TM.Lifting.LiftAlphabet]
tin:13 [in Undecidability.TM.Hoare.HoareLegacy]
tin:13 [in Undecidability.TM.Compound.CopySymbols]
tin:13 [in Undecidability.TM.Combinators.SequentialComposition]
tin:13 [in Undecidability.TM.L.CaseCom]
tin:130 [in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
tin:130 [in Undecidability.TM.Univ.LookupAssociativeListTM]
tin:132 [in Undecidability.TM.Combinators.StateWhile]
tin:136 [in Undecidability.TM.Code.NatTM]
tin:136 [in Undecidability.TM.Hoare.HoareLogic]
tin:137 [in Undecidability.TM.Hoare.HoareRegister]
tin:14 [in Undecidability.TM.Code.List.Cons_constant]
tin:14 [in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
tin:140 [in Undecidability.TM.Code.Copy]
tin:140 [in Undecidability.TM.Combinators.StateWhile]
tin:143 [in Undecidability.TM.Hoare.HoareRegister]
tin:146 [in Undecidability.TM.L.HeapInterpreter.StepTM]
tin:146 [in Undecidability.TM.Hoare.HoareLogic]
tin:148 [in Undecidability.TM.Code.Copy]
tin:15 [in Undecidability.TM.Code.BinNumbers.PosIncrementTM]
tin:15 [in Undecidability.TM.Code.BinNumbers.NTM]
tin:15 [in Undecidability.TM.Compound.CopySymbols]
tin:154 [in Undecidability.TM.Combinators.StateWhile]
tin:154 [in Undecidability.TM.Hoare.HoareCombinators]
tin:155 [in Undecidability.TM.Univ.LookupAssociativeListTM]
tin:155 [in Undecidability.TM.Hoare.HoareLogic]
tin:16 [in Undecidability.TM.Code.BinNumbers.PosMultTM]
tin:16 [in Undecidability.TM.Compound.CopySymbols]
tin:16 [in Complexity.NP.TM.M_LM2TM]
tin:16 [in Undecidability.TM.L.CaseCom]
tin:160 [in Undecidability.TM.L.HeapInterpreter.StepTM]
tin:160 [in Undecidability.TM.Hoare.HoareLogic]
tin:161 [in Undecidability.TM.Hoare.HoareRegister]
tin:164 [in Undecidability.TM.Univ.Univ]
tin:165 [in Undecidability.TM.Hoare.HoareLogic]
tin:166 [in Undecidability.TM.Hoare.HoareRegister]
tin:17 [in Undecidability.TM.Code.CaseNat]
tin:17 [in Undecidability.TM.Code.NatTM]
tin:17 [in Undecidability.TM.Combinators.If]
tin:17 [in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
tin:17 [in Undecidability.TM.Hoare.HoareStdLib]
tin:171 [in Undecidability.TM.Code.Copy]
tin:178 [in Undecidability.TM.Univ.Univ]
tin:18 [in Undecidability.TM.L.Transcode.Boollist_to_Enc]
tin:18 [in Undecidability.TM.Lifting.LiftAlphabet]
tin:18 [in Undecidability.TM.Compound.CopySymbols]
tin:18 [in Undecidability.TM.Compound.Multi]
tin:183 [in Undecidability.TM.Code.Copy]
tin:184 [in Undecidability.TM.Hoare.HoareRegister]
tin:186 [in Undecidability.TM.Hoare.HoareRegister]
tin:189 [in Undecidability.TM.L.HeapInterpreter.StepTM]
tin:19 [in Undecidability.TM.Code.List.Concat_Repeat]
tin:19 [in Undecidability.TM.Code.CaseList]
tin:19 [in Undecidability.TM.Compound.CopySymbols]
tin:19 [in Undecidability.TM.Code.CaseSum]
tin:19 [in Undecidability.TM.L.HeapInterpreter.StepTM]
tin:195 [in Undecidability.TM.Code.Copy]
tin:199 [in Undecidability.TM.Single.StepTM]
tin:2 [in Undecidability.TM.Code.BinNumbers.PosCompareTM]
tin:2 [in Undecidability.TM.Code.BinNumbers.PosShiftTM]
tin:20 [in Complexity.TM.Code.DecodeList]
tin:20 [in Undecidability.TM.Compound.CopySymbols]
tin:20 [in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
tin:203 [in Undecidability.TM.Code.Copy]
tin:205 [in Undecidability.TM.L.HeapInterpreter.StepTM]
tin:206 [in Undecidability.TM.Code.Copy]
tin:208 [in Undecidability.TM.Hoare.HoareCombinators]
tin:209 [in Undecidability.TM.Single.StepTM]
tin:21 [in Undecidability.TM.Code.List.Rev]
tin:213 [in Undecidability.TM.Code.Copy]
tin:22 [in Complexity.TM.Code.Decode]
tin:22 [in Undecidability.TM.Code.BinNumbers.PosIncrementTM]
tin:22 [in Undecidability.TM.Hoare.HoareLegacy]
tin:22 [in Undecidability.TM.Code.BinNumbers.NTM]
tin:22 [in Undecidability.TM.Code.CompareValue]
tin:22 [in Undecidability.TM.Combinators.SequentialComposition]
tin:221 [in Undecidability.TM.Single.StepTM]
tin:226 [in Undecidability.TM.Single.StepTM]
tin:23 [in Undecidability.TM.Code.CaseSum]
tin:23 [in Complexity.NP.TM.LM_to_mTM]
tin:23 [in Undecidability.TM.Compound.WriteString]
tin:240 [in Undecidability.TM.Single.StepTM]
tin:240 [in Undecidability.TM.Hoare.HoareLogic]
tin:243 [in Undecidability.TM.L.HeapInterpreter.StepTM]
tin:247 [in Undecidability.TM.Single.StepTM]
tin:25 [in Undecidability.TM.Code.List.Concat_Repeat]
tin:25 [in Undecidability.TM.Compound.Multi]
tin:25 [in Undecidability.TM.Code.BinNumbers.PosShiftTM]
tin:255 [in Undecidability.TM.Single.StepTM]
tin:26 [in Undecidability.TM.Hoare.HoareLegacy]
tin:26 [in Undecidability.TM.Code.BinNumbers.NTM]
tin:261 [in Undecidability.TM.Hoare.HoareLogic]
tin:27 [in Undecidability.TM.Code.List.Length]
tin:27 [in Undecidability.TM.L.HeapInterpreter.StepTM]
tin:271 [in Undecidability.TM.Single.StepTM]
tin:279 [in Undecidability.TM.Single.StepTM]
tin:28 [in Undecidability.TM.L.Transcode.Boollist_to_Enc]
tin:28 [in Undecidability.TM.Code.List.Rev]
tin:28 [in Undecidability.TM.Combinators.If]
tin:281 [in Undecidability.TM.Hoare.HoareLogic]
tin:289 [in Undecidability.TM.Hoare.HoareCombinators]
tin:29 [in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
tin:29 [in Undecidability.TM.Code.CasePair]
tin:29 [in Complexity.NP.TM.LM_to_mTM]
tin:291 [in Undecidability.TM.Util.TM_facts]
tin:293 [in Undecidability.TM.Single.StepTM]
tin:3 [in Undecidability.TM.Code.CaseNat]
tin:3 [in Undecidability.TM.Code.CaseBool]
tin:3 [in Undecidability.TM.Code.BinNumbers.NTM]
tin:3 [in Undecidability.TM.L.CaseCom]
tin:3 [in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
tin:30 [in Undecidability.TM.Code.CaseSum]
tin:30 [in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
tin:300 [in Undecidability.TM.Single.StepTM]
tin:301 [in Undecidability.TM.Util.TM_facts]
tin:304 [in Undecidability.TM.Hoare.HoareLogic]
tin:306 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
tin:308 [in Undecidability.TM.Single.StepTM]
tin:31 [in Undecidability.TM.Code.BinNumbers.NTM]
tin:31 [in Undecidability.TM.Code.List.App]
tin:311 [in Undecidability.TM.Single.StepTM]
tin:317 [in Undecidability.TM.Single.StepTM]
tin:32 [in Undecidability.TM.Code.NatTM]
tin:322 [in Undecidability.TM.Hoare.HoareLogic]
tin:33 [in Undecidability.TM.Code.WriteValue]
tin:330 [in Undecidability.TM.Single.StepTM]
tin:332 [in Undecidability.TM.Hoare.HoareCombinators]
tin:34 [in Undecidability.TM.Compound.CopySymbols]
tin:342 [in Undecidability.TM.Hoare.HoareCombinators]
tin:345 [in Undecidability.TM.Single.StepTM]
tin:345 [in Undecidability.TM.Hoare.HoareLogic]
tin:347 [in Undecidability.TM.Hoare.HoareCombinators]
tin:348 [in Undecidability.TM.Util.TM_facts]
tin:35 [in Undecidability.TM.Code.BinNumbers.PosMultTM]
tin:35 [in Complexity.NP.TM.LM_to_mTM]
tin:35 [in Undecidability.TM.Code.BinNumbers.PosShiftTM]
tin:352 [in Undecidability.TM.Hoare.HoareCombinators]
tin:354 [in Undecidability.TM.Single.StepTM]
tin:357 [in Undecidability.TM.Hoare.HoareCombinators]
tin:36 [in Undecidability.TM.Code.CaseList]
tin:36 [in Undecidability.TM.Code.BinNumbers.NTM]
tin:36 [in Undecidability.TM.Code.CompareValue]
tin:36 [in Undecidability.TM.Hoare.HoareLogic]
tin:36 [in Undecidability.TM.Code.BinNumbers.PosAddTM]
tin:361 [in Undecidability.TM.Single.StepTM]
tin:368 [in Undecidability.TM.Hoare.HoareLogic]
tin:37 [in Undecidability.TM.Code.List.Length]
tin:37 [in Undecidability.TM.L.HeapInterpreter.StepTM]
tin:378 [in Undecidability.TM.Single.StepTM]
tin:38 [in Undecidability.TM.Code.CasePair]
tin:39 [in Undecidability.TM.L.Transcode.Boollist_to_Enc]
tin:392 [in Undecidability.TM.Hoare.HoareCombinators]
tin:393 [in Undecidability.TM.Single.StepTM]
tin:394 [in Undecidability.TM.Hoare.HoareLogic]
tin:4 [in Undecidability.TM.L.Transcode.Boollist_to_Enc]
tin:4 [in Complexity.NP.TM.M_LM2TM]
tin:4 [in Undecidability.TM.Compound.Shift]
tin:40 [in Undecidability.TM.Combinators.While]
tin:40 [in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
tin:401 [in Undecidability.TM.Single.StepTM]
tin:402 [in Undecidability.TM.Hoare.HoareCombinators]
tin:405 [in Undecidability.TM.Hoare.HoareCombinators]
tin:408 [in Undecidability.TM.Hoare.HoareCombinators]
tin:41 [in Undecidability.TM.Code.NatTM]
tin:41 [in Undecidability.TM.Code.List.Rev]
tin:41 [in Complexity.NP.TM.M_multi2mono]
tin:41 [in Undecidability.TM.Code.List.App]
tin:413 [in Undecidability.TM.Hoare.HoareCombinators]
tin:416 [in Undecidability.TM.Hoare.HoareCombinators]
tin:42 [in Undecidability.TM.L.HeapInterpreter.LookupTM]
tin:421 [in Undecidability.TM.Single.StepTM]
tin:421 [in Undecidability.TM.Hoare.HoareCombinators]
tin:422 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
tin:429 [in Undecidability.TM.Single.StepTM]
tin:43 [in Undecidability.TM.Combinators.While]
tin:43 [in Undecidability.TM.Code.BinNumbers.PosShiftTM]
tin:44 [in Undecidability.TM.Code.CaseSum]
tin:441 [in Undecidability.TM.Hoare.HoareRegister]
tin:444 [in Undecidability.TM.Hoare.HoareRegister]
tin:445 [in Undecidability.TM.Single.StepTM]
tin:45 [in Undecidability.TM.Code.CaseList]
tin:45 [in Undecidability.TM.Compound.MoveToSymbol]
tin:452 [in Undecidability.TM.Single.StepTM]
tin:457 [in Undecidability.TM.Single.StepTM]
tin:46 [in Undecidability.TM.Code.CasePair]
tin:46 [in Undecidability.TM.Code.BinNumbers.PosAddTM]
tin:461 [in Undecidability.TM.Single.StepTM]
tin:47 [in Undecidability.TM.Code.BinNumbers.PosCompareTM]
tin:47 [in Undecidability.TM.Code.NatTM]
tin:47 [in Undecidability.TM.Compound.Compare]
tin:47 [in Undecidability.TM.L.HeapInterpreter.StepTM]
tin:473 [in Undecidability.TM.Single.StepTM]
tin:477 [in Undecidability.TM.Single.StepTM]
tin:48 [in Undecidability.TM.Code.BinNumbers.PosMultTM]
tin:48 [in Undecidability.TM.Code.CaseSum]
tin:48 [in Undecidability.TM.Compound.Shift]
tin:48 [in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
tin:49 [in Undecidability.TM.Combinators.While]
tin:49 [in Undecidability.TM.Code.List.Rev]
tin:5 [in Undecidability.TM.Code.CaseFin]
tin:5 [in Undecidability.TM.Compound.CopySymbols]
tin:5 [in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
tin:50 [in Undecidability.TM.Code.List.Length]
tin:500 [in Undecidability.TM.Single.StepTM]
tin:507 [in Undecidability.TM.Single.StepTM]
tin:51 [in Undecidability.TM.Code.CaseList]
tin:51 [in Undecidability.TM.Code.List.App]
tin:514 [in Undecidability.TM.Single.StepTM]
tin:53 [in Undecidability.TM.Code.List.Concat_Repeat]
tin:53 [in Undecidability.TM.Code.NatTM]
tin:53 [in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
tin:55 [in Undecidability.TM.Code.BinNumbers.PosShiftTM]
tin:56 [in Undecidability.TM.Code.CasePair]
tin:57 [in Undecidability.TM.Combinators.Switch]
tin:57 [in Undecidability.TM.Code.NatTM]
tin:57 [in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
tin:58 [in Undecidability.TM.Code.List.Length]
tin:59 [in Undecidability.TM.Combinators.While]
tin:59 [in Undecidability.TM.Code.List.Rev]
tin:59 [in Undecidability.TM.Code.List.App]
tin:6 [in Undecidability.TM.Code.List.Cons_constant]
tin:6 [in Complexity.NP.TM.LM_to_mTM]
tin:60 [in Undecidability.TM.Code.BinNumbers.PosShiftTM]
tin:63 [in Undecidability.TM.Univ.LowLevel]
tin:64 [in Undecidability.TM.Code.CasePair]
tin:65 [in Undecidability.TM.Code.BinNumbers.PosShiftTM]
tin:66 [in Undecidability.TM.Code.CaseList]
tin:66 [in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
tin:67 [in Undecidability.TM.Combinators.Switch]
tin:68 [in Undecidability.TM.Compound.MoveToSymbol]
tin:69 [in Undecidability.TM.Code.BinNumbers.PosCompareTM]
tin:69 [in Undecidability.TM.Code.List.Length]
tin:69 [in Undecidability.TM.Compound.CopySymbols]
tin:69 [in Undecidability.TM.Univ.LowLevel]
tin:69 [in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
tin:7 [in Undecidability.TM.Hoare.HoareLegacy]
tin:7 [in Undecidability.TM.Compound.MoveToSymbol]
tin:7 [in Undecidability.TM.Code.List.Rev]
tin:7 [in Complexity.TM.Code.DecodeBool]
tin:71 [in Undecidability.TM.Combinators.While]
tin:71 [in Undecidability.TM.Code.CaseList]
tin:71 [in Complexity.TM.Single.DecodeTape]
tin:72 [in Undecidability.TM.Compound.CopySymbols]
tin:72 [in Undecidability.TM.L.HeapInterpreter.StepTM]
tin:72 [in Undecidability.TM.Code.CasePair]
tin:73 [in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
tin:73 [in Undecidability.TM.Compound.CopySymbols]
tin:73 [in Undecidability.TM.Compound.Shift]
tin:75 [in Undecidability.TM.Code.BinNumbers.PosCompareTM]
tin:75 [in Undecidability.TM.Compound.CopySymbols]
tin:76 [in Undecidability.TM.Compound.CopySymbols]
tin:77 [in Undecidability.TM.Combinators.While]
tin:78 [in Undecidability.TM.Code.NatTM]
tin:78 [in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
tin:78 [in Undecidability.TM.Compound.CopySymbols]
tin:78 [in Undecidability.TM.Univ.LowLevel]
tin:79 [in Undecidability.TM.Code.CaseList]
tin:79 [in Undecidability.TM.Compound.CopySymbols]
tin:8 [in Undecidability.TM.Code.BinNumbers.NTM]
tin:8 [in Undecidability.TM.L.HeapInterpreter.StepTM]
tin:8 [in Undecidability.TM.Hoare.HoareLogic]
tin:80 [in Undecidability.TM.Compound.CopySymbols]
tin:80 [in Undecidability.TM.Code.BinNumbers.PosAddTM]
tin:80 [in Undecidability.TM.Hoare.HoareExamples]
tin:81 [in Undecidability.TM.Code.BinNumbers.PosShiftTM]
tin:82 [in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
tin:82 [in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
tin:82 [in Undecidability.TM.Hoare.HoareExamples]
tin:83 [in Undecidability.TM.L.HeapInterpreter.StepTM]
tin:84 [in Undecidability.TM.Compound.Compare]
tin:85 [in Undecidability.TM.Univ.LowLevel]
tin:85 [in Undecidability.TM.Hoare.HoareExamples]
tin:87 [in Undecidability.TM.Combinators.While]
tin:87 [in Undecidability.TM.Code.CaseList]
tin:87 [in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
tin:88 [in Undecidability.TM.Code.NatTM]
tin:88 [in Undecidability.TM.Hoare.HoareExamples]
tin:89 [in Undecidability.TM.Code.Copy]
tin:89 [in Undecidability.TM.Combinators.StateWhile]
tin:9 [in Undecidability.TM.L.Transcode.Boollist_to_Enc]
tin:9 [in Undecidability.TM.Code.CaseSum]
tin:9 [in Undecidability.TM.Compound.Compare]
tin:9 [in Undecidability.TM.Code.BinNumbers.PosShiftTM]
tin:91 [in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
tin:91 [in Undecidability.TM.Hoare.HoareLogic]
tin:91 [in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
tin:91 [in Undecidability.TM.Code.BinNumbers.PosShiftTM]
tin:93 [in Undecidability.TM.Univ.LowLevel]
tin:93 [in Undecidability.TM.Code.Copy]
tin:96 [in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
tin:96 [in Undecidability.TM.Compound.MoveToSymbol]
tin:96 [in Undecidability.TM.Combinators.StateWhile]
tin:96 [in Undecidability.TM.Code.BinNumbers.PosAddTM]
tin:97 [in Undecidability.TM.Code.CaseList]
tin:97 [in Complexity.TM.Single.DecodeTape]
tin:98 [in Undecidability.TM.Code.NatTM]
tin:98 [in Undecidability.TM.L.HeapInterpreter.StepTM]
tin:99 [in Undecidability.TM.Univ.LowLevel]
tl:142 [in Undecidability.TM.Compound.MoveToSymbol]
tl:179 [in Undecidability.TM.Compound.MoveToSymbol]
tl:5 [in Undecidability.Shared.Libs.DLW.Utils.list_bool]
tl:65 [in Complexity.NP.TM.M_multi2mono]
tl:69 [in Complexity.NP.TM.M_multi2mono]
tl:9 [in Undecidability.Shared.Libs.DLW.Utils.list_bool]
tmid:101 [in Undecidability.TM.Combinators.StateWhile]
tmid:113 [in Undecidability.TM.Combinators.StateWhile]
tmid:135 [in Undecidability.TM.Combinators.StateWhile]
tmid:156 [in Undecidability.TM.Hoare.HoareCombinators]
tmid:158 [in Undecidability.TM.Hoare.HoareCombinators]
tmid:159 [in Undecidability.TM.Combinators.StateWhile]
tmid:318 [in Undecidability.TM.Hoare.HoareCombinators]
tmid:333 [in Undecidability.TM.Hoare.HoareCombinators]
tmid:339 [in Undecidability.TM.Hoare.HoareCombinators]
tmid:393 [in Undecidability.TM.Hoare.HoareCombinators]
tmid:399 [in Undecidability.TM.Hoare.HoareCombinators]
tmid:44 [in Undecidability.TM.Combinators.While]
tmid:53 [in Undecidability.TM.Combinators.While]
tmid:54 [in Undecidability.TM.Combinators.While]
tmid:62 [in Undecidability.TM.Combinators.While]
tmid:64 [in Undecidability.TM.Combinators.While]
tmid:72 [in Undecidability.TM.Combinators.While]
tmid:92 [in Undecidability.TM.Combinators.While]
tmid:99 [in Undecidability.TM.Combinators.StateWhile]
tmp:10 [in Undecidability.TM.L.Eval]
tmp:35 [in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
TM':3709 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
tm:103 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:106 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:1108 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:1109 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:1111 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:1114 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:1121 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:114 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:120 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:122 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:131 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:136 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:14 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:140 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:143 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:147 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:15 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:153 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:155 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:16 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:169 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:17 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:173 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:177 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:18 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:181 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:185 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:189 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:19 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:190 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:194 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:198 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:20 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:202 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:21 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:22 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:23 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:24 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:25 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:27 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:274 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:279 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:28 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:29 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:293 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:298 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:30 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:304 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:307 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:31 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:318 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:33 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:339 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:34 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:342 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:345 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:348 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:349 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:35 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:353 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:356 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:359 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:363 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:37 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:370 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:3708 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
tm:373 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:376 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:379 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:38 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:382 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:386 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:39 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:391 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:394 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:40 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:400 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:406 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:413 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:42 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:423 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:430 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:431 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:433 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:434 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:435 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:437 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:438 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:439 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:441 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:442 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:443 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:445 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:447 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:451 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:452 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:458 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:466 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:473 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:481 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:490 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:495 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:50 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:501 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:506 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:511 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:516 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:522 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:527 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:532 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:537 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:543 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:548 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:553 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:557 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:563 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:568 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:574 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:581 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:584 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:588 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:591 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:594 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:597 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:601 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:604 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:607 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:61 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:610 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:614 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:617 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:620 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:621 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:623 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:629 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:633 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:639 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:645 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:649 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:653 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:657 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:661 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:666 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:672 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:688 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:693 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:694 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:695 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:699 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:700 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:703 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:705 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:708 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:71 [in Complexity.L.TM.TMflatten]
tm:712 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:717 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:719 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:721 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:723 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:726 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:728 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:731 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:732 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:735 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:738 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:74 [in Complexity.L.TM.TMflatten]
tm:741 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:748 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:753 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:755 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:757 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:759 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:762 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:763 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:764 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:766 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:769 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:773 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:778 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:779 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:780 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:781 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:782 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:783 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:785 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:786 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:787 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:788 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:789 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:791 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:793 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:794 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:796 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:828 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:830 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:832 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:836 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:840 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:853 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:857 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:86 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:875 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:880 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:902 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:904 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:906 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:908 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:910 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:911 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:912 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:914 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:918 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:919 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:921 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:925 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:929 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:932 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:935 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:936 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:937 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:938 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:940 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:941 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:942 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:945 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:948 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:952 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:957 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:962 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tm:98 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
tout:10 [in Undecidability.TM.L.Transcode.Boollist_to_Enc]
tout:10 [in Undecidability.TM.Code.CaseSum]
tout:10 [in Undecidability.TM.Compound.Compare]
tout:10 [in Undecidability.TM.Code.BinNumbers.PosShiftTM]
tout:101 [in Undecidability.TM.Compound.CopySymbols]
tout:102 [in Undecidability.TM.Code.Copy]
tout:104 [in Undecidability.TM.Code.BinNumbers.PosAddTM]
tout:105 [in Undecidability.TM.Hoare.HoareExamples]
tout:107 [in Undecidability.TM.Hoare.HoareLogic]
tout:107 [in Undecidability.TM.Hoare.HoareExamples]
tout:109 [in Undecidability.TM.Compound.Shift]
tout:109 [in Undecidability.TM.Code.BinNumbers.PosAddTM]
tout:11 [in Undecidability.TM.Code.List.Concat_Repeat]
tout:11 [in Undecidability.TM.Code.CaseList]
tout:110 [in Undecidability.TM.L.HeapInterpreter.StepTM]
tout:110 [in Undecidability.TM.Hoare.HoareCombinators]
tout:110 [in Undecidability.TM.Hoare.HoareExamples]
tout:115 [in Undecidability.TM.Code.List.Nth]
tout:115 [in Undecidability.TM.Univ.LowLevel]
tout:115 [in Undecidability.TM.Hoare.HoareLogic]
tout:117 [in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
tout:118 [in Undecidability.TM.Univ.Univ]
tout:12 [in Undecidability.TM.Code.List.Length]
tout:12 [in Undecidability.TM.Code.NatTM]
tout:12 [in Undecidability.TM.Code.BinNumbers.NTM]
tout:124 [in Undecidability.TM.Code.Copy]
tout:126 [in Undecidability.TM.Hoare.HoareLogic]
tout:128 [in Undecidability.TM.Code.Copy]
tout:131 [in Undecidability.TM.Univ.LookupAssociativeListTM]
tout:136 [in Undecidability.TM.Combinators.StateWhile]
tout:138 [in Undecidability.TM.Hoare.HoareRegister]
tout:14 [in Undecidability.TM.Code.CaseNat]
tout:14 [in Complexity.TM.Code.Decode]
tout:14 [in Undecidability.TM.Lifting.LiftAlphabet]
tout:14 [in Undecidability.TM.Hoare.HoareLegacy]
tout:14 [in Undecidability.TM.L.CaseCom]
tout:14 [in Complexity.NP.TM.LM_to_mTM]
tout:141 [in Undecidability.TM.Code.Copy]
tout:143 [in Undecidability.TM.Combinators.StateWhile]
tout:144 [in Undecidability.TM.Hoare.HoareRegister]
tout:148 [in Undecidability.TM.Hoare.HoareLogic]
tout:16 [in Undecidability.TM.Code.BinNumbers.PosIncrementTM]
tout:16 [in Undecidability.TM.Code.BinNumbers.NTM]
tout:161 [in Undecidability.TM.L.HeapInterpreter.StepTM]
tout:162 [in Undecidability.TM.Hoare.HoareRegister]
tout:165 [in Undecidability.TM.Univ.Univ]
tout:167 [in Undecidability.TM.Hoare.HoareRegister]
tout:17 [in Undecidability.TM.Code.BinNumbers.PosMultTM]
tout:17 [in Undecidability.TM.Combinators.SequentialComposition]
tout:17 [in Undecidability.TM.L.CaseCom]
tout:172 [in Undecidability.TM.Code.Copy]
tout:18 [in Undecidability.TM.Code.CaseNat]
tout:18 [in Undecidability.TM.Code.NatTM]
tout:18 [in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
tout:19 [in Undecidability.TM.Compound.Multi]
tout:196 [in Undecidability.TM.Code.Copy]
tout:2 [in Undecidability.TM.Code.BinNumbers.PosIncrementTM]
tout:2 [in Undecidability.TM.Code.NatTM]
tout:2 [in Undecidability.TM.Code.NatSub]
tout:20 [in Undecidability.TM.Code.List.Concat_Repeat]
tout:20 [in Undecidability.TM.Code.CaseList]
tout:20 [in Undecidability.TM.Code.CaseSum]
tout:200 [in Undecidability.TM.Single.StepTM]
tout:206 [in Undecidability.TM.L.HeapInterpreter.StepTM]
tout:207 [in Undecidability.TM.Code.Copy]
tout:21 [in Undecidability.TM.Combinators.If]
tout:21 [in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
tout:210 [in Undecidability.TM.Single.StepTM]
tout:210 [in Undecidability.TM.Hoare.HoareCombinators]
tout:227 [in Undecidability.TM.Single.StepTM]
tout:23 [in Complexity.TM.Code.Decode]
tout:23 [in Undecidability.TM.Code.BinNumbers.PosIncrementTM]
tout:23 [in Undecidability.TM.Code.BinNumbers.NTM]
tout:23 [in Undecidability.TM.Code.CompareValue]
tout:24 [in Undecidability.TM.Code.CaseSum]
tout:24 [in Undecidability.TM.Compound.WriteString]
tout:248 [in Undecidability.TM.Single.StepTM]
tout:25 [in Undecidability.TM.Combinators.SequentialComposition]
tout:251 [in Undecidability.TM.Hoare.HoareLogic]
tout:256 [in Undecidability.TM.Single.StepTM]
tout:26 [in Undecidability.TM.Compound.Multi]
tout:26 [in Undecidability.TM.Code.BinNumbers.PosShiftTM]
tout:27 [in Undecidability.TM.Code.BinNumbers.NTM]
tout:272 [in Undecidability.TM.Hoare.HoareLogic]
tout:28 [in Undecidability.TM.L.HeapInterpreter.StepTM]
tout:280 [in Undecidability.TM.Single.StepTM]
tout:29 [in Undecidability.TM.L.Transcode.Boollist_to_Enc]
tout:29 [in Undecidability.TM.Code.List.Rev]
tout:291 [in Undecidability.TM.Hoare.HoareCombinators]
tout:296 [in Undecidability.TM.Hoare.HoareLogic]
tout:3 [in Undecidability.TM.Code.BinNumbers.PosCompareTM]
tout:3 [in Undecidability.TM.Code.BinNumbers.PosShiftTM]
tout:30 [in Undecidability.TM.Code.CasePair]
tout:301 [in Undecidability.TM.Single.StepTM]
tout:307 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
tout:31 [in Undecidability.TM.Code.CaseSum]
tout:31 [in Undecidability.TM.Combinators.If]
tout:31 [in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
tout:312 [in Undecidability.TM.Single.StepTM]
tout:313 [in Undecidability.TM.Hoare.HoareLogic]
tout:32 [in Undecidability.TM.Code.BinNumbers.NTM]
tout:32 [in Undecidability.TM.Code.List.App]
tout:320 [in Undecidability.TM.Hoare.HoareCombinators]
tout:33 [in Undecidability.TM.Code.NatTM]
tout:331 [in Undecidability.TM.Single.StepTM]
tout:334 [in Undecidability.TM.Hoare.HoareLogic]
tout:336 [in Undecidability.TM.Hoare.HoareCombinators]
tout:34 [in Undecidability.TM.Code.WriteValue]
tout:340 [in Undecidability.TM.Hoare.HoareCombinators]
tout:343 [in Undecidability.TM.Hoare.HoareCombinators]
tout:348 [in Undecidability.TM.Hoare.HoareCombinators]
tout:35 [in Undecidability.TM.Compound.CopySymbols]
tout:353 [in Undecidability.TM.Hoare.HoareCombinators]
tout:355 [in Undecidability.TM.Single.StepTM]
tout:358 [in Undecidability.TM.Hoare.HoareLogic]
tout:358 [in Undecidability.TM.Hoare.HoareCombinators]
tout:36 [in Undecidability.TM.Code.BinNumbers.PosMultTM]
tout:36 [in Undecidability.TM.Code.BinNumbers.PosShiftTM]
tout:362 [in Undecidability.TM.Single.StepTM]
tout:37 [in Undecidability.TM.Code.CaseList]
tout:37 [in Undecidability.TM.Code.BinNumbers.NTM]
tout:37 [in Undecidability.TM.Code.BinNumbers.PosAddTM]
tout:379 [in Undecidability.TM.Single.StepTM]
tout:38 [in Undecidability.TM.Code.List.Length]
tout:385 [in Undecidability.TM.Hoare.HoareLogic]
tout:396 [in Undecidability.TM.Hoare.HoareCombinators]
tout:4 [in Undecidability.TM.Code.CaseNat]
tout:4 [in Undecidability.TM.Code.CaseBool]
tout:4 [in Undecidability.TM.Code.BinNumbers.NTM]
tout:4 [in Undecidability.TM.L.CaseCom]
tout:4 [in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
tout:400 [in Undecidability.TM.Hoare.HoareCombinators]
tout:402 [in Undecidability.TM.Single.StepTM]
tout:404 [in Undecidability.TM.Hoare.HoareLogic]
tout:409 [in Undecidability.TM.Hoare.HoareCombinators]
tout:41 [in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
tout:417 [in Undecidability.TM.Hoare.HoareCombinators]
tout:42 [in Undecidability.TM.Combinators.While]
tout:42 [in Complexity.NP.TM.M_multi2mono]
tout:423 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
tout:43 [in Undecidability.TM.L.HeapInterpreter.LookupTM]
tout:430 [in Undecidability.TM.Single.StepTM]
tout:44 [in Undecidability.TM.Code.BinNumbers.PosShiftTM]
tout:45 [in Undecidability.TM.Code.CaseSum]
tout:453 [in Undecidability.TM.Single.StepTM]
tout:46 [in Undecidability.TM.Combinators.While]
tout:46 [in Undecidability.TM.Compound.MoveToSymbol]
tout:462 [in Undecidability.TM.Single.StepTM]
tout:47 [in Undecidability.TM.Code.CasePair]
tout:47 [in Undecidability.TM.Code.BinNumbers.PosAddTM]
tout:478 [in Undecidability.TM.Single.StepTM]
tout:48 [in Undecidability.TM.Code.BinNumbers.PosCompareTM]
tout:48 [in Undecidability.TM.Compound.Compare]
tout:48 [in Undecidability.TM.L.HeapInterpreter.StepTM]
tout:49 [in Undecidability.TM.Code.BinNumbers.PosMultTM]
tout:49 [in Undecidability.TM.Code.CaseSum]
tout:49 [in Undecidability.TM.Compound.Shift]
tout:49 [in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
tout:5 [in Undecidability.TM.L.Transcode.Boollist_to_Enc]
tout:5 [in Complexity.NP.TM.M_LM2TM]
tout:5 [in Undecidability.TM.Compound.Shift]
tout:50 [in Undecidability.TM.Code.List.Rev]
tout:508 [in Undecidability.TM.Single.StepTM]
tout:52 [in Undecidability.TM.Code.List.App]
tout:56 [in Undecidability.TM.Code.BinNumbers.PosShiftTM]
tout:58 [in Undecidability.TM.Code.NatTM]
tout:58 [in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
tout:59 [in Undecidability.TM.Code.List.Length]
tout:6 [in Undecidability.TM.L.Transcode.Boollist_to_Enc]
tout:6 [in Undecidability.TM.Code.CaseFin]
tout:6 [in Undecidability.TM.Compound.CopySymbols]
tout:6 [in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
tout:61 [in Undecidability.TM.Combinators.Switch]
tout:61 [in Undecidability.TM.Code.BinNumbers.PosShiftTM]
tout:64 [in Undecidability.TM.Univ.LowLevel]
tout:65 [in Undecidability.TM.Code.CasePair]
tout:66 [in Undecidability.TM.Code.BinNumbers.PosShiftTM]
tout:67 [in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
tout:7 [in Undecidability.TM.Code.List.Cons_constant]
tout:70 [in Undecidability.TM.Combinators.Switch]
tout:70 [in Undecidability.TM.Code.BinNumbers.PosCompareTM]
tout:70 [in Undecidability.TM.Univ.LowLevel]
tout:71 [in Undecidability.TM.Univ.Univ]
tout:72 [in Undecidability.TM.Code.CaseList]
tout:72 [in Complexity.TM.Single.DecodeTape]
tout:73 [in Undecidability.TM.Combinators.While]
tout:76 [in Undecidability.TM.Code.BinNumbers.PosCompareTM]
tout:79 [in Undecidability.TM.Combinators.While]
tout:79 [in Undecidability.TM.Code.NatTM]
tout:79 [in Undecidability.TM.Univ.LowLevel]
tout:79 [in Undecidability.TM.Hoare.HoareExamples]
tout:8 [in Undecidability.TM.Hoare.HoareLegacy]
tout:8 [in Undecidability.TM.Compound.MoveToSymbol]
tout:8 [in Undecidability.TM.Code.List.Rev]
tout:80 [in Undecidability.TM.Code.CaseList]
tout:81 [in Undecidability.TM.Code.BinNumbers.PosAddTM]
tout:81 [in Undecidability.TM.Hoare.HoareExamples]
tout:82 [in Undecidability.TM.Code.BinNumbers.PosShiftTM]
tout:83 [in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
tout:84 [in Undecidability.TM.L.HeapInterpreter.StepTM]
tout:84 [in Undecidability.TM.Hoare.HoareExamples]
tout:86 [in Undecidability.TM.Univ.LowLevel]
tout:87 [in Undecidability.TM.Hoare.HoareExamples]
tout:88 [in Undecidability.TM.Code.CaseList]
tout:88 [in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
tout:89 [in Undecidability.TM.Code.NatTM]
tout:9 [in Undecidability.TM.Code.BinNumbers.NTM]
tout:9 [in Undecidability.TM.L.HeapInterpreter.StepTM]
tout:9 [in Undecidability.TM.Hoare.HoareLogic]
tout:90 [in Undecidability.TM.Code.Copy]
tout:92 [in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
tout:92 [in Undecidability.TM.Code.BinNumbers.PosShiftTM]
tout:93 [in Undecidability.TM.Hoare.HoareLogic]
tout:94 [in Undecidability.TM.Univ.LowLevel]
tout:94 [in Undecidability.TM.Code.Copy]
tout:97 [in Undecidability.TM.Compound.MoveToSymbol]
tout:97 [in Undecidability.TM.Code.BinNumbers.PosAddTM]
tout:99 [in Undecidability.TM.Code.NatTM]
tpr:14 [in Complexity.NP.SAT.CookLevin.Reductions.TCC_to_CC]
tpr:15 [in Complexity.NP.SAT.CookLevin.Reductions.TCC_to_CC]
tpr:95 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
tpr:97 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
tpr:99 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
tps1a:213 [in Complexity.TM.PrettyBounds.M2MBounds]
tps1b:214 [in Complexity.TM.PrettyBounds.M2MBounds]
tps1:109 [in Complexity.TM.PrettyBounds.M2MBounds]
tps1:121 [in Complexity.TM.PrettyBounds.M2MBounds]
tps1:129 [in Complexity.TM.PrettyBounds.M2MBounds]
tps1:137 [in Complexity.TM.PrettyBounds.M2MBounds]
tps1:141 [in Undecidability.TM.Single.StepTM]
tps1:152 [in Complexity.TM.PrettyBounds.M2MBounds]
tps1:161 [in Complexity.TM.PrettyBounds.M2MBounds]
tps1:162 [in Undecidability.TM.Single.StepTM]
tps1:168 [in Undecidability.TM.Single.StepTM]
tps1:171 [in Complexity.TM.PrettyBounds.M2MBounds]
tps1:171 [in Undecidability.TM.Single.StepTM]
tps1:177 [in Undecidability.TM.Single.StepTM]
tps1:185 [in Undecidability.TM.Single.StepTM]
tps1:191 [in Undecidability.TM.Single.StepTM]
tps1:199 [in Complexity.TM.PrettyBounds.M2MBounds]
tps1:203 [in Undecidability.TM.Single.StepTM]
tps1:206 [in Complexity.TM.PrettyBounds.M2MBounds]
tps1:213 [in Undecidability.TM.Single.StepTM]
tps1:221 [in Complexity.TM.PrettyBounds.M2MBounds]
tps1:223 [in Undecidability.TM.Single.StepTM]
tps1:228 [in Complexity.TM.PrettyBounds.M2MBounds]
tps1:230 [in Undecidability.TM.Single.StepTM]
tps1:236 [in Complexity.TM.PrettyBounds.M2MBounds]
tps1:242 [in Undecidability.TM.Single.StepTM]
tps1:251 [in Undecidability.TM.Single.StepTM]
tps1:259 [in Undecidability.TM.Single.StepTM]
tps1:273 [in Undecidability.TM.Single.StepTM]
tps1:283 [in Undecidability.TM.Single.StepTM]
tps1:295 [in Undecidability.TM.Single.StepTM]
tps1:332 [in Undecidability.TM.Single.StepTM]
tps1:341 [in Undecidability.TM.Single.StepTM]
tps1:347 [in Undecidability.TM.Single.StepTM]
tps1:356 [in Undecidability.TM.Single.StepTM]
tps1:380 [in Undecidability.TM.Single.StepTM]
tps1:389 [in Undecidability.TM.Single.StepTM]
tps1:395 [in Undecidability.TM.Single.StepTM]
tps1:405 [in Undecidability.TM.Single.StepTM]
tps1:417 [in Undecidability.TM.Single.StepTM]
tps1:423 [in Undecidability.TM.Single.StepTM]
tps1:433 [in Undecidability.TM.Single.StepTM]
tps1:439 [in Undecidability.TM.Single.StepTM]
tps1:447 [in Undecidability.TM.Single.StepTM]
tps1:8 [in Undecidability.TM.Basic.Mono]
tps1:80 [in Complexity.TM.PrettyBounds.M2MBounds]
tps1:86 [in Complexity.TM.PrettyBounds.M2MBounds]
tps1:92 [in Complexity.TM.PrettyBounds.M2MBounds]
tps1:98 [in Complexity.TM.PrettyBounds.M2MBounds]
tps2:111 [in Complexity.TM.PrettyBounds.M2MBounds]
tps2:122 [in Complexity.TM.PrettyBounds.M2MBounds]
tps2:130 [in Complexity.TM.PrettyBounds.M2MBounds]
tps2:138 [in Complexity.TM.PrettyBounds.M2MBounds]
tps2:142 [in Undecidability.TM.Single.StepTM]
tps2:153 [in Complexity.TM.PrettyBounds.M2MBounds]
tps2:162 [in Complexity.TM.PrettyBounds.M2MBounds]
tps2:163 [in Undecidability.TM.Single.StepTM]
tps2:169 [in Undecidability.TM.Single.StepTM]
tps2:172 [in Complexity.TM.PrettyBounds.M2MBounds]
tps2:172 [in Undecidability.TM.Single.StepTM]
tps2:178 [in Undecidability.TM.Single.StepTM]
tps2:186 [in Undecidability.TM.Single.StepTM]
tps2:192 [in Undecidability.TM.Single.StepTM]
tps2:200 [in Complexity.TM.PrettyBounds.M2MBounds]
tps2:204 [in Undecidability.TM.Single.StepTM]
tps2:207 [in Complexity.TM.PrettyBounds.M2MBounds]
tps2:214 [in Undecidability.TM.Single.StepTM]
tps2:215 [in Complexity.TM.PrettyBounds.M2MBounds]
tps2:222 [in Complexity.TM.PrettyBounds.M2MBounds]
tps2:224 [in Undecidability.TM.Single.StepTM]
tps2:229 [in Complexity.TM.PrettyBounds.M2MBounds]
tps2:231 [in Undecidability.TM.Single.StepTM]
tps2:237 [in Complexity.TM.PrettyBounds.M2MBounds]
tps2:243 [in Undecidability.TM.Single.StepTM]
tps2:252 [in Undecidability.TM.Single.StepTM]
tps2:260 [in Undecidability.TM.Single.StepTM]
tps2:274 [in Undecidability.TM.Single.StepTM]
tps2:285 [in Undecidability.TM.Single.StepTM]
tps2:288 [in Undecidability.TM.Single.StepTM]
tps2:296 [in Undecidability.TM.Single.StepTM]
tps2:333 [in Undecidability.TM.Single.StepTM]
tps2:342 [in Undecidability.TM.Single.StepTM]
tps2:348 [in Undecidability.TM.Single.StepTM]
tps2:357 [in Undecidability.TM.Single.StepTM]
tps2:381 [in Undecidability.TM.Single.StepTM]
tps2:390 [in Undecidability.TM.Single.StepTM]
tps2:396 [in Undecidability.TM.Single.StepTM]
tps2:406 [in Undecidability.TM.Single.StepTM]
tps2:418 [in Undecidability.TM.Single.StepTM]
tps2:424 [in Undecidability.TM.Single.StepTM]
tps2:434 [in Undecidability.TM.Single.StepTM]
tps2:440 [in Undecidability.TM.Single.StepTM]
tps2:448 [in Undecidability.TM.Single.StepTM]
tps2:60 [in Complexity.TM.PrettyBounds.M2MBounds]
tps2:81 [in Complexity.TM.PrettyBounds.M2MBounds]
tps2:87 [in Complexity.TM.PrettyBounds.M2MBounds]
tps2:9 [in Undecidability.TM.Basic.Mono]
tps2:93 [in Complexity.TM.PrettyBounds.M2MBounds]
tps2:99 [in Complexity.TM.PrettyBounds.M2MBounds]
tps:117 [in Undecidability.TM.Single.StepTM]
tps:136 [in Undecidability.TM.Single.StepTM]
tps:143 [in Complexity.TM.PrettyBounds.M2MBounds]
tps:144 [in Undecidability.TM.Single.StepTM]
tps:147 [in Complexity.TM.PrettyBounds.M2MBounds]
tps:160 [in Undecidability.TM.Single.StepTM]
tps:166 [in Undecidability.TM.Single.StepTM]
tps:19 [in Complexity.NP.SAT.CookLevin.Subproblems.TM_single]
tps:206 [in Undecidability.TM.Single.StepTM]
tps:243 [in Complexity.TM.PrettyBounds.M2MBounds]
tps:249 [in Complexity.TM.PrettyBounds.M2MBounds]
tps:263 [in Undecidability.TM.Single.StepTM]
tps:276 [in Undecidability.TM.Single.StepTM]
tps:286 [in Undecidability.TM.Single.StepTM]
tps:298 [in Undecidability.TM.Single.StepTM]
tps:313 [in Undecidability.TM.Single.StepTM]
tps:316 [in Undecidability.TM.Single.StepTM]
tps:319 [in Undecidability.TM.Single.StepTM]
tps:323 [in Undecidability.TM.Single.StepTM]
tps:409 [in Undecidability.TM.Single.StepTM]
tps:426 [in Undecidability.TM.Single.StepTM]
tps:436 [in Undecidability.TM.Single.StepTM]
tps:450 [in Undecidability.TM.Single.StepTM]
tps:454 [in Undecidability.TM.Single.StepTM]
tps:455 [in Undecidability.TM.Single.StepTM]
tps:459 [in Undecidability.TM.Single.StepTM]
tps:51 [in Complexity.TM.PrettyBounds.M2MBounds]
tps:55 [in Complexity.TM.PrettyBounds.M2MBounds]
tps:69 [in Complexity.TM.PrettyBounds.M2MBounds]
tps:71 [in Complexity.TM.PrettyBounds.M2MBounds]
tps:73 [in Complexity.TM.PrettyBounds.M2MBounds]
tps:76 [in Complexity.TM.PrettyBounds.M2MBounds]
tps:8 [in Undecidability.TM.PrettyBounds.SizeBounds]
tp_final:226 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
tp_final:207 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
tp'':153 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
tp':106 [in Undecidability.TM.Univ.Univ]
tp':113 [in Undecidability.TM.Univ.Univ]
tp':120 [in Undecidability.TM.Univ.Univ]
tp':123 [in Undecidability.TM.Univ.Univ]
tp':131 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
tp':142 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
tp':150 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
tp':16 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
tp':167 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
tp':185 [in Undecidability.TM.Univ.Univ]
tp':2717 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
tp':2731 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
tp':2737 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
tp':2745 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
tp':2762 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
tp':2773 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
tp':2781 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
tp':474 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
tp':48 [in Undecidability.TM.Univ.Univ]
tp':481 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
tp':49 [in Undecidability.TM.Univ.Univ]
tp':5 [in Complexity.NP.SAT.CookLevin.Reductions.TMGenNP_fixed_singleTapeTM_to_FlatFunSingleTMGenNP]
tp':50 [in Complexity.NP.SAT.CookLevin.Subproblems.TM_single]
tp':55 [in Undecidability.TM.Univ.Univ]
tp':56 [in Undecidability.TM.Univ.Univ]
tp':66 [in Undecidability.TM.Univ.Univ]
tp':74 [in Undecidability.TM.Univ.Univ]
tp0:462 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
tp0:463 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
tp1:101 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
tp2:102 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
tp:101 [in Complexity.TM.PrettyBounds.M2MBounds]
tp:101 [in Undecidability.TM.Univ.Univ]
tp:104 [in Complexity.TM.PrettyBounds.M2MBounds]
tp:104 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
tp:105 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
tp:106 [in Complexity.TM.PrettyBounds.M2MBounds]
tp:106 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
tp:107 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
tp:108 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
tp:109 [in Undecidability.TM.Univ.Univ]
tp:11 [in Complexity.TM.PrettyBounds.M2MBounds]
tp:11 [in Undecidability.L.TM.TMinL]
tp:11 [in Complexity.NP.SAT.CookLevin.Subproblems.TM_single]
tp:110 [in Complexity.TM.PrettyBounds.M2MBounds]
tp:111 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
tp:112 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
tp:113 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
tp:114 [in Complexity.TM.PrettyBounds.M2MBounds]
tp:114 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
tp:115 [in Undecidability.TM.Univ.Univ]
tp:116 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
tp:117 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
tp:122 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
tp:123 [in Complexity.TM.PrettyBounds.M2MBounds]
tp:125 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
tp:126 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
tp:126 [in Undecidability.TM.Univ.Univ]
tp:130 [in Undecidability.TM.Univ.Univ]
tp:131 [in Complexity.TM.PrettyBounds.M2MBounds]
tp:133 [in Complexity.TM.PrettyBounds.UnivBounds]
tp:134 [in Undecidability.TM.Univ.Univ]
tp:136 [in Complexity.TM.PrettyBounds.UnivBounds]
tp:137 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
tp:137 [in Undecidability.TM.Single.StepTM]
tp:138 [in Undecidability.TM.Univ.Univ]
tp:139 [in Complexity.TM.PrettyBounds.M2MBounds]
tp:14 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
tp:142 [in Undecidability.TM.Univ.Univ]
tp:145 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
tp:146 [in Undecidability.TM.Univ.Univ]
tp:147 [in Undecidability.TM.Univ.LowLevel]
tp:150 [in Undecidability.TM.Univ.Univ]
tp:154 [in Complexity.TM.PrettyBounds.M2MBounds]
tp:154 [in Complexity.TM.PrettyBounds.UnivBounds]
tp:154 [in Undecidability.TM.Univ.Univ]
tp:157 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
tp:158 [in Undecidability.TM.Univ.Univ]
tp:16 [in Complexity.NP.SAT.CookLevin.Subproblems.TM_single]
tp:162 [in Undecidability.TM.Univ.Univ]
tp:163 [in Complexity.TM.PrettyBounds.M2MBounds]
tp:163 [in Complexity.TM.PrettyBounds.UnivBounds]
tp:164 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
tp:164 [in Undecidability.TM.Single.StepTM]
tp:168 [in Complexity.TM.PrettyBounds.UnivBounds]
tp:168 [in Undecidability.TM.Univ.Univ]
tp:170 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
tp:173 [in Complexity.TM.PrettyBounds.M2MBounds]
tp:173 [in Complexity.TM.PrettyBounds.UnivBounds]
tp:177 [in Complexity.TM.PrettyBounds.M2MBounds]
tp:181 [in Undecidability.TM.Univ.Univ]
tp:19 [in Undecidability.TM.Univ.Univ]
tp:193 [in Undecidability.TM.Single.StepTM]
tp:2 [in Complexity.NP.SAT.CookLevin.Reductions.TMGenNP_fixed_singleTapeTM_to_FlatFunSingleTMGenNP]
tp:201 [in Complexity.TM.PrettyBounds.M2MBounds]
tp:205 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
tp:205 [in Undecidability.TM.Single.StepTM]
tp:208 [in Complexity.TM.PrettyBounds.M2MBounds]
tp:210 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
tp:215 [in Undecidability.TM.Single.StepTM]
tp:216 [in Complexity.TM.PrettyBounds.M2MBounds]
tp:218 [in Undecidability.TM.Single.StepTM]
tp:22 [in Undecidability.TM.Univ.Univ]
tp:220 [in Undecidability.TM.Single.StepTM]
tp:223 [in Complexity.TM.PrettyBounds.M2MBounds]
tp:224 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
tp:225 [in Undecidability.TM.Single.StepTM]
tp:228 [in Undecidability.TM.Hoare.HoareRegister]
tp:230 [in Complexity.TM.PrettyBounds.M2MBounds]
tp:232 [in Undecidability.TM.Single.StepTM]
tp:238 [in Complexity.TM.PrettyBounds.M2MBounds]
tp:239 [in Undecidability.TM.Single.StepTM]
tp:244 [in Undecidability.TM.Single.StepTM]
tp:253 [in Undecidability.TM.Single.StepTM]
tp:259 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
tp:26 [in Undecidability.TM.Univ.Univ]
tp:261 [in Undecidability.TM.Single.StepTM]
tp:2640 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
tp:27 [in Undecidability.TM.Univ.Univ]
tp:270 [in Undecidability.TM.Single.StepTM]
tp:2714 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
tp:2721 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
tp:2727 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
tp:2733 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
tp:2739 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
tp:2743 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
tp:275 [in Undecidability.TM.Single.StepTM]
tp:2751 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
tp:2757 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
tp:2768 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
tp:2771 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
tp:2777 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
tp:284 [in Undecidability.TM.Single.StepTM]
tp:289 [in Undecidability.TM.Single.StepTM]
tp:297 [in Undecidability.TM.Single.StepTM]
tp:30 [in Undecidability.TM.Univ.Univ]
tp:31 [in Complexity.TM.PrettyBounds.M2MBounds]
tp:32 [in Undecidability.TM.TM]
tp:325 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
tp:327 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
tp:33 [in Complexity.NP.SAT.CookLevin.Subproblems.SingleTMGenNP]
tp:334 [in Undecidability.TM.Single.StepTM]
tp:34 [in Complexity.TM.PrettyBounds.M2MBounds]
tp:343 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
tp:349 [in Undecidability.TM.Single.StepTM]
tp:35 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
tp:358 [in Undecidability.TM.Single.StepTM]
tp:36 [in Undecidability.TM.Univ.Univ]
tp:37 [in Complexity.TM.PrettyBounds.M2MBounds]
tp:382 [in Undecidability.TM.Single.StepTM]
tp:382 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
tp:397 [in Undecidability.TM.Single.StepTM]
tp:40 [in Complexity.TM.PrettyBounds.M2MBounds]
tp:407 [in Undecidability.TM.Single.StepTM]
tp:41 [in Undecidability.TM.Univ.Univ]
tp:419 [in Undecidability.TM.Single.StepTM]
tp:42 [in Complexity.TM.PrettyBounds.M2MBounds]
tp:425 [in Undecidability.TM.Single.StepTM]
tp:43 [in Undecidability.TM.Univ.Univ]
tp:435 [in Undecidability.TM.Single.StepTM]
tp:437 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
tp:439 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
tp:44 [in Complexity.TM.PrettyBounds.M2MBounds]
tp:441 [in Undecidability.TM.Single.StepTM]
tp:449 [in Undecidability.TM.Single.StepTM]
tp:452 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
tp:453 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
tp:459 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
tp:46 [in Complexity.TM.PrettyBounds.M2MBounds]
tp:46 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
tp:464 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
tp:467 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
tp:473 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
tp:48 [in Complexity.NP.SAT.CookLevin.Subproblems.TM_single]
tp:480 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
tp:49 [in Complexity.TM.PrettyBounds.M2MBounds]
tp:49 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
tp:5 [in Undecidability.TM.Univ.Univ]
tp:51 [in Undecidability.TM.Univ.Univ]
tp:52 [in Undecidability.TM.Univ.LowLevel]
tp:55 [in Undecidability.TM.Univ.LowLevel]
tp:57 [in Undecidability.TM.Univ.Univ]
tp:59 [in Undecidability.TM.Univ.LowLevel]
tp:60 [in Undecidability.TM.Univ.Univ]
tp:61 [in Complexity.TM.PrettyBounds.M2MBounds]
tp:67 [in Undecidability.TM.Univ.LowLevel]
tp:68 [in Undecidability.TM.Univ.Univ]
tp:7 [in Complexity.NP.TM.TMGenNP]
tp:70 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
tp:71 [in Undecidability.TM.Univ.LowLevel]
tp:77 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
tp:77 [in Undecidability.TM.Univ.Univ]
tp:8 [in Undecidability.TM.Univ.Univ]
tp:80 [in Undecidability.TM.Univ.LowLevel]
tp:81 [in Undecidability.TM.Univ.Univ]
tp:85 [in Undecidability.TM.Univ.Univ]
tp:87 [in Undecidability.TM.Univ.LowLevel]
tp:89 [in Undecidability.TM.Univ.Univ]
tp:93 [in Undecidability.TM.Univ.Univ]
tp:97 [in Undecidability.TM.Univ.Univ]
transb:17 [in Undecidability.L.Complexity.UpToCNary]
transt:3659 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transt:636 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
transt:642 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
trans':23 [in Complexity.L.TM.TMflatFun]
trans0:101 [in Complexity.L.TM.TMunflatten]
trans:22 [in Complexity.L.TM.TMflatFun]
trans:42 [in Complexity.L.TM.TMflatFun]
trans:53 [in Complexity.L.TM.TMflatFun]
trans:8 [in Complexity.NP.SAT.CookLevin.Subproblems.TM_single]
tr:144 [in Undecidability.TM.Compound.MoveToSymbol]
tr:181 [in Undecidability.TM.Compound.MoveToSymbol]
ts':18 [in Complexity.L.TM.TMflatFun]
ts:12 [in Undecidability.L.TM.TapeFuns]
ts:12 [in Complexity.L.TM.TMflatFun]
ts:13 [in Complexity.NP.SAT.CookLevin.Reductions.TMGenNP_fixed_singleTapeTM_to_FlatFunSingleTMGenNP]
ts:15 [in Complexity.NP.TM.mTM_to_singleTapeTM]
ts:15 [in Complexity.NP.TM.TMGenNP_fixed_mTM]
ts:17 [in Complexity.NP.SAT.CookLevin.Reductions.TMGenNP_fixed_singleTapeTM_to_FlatFunSingleTMGenNP]
ts:17 [in Complexity.L.TM.TMflatFun]
ts:19 [in Complexity.NP.TM.mTM_to_singleTapeTM]
ts:234 [in Complexity.L.TM.TMunflatten]
ts:27 [in Complexity.NP.TM.TMGenNP_fixed_mTM]
ts:36 [in Complexity.NP.TM.M_multi2mono]
ts:5 [in Complexity.NP.TM.mTM_to_singleTapeTM]
ts:51 [in Undecidability.TM.Util.TM_facts]
ts:53 [in Undecidability.TM.L.CompilerBoolFuns.NaryApp]
ts:6 [in Complexity.NP.TM.TMGenNP_fixed_mTM]
ts:8 [in Complexity.NP.TM.mTM_to_singleTapeTM]
ts:8 [in Undecidability.L.TM.TapeFuns]
ts:91 [in Complexity.L.TM.TMflatComp]
ts:94 [in Complexity.L.TM.TMflatComp]
tt1:107 [in Undecidability.L.Tactics.ComputableTime]
tt1:11 [in Undecidability.L.Tactics.Computable]
tt1:120 [in Undecidability.L.Tactics.ComputableTime]
tt1:124 [in Undecidability.L.Tactics.Computable]
tt1:127 [in Undecidability.L.Tactics.ComputableTime]
tt1:130 [in Undecidability.L.Tactics.Computable]
tt1:135 [in Undecidability.L.Tactics.Computable]
tt1:148 [in Undecidability.L.Tactics.Computable]
tt1:151 [in Undecidability.L.Tactics.ComputableTime]
tt1:162 [in Undecidability.L.Tactics.ComputableTime]
tt1:46 [in Undecidability.L.Tactics.Computable]
tt1:54 [in Undecidability.L.Tactics.Computable]
tt1:65 [in Undecidability.L.Tactics.ComputableTime]
tt1:70 [in Undecidability.L.Tactics.Computable]
tt1:75 [in Undecidability.L.Tactics.ComputableTime]
tt1:76 [in Undecidability.L.Tactics.Computable]
tt1:86 [in Undecidability.L.Tactics.Computable]
tt1:90 [in Undecidability.L.Tactics.ComputableTime]
tt2:12 [in Undecidability.L.Tactics.Computable]
tt2:125 [in Undecidability.L.Tactics.Computable]
tt2:128 [in Undecidability.L.Tactics.ComputableTime]
tt2:47 [in Undecidability.L.Tactics.Computable]
tt2:55 [in Undecidability.L.Tactics.Computable]
tt2:66 [in Undecidability.L.Tactics.ComputableTime]
tt2:76 [in Undecidability.L.Tactics.ComputableTime]
tt2:77 [in Undecidability.L.Tactics.Computable]
tt2:87 [in Undecidability.L.Tactics.Computable]
tt2:91 [in Undecidability.L.Tactics.ComputableTime]
tt:101 [in Undecidability.L.Tactics.Computable]
tt:103 [in Undecidability.L.Tactics.Computable]
tt:108 [in Undecidability.L.Tactics.Computable]
tt:140 [in Undecidability.L.Tactics.ComputableTime]
tt:146 [in Undecidability.L.Tactics.ComputableTime]
tt:179 [in Undecidability.L.Tactics.ComputableTime]
tt:188 [in Undecidability.L.Tactics.ComputableTime]
tt:194 [in Undecidability.L.Tactics.ComputableTime]
tt:2 [in Undecidability.L.Tactics.ComputableTime]
tt:94 [in Undecidability.L.Tactics.Computable]
type:1 [in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
ty:101 [in Undecidability.L.Tactics.ComputableTime]
ty:113 [in Undecidability.L.Tactics.ComputableTime]
ty:16 [in Undecidability.L.Tactics.Lbeta_nonrefl]
ty:23 [in Undecidability.L.Tactics.ComputableTime]
ty:25 [in Undecidability.L.Tactics.Computable]
ty:29 [in Undecidability.L.Tactics.Computable]
ty:30 [in Undecidability.L.Tactics.ComputableTime]
ty:35 [in Undecidability.L.Tactics.ComputableTime]
ty:35 [in Undecidability.L.Tactics.Computable]
ty:38 [in Undecidability.L.Tactics.Computable]
ty:40 [in Undecidability.L.Tactics.ComputableTime]
ty:44 [in Undecidability.L.Tactics.ComputableTime]
ty:48 [in Undecidability.L.Tactics.ComputableTime]
ty:53 [in Undecidability.L.Tactics.ComputableTime]
ty:57 [in Undecidability.L.Tactics.ComputableTime]
ty:6 [in Undecidability.L.Tactics.ComputableTime]
ty:65 [in Undecidability.L.Tactics.Computable]
T_fin:331 [in Complexity.TM.PrettyBounds.M2MBounds]
T_fin:321 [in Complexity.TM.PrettyBounds.M2MBounds]
T_fin:313 [in Complexity.TM.PrettyBounds.M2MBounds]
T_fin:305 [in Complexity.TM.PrettyBounds.M2MBounds]
t__f:21 [in Undecidability.L.Datatypes.List.List_basics]
T__X:75 [in Complexity.TM.Code.Decode]
t__R:36 [in Complexity.TM.Code.Decode]
t__L:34 [in Complexity.TM.Code.Decode]
t__R:29 [in Complexity.TM.Code.Decode]
t__L:28 [in Complexity.TM.Code.Decode]
t__R:20 [in Complexity.TM.Code.Decode]
t__g:59 [in Complexity.NP.TM.mTM_to_singleTapeTM]
t__g:56 [in Complexity.NP.TM.mTM_to_singleTapeTM]
T__X:14 [in Complexity.TM.Code.DecodeList]
t__R:25 [in Complexity.TM.Single.EncodeTapesInvariants]
T_univ:468 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
T_univ:454 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
T_univ:443 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
T_Univ:384 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
T_Univ:379 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
T_univ:369 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
T_univ:367 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
T_univ:362 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
T_univ:355 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
T_univ:351 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
T_Univ:271 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
T_Univ:262 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
T_Univ:255 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
T_univ:249 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
T_univ:243 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
T_univ:235 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
T_univ:230 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
T_univ:224 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
T_univ:218 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
T_univ:213 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
T_univ:211 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
t__end:56 [in Undecidability.L.Functions.UnboundIteration]
t__step:55 [in Undecidability.L.Functions.UnboundIteration]
t__R2:15 [in Complexity.TM.Compound.MoveToSymbol_niceSpec]
t__R1:14 [in Complexity.TM.Compound.MoveToSymbol_niceSpec]
t__L:12 [in Complexity.TM.Compound.MoveToSymbol_niceSpec]
T__multi:13 [in Complexity.NP.TM.M_multi2mono]
t__f:18 [in Undecidability.L.Datatypes.List.List_fold]
t__f:7 [in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
t__R2:104 [in Complexity.TM.Single.DecodeTape]
t__R1:103 [in Complexity.TM.Single.DecodeTape]
t__R2:100 [in Complexity.TM.Single.DecodeTape]
t__R1:99 [in Complexity.TM.Single.DecodeTape]
t__R:95 [in Complexity.TM.Single.DecodeTape]
t__L:94 [in Complexity.TM.Single.DecodeTape]
t__L':93 [in Complexity.TM.Single.DecodeTape]
t_a:22 [in Undecidability.L.Tactics.Computable]
t_f:20 [in Undecidability.L.Tactics.Computable]
t__X:22 [in Undecidability.L.Functions.Encoding]
t__X:16 [in Undecidability.L.Functions.Encoding]
t__Y:9 [in Undecidability.L.Functions.Encoding]
t__X:8 [in Undecidability.L.Functions.Encoding]
t__cert:603 [in Complexity.NP.TM.LM_to_mTM]
t__cert:598 [in Complexity.NP.TM.LM_to_mTM]
t__cert:42 [in Complexity.NP.TM.LM_to_mTM]
t__cert:39 [in Complexity.NP.TM.LM_to_mTM]
t__cert:31 [in Complexity.NP.TM.LM_to_mTM]
t__cert:25 [in Complexity.NP.TM.LM_to_mTM]
t__cert:11 [in Complexity.NP.TM.TMGenNP_fixed_mTM]
t__cert':8 [in Complexity.NP.TM.TMGenNP_fixed_mTM]
t'':83 [in Undecidability.TM.Combinators.StateWhile]
t':10 [in Complexity.TM.Single.DecodeTape]
t':10 [in Undecidability.TM.L.CompilerBoolFuns.Compiler]
T':10 [in Complexity.NP.TM.LM_to_mTM]
t':104 [in Undecidability.L.Tactics.LClos]
t':108 [in Undecidability.L.Complexity.ResourceMeasures]
t':11 [in Complexity.TM.Compound.MoveToSymbol_niceSpec]
t':11 [in Undecidability.TM.Basic.Duo]
t':110 [in Complexity.TM.Single.DecodeTape]
t':112 [in Undecidability.TM.Compound.Shift]
t':113 [in Undecidability.TM.Single.StepTM]
t':115 [in Undecidability.TM.Combinators.StateWhile]
t':117 [in Undecidability.L.Computability.Seval]
t':119 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
t':12 [in Undecidability.L.Tactics.Lrewrite]
t':129 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
t':13 [in Complexity.TM.Single.DecodeTapes]
t':13 [in Undecidability.TM.Compound.Multi]
t':137 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
t':14 [in Complexity.TM.Single.DecodeTape]
t':143 [in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
t':16 [in Undecidability.L.Functions.Eval]
T':16 [in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisStep]
t':16 [in Undecidability.TM.Basic.Duo]
t':171 [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
t':18 [in Undecidability.L.L]
t':19 [in Undecidability.L.Complexity.ResourceMeasures]
T':19 [in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisStep]
t':2 [in Complexity.L.TM.TMflatFun]
t':2 [in Complexity.TM.Code.DecodeBool]
t':20 [in Undecidability.TM.Basic.Mono]
t':20 [in Undecidability.TM.Lifting.LiftTapes]
t':21 [in Complexity.TM.Compound.MoveToSymbol_niceSpec]
t':21 [in Complexity.L.AbstractMachines.AbstractHeapMachine]
t':218 [in Complexity.L.TM.TMunflatten]
T':218 [in Undecidability.TM.L.HeapInterpreter.StepTM]
t':221 [in Complexity.L.TM.TMunflatten]
t':225 [in Complexity.L.TM.TMunflatten]
t':229 [in Undecidability.L.Util.L_facts]
t':24 [in Undecidability.L.Tactics.Lrewrite]
t':24 [in Undecidability.L.Tactics.Lbeta_nonrefl]
t':24 [in Undecidability.TM.Lifting.LiftTapes]
t':249 [in Complexity.L.TM.TMflatComp]
t':25 [in Undecidability.TM.Basic.Mono]
t':25 [in Complexity.TM.Single.DecodeTapes]
t':27 [in Undecidability.TM.Basic.Mono]
t':28 [in Undecidability.TM.Combinators.Mirror]
t':29 [in Undecidability.TM.Basic.Mono]
t':29 [in Complexity.L.AbstractMachines.AbstractHeapMachine]
T':297 [in Undecidability.TM.Util.TM_facts]
t':3 [in Complexity.TM.Single.DecodeTape]
t':31 [in Complexity.NP.TM.TMGenNP]
t':31 [in Undecidability.TM.TM]
T':313 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
t':33 [in Undecidability.L.Tactics.Lrewrite]
t':35 [in Undecidability.TM.SBTM]
t':36 [in Undecidability.L.Complexity.ResourceMeasures]
t':38 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
T':39 [in Complexity.L.AbstractMachines.AbstractSubstMachine]
T':39 [in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
T':398 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
t':4 [in Undecidability.L.Tactics.Lrewrite]
t':4 [in Undecidability.TM.Compound.Multi]
t':40 [in Undecidability.TM.L.CompilerBoolFuns.NaryApp]
t':40 [in Undecidability.TM.Basic.Mono]
t':40 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
t':40 [in Undecidability.TM.SBTM]
T':403 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
t':41 [in Complexity.NP.TM.TMGenNP]
t':41 [in Undecidability.TM.TM]
t':41 [in Complexity.L.TM.TMflatFun]
t':410 [in Undecidability.TM.Util.TM_facts]
T':427 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
t':44 [in Complexity.TM.Code.Decode]
t':45 [in Undecidability.L.Tactics.GenEncode]
t':45 [in Undecidability.TM.Basic.Mono]
t':45 [in Undecidability.L.Complexity.GenericNary]
T':468 [in Undecidability.TM.Single.StepTM]
T':476 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
T':478 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
t':49 [in Complexity.L.TM.TMflatFun]
t':5 [in Undecidability.TM.Hoare.HoareStdLib]
t':50 [in Undecidability.L.Complexity.ResourceMeasures]
t':50 [in Undecidability.TM.SBTM]
t':50 [in Complexity.TM.Single.DecodeTapes]
T':512 [in Undecidability.TM.Single.StepTM]
t':52 [in Undecidability.TM.Code.ChangeAlphabet]
t':56 [in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
t':56 [in Undecidability.L.AbstractMachines.FlatPro.Programs]
t':58 [in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
t':59 [in Undecidability.L.Tactics.Lrewrite]
t':6 [in Undecidability.TM.Basic.Null]
t':6 [in Complexity.NP.TM.M_multi2mono]
t':6 [in Complexity.L.TM.TMflatFun]
t':60 [in Undecidability.L.AbstractMachines.FlatPro.Programs]
t':63 [in Complexity.TM.Code.Decode]
t':63 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
t':66 [in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
t':66 [in Complexity.TM.Single.DecodeTape]
t':69 [in Undecidability.L.Tactics.Lrewrite]
t':7 [in Complexity.TM.Code.Decode]
t':7 [in Complexity.TM.Code.DecodeList]
t':7 [in Undecidability.L.Complexity.ResourceMeasures]
t':71 [in Complexity.L.TM.TMflatFun]
t':76 [in Complexity.TM.Single.DecodeTape]
t':78 [in Undecidability.L.Util.L_facts]
t':8 [in Undecidability.TM.Compound.Multi]
t':80 [in Complexity.TM.Single.DecodeTape]
t':81 [in Undecidability.TM.Combinators.StateWhile]
t':86 [in Undecidability.L.Tactics.LClos]
t':87 [in Undecidability.TM.Combinators.StateWhile]
T':91 [in Complexity.Libs.CookPrelim.FlatFinTypes]
t':93 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
t':93 [in Undecidability.TM.Compound.MoveToSymbol]
t':93 [in Undecidability.L.Complexity.ResourceMeasures]
t':95 [in Undecidability.TM.Compound.MoveToSymbol]
t0:5 [in Complexity.TM.Single.EncodeTapesInvariants]
t0:68 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
t0:98 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
t1':95 [in Undecidability.TM.Compound.CopySymbols]
t1':98 [in Undecidability.TM.Compound.CopySymbols]
T1:1 [in Undecidability.Shared.Libs.PSL.FiniteTypes.CompoundFinTypes]
t1:10 [in Complexity.TM.Code.DecodeList]
t1:100 [in Undecidability.L.Prelim.ARS]
t1:106 [in Undecidability.L.Tactics.ComputableTime]
t1:108 [in Undecidability.TM.Util.TM_facts]
T1:11 [in Undecidability.TM.Combinators.SequentialComposition]
t1:119 [in Undecidability.L.Tactics.ComputableTime]
t1:120 [in Undecidability.L.Prelim.ARS]
t1:122 [in Undecidability.L.Tactics.Computable]
t1:125 [in Undecidability.L.Tactics.ComputableTime]
t1:129 [in Undecidability.L.Tactics.Computable]
t1:133 [in Undecidability.L.Prelim.ARS]
t1:134 [in Undecidability.L.Tactics.Computable]
t1:14 [in Undecidability.L.Tactics.GenEncode]
T1:14 [in Undecidability.TM.Combinators.If]
T1:14 [in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
t1:147 [in Undecidability.L.Tactics.Computable]
t1:150 [in Undecidability.L.Tactics.ComputableTime]
t1:16 [in Complexity.TM.Single.DecodeTapes]
t1:161 [in Undecidability.L.Tactics.ComputableTime]
t1:17 [in Complexity.NP.TM.TMGenNP_fixed_mTM]
T1:19 [in Undecidability.Shared.Libs.PSL.FiniteTypes.VectorFin]
t1:199 [in Undecidability.L.Tactics.Extract]
T1:20 [in Undecidability.TM.Combinators.SequentialComposition]
T1:21 [in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
t1:214 [in Undecidability.L.Prelim.ARS]
t1:221 [in Undecidability.L.Tactics.Extract]
t1:222 [in Undecidability.L.Prelim.ARS]
t1:227 [in Undecidability.L.Tactics.Extract]
t1:23 [in Undecidability.Shared.Libs.DLW.Code.sss]
T1:25 [in Undecidability.Shared.Libs.PSL.FiniteTypes.VectorFin]
T1:25 [in Undecidability.TM.Combinators.If]
t1:3 [in Undecidability.L.Computability.Scott]
t1:358 [in Undecidability.TM.Util.TM_facts]
t1:3620 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
t1:37 [in Undecidability.TM.Compound.CopySymbols]
t1:40 [in Undecidability.TM.Compound.CopySymbols]
t1:43 [in Undecidability.TM.Compound.CopySymbols]
t1:44 [in Undecidability.L.Tactics.Computable]
t1:46 [in Undecidability.TM.Compound.CopySymbols]
t1:52 [in Undecidability.L.Tactics.Computable]
T1:55 [in Undecidability.TM.Combinators.Switch]
t1:6 [in Undecidability.TM.Compound.MoveToSymbol]
t1:6 [in Undecidability.Shared.Libs.DLW.Code.sss]
t1:60 [in Undecidability.L.Tactics.Computable]
t1:63 [in Undecidability.L.Tactics.ComputableTime]
t1:64 [in Undecidability.TM.Code.ChangeAlphabet]
T1:65 [in Undecidability.TM.Combinators.Switch]
t1:68 [in Undecidability.TM.Code.ChangeAlphabet]
t1:69 [in Undecidability.L.Tactics.Computable]
T1:7 [in Undecidability.Shared.Libs.PSL.FiniteTypes.CompoundFinTypes]
t1:73 [in Undecidability.L.Tactics.ComputableTime]
t1:74 [in Undecidability.L.Tactics.Computable]
t1:75 [in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
t1:80 [in Undecidability.TM.Util.TM_facts]
t1:83 [in Undecidability.L.Tactics.ComputableTime]
t1:84 [in Undecidability.L.Tactics.Computable]
t1:85 [in Undecidability.Shared.Libs.DLW.Code.sss]
t1:88 [in Undecidability.L.Tactics.ComputableTime]
t1:9 [in Undecidability.L.Tactics.Computable]
t1:92 [in Undecidability.L.Tactics.Extract]
t2':96 [in Undecidability.TM.Compound.CopySymbols]
t2':99 [in Undecidability.TM.Compound.CopySymbols]
T2:10 [in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
t2:10 [in Undecidability.L.Tactics.Computable]
t2:101 [in Undecidability.L.Prelim.ARS]
t2:109 [in Undecidability.TM.Util.TM_facts]
T2:12 [in Undecidability.TM.Combinators.SequentialComposition]
t2:121 [in Undecidability.L.Prelim.ARS]
t2:123 [in Undecidability.L.Tactics.Computable]
t2:126 [in Undecidability.L.Tactics.ComputableTime]
t2:134 [in Undecidability.L.Prelim.ARS]
t2:15 [in Undecidability.L.Tactics.GenEncode]
T2:15 [in Undecidability.TM.Combinators.If]
t2:19 [in Undecidability.TM.Code.Copy]
t2:2 [in Undecidability.L.Computability.Scott]
T2:2 [in Undecidability.Shared.Libs.PSL.FiniteTypes.CompoundFinTypes]
T2:20 [in Undecidability.Shared.Libs.PSL.FiniteTypes.VectorFin]
t2:201 [in Undecidability.L.Tactics.Extract]
T2:21 [in Undecidability.TM.Combinators.SequentialComposition]
t2:215 [in Undecidability.L.Prelim.ARS]
t2:223 [in Undecidability.L.Prelim.ARS]
t2:225 [in Undecidability.L.Tactics.Extract]
t2:228 [in Undecidability.L.Tactics.Extract]
T2:24 [in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
t2:24 [in Undecidability.Shared.Libs.DLW.Code.sss]
t2:246 [in Undecidability.Shared.Libs.DLW.Vec.vec]
T2:26 [in Undecidability.Shared.Libs.PSL.FiniteTypes.VectorFin]
T2:26 [in Undecidability.TM.Combinators.If]
t2:26 [in Undecidability.TM.Code.Copy]
t2:359 [in Undecidability.TM.Util.TM_facts]
t2:3621 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
t2:38 [in Undecidability.TM.Compound.CopySymbols]
t2:38 [in Undecidability.TM.Code.Copy]
t2:41 [in Undecidability.TM.Compound.CopySymbols]
t2:44 [in Undecidability.TM.Compound.CopySymbols]
t2:45 [in Undecidability.TM.Code.Copy]
t2:45 [in Undecidability.L.Tactics.Computable]
t2:47 [in Undecidability.TM.Compound.CopySymbols]
t2:53 [in Undecidability.L.Tactics.Computable]
T2:56 [in Undecidability.TM.Combinators.Switch]
t2:64 [in Undecidability.L.Tactics.ComputableTime]
t2:65 [in Undecidability.TM.Code.ChangeAlphabet]
T2:66 [in Undecidability.TM.Combinators.Switch]
t2:69 [in Undecidability.TM.Code.ChangeAlphabet]
t2:7 [in Undecidability.Shared.Libs.DLW.Code.sss]
t2:74 [in Undecidability.L.Tactics.ComputableTime]
t2:75 [in Undecidability.L.Tactics.Computable]
t2:76 [in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
T2:8 [in Undecidability.Shared.Libs.PSL.FiniteTypes.CompoundFinTypes]
t2:81 [in Undecidability.TM.Util.TM_facts]
t2:85 [in Undecidability.L.Tactics.Computable]
t2:86 [in Undecidability.Shared.Libs.DLW.Code.sss]
t2:89 [in Undecidability.L.Tactics.ComputableTime]
t2:93 [in Undecidability.L.Tactics.Extract]
T3:16 [in Undecidability.TM.Combinators.If]
T3:27 [in Undecidability.TM.Combinators.If]
t3:3622 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
t:1 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds_Loop]
t:1 [in Undecidability.L.Tactics.ComputableTime]
t:1 [in Complexity.L.AbstractMachines.FlatPro.Computable.LPro]
t:1 [in Undecidability.TM.Code.BinNumbers.PosPointers]
t:1 [in Undecidability.L.AbstractMachines.FlatPro.Programs]
t:1 [in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
t:1 [in Complexity.TM.Code.DecodeBool]
T:1 [in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
t:1 [in Undecidability.TM.L.CaseCom]
t:10 [in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
t:10 [in Undecidability.L.Tactics.Lbeta_nonrefl]
t:10 [in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
T:10 [in Undecidability.TM.L.HeapInterpreter.StepTM]
t:10 [in Complexity.L.TM.TMflatten]
t:10 [in Complexity.TM.Compound.MoveToSymbol_niceSpec]
t:10 [in Complexity.L.TM.TMflatFun]
t:10 [in Undecidability.TM.Code.Code]
t:10 [in Undecidability.L.Computability.Rice]
t:10 [in Undecidability.TM.Util.TM_facts]
t:10 [in Undecidability.TM.Basic.Duo]
t:10 [in Undecidability.L.Computability.Por]
t:100 [in Undecidability.L.Tactics.ComputableTime]
t:100 [in Undecidability.L.Tactics.LClos]
t:100 [in Undecidability.TM.Compound.MoveToSymbol]
t:100 [in Complexity.L.TM.TMflatComp]
t:100 [in Undecidability.TM.Code.CodeTM]
T:100 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
t:100 [in Undecidability.L.Tactics.Computable]
t:101 [in Undecidability.L.Util.L_facts]
t:101 [in Undecidability.TM.Compound.MoveToSymbol]
t:102 [in Undecidability.TM.Compound.CopySymbols]
t:102 [in Undecidability.L.Complexity.ResourceMeasures]
t:102 [in Undecidability.TM.Util.TM_facts]
T:102 [in Undecidability.TM.Hoare.HoareLogic]
t:103 [in Undecidability.L.Util.L_facts]
t:103 [in Undecidability.L.Computability.Seval]
t:103 [in Undecidability.L.Tactics.LClos]
t:103 [in Undecidability.TM.Compound.MoveToSymbol]
t:103 [in Undecidability.TM.Code.CodeTM]
t:103 [in Undecidability.TM.Univ.LowLevel]
T:103 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
T:103 [in Undecidability.TM.L.HeapInterpreter.StepTM]
t:1036 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
t:104 [in Undecidability.TM.Compound.MoveToSymbol]
t:104 [in Undecidability.TM.Compound.CopySymbols]
t:105 [in Undecidability.TM.Compound.MoveToSymbol]
t:105 [in Undecidability.L.Tactics.LClos_Eval]
t:105 [in Undecidability.TM.Compound.CopySymbols]
t:105 [in Undecidability.TM.Util.TM_facts]
t:106 [in Undecidability.L.Tactics.Extract]
t:106 [in Undecidability.L.Tactics.LClos]
t:106 [in Undecidability.TM.Univ.LowLevel]
t:106 [in Undecidability.TM.Util.TM_facts]
t:1061 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
t:1066 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
t:107 [in Undecidability.L.Tactics.LClos_Eval]
t:107 [in Undecidability.TM.Compound.CopySymbols]
t:107 [in Undecidability.L.Complexity.ResourceMeasures]
t:107 [in Undecidability.TM.Util.TM_facts]
t:1073 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
t:108 [in Undecidability.L.Prelim.ARS]
t:108 [in Undecidability.TM.Compound.CopySymbols]
t:108 [in Complexity.TM.Single.DecodeTape]
t:109 [in Undecidability.L.Util.L_facts]
t:109 [in Undecidability.L.Tactics.LClos_Eval]
t:109 [in Undecidability.TM.Compound.CopySymbols]
T:109 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
t:11 [in Undecidability.L.Functions.Eval]
t:11 [in Undecidability.L.Tactics.Lrewrite]
t:11 [in Undecidability.TM.Compound.CopySymbols]
t:11 [in Undecidability.TM.Code.CodeTM]
t:11 [in Undecidability.L.Computability.Decidability]
t:11 [in Complexity.L.TM.TMflatten]
t:11 [in Complexity.TM.Single.DecodeTapes]
t:11 [in Undecidability.L.Computability.Rice]
t:11 [in Undecidability.TM.L.CaseCom]
t:11 [in Undecidability.TM.Hoare.HoareStdLib]
t:11 [in Undecidability.L.Computability.Scott]
t:110 [in Undecidability.L.Computability.Seval]
t:110 [in Undecidability.TM.Univ.LowLevel]
t:110 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
t:110 [in Undecidability.TM.Combinators.StateWhile]
T:111 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
t:111 [in Complexity.TM.Single.DecodeTape]
t:111 [in Undecidability.TM.Compound.Shift]
t:1112 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
t:1119 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
t:112 [in Undecidability.L.Util.L_facts]
t:112 [in Undecidability.TM.Single.StepTM]
t:112 [in Undecidability.L.Tactics.ComputableTime]
t:112 [in Complexity.TM.Single.DecodeTape]
t:113 [in Undecidability.L.Tactics.LClos_Eval]
t:113 [in Undecidability.L.Complexity.ResourceMeasures]
t:113 [in Undecidability.TM.Compound.Compare]
T:113 [in Undecidability.TM.L.HeapInterpreter.StepTM]
t:113 [in Complexity.L.AbstractMachines.AbstractHeapMachine]
t:114 [in Undecidability.L.Prelim.ARS]
t:114 [in Undecidability.L.Util.L_facts]
t:114 [in Complexity.L.AbstractMachines.AbstractHeapMachine]
t:114 [in Undecidability.L.Tactics.Reflection]
t:114 [in Undecidability.TM.Lifting.LiftTapes]
T:115 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
t:115 [in Undecidability.TM.Lifting.LiftTapes]
t:116 [in Undecidability.L.Computability.Seval]
t:116 [in Undecidability.TM.Util.TM_facts]
t:117 [in Undecidability.L.Util.L_facts]
t:117 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
t:118 [in Undecidability.TM.Util.TM_facts]
t:119 [in Undecidability.L.Util.L_facts]
t:119 [in Undecidability.TM.Compound.MoveToSymbol]
t:12 [in Undecidability.TM.PrettyBounds.SizeBounds]
t:12 [in Undecidability.L.Tactics.GenEncode]
t:12 [in Undecidability.TM.Code.BinNumbers.PosPointers]
t:12 [in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
t:12 [in Undecidability.L.Functions.Proc]
t:12 [in Undecidability.TM.Util.TM_facts]
t:12 [in Undecidability.TM.L.CaseCom]
t:12 [in Undecidability.TM.Compound.Multi]
t:12 [in Undecidability.TM.Hoare.HoareStdLib]
t:12 [in Undecidability.L.Computability.Por]
t:12 [in Undecidability.TM.Compound.WriteString]
t:120 [in Complexity.L.AbstractMachines.AbstractHeapMachine]
t:120 [in Undecidability.TM.Util.TM_facts]
t:121 [in Undecidability.L.Computability.Seval]
T:121 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
t:121 [in Undecidability.TM.Util.TM_facts]
t:122 [in Undecidability.L.Util.L_facts]
t:122 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
t:123 [in Undecidability.TM.Compound.CopySymbols]
t:123 [in Complexity.L.AbstractMachines.AbstractHeapMachine]
t:124 [in Undecidability.L.Util.L_facts]
t:124 [in Undecidability.L.Tactics.Extract]
t:124 [in Undecidability.TM.Util.TM_facts]
t:125 [in Undecidability.TM.Compound.MoveToSymbol]
T:125 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
t:126 [in Undecidability.L.Util.L_facts]
t:126 [in Undecidability.L.Tactics.Computable]
t:127 [in Undecidability.TM.Util.TM_facts]
t:128 [in Undecidability.L.Prelim.ARS]
t:129 [in Undecidability.TM.Compound.Compare]
t:13 [in Undecidability.L.Functions.Eval]
t:13 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
t:13 [in Undecidability.TM.Compound.MoveToSymbol]
t:13 [in Undecidability.TM.Hoare.HoareRegister]
t:13 [in Undecidability.TM.TM]
t:13 [in Undecidability.TM.Compound.Compare]
t:13 [in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
t:13 [in Complexity.TM.Single.DecodeTape]
t:13 [in Undecidability.L.Functions.Decoding]
t:130 [in Undecidability.TM.Hoare.HoareRegister]
t:130 [in Undecidability.TM.Util.TM_facts]
t:131 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
t:131 [in Undecidability.L.Tactics.Computable]
t:132 [in Undecidability.L.Tactics.LClos]
t:133 [in Undecidability.L.Util.L_facts]
t:133 [in Undecidability.TM.Util.TM_facts]
t:134 [in Undecidability.TM.Util.TM_facts]
t:135 [in Undecidability.L.Util.L_facts]
t:135 [in Undecidability.L.Tactics.LClos]
t:135 [in Undecidability.TM.Hoare.HoareRegister]
T:135 [in Undecidability.TM.Lifting.LiftTapes]
t:137 [in Undecidability.L.Util.L_facts]
t:137 [in Undecidability.TM.Util.TM_facts]
t:139 [in Undecidability.L.Util.L_facts]
t:139 [in Undecidability.L.Tactics.LClos]
t:14 [in Undecidability.TM.PrettyBounds.SizeBounds]
t:14 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
t:14 [in Undecidability.TM.Compound.MoveToSymbol]
t:14 [in Undecidability.TM.Combinators.Mirror]
t:14 [in Complexity.L.AbstractMachines.UnfoldHeap]
t:14 [in Undecidability.TM.Code.CodeTM]
t:14 [in Undecidability.L.Tactics.Lbeta_nonrefl]
t:14 [in Undecidability.TM.Compound.Compare]
T:14 [in Complexity.L.AbstractMachines.AbstractSubstMachine]
t:14 [in Undecidability.L.Computability.Decidability]
t:14 [in Undecidability.TM.SBTM]
t:14 [in Complexity.NP.TM.M_multi2mono]
t:14 [in Undecidability.TM.Code.ChangeAlphabet]
t:14 [in Undecidability.TM.L.Eval]
t:14 [in Undecidability.L.Functions.Proc]
t:140 [in Undecidability.TM.Util.TM_facts]
t:141 [in Undecidability.L.Util.L_facts]
t:141 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
t:141 [in Undecidability.TM.Util.TM_facts]
t:142 [in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
t:142 [in Undecidability.TM.Compound.Compare]
t:144 [in Undecidability.TM.Util.TM_facts]
t:146 [in Undecidability.L.Tactics.Extract]
t:146 [in Undecidability.TM.Compound.MoveToSymbol]
t:147 [in Undecidability.L.Util.L_facts]
T:147 [in Undecidability.TM.Single.StepTM]
t:147 [in Undecidability.TM.Util.TM_facts]
T:148 [in Undecidability.TM.L.HeapInterpreter.StepTM]
t:149 [in Undecidability.TM.Util.TM_facts]
t:15 [in Undecidability.L.Functions.Eval]
t:15 [in Undecidability.L.Computability.Seval]
t:15 [in Undecidability.L.Tactics.LClos]
t:15 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
t:15 [in Undecidability.TM.Combinators.Mirror]
t:15 [in Undecidability.TM.Code.WriteValue]
t:15 [in Undecidability.L.Tactics.Lbeta]
t:15 [in Undecidability.TM.Util.TM_facts]
t:15 [in Undecidability.TM.L.CaseCom]
t:15 [in Undecidability.L.Functions.Decoding]
t:15 [in Undecidability.TM.Basic.Duo]
t:15 [in Complexity.NP.L.GenNP]
t:15 [in Undecidability.L.Computability.Por]
t:15 [in Undecidability.L.Computability.Scott]
t:150 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
T:150 [in Undecidability.TM.Single.StepTM]
t:150 [in Complexity.Libs.CookPrelim.FlatFinTypes]
t:150 [in Undecidability.TM.Compound.Compare]
t:151 [in Undecidability.TM.Univ.LowLevel]
t:151 [in Undecidability.TM.Util.TM_facts]
t:153 [in Undecidability.L.Util.L_facts]
t:153 [in Undecidability.TM.Univ.LowLevel]
t:154 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
T:154 [in Undecidability.TM.L.HeapInterpreter.StepTM]
t:154 [in Undecidability.TM.Util.TM_facts]
t:155 [in Complexity.Libs.CookPrelim.FlatFinTypes]
t:156 [in Undecidability.L.Util.L_facts]
t:156 [in Undecidability.TM.Single.StepTM]
t:156 [in Undecidability.L.Tactics.Extract]
t:156 [in Undecidability.TM.Univ.LowLevel]
T:157 [in Undecidability.TM.Single.StepTM]
t:158 [in Undecidability.TM.Util.TM_facts]
t:159 [in Undecidability.TM.Single.StepTM]
t:16 [in Undecidability.L.Tactics.Lrewrite]
t:16 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
T:16 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
t:16 [in Undecidability.TM.Compound.MoveToSymbol]
t:16 [in Complexity.TM.Code.DecodeList]
t:16 [in Undecidability.L.Tactics.LClos_Eval]
t:16 [in Undecidability.L.Complexity.ResourceMeasures]
t:16 [in Undecidability.TM.Compound.Compare]
t:16 [in Undecidability.L.Computability.Rice]
t:16 [in Undecidability.TM.Compound.Shift]
t:16 [in Undecidability.TM.Compound.WriteString]
t:160 [in Undecidability.L.Util.L_facts]
t:161 [in Undecidability.TM.Single.StepTM]
t:161 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
t:161 [in Undecidability.TM.Util.TM_facts]
t:163 [in Undecidability.L.Util.L_facts]
t:163 [in Undecidability.TM.Compound.MoveToSymbol]
T:164 [in Undecidability.TM.L.HeapInterpreter.StepTM]
t:165 [in Undecidability.TM.Single.StepTM]
T:166 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
t:167 [in Undecidability.L.Util.L_facts]
t:167 [in Undecidability.TM.Single.StepTM]
t:169 [in Undecidability.TM.Util.TM_facts]
T:17 [in Undecidability.TM.Lifting.LiftAlphabet]
t:17 [in Undecidability.TM.Compound.MoveToSymbol]
t:17 [in Undecidability.TM.Combinators.Mirror]
t:17 [in Undecidability.TM.Code.BinNumbers.PosPointers]
t:17 [in Undecidability.L.L]
t:17 [in Undecidability.TM.Compound.Compare]
t:17 [in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
T:17 [in Undecidability.Shared.Libs.PSL.FiniteTypes.CompoundFinTypes]
t:170 [in Undecidability.L.Prelim.ARS]
t:170 [in Undecidability.TM.Single.StepTM]
t:170 [in Undecidability.TM.Util.TM_facts]
t:171 [in Undecidability.TM.Util.TM_facts]
t:172 [in Undecidability.TM.Util.TM_facts]
t:173 [in Undecidability.TM.Util.TM_facts]
t:174 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
t:174 [in Undecidability.TM.Util.TM_facts]
t:175 [in Undecidability.TM.Util.TM_facts]
t:176 [in Undecidability.L.Util.L_facts]
t:176 [in Undecidability.TM.Single.StepTM]
t:177 [in Undecidability.L.Prelim.ARS]
t:177 [in Undecidability.TM.Compound.MoveToSymbol]
t:177 [in Undecidability.TM.Code.Code]
t:178 [in Undecidability.L.Tactics.ComputableTime]
t:179 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
T:18 [in Undecidability.TM.Combinators.Combinators]
t:18 [in Undecidability.L.Functions.Eval]
t:18 [in Undecidability.L.Computability.Seval]
t:18 [in Undecidability.L.Complexity.ResourceMeasures]
t:18 [in Undecidability.L.TM.TapeFuns]
T:18 [in Undecidability.Shared.Libs.DLW.Utils.fin_upto]
t:18 [in Undecidability.TM.L.Eval]
t:18 [in Undecidability.L.Computability.Rice]
T:18 [in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
t:18 [in Undecidability.TM.Util.TM_facts]
t:18 [in Undecidability.TM.Compound.Shift]
t:180 [in Undecidability.L.Util.L_facts]
t:180 [in Undecidability.TM.Compound.Compare]
t:180 [in Undecidability.TM.Util.TM_facts]
t:181 [in Complexity.Libs.CookPrelim.FlatFinTypes]
t:183 [in Undecidability.L.Prelim.ARS]
t:183 [in Undecidability.TM.Compound.MoveToSymbol]
t:184 [in Undecidability.L.Util.L_facts]
t:184 [in Undecidability.TM.Single.StepTM]
T:184 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
t:185 [in Undecidability.TM.Util.TM_facts]
t:189 [in Undecidability.L.Util.L_facts]
t:19 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
t:19 [in Undecidability.TM.Compound.MoveToSymbol]
t:19 [in Undecidability.TM.Basic.Mono]
t:19 [in Undecidability.TM.Code.CodeTM]
t:19 [in Undecidability.TM.Compound.Compare]
t:19 [in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
t:19 [in Undecidability.TM.SBTM]
t:19 [in Undecidability.TM.Lifting.LiftTapes]
t:19 [in Undecidability.L.Computability.Rice]
t:19 [in Complexity.NP.L.GenNP]
t:190 [in Undecidability.TM.Single.StepTM]
t:190 [in Undecidability.TM.Hoare.HoareRegister]
t:191 [in Undecidability.L.Tactics.Extract]
t:191 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
T:191 [in Undecidability.TM.L.HeapInterpreter.StepTM]
t:192 [in Undecidability.L.Tactics.Extract]
t:193 [in Undecidability.TM.Code.Copy]
t:194 [in Undecidability.L.Util.L_facts]
t:194 [in Undecidability.L.Tactics.Extract]
t:195 [in Undecidability.TM.Single.StepTM]
t:196 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
t:197 [in Undecidability.TM.Util.TM_facts]
t:198 [in Undecidability.L.Tactics.Extract]
t:198 [in Undecidability.TM.Hoare.HoareRegister]
t:198 [in Undecidability.TM.L.HeapInterpreter.StepTM]
t:2 [in Undecidability.L.Util.L_facts]
t:2 [in Undecidability.L.Tactics.Lsimpl]
t:2 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds_Loop]
t:2 [in Undecidability.L.Computability.Seval]
t:2 [in Complexity.L.AbstractMachines.FlatPro.Computable.LPro]
t:2 [in Undecidability.L.Tactics.LClos_Eval]
t:2 [in Undecidability.L.Datatypes.List.List_extra]
t:2 [in Undecidability.TM.Code.CodeTM]
t:2 [in Undecidability.L.Computability.Fixpoints]
t:2 [in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
t:2 [in Undecidability.L.Tactics.Lbeta]
t:2 [in Undecidability.L.Computability.Acceptability]
t:2 [in Undecidability.L.Functions.Proc]
T:2 [in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
t:2 [in Undecidability.L.Computability.Synthetic]
T:2 [in Complexity.L.AbstractMachines.Computable.HeapMachine]
t:2 [in Complexity.TM.Single.DecodeTape]
t:2 [in Undecidability.L.Computability.Computability]
t:2 [in Undecidability.L.Functions.Equality]
t:2 [in Undecidability.L.Computability.Por]
t:20 [in Undecidability.L.Tactics.Lrewrite]
t:20 [in Undecidability.TM.Lifting.LiftAlphabet]
T:20 [in Undecidability.TM.Hoare.HoareLegacy]
t:20 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
t:20 [in Undecidability.TM.Compound.MoveToSymbol]
t:20 [in Undecidability.L.TM.TapeFuns]
T:20 [in Undecidability.Shared.Libs.DLW.Utils.fin_upto]
t:20 [in Undecidability.L.Tactics.Lbeta_nonrefl]
t:20 [in Undecidability.TM.Compound.Compare]
t:20 [in Complexity.TM.Compound.MoveToSymbol_niceSpec]
t:20 [in Undecidability.L.Tactics.Reflection]
t:20 [in Undecidability.L.Computability.Rice]
t:20 [in Undecidability.TM.L.CaseCom]
t:20 [in Undecidability.TM.Hoare.HoareCombinators]
t:200 [in Undecidability.L.Util.L_facts]
t:200 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
T:200 [in Undecidability.TM.L.HeapInterpreter.StepTM]
T:203 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
t:203 [in Undecidability.TM.Util.TM_facts]
t:205 [in Undecidability.TM.Hoare.HoareRegister]
t:206 [in Complexity.L.TM.TMunflatten]
t:206 [in Undecidability.TM.Util.TM_facts]
T:209 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
T:209 [in Undecidability.TM.L.HeapInterpreter.StepTM]
t:21 [in Undecidability.L.Computability.Seval]
t:21 [in Undecidability.TM.Compound.MoveToSymbol]
t:21 [in Undecidability.L.L]
t:21 [in Undecidability.TM.Hoare.HoareRegister]
t:21 [in Undecidability.TM.Compound.Compare]
t:21 [in Complexity.L.AbstractMachines.AbstractSubstMachine]
T:21 [in Undecidability.TM.L.HeapInterpreter.StepTM]
t:21 [in Undecidability.L.Computability.Rice]
T:21 [in Complexity.L.AbstractMachines.Computable.HeapMachine]
t:21 [in Undecidability.TM.Compound.Shift]
t:210 [in Undecidability.L.Util.L_facts]
t:210 [in Complexity.L.TM.TMunflatten]
t:211 [in Undecidability.TM.Util.TM_facts]
t:212 [in Undecidability.L.Util.L_facts]
t:212 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
t:213 [in Undecidability.TM.Hoare.HoareRegister]
t:214 [in Complexity.L.TM.TMunflatten]
T:215 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
t:216 [in Undecidability.TM.Util.TM_facts]
t:217 [in Undecidability.L.Util.L_facts]
t:217 [in Undecidability.L.Tactics.Extract]
T:217 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
t:217 [in Complexity.L.TM.TMunflatten]
t:218 [in Undecidability.L.Tactics.Extract]
t:22 [in Undecidability.L.Tactics.LClos_Eval]
t:22 [in Undecidability.L.Complexity.ResourceMeasures]
t:22 [in Undecidability.TM.Code.BinNumbers.PosPointers]
T:22 [in Undecidability.Shared.Libs.DLW.Utils.fin_upto]
T:22 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
t:220 [in Undecidability.L.Tactics.Extract]
t:220 [in Complexity.L.TM.TMunflatten]
T:220 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
t:221 [in Undecidability.Shared.Libs.DLW.Vec.vec]
t:222 [in Undecidability.L.Util.L_facts]
T:222 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
t:224 [in Complexity.L.TM.TMunflatten]
T:226 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
t:226 [in Undecidability.TM.L.HeapInterpreter.StepTM]
t:227 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
t:227 [in Complexity.L.TM.TMunflatten]
t:228 [in Undecidability.L.Util.L_facts]
t:229 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
t:229 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
t:23 [in Undecidability.TM.L.CompilerBoolFuns.NaryApp]
t:23 [in Undecidability.L.Tactics.Lrewrite]
t:23 [in Undecidability.L.Computability.Enum]
t:23 [in Undecidability.TM.Code.WriteValue]
t:23 [in Undecidability.L.Tactics.Lbeta_nonrefl]
t:23 [in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
t:23 [in Undecidability.TM.Lifting.LiftTapes]
t:23 [in Complexity.TM.Single.DecodeTape]
t:23 [in Undecidability.TM.Compound.Shift]
t:230 [in Complexity.L.TM.TMunflatten]
T:232 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
t:232 [in Undecidability.TM.Util.TM_facts]
t:233 [in Undecidability.L.Tactics.Extract]
t:234 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
t:236 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
t:236 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
T:236 [in Undecidability.TM.L.HeapInterpreter.StepTM]
t:237 [in Undecidability.TM.Single.StepTM]
T:237 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
T:238 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
t:238 [in Undecidability.L.Tactics.Extract]
t:239 [in Undecidability.L.Prelim.ARS]
t:239 [in Undecidability.L.Util.L_facts]
t:24 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
t:24 [in Undecidability.L.Computability.Seval]
t:24 [in Undecidability.TM.Basic.Mono]
t:24 [in Complexity.TM.Single.EncodeTapesInvariants]
t:24 [in Undecidability.TM.Code.CodeTM]
T:24 [in Undecidability.Shared.Libs.DLW.Utils.fin_upto]
T:24 [in Undecidability.TM.L.HeapInterpreter.StepTM]
t:24 [in Complexity.TM.Single.DecodeTapes]
t:24 [in Undecidability.L.Tactics.Reflection]
t:24 [in Undecidability.L.Complexity.GenericNary]
t:24 [in Undecidability.L.Tactics.Computable]
t:240 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
T:240 [in Undecidability.TM.L.HeapInterpreter.StepTM]
t:240 [in Undecidability.TM.Util.TM_facts]
t:242 [in Undecidability.L.Util.L_facts]
t:242 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
T:242 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
t:242 [in Undecidability.TM.Hoare.HoareRegister]
t:242 [in Undecidability.TM.Util.TM_facts]
t:244 [in Undecidability.L.Tactics.Extract]
t:244 [in Undecidability.TM.Util.TM_facts]
t:245 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
t:245 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
t:245 [in Undecidability.TM.Hoare.HoareRegister]
T:245 [in Undecidability.TM.L.HeapInterpreter.StepTM]
t:246 [in Complexity.L.TM.TMflatComp]
t:246 [in Undecidability.TM.Util.TM_facts]
T:247 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
t:247 [in Undecidability.TM.Util.TM_facts]
t:248 [in Complexity.L.TM.TMflatComp]
T:25 [in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
t:25 [in Complexity.L.AbstractMachines.UnfoldHeap]
t:25 [in Undecidability.TM.Code.BinNumbers.PosPointers]
t:25 [in Undecidability.TM.TM]
t:25 [in Complexity.TM.Compound.MoveToSymbol_niceSpec]
t:251 [in Complexity.L.TM.TMflatComp]
T:251 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
T:253 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
T:256 [in Complexity.TM.PrettyBounds.M2MBounds]
t:257 [in Complexity.L.TM.TMflatComp]
T:257 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
t:259 [in Complexity.L.TM.TMflatComp]
T:26 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds_Loop]
t:26 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
t:26 [in Undecidability.L.Computability.Enum]
t:26 [in Undecidability.TM.Basic.Mono]
t:26 [in Undecidability.L.Complexity.ResourceMeasures]
T:26 [in Undecidability.Shared.Libs.DLW.Utils.fin_upto]
t:26 [in Undecidability.L.AbstractMachines.FlatPro.Programs]
t:26 [in Undecidability.L.Computability.Rice]
t:26 [in Undecidability.TM.Util.TM_facts]
t:26 [in Undecidability.L.Functions.Decoding]
t:26 [in Undecidability.TM.Compound.Shift]
t:26 [in Undecidability.TM.Single.EncodeTapes]
t:261 [in Complexity.L.TM.TMflatComp]
t:263 [in Complexity.L.TM.TMflatComp]
T:263 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
T:265 [in Complexity.TM.PrettyBounds.M2MBounds]
T:268 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
t:27 [in Undecidability.L.Tactics.Lrewrite]
t:27 [in Undecidability.L.Tactics.Extract]
t:27 [in Undecidability.TM.Combinators.Mirror]
t:27 [in Complexity.NP.TM.TMGenNP]
t:27 [in Undecidability.TM.Code.CodeTM]
t:27 [in Undecidability.TM.Hoare.HoareRegister]
t:27 [in Undecidability.TM.Lifting.LiftTapes]
T:270 [in Complexity.TM.PrettyBounds.M2MBounds]
t:273 [in Complexity.L.TM.TMflatComp]
T:273 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
t:275 [in Undecidability.L.Tactics.Reflection]
t:276 [in Complexity.L.TM.TMflatComp]
T:277 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
t:277 [in Undecidability.L.Tactics.Reflection]
t:278 [in Undecidability.TM.Util.TM_facts]
t:279 [in Complexity.L.TM.TMflatComp]
t:279 [in Undecidability.L.Tactics.Reflection]
t:28 [in Undecidability.TM.Basic.Mono]
t:28 [in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
t:28 [in Undecidability.TM.SBTM]
t:28 [in Undecidability.TM.Code.Copy]
t:28 [in Undecidability.L.Complexity.GenericNary]
t:28 [in Complexity.TM.Single.DecodeTape]
t:28 [in Undecidability.L.Functions.Decoding]
t:28 [in Undecidability.TM.Compound.Shift]
T:280 [in Complexity.TM.PrettyBounds.M2MBounds]
t:281 [in Complexity.L.TM.TMflatComp]
t:281 [in Undecidability.L.Tactics.Reflection]
T:282 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
t:284 [in Complexity.L.TM.TMflatComp]
T:287 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
T:288 [in Complexity.TM.PrettyBounds.M2MBounds]
t:288 [in Complexity.L.TM.TMflatComp]
T:29 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
t:29 [in Undecidability.L.Util.L_facts]
t:29 [in Undecidability.L.Tactics.GenEncode]
t:29 [in Undecidability.TM.Code.CodeTM]
t:29 [in Complexity.L.AbstractMachines.AbstractSubstMachine]
t:29 [in Undecidability.L.AbstractMachines.FlatPro.Programs]
T:29 [in Undecidability.TM.L.HeapInterpreter.StepTM]
t:29 [in Complexity.TM.Single.DecodeTapes]
t:29 [in Undecidability.L.Tactics.Reflection]
T:290 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
T:290 [in Undecidability.TM.Util.TM_facts]
T:291 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
T:292 [in Complexity.TM.PrettyBounds.M2MBounds]
T:293 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
T:296 [in Complexity.TM.PrettyBounds.M2MBounds]
T:296 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
T:296 [in Undecidability.TM.Util.TM_facts]
T:299 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
t:3 [in Undecidability.L.Tactics.Lrewrite]
t:3 [in Undecidability.L.Datatypes.LBool]
T:3 [in Complexity.L.AbstractMachines.Computable.UnivDecTime]
t:3 [in Undecidability.L.Functions.Subst]
t:3 [in Undecidability.L.TM.TapeFuns]
t:3 [in Undecidability.TM.Util.TM_facts]
t:3 [in Undecidability.TM.Compound.Multi]
t:30 [in Undecidability.TM.Code.BinNumbers.PosPointers]
t:30 [in Undecidability.L.Tactics.Lbeta_nonrefl]
t:30 [in Undecidability.TM.SBTM]
t:30 [in Undecidability.L.Computability.Rice]
t:30 [in Undecidability.TM.Compound.Shift]
T:300 [in Undecidability.TM.Util.TM_facts]
T:302 [in Complexity.TM.PrettyBounds.M2MBounds]
T:304 [in Undecidability.TM.Single.StepTM]
T:304 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
T:306 [in Undecidability.TM.Single.StepTM]
T:31 [in Undecidability.TM.Combinators.Combinators]
t:31 [in Undecidability.L.Tactics.Lrewrite]
T:31 [in Undecidability.L.Datatypes.LOptions]
t:31 [in Undecidability.TM.Lifting.LiftAlphabet]
t:31 [in Undecidability.L.Complexity.ResourceMeasures]
t:31 [in Undecidability.L.Complexity.GenericNary]
t:31 [in Undecidability.TM.Single.EncodeTapes]
T:310 [in Complexity.TM.PrettyBounds.M2MBounds]
T:310 [in Undecidability.TM.Single.StepTM]
T:310 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
t:3106 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
T:318 [in Complexity.TM.PrettyBounds.M2MBounds]
T:32 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds_Loop]
t:32 [in Undecidability.L.Tactics.Extract]
t:32 [in Undecidability.TM.Combinators.Switch]
t:32 [in Undecidability.TM.Lifting.LiftAlphabet]
t:32 [in Undecidability.L.Tactics.GenEncode]
t:32 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
T:32 [in Undecidability.TM.Combinators.Mirror]
t:32 [in Undecidability.TM.Code.CodeTM]
T:32 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
t:32 [in Undecidability.TM.Hoare.HoareRegister]
t:32 [in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
t:32 [in Undecidability.L.Computability.Rice]
T:32 [in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
t:32 [in Undecidability.TM.Util.TM_facts]
t:32 [in Complexity.TM.Single.DecodeTape]
T:3219 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
t:322 [in Undecidability.TM.Single.StepTM]
T:324 [in Undecidability.TM.Single.StepTM]
T:328 [in Complexity.TM.PrettyBounds.M2MBounds]
t:33 [in Undecidability.L.Util.L_facts]
t:33 [in Undecidability.L.Computability.Seval]
t:33 [in Undecidability.TM.Combinators.Switch]
t:33 [in Undecidability.L.Tactics.LClos]
t:33 [in Undecidability.TM.Combinators.Mirror]
t:33 [in Undecidability.TM.Code.BinNumbers.PosPointers]
t:33 [in Undecidability.L.Tactics.Lbeta_nonrefl]
T:33 [in Complexity.L.AbstractMachines.AbstractSubstMachine]
t:33 [in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
T:336 [in Complexity.TM.PrettyBounds.M2MBounds]
T:339 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
T:34 [in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
T:34 [in Undecidability.L.Datatypes.LOptions]
t:34 [in Undecidability.L.Tactics.Extract]
t:34 [in Undecidability.L.Tactics.ComputableTime]
T:34 [in Undecidability.Shared.Libs.DLW.Utils.fin_upto]
T:34 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
t:34 [in Undecidability.TM.Util.TM_facts]
t:34 [in Complexity.TM.Single.DecodeTape]
t:34 [in Undecidability.TM.Single.EncodeTapes]
t:340 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
T:341 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
T:342 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
T:344 [in Complexity.TM.PrettyBounds.M2MBounds]
T:344 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
T:349 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
t:35 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
t:35 [in Undecidability.TM.Compound.MoveToSymbol]
T:35 [in Undecidability.TM.Combinators.Mirror]
t:35 [in Complexity.TM.Single.EncodeTapesInvariants]
t:35 [in Undecidability.L.Complexity.ResourceMeasures]
t:35 [in Undecidability.TM.Code.BinNumbers.PosPointers]
t:35 [in Undecidability.TM.Code.CodeTM]
t:350 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
T:353 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
t:354 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
T:357 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
t:359 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
t:36 [in Undecidability.L.Util.L_facts]
t:36 [in Undecidability.L.Computability.Seval]
t:36 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
t:36 [in Undecidability.TM.Compound.MoveToSymbol]
T:36 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
t:36 [in Undecidability.TM.Hoare.HoareRegister]
t:36 [in Undecidability.L.Tactics.Lbeta_nonrefl]
t:36 [in Undecidability.TM.SBTM]
t:36 [in Undecidability.TM.Code.ChangeAlphabet]
t:36 [in Undecidability.TM.Compound.WriteString]
T:361 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
t:363 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
T:365 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
t:366 [in Undecidability.TM.Util.TM_facts]
t:368 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
t:37 [in Undecidability.TM.Compound.MoveToSymbol]
t:37 [in Complexity.NP.TM.TMGenNP]
t:37 [in Undecidability.TM.Code.BinNumbers.PosPointers]
t:37 [in Undecidability.TM.Code.CodeTM]
T:37 [in Complexity.L.AbstractMachines.AbstractSubstMachine]
t:37 [in Undecidability.L.Computability.Rice]
t:37 [in Undecidability.TM.Util.TM_facts]
t:37 [in Complexity.TM.Single.DecodeTape]
T:371 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
t:373 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
T:375 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
T:377 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
T:378 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
t:38 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
t:38 [in Undecidability.L.TM.TMEncoding]
T:380 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
T:385 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
T:388 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
T:39 [in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
t:39 [in Undecidability.TM.L.CompilerBoolFuns.NaryApp]
t:39 [in Undecidability.L.Tactics.ComputableTime]
t:39 [in Undecidability.L.Computability.Seval]
t:39 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
t:39 [in Undecidability.TM.Compound.MoveToSymbol]
t:39 [in Undecidability.TM.Basic.Mono]
t:39 [in Complexity.TM.Single.EncodeTapesInvariants]
t:39 [in Undecidability.L.Complexity.ResourceMeasures]
T:39 [in Undecidability.Shared.Libs.DLW.Utils.fin_upto]
t:39 [in Undecidability.TM.TM]
T:39 [in Undecidability.TM.L.HeapInterpreter.StepTM]
t:39 [in Undecidability.TM.Code.ChangeAlphabet]
t:39 [in Undecidability.TM.Util.TM_facts]
t:39 [in Complexity.L.AbstractMachines.FunctionalDefinitions]
t:39 [in Undecidability.TM.Compound.WriteString]
T:390 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
T:393 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
T:396 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
t:4 [in Undecidability.L.Tactics.Lsimpl]
t:4 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds_Loop]
t:4 [in Undecidability.L.TM.TapeFuns]
t:4 [in Undecidability.L.Computability.Fixpoints]
t:4 [in Undecidability.TM.TM]
t:4 [in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
T:4 [in Undecidability.TM.L.HeapInterpreter.StepTM]
t:4 [in Undecidability.TM.Hoare.HoareStdLib]
T:40 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
t:40 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
t:40 [in Complexity.TM.Code.Decode]
t:40 [in Undecidability.TM.Code.BinNumbers.PosPointers]
t:40 [in Complexity.L.TM.TMflatFun]
t:40 [in Complexity.TM.Single.DecodeTapes]
t:40 [in Undecidability.TM.Util.TM_facts]
t:40 [in Complexity.TM.Single.DecodeTape]
T:401 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
T:406 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
t:408 [in Undecidability.TM.Util.TM_facts]
t:41 [in Undecidability.TM.Compound.MoveToSymbol]
t:41 [in Undecidability.TM.Hoare.HoareRegister]
t:41 [in Undecidability.TM.Code.ChangeAlphabet]
t:41 [in Undecidability.TM.Util.TM_facts]
t:41 [in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
t:41 [in Undecidability.L.Tactics.Computable]
T:410 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
T:418 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
t:42 [in Undecidability.L.Computability.Seval]
t:42 [in Undecidability.TM.Compound.CopySymbols]
t:42 [in Undecidability.L.Complexity.ResourceMeasures]
t:42 [in Undecidability.TM.Combinators.If]
t:42 [in Complexity.L.AbstractMachines.AbstractSubstMachine]
T:42 [in Undecidability.TM.L.HeapInterpreter.StepTM]
t:42 [in Undecidability.L.TM.TMEncoding]
t:42 [in Complexity.TM.Single.DecodeTape]
t:42 [in Undecidability.TM.Hoare.HoareCombinators]
t:42 [in Undecidability.TM.Compound.WriteString]
T:420 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
T:425 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
t:43 [in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
t:43 [in Complexity.TM.Code.Decode]
t:43 [in Undecidability.TM.Compound.MoveToSymbol]
t:43 [in Complexity.NP.TM.TMGenNP]
t:43 [in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
t:43 [in Undecidability.TM.Util.TM_facts]
T:432 [in Undecidability.TM.Hoare.HoareRegister]
T:434 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
t:434 [in Undecidability.TM.Hoare.HoareRegister]
T:436 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
T:436 [in Undecidability.TM.Hoare.HoareRegister]
t:437 [in Undecidability.TM.Hoare.HoareRegister]
T:438 [in Undecidability.TM.Hoare.HoareRegister]
t:439 [in Undecidability.TM.Hoare.HoareRegister]
t:44 [in Undecidability.L.Computability.Seval]
t:44 [in Undecidability.TM.Combinators.Switch]
t:44 [in Undecidability.TM.Basic.Mono]
t:44 [in Undecidability.TM.Univ.LowLevel]
t:44 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
t:44 [in Undecidability.TM.Code.ChangeAlphabet]
T:440 [in Undecidability.TM.Hoare.HoareRegister]
T:442 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
T:45 [in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
t:45 [in Undecidability.L.Util.L_facts]
t:45 [in Undecidability.TM.Compound.CopySymbols]
t:45 [in Undecidability.L.Datatypes.LVector]
t:45 [in Undecidability.TM.TM]
T:45 [in Complexity.L.AbstractMachines.AbstractSubstMachine]
t:45 [in Undecidability.TM.SBTM]
t:45 [in Undecidability.TM.Util.TM_facts]
t:45 [in Undecidability.TM.Compound.WriteString]
T:456 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
t:46 [in Undecidability.TM.L.CompilerBoolFuns.NaryApp]
T:46 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
t:46 [in Undecidability.L.Computability.Enum]
t:46 [in Undecidability.TM.Code.CodeTM]
t:46 [in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
t:46 [in Undecidability.TM.Hoare.HoareRegister]
t:46 [in Complexity.L.AbstractMachines.AbstractHeapMachine]
t:46 [in Undecidability.TM.Code.ChangeAlphabet]
T:461 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
T:465 [in Undecidability.TM.Single.StepTM]
T:466 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
t:47 [in Undecidability.TM.Hoare.HoareTactics]
t:47 [in Undecidability.L.Tactics.ComputableTime]
t:47 [in Undecidability.TM.Compound.MoveToSymbol]
t:47 [in Undecidability.TM.Code.BinNumbers.PosPointers]
t:47 [in Complexity.Complexity.SpaceBoundsTime]
T:47 [in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
T:470 [in Undecidability.TM.Single.StepTM]
T:470 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
T:471 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
t:471 [in Undecidability.TM.Hoare.HoareRegister]
T:475 [in Undecidability.TM.Single.StepTM]
t:475 [in Undecidability.TM.Hoare.HoareRegister]
T:477 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
t:48 [in Undecidability.L.Tactics.Lrewrite]
t:48 [in Undecidability.TM.Hoare.HoareTactics]
t:48 [in Undecidability.TM.Compound.CopySymbols]
t:48 [in Complexity.NP.TM.TMGenNP]
t:48 [in Complexity.L.TM.TMflatFun]
t:48 [in Undecidability.TM.Code.Copy]
t:48 [in Complexity.TM.Single.DecodeTapes]
t:48 [in Undecidability.TM.Util.TM_facts]
T:481 [in Undecidability.TM.Single.StepTM]
T:487 [in Undecidability.TM.Single.StepTM]
t:49 [in Undecidability.TM.Compound.MoveToSymbol]
t:49 [in Undecidability.L.Complexity.ResourceMeasures]
t:49 [in Undecidability.TM.Code.CodeTM]
t:49 [in Undecidability.L.Tactics.Reflection]
T:494 [in Undecidability.TM.Single.StepTM]
t:5 [in Undecidability.TM.Basic.Null]
t:5 [in Undecidability.L.Tactics.ComputableTime]
t:5 [in Undecidability.TM.Lifting.LiftAlphabet]
T:5 [in Undecidability.TM.PrettyBounds.SizeBounds]
t:5 [in Undecidability.L.Tactics.LClos]
t:5 [in Undecidability.L.Computability.Fixpoints]
t:5 [in Undecidability.L.L]
t:5 [in Undecidability.TM.L.Alphabets]
t:5 [in Complexity.NP.SAT.CookLevin.Subproblems.TM_single]
t:5 [in Complexity.NP.TM.M_multi2mono]
t:5 [in Complexity.L.TM.TMflatFun]
t:5 [in Undecidability.L.Computability.Acceptability]
t:5 [in Undecidability.L.Tactics.Reflection]
t:5 [in Undecidability.TM.Util.TM_facts]
t:5 [in Undecidability.L.Computability.Scott]
t:50 [in Complexity.L.AbstractMachines.UnfoldTailRec]
t:50 [in Undecidability.TM.Compound.MoveToSymbol]
t:50 [in Undecidability.TM.Compound.CopySymbols]
t:50 [in Undecidability.L.Datatypes.LVector]
t:50 [in Complexity.L.AbstractMachines.AbstractSubstMachine]
t:50 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
t:50 [in Complexity.NP.TM.M_multi2mono]
t:50 [in Complexity.NP.Clique.kSAT_to_Clique]
t:50 [in Undecidability.TM.Compound.Shift]
T:502 [in Undecidability.TM.Single.StepTM]
t:51 [in Undecidability.L.Computability.Enum]
t:51 [in Undecidability.L.Computability.Seval]
t:51 [in Undecidability.TM.Compound.CopySymbols]
t:51 [in Undecidability.TM.Univ.LowLevel]
t:51 [in Undecidability.TM.Compound.Compare]
T:51 [in Undecidability.TM.L.HeapInterpreter.StepTM]
T:51 [in Undecidability.Synthetic.ListEnumerabilityFacts]
T:511 [in Undecidability.TM.Single.StepTM]
T:516 [in Undecidability.TM.Single.StepTM]
t:52 [in Undecidability.TM.Lifting.LiftAlphabet]
t:52 [in Undecidability.TM.Compound.MoveToSymbol]
t:52 [in Undecidability.TM.Code.BinNumbers.PosPointers]
t:52 [in Complexity.L.TM.TMflat]
t:53 [in Undecidability.L.Tactics.Lrewrite]
t:53 [in Complexity.NP.TM.mTM_to_singleTapeTM]
t:53 [in Undecidability.L.Tactics.LClos]
t:53 [in Undecidability.TM.Compound.MoveToSymbol]
t:53 [in Undecidability.TM.Compound.CopySymbols]
t:53 [in Undecidability.TM.Code.CodeTM]
t:53 [in Undecidability.TM.TM]
t:53 [in Undecidability.TM.Compound.Compare]
t:53 [in Undecidability.L.Datatypes.LNat]
t:54 [in Complexity.NP.TM.mTM_to_singleTapeTM]
t:54 [in Undecidability.TM.Compound.MoveToSymbol]
t:54 [in Undecidability.TM.Compound.CopySymbols]
t:54 [in Undecidability.TM.Univ.LowLevel]
t:54 [in Undecidability.TM.Compound.Compare]
t:55 [in Undecidability.TM.L.CompilerBoolFuns.NaryApp]
t:55 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
t:55 [in Complexity.NP.TM.mTM_to_singleTapeTM]
t:55 [in Undecidability.L.Computability.Seval]
t:55 [in Undecidability.TM.Compound.CopySymbols]
t:55 [in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
t:55 [in Undecidability.L.AbstractMachines.FlatPro.Programs]
t:55 [in Complexity.Complexity.SpaceBoundsTime]
T:55 [in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
t:55 [in Undecidability.L.Datatypes.LNat]
t:56 [in Undecidability.TM.Code.CodeTM]
t:56 [in Complexity.L.TM.TMflat]
t:56 [in Undecidability.TM.Hoare.HoareRegister]
t:56 [in Undecidability.TM.Compound.Compare]
t:56 [in Complexity.L.AbstractMachines.AbstractHeapMachine]
t:56 [in Undecidability.TM.Code.ChangeAlphabet]
T:56 [in Complexity.L.AbstractMachines.FunctionalDefinitions]
t:57 [in Complexity.NP.TM.mTM_to_singleTapeTM]
t:57 [in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
t:57 [in Undecidability.L.Complexity.ResourceMeasures]
t:57 [in Undecidability.TM.Compound.Compare]
t:57 [in Undecidability.L.Datatypes.LNat]
t:58 [in Undecidability.L.Tactics.Lrewrite]
t:58 [in Complexity.NP.TM.mTM_to_singleTapeTM]
t:58 [in Undecidability.L.Computability.Seval]
t:58 [in Undecidability.TM.Univ.LowLevel]
t:58 [in Undecidability.TM.Compound.Compare]
t:58 [in Undecidability.TM.Code.ChangeAlphabet]
t:59 [in Undecidability.L.Datatypes.LVector]
t:59 [in Undecidability.L.AbstractMachines.FlatPro.Programs]
t:59 [in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
t:59 [in Undecidability.L.Datatypes.LNat]
T:6 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
t:6 [in Undecidability.L.Tactics.Lsimpl]
t:6 [in Complexity.TM.Code.Decode]
t:6 [in Complexity.NP.TM.mTM_to_singleTapeTM]
t:6 [in Complexity.TM.Code.DecodeList]
t:6 [in Undecidability.L.Complexity.ResourceMeasures]
t:6 [in Undecidability.TM.Code.BinNumbers.PosPointers]
t:6 [in Undecidability.TM.Code.CodeTM]
t:6 [in Undecidability.L.TM.TapeFuns]
t:6 [in Undecidability.TM.L.Eval]
t:6 [in Undecidability.L.Computability.Rice]
t:6 [in Undecidability.TM.Univ.Univ]
t:6 [in Undecidability.L.Computability.Por]
t:60 [in Undecidability.L.Tactics.ComputableTime]
t:60 [in Complexity.NP.TM.mTM_to_singleTapeTM]
t:60 [in Undecidability.TM.Code.CodeTM]
T:60 [in Complexity.L.AbstractMachines.AbstractHeapMachine]
t:60 [in Undecidability.L.Complexity.GenericNary]
T:60 [in Complexity.L.AbstractMachines.FunctionalDefinitions]
t:61 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
t:61 [in Undecidability.L.Complexity.ResourceMeasures]
t:61 [in Undecidability.L.Datatypes.LVector]
t:61 [in Undecidability.TM.Hoare.HoareRegister]
t:61 [in Undecidability.L.AbstractMachines.FlatPro.Programs]
t:61 [in Undecidability.TM.Code.ChangeAlphabet]
t:62 [in Complexity.TM.Code.Decode]
T:62 [in Undecidability.TM.Lifting.LiftAlphabet]
t:62 [in Undecidability.TM.Code.CodeTM]
t:62 [in Complexity.L.TM.TMflat]
t:62 [in Undecidability.TM.Hoare.HoareRegister]
t:62 [in Undecidability.TM.Code.Copy]
T:62 [in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
t:63 [in Complexity.L.AbstractMachines.Computable.EvalForTime]
t:63 [in Undecidability.TM.Code.ChangeAlphabet]
t:63 [in Complexity.TM.Single.DecodeTape]
t:64 [in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
t:64 [in Complexity.L.AbstractMachines.Computable.EvalForTime]
T:64 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
t:64 [in Undecidability.L.Complexity.ResourceMeasures]
t:64 [in Complexity.L.TM.TMflatComp]
T:64 [in Complexity.L.AbstractMachines.FunctionalDefinitions]
t:64 [in Undecidability.TM.Hoare.HoareCombinators]
t:64 [in Undecidability.L.Tactics.Computable]
T:65 [in Complexity.TM.PrettyBounds.M2MBounds]
t:65 [in Undecidability.L.Tactics.Lrewrite]
t:65 [in Undecidability.TM.Code.CodeTM]
T:65 [in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
t:65 [in Complexity.TM.Single.DecodeTape]
t:66 [in Undecidability.L.Util.L_facts]
t:66 [in Undecidability.TM.Hoare.HoareRegister]
t:66 [in Undecidability.TM.Single.EncodeTapes]
t:67 [in Undecidability.L.Computability.Seval]
t:67 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
t:67 [in Undecidability.L.Complexity.ResourceMeasures]
t:67 [in Complexity.L.TM.TMflatComp]
t:67 [in Complexity.L.AbstractMachines.AbstractHeapMachine]
t:68 [in Undecidability.L.Tactics.Lrewrite]
t:68 [in Undecidability.L.Util.L_facts]
t:68 [in Undecidability.TM.Code.CodeTM]
t:68 [in Undecidability.TM.Hoare.HoareRegister]
t:69 [in Undecidability.L.Tactics.Reflection]
t:69 [in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
t:69 [in Undecidability.TM.Single.EncodeTapes]
t:7 [in Undecidability.L.Util.L_facts]
t:7 [in Undecidability.L.Tactics.Lsimpl]
t:7 [in Undecidability.TM.Code.WriteValue]
t:7 [in Undecidability.L.Functions.Proc]
T:7 [in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
t:7 [in Undecidability.TM.L.CaseCom]
t:7 [in Undecidability.L.Functions.Decoding]
t:7 [in Undecidability.L.Tactics.Computable]
t:7 [in Undecidability.TM.Compound.Multi]
t:7 [in Undecidability.L.Computability.Scott]
t:7 [in Undecidability.TM.Compound.WriteString]
t:70 [in Undecidability.TM.Compound.MoveToSymbol]
t:70 [in Complexity.L.TM.TMflat]
t:70 [in Complexity.L.TM.TMflatFun]
t:71 [in Undecidability.TM.Compound.MoveToSymbol]
t:71 [in Undecidability.TM.Compound.CopySymbols]
t:71 [in Undecidability.L.Complexity.ResourceMeasures]
t:71 [in Undecidability.TM.Code.CodeTM]
t:71 [in Undecidability.TM.Code.ChangeAlphabet]
t:71 [in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
t:73 [in Undecidability.TM.Compound.MoveToSymbol]
t:73 [in Undecidability.TM.Code.CodeTM]
t:73 [in Undecidability.TM.Hoare.HoareRegister]
t:73 [in Complexity.NP.TM.M_multi2mono]
t:73 [in Complexity.L.TM.TMflatFun]
t:73 [in Undecidability.TM.Code.ChangeAlphabet]
T:73 [in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
t:74 [in Undecidability.L.Computability.Seval]
t:74 [in Undecidability.TM.Compound.MoveToSymbol]
T:74 [in Undecidability.TM.L.HeapInterpreter.StepTM]
T:74 [in Complexity.L.AbstractMachines.AbstractHeapMachine]
t:74 [in Undecidability.TM.Util.TM_facts]
t:75 [in Undecidability.L.Util.L_facts]
t:75 [in Undecidability.L.Tactics.Extract]
t:75 [in Undecidability.TM.Code.CodeTM]
t:75 [in Undecidability.TM.Code.ChangeAlphabet]
t:75 [in Complexity.TM.Single.DecodeTape]
T:76 [in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
t:76 [in Undecidability.L.Computability.Seval]
t:76 [in Undecidability.L.Tactics.LClos]
t:76 [in Undecidability.TM.Compound.MoveToSymbol]
t:76 [in Complexity.L.TM.TMflatFun]
t:76 [in Undecidability.TM.Code.ChangeAlphabet]
t:76 [in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
t:76 [in Undecidability.TM.Util.TM_facts]
t:76 [in Undecidability.TM.Compound.Shift]
t:76 [in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
t:77 [in Undecidability.L.Util.L_facts]
t:77 [in Complexity.TM.Code.Decode]
t:77 [in Undecidability.TM.Compound.MoveToSymbol]
t:77 [in Undecidability.L.Complexity.GenericNary]
t:77 [in Undecidability.TM.Util.TM_facts]
t:78 [in Undecidability.TM.Compound.MoveToSymbol]
t:78 [in Undecidability.TM.Code.CodeTM]
t:78 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
t:78 [in Undecidability.TM.Util.TM_facts]
t:78 [in Undecidability.TM.Compound.Shift]
t:79 [in Undecidability.L.Computability.Seval]
t:79 [in Undecidability.TM.Combinators.StateWhile]
t:79 [in Undecidability.TM.Util.TM_facts]
t:79 [in Complexity.TM.Single.DecodeTape]
t:8 [in Complexity.TM.Single.EncodeTapesInvariants]
t:8 [in Undecidability.L.Datatypes.List.List_extra]
t:8 [in Undecidability.L.Computability.Decidability]
t:8 [in Undecidability.TM.L.Alphabets]
t:8 [in Undecidability.L.Tactics.Lbeta]
t:8 [in Undecidability.L.Computability.Acceptability]
t:8 [in Undecidability.L.Computability.Rice]
t:8 [in Undecidability.TM.Util.TM_facts]
t:8 [in Complexity.NP.L.GenNP]
t:8 [in Undecidability.L.Computability.Por]
t:80 [in Undecidability.L.Computability.Seval]
t:808 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
t:81 [in Undecidability.L.Util.L_facts]
t:81 [in Undecidability.TM.Code.CodeTM]
t:81 [in Undecidability.TM.Compound.Shift]
t:811 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
t:815 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
t:818 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
t:82 [in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
t:82 [in Undecidability.L.Computability.Seval]
t:82 [in Undecidability.L.Tactics.LClos]
t:82 [in Undecidability.TM.Util.TM_facts]
t:821 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
t:825 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
t:83 [in Undecidability.L.Util.L_facts]
t:83 [in Undecidability.L.Complexity.ResourceMeasures]
t:83 [in Complexity.L.AbstractMachines.AbstractHeapMachine]
t:83 [in Undecidability.TM.Util.TM_facts]
t:83 [in Complexity.TM.Single.DecodeTape]
t:83 [in Undecidability.TM.Compound.Shift]
t:834 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
t:838 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
t:84 [in Undecidability.L.Computability.Seval]
t:84 [in Undecidability.TM.Util.TM_facts]
t:842 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
t:846 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
t:85 [in Undecidability.L.Computability.Seval]
t:85 [in Undecidability.L.Tactics.LClos]
t:85 [in Undecidability.L.Complexity.ResourceMeasures]
t:85 [in Undecidability.TM.Combinators.StateWhile]
t:85 [in Complexity.TM.Single.DecodeTape]
t:851 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
t:855 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
t:86 [in Undecidability.L.Util.L_facts]
t:86 [in Undecidability.L.Computability.Seval]
t:86 [in Undecidability.TM.Compound.Compare]
T:86 [in Undecidability.L.Computability.Synthetic]
t:86 [in Undecidability.TM.Hoare.HoareCombinators]
t:86 [in Undecidability.TM.Compound.Shift]
t:87 [in Complexity.L.TM.TMflatComp]
t:87 [in Complexity.TM.Single.DecodeTape]
t:873 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
t:878 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
t:88 [in Undecidability.L.Util.L_facts]
t:88 [in Undecidability.L.Computability.Seval]
T:88 [in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
t:88 [in Undecidability.TM.Util.TM_facts]
t:88 [in Undecidability.TM.Compound.Shift]
T:89 [in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
t:89 [in Undecidability.L.Tactics.LClos]
t:9 [in Undecidability.L.Util.L_facts]
t:9 [in Complexity.NP.TM.mTM_to_singleTapeTM]
t:9 [in Undecidability.L.Computability.Seval]
t:9 [in Undecidability.TM.PrettyBounds.SizeBounds]
t:9 [in Undecidability.TM.Code.BinNumbers.PosPointers]
t:9 [in Undecidability.TM.TM]
T:9 [in Complexity.L.AbstractMachines.AbstractSubstMachine]
t:9 [in Undecidability.TM.L.Alphabets]
t:9 [in Undecidability.TM.Code.ChangeAlphabet]
t:9 [in Undecidability.TM.Code.Copy]
t:9 [in Undecidability.L.Computability.Rice]
T:9 [in Complexity.L.AbstractMachines.Computable.HeapMachine]
t:9 [in Complexity.TM.Single.DecodeTape]
t:9 [in Undecidability.TM.L.CompilerBoolFuns.Compiler]
t:90 [in Undecidability.L.Util.L_facts]
T:90 [in Complexity.Libs.CookPrelim.FlatFinTypes]
t:90 [in Complexity.L.TM.TMflatComp]
t:90 [in Undecidability.TM.Compound.Shift]
t:90 [in Undecidability.TM.L.CompilerBoolFuns.Compiler]
t:91 [in Undecidability.L.Computability.Seval]
t:91 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
t:91 [in Undecidability.TM.Util.TM_facts]
t:92 [in Undecidability.TM.Compound.MoveToSymbol]
t:92 [in Undecidability.L.Complexity.ResourceMeasures]
t:92 [in Undecidability.TM.Code.CodeTM]
t:93 [in Undecidability.L.Computability.Seval]
t:93 [in Undecidability.L.Tactics.Computable]
t:94 [in Undecidability.L.Tactics.LClos]
t:94 [in Undecidability.TM.Compound.MoveToSymbol]
t:94 [in Undecidability.TM.Compound.CopySymbols]
t:94 [in Complexity.L.AbstractMachines.AbstractHeapMachine]
t:94 [in Undecidability.TM.Util.TM_facts]
t:946 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
t:95 [in Undecidability.L.Computability.Seval]
t:95 [in Undecidability.TM.Code.CodeTM]
t:95 [in Undecidability.L.Tactics.Reflection]
t:95 [in Undecidability.TM.Util.TM_facts]
t:950 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
t:955 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
t:960 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
t:97 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
t:97 [in Undecidability.TM.Compound.CopySymbols]
t:98 [in Undecidability.L.Util.L_facts]
t:98 [in Undecidability.TM.Compound.MoveToSymbol]
T:98 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
T:99 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
t:99 [in Undecidability.TM.Util.TM_facts]

U

UG:68 [in Complexity.NP.Clique.FlatUGraph]
uiter:8 [in Undecidability.L.Functions.UnboundIteration]
us1:136 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
us:106 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
us:121 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
us:130 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
u':131 [in Undecidability.L.Util.L_facts]
u':157 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
u':325 [in Complexity.Libs.CookPrelim.MorePrelim]
u0:102 [in Undecidability.L.Tactics.Reflection]
u1:57 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
u2:58 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
u:1 [in Undecidability.L.Functions.Eval]
u:1 [in Undecidability.L.Computability.Decidability]
u:10 [in Undecidability.L.Computability.Seval]
U:10 [in Undecidability.Shared.Libs.PSL.Lists.Power]
u:10 [in Undecidability.L.Computability.Computability]
u:102 [in Undecidability.L.Prelim.ARS]
u:104 [in Undecidability.L.Computability.Seval]
u:105 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
u:106 [in Undecidability.L.Tactics.Reflection]
u:107 [in Undecidability.L.Tactics.LClos]
u:11 [in Undecidability.L.Tactics.LClos_Eval]
u:11 [in Undecidability.L.Tactics.Lbeta_nonrefl]
u:110 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
u:111 [in Undecidability.L.Tactics.Reflection]
u:114 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
u:115 [in Undecidability.L.Util.L_facts]
u:115 [in Undecidability.L.Computability.Seval]
u:115 [in Undecidability.L.Tactics.Reflection]
u:120 [in Undecidability.L.Util.L_facts]
u:120 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
u:124 [in Undecidability.L.Prelim.ARS]
u:127 [in Undecidability.L.Util.L_facts]
u:127 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
u:128 [in Undecidability.Shared.Libs.DLW.Utils.sums]
u:129 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
u:13 [in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
u:13 [in Undecidability.L.Tactics.Lrewrite]
u:130 [in Undecidability.L.Util.L_facts]
u:136 [in Undecidability.L.Tactics.Extract]
u:137 [in Undecidability.L.Prelim.ARS]
u:14 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_nat_facts]
U:14 [in Undecidability.Shared.Libs.PSL.Lists.Power]
u:141 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
u:142 [in Undecidability.L.Util.L_facts]
u:145 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
u:149 [in Undecidability.Shared.Libs.DLW.Vec.vec]
u:15 [in Undecidability.L.Computability.Decidability]
u:151 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
u:158 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
u:16 [in Undecidability.L.L]
u:163 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
u:167 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
u:17 [in Undecidability.TM.L.CompilerBoolFuns.NaryApp]
u:17 [in Undecidability.Shared.Libs.DLW.Utils.crt]
u:17 [in Undecidability.L.Tactics.LClos_Eval]
u:17 [in Undecidability.L.Computability.Decidability]
U:17 [in Undecidability.Shared.Libs.PSL.Lists.Power]
u:17 [in Undecidability.L.Computability.Rice]
u:172 [in Undecidability.TM.Lifting.LiftTapes]
u:172 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
u:173 [in Undecidability.TM.Lifting.LiftTapes]
u:178 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
u:183 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
u:184 [in Undecidability.L.Prelim.ARS]
u:185 [in Undecidability.L.Util.L_facts]
u:189 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
u:19 [in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
u:19 [in Undecidability.L.Tactics.Extract]
u:190 [in Undecidability.L.Util.L_facts]
u:195 [in Undecidability.L.Util.L_facts]
u:196 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
U:2 [in Undecidability.Shared.Libs.PSL.Lists.Power]
u:2 [in Undecidability.TM.PrettyBounds.MaxList]
u:20 [in Undecidability.L.Computability.Decidability]
U:20 [in Undecidability.Shared.Libs.PSL.Lists.Power]
u:201 [in Undecidability.L.Util.L_facts]
u:212 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
U:22 [in Undecidability.Shared.Libs.PSL.Lists.Power]
u:23 [in Undecidability.L.Tactics.LClos_Eval]
U:24 [in Undecidability.Shared.Libs.PSL.Lists.Power]
u:2543 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
u:2600 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
u:2605 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
u:2610 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
u:27 [in Undecidability.L.Util.L_facts]
u:27 [in Undecidability.L.Computability.Seval]
U:27 [in Undecidability.Shared.Libs.PSL.Lists.Power]
u:27 [in Undecidability.L.Computability.Rice]
u:2709 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
u:280 [in Undecidability.Shared.Libs.DLW.Vec.vec]
u:282 [in Undecidability.L.Tactics.Reflection]
u:283 [in Undecidability.Shared.Libs.DLW.Vec.vec]
u:2880 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
u:2885 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
u:2893 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
u:2898 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
U:29 [in Undecidability.Shared.Libs.PSL.Lists.Power]
u:3 [in Undecidability.L.Functions.Eval]
u:3 [in Undecidability.Shared.Libs.DLW.Utils.sums]
u:3 [in Undecidability.L.Tactics.Lbeta_nonrefl]
u:3 [in Undecidability.L.Tactics.Lbeta]
u:312 [in Undecidability.L.Tactics.Reflection]
u:316 [in Undecidability.Shared.Libs.DLW.Vec.vec]
u:32 [in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
u:32 [in Undecidability.Shared.Libs.DLW.Utils.fin_quotient]
u:32 [in Undecidability.L.Datatypes.LOptions]
U:32 [in Undecidability.Shared.Libs.PSL.Lists.Power]
u:322 [in Complexity.Libs.CookPrelim.MorePrelim]
u:34 [in Undecidability.Shared.Libs.DLW.Utils.fin_quotient]
U:35 [in Undecidability.Shared.Libs.PSL.Lists.Power]
u:35 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
u:357 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
u:37 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
u:38 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
u:38 [in Undecidability.L.Computability.Rice]
u:39 [in Undecidability.L.Tactics.Lrewrite]
u:39 [in Undecidability.L.Tactics.Lbeta_nonrefl]
U:39 [in Undecidability.Shared.Libs.PSL.Lists.Power]
u:4 [in Undecidability.L.Computability.Acceptability]
U:42 [in Undecidability.Shared.Libs.PSL.Lists.Power]
U:44 [in Undecidability.Shared.Libs.PSL.Lists.Power]
u:44 [in Undecidability.L.Datatypes.LNat]
U:45 [in Undecidability.Shared.Libs.PSL.Lists.Power]
u:46 [in Undecidability.L.Tactics.Lrewrite]
U:46 [in Undecidability.Shared.Libs.PSL.Lists.Power]
u:46 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
U:49 [in Undecidability.Shared.Libs.PSL.Lists.Power]
u:5 [in Undecidability.L.Tactics.Lrewrite]
u:50 [in Undecidability.L.Util.L_facts]
u:50 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
u:51 [in Undecidability.L.Complexity.ResourceMeasures]
U:52 [in Undecidability.Shared.Libs.PSL.Lists.Power]
u:52 [in Complexity.NP.SAT.CookLevin.Subproblems.CC]
u:53 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
u:53 [in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
u:54 [in Undecidability.L.Tactics.Lrewrite]
u:59 [in Undecidability.L.Util.L_facts]
u:59 [in Complexity.NP.SAT.CookLevin.Subproblems.CC]
u:6 [in Undecidability.L.Tactics.LClos_Eval]
u:6 [in Undecidability.L.Computability.Decidability]
U:6 [in Undecidability.Shared.Libs.PSL.Lists.Power]
u:60 [in Undecidability.L.Tactics.Lrewrite]
u:61 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
u:63 [in Undecidability.L.Util.L_facts]
u:63 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
u:63 [in Complexity.NP.SAT.CookLevin.Subproblems.CC]
u:65 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
u:66 [in Undecidability.L.Tactics.Lrewrite]
u:66 [in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
u:7 [in Undecidability.TM.L.CompilerBoolFuns.NaryApp]
U:7 [in Undecidability.Shared.Libs.PSL.Lists.Power]
u:7 [in Undecidability.L.Computability.Rice]
u:70 [in Undecidability.L.Tactics.Lrewrite]
u:70 [in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
u:76 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
u:77 [in Undecidability.L.Tactics.LClos]
u:78 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
u:8 [in Undecidability.L.Complexity.ResourceMeasures]
u:8 [in Undecidability.L.Tactics.Lbeta_nonrefl]
u:81 [in Complexity.NP.SAT.CookLevin.Subproblems.CC]
u:86 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
u:87 [in Undecidability.Shared.Libs.DLW.Vec.vec]
u:9 [in Undecidability.L.L]
u:9 [in Undecidability.L.Tactics.Lbeta]
u:93 [in Undecidability.L.Util.L_facts]
u:93 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
u:94 [in Undecidability.L.Complexity.ResourceMeasures]
u:99 [in Undecidability.L.Tactics.Reflection]

V

validX:2 [in Complexity.Complexity.Subtypes]
validX:45 [in Complexity.Complexity.Subtypes]
validX:57 [in Complexity.Complexity.Subtypes]
validY:25 [in Complexity.Complexity.Subtypes]
validY:34 [in Complexity.Complexity.Subtypes]
validY:59 [in Complexity.Complexity.Subtypes]
value:141 [in Undecidability.TM.Univ.LowLevel]
Vars:321 [in Undecidability.L.Tactics.Reflection]
Vars:323 [in Undecidability.L.Tactics.Reflection]
Va:40 [in Complexity.NP.Clique.kSAT_to_FlatClique]
Vb:41 [in Complexity.NP.Clique.kSAT_to_FlatClique]
vs:101 [in Undecidability.TM.Single.StepTM]
vs:109 [in Undecidability.TM.Single.StepTM]
vs:180 [in Complexity.TM.PrettyBounds.M2MBounds]
vs:191 [in Complexity.TM.PrettyBounds.M2MBounds]
vs:79 [in Complexity.Libs.CookPrelim.MorePrelim]
vs:86 [in Undecidability.TM.Single.StepTM]
vs:95 [in Undecidability.TM.Single.StepTM]
vx:121 [in Undecidability.TM.Util.Relations]
vX:146 [in Complexity.Complexity.NP]
vy:122 [in Undecidability.TM.Util.Relations]
v':12 [in Complexity.NP.Clique.Clique]
v':12 [in Complexity.NP.TM.M_multi2mono]
v':130 [in Complexity.Libs.CookPrelim.FlatFinTypes]
V':132 [in Undecidability.TM.L.HeapInterpreter.StepTM]
v':162 [in Complexity.L.TM.TMunflatten]
V':169 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
v':177 [in Complexity.L.TM.TMunflatten]
v':18 [in Complexity.L.TM.TMflat]
v':184 [in Complexity.L.TM.TMunflatten]
v':188 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
v':19 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_nat_facts]
v':191 [in Complexity.L.TM.TMunflatten]
v':198 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
v':207 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
v':21 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
V':219 [in Undecidability.TM.L.HeapInterpreter.StepTM]
v':220 [in Complexity.L.TM.TMflatComp]
v':23 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
v':26 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
v':27 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_nat_facts]
v':27 [in Complexity.L.TM.TMflatFun]
v':283 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
v':285 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
v':341 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
v':343 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
v':35 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
V':38 [in Complexity.L.AbstractMachines.AbstractSubstMachine]
v':38 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
V':40 [in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
v':43 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_nat_facts]
v':45 [in Complexity.NP.TM.M_multi2mono]
v':50 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
v':51 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_nat_facts]
v':53 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
v':65 [in Complexity.L.TM.TMunflatten]
v':73 [in Complexity.L.TM.TMunflatten]
v':75 [in Complexity.NP.TM.M_multi2mono]
v':78 [in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
v':8 [in Undecidability.L.Functions.Eval]
V':92 [in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
v0':22 [in Complexity.L.TM.TMflat]
v0':27 [in Complexity.L.TM.TMflat]
v0:104 [in Undecidability.L.Tactics.Reflection]
v0:21 [in Complexity.L.TM.TMflat]
v0:25 [in Complexity.L.TM.TMflat]
v0:37 [in Complexity.NP.TM.M_multi2mono]
v1:100 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
v1:101 [in Complexity.NP.Clique.FlatClique]
v1:149 [in Undecidability.L.Util.L_facts]
V1:15 [in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
v1:15 [in Complexity.NP.Clique.kSAT_to_FlatClique]
v1:15 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
v1:16 [in Complexity.NP.Clique.kSAT_to_Clique]
v1:18 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
V1:2 [in Complexity.NP.Clique.FlatUGraph]
v1:207 [in Undecidability.L.Util.L_facts]
v1:21 [in Complexity.NP.Clique.FlatUGraph]
V1:22 [in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
v1:220 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
v1:226 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
v1:233 [in Undecidability.Shared.Libs.DLW.Vec.vec]
v1:239 [in Undecidability.Shared.Libs.DLW.Vec.vec]
v1:24 [in Complexity.NP.Clique.kSAT_to_Clique]
v1:25 [in Complexity.NP.Clique.FlatUGraph]
v1:26 [in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
v1:26 [in Complexity.NP.Clique.FlatClique]
v1:27 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
v1:277 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
v1:280 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
v1:3 [in Complexity.NP.Clique.Clique]
v1:31 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
v1:32 [in Complexity.NP.Clique.kSAT_to_FlatClique]
v1:335 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
v1:338 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
v1:34 [in Complexity.NP.Clique.kSAT_to_Clique]
v1:38 [in Complexity.NP.Clique.kSAT_to_Clique]
v1:39 [in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
v1:4 [in Complexity.NP.Clique.UGraph]
v1:400 [in Undecidability.TM.Util.TM_facts]
v1:42 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
v1:46 [in Complexity.NP.Clique.kSAT_to_FlatClique]
v1:46 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
v1:5 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
v1:5 [in Complexity.NP.Clique.FlatClique]
v1:51 [in Complexity.NP.Clique.FlatClique]
v1:52 [in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
v1:54 [in Complexity.NP.Clique.FlatClique]
v1:55 [in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
v1:57 [in Complexity.NP.Clique.FlatClique]
v1:59 [in Complexity.NP.Clique.FlatUGraph]
V1:61 [in Complexity.NP.Clique.FlatUGraph]
v1:62 [in Complexity.NP.Clique.kSAT_to_FlatClique]
v1:63 [in Undecidability.Shared.Libs.PSL.Vectors.VectorDupfree]
v1:64 [in Complexity.NP.Clique.FlatUGraph]
v1:66 [in Undecidability.TM.Util.TM_facts]
v1:67 [in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
v1:7 [in Complexity.NP.Clique.UGraph]
v1:73 [in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
v1:86 [in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
v1:92 [in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
v1:93 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
v1:97 [in Complexity.NP.Clique.FlatClique]
v2':247 [in Undecidability.Shared.Libs.DLW.Vec.vec]
v2:101 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
v2:102 [in Complexity.NP.Clique.FlatClique]
V2:11 [in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
v2:150 [in Undecidability.L.Util.L_facts]
v2:16 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
v2:17 [in Complexity.NP.Clique.kSAT_to_FlatClique]
v2:18 [in Complexity.NP.Clique.FlatClique]
v2:18 [in Complexity.NP.Clique.kSAT_to_Clique]
v2:19 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
v2:208 [in Undecidability.L.Util.L_facts]
v2:22 [in Complexity.NP.Clique.FlatUGraph]
v2:221 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
v2:227 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
v2:234 [in Undecidability.Shared.Libs.DLW.Vec.vec]
v2:240 [in Undecidability.Shared.Libs.DLW.Vec.vec]
v2:243 [in Undecidability.Shared.Libs.DLW.Vec.vec]
v2:244 [in Undecidability.Shared.Libs.DLW.Vec.vec]
v2:25 [in Complexity.NP.Clique.kSAT_to_Clique]
V2:25 [in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
v2:26 [in Complexity.NP.Clique.FlatUGraph]
v2:27 [in Complexity.NP.Clique.FlatClique]
v2:278 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
v2:28 [in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
v2:28 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
v2:281 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
V2:3 [in Complexity.NP.Clique.FlatUGraph]
v2:32 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
v2:33 [in Complexity.NP.Clique.kSAT_to_FlatClique]
v2:336 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
v2:339 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
v2:35 [in Complexity.NP.Clique.kSAT_to_Clique]
v2:39 [in Complexity.NP.Clique.kSAT_to_Clique]
v2:4 [in Complexity.NP.Clique.Clique]
v2:401 [in Undecidability.TM.Util.TM_facts]
v2:41 [in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
v2:43 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
v2:47 [in Complexity.NP.Clique.kSAT_to_FlatClique]
v2:47 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
v2:5 [in Complexity.NP.Clique.UGraph]
v2:52 [in Complexity.NP.Clique.FlatClique]
v2:55 [in Complexity.NP.Clique.FlatClique]
v2:58 [in Complexity.NP.Clique.FlatClique]
v2:59 [in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
v2:6 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
v2:6 [in Complexity.NP.Clique.FlatClique]
v2:60 [in Complexity.NP.Clique.FlatUGraph]
V2:62 [in Complexity.NP.Clique.FlatUGraph]
v2:63 [in Complexity.NP.Clique.kSAT_to_FlatClique]
v2:64 [in Undecidability.Shared.Libs.PSL.Vectors.VectorDupfree]
v2:65 [in Complexity.NP.Clique.FlatUGraph]
v2:67 [in Undecidability.TM.Util.TM_facts]
v2:69 [in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
v2:8 [in Complexity.NP.Clique.UGraph]
v2:89 [in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
v2:94 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
v2:97 [in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
v2:98 [in Complexity.NP.Clique.FlatClique]
v:10 [in Complexity.NP.SAT.SharedSAT]
v:10 [in Complexity.NP.Clique.Clique]
V:10 [in Complexity.L.AbstractMachines.AbstractSubstMachine]
v:10 [in Complexity.NP.TM.M_multi2mono]
V:10 [in Undecidability.TM.Lifting.LiftTapes]
V:10 [in Complexity.L.AbstractMachines.Computable.HeapMachine]
v:100 [in Undecidability.Shared.Libs.DLW.Utils.fin_base]
v:100 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
v:100 [in Undecidability.L.Tactics.Reflection]
v:101 [in Complexity.NP.Clique.kSAT_to_Clique]
v:102 [in Undecidability.Shared.Libs.DLW.Vec.vec]
v:102 [in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
v:102 [in Complexity.NP.Clique.kSAT_to_Clique]
v:102 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
v:103 [in Complexity.NP.Clique.kSAT_to_Clique]
V:104 [in Undecidability.TM.L.HeapInterpreter.StepTM]
v:105 [in Undecidability.L.Computability.Seval]
V:106 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
v:108 [in Undecidability.Shared.Libs.DLW.Vec.vec]
v:109 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
v:11 [in Undecidability.TM.L.CompilerBoolFuns.NaryApp]
v:11 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
v:11 [in Undecidability.L.Computability.Seval]
v:11 [in Undecidability.TM.Util.VectorPrelim]
v:11 [in Undecidability.Shared.Libs.DLW.Utils.crt]
v:11 [in Complexity.NP.TM.M_multi2mono]
v:110 [in Undecidability.Shared.Libs.DLW.Vec.vec]
V:111 [in Complexity.NP.Clique.FlatClique]
V:112 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
v:112 [in Undecidability.Shared.Libs.DLW.Vec.vec]
V:112 [in Complexity.NP.Clique.FlatClique]
V:114 [in Complexity.NP.Clique.FlatClique]
V:114 [in Undecidability.TM.L.HeapInterpreter.StepTM]
v:116 [in Undecidability.Shared.Libs.DLW.Vec.vec]
V:116 [in Complexity.NP.Clique.FlatClique]
v:118 [in Undecidability.L.Computability.Seval]
V:119 [in Complexity.NP.Clique.FlatClique]
v:119 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
v:12 [in Undecidability.Shared.Libs.DLW.Vec.vec]
v:12 [in Complexity.NP.SAT.SAT_inNP]
v:121 [in Undecidability.Shared.Libs.DLW.Vec.vec]
V:122 [in Complexity.NP.Clique.FlatClique]
v:124 [in Undecidability.L.Tactics.ComputableTime]
v:125 [in Undecidability.Shared.Libs.DLW.Vec.vec]
v:128 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
v:129 [in Undecidability.Shared.Libs.DLW.Vec.vec]
v:129 [in Complexity.Libs.CookPrelim.FlatFinTypes]
v:129 [in Undecidability.Shared.Libs.DLW.Utils.sums]
v:131 [in Complexity.Libs.CookPrelim.FlatFinTypes]
v:132 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
v:133 [in Undecidability.Shared.Libs.DLW.Vec.vec]
v:133 [in Complexity.NP.Clique.kSAT_to_Clique]
V:137 [in Undecidability.TM.L.HeapInterpreter.StepTM]
v:138 [in Undecidability.Shared.Libs.DLW.Vec.vec]
v:138 [in Undecidability.L.Tactics.ComputableTime]
v:14 [in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
v:14 [in Complexity.L.ComparisonTimeBoundDerivation]
v:14 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
V:142 [in Undecidability.TM.L.HeapInterpreter.StepTM]
v:146 [in Undecidability.Shared.Libs.DLW.Vec.vec]
v:147 [in Undecidability.TM.Lifting.LiftTapes]
v:147 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
v:148 [in Undecidability.Shared.Libs.DLW.Vec.vec]
v:149 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
V:149 [in Undecidability.TM.L.HeapInterpreter.StepTM]
v:15 [in Undecidability.TM.L.CompilerBoolFuns.NaryApp]
v:15 [in Undecidability.L.TM.TapeFuns]
v:15 [in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
V:15 [in Complexity.L.AbstractMachines.AbstractSubstMachine]
v:15 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
v:150 [in Undecidability.Shared.Libs.DLW.Vec.vec]
v:151 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
v:152 [in Undecidability.Shared.Libs.DLW.Vec.vec]
v:153 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
v:153 [in Complexity.L.ComparisonTimeBoundDerivation]
v:153 [in Undecidability.Shared.Libs.DLW.Utils.php]
v:153 [in Undecidability.TM.Lifting.LiftTapes]
v:154 [in Undecidability.Shared.Libs.DLW.Vec.vec]
V:155 [in Undecidability.TM.L.HeapInterpreter.StepTM]
v:155 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
v:157 [in Undecidability.Shared.Libs.DLW.Vec.vec]
v:157 [in Undecidability.TM.Lifting.LiftTapes]
v:158 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
v:16 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
v:16 [in Undecidability.Shared.Libs.DLW.Vec.vec]
v:16 [in Undecidability.TM.Util.VectorPrelim]
v:16 [in Complexity.L.ComparisonTimeBoundDerivation]
v:16 [in Undecidability.Shared.Libs.PSL.FiniteTypes.VectorFin]
v:16 [in Undecidability.L.TM.TapeFuns]
v:16 [in Undecidability.L.Computability.MuRec]
v:161 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
v:162 [in Undecidability.Shared.Libs.DLW.Vec.vec]
v:164 [in Complexity.L.TM.TMunflatten]
V:165 [in Undecidability.TM.L.HeapInterpreter.StepTM]
v:167 [in Undecidability.Shared.Libs.DLW.Vec.vec]
V:167 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
v:168 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
v:17 [in Undecidability.Shared.Libs.DLW.Vec.vec]
V:17 [in Complexity.NP.Clique.FlatUGraph]
v:17 [in Complexity.L.TM.TMflat]
v:17 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
v:173 [in Undecidability.Shared.Libs.DLW.Vec.vec]
v:174 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
V:175 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
v:176 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
v:176 [in Complexity.L.TM.TMunflatten]
v:177 [in Undecidability.Shared.Libs.DLW.Vec.vec]
v:178 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
v:18 [in Complexity.NP.Clique.FlatUGraph]
v:18 [in Undecidability.Shared.Libs.DLW.Utils.crt]
v:18 [in Undecidability.L.Computability.Decidability]
v:18 [in Complexity.NP.TM.M_multi2mono]
v:180 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
v:181 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
V:181 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
v:183 [in Complexity.L.TM.TMunflatten]
V:185 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
v:186 [in Undecidability.Shared.Libs.DLW.Vec.vec]
v:187 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
v:189 [in Undecidability.Shared.Libs.DLW.Vec.vec]
v:19 [in Undecidability.Shared.Libs.DLW.Vec.vec]
v:19 [in Complexity.L.ComparisonTimeBoundDerivation]
v:19 [in Complexity.NP.SAT.FSAT.FSAT]
v:19 [in Undecidability.L.L]
V:19 [in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
v:190 [in Complexity.L.TM.TMunflatten]
V:192 [in Undecidability.TM.L.HeapInterpreter.StepTM]
v:197 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
v:197 [in Undecidability.Shared.Libs.DLW.Vec.vec]
v:197 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
v:2 [in Complexity.NP.SAT.SharedSAT]
V:2 [in Complexity.L.AbstractMachines.Computable.UnivDecTime]
V:2 [in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
v:20 [in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
v:20 [in Undecidability.Shared.Libs.DLW.Vec.vec]
V:20 [in Complexity.L.AbstractMachines.Computable.HeapMachine]
v:20 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
v:201 [in Undecidability.Shared.Libs.DLW.Vec.vec]
V:201 [in Undecidability.TM.L.HeapInterpreter.StepTM]
V:202 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
V:204 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
v:206 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
v:208 [in Undecidability.Shared.Libs.DLW.Vec.vec]
v:21 [in Undecidability.TM.L.CompilerBoolFuns.NaryApp]
v:21 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
v:21 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
v:21 [in Undecidability.L.Tactics.ComputableTime]
v:21 [in Undecidability.TM.Util.VectorPrelim]
V:21 [in Complexity.NP.Clique.FlatClique]
v:21 [in Undecidability.L.Computability.Decidability]
v:21 [in Complexity.NP.SAT.CookLevin.Subproblems.TM_single]
V:210 [in Undecidability.TM.L.HeapInterpreter.StepTM]
v:213 [in Undecidability.L.Util.L_facts]
v:213 [in Undecidability.Shared.Libs.DLW.Vec.vec]
v:213 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
V:213 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
v:214 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
v:217 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
v:218 [in Undecidability.L.Util.L_facts]
v:218 [in Undecidability.Shared.Libs.DLW.Vec.vec]
V:218 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
v:22 [in Undecidability.Shared.Libs.DLW.Vec.vec]
v:22 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
v:22 [in Complexity.NP.SAT.SAT]
v:22 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
v:221 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
v:222 [in Complexity.L.TM.TMflatComp]
v:223 [in Undecidability.L.Util.L_facts]
V:223 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
V:223 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
V:228 [in Undecidability.TM.L.HeapInterpreter.StepTM]
V:23 [in Complexity.NP.Clique.FlatClique]
v:23 [in Undecidability.L.Computability.MuRec]
v:23 [in Undecidability.L.Tactics.Computable]
v:230 [in Complexity.Libs.CookPrelim.MorePrelim]
V:233 [in Undecidability.TM.L.HeapInterpreter.StepTM]
V:237 [in Undecidability.TM.L.HeapInterpreter.StepTM]
v:239 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
v:24 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
v:24 [in Undecidability.TM.PrettyBounds.SizeBounds]
v:24 [in Undecidability.TM.Util.VectorPrelim]
v:24 [in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
v:24 [in Complexity.NP.SAT.FSAT.FSAT]
v:24 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
v:240 [in Undecidability.L.Util.L_facts]
V:241 [in Undecidability.TM.L.HeapInterpreter.StepTM]
V:246 [in Undecidability.TM.L.HeapInterpreter.StepTM]
v:247 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
v:248 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
v:25 [in Undecidability.TM.Compound.TMTac]
V:25 [in Complexity.L.AbstractMachines.AbstractSubstMachine]
v:25 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
v:25 [in Complexity.L.TM.TMflatFun]
v:250 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
v:259 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
V:26 [in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
v:26 [in Undecidability.Shared.Libs.DLW.Vec.vec]
v:26 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_nat_facts]
V:26 [in Undecidability.Shared.Libs.PSL.Vectors.VectorDupfree]
v:26 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
v:261 [in Undecidability.Shared.Libs.DLW.Vec.vec]
v:265 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
v:268 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
V:27 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds_Loop]
v:270 [in Undecidability.Shared.Libs.DLW.Vec.vec]
v:273 [in Undecidability.Shared.Libs.DLW.Vec.vec]
v:275 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
v:276 [in Undecidability.Shared.Libs.DLW.Vec.vec]
v:276 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
v:278 [in Undecidability.Shared.Libs.DLW.Vec.vec]
v:279 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
v:28 [in Undecidability.L.Tactics.Lrewrite]
v:28 [in Undecidability.L.L]
v:28 [in Complexity.NP.Clique.FlatClique]
v:281 [in Undecidability.Shared.Libs.DLW.Vec.vec]
v:282 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
v:284 [in Undecidability.Shared.Libs.DLW.Vec.vec]
v:284 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
v:285 [in Undecidability.Shared.Libs.DLW.Vec.vec]
v:286 [in Undecidability.Shared.Libs.DLW.Vec.vec]
v:287 [in Undecidability.Shared.Libs.DLW.Vec.vec]
v:288 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
v:29 [in Undecidability.L.Tactics.Lrewrite]
v:29 [in Undecidability.Shared.Libs.DLW.Vec.vec]
v:29 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_nat_facts]
v:291 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
v:2931 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
v:2932 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
v:2933 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
v:2934 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
v:298 [in Undecidability.Shared.Libs.DLW.Vec.vec]
v:3 [in Undecidability.TM.Util.VectorPrelim]
V:3 [in Complexity.NP.Clique.FlatClique]
v:3 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
V:30 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
V:30 [in Complexity.NP.Clique.FlatUGraph]
v:30 [in Complexity.NP.SAT.CookLevin.Subproblems.SingleTMGenNP]
v:30 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
v:301 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
v:306 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
v:307 [in Undecidability.Shared.Libs.DLW.Vec.vec]
v:311 [in Undecidability.Shared.Libs.DLW.Vec.vec]
v:311 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
v:314 [in Undecidability.Shared.Libs.DLW.Vec.vec]
v:317 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
v:318 [in Undecidability.Shared.Libs.DLW.Vec.vec]
v:32 [in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
V:32 [in Complexity.NP.Clique.FlatUGraph]
v:32 [in Undecidability.Shared.Libs.DLW.Utils.crt]
v:32 [in Complexity.NP.TM.M_multi2mono]
v:320 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
v:321 [in Complexity.Libs.CookPrelim.MorePrelim]
v:322 [in Undecidability.Shared.Libs.DLW.Vec.vec]
v:328 [in Undecidability.Shared.Libs.DLW.Vec.vec]
v:33 [in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
v:33 [in Undecidability.Shared.Libs.DLW.Utils.fin_quotient]
V:33 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds_Loop]
v:33 [in Complexity.NP.Clique.FlatUGraph]
V:33 [in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
v:330 [in Undecidability.Shared.Libs.DLW.Vec.vec]
v:334 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
v:337 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
v:338 [in Undecidability.Shared.Libs.DLW.Vec.vec]
v:34 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
v:340 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
v:341 [in Undecidability.Shared.Libs.DLW.Vec.vec]
v:342 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
v:344 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
v:345 [in Undecidability.Shared.Libs.DLW.Vec.vec]
V:35 [in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
v:35 [in Undecidability.Shared.Libs.DLW.Utils.fin_quotient]
v:35 [in Undecidability.TM.L.CompilerBoolFuns.NaryApp]
v:35 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
v:35 [in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
v:35 [in Complexity.NP.TM.M_multi2mono]
v:357 [in Undecidability.Shared.Libs.DLW.Vec.vec]
v:358 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
v:36 [in Undecidability.TM.Util.VectorPrelim]
v:36 [in Undecidability.Shared.Libs.DLW.Utils.interval]
v:368 [in Undecidability.Shared.Libs.DLW.Vec.vec]
v:37 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_nat_facts]
v:37 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
v:38 [in Undecidability.Shared.Libs.DLW.Vec.vec]
v:38 [in Complexity.NP.SAT.FSAT.FSAT]
v:38 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
v:39 [in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
v:39 [in Undecidability.TM.Single.EncodeTapes]
v:390 [in Undecidability.Shared.Libs.DLW.Vec.vec]
v:394 [in Undecidability.Shared.Libs.DLW.Vec.vec]
v:4 [in Complexity.NP.SAT.SharedSAT]
v:4 [in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
V:40 [in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
v:40 [in Undecidability.Shared.Libs.DLW.Vec.vec]
v:40 [in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
v:40 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
V:41 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
v:41 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_nat_facts]
v:41 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
v:412 [in Undecidability.Shared.Libs.DLW.Vec.vec]
v:416 [in Undecidability.Shared.Libs.DLW.Vec.vec]
v:419 [in Undecidability.Shared.Libs.DLW.Vec.vec]
v:42 [in Undecidability.TM.L.CompilerBoolFuns.NaryApp]
v:420 [in Undecidability.Shared.Libs.DLW.Vec.vec]
v:43 [in Undecidability.Shared.Libs.DLW.Vec.vec]
V:43 [in Undecidability.TM.L.HeapInterpreter.StepTM]
v:44 [in Complexity.NP.TM.M_multi2mono]
v:45 [in Undecidability.Shared.Libs.DLW.Vec.vec]
v:45 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
v:45 [in Undecidability.TM.Single.EncodeTapes]
V:46 [in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
V:46 [in Complexity.NP.Clique.FlatUGraph]
V:46 [in Complexity.L.AbstractMachines.AbstractSubstMachine]
V:47 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
v:47 [in Complexity.NP.Clique.FlatUGraph]
v:47 [in Complexity.NP.SAT.SAT_inNP]
v:47 [in Complexity.L.TM.TMunflatten]
V:48 [in Complexity.NP.Clique.FlatUGraph]
v:48 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
v:48 [in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
V:48 [in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
v:48 [in Complexity.NP.SAT.SAT]
v:49 [in Undecidability.TM.L.CompilerBoolFuns.NaryApp]
v:49 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
v:49 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
v:49 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_nat_facts]
v:49 [in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
v:49 [in Complexity.NP.Clique.kSAT_to_Clique]
v:49 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
v:5 [in Undecidability.Shared.Libs.DLW.Vec.vec]
v:5 [in Undecidability.L.Datatypes.LOptions]
V:5 [in Undecidability.TM.Lifting.LiftTapes]
V:51 [in Complexity.NP.Clique.FlatUGraph]
v:51 [in Complexity.NP.SAT.SAT]
v:51 [in Undecidability.TM.Single.EncodeTapes]
v:52 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
v:52 [in Complexity.NP.Clique.FlatUGraph]
v:52 [in Complexity.NP.SAT.FSAT.FSAT]
V:52 [in Undecidability.TM.L.HeapInterpreter.StepTM]
v:52 [in Complexity.NP.TM.M_multi2mono]
v:52 [in Undecidability.TM.L.CompilerBoolFuns.Compiler]
v:52 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
v:53 [in Complexity.NP.SAT.CookLevin.Subproblems.CC]
v:54 [in Undecidability.TM.L.CompilerBoolFuns.NaryApp]
V:54 [in Complexity.NP.Clique.FlatUGraph]
v:54 [in Complexity.NP.SAT.SAT]
V:55 [in Complexity.L.AbstractMachines.FunctionalDefinitions]
v:55 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
v:56 [in Complexity.NP.SAT.SAT_inNP]
v:56 [in Complexity.NP.Clique.kSAT_to_Clique]
V:56 [in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
v:57 [in Undecidability.Shared.Libs.DLW.Vec.vec]
v:57 [in Undecidability.TM.Single.EncodeTapes]
v:59 [in Undecidability.TM.L.CompilerBoolFuns.NaryApp]
v:59 [in Undecidability.TM.Util.TM_facts]
v:59 [in Complexity.NP.SAT.SAT]
v:6 [in Undecidability.L.Functions.Eval]
v:6 [in Complexity.NP.SAT.SAT_inNP]
v:6 [in Undecidability.TM.L.CompilerBoolFuns.Compiler]
v:60 [in Complexity.NP.Clique.kSAT_to_Clique]
v:60 [in Undecidability.TM.L.CompilerBoolFuns.Compiler]
v:60 [in Complexity.NP.SAT.CookLevin.Subproblems.CC]
v:60 [in Undecidability.TM.Single.EncodeTapes]
V:61 [in Complexity.L.AbstractMachines.AbstractHeapMachine]
V:61 [in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
v:61 [in Undecidability.TM.L.CompilerBoolFuns.Compiler]
v:62 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
v:62 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
v:62 [in Complexity.L.TM.TMflatten]
v:62 [in Complexity.NP.SAT.SAT]
V:63 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
v:63 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
V:63 [in Complexity.L.AbstractMachines.FunctionalDefinitions]
v:64 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
v:64 [in Complexity.L.TM.TMunflatten]
v:64 [in Complexity.NP.SAT.CookLevin.Subproblems.CC]
v:64 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
V:65 [in Undecidability.TM.Lifting.LiftTapes]
v:66 [in Undecidability.Shared.Libs.DLW.Vec.vec]
v:66 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
V:66 [in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
v:69 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
v:7 [in Complexity.NP.SAT.SharedSAT]
v:7 [in Undecidability.L.Tactics.LClos_Eval]
V:7 [in Undecidability.Shared.Libs.PSL.Vectors.VectorDupfree]
v:7 [in Undecidability.TM.Util.TM_facts]
v:70 [in Complexity.NP.SAT.SAT_inNP]
v:71 [in Undecidability.Shared.Libs.DLW.Vec.vec]
v:71 [in Complexity.NP.Clique.kSAT_to_Clique]
v:72 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
v:73 [in Complexity.NP.SAT.SAT_inNP]
v:73 [in Undecidability.L.Tactics.Computable]
V:74 [in Complexity.NP.Clique.FlatUGraph]
v:74 [in Complexity.NP.TM.M_multi2mono]
V:74 [in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
v:75 [in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
v:75 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
V:75 [in Undecidability.TM.L.HeapInterpreter.StepTM]
V:75 [in Complexity.L.AbstractMachines.AbstractHeapMachine]
v:75 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
v:76 [in Undecidability.Shared.Libs.DLW.Vec.vec]
v:76 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
v:77 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
v:77 [in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
V:77 [in Undecidability.TM.Lifting.LiftTapes]
V:78 [in Complexity.NP.Clique.FlatClique]
v:78 [in Undecidability.TM.L.CompilerBoolFuns.Compiler]
v:8 [in Undecidability.TM.Util.VectorPrelim]
v:8 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_nat_facts]
V:8 [in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
v:80 [in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
v:81 [in Undecidability.Shared.Libs.DLW.Vec.vec]
V:82 [in Undecidability.TM.Lifting.LiftTapes]
v:82 [in Complexity.NP.SAT.CookLevin.Subproblems.CC]
v:83 [in Undecidability.L.Tactics.Computable]
v:83 [in Undecidability.TM.L.CompilerBoolFuns.Compiler]
V:86 [in Undecidability.TM.Lifting.LiftTapes]
v:87 [in Complexity.L.ComparisonTimeBoundDerivation]
v:87 [in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
V:88 [in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
v:88 [in Undecidability.Shared.Libs.DLW.Vec.vec]
V:88 [in Undecidability.TM.Lifting.LiftTapes]
v:88 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
v:89 [in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
V:89 [in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
v:89 [in Undecidability.TM.L.CompilerBoolFuns.Compiler]
v:9 [in Undecidability.Shared.Libs.DLW.Vec.vec]
v:9 [in Complexity.NP.SAT.SAT_inNP]
v:91 [in Undecidability.Shared.Libs.DLW.Vec.vec]
v:91 [in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
v:91 [in Complexity.NP.Clique.kSAT_to_Clique]
v:92 [in Undecidability.L.Util.L_facts]
v:92 [in Undecidability.L.Tactics.Computable]
v:94 [in Complexity.NP.SAT.SAT_inNP]
v:95 [in Undecidability.Shared.Libs.DLW.Vec.vec]
v:95 [in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
v:95 [in Complexity.NP.Clique.kSAT_to_Clique]
v:95 [in Undecidability.TM.L.CompilerBoolFuns.Compiler]
v:97 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
v:98 [in Complexity.NP.Clique.kSAT_to_Clique]
v:99 [in Undecidability.L.Tactics.ComputableTime]

W

wf:129 [in Complexity.NP.SAT.CookLevin.Subproblems.CC]
width:161 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
width:163 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
width:165 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
width:17 [in Complexity.NP.SAT.CookLevin.Subproblems.CC]
width:20 [in Complexity.NP.SAT.CookLevin.Subproblems.CC]
w':103 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
w':106 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
w':146 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
w':79 [in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
w1:116 [in Complexity.NP.SAT.CookLevin.Subproblems.CC]
w1:120 [in Complexity.NP.SAT.CookLevin.Subproblems.CC]
w1:264 [in Complexity.Libs.CookPrelim.MorePrelim]
w1:29 [in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
w1:42 [in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
w1:46 [in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
w1:53 [in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
w1:56 [in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
w1:70 [in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
w1:74 [in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
w1:87 [in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
w1:93 [in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
w2:117 [in Complexity.NP.SAT.CookLevin.Subproblems.CC]
w2:121 [in Complexity.NP.SAT.CookLevin.Subproblems.CC]
w2:265 [in Complexity.Libs.CookPrelim.MorePrelim]
w2:30 [in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
w2:43 [in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
w2:50 [in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
w2:60 [in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
w2:71 [in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
w2:90 [in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
w2:95 [in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
w3:47 [in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
w:10 [in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
w:101 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
w:102 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
w:104 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
w:106 [in Undecidability.L.Computability.Seval]
w:108 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
w:11 [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
w:11 [in Complexity.NP.SAT.CookLevin.Reductions.FlatTCC_to_FlatCC]
w:112 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
w:114 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
w:115 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
w:116 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
w:117 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
w:117 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
w:118 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
w:12 [in Undecidability.L.Computability.Seval]
w:12 [in Undecidability.Shared.Libs.DLW.Utils.crt]
W:12 [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
w:12 [in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
w:12 [in Undecidability.L.Functions.Encoding]
w:120 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
w:123 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
w:133 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
w:134 [in Undecidability.TM.Univ.LowLevel]
w:138 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
w:143 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
w:144 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
w:147 [in Undecidability.Shared.Libs.DLW.Vec.vec]
w:147 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
w:150 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
w:151 [in Undecidability.Shared.Libs.DLW.Vec.vec]
w:153 [in Undecidability.Shared.Libs.DLW.Vec.vec]
w:154 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
w:155 [in Undecidability.Shared.Libs.DLW.Vec.vec]
w:158 [in Undecidability.Shared.Libs.DLW.Vec.vec]
w:160 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
w:162 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
w:165 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
w:168 [in Undecidability.Shared.Libs.DLW.Vec.vec]
w:17 [in Complexity.NP.SAT.CookLevin.Reductions.FlatTCC_to_FlatCC]
w:173 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
w:175 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
w:178 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
w:187 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
w:21 [in Undecidability.Shared.Libs.DLW.Utils.crt]
w:24 [in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
w:25 [in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
w:2542 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
w:2545 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
w:26 [in Undecidability.TM.Compound.TMTac]
w:260 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
w:2604 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
w:2609 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
w:2614 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
w:27 [in Undecidability.Shared.Libs.DLW.Vec.vec]
w:271 [in Undecidability.Shared.Libs.DLW.Vec.vec]
w:2711 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
w:274 [in Undecidability.Shared.Libs.DLW.Vec.vec]
w:279 [in Undecidability.Shared.Libs.DLW.Vec.vec]
w:282 [in Undecidability.Shared.Libs.DLW.Vec.vec]
w:284 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
w:291 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
W:2917 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
W:2929 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
W:2954 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
w:299 [in Undecidability.Shared.Libs.DLW.Vec.vec]
w:299 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
w:30 [in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
W:3042 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
W:3057 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
W:3063 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
w:307 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
W:3072 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
w:3077 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
w:309 [in Undecidability.Shared.Libs.DLW.Vec.vec]
W:3105 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
W:3111 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
W:3124 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
w:314 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
W:3162 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
W:3171 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
W:3179 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
W:3189 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
w:32 [in Undecidability.TM.SBTM]
w:321 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
w:3212 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
w:3213 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
w:3214 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
w:3215 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
w:323 [in Undecidability.Shared.Libs.DLW.Vec.vec]
w:33 [in Undecidability.L.Datatypes.LProd]
w:332 [in Undecidability.Shared.Libs.DLW.Vec.vec]
w:339 [in Undecidability.Shared.Libs.DLW.Vec.vec]
w:34 [in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
w:358 [in Undecidability.Shared.Libs.DLW.Vec.vec]
W:3596 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
W:3629 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
w:37 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
w:413 [in Undecidability.Shared.Libs.DLW.Vec.vec]
w:42 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
w:42 [in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
w:46 [in Undecidability.Shared.Libs.DLW.Vec.vec]
w:46 [in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
w:48 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
w:50 [in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
w:51 [in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
w:54 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
w:54 [in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
w:55 [in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
w:59 [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
w:59 [in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
w:7 [in Complexity.NP.SAT.CookLevin.Reductions.FlatTCC_to_FlatCC]
w:73 [in Undecidability.TM.Univ.LowLevel]
w:73 [in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
w:74 [in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
w:76 [in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
w:8 [in Undecidability.Shared.Libs.DLW.Utils.crt]
w:8 [in Complexity.NP.SAT.CookLevin.Reductions.FlatTCC_to_FlatCC]
w:8 [in Undecidability.L.AbstractMachines.LargestVar]
w:81 [in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
w:83 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
w:9 [in Complexity.NP.SAT.CookLevin.Reductions.FlatTCC_to_FlatCC]
w:91 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
w:92 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
w:95 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
w:96 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
w:97 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]

X

XeqbComp:145 [in Complexity.L.ComparisonTimeBoundDerivation]
XeqbComp:26 [in Undecidability.L.Datatypes.List.List_in]
XeqbComp:5 [in Complexity.L.ComparisonTimeBoundDerivation]
XeqbComp:53 [in Undecidability.L.Datatypes.List.List_in]
XeqbComp:79 [in Complexity.L.ComparisonTimeBoundDerivation]
XeqbComp:86 [in Complexity.NP.SAT.SAT_inNP]
Xeqb:82 [in Complexity.Libs.CookPrelim.PolyBounds]
Xeq:144 [in Complexity.L.ComparisonTimeBoundDerivation]
Xeq:25 [in Undecidability.L.Datatypes.List.List_in]
Xeq:4 [in Complexity.L.ComparisonTimeBoundDerivation]
Xeq:52 [in Undecidability.L.Datatypes.List.List_in]
Xeq:78 [in Complexity.L.ComparisonTimeBoundDerivation]
Xeq:85 [in Complexity.NP.SAT.SAT_inNP]
xInt:13 [in Undecidability.L.Tactics.ComputableTime]
Xint:155 [in Complexity.Libs.CookPrelim.PolyBounds]
xInt:18 [in Undecidability.L.Tactics.Computable]
Xint:20 [in Undecidability.L.Datatypes.List.List_extra]
Xint:255 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
xInt:8 [in Undecidability.L.Tactics.ComputableTime]
xs':205 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
xs':213 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
xs':54 [in Complexity.TM.Code.Decode]
xs1:149 [in Undecidability.TM.Code.Code]
xs1:34 [in Undecidability.TM.PrettyBounds.MaxList]
xs2:150 [in Undecidability.TM.Code.Code]
xs2:35 [in Undecidability.TM.PrettyBounds.MaxList]
xs:1 [in Undecidability.TM.PrettyBounds.MaxList]
xs:10 [in Undecidability.L.Datatypes.Lists]
xs:101 [in Complexity.TM.PrettyBounds.BaseCode]
xs:101 [in Undecidability.TM.Compound.Compare]
xs:102 [in Undecidability.TM.Univ.LookupAssociativeListTM]
xs:102 [in Complexity.NP.TM.LM_to_mTM]
xs:103 [in Complexity.TM.PrettyBounds.BaseCodeSpace]
xs:104 [in Undecidability.TM.Compound.Compare]
xs:106 [in Undecidability.TM.Code.CaseList]
xs:106 [in Undecidability.TM.Univ.LookupAssociativeListTM]
xs:107 [in Complexity.TM.PrettyBounds.UnivBounds]
xs:109 [in Undecidability.TM.Code.CaseList]
xs:109 [in Complexity.TM.PrettyBounds.BaseCodeSpace]
xs:11 [in Complexity.TM.PrettyBounds.SpaceBounds]
xs:11 [in Undecidability.TM.Code.List.Rev]
xs:11 [in Undecidability.Shared.Libs.PSL.Vectors.VectorDupfree]
xs:110 [in Undecidability.TM.Single.StepTM]
xs:110 [in Undecidability.TM.Code.List.Nth]
xs:111 [in Undecidability.TM.Code.CaseList]
xs:111 [in Complexity.TM.PrettyBounds.UnivBounds]
xs:111 [in Undecidability.TM.Univ.LookupAssociativeListTM]
xs:116 [in Undecidability.TM.Univ.LookupAssociativeListTM]
xs:117 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
xs:12 [in Undecidability.L.Prelim.MoreBase]
xs:12 [in Undecidability.TM.PrettyBounds.MaxList]
xs:120 [in Undecidability.TM.Univ.LookupAssociativeListTM]
xs:123 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
xs:123 [in Undecidability.TM.Util.TM_facts]
xs:126 [in Undecidability.TM.Util.TM_facts]
xs:128 [in Undecidability.TM.Univ.LookupAssociativeListTM]
xs:129 [in Undecidability.TM.Util.TM_facts]
xs:13 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds_Loop]
xs:130 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
xs:132 [in Undecidability.TM.Util.TM_facts]
xs:133 [in Complexity.TM.PrettyBounds.BaseCode]
xs:133 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
xs:134 [in Undecidability.TM.Univ.LookupAssociativeListTM]
xs:136 [in Undecidability.TM.Util.TM_facts]
xs:139 [in Undecidability.TM.Util.TM_facts]
xs:14 [in Undecidability.TM.Compound.TMTac]
xs:14 [in Undecidability.L.Datatypes.Lists]
xs:14 [in Undecidability.TM.Code.BinNumbers.EncodeBinNumbers]
xs:14 [in Undecidability.TM.Code.CompareValue]
xs:14 [in Undecidability.Shared.Libs.PSL.Vectors.VectorDupfree]
xs:141 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
xs:143 [in Undecidability.TM.Util.TM_facts]
xs:145 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
xs:146 [in Undecidability.TM.Util.TM_facts]
xs:147 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
xs:15 [in Undecidability.TM.Code.List.Length]
xs:15 [in Complexity.TM.PrettyBounds.BaseCodeSpace]
xs:15 [in Undecidability.TM.PrettyBounds.MaxList]
xs:15 [in Undecidability.TM.Code.List.App]
xs:150 [in Undecidability.TM.Univ.LookupAssociativeListTM]
xs:151 [in Undecidability.TM.Univ.LookupAssociativeListTM]
xs:152 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
xs:156 [in Undecidability.TM.Code.Code]
xs:157 [in Undecidability.TM.Univ.LookupAssociativeListTM]
xs:158 [in Undecidability.TM.Code.Code]
xs:16 [in Undecidability.TM.Code.List.Concat_Repeat]
xs:17 [in Undecidability.TM.Code.List.App]
xs:173 [in Undecidability.TM.Code.Code]
xs:178 [in Undecidability.TM.Code.Code]
xs:18 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
xs:18 [in Undecidability.TM.Compound.TMTac]
xs:18 [in Complexity.L.TM.TMflatComp]
xs:18 [in Undecidability.TM.Univ.LookupAssociativeListTM]
xs:18 [in Undecidability.TM.PrettyBounds.MaxList]
xs:182 [in Undecidability.TM.Code.Code]
xs:184 [in Undecidability.TM.Code.Code]
xs:185 [in Undecidability.TM.Code.Code]
xs:186 [in Undecidability.TM.Code.Code]
xs:187 [in Undecidability.TM.Code.Code]
xs:188 [in Undecidability.TM.Code.Code]
xs:19 [in Undecidability.L.Datatypes.List.List_basics]
xs:19 [in Complexity.TM.PrettyBounds.UnivBounds]
xs:19 [in Undecidability.TM.Code.List.Rev]
xs:19 [in Undecidability.TM.Code.List.App]
xs:191 [in Undecidability.TM.Code.Code]
xs:192 [in Complexity.TM.PrettyBounds.M2MBounds]
xs:192 [in Undecidability.TM.Code.Code]
xs:194 [in Undecidability.TM.Code.Code]
xs:195 [in Undecidability.TM.Code.Code]
xs:197 [in Undecidability.TM.Code.Code]
xs:2 [in Undecidability.TM.Code.CaseList]
xs:2 [in Undecidability.TM.Single.StepTM]
xs:2 [in Undecidability.TM.Code.CaseNat]
xs:2 [in Undecidability.TM.PrettyBounds.SizeBounds]
xs:2 [in Complexity.TM.PrettyBounds.SpaceBounds]
xs:2 [in Undecidability.TM.Code.CaseSum]
xs:201 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
xs:209 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
xs:218 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
xs:219 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
xs:22 [in Undecidability.TM.Compound.TMTac]
xs:22 [in Undecidability.TM.PrettyBounds.MaxList]
xs:225 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
xs:229 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
xs:23 [in Undecidability.TM.Code.List.Concat_Repeat]
xs:23 [in Undecidability.TM.Code.List.Rev]
xs:23 [in Complexity.L.TM.TMflatComp]
xs:238 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
xs:24 [in Undecidability.TM.Code.List.Nth]
xs:24 [in Undecidability.TM.PrettyBounds.MaxList]
xs:240 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
xs:243 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
xs:247 [in Complexity.TM.PrettyBounds.M2MBounds]
xs:247 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
xs:25 [in Undecidability.TM.Code.List.Length]
xs:25 [in Undecidability.TM.Code.List.Rev]
xs:250 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
xs:254 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
xs:27 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
xs:27 [in Undecidability.TM.Code.List.Nth]
xs:27 [in Complexity.TM.PrettyBounds.UnivBounds]
xs:27 [in Undecidability.TM.PrettyBounds.MaxList]
xs:27 [in Undecidability.TM.Compound.WriteString]
xs:29 [in Undecidability.TM.Code.List.Concat_Repeat]
xs:29 [in Undecidability.TM.Code.List.Length]
xs:29 [in Complexity.NP.TM.M_multi2mono]
xs:29 [in Undecidability.TM.Code.List.App]
xs:30 [in Undecidability.TM.Util.VectorPrelim]
xs:30 [in Undecidability.TM.Univ.LookupAssociativeListTM]
xs:30 [in Undecidability.TM.Compound.WriteString]
xs:31 [in Undecidability.Shared.Libs.PSL.Vectors.VectorDupfree]
xs:31 [in Undecidability.TM.Lifting.LiftTapes]
xs:31 [in Undecidability.TM.PrettyBounds.MaxList]
xs:32 [in Undecidability.TM.Code.List.Rev]
xs:32 [in Complexity.L.TM.TMflatFun]
xs:321 [in Undecidability.TM.Single.StepTM]
xs:33 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
xs:33 [in Undecidability.TM.Code.List.App]
xs:331 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
xs:336 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
xs:34 [in Undecidability.TM.Code.List.Length]
xs:34 [in Undecidability.L.Tactics.ComputableDemo]
xs:35 [in Undecidability.Shared.Libs.PSL.Vectors.VectorDupfree]
xs:35 [in Undecidability.TM.Lifting.LiftTapes]
xs:37 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
xs:37 [in Complexity.TM.PrettyBounds.UnivBounds]
xs:37 [in Undecidability.TM.Univ.LookupAssociativeListTM]
xs:37 [in Undecidability.L.Prelim.MoreList]
xs:38 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
xs:38 [in Undecidability.TM.Code.List.Rev]
xs:38 [in Undecidability.TM.PrettyBounds.MaxList]
xs:38 [in Undecidability.L.Prelim.MoreList]
xs:39 [in Undecidability.TM.Code.List.Length]
xs:4 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
xs:4 [in Complexity.TM.PrettyBounds.UnivBounds]
xs:40 [in Undecidability.TM.Util.VectorPrelim]
xs:40 [in Undecidability.Shared.Libs.PSL.Vectors.VectorDupfree]
xs:40 [in Undecidability.TM.Code.List.App]
xs:41 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
xs:41 [in Undecidability.L.Tactics.ComputableDemo]
xs:42 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
xs:42 [in Undecidability.TM.PrettyBounds.MaxList]
xs:43 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
xs:43 [in Undecidability.TM.Util.VectorPrelim]
xs:43 [in Undecidability.Shared.Libs.PSL.Lists.Position]
xs:43 [in Undecidability.TM.Code.List.Rev]
xs:43 [in Undecidability.Shared.Libs.PSL.Vectors.VectorDupfree]
xs:43 [in Undecidability.TM.Code.List.App]
xs:45 [in Undecidability.TM.Code.List.Rev]
xs:45 [in Undecidability.Shared.Libs.PSL.Vectors.VectorDupfree]
xs:45 [in Undecidability.TM.PrettyBounds.MaxList]
xs:45 [in Undecidability.TM.Code.List.App]
xs:46 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
xs:46 [in Undecidability.TM.Univ.LookupAssociativeListTM]
xs:46 [in Undecidability.TM.Code.List.App]
xs:47 [in Complexity.TM.PrettyBounds.UnivBounds]
xs:47 [in Undecidability.TM.Code.List.Length]
xs:48 [in Undecidability.Shared.Libs.PSL.Lists.Position]
xs:48 [in Undecidability.TM.Code.List.Rev]
xs:48 [in Undecidability.Shared.Libs.PSL.Vectors.VectorDupfree]
xs:48 [in Undecidability.TM.Univ.LookupAssociativeListTM]
xs:49 [in Undecidability.TM.Util.VectorPrelim]
xs:49 [in Undecidability.TM.PrettyBounds.MaxList]
xs:5 [in Complexity.TM.PrettyBounds.BaseCode]
xs:5 [in Undecidability.TM.Code.List.Rev]
xs:5 [in Undecidability.TM.PrettyBounds.MaxList]
xs:50 [in Undecidability.Shared.Libs.PSL.Lists.Position]
xs:50 [in Undecidability.TM.PrettyBounds.MaxList]
xs:51 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
xs:51 [in Complexity.TM.Code.Decode]
xs:51 [in Undecidability.Shared.Libs.PSL.Vectors.VectorDupfree]
xs:51 [in Undecidability.TM.Code.BinNumbers.PosShiftTM]
xs:52 [in Undecidability.TM.Code.List.Nth]
xs:52 [in Undecidability.TM.Code.List.Length]
xs:53 [in Undecidability.TM.Util.VectorPrelim]
xs:53 [in Undecidability.Shared.Libs.PSL.Lists.Position]
xs:53 [in Undecidability.TM.Code.List.Rev]
xs:53 [in Undecidability.TM.PrettyBounds.MaxList]
xs:55 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
xs:56 [in Undecidability.L.Datatypes.List.List_basics]
xs:56 [in Complexity.NP.TM.M_multi2mono]
xs:57 [in Undecidability.TM.Code.List.Concat_Repeat]
xs:57 [in Complexity.TM.PrettyBounds.UnivBounds]
xs:57 [in Undecidability.TM.Util.VectorPrelim]
xs:57 [in Undecidability.TM.Code.List.Length]
xs:57 [in Undecidability.Shared.Libs.PSL.Vectors.VectorDupfree]
xs:57 [in Undecidability.TM.PrettyBounds.MaxList]
xs:58 [in Undecidability.TM.Code.List.Nth]
xs:58 [in Undecidability.TM.Code.List.Rev]
xs:59 [in Undecidability.L.Datatypes.List.List_basics]
xs:59 [in Complexity.TM.PrettyBounds.BaseCodeSpace]
xs:59 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
xs:59 [in Complexity.TM.PrettyBounds.PrettyBounds]
xs:6 [in Undecidability.TM.Single.StepTM]
xs:60 [in Undecidability.TM.Code.List.Length]
xs:60 [in Undecidability.TM.Univ.LookupAssociativeListTM]
xs:61 [in Undecidability.L.Datatypes.List.List_basics]
xs:61 [in Undecidability.TM.Code.List.Rev]
xs:61 [in Undecidability.TM.PrettyBounds.MaxList]
xs:62 [in Undecidability.TM.Code.List.Nth]
xs:62 [in Undecidability.TM.Code.List.Rev]
xs:62 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
xs:63 [in Undecidability.TM.Code.List.App]
xs:64 [in Undecidability.TM.PrettyBounds.MaxList]
xs:65 [in Complexity.TM.PrettyBounds.BaseCodeSpace]
xs:65 [in Undecidability.TM.PrettyBounds.MaxList]
xs:67 [in Undecidability.TM.Code.List.Nth]
xs:67 [in Complexity.TM.PrettyBounds.UnivBounds]
xs:67 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
xs:67 [in Undecidability.TM.PrettyBounds.MaxList]
xs:68 [in Undecidability.TM.Code.List.Length]
xs:69 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
xs:69 [in Complexity.TM.PrettyBounds.PrettyBounds]
xs:7 [in Undecidability.L.Datatypes.List.List_basics]
xs:7 [in Complexity.TM.PrettyBounds.SpaceBounds]
xs:7 [in Complexity.L.TM.TMflatComp]
xs:70 [in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
xs:71 [in Undecidability.TM.Code.List.Length]
xs:71 [in Complexity.TM.PrettyBounds.BaseCodeSpace]
xs:71 [in Undecidability.TM.Univ.LookupAssociativeListTM]
xs:71 [in Undecidability.TM.PrettyBounds.MaxList]
xs:72 [in Undecidability.TM.Code.List.Nth]
xs:73 [in Undecidability.TM.PrettyBounds.MaxList]
xs:74 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
xs:74 [in Undecidability.TM.Univ.LookupAssociativeListTM]
xs:75 [in Complexity.TM.PrettyBounds.BaseCode]
xs:75 [in Undecidability.TM.Code.CaseList]
xs:76 [in Undecidability.TM.Code.List.Nth]
xs:76 [in Complexity.TM.PrettyBounds.UnivBounds]
xs:76 [in Undecidability.TM.PrettyBounds.MaxList]
xs:78 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
xs:78 [in Undecidability.TM.PrettyBounds.MaxList]
xs:78 [in Complexity.Libs.CookPrelim.MorePrelim]
xs:79 [in Undecidability.TM.PrettyBounds.MaxList]
xs:8 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
xs:8 [in Complexity.TM.PrettyBounds.UnivBounds]
xs:8 [in Undecidability.TM.Code.CompareValue]
xs:8 [in Undecidability.TM.Code.CasePair]
xs:8 [in Undecidability.TM.Code.List.App]
xs:80 [in Undecidability.TM.Code.List.Nth]
xs:80 [in Undecidability.TM.Univ.LookupAssociativeListTM]
xs:81 [in Complexity.TM.PrettyBounds.BaseCode]
xs:81 [in Undecidability.TM.PrettyBounds.MaxList]
xs:84 [in Complexity.TM.PrettyBounds.BaseCode]
xs:84 [in Undecidability.TM.Code.List.Nth]
xs:84 [in Undecidability.TM.Univ.LookupAssociativeListTM]
xs:84 [in Undecidability.TM.PrettyBounds.MaxList]
xs:85 [in Complexity.TM.PrettyBounds.UnivBounds]
xs:85 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
xs:88 [in Undecidability.TM.Compound.Compare]
xs:89 [in Undecidability.TM.Code.List.Nth]
xs:89 [in Undecidability.TM.Univ.LookupAssociativeListTM]
xs:89 [in Undecidability.TM.PrettyBounds.MaxList]
xs:9 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds_Loop]
xs:9 [in Complexity.TM.PrettyBounds.SpaceBounds]
xs:9 [in Undecidability.TM.Code.BinNumbers.EncodeBinNumbers]
xs:9 [in Complexity.TM.PrettyBounds.BaseCodeSpace]
xs:9 [in Undecidability.TM.Univ.LookupAssociativeListTM]
xs:91 [in Complexity.TM.PrettyBounds.BaseCode]
xs:92 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
xs:94 [in Complexity.TM.PrettyBounds.BaseCode]
xs:94 [in Undecidability.TM.Code.List.Nth]
xs:94 [in Complexity.TM.PrettyBounds.UnivBounds]
xs:94 [in Undecidability.TM.Univ.LookupAssociativeListTM]
xs:96 [in Complexity.TM.PrettyBounds.BaseCode]
xs:96 [in Complexity.TM.PrettyBounds.BaseCodeSpace]
xs:98 [in Undecidability.TM.Code.List.Nth]
xs:98 [in Undecidability.TM.Univ.LookupAssociativeListTM]
xTime:9 [in Undecidability.L.Tactics.ComputableTime]
xT:10 [in Undecidability.L.Tactics.ComputableTactics]
xT:160 [in Undecidability.L.Tactics.ComputableTime]
xT:186 [in Undecidability.L.Tactics.ComputableTime]
xT:19 [in Undecidability.L.Datatypes.LNat]
xT:3 [in Undecidability.L.Datatypes.LNat]
xT:43 [in Undecidability.L.Tactics.Lrewrite]
xT:6 [in Undecidability.L.Tactics.ComputableTactics]
xT:70 [in Undecidability.L.Tactics.ComputableTime]
xT:8 [in Undecidability.L.Tactics.ComputableTactics]
xT:80 [in Undecidability.L.Tactics.ComputableTime]
xt:83 [in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
xT:86 [in Undecidability.L.Tactics.ComputableTime]
xT:9 [in Undecidability.L.Datatypes.LNat]
xxx:81 [in Undecidability.L.Complexity.UpToCNary]
xy:11 [in Undecidability.Shared.embed_nat]
xy:124 [in Complexity.L.TM.TMflatComp]
X__cert:12 [in Complexity.NP.L.CanEnumTerm_def]
X__cert:1 [in Complexity.NP.L.CanEnumTerm_def]
X__cert:1 [in Complexity.NP.L.GenNP_is_hard]
X_encodable:119 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
x__tl:38 [in Complexity.TM.Code.Decode]
x__hd:37 [in Complexity.TM.Code.Decode]
x__last:33 [in Complexity.TM.Code.Decode]
x__init:32 [in Complexity.TM.Code.Decode]
x__tl:31 [in Complexity.TM.Code.Decode]
x__hd:30 [in Complexity.TM.Code.Decode]
X_encodable:160 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
X_encodable:156 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
X_encodable:6 [in Complexity.NP.SAT.CookLevin.Reductions.FlatTCC_to_FlatCC]
X__cert:1 [in Complexity.NP.L.GenNP]
x':100 [in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
x':1001 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
x':105 [in Undecidability.L.Tactics.Computable]
x':109 [in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
x':11 [in Undecidability.L.Functions.UnboundIteration]
x':110 [in Complexity.L.TM.TMflatComp]
x':110 [in Undecidability.L.Tactics.Computable]
x':12 [in Complexity.TM.Single.DecodeTape]
x':123 [in Complexity.L.TM.TMunflatten]
x':14 [in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
x':142 [in Undecidability.L.Tactics.ComputableTime]
x':144 [in Complexity.L.TM.TMunflatten]
x':146 [in Complexity.L.TM.TMunflatten]
x':148 [in Undecidability.L.Tactics.ComputableTime]
x':15 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
x':15 [in Undecidability.Synthetic.Infinite]
x':151 [in Complexity.L.TM.TMflatComp]
x':17 [in Complexity.TM.PrettyBounds.UnivBounds]
x':171 [in Complexity.L.TM.TMflatComp]
x':18 [in Undecidability.L.Datatypes.List.List_eqb]
x':180 [in Complexity.L.TM.TMflatComp]
x':19 [in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
x':191 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
X':2 [in Undecidability.TM.Univ.LowLevel]
x':21 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
x':21 [in Complexity.HierarchyTheorem.TimeHierarchyTheorem]
x':21 [in Undecidability.Shared.Libs.DLW.Vec.pos]
x':26 [in Undecidability.L.Functions.EqBool]
x':28 [in Undecidability.TM.Univ.LookupAssociativeListTM]
x':283 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x':287 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x':3 [in Complexity.Complexity.Monotonic]
x':30 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
x':32 [in Undecidability.L.Tactics.ComputableTactics]
x':33 [in Undecidability.L.Prelim.LoopSum]
X':33 [in Undecidability.TM.Univ.LowLevel]
x':334 [in Undecidability.TM.Hoare.HoareCombinators]
x':37 [in Complexity.L.AbstractMachines.Computable.EvalForTime]
x':375 [in Undecidability.TM.Hoare.HoareCombinators]
x':38 [in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
x':394 [in Undecidability.TM.Hoare.HoareCombinators]
x':40 [in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
X':428 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x':439 [in Undecidability.TM.Hoare.HoareCombinators]
x':44 [in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
x':44 [in Undecidability.Shared.Libs.PSL.FiniteTypes.Arbitrary]
x':45 [in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
x':461 [in Undecidability.TM.Hoare.HoareCombinators]
x':5 [in Complexity.TM.Code.Decode]
x':5 [in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
x':53 [in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
x':54 [in Undecidability.L.Prelim.ARS]
x':61 [in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
x':633 [in Complexity.NP.TM.LM_to_mTM]
x':634 [in Complexity.NP.TM.LM_to_mTM]
x':66 [in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
x':68 [in Complexity.L.AbstractMachines.Computable.EvalForTime]
x':68 [in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
x':73 [in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
x':74 [in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
x':78 [in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
x':8 [in Complexity.TM.Single.DecodeTape]
x':83 [in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
x':84 [in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
x':96 [in Complexity.Libs.CookPrelim.FlatFinTypes]
x':98 [in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
x':996 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
x0':111 [in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
x0':124 [in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
x0':62 [in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
x0:103 [in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
x0:105 [in Undecidability.L.Computability.Synthetic]
x0:106 [in Undecidability.L.Computability.Synthetic]
x0:108 [in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
x0:110 [in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
x0:113 [in Undecidability.L.Computability.Synthetic]
x0:114 [in Undecidability.L.Computability.Synthetic]
x0:116 [in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
x0:120 [in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
x0:123 [in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
x0:14 [in Undecidability.Shared.Libs.PSL.FiniteTypes.DepPairs]
x0:17 [in Complexity.L.AbstractMachines.Computable.Unfolding]
x0:17 [in Undecidability.Shared.Libs.PSL.FiniteTypes.DepPairs]
x0:22 [in Complexity.Complexity.ONotationIsAppropriate]
x0:24 [in Complexity.L.AbstractMachines.Computable.Unfolding]
x0:35 [in Undecidability.L.Functions.UnboundIteration]
x0:3581 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
x0:3583 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
x0:3584 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
x0:3587 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
x0:3588 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
x0:3590 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
x0:51 [in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
x0:53 [in Undecidability.L.Functions.UnboundIteration]
x0:542 [in Complexity.NP.TM.LM_to_mTM]
x0:543 [in Complexity.NP.TM.LM_to_mTM]
x0:544 [in Complexity.NP.TM.LM_to_mTM]
x0:545 [in Complexity.NP.TM.LM_to_mTM]
x0:57 [in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
x0:61 [in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
x0:7 [in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
x0:74 [in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
x0:76 [in Complexity.NP.TM.LM_to_mTM]
x0:78 [in Complexity.NP.TM.LM_to_mTM]
x0:80 [in Complexity.NP.TM.LM_to_mTM]
x0:82 [in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
x0:82 [in Complexity.NP.TM.LM_to_mTM]
x1:105 [in Undecidability.TM.Util.Relations]
x1:11 [in Undecidability.L.Datatypes.LProd]
x1:127 [in Undecidability.TM.Compound.Compare]
x1:135 [in Undecidability.TM.Compound.Compare]
x1:137 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
x1:138 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
x1:139 [in Complexity.TM.PrettyBounds.BaseCode]
x1:169 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x1:177 [in Complexity.Libs.CookPrelim.FlatFinTypes]
x1:18 [in Undecidability.Shared.Libs.DLW.Utils.quotient]
x1:187 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
x1:19 [in Undecidability.Shared.Libs.PSL.Retracts]
x1:19 [in Undecidability.TM.Code.CompareValue]
x1:198 [in Complexity.Libs.CookPrelim.MorePrelim]
x1:203 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
x1:21 [in Undecidability.L.Datatypes.LProd]
x1:214 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
x1:23 [in Complexity.TM.PrettyBounds.PrettyBounds]
x1:26 [in Undecidability.TM.Code.CompareValue]
x1:2649 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
x1:3 [in Undecidability.TM.Code.CompareValue]
x1:3 [in Undecidability.TM.Code.Copy]
x1:3231 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
x1:33 [in Undecidability.Shared.Libs.DLW.Utils.quotient]
x1:34 [in Undecidability.TM.Code.CompareValue]
x1:349 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x1:3572 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
x1:3585 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
x1:3589 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
x1:3591 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
x1:38 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds_Loop]
x1:38 [in Undecidability.TM.Code.CompareValue]
x1:4 [in Complexity.Libs.UniformHomomorphisms]
x1:569 [in Complexity.NP.TM.LM_to_mTM]
x1:570 [in Complexity.NP.TM.LM_to_mTM]
x1:62 [in Undecidability.Shared.Libs.DLW.Utils.quotient]
x1:63 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x1:64 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x1:65 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x1:66 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x1:67 [in Complexity.Libs.CookPrelim.FlatFinTypes]
x1:81 [in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
x1:82 [in Undecidability.TM.Code.Code]
x1:9 [in Complexity.TM.PrettyBounds.PrettyBounds]
x1:91 [in Undecidability.TM.Code.Code]
x2:10 [in Complexity.TM.PrettyBounds.PrettyBounds]
x2:106 [in Undecidability.TM.Util.Relations]
x2:128 [in Undecidability.TM.Compound.Compare]
x2:13 [in Undecidability.L.Datatypes.LProd]
x2:136 [in Undecidability.TM.Compound.Compare]
x2:138 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
x2:139 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
x2:140 [in Complexity.TM.PrettyBounds.BaseCode]
x2:172 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x2:188 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
x2:19 [in Undecidability.Shared.Libs.DLW.Utils.quotient]
x2:199 [in Complexity.Libs.CookPrelim.MorePrelim]
x2:20 [in Undecidability.Shared.Libs.PSL.Retracts]
x2:20 [in Undecidability.TM.Code.CompareValue]
x2:204 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
x2:215 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
x2:22 [in Undecidability.L.Datatypes.LProd]
x2:24 [in Complexity.TM.PrettyBounds.PrettyBounds]
x2:2650 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
x2:27 [in Undecidability.TM.Code.CompareValue]
x2:3232 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
x2:34 [in Undecidability.Shared.Libs.DLW.Utils.quotient]
x2:35 [in Undecidability.TM.Code.CompareValue]
x2:351 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x2:3573 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
x2:3592 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
x2:39 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds_Loop]
x2:39 [in Undecidability.TM.Code.CompareValue]
x2:4 [in Undecidability.TM.Code.CompareValue]
x2:4 [in Undecidability.TM.Code.Copy]
x2:5 [in Complexity.Libs.UniformHomomorphisms]
x2:63 [in Undecidability.Shared.Libs.DLW.Utils.quotient]
x2:68 [in Complexity.Libs.CookPrelim.FlatFinTypes]
x2:82 [in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
x2:83 [in Undecidability.TM.Code.Code]
x2:92 [in Undecidability.TM.Code.Code]
x3:140 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
x3:189 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
x3:205 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
x3:216 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
x3:2651 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
x3:3233 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
x3:3574 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
x4:141 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
x4:190 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
x4:206 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
x4:217 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
x4:2652 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
x4:3234 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
x4:3575 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
x5:142 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
x5:191 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
x5:207 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
x5:218 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
x5:2653 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
x5:3235 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
x5:3576 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
x6:143 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
x6:192 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
x6:208 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
x6:219 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
x6:2654 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
x6:3236 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
x6:3577 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
X:1 [in Undecidability.Shared.Libs.PSL.Tactics.Tactics]
x:1 [in Undecidability.L.Prelim.ARS]
X:1 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
X:1 [in Undecidability.Shared.Libs.DLW.Utils.fin_dec]
X:1 [in Undecidability.TM.Code.CaseList]
x:1 [in Complexity.L.Datatypes.LBinNums]
X:1 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
X:1 [in Complexity.Complexity.EncodableP]
X:1 [in Undecidability.Synthetic.SemiDecidabilityFacts]
X:1 [in Undecidability.L.Datatypes.List.List_basics]
X:1 [in Undecidability.L.Complexity.UpToCNary]
X:1 [in Undecidability.TM.Single.StepTM]
X:1 [in Undecidability.Shared.Libs.PSL.Prelim]
X:1 [in Undecidability.TM.Code.CaseNat]
X:1 [in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
X:1 [in Undecidability.Shared.Libs.PSL.EqDec]
X:1 [in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
X:1 [in Undecidability.TM.Util.VectorPrelim]
X:1 [in Undecidability.Synthetic.EnumerabilityFacts]
X:1 [in Undecidability.L.Prelim.LoopSum]
X:1 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
X:1 [in Undecidability.Shared.FinTypeEquiv]
X:1 [in Undecidability.Shared.Libs.DLW.Utils.quotient]
X:1 [in Undecidability.L.Datatypes.Lists]
X:1 [in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
X:1 [in Complexity.Libs.CookPrelim.FlatFinTypes]
X:1 [in Complexity.Complexity.Subtypes]
X:1 [in Undecidability.Shared.Libs.PSL.Inhabited]
X:1 [in Complexity.L.Functions.IterupN]
X:1 [in Complexity.Complexity.LinTimeDecodable]
x:1 [in Undecidability.L.Tactics.ComputableDemo]
x:1 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
X:1 [in Undecidability.L.Datatypes.LVector]
X:1 [in Undecidability.L.Complexity.UpToC]
X:1 [in Complexity.L.TM.TapeDecode]
X:1 [in Undecidability.L.Datatypes.List.List_nat]
X:1 [in Complexity.Libs.CookPrelim.PolyBounds]
X:1 [in Undecidability.TM.Code.CompareValue]
X:1 [in Undecidability.TM.Univ.LowLevel]
X:1 [in Undecidability.Shared.Libs.DLW.Utils.sums]
x:1 [in Complexity.Complexity.UpToCPoly]
X:1 [in Undecidability.TM.Code.CaseSum]
X:1 [in Undecidability.L.Datatypes.LFinType]
X:1 [in Undecidability.Synthetic.Undecidability]
x:1 [in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicFinTypes]
X:1 [in Undecidability.L.Functions.EqBool]
X:1 [in Undecidability.Shared.Libs.DLW.Utils.fin_base]
X:1 [in Undecidability.Synthetic.MoreEnumerabilityFacts]
X:1 [in Undecidability.Synthetic.Definitions]
X:1 [in Undecidability.TM.Util.Relations]
X:1 [in Complexity.L.TM.TMflatten]
X:1 [in Complexity.TM.Compound.MoveToSymbol_niceSpec]
X:1 [in Undecidability.Synthetic.InformativeDefinitions]
X:1 [in Undecidability.Shared.Libs.PSL.Lists.Dupfree]
X:1 [in Undecidability.Synthetic.ListEnumerabilityFacts]
X:1 [in Undecidability.TM.Code.Copy]
X:1 [in Undecidability.Synthetic.DecidabilityFacts]
X:1 [in Undecidability.Shared.Libs.PSL.Vectors.VectorDupfree]
X:1 [in Undecidability.Shared.Dec]
x:1 [in Complexity.L.Functions.BinNumsCompare]
X:1 [in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
X:1 [in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
X:1 [in Complexity.NP.TM.L_to_LM]
X:1 [in Complexity.Complexity.Definitions]
X:1 [in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
X:1 [in Undecidability.L.Functions.Decoding]
x:1 [in Undecidability.L.Datatypes.LNat]
X:1 [in Undecidability.L.Complexity.LinDecode.LTD_def]
X:1 [in Complexity.Complexity.PolyTimeComputable]
x:1 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
x:1 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
X:1 [in Undecidability.L.Tactics.Computable]
x:1 [in Complexity.L.AbstractMachines.Computable.LargestVar]
X:1 [in Undecidability.L.Complexity.LinDecode.LTDlist]
x:10 [in Complexity.Libs.Pigeonhole]
X:10 [in Complexity.TM.PrettyBounds.BaseCode]
x:10 [in Undecidability.Shared.Libs.DLW.Utils.fin_dec]
x:10 [in Undecidability.Synthetic.InformativeReducibilityFacts]
X:10 [in Undecidability.L.Datatypes.List.List_basics]
X:10 [in Undecidability.L.Tactics.Extract]
X:10 [in Complexity.TM.Code.Decode]
x:10 [in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
x:10 [in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
x:10 [in Undecidability.TM.Code.List.Length]
X:10 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
X:10 [in Undecidability.Shared.FinTypeEquiv]
x:10 [in Undecidability.Shared.Libs.DLW.Utils.quotient]
X:10 [in Undecidability.Shared.Libs.PSL.FiniteTypes.VectorFin]
x:10 [in Undecidability.L.Tactics.ComputableDemo]
X:10 [in Undecidability.L.Complexity.UpToC]
x:10 [in Complexity.NP.L.GenNPBool]
x:10 [in Undecidability.Shared.Libs.DLW.Utils.fin_upto]
X:10 [in Undecidability.TM.Code.WriteValue]
x:10 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
x:10 [in Undecidability.Shared.Libs.DLW.Utils.php]
X:10 [in Undecidability.L.Datatypes.LFinType]
X:10 [in Undecidability.L.Functions.EqBool]
x:10 [in Undecidability.Synthetic.MoreEnumerabilityFacts]
X:10 [in Undecidability.Synthetic.Definitions]
X:10 [in Undecidability.Synthetic.InformativeDefinitions]
x:10 [in Undecidability.Shared.Libs.DLW.Wf.wf_finite]
X:10 [in Undecidability.Synthetic.ListEnumerabilityFacts]
x:10 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
x:10 [in Undecidability.Shared.Libs.PSL.Vectors.VectorDupfree]
x:10 [in Undecidability.L.Functions.Proc]
x:10 [in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
x:10 [in Undecidability.Synthetic.Infinite]
X:10 [in Undecidability.Shared.Libs.PSL.FiniteTypes.Cardinality]
x:10 [in Undecidability.Shared.Libs.DLW.Utils.seteq]
X:10 [in Complexity.Complexity.PolyTimeComputable]
x:10 [in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
x:10 [in Undecidability.TM.PrettyBounds.MaxList]
x:10 [in Undecidability.Synthetic.ReducibilityFacts]
x:10 [in Undecidability.TM.Hoare.HoareExamples]
x:10 [in Undecidability.Shared.Libs.PSL.FiniteTypes.FiniteFunction]
x:10 [in Undecidability.L.Computability.Scott]
X:100 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:100 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:100 [in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
x:100 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
x:100 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
x:100 [in Undecidability.L.Complexity.UpToC]
X:100 [in Undecidability.TM.Util.Relations]
X:100 [in Undecidability.Synthetic.ListEnumerabilityFacts]
x:100 [in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
x:1003 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
X:101 [in Undecidability.TM.Code.List.Nth]
x:101 [in Complexity.TM.PrettyBounds.UnivBounds]
x:101 [in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
x:101 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:101 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:101 [in Complexity.TM.PrettyBounds.BaseCodeSpace]
X:101 [in Complexity.L.TM.TMflatComp]
x:101 [in Undecidability.TM.Code.CodeTM]
x:101 [in Complexity.Complexity.UpToCPoly]
x:101 [in Undecidability.Shared.Libs.DLW.Utils.php]
x:101 [in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
x:101 [in Undecidability.L.Computability.Synthetic]
x:101 [in Undecidability.TM.Util.TM_facts]
x:101 [in Undecidability.TM.Univ.LookupAssociativeListTM]
x:1012 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
x:1015 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
X:102 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
x:102 [in Undecidability.L.Complexity.UpToCNary]
X:102 [in Complexity.TM.PrettyBounds.UnivBounds]
x:102 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:102 [in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
X:102 [in Complexity.Libs.CookPrelim.FlatFinTypes]
X:102 [in Complexity.L.ComparisonTimeBoundDerivation]
x:102 [in Complexity.L.TM.CompCode]
x:102 [in Complexity.Complexity.UpToCPoly]
x:102 [in Complexity.L.TM.TMunflatten]
X:102 [in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
x:102 [in Complexity.TM.Single.DecodeTape]
X:102 [in Undecidability.L.Tactics.Computable]
x:102 [in Complexity.TM.PrettyBounds.PrettyBounds]
x:103 [in Undecidability.TM.Single.StepTM]
x:103 [in Complexity.TM.PrettyBounds.UnivBounds]
X:103 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:103 [in Complexity.NP.TM.mTM_to_singleTapeTM]
X:103 [in Undecidability.TM.Util.Prelim]
X:103 [in Complexity.NP.SAT.SAT_inNP]
X:103 [in Undecidability.Shared.Libs.DLW.Utils.php]
x:103 [in Complexity.L.TM.TMunflatten]
x:103 [in Undecidability.TM.Compound.Compare]
x:103 [in Undecidability.Synthetic.ListEnumerabilityFacts]
x:103 [in Undecidability.L.Computability.Synthetic]
x:103 [in Complexity.Complexity.PolyTimeComputable]
x:103 [in Complexity.NP.TM.LM_to_mTM]
X:103 [in Complexity.Libs.CookPrelim.MorePrelim]
X:104 [in Complexity.TM.PrettyBounds.BaseCode]
x:104 [in Undecidability.TM.Code.CaseList]
x:104 [in Complexity.TM.PrettyBounds.UnivBounds]
x:104 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:104 [in Complexity.NP.TM.mTM_to_singleTapeTM]
X:104 [in Complexity.L.ComparisonTimeBoundDerivation]
x:104 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
x:104 [in Undecidability.TM.Code.CodeTM]
X:104 [in Undecidability.Shared.Libs.DLW.Utils.fin_base]
x:104 [in Undecidability.TM.Code.Copy]
x:104 [in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
x:104 [in Undecidability.TM.Util.TM_facts]
x:104 [in Complexity.Complexity.PolyTimeComputable]
x:104 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
x:104 [in Undecidability.L.Tactics.Computable]
X:104 [in Complexity.NP.TM.LM_to_mTM]
x:105 [in Undecidability.TM.Code.CaseList]
X:105 [in Undecidability.TM.Single.StepTM]
X:105 [in Complexity.TM.PrettyBounds.UnivBounds]
x:105 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:105 [in Undecidability.TM.Univ.LookupAssociativeListTM]
X:105 [in Complexity.Complexity.PolyTimeComputable]
x:105 [in Complexity.TM.PrettyBounds.PrettyBounds]
x:106 [in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
x:106 [in Undecidability.L.Complexity.UpToCNary]
X:106 [in Undecidability.TM.Code.List.Nth]
x:106 [in Complexity.NP.TM.mTM_to_singleTapeTM]
X:106 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
x:106 [in Undecidability.TM.Util.Prelim]
x:106 [in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
x:107 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
X:107 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:107 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:107 [in Undecidability.TM.Util.Prelim]
X:107 [in Complexity.Libs.CookPrelim.FlatFinTypes]
x:107 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
x:107 [in Complexity.L.TM.TMflatComp]
X:107 [in Undecidability.TM.Util.Relations]
x:107 [in Undecidability.Synthetic.ListEnumerabilityFacts]
x:107 [in Undecidability.TM.Code.Copy]
x:107 [in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
X:107 [in Undecidability.L.Computability.Synthetic]
x:107 [in Complexity.TM.Single.DecodeTape]
x:107 [in Complexity.Complexity.PolyTimeComputable]
X:107 [in Undecidability.L.Tactics.Computable]
x:107 [in Complexity.Complexity.NP]
X:108 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
x:108 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:108 [in Complexity.Libs.CookPrelim.FlatFinTypes]
X:108 [in Complexity.L.ComparisonTimeBoundDerivation]
x:108 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
x:108 [in Complexity.TM.PrettyBounds.BaseCodeSpace]
x:108 [in Undecidability.Shared.Libs.DLW.Utils.fin_base]
x:108 [in Undecidability.Synthetic.ListEnumerabilityFacts]
x:108 [in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
x:108 [in Complexity.Complexity.PolyTimeComputable]
x:108 [in Complexity.Complexity.NP]
X:109 [in Complexity.TM.PrettyBounds.UnivBounds]
x:109 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:109 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
x:109 [in Complexity.Libs.CookPrelim.FlatFinTypes]
X:109 [in Complexity.NP.SAT.SAT_inNP]
x:109 [in Undecidability.Shared.Libs.DLW.Utils.php]
X:109 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
x:109 [in Complexity.Complexity.PolyTimeComputable]
x:109 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
x:109 [in Undecidability.L.Tactics.Computable]
x:109 [in Complexity.Complexity.NP]
X:109 [in Complexity.NP.TM.LM_to_mTM]
X:109 [in Complexity.Libs.CookPrelim.MorePrelim]
x:11 [in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
x:11 [in Undecidability.Shared.Libs.DLW.Utils.fin_quotient]
x:11 [in Undecidability.Shared.Libs.PSL.FCI]
X:11 [in Undecidability.Shared.Libs.DLW.Utils.fin_dec]
x:11 [in Complexity.NP.L.GenNP_is_hard]
x:11 [in Undecidability.Synthetic.InformativeReducibilityFacts]
X:11 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds_Loop]
x:11 [in Undecidability.L.Computability.Enum]
X:11 [in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
x:11 [in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
x:11 [in Undecidability.TM.Hoare.HoareLegacy]
X:11 [in Undecidability.TM.Code.List.Cons_constant]
x:11 [in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
x:11 [in Undecidability.Synthetic.EnumerabilityFacts]
x:11 [in Undecidability.L.Prelim.LoopSum]
x:11 [in Undecidability.Shared.FinTypeEquiv]
X:11 [in Undecidability.L.Datatypes.Lists]
x:11 [in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
x:11 [in Complexity.Libs.CookPrelim.FlatFinTypes]
x:11 [in Undecidability.TM.Code.BinNumbers.EncodeBinNumbers]
x:11 [in Undecidability.Shared.Libs.DLW.Utils.interval]
x:11 [in Complexity.L.ComparisonTimeBoundDerivation]
x:11 [in Complexity.TM.Single.EncodeTapesInvariants]
X:11 [in Undecidability.L.Prelim.MoreBase]
x:11 [in Undecidability.Shared.Libs.DLW.Wf.acc_irr]
X:11 [in Undecidability.L.Datatypes.LVector]
X:11 [in Undecidability.L.Complexity.UpToC]
x:11 [in Complexity.TM.PrettyBounds.BaseCodeSpace]
X:11 [in Undecidability.L.Datatypes.List.List_nat]
x:11 [in Complexity.Libs.UniformHomomorphisms]
x:11 [in Undecidability.TM.Code.CompareValue]
x:11 [in Complexity.Complexity.UpToCPoly]
X:11 [in Undecidability.L.Datatypes.LFinType]
x:11 [in Undecidability.Shared.Libs.DLW.Utils.fin_base]
x:11 [in Undecidability.Shared.Libs.PSL.FiniteTypes.Arbitrary]
x:11 [in Undecidability.Shared.Libs.PSL.Lists.Power]
X:11 [in Undecidability.TM.Util.Relations]
x:11 [in Undecidability.TM.Code.Copy]
x:11 [in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
x:11 [in Undecidability.L.Datatypes.List.List_in]
x:11 [in Complexity.L.Functions.BinNumsCompare]
x:11 [in Undecidability.L.Functions.Proc]
X:11 [in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
x:11 [in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
x:11 [in Undecidability.TM.Code.Code]
X:11 [in Undecidability.Synthetic.Infinite]
X:11 [in Complexity.Complexity.Definitions]
x:11 [in Complexity.TM.Single.DecodeTape]
x:11 [in Complexity.NP.SAT.CookLevin.Reductions.CC_to_BinaryCC]
x:11 [in Undecidability.Synthetic.ReducibilityFacts]
x:11 [in Undecidability.Shared.Libs.PSL.FiniteTypes.DepPairs]
x:110 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:110 [in Complexity.NP.TM.mTM_to_singleTapeTM]
X:110 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
X:110 [in Complexity.Libs.CookPrelim.FlatFinTypes]
x:110 [in Undecidability.Shared.Libs.DLW.Utils.sums]
x:110 [in Undecidability.TM.Code.Copy]
x:110 [in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
X:110 [in Undecidability.L.Computability.Synthetic]
x:110 [in Undecidability.TM.Univ.LookupAssociativeListTM]
x:110 [in Complexity.Complexity.PolyTimeComputable]
x:110 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
x:110 [in Complexity.Complexity.NP]
x:110 [in Complexity.TM.PrettyBounds.PrettyBounds]
X:111 [in Complexity.TM.PrettyBounds.BaseCode]
x:111 [in Complexity.NP.TM.mTM_to_singleTapeTM]
X:111 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
X:111 [in Complexity.NP.SAT.SAT_inNP]
X:111 [in Undecidability.Shared.Libs.DLW.Utils.php]
x:111 [in Undecidability.Shared.Libs.DLW.Utils.fin_base]
x:111 [in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
x:111 [in Complexity.Complexity.PolyTimeComputable]
x:111 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
X:111 [in Undecidability.L.Tactics.Computable]
x:111 [in Complexity.Complexity.NP]
X:112 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:112 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:112 [in Undecidability.L.Tactics.LClos]
X:112 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
X:112 [in Complexity.L.TM.TMflatComp]
x:112 [in Undecidability.TM.Code.CodeTM]
x:112 [in Undecidability.Shared.Libs.DLW.Utils.fin_base]
x:112 [in Undecidability.TM.Util.Relations]
x:112 [in Undecidability.Synthetic.ListEnumerabilityFacts]
X:112 [in Complexity.Complexity.PolyTimeComputable]
x:112 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
x:112 [in Complexity.Complexity.NP]
x:113 [in Undecidability.Shared.Libs.DLW.Vec.vec]
X:113 [in Complexity.TM.PrettyBounds.UnivBounds]
x:113 [in Complexity.NP.TM.mTM_to_singleTapeTM]
X:113 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
x:113 [in Complexity.TM.PrettyBounds.BaseCodeSpace]
x:113 [in Undecidability.TM.Code.CodeTM]
X:113 [in Complexity.Libs.CookPrelim.PolyBounds]
X:113 [in Complexity.L.TM.TMunflatten]
x:113 [in Undecidability.Shared.Libs.DLW.Utils.fin_base]
x:113 [in Undecidability.Synthetic.ListEnumerabilityFacts]
x:113 [in Undecidability.TM.Code.Copy]
x:113 [in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
X:113 [in Complexity.Complexity.NP]
x:113 [in Complexity.Libs.CookPrelim.MorePrelim]
x:114 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
x:114 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:114 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
x:114 [in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
x:114 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
X:114 [in Complexity.L.ComparisonTimeBoundDerivation]
x:114 [in Undecidability.TM.Code.CodeTM]
X:114 [in Undecidability.Shared.Libs.DLW.Utils.fin_base]
x:114 [in Undecidability.TM.Compound.Compare]
X:114 [in Undecidability.Synthetic.ListEnumerabilityFacts]
x:114 [in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
x:114 [in Undecidability.TM.Hoare.HoareExamples]
x:114 [in Complexity.NP.TM.LM_to_mTM]
x:114 [in Complexity.Libs.CookPrelim.MorePrelim]
X:115 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
X:115 [in Complexity.TM.PrettyBounds.UnivBounds]
x:115 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:115 [in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
X:115 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
X:115 [in Complexity.NP.SAT.SAT_inNP]
x:115 [in Undecidability.Shared.Libs.DLW.Utils.sums]
x:115 [in Undecidability.TM.Univ.LookupAssociativeListTM]
x:115 [in Undecidability.L.Tactics.Computable]
x:115 [in Complexity.NP.TM.LM_to_mTM]
X:116 [in Complexity.TM.PrettyBounds.BaseCode]
x:116 [in Complexity.TM.PrettyBounds.UnivBounds]
X:116 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:116 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:116 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
X:116 [in Undecidability.Shared.Libs.DLW.Utils.php]
x:116 [in Undecidability.Shared.Libs.DLW.Utils.fin_base]
x:116 [in Undecidability.TM.Code.Copy]
x:116 [in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
x:116 [in Complexity.Complexity.PolyTimeComputable]
x:116 [in Undecidability.L.Tactics.Computable]
x:116 [in Undecidability.TM.Hoare.HoareExamples]
x:116 [in Complexity.NP.TM.LM_to_mTM]
x:117 [in Undecidability.Shared.Libs.DLW.Vec.vec]
X:117 [in Complexity.TM.PrettyBounds.UnivBounds]
x:117 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:117 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
x:117 [in Undecidability.L.Tactics.LClos]
X:117 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
X:117 [in Complexity.Libs.CookPrelim.FlatFinTypes]
x:117 [in Undecidability.Shared.Libs.DLW.Utils.sums]
x:117 [in Undecidability.Synthetic.ListEnumerabilityFacts]
X:117 [in Undecidability.L.Tactics.Computable]
x:117 [in Complexity.NP.TM.LM_to_mTM]
x:118 [in Complexity.TM.PrettyBounds.BaseCode]
X:118 [in Undecidability.L.Tactics.Extract]
x:118 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:118 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
X:118 [in Undecidability.Shared.Libs.DLW.Utils.fin_base]
x:118 [in Undecidability.TM.Hoare.HoareExamples]
x:118 [in Complexity.NP.TM.LM_to_mTM]
x:119 [in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
x:119 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
x:119 [in Undecidability.L.Tactics.Extract]
x:119 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:119 [in Undecidability.L.Tactics.LClos]
X:119 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
x:119 [in Complexity.L.TM.TMunflatten]
X:119 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
x:119 [in Undecidability.TM.Code.Copy]
x:119 [in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
x:119 [in Undecidability.TM.Univ.LookupAssociativeListTM]
x:119 [in Undecidability.TM.Compound.Shift]
x:119 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
x:119 [in Complexity.Complexity.NP]
x:119 [in Complexity.NP.TM.LM_to_mTM]
x:12 [in Undecidability.L.Prelim.ARS]
x:12 [in Complexity.TM.PrettyBounds.BaseCode]
x:12 [in Complexity.L.Datatypes.LBinNums]
x:12 [in Complexity.NP.L.GenNP_is_hard]
x:12 [in Undecidability.Shared.FilterFacts]
x:12 [in Undecidability.Shared.Libs.PSL.Lists.Removal]
x:12 [in Undecidability.TM.Code.BinNumbers.PosMultTM]
x:12 [in Undecidability.L.Tactics.Extract]
X:12 [in Complexity.TM.PrettyBounds.UnivBounds]
x:12 [in Undecidability.L.Tactics.ComputableTime]
X:12 [in Undecidability.Shared.Libs.PSL.EqDec]
x:12 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:12 [in Undecidability.TM.Hoare.HoareLegacy]
X:12 [in Undecidability.TM.Util.VectorPrelim]
x:12 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
x:12 [in Undecidability.Shared.Libs.PSL.Lists.Filter]
X:12 [in Undecidability.Shared.Libs.DLW.Utils.quotient]
X:12 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_nat_facts]
X:12 [in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
X:12 [in Complexity.Libs.CookPrelim.FlatFinTypes]
x:12 [in Complexity.L.Functions.IterupN]
X:12 [in Undecidability.L.Complexity.UpToC]
x:12 [in Complexity.NP.L.GenNPBool]
X:12 [in Complexity.Libs.CookPrelim.PolyBounds]
x:12 [in Undecidability.L.Datatypes.LFinType]
x:12 [in Undecidability.L.Functions.EqBool]
X:12 [in Undecidability.Shared.Libs.DLW.Utils.fin_base]
x:12 [in Undecidability.Shared.Libs.PSL.Bijection]
x:12 [in Undecidability.L.Datatypes.List.List_eqb]
x:12 [in Undecidability.Synthetic.ListEnumerabilityFacts]
x:12 [in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
x:12 [in Undecidability.L.Functions.EnumInt]
x:12 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
X:12 [in Undecidability.Shared.Libs.PSL.Vectors.VectorDupfree]
x:12 [in Undecidability.Shared.Libs.PSL.Lists.Cardinality]
x:12 [in Undecidability.L.Computability.Synthetic]
x:12 [in Undecidability.L.Functions.FinTypeLookup]
x:12 [in Complexity.Complexity.Monotonic]
x:12 [in Undecidability.L.Datatypes.LNat]
x:12 [in Complexity.NP.SAT.CookLevin.Reductions.CC_to_BinaryCC]
x:12 [in Undecidability.L.Computability.Scott]
X:12 [in Undecidability.Shared.Libs.PSL.FiniteTypes.CompoundFinTypes]
X:12 [in Undecidability.L.Prelim.MoreList]
x:120 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:120 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
x:120 [in Undecidability.Shared.Libs.DLW.Utils.fin_base]
x:120 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
x:120 [in Complexity.NP.TM.LM_to_mTM]
X:121 [in Complexity.TM.PrettyBounds.BaseCode]
X:121 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
X:121 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:121 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:121 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
X:121 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
X:121 [in Complexity.NP.SAT.SAT_inNP]
X:121 [in Undecidability.TM.Hoare.HoareRegister]
X:121 [in Undecidability.Synthetic.ListEnumerabilityFacts]
X:121 [in Complexity.Complexity.PolyTimeComputable]
x:121 [in Complexity.Complexity.NP]
x:121 [in Undecidability.TM.Hoare.HoareExamples]
x:121 [in Complexity.NP.TM.LM_to_mTM]
x:122 [in Complexity.NP.TM.mTM_to_singleTapeTM]
X:122 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
X:122 [in Complexity.L.ComparisonTimeBoundDerivation]
x:122 [in Complexity.L.TM.TMflatComp]
x:122 [in Undecidability.Shared.Libs.DLW.Utils.php]
x:122 [in Undecidability.TM.Code.Copy]
x:122 [in Undecidability.TM.Util.TM_facts]
x:122 [in Undecidability.Shared.Libs.DLW.Vec.pos]
x:122 [in Complexity.NP.TM.LM_to_mTM]
x:123 [in Complexity.TM.PrettyBounds.BaseCode]
x:123 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:123 [in Complexity.Libs.CookPrelim.FlatFinTypes]
x:123 [in Undecidability.TM.Compound.Compare]
x:123 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
x:123 [in Complexity.NP.TM.LM_to_mTM]
x:124 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:124 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
x:124 [in Undecidability.Shared.Libs.DLW.Utils.sums]
X:124 [in Undecidability.Shared.Libs.DLW.Utils.php]
X:124 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
x:124 [in Undecidability.TM.Code.Code]
X:124 [in Undecidability.TM.Univ.LookupAssociativeListTM]
x:124 [in Complexity.Complexity.NP]
x:124 [in Complexity.NP.TM.LM_to_mTM]
x:125 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
x:125 [in Undecidability.TM.Code.List.Nth]
X:125 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:125 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:125 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
x:125 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
X:125 [in Complexity.L.TM.TMflatComp]
X:125 [in Complexity.L.TM.TMunflatten]
x:125 [in Undecidability.Synthetic.ListEnumerabilityFacts]
x:125 [in Undecidability.TM.Util.TM_facts]
x:125 [in Complexity.Complexity.PolyTimeComputable]
x:125 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
x:125 [in Undecidability.Shared.Libs.DLW.Vec.pos]
x:125 [in Complexity.NP.TM.LM_to_mTM]
x:126 [in Undecidability.Shared.Libs.DLW.Vec.vec]
x:126 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
x:126 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:126 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:126 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
x:126 [in Complexity.L.ComparisonTimeBoundDerivation]
x:126 [in Undecidability.TM.Code.Copy]
x:126 [in Undecidability.Shared.Libs.DLW.Vec.pos]
x:126 [in Complexity.NP.TM.LM_to_mTM]
X:127 [in Undecidability.Shared.Libs.DLW.Vec.vec]
x:127 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:127 [in Undecidability.Shared.Libs.DLW.Utils.sums]
X:127 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
x:127 [in Undecidability.TM.Code.Code]
x:127 [in Undecidability.TM.Compound.Shift]
x:127 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
x:127 [in Complexity.Complexity.NP]
x:127 [in Complexity.NP.TM.LM_to_mTM]
X:128 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
x:128 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:128 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
x:128 [in Undecidability.TM.Compound.MoveToSymbol]
x:128 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
X:128 [in Undecidability.Synthetic.ListEnumerabilityFacts]
x:128 [in Undecidability.TM.Util.TM_facts]
x:128 [in Undecidability.Shared.Libs.DLW.Vec.pos]
x:128 [in Complexity.NP.TM.LM_to_mTM]
x:129 [in Undecidability.L.Tactics.Extract]
X:129 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:129 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:129 [in Undecidability.TM.Compound.MoveToSymbol]
x:129 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
X:129 [in Complexity.NP.SAT.SAT_inNP]
x:129 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
x:129 [in Undecidability.TM.Util.Relations]
x:129 [in Undecidability.TM.Code.Copy]
x:129 [in Undecidability.TM.Univ.LookupAssociativeListTM]
x:129 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
x:129 [in Complexity.Complexity.NP]
x:129 [in Complexity.NP.TM.LM_to_mTM]
X:13 [in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
x:13 [in Undecidability.Shared.Libs.PSL.FCI]
x:13 [in Undecidability.TM.Compound.TMTac]
x:13 [in Undecidability.Synthetic.InformativeReducibilityFacts]
x:13 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
X:13 [in Complexity.Complexity.EncodableP]
X:13 [in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
x:13 [in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
x:13 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
X:13 [in Undecidability.Synthetic.EnumerabilityFacts]
x:13 [in Undecidability.TM.Code.CaseFin]
x:13 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
x:13 [in Undecidability.L.Datatypes.Lists]
X:13 [in Undecidability.TM.Code.BinNumbers.EncodeBinNumbers]
x:13 [in Complexity.Complexity.Subtypes]
x:13 [in Complexity.TM.Single.EncodeTapesInvariants]
X:13 [in Undecidability.L.Complexity.UpToC]
x:13 [in Complexity.TM.PrettyBounds.BaseCodeSpace]
X:13 [in Undecidability.TM.Code.CompareValue]
x:13 [in Undecidability.TM.Univ.LowLevel]
x:13 [in Undecidability.TM.Code.WriteValue]
x:13 [in Complexity.L.Functions.BinNumsSub]
X:13 [in Undecidability.L.Datatypes.LFinType]
x:13 [in Undecidability.L.Tactics.Lbeta_nonrefl]
x:13 [in Undecidability.TM.Code.NatSub]
x:13 [in Undecidability.Shared.Libs.PSL.FiniteTypes.Arbitrary]
x:13 [in Undecidability.Shared.Libs.PSL.Lists.Power]
X:13 [in Undecidability.Synthetic.Definitions]
x:13 [in Undecidability.L.Functions.UnboundIteration]
x:13 [in Undecidability.Shared.Libs.DLW.Wf.wf_finite]
x:13 [in Undecidability.TM.Code.Copy]
x:13 [in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
x:13 [in Undecidability.L.Datatypes.List.List_in]
x:13 [in Complexity.L.Functions.BinNumsCompare]
X:13 [in Undecidability.L.Computability.Synthetic]
X:13 [in Undecidability.Shared.ListAutomation]
X:13 [in Undecidability.L.Datatypes.List.List_fold]
x:13 [in Complexity.Complexity.NP]
x:13 [in Complexity.NP.SAT.CookLevin.Reductions.CC_to_BinaryCC]
x:13 [in Undecidability.Synthetic.ReducibilityFacts]
X:13 [in Complexity.NP.SAT.CookLevin.Subproblems.CC]
x:13 [in Undecidability.TM.Hoare.HoareStdLib]
x:13 [in Undecidability.L.Computability.Scott]
x:13 [in Undecidability.Shared.Libs.PSL.FiniteTypes.DepPairs]
x:13 [in Complexity.TM.PrettyBounds.PrettyBounds]
x:130 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:130 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
x:130 [in Undecidability.L.Tactics.LClos]
x:130 [in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
X:130 [in Undecidability.Shared.Libs.DLW.Utils.php]
x:130 [in Undecidability.TM.Compound.Compare]
X:130 [in Complexity.Complexity.PolyTimeComputable]
x:130 [in Complexity.Complexity.NP]
x:130 [in Complexity.NP.TM.LM_to_mTM]
X:131 [in Complexity.TM.PrettyBounds.BaseCode]
x:131 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
X:131 [in Undecidability.Shared.Libs.DLW.Vec.vec]
x:131 [in Complexity.NP.TM.mTM_to_singleTapeTM]
X:131 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
x:131 [in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
x:131 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
x:131 [in Complexity.L.TM.CompCode]
x:131 [in Undecidability.TM.Hoare.HoareRegister]
x:131 [in Undecidability.TM.Util.Relations]
X:131 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
X:131 [in Undecidability.Synthetic.ListEnumerabilityFacts]
x:131 [in Undecidability.TM.Util.TM_facts]
x:131 [in Undecidability.Shared.Libs.DLW.Vec.pos]
X:131 [in Complexity.Complexity.NP]
x:131 [in Complexity.NP.TM.LM_to_mTM]
x:131 [in Complexity.Libs.CookPrelim.MorePrelim]
X:132 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
x:132 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:132 [in Undecidability.Shared.Libs.DLW.Utils.sums]
x:132 [in Undecidability.TM.Hoare.HoareRegister]
x:132 [in Undecidability.Shared.Libs.DLW.Vec.pos]
x:132 [in Complexity.NP.TM.LM_to_mTM]
x:133 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:133 [in Complexity.NP.SAT.SAT_inNP]
x:133 [in Complexity.NP.TM.LM_to_mTM]
x:134 [in Complexity.TM.PrettyBounds.BaseCode]
x:134 [in Undecidability.Shared.Libs.DLW.Vec.vec]
x:134 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:134 [in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
x:134 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
x:134 [in Undecidability.TM.Compound.MoveToSymbol]
X:134 [in Complexity.L.TM.TMunflatten]
X:134 [in Undecidability.Synthetic.ListEnumerabilityFacts]
x:134 [in Complexity.Complexity.PolyTimeComputable]
x:134 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
x:134 [in Undecidability.Shared.Libs.DLW.Vec.pos]
x:134 [in Complexity.NP.TM.LM_to_mTM]
X:134 [in Complexity.Libs.CookPrelim.MorePrelim]
x:135 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
x:135 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:135 [in Undecidability.TM.Compound.MoveToSymbol]
X:135 [in Complexity.Libs.CookPrelim.FlatFinTypes]
x:135 [in Undecidability.TM.Util.TM_facts]
x:135 [in Undecidability.TM.Univ.LookupAssociativeListTM]
x:135 [in Complexity.NP.TM.LM_to_mTM]
X:136 [in Undecidability.Shared.Libs.DLW.Vec.vec]
X:136 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:136 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:136 [in Complexity.Libs.CookPrelim.FlatFinTypes]
x:136 [in Complexity.L.TM.TMflatComp]
X:136 [in Complexity.Libs.CookPrelim.PolyBounds]
x:136 [in Undecidability.Shared.Libs.DLW.Utils.sums]
x:136 [in Undecidability.TM.Hoare.HoareRegister]
x:136 [in Undecidability.TM.Util.Relations]
x:136 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
x:136 [in Complexity.NP.TM.LM_to_mTM]
X:137 [in Complexity.TM.PrettyBounds.BaseCode]
x:137 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:137 [in Undecidability.TM.Util.Relations]
x:137 [in Complexity.NP.TM.LM_to_mTM]
x:138 [in Complexity.NP.TM.mTM_to_singleTapeTM]
X:138 [in Complexity.L.TM.TMflatComp]
x:138 [in Undecidability.TM.Code.Copy]
x:138 [in Undecidability.TM.Util.TM_facts]
X:138 [in Complexity.Complexity.NP]
x:138 [in Complexity.NP.TM.LM_to_mTM]
x:139 [in Undecidability.L.Prelim.ARS]
X:139 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
x:139 [in Undecidability.Shared.Libs.DLW.Vec.vec]
X:139 [in Undecidability.L.Tactics.ComputableTime]
x:139 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:139 [in Undecidability.TM.Compound.MoveToSymbol]
X:139 [in Complexity.Libs.CookPrelim.PolyBounds]
x:139 [in Undecidability.TM.Compound.Compare]
X:139 [in Undecidability.Synthetic.ListEnumerabilityFacts]
X:139 [in Complexity.Complexity.PolyTimeComputable]
x:139 [in Complexity.NP.TM.LM_to_mTM]
x:14 [in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
x:14 [in Undecidability.Shared.Libs.DLW.Utils.fin_dec]
x:14 [in Undecidability.TM.Code.CaseList]
X:14 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
x:14 [in Undecidability.L.Util.L_facts]
x:14 [in Undecidability.TM.Code.BinNumbers.PosMultTM]
x:14 [in Undecidability.Shared.Libs.PSL.Retracts]
x:14 [in Undecidability.L.Tactics.Extract]
x:14 [in Undecidability.L.Functions.LoopSum]
X:14 [in Undecidability.Shared.Libs.PSL.EqDec]
X:14 [in Undecidability.Shared.FinTypeEquiv]
X:14 [in Complexity.L.Functions.IterupN]
x:14 [in Undecidability.TM.Code.BinNumbers.NTM]
x:14 [in Undecidability.Shared.FinTypeForallExists]
x:14 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
x:14 [in Complexity.NP.L.GenNPBool]
x:14 [in Undecidability.Shared.Libs.DLW.Utils.fin_upto]
x:14 [in Undecidability.Shared.Libs.DLW.Utils.sorting]
x:14 [in Undecidability.TM.Univ.LowLevel]
x:14 [in Complexity.L.Functions.BinNumsSub]
x:14 [in Undecidability.L.Datatypes.LFinType]
X:14 [in Undecidability.Shared.Libs.PSL.FiniteTypes.Arbitrary]
x:14 [in Undecidability.Shared.Libs.PSL.Lists.Dupfree]
x:14 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
x:14 [in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
x:14 [in Undecidability.Synthetic.Infinite]
X:14 [in Undecidability.Shared.Libs.PSL.FiniteTypes.Cardinality]
X:14 [in Undecidability.TM.Univ.LookupAssociativeListTM]
x:14 [in Undecidability.L.Functions.Decoding]
x:14 [in Undecidability.L.Computability.Computability]
X:14 [in Undecidability.L.Functions.Encoding]
x:14 [in Undecidability.Synthetic.ReducibilityFacts]
X:14 [in Undecidability.TM.Hoare.HoareExamples]
x:14 [in Undecidability.L.Functions.Size]
x:14 [in Undecidability.Shared.Libs.PSL.FiniteTypes.CompoundFinTypes]
x:140 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:140 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
x:140 [in Undecidability.Shared.Libs.DLW.Utils.sums]
x:140 [in Complexity.L.TM.TMunflatten]
x:140 [in Complexity.NP.TM.LM_to_mTM]
x:141 [in Undecidability.Shared.Libs.DLW.Vec.vec]
x:141 [in Undecidability.L.Tactics.ComputableTime]
x:141 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:141 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:141 [in Undecidability.L.Tactics.LClos]
x:141 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
x:141 [in Undecidability.TM.Compound.MoveToSymbol]
X:141 [in Complexity.Libs.CookPrelim.FlatFinTypes]
x:141 [in Undecidability.Shared.Libs.DLW.Utils.sums]
x:141 [in Complexity.NP.TM.LM_to_mTM]
x:142 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:142 [in Complexity.Libs.CookPrelim.PolyBounds]
x:142 [in Undecidability.TM.Hoare.HoareRegister]
x:142 [in Undecidability.TM.Util.Relations]
X:142 [in Undecidability.Synthetic.ListEnumerabilityFacts]
x:142 [in Undecidability.TM.Code.Copy]
x:142 [in Undecidability.TM.Util.TM_facts]
x:142 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
x:142 [in Complexity.NP.TM.LM_to_mTM]
X:142 [in Complexity.Libs.CookPrelim.MorePrelim]
X:143 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
x:143 [in Complexity.NP.TM.mTM_to_singleTapeTM]
X:143 [in Complexity.Libs.CookPrelim.PolyBounds]
x:143 [in Undecidability.Shared.Libs.DLW.Utils.php]
x:143 [in Complexity.Complexity.PolyTimeComputable]
x:143 [in Undecidability.L.Tactics.Computable]
x:143 [in Complexity.NP.TM.LM_to_mTM]
X:144 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:144 [in Complexity.NP.TM.mTM_to_singleTapeTM]
X:144 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
X:144 [in Complexity.Libs.CookPrelim.FlatFinTypes]
X:144 [in Undecidability.Synthetic.ListEnumerabilityFacts]
X:144 [in Complexity.Complexity.NP]
x:144 [in Complexity.NP.TM.LM_to_mTM]
x:145 [in Undecidability.L.Prelim.ARS]
X:145 [in Undecidability.L.Tactics.ComputableTime]
x:145 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:145 [in Undecidability.TM.Compound.MoveToSymbol]
x:145 [in Complexity.Libs.CookPrelim.FlatFinTypes]
x:145 [in Undecidability.TM.Util.Relations]
x:145 [in Undecidability.TM.Util.TM_facts]
X:145 [in Undecidability.TM.Univ.LookupAssociativeListTM]
x:145 [in Complexity.NP.TM.LM_to_mTM]
x:146 [in Complexity.NP.TM.mTM_to_singleTapeTM]
X:146 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
x:146 [in Complexity.Libs.CookPrelim.PolyBounds]
x:146 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
x:146 [in Undecidability.L.Tactics.Computable]
x:146 [in Complexity.NP.TM.LM_to_mTM]
x:146 [in Complexity.Libs.CookPrelim.MorePrelim]
x:147 [in Complexity.TM.PrettyBounds.UnivBounds]
x:147 [in Undecidability.L.Tactics.ComputableTime]
x:147 [in Complexity.NP.TM.mTM_to_singleTapeTM]
X:147 [in Complexity.L.TM.CompCode]
X:147 [in Complexity.Libs.CookPrelim.PolyBounds]
x:147 [in Undecidability.Shared.Libs.DLW.Utils.sums]
x:147 [in Undecidability.TM.Compound.Compare]
x:147 [in Undecidability.TM.Code.Copy]
x:147 [in Complexity.NP.TM.LM_to_mTM]
x:148 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:148 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:148 [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
X:148 [in Complexity.L.TM.TMunflatten]
x:148 [in Undecidability.TM.Hoare.HoareRegister]
X:148 [in Complexity.L.AbstractMachines.AbstractHeapMachine]
X:148 [in Undecidability.TM.Code.Code]
x:148 [in Undecidability.TM.Util.TM_facts]
x:148 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
x:148 [in Complexity.Complexity.NP]
x:148 [in Complexity.NP.TM.LM_to_mTM]
x:148 [in Complexity.Libs.CookPrelim.MorePrelim]
x:149 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:149 [in Undecidability.TM.Compound.MoveToSymbol]
x:149 [in Undecidability.Shared.Libs.DLW.Utils.php]
x:149 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
x:149 [in Undecidability.TM.Univ.LookupAssociativeListTM]
x:149 [in Complexity.Complexity.NP]
x:149 [in Complexity.NP.TM.LM_to_mTM]
x:15 [in Complexity.Libs.Pigeonhole]
X:15 [in Undecidability.L.Prelim.ARS]
X:15 [in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
x:15 [in Undecidability.Shared.Libs.DLW.Utils.fin_quotient]
x:15 [in Undecidability.Shared.Libs.PSL.FCI]
x:15 [in Undecidability.Shared.Libs.DLW.Utils.fin_dec]
X:15 [in Undecidability.TM.Compound.TMTac]
x:15 [in Complexity.L.Datatypes.LBinNums]
x:15 [in Undecidability.Synthetic.InformativeReducibilityFacts]
x:15 [in Undecidability.Shared.Libs.PSL.Lists.Removal]
x:15 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds_Loop]
x:15 [in Undecidability.Shared.Libs.PSL.Retracts]
X:15 [in Undecidability.L.Tactics.Extract]
X:15 [in Undecidability.L.Functions.LoopSum]
X:15 [in Undecidability.TM.PrettyBounds.SizeBounds]
X:15 [in Undecidability.Synthetic.EnumerabilityFacts]
X:15 [in Undecidability.L.Prelim.LoopSum]
x:15 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
X:15 [in Undecidability.L.Datatypes.Lists]
x:15 [in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
x:15 [in Complexity.Libs.CookPrelim.FlatFinTypes]
x:15 [in Undecidability.TM.Code.BinNumbers.EncodeBinNumbers]
x:15 [in Complexity.Complexity.Subtypes]
x:15 [in Undecidability.TM.Basic.Mono]
x:15 [in Undecidability.L.Prelim.MoreBase]
x:15 [in Complexity.L.TM.CompCode]
x:15 [in Undecidability.Shared.FinTypeForallExists]
x:15 [in Undecidability.Shared.Libs.DLW.Wf.acc_irr]
x:15 [in Complexity.NP.L.GenNPBool]
X:15 [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
x:15 [in Complexity.L.AbstractMachines.FlatPro.Computable.Compile]
x:15 [in Complexity.L.Functions.BinNumsSub]
X:15 [in Complexity.Complexity.UpToCPoly]
x:15 [in Undecidability.Shared.Libs.DLW.Utils.php]
X:15 [in Undecidability.L.Datatypes.LFinType]
x:15 [in Undecidability.Shared.Libs.DLW.Utils.fin_base]
X:15 [in Undecidability.L.Tactics.Lbeta_nonrefl]
x:15 [in Undecidability.Synthetic.MoreEnumerabilityFacts]
x:15 [in Undecidability.TM.Util.Relations]
x:15 [in Undecidability.Shared.Libs.DLW.Wf.wf_finite]
X:15 [in Undecidability.Synthetic.ListEnumerabilityFacts]
x:15 [in Undecidability.L.TM.TMEncoding]
x:15 [in Undecidability.Shared.Libs.PSL.Vectors.VectorDupfree]
X:15 [in Undecidability.Shared.Dec]
x:15 [in Complexity.L.Functions.BinNumsCompare]
x:15 [in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
X:15 [in Undecidability.Shared.ListAutomation]
x:15 [in Complexity.Complexity.Monotonic]
x:15 [in Undecidability.TM.Code.CasePair]
X:15 [in Undecidability.Synthetic.ReducibilityFacts]
x:15 [in Undecidability.TM.Code.BinNumbers.PosAddTM]
X:15 [in Undecidability.Shared.Libs.PSL.FiniteTypes.CompoundFinTypes]
x:150 [in Complexity.NP.TM.mTM_to_singleTapeTM]
X:150 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
x:150 [in Undecidability.TM.Compound.MoveToSymbol]
x:150 [in Complexity.L.TM.TMflatComp]
x:150 [in Undecidability.Shared.Libs.DLW.Utils.sums]
x:150 [in Undecidability.TM.Code.Copy]
x:150 [in Undecidability.TM.Util.TM_facts]
x:150 [in Complexity.Complexity.NP]
x:150 [in Complexity.NP.TM.LM_to_mTM]
X:150 [in Complexity.Libs.CookPrelim.MorePrelim]
x:151 [in Undecidability.L.Prelim.ARS]
X:151 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:151 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:151 [in Complexity.Libs.CookPrelim.PolyBounds]
x:151 [in Undecidability.TM.Compound.Compare]
x:151 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
x:151 [in Complexity.Complexity.NP]
x:151 [in Complexity.NP.TM.LM_to_mTM]
x:152 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:152 [in Complexity.Libs.CookPrelim.PolyBounds]
x:152 [in Undecidability.Shared.Libs.DLW.Utils.sums]
x:152 [in Complexity.L.AbstractMachines.AbstractHeapMachine]
x:152 [in Undecidability.TM.Univ.LookupAssociativeListTM]
x:152 [in Complexity.Complexity.NP]
x:152 [in Complexity.NP.TM.LM_to_mTM]
x:153 [in Complexity.NP.TM.mTM_to_singleTapeTM]
X:153 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
x:153 [in Undecidability.TM.Util.TM_facts]
x:153 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
x:153 [in Complexity.Complexity.NP]
x:153 [in Complexity.NP.TM.LM_to_mTM]
x:154 [in Complexity.NP.TM.mTM_to_singleTapeTM]
X:154 [in Complexity.L.TM.TMflatComp]
X:154 [in Undecidability.Shared.Libs.DLW.Utils.php]
x:154 [in Undecidability.TM.Compound.Compare]
X:154 [in Complexity.Complexity.NP]
x:154 [in Complexity.NP.TM.LM_to_mTM]
x:154 [in Complexity.Libs.CookPrelim.MorePrelim]
x:155 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:155 [in Undecidability.TM.Compound.MoveToSymbol]
x:155 [in Complexity.NP.TM.LM_to_mTM]
x:156 [in Undecidability.L.Prelim.ARS]
X:156 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:156 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:156 [in Undecidability.TM.Compound.MoveToSymbol]
x:156 [in Complexity.NP.TM.LM_to_mTM]
x:157 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:157 [in Undecidability.TM.Util.TM_facts]
x:157 [in Complexity.NP.TM.LM_to_mTM]
X:157 [in Complexity.Libs.CookPrelim.MorePrelim]
X:158 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
x:158 [in Complexity.NP.TM.mTM_to_singleTapeTM]
X:158 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
x:158 [in Undecidability.TM.Compound.MoveToSymbol]
X:158 [in Complexity.L.ComparisonTimeBoundDerivation]
x:158 [in Undecidability.TM.Univ.LookupAssociativeListTM]
x:158 [in Complexity.NP.TM.LM_to_mTM]
x:159 [in Undecidability.L.Prelim.ARS]
X:159 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
x:159 [in Undecidability.L.Tactics.ComputableTime]
x:159 [in Complexity.NP.TM.mTM_to_singleTapeTM]
X:159 [in Complexity.Libs.CookPrelim.FlatFinTypes]
x:159 [in Undecidability.Shared.Libs.DLW.Utils.php]
x:159 [in Complexity.NP.TM.LM_to_mTM]
X:16 [in Undecidability.Shared.Libs.PSL.Numbers]
X:16 [in Complexity.TM.PrettyBounds.BaseCode]
x:16 [in Undecidability.Shared.Libs.DLW.Utils.fin_dec]
x:16 [in Undecidability.Synthetic.InformativeReducibilityFacts]
X:16 [in Complexity.Complexity.EncodableP]
x:16 [in Undecidability.L.Datatypes.List.List_basics]
x:16 [in Complexity.TM.PrettyBounds.UnivBounds]
x:16 [in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
x:16 [in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
x:16 [in Undecidability.L.Datatypes.LSum]
x:16 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
x:16 [in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
X:16 [in Complexity.Libs.CookPrelim.FlatFinTypes]
X:16 [in Complexity.TM.Single.EncodeTapesInvariants]
x:16 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
x:16 [in Complexity.TM.PrettyBounds.BaseCodeSpace]
x:16 [in Complexity.NP.L.GenNPBool]
X:16 [in Complexity.Libs.CookPrelim.PolyBounds]
x:16 [in Undecidability.Shared.Libs.DLW.Utils.sorting]
x:16 [in Complexity.L.Functions.BinNumsSub]
X:16 [in Undecidability.TM.Hoare.HoareRegister]
X:16 [in Undecidability.Shared.Libs.DLW.Utils.fin_base]
x:16 [in Undecidability.TM.Code.NatSub]
x:16 [in Undecidability.L.Computability.Decidability]
x:16 [in Undecidability.Shared.Libs.PSL.FiniteTypes.Arbitrary]
x:16 [in Undecidability.L.Datatypes.List.List_eqb]
x:16 [in Undecidability.Shared.Libs.PSL.Lists.Power]
x:16 [in Undecidability.Synthetic.Definitions]
x:16 [in Complexity.TM.Compound.MoveToSymbol_niceSpec]
X:16 [in Undecidability.L.Tactics.ComputableTactics]
X:16 [in Undecidability.Shared.Dec]
x:16 [in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
X:16 [in Undecidability.Synthetic.Infinite]
x:16 [in Complexity.Complexity.Definitions]
x:16 [in Complexity.Complexity.Monotonic]
x:16 [in Undecidability.L.Functions.Decoding]
x:16 [in Undecidability.L.Datatypes.LNat]
x:16 [in Complexity.Complexity.NP]
X:16 [in Complexity.NP.SAT.CookLevin.Subproblems.CC]
x:16 [in Complexity.L.AbstractMachines.Computable.LargestVar]
x:16 [in Undecidability.TM.Code.List.App]
x:16 [in Undecidability.Shared.Libs.PSL.FiniteTypes.DepPairs]
X:160 [in Undecidability.Shared.Libs.DLW.Vec.vec]
x:160 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:160 [in Undecidability.TM.Util.TM_facts]
x:160 [in Complexity.NP.TM.LM_to_mTM]
x:160 [in Complexity.Libs.CookPrelim.MorePrelim]
X:161 [in Undecidability.L.Prelim.ARS]
X:161 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:161 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:161 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
x:161 [in Complexity.NP.TM.LM_to_mTM]
x:162 [in Complexity.NP.TM.mTM_to_singleTapeTM]
X:162 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
x:162 [in Undecidability.TM.Compound.MoveToSymbol]
x:162 [in Complexity.Libs.CookPrelim.FlatFinTypes]
X:162 [in Complexity.L.ComparisonTimeBoundDerivation]
x:162 [in Undecidability.TM.Compound.Compare]
x:162 [in Undecidability.TM.Code.Copy]
x:162 [in Complexity.NP.TM.LM_to_mTM]
X:162 [in Complexity.Libs.CookPrelim.MorePrelim]
X:163 [in Undecidability.Shared.Libs.DLW.Vec.vec]
x:163 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:163 [in Undecidability.Shared.Libs.DLW.Utils.php]
x:163 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
x:163 [in Complexity.NP.TM.LM_to_mTM]
x:164 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:164 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:164 [in Complexity.L.TM.TMflatComp]
x:164 [in Undecidability.TM.Util.TM_facts]
x:164 [in Complexity.NP.TM.LM_to_mTM]
x:165 [in Complexity.NP.TM.mTM_to_singleTapeTM]
X:165 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
x:165 [in Undecidability.TM.Compound.Compare]
x:165 [in Complexity.NP.TM.LM_to_mTM]
x:166 [in Undecidability.Shared.Libs.DLW.Vec.vec]
x:166 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:166 [in Complexity.Libs.CookPrelim.FlatFinTypes]
x:166 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
x:166 [in Complexity.NP.TM.LM_to_mTM]
x:166 [in Complexity.Libs.CookPrelim.MorePrelim]
X:167 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
X:167 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:167 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:167 [in Complexity.L.TM.TMflatComp]
x:167 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
x:167 [in Complexity.NP.TM.LM_to_mTM]
X:168 [in Undecidability.L.Tactics.ComputableTime]
x:168 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:168 [in Undecidability.TM.Compound.MoveToSymbol]
X:168 [in Complexity.L.ComparisonTimeBoundDerivation]
x:168 [in Undecidability.TM.Code.Copy]
x:168 [in Complexity.NP.TM.LM_to_mTM]
x:169 [in Undecidability.L.Tactics.ComputableTime]
x:169 [in Complexity.NP.TM.mTM_to_singleTapeTM]
X:169 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
x:169 [in Complexity.NP.TM.LM_to_mTM]
X:169 [in Complexity.Libs.CookPrelim.MorePrelim]
x:17 [in Undecidability.L.Datatypes.LProd]
X:17 [in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
x:17 [in Undecidability.Shared.Libs.DLW.Utils.fin_quotient]
x:17 [in Complexity.L.AbstractMachines.Computable.EvalForTime]
x:17 [in Undecidability.TM.Code.CaseList]
x:17 [in Complexity.NP.L.GenNP_is_hard]
x:17 [in Undecidability.Shared.FilterFacts]
X:17 [in Undecidability.L.Datatypes.List.List_basics]
x:17 [in Undecidability.Shared.Libs.PSL.Retracts]
X:17 [in Undecidability.TM.Util.VectorPrelim]
x:17 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
x:17 [in Undecidability.Shared.Libs.PSL.Lists.Filter]
X:17 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_nat_facts]
X:17 [in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
x:17 [in Undecidability.TM.Code.BinNumbers.EncodeBinNumbers]
x:17 [in Complexity.Complexity.Subtypes]
x:17 [in Undecidability.Shared.Libs.DLW.Utils.interval]
x:17 [in Complexity.L.Functions.IterupN]
x:17 [in Undecidability.Shared.FinTypeForallExists]
x:17 [in Undecidability.Shared.Libs.DLW.Wf.wf_incl]
x:17 [in Undecidability.Shared.Libs.DLW.Wf.acc_irr]
x:17 [in Complexity.NP.L.GenNPBool]
x:17 [in Complexity.Libs.UniformHomomorphisms]
x:17 [in Complexity.L.AbstractMachines.FlatPro.Computable.Compile]
x:17 [in Undecidability.TM.Univ.LowLevel]
x:17 [in Complexity.L.Functions.BinNumsSub]
x:17 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
x:17 [in Undecidability.L.Datatypes.LFinType]
X:17 [in Undecidability.Synthetic.MoreEnumerabilityFacts]
x:17 [in Undecidability.L.Functions.UnboundIteration]
X:17 [in Undecidability.TM.Util.Relations]
x:17 [in Undecidability.TM.Code.Copy]
x:17 [in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
X:17 [in Undecidability.Synthetic.DecidabilityFacts]
X:17 [in Undecidability.Shared.Libs.PSL.Vectors.VectorDupfree]
x:17 [in Complexity.L.Functions.BinNumsCompare]
X:17 [in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
x:17 [in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
x:17 [in Undecidability.Shared.Libs.PSL.Lists.Cardinality]
X:17 [in Undecidability.L.Computability.Synthetic]
X:17 [in Complexity.Complexity.Definitions]
X:17 [in Undecidability.L.Functions.Decoding]
x:17 [in Undecidability.TM.Code.CasePair]
x:17 [in Undecidability.L.Tactics.Computable]
x:17 [in Undecidability.TM.Code.BinNumbers.PosAddTM]
x:17 [in Undecidability.TM.Hoare.HoareExamples]
X:17 [in Complexity.NP.TM.LM_to_mTM]
x:17 [in Complexity.TM.PrettyBounds.PrettyBounds]
X:170 [in Undecidability.L.Tactics.ComputableTime]
x:170 [in Complexity.NP.TM.mTM_to_singleTapeTM]
X:170 [in Complexity.L.ComparisonTimeBoundDerivation]
x:170 [in Complexity.NP.TM.LM_to_mTM]
x:171 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:171 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
x:171 [in Complexity.NP.TM.LM_to_mTM]
x:172 [in Undecidability.L.Tactics.ComputableTime]
x:172 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:172 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
x:172 [in Complexity.NP.TM.LM_to_mTM]
X:173 [in Undecidability.L.Prelim.ARS]
X:173 [in Undecidability.L.Tactics.ComputableTime]
x:173 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:173 [in Complexity.L.TM.TMflatComp]
x:173 [in Undecidability.Shared.Libs.DLW.Utils.sums]
x:173 [in Undecidability.TM.Compound.Compare]
x:173 [in Undecidability.TM.Code.Copy]
x:173 [in Complexity.NP.TM.LM_to_mTM]
x:173 [in Complexity.Libs.CookPrelim.MorePrelim]
x:174 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:174 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
X:174 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
X:174 [in Complexity.L.ComparisonTimeBoundDerivation]
x:174 [in Complexity.NP.TM.LM_to_mTM]
X:174 [in Complexity.Libs.CookPrelim.MorePrelim]
x:175 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:175 [in Undecidability.TM.Compound.MoveToSymbol]
x:175 [in Undecidability.Shared.Libs.DLW.Utils.sums]
x:175 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
x:175 [in Complexity.NP.TM.LM_to_mTM]
x:176 [in Undecidability.L.Tactics.ComputableTime]
x:176 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:176 [in Complexity.L.TM.TMflatComp]
x:176 [in Undecidability.Shared.Libs.DLW.Utils.sums]
x:176 [in Complexity.NP.TM.LM_to_mTM]
x:177 [in Complexity.NP.TM.mTM_to_singleTapeTM]
X:177 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
x:177 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
x:177 [in Complexity.NP.TM.LM_to_mTM]
x:177 [in Complexity.Libs.CookPrelim.MorePrelim]
X:178 [in Complexity.TM.PrettyBounds.M2MBounds]
x:178 [in Undecidability.Shared.Libs.DLW.Vec.vec]
x:178 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:178 [in Undecidability.TM.Compound.MoveToSymbol]
X:178 [in Undecidability.TM.Hoare.HoareLogic]
x:178 [in Complexity.NP.TM.LM_to_mTM]
X:179 [in Undecidability.L.Prelim.ARS]
x:179 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:179 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
x:179 [in Complexity.NP.TM.LM_to_mTM]
X:179 [in Complexity.Libs.CookPrelim.MorePrelim]
x:18 [in Complexity.Libs.Pigeonhole]
X:18 [in Undecidability.L.Prelim.ARS]
x:18 [in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
x:18 [in Complexity.TM.PrettyBounds.BaseCode]
X:18 [in Undecidability.Shared.Libs.DLW.Utils.fin_dec]
x:18 [in Complexity.L.Datatypes.LBinNums]
x:18 [in Complexity.NP.L.GenNP_is_hard]
x:18 [in Undecidability.L.Util.L_facts]
x:18 [in Undecidability.Shared.Libs.PSL.Lists.Removal]
X:18 [in Undecidability.TM.Code.List.Nth]
x:18 [in Complexity.TM.Code.Decode]
x:18 [in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
x:18 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
X:18 [in Undecidability.Shared.FinTypeEquiv]
x:18 [in Complexity.Complexity.Subtypes]
x:18 [in Undecidability.Shared.Libs.DLW.Wf.wf_incl]
X:18 [in Undecidability.L.Complexity.UpToC]
x:18 [in Complexity.NP.L.GenNPBool]
x:18 [in Complexity.Libs.UniformHomomorphisms]
x:18 [in Undecidability.Shared.Libs.DLW.Utils.list_bool]
X:18 [in Undecidability.TM.Code.WriteValue]
x:18 [in Complexity.L.Functions.BinNumsSub]
x:18 [in Undecidability.Shared.Libs.DLW.Utils.php]
x:18 [in Undecidability.L.Datatypes.LFinType]
X:18 [in Undecidability.Shared.Libs.DLW.Utils.fin_base]
x:18 [in Undecidability.Shared.Libs.PSL.Bijection]
x:18 [in Undecidability.Shared.Libs.PSL.FiniteTypes.Arbitrary]
x:18 [in Undecidability.Shared.Libs.PSL.Lists.Power]
X:18 [in Undecidability.Synthetic.Definitions]
X:18 [in Undecidability.Shared.Libs.PSL.Lists.Dupfree]
x:18 [in Undecidability.Synthetic.ListEnumerabilityFacts]
X:18 [in Undecidability.Shared.Dec]
x:18 [in Undecidability.TM.L.CaseCom]
x:18 [in Undecidability.L.Datatypes.LNat]
x:18 [in Complexity.Complexity.PolyTimeComputable]
x:18 [in Undecidability.TM.Code.List.App]
x:18 [in Undecidability.Shared.Libs.PSL.FiniteTypes.CompoundFinTypes]
x:180 [in Complexity.NP.TM.mTM_to_singleTapeTM]
X:180 [in Complexity.L.ComparisonTimeBoundDerivation]
x:180 [in Undecidability.TM.Code.Code]
x:180 [in Complexity.NP.TM.LM_to_mTM]
x:181 [in Complexity.NP.TM.mTM_to_singleTapeTM]
X:181 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
x:181 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
x:181 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
x:181 [in Undecidability.TM.Code.Copy]
x:181 [in Undecidability.TM.Code.Code]
x:181 [in Complexity.NP.TM.LM_to_mTM]
x:182 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
x:182 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:182 [in Undecidability.TM.Compound.MoveToSymbol]
x:182 [in Complexity.L.TM.TMflatComp]
x:182 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
x:182 [in Undecidability.TM.Hoare.HoareLogic]
x:182 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
x:182 [in Complexity.NP.TM.LM_to_mTM]
x:182 [in Complexity.Libs.CookPrelim.MorePrelim]
x:183 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:183 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
x:183 [in Complexity.NP.TM.LM_to_mTM]
X:184 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
x:184 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:184 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
X:184 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
x:184 [in Complexity.NP.TM.LM_to_mTM]
X:184 [in Complexity.Libs.CookPrelim.MorePrelim]
x:185 [in Undecidability.L.Tactics.ComputableTime]
x:185 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:185 [in Complexity.NP.TM.mTM_to_singleTapeTM]
X:185 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
X:185 [in Complexity.L.TM.TMflatComp]
x:185 [in Undecidability.TM.Code.Copy]
x:185 [in Complexity.NP.TM.LM_to_mTM]
x:186 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:186 [in Complexity.NP.TM.LM_to_mTM]
X:187 [in Complexity.TM.PrettyBounds.M2MBounds]
x:187 [in Undecidability.Shared.Libs.DLW.Vec.vec]
X:187 [in Undecidability.L.Tactics.ComputableTime]
x:187 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:187 [in Complexity.NP.TM.LM_to_mTM]
X:188 [in Undecidability.L.Prelim.ARS]
X:188 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:188 [in Complexity.NP.TM.mTM_to_singleTapeTM]
X:188 [in Complexity.L.ComparisonTimeBoundDerivation]
x:188 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
x:188 [in Complexity.NP.TM.LM_to_mTM]
X:188 [in Complexity.Libs.CookPrelim.MorePrelim]
x:189 [in Undecidability.L.Tactics.ComputableTime]
x:189 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:189 [in Undecidability.TM.Compound.MoveToSymbol]
x:189 [in Complexity.NP.TM.LM_to_mTM]
x:19 [in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
x:19 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
x:19 [in Undecidability.Shared.Libs.PSL.FCI]
X:19 [in Undecidability.TM.Compound.TMTac]
x:19 [in Complexity.NP.L.GenNP_is_hard]
x:19 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
X:19 [in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
x:19 [in Complexity.TM.Code.Decode]
X:19 [in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
X:19 [in Undecidability.TM.Hoare.HoareLegacy]
x:19 [in Undecidability.TM.PrettyBounds.SizeBounds]
x:19 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
X:19 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
x:19 [in Complexity.TM.Code.DecodeList]
X:19 [in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
x:19 [in Complexity.Libs.CookPrelim.FlatFinTypes]
x:19 [in Complexity.Complexity.Subtypes]
x:19 [in Undecidability.Shared.Libs.DLW.Utils.interval]
X:19 [in Complexity.L.Functions.IterupN]
x:19 [in Undecidability.TM.Code.BinNumbers.NTM]
x:19 [in Undecidability.L.Datatypes.LVector]
x:19 [in Complexity.NP.L.GenNPBool]
x:19 [in Undecidability.Shared.Libs.DLW.Utils.fin_upto]
x:19 [in Undecidability.TM.Univ.LowLevel]
x:19 [in Complexity.L.Functions.BinNumsSub]
X:19 [in Complexity.Complexity.UpToCPoly]
X:19 [in Undecidability.L.Datatypes.LFinType]
x:19 [in Undecidability.TM.Hoare.HoareRegister]
X:19 [in Undecidability.Shared.Libs.DLW.Utils.fin_base]
x:19 [in Undecidability.L.Tactics.Lbeta_nonrefl]
x:19 [in Undecidability.L.Computability.Decidability]
x:19 [in Undecidability.Shared.Libs.DLW.Wf.wf_finite]
x:19 [in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
x:19 [in Undecidability.L.Tactics.ComputableTactics]
x:19 [in Undecidability.TM.Code.Code]
x:19 [in Undecidability.L.Functions.FinTypeLookup]
X:19 [in Undecidability.Shared.ListAutomation]
x:19 [in Undecidability.TM.Univ.LookupAssociativeListTM]
x:19 [in Complexity.Complexity.Monotonic]
x:19 [in Undecidability.Shared.Libs.DLW.Utils.seteq]
X:19 [in Complexity.Complexity.PolyTimeComputable]
x:19 [in Undecidability.L.Functions.Encoding]
x:19 [in Undecidability.Synthetic.ReducibilityFacts]
X:19 [in Complexity.NP.SAT.CookLevin.Subproblems.CC]
x:19 [in Complexity.NP.TM.TMGenNP_fixed_mTM]
x:190 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
x:190 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:190 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:190 [in Complexity.NP.TM.LM_to_mTM]
x:191 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:191 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
x:191 [in Complexity.NP.TM.LM_to_mTM]
x:192 [in Undecidability.L.Prelim.ARS]
x:192 [in Undecidability.Shared.Libs.DLW.Vec.vec]
X:192 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:192 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:192 [in Complexity.L.ComparisonTimeBoundDerivation]
x:192 [in Complexity.NP.TM.LM_to_mTM]
X:193 [in Undecidability.L.Tactics.ComputableTime]
x:193 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:193 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
X:193 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
x:193 [in Complexity.NP.TM.LM_to_mTM]
X:194 [in Undecidability.L.Prelim.ARS]
X:194 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
x:194 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:194 [in Undecidability.TM.Compound.MoveToSymbol]
x:194 [in Undecidability.Shared.Libs.DLW.Utils.sums]
x:194 [in Complexity.NP.TM.LM_to_mTM]
X:194 [in Complexity.Libs.CookPrelim.MorePrelim]
x:195 [in Undecidability.L.Tactics.ComputableTime]
x:195 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:195 [in Complexity.NP.TM.LM_to_mTM]
x:196 [in Undecidability.L.Prelim.ARS]
x:196 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:196 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
x:196 [in Complexity.NP.TM.LM_to_mTM]
x:197 [in Complexity.NP.TM.mTM_to_singleTapeTM]
X:197 [in Complexity.L.TM.TMflatComp]
x:197 [in Undecidability.Shared.Libs.DLW.Utils.sums]
x:197 [in Undecidability.TM.Code.Copy]
x:197 [in Complexity.NP.TM.LM_to_mTM]
X:198 [in Undecidability.L.Prelim.ARS]
x:198 [in Undecidability.Shared.Libs.DLW.Vec.vec]
x:198 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:198 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:198 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
X:198 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
x:198 [in Undecidability.TM.Util.TM_facts]
x:198 [in Complexity.NP.TM.LM_to_mTM]
X:199 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:199 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:199 [in Complexity.NP.TM.LM_to_mTM]
x:2 [in Undecidability.Shared.Libs.PSL.Numbers]
x:2 [in Undecidability.L.Prelim.ARS]
x:2 [in Complexity.L.Datatypes.LBinNums]
x:2 [in Undecidability.Shared.FilterFacts]
x:2 [in Undecidability.TM.Code.BinNumbers.PosMultTM]
X:2 [in Complexity.TM.PrettyBounds.UnivBounds]
X:2 [in Complexity.TM.Code.Decode]
x:2 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
X:2 [in Undecidability.TM.Code.List.Cons_constant]
x:2 [in Undecidability.Shared.Libs.PSL.Lists.Filter]
x:2 [in Undecidability.Shared.FinTypeEquiv]
X:2 [in Complexity.TM.Code.DecodeList]
x:2 [in Undecidability.Shared.Libs.DLW.Utils.interval]
x:2 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
x:2 [in Undecidability.Shared.embed_nat]
x:2 [in Complexity.L.Functions.BinNumsSub]
x:2 [in Complexity.Complexity.UpToCPoly]
X:2 [in Undecidability.L.Datatypes.LFinType]
x:2 [in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicFinTypes]
x:2 [in Complexity.L.AbstractMachines.Computable.Lookup]
x:2 [in Undecidability.TM.Hoare.HoareTacticsView]
x:2 [in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
X:2 [in Undecidability.TM.Code.Code]
x:2 [in Undecidability.Synthetic.Infinite]
X:2 [in Undecidability.Shared.Libs.PSL.FiniteTypes.Cardinality]
x:2 [in Complexity.Complexity.Monotonic]
x:2 [in Undecidability.L.Datatypes.LNat]
x:2 [in Undecidability.TM.Code.BinNumbers.PosAddTM]
X:2 [in Undecidability.TM.Hoare.HoareExamples]
x:2 [in Complexity.TM.PrettyBounds.PrettyBounds]
x:2 [in Complexity.L.Functions.BinNumsAdd]
x:20 [in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
x:20 [in Complexity.L.AbstractMachines.Computable.EvalForTime]
x:20 [in Complexity.NP.L.GenNP_is_hard]
X:20 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
x:20 [in Undecidability.L.Util.L_facts]
x:20 [in Undecidability.Shared.FilterFacts]
x:20 [in Complexity.HierarchyTheorem.TimeHierarchyTheorem]
X:20 [in Undecidability.L.Datatypes.List.List_basics]
x:20 [in Undecidability.L.Datatypes.LSum]
x:20 [in Undecidability.TM.PrettyBounds.SizeBounds]
x:20 [in Undecidability.Synthetic.EnumerabilityFacts]
x:20 [in Undecidability.L.Prelim.LoopSum]
x:20 [in Undecidability.Shared.Libs.PSL.Lists.Filter]
x:20 [in Complexity.Complexity.Subtypes]
x:20 [in Complexity.L.AbstractMachines.Computable.UnivDecTime]
x:20 [in Undecidability.L.Datatypes.LVector]
x:20 [in Complexity.NP.L.GenNPBool]
X:20 [in Complexity.L.TM.TMflatComp]
X:20 [in Undecidability.L.Datatypes.List.List_nat]
x:20 [in Complexity.Libs.UniformHomomorphisms]
X:20 [in Complexity.Libs.CookPrelim.PolyBounds]
X:20 [in Undecidability.TM.Univ.LowLevel]
X:20 [in Undecidability.Shared.Libs.DLW.Utils.fin_base]
x:20 [in Undecidability.Synthetic.MoreEnumerabilityFacts]
X:20 [in Complexity.NP.SAT.CookLevin.Subproblems.TM_single]
x:20 [in Complexity.Complexity.SpaceBoundsTime]
X:20 [in Undecidability.Synthetic.ListEnumerabilityFacts]
x:20 [in Undecidability.TM.Code.Copy]
x:20 [in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
x:20 [in Undecidability.Synthetic.DecidabilityFacts]
x:20 [in Undecidability.Shared.Libs.PSL.Vectors.VectorDupfree]
x:20 [in Undecidability.L.Tactics.ComputableTactics]
x:20 [in Undecidability.Synthetic.Infinite]
x:20 [in Complexity.Complexity.Monotonic]
x:20 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
X:20 [in Undecidability.TM.Code.CasePair]
x:20 [in Complexity.NP.L.GenNP]
X:20 [in Undecidability.L.Functions.Encoding]
x:20 [in Undecidability.Synthetic.ReducibilityFacts]
x:20 [in Undecidability.TM.Code.BinNumbers.PosAddTM]
X:20 [in Undecidability.TM.Hoare.HoareExamples]
x:20 [in Complexity.NP.TM.LM_to_mTM]
x:20 [in Complexity.L.Functions.BinNumsAdd]
x:200 [in Undecidability.L.Prelim.ARS]
x:200 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:200 [in Undecidability.TM.Compound.Compare]
X:200 [in Undecidability.TM.Code.Copy]
x:200 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
x:200 [in Complexity.NP.TM.LM_to_mTM]
x:201 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
x:201 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:201 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
x:201 [in Undecidability.TM.Compound.Compare]
x:201 [in Complexity.NP.TM.LM_to_mTM]
X:202 [in Undecidability.L.Prelim.ARS]
X:202 [in Undecidability.Shared.Libs.DLW.Vec.vec]
x:202 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:202 [in Undecidability.TM.Compound.Compare]
x:202 [in Undecidability.TM.Code.Copy]
x:202 [in Complexity.NP.TM.LM_to_mTM]
X:202 [in Complexity.Libs.CookPrelim.MorePrelim]
X:203 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
x:203 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:203 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:203 [in Undecidability.TM.Compound.Compare]
x:203 [in Complexity.NP.TM.LM_to_mTM]
X:204 [in Undecidability.L.Prelim.ARS]
x:204 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:204 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
x:204 [in Complexity.NP.TM.LM_to_mTM]
x:205 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:205 [in Undecidability.TM.Code.Copy]
x:205 [in Complexity.NP.TM.LM_to_mTM]
X:206 [in Undecidability.L.Prelim.ARS]
x:206 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:206 [in Complexity.NP.TM.LM_to_mTM]
X:206 [in Complexity.Libs.CookPrelim.MorePrelim]
x:207 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:207 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:207 [in Complexity.L.TM.TMunflatten]
x:207 [in Undecidability.TM.Util.TM_facts]
x:207 [in Complexity.NP.TM.LM_to_mTM]
x:208 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:208 [in Undecidability.TM.Code.Copy]
x:208 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
x:208 [in Complexity.NP.TM.LM_to_mTM]
X:209 [in Undecidability.L.Prelim.ARS]
x:209 [in Undecidability.Shared.Libs.DLW.Vec.vec]
x:209 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:209 [in Complexity.NP.TM.LM_to_mTM]
X:209 [in Complexity.Libs.CookPrelim.MorePrelim]
x:21 [in Undecidability.L.Prelim.ARS]
X:21 [in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
x:21 [in Undecidability.Shared.Libs.DLW.Utils.fin_quotient]
x:21 [in Undecidability.Shared.Libs.DLW.Utils.fin_dec]
x:21 [in Complexity.NP.L.GenNP_is_hard]
x:21 [in Undecidability.L.Util.L_facts]
x:21 [in Undecidability.Shared.Libs.PSL.Lists.Removal]
x:21 [in Undecidability.Shared.Libs.PSL.Retracts]
x:21 [in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
x:21 [in Undecidability.TM.PrettyBounds.SizeBounds]
x:21 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
x:21 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_nat_facts]
X:21 [in Complexity.Complexity.Subtypes]
x:21 [in Undecidability.L.Datatypes.LVector]
x:21 [in Undecidability.L.Complexity.UpToC]
x:21 [in Complexity.TM.PrettyBounds.BaseCodeSpace]
x:21 [in Complexity.NP.L.GenNPBool]
x:21 [in Undecidability.Shared.Libs.DLW.Utils.list_bool]
x:21 [in Undecidability.TM.Code.WriteValue]
x:21 [in Complexity.L.Functions.BinNumsSub]
x:21 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
x:21 [in Undecidability.TM.Code.CaseSum]
x:21 [in Undecidability.L.Datatypes.LFinType]
X:21 [in Undecidability.L.Functions.EqBool]
X:21 [in Undecidability.Shared.Libs.PSL.FiniteTypes.Arbitrary]
X:21 [in Undecidability.Synthetic.Definitions]
x:21 [in Undecidability.TM.Util.Relations]
x:21 [in Undecidability.Synthetic.DecidabilityFacts]
x:21 [in Undecidability.L.Tactics.ComputableTactics]
x:21 [in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
x:21 [in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
x:21 [in Undecidability.L.Computability.Synthetic]
x:21 [in Complexity.Complexity.Monotonic]
x:21 [in Complexity.TM.Single.DecodeTape]
x:21 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
x:21 [in Undecidability.TM.PrettyBounds.MaxList]
X:21 [in Undecidability.Synthetic.ReducibilityFacts]
x:210 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:210 [in Complexity.NP.TM.LM_to_mTM]
x:210 [in Complexity.Libs.CookPrelim.MorePrelim]
x:211 [in Complexity.NP.TM.mTM_to_singleTapeTM]
X:211 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
x:211 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
x:211 [in Complexity.NP.TM.LM_to_mTM]
X:212 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
x:212 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:212 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
x:212 [in Undecidability.TM.Code.Copy]
x:212 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
x:212 [in Complexity.NP.TM.LM_to_mTM]
x:213 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:213 [in Complexity.NP.TM.LM_to_mTM]
X:213 [in Complexity.Libs.CookPrelim.MorePrelim]
x:214 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:214 [in Undecidability.TM.Compound.Compare]
x:214 [in Undecidability.TM.Util.TM_facts]
x:214 [in Complexity.NP.TM.LM_to_mTM]
x:214 [in Complexity.Libs.CookPrelim.MorePrelim]
x:215 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:215 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:215 [in Undecidability.TM.Compound.Compare]
x:215 [in Undecidability.TM.Code.Copy]
x:215 [in Complexity.NP.TM.LM_to_mTM]
x:216 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:216 [in Undecidability.TM.Compound.Compare]
x:216 [in Complexity.NP.TM.LM_to_mTM]
X:217 [in Undecidability.L.Prelim.ARS]
X:217 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
X:217 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
x:217 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:217 [in Undecidability.TM.Compound.Compare]
X:217 [in Undecidability.TM.Code.Copy]
x:217 [in Complexity.NP.TM.LM_to_mTM]
X:217 [in Complexity.Libs.CookPrelim.MorePrelim]
x:218 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:218 [in Undecidability.TM.Util.TM_facts]
x:218 [in Complexity.NP.TM.LM_to_mTM]
x:218 [in Complexity.Libs.CookPrelim.MorePrelim]
x:219 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:219 [in Undecidability.TM.Code.Copy]
x:219 [in Complexity.NP.TM.LM_to_mTM]
x:22 [in Undecidability.Shared.Libs.PSL.Numbers]
x:22 [in Undecidability.Shared.Libs.DLW.Utils.fin_dec]
x:22 [in Complexity.NP.L.GenNP_is_hard]
X:22 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
x:22 [in Undecidability.L.Util.L_facts]
X:22 [in Undecidability.L.Complexity.UpToCNary]
X:22 [in Undecidability.L.Tactics.ComputableTime]
x:22 [in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
x:22 [in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
x:22 [in Undecidability.TM.PrettyBounds.SizeBounds]
x:22 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
X:22 [in Undecidability.TM.Util.VectorPrelim]
x:22 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
X:22 [in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
x:22 [in Undecidability.Shared.Libs.DLW.Utils.interval]
x:22 [in Complexity.TM.Single.EncodeTapesInvariants]
x:22 [in Complexity.L.Functions.IterupN]
X:22 [in Undecidability.L.Datatypes.LVector]
X:22 [in Undecidability.L.Complexity.UpToC]
x:22 [in Complexity.NP.L.GenNPBool]
x:22 [in Complexity.Libs.UniformHomomorphisms]
X:22 [in Undecidability.L.TM.TapeFuns]
x:22 [in Complexity.Complexity.UpToCPoly]
x:22 [in Undecidability.L.Computability.Decidability]
x:22 [in Undecidability.L.Datatypes.List.List_eqb]
x:22 [in Complexity.NP.SAT.CookLevin.Subproblems.TM_single]
x:22 [in Complexity.Complexity.SpaceBoundsTime]
x:22 [in Undecidability.Shared.Libs.DLW.Wf.wf_finite]
x:22 [in Undecidability.Synthetic.DecidabilityFacts]
X:22 [in Undecidability.Shared.Libs.PSL.Vectors.VectorDupfree]
X:22 [in Undecidability.Shared.Dec]
x:22 [in Undecidability.Shared.Libs.PSL.Lists.Cardinality]
x:22 [in Undecidability.L.Functions.FinTypeLookup]
x:22 [in Complexity.Complexity.Definitions]
x:22 [in Complexity.Complexity.Monotonic]
x:22 [in Undecidability.Shared.Libs.DLW.Utils.seteq]
x:22 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
x:22 [in Undecidability.TM.Code.CasePair]
x:22 [in Undecidability.L.Computability.Computability]
x:22 [in Undecidability.TM.Code.BinNumbers.PosAddTM]
X:22 [in Undecidability.Shared.Libs.PSL.FiniteTypes.CompoundFinTypes]
X:22 [in Complexity.Libs.CookPrelim.MorePrelim]
x:22 [in Complexity.L.Functions.BinNumsAdd]
x:220 [in Complexity.NP.TM.mTM_to_singleTapeTM]
X:220 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
x:220 [in Complexity.NP.TM.LM_to_mTM]
x:221 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:221 [in Undecidability.TM.Util.TM_facts]
x:221 [in Complexity.NP.TM.LM_to_mTM]
x:222 [in Complexity.NP.TM.mTM_to_singleTapeTM]
X:222 [in Undecidability.TM.Code.Copy]
x:222 [in Complexity.NP.TM.LM_to_mTM]
x:2220 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
x:2221 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
X:223 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
x:223 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:223 [in Complexity.NP.TM.LM_to_mTM]
X:224 [in Undecidability.L.Prelim.ARS]
x:224 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:224 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:224 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
x:224 [in Undecidability.TM.Util.TM_facts]
x:224 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
x:224 [in Complexity.NP.TM.LM_to_mTM]
x:225 [in Complexity.NP.TM.mTM_to_singleTapeTM]
X:225 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
x:225 [in Undecidability.TM.Code.Copy]
x:225 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
x:225 [in Complexity.NP.TM.LM_to_mTM]
X:226 [in Undecidability.L.Prelim.ARS]
X:226 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:226 [in Complexity.NP.TM.mTM_to_singleTapeTM]
X:226 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
x:226 [in Complexity.NP.TM.LM_to_mTM]
x:227 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:227 [in Undecidability.TM.Util.TM_facts]
x:227 [in Complexity.NP.TM.LM_to_mTM]
x:228 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:228 [in Complexity.NP.TM.LM_to_mTM]
x:229 [in Complexity.NP.TM.mTM_to_singleTapeTM]
X:229 [in Undecidability.TM.Code.Copy]
x:229 [in Complexity.NP.TM.LM_to_mTM]
x:23 [in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
x:23 [in Undecidability.Shared.Libs.DLW.Utils.fin_dec]
X:23 [in Undecidability.TM.Compound.TMTac]
x:23 [in Undecidability.TM.Code.CaseList]
x:23 [in Undecidability.Shared.Libs.PSL.Lists.Removal]
X:23 [in Undecidability.L.Datatypes.List.List_basics]
X:23 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
X:23 [in Complexity.TM.PrettyBounds.UnivBounds]
X:23 [in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
x:23 [in Complexity.NP.TM.mTM_to_singleTapeTM]
X:23 [in Undecidability.TM.PrettyBounds.SizeBounds]
X:23 [in Undecidability.TM.Code.List.Length]
x:23 [in Undecidability.L.Prelim.LoopSum]
x:23 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
x:23 [in Undecidability.Shared.Libs.DLW.Utils.quotient]
x:23 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_nat_facts]
x:23 [in Complexity.L.AbstractMachines.Computable.UnivDecTime]
x:23 [in Undecidability.Shared.Libs.DLW.Wf.acc_irr]
x:23 [in Complexity.TM.PrettyBounds.BaseCodeSpace]
x:23 [in Undecidability.L.Datatypes.List.List_nat]
x:23 [in Undecidability.TM.Univ.LowLevel]
x:23 [in Complexity.L.Functions.BinNumsSub]
x:23 [in Complexity.Complexity.ONotationIsAppropriate]
X:23 [in Complexity.Complexity.UpToCPoly]
x:23 [in Undecidability.Shared.Libs.PSL.FiniteTypes.Arbitrary]
X:23 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
X:23 [in Undecidability.TM.Util.Relations]
X:23 [in Undecidability.Synthetic.ListEnumerabilityFacts]
x:23 [in Undecidability.Synthetic.DecidabilityFacts]
x:23 [in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
X:23 [in Undecidability.L.Computability.Synthetic]
X:23 [in Undecidability.Shared.ListAutomation]
X:23 [in Complexity.Complexity.Definitions]
X:23 [in Undecidability.TM.Univ.LookupAssociativeListTM]
x:23 [in Complexity.Complexity.Monotonic]
X:23 [in Undecidability.L.Functions.Decoding]
X:23 [in Undecidability.TM.L.CompilerBoolFuns.Compiler]
x:23 [in Undecidability.TM.Hoare.HoareExamples]
x:23 [in Undecidability.L.Functions.Size]
X:23 [in Undecidability.L.Prelim.MoreList]
x:230 [in Undecidability.L.Prelim.ARS]
x:230 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:230 [in Undecidability.TM.Util.TM_facts]
x:230 [in Complexity.NP.TM.LM_to_mTM]
X:231 [in Undecidability.L.Prelim.ARS]
x:231 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:231 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
X:231 [in Undecidability.TM.Hoare.HoareRegister]
x:231 [in Complexity.NP.TM.LM_to_mTM]
X:231 [in Complexity.Libs.CookPrelim.MorePrelim]
x:232 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:232 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:232 [in Undecidability.TM.Code.Copy]
x:232 [in Complexity.NP.TM.LM_to_mTM]
x:232 [in Complexity.Libs.CookPrelim.MorePrelim]
x:233 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:233 [in Complexity.NP.TM.LM_to_mTM]
x:234 [in Undecidability.L.Prelim.ARS]
x:234 [in Undecidability.L.Util.L_facts]
x:234 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:234 [in Undecidability.TM.Util.TM_facts]
x:234 [in Complexity.NP.TM.LM_to_mTM]
x:235 [in Complexity.NP.TM.mTM_to_singleTapeTM]
X:235 [in Undecidability.TM.Code.Copy]
x:235 [in Complexity.NP.TM.LM_to_mTM]
X:236 [in Undecidability.L.Prelim.ARS]
x:236 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:236 [in Complexity.NP.TM.LM_to_mTM]
x:237 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:237 [in Undecidability.TM.Util.TM_facts]
X:237 [in Undecidability.TM.Hoare.HoareLogic]
x:237 [in Complexity.NP.TM.LM_to_mTM]
x:238 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:238 [in Undecidability.TM.Code.Copy]
x:238 [in Complexity.NP.TM.LM_to_mTM]
x:239 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:239 [in Complexity.NP.TM.LM_to_mTM]
x:24 [in Undecidability.Shared.Libs.PSL.Numbers]
x:24 [in Complexity.Libs.Pigeonhole]
X:24 [in Undecidability.L.Prelim.ARS]
x:24 [in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
x:24 [in Undecidability.Shared.Libs.DLW.Utils.fin_quotient]
x:24 [in Undecidability.L.Util.L_facts]
x:24 [in Undecidability.Shared.Libs.DLW.Vec.vec]
x:24 [in Undecidability.L.Tactics.ComputableTime]
X:24 [in Undecidability.Shared.Libs.PSL.EqDec]
x:24 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:24 [in Undecidability.TM.Hoare.HoareLegacy]
X:24 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
x:24 [in Undecidability.Synthetic.EnumerabilityFacts]
x:24 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
X:24 [in Complexity.L.Functions.IterupN]
x:24 [in Complexity.Libs.UniformHomomorphisms]
X:24 [in Complexity.Libs.CookPrelim.PolyBounds]
x:24 [in Complexity.Complexity.ONotationIsAppropriate]
X:24 [in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
x:24 [in Undecidability.TM.Code.NatSub]
x:24 [in Undecidability.Synthetic.MoreEnumerabilityFacts]
x:24 [in Undecidability.Synthetic.Definitions]
x:24 [in Undecidability.TM.Code.Copy]
X:24 [in Undecidability.Synthetic.DecidabilityFacts]
X:24 [in Undecidability.Shared.Dec]
x:24 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
x:24 [in Undecidability.L.Functions.Encoding]
x:24 [in Undecidability.TM.Code.BinNumbers.PosAddTM]
x:24 [in Undecidability.TM.Code.List.App]
x:24 [in Undecidability.Shared.Libs.PSL.FiniteTypes.CompoundFinTypes]
x:24 [in Complexity.L.Functions.BinNumsAdd]
x:240 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:240 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:240 [in Complexity.NP.TM.LM_to_mTM]
x:241 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:241 [in Undecidability.TM.Hoare.HoareLogic]
x:241 [in Complexity.NP.TM.LM_to_mTM]
x:242 [in Complexity.NP.TM.mTM_to_singleTapeTM]
X:242 [in Undecidability.TM.Code.Copy]
x:242 [in Undecidability.TM.Hoare.HoareLogic]
x:242 [in Complexity.NP.TM.LM_to_mTM]
x:243 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
x:243 [in Undecidability.L.Tactics.Extract]
x:243 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:243 [in Undecidability.TM.Hoare.HoareRegister]
x:243 [in Complexity.NP.TM.LM_to_mTM]
x:244 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
x:244 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:244 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
x:244 [in Complexity.NP.TM.LM_to_mTM]
X:245 [in Complexity.TM.PrettyBounds.M2MBounds]
x:245 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:245 [in Undecidability.TM.Code.Copy]
x:245 [in Complexity.NP.TM.LM_to_mTM]
x:246 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:246 [in Undecidability.TM.Hoare.HoareRegister]
x:246 [in Complexity.NP.TM.LM_to_mTM]
X:246 [in Complexity.Libs.CookPrelim.MorePrelim]
x:247 [in Complexity.NP.TM.mTM_to_singleTapeTM]
X:247 [in Undecidability.TM.Hoare.HoareLogic]
x:247 [in Complexity.NP.TM.LM_to_mTM]
x:248 [in Complexity.NP.TM.mTM_to_singleTapeTM]
X:248 [in Undecidability.TM.Code.Copy]
x:248 [in Complexity.NP.TM.LM_to_mTM]
x:249 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:249 [in Complexity.NP.TM.LM_to_mTM]
X:25 [in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
x:25 [in Undecidability.Shared.Libs.PSL.FCI]
X:25 [in Undecidability.Shared.Libs.DLW.Utils.fin_dec]
x:25 [in Undecidability.Shared.FilterFacts]
x:25 [in Undecidability.L.Functions.LoopSum]
X:25 [in Undecidability.Shared.Libs.PSL.EqDec]
X:25 [in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
x:25 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:25 [in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
x:25 [in Undecidability.TM.Hoare.HoareLegacy]
x:25 [in Undecidability.TM.PrettyBounds.SizeBounds]
X:25 [in Undecidability.TM.Util.VectorPrelim]
x:25 [in Undecidability.TM.Code.NatTM]
X:25 [in Undecidability.Synthetic.EnumerabilityFacts]
X:25 [in Undecidability.L.Prelim.LoopSum]
x:25 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
x:25 [in Undecidability.Shared.Libs.PSL.Lists.Filter]
x:25 [in Undecidability.Shared.Libs.DLW.Utils.interval]
x:25 [in Complexity.TM.PrettyBounds.BaseCodeSpace]
x:25 [in Complexity.NP.SAT.SAT_inNP]
x:25 [in Complexity.NP.L.LMGenNP]
x:25 [in Undecidability.Shared.Libs.DLW.Utils.list_bool]
x:25 [in Complexity.L.Functions.BinNumsSub]
x:25 [in Complexity.Complexity.ONotationIsAppropriate]
x:25 [in Undecidability.L.Functions.EqBool]
x:25 [in Undecidability.Shared.Libs.PSL.FiniteTypes.Arbitrary]
x:25 [in Undecidability.Synthetic.MoreEnumerabilityFacts]
x:25 [in Undecidability.Shared.Libs.PSL.Lists.Power]
x:25 [in Undecidability.Synthetic.ListEnumerabilityFacts]
x:25 [in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
x:25 [in Undecidability.TM.L.Eval]
x:25 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
x:25 [in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
x:25 [in Undecidability.Shared.Libs.DLW.Utils.seteq]
x:25 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
X:25 [in Undecidability.TM.Code.CasePair]
x:25 [in Undecidability.Synthetic.ReducibilityFacts]
x:25 [in Complexity.L.AbstractMachines.Computable.LargestVar]
X:25 [in Undecidability.Shared.Libs.PSL.FiniteTypes.CompoundFinTypes]
x:25 [in Complexity.L.Functions.BinNumsAdd]
x:250 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:250 [in Complexity.NP.TM.LM_to_mTM]
x:251 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:251 [in Undecidability.TM.Code.Copy]
x:251 [in Complexity.NP.TM.LM_to_mTM]
X:251 [in Complexity.Libs.CookPrelim.MorePrelim]
x:252 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:252 [in Complexity.L.TM.TMflatComp]
x:252 [in Undecidability.TM.Hoare.HoareLogic]
x:252 [in Complexity.NP.TM.LM_to_mTM]
x:253 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:253 [in Undecidability.TM.Hoare.HoareLogic]
x:253 [in Complexity.NP.TM.LM_to_mTM]
x:254 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:254 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:254 [in Complexity.L.TM.TMflatComp]
x:254 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
x:254 [in Complexity.NP.TM.LM_to_mTM]
x:255 [in Complexity.NP.TM.mTM_to_singleTapeTM]
X:255 [in Undecidability.TM.Code.Copy]
x:255 [in Complexity.NP.TM.LM_to_mTM]
x:256 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:256 [in Complexity.NP.TM.LM_to_mTM]
X:256 [in Complexity.Libs.CookPrelim.MorePrelim]
X:257 [in Undecidability.Shared.Libs.DLW.Vec.vec]
x:257 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:257 [in Complexity.NP.TM.LM_to_mTM]
x:258 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:258 [in Undecidability.TM.Code.Copy]
X:258 [in Undecidability.TM.Hoare.HoareLogic]
x:258 [in Complexity.NP.TM.LM_to_mTM]
x:259 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:259 [in Complexity.NP.TM.LM_to_mTM]
X:26 [in Undecidability.TM.L.CompilerBoolFuns.NaryApp]
x:26 [in Undecidability.Shared.Libs.PSL.Lists.Removal]
x:26 [in Complexity.HierarchyTheorem.TimeHierarchyTheorem]
x:26 [in Undecidability.Shared.Libs.DLW.Utils.prime]
x:26 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:26 [in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
X:26 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
x:26 [in Undecidability.Shared.FinTypeEquiv]
x:26 [in Complexity.L.AbstractMachines.Computable.UnivDecTime]
x:26 [in Undecidability.L.Complexity.UpToC]
x:26 [in Complexity.L.AbstractMachines.FlatPro.Computable.Compile]
X:26 [in Undecidability.TM.Univ.LowLevel]
x:26 [in Complexity.L.Functions.BinNumsSub]
X:26 [in Complexity.Complexity.UpToCPoly]
x:26 [in Complexity.L.TM.TMunflatten]
x:26 [in Undecidability.Shared.Libs.DLW.Utils.fin_base]
X:26 [in Undecidability.Synthetic.Definitions]
X:26 [in Complexity.NP.TM.M_multi2mono]
x:26 [in Undecidability.Shared.Libs.DLW.Wf.wf_finite]
x:26 [in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
x:26 [in Undecidability.Synthetic.DecidabilityFacts]
x:26 [in Undecidability.L.TM.TMEncoding]
X:26 [in Undecidability.Shared.Dec]
x:26 [in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
x:26 [in Undecidability.TM.Code.Code]
x:26 [in Undecidability.L.Datatypes.LNat]
x:26 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
x:26 [in Undecidability.TM.PrettyBounds.MaxList]
X:26 [in Complexity.Complexity.NP]
x:26 [in Complexity.L.Functions.BinNumsAdd]
X:26 [in Undecidability.TM.Compound.WriteString]
x:260 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:260 [in Complexity.NP.TM.LM_to_mTM]
x:261 [in Complexity.NP.TM.mTM_to_singleTapeTM]
X:261 [in Undecidability.TM.Code.Copy]
x:261 [in Complexity.NP.TM.LM_to_mTM]
X:261 [in Complexity.Libs.CookPrelim.MorePrelim]
x:262 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:262 [in Undecidability.TM.Hoare.HoareLogic]
x:262 [in Complexity.NP.TM.LM_to_mTM]
X:263 [in Undecidability.Shared.Libs.DLW.Vec.vec]
x:263 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:263 [in Undecidability.TM.Hoare.HoareLogic]
x:263 [in Complexity.NP.TM.LM_to_mTM]
X:264 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:264 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:264 [in Complexity.L.TM.TMflatComp]
x:264 [in Undecidability.TM.Code.Copy]
x:264 [in Complexity.NP.TM.LM_to_mTM]
X:2647 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
x:265 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:265 [in Complexity.NP.TM.LM_to_mTM]
X:2655 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
x:266 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:266 [in Complexity.L.TM.TMflatComp]
x:266 [in Complexity.NP.TM.LM_to_mTM]
X:266 [in Complexity.Libs.CookPrelim.MorePrelim]
x:267 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:267 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
x:267 [in Complexity.NP.TM.LM_to_mTM]
X:2673 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
X:268 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:268 [in Complexity.NP.TM.mTM_to_singleTapeTM]
X:268 [in Undecidability.TM.Code.Copy]
X:268 [in Undecidability.TM.Hoare.HoareLogic]
x:268 [in Complexity.NP.TM.LM_to_mTM]
x:269 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
x:269 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:269 [in Complexity.NP.TM.LM_to_mTM]
X:269 [in Complexity.Libs.CookPrelim.MorePrelim]
X:2690 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
X:2697 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
x:27 [in Undecidability.L.Prelim.ARS]
x:27 [in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
x:27 [in Undecidability.Shared.Libs.DLW.Utils.fin_dec]
X:27 [in Undecidability.TM.Code.CaseList]
X:27 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
X:27 [in Undecidability.L.Datatypes.List.List_basics]
x:27 [in Undecidability.L.Functions.LoopSum]
X:27 [in Undecidability.Shared.Libs.PSL.EqDec]
x:27 [in Complexity.TM.Code.Decode]
x:27 [in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
x:27 [in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
X:27 [in Undecidability.Synthetic.EnumerabilityFacts]
x:27 [in Undecidability.Shared.FinTypeEquiv]
x:27 [in Undecidability.Shared.Libs.PSL.FiniteTypes.VectorFin]
X:27 [in Undecidability.L.Complexity.UpToC]
x:27 [in Complexity.TM.PrettyBounds.BaseCodeSpace]
x:27 [in Complexity.NP.L.GenNPBool]
x:27 [in Complexity.Libs.UniformHomomorphisms]
x:27 [in Undecidability.TM.Code.WriteValue]
x:27 [in Complexity.L.Functions.BinNumsSub]
x:27 [in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
X:27 [in Undecidability.Shared.Libs.DLW.Utils.fin_base]
X:27 [in Undecidability.Shared.Libs.PSL.FiniteTypes.Arbitrary]
x:27 [in Undecidability.L.Functions.UnboundIteration]
x:27 [in Undecidability.TM.Util.Relations]
X:27 [in Undecidability.Synthetic.ListEnumerabilityFacts]
x:27 [in Undecidability.TM.Code.Copy]
x:27 [in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
x:27 [in Undecidability.TM.L.Eval]
x:27 [in Undecidability.L.Tactics.Reflection]
X:27 [in Undecidability.Synthetic.DecidabilityFacts]
x:27 [in Undecidability.L.TM.TMEncoding]
x:27 [in Undecidability.Shared.Libs.PSL.Vectors.VectorDupfree]
x:27 [in Undecidability.Shared.Libs.PSL.Lists.Cardinality]
x:27 [in Undecidability.TM.Code.Code]
x:27 [in Undecidability.L.Computability.Synthetic]
x:27 [in Undecidability.L.Functions.FinTypeLookup]
X:27 [in Undecidability.Shared.ListAutomation]
X:27 [in Undecidability.L.Datatypes.List.List_fold]
x:27 [in Undecidability.TM.Univ.LookupAssociativeListTM]
x:27 [in Undecidability.L.Functions.Decoding]
x:27 [in Undecidability.TM.Code.CasePair]
X:27 [in Undecidability.TM.Hoare.HoareExamples]
X:27 [in Undecidability.TM.Code.List.App]
x:27 [in Complexity.TM.PrettyBounds.PrettyBounds]
x:27 [in Undecidability.L.Prelim.MoreList]
x:270 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
x:270 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:270 [in Complexity.NP.TM.LM_to_mTM]
x:270 [in Complexity.Libs.CookPrelim.MorePrelim]
x:271 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:271 [in Undecidability.TM.Code.Copy]
x:271 [in Complexity.NP.TM.LM_to_mTM]
x:272 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:272 [in Complexity.NP.TM.LM_to_mTM]
x:273 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:273 [in Undecidability.TM.Hoare.HoareLogic]
x:273 [in Complexity.NP.TM.LM_to_mTM]
x:274 [in Complexity.NP.TM.mTM_to_singleTapeTM]
X:274 [in Undecidability.TM.Code.Copy]
x:274 [in Undecidability.TM.Hoare.HoareLogic]
x:274 [in Complexity.NP.TM.LM_to_mTM]
x:275 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:275 [in Complexity.NP.TM.LM_to_mTM]
X:275 [in Complexity.Libs.CookPrelim.MorePrelim]
x:276 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:276 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:276 [in Complexity.NP.TM.LM_to_mTM]
x:277 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:277 [in Undecidability.TM.Code.Copy]
x:277 [in Complexity.NP.TM.LM_to_mTM]
x:278 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:278 [in Complexity.NP.TM.LM_to_mTM]
x:2788 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
x:279 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:279 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
x:279 [in Complexity.NP.TM.LM_to_mTM]
X:279 [in Complexity.Libs.CookPrelim.MorePrelim]
x:28 [in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
x:28 [in Undecidability.Shared.Libs.DLW.Utils.fin_quotient]
x:28 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
x:28 [in Undecidability.Shared.Libs.DLW.Utils.fin_dec]
x:28 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
x:28 [in Undecidability.L.Complexity.UpToCNary]
x:28 [in Complexity.TM.PrettyBounds.UnivBounds]
x:28 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
x:28 [in Undecidability.Shared.FinTypeEquiv]
x:28 [in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
x:28 [in Complexity.Complexity.Subtypes]
X:28 [in Complexity.L.ComparisonTimeBoundDerivation]
X:28 [in Complexity.Libs.CookPrelim.PolyBounds]
x:28 [in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
x:28 [in Undecidability.TM.Code.NatSub]
x:28 [in Undecidability.L.Functions.UnboundIteration]
x:28 [in Complexity.NP.TM.M_multi2mono]
X:28 [in Complexity.L.TM.TMflatFun]
x:28 [in Undecidability.TM.L.Eval]
X:28 [in Undecidability.Synthetic.DecidabilityFacts]
X:28 [in Undecidability.Shared.Dec]
x:28 [in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
x:28 [in Complexity.Complexity.Definitions]
x:28 [in Undecidability.L.Datatypes.LNat]
X:28 [in Undecidability.L.Tactics.Computable]
x:28 [in Undecidability.L.Functions.Size]
X:28 [in Undecidability.L.Prelim.MoreList]
x:280 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:280 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:280 [in Complexity.NP.TM.LM_to_mTM]
x:281 [in Complexity.NP.TM.mTM_to_singleTapeTM]
X:281 [in Undecidability.TM.Code.Copy]
x:281 [in Complexity.NP.TM.LM_to_mTM]
x:282 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:282 [in Complexity.NP.TM.LM_to_mTM]
x:283 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:283 [in Complexity.NP.TM.LM_to_mTM]
X:283 [in Complexity.Libs.CookPrelim.MorePrelim]
x:284 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:284 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:284 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
x:284 [in Undecidability.TM.Code.Copy]
x:284 [in Complexity.NP.TM.LM_to_mTM]
x:285 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:285 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
x:285 [in Complexity.NP.TM.LM_to_mTM]
x:286 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:286 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
x:286 [in Complexity.NP.TM.LM_to_mTM]
x:287 [in Complexity.NP.TM.mTM_to_singleTapeTM]
X:287 [in Undecidability.TM.Code.Copy]
x:287 [in Complexity.NP.TM.LM_to_mTM]
X:287 [in Complexity.Libs.CookPrelim.MorePrelim]
x:288 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:288 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:288 [in Complexity.NP.TM.LM_to_mTM]
x:289 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:289 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
x:289 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
x:289 [in Complexity.NP.TM.LM_to_mTM]
X:29 [in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
x:29 [in Complexity.TM.PrettyBounds.BaseCode]
x:29 [in Undecidability.Shared.Libs.DLW.Utils.fin_dec]
x:29 [in Undecidability.TM.Code.CaseList]
X:29 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
x:29 [in Undecidability.Shared.FilterFacts]
x:29 [in Undecidability.Shared.Libs.PSL.Lists.Removal]
X:29 [in Undecidability.L.Tactics.ComputableTime]
x:29 [in Undecidability.Synthetic.EnumerabilityFacts]
x:29 [in Undecidability.L.Prelim.LoopSum]
x:29 [in Undecidability.Shared.Libs.PSL.Lists.Position]
x:29 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
x:29 [in Undecidability.Shared.Libs.PSL.Lists.Filter]
x:29 [in Undecidability.Shared.FinTypeEquiv]
X:29 [in Complexity.Complexity.Subtypes]
x:29 [in Complexity.TM.Single.EncodeTapesInvariants]
x:29 [in Complexity.L.Functions.IterupN]
x:29 [in Undecidability.TM.Code.BinNumbers.NTM]
x:29 [in Complexity.L.AbstractMachines.Computable.UnivDecTime]
x:29 [in Undecidability.TM.Univ.LowLevel]
x:29 [in Complexity.L.Functions.BinNumsSub]
x:29 [in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
X:29 [in Complexity.NP.SAT.CookLevin.Subproblems.SingleTMGenNP]
x:29 [in Undecidability.L.Tactics.Lbeta_nonrefl]
x:29 [in Undecidability.Shared.Libs.PSL.FiniteTypes.Arbitrary]
x:29 [in Undecidability.Synthetic.MoreEnumerabilityFacts]
X:29 [in Undecidability.Synthetic.Definitions]
x:29 [in Undecidability.L.Functions.UnboundIteration]
X:29 [in Undecidability.TM.Util.Relations]
x:29 [in Undecidability.Shared.Libs.DLW.Wf.wf_finite]
X:29 [in Undecidability.Synthetic.ListEnumerabilityFacts]
X:29 [in Undecidability.Shared.Libs.PSL.Vectors.VectorDupfree]
X:29 [in Undecidability.L.Tactics.ComputableTactics]
X:29 [in Undecidability.Shared.Dec]
X:29 [in Undecidability.TM.Lifting.LiftTapes]
x:29 [in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
X:29 [in Complexity.Complexity.Definitions]
x:29 [in Undecidability.L.Functions.Decoding]
x:29 [in Undecidability.TM.PrettyBounds.MaxList]
x:29 [in Complexity.Libs.CookPrelim.MorePrelim]
X:29 [in Undecidability.TM.Compound.WriteString]
x:290 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:290 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:290 [in Complexity.L.TM.TMflatComp]
x:290 [in Undecidability.TM.Code.Copy]
x:290 [in Complexity.NP.TM.LM_to_mTM]
X:290 [in Complexity.Libs.CookPrelim.MorePrelim]
X:2901 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
x:2902 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
x:291 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:291 [in Complexity.L.TM.TMflatComp]
x:291 [in Complexity.NP.TM.LM_to_mTM]
X:2914 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
x:292 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:292 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
x:292 [in Complexity.NP.TM.LM_to_mTM]
X:2923 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
X:2926 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
x:293 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:293 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:293 [in Complexity.NP.TM.LM_to_mTM]
X:294 [in Undecidability.Shared.Libs.DLW.Vec.vec]
x:294 [in Complexity.NP.TM.mTM_to_singleTapeTM]
X:294 [in Undecidability.TM.Code.Copy]
x:294 [in Complexity.NP.TM.LM_to_mTM]
X:294 [in Complexity.Libs.CookPrelim.MorePrelim]
x:295 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:295 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:295 [in Complexity.NP.TM.LM_to_mTM]
X:2951 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
x:296 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:296 [in Complexity.NP.TM.LM_to_mTM]
x:297 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:297 [in Undecidability.TM.Code.Copy]
x:297 [in Complexity.NP.TM.LM_to_mTM]
x:298 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:298 [in Complexity.NP.TM.LM_to_mTM]
X:298 [in Complexity.Libs.CookPrelim.MorePrelim]
x:299 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:299 [in Complexity.NP.TM.LM_to_mTM]
x:3 [in Undecidability.Shared.Libs.PSL.Numbers]
x:3 [in Undecidability.L.Prelim.ARS]
X:3 [in Complexity.TM.PrettyBounds.BaseCode]
x:3 [in Undecidability.TM.Compound.TMTac]
x:3 [in Complexity.L.Datatypes.LBinNums]
x:3 [in Complexity.NP.L.GenNP_is_hard]
x:3 [in Undecidability.Shared.Libs.PSL.Lists.Removal]
x:3 [in Undecidability.Synthetic.SemiDecidabilityFacts]
x:3 [in Undecidability.TM.Single.StepTM]
X:3 [in Undecidability.Shared.Libs.PSL.Prelim]
x:3 [in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisUnfoldClos]
x:3 [in Undecidability.L.Tactics.LClos]
x:3 [in Undecidability.Synthetic.EnumerabilityFacts]
x:3 [in Undecidability.TM.Code.BinNumbers.EncodeBinNumbers]
x:3 [in Undecidability.Shared.Libs.DLW.Wf.acc_irr]
x:3 [in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisStep]
X:3 [in Complexity.NP.L.LMGenNP]
x:3 [in Undecidability.TM.Code.CodeTM]
X:3 [in Undecidability.TM.Code.WriteValue]
x:3 [in Complexity.Complexity.UpToCPoly]
x:3 [in Undecidability.L.Datatypes.LFinType]
X:3 [in Undecidability.Synthetic.Undecidability]
x:3 [in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicFinTypes]
x:3 [in Undecidability.Shared.Libs.DLW.Utils.fin_base]
x:3 [in Undecidability.TM.Compound.Compare]
X:3 [in Complexity.Libs.CookPrelim.Tactics]
X:3 [in Undecidability.Synthetic.MoreEnumerabilityFacts]
x:3 [in Undecidability.Synthetic.Definitions]
X:3 [in Undecidability.TM.Util.Relations]
x:3 [in Undecidability.Shared.Libs.DLW.Wf.wf_finite]
x:3 [in Complexity.TM.Single.DecodeTapes]
x:3 [in Undecidability.L.Tactics.Reflection]
x:3 [in Undecidability.Synthetic.DecidabilityFacts]
x:3 [in Undecidability.L.Tactics.ComputableTactics]
x:3 [in Complexity.L.Functions.BinNumsCompare]
X:3 [in Undecidability.TM.Lifting.LiftTapes]
x:3 [in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
x:3 [in Complexity.NP.SAT.CookLevin.Reductions.FlatTCC_to_FlatCC]
x:3 [in Undecidability.TM.PrettyBounds.MaxList]
X:3 [in Undecidability.L.Computability.Computability]
x:3 [in Undecidability.TM.Code.ProgrammingTools]
x:30 [in Complexity.Libs.Pigeonhole]
x:30 [in Undecidability.Shared.Libs.PSL.FCI]
x:30 [in Undecidability.TM.Code.BinNumbers.PosMultTM]
x:30 [in Undecidability.L.Tactics.LClos]
X:30 [in Undecidability.Synthetic.EnumerabilityFacts]
x:30 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
x:30 [in Undecidability.Shared.FinTypeEquiv]
x:30 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_nat_facts]
x:30 [in Complexity.Libs.UniformHomomorphisms]
x:30 [in Complexity.L.AbstractMachines.FlatPro.Computable.Compile]
x:30 [in Undecidability.Shared.Libs.DLW.Utils.list_bool]
x:30 [in Undecidability.TM.Code.WriteValue]
X:30 [in Complexity.Complexity.UpToCPoly]
x:30 [in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
X:30 [in Undecidability.L.Functions.EqBool]
x:30 [in Undecidability.Synthetic.MoreEnumerabilityFacts]
x:30 [in Undecidability.L.Functions.UnboundIteration]
X:30 [in Complexity.NP.TM.M_multi2mono]
x:30 [in Undecidability.TM.Code.Copy]
x:30 [in Undecidability.Synthetic.DecidabilityFacts]
X:30 [in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
X:30 [in Undecidability.Shared.Libs.PSL.Lists.Cardinality]
x:30 [in Undecidability.L.Functions.FinTypeLookup]
X:30 [in Undecidability.L.Functions.Decoding]
x:30 [in Undecidability.L.Datatypes.LNat]
x:30 [in Complexity.Complexity.PolyTimeComputable]
X:30 [in Undecidability.Shared.Libs.DLW.Vec.pos]
x:30 [in Undecidability.L.Tactics.Computable]
x:30 [in Undecidability.TM.Hoare.HoareExamples]
x:30 [in Complexity.L.AbstractMachines.Computable.LargestVar]
x:300 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:300 [in Complexity.NP.TM.mTM_to_singleTapeTM]
X:300 [in Undecidability.TM.Code.Copy]
x:300 [in Complexity.NP.TM.LM_to_mTM]
x:301 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:301 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
x:301 [in Complexity.NP.TM.LM_to_mTM]
x:302 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:302 [in Complexity.NP.TM.LM_to_mTM]
x:3026 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
x:303 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:303 [in Undecidability.TM.Code.Copy]
x:303 [in Complexity.NP.TM.LM_to_mTM]
X:303 [in Complexity.Libs.CookPrelim.MorePrelim]
X:3039 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
x:304 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:304 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:304 [in Complexity.NP.TM.LM_to_mTM]
x:305 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:305 [in Complexity.NP.TM.LM_to_mTM]
X:3054 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
x:306 [in Undecidability.Shared.Libs.DLW.Vec.vec]
x:306 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:306 [in Complexity.NP.TM.LM_to_mTM]
X:3060 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
X:3069 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
x:307 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:307 [in Complexity.NP.TM.mTM_to_singleTapeTM]
X:307 [in Undecidability.TM.Code.Copy]
x:307 [in Complexity.NP.TM.LM_to_mTM]
X:307 [in Complexity.Libs.CookPrelim.MorePrelim]
x:308 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:308 [in Complexity.NP.TM.LM_to_mTM]
X:3083 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
X:3088 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
x:309 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:309 [in Complexity.NP.TM.LM_to_mTM]
X:3094 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
X:3098 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
x:31 [in Undecidability.L.Prelim.ARS]
x:31 [in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
x:31 [in Undecidability.Shared.Libs.PSL.FCI]
x:31 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
x:31 [in Undecidability.TM.Code.BinNumbers.PosMultTM]
X:31 [in Undecidability.L.Datatypes.List.List_basics]
X:31 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
x:31 [in Undecidability.L.Tactics.ComputableTime]
x:31 [in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
X:31 [in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
x:31 [in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
x:31 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
x:31 [in Undecidability.Shared.Libs.DLW.Utils.quotient]
x:31 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_nat_facts]
x:31 [in Complexity.Libs.CookPrelim.FlatFinTypes]
x:31 [in Undecidability.Shared.Libs.DLW.Utils.interval]
x:31 [in Undecidability.L.Complexity.UpToC]
x:31 [in Undecidability.L.Datatypes.List.List_nat]
x:31 [in Undecidability.Shared.Libs.DLW.Utils.list_bool]
x:31 [in Undecidability.TM.Univ.LowLevel]
x:31 [in Complexity.L.Functions.BinNumsSub]
x:31 [in Undecidability.Shared.Libs.DLW.Utils.php]
x:31 [in Complexity.NP.SAT.CookLevin.Subproblems.SingleTMGenNP]
x:31 [in Undecidability.Shared.Libs.DLW.Utils.fin_base]
x:31 [in Undecidability.TM.Code.NatSub]
x:31 [in Undecidability.L.Computability.Decidability]
x:31 [in Undecidability.Shared.Libs.PSL.FiniteTypes.Arbitrary]
X:31 [in Undecidability.Synthetic.MoreEnumerabilityFacts]
x:31 [in Undecidability.Shared.Libs.DLW.Wf.wf_finite]
x:31 [in Undecidability.TM.L.Eval]
X:31 [in Complexity.TM.Single.DecodeTapes]
x:31 [in Undecidability.Synthetic.DecidabilityFacts]
x:31 [in Undecidability.L.TM.TMEncoding]
x:31 [in Undecidability.L.Tactics.ComputableTactics]
x:31 [in Undecidability.Shared.Dec]
x:31 [in Undecidability.Synthetic.Infinite]
x:31 [in Complexity.TM.PrettyBounds.PrettyBounds]
x:310 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:310 [in Undecidability.TM.Code.Copy]
x:310 [in Complexity.NP.TM.LM_to_mTM]
x:310 [in Complexity.Libs.CookPrelim.MorePrelim]
X:3102 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
X:3108 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
x:311 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:311 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:311 [in Complexity.NP.TM.LM_to_mTM]
x:312 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:312 [in Complexity.NP.TM.LM_to_mTM]
x:312 [in Complexity.Libs.CookPrelim.MorePrelim]
X:3121 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
x:313 [in Complexity.NP.TM.mTM_to_singleTapeTM]
X:313 [in Undecidability.TM.Code.Copy]
x:313 [in Complexity.NP.TM.LM_to_mTM]
X:313 [in Complexity.Libs.CookPrelim.MorePrelim]
x:314 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:314 [in Complexity.NP.TM.LM_to_mTM]
x:315 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:315 [in Complexity.NP.TM.LM_to_mTM]
X:3159 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
x:316 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:316 [in Undecidability.TM.Code.Copy]
x:316 [in Complexity.NP.TM.LM_to_mTM]
X:3168 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
x:317 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:317 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:317 [in Undecidability.Shared.Libs.DLW.Code.sss]
x:317 [in Complexity.NP.TM.LM_to_mTM]
X:3176 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
x:318 [in Complexity.NP.TM.mTM_to_singleTapeTM]
X:318 [in Undecidability.TM.Hoare.HoareLogic]
x:318 [in Complexity.NP.TM.LM_to_mTM]
X:3186 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
x:319 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:319 [in Complexity.NP.TM.LM_to_mTM]
X:3197 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
x:3198 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
x:32 [in Undecidability.TM.Combinators.Combinators]
x:32 [in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
x:32 [in Undecidability.Shared.Libs.PSL.FCI]
X:32 [in Undecidability.TM.Code.CaseList]
x:32 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
x:32 [in Undecidability.Shared.Libs.PSL.Lists.Removal]
X:32 [in Undecidability.Shared.Libs.PSL.EqDec]
x:32 [in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
X:32 [in Undecidability.TM.Util.VectorPrelim]
X:32 [in Undecidability.TM.Code.List.Length]
x:32 [in Undecidability.Shared.Libs.PSL.Lists.Position]
x:32 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
x:32 [in Undecidability.Shared.Libs.DLW.Utils.interval]
x:32 [in Complexity.L.AbstractMachines.Computable.UnivDecTime]
X:32 [in Undecidability.L.Complexity.UpToC]
x:32 [in Complexity.TM.PrettyBounds.BaseCodeSpace]
X:32 [in Complexity.Libs.CookPrelim.PolyBounds]
X:32 [in Undecidability.TM.Code.CompareValue]
X:32 [in Undecidability.TM.Univ.LowLevel]
x:32 [in Undecidability.TM.Code.WriteValue]
X:32 [in Undecidability.Shared.Libs.DLW.Utils.fin_base]
X:32 [in Undecidability.L.Datatypes.List.List_eqb]
x:32 [in Undecidability.TM.Code.Copy]
x:32 [in Undecidability.Synthetic.DecidabilityFacts]
x:32 [in Undecidability.L.Datatypes.List.List_in]
x:32 [in Undecidability.L.TM.TMEncoding]
X:32 [in Undecidability.TM.Lifting.LiftTapes]
x:32 [in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
x:32 [in Undecidability.Shared.ListAutomation]
x:32 [in Undecidability.L.Datatypes.LNat]
X:32 [in Complexity.Complexity.PolyTimeComputable]
x:32 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
x:32 [in Complexity.Complexity.NP]
x:32 [in Undecidability.Synthetic.ReducibilityFacts]
x:32 [in Undecidability.L.Prelim.MoreList]
X:320 [in Undecidability.TM.Single.StepTM]
x:320 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:320 [in Complexity.NP.TM.mTM_to_singleTapeTM]
X:320 [in Undecidability.TM.Code.Copy]
x:320 [in Complexity.NP.TM.LM_to_mTM]
X:320 [in Complexity.Libs.CookPrelim.MorePrelim]
X:3205 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
x:3206 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
x:321 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:321 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:321 [in Undecidability.Shared.Libs.DLW.Code.sss]
x:321 [in Complexity.NP.TM.LM_to_mTM]
x:322 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:322 [in Complexity.NP.TM.LM_to_mTM]
X:3220 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
x:323 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:323 [in Undecidability.TM.Code.Copy]
x:323 [in Undecidability.TM.Hoare.HoareLogic]
x:323 [in Complexity.NP.TM.LM_to_mTM]
x:3230 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
x:324 [in Complexity.NP.TM.mTM_to_singleTapeTM]
X:324 [in Undecidability.TM.Code.Copy]
x:324 [in Undecidability.TM.Hoare.HoareLogic]
x:324 [in Complexity.NP.TM.LM_to_mTM]
x:325 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:325 [in Undecidability.L.Tactics.Reflection]
x:325 [in Complexity.NP.TM.LM_to_mTM]
x:326 [in Complexity.NP.TM.mTM_to_singleTapeTM]
X:326 [in Undecidability.TM.Hoare.HoareCombinators]
x:326 [in Undecidability.Shared.Libs.DLW.Code.sss]
x:326 [in Complexity.NP.TM.LM_to_mTM]
X:326 [in Complexity.Libs.CookPrelim.MorePrelim]
x:327 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:327 [in Complexity.NP.TM.LM_to_mTM]
x:328 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:328 [in Complexity.NP.TM.mTM_to_singleTapeTM]
X:328 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
x:328 [in Undecidability.Shared.Libs.DLW.Code.sss]
x:328 [in Complexity.NP.TM.LM_to_mTM]
x:329 [in Complexity.NP.TM.mTM_to_singleTapeTM]
X:329 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
X:329 [in Undecidability.TM.Hoare.HoareLogic]
x:329 [in Complexity.NP.TM.LM_to_mTM]
X:329 [in Complexity.Libs.CookPrelim.MorePrelim]
x:33 [in Undecidability.Shared.Libs.PSL.Numbers]
x:33 [in Undecidability.TM.Combinators.Combinators]
x:33 [in Undecidability.L.Prelim.ARS]
X:33 [in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
X:33 [in Complexity.TM.PrettyBounds.BaseCode]
x:33 [in Undecidability.Shared.Libs.PSL.FCI]
x:33 [in Undecidability.Shared.FilterFacts]
x:33 [in Undecidability.TM.Code.BinNumbers.PosMultTM]
x:33 [in Undecidability.L.Complexity.UpToCNary]
X:33 [in Complexity.TM.PrettyBounds.UnivBounds]
x:33 [in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
X:33 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
x:33 [in Undecidability.Shared.Libs.PSL.Lists.Filter]
x:33 [in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
X:33 [in Complexity.Libs.CookPrelim.FlatFinTypes]
x:33 [in Undecidability.Shared.Libs.DLW.Utils.interval]
x:33 [in Complexity.Libs.UniformHomomorphisms]
X:33 [in Complexity.Complexity.UpToCPoly]
X:33 [in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
x:33 [in Undecidability.TM.Util.Relations]
X:33 [in Complexity.NP.TM.M_multi2mono]
x:33 [in Undecidability.TM.L.Eval]
X:33 [in Undecidability.Synthetic.DecidabilityFacts]
x:33 [in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
X:33 [in Undecidability.TM.Univ.LookupAssociativeListTM]
x:33 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
X:33 [in Undecidability.TM.Hoare.HoareExamples]
x:33 [in Undecidability.L.Functions.Size]
x:33 [in Complexity.TM.PrettyBounds.PrettyBounds]
X:33 [in Undecidability.L.Prelim.MoreList]
x:330 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:330 [in Undecidability.TM.Code.Copy]
x:330 [in Undecidability.TM.Hoare.HoareCombinators]
x:330 [in Complexity.NP.TM.LM_to_mTM]
x:331 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:331 [in Undecidability.TM.Hoare.HoareCombinators]
x:331 [in Undecidability.Shared.Libs.DLW.Code.sss]
x:331 [in Complexity.NP.TM.LM_to_mTM]
x:332 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:332 [in Complexity.NP.TM.LM_to_mTM]
x:333 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:333 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
x:333 [in Complexity.NP.TM.LM_to_mTM]
x:334 [in Complexity.NP.TM.mTM_to_singleTapeTM]
X:334 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
x:334 [in Complexity.NP.TM.LM_to_mTM]
X:334 [in Complexity.Libs.CookPrelim.MorePrelim]
x:335 [in Complexity.NP.TM.mTM_to_singleTapeTM]
X:335 [in Undecidability.TM.Code.Copy]
x:335 [in Undecidability.TM.Hoare.HoareLogic]
x:335 [in Undecidability.Shared.Libs.DLW.Code.sss]
x:335 [in Complexity.NP.TM.LM_to_mTM]
x:336 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:336 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
x:336 [in Undecidability.TM.Hoare.HoareLogic]
x:336 [in Complexity.NP.TM.LM_to_mTM]
x:337 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:337 [in Undecidability.TM.Hoare.HoareCombinators]
x:337 [in Complexity.NP.TM.LM_to_mTM]
x:338 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:338 [in Complexity.NP.TM.LM_to_mTM]
x:339 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:339 [in Complexity.NP.TM.LM_to_mTM]
x:339 [in Complexity.Libs.CookPrelim.MorePrelim]
x:34 [in Undecidability.TM.Combinators.Combinators]
x:34 [in Undecidability.TM.Code.CaseList]
X:34 [in Undecidability.L.Tactics.Lrewrite]
X:34 [in Undecidability.Shared.Libs.PSL.EqDec]
x:34 [in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
X:34 [in Undecidability.Synthetic.EnumerabilityFacts]
x:34 [in Undecidability.L.Prelim.LoopSum]
X:34 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_nat_facts]
x:34 [in Undecidability.TM.Util.Prelim]
x:34 [in Undecidability.Shared.Libs.DLW.Utils.interval]
x:34 [in Complexity.L.Functions.IterupN]
x:34 [in Undecidability.TM.Code.BinNumbers.NTM]
x:34 [in Complexity.NP.SAT.SAT_inNP]
x:34 [in Undecidability.L.Datatypes.List.List_extra]
x:34 [in Complexity.L.AbstractMachines.FlatPro.Computable.Compile]
x:34 [in Undecidability.Shared.Libs.DLW.Utils.php]
X:34 [in Undecidability.Shared.Libs.PSL.FiniteTypes.Arbitrary]
x:34 [in Undecidability.Synthetic.MoreEnumerabilityFacts]
x:34 [in Undecidability.Synthetic.Definitions]
x:34 [in Undecidability.TM.L.Eval]
x:34 [in Undecidability.Shared.Libs.PSL.Vectors.VectorDupfree]
X:34 [in Complexity.Complexity.Definitions]
x:34 [in Undecidability.L.Datatypes.LNat]
X:34 [in Undecidability.L.Tactics.Computable]
x:340 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:340 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:340 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
x:340 [in Complexity.NP.TM.LM_to_mTM]
x:341 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:341 [in Undecidability.TM.Code.Copy]
X:341 [in Undecidability.TM.Hoare.HoareLogic]
x:341 [in Undecidability.TM.Hoare.HoareCombinators]
x:341 [in Complexity.NP.TM.LM_to_mTM]
x:342 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:342 [in Complexity.NP.TM.LM_to_mTM]
X:343 [in Undecidability.Shared.Libs.DLW.Vec.vec]
x:343 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:343 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
x:343 [in Complexity.NP.TM.LM_to_mTM]
x:344 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:344 [in Complexity.NP.TM.LM_to_mTM]
x:345 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:345 [in Complexity.NP.TM.LM_to_mTM]
x:346 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:346 [in Undecidability.TM.Hoare.HoareLogic]
x:346 [in Undecidability.TM.Hoare.HoareCombinators]
x:346 [in Complexity.NP.TM.LM_to_mTM]
x:347 [in Complexity.NP.TM.mTM_to_singleTapeTM]
X:347 [in Undecidability.TM.Code.Copy]
x:347 [in Undecidability.TM.Hoare.HoareLogic]
x:347 [in Complexity.NP.TM.LM_to_mTM]
x:348 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:348 [in Complexity.NP.TM.LM_to_mTM]
x:349 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:349 [in Complexity.NP.TM.LM_to_mTM]
X:35 [in Undecidability.Shared.Libs.PSL.Numbers]
x:35 [in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
x:35 [in Complexity.TM.PrettyBounds.BaseCode]
x:35 [in Complexity.TM.Code.Decode]
X:35 [in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
x:35 [in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
X:35 [in Undecidability.L.Prelim.LoopSum]
X:35 [in Complexity.Libs.CookPrelim.FlatFinTypes]
x:35 [in Undecidability.L.Datatypes.List.List_extra]
X:35 [in Complexity.Libs.CookPrelim.PolyBounds]
x:35 [in Undecidability.Shared.Libs.DLW.Utils.fin_upto]
X:35 [in Complexity.L.TM.TMunflatten]
x:35 [in Undecidability.TM.Code.NatSub]
X:35 [in Undecidability.Synthetic.Definitions]
x:35 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
x:35 [in Undecidability.Synthetic.ListEnumerabilityFacts]
x:35 [in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
x:35 [in Undecidability.L.Tactics.ComputableTactics]
x:35 [in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
x:35 [in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
x:35 [in Undecidability.TM.Code.Code]
x:35 [in Undecidability.Shared.ListAutomation]
x:35 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
X:35 [in Undecidability.Shared.Libs.DLW.Vec.pos]
X:35 [in Undecidability.TM.Code.CasePair]
x:35 [in Complexity.L.AbstractMachines.Computable.LargestVar]
x:35 [in Complexity.TM.PrettyBounds.PrettyBounds]
x:350 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:350 [in Complexity.NP.TM.LM_to_mTM]
x:351 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:351 [in Undecidability.TM.Hoare.HoareCombinators]
x:351 [in Complexity.NP.TM.LM_to_mTM]
x:352 [in Complexity.NP.TM.mTM_to_singleTapeTM]
X:352 [in Undecidability.TM.Hoare.HoareLogic]
x:352 [in Complexity.NP.TM.LM_to_mTM]
X:353 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:353 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:353 [in Undecidability.TM.Code.Copy]
x:353 [in Complexity.NP.TM.LM_to_mTM]
x:354 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:354 [in Complexity.NP.TM.LM_to_mTM]
x:355 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:355 [in Complexity.NP.TM.LM_to_mTM]
x:356 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:356 [in Undecidability.TM.Hoare.HoareCombinators]
x:356 [in Complexity.NP.TM.LM_to_mTM]
x:357 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:357 [in Complexity.NP.TM.LM_to_mTM]
X:3578 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
x:358 [in Complexity.NP.TM.mTM_to_singleTapeTM]
X:358 [in Undecidability.TM.Code.Copy]
x:358 [in Complexity.NP.TM.LM_to_mTM]
x:359 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:359 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:359 [in Undecidability.TM.Hoare.HoareLogic]
x:359 [in Complexity.NP.TM.LM_to_mTM]
X:3593 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
x:36 [in Undecidability.L.Prelim.ARS]
x:36 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
x:36 [in Complexity.L.AbstractMachines.Computable.EvalForTime]
x:36 [in Undecidability.L.Tactics.Lrewrite]
x:36 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
x:36 [in Undecidability.Shared.Libs.PSL.Lists.Removal]
X:36 [in Undecidability.L.Datatypes.LOptions]
X:36 [in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
X:36 [in Undecidability.Shared.Libs.PSL.EqDec]
x:36 [in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
x:36 [in Undecidability.L.Tactics.GenEncode]
x:36 [in Undecidability.Shared.Libs.PSL.Lists.Position]
x:36 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
x:36 [in Undecidability.Shared.Libs.DLW.Utils.quotient]
x:36 [in Undecidability.TM.Util.Prelim]
x:36 [in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
x:36 [in Undecidability.L.Complexity.UpToC]
X:36 [in Undecidability.Shared.Libs.DLW.Utils.fin_upto]
x:36 [in Undecidability.L.Functions.EqBool]
X:36 [in Undecidability.Shared.Libs.DLW.Utils.fin_base]
x:36 [in Undecidability.Shared.Libs.PSL.FiniteTypes.Arbitrary]
x:36 [in Undecidability.Shared.Libs.PSL.Lists.Power]
x:36 [in Undecidability.TM.L.Eval]
x:36 [in Undecidability.Synthetic.DecidabilityFacts]
x:36 [in Undecidability.L.Tactics.ComputableTactics]
X:36 [in Undecidability.Shared.Dec]
x:36 [in Undecidability.TM.Code.Code]
x:36 [in Undecidability.L.Computability.Synthetic]
x:36 [in Undecidability.Synthetic.Infinite]
x:36 [in Undecidability.L.Tactics.Computable]
X:36 [in Complexity.Complexity.NP]
x:36 [in Undecidability.TM.Hoare.HoareExamples]
x:360 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:360 [in Undecidability.TM.Hoare.HoareLogic]
x:360 [in Complexity.NP.TM.LM_to_mTM]
x:3607 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
x:3608 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
x:3609 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
X:361 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:361 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:361 [in Undecidability.TM.Hoare.HoareCombinators]
x:361 [in Complexity.NP.TM.LM_to_mTM]
x:3610 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
x:362 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:362 [in Complexity.NP.TM.LM_to_mTM]
X:3626 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
x:363 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:363 [in Complexity.NP.TM.LM_to_mTM]
x:3634 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
x:3635 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
x:3636 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
x:3637 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
X:3638 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
X:364 [in Undecidability.Shared.Libs.DLW.Vec.vec]
x:364 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:364 [in Undecidability.TM.Code.Copy]
x:364 [in Complexity.NP.TM.LM_to_mTM]
X:3643 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
X:3646 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
X:365 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:365 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:365 [in Complexity.NP.TM.LM_to_mTM]
X:3651 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
X:3654 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
x:366 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:366 [in Complexity.NP.TM.LM_to_mTM]
x:367 [in Complexity.NP.TM.mTM_to_singleTapeTM]
X:367 [in Undecidability.TM.Hoare.HoareCombinators]
x:367 [in Complexity.NP.TM.LM_to_mTM]
X:368 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
x:368 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:368 [in Complexity.NP.TM.LM_to_mTM]
X:3687 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
X:369 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:369 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:369 [in Undecidability.TM.Util.TM_facts]
x:369 [in Complexity.NP.TM.LM_to_mTM]
X:3690 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
X:3699 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
x:37 [in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
x:37 [in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
x:37 [in Complexity.Complexity.ONotation]
x:37 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
X:37 [in Undecidability.TM.Code.List.Nth]
x:37 [in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
x:37 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:37 [in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
x:37 [in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
x:37 [in Undecidability.L.Prelim.LoopSum]
x:37 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
X:37 [in Undecidability.Shared.Libs.PSL.Lists.Filter]
x:37 [in Undecidability.Shared.Libs.DLW.Utils.quotient]
x:37 [in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
x:37 [in Complexity.Complexity.Subtypes]
x:37 [in Complexity.TM.Single.EncodeTapesInvariants]
X:37 [in Undecidability.L.Complexity.UpToC]
x:37 [in Complexity.Complexity.ONotationIsAppropriate]
X:37 [in Complexity.Complexity.UpToCPoly]
x:37 [in Undecidability.L.Functions.UnboundIteration]
X:37 [in Undecidability.TM.Util.Relations]
x:37 [in Undecidability.TM.Code.Copy]
x:37 [in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
x:37 [in Undecidability.TM.L.Eval]
x:37 [in Undecidability.L.Tactics.Reflection]
x:37 [in Undecidability.Synthetic.DecidabilityFacts]
x:37 [in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
x:37 [in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
X:37 [in Undecidability.TM.Code.Code]
x:37 [in Undecidability.Shared.Libs.DLW.Vec.pos]
x:37 [in Undecidability.TM.Code.CasePair]
X:37 [in Undecidability.TM.Hoare.HoareExamples]
X:37 [in Undecidability.TM.Single.EncodeTapes]
x:370 [in Complexity.NP.TM.mTM_to_singleTapeTM]
X:370 [in Undecidability.TM.Code.Copy]
x:370 [in Complexity.NP.TM.LM_to_mTM]
x:3702 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
x:371 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:371 [in Undecidability.TM.Hoare.HoareCombinators]
x:371 [in Complexity.NP.TM.LM_to_mTM]
x:372 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:372 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:372 [in Complexity.NP.TM.LM_to_mTM]
x:373 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:373 [in Undecidability.TM.Hoare.HoareCombinators]
x:373 [in Complexity.NP.TM.LM_to_mTM]
x:374 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:374 [in Complexity.NP.TM.LM_to_mTM]
x:375 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:375 [in Complexity.NP.TM.LM_to_mTM]
X:376 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:376 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:376 [in Undecidability.TM.Code.Copy]
x:376 [in Complexity.NP.TM.LM_to_mTM]
x:377 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:377 [in Undecidability.TM.Hoare.HoareCombinators]
x:377 [in Complexity.NP.TM.LM_to_mTM]
x:378 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:378 [in Complexity.NP.TM.LM_to_mTM]
x:379 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:379 [in Complexity.NP.TM.LM_to_mTM]
x:38 [in Undecidability.Shared.Libs.PSL.Numbers]
x:38 [in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
X:38 [in Complexity.TM.PrettyBounds.BaseCode]
x:38 [in Undecidability.Shared.Libs.PSL.FCI]
x:38 [in Complexity.Complexity.ONotation]
x:38 [in Undecidability.L.Complexity.UpToCNary]
X:38 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
x:38 [in Complexity.TM.PrettyBounds.UnivBounds]
X:38 [in Undecidability.Shared.Libs.PSL.EqDec]
X:38 [in Undecidability.TM.Util.VectorPrelim]
x:38 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
x:38 [in Undecidability.TM.Compound.MoveToSymbol]
x:38 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_nat_facts]
x:38 [in Complexity.Libs.CookPrelim.FlatFinTypes]
X:38 [in Complexity.Libs.CookPrelim.PolyBounds]
x:38 [in Complexity.L.AbstractMachines.FlatPro.Computable.Compile]
x:38 [in Undecidability.TM.Code.WriteValue]
x:38 [in Complexity.Complexity.ONotationIsAppropriate]
X:38 [in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
x:38 [in Undecidability.Shared.Libs.DLW.Utils.fin_base]
x:38 [in Undecidability.L.Tactics.Lbeta_nonrefl]
x:38 [in Undecidability.TM.Code.NatSub]
x:38 [in Undecidability.Shared.Libs.PSL.FiniteTypes.Arbitrary]
X:38 [in Undecidability.Synthetic.MoreEnumerabilityFacts]
x:38 [in Undecidability.TM.Code.ChangeAlphabet]
X:38 [in Undecidability.Synthetic.ListEnumerabilityFacts]
x:38 [in Complexity.TM.Single.DecodeTapes]
x:38 [in Undecidability.Synthetic.DecidabilityFacts]
X:38 [in Undecidability.Shared.Dec]
X:38 [in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
x:38 [in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
x:38 [in Undecidability.Shared.ListAutomation]
x:38 [in Undecidability.TM.Univ.LookupAssociativeListTM]
X:38 [in Undecidability.L.Functions.Decoding]
x:38 [in Undecidability.L.Datatypes.LNat]
X:38 [in Complexity.NP.SAT.CookLevin.Subproblems.CC]
X:38 [in Undecidability.TM.Code.List.App]
x:38 [in Undecidability.L.Functions.Size]
x:38 [in Complexity.TM.PrettyBounds.PrettyBounds]
x:380 [in Complexity.NP.TM.mTM_to_singleTapeTM]
X:380 [in Undecidability.TM.Code.Copy]
x:380 [in Complexity.NP.TM.LM_to_mTM]
x:381 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:381 [in Complexity.NP.TM.LM_to_mTM]
x:382 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:382 [in Complexity.NP.TM.LM_to_mTM]
x:383 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:383 [in Complexity.NP.TM.LM_to_mTM]
X:384 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:384 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:384 [in Undecidability.TM.Code.Copy]
X:384 [in Undecidability.TM.Hoare.HoareCombinators]
x:384 [in Complexity.NP.TM.LM_to_mTM]
x:385 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:385 [in Complexity.NP.TM.LM_to_mTM]
x:386 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:386 [in Complexity.NP.TM.LM_to_mTM]
x:387 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:387 [in Complexity.NP.TM.LM_to_mTM]
x:388 [in Complexity.NP.TM.mTM_to_singleTapeTM]
X:388 [in Undecidability.TM.Code.Copy]
x:388 [in Complexity.NP.TM.LM_to_mTM]
x:389 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:389 [in Complexity.NP.TM.LM_to_mTM]
x:39 [in Undecidability.Shared.Libs.PSL.Numbers]
x:39 [in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
x:39 [in Undecidability.Shared.Libs.PSL.Lists.Removal]
x:39 [in Undecidability.Shared.Libs.DLW.Utils.prime]
X:39 [in Undecidability.Shared.Libs.PSL.EqDec]
x:39 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:39 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
X:39 [in Complexity.Libs.CookPrelim.FlatFinTypes]
x:39 [in Complexity.Complexity.Subtypes]
x:39 [in Complexity.NP.SAT.SAT_inNP]
x:39 [in Undecidability.TM.Univ.LowLevel]
x:39 [in Undecidability.L.Functions.EqBool]
X:39 [in Undecidability.Shared.Libs.PSL.FiniteTypes.Arbitrary]
X:39 [in Complexity.L.TM.TMflatten]
x:39 [in Undecidability.TM.Code.Copy]
X:39 [in Undecidability.Synthetic.DecidabilityFacts]
x:39 [in Undecidability.Shared.Libs.PSL.Vectors.VectorDupfree]
x:39 [in Undecidability.TM.Code.Code]
x:39 [in Undecidability.L.Computability.Synthetic]
x:39 [in Undecidability.Synthetic.Infinite]
X:39 [in Complexity.Libs.CookPrelim.MorePrelim]
x:390 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:390 [in Undecidability.TM.Hoare.HoareCombinators]
x:390 [in Complexity.NP.TM.LM_to_mTM]
x:391 [in Undecidability.Shared.Libs.DLW.Vec.vec]
x:391 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:391 [in Undecidability.TM.Hoare.HoareCombinators]
x:391 [in Complexity.NP.TM.LM_to_mTM]
X:392 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:392 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:392 [in Undecidability.TM.Code.Copy]
x:392 [in Complexity.NP.TM.LM_to_mTM]
x:393 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:393 [in Undecidability.TM.Util.TM_facts]
x:393 [in Complexity.NP.TM.LM_to_mTM]
x:394 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:394 [in Complexity.NP.TM.LM_to_mTM]
x:395 [in Undecidability.Shared.Libs.DLW.Vec.vec]
x:395 [in Complexity.NP.TM.mTM_to_singleTapeTM]
X:395 [in Undecidability.TM.Code.Copy]
x:395 [in Complexity.NP.TM.LM_to_mTM]
x:396 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:396 [in Complexity.NP.TM.LM_to_mTM]
x:397 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:397 [in Undecidability.TM.Hoare.HoareCombinators]
x:397 [in Complexity.NP.TM.LM_to_mTM]
x:398 [in Undecidability.Shared.Libs.DLW.Vec.vec]
x:398 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:398 [in Complexity.NP.TM.LM_to_mTM]
x:399 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:399 [in Undecidability.TM.Code.Copy]
x:399 [in Complexity.NP.TM.LM_to_mTM]
x:4 [in Complexity.Libs.Pigeonhole]
x:4 [in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
x:4 [in Undecidability.Shared.Libs.DLW.Utils.fin_dec]
x:4 [in Undecidability.TM.Compound.TMTac]
x:4 [in Undecidability.L.Complexity.UpToCNary]
X:4 [in Undecidability.TM.Single.StepTM]
x:4 [in Complexity.L.Datatypes.LDepPair]
X:4 [in Undecidability.Shared.Libs.PSL.EqDec]
x:4 [in Complexity.TM.Code.Decode]
x:4 [in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
X:4 [in Undecidability.TM.Hoare.HoareLegacy]
X:4 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
x:4 [in Undecidability.Shared.Libs.DLW.Utils.quotient]
x:4 [in Undecidability.L.Datatypes.Lists]
x:4 [in Complexity.Complexity.Subtypes]
x:4 [in Complexity.L.Functions.IterupN]
x:4 [in Undecidability.L.Prelim.MoreBase]
x:4 [in Undecidability.L.Tactics.ComputableDemo]
x:4 [in Undecidability.Shared.Libs.DLW.Wf.wf_incl]
X:4 [in Undecidability.L.Datatypes.LVector]
X:4 [in Complexity.L.TM.TMflatComp]
X:4 [in Undecidability.L.Datatypes.List.List_nat]
x:4 [in Complexity.Complexity.UpToCPoly]
x:4 [in Undecidability.Shared.Libs.DLW.Utils.php]
x:4 [in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicFinTypes]
x:4 [in Undecidability.L.Functions.EqBool]
X:4 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
X:4 [in Undecidability.Shared.Libs.DLW.Utils.fin_base]
x:4 [in Undecidability.L.Datatypes.List.List_eqb]
X:4 [in Undecidability.Synthetic.InformativeDefinitions]
x:4 [in Undecidability.Shared.Libs.PSL.Lists.Dupfree]
x:4 [in Complexity.TM.Single.DecodeTapes]
x:4 [in Undecidability.L.Functions.EnumInt]
X:4 [in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
x:4 [in Undecidability.Synthetic.Infinite]
x:4 [in Complexity.NP.SAT.CookLevin.Reductions.FlatTCC_to_FlatCC]
X:4 [in Undecidability.Shared.ListAutomation]
x:4 [in Undecidability.Shared.Libs.PSL.FiniteTypes.Cardinality]
x:4 [in Undecidability.Shared.Libs.DLW.Utils.seteq]
x:4 [in Undecidability.TM.PrettyBounds.MaxList]
X:4 [in Undecidability.TM.L.CompilerBoolFuns.Compiler]
X:4 [in Undecidability.L.Functions.Encoding]
x:4 [in Undecidability.TM.Code.ProgrammingTools]
x:4 [in Undecidability.TM.Hoare.HoareExamples]
x:4 [in Undecidability.Shared.Libs.PSL.FiniteTypes.FiniteFunction]
X:4 [in Undecidability.L.AbstractMachines.LargestVar]
x:40 [in Complexity.Libs.Pigeonhole]
x:40 [in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
x:40 [in Complexity.TM.PrettyBounds.BaseCode]
x:40 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
x:40 [in Complexity.L.AbstractMachines.Computable.EvalForTime]
X:40 [in Undecidability.L.Tactics.Lrewrite]
x:40 [in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
x:40 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
x:40 [in Undecidability.TM.Compound.MoveToSymbol]
x:40 [in Undecidability.Shared.Libs.DLW.Utils.quotient]
x:40 [in Complexity.Complexity.Subtypes]
x:40 [in Undecidability.TM.Code.BinNumbers.NTM]
X:40 [in Complexity.Libs.UniformHomomorphisms]
x:40 [in Undecidability.Shared.Libs.DLW.Utils.fin_upto]
x:40 [in Undecidability.TM.Code.CaseSum]
X:40 [in Complexity.Complexity.SpaceBoundsTime]
x:40 [in Complexity.L.AbstractMachines.AbstractHeapMachine]
x:40 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
x:40 [in Undecidability.TM.Code.ChangeAlphabet]
X:40 [in Undecidability.Synthetic.ListEnumerabilityFacts]
x:40 [in Undecidability.L.Tactics.ComputableTactics]
X:40 [in Undecidability.Shared.Dec]
x:40 [in Undecidability.L.Datatypes.LNat]
x:40 [in Undecidability.L.Tactics.Computable]
x:40 [in Complexity.L.AbstractMachines.Computable.LargestVar]
X:400 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:400 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:400 [in Complexity.NP.TM.LM_to_mTM]
x:401 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:401 [in Undecidability.TM.Hoare.HoareCombinators]
x:401 [in Complexity.NP.TM.LM_to_mTM]
x:402 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:402 [in Complexity.NP.TM.LM_to_mTM]
x:403 [in Complexity.NP.TM.mTM_to_singleTapeTM]
X:403 [in Undecidability.TM.Code.Copy]
x:403 [in Complexity.NP.TM.LM_to_mTM]
x:404 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:404 [in Undecidability.TM.Hoare.HoareCombinators]
x:404 [in Complexity.NP.TM.LM_to_mTM]
x:405 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:405 [in Complexity.NP.TM.LM_to_mTM]
x:406 [in Undecidability.Shared.Libs.DLW.Vec.vec]
x:406 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:406 [in Complexity.NP.TM.LM_to_mTM]
x:407 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:407 [in Undecidability.TM.Code.Copy]
x:407 [in Undecidability.TM.Hoare.HoareCombinators]
x:407 [in Complexity.NP.TM.LM_to_mTM]
X:408 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:408 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:408 [in Complexity.NP.TM.LM_to_mTM]
x:409 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:409 [in Complexity.NP.TM.LM_to_mTM]
X:41 [in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
x:41 [in Undecidability.Shared.Libs.PSL.FCI]
x:41 [in Undecidability.Shared.Libs.PSL.Lists.Removal]
x:41 [in Undecidability.L.Datatypes.List.List_basics]
X:41 [in Undecidability.L.Computability.Enum]
x:41 [in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
x:41 [in Undecidability.Shared.Libs.PSL.EqDec]
X:41 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:41 [in Undecidability.TM.Util.VectorPrelim]
X:41 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
x:41 [in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
X:41 [in Complexity.Complexity.Subtypes]
x:41 [in Undecidability.L.Complexity.UpToC]
x:41 [in Complexity.TM.PrettyBounds.BaseCodeSpace]
X:41 [in Complexity.Libs.CookPrelim.PolyBounds]
X:41 [in Complexity.Complexity.UpToCPoly]
x:41 [in Undecidability.Shared.Libs.DLW.Utils.php]
X:41 [in Complexity.L.TM.TMunflatten]
x:41 [in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
x:41 [in Undecidability.Shared.Libs.PSL.FiniteTypes.Arbitrary]
x:41 [in Undecidability.TM.Util.Relations]
x:41 [in Undecidability.TM.Code.Copy]
X:41 [in Undecidability.L.Tactics.ComputableTactics]
X:41 [in Undecidability.Shared.Dec]
x:41 [in Undecidability.L.Computability.Synthetic]
x:41 [in Undecidability.Synthetic.Infinite]
x:41 [in Undecidability.Shared.ListAutomation]
X:41 [in Complexity.Complexity.Definitions]
X:41 [in Complexity.L.AbstractMachines.FunctionalDefinitions]
x:41 [in Undecidability.L.Datatypes.LNat]
x:41 [in Undecidability.TM.PrettyBounds.MaxList]
x:41 [in Complexity.TM.PrettyBounds.PrettyBounds]
X:410 [in Undecidability.TM.Single.StepTM]
x:410 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:410 [in Complexity.NP.TM.LM_to_mTM]
x:411 [in Undecidability.TM.Single.StepTM]
x:411 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:411 [in Complexity.NP.TM.LM_to_mTM]
x:412 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:412 [in Undecidability.TM.Hoare.HoareCombinators]
x:412 [in Complexity.NP.TM.LM_to_mTM]
x:413 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:413 [in Complexity.NP.TM.LM_to_mTM]
x:414 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:414 [in Complexity.NP.TM.LM_to_mTM]
x:415 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:415 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:415 [in Undecidability.TM.Hoare.HoareCombinators]
x:415 [in Complexity.NP.TM.LM_to_mTM]
x:416 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:416 [in Complexity.NP.TM.LM_to_mTM]
x:417 [in Undecidability.Shared.Libs.DLW.Vec.vec]
X:417 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:417 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:417 [in Complexity.NP.TM.LM_to_mTM]
x:418 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:418 [in Complexity.NP.TM.LM_to_mTM]
x:419 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:419 [in Complexity.NP.TM.LM_to_mTM]
x:42 [in Undecidability.L.Prelim.ARS]
X:42 [in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
x:42 [in Complexity.L.AbstractMachines.Computable.EvalForTime]
x:42 [in Undecidability.Shared.Libs.PSL.FCI]
x:42 [in Undecidability.L.Tactics.Lrewrite]
x:42 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
x:42 [in Complexity.TM.Code.Decode]
X:42 [in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
x:42 [in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
x:42 [in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
x:42 [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
x:42 [in Undecidability.L.Tactics.LClos]
X:42 [in Undecidability.TM.Util.VectorPrelim]
x:42 [in Undecidability.Synthetic.EnumerabilityFacts]
x:42 [in Undecidability.Shared.Libs.PSL.Lists.Filter]
x:42 [in Undecidability.TM.Compound.MoveToSymbol]
x:42 [in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
x:42 [in Undecidability.Shared.Libs.DLW.Utils.interval]
X:42 [in Undecidability.L.Tactics.ComputableDemo]
X:42 [in Undecidability.L.Complexity.UpToC]
x:42 [in Complexity.NP.L.GenNPBool]
x:42 [in Undecidability.Shared.Libs.DLW.Utils.fin_upto]
x:42 [in Complexity.L.AbstractMachines.FlatPro.Computable.Compile]
x:42 [in Undecidability.TM.Code.WriteValue]
x:42 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
x:42 [in Complexity.Complexity.ONotationIsAppropriate]
X:42 [in Undecidability.L.Functions.EqBool]
X:42 [in Undecidability.Shared.Libs.DLW.Utils.fin_base]
x:42 [in Undecidability.Synthetic.MoreEnumerabilityFacts]
x:42 [in Undecidability.L.Functions.UnboundIteration]
x:42 [in Undecidability.TM.Code.ChangeAlphabet]
x:42 [in Complexity.TM.Single.DecodeTapes]
x:42 [in Undecidability.Synthetic.DecidabilityFacts]
x:42 [in Undecidability.Shared.Libs.PSL.Vectors.VectorDupfree]
x:42 [in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
x:42 [in Undecidability.TM.Code.Code]
X:42 [in Undecidability.TM.Univ.LookupAssociativeListTM]
X:42 [in Undecidability.TM.Code.CasePair]
x:42 [in Undecidability.L.Tactics.Computable]
x:42 [in Undecidability.Synthetic.ReducibilityFacts]
X:42 [in Undecidability.TM.Single.EncodeTapes]
x:420 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:420 [in Undecidability.TM.Hoare.HoareCombinators]
x:420 [in Complexity.NP.TM.LM_to_mTM]
x:421 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:421 [in Complexity.NP.TM.LM_to_mTM]
x:422 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:422 [in Complexity.NP.TM.LM_to_mTM]
x:423 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:423 [in Undecidability.TM.Hoare.HoareCombinators]
x:423 [in Complexity.NP.TM.LM_to_mTM]
x:424 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:424 [in Complexity.NP.TM.LM_to_mTM]
x:425 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:425 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:425 [in Complexity.NP.TM.LM_to_mTM]
X:426 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:426 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:426 [in Complexity.NP.TM.LM_to_mTM]
x:427 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:427 [in Complexity.NP.TM.LM_to_mTM]
x:428 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:428 [in Complexity.NP.TM.LM_to_mTM]
x:429 [in Complexity.NP.TM.mTM_to_singleTapeTM]
X:429 [in Undecidability.TM.Hoare.HoareCombinators]
x:429 [in Complexity.NP.TM.LM_to_mTM]
x:43 [in Undecidability.L.Prelim.ARS]
X:43 [in Complexity.TM.PrettyBounds.BaseCode]
x:43 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
x:43 [in Undecidability.Shared.Libs.PSL.Lists.Removal]
x:43 [in Undecidability.Shared.Libs.DLW.Utils.prime]
x:43 [in Undecidability.L.Complexity.UpToCNary]
X:43 [in Complexity.TM.PrettyBounds.UnivBounds]
X:43 [in Undecidability.L.Tactics.ComputableTime]
x:43 [in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
x:43 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
X:43 [in Undecidability.Synthetic.EnumerabilityFacts]
x:43 [in Undecidability.Shared.Libs.DLW.Utils.quotient]
x:43 [in Undecidability.Shared.Libs.DLW.Utils.interval]
x:43 [in Complexity.TM.Single.EncodeTapesInvariants]
X:43 [in Complexity.L.TM.CompCode]
x:43 [in Complexity.NP.L.GenNPBool]
x:43 [in Undecidability.TM.Code.CompareValue]
x:43 [in Undecidability.TM.Code.WriteValue]
x:43 [in Undecidability.Shared.Libs.DLW.Utils.php]
x:43 [in Undecidability.Shared.Libs.PSL.FiniteTypes.Arbitrary]
x:43 [in Complexity.TM.Single.DecodeTapes]
x:43 [in Undecidability.Synthetic.DecidabilityFacts]
X:43 [in Undecidability.Shared.Dec]
X:43 [in Undecidability.TM.Lifting.LiftTapes]
x:43 [in Undecidability.L.Computability.Synthetic]
x:43 [in Undecidability.Synthetic.Infinite]
x:43 [in Complexity.Complexity.PolyTimeComputable]
x:43 [in Undecidability.Synthetic.ReducibilityFacts]
x:43 [in Undecidability.TM.Hoare.HoareExamples]
x:43 [in Undecidability.L.Functions.Size]
X:43 [in Complexity.Libs.CookPrelim.MorePrelim]
x:430 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:430 [in Complexity.NP.TM.LM_to_mTM]
x:431 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:431 [in Complexity.NP.TM.LM_to_mTM]
x:432 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:432 [in Complexity.NP.TM.LM_to_mTM]
x:433 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:433 [in Complexity.NP.TM.LM_to_mTM]
x:434 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:434 [in Complexity.NP.TM.LM_to_mTM]
x:435 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:435 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:435 [in Undecidability.TM.Hoare.HoareCombinators]
x:435 [in Complexity.NP.TM.LM_to_mTM]
x:436 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:436 [in Complexity.NP.TM.LM_to_mTM]
X:437 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:437 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:437 [in Undecidability.TM.Hoare.HoareCombinators]
x:437 [in Complexity.NP.TM.LM_to_mTM]
x:438 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:438 [in Complexity.NP.TM.LM_to_mTM]
x:439 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:439 [in Complexity.NP.TM.LM_to_mTM]
x:44 [in Complexity.Libs.Pigeonhole]
x:44 [in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
x:44 [in Undecidability.TM.L.CompilerBoolFuns.NaryApp]
x:44 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:44 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
x:44 [in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
x:44 [in Undecidability.Shared.Libs.DLW.Utils.interval]
x:44 [in Complexity.TM.PrettyBounds.BaseCodeSpace]
x:44 [in Complexity.Libs.UniformHomomorphisms]
x:44 [in Undecidability.Shared.Libs.DLW.Utils.php]
x:44 [in Undecidability.L.Functions.UnboundIteration]
x:44 [in Complexity.TM.Single.DecodeTapes]
x:44 [in Undecidability.Synthetic.DecidabilityFacts]
x:44 [in Undecidability.TM.Lifting.LiftTapes]
x:44 [in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
x:44 [in Undecidability.L.Complexity.GenericNary]
X:44 [in Undecidability.TM.Code.Code]
X:44 [in Undecidability.L.Functions.Decoding]
x:44 [in Undecidability.TM.Code.CasePair]
x:44 [in Complexity.Complexity.NP]
X:44 [in Complexity.NP.TM.LM_to_mTM]
x:44 [in Complexity.TM.PrettyBounds.PrettyBounds]
x:440 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:440 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:440 [in Complexity.NP.TM.LM_to_mTM]
X:441 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:441 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:441 [in Undecidability.TM.Hoare.HoareCombinators]
x:441 [in Complexity.NP.TM.LM_to_mTM]
x:442 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:442 [in Complexity.NP.TM.LM_to_mTM]
x:443 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:443 [in Complexity.NP.TM.LM_to_mTM]
x:444 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:444 [in Complexity.NP.TM.LM_to_mTM]
X:445 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:445 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:445 [in Complexity.NP.TM.LM_to_mTM]
x:446 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:446 [in Complexity.NP.TM.LM_to_mTM]
x:447 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:447 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:447 [in Complexity.NP.TM.LM_to_mTM]
x:448 [in Complexity.NP.TM.mTM_to_singleTapeTM]
X:448 [in Undecidability.TM.Hoare.HoareCombinators]
x:448 [in Complexity.NP.TM.LM_to_mTM]
X:449 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:449 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:449 [in Complexity.NP.TM.LM_to_mTM]
x:45 [in Complexity.TM.PrettyBounds.BaseCode]
x:45 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
X:45 [in Undecidability.TM.Code.List.Nth]
x:45 [in Undecidability.L.Computability.Enum]
x:45 [in Undecidability.L.Tactics.ComputableTime]
x:45 [in Complexity.TM.Code.Decode]
X:45 [in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
x:45 [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
X:45 [in Undecidability.TM.Code.List.Length]
X:45 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
x:45 [in Undecidability.Shared.Libs.DLW.Utils.quotient]
x:45 [in Undecidability.Shared.Libs.DLW.Utils.interval]
x:45 [in Undecidability.Shared.Libs.DLW.Utils.fin_upto]
X:45 [in Complexity.Complexity.UpToCPoly]
x:45 [in Undecidability.Shared.Libs.DLW.Utils.fin_base]
X:45 [in Undecidability.Shared.Libs.PSL.FiniteTypes.Arbitrary]
X:45 [in Undecidability.TM.Util.Relations]
X:45 [in Complexity.L.TM.TMflatten]
x:45 [in Undecidability.TM.Code.ChangeAlphabet]
x:45 [in Complexity.TM.Single.DecodeTapes]
X:45 [in Undecidability.Synthetic.DecidabilityFacts]
X:45 [in Undecidability.L.Tactics.ComputableTactics]
X:45 [in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
x:45 [in Undecidability.L.Computability.Synthetic]
x:45 [in Undecidability.Synthetic.Infinite]
x:45 [in Undecidability.L.Datatypes.LNat]
X:45 [in Undecidability.Synthetic.ReducibilityFacts]
x:45 [in Complexity.L.AbstractMachines.Computable.LargestVar]
x:45 [in Complexity.Libs.CookPrelim.MorePrelim]
x:450 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:450 [in Complexity.NP.TM.LM_to_mTM]
x:451 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:451 [in Complexity.NP.TM.LM_to_mTM]
X:452 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:452 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:452 [in Complexity.NP.TM.LM_to_mTM]
x:453 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:453 [in Complexity.NP.TM.LM_to_mTM]
x:454 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:454 [in Complexity.NP.TM.LM_to_mTM]
x:455 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:455 [in Complexity.NP.TM.LM_to_mTM]
x:456 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:456 [in Complexity.NP.TM.LM_to_mTM]
x:457 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:457 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:457 [in Undecidability.TM.Hoare.HoareCombinators]
x:457 [in Complexity.NP.TM.LM_to_mTM]
X:458 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:458 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:458 [in Complexity.NP.TM.LM_to_mTM]
x:459 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:459 [in Undecidability.TM.Hoare.HoareCombinators]
x:459 [in Complexity.NP.TM.LM_to_mTM]
x:46 [in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
x:46 [in Undecidability.Shared.Libs.PSL.Lists.Removal]
x:46 [in Undecidability.TM.Code.BinNumbers.PosMultTM]
X:46 [in Undecidability.Shared.Libs.PSL.EqDec]
x:46 [in Complexity.TM.Code.Decode]
x:46 [in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
x:46 [in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
X:46 [in Undecidability.TM.Util.VectorPrelim]
X:46 [in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
x:46 [in Undecidability.L.Complexity.UpToC]
x:46 [in Complexity.TM.PrettyBounds.BaseCodeSpace]
X:46 [in Complexity.Libs.CookPrelim.PolyBounds]
x:46 [in Complexity.L.AbstractMachines.FlatPro.Computable.Compile]
x:46 [in Undecidability.TM.Code.CompareValue]
x:46 [in Undecidability.TM.Code.CaseSum]
X:46 [in Undecidability.Shared.Libs.DLW.Utils.fin_base]
x:46 [in Undecidability.TM.Code.NatSub]
x:46 [in Complexity.NP.TM.M_multi2mono]
x:46 [in Undecidability.Synthetic.ListEnumerabilityFacts]
x:46 [in Undecidability.TM.Code.Copy]
x:46 [in Complexity.TM.Single.DecodeTapes]
x:46 [in Undecidability.L.Tactics.Reflection]
X:46 [in Undecidability.Synthetic.DecidabilityFacts]
x:46 [in Undecidability.Shared.Libs.PSL.Vectors.VectorDupfree]
x:46 [in Complexity.Complexity.NP]
X:46 [in Undecidability.TM.Single.EncodeTapes]
x:460 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:460 [in Complexity.NP.TM.LM_to_mTM]
x:461 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:461 [in Complexity.NP.TM.LM_to_mTM]
x:462 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:462 [in Complexity.NP.TM.LM_to_mTM]
x:463 [in Complexity.NP.TM.mTM_to_singleTapeTM]
X:463 [in Undecidability.TM.Hoare.HoareRegister]
x:463 [in Undecidability.TM.Hoare.HoareCombinators]
x:463 [in Complexity.NP.TM.LM_to_mTM]
X:464 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:464 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:464 [in Complexity.NP.TM.LM_to_mTM]
x:465 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:465 [in Complexity.NP.TM.LM_to_mTM]
x:466 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:466 [in Complexity.NP.TM.LM_to_mTM]
x:467 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:467 [in Complexity.NP.TM.LM_to_mTM]
x:468 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:468 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:468 [in Complexity.NP.TM.LM_to_mTM]
X:469 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:469 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:469 [in Complexity.NP.TM.LM_to_mTM]
x:47 [in Complexity.Libs.Pigeonhole]
x:47 [in Undecidability.L.Prelim.ARS]
x:47 [in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
x:47 [in Undecidability.Shared.Libs.DLW.Utils.fin_quotient]
X:47 [in Complexity.TM.Code.Decode]
x:47 [in Complexity.NP.TM.mTM_to_singleTapeTM]
X:47 [in Undecidability.Synthetic.EnumerabilityFacts]
x:47 [in Undecidability.Shared.Libs.DLW.Code.compiler]
x:47 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
X:47 [in Undecidability.L.Complexity.UpToC]
x:47 [in Undecidability.TM.Code.CodeTM]
X:47 [in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
x:47 [in Undecidability.L.Functions.EqBool]
x:47 [in Undecidability.Shared.Libs.PSL.FiniteTypes.Arbitrary]
x:47 [in Undecidability.TM.Code.ChangeAlphabet]
X:47 [in Undecidability.Synthetic.DecidabilityFacts]
x:47 [in Undecidability.Synthetic.Infinite]
X:47 [in Undecidability.Shared.ListAutomation]
x:47 [in Undecidability.TM.Univ.LookupAssociativeListTM]
X:47 [in Complexity.L.AbstractMachines.FunctionalDefinitions]
x:47 [in Undecidability.L.Datatypes.LNat]
x:47 [in Complexity.Complexity.PolyTimeComputable]
x:470 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:470 [in Complexity.NP.TM.LM_to_mTM]
x:471 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:471 [in Complexity.NP.TM.LM_to_mTM]
x:472 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:472 [in Undecidability.TM.Hoare.HoareRegister]
x:472 [in Complexity.NP.TM.LM_to_mTM]
x:473 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:473 [in Undecidability.TM.Hoare.HoareRegister]
x:473 [in Complexity.NP.TM.LM_to_mTM]
x:474 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:474 [in Complexity.NP.TM.LM_to_mTM]
x:475 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:475 [in Complexity.NP.TM.LM_to_mTM]
x:476 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:476 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:476 [in Undecidability.TM.Hoare.HoareRegister]
x:476 [in Complexity.NP.TM.LM_to_mTM]
x:477 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:477 [in Complexity.NP.TM.LM_to_mTM]
x:478 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:478 [in Complexity.NP.TM.LM_to_mTM]
x:479 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:479 [in Complexity.NP.TM.LM_to_mTM]
x:48 [in Undecidability.Shared.Libs.PSL.Numbers]
x:48 [in Complexity.Libs.Pigeonhole]
x:48 [in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
X:48 [in Complexity.TM.PrettyBounds.BaseCode]
x:48 [in Undecidability.Shared.Libs.PSL.Lists.Removal]
x:48 [in Undecidability.L.Complexity.UpToCNary]
x:48 [in Complexity.TM.PrettyBounds.UnivBounds]
X:48 [in Undecidability.Shared.Libs.PSL.EqDec]
X:48 [in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
x:48 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:48 [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
x:48 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
X:48 [in Complexity.L.ComparisonTimeBoundDerivation]
x:48 [in Complexity.TM.PrettyBounds.BaseCodeSpace]
X:48 [in Complexity.L.TM.TMflatComp]
x:48 [in Undecidability.Shared.Libs.DLW.Utils.fin_upto]
X:48 [in Undecidability.Shared.Libs.PSL.FiniteTypes.Arbitrary]
x:48 [in Undecidability.L.Functions.UnboundIteration]
X:48 [in Undecidability.Shared.ListAutomation]
x:48 [in Complexity.Complexity.PolyTimeComputable]
x:48 [in Undecidability.Shared.Libs.DLW.Vec.pos]
x:48 [in Undecidability.TM.Code.CasePair]
X:48 [in Undecidability.TM.Hoare.HoareExamples]
x:48 [in Undecidability.L.Functions.Size]
X:48 [in Complexity.Libs.CookPrelim.MorePrelim]
x:48 [in Complexity.TM.PrettyBounds.PrettyBounds]
x:480 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:480 [in Complexity.NP.TM.LM_to_mTM]
x:481 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:481 [in Complexity.NP.TM.LM_to_mTM]
x:482 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:482 [in Complexity.NP.TM.LM_to_mTM]
x:483 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:483 [in Complexity.NP.TM.LM_to_mTM]
x:484 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:484 [in Complexity.NP.TM.LM_to_mTM]
x:485 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:485 [in Complexity.NP.TM.LM_to_mTM]
x:486 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:486 [in Complexity.NP.TM.LM_to_mTM]
x:487 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:487 [in Complexity.NP.TM.LM_to_mTM]
x:488 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:488 [in Complexity.NP.TM.LM_to_mTM]
x:489 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:489 [in Complexity.NP.TM.LM_to_mTM]
x:49 [in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
x:49 [in Undecidability.TM.Code.CaseList]
x:49 [in Undecidability.TM.Hoare.HoareTactics]
x:49 [in Undecidability.L.Computability.Enum]
x:49 [in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
x:49 [in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
x:49 [in Undecidability.Shared.Libs.PSL.Lists.Position]
x:49 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
x:49 [in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
x:49 [in Complexity.Complexity.Subtypes]
x:49 [in Undecidability.L.Tactics.ComputableDemo]
X:49 [in Complexity.Complexity.UpToCPoly]
x:49 [in Complexity.L.TM.TMunflatten]
X:49 [in Undecidability.L.Functions.EqBool]
x:49 [in Undecidability.TM.Util.Relations]
X:49 [in Undecidability.Synthetic.ListEnumerabilityFacts]
X:49 [in Undecidability.Synthetic.DecidabilityFacts]
X:49 [in Undecidability.L.Datatypes.List.List_in]
x:49 [in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
x:49 [in Undecidability.TM.Code.Code]
x:49 [in Undecidability.TM.Univ.LookupAssociativeListTM]
X:49 [in Complexity.Complexity.PolyTimeComputable]
x:49 [in Undecidability.L.Tactics.Computable]
x:49 [in Complexity.Complexity.NP]
X:49 [in Undecidability.Synthetic.ReducibilityFacts]
X:49 [in Complexity.Libs.CookPrelim.MorePrelim]
x:490 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:490 [in Complexity.NP.TM.LM_to_mTM]
x:491 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:491 [in Complexity.NP.TM.LM_to_mTM]
x:492 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:492 [in Complexity.NP.TM.LM_to_mTM]
x:493 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:493 [in Complexity.NP.TM.LM_to_mTM]
x:494 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:494 [in Complexity.NP.TM.LM_to_mTM]
x:495 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:495 [in Complexity.NP.TM.LM_to_mTM]
x:496 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:496 [in Complexity.NP.TM.LM_to_mTM]
x:497 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:497 [in Complexity.NP.TM.LM_to_mTM]
x:498 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:498 [in Complexity.NP.TM.LM_to_mTM]
x:499 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:499 [in Complexity.NP.TM.LM_to_mTM]
X:5 [in Undecidability.Shared.Libs.PSL.Numbers]
x:5 [in Undecidability.L.Prelim.ARS]
x:5 [in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
x:5 [in Complexity.NP.L.GenNP_is_hard]
x:5 [in Undecidability.Shared.Libs.PSL.Lists.Removal]
x:5 [in Complexity.Complexity.EncodableP]
x:5 [in Undecidability.Synthetic.SemiDecidabilityFacts]
X:5 [in Undecidability.L.Datatypes.List.List_basics]
x:5 [in Undecidability.L.Complexity.UpToCNary]
x:5 [in Undecidability.Shared.Libs.PSL.Prelim]
x:5 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
x:5 [in Complexity.L.Datatypes.LDepPair]
x:5 [in Undecidability.Shared.Libs.PSL.Retracts]
x:5 [in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
x:5 [in Undecidability.TM.Code.List.Cons_constant]
x:5 [in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
x:5 [in Undecidability.L.Prelim.LoopSum]
X:5 [in Undecidability.Shared.FinTypeEquiv]
X:5 [in Undecidability.L.Datatypes.Lists]
x:5 [in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
X:5 [in Complexity.Libs.CookPrelim.FlatFinTypes]
x:5 [in Complexity.Complexity.Subtypes]
x:5 [in Undecidability.Shared.FinTypeForallExists]
X:5 [in Complexity.Libs.CookPrelim.PolyBounds]
x:5 [in Undecidability.Shared.Libs.DLW.Utils.fin_upto]
x:5 [in Undecidability.Shared.Libs.DLW.Utils.sums]
X:5 [in Undecidability.L.Datatypes.LFinType]
x:5 [in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicFinTypes]
X:5 [in Undecidability.TM.Hoare.HoareRegister]
x:5 [in Undecidability.TM.Code.NatSub]
x:5 [in Undecidability.Shared.Libs.PSL.Bijection]
x:5 [in Complexity.L.AbstractMachines.Computable.Lookup]
X:5 [in Complexity.TM.Compound.MoveToSymbol_niceSpec]
x:5 [in Undecidability.Shared.Libs.DLW.Wf.wf_finite]
X:5 [in Undecidability.Synthetic.ListEnumerabilityFacts]
x:5 [in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
x:5 [in Complexity.TM.Single.DecodeTapes]
x:5 [in Undecidability.L.TM.TMEncoding]
x:5 [in Undecidability.L.Tactics.ComputableTactics]
X:5 [in Undecidability.Shared.Dec]
x:5 [in Complexity.L.Functions.BinNumsCompare]
x:5 [in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
x:5 [in Undecidability.Shared.Libs.PSL.Lists.Cardinality]
x:5 [in Undecidability.L.Functions.FinTypeLookup]
x:5 [in Undecidability.Shared.ListAutomation]
X:5 [in Undecidability.Shared.Libs.PSL.FiniteTypes.Cardinality]
x:5 [in Undecidability.L.Functions.Decoding]
X:5 [in Complexity.Complexity.NP]
x:5 [in Complexity.NP.SAT.CookLevin.Reductions.CC_to_BinaryCC]
x:5 [in Undecidability.TM.Code.BinNumbers.PosAddTM]
x:5 [in Complexity.TM.PrettyBounds.PrettyBounds]
x:50 [in Complexity.Libs.Pigeonhole]
X:50 [in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
x:50 [in Undecidability.TM.Hoare.HoareTactics]
X:50 [in Undecidability.Shared.Libs.PSL.EqDec]
x:50 [in Complexity.TM.Code.Decode]
x:50 [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
x:50 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
x:50 [in Undecidability.L.Tactics.LClos]
X:50 [in Undecidability.TM.Util.VectorPrelim]
x:50 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
x:50 [in Undecidability.Shared.Libs.DLW.Utils.quotient]
x:50 [in Complexity.Libs.CookPrelim.FlatFinTypes]
x:50 [in Complexity.L.TM.CompCode]
X:50 [in Undecidability.L.Complexity.UpToC]
x:50 [in Undecidability.TM.Code.CodeTM]
x:50 [in Complexity.Libs.CookPrelim.PolyBounds]
x:50 [in Undecidability.TM.Code.CompareValue]
x:50 [in Complexity.L.TM.TMunflatten]
x:50 [in Undecidability.TM.Code.NatSub]
x:50 [in Complexity.L.AbstractMachines.Computable.LargestVar]
X:50 [in Complexity.NP.TM.LM_to_mTM]
X:50 [in Undecidability.TM.Code.BinNumbers.PosShiftTM]
x:500 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:500 [in Complexity.NP.TM.LM_to_mTM]
x:501 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:501 [in Complexity.NP.TM.LM_to_mTM]
x:502 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:502 [in Complexity.NP.TM.LM_to_mTM]
x:503 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:503 [in Complexity.NP.TM.LM_to_mTM]
x:504 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:504 [in Complexity.NP.TM.LM_to_mTM]
x:505 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:505 [in Complexity.NP.TM.LM_to_mTM]
x:506 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:506 [in Complexity.NP.TM.LM_to_mTM]
x:507 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:507 [in Complexity.NP.TM.LM_to_mTM]
x:508 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:508 [in Complexity.NP.TM.LM_to_mTM]
x:509 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:509 [in Complexity.NP.TM.LM_to_mTM]
x:51 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
X:51 [in Undecidability.Shared.Libs.PSL.EqDec]
X:51 [in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
x:51 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
X:51 [in Undecidability.Synthetic.EnumerabilityFacts]
x:51 [in Undecidability.Shared.Libs.PSL.Lists.Position]
x:51 [in Undecidability.Shared.Libs.DLW.Utils.quotient]
x:51 [in Complexity.Complexity.Subtypes]
x:51 [in Undecidability.Shared.Libs.DLW.Code.compiler]
x:51 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
X:51 [in Complexity.Libs.CookPrelim.PolyBounds]
x:51 [in Complexity.L.TM.TMunflatten]
X:51 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
x:51 [in Undecidability.Shared.Libs.PSL.FiniteTypes.Arbitrary]
x:51 [in Undecidability.L.Functions.UnboundIteration]
x:51 [in Undecidability.TM.Code.ChangeAlphabet]
X:51 [in Undecidability.Synthetic.DecidabilityFacts]
x:51 [in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
X:51 [in Undecidability.Shared.ListAutomation]
x:51 [in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
x:51 [in Complexity.Libs.CookPrelim.MorePrelim]
x:510 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:510 [in Complexity.NP.TM.LM_to_mTM]
x:511 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:511 [in Complexity.NP.TM.LM_to_mTM]
x:512 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:512 [in Complexity.NP.TM.LM_to_mTM]
x:513 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:513 [in Complexity.NP.TM.LM_to_mTM]
x:514 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:514 [in Complexity.NP.TM.LM_to_mTM]
x:515 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:515 [in Complexity.NP.TM.LM_to_mTM]
x:516 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:516 [in Complexity.NP.TM.LM_to_mTM]
x:517 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:517 [in Complexity.NP.TM.LM_to_mTM]
x:518 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:518 [in Complexity.NP.TM.LM_to_mTM]
x:519 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:519 [in Complexity.NP.TM.LM_to_mTM]
x:52 [in Undecidability.Shared.Libs.PSL.Numbers]
x:52 [in Undecidability.L.Prelim.ARS]
x:52 [in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
x:52 [in Undecidability.Shared.Libs.DLW.Utils.fin_quotient]
x:52 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
x:52 [in Complexity.L.AbstractMachines.Computable.EvalForTime]
x:52 [in Undecidability.Shared.Libs.PSL.Lists.Removal]
x:52 [in Undecidability.TM.Code.BinNumbers.PosMultTM]
X:52 [in Complexity.TM.PrettyBounds.UnivBounds]
x:52 [in Complexity.L.AbstractMachines.UnfoldTailRec]
X:52 [in Undecidability.L.Tactics.ComputableTime]
x:52 [in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
x:52 [in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
x:52 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
x:52 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
x:52 [in Undecidability.Shared.Libs.DLW.Utils.quotient]
x:52 [in Complexity.Complexity.Subtypes]
x:52 [in Undecidability.Shared.Libs.DLW.Utils.fin_upto]
x:52 [in Complexity.L.TM.TMunflatten]
X:52 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
X:52 [in Complexity.L.TM.TMflatten]
X:52 [in Undecidability.Synthetic.DecidabilityFacts]
x:52 [in Undecidability.Shared.Libs.PSL.Vectors.VectorDupfree]
x:52 [in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
x:52 [in Undecidability.Synthetic.Infinite]
X:52 [in Undecidability.Shared.ListAutomation]
X:52 [in Undecidability.L.Functions.Decoding]
x:52 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
x:52 [in Undecidability.TM.PrettyBounds.MaxList]
x:52 [in Complexity.Complexity.NP]
X:52 [in Undecidability.TM.Single.EncodeTapes]
X:52 [in Complexity.Libs.CookPrelim.MorePrelim]
X:52 [in Complexity.TM.PrettyBounds.PrettyBounds]
x:52 [in Undecidability.TM.Code.BinNumbers.PosShiftTM]
x:520 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:520 [in Complexity.NP.TM.LM_to_mTM]
x:521 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:521 [in Complexity.NP.TM.LM_to_mTM]
x:522 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:522 [in Complexity.NP.TM.LM_to_mTM]
x:523 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:523 [in Complexity.NP.TM.LM_to_mTM]
x:524 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:524 [in Complexity.NP.TM.LM_to_mTM]
x:525 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:525 [in Complexity.NP.TM.LM_to_mTM]
x:526 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:526 [in Complexity.NP.TM.LM_to_mTM]
x:527 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:527 [in Complexity.NP.TM.LM_to_mTM]
x:528 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:528 [in Complexity.NP.TM.LM_to_mTM]
x:529 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:529 [in Complexity.NP.TM.LM_to_mTM]
x:53 [in Complexity.Libs.Pigeonhole]
x:53 [in Undecidability.L.Prelim.ARS]
x:53 [in Complexity.TM.PrettyBounds.BaseCode]
x:53 [in Complexity.Complexity.ONotation]
x:53 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
X:53 [in Undecidability.L.Datatypes.List.List_basics]
x:53 [in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
X:53 [in Undecidability.Shared.Libs.PSL.EqDec]
x:53 [in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
X:53 [in Undecidability.Synthetic.EnumerabilityFacts]
x:53 [in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
X:53 [in Complexity.Complexity.Subtypes]
x:53 [in Undecidability.Shared.Libs.DLW.Code.compiler]
x:53 [in Undecidability.L.Complexity.UpToC]
x:53 [in Undecidability.TM.Code.CompareValue]
x:53 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
X:53 [in Complexity.Complexity.UpToCPoly]
X:53 [in Undecidability.Shared.Libs.DLW.Utils.fin_base]
x:53 [in Undecidability.TM.Code.NatSub]
x:53 [in Undecidability.L.Datatypes.List.List_eqb]
X:53 [in Undecidability.TM.Util.Relations]
x:53 [in Undecidability.L.Complexity.GenericNary]
X:53 [in Undecidability.Shared.ListAutomation]
x:53 [in Complexity.L.AbstractMachines.FunctionalDefinitions]
X:53 [in Undecidability.TM.Code.CasePair]
x:53 [in Complexity.Complexity.NP]
X:53 [in Undecidability.Synthetic.ReducibilityFacts]
x:530 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:530 [in Complexity.NP.TM.LM_to_mTM]
x:531 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:531 [in Complexity.NP.TM.LM_to_mTM]
x:532 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:532 [in Complexity.NP.TM.LM_to_mTM]
x:533 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:533 [in Complexity.NP.TM.LM_to_mTM]
x:534 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:534 [in Complexity.NP.TM.LM_to_mTM]
x:535 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:535 [in Complexity.NP.TM.LM_to_mTM]
x:536 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:536 [in Complexity.NP.TM.LM_to_mTM]
x:537 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:537 [in Complexity.NP.TM.LM_to_mTM]
x:538 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:538 [in Complexity.NP.TM.LM_to_mTM]
x:539 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:539 [in Complexity.NP.TM.LM_to_mTM]
x:54 [in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
x:54 [in Undecidability.Shared.Libs.DLW.Utils.fin_quotient]
x:54 [in Undecidability.L.Tactics.ComputableTime]
X:54 [in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
x:54 [in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
X:54 [in Undecidability.TM.Util.VectorPrelim]
x:54 [in Undecidability.Shared.Libs.PSL.Lists.Position]
x:54 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
x:54 [in Complexity.L.TM.CompCode]
X:54 [in Undecidability.L.Complexity.UpToC]
X:54 [in Complexity.L.TM.TMflatComp]
x:54 [in Undecidability.TM.Code.CodeTM]
x:54 [in Undecidability.Shared.Libs.DLW.Utils.fin_upto]
x:54 [in Undecidability.Shared.Libs.DLW.Utils.php]
x:54 [in Undecidability.L.Functions.EqBool]
x:54 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
X:54 [in Complexity.NP.TM.M_multi2mono]
x:54 [in Undecidability.TM.Code.ChangeAlphabet]
x:54 [in Complexity.TM.Single.DecodeTapes]
x:54 [in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
x:54 [in Undecidability.Shared.ListAutomation]
x:54 [in Complexity.Complexity.NP]
x:54 [in Undecidability.TM.Hoare.HoareExamples]
X:54 [in Complexity.Libs.CookPrelim.MorePrelim]
x:540 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:540 [in Complexity.NP.TM.LM_to_mTM]
x:541 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:541 [in Complexity.NP.TM.LM_to_mTM]
x:542 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:543 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:544 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:545 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:546 [in Complexity.NP.TM.mTM_to_singleTapeTM]
X:546 [in Complexity.NP.TM.LM_to_mTM]
x:547 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:548 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:549 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:55 [in Undecidability.Shared.Libs.PSL.Numbers]
x:55 [in Complexity.Libs.Pigeonhole]
x:55 [in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
x:55 [in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
x:55 [in Undecidability.TM.Code.CaseList]
x:55 [in Complexity.Complexity.ONotation]
x:55 [in Undecidability.L.Complexity.UpToCNary]
x:55 [in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
x:55 [in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
X:55 [in Undecidability.TM.Code.List.Length]
x:55 [in Undecidability.Shared.Libs.DLW.Utils.quotient]
x:55 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
X:55 [in Undecidability.Shared.Libs.PSL.FiniteTypes.Arbitrary]
X:55 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
X:55 [in Undecidability.Synthetic.ListEnumerabilityFacts]
x:55 [in Undecidability.TM.Code.Copy]
x:55 [in Complexity.TM.Single.DecodeTapes]
X:55 [in Undecidability.Shared.Libs.PSL.Vectors.VectorDupfree]
x:55 [in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
X:55 [in Undecidability.Shared.ListAutomation]
X:55 [in Complexity.Complexity.Definitions]
x:55 [in Undecidability.Shared.Libs.DLW.Code.subcode]
x:55 [in Undecidability.TM.Code.CasePair]
X:55 [in Complexity.NP.TM.LM_to_mTM]
x:550 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:551 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:552 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:552 [in Complexity.NP.TM.LM_to_mTM]
x:553 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:553 [in Complexity.NP.TM.LM_to_mTM]
x:554 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:554 [in Complexity.NP.TM.LM_to_mTM]
x:555 [in Complexity.NP.TM.mTM_to_singleTapeTM]
X:555 [in Complexity.NP.TM.LM_to_mTM]
x:556 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:557 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:558 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:559 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:56 [in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
x:56 [in Undecidability.Shared.Libs.DLW.Utils.fin_quotient]
X:56 [in Undecidability.L.Tactics.Extract]
x:56 [in Complexity.TM.PrettyBounds.UnivBounds]
x:56 [in Undecidability.Shared.Libs.DLW.Utils.quotient]
x:56 [in Complexity.Libs.CookPrelim.FlatFinTypes]
X:56 [in Complexity.Complexity.UpToCPoly]
x:56 [in Undecidability.Shared.Libs.DLW.Utils.php]
X:56 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
x:56 [in Undecidability.TM.Util.Relations]
x:56 [in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
x:56 [in Undecidability.Synthetic.Infinite]
x:56 [in Undecidability.Shared.ListAutomation]
X:56 [in Undecidability.TM.Univ.LookupAssociativeListTM]
x:56 [in Complexity.Complexity.NP]
x:56 [in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
x:560 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:561 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:562 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:563 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:563 [in Complexity.NP.TM.LM_to_mTM]
x:564 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:564 [in Complexity.NP.TM.LM_to_mTM]
x:565 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:565 [in Complexity.NP.TM.LM_to_mTM]
x:566 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:566 [in Complexity.NP.TM.LM_to_mTM]
x:567 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:568 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:569 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:57 [in Undecidability.Shared.Libs.PSL.Numbers]
x:57 [in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
X:57 [in Complexity.TM.PrettyBounds.BaseCode]
x:57 [in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
x:57 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
x:57 [in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
x:57 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
x:57 [in Undecidability.TM.Code.CodeTM]
X:57 [in Complexity.Libs.CookPrelim.PolyBounds]
x:57 [in Undecidability.TM.Code.CompareValue]
x:57 [in Undecidability.TM.Code.CaseSum]
X:57 [in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
X:57 [in Complexity.L.TM.TMflatten]
x:57 [in Undecidability.TM.Code.ChangeAlphabet]
X:57 [in Undecidability.Synthetic.ListEnumerabilityFacts]
x:57 [in Undecidability.L.Complexity.GenericNary]
x:57 [in Undecidability.L.Computability.Synthetic]
x:57 [in Undecidability.Synthetic.Infinite]
X:57 [in Undecidability.Shared.ListAutomation]
x:57 [in Complexity.Complexity.PolyTimeComputable]
x:57 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
x:57 [in Undecidability.L.Tactics.Computable]
x:570 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:571 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:571 [in Complexity.NP.TM.LM_to_mTM]
x:572 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:572 [in Complexity.NP.TM.LM_to_mTM]
x:573 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:573 [in Complexity.NP.TM.LM_to_mTM]
x:574 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:574 [in Complexity.NP.TM.LM_to_mTM]
x:575 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:575 [in Complexity.NP.TM.LM_to_mTM]
x:576 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:576 [in Complexity.NP.TM.LM_to_mTM]
x:577 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:577 [in Complexity.NP.TM.LM_to_mTM]
x:578 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:578 [in Complexity.NP.TM.LM_to_mTM]
x:579 [in Complexity.NP.TM.mTM_to_singleTapeTM]
X:579 [in Complexity.NP.TM.LM_to_mTM]
x:58 [in Complexity.Libs.Pigeonhole]
X:58 [in Undecidability.TM.Code.CaseList]
x:58 [in Complexity.Complexity.ONotation]
X:58 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
X:58 [in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
x:58 [in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
X:58 [in Complexity.L.ComparisonTimeBoundDerivation]
X:58 [in Undecidability.Shared.Libs.DLW.Utils.fin_base]
x:58 [in Undecidability.Shared.Libs.PSL.FiniteTypes.Arbitrary]
x:58 [in Undecidability.L.Functions.UnboundIteration]
X:58 [in Undecidability.TM.Util.Relations]
X:58 [in Undecidability.Synthetic.ListEnumerabilityFacts]
x:58 [in Undecidability.L.Tactics.Reflection]
x:58 [in Undecidability.Synthetic.Infinite]
x:58 [in Undecidability.Shared.ListAutomation]
X:58 [in Undecidability.L.Functions.Decoding]
X:58 [in Complexity.Complexity.PolyTimeComputable]
x:58 [in Undecidability.TM.Code.CasePair]
X:58 [in Complexity.Complexity.NP]
X:58 [in Undecidability.TM.Single.EncodeTapes]
X:58 [in Complexity.Libs.CookPrelim.MorePrelim]
x:58 [in Complexity.TM.PrettyBounds.PrettyBounds]
x:580 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:581 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:582 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:583 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:583 [in Complexity.NP.TM.LM_to_mTM]
x:584 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:584 [in Complexity.NP.TM.LM_to_mTM]
x:585 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:585 [in Complexity.NP.TM.LM_to_mTM]
x:586 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:586 [in Complexity.NP.TM.LM_to_mTM]
x:587 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:588 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:589 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:59 [in Undecidability.L.Prelim.ARS]
x:59 [in Complexity.TM.PrettyBounds.BaseCode]
x:59 [in Undecidability.Shared.Libs.DLW.Utils.fin_quotient]
x:59 [in Undecidability.Shared.Libs.PSL.Retracts]
x:59 [in Undecidability.L.Tactics.Extract]
x:59 [in Undecidability.L.Tactics.ComputableTime]
X:59 [in Complexity.TM.Code.Decode]
x:59 [in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
x:59 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:59 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
x:59 [in Undecidability.L.Tactics.LClos]
x:59 [in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
x:59 [in Undecidability.L.Complexity.UpToC]
X:59 [in Complexity.Complexity.UpToCPoly]
x:59 [in Undecidability.Shared.Libs.PSL.FiniteTypes.Arbitrary]
x:59 [in Undecidability.TM.Code.ChangeAlphabet]
X:59 [in Undecidability.Synthetic.ListEnumerabilityFacts]
x:59 [in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
x:59 [in Undecidability.Synthetic.Infinite]
X:59 [in Undecidability.Shared.ListAutomation]
x:59 [in Undecidability.TM.Compound.Shift]
x:59 [in Undecidability.TM.PrettyBounds.MaxList]
x:590 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:591 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:592 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:593 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:594 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:595 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:596 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:597 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:598 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:599 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:6 [in Complexity.Libs.Pigeonhole]
X:6 [in Complexity.NP.SAT.CookLevin.Reductions.TCC_to_CC]
x:6 [in Undecidability.TM.Code.BinNumbers.PosMultTM]
x:6 [in Undecidability.Shared.Libs.PSL.Prelim]
X:6 [in Complexity.TM.PrettyBounds.UnivBounds]
X:6 [in Undecidability.Shared.Libs.PSL.EqDec]
x:6 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
X:6 [in Undecidability.TM.Util.VectorPrelim]
x:6 [in Complexity.L.AbstractMachines.Computable.Unfolding]
x:6 [in Undecidability.Synthetic.EnumerabilityFacts]
x:6 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
x:6 [in Undecidability.Shared.FinTypeEquiv]
X:6 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_nat_facts]
x:6 [in Undecidability.TM.Code.BinNumbers.EncodeBinNumbers]
x:6 [in Undecidability.Shared.Libs.DLW.Utils.interval]
x:6 [in Undecidability.Shared.FinTypeForallExists]
x:6 [in Undecidability.Shared.Libs.DLW.Wf.acc_irr]
x:6 [in Undecidability.L.Complexity.UpToC]
X:6 [in Complexity.L.TM.TapeDecode]
x:6 [in Complexity.NP.L.GenNPBool]
x:6 [in Undecidability.TM.Code.WriteValue]
X:6 [in Complexity.Complexity.UpToCPoly]
x:6 [in Undecidability.L.Datatypes.LFinType]
x:6 [in Undecidability.Shared.Libs.DLW.Utils.fin_base]
X:6 [in Undecidability.Shared.Libs.PSL.FiniteTypes.Arbitrary]
x:6 [in Undecidability.Synthetic.MoreEnumerabilityFacts]
X:6 [in Undecidability.Synthetic.Definitions]
x:6 [in Complexity.TM.Compound.MoveToSymbol_niceSpec]
x:6 [in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
x:6 [in Undecidability.Shared.Libs.PSL.Vectors.VectorDupfree]
x:6 [in Complexity.L.Functions.BinNumsCompare]
x:6 [in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
X:6 [in Undecidability.TM.Code.Code]
x:6 [in Undecidability.L.Computability.Synthetic]
x:6 [in Undecidability.Shared.Libs.PSL.FiniteTypes.Cardinality]
x:6 [in Undecidability.L.Datatypes.LNat]
x:6 [in Undecidability.L.Complexity.LinDecode.LTD_def]
x:6 [in Undecidability.L.Functions.Equality]
x:6 [in Undecidability.L.Computability.Scott]
x:60 [in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
x:60 [in Undecidability.TM.Code.CaseList]
x:60 [in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
x:60 [in Undecidability.L.Complexity.UpToC]
X:60 [in Complexity.Libs.CookPrelim.PolyBounds]
x:60 [in Undecidability.Shared.Libs.DLW.Utils.php]
X:60 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
X:60 [in Undecidability.Shared.Libs.PSL.FiniteTypes.Arbitrary]
x:60 [in Undecidability.L.Functions.UnboundIteration]
x:60 [in Undecidability.TM.Code.Copy]
X:60 [in Undecidability.Shared.Libs.PSL.Vectors.VectorDupfree]
x:60 [in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
x:60 [in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
x:60 [in Undecidability.L.Computability.Synthetic]
x:60 [in Undecidability.Shared.ListAutomation]
x:60 [in Undecidability.TM.PrettyBounds.MaxList]
X:60 [in Undecidability.TM.Code.CasePair]
X:60 [in Undecidability.TM.Hoare.HoareExamples]
X:60 [in Complexity.TM.PrettyBounds.PrettyBounds]
x:600 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:601 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:602 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:603 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:604 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:605 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:606 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:607 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:608 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:609 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:61 [in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
x:61 [in Undecidability.Shared.Libs.DLW.Utils.fin_quotient]
x:61 [in Complexity.Complexity.ONotation]
x:61 [in Undecidability.Shared.Libs.DLW.Vec.vec]
x:61 [in Undecidability.L.Complexity.UpToCNary]
X:61 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
x:61 [in Undecidability.L.Tactics.Extract]
x:61 [in Undecidability.L.Computability.Enum]
x:61 [in Undecidability.L.Tactics.ComputableTime]
X:61 [in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
x:61 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:61 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:61 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
x:61 [in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
X:61 [in Undecidability.L.Complexity.UpToC]
x:61 [in Complexity.L.TM.TMflatComp]
x:61 [in Undecidability.TM.Code.CodeTM]
x:61 [in Undecidability.TM.Util.Relations]
x:61 [in Complexity.L.TM.TMflatten]
x:61 [in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
X:61 [in Undecidability.Shared.ListAutomation]
x:61 [in Undecidability.TM.Univ.LookupAssociativeListTM]
X:61 [in Complexity.Complexity.NP]
x:61 [in Complexity.NP.TM.LM_to_mTM]
x:610 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:611 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:612 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:613 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:613 [in Complexity.NP.TM.LM_to_mTM]
x:614 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:614 [in Complexity.NP.TM.LM_to_mTM]
x:615 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:615 [in Complexity.NP.TM.LM_to_mTM]
x:616 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:617 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:618 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:619 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:62 [in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
x:62 [in Undecidability.Shared.Libs.DLW.Utils.fin_quotient]
X:62 [in Undecidability.TM.Code.CaseList]
x:62 [in Complexity.Complexity.ONotation]
x:62 [in Undecidability.L.Complexity.UpToCNary]
x:62 [in Undecidability.L.Tactics.Extract]
X:62 [in Complexity.TM.PrettyBounds.UnivBounds]
x:62 [in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
x:62 [in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
x:62 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:62 [in Undecidability.L.Computability.Seval]
x:62 [in Undecidability.L.Tactics.GenEncode]
x:62 [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
x:62 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
x:62 [in Complexity.Complexity.Subtypes]
x:62 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
X:62 [in Complexity.Complexity.UpToCPoly]
x:62 [in Undecidability.Shared.Libs.PSL.FiniteTypes.Arbitrary]
x:62 [in Undecidability.L.Functions.UnboundIteration]
x:62 [in Complexity.NP.TM.M_multi2mono]
X:62 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
x:62 [in Undecidability.TM.Code.ChangeAlphabet]
x:62 [in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
x:62 [in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
X:62 [in Undecidability.L.Computability.Synthetic]
X:62 [in Undecidability.Shared.ListAutomation]
x:62 [in Complexity.Complexity.Definitions]
x:62 [in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
x:62 [in Undecidability.TM.Code.CasePair]
x:62 [in Undecidability.L.Tactics.Computable]
X:62 [in Complexity.Libs.CookPrelim.MorePrelim]
x:620 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:621 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:622 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:623 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:624 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:625 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:626 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:626 [in Complexity.NP.TM.LM_to_mTM]
x:627 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:627 [in Complexity.NP.TM.LM_to_mTM]
x:628 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:628 [in Complexity.NP.TM.LM_to_mTM]
x:629 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:629 [in Complexity.NP.TM.LM_to_mTM]
x:63 [in Undecidability.L.Prelim.ARS]
x:63 [in Complexity.Complexity.ONotation]
x:63 [in Undecidability.L.Tactics.Extract]
x:63 [in Undecidability.L.Computability.Seval]
X:63 [in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
X:63 [in Undecidability.L.Datatypes.LVector]
x:63 [in Undecidability.TM.Code.CodeTM]
X:63 [in Undecidability.Shared.Libs.DLW.Utils.fin_base]
x:63 [in Undecidability.Shared.Libs.PSL.FiniteTypes.Arbitrary]
x:63 [in Complexity.NP.TM.M_multi2mono]
x:63 [in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
x:63 [in Undecidability.L.Complexity.GenericNary]
x:63 [in Undecidability.Synthetic.Infinite]
X:63 [in Undecidability.L.Functions.FinTypeLookup]
X:63 [in Undecidability.L.Functions.Decoding]
x:63 [in Undecidability.TM.PrettyBounds.MaxList]
x:63 [in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
X:63 [in Complexity.Libs.CookPrelim.MorePrelim]
x:630 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:630 [in Complexity.NP.TM.LM_to_mTM]
x:631 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:631 [in Complexity.NP.TM.LM_to_mTM]
x:632 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:632 [in Complexity.NP.TM.LM_to_mTM]
x:633 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:634 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:635 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:635 [in Complexity.NP.TM.LM_to_mTM]
x:636 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:636 [in Complexity.NP.TM.LM_to_mTM]
x:637 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:638 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:639 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:64 [in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
x:64 [in Complexity.TM.PrettyBounds.BaseCode]
x:64 [in Undecidability.Shared.Libs.DLW.Utils.fin_quotient]
x:64 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
x:64 [in Undecidability.Shared.Libs.DLW.Vec.vec]
x:64 [in Undecidability.L.Computability.Seval]
x:64 [in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
x:64 [in Complexity.Libs.CookPrelim.PolyBounds]
x:64 [in Undecidability.Shared.Libs.DLW.Utils.php]
X:64 [in Undecidability.Shared.Libs.PSL.FiniteTypes.Arbitrary]
x:64 [in Undecidability.L.Functions.UnboundIteration]
X:64 [in Undecidability.TM.Util.Relations]
X:64 [in Undecidability.Synthetic.ListEnumerabilityFacts]
x:64 [in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
x:64 [in Complexity.Complexity.NP]
X:64 [in Complexity.NP.TM.LM_to_mTM]
x:640 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:641 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:642 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:643 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:65 [in Undecidability.Shared.Libs.PSL.Retracts]
x:65 [in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
X:65 [in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
x:65 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:65 [in Undecidability.L.Computability.Seval]
x:65 [in Undecidability.L.Tactics.LClos]
x:65 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
X:65 [in Undecidability.Shared.Libs.DLW.Utils.quotient]
x:65 [in Complexity.Complexity.Subtypes]
x:65 [in Undecidability.L.Complexity.UpToC]
X:65 [in Complexity.Libs.CookPrelim.PolyBounds]
X:65 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
X:65 [in Undecidability.Shared.Libs.DLW.Utils.fin_base]
x:65 [in Undecidability.Shared.Libs.PSL.Vectors.VectorDupfree]
x:65 [in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
x:65 [in Undecidability.L.Computability.Synthetic]
x:65 [in Complexity.Complexity.NP]
x:65 [in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
X:65 [in Complexity.NP.TM.LM_to_mTM]
x:65 [in Undecidability.Shared.Libs.PSL.FiniteTypes.FiniteFunction]
x:66 [in Undecidability.Shared.Libs.DLW.Utils.fin_quotient]
x:66 [in Complexity.Complexity.ONotation]
x:66 [in Complexity.TM.PrettyBounds.UnivBounds]
x:66 [in Complexity.TM.Code.Decode]
x:66 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
X:66 [in Undecidability.TM.Code.List.Length]
x:66 [in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
X:66 [in Undecidability.L.Complexity.UpToC]
x:66 [in Complexity.TM.PrettyBounds.BaseCodeSpace]
x:66 [in Undecidability.TM.Code.CodeTM]
x:66 [in Undecidability.Shared.Libs.PSL.FiniteTypes.Arbitrary]
x:66 [in Undecidability.L.Functions.UnboundIteration]
X:66 [in Undecidability.Synthetic.ListEnumerabilityFacts]
x:66 [in Undecidability.L.Tactics.Reflection]
X:66 [in Complexity.Complexity.Definitions]
X:66 [in Undecidability.TM.Univ.LookupAssociativeListTM]
x:66 [in Complexity.Complexity.PolyTimeComputable]
x:66 [in Undecidability.TM.PrettyBounds.MaxList]
x:66 [in Undecidability.TM.Hoare.HoareExamples]
X:67 [in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
x:67 [in Undecidability.Shared.Libs.DLW.Utils.fin_quotient]
x:67 [in Complexity.L.AbstractMachines.Computable.EvalForTime]
x:67 [in Undecidability.L.Complexity.UpToCNary]
x:67 [in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
x:67 [in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
x:67 [in Complexity.Complexity.Subtypes]
X:67 [in Complexity.Complexity.UpToCPoly]
x:67 [in Undecidability.Shared.Libs.DLW.Utils.php]
X:67 [in Undecidability.Shared.Libs.DLW.Utils.fin_base]
x:67 [in Complexity.NP.TM.M_multi2mono]
x:67 [in Undecidability.TM.Code.ChangeAlphabet]
x:67 [in Undecidability.TM.Code.Copy]
x:67 [in Undecidability.L.Complexity.GenericNary]
X:67 [in Undecidability.L.Computability.Synthetic]
x:67 [in Undecidability.TM.Compound.Shift]
X:67 [in Complexity.Complexity.PolyTimeComputable]
x:67 [in Complexity.Complexity.NP]
X:67 [in Complexity.NP.TM.LM_to_mTM]
X:67 [in Complexity.Libs.CookPrelim.MorePrelim]
x:68 [in Undecidability.Shared.Libs.DLW.Utils.fin_quotient]
x:68 [in Complexity.Complexity.ONotation]
X:68 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
x:68 [in Undecidability.L.Tactics.ComputableTime]
x:68 [in Complexity.TM.Code.Decode]
X:68 [in Undecidability.Shared.Libs.DLW.Utils.quotient]
x:68 [in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
X:68 [in Complexity.TM.PrettyBounds.BaseCodeSpace]
x:68 [in Undecidability.TM.Code.CaseSum]
X:68 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
x:68 [in Undecidability.L.Functions.UnboundIteration]
x:68 [in Undecidability.TM.Util.Relations]
x:68 [in Undecidability.Synthetic.ListEnumerabilityFacts]
x:68 [in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
x:68 [in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
x:68 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
x:68 [in Complexity.TM.PrettyBounds.PrettyBounds]
x:69 [in Undecidability.L.Prelim.ARS]
x:69 [in Undecidability.Shared.Libs.DLW.Utils.fin_quotient]
x:69 [in Undecidability.Shared.Libs.DLW.Vec.vec]
x:69 [in Undecidability.L.Computability.Enum]
X:69 [in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
X:69 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:69 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:69 [in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
X:69 [in Complexity.Libs.CookPrelim.FlatFinTypes]
x:69 [in Undecidability.TM.Code.CodeTM]
x:69 [in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
X:69 [in Complexity.Complexity.PolyTimeComputable]
x:69 [in Undecidability.TM.PrettyBounds.MaxList]
X:69 [in Undecidability.TM.Code.CasePair]
x:69 [in Complexity.Complexity.NP]
x:69 [in Complexity.NP.TM.LM_to_mTM]
X:7 [in Undecidability.L.Prelim.ARS]
x:7 [in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
x:7 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
x:7 [in Undecidability.Shared.Libs.PSL.FCI]
x:7 [in Undecidability.Shared.Libs.DLW.Utils.fin_dec]
X:7 [in Undecidability.TM.Compound.TMTac]
x:7 [in Complexity.NP.L.GenNP_is_hard]
x:7 [in Undecidability.Synthetic.InformativeReducibilityFacts]
x:7 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
X:7 [in Complexity.Complexity.EncodableP]
X:7 [in Undecidability.Synthetic.SemiDecidabilityFacts]
X:7 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds_Loop]
x:7 [in Undecidability.L.Tactics.Extract]
x:7 [in Undecidability.L.Tactics.ComputableTime]
x:7 [in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
X:7 [in Undecidability.L.Datatypes.LSum]
x:7 [in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
X:7 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
X:7 [in Undecidability.Shared.Libs.DLW.Utils.quotient]
x:7 [in Undecidability.TM.Code.CaseBool]
x:7 [in Undecidability.L.Datatypes.Lists]
X:7 [in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
x:7 [in Undecidability.TM.Code.BinNumbers.EncodeBinNumbers]
X:7 [in Complexity.Complexity.Subtypes]
x:7 [in Complexity.L.Functions.IterupN]
x:7 [in Complexity.L.AbstractMachines.Computable.UnivDecTime]
x:7 [in Undecidability.Shared.Libs.DLW.Code.compiler]
x:7 [in Undecidability.L.Datatypes.LVector]
x:7 [in Undecidability.Shared.Libs.DLW.Utils.fin_upto]
X:7 [in Undecidability.TM.Code.CompareValue]
x:7 [in Undecidability.Shared.Libs.DLW.Utils.sums]
x:7 [in Undecidability.Synthetic.Undecidability]
X:7 [in Undecidability.L.Functions.EqBool]
X:7 [in Undecidability.Shared.Libs.DLW.Utils.fin_base]
x:7 [in Undecidability.TM.Code.NatSub]
x:7 [in Undecidability.TM.L.Alphabets]
x:7 [in Complexity.Complexity.SpaceBoundsTime]
X:7 [in Undecidability.Synthetic.InformativeDefinitions]
x:7 [in Undecidability.Shared.Libs.PSL.Lists.Dupfree]
x:7 [in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
x:7 [in Undecidability.L.Tactics.Reflection]
x:7 [in Undecidability.L.Datatypes.List.List_in]
x:7 [in Undecidability.L.Tactics.ComputableTactics]
X:7 [in Undecidability.Shared.Dec]
x:7 [in Complexity.L.Functions.BinNumsCompare]
x:7 [in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
x:7 [in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
x:7 [in Undecidability.Shared.Libs.PSL.Lists.Cardinality]
x:7 [in Undecidability.Shared.Libs.PSL.FiniteTypes.Cardinality]
x:7 [in Complexity.Complexity.Definitions]
x:7 [in Complexity.Complexity.Monotonic]
x:7 [in Undecidability.Shared.Libs.DLW.Utils.seteq]
x:7 [in Complexity.TM.Single.DecodeTape]
X:7 [in Undecidability.TM.Code.CasePair]
x:7 [in Complexity.NP.SAT.CookLevin.Reductions.CC_to_BinaryCC]
x:7 [in Undecidability.Synthetic.ReducibilityFacts]
X:7 [in Undecidability.TM.Hoare.HoareExamples]
x:70 [in Undecidability.L.Prelim.ARS]
x:70 [in Undecidability.Shared.Libs.PSL.Retracts]
x:70 [in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
x:70 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:70 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
x:70 [in Complexity.TM.PrettyBounds.BaseCodeSpace]
X:70 [in Undecidability.TM.Util.Relations]
x:70 [in Undecidability.TM.Code.ChangeAlphabet]
x:70 [in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
x:70 [in Undecidability.TM.Univ.LookupAssociativeListTM]
x:70 [in Complexity.NP.TM.LM_to_mTM]
X:71 [in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
x:71 [in Complexity.Complexity.ONotation]
X:71 [in Complexity.TM.PrettyBounds.UnivBounds]
x:71 [in Undecidability.L.Computability.Enum]
x:71 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:71 [in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
x:71 [in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
x:71 [in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
x:71 [in Undecidability.L.Complexity.UpToC]
x:71 [in Complexity.Complexity.UpToCPoly]
X:71 [in Undecidability.Synthetic.ListEnumerabilityFacts]
X:71 [in Undecidability.L.Computability.Synthetic]
X:71 [in Complexity.Complexity.PolyTimeComputable]
x:71 [in Undecidability.TM.Code.CasePair]
X:71 [in Undecidability.TM.Hoare.HoareExamples]
x:72 [in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
x:72 [in Complexity.Complexity.ONotation]
X:72 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
x:72 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:72 [in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
X:72 [in Complexity.Libs.CookPrelim.FlatFinTypes]
x:72 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
x:72 [in Undecidability.L.Complexity.UpToC]
x:72 [in Undecidability.TM.Code.CodeTM]
X:72 [in Complexity.Complexity.UpToCPoly]
X:72 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
X:72 [in Undecidability.TM.Util.Relations]
x:72 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
x:72 [in Undecidability.TM.PrettyBounds.MaxList]
X:72 [in Complexity.Complexity.NP]
x:73 [in Undecidability.L.Prelim.ARS]
x:73 [in Complexity.L.AbstractMachines.Computable.EvalForTime]
x:73 [in Complexity.Complexity.ONotation]
x:73 [in Undecidability.L.Complexity.UpToCNary]
x:73 [in Undecidability.TM.Code.BinNumbers.PosDefinitions]
X:73 [in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
x:73 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:73 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:73 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
x:73 [in Undecidability.L.Datatypes.LVector]
x:73 [in Undecidability.L.Complexity.UpToC]
x:73 [in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
X:73 [in Undecidability.Shared.Libs.DLW.Utils.fin_base]
X:73 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
x:73 [in Undecidability.Synthetic.ListEnumerabilityFacts]
x:73 [in Undecidability.TM.Code.Copy]
x:73 [in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
x:73 [in Undecidability.L.Complexity.GenericNary]
x:73 [in Complexity.Complexity.Definitions]
x:74 [in Complexity.TM.PrettyBounds.BaseCode]
x:74 [in Undecidability.Shared.Libs.DLW.Vec.vec]
x:74 [in Undecidability.L.Complexity.UpToCNary]
x:74 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:74 [in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
x:74 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
x:74 [in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
x:74 [in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
x:74 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
x:74 [in Undecidability.L.Complexity.UpToC]
X:74 [in Complexity.TM.PrettyBounds.BaseCodeSpace]
x:74 [in Undecidability.TM.Code.CodeTM]
x:74 [in Complexity.Libs.CookPrelim.PolyBounds]
x:74 [in Undecidability.Shared.Libs.DLW.Utils.sums]
x:74 [in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
x:74 [in Complexity.Complexity.PolyTimeComputable]
X:75 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
x:75 [in Complexity.TM.PrettyBounds.UnivBounds]
x:75 [in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
x:75 [in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
X:75 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:75 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:75 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
x:75 [in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
x:75 [in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
x:75 [in Complexity.L.ComparisonTimeBoundDerivation]
X:75 [in Undecidability.L.Datatypes.LVector]
X:75 [in Undecidability.L.Complexity.UpToC]
x:75 [in Complexity.L.TM.TMflatComp]
x:75 [in Undecidability.Shared.Libs.DLW.Utils.sums]
X:75 [in Undecidability.Shared.Libs.DLW.Utils.fin_base]
X:75 [in Undecidability.Synthetic.ListEnumerabilityFacts]
x:75 [in Undecidability.L.Tactics.Reflection]
x:75 [in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
x:75 [in Undecidability.TM.Univ.LookupAssociativeListTM]
X:75 [in Complexity.Complexity.PolyTimeComputable]
x:75 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
x:75 [in Undecidability.TM.Code.CasePair]
x:75 [in Complexity.NP.TM.LM_to_mTM]
x:76 [in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
x:76 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:76 [in Undecidability.L.Tactics.GenEncode]
x:76 [in Undecidability.TM.Util.Prelim]
x:76 [in Complexity.TM.PrettyBounds.BaseCodeSpace]
x:76 [in Undecidability.TM.Code.CodeTM]
x:76 [in Complexity.Complexity.UpToCPoly]
x:76 [in Complexity.L.TM.TMunflatten]
X:76 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
x:76 [in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
X:76 [in Complexity.NP.Clique.kSAT_to_Clique]
x:76 [in Undecidability.L.Computability.Synthetic]
x:76 [in Undecidability.Synthetic.Infinite]
x:77 [in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
x:77 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
x:77 [in Undecidability.L.Complexity.UpToCNary]
X:77 [in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
x:77 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:77 [in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
x:77 [in Undecidability.L.Tactics.GenEncode]
X:77 [in Complexity.Libs.CookPrelim.FlatFinTypes]
x:77 [in Undecidability.Shared.Libs.DLW.Utils.sums]
X:77 [in Complexity.Complexity.UpToCPoly]
x:77 [in Complexity.L.TM.TMunflatten]
X:77 [in Undecidability.Shared.Libs.DLW.Utils.fin_base]
X:77 [in Undecidability.TM.Util.Relations]
x:77 [in Undecidability.Synthetic.ListEnumerabilityFacts]
X:77 [in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
x:77 [in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
x:77 [in Undecidability.TM.Hoare.HoareExamples]
x:77 [in Complexity.NP.TM.LM_to_mTM]
X:77 [in Complexity.Libs.CookPrelim.MorePrelim]
x:77 [in Complexity.TM.PrettyBounds.PrettyBounds]
x:78 [in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
x:78 [in Undecidability.Shared.Libs.DLW.Vec.vec]
x:78 [in Undecidability.L.Tactics.ComputableTime]
x:78 [in Complexity.NP.TM.mTM_to_singleTapeTM]
X:78 [in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
x:78 [in Undecidability.L.Complexity.UpToC]
x:78 [in Undecidability.Shared.Libs.DLW.Utils.sums]
x:78 [in Undecidability.Shared.Libs.DLW.Utils.php]
x:78 [in Complexity.L.TM.TMunflatten]
x:78 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
x:78 [in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
x:78 [in Complexity.Complexity.Definitions]
x:78 [in Complexity.Complexity.PolyTimeComputable]
x:78 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
X:78 [in Complexity.TM.PrettyBounds.PrettyBounds]
X:79 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
x:79 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:79 [in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
X:79 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
x:79 [in Complexity.L.TM.CompCode]
x:79 [in Undecidability.L.Complexity.UpToC]
X:79 [in Complexity.TM.PrettyBounds.BaseCodeSpace]
x:79 [in Complexity.L.TM.TMflatComp]
x:79 [in Undecidability.TM.Code.CodeTM]
x:79 [in Complexity.L.TM.TMunflatten]
x:79 [in Complexity.NP.Clique.kSAT_to_Clique]
x:79 [in Undecidability.Synthetic.Infinite]
x:79 [in Undecidability.TM.Univ.LookupAssociativeListTM]
x:79 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
x:79 [in Complexity.NP.TM.LM_to_mTM]
x:8 [in Undecidability.Shared.Libs.PSL.Numbers]
x:8 [in Undecidability.Shared.Libs.PSL.FCI]
x:8 [in Complexity.NP.L.CanEnumTerm_def]
x:8 [in Undecidability.Synthetic.InformativeReducibilityFacts]
x:8 [in Undecidability.Shared.Libs.PSL.Lists.Removal]
X:8 [in Undecidability.TM.Code.List.Nth]
x:8 [in Undecidability.L.Functions.LoopSum]
X:8 [in Undecidability.Shared.Libs.PSL.EqDec]
x:8 [in Complexity.L.TM.TMflatEnc]
X:8 [in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
x:8 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:8 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
X:8 [in Undecidability.TM.Code.List.Length]
X:8 [in Undecidability.L.Prelim.LoopSum]
x:8 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
x:8 [in Complexity.Libs.CookPrelim.FlatFinTypes]
X:8 [in Undecidability.TM.Code.BinNumbers.EncodeBinNumbers]
x:8 [in Undecidability.Shared.FinTypeForallExists]
X:8 [in Undecidability.L.Datatypes.LVector]
X:8 [in Undecidability.L.Complexity.UpToC]
x:8 [in Complexity.TM.PrettyBounds.BaseCodeSpace]
x:8 [in Complexity.NP.L.GenNPBool]
X:8 [in Undecidability.L.Datatypes.List.List_nat]
x:8 [in Undecidability.TM.Code.CodeTM]
x:8 [in Complexity.Libs.UniformHomomorphisms]
x:8 [in Undecidability.Shared.embed_nat]
x:8 [in Undecidability.TM.Univ.LowLevel]
x:8 [in Undecidability.Synthetic.Undecidability]
X:8 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
X:8 [in Undecidability.Shared.Libs.DLW.Utils.fin_base]
x:8 [in Complexity.Libs.CookPrelim.Tactics]
x:8 [in Undecidability.Shared.Libs.PSL.FiniteTypes.Arbitrary]
x:8 [in Complexity.Complexity.SpaceBoundsTime]
x:8 [in Undecidability.TM.Util.Relations]
X:8 [in Undecidability.Shared.Libs.PSL.Vectors.VectorDupfree]
X:8 [in Undecidability.TM.Lifting.LiftTapes]
x:8 [in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
x:8 [in Undecidability.TM.Code.Code]
X:8 [in Undecidability.L.Computability.Synthetic]
X:8 [in Undecidability.Synthetic.Infinite]
X:8 [in Undecidability.Shared.Libs.PSL.FiniteTypes.Cardinality]
x:8 [in Undecidability.TM.Univ.LookupAssociativeListTM]
x:8 [in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
x:8 [in Undecidability.L.Functions.Decoding]
x:8 [in Undecidability.L.Datatypes.LNat]
x:8 [in Undecidability.TM.PrettyBounds.MaxList]
x:8 [in Undecidability.Synthetic.ReducibilityFacts]
x:8 [in Undecidability.L.Computability.Scott]
x:80 [in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
x:80 [in Undecidability.L.Prelim.ARS]
X:80 [in Complexity.TM.PrettyBounds.UnivBounds]
x:80 [in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
x:80 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:80 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:80 [in Undecidability.TM.Util.Prelim]
x:80 [in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
x:80 [in Undecidability.L.Complexity.UpToC]
X:80 [in Complexity.Libs.CookPrelim.PolyBounds]
X:80 [in Complexity.L.TM.TMunflatten]
X:80 [in Undecidability.Synthetic.ListEnumerabilityFacts]
X:80 [in Undecidability.L.Computability.Synthetic]
x:80 [in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
X:80 [in Complexity.Complexity.PolyTimeComputable]
x:80 [in Undecidability.TM.PrettyBounds.MaxList]
x:81 [in Undecidability.Shared.Libs.DLW.Utils.prime]
X:81 [in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
x:81 [in Complexity.NP.TM.mTM_to_singleTapeTM]
X:81 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
X:81 [in Undecidability.L.Complexity.UpToC]
x:81 [in Complexity.TM.PrettyBounds.BaseCodeSpace]
x:81 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
x:81 [in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
x:81 [in Undecidability.L.Complexity.GenericNary]
x:81 [in Complexity.NP.Clique.kSAT_to_Clique]
X:81 [in Undecidability.TM.Code.Code]
x:81 [in Undecidability.Synthetic.Infinite]
x:81 [in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
x:81 [in Complexity.Complexity.NP]
x:81 [in Complexity.NP.TM.LM_to_mTM]
X:82 [in Undecidability.TM.Single.StepTM]
X:82 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
X:82 [in Undecidability.L.Tactics.Extract]
x:82 [in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
x:82 [in Complexity.NP.TM.mTM_to_singleTapeTM]
X:82 [in Undecidability.TM.Util.Prelim]
x:82 [in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
X:82 [in Complexity.Libs.CookPrelim.FlatFinTypes]
x:82 [in Undecidability.TM.Code.CodeTM]
x:82 [in Undecidability.Shared.Libs.DLW.Utils.sums]
X:82 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
X:82 [in Undecidability.TM.Util.Relations]
x:82 [in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
x:82 [in Complexity.Complexity.Definitions]
X:82 [in Complexity.Libs.CookPrelim.MorePrelim]
X:83 [in Undecidability.TM.Code.CaseList]
x:83 [in Undecidability.Shared.Libs.DLW.Vec.vec]
X:83 [in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
x:83 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:83 [in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
x:83 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
x:83 [in Undecidability.L.Datatypes.LVector]
X:83 [in Undecidability.Synthetic.ListEnumerabilityFacts]
x:83 [in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
x:83 [in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
x:83 [in Undecidability.TM.Univ.LookupAssociativeListTM]
x:83 [in Undecidability.TM.PrettyBounds.MaxList]
x:83 [in Undecidability.TM.Code.CasePair]
X:83 [in Complexity.Complexity.NP]
X:83 [in Complexity.NP.TM.LM_to_mTM]
x:84 [in Undecidability.L.Prelim.ARS]
x:84 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
x:84 [in Undecidability.L.Complexity.UpToCNary]
x:84 [in Complexity.TM.PrettyBounds.UnivBounds]
x:84 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:84 [in Complexity.NP.TM.mTM_to_singleTapeTM]
X:84 [in Complexity.TM.PrettyBounds.BaseCodeSpace]
x:84 [in Undecidability.Shared.Libs.DLW.Utils.sums]
X:84 [in Undecidability.TM.Hoare.HoareRegister]
X:84 [in Undecidability.Shared.Libs.DLW.Utils.fin_base]
x:84 [in Undecidability.L.Tactics.Reflection]
X:84 [in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
x:84 [in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
x:84 [in Undecidability.L.Computability.Synthetic]
x:84 [in Complexity.Complexity.PolyTimeComputable]
x:84 [in Undecidability.TM.Code.CasePair]
x:85 [in Undecidability.L.Tactics.ComputableTime]
x:85 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:85 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
x:85 [in Undecidability.L.Datatypes.LVector]
x:85 [in Undecidability.L.Complexity.UpToC]
x:85 [in Undecidability.Shared.Libs.DLW.Utils.php]
x:85 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
X:85 [in Undecidability.Synthetic.ListEnumerabilityFacts]
x:85 [in Undecidability.TM.Code.Copy]
X:85 [in Undecidability.L.Computability.Synthetic]
x:85 [in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
x:85 [in Complexity.Complexity.PolyTimeComputable]
x:85 [in Undecidability.TM.PrettyBounds.MaxList]
X:859 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
x:86 [in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
x:86 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
X:86 [in Undecidability.L.Tactics.Extract]
X:86 [in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
x:86 [in Complexity.NP.TM.mTM_to_singleTapeTM]
X:86 [in Complexity.Libs.CookPrelim.FlatFinTypes]
x:86 [in Undecidability.L.Complexity.UpToC]
x:86 [in Undecidability.Shared.Libs.DLW.Utils.sums]
X:86 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
X:86 [in Complexity.Complexity.UpToCPoly]
x:86 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
X:86 [in Undecidability.TM.Code.Code]
x:86 [in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
X:86 [in Complexity.Complexity.Definitions]
X:86 [in Complexity.Complexity.PolyTimeComputable]
X:86 [in Undecidability.TM.PrettyBounds.MaxList]
x:86 [in Complexity.TM.PrettyBounds.PrettyBounds]
x:869 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
X:87 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
x:87 [in Undecidability.L.Complexity.UpToCNary]
x:87 [in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
x:87 [in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
x:87 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:87 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:87 [in Undecidability.TM.Util.Prelim]
X:87 [in Undecidability.L.Datatypes.LVector]
x:87 [in Undecidability.L.Complexity.UpToC]
x:87 [in Undecidability.Shared.Libs.DLW.Utils.fin_base]
x:87 [in Undecidability.TM.Code.Copy]
x:87 [in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
x:87 [in Undecidability.TM.Util.TM_facts]
X:87 [in Complexity.Libs.CookPrelim.MorePrelim]
X:87 [in Complexity.TM.PrettyBounds.PrettyBounds]
x:88 [in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
x:88 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:88 [in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
x:88 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
X:88 [in Undecidability.Shared.Libs.DLW.Utils.php]
x:88 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
x:88 [in Undecidability.Shared.Libs.DLW.Utils.fin_base]
X:88 [in Undecidability.TM.Util.Relations]
X:88 [in Undecidability.Synthetic.ListEnumerabilityFacts]
x:88 [in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
x:88 [in Undecidability.TM.Univ.LookupAssociativeListTM]
x:89 [in Undecidability.L.Prelim.ARS]
X:89 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
X:89 [in Complexity.TM.PrettyBounds.UnivBounds]
x:89 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:89 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:89 [in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
x:89 [in Undecidability.L.Complexity.UpToC]
x:89 [in Complexity.TM.PrettyBounds.BaseCodeSpace]
x:89 [in Undecidability.Shared.Libs.DLW.Utils.sums]
X:89 [in Complexity.Complexity.UpToCPoly]
X:89 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
x:89 [in Undecidability.Shared.Libs.DLW.Utils.fin_base]
x:89 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
x:891 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
x:9 [in Undecidability.Shared.Libs.PSL.Numbers]
X:9 [in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
x:9 [in Undecidability.Shared.Libs.DLW.Utils.fin_quotient]
x:9 [in Undecidability.Shared.Libs.DLW.Utils.fin_dec]
x:9 [in Complexity.NP.L.GenNP_is_hard]
x:9 [in Undecidability.Synthetic.InformativeReducibilityFacts]
X:9 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
x:9 [in Undecidability.TM.Code.BinNumbers.PosMultTM]
x:9 [in Undecidability.L.Datatypes.LOptions]
x:9 [in Undecidability.TM.Code.BinNumbers.PosDefinitions]
x:9 [in Undecidability.L.Computability.Enum]
x:9 [in Complexity.L.TM.TMflatEnc]
x:9 [in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
x:9 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
X:9 [in Undecidability.TM.Util.VectorPrelim]
X:9 [in Undecidability.Synthetic.EnumerabilityFacts]
x:9 [in Undecidability.TM.Code.CaseFin]
X:9 [in Undecidability.L.Datatypes.Lists]
X:9 [in Complexity.Libs.CookPrelim.FlatFinTypes]
x:9 [in Complexity.TM.Single.EncodeTapesInvariants]
X:9 [in Complexity.L.Functions.IterupN]
X:9 [in Complexity.Complexity.LinTimeDecodable]
x:9 [in Undecidability.Shared.Libs.DLW.Wf.wf_incl]
x:9 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
X:9 [in Undecidability.L.Complexity.UpToC]
X:9 [in Complexity.L.TM.TapeDecode]
x:9 [in Complexity.L.TM.TMflatComp]
X:9 [in Complexity.Libs.CookPrelim.PolyBounds]
x:9 [in Undecidability.Shared.Libs.DLW.Utils.sums]
X:9 [in Undecidability.L.Datatypes.LFinType]
X:9 [in Undecidability.TM.Hoare.HoareRegister]
x:9 [in Undecidability.TM.Code.NatSub]
x:9 [in Complexity.Libs.CookPrelim.Tactics]
x:9 [in Undecidability.L.Functions.Ackermann]
X:9 [in Undecidability.Shared.Libs.PSL.FiniteTypes.Arbitrary]
x:9 [in Undecidability.L.Datatypes.List.List_eqb]
x:9 [in Undecidability.Synthetic.Definitions]
x:9 [in Undecidability.L.Functions.UnboundIteration]
x:9 [in Undecidability.L.Tactics.ComputableTactics]
X:9 [in Undecidability.Shared.Dec]
x:9 [in Complexity.L.Functions.BinNumsCompare]
x:9 [in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
x:9 [in Undecidability.Shared.Libs.PSL.Lists.Cardinality]
x:9 [in Undecidability.TM.Code.Code]
x:9 [in Complexity.Complexity.Definitions]
x:9 [in Complexity.Complexity.Monotonic]
x:9 [in Complexity.Complexity.PolyTimeComputable]
x:9 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
x:9 [in Undecidability.TM.PrettyBounds.MaxList]
x:9 [in Complexity.NP.SAT.CookLevin.Reductions.CC_to_BinaryCC]
x:9 [in Undecidability.Synthetic.ReducibilityFacts]
x:9 [in Undecidability.Shared.Libs.PSL.FiniteTypes.FiniteFunction]
x:9 [in Undecidability.L.Computability.Scott]
x:9 [in Undecidability.Shared.Libs.PSL.FiniteTypes.CompoundFinTypes]
x:9 [in Undecidability.Shared.Libs.PSL.FiniteTypes.DepPairs]
x:90 [in Undecidability.L.Complexity.UpToCNary]
X:90 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
x:90 [in Complexity.NP.TM.mTM_to_singleTapeTM]
X:90 [in Undecidability.L.Datatypes.LVector]
X:90 [in Undecidability.L.Complexity.UpToC]
x:90 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
X:90 [in Undecidability.L.Computability.Synthetic]
x:90 [in Undecidability.TM.Util.TM_facts]
x:90 [in Complexity.Complexity.PolyTimeComputable]
x:90 [in Undecidability.TM.PrettyBounds.MaxList]
x:90 [in Complexity.Complexity.NP]
x:90 [in Complexity.NP.TM.LM_to_mTM]
X:91 [in Undecidability.TM.Single.StepTM]
x:91 [in Undecidability.L.Tactics.Extract]
X:91 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:91 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:91 [in Undecidability.L.Tactics.LClos]
x:91 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
x:91 [in Undecidability.Shared.Libs.DLW.Utils.fin_base]
x:91 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
x:91 [in Undecidability.TM.Code.Copy]
x:91 [in Complexity.Complexity.PolyTimeComputable]
X:91 [in Complexity.Complexity.NP]
x:91 [in Complexity.NP.TM.LM_to_mTM]
X:915 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
x:92 [in Complexity.TM.PrettyBounds.BaseCode]
x:92 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:92 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:92 [in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
X:92 [in Complexity.L.ComparisonTimeBoundDerivation]
x:92 [in Complexity.Complexity.UpToCPoly]
x:92 [in Undecidability.Shared.Libs.DLW.Utils.php]
x:92 [in Undecidability.Shared.Libs.DLW.Utils.fin_base]
x:92 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
x:92 [in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
X:92 [in Undecidability.L.Computability.Synthetic]
X:92 [in Complexity.Complexity.Definitions]
X:92 [in Complexity.Complexity.PolyTimeComputable]
x:92 [in Complexity.NP.TM.LM_to_mTM]
X:92 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
X:92 [in Complexity.Libs.CookPrelim.MorePrelim]
x:93 [in Undecidability.L.Complexity.UpToCNary]
x:93 [in Complexity.TM.PrettyBounds.UnivBounds]
x:93 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:93 [in Undecidability.TM.Code.CodeTM]
X:93 [in Complexity.Libs.CookPrelim.PolyBounds]
x:93 [in Undecidability.Shared.Libs.DLW.Utils.sums]
X:93 [in Complexity.Complexity.UpToCPoly]
x:93 [in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
x:93 [in Undecidability.TM.Util.TM_facts]
x:93 [in Undecidability.TM.Univ.LookupAssociativeListTM]
x:93 [in Undecidability.TM.L.CompilerBoolFuns.Compiler]
x:93 [in Complexity.NP.TM.LM_to_mTM]
x:93 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
x:93 [in Complexity.TM.PrettyBounds.PrettyBounds]
X:94 [in Undecidability.TM.Code.CaseList]
x:94 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:94 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
X:94 [in Undecidability.L.Datatypes.LVector]
x:94 [in Undecidability.Shared.Libs.DLW.Utils.fin_base]
X:94 [in Undecidability.TM.Util.Relations]
x:94 [in Undecidability.Synthetic.ListEnumerabilityFacts]
x:94 [in Complexity.Complexity.NP]
x:94 [in Undecidability.TM.L.CompilerBoolFuns.Compiler]
x:94 [in Complexity.NP.TM.LM_to_mTM]
x:95 [in Complexity.TM.PrettyBounds.UnivBounds]
x:95 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:95 [in Complexity.Libs.CookPrelim.FlatFinTypes]
x:95 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
x:95 [in Complexity.TM.PrettyBounds.BaseCodeSpace]
x:95 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
X:95 [in Undecidability.Shared.Libs.DLW.Utils.fin_base]
X:95 [in Undecidability.Synthetic.ListEnumerabilityFacts]
x:95 [in Undecidability.TM.Code.Copy]
x:95 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
x:95 [in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
x:95 [in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
x:95 [in Undecidability.TM.Code.Code]
X:95 [in Undecidability.L.Computability.Synthetic]
x:95 [in Complexity.Complexity.NP]
X:95 [in Complexity.Libs.CookPrelim.MorePrelim]
x:96 [in Undecidability.TM.Code.CaseList]
X:96 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
X:96 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:96 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:96 [in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
X:96 [in Complexity.L.ComparisonTimeBoundDerivation]
x:96 [in Undecidability.TM.Code.CodeTM]
x:96 [in Complexity.Complexity.UpToCPoly]
X:96 [in Undecidability.Shared.Libs.DLW.Utils.php]
x:96 [in Complexity.Complexity.PolyTimeComputable]
x:96 [in Complexity.Complexity.NP]
X:97 [in Undecidability.TM.Single.StepTM]
X:97 [in Complexity.TM.PrettyBounds.UnivBounds]
x:97 [in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
x:97 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
x:97 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:97 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
X:97 [in Undecidability.TM.Util.Prelim]
X:97 [in Complexity.Libs.CookPrelim.FlatFinTypes]
x:97 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
X:97 [in Complexity.Complexity.UpToCPoly]
X:97 [in Undecidability.Shared.Libs.DLW.Utils.fin_base]
X:97 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
X:97 [in Undecidability.Synthetic.ListEnumerabilityFacts]
x:97 [in Undecidability.TM.Univ.LookupAssociativeListTM]
x:97 [in Complexity.Complexity.PolyTimeComputable]
x:97 [in Complexity.Complexity.NP]
X:97 [in Complexity.NP.TM.LM_to_mTM]
x:98 [in Complexity.NP.TM.mTM_to_singleTapeTM]
x:98 [in Complexity.L.TM.CompCode]
x:98 [in Complexity.TM.PrettyBounds.BaseCodeSpace]
x:98 [in Undecidability.Shared.Libs.DLW.Utils.sorting]
X:98 [in Undecidability.TM.Util.Relations]
x:98 [in Complexity.L.AbstractMachines.AbstractHeapMachine]
x:98 [in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
x:98 [in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
x:98 [in Undecidability.TM.Util.TM_facts]
X:98 [in Complexity.Complexity.Definitions]
x:98 [in Complexity.TM.Single.DecodeTape]
X:98 [in Complexity.Complexity.PolyTimeComputable]
X:98 [in Complexity.Complexity.NP]
X:98 [in Complexity.NP.TM.LM_to_mTM]
X:98 [in Complexity.Libs.CookPrelim.MorePrelim]
x:99 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
x:99 [in Complexity.TM.PrettyBounds.UnivBounds]
x:99 [in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
x:99 [in Complexity.NP.TM.mTM_to_singleTapeTM]
X:99 [in Complexity.NP.SAT.SAT_inNP]
x:99 [in Undecidability.Shared.Libs.DLW.Utils.sorting]
X:99 [in Undecidability.Synthetic.ListEnumerabilityFacts]
x:99 [in Undecidability.TM.Code.Copy]
x:99 [in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
x:99 [in Undecidability.L.Computability.Synthetic]
x:99 [in Undecidability.L.Tactics.Computable]
X:99 [in Complexity.NP.TM.LM_to_mTM]
x:993 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
x:998 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]

Y

yExt:82 [in Undecidability.L.Tactics.Computable]
yExt:91 [in Undecidability.L.Tactics.Computable]
yInt:136 [in Undecidability.L.Tactics.ComputableTime]
Yint:156 [in Complexity.Libs.CookPrelim.PolyBounds]
yInt:18 [in Undecidability.L.Tactics.ComputableTime]
Yint:21 [in Undecidability.L.Datatypes.List.List_extra]
Yint:256 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
yInt:98 [in Undecidability.L.Tactics.ComputableTime]
ymid:108 [in Undecidability.TM.Hoare.HoareCombinators]
ymid:113 [in Undecidability.TM.Hoare.HoareCombinators]
ymid:132 [in Undecidability.TM.Hoare.HoareCombinators]
ymid:155 [in Undecidability.TM.Hoare.HoareCombinators]
ymid:157 [in Undecidability.TM.Hoare.HoareCombinators]
ymid:158 [in Undecidability.TM.Combinators.StateWhile]
ymid:160 [in Undecidability.TM.Hoare.HoareCombinators]
ymid:173 [in Undecidability.TM.Hoare.HoareCombinators]
ymid:52 [in Undecidability.TM.Combinators.While]
ymid:65 [in Undecidability.TM.Combinators.While]
ymid:91 [in Undecidability.TM.Combinators.While]
yout:10 [in Undecidability.TM.Hoare.HoareLogic]
yout:100 [in Undecidability.TM.Hoare.HoareExamples]
yout:102 [in Undecidability.TM.Hoare.HoareExamples]
yout:106 [in Undecidability.TM.Hoare.HoareLogic]
yout:11 [in Undecidability.TM.L.Transcode.Boollist_to_Enc]
yout:11 [in Undecidability.TM.Code.CaseBool]
yout:11 [in Undecidability.TM.Code.CaseSum]
yout:11 [in Undecidability.TM.Compound.Compare]
yout:11 [in Undecidability.TM.Code.BinNumbers.PosShiftTM]
yout:111 [in Undecidability.TM.L.HeapInterpreter.StepTM]
yout:111 [in Undecidability.TM.Hoare.HoareCombinators]
yout:113 [in Undecidability.TM.Code.CaseList]
yout:113 [in Undecidability.TM.Code.List.Nth]
yout:116 [in Undecidability.TM.Code.List.Nth]
yout:116 [in Undecidability.TM.Univ.LowLevel]
yout:116 [in Undecidability.TM.Hoare.HoareLogic]
yout:118 [in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
yout:12 [in Undecidability.TM.Code.List.Concat_Repeat]
yout:127 [in Undecidability.TM.Hoare.HoareLogic]
yout:127 [in Undecidability.TM.Hoare.HoareExamples]
yout:13 [in Undecidability.TM.Code.List.Length]
yout:132 [in Undecidability.TM.Univ.LookupAssociativeListTM]
yout:137 [in Undecidability.TM.Combinators.StateWhile]
yout:139 [in Undecidability.TM.Hoare.HoareRegister]
yout:14 [in Undecidability.TM.Univ.Univ]
yout:142 [in Undecidability.TM.Combinators.StateWhile]
yout:145 [in Undecidability.TM.Hoare.HoareRegister]
yout:147 [in Undecidability.TM.Hoare.HoareLogic]
yout:15 [in Complexity.TM.Code.Decode]
yout:15 [in Undecidability.TM.Lifting.LiftAlphabet]
yout:15 [in Undecidability.TM.Hoare.HoareLegacy]
yout:15 [in Undecidability.TM.Code.CaseFin]
yout:154 [in Undecidability.TM.Univ.LookupAssociativeListTM]
yout:162 [in Undecidability.TM.L.HeapInterpreter.StepTM]
yout:163 [in Undecidability.TM.Hoare.HoareRegister]
yout:163 [in Undecidability.TM.Hoare.HoareExamples]
yout:168 [in Undecidability.TM.Hoare.HoareRegister]
yout:17 [in Undecidability.TM.Code.BinNumbers.NTM]
yout:18 [in Undecidability.TM.Code.BinNumbers.PosMultTM]
yout:18 [in Undecidability.TM.Combinators.SequentialComposition]
yout:18 [in Undecidability.TM.Univ.Univ]
yout:19 [in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
yout:201 [in Undecidability.TM.Single.StepTM]
yout:207 [in Undecidability.TM.L.HeapInterpreter.StepTM]
yout:209 [in Undecidability.TM.Hoare.HoareCombinators]
yout:211 [in Undecidability.TM.Single.StepTM]
yout:22 [in Undecidability.TM.L.CaseCom]
yout:228 [in Undecidability.TM.Single.StepTM]
yout:24 [in Complexity.TM.Code.Decode]
yout:24 [in Undecidability.TM.Code.CompareValue]
yout:249 [in Undecidability.TM.Single.StepTM]
yout:25 [in Complexity.TM.Code.DecodeList]
yout:250 [in Undecidability.TM.Hoare.HoareLogic]
yout:257 [in Undecidability.TM.Single.StepTM]
yout:26 [in Undecidability.TM.Combinators.SequentialComposition]
yout:26 [in Undecidability.TM.L.HeapInterpreter.LookupTM]
yout:266 [in Undecidability.TM.Hoare.HoareExamples]
yout:27 [in Undecidability.TM.L.CaseCom]
yout:27 [in Undecidability.TM.Compound.Multi]
yout:27 [in Undecidability.TM.Code.BinNumbers.PosShiftTM]
yout:271 [in Undecidability.TM.Hoare.HoareLogic]
yout:272 [in Undecidability.TM.Hoare.HoareRegister]
yout:28 [in Undecidability.TM.Code.CaseNat]
yout:281 [in Undecidability.TM.Single.StepTM]
yout:282 [in Undecidability.TM.Hoare.HoareExamples]
yout:288 [in Undecidability.TM.Hoare.HoareLogic]
yout:29 [in Undecidability.TM.Code.List.Nth]
yout:290 [in Undecidability.TM.Hoare.HoareCombinators]
yout:295 [in Undecidability.TM.Hoare.HoareLogic]
yout:3 [in Undecidability.TM.Code.BinNumbers.PosIncrementTM]
yout:3 [in Undecidability.TM.Code.NatTM]
yout:30 [in Undecidability.TM.L.Transcode.Boollist_to_Enc]
yout:30 [in Undecidability.TM.Code.List.Rev]
yout:301 [in Undecidability.TM.Hoare.HoareRegister]
yout:302 [in Undecidability.TM.Single.StepTM]
yout:31 [in Undecidability.TM.Hoare.HoareCombinators]
yout:312 [in Undecidability.TM.Hoare.HoareLogic]
yout:319 [in Undecidability.TM.Hoare.HoareCombinators]
yout:32 [in Undecidability.TM.Code.CaseSum]
yout:333 [in Undecidability.TM.Hoare.HoareLogic]
yout:335 [in Undecidability.TM.Hoare.HoareCombinators]
yout:338 [in Undecidability.TM.Hoare.HoareCombinators]
yout:344 [in Undecidability.TM.Hoare.HoareCombinators]
yout:349 [in Undecidability.TM.Hoare.HoareCombinators]
yout:354 [in Undecidability.TM.Hoare.HoareCombinators]
yout:357 [in Undecidability.TM.Hoare.HoareLogic]
yout:359 [in Undecidability.TM.Hoare.HoareCombinators]
yout:37 [in Undecidability.TM.Code.BinNumbers.PosShiftTM]
yout:374 [in Undecidability.TM.Hoare.HoareCombinators]
yout:376 [in Undecidability.TM.Hoare.HoareLogic]
yout:376 [in Undecidability.TM.Hoare.HoareCombinators]
yout:38 [in Undecidability.TM.Code.CaseList]
yout:38 [in Undecidability.TM.Code.BinNumbers.NTM]
yout:384 [in Undecidability.TM.Hoare.HoareLogic]
yout:395 [in Undecidability.TM.Hoare.HoareCombinators]
yout:398 [in Undecidability.TM.Hoare.HoareCombinators]
yout:4 [in Undecidability.TM.Code.BinNumbers.PosCompareTM]
yout:4 [in Undecidability.TM.Code.BinNumbers.PosShiftTM]
yout:403 [in Undecidability.TM.Single.StepTM]
yout:403 [in Undecidability.TM.Hoare.HoareLogic]
yout:408 [in Undecidability.TM.Hoare.HoareRegister]
yout:41 [in Undecidability.TM.Combinators.While]
yout:410 [in Undecidability.TM.Hoare.HoareCombinators]
yout:418 [in Undecidability.TM.Hoare.HoareCombinators]
yout:42 [in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
yout:427 [in Undecidability.TM.Hoare.HoareRegister]
yout:431 [in Undecidability.TM.Single.StepTM]
yout:438 [in Undecidability.TM.Hoare.HoareCombinators]
yout:44 [in Undecidability.TM.L.HeapInterpreter.LookupTM]
yout:440 [in Undecidability.TM.Hoare.HoareCombinators]
yout:45 [in Undecidability.TM.Combinators.While]
yout:45 [in Undecidability.TM.Code.BinNumbers.PosShiftTM]
yout:46 [in Undecidability.TM.Univ.Univ]
yout:460 [in Undecidability.TM.Hoare.HoareCombinators]
yout:462 [in Undecidability.TM.Hoare.HoareCombinators]
yout:463 [in Undecidability.TM.Single.StepTM]
yout:470 [in Undecidability.TM.Hoare.HoareRegister]
yout:479 [in Undecidability.TM.Single.StepTM]
yout:48 [in Undecidability.TM.Code.BinNumbers.PosAddTM]
yout:483 [in Undecidability.TM.Hoare.HoareRegister]
yout:484 [in Undecidability.TM.Hoare.HoareRegister]
yout:49 [in Undecidability.TM.Code.BinNumbers.PosCompareTM]
yout:49 [in Undecidability.TM.Code.CompareValue]
yout:49 [in Undecidability.TM.Compound.Compare]
yout:49 [in Undecidability.TM.L.HeapInterpreter.StepTM]
yout:492 [in Undecidability.TM.Hoare.HoareRegister]
yout:493 [in Undecidability.TM.Hoare.HoareRegister]
yout:5 [in Undecidability.TM.Code.CaseNat]
yout:5 [in Undecidability.TM.Code.CaseBool]
yout:5 [in Undecidability.TM.L.CaseCom]
yout:5 [in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
yout:50 [in Undecidability.TM.Code.BinNumbers.PosMultTM]
yout:502 [in Undecidability.TM.Hoare.HoareRegister]
yout:503 [in Undecidability.TM.Hoare.HoareRegister]
yout:504 [in Undecidability.TM.Hoare.HoareRegister]
yout:509 [in Undecidability.TM.Single.StepTM]
yout:51 [in Undecidability.TM.Code.List.Rev]
yout:51 [in Undecidability.TM.Univ.LookupAssociativeListTM]
yout:514 [in Undecidability.TM.Hoare.HoareRegister]
yout:515 [in Undecidability.TM.Hoare.HoareRegister]
yout:516 [in Undecidability.TM.Hoare.HoareRegister]
yout:52 [in Undecidability.TM.Code.CompareValue]
yout:524 [in Undecidability.TM.Hoare.HoareRegister]
yout:525 [in Undecidability.TM.Hoare.HoareRegister]
yout:53 [in Undecidability.TM.Univ.Univ]
yout:534 [in Undecidability.TM.Hoare.HoareRegister]
yout:535 [in Undecidability.TM.Hoare.HoareRegister]
yout:54 [in Undecidability.TM.Hoare.HoareCombinators]
yout:546 [in Undecidability.TM.Hoare.HoareRegister]
yout:547 [in Undecidability.TM.Hoare.HoareRegister]
yout:548 [in Undecidability.TM.Hoare.HoareRegister]
yout:55 [in Undecidability.TM.Code.List.Nth]
yout:56 [in Undecidability.TM.Code.CompareValue]
yout:560 [in Undecidability.TM.Hoare.HoareRegister]
yout:561 [in Undecidability.TM.Hoare.HoareRegister]
yout:562 [in Undecidability.TM.Hoare.HoareRegister]
yout:57 [in Undecidability.TM.Code.BinNumbers.PosShiftTM]
yout:572 [in Undecidability.TM.Hoare.HoareRegister]
yout:573 [in Undecidability.TM.Hoare.HoareRegister]
yout:584 [in Undecidability.TM.Hoare.HoareRegister]
yout:585 [in Undecidability.TM.Hoare.HoareRegister]
yout:59 [in Undecidability.TM.Code.NatTM]
yout:59 [in Undecidability.TM.Code.CompareValue]
yout:6 [in Undecidability.TM.Compound.Shift]
yout:62 [in Undecidability.TM.Combinators.Switch]
yout:62 [in Undecidability.TM.Code.BinNumbers.PosShiftTM]
yout:63 [in Undecidability.TM.Code.CaseSum]
yout:65 [in Undecidability.TM.Univ.LowLevel]
yout:66 [in Undecidability.TM.L.HeapInterpreter.LookupTM]
yout:67 [in Undecidability.TM.Code.BinNumbers.PosShiftTM]
yout:7 [in Undecidability.TM.Code.CaseFin]
yout:7 [in Undecidability.TM.Compound.CopySymbols]
yout:7 [in Undecidability.TM.Hoare.HoareMult]
yout:71 [in Undecidability.TM.Combinators.Switch]
yout:71 [in Undecidability.TM.Code.BinNumbers.PosCompareTM]
yout:73 [in Undecidability.TM.Code.CaseList]
yout:74 [in Undecidability.TM.Combinators.While]
yout:75 [in Undecidability.TM.Code.CaseSum]
yout:75 [in Undecidability.TM.Hoare.HoareCombinators]
yout:77 [in Undecidability.TM.Code.BinNumbers.PosCompareTM]
yout:77 [in Undecidability.TM.Univ.LookupAssociativeListTM]
yout:78 [in Undecidability.TM.Combinators.While]
yout:80 [in Undecidability.TM.Hoare.HoareMult]
yout:83 [in Undecidability.TM.Code.BinNumbers.PosShiftTM]
yout:89 [in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
yout:9 [in Undecidability.TM.Hoare.HoareLegacy]
yout:9 [in Undecidability.TM.Compound.MoveToSymbol]
yout:9 [in Undecidability.TM.Code.List.Rev]
yout:92 [in Undecidability.TM.Hoare.HoareLogic]
yout:93 [in Undecidability.TM.Code.BinNumbers.PosShiftTM]
yout:98 [in Undecidability.TM.Hoare.HoareCombinators]
yout:98 [in Undecidability.TM.Hoare.HoareExamples]
ys':55 [in Complexity.TM.Code.Decode]
ys1:151 [in Undecidability.TM.Code.Code]
ys1:9 [in Undecidability.TM.Code.CompareValue]
ys2:10 [in Undecidability.TM.Code.CompareValue]
ys2:152 [in Undecidability.TM.Code.Code]
ys:10 [in Undecidability.TM.Code.BinNumbers.EncodeBinNumbers]
ys:102 [in Undecidability.TM.Compound.Compare]
ys:105 [in Undecidability.TM.Compound.Compare]
ys:108 [in Complexity.TM.PrettyBounds.UnivBounds]
ys:112 [in Complexity.TM.PrettyBounds.UnivBounds]
ys:12 [in Undecidability.TM.Code.List.Rev]
ys:142 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
ys:148 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
ys:15 [in Undecidability.TM.Code.CompareValue]
ys:179 [in Undecidability.TM.Code.Code]
ys:183 [in Undecidability.TM.Code.Code]
ys:19 [in Complexity.L.TM.TMflatComp]
ys:193 [in Complexity.TM.PrettyBounds.M2MBounds]
ys:196 [in Undecidability.TM.Code.Code]
ys:203 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
ys:211 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
ys:219 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
ys:230 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
ys:24 [in Undecidability.TM.Code.List.Rev]
ys:24 [in Complexity.L.TM.TMflatComp]
ys:241 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
ys:251 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
ys:31 [in Undecidability.TM.Util.VectorPrelim]
ys:33 [in Undecidability.TM.Code.List.Rev]
ys:33 [in Complexity.L.TM.TMflatFun]
ys:34 [in Undecidability.TM.Code.List.App]
ys:44 [in Undecidability.TM.Util.VectorPrelim]
ys:44 [in Undecidability.TM.Code.List.Rev]
ys:44 [in Undecidability.TM.Code.List.App]
ys:46 [in Undecidability.TM.Code.List.Rev]
ys:47 [in Undecidability.TM.Code.List.App]
ys:53 [in Complexity.TM.Code.Decode]
ys:58 [in Undecidability.TM.Util.VectorPrelim]
ys:58 [in Complexity.NP.TM.M_multi2mono]
ys:60 [in Complexity.TM.PrettyBounds.BaseCodeSpace]
ys:64 [in Undecidability.TM.Code.List.App]
ys:7 [in Undecidability.TM.Single.StepTM]
ys:8 [in Complexity.L.TM.TMflatComp]
ys:89 [in Undecidability.TM.Compound.Compare]
ys:9 [in Undecidability.TM.Code.List.App]
yTime:19 [in Undecidability.L.Tactics.ComputableTime]
yT:11 [in Undecidability.L.Datatypes.LNat]
yT:137 [in Undecidability.L.Tactics.ComputableTime]
yT:21 [in Undecidability.L.Datatypes.LNat]
yT:5 [in Undecidability.L.Datatypes.LNat]
yT:97 [in Undecidability.L.Tactics.ComputableTime]
y_res:53 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
y_res:44 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
y'':21 [in Undecidability.TM.Hoare.HoareCombinators]
y'':43 [in Undecidability.TM.Hoare.HoareCombinators]
y'':65 [in Undecidability.TM.Hoare.HoareCombinators]
y'':87 [in Undecidability.TM.Hoare.HoareCombinators]
y':1002 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
y':101 [in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
y':109 [in Complexity.L.TM.TMflatComp]
y':110 [in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
y':116 [in Complexity.Libs.CookPrelim.MorePrelim]
y':122 [in Complexity.L.TM.TMunflatten]
y':122 [in Undecidability.TM.Combinators.StateWhile]
y':143 [in Undecidability.L.Prelim.ARS]
y':143 [in Complexity.L.TM.TMunflatten]
y':145 [in Complexity.L.TM.TMunflatten]
y':147 [in Complexity.L.TM.TMunflatten]
y':153 [in Complexity.L.TM.TMflatComp]
y':170 [in Complexity.L.TM.TMflatComp]
y':179 [in Complexity.L.TM.TMflatComp]
y':19 [in Undecidability.TM.Hoare.HoareCombinators]
y':20 [in Undecidability.L.Functions.EqBool]
y':25 [in Undecidability.TM.Univ.LowLevel]
y':34 [in Undecidability.L.Tactics.ComputableTactics]
Y':35 [in Undecidability.TM.Univ.LowLevel]
Y':4 [in Undecidability.TM.Univ.LowLevel]
y':41 [in Undecidability.TM.Hoare.HoareCombinators]
Y':429 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
y':45 [in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
y':45 [in Undecidability.Shared.Libs.PSL.Lists.Position]
y':46 [in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
y':48 [in Complexity.Complexity.NP]
y':51 [in Complexity.Complexity.NP]
y':54 [in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
y':56 [in Undecidability.Shared.Libs.PSL.Lists.Position]
y':62 [in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
y':63 [in Undecidability.TM.Hoare.HoareCombinators]
y':67 [in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
y':69 [in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
y':74 [in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
y':75 [in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
y':84 [in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
y':85 [in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
y':85 [in Undecidability.TM.Hoare.HoareCombinators]
y':99 [in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
y':997 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
y1:12 [in Undecidability.L.Datatypes.LProd]
y1:15 [in Undecidability.TM.Univ.LowLevel]
y1:19 [in Undecidability.L.Datatypes.LProd]
y1:2 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
Y1:20 [in Complexity.Complexity.PolyTimeComputable]
y1:21 [in Complexity.TM.PrettyBounds.PrettyBounds]
y1:22 [in Undecidability.L.Prelim.ARS]
Y1:33 [in Complexity.Complexity.PolyTimeComputable]
y1:344 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
y1:40 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds_Loop]
y1:5 [in Undecidability.TM.Code.CompareValue]
y1:5 [in Undecidability.TM.Code.Copy]
y1:7 [in Undecidability.L.Functions.Equality]
y1:93 [in Undecidability.TM.Code.Code]
y2:14 [in Undecidability.L.Datatypes.LProd]
y2:16 [in Undecidability.TM.Univ.LowLevel]
y2:20 [in Undecidability.L.Datatypes.LProd]
Y2:21 [in Complexity.Complexity.PolyTimeComputable]
y2:22 [in Complexity.TM.PrettyBounds.PrettyBounds]
y2:23 [in Undecidability.L.Prelim.ARS]
y2:3 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
Y2:34 [in Complexity.Complexity.PolyTimeComputable]
y2:346 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
y2:41 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds_Loop]
y2:6 [in Undecidability.TM.Code.CompareValue]
y2:6 [in Undecidability.TM.Code.Copy]
y2:94 [in Undecidability.TM.Code.Code]
y3:4 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
y4:5 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
y:1 [in Undecidability.TM.Hoare.HoareTactics]
y:1 [in Undecidability.Shared.embed_nat]
y:1 [in Undecidability.L.Tactics.ComputableTactics]
y:10 [in Undecidability.Shared.Libs.PSL.Numbers]
y:10 [in Undecidability.TM.Code.BinNumbers.PosMultTM]
y:10 [in Undecidability.L.Datatypes.LOptions]
y:10 [in Undecidability.TM.Hoare.HoareTactics]
y:10 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
y:10 [in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
Y:10 [in Complexity.Complexity.LinTimeDecodable]
y:10 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
y:10 [in Complexity.L.TM.TMflatComp]
y:10 [in Undecidability.Shared.Libs.DLW.Utils.sums]
y:10 [in Undecidability.TM.Code.NatSub]
y:10 [in Undecidability.L.Functions.Ackermann]
y:10 [in Undecidability.L.Datatypes.List.List_eqb]
y:10 [in Undecidability.L.Functions.UnboundIteration]
y:10 [in Undecidability.TM.Util.Relations]
y:10 [in Complexity.L.Functions.BinNumsCompare]
y:10 [in Undecidability.L.Datatypes.LNat]
y:10 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
y:10 [in Undecidability.TM.L.Transcode.Enc_to_Boollist]
y:10 [in Undecidability.TM.Code.List.App]
y:10 [in Undecidability.TM.Hoare.HoareStdLib]
y:100 [in Undecidability.TM.Code.CaseList]
y:100 [in Complexity.Libs.CookPrelim.PolyBounds]
y:1004 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
y:101 [in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
y:101 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
y:101 [in Undecidability.L.Complexity.UpToC]
Y:101 [in Undecidability.TM.Util.Relations]
y:101 [in Undecidability.TM.Hoare.HoareExamples]
y:1013 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
y:1016 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
Y:102 [in Complexity.L.TM.TMflatComp]
y:102 [in Undecidability.TM.Code.CodeTM]
y:102 [in Complexity.Libs.CookPrelim.PolyBounds]
y:102 [in Undecidability.Shared.Libs.DLW.Utils.php]
y:102 [in Undecidability.L.Computability.Synthetic]
Y:103 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
y:103 [in Undecidability.L.Complexity.UpToCNary]
y:103 [in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
y:103 [in Complexity.L.TM.CompCode]
y:103 [in Undecidability.L.Complexity.UpToC]
Y:103 [in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
y:103 [in Complexity.TM.PrettyBounds.PrettyBounds]
Y:104 [in Undecidability.TM.Util.Prelim]
y:104 [in Undecidability.L.Complexity.UpToC]
Y:104 [in Undecidability.Shared.Libs.DLW.Utils.php]
y:104 [in Undecidability.L.Computability.Synthetic]
y:104 [in Undecidability.TM.L.HeapInterpreter.LookupTM]
Y:105 [in Complexity.TM.PrettyBounds.BaseCode]
y:105 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
y:105 [in Undecidability.TM.Code.CodeTM]
y:105 [in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
y:105 [in Undecidability.TM.Hoare.HoareMult]
Y:105 [in Complexity.NP.TM.LM_to_mTM]
Y:106 [in Undecidability.TM.Single.StepTM]
Y:106 [in Complexity.TM.PrettyBounds.UnivBounds]
y:106 [in Undecidability.TM.Hoare.HoareExamples]
y:106 [in Complexity.TM.PrettyBounds.PrettyBounds]
y:107 [in Undecidability.L.Complexity.UpToCNary]
Y:108 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
y:108 [in Complexity.L.TM.TMflatComp]
Y:108 [in Undecidability.TM.Util.Relations]
y:108 [in Undecidability.TM.Univ.LookupAssociativeListTM]
Y:109 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
y:109 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
y:109 [in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
y:109 [in Undecidability.TM.Hoare.HoareExamples]
Y:11 [in Undecidability.L.Datatypes.List.List_basics]
y:11 [in Undecidability.TM.Hoare.HoareTactics]
y:11 [in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
y:11 [in Undecidability.Shared.Libs.DLW.Utils.quotient]
y:11 [in Undecidability.Shared.Libs.DLW.Utils.fin_upto]
y:11 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
y:11 [in Undecidability.Synthetic.MoreEnumerabilityFacts]
Y:11 [in Undecidability.Synthetic.InformativeDefinitions]
Y:11 [in Undecidability.Shared.Libs.PSL.Lists.Dupfree]
y:11 [in Undecidability.Shared.Libs.DLW.Wf.wf_finite]
Y:11 [in Complexity.Complexity.PolyTimeComputable]
Y:110 [in Complexity.TM.PrettyBounds.UnivBounds]
y:110 [in Undecidability.Shared.Libs.DLW.Utils.php]
Y:110 [in Complexity.NP.TM.LM_to_mTM]
y:111 [in Undecidability.Shared.Libs.DLW.Utils.sums]
y:111 [in Undecidability.TM.Hoare.HoareMult]
y:112 [in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
Y:112 [in Undecidability.Shared.Libs.DLW.Utils.php]
Y:112 [in Undecidability.L.Tactics.Computable]
y:112 [in Undecidability.TM.Hoare.HoareExamples]
y:113 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
Y:113 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
Y:113 [in Complexity.L.TM.TMflatComp]
y:113 [in Undecidability.TM.Univ.LookupAssociativeListTM]
y:113 [in Undecidability.TM.Hoare.HoareExamples]
Y:114 [in Complexity.TM.PrettyBounds.UnivBounds]
y:114 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
Y:114 [in Complexity.Libs.CookPrelim.PolyBounds]
Y:114 [in Complexity.L.TM.TMunflatten]
y:114 [in Undecidability.TM.Util.Relations]
Y:114 [in Complexity.Complexity.NP]
y:115 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
Y:115 [in Undecidability.Synthetic.ListEnumerabilityFacts]
y:115 [in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
y:115 [in Undecidability.TM.Hoare.HoareExamples]
y:115 [in Complexity.Libs.CookPrelim.MorePrelim]
Y:117 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
Y:117 [in Undecidability.Shared.Libs.DLW.Utils.php]
y:117 [in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
y:117 [in Undecidability.TM.Hoare.HoareExamples]
y:118 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
y:118 [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
y:118 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
y:118 [in Undecidability.L.Tactics.LClos]
y:118 [in Undecidability.Synthetic.ListEnumerabilityFacts]
Y:118 [in Undecidability.L.Tactics.Computable]
y:119 [in Undecidability.TM.Hoare.HoareExamples]
y:12 [in Undecidability.Shared.Libs.PSL.Numbers]
y:12 [in Undecidability.Shared.Libs.DLW.Utils.fin_quotient]
y:12 [in Undecidability.Synthetic.InformativeReducibilityFacts]
y:12 [in Undecidability.TM.Hoare.HoareTactics]
y:12 [in Undecidability.L.Prelim.LoopSum]
y:12 [in Undecidability.TM.Code.BinNumbers.EncodeBinNumbers]
Y:12 [in Complexity.L.ComparisonTimeBoundDerivation]
Y:12 [in Undecidability.L.Datatypes.LVector]
y:12 [in Undecidability.TM.Code.CompareValue]
y:12 [in Undecidability.TM.Code.NatSub]
Y:12 [in Undecidability.TM.Util.Relations]
y:12 [in Complexity.L.Functions.BinNumsCompare]
Y:12 [in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
y:12 [in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
Y:12 [in Undecidability.Synthetic.Infinite]
y:12 [in Undecidability.TM.Basic.Duo]
y:12 [in Undecidability.L.Computability.Computability]
y:12 [in Undecidability.Synthetic.ReducibilityFacts]
y:12 [in Complexity.L.Functions.BinNumsAdd]
y:120 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
y:120 [in Complexity.L.TM.TMunflatten]
y:120 [in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
y:121 [in Undecidability.L.Tactics.LClos]
y:121 [in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
y:121 [in Undecidability.TM.Combinators.StateWhile]
y:121 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
Y:122 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
Y:122 [in Undecidability.Synthetic.ListEnumerabilityFacts]
y:122 [in Undecidability.TM.Hoare.HoareExamples]
y:123 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
y:123 [in Undecidability.L.Tactics.LClos]
y:123 [in Complexity.L.TM.TMflatComp]
y:123 [in Undecidability.Shared.Libs.DLW.Utils.php]
y:123 [in Undecidability.TM.Code.Code]
y:124 [in Complexity.Libs.CookPrelim.FlatFinTypes]
y:124 [in Undecidability.Synthetic.ListEnumerabilityFacts]
y:125 [in Undecidability.Shared.Libs.DLW.Utils.sums]
Y:125 [in Undecidability.Shared.Libs.DLW.Utils.php]
Y:125 [in Undecidability.TM.Univ.LookupAssociativeListTM]
y:126 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
y:126 [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
y:126 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
Y:126 [in Complexity.L.TM.TMflatComp]
Y:126 [in Complexity.L.TM.TMunflatten]
y:128 [in Undecidability.TM.Code.Code]
y:129 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
y:129 [in Undecidability.Shared.Libs.DLW.Utils.php]
y:129 [in Undecidability.TM.Hoare.HoareRegister]
y:13 [in Undecidability.TM.Code.BinNumbers.PosMultTM]
y:13 [in Undecidability.TM.Hoare.HoareTactics]
Y:13 [in Complexity.TM.PrettyBounds.UnivBounds]
Y:13 [in Undecidability.TM.Util.VectorPrelim]
Y:13 [in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
y:13 [in Undecidability.L.Tactics.ComputableDemo]
y:13 [in Undecidability.L.Functions.EqBool]
y:13 [in Undecidability.Shared.Libs.PSL.Bijection]
y:13 [in Undecidability.L.Datatypes.LNat]
y:13 [in Undecidability.L.Computability.Computability]
y:130 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
y:130 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
Y:131 [in Undecidability.Shared.Libs.DLW.Utils.php]
y:132 [in Complexity.L.TM.CompCode]
y:132 [in Undecidability.TM.Util.Relations]
y:132 [in Undecidability.TM.Hoare.HoareMult]
y:132 [in Complexity.Libs.CookPrelim.MorePrelim]
y:133 [in Undecidability.Shared.Libs.DLW.Utils.sums]
y:134 [in Undecidability.TM.Hoare.HoareRegister]
Y:134 [in Complexity.Complexity.NP]
y:135 [in Undecidability.L.Tactics.ComputableTime]
Y:135 [in Complexity.L.TM.TMunflatten]
y:136 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
Y:136 [in Undecidability.L.Tactics.Computable]
y:137 [in Complexity.L.TM.TMflatComp]
y:137 [in Undecidability.Shared.Libs.DLW.Utils.sums]
y:137 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
y:138 [in Undecidability.TM.Util.Relations]
y:138 [in Undecidability.TM.Hoare.HoareMult]
Y:139 [in Complexity.L.TM.TMflatComp]
Y:139 [in Complexity.Complexity.NP]
y:139 [in Undecidability.TM.Hoare.HoareExamples]
y:14 [in Undecidability.Shared.Libs.PSL.Numbers]
y:14 [in Undecidability.TM.Combinators.Combinators]
y:14 [in Undecidability.L.Prelim.ARS]
y:14 [in Undecidability.Synthetic.InformativeReducibilityFacts]
y:14 [in Undecidability.TM.Hoare.HoareTactics]
y:14 [in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
Y:14 [in Undecidability.Shared.Libs.DLW.Utils.quotient]
y:14 [in Complexity.L.Functions.BinNumsCompare]
Y:14 [in Undecidability.L.Datatypes.List.List_fold]
y:14 [in Complexity.Complexity.NP]
y:14 [in Complexity.TM.PrettyBounds.PrettyBounds]
y:14 [in Complexity.L.Functions.BinNumsAdd]
y:140 [in Undecidability.L.Prelim.ARS]
y:141 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
y:141 [in Complexity.L.TM.TMunflatten]
y:142 [in Undecidability.Shared.Libs.DLW.Vec.vec]
y:142 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
y:143 [in Undecidability.TM.Util.Relations]
y:143 [in Undecidability.TM.Hoare.HoareExamples]
y:144 [in Undecidability.Shared.Libs.DLW.Utils.php]
y:146 [in Undecidability.L.Prelim.ARS]
y:146 [in Undecidability.TM.Util.Relations]
Y:146 [in Undecidability.TM.Univ.LookupAssociativeListTM]
y:147 [in Complexity.Libs.CookPrelim.MorePrelim]
y:148 [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
y:148 [in Undecidability.Shared.Libs.DLW.Utils.sums]
y:149 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
y:149 [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
Y:149 [in Complexity.L.TM.TMunflatten]
Y:149 [in Undecidability.L.Tactics.Computable]
y:149 [in Complexity.Libs.CookPrelim.MorePrelim]
y:15 [in Undecidability.L.Util.L_facts]
y:15 [in Undecidability.TM.Code.BinNumbers.PosMultTM]
y:15 [in Undecidability.TM.Hoare.HoareTactics]
y:15 [in Undecidability.Shared.Libs.DLW.Utils.sorting]
Y:15 [in Undecidability.L.Functions.EqBool]
y:15 [in Undecidability.TM.Code.NatSub]
y:15 [in Undecidability.Shared.Libs.PSL.Lists.Dupfree]
y:15 [in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
Y:15 [in Undecidability.TM.Univ.LookupAssociativeListTM]
y:15 [in Undecidability.L.Computability.Computability]
y:150 [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
y:150 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
y:150 [in Undecidability.TM.Hoare.HoareExamples]
y:151 [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
y:151 [in Undecidability.Shared.Libs.DLW.Utils.php]
y:152 [in Undecidability.L.Prelim.ARS]
Y:152 [in Undecidability.L.Tactics.ComputableTime]
y:152 [in Complexity.L.TM.TMflatComp]
Y:154 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
y:154 [in Undecidability.TM.Hoare.HoareExamples]
Y:155 [in Complexity.L.TM.TMflatComp]
y:155 [in Complexity.Libs.CookPrelim.MorePrelim]
y:157 [in Undecidability.L.Prelim.ARS]
y:158 [in Undecidability.TM.Hoare.HoareRegister]
y:16 [in Complexity.Libs.Pigeonhole]
y:16 [in Undecidability.Shared.Libs.DLW.Utils.fin_quotient]
y:16 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
y:16 [in Undecidability.TM.Hoare.HoareTactics]
y:16 [in Undecidability.Shared.Libs.PSL.Retracts]
Y:16 [in Undecidability.L.Functions.LoopSum]
Y:16 [in Undecidability.L.Prelim.LoopSum]
y:16 [in Undecidability.TM.Code.BinNumbers.EncodeBinNumbers]
y:16 [in Complexity.L.TM.CompCode]
y:16 [in Undecidability.Synthetic.MoreEnumerabilityFacts]
y:16 [in Undecidability.TM.Util.Relations]
y:16 [in Undecidability.Shared.Libs.DLW.Wf.wf_finite]
y:16 [in Undecidability.L.TM.TMEncoding]
y:16 [in Complexity.L.Functions.BinNumsCompare]
y:16 [in Undecidability.TM.Code.BinNumbers.PosAddTM]
y:16 [in Complexity.L.Functions.BinNumsAdd]
y:16 [in Undecidability.TM.Code.BinNumbers.PosShiftTM]
y:160 [in Undecidability.L.Prelim.ARS]
y:160 [in Undecidability.TM.Hoare.HoareRegister]
y:161 [in Undecidability.Shared.Libs.DLW.Utils.php]
y:161 [in Complexity.Libs.CookPrelim.MorePrelim]
y:162 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
Y:163 [in Undecidability.L.Tactics.ComputableTime]
y:164 [in Undecidability.Shared.Libs.DLW.Utils.php]
y:165 [in Complexity.L.TM.TMflatComp]
y:167 [in Complexity.Libs.CookPrelim.FlatFinTypes]
y:167 [in Complexity.Libs.CookPrelim.MorePrelim]
y:168 [in Complexity.L.TM.TMflatComp]
y:169 [in Undecidability.TM.Code.Copy]
y:17 [in Undecidability.TM.Combinators.Combinators]
y:17 [in Undecidability.Shared.Libs.DLW.Utils.fin_dec]
y:17 [in Undecidability.TM.Hoare.HoareTactics]
y:17 [in Undecidability.L.Tactics.ComputableTime]
y:17 [in Undecidability.L.Datatypes.LSum]
y:17 [in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
y:17 [in Undecidability.Shared.Libs.DLW.Utils.quotient]
y:17 [in Undecidability.L.Tactics.ComputableDemo]
y:17 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
y:17 [in Undecidability.Shared.Libs.DLW.Utils.sorting]
y:17 [in Undecidability.Shared.Libs.PSL.Bijection]
Y:17 [in Undecidability.Shared.Dec]
y:17 [in Undecidability.L.Datatypes.LNat]
y:17 [in Undecidability.TM.Basic.Duo]
y:17 [in Complexity.Complexity.NP]
y:17 [in Undecidability.L.Computability.Computability]
Y:17 [in Undecidability.Synthetic.ReducibilityFacts]
Y:170 [in Complexity.Libs.CookPrelim.MorePrelim]
y:172 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
y:173 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
Y:174 [in Undecidability.L.Tactics.ComputableTime]
y:174 [in Complexity.L.TM.TMflatComp]
y:174 [in Undecidability.TM.Code.Copy]
y:174 [in Undecidability.TM.Hoare.HoareExamples]
y:175 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
y:176 [in Undecidability.TM.Hoare.HoareLogic]
y:176 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
y:177 [in Undecidability.L.Tactics.ComputableTime]
y:177 [in Complexity.L.TM.TMflatComp]
y:178 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
y:178 [in Undecidability.TM.Hoare.HoareExamples]
y:18 [in Undecidability.L.Datatypes.LProd]
y:18 [in Undecidability.Shared.Libs.DLW.Utils.fin_quotient]
y:18 [in Undecidability.TM.Hoare.HoareTactics]
y:18 [in Undecidability.Shared.Libs.PSL.Retracts]
y:18 [in Complexity.TM.PrettyBounds.UnivBounds]
Y:18 [in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
y:18 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
y:18 [in Undecidability.L.Functions.UnboundIteration]
Y:18 [in Undecidability.TM.Util.Relations]
y:18 [in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
y:18 [in Complexity.L.Functions.BinNumsCompare]
Y:18 [in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
y:18 [in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
y:18 [in Undecidability.TM.Code.BinNumbers.PosAddTM]
y:18 [in Complexity.TM.PrettyBounds.PrettyBounds]
y:18 [in Undecidability.TM.Code.BinNumbers.PosShiftTM]
y:181 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
y:181 [in Undecidability.TM.Hoare.HoareRegister]
y:182 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
y:182 [in Undecidability.TM.Code.Copy]
y:183 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
y:183 [in Complexity.L.TM.TMflatComp]
y:183 [in Undecidability.TM.Hoare.HoareRegister]
y:183 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
Y:185 [in Complexity.Libs.CookPrelim.MorePrelim]
Y:186 [in Complexity.L.TM.TMflatComp]
y:186 [in Undecidability.TM.Code.Copy]
Y:188 [in Complexity.TM.PrettyBounds.M2MBounds]
y:189 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
Y:189 [in Complexity.Libs.CookPrelim.MorePrelim]
Y:19 [in Undecidability.L.Prelim.ARS]
y:19 [in Complexity.L.Datatypes.LBinNums]
y:19 [in Undecidability.TM.Hoare.HoareTactics]
y:19 [in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
y:19 [in Undecidability.L.Functions.EqBool]
Y:19 [in Undecidability.Shared.Dec]
y:19 [in Undecidability.L.Computability.Computability]
Y:190 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
y:191 [in Undecidability.TM.Hoare.HoareExamples]
y:192 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
y:193 [in Undecidability.L.Prelim.ARS]
Y:193 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
y:194 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
Y:194 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
y:195 [in Undecidability.TM.Hoare.HoareExamples]
Y:195 [in Complexity.Libs.CookPrelim.MorePrelim]
y:197 [in Undecidability.L.Prelim.ARS]
y:197 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
Y:198 [in Complexity.L.TM.TMflatComp]
Y:2 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
Y:2 [in Undecidability.Shared.Libs.PSL.Prelim]
y:2 [in Undecidability.TM.Hoare.HoareTactics]
Y:2 [in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
Y:2 [in Undecidability.L.Prelim.LoopSum]
Y:2 [in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
Y:2 [in Complexity.Complexity.LinTimeDecodable]
Y:2 [in Undecidability.TM.Code.CompareValue]
Y:2 [in Undecidability.TM.Util.Relations]
Y:2 [in Complexity.L.TM.TMflatten]
Y:2 [in Undecidability.TM.Code.Copy]
y:2 [in Undecidability.Synthetic.DecidabilityFacts]
y:2 [in Undecidability.L.Tactics.ComputableTactics]
y:2 [in Complexity.L.Functions.BinNumsCompare]
Y:2 [in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
Y:2 [in Complexity.Complexity.PolyTimeComputable]
y:2 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
y:2 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
y:2 [in Complexity.L.AbstractMachines.Computable.LargestVar]
y:20 [in Undecidability.TM.Hoare.HoareTactics]
Y:20 [in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
y:20 [in Undecidability.Shared.Libs.DLW.Wf.acc_irr]
y:20 [in Undecidability.Shared.Libs.DLW.Utils.php]
y:20 [in Undecidability.Shared.Libs.DLW.Wf.wf_finite]
y:20 [in Undecidability.TM.L.Eval]
y:20 [in Undecidability.L.Datatypes.LNat]
Y:200 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
y:200 [in Undecidability.TM.Hoare.HoareLogic]
y:201 [in Undecidability.L.Prelim.ARS]
y:202 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
y:202 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
Y:203 [in Undecidability.Shared.Libs.DLW.Vec.vec]
y:21 [in Undecidability.TM.Hoare.HoareTactics]
y:21 [in Undecidability.L.Datatypes.LSum]
y:21 [in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
y:21 [in Undecidability.L.Prelim.LoopSum]
y:21 [in Undecidability.L.Tactics.ComputableDemo]
Y:21 [in Complexity.L.TM.TMflatComp]
y:21 [in Complexity.Libs.UniformHomomorphisms]
Y:21 [in Undecidability.TM.Univ.LowLevel]
Y:21 [in Undecidability.Shared.Libs.DLW.Utils.fin_base]
y:21 [in Undecidability.TM.L.Eval]
y:21 [in Undecidability.Shared.Libs.PSL.Vectors.VectorDupfree]
y:21 [in Undecidability.TM.Lifting.LiftTapes]
y:21 [in Undecidability.TM.Code.BinNumbers.PosAddTM]
y:21 [in Complexity.L.Functions.BinNumsAdd]
y:210 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
y:211 [in Undecidability.TM.Hoare.HoareLogic]
y:217 [in Undecidability.TM.Hoare.HoareExamples]
y:219 [in Complexity.Libs.CookPrelim.MorePrelim]
y:22 [in Undecidability.Shared.Libs.DLW.Utils.fin_quotient]
y:22 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
y:22 [in Undecidability.Shared.Libs.PSL.Lists.Removal]
y:22 [in Undecidability.TM.Code.CaseNat]
y:22 [in Undecidability.TM.Hoare.HoareTactics]
y:22 [in Undecidability.Shared.Libs.PSL.Retracts]
Y:22 [in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
Y:22 [in Complexity.Complexity.Subtypes]
y:22 [in Complexity.L.Functions.BinNumsSub]
y:22 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
Y:22 [in Undecidability.L.Functions.EqBool]
y:22 [in Undecidability.TM.Util.Relations]
y:22 [in Undecidability.TM.L.Eval]
y:22 [in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
y:222 [in Undecidability.TM.Hoare.HoareExamples]
y:223 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
y:223 [in Undecidability.TM.Hoare.HoareLogic]
y:224 [in Undecidability.TM.Hoare.HoareCombinators]
y:226 [in Undecidability.TM.Hoare.HoareCombinators]
Y:227 [in Undecidability.L.Prelim.ARS]
Y:227 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
y:227 [in Undecidability.TM.Hoare.HoareCombinators]
y:228 [in Undecidability.TM.Hoare.HoareCombinators]
y:23 [in Undecidability.L.Util.L_facts]
Y:23 [in Undecidability.L.Complexity.UpToCNary]
y:23 [in Undecidability.TM.Hoare.HoareTactics]
y:23 [in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
y:23 [in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
Y:23 [in Undecidability.L.Datatypes.LVector]
y:23 [in Undecidability.TM.Code.NatSub]
y:23 [in Undecidability.L.Datatypes.List.List_eqb]
y:23 [in Undecidability.Shared.Libs.DLW.Wf.wf_finite]
y:23 [in Undecidability.TM.L.Eval]
Y:23 [in Undecidability.Shared.Libs.PSL.Vectors.VectorDupfree]
Y:23 [in Undecidability.Shared.Dec]
y:23 [in Undecidability.Shared.Libs.DLW.Utils.seteq]
y:23 [in Undecidability.L.Computability.Computability]
Y:23 [in Undecidability.Synthetic.ReducibilityFacts]
y:23 [in Undecidability.TM.Code.BinNumbers.PosAddTM]
Y:23 [in Undecidability.Shared.Libs.PSL.FiniteTypes.CompoundFinTypes]
y:23 [in Complexity.L.Functions.BinNumsAdd]
y:232 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
y:235 [in Undecidability.L.Prelim.ARS]
y:239 [in Undecidability.TM.Hoare.HoareExamples]
y:24 [in Undecidability.Shared.Libs.DLW.Utils.fin_dec]
y:24 [in Undecidability.Shared.Libs.PSL.Lists.Removal]
y:24 [in Undecidability.TM.Code.BinNumbers.PosMultTM]
Y:24 [in Undecidability.L.Datatypes.List.List_basics]
y:24 [in Undecidability.TM.Hoare.HoareTactics]
Y:24 [in Complexity.TM.PrettyBounds.UnivBounds]
y:24 [in Undecidability.L.Prelim.LoopSum]
y:24 [in Undecidability.Shared.Libs.DLW.Utils.quotient]
y:24 [in Undecidability.L.Datatypes.List.List_nat]
y:24 [in Undecidability.TM.Univ.LowLevel]
y:24 [in Complexity.L.Functions.BinNumsSub]
Y:24 [in Undecidability.TM.Util.Relations]
y:24 [in Undecidability.TM.L.Eval]
Y:24 [in Undecidability.TM.Univ.LookupAssociativeListTM]
y:241 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
y:241 [in Undecidability.TM.Hoare.HoareRegister]
y:244 [in Undecidability.TM.Hoare.HoareRegister]
y:244 [in Undecidability.TM.Hoare.HoareExamples]
Y:247 [in Complexity.Libs.CookPrelim.MorePrelim]
Y:25 [in Undecidability.L.Prelim.ARS]
y:25 [in Undecidability.Shared.Libs.DLW.Utils.fin_quotient]
y:25 [in Undecidability.Shared.Libs.DLW.Vec.vec]
y:25 [in Undecidability.TM.Hoare.HoareTactics]
y:25 [in Complexity.Libs.UniformHomomorphisms]
y:25 [in Undecidability.TM.Code.CaseSum]
y:25 [in Undecidability.Shared.Libs.DLW.Utils.fin_base]
Y:25 [in Undecidability.Shared.Dec]
y:25 [in Undecidability.TM.Hoare.HoareMult]
y:25 [in Undecidability.TM.Code.BinNumbers.PosAddTM]
y:253 [in Complexity.L.TM.TMflatComp]
y:255 [in Complexity.L.TM.TMflatComp]
y:257 [in Undecidability.TM.Hoare.HoareRegister]
Y:258 [in Undecidability.Shared.Libs.DLW.Vec.vec]
y:258 [in Undecidability.TM.Hoare.HoareRegister]
y:26 [in Undecidability.Shared.Libs.PSL.Numbers]
y:26 [in Undecidability.TM.Code.CaseNat]
y:26 [in Undecidability.TM.Hoare.HoareTactics]
Y:26 [in Undecidability.Shared.Libs.PSL.EqDec]
Y:26 [in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
Y:26 [in Undecidability.TM.Util.VectorPrelim]
Y:26 [in Undecidability.L.Prelim.LoopSum]
y:26 [in Complexity.Complexity.Subtypes]
y:26 [in Complexity.NP.SAT.SAT_inNP]
y:26 [in Undecidability.TM.L.Eval]
y:26 [in Undecidability.Synthetic.ReducibilityFacts]
Y:26 [in Undecidability.Shared.Libs.PSL.FiniteTypes.CompoundFinTypes]
y:263 [in Undecidability.TM.Hoare.HoareCombinators]
Y:264 [in Undecidability.Shared.Libs.DLW.Vec.vec]
y:265 [in Complexity.L.TM.TMflatComp]
y:267 [in Complexity.L.TM.TMflatComp]
y:27 [in Undecidability.Shared.Libs.PSL.Lists.Removal]
y:27 [in Undecidability.TM.Code.BinNumbers.PosMultTM]
y:27 [in Undecidability.Shared.Libs.DLW.Utils.prime]
y:27 [in Undecidability.TM.Hoare.HoareTactics]
Y:27 [in Undecidability.TM.Univ.LowLevel]
y:27 [in Undecidability.TM.Code.NatSub]
Y:27 [in Undecidability.Shared.Dec]
y:27 [in Undecidability.L.Datatypes.LNat]
y:27 [in Complexity.L.Functions.BinNumsAdd]
y:271 [in Undecidability.TM.Hoare.HoareRegister]
y:273 [in Undecidability.TM.Hoare.HoareRegister]
y:274 [in Complexity.Libs.CookPrelim.MorePrelim]
y:276 [in Undecidability.TM.Hoare.HoareCombinators]
y:28 [in Undecidability.L.Prelim.ARS]
y:28 [in Undecidability.TM.Hoare.HoareTactics]
Y:28 [in Undecidability.Shared.Libs.PSL.EqDec]
y:28 [in Complexity.L.Functions.BinNumsSub]
Y:28 [in Undecidability.Shared.Libs.DLW.Utils.fin_base]
y:28 [in Undecidability.TM.Util.Relations]
y:28 [in Undecidability.Shared.Libs.PSL.Vectors.VectorDupfree]
Y:28 [in Undecidability.L.Datatypes.List.List_fold]
y:28 [in Complexity.TM.PrettyBounds.PrettyBounds]
y:281 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
y:285 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
y:285 [in Undecidability.TM.Hoare.HoareRegister]
y:286 [in Undecidability.TM.Hoare.HoareRegister]
y:287 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
y:29 [in Undecidability.Shared.Libs.PSL.Numbers]
y:29 [in Undecidability.Shared.Libs.DLW.Utils.fin_quotient]
y:29 [in Undecidability.TM.Hoare.HoareTactics]
y:29 [in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
y:29 [in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
y:29 [in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
y:29 [in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
Y:29 [in Complexity.L.TM.TMflatFun]
y:29 [in Undecidability.TM.Univ.LookupAssociativeListTM]
y:29 [in Undecidability.L.Datatypes.LNat]
y:290 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
Y:2915 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
y:292 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
y:292 [in Undecidability.TM.Hoare.HoareCombinators]
Y:2927 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
y:294 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
Y:295 [in Undecidability.Shared.Libs.DLW.Vec.vec]
Y:2952 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
y:299 [in Undecidability.TM.Hoare.HoareExamples]
y:3 [in Undecidability.TM.Code.BinNumbers.PosMultTM]
y:3 [in Undecidability.TM.Hoare.HoareTactics]
y:3 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
Y:3 [in Undecidability.TM.Univ.LowLevel]
y:3 [in Complexity.L.Functions.BinNumsSub]
y:3 [in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
y:3 [in Undecidability.TM.Code.BinNumbers.PosAddTM]
y:3 [in Complexity.TM.PrettyBounds.PrettyBounds]
y:30 [in Undecidability.Shared.Libs.DLW.Utils.fin_quotient]
y:30 [in Undecidability.Shared.Libs.DLW.Utils.fin_dec]
y:30 [in Undecidability.TM.Hoare.HoareTactics]
y:30 [in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
y:30 [in Undecidability.L.Prelim.LoopSum]
Y:30 [in Complexity.Complexity.Subtypes]
y:30 [in Undecidability.TM.Code.BinNumbers.NTM]
y:30 [in Undecidability.TM.Univ.LowLevel]
y:30 [in Complexity.L.Functions.BinNumsSub]
y:30 [in Undecidability.Shared.Libs.DLW.Utils.fin_base]
y:30 [in Undecidability.TM.Code.NatSub]
Y:30 [in Undecidability.Synthetic.Definitions]
Y:30 [in Undecidability.TM.Util.Relations]
y:30 [in Undecidability.TM.L.Eval]
Y:30 [in Undecidability.Shared.Dec]
y:30 [in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
y:30 [in Undecidability.TM.Hoare.HoareMult]
y:30 [in Undecidability.TM.PrettyBounds.MaxList]
y:30 [in Complexity.Libs.CookPrelim.MorePrelim]
y:300 [in Undecidability.TM.Hoare.HoareRegister]
y:302 [in Undecidability.TM.Hoare.HoareRegister]
y:304 [in Undecidability.TM.Hoare.HoareExamples]
Y:3040 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
y:305 [in Undecidability.TM.Hoare.HoareCombinators]
Y:3055 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
y:306 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
y:306 [in Undecidability.TM.Hoare.HoareCombinators]
Y:3061 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
y:307 [in Undecidability.TM.Hoare.HoareCombinators]
Y:3070 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
y:308 [in Undecidability.Shared.Libs.DLW.Vec.vec]
y:308 [in Undecidability.TM.Hoare.HoareCombinators]
y:309 [in Undecidability.TM.Hoare.HoareCombinators]
y:31 [in Undecidability.Shared.Libs.DLW.Utils.fin_quotient]
y:31 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
y:31 [in Undecidability.TM.Hoare.HoareTactics]
Y:31 [in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
Y:31 [in Undecidability.L.Functions.Decoding]
y:31 [in Undecidability.L.Datatypes.LNat]
y:31 [in Complexity.Complexity.PolyTimeComputable]
y:31 [in Complexity.Complexity.NP]
Y:3103 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Y:3109 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Y:3122 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
y:313 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
Y:3160 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Y:3169 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Y:3177 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Y:3187 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
y:32 [in Undecidability.Shared.Libs.PSL.Numbers]
y:32 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
y:32 [in Undecidability.TM.Code.BinNumbers.PosMultTM]
y:32 [in Undecidability.TM.Hoare.HoareTactics]
y:32 [in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
y:32 [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
y:32 [in Complexity.Libs.CookPrelim.FlatFinTypes]
Y:32 [in Undecidability.Synthetic.MoreEnumerabilityFacts]
y:32 [in Undecidability.Shared.Libs.DLW.Wf.wf_finite]
y:32 [in Undecidability.TM.L.Eval]
Y:32 [in Complexity.TM.Single.DecodeTapes]
y:32 [in Undecidability.Shared.Dec]
y:32 [in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
y:32 [in Undecidability.TM.Combinators.SequentialComposition]
y:32 [in Undecidability.TM.L.Transcode.Enc_to_Boollist]
y:32 [in Complexity.TM.PrettyBounds.PrettyBounds]
y:32 [in Undecidability.TM.Code.BinNumbers.PosShiftTM]
y:321 [in Undecidability.TM.Hoare.HoareExamples]
Y:325 [in Undecidability.TM.Code.Copy]
y:326 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
y:326 [in Undecidability.TM.Hoare.HoareExamples]
Y:329 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
y:329 [in Undecidability.Shared.Libs.DLW.Code.sss]
y:33 [in Undecidability.TM.Hoare.HoareTactics]
Y:33 [in Undecidability.Shared.Libs.PSL.EqDec]
y:33 [in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
y:33 [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
Y:33 [in Undecidability.TM.Util.VectorPrelim]
y:33 [in Complexity.TM.PrettyBounds.BaseCodeSpace]
y:33 [in Undecidability.L.Tactics.ComputableTactics]
y:33 [in Undecidability.L.Datatypes.LNat]
y:331 [in Undecidability.TM.Code.Copy]
y:332 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
y:333 [in Undecidability.Shared.Libs.DLW.Code.sss]
Y:335 [in Complexity.Libs.CookPrelim.MorePrelim]
Y:336 [in Undecidability.TM.Code.Copy]
y:336 [in Undecidability.Shared.Libs.DLW.Code.sss]
y:337 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
y:337 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
y:338 [in Complexity.Libs.CookPrelim.MorePrelim]
y:34 [in Undecidability.Shared.Libs.PSL.Numbers]
y:34 [in Undecidability.L.Prelim.ARS]
y:34 [in Undecidability.TM.Code.BinNumbers.PosMultTM]
y:34 [in Undecidability.TM.Hoare.HoareTactics]
Y:34 [in Complexity.TM.PrettyBounds.UnivBounds]
Y:34 [in Undecidability.TM.Univ.LowLevel]
y:34 [in Undecidability.TM.Code.NatSub]
y:34 [in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
Y:34 [in Undecidability.TM.Univ.LookupAssociativeListTM]
y:34 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
y:34 [in Complexity.TM.PrettyBounds.PrettyBounds]
y:34 [in Undecidability.TM.Code.BinNumbers.PosShiftTM]
y:341 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
y:342 [in Undecidability.TM.Code.Copy]
y:344 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Y:348 [in Undecidability.TM.Code.Copy]
y:35 [in Undecidability.TM.Hoare.HoareTactics]
Y:35 [in Undecidability.Shared.Libs.PSL.EqDec]
y:35 [in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
Y:35 [in Undecidability.Synthetic.EnumerabilityFacts]
y:35 [in Undecidability.TM.Code.BinNumbers.NTM]
y:35 [in Undecidability.Synthetic.MoreEnumerabilityFacts]
y:35 [in Undecidability.TM.Util.Relations]
Y:354 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
y:354 [in Undecidability.TM.Code.Copy]
y:354 [in Undecidability.TM.Hoare.HoareExamples]
Y:359 [in Undecidability.TM.Code.Copy]
Y:3594 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
y:36 [in Undecidability.Shared.Libs.DLW.Utils.fin_quotient]
y:36 [in Undecidability.TM.Hoare.HoareTactics]
Y:36 [in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
y:36 [in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
Y:36 [in Undecidability.Synthetic.Definitions]
y:36 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
y:36 [in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
y:36 [in Undecidability.Shared.Libs.PSL.Vectors.VectorDupfree]
y:36 [in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
y:36 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
y:36 [in Undecidability.TM.L.Transcode.Enc_to_Boollist]
y:36 [in Complexity.TM.PrettyBounds.PrettyBounds]
y:360 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
y:360 [in Undecidability.TM.Util.TM_facts]
y:360 [in Undecidability.TM.Hoare.HoareExamples]
Y:362 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
Y:3627 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Y:365 [in Undecidability.Shared.Libs.DLW.Vec.vec]
y:365 [in Undecidability.TM.Code.Copy]
Y:366 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
y:37 [in Undecidability.L.Prelim.ARS]
y:37 [in Undecidability.Shared.Libs.DLW.Utils.fin_quotient]
y:37 [in Undecidability.TM.Hoare.HoareTactics]
Y:37 [in Undecidability.Shared.Libs.PSL.EqDec]
y:37 [in Undecidability.L.Functions.EqBool]
y:37 [in Undecidability.TM.Code.NatSub]
y:37 [in Undecidability.L.Tactics.ComputableTactics]
y:37 [in Undecidability.L.Computability.Synthetic]
Y:37 [in Complexity.Complexity.NP]
Y:370 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
Y:371 [in Undecidability.TM.Code.Copy]
y:372 [in Undecidability.TM.Hoare.HoareCombinators]
y:374 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
y:375 [in Undecidability.TM.Hoare.HoareRegister]
y:376 [in Undecidability.TM.Hoare.HoareRegister]
Y:377 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
y:377 [in Undecidability.TM.Code.Copy]
y:378 [in Undecidability.TM.Hoare.HoareCombinators]
y:38 [in Undecidability.TM.Hoare.HoareTactics]
y:38 [in Complexity.NP.TM.mTM_to_singleTapeTM]
Y:38 [in Undecidability.Shared.Libs.PSL.Lists.Filter]
y:38 [in Undecidability.TM.Code.CaseSum]
Y:38 [in Undecidability.TM.Util.Relations]
y:38 [in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
y:38 [in Undecidability.L.Tactics.ComputableTactics]
Y:38 [in Undecidability.TM.Code.Code]
y:38 [in Undecidability.Shared.Libs.DLW.Vec.pos]
Y:38 [in Undecidability.TM.Hoare.HoareExamples]
y:381 [in Undecidability.TM.Hoare.HoareExamples]
Y:385 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
y:387 [in Undecidability.TM.Hoare.HoareExamples]
y:39 [in Undecidability.TM.Hoare.HoareTactics]
y:39 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
y:39 [in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
y:39 [in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
Y:39 [in Undecidability.Synthetic.MoreEnumerabilityFacts]
y:39 [in Undecidability.L.Tactics.ComputableTactics]
Y:39 [in Undecidability.Shared.Dec]
y:39 [in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
Y:39 [in Undecidability.L.Functions.Decoding]
y:39 [in Complexity.TM.PrettyBounds.PrettyBounds]
y:390 [in Undecidability.TM.Hoare.HoareRegister]
y:391 [in Undecidability.TM.Hoare.HoareRegister]
Y:393 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
y:4 [in Undecidability.Shared.Libs.PSL.Numbers]
y:4 [in Undecidability.L.Prelim.ARS]
y:4 [in Undecidability.TM.Hoare.HoareTactics]
y:4 [in Undecidability.L.Datatypes.LFinType]
Y:4 [in Undecidability.TM.Util.Relations]
y:4 [in Complexity.L.Functions.BinNumsCompare]
y:4 [in Undecidability.L.Datatypes.LNat]
y:40 [in Undecidability.Shared.Libs.PSL.Numbers]
y:40 [in Undecidability.Shared.Libs.PSL.Lists.Removal]
y:40 [in Undecidability.Shared.Libs.DLW.Utils.prime]
y:40 [in Undecidability.TM.Hoare.HoareTactics]
Y:40 [in Undecidability.Shared.Libs.PSL.EqDec]
y:40 [in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
y:40 [in Undecidability.TM.Univ.LowLevel]
y:40 [in Undecidability.L.Functions.EqBool]
Y:40 [in Complexity.Libs.CookPrelim.MorePrelim]
Y:401 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
y:404 [in Undecidability.Shared.Libs.DLW.Vec.vec]
y:407 [in Undecidability.Shared.Libs.DLW.Vec.vec]
y:407 [in Undecidability.TM.Hoare.HoareRegister]
Y:409 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
y:409 [in Undecidability.TM.Hoare.HoareRegister]
y:41 [in Undecidability.TM.Hoare.HoareTactics]
y:41 [in Complexity.TM.Code.Decode]
y:41 [in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
y:41 [in Undecidability.Synthetic.EnumerabilityFacts]
y:41 [in Undecidability.TM.Basic.Mono]
y:41 [in Undecidability.TM.Code.BinNumbers.NTM]
Y:41 [in Complexity.Libs.UniformHomomorphisms]
y:41 [in Undecidability.Shared.Libs.DLW.Utils.fin_upto]
y:41 [in Undecidability.Synthetic.MoreEnumerabilityFacts]
y:41 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
y:416 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
y:418 [in Undecidability.Shared.Libs.DLW.Vec.vec]
Y:418 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
y:42 [in Undecidability.Shared.Libs.PSL.Numbers]
y:42 [in Undecidability.TM.Code.BinNumbers.PosMultTM]
y:42 [in Undecidability.TM.Hoare.HoareTactics]
y:42 [in Undecidability.Shared.Libs.PSL.EqDec]
Y:42 [in Complexity.Complexity.Subtypes]
y:42 [in Complexity.TM.PrettyBounds.BaseCodeSpace]
y:42 [in Undecidability.TM.Util.Relations]
Y:42 [in Undecidability.L.Tactics.ComputableTactics]
Y:42 [in Undecidability.Shared.Dec]
y:42 [in Undecidability.L.Computability.Synthetic]
y:42 [in Undecidability.L.Datatypes.LNat]
y:42 [in Complexity.TM.PrettyBounds.PrettyBounds]
y:424 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
y:426 [in Undecidability.TM.Hoare.HoareRegister]
Y:427 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
y:428 [in Undecidability.TM.Hoare.HoareRegister]
y:43 [in Undecidability.TM.Hoare.HoareTactics]
y:43 [in Complexity.NP.TM.mTM_to_singleTapeTM]
y:43 [in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
y:43 [in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
Y:43 [in Undecidability.L.Tactics.ComputableDemo]
y:43 [in Undecidability.Shared.Libs.DLW.Utils.fin_upto]
y:43 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
y:43 [in Undecidability.TM.Code.Code]
Y:43 [in Undecidability.TM.Univ.LookupAssociativeListTM]
y:43 [in Complexity.Complexity.NP]
y:436 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
y:436 [in Undecidability.TM.Hoare.HoareCombinators]
y:44 [in Undecidability.Shared.Libs.PSL.Numbers]
y:44 [in Undecidability.L.Prelim.ARS]
y:44 [in Undecidability.Shared.Libs.PSL.Lists.Removal]
y:44 [in Undecidability.Shared.Libs.DLW.Utils.prime]
y:44 [in Undecidability.TM.Hoare.HoareTactics]
Y:44 [in Complexity.TM.PrettyBounds.UnivBounds]
Y:44 [in Undecidability.Synthetic.EnumerabilityFacts]
y:44 [in Undecidability.Shared.Libs.PSL.Lists.Position]
Y:44 [in Complexity.L.TM.CompCode]
y:44 [in Undecidability.TM.Code.CompareValue]
y:44 [in Undecidability.L.Computability.Synthetic]
y:44 [in Complexity.Complexity.PolyTimeComputable]
y:44 [in Undecidability.TM.Hoare.HoareExamples]
Y:44 [in Complexity.Libs.CookPrelim.MorePrelim]
y:442 [in Undecidability.TM.Hoare.HoareCombinators]
y:45 [in Complexity.Libs.Pigeonhole]
y:45 [in Undecidability.TM.Code.BinNumbers.PosMultTM]
y:45 [in Undecidability.TM.Hoare.HoareTactics]
y:45 [in Undecidability.TM.Code.NatSub]
y:45 [in Undecidability.TM.Lifting.LiftTapes]
y:45 [in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
Y:45 [in Undecidability.TM.Code.Code]
Y:45 [in Undecidability.L.Functions.Decoding]
y:45 [in Complexity.Complexity.PolyTimeComputable]
y:45 [in Complexity.TM.PrettyBounds.PrettyBounds]
Y:453 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
y:458 [in Undecidability.TM.Hoare.HoareCombinators]
y:46 [in Undecidability.TM.Hoare.HoareTactics]
y:46 [in Undecidability.TM.Basic.Mono]
y:46 [in Undecidability.Shared.Libs.DLW.Utils.fin_upto]
Y:46 [in Undecidability.TM.Util.Relations]
Y:46 [in Undecidability.L.Tactics.ComputableTactics]
y:46 [in Undecidability.L.Computability.Synthetic]
y:46 [in Undecidability.L.Datatypes.LNat]
y:46 [in Complexity.Complexity.PolyTimeComputable]
Y:46 [in Undecidability.Synthetic.ReducibilityFacts]
y:464 [in Undecidability.TM.Hoare.HoareCombinators]
y:47 [in Undecidability.TM.Code.BinNumbers.PosMultTM]
y:47 [in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
y:47 [in Undecidability.TM.Code.CompareValue]
Y:47 [in Undecidability.Shared.Libs.DLW.Utils.fin_base]
y:47 [in Undecidability.TM.Code.Code]
y:47 [in Undecidability.TM.Hoare.HoareMult]
y:47 [in Undecidability.L.Computability.Synthetic]
y:47 [in Complexity.Complexity.NP]
y:474 [in Undecidability.TM.Hoare.HoareRegister]
y:48 [in Undecidability.L.Prelim.ARS]
y:48 [in Undecidability.Shared.Libs.DLW.Utils.fin_quotient]
Y:48 [in Complexity.TM.Code.Decode]
y:48 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
Y:48 [in Undecidability.Synthetic.DecidabilityFacts]
y:48 [in Undecidability.L.Computability.Synthetic]
y:48 [in Undecidability.Synthetic.Infinite]
y:48 [in Undecidability.L.Datatypes.LNat]
Y:49 [in Undecidability.Shared.Libs.PSL.EqDec]
y:49 [in Complexity.TM.PrettyBounds.BaseCodeSpace]
Y:49 [in Complexity.L.TM.TMflatComp]
y:49 [in Undecidability.Shared.Libs.DLW.Utils.fin_upto]
y:49 [in Undecidability.TM.Code.NatSub]
y:49 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
y:49 [in Undecidability.TM.Code.CasePair]
y:49 [in Undecidability.TM.L.Transcode.Enc_to_Boollist]
Y:49 [in Undecidability.TM.Hoare.HoareExamples]
y:49 [in Complexity.TM.PrettyBounds.PrettyBounds]
y:5 [in Undecidability.TM.Hoare.HoareTactics]
y:5 [in Undecidability.Synthetic.EnumerabilityFacts]
y:5 [in Undecidability.Shared.Libs.DLW.Utils.quotient]
y:5 [in Undecidability.L.Tactics.ComputableDemo]
Y:5 [in Complexity.L.TM.TMflatComp]
y:5 [in Complexity.Complexity.UpToCPoly]
Y:5 [in Undecidability.Synthetic.Undecidability]
y:5 [in Undecidability.L.Functions.EqBool]
Y:5 [in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
Y:5 [in Undecidability.L.Functions.Encoding]
y:5 [in Complexity.L.Functions.BinNumsAdd]
Y:5 [in Undecidability.L.AbstractMachines.LargestVar]
y:50 [in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
y:50 [in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
y:50 [in Undecidability.TM.Util.Relations]
Y:50 [in Undecidability.Synthetic.DecidabilityFacts]
y:50 [in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
Y:50 [in Complexity.Complexity.PolyTimeComputable]
y:50 [in Complexity.Complexity.NP]
Y:50 [in Undecidability.Synthetic.ReducibilityFacts]
y:51 [in Complexity.Libs.Pigeonhole]
y:51 [in Undecidability.L.Prelim.ARS]
Y:51 [in Complexity.TM.PrettyBounds.BaseCode]
y:51 [in Complexity.L.TM.CompCode]
y:51 [in Undecidability.TM.Code.CompareValue]
Y:52 [in Undecidability.Shared.Libs.PSL.EqDec]
y:52 [in Complexity.TM.Code.Decode]
y:52 [in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
y:52 [in Undecidability.Shared.Libs.PSL.Lists.Position]
y:52 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
y:52 [in Undecidability.Shared.Libs.DLW.Utils.fin_base]
y:52 [in Undecidability.TM.Code.NatSub]
y:52 [in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
y:52 [in Undecidability.TM.Hoare.HoareMult]
y:52 [in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
y:53 [in Undecidability.Shared.Libs.DLW.Utils.fin_quotient]
y:53 [in Undecidability.TM.Code.BinNumbers.PosMultTM]
Y:53 [in Complexity.TM.PrettyBounds.UnivBounds]
y:53 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
y:53 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
y:53 [in Undecidability.Shared.Libs.DLW.Utils.quotient]
y:53 [in Undecidability.Shared.Libs.DLW.Utils.fin_upto]
y:53 [in Undecidability.Shared.Libs.PSL.Vectors.VectorDupfree]
y:53 [in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
y:53 [in Undecidability.Synthetic.Infinite]
y:53 [in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
Y:53 [in Undecidability.L.Functions.Decoding]
y:53 [in Undecidability.TM.L.Transcode.Enc_to_Boollist]
y:53 [in Undecidability.TM.Code.BinNumbers.PosShiftTM]
y:54 [in Complexity.TM.PrettyBounds.BaseCode]
y:54 [in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
Y:54 [in Complexity.Complexity.Subtypes]
y:54 [in Undecidability.TM.Code.CompareValue]
y:54 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
Y:54 [in Undecidability.Shared.Libs.DLW.Utils.fin_base]
y:54 [in Undecidability.L.Datatypes.List.List_eqb]
y:54 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
Y:54 [in Undecidability.Synthetic.ReducibilityFacts]
Y:547 [in Complexity.NP.TM.LM_to_mTM]
y:55 [in Undecidability.Shared.Libs.DLW.Utils.fin_quotient]
y:55 [in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
y:55 [in Undecidability.Shared.Libs.PSL.Lists.Position]
y:55 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
y:55 [in Complexity.L.TM.CompCode]
Y:55 [in Complexity.L.TM.TMflatComp]
y:55 [in Undecidability.Shared.Libs.DLW.Utils.fin_upto]
y:55 [in Complexity.L.TM.TMflat]
y:55 [in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
y:55 [in Undecidability.TM.PrettyBounds.MaxList]
y:55 [in Undecidability.TM.Hoare.HoareExamples]
y:56 [in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
y:56 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
y:56 [in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
y:56 [in Undecidability.L.Computability.Synthetic]
Y:56 [in Complexity.Complexity.Definitions]
y:56 [in Undecidability.TM.PrettyBounds.MaxList]
Y:56 [in Complexity.NP.TM.LM_to_mTM]
y:57 [in Undecidability.Shared.Libs.DLW.Utils.fin_quotient]
y:57 [in Undecidability.TM.Util.Relations]
Y:57 [in Undecidability.TM.Univ.LookupAssociativeListTM]
y:58 [in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
y:58 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
y:58 [in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
y:58 [in Undecidability.TM.Code.CompareValue]
Y:580 [in Complexity.NP.TM.LM_to_mTM]
y:59 [in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
y:59 [in Undecidability.Shared.Libs.DLW.Utils.quotient]
y:59 [in Undecidability.TM.Code.CaseSum]
Y:59 [in Undecidability.Shared.Libs.DLW.Utils.fin_base]
y:59 [in Undecidability.L.Computability.Synthetic]
Y:59 [in Complexity.Complexity.PolyTimeComputable]
y:6 [in Undecidability.L.Prelim.ARS]
y:6 [in Undecidability.TM.Hoare.HoareTactics]
y:6 [in Undecidability.Shared.Libs.PSL.Retracts]
y:6 [in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
y:6 [in Undecidability.Shared.Libs.DLW.Utils.fin_upto]
y:6 [in Undecidability.TM.Code.NatSub]
y:6 [in Complexity.NP.TM.M_LM2TM]
y:6 [in Undecidability.Shared.Libs.DLW.Wf.wf_finite]
y:6 [in Undecidability.L.TM.TMEncoding]
y:6 [in Undecidability.TM.Code.BinNumbers.PosAddTM]
y:60 [in Undecidability.L.Prelim.ARS]
y:60 [in Undecidability.Shared.Libs.DLW.Utils.fin_quotient]
y:60 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
y:60 [in Undecidability.Shared.Libs.DLW.Utils.quotient]
y:60 [in Undecidability.TM.Code.NatSub]
y:61 [in Undecidability.Shared.Libs.DLW.Utils.quotient]
y:61 [in Undecidability.TM.Code.NatSub]
y:61 [in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
y:61 [in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
Y:61 [in Undecidability.TM.Hoare.HoareExamples]
Y:62 [in Complexity.TM.PrettyBounds.BaseCode]
y:62 [in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
y:62 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
y:62 [in Complexity.L.TM.TMflatComp]
y:62 [in Undecidability.TM.Hoare.HoareCombinators]
y:62 [in Complexity.TM.PrettyBounds.PrettyBounds]
y:63 [in Undecidability.Shared.Libs.DLW.Utils.fin_quotient]
Y:63 [in Complexity.TM.PrettyBounds.UnivBounds]
Y:63 [in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
y:63 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
y:63 [in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
y:64 [in Undecidability.L.Prelim.ARS]
y:64 [in Undecidability.TM.Code.List.Nth]
y:64 [in Undecidability.L.Tactics.Extract]
Y:64 [in Undecidability.Shared.Libs.DLW.Utils.quotient]
Y:64 [in Undecidability.L.Datatypes.LVector]
Y:64 [in Undecidability.Shared.Libs.DLW.Utils.fin_base]
Y:64 [in Undecidability.L.Functions.FinTypeLookup]
y:65 [in Complexity.TM.PrettyBounds.BaseCode]
y:65 [in Undecidability.Shared.Libs.DLW.Utils.fin_quotient]
y:65 [in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
Y:65 [in Undecidability.TM.Util.Relations]
y:66 [in Complexity.TM.PrettyBounds.BaseCode]
Y:66 [in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
Y:66 [in Undecidability.Shared.Libs.DLW.Utils.fin_base]
y:66 [in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
y:67 [in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
y:67 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
Y:67 [in Undecidability.Shared.Libs.DLW.Utils.quotient]
Y:67 [in Complexity.Complexity.Definitions]
Y:67 [in Undecidability.TM.Univ.LookupAssociativeListTM]
y:67 [in Complexity.TM.Single.DecodeTape]
y:67 [in Undecidability.TM.Hoare.HoareExamples]
Y:68 [in Undecidability.Shared.Libs.DLW.Utils.fin_base]
Y:68 [in Complexity.Complexity.PolyTimeComputable]
y:69 [in Undecidability.TM.Code.List.Nth]
y:69 [in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
y:69 [in Undecidability.Shared.Libs.DLW.Utils.php]
y:69 [in Undecidability.TM.Util.Relations]
y:69 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
y:7 [in Undecidability.Shared.Libs.PSL.Lists.Removal]
y:7 [in Undecidability.TM.Code.BinNumbers.PosMultTM]
y:7 [in Undecidability.TM.Hoare.HoareTactics]
y:7 [in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
y:7 [in Undecidability.Shared.embed_nat]
y:7 [in Undecidability.TM.Univ.LowLevel]
y:7 [in Undecidability.L.Datatypes.LFinType]
y:7 [in Complexity.NP.TM.M_multi2mono]
y:7 [in Undecidability.L.Datatypes.LNat]
y:7 [in Complexity.L.Functions.BinNumsAdd]
Y:70 [in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
Y:70 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
Y:70 [in Undecidability.Shared.Libs.DLW.Utils.quotient]
y:70 [in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
Y:70 [in Complexity.Complexity.PolyTimeComputable]
y:71 [in Undecidability.L.Prelim.ARS]
y:71 [in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
y:71 [in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
Y:71 [in Undecidability.TM.Util.Relations]
y:71 [in Complexity.TM.PrettyBounds.PrettyBounds]
Y:72 [in Complexity.TM.PrettyBounds.UnivBounds]
y:72 [in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
Y:72 [in Undecidability.L.Computability.Synthetic]
Y:72 [in Complexity.Complexity.PolyTimeComputable]
Y:72 [in Undecidability.TM.Hoare.HoareExamples]
y:72 [in Undecidability.TM.Code.BinNumbers.PosShiftTM]
Y:73 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
y:73 [in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
y:73 [in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
Y:73 [in Undecidability.TM.Util.Relations]
Y:73 [in Complexity.Complexity.NP]
y:74 [in Undecidability.L.Prelim.ARS]
y:74 [in Undecidability.TM.Code.BinNumbers.PosDefinitions]
y:74 [in Undecidability.Shared.Libs.PSL.Retracts]
Y:74 [in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
y:74 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
y:74 [in Undecidability.L.Datatypes.LVector]
Y:74 [in Undecidability.Shared.Libs.DLW.Utils.fin_base]
y:74 [in Undecidability.TM.Hoare.HoareCombinators]
y:74 [in Undecidability.TM.Code.BinNumbers.PosShiftTM]
y:75 [in Undecidability.TM.Util.Prelim]
y:75 [in Complexity.Libs.CookPrelim.PolyBounds]
y:75 [in Undecidability.TM.L.HeapInterpreter.LookupTM]
y:76 [in Undecidability.L.Complexity.UpToCNary]
y:76 [in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
y:76 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
Y:76 [in Undecidability.Shared.Libs.DLW.Utils.fin_base]
Y:76 [in Complexity.Complexity.PolyTimeComputable]
y:77 [in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
y:77 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
Y:77 [in Complexity.NP.Clique.kSAT_to_Clique]
y:77 [in Undecidability.L.Computability.Synthetic]
y:77 [in Complexity.TM.Single.DecodeTape]
y:78 [in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
Y:78 [in Undecidability.TM.Util.Relations]
y:78 [in Undecidability.TM.Hoare.HoareExamples]
y:79 [in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
y:79 [in Undecidability.Shared.Libs.DLW.Vec.vec]
y:79 [in Undecidability.TM.Util.Prelim]
y:79 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
y:79 [in Complexity.Complexity.Definitions]
Y:8 [in Undecidability.L.Prelim.ARS]
y:8 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
Y:8 [in Complexity.Complexity.EncodableP]
y:8 [in Undecidability.TM.Hoare.HoareTactics]
y:8 [in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
Y:8 [in Undecidability.L.Datatypes.LSum]
y:8 [in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
y:8 [in Undecidability.Synthetic.EnumerabilityFacts]
Y:8 [in Undecidability.Shared.Libs.DLW.Utils.quotient]
y:8 [in Complexity.TM.Code.DecodeList]
Y:8 [in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
Y:8 [in Complexity.Complexity.Subtypes]
y:8 [in Undecidability.Shared.Libs.DLW.Utils.fin_upto]
y:8 [in Undecidability.Shared.Libs.PSL.Bijection]
y:8 [in Complexity.L.Functions.BinNumsCompare]
y:8 [in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
y:8 [in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
y:8 [in Undecidability.Shared.Libs.DLW.Utils.seteq]
Y:8 [in Undecidability.L.Computability.Computability]
y:8 [in Complexity.TM.PrettyBounds.PrettyBounds]
y:80 [in Undecidability.L.Complexity.UpToCNary]
y:80 [in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
y:80 [in Complexity.L.TM.CompCode]
y:80 [in Complexity.NP.Clique.kSAT_to_Clique]
y:81 [in Undecidability.L.Prelim.ARS]
Y:81 [in Complexity.TM.PrettyBounds.UnivBounds]
y:81 [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
y:81 [in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
y:81 [in Complexity.TM.Single.DecodeTape]
y:81 [in Undecidability.TM.L.HeapInterpreter.LookupTM]
y:81 [in Undecidability.L.Tactics.Computable]
y:82 [in Undecidability.Shared.Libs.DLW.Utils.prime]
Y:82 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
y:82 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
y:82 [in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
y:82 [in Complexity.NP.Clique.kSAT_to_Clique]
y:83 [in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
y:83 [in Undecidability.L.Complexity.UpToCNary]
Y:83 [in Undecidability.TM.Single.StepTM]
Y:83 [in Undecidability.TM.Util.Prelim]
Y:83 [in Undecidability.TM.Util.Relations]
y:83 [in Undecidability.TM.Hoare.HoareExamples]
y:84 [in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
y:84 [in Undecidability.Shared.Libs.DLW.Vec.vec]
y:84 [in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
y:84 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
y:84 [in Undecidability.L.Datatypes.LVector]
Y:84 [in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
y:84 [in Undecidability.TM.Hoare.HoareCombinators]
Y:84 [in Complexity.Complexity.NP]
Y:84 [in Complexity.NP.TM.LM_to_mTM]
y:84 [in Complexity.TM.PrettyBounds.PrettyBounds]
y:85 [in Undecidability.L.Prelim.ARS]
y:85 [in Undecidability.TM.Code.CaseList]
y:85 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
y:85 [in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
y:85 [in Undecidability.TM.Code.CasePair]
y:86 [in Undecidability.L.Complexity.UpToCNary]
y:86 [in Undecidability.TM.Code.List.Nth]
y:86 [in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
y:86 [in Undecidability.L.Datatypes.LVector]
Y:86 [in Complexity.TM.PrettyBounds.BaseCodeSpace]
y:86 [in Undecidability.TM.Univ.LookupAssociativeListTM]
y:86 [in Undecidability.TM.Hoare.HoareExamples]
y:87 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
y:87 [in Undecidability.Shared.Libs.DLW.Utils.sums]
Y:87 [in Undecidability.TM.Code.Code]
Y:87 [in Complexity.Complexity.Definitions]
Y:87 [in Complexity.Complexity.PolyTimeComputable]
Y:88 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
Y:88 [in Complexity.TM.PrettyBounds.PrettyBounds]
y:88 [in Undecidability.TM.Code.BinNumbers.PosShiftTM]
y:89 [in Undecidability.L.Complexity.UpToCNary]
y:89 [in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
y:89 [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
Y:89 [in Undecidability.Shared.Libs.DLW.Utils.php]
Y:89 [in Undecidability.TM.Util.Relations]
y:89 [in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
y:9 [in Undecidability.Shared.Libs.PSL.Lists.Removal]
y:9 [in Undecidability.TM.Hoare.HoareTactics]
Y:9 [in Undecidability.Shared.Libs.PSL.EqDec]
Y:9 [in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
Y:9 [in Undecidability.L.Prelim.LoopSum]
y:9 [in Undecidability.Shared.Libs.DLW.Wf.acc_irr]
y:9 [in Undecidability.TM.Combinators.SequentialComposition]
y:9 [in Complexity.L.Functions.BinNumsAdd]
y:90 [in Undecidability.L.Prelim.ARS]
y:90 [in Undecidability.TM.Code.CaseList]
Y:90 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
Y:90 [in Complexity.TM.PrettyBounds.UnivBounds]
y:90 [in Complexity.TM.PrettyBounds.BaseCodeSpace]
y:90 [in Undecidability.Shared.Libs.DLW.Utils.sums]
y:90 [in Undecidability.L.Tactics.Computable]
y:90 [in Undecidability.TM.Hoare.HoareExamples]
y:90 [in Undecidability.TM.Code.BinNumbers.PosShiftTM]
y:91 [in Undecidability.TM.Code.List.Nth]
Y:91 [in Undecidability.L.Complexity.UpToC]
y:91 [in Undecidability.TM.Univ.LookupAssociativeListTM]
y:92 [in Undecidability.L.Complexity.UpToCNary]
Y:92 [in Undecidability.TM.Single.StepTM]
y:92 [in Undecidability.TM.Hoare.HoareExamples]
y:93 [in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
y:93 [in Undecidability.L.Complexity.UpToC]
y:93 [in Undecidability.Shared.Libs.DLW.Utils.php]
y:93 [in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
Y:93 [in Complexity.Complexity.Definitions]
Y:93 [in Complexity.Complexity.PolyTimeComputable]
y:93 [in Undecidability.TM.Hoare.HoareExamples]
y:94 [in Undecidability.TM.Code.CodeTM]
y:94 [in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
y:94 [in Complexity.TM.PrettyBounds.PrettyBounds]
y:95 [in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
Y:95 [in Undecidability.TM.Util.Relations]
Y:96 [in Undecidability.L.Complexity.UpToCNary]
y:96 [in Undecidability.L.Tactics.ComputableTime]
y:96 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
y:96 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
y:96 [in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
y:96 [in Undecidability.TM.Code.Code]
y:96 [in Undecidability.TM.Hoare.HoareExamples]
y:97 [in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
y:97 [in Undecidability.L.Complexity.UpToC]
y:97 [in Undecidability.TM.Code.CodeTM]
Y:97 [in Undecidability.Shared.Libs.DLW.Utils.php]
y:97 [in Undecidability.TM.Hoare.HoareCombinators]
y:98 [in Undecidability.L.Complexity.UpToCNary]
Y:98 [in Undecidability.TM.Single.StepTM]
Y:98 [in Undecidability.TM.Util.Prelim]
y:98 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
y:98 [in Undecidability.L.Computability.Synthetic]
y:98 [in Undecidability.TM.L.HeapInterpreter.LookupTM]
y:99 [in Undecidability.TM.Combinators.While]
y:99 [in Complexity.L.TM.CompCode]
Y:99 [in Undecidability.TM.Util.Relations]
y:99 [in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
Y:99 [in Complexity.Complexity.PolyTimeComputable]
Y:99 [in Complexity.Complexity.NP]
y:99 [in Undecidability.TM.Hoare.HoareExamples]
Y:99 [in Complexity.Libs.CookPrelim.MorePrelim]
y:994 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
y:999 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]

Z

Z__case:97 [in Undecidability.L.Complexity.UpToCNary]
Z__case:92 [in Undecidability.L.Complexity.UpToC]
z':102 [in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
z':111 [in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
z':86 [in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
z1:62 [in Undecidability.TM.Util.Relations]
z2:63 [in Undecidability.TM.Util.Relations]
z:10 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
Z:100 [in Complexity.Complexity.NP]
z:102 [in Undecidability.L.Complexity.UpToC]
Z:102 [in Undecidability.TM.Util.Relations]
z:104 [in Undecidability.L.Complexity.UpToCNary]
z:105 [in Undecidability.L.Complexity.UpToCNary]
z:105 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
z:106 [in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
z:108 [in Undecidability.L.Complexity.UpToCNary]
Z:109 [in Undecidability.TM.Util.Relations]
z:11 [in Undecidability.Shared.Libs.DLW.Utils.sums]
z:11 [in Undecidability.L.Tactics.ComputableTactics]
z:113 [in Undecidability.TM.Util.Relations]
Z:115 [in Complexity.Libs.CookPrelim.PolyBounds]
z:118 [in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
z:12 [in Undecidability.L.Tactics.ComputableTactics]
Z:12 [in Complexity.Complexity.PolyTimeComputable]
z:12 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
z:120 [in Complexity.Complexity.NP]
z:120 [in Undecidability.TM.Hoare.HoareExamples]
z:122 [in Complexity.Complexity.NP]
z:123 [in Complexity.Complexity.NP]
z:123 [in Undecidability.TM.Hoare.HoareExamples]
z:126 [in Complexity.Complexity.NP]
z:13 [in Undecidability.L.Prelim.ARS]
z:133 [in Undecidability.TM.Util.Relations]
z:133 [in Complexity.Libs.CookPrelim.MorePrelim]
z:134 [in Undecidability.Shared.Libs.DLW.Utils.sums]
z:138 [in Undecidability.Shared.Libs.DLW.Utils.sums]
z:139 [in Undecidability.TM.Util.Relations]
Z:14 [in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
z:141 [in Undecidability.L.Prelim.ARS]
z:144 [in Undecidability.TM.Util.Relations]
z:147 [in Undecidability.L.Prelim.ARS]
z:15 [in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
z:156 [in Complexity.Libs.CookPrelim.MorePrelim]
z:16 [in Undecidability.L.Tactics.ComputableDemo]
z:168 [in Complexity.Libs.CookPrelim.MorePrelim]
Z:188 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
z:19 [in Undecidability.Shared.Libs.DLW.Utils.fin_quotient]
Z:19 [in Undecidability.L.Functions.UnboundIteration]
Z:191 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
Z:194 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
Z:195 [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
z:20 [in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
Z:204 [in Undecidability.Shared.Libs.DLW.Vec.vec]
z:217 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
z:219 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
z:22 [in Undecidability.L.Tactics.ComputableDemo]
Z:22 [in Complexity.Complexity.PolyTimeComputable]
z:23 [in Complexity.TM.PrettyBounds.M2MBounds]
z:24 [in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
Z:24 [in Undecidability.L.Datatypes.LVector]
z:26 [in Undecidability.L.Functions.UnboundIteration]
Z:27 [in Undecidability.TM.Util.VectorPrelim]
z:28 [in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
Z:2916 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Z:2928 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Z:2953 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Z:3 [in Complexity.Complexity.PolyTimeComputable]
z:3 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
Z:30 [in Complexity.L.TM.TMflatFun]
Z:3041 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Z:3056 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Z:3062 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Z:3071 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Z:31 [in Undecidability.TM.Util.Relations]
Z:3104 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Z:3110 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Z:3123 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Z:3161 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Z:3170 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Z:3178 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Z:3188 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
z:32 [in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
z:33 [in Undecidability.Shared.Libs.DLW.Wf.wf_finite]
z:34 [in Undecidability.TM.Util.Relations]
Z:35 [in Complexity.Complexity.PolyTimeComputable]
Z:3595 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Z:3628 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
z:37 [in Complexity.NP.TM.mTM_to_singleTapeTM]
z:37 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
z:38 [in Undecidability.L.Prelim.ARS]
z:4 [in Undecidability.Shared.Libs.PSL.Lists.Removal]
z:4 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
z:40 [in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
z:40 [in Undecidability.TM.PrettyBounds.MaxList]
z:408 [in Undecidability.Shared.Libs.DLW.Vec.vec]
Z:410 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
Z:419 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
z:42 [in Complexity.NP.TM.mTM_to_singleTapeTM]
z:45 [in Undecidability.L.Prelim.ARS]
Z:5 [in Undecidability.TM.Util.Relations]
Z:50 [in Complexity.L.TM.TMflatComp]
z:50 [in Complexity.TM.PrettyBounds.PrettyBounds]
Z:51 [in Complexity.Complexity.PolyTimeComputable]
z:52 [in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
z:54 [in Undecidability.Shared.Libs.PSL.Numbers]
Z:54 [in Undecidability.TM.Util.Relations]
Z:56 [in Complexity.L.TM.TMflatComp]
z:58 [in Undecidability.Shared.Libs.DLW.Utils.fin_quotient]
Z:59 [in Undecidability.TM.Util.Relations]
z:6 [in Complexity.TM.PrettyBounds.M2MBounds]
z:6 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
z:6 [in Undecidability.L.Tactics.ComputableDemo]
z:6 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
Z:60 [in Complexity.Complexity.PolyTimeComputable]
z:62 [in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
z:63 [in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
z:63 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
z:63 [in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
z:63 [in Complexity.TM.PrettyBounds.PrettyBounds]
Z:65 [in Undecidability.L.Datatypes.LVector]
z:66 [in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
z:66 [in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
z:67 [in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
z:68 [in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
z:68 [in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
z:68 [in Undecidability.TM.PrettyBounds.MaxList]
z:7 [in Undecidability.Shared.Libs.DLW.Wf.wf_finite]
z:7 [in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
z:70 [in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
z:71 [in Undecidability.Shared.Libs.DLW.Utils.fin_base]
z:72 [in Undecidability.L.Prelim.ARS]
z:72 [in Complexity.TM.PrettyBounds.PrettyBounds]
z:75 [in Undecidability.L.Prelim.ARS]
z:75 [in Undecidability.L.Complexity.UpToCNary]
z:79 [in Undecidability.L.Complexity.UpToCNary]
z:79 [in Complexity.TM.PrettyBounds.PrettyBounds]
z:8 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
z:81 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
z:82 [in Undecidability.L.Prelim.ARS]
z:82 [in Undecidability.TM.PrettyBounds.MaxList]
z:83 [in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
Z:84 [in Undecidability.TM.Util.Prelim]
z:85 [in Undecidability.Shared.Libs.PSL.Retracts]
z:86 [in Undecidability.L.Prelim.ARS]
Z:88 [in Undecidability.TM.Code.Code]
z:89 [in Complexity.TM.PrettyBounds.PrettyBounds]
Z:9 [in Undecidability.L.Prelim.ARS]
z:9 [in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
z:9 [in Undecidability.TM.Util.Relations]
z:91 [in Undecidability.L.Prelim.ARS]
z:94 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
z:94 [in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
z:95 [in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
z:96 [in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
z:97 [in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
z:98 [in Undecidability.L.Complexity.UpToC]
z:98 [in Complexity.TM.PrettyBounds.PrettyBounds]
z:99 [in Undecidability.L.Complexity.UpToC]

other

Σ__X:1 [in Undecidability.TM.Code.List.Cons_constant]
Σ:1 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
Σ:1 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_nat_facts]
Σ:1 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
Σ:10 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
Σ:110 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
Σ:12 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
Σ:17 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
Σ:19 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
Σ:22 [in Complexity.TM.Code.DecodeList]
Σ:25 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
Σ:30 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
Σ:31 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
Σ:36 [in Undecidability.TM.TM]
Σ:36 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
Σ:404 [in Undecidability.TM.Util.TM_facts]
Σ:43 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
Σ:43 [in Undecidability.TM.TM]
Σ:44 [in Undecidability.TM.TM]
Σ:44 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
Σ:47 [in Undecidability.TM.TM]
Σ:49 [in Undecidability.TM.TM]
Σ:51 [in Undecidability.TM.TM]
Σ:55 [in Undecidability.TM.TM]
Σ:59 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
Σ:6 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
Σ:65 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
Σ:72 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
Σ:8 [in Undecidability.TM.L.CompilerBoolFuns.Compiler]
Σ:97 [in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
γ1:1004 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1011 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1029 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1037 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1045 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1051 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1058 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1065 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1105 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1112 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1119 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1137 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1145 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1153 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1159 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1166 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1173 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1191 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1199 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1207 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1213 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1220 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1227 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1243 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1250 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1257 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1264 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1271 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1278 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1288 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1295 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1302 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1309 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1316 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1323 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1333 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1340 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1347 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1354 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1361 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1368 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1388 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1396 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1404 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1435 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1443 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1451 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:146 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
γ1:1482 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1490 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1498 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1525 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1533 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1541 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:156 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
γ1:1572 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1580 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1588 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1618 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1626 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1634 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:164 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
γ1:1659 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1667 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1675 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1698 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1706 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1714 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1737 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1745 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1753 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1788 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1795 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1802 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1816 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1823 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1830 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1836 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1843 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1850 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1864 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1871 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1878 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1884 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1891 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1898 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1911 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1918 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1925 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1932 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1939 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1946 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1956 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1963 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1970 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1977 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1983 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1989 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:1995 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:2043 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:2075 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:208 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:2108 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:2119 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:214 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:2141 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:2152 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:2173 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:2183 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:220 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:2203 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:2213 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:2226 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:2235 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:2244 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:226 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:2280 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:2289 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:2298 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:2306 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:2314 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:232 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:2322 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:2354 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:2362 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:2370 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:2378 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:238 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:2386 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:2394 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:2426 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:2434 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:2442 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:2449 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:2456 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:2463 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:2491 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:2498 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:2505 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:2527 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:2550 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:2556 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:2562 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:2568 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:2574 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:2580 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:2586 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:2593 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:2624 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:2631 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:3281 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:3291 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:3301 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:3313 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:3323 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:3333 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:3345 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:3355 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:3365 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:3375 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:3383 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:3391 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:3401 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:3409 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:3417 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:3427 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:3435 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:3443 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:3455 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:3465 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:3475 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:3484 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:3493 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:3502 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:3510 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:3518 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:3526 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:3553 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:3560 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:3566 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:359 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:369 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:379 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:402 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:411 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:420 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:445 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:455 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:465 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:490 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:500 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:510 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:533 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:542 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:551 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:576 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:586 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:596 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:620 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:630 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:640 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:663 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:673 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:683 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:706 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:716 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:726 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:766 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:773 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:780 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:802 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:811 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:820 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:826 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:833 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:840 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:862 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:871 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:880 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:886 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:893 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:900 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:943 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:950 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:957 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:975 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:983 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:991 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ1:997 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1005 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1012 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1052 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1059 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1066 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1083 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1091 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1099 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1106 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1113 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1120 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1138 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1146 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1154 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1160 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1167 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1174 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1214 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1221 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1228 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1244 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1251 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1258 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1265 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1272 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1279 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1289 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1296 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1303 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1310 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1317 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1324 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1334 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1341 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1348 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1355 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1362 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1369 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1389 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1397 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1405 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1436 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1444 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1452 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:147 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
γ2:1483 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1491 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1499 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1526 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1534 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1542 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:157 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
γ2:1573 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1581 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1589 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1619 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1627 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1635 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:165 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
γ2:1660 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1668 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1676 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1699 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1707 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1715 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1738 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1746 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1754 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1768 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1775 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1782 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1789 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1796 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1803 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1817 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1824 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1831 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1837 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1844 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1851 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1885 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1892 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1899 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1912 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1919 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1926 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1933 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1940 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1947 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1957 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1964 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1971 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1978 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1984 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1990 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:1996 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:2011 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:2044 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:209 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:2097 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:2120 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:2130 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:215 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:2153 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:2163 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:2184 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:2193 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:221 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:2214 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:2227 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:2236 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:2245 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:2253 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:2262 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:227 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:2271 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:2307 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:2315 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:2323 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:233 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:2330 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:2338 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:2346 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:2379 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:2387 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:239 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:2395 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:2402 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:2410 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:2418 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:2450 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:2457 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:2464 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:2470 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:2477 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:2484 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:2528 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:2551 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:2557 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:2563 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:2569 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:2575 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:2581 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:2587 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:2594 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:2625 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:2632 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:3282 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:3292 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:3302 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:3314 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:3324 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:3334 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:3346 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:3356 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:3366 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:3376 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:3384 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:3392 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:3402 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:3410 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:3418 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:3428 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:3436 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:3444 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:3456 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:3466 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:3476 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:3485 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:3494 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:3503 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:3511 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:3519 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:3527 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:3554 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:3561 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:3567 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:360 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:370 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:380 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:403 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:412 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:421 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:446 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:456 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:466 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:491 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:501 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:511 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:534 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:543 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:552 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:577 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:587 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:597 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:621 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:631 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:641 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:664 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:674 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:684 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:707 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:717 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:727 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:742 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:751 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:760 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:767 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:774 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:781 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:803 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:812 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:821 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:827 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:834 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:841 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:887 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:894 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:901 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:921 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:929 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:937 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:944 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:951 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:958 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:976 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:984 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:992 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ2:998 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1006 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1013 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1030 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1038 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1046 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1053 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1060 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1067 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1084 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1092 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1100 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1107 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1114 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1121 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1161 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1168 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1175 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1192 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1200 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1208 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1215 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1222 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1229 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1245 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1252 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1259 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1266 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1273 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1280 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1290 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1297 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1304 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1311 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1318 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1325 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1335 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1342 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1349 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1356 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1363 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1370 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1390 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1398 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1406 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1437 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1445 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1453 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:148 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
γ3:1484 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1492 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1500 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1527 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1535 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1543 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1574 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:158 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
γ3:1582 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1590 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1620 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1628 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1636 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:166 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
γ3:1661 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1669 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1677 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1700 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1708 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1716 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1739 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1747 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1755 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1769 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1776 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1783 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1790 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1797 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1804 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1838 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1845 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1852 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1865 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1872 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1879 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1886 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1893 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1900 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1913 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1920 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1927 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1934 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1941 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1948 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1958 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1965 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1972 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1979 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1985 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1991 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:1997 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:2012 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:2076 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:2098 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:210 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:2109 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:2131 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:2142 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:216 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:2164 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:2174 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:2194 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:2204 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:222 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:2254 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:2263 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:2272 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:228 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:2281 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:2290 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:2299 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:2331 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:2339 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:234 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:2347 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:2355 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:2363 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:2371 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:240 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:2403 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:2411 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:2419 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:2427 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:2435 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:2443 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:2471 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:2478 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:2485 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:2492 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:2499 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:2506 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:2529 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:2552 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:2558 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:2564 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:2570 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:2576 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:2582 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:2588 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:2595 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:2626 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:2633 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:3283 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:3293 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:3303 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:3315 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:3325 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:3335 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:3347 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:3357 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:3367 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:3377 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:3385 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:3393 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:3403 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:3411 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:3419 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:3429 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:3437 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:3445 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:3457 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:3467 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:3477 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:3486 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:3495 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:3504 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:3512 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:3520 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:3528 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:3555 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:3562 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:3568 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:361 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:371 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:381 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:404 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:413 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:422 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:447 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:457 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:467 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:492 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:502 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:512 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:535 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:544 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:553 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:578 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:588 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:598 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:622 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:632 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:642 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:665 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:675 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:685 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:708 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:718 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:728 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:743 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:752 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:761 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:768 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:775 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:782 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:828 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:835 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:842 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:863 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:872 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:881 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:888 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:895 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:902 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:922 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:930 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:938 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:945 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:952 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:959 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ3:999 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1000 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1007 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1014 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1031 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1039 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1047 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1054 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1061 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1068 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1085 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1093 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1101 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1108 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1115 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1122 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1139 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1147 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1155 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1162 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1169 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1176 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1193 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1201 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1209 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1216 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1223 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1230 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1246 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1253 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1260 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1267 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1274 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1281 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1291 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1298 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1305 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1312 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1319 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1326 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1336 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1343 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1350 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1357 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1364 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1371 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1391 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1399 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1407 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1438 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1446 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1454 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1485 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:149 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
γ4:1493 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1501 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1528 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1536 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1544 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1575 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1583 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:159 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
γ4:1591 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1621 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1629 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1637 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1662 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:167 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
γ4:1670 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1678 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1701 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1709 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1717 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1740 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1748 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1756 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1770 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1777 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1784 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1791 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1798 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1805 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1818 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1825 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1832 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1839 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1846 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1853 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1866 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1873 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1880 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1887 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1894 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1901 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1914 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1921 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1928 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1935 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1942 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1949 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1959 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1966 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1973 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1980 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1986 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1992 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:1998 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:2013 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:2045 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:2077 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:2099 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:211 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:2110 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:2121 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:2132 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:2143 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:2154 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:2165 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:217 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:2175 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:2185 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:2195 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:2205 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:2215 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:2228 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:223 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:2237 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:2246 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:2255 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:2264 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:2273 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:2282 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:229 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:2291 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:2300 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:2308 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:2316 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:2324 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:2332 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:2340 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:2348 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:235 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:2356 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:2364 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:2372 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:2380 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:2388 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:2396 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:2404 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:241 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:2412 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:2420 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:2428 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:2436 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:2444 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:2451 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:2458 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:2465 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:2472 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:2479 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:2486 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:2493 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:2500 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:2507 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:2530 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:2553 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:2559 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:2565 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:2571 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:2577 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:2583 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:2589 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:2596 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:2627 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:2634 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:3284 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:3294 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:3304 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:3316 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:3326 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:3336 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:3348 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:3358 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:3368 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:3378 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:3386 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:3394 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:3404 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:3412 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:3420 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:3430 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:3438 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:3446 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:3458 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:3468 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:3478 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:3487 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:3496 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:3505 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:3513 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:3521 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:3529 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:3556 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:3563 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:3569 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:362 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:372 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:382 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:405 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:414 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:423 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:448 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:458 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:468 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:493 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:503 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:513 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:536 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:545 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:554 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:579 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:589 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:599 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:623 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:633 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:643 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:666 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:676 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:686 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:709 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:719 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:729 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:744 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:753 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:762 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:769 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:776 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:783 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:804 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:813 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:822 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:829 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:836 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:843 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:864 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:873 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:882 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:889 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:896 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:903 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:923 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:931 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:939 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:946 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:953 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:960 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:977 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:985 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ4:993 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1001 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1008 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1015 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1032 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1040 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1048 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1055 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1062 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1069 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1086 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1094 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1102 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1109 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1116 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1123 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1140 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1148 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1156 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1163 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1170 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1177 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1194 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1202 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1210 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1217 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1224 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1231 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1247 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1254 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1261 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1268 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1275 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1282 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1292 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1299 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1306 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1313 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1320 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1327 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1337 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1344 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1351 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1358 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1365 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1372 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1392 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1400 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1408 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1439 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1447 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1455 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1486 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1494 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:150 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
γ5:1502 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1529 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1537 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1545 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1576 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1584 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1592 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:160 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
γ5:1622 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1630 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1638 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1663 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1671 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1679 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:168 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
γ5:1702 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1710 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1718 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1741 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1749 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1757 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1771 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1778 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1785 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1792 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1799 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1806 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1819 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1826 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1833 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1840 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1847 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1854 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1867 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1874 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1881 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1888 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1895 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1902 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1915 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1922 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1929 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1936 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1943 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1950 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1960 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1967 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1974 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1981 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1987 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1993 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:1999 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:2014 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:2046 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:2078 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:2100 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:2111 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:212 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:2122 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:2133 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:2144 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:2155 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:2166 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:2176 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:218 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:2186 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:2196 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:2206 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:2216 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:2229 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:2238 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:224 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:2247 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:2256 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:2265 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:2274 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:2283 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:2292 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:230 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:2301 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:2309 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:2317 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:2325 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:2333 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:2341 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:2349 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:2357 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:236 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:2365 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:2373 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:2381 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:2389 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:2397 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:2405 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:2413 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:242 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:2421 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:2429 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:2437 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:2445 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:2452 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:2459 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:2466 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:2473 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:2480 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:2487 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:2494 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:2501 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:2508 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:2531 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:2554 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:2560 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:2566 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:2572 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:2578 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:2584 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:2590 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:2597 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:2628 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:2635 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:3285 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:3295 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:3305 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:3317 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:3327 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:3337 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:3349 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:3359 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:3369 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:3379 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:3387 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:3395 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:3405 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:3413 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:3421 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:3431 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:3439 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:3447 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:3459 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:3469 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:3479 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:3488 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:3497 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:3506 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:3514 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:3522 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:3530 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:3557 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:3564 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:3570 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:363 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:373 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:383 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:406 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:415 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:424 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:449 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:459 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:469 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:494 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:504 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:514 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:537 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:546 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:555 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:580 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:590 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:600 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:624 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:634 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:644 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:667 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:677 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:687 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:710 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:720 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:730 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:745 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:754 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:763 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:770 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:777 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:784 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:805 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:814 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:823 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:830 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:837 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:844 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:865 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:874 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:883 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:890 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:897 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:904 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:924 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:932 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:940 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:947 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:954 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:961 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:978 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:986 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ5:994 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1002 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1009 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1016 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1033 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1041 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1049 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1056 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1063 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1070 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1087 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1095 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1103 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1110 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1117 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1124 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1141 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1149 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1157 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1164 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1171 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1178 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1195 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1203 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1211 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1218 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1225 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1232 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1248 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1255 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1262 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1269 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1276 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1283 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1293 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1300 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1307 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1314 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1321 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1328 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1338 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1345 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1352 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1359 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1366 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1373 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1393 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1401 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1409 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1440 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1448 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1456 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1487 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1495 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1503 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:151 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
γ6:1530 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1538 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1546 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1577 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1585 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1593 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:161 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
γ6:1623 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1631 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1639 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1664 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1672 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1680 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:169 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
γ6:1703 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1711 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1719 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1742 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1750 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1758 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1772 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1779 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1786 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1793 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1800 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1807 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1820 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1827 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1834 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1841 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1848 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1855 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1868 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1875 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1882 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1889 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1896 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1903 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1916 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1923 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1930 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1937 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1944 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1951 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1961 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1968 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1975 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1982 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1988 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:1994 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:2000 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:2015 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:2047 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:2079 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:2101 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:2112 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:2123 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:213 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:2134 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:2145 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:2156 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:2167 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:2177 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:2187 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:219 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:2197 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:2207 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:2217 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:2230 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:2239 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:2248 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:225 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:2257 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:2266 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:2275 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:2284 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:2293 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:2302 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:231 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:2310 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:2318 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:2326 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:2334 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:2342 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:2350 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:2358 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:2366 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:237 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:2374 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:2382 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:2390 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:2398 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:2406 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:2414 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:2422 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:243 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:2430 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:2438 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:2446 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:2453 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:2460 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:2467 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:2474 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:2481 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:2488 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:2495 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:2502 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:2509 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:2532 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:2555 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:2561 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:2567 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:2573 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:2579 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:2585 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:2591 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:2598 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:2629 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:2636 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:3286 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:3296 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:3306 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:3318 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:3328 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:3338 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:3350 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:3360 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:3370 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:3380 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:3388 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:3396 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:3406 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:3414 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:3422 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:3432 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:3440 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:3448 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:3460 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:3470 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:3480 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:3489 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:3498 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:3507 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:3515 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:3523 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:3531 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:3558 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:3565 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:3571 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:364 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:374 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:384 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:407 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:416 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:425 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:450 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:460 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:470 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:495 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:505 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:515 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:538 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:547 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:556 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:581 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:591 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:601 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:625 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:635 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:645 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:668 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:678 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:688 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:711 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:721 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:731 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:746 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:755 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:764 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:771 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:778 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:785 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:806 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:815 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:824 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:831 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:838 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:845 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:866 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:875 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:884 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:891 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:898 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:905 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:925 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:933 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:941 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:948 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:955 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:962 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:979 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:987 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ6:995 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ:2533 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ:2536 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ:2538 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
γ:3229 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
δ:21 [in Undecidability.Shared.Libs.DLW.Code.subcode]
ε:21 [in Complexity.Complexity.ONotationIsAppropriate]
η:2534 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
ρ:20 [in Undecidability.Shared.Libs.DLW.Code.subcode]
σ1:114 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
σ1:1429 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ1:1458 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ1:1566 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ1:1595 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ1:172 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ1:178 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ1:180 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ1:183 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ1:187 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ1:189 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ1:192 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ1:2803 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ1:2805 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ1:2806 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ1:2811 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ1:2814 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ1:2817 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ1:2820 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ1:2821 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ1:2823 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ1:2825 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ1:2826 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ1:295 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ2:115 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
σ2:1430 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ2:1459 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ2:1567 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ2:1596 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ2:173 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ2:181 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ2:184 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ2:190 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ2:193 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ2:2807 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ2:2812 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ2:2815 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ2:2818 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ2:2824 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ2:2827 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ3:116 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
σ3:174 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ3:185 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ3:194 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ3:2813 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ4:117 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
σ4:175 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ5:118 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
σ6:119 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
σ:100 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ:1383 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ:1411 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ:1424 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ:1462 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ:1477 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ:1506 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ:1521 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ:1549 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ:156 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ:1561 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ:1599 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ:1614 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ:1642 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ:1690 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ:1722 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ:1729 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ:1761 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ:2102 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ:2113 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ:2124 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ:2135 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ:2146 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ:2157 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ:263 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ:267 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ:271 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ:276 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ:2798 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ:2801 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ:2809 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ:281 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ:2829 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ:2830 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ:2833 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ:2860 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ:2871 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ:288 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ:2881 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ:2894 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ:3028 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ:303 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ:3453 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ:3463 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ:3473 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ:3482 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ:3491 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ:3500 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
σ:740 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
σ:750 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
σ:751 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]

---

Module Index

A

ARSNotations [in Undecidability.L.Prelim.ARS]

B

BoollistToEnc [in Undecidability.TM.L.Transcode.Boollist_to_Enc]
boollist_enum [in Complexity.NP.L.CanEnumTerm]
Boollist2encBoolsTM [in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]

C

CheckEncodesBool [in Complexity.TM.Code.DecodeBool]
CheckEncodesBoolList [in Complexity.TM.Code.DecodeList]
CheckEncodesTape [in Complexity.TM.Single.DecodeTape]
CheckEncodesTapes [in Complexity.TM.Single.DecodeTapes]
CheckTapeContains [in Complexity.TM.Code.Decode]
clos_notation [in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
ConcatRepeat [in Undecidability.TM.Code.List.Concat_Repeat]
Cons_constant [in Undecidability.TM.Code.List.Cons_constant]
ContainsEncoding [in Complexity.TM.Code.Decode]

E

EmbedNatNotations [in Undecidability.Shared.embed_nat]
encBoolsTM2boollist [in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
EncToBoollist [in Undecidability.TM.L.Transcode.Enc_to_Boollist]
EvalL [in Undecidability.TM.L.Eval]
explicit_bounds [in Complexity.L.ComparisonTimeBoundDerivation]

F

FCI [in Undecidability.Shared.Libs.PSL.FCI]

H

HOAS_Notations [in Undecidability.L.Util.L_facts]

I

Intern [in Undecidability.L.Tactics.ComputableTactics]

J

JumpTarget_steps_nice [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]

L

Leftmost [in Undecidability.L.Complexity.ResourceMeasures]
ListAutomationNotations [in Undecidability.Shared.ListAutomation]
LM [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
LMtoTM [in Complexity.NP.TM.M_LM2TM]
LM_Lookup_nice [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
L_Notations [in Undecidability.L.Util.L_facts]
L_Notations_app [in Undecidability.L.Util.L_facts]

M

M [in Complexity.NP.TM.LM_to_mTM]
MultiToMono [in Complexity.NP.TM.M_multi2mono]

O

Option [in Undecidability.TM.Code.ProgrammingTools]

P

Private_UnfoldClos [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]

R

ReductionChainNotations [in Undecidability.Synthetic.ReducibilityFacts]

S

smallo_equiv [in Complexity.Complexity.ONotationIsAppropriate]

T

task [in Complexity.L.AbstractMachines.UnfoldTailRec]
TrueOrDiverge [in Complexity.NP.TM.LM_to_mTM]

U

UndecidabilityNotations [in Undecidability.Synthetic.Undecidability]
UnfoldClos [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
Univ_nice [in Complexity.TM.PrettyBounds.UnivBounds]
uptoc_mixed [in Complexity.L.ComparisonTimeBoundDerivation]
uptoc_pure [in Complexity.L.ComparisonTimeBoundDerivation]

V

VecToListCoercion [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
VectorNotations2 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]

---

Variable Index

A

abstractDefs.fixCoversHead.p [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
abstractDefs.X [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
Acc_irrelevance.Hf [in Undecidability.Shared.Libs.DLW.Wf.acc_irr]
Acc_irrelevance.f [in Undecidability.Shared.Libs.DLW.Wf.acc_irr]
Acc_irrelevance.P [in Undecidability.Shared.Libs.DLW.Wf.acc_irr]
Acc_irrelevance.R [in Undecidability.Shared.Libs.DLW.Wf.acc_irr]
Acc_irrelevance.X [in Undecidability.Shared.Libs.DLW.Wf.acc_irr]
AlphabetLifting'.n [in Undecidability.TM.Hoare.HoareRegister]
AlphabetLifting'.retr [in Undecidability.TM.Hoare.HoareRegister]
AlphabetLifting'.sig [in Undecidability.TM.Hoare.HoareRegister]
AlphabetLifting'.tau [in Undecidability.TM.Hoare.HoareRegister]
AlphabetLifting.n [in Undecidability.TM.Hoare.HoareRegister]
AlphabetLifting.retr [in Undecidability.TM.Hoare.HoareRegister]
AlphabetLifting.sig [in Undecidability.TM.Hoare.HoareRegister]
AlphabetLifting.tau [in Undecidability.TM.Hoare.HoareRegister]
Analysis.empty_H__init [in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisStep]
Analysis.H [in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisStep]
Analysis.H [in Complexity.L.AbstractMachines.AbstractHeapMachine]
Analysis.H__init [in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisStep]
Analysis.i [in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisStep]
Analysis.i [in Complexity.L.AbstractMachines.AbstractHeapMachine]
Analysis.P0 [in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisStep]
Analysis.R [in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisStep]
Analysis.R [in Complexity.L.AbstractMachines.AbstractHeapMachine]
Analysis.s0 [in Complexity.L.AbstractMachines.AbstractHeapMachine]
Analysis.T [in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisStep]
Analysis.T [in Complexity.L.AbstractMachines.AbstractHeapMachine]
Analysis.V [in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisStep]
Analysis.V [in Complexity.L.AbstractMachines.AbstractHeapMachine]
Append.cX [in Undecidability.TM.Code.List.App]
Append.defX [in Undecidability.TM.Code.List.App]
Append.sigX [in Undecidability.TM.Code.List.App]
Append.stop [in Undecidability.TM.Code.List.App]
Append.X [in Undecidability.TM.Code.List.App]
App_nice.cX [in Complexity.TM.PrettyBounds.BaseCode]
App_nice.X [in Complexity.TM.PrettyBounds.BaseCode]
App_nice.sigX [in Complexity.TM.PrettyBounds.BaseCode]
App_nice.cX [in Undecidability.TM.Code.List.App]
App_nice.X [in Undecidability.TM.Code.List.App]
App_nice.sigX [in Undecidability.TM.Code.List.App]

B

base_decomp.base_p.base_p_full [in Undecidability.Shared.Libs.DLW.Utils.prime]
base_decomp.base_p.Hp [in Undecidability.Shared.Libs.DLW.Utils.prime]
base_decomp.base_p.p [in Undecidability.Shared.Libs.DLW.Utils.prime]
bezout.gcd_lcm.lcm_full [in Undecidability.Shared.Libs.DLW.Utils.gcd]
bezout.gcd_lcm.gcd_full [in Undecidability.Shared.Libs.DLW.Utils.gcd]
Bijection.X [in Undecidability.Shared.Libs.PSL.Bijection]
Bijection.Y [in Undecidability.Shared.Libs.PSL.Bijection]
binomial_Newton.distr_r [in Undecidability.Shared.Libs.DLW.Utils.sums]
binomial_Newton.distr_l [in Undecidability.Shared.Libs.DLW.Utils.sums]
binomial_Newton.M_times [in Undecidability.Shared.Libs.DLW.Utils.sums]
binomial_Newton.sum_cancel [in Undecidability.Shared.Libs.DLW.Utils.sums]
binomial_Newton.sum_comm [in Undecidability.Shared.Libs.DLW.Utils.sums]
binomial_Newton.M_sum [in Undecidability.Shared.Libs.DLW.Utils.sums]
binomial_Newton.one [in Undecidability.Shared.Libs.DLW.Utils.sums]
binomial_Newton.zero [in Undecidability.Shared.Libs.DLW.Utils.sums]
binomial_Newton.times [in Undecidability.Shared.Libs.DLW.Utils.sums]
binomial_Newton.sum [in Undecidability.Shared.Libs.DLW.Utils.sums]
binomial_Newton.X [in Undecidability.Shared.Libs.DLW.Utils.sums]
binomial.fact_neq_0 [in Undecidability.Shared.Libs.DLW.Utils.binomial]
BookKeepingForRead.sig [in Undecidability.TM.Single.StepTM]
BoollistToEnc.M.sig [in Undecidability.TM.L.Transcode.Boollist_to_Enc]
Boollist2encBoolsTM.Fix.b [in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
Boollist2encBoolsTM.Fix.retr_list [in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
Boollist2encBoolsTM.Fix.s [in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
Boollist2encBoolsTM.Fix.Σ [in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
bounded_min.Q [in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
bounded_min.P [in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
bounded_choose_d.Q [in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
bounded_choose_d.P [in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]

C

Cardinality.X [in Undecidability.Shared.Libs.PSL.Lists.Cardinality]
CaseChar.f [in Undecidability.TM.Basic.Mono]
CaseChar.F [in Undecidability.TM.Basic.Mono]
CaseChar.sig [in Undecidability.TM.Basic.Mono]
CaseChar2.f [in Undecidability.TM.Basic.Duo]
CaseChar2.F [in Undecidability.TM.Basic.Duo]
CaseChar2.sig [in Undecidability.TM.Basic.Duo]
CaseFin.defSig [in Undecidability.TM.Code.CaseFin]
CaseFin.defSig [in Undecidability.TM.Code.CaseFin]
CaseFin.sig [in Undecidability.TM.Code.CaseFin]
CaseFin.sig [in Undecidability.TM.Code.CaseFin]
CaseList_nice.cX [in Complexity.TM.PrettyBounds.BaseCodeSpace]
CaseList_nice.X [in Complexity.TM.PrettyBounds.BaseCodeSpace]
CaseList_nice.sigX [in Complexity.TM.PrettyBounds.BaseCodeSpace]
CaseList.codX [in Undecidability.TM.Code.CaseList]
CaseList.cX [in Undecidability.TM.Code.CaseList]
CaseList.sigX [in Undecidability.TM.Code.CaseList]
CaseList.sigX [in Undecidability.TM.Code.CaseList]
CaseList.X [in Undecidability.TM.Code.CaseList]
CaseList.X [in Undecidability.TM.Code.CaseList]
CaseOption.codX [in Undecidability.TM.Code.CaseSum]
CaseOption.sig [in Undecidability.TM.Code.CaseSum]
CaseOption.sigX [in Undecidability.TM.Code.CaseSum]
CaseOption.tau [in Undecidability.TM.Code.CaseSum]
CaseOption.X [in Undecidability.TM.Code.CaseSum]
CaseOpton.codX [in Undecidability.TM.Code.CaseSum]
CaseOpton.sigX [in Undecidability.TM.Code.CaseSum]
CaseOpton.X [in Undecidability.TM.Code.CaseSum]
CasePair_size_nice.cY [in Complexity.TM.PrettyBounds.BaseCodeSpace]
CasePair_size_nice.cX [in Complexity.TM.PrettyBounds.BaseCodeSpace]
CasePair_size_nice.Y [in Complexity.TM.PrettyBounds.BaseCodeSpace]
CasePair_size_nice.X [in Complexity.TM.PrettyBounds.BaseCodeSpace]
CasePair_size_nice.sigY [in Complexity.TM.PrettyBounds.BaseCodeSpace]
CasePair_size_nice.sigX [in Complexity.TM.PrettyBounds.BaseCodeSpace]
CasePair.codX [in Undecidability.TM.Code.CasePair]
CasePair.codY [in Undecidability.TM.Code.CasePair]
CasePair.cX [in Undecidability.TM.Code.CasePair]
CasePair.cY [in Undecidability.TM.Code.CasePair]
CasePair.sigX [in Undecidability.TM.Code.CasePair]
CasePair.sigX [in Undecidability.TM.Code.CasePair]
CasePair.sigY [in Undecidability.TM.Code.CasePair]
CasePair.sigY [in Undecidability.TM.Code.CasePair]
CasePair.X [in Undecidability.TM.Code.CasePair]
CasePair.X [in Undecidability.TM.Code.CasePair]
CasePair.Y [in Undecidability.TM.Code.CasePair]
CasePair.Y [in Undecidability.TM.Code.CasePair]
CaseSum.codX [in Undecidability.TM.Code.CaseSum]
CaseSum.codX [in Undecidability.TM.Code.CaseSum]
CaseSum.codY [in Undecidability.TM.Code.CaseSum]
CaseSum.codY [in Undecidability.TM.Code.CaseSum]
CaseSum.sigX [in Undecidability.TM.Code.CaseSum]
CaseSum.sigX [in Undecidability.TM.Code.CaseSum]
CaseSum.sigY [in Undecidability.TM.Code.CaseSum]
CaseSum.sigY [in Undecidability.TM.Code.CaseSum]
CaseSum.X [in Undecidability.TM.Code.CaseSum]
CaseSum.X [in Undecidability.TM.Code.CaseSum]
CaseSum.Y [in Undecidability.TM.Code.CaseSum]
CaseSum.Y [in Undecidability.TM.Code.CaseSum]
CCCard_of_size.X [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
ChangeAlphabet.F [in Undecidability.TM.Code.ChangeAlphabet]
ChangeAlphabet.n [in Undecidability.TM.Code.ChangeAlphabet]
ChangeAlphabet.pM [in Undecidability.TM.Code.ChangeAlphabet]
ChangeAlphabet.retr [in Undecidability.TM.Code.ChangeAlphabet]
ChangeAlphabet.sig [in Undecidability.TM.Code.ChangeAlphabet]
ChangeAlphabet.tau [in Undecidability.TM.Code.ChangeAlphabet]
CheckEncodesBoolList.checkEncodesBoolList.I__X [in Complexity.TM.Code.DecodeList]
CheckEncodesBoolList.checkEncodesBoolList.Rel__X [in Complexity.TM.Code.DecodeList]
CheckEncodesBoolList.checkEncodesBoolList.Rel' [in Complexity.TM.Code.DecodeList]
CheckEncodesBool.checkEncodesBool.Rel [in Complexity.TM.Code.DecodeBool]
CheckEncodesTapes.checkEncodesTapes.I__X [in Complexity.TM.Single.DecodeTapes]
CheckEncodesTapes.checkEncodesTapes.Rel [in Complexity.TM.Single.DecodeTapes]
CheckEncodesTape.checkEncodesTape.Rel [in Complexity.TM.Single.DecodeTape]
CheckTapeContains.fixx.M_checkX [in Complexity.TM.Code.Decode]
CheckTapeContains.fixx.Rel [in Complexity.TM.Code.Decode]
CompareLists.X [in Undecidability.TM.Compound.Compare]
CompareValues.cX [in Undecidability.TM.Code.CompareValue]
CompareValues.cX [in Undecidability.TM.Code.CompareValue]
CompareValues.cX_injective [in Undecidability.TM.Code.CompareValue]
CompareValues.HInj [in Undecidability.TM.Code.CompareValue]
CompareValues.sigX [in Undecidability.TM.Code.CompareValue]
CompareValues.sigX [in Undecidability.TM.Code.CompareValue]
CompareValues.X [in Undecidability.TM.Code.CompareValue]
CompareValues.X [in Undecidability.TM.Code.CompareValue]
Compare_fun_lemmas.stop [in Undecidability.TM.Compound.Compare]
Compare_fun_lemmas.X [in Undecidability.TM.Compound.Compare]
Compare.sig [in Undecidability.TM.Compound.Compare]
Compare.stop [in Undecidability.TM.Compound.Compare]
ComposeRetracts.A [in Undecidability.Shared.Libs.PSL.Retracts]
ComposeRetracts.B [in Undecidability.Shared.Libs.PSL.Retracts]
ComposeRetracts.C [in Undecidability.Shared.Libs.PSL.Retracts]
Composition.F1 [in Undecidability.TM.Combinators.SequentialComposition]
Composition.F2 [in Undecidability.TM.Combinators.SequentialComposition]
Composition.n [in Undecidability.TM.Combinators.SequentialComposition]
Composition.pM1 [in Undecidability.TM.Combinators.SequentialComposition]
Composition.pM2 [in Undecidability.TM.Combinators.SequentialComposition]
Composition.sig [in Undecidability.TM.Combinators.SequentialComposition]
comp.correctness.HPQ [in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
comp.correctness.linker [in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
comp.correctness.P [in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
comp.correctness.Q [in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
comp.cP [in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
comp.err [in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
comp.Hicomp [in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
comp.Hilen [in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
comp.icomp [in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
comp.ilen [in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
comp.iP [in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
comp.iQ [in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
comp.P [in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
comp.P_eq [in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
comp.simul [in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
comp.state_Y [in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
comp.state_X [in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
comp.step_Y_fun [in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
comp.step_X_tot [in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
comp.step_Y [in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
comp.step_X [in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
comp.X [in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
comp.Y [in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
ConcatRepeat.concatRepeat.cX [in Undecidability.TM.Code.List.Concat_Repeat]
ConcatRepeat.concatRepeat.retr1 [in Undecidability.TM.Code.List.Concat_Repeat]
ConcatRepeat.concatRepeat.retr2 [in Undecidability.TM.Code.List.Concat_Repeat]
ConcatRepeat.concatRepeat.sig [in Undecidability.TM.Code.List.Concat_Repeat]
ConcatRepeat.concatRepeat.sigX [in Undecidability.TM.Code.List.Concat_Repeat]
ConcatRepeat.concatRepeat.X [in Undecidability.TM.Code.List.Concat_Repeat]
Cons_constant.Fix.c [in Undecidability.TM.Code.List.Cons_constant]
conv_output.retr_list [in Undecidability.TM.L.CompilerBoolFuns.Compiler]
conv_output.retr_pro [in Undecidability.TM.L.CompilerBoolFuns.Compiler]
conv_output.b [in Undecidability.TM.L.CompilerBoolFuns.Compiler]
conv_output.s [in Undecidability.TM.L.CompilerBoolFuns.Compiler]
conv_output.Σ [in Undecidability.TM.L.CompilerBoolFuns.Compiler]
CopySymbols.f [in Undecidability.TM.Compound.CopySymbols]
CopySymbols.sig [in Undecidability.TM.Compound.CopySymbols]
CopyValue.cX [in Undecidability.TM.Code.Copy]
CopyValue.I [in Undecidability.TM.Code.Copy]
CopyValue.sig [in Undecidability.TM.Code.Copy]
CopyValue.sigX [in Undecidability.TM.Code.Copy]
CopyValue.X [in Undecidability.TM.Code.Copy]
Copy_size_nice.cY [in Complexity.TM.PrettyBounds.BaseCodeSpace]
Copy_size_nice.Y [in Complexity.TM.PrettyBounds.BaseCodeSpace]
Copy_size_nice.sigY [in Complexity.TM.PrettyBounds.BaseCodeSpace]
Copy_size_nice.cX [in Complexity.TM.PrettyBounds.BaseCodeSpace]
Copy_size_nice.X [in Complexity.TM.PrettyBounds.BaseCodeSpace]
Copy_size_nice.sigX [in Complexity.TM.PrettyBounds.BaseCodeSpace]
Copy.f [in Undecidability.TM.Code.Copy]
Copy.f [in Undecidability.TM.Compound.Multi]
Copy.sig [in Undecidability.TM.Code.Copy]
Copy.sig [in Undecidability.TM.Compound.Multi]
Copy.stop [in Undecidability.TM.Code.Copy]
Count.X [in Undecidability.Shared.Libs.PSL.Vectors.VectorDupfree]

D

decidable_sinc.f_P [in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
decidable_sinc.f_select [in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
decidable_sinc.f_sinc [in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
decidable_sinc.f [in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
decidable_sinc.next [in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
decidable_sinc.Pdec [in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
decidable_sinc.Punb [in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
decidable_sinc.P [in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
defExPTCC.finalCondition [in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
defExPTCC.initCond [in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
defExPTCC.l [in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
defExPTCC.p [in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
defExPTCC.Sigma [in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
defExPTCC.t [in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
Diverge.n [in Undecidability.TM.Compound.Multi]
Diverge.sig [in Undecidability.TM.Compound.Multi]
DoAct_Derived.D [in Undecidability.TM.Basic.Mono]
DoAct_Derived.c [in Undecidability.TM.Basic.Mono]
DoAct_Derived.sig [in Undecidability.TM.Basic.Mono]
DoAct.act [in Undecidability.TM.Basic.Mono]
DoAct.c [in Undecidability.TM.Basic.Mono]
DoAct.sig [in Undecidability.TM.Basic.Mono]
dupfree_dec.eqbX_correct [in Undecidability.L.Datatypes.List.List_in]
dupfree_dec.eqbX [in Undecidability.L.Datatypes.List.List_in]
dupfree_dec.X [in Undecidability.L.Datatypes.List.List_in]
Dupfree.X [in Undecidability.Shared.Libs.PSL.Lists.Dupfree]

E

encBoolsTM2boollist.Fix.b [in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
encBoolsTM2boollist.Fix.retr_list [in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
encBoolsTM2boollist.Fix.s [in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
encBoolsTM2boollist.Fix.Σ [in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
encodeList_size_eq.sigX [in Complexity.TM.PrettyBounds.BaseCode]
encodeList_size_eq.X [in Complexity.TM.PrettyBounds.BaseCode]
Encode_list.cX [in Undecidability.TM.Code.Code]
Encode_list.X [in Undecidability.TM.Code.Code]
Encode_list.sigX [in Undecidability.TM.Code.Code]
Encode_option.cX [in Undecidability.TM.Code.Code]
Encode_option.X [in Undecidability.TM.Code.Code]
Encode_option.sigX [in Undecidability.TM.Code.Code]
Encode_pair.cY [in Undecidability.TM.Code.Code]
Encode_pair.cX [in Undecidability.TM.Code.Code]
Encode_pair.Y [in Undecidability.TM.Code.Code]
Encode_pair.X [in Undecidability.TM.Code.Code]
Encode_pair.sigY [in Undecidability.TM.Code.Code]
Encode_pair.sigX [in Undecidability.TM.Code.Code]
Encode_sum.cY [in Undecidability.TM.Code.Code]
Encode_sum.cX [in Undecidability.TM.Code.Code]
Encode_sum.sigY [in Undecidability.TM.Code.Code]
Encode_sum.sigX [in Undecidability.TM.Code.Code]
Encode_sum.Y [in Undecidability.TM.Code.Code]
Encode_sum.X [in Undecidability.TM.Code.Code]
Encode_map_comp.I2 [in Undecidability.TM.Code.Code]
Encode_map_comp.I1 [in Undecidability.TM.Code.Code]
Encode_map_comp.cX [in Undecidability.TM.Code.Code]
Encode_map_comp.sig3 [in Undecidability.TM.Code.Code]
Encode_map_comp.sig2 [in Undecidability.TM.Code.Code]
Encode_map_comp.sig1 [in Undecidability.TM.Code.Code]
Encode_map_comp.X [in Undecidability.TM.Code.Code]
Encode_map.inj [in Undecidability.TM.Code.Code]
Encode_map.cX [in Undecidability.TM.Code.Code]
Encode_map.tau [in Undecidability.TM.Code.Code]
Encode_map.sig [in Undecidability.TM.Code.Code]
Encode_map.X [in Undecidability.TM.Code.Code]
Encode_Finite.sig [in Undecidability.TM.Code.Code]
EncToBoollist.M.sig [in Undecidability.TM.L.Transcode.Enc_to_Boollist]
enumerator_list_enumerator.e [in Undecidability.Synthetic.ListEnumerabilityFacts]
enumerator_list_enumerator.T [in Undecidability.Synthetic.ListEnumerabilityFacts]
enumerator_list_enumerator.X [in Undecidability.Synthetic.ListEnumerabilityFacts]
enumerator_list_enumerator.T [in Undecidability.Synthetic.ListEnumerabilityFacts]
enumerator_list_enumerator.e [in Undecidability.Synthetic.ListEnumerabilityFacts]
enumerator_list_enumerator.p [in Undecidability.Synthetic.ListEnumerabilityFacts]
enumerator_list_enumerator.X [in Undecidability.Synthetic.ListEnumerabilityFacts]
enum_red.d [in Undecidability.Synthetic.ReducibilityFacts]
enum_red.x0 [in Undecidability.Synthetic.ReducibilityFacts]
enum_red.qe [in Undecidability.Synthetic.ReducibilityFacts]
enum_red.Lq [in Undecidability.Synthetic.ReducibilityFacts]
enum_red.Hf [in Undecidability.Synthetic.ReducibilityFacts]
enum_red.f [in Undecidability.Synthetic.ReducibilityFacts]
enum_red.q [in Undecidability.Synthetic.ReducibilityFacts]
enum_red.p [in Undecidability.Synthetic.ReducibilityFacts]
enum_red.Y [in Undecidability.Synthetic.ReducibilityFacts]
enum_red.X [in Undecidability.Synthetic.ReducibilityFacts]
ep_quotient.Hrc [in Undecidability.Shared.Libs.DLW.Utils.quotient]
ep_quotient.Hcr [in Undecidability.Shared.Libs.DLW.Utils.quotient]
ep_quotient.Hrpr [in Undecidability.Shared.Libs.DLW.Utils.quotient]
ep_quotient.rpr [in Undecidability.Shared.Libs.DLW.Utils.quotient]
ep_quotient.P_to_X [in Undecidability.Shared.Libs.DLW.Utils.quotient]
ep_quotient.cls [in Undecidability.Shared.Libs.DLW.Utils.quotient]
ep_quotient.is_min_repr_P [in Undecidability.Shared.Libs.DLW.Utils.quotient]
ep_quotient.Y_discrete [in Undecidability.Shared.Libs.DLW.Utils.quotient]
ep_quotient.pi1_inj [in Undecidability.Shared.Libs.DLW.Utils.quotient]
ep_quotient.Y [in Undecidability.Shared.Libs.DLW.Utils.quotient]
ep_quotient.P_spec [in Undecidability.Shared.Libs.DLW.Utils.quotient]
ep_quotient.P [in Undecidability.Shared.Libs.DLW.Utils.quotient]
ep_quotient.is_min_repr_dec [in Undecidability.Shared.Libs.DLW.Utils.quotient]
ep_quotient.find_min_repr [in Undecidability.Shared.Libs.DLW.Utils.quotient]
ep_quotient.is_min_repr_involutive [in Undecidability.Shared.Libs.DLW.Utils.quotient]
ep_quotient.is_min_repr_inj [in Undecidability.Shared.Libs.DLW.Utils.quotient]
ep_quotient.is_min_repr [in Undecidability.Shared.Libs.DLW.Utils.quotient]
ep_quotient.is_repr_exists [in Undecidability.Shared.Libs.DLW.Utils.quotient]
ep_quotient.is_repr_dec [in Undecidability.Shared.Libs.DLW.Utils.quotient]
ep_quotient.is_repr_trans [in Undecidability.Shared.Libs.DLW.Utils.quotient]
ep_quotient.is_repr [in Undecidability.Shared.Libs.DLW.Utils.quotient]
ep_quotient.HT1 [in Undecidability.Shared.Libs.DLW.Utils.quotient]
ep_quotient.T [in Undecidability.Shared.Libs.DLW.Utils.quotient]
ep_quotient.HR2 [in Undecidability.Shared.Libs.DLW.Utils.quotient]
ep_quotient.HR1 [in Undecidability.Shared.Libs.DLW.Utils.quotient]
ep_quotient.Hf [in Undecidability.Shared.Libs.DLW.Utils.quotient]
ep_quotient.f [in Undecidability.Shared.Libs.DLW.Utils.quotient]
ep_quotient.R [in Undecidability.Shared.Libs.DLW.Utils.quotient]
ep_quotient.X [in Undecidability.Shared.Libs.DLW.Utils.quotient]
Equi.X [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
EvalL.Fix.Σ [in Undecidability.TM.L.Eval]
exists_equiv.HPQ [in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
exists_equiv.Q [in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
exists_equiv.P [in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
exists_equiv.X [in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
explicit_bounds.explicit_bounds.fixXeq.X [in Complexity.L.ComparisonTimeBoundDerivation]
extraction.fixXeq.X [in Complexity.NP.SAT.SAT_inNP]

F

FCI.FCI.R [in Undecidability.Shared.Libs.PSL.FCI]
FCI.FCI.sigma [in Undecidability.Shared.Libs.PSL.FCI]
FCI.FCI.X [in Undecidability.Shared.Libs.PSL.FCI]
Fill.m [in Undecidability.TM.Lifting.LiftTapes]
Fill.n [in Undecidability.TM.Lifting.LiftTapes]
Fill.Test.a [in Undecidability.TM.Lifting.LiftTapes]
Fill.Test.b [in Undecidability.TM.Lifting.LiftTapes]
Fill.Test.x [in Undecidability.TM.Lifting.LiftTapes]
Fill.Test.y [in Undecidability.TM.Lifting.LiftTapes]
Fill.Test.z [in Undecidability.TM.Lifting.LiftTapes]
Fill.X [in Undecidability.TM.Lifting.LiftTapes]
Filter.X [in Undecidability.Shared.FilterFacts]
Filter.X [in Undecidability.Shared.Libs.PSL.Lists.Filter]
finite_t_weak_dec_powerset.pset_fin_t [in Undecidability.Shared.Libs.DLW.Utils.fin_upto]
finite_t_weak_dec_powerset.wdec [in Undecidability.Shared.Libs.DLW.Utils.fin_upto]
finite_t_weak_dec_powerset.X [in Undecidability.Shared.Libs.DLW.Utils.fin_upto]
finite_t_upto.R [in Undecidability.Shared.Libs.DLW.Utils.fin_upto]
finite_t_upto.X [in Undecidability.Shared.Libs.DLW.Utils.fin_upto]
finite_t_dec_choose_one.Pdec [in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
finite_t_dec_choose_one.HQ [in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
finite_t_dec_choose_one.HX [in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
finite_t_dec_choose_one.Q [in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
finite_t_dec_choose_one.P [in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
finite_t_dec_choose_one.X [in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
finite_discrete_choice.X_discrete [in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
finite_discrete_choice.R [in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
finite_discrete_choice.Y [in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
finite_discrete_choice.X [in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
finite.filter.P [in Undecidability.Shared.Libs.DLW.Utils.fin_base]
finite.filter.Pdec [in Undecidability.Shared.Libs.DLW.Utils.fin_base]
finite.filter.X [in Undecidability.Shared.Libs.DLW.Utils.fin_base]
fin_reif.R [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
fin_reif.X [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
Fip.R [in Undecidability.Shared.Libs.PSL.FCI]
Fip.sigma [in Undecidability.Shared.Libs.PSL.FCI]
Fip.X [in Undecidability.Shared.Libs.PSL.FCI]
first_which_ni.HP [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
first_which_ni.P [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
fixEqBoolT.eqbX [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
fixEqBoolT.X [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
fixEqBoolT.Y [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
fixFCCInstance.fpr [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
fixfilterSome.X [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
fixGraph.g [in Complexity.NP.Clique.Clique]
fixGraph.G [in Complexity.NP.Clique.FlatClique]
fixGraph.UG [in Complexity.NP.Clique.FlatClique]
fixH.H [in Undecidability.L.AbstractMachines.FlatPro.UnfoldClos]
FixInit.empty_H__init [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds_Loop]
FixInit.H__init [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds_Loop]
fixInstanceA.fpr [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
fixInstanceA.isFlattening [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
fixInstanceA.pr [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
fixInstance.bpr [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
fixInstance.c [in Complexity.NP.SAT.CookLevin.Subproblems.CC]
fixInstance.cards [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
fixInstance.Fcards [in Complexity.NP.SAT.CookLevin.Reductions.TCC_to_CC]
fixInstance.Ffinal [in Complexity.NP.SAT.CookLevin.Reductions.TCC_to_CC]
fixInstance.final [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
fixInstance.Finit [in Complexity.NP.SAT.CookLevin.Reductions.TCC_to_CC]
fixInstance.fpr [in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
fixInstance.fpr [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
fixInstance.FSigma [in Complexity.NP.SAT.CookLevin.Reductions.TCC_to_CC]
fixInstance.Fsteps [in Complexity.NP.SAT.CookLevin.Reductions.TCC_to_CC]
fixInstance.h' [in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
fixInstance.init [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
fixInstance.k [in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
fixInstance.pr [in Complexity.NP.SAT.CookLevin.Reductions.CC_to_BinaryCC]
fixInstance.Sigma [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
fixInstance.steps [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
fixInstance.Y [in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
fixIsInjFinfuncTable.eqbX [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
fixIsInjFinfuncTable.eqbY [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
fixIsInjFinfuncTable.X [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
fixIsInjFinfuncTable.Y [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
fixIt.X [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
fixListProd.X [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
fixPrelude.A0 [in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
fixPrelude.A1 [in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
fixPrelude.A2 [in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
fixPrelude.A3 [in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
fixPrelude.A4 [in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
fixPrelude.A5 [in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
fixPrelude.ESigma [in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
fixPrelude.eSigma' [in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
fixPrelude.finalCondition [in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
fixPrelude.FSigma [in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
fixPrelude.FSigma' [in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
fixPrelude.initCond [in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
fixPrelude.initialString [in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
fixPrelude.l [in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
fixPrelude.p [in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
fixPrelude.p' [in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
fixPrelude.Sigma [in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
fixPrelude.Sigma' [in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
fixPrelude.t [in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
fixPrelude.t' [in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
fixprodLists.X [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
fixprodLists.X [in Undecidability.L.Datatypes.List.List_extra]
fixprodLists.Y [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
fixprodLists.Y [in Undecidability.L.Datatypes.List.List_extra]
fixPTCCInstance.A0 [in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
fixPTCCInstance.A1 [in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
fixPTCCInstance.A2 [in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
fixPTCCInstance.A3 [in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
fixPTCCInstance.A4 [in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
fixPTCCInstance.ESigma [in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
fixPTCCInstance.eSigma' [in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
fixPTCCInstance.finalCondition [in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
fixPTCCInstance.fixInitial.initialString [in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
fixPTCCInstance.FSigma [in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
fixPTCCInstance.FSigma' [in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
fixPTCCInstance.initCond [in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
fixPTCCInstance.initialPred [in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
fixPTCCInstance.l [in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
fixPTCCInstance.p [in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
fixPTCCInstance.p' [in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
fixPTCCInstance.Sigma [in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
fixPTCCInstance.Sigma' [in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
fixPTCCInstance.t [in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
fixPTCCInstance.t' [in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
fixRulePred.p [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
fixRulePred.X [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
fixSAT.Clique_implies_SAT.L [in Complexity.NP.Clique.kSAT_to_Clique]
fixSAT.Hkcnf [in Complexity.NP.Clique.kSAT_to_Clique]
fixSAT.Hkgt [in Complexity.NP.Clique.kSAT_to_Clique]
fixSAT.k [in Complexity.NP.Clique.kSAT_to_Clique]
fixSAT.k [in Complexity.NP.Clique.kSAT_to_FlatClique]
fixSAT.N [in Complexity.NP.Clique.kSAT_to_Clique]
fixSAT.N [in Complexity.NP.Clique.kSAT_to_FlatClique]
fixSAT.SAT_implies_Clique.a__sat [in Complexity.NP.Clique.kSAT_to_Clique]
fixSig.fsig [in Complexity.L.TM.TMflatten]
fixSig.fstates [in Complexity.L.TM.TMflatten]
fixSig.ftrans [in Complexity.L.TM.TMflatten]
fixSig.n [in Complexity.L.TM.TMflatten]
fixTM.fixAbstractTypes.M [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
fixTM.fixAbstractTypes.W [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
fixTM.fixAbstractTypes.X [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
fixTM.fixAbstractTypes.Y [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
fixTM.fixAbstractTypes.Z [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
fixTM.fixedInput [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
fixTM.flatFixedInput [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
fixTM.flatTM [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
fixTM.fTM [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
fixTM.index__comp [in Complexity.NP.SAT.CookLevin.Reductions.TMGenNP_fixed_singleTapeTM_to_FlatFunSingleTMGenNP]
fixTM.k' [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
fixTM.M [in Complexity.NP.SAT.CookLevin.Reductions.TMGenNP_fixed_singleTapeTM_to_FlatFunSingleTMGenNP]
fixTM.reg__sig [in Complexity.NP.SAT.CookLevin.Reductions.TMGenNP_fixed_singleTapeTM_to_FlatFunSingleTMGenNP]
fixTM.sig [in Complexity.NP.SAT.CookLevin.Reductions.TMGenNP_fixed_singleTapeTM_to_FlatFunSingleTMGenNP]
fixTM.t [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
fixTM.Σ [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
fixValid.l [in Complexity.NP.SAT.CookLevin.Subproblems.CC]
fixValid.offset [in Complexity.NP.SAT.CookLevin.Subproblems.CC]
fixValid.width [in Complexity.NP.SAT.CookLevin.Subproblems.CC]
fixValid.X [in Complexity.NP.SAT.CookLevin.Subproblems.CC]
fixXrepEl.X [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
fixX.A0 [in Complexity.NP.SAT.CookLevin.Subproblems.CC]
fixX.A1 [in Complexity.NP.SAT.CookLevin.Subproblems.CC]
fixX.cards [in Complexity.NP.SAT.CookLevin.Subproblems.CC]
fixX.eqbX [in Complexity.NP.SAT.SAT_inNP]
fixX.h [in Complexity.Libs.UniformHomomorphisms]
fixX.offset [in Complexity.NP.SAT.CookLevin.Subproblems.CC]
fixX.width [in Complexity.NP.SAT.CookLevin.Subproblems.CC]
FixX.X [in Undecidability.L.Prelim.ARS]
fixX.X [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
fixX.X [in Complexity.NP.SAT.SAT_inNP]
fixX.X [in Complexity.Libs.UniformHomomorphisms]
fixX.X [in Complexity.NP.SAT.CookLevin.Reductions.FlatTCC_to_FlatCC]
fixX.X [in Complexity.NP.SAT.CookLevin.Subproblems.CC]
fixX.Y [in Complexity.Libs.UniformHomomorphisms]
fixX.Y [in Complexity.Libs.CookPrelim.PolyBounds]
Fix_XY.Y [in Undecidability.L.Datatypes.LProd]
Fix_XY.X [in Undecidability.L.Datatypes.LProd]
fix_optReturn.X [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
fix_option_map.B [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
fix_option_map.A [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
Fix_X.X [in Undecidability.L.Datatypes.List.List_basics]
Fix_X.X [in Undecidability.L.Datatypes.LOptions]
fix_X.X [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
Fix_XY.intY [in Undecidability.L.Datatypes.LSum]
Fix_XY.intX [in Undecidability.L.Datatypes.LSum]
Fix_XY.Y [in Undecidability.L.Datatypes.LSum]
Fix_XY.X [in Undecidability.L.Datatypes.LSum]
Fix_X.X [in Undecidability.Shared.Libs.PSL.Lists.Position]
Fix_X.X_eqb_spec [in Undecidability.L.Datatypes.List.List_nat]
Fix_X.X_eqb [in Undecidability.L.Datatypes.List.List_nat]
Fix_Sig.InitTape.I [in Undecidability.TM.Code.CodeTM]
Fix_Sig.InitTape.cX [in Undecidability.TM.Code.CodeTM]
Fix_Sig.InitTape.X [in Undecidability.TM.Code.CodeTM]
Fix_Sig.InitTape.sigX [in Undecidability.TM.Code.CodeTM]
Fix_Sig.Encodes_Ext.I2 [in Undecidability.TM.Code.CodeTM]
Fix_Sig.Encodes_Ext.I1 [in Undecidability.TM.Code.CodeTM]
Fix_Sig.Encodes_Ext.cY [in Undecidability.TM.Code.CodeTM]
Fix_Sig.Encodes_Ext.cX [in Undecidability.TM.Code.CodeTM]
Fix_Sig.Encodes_Ext.sigY [in Undecidability.TM.Code.CodeTM]
Fix_Sig.Encodes_Ext.sigX [in Undecidability.TM.Code.CodeTM]
Fix_Sig.Encodes_Ext.Y [in Undecidability.TM.Code.CodeTM]
Fix_Sig.Encodes_Ext.X [in Undecidability.TM.Code.CodeTM]
Fix_Sig.Tape_Contains.I [in Undecidability.TM.Code.CodeTM]
Fix_Sig.Tape_Contains.cX [in Undecidability.TM.Code.CodeTM]
Fix_Sig.Tape_Contains.X [in Undecidability.TM.Code.CodeTM]
Fix_Sig.Tape_Contains.sigX [in Undecidability.TM.Code.CodeTM]
Fix_Sig.sig [in Undecidability.TM.Code.CodeTM]
fix_sig.sig [in Undecidability.L.TM.TapeFuns]
Fix_Alphabet.n [in Undecidability.TM.TM]
Fix_Alphabet.Σ [in Undecidability.TM.TM]
Fix_Sigma.Σ [in Undecidability.TM.TM]
Fix_X.X_eqb_spec [in Undecidability.L.Datatypes.List.List_eqb]
Fix_X.X_eqb [in Undecidability.L.Datatypes.List.List_eqb]
Fix_X.X [in Undecidability.L.Datatypes.List.List_eqb]
Fix_X2.n [in Undecidability.TM.Util.Relations]
Fix_X2.Z [in Undecidability.TM.Util.Relations]
Fix_X2.Y [in Undecidability.TM.Util.Relations]
Fix_X2.X [in Undecidability.TM.Util.Relations]
fix_X.X [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
fix_sig.sig [in Undecidability.L.TM.TMEncoding]
Fix_X.X [in Undecidability.L.Datatypes.List.List_enc]
Fix_Sigma.sig [in Undecidability.TM.Util.TM_facts]
flat_map.f [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
flat_map.Y [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
flat_map.X [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
forallb.X [in Undecidability.L.Datatypes.List.List_fold]
forall_equiv.HPQ [in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
forall_equiv.Q [in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
forall_equiv.P [in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
forall_equiv.A [in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
forall_equiv.X [in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
fp_quotient.Some_inj [in Undecidability.Shared.Libs.DLW.Utils.fin_quotient]
fp_quotient.dec [in Undecidability.Shared.Libs.DLW.Utils.fin_quotient]
fp_quotient.per [in Undecidability.Shared.Libs.DLW.Utils.fin_quotient]
fp_quotient.X [in Undecidability.Shared.Libs.DLW.Utils.fin_quotient]
funTable.eqbX [in Undecidability.L.Functions.FinTypeLookup]
funTable.f [in Undecidability.L.Functions.FinTypeLookup]
funTable.X [in Undecidability.L.Functions.FinTypeLookup]
funTable.Y [in Undecidability.L.Functions.FinTypeLookup]
fun2vec.X [in Undecidability.Shared.Libs.DLW.Vec.vec]

G

Graph.A [in Undecidability.TM.Univ.LowLevel]
Graph.B [in Undecidability.TM.Univ.LowLevel]
Graph.f [in Undecidability.TM.Univ.LowLevel]

I

Id.F [in Undecidability.TM.Combinators.Combinators]
Id.n [in Undecidability.TM.Combinators.Combinators]
Id.pM [in Undecidability.TM.Combinators.Combinators]
Id.sig [in Undecidability.TM.Combinators.Combinators]
If.F [in Undecidability.TM.Combinators.If]
If.n [in Undecidability.TM.Combinators.If]
If.pM1 [in Undecidability.TM.Combinators.If]
If.pM2 [in Undecidability.TM.Combinators.If]
If.pM3 [in Undecidability.TM.Combinators.If]
If.sig [in Undecidability.TM.Combinators.If]
Inclusion.X [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
Inclusion.X [in Undecidability.Shared.ListAutomation]
incl.X [in Undecidability.Shared.Libs.DLW.Utils.php]
Informative_Chinese_Remainder_theorems.Binary.Huv [in Undecidability.Shared.Libs.DLW.Utils.crt]
Informative_Chinese_Remainder_theorems.Binary.Hv [in Undecidability.Shared.Libs.DLW.Utils.crt]
Informative_Chinese_Remainder_theorems.Binary.Hu [in Undecidability.Shared.Libs.DLW.Utils.crt]
Informative_Chinese_Remainder_theorems.Binary.b [in Undecidability.Shared.Libs.DLW.Utils.crt]
Informative_Chinese_Remainder_theorems.Binary.a [in Undecidability.Shared.Libs.DLW.Utils.crt]
Informative_Chinese_Remainder_theorems.Binary.v [in Undecidability.Shared.Libs.DLW.Utils.crt]
Informative_Chinese_Remainder_theorems.Binary.u [in Undecidability.Shared.Libs.DLW.Utils.crt]
Inf.f' [in Undecidability.Synthetic.Infinite]
Inf.Gen.f [in Undecidability.Synthetic.Infinite]
Inf.Gen.Hf [in Undecidability.Synthetic.Infinite]
Inf.Hf' [in Undecidability.Synthetic.Infinite]
Inf.Hg [in Undecidability.Synthetic.Infinite]
Inf.HX [in Undecidability.Synthetic.Infinite]
Inf.X [in Undecidability.Synthetic.Infinite]
InitUniv.retr_sigTape_sig [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
InitUniv.retr_sigGraph_sig [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
InitUniv.sig [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
InitUniv.sigM [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
InjectSurject.def [in Undecidability.TM.Lifting.LiftAlphabet]
InjectSurject.inj [in Undecidability.TM.Lifting.LiftAlphabet]
InjectSurject.sig [in Undecidability.TM.Lifting.LiftAlphabet]
InjectSurject.tau [in Undecidability.TM.Lifting.LiftAlphabet]
InjectTape.f [in Undecidability.TM.Lifting.LiftAlphabet]
InjectTape.sig [in Undecidability.TM.Lifting.LiftAlphabet]
InjectTape.tau [in Undecidability.TM.Lifting.LiftAlphabet]
int.X [in Undecidability.L.Datatypes.LOptions]
int.X [in Undecidability.L.Datatypes.LSum]
int.X [in Complexity.L.TM.CompCode]
int.X [in Complexity.L.TM.CompCode]
int.X [in Complexity.L.TM.CompCode]
int.X [in Complexity.L.TM.CompCode]
int.X [in Complexity.L.TM.CompCode]
int.Y [in Undecidability.L.Datatypes.LSum]
int.Y [in Complexity.L.TM.CompCode]
int.Y [in Complexity.L.TM.CompCode]
In_nth.n [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
In_nth.A [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
In_Dec.X_dec [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
In_Dec.X [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
In_t.X [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
Iteration.f [in Undecidability.Shared.Libs.PSL.Numbers]
Iteration.X [in Undecidability.Shared.Libs.PSL.Numbers]
iter.f [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
iter.X [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
it_i.f [in Undecidability.L.Tactics.Extract]
it_i.X [in Undecidability.L.Tactics.Extract]

J

Join.A [in Undecidability.Shared.Libs.PSL.Retracts]
Join.B [in Undecidability.Shared.Libs.PSL.Retracts]
Join.disjoint [in Undecidability.Shared.Libs.PSL.Retracts]
Join.retr1 [in Undecidability.Shared.Libs.PSL.Retracts]
Join.retr2 [in Undecidability.Shared.Libs.PSL.Retracts]
Join.Z [in Undecidability.Shared.Libs.PSL.Retracts]

L

lb_mask_nat.lb_mask_nat_2 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
lb_mask_nat.lb_mask_nat_1 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
lb_complement.bin_comp [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
lb_pointwise.lbpw_mono_2 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
lb_pointwise.lbpw_mono_f_0 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
lb_pointwise.lbpw_mono_1 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
lb_pointwise.Hf2 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
lb_pointwise.Hf1 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
lb_pointwise.f [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
Lenght.cX [in Undecidability.TM.Code.List.Length]
Lenght.retr1 [in Undecidability.TM.Code.List.Length]
Lenght.retr2 [in Undecidability.TM.Code.List.Length]
Lenght.sig [in Undecidability.TM.Code.List.Length]
Lenght.sigX [in Undecidability.TM.Code.List.Length]
Lenght.X [in Undecidability.TM.Code.List.Length]
Length_steps_nice.cX [in Complexity.TM.PrettyBounds.BaseCode]
Length_steps_nice.X [in Complexity.TM.PrettyBounds.BaseCode]
Length_steps_nice.sigX [in Complexity.TM.PrettyBounds.BaseCode]
Length_steps_nice.cX [in Undecidability.TM.Code.List.Length]
Length_steps_nice.X [in Undecidability.TM.Code.List.Length]
Length_steps_nice.sigX [in Undecidability.TM.Code.List.Length]
Length_size_nice.cX [in Complexity.TM.PrettyBounds.BaseCodeSpace]
Length_size_nice.X [in Complexity.TM.PrettyBounds.BaseCodeSpace]
Length_size_nice.sigX [in Complexity.TM.PrettyBounds.BaseCodeSpace]
length.X [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
LiftAlphabet.def [in Undecidability.TM.Lifting.LiftAlphabet]
LiftAlphabet.F [in Undecidability.TM.Lifting.LiftAlphabet]
LiftAlphabet.Inj [in Undecidability.TM.Lifting.LiftAlphabet]
LiftAlphabet.n [in Undecidability.TM.Lifting.LiftAlphabet]
LiftAlphabet.pMSig [in Undecidability.TM.Lifting.LiftAlphabet]
LiftAlphabet.sig [in Undecidability.TM.Lifting.LiftAlphabet]
LiftAlphabet.tau [in Undecidability.TM.Lifting.LiftAlphabet]
Lifting.HI [in Undecidability.TM.Hoare.HoareRegister]
Lifting.I [in Undecidability.TM.Hoare.HoareRegister]
Lifting.m [in Undecidability.TM.Hoare.HoareRegister]
Lifting.n [in Undecidability.TM.Hoare.HoareRegister]
Lifting.P [in Undecidability.TM.Hoare.HoareRegister]
Lifting.sig [in Undecidability.TM.Hoare.HoareRegister]
LiftNM.F [in Undecidability.TM.Lifting.LiftTapes]
LiftNM.I [in Undecidability.TM.Lifting.LiftTapes]
LiftNM.I_dupfree [in Undecidability.TM.Lifting.LiftTapes]
LiftNM.m [in Undecidability.TM.Lifting.LiftTapes]
LiftNM.n [in Undecidability.TM.Lifting.LiftTapes]
LiftNM.pM [in Undecidability.TM.Lifting.LiftTapes]
LiftNM.sig [in Undecidability.TM.Lifting.LiftTapes]
LiftTapes_Rel.T [in Undecidability.TM.Lifting.LiftTapes]
LiftTapes_Rel.R [in Undecidability.TM.Lifting.LiftTapes]
LiftTapes_Rel.I [in Undecidability.TM.Lifting.LiftTapes]
LiftTapes_Rel.n [in Undecidability.TM.Lifting.LiftTapes]
LiftTapes_Rel.m [in Undecidability.TM.Lifting.LiftTapes]
LiftTapes_Rel.F [in Undecidability.TM.Lifting.LiftTapes]
LiftTapes_Rel.sig [in Undecidability.TM.Lifting.LiftTapes]
lift_sigma_tau.F [in Undecidability.TM.Lifting.LiftAlphabet]
lift_sigma_tau.def [in Undecidability.TM.Lifting.LiftAlphabet]
lift_sigma_tau.g [in Undecidability.TM.Lifting.LiftAlphabet]
lift_sigma_tau.tau [in Undecidability.TM.Lifting.LiftAlphabet]
lift_sigma_tau.sig [in Undecidability.TM.Lifting.LiftAlphabet]
lift_sigma_tau.n [in Undecidability.TM.Lifting.LiftAlphabet]
linker.c [in Undecidability.Shared.Libs.DLW.Code.compiler]
linker.comp.lnk [in Undecidability.Shared.Libs.DLW.Code.compiler]
linker.err [in Undecidability.Shared.Libs.DLW.Code.compiler]
linker.Hc [in Undecidability.Shared.Libs.DLW.Code.compiler]
linker.i [in Undecidability.Shared.Libs.DLW.Code.compiler]
linker.lc [in Undecidability.Shared.Libs.DLW.Code.compiler]
linker.linker_in_code.Hlc [in Undecidability.Shared.Libs.DLW.Code.compiler]
linker.P [in Undecidability.Shared.Libs.DLW.Code.compiler]
linker.X [in Undecidability.Shared.Libs.DLW.Code.compiler]
linker.Y [in Undecidability.Shared.Libs.DLW.Code.compiler]
Lin.HA [in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
Lin.Heap [in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
ListStuff.X [in Undecidability.TM.Code.List.App]
list_discrim.PQdec [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
list_discrim.Q [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
list_discrim.P [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
list_discrim.X [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
list_dec.H [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
list_dec.Q [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
list_dec.P [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
list_dec.X [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
list_first_dec.Pdec [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
list_first_dec.P [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
list_first_dec.X [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
list_assoc.eq_X_dec [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
list_assoc.Y [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
list_assoc.X [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
list_in_map.Y [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
list_in_map.X [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
list_injective.HP1 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
list_injective.HP0 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
list_injective.P [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
list_injective.X [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
list_discr_vec.f [in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
list_discr_vec.Hv [in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
list_discr_vec.v [in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
list_discr_vec.Hl2 [in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
list_discr_vec.Hl1 [in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
list_discr_vec.l [in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
list_discr_vec.ll [in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
list_discr_vec.D [in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
list_discr_vec.X [in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
list_bool_succ_rect.list_bool_succ_rec [in Undecidability.Shared.Libs.DLW.Utils.list_bool]
list_bool_succ_rect.HPS [in Undecidability.Shared.Libs.DLW.Utils.list_bool]
list_bool_succ_rect.HP0 [in Undecidability.Shared.Libs.DLW.Utils.list_bool]
list_bool_succ_rect.P [in Undecidability.Shared.Libs.DLW.Utils.list_bool]
list_bool_next.list_bool_next_def [in Undecidability.Shared.Libs.DLW.Utils.list_bool]
list_eqb.spec [in Undecidability.L.Datatypes.List.List_eqb]
list_eqb.eqb [in Undecidability.L.Datatypes.List.List_eqb]
list_eqb.X [in Undecidability.L.Datatypes.List.List_eqb]
list_choose_dep.Q [in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
list_choose_dep.P [in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
list_choose_dep.X [in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
list_choose_d.Q [in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
list_choose_d.P [in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
list_choose_d.X [in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
list_in_time.X [in Undecidability.L.Datatypes.List.List_in]
list_in.eqb_correct [in Undecidability.L.Datatypes.List.List_in]
list_in.eqb [in Undecidability.L.Datatypes.List.List_in]
list_in.X [in Undecidability.L.Datatypes.List.List_in]
LMGenNP_to_TMGenNP_mTM.M__mono [in Complexity.NP.TM.mTM_to_singleTapeTM]
LMtoTM.sec.sig [in Complexity.NP.TM.M_LM2TM]
LookupAssociativeList.cX [in Undecidability.TM.Univ.LookupAssociativeListTM]
LookupAssociativeList.cX_injective [in Undecidability.TM.Univ.LookupAssociativeListTM]
LookupAssociativeList.cY [in Undecidability.TM.Univ.LookupAssociativeListTM]
LookupAssociativeList.sigX [in Undecidability.TM.Univ.LookupAssociativeListTM]
LookupAssociativeList.sigY [in Undecidability.TM.Univ.LookupAssociativeListTM]
LookupAssociativeList.X [in Undecidability.TM.Univ.LookupAssociativeListTM]
LookupAssociativeList.Y [in Undecidability.TM.Univ.LookupAssociativeListTM]
Lookup_size_nice.cY [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
Lookup_size_nice.cX [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
Lookup_size_nice.Y [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
Lookup_size_nice.X [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
Lookup_size_nice.sigY [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
Lookup_size_nice.sigX [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
Lookup.retr_heap_lookup [in Undecidability.TM.L.HeapInterpreter.LookupTM]
Lookup.retr_clos_lookup [in Undecidability.TM.L.HeapInterpreter.LookupTM]
Lookup.sigLookup [in Undecidability.TM.L.HeapInterpreter.LookupTM]
Lookup.X [in Undecidability.L.Functions.FinTypeLookup]
Lookup.Y [in Undecidability.L.Functions.FinTypeLookup]
LoopLift.A [in Undecidability.TM.Util.Prelim]
LoopLift.B [in Undecidability.TM.Util.Prelim]
LoopLift.f [in Undecidability.TM.Util.Prelim]
LoopLift.f' [in Undecidability.TM.Util.Prelim]
LoopLift.h [in Undecidability.TM.Util.Prelim]
LoopLift.halt_lift_comp [in Undecidability.TM.Util.Prelim]
LoopLift.h' [in Undecidability.TM.Util.Prelim]
LoopLift.lift [in Undecidability.TM.Util.Prelim]
LoopLift.step_lift_comp [in Undecidability.TM.Util.Prelim]
LoopMerge.A [in Undecidability.TM.Util.Prelim]
LoopMerge.f [in Undecidability.TM.Util.Prelim]
LoopMerge.h [in Undecidability.TM.Util.Prelim]
LoopMerge.halt_comp [in Undecidability.TM.Util.Prelim]
LoopMerge.h' [in Undecidability.TM.Util.Prelim]
loopM.eqb_state [in Undecidability.L.TM.TMinL.TMinL_extract]
loopM.eqb_sig [in Undecidability.L.TM.TMinL.TMinL_extract]
loopM.M [in Undecidability.L.TM.TMinL.TMinL_extract]
loopM.n [in Undecidability.L.TM.TMinL.TMinL_extract]
loopM.reg_state [in Undecidability.L.TM.TMinL.TMinL_extract]
loopM.reg_sig [in Undecidability.L.TM.TMinL.TMinL_extract]
loopSum.X [in Undecidability.L.Functions.LoopSum]
loopSum.Y [in Undecidability.L.Functions.LoopSum]
loop_map.step_map_comp [in Undecidability.TM.Lifting.LiftTapes]
loop_map.g [in Undecidability.TM.Lifting.LiftTapes]
loop_map.h [in Undecidability.TM.Lifting.LiftTapes]
loop_map.f [in Undecidability.TM.Lifting.LiftTapes]
loop_map.B [in Undecidability.TM.Lifting.LiftTapes]
loop_map.A [in Undecidability.TM.Lifting.LiftTapes]
Loop.A [in Undecidability.TM.Util.Prelim]
Loop.f [in Undecidability.TM.Util.Prelim]
Loop.p [in Undecidability.TM.Util.Prelim]
L_list_def.L [in Undecidability.Synthetic.ListEnumerabilityFacts]
L_enum_rec.H_d [in Undecidability.L.Computability.Synthetic]
L_enum_rec.c_d [in Undecidability.L.Computability.Synthetic]
L_enum_rec.d [in Undecidability.L.Computability.Synthetic]
L_enum_rec.H_f [in Undecidability.L.Computability.Synthetic]
L_enum_rec.c_f [in Undecidability.L.Computability.Synthetic]
L_enum_rec.f [in Undecidability.L.Computability.Synthetic]
L_enum_rec.p [in Undecidability.L.Computability.Synthetic]
L_enum_rec.X [in Undecidability.L.Computability.Synthetic]

M

main.Hscl [in Undecidability.TM.L.CompilerBoolFuns.Compiler]
main.Hs1 [in Undecidability.TM.L.CompilerBoolFuns.Compiler]
main.Hs2 [in Undecidability.TM.L.CompilerBoolFuns.Compiler]
main.k [in Undecidability.TM.L.CompilerBoolFuns.Compiler]
main.R [in Undecidability.TM.L.CompilerBoolFuns.Compiler]
main.s [in Undecidability.TM.L.CompilerBoolFuns.Compiler]
MakeSingleTape_Bounded_by_sizeOfmTapes.n [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
MakeSingleTape_Bounded_by_sizeOfmTapes.sig [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
MakeSingleTape.n [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
MakeSingleTape.sigM [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
MapCode.cX [in Undecidability.TM.Code.ChangeAlphabet]
MapCode.I [in Undecidability.TM.Code.ChangeAlphabet]
MapCode.I_x [in Undecidability.TM.Code.ChangeAlphabet]
MapCode.retr [in Undecidability.TM.Code.ChangeAlphabet]
MapCode.sig [in Undecidability.TM.Code.ChangeAlphabet]
MapCode.sigX [in Undecidability.TM.Code.ChangeAlphabet]
MapCode.tau [in Undecidability.TM.Code.ChangeAlphabet]
MapCode.X [in Undecidability.TM.Code.ChangeAlphabet]
MapTape.g [in Undecidability.TM.Util.TM_facts]
MapTape.sig [in Undecidability.TM.Util.TM_facts]
MapTape.tau [in Undecidability.TM.Util.TM_facts]
map_vec_pos_equiv.T_trans [in Undecidability.Shared.Libs.DLW.Vec.vec]
map_vec_pos_equiv.T_refl [in Undecidability.Shared.Libs.DLW.Vec.vec]
map_vec_pos_equiv.T [in Undecidability.Shared.Libs.DLW.Vec.vec]
map_vec_pos_equiv.Y [in Undecidability.Shared.Libs.DLW.Vec.vec]
map_vec_pos_equiv.R [in Undecidability.Shared.Libs.DLW.Vec.vec]
map_vec_pos_equiv.X [in Undecidability.Shared.Libs.DLW.Vec.vec]
map.f [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
map.X [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
Map.X [in Undecidability.TM.Util.Prelim]
map.Y [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
Map.Y [in Undecidability.TM.Util.Prelim]
Map.Z [in Undecidability.TM.Util.Prelim]
MatchTapes.sig [in Undecidability.TM.Util.TM_facts]
max_list_map.f [in Undecidability.TM.PrettyBounds.MaxList]
max_list_map.X [in Undecidability.TM.PrettyBounds.MaxList]
measure_double_rect.measure_double_rect.Fix_F_2_Acc_irr [in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
measure_double_rect.measure_double_rect.Fix_F_2_paired_Acc_irr [in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
measure_double_rect.measure_double_rect.Fix_F_2_paired [in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
measure_double_rect.measure_double_rect.F_ext [in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
measure_double_rect.measure_double_rect.Fix_F_2_fix [in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
measure_double_rect.measure_double_rect.Fix_F_2 [in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
measure_double_rect.measure_double_rect_paired.Q [in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
measure_double_rect.Rwf [in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
measure_double_rect.R [in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
measure_double_rect.m' [in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
measure_double_rect.F [in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
measure_double_rect.P [in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
measure_double_rect.m [in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
measure_double_rect.Y [in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
measure_double_rect.X [in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
measure_rect.Fix_F_Acc_irr [in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
measure_rect.F_ext [in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
measure_rect.Fix_F_fix [in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
measure_rect.Fix_F [in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
measure_rect.Rwf [in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
measure_rect.R [in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
measure_rect.F [in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
measure_rect.P [in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
measure_rect.m [in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
measure_rect.X [in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
measure_rect_123.measure_rect3.R [in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
measure_rect_123.measure_rect3.m' [in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
measure_rect_123.measure_rect3.F [in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
measure_rect_123.measure_rect3.P [in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
measure_rect_123.measure_rect3.m [in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
measure_rect_123.measure_rect3.Z [in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
measure_rect_123.measure_rect3.Y [in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
measure_rect_123.measure_rect3.X [in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
measure_rect_123.measure_rect2.R [in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
measure_rect_123.measure_rect2.m' [in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
measure_rect_123.measure_rect2.F [in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
measure_rect_123.measure_rect2.P [in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
measure_rect_123.measure_rect2.m [in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
measure_rect_123.measure_rect2.Y [in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
measure_rect_123.measure_rect2.X [in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
measure_rect_123.measure_rect.F [in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
measure_rect_123.measure_rect.P [in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
measure_rect_123.measure_rect.m [in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
measure_rect_123.measure_rect.X [in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
Membership.X [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
MirrorTape.n [in Undecidability.TM.Util.TM_facts]
MirrorTape.sig [in Undecidability.TM.Util.TM_facts]
Mirror.F [in Undecidability.TM.Combinators.Mirror]
Mirror.n [in Undecidability.TM.Combinators.Mirror]
Mirror.pM [in Undecidability.TM.Combinators.Mirror]
Mirror.sig [in Undecidability.TM.Combinators.Mirror]
Mk_Mono.R [in Undecidability.TM.Basic.Mono]
Mk_Mono.F [in Undecidability.TM.Basic.Mono]
Mk_Mono.fin [in Undecidability.TM.Basic.Mono]
Mk_Mono.init [in Undecidability.TM.Basic.Mono]
Mk_Mono.mono_trans [in Undecidability.TM.Basic.Mono]
Mk_Mono.state [in Undecidability.TM.Basic.Mono]
Mk_Mono.sig [in Undecidability.TM.Basic.Mono]
mk_init.sim [in Undecidability.TM.L.CompilerBoolFuns.Compiler]
mk_init.k [in Undecidability.TM.L.CompilerBoolFuns.Compiler]
mk_init.m [in Undecidability.TM.L.CompilerBoolFuns.Compiler]
mk_init.H_disj [in Undecidability.TM.L.CompilerBoolFuns.Compiler]
mk_init.b [in Undecidability.TM.L.CompilerBoolFuns.Compiler]
mk_init.s [in Undecidability.TM.L.CompilerBoolFuns.Compiler]
mk_init.Σ [in Undecidability.TM.L.CompilerBoolFuns.Compiler]
mk_init_one.retr_list [in Undecidability.TM.L.CompilerBoolFuns.Compiler]
mk_init_one.retr_pro [in Undecidability.TM.L.CompilerBoolFuns.Compiler]
mk_init_one.H_disj [in Undecidability.TM.L.CompilerBoolFuns.Compiler]
mk_init_one.b [in Undecidability.TM.L.CompilerBoolFuns.Compiler]
mk_init_one.s [in Undecidability.TM.L.CompilerBoolFuns.Compiler]
mk_init_one.Σ [in Undecidability.TM.L.CompilerBoolFuns.Compiler]
Mono_Nop.sig [in Undecidability.TM.Basic.Null]
MovePar.D1 [in Undecidability.TM.Compound.Multi]
MovePar.D2 [in Undecidability.TM.Compound.Multi]
MovePar.sig [in Undecidability.TM.Compound.Multi]
MoveToSymbol_Sem.f [in Undecidability.TM.Compound.MoveToSymbol]
MoveToSymbol_Sem.stop [in Undecidability.TM.Compound.MoveToSymbol]
MoveToSymbol_Sem.sig [in Undecidability.TM.Compound.MoveToSymbol]
MoveToSymbol.f [in Undecidability.TM.Compound.MoveToSymbol]
MoveToSymbol.g [in Undecidability.TM.Compound.MoveToSymbol]
MoveToSymbol.sig [in Undecidability.TM.Compound.MoveToSymbol]
MoveValue.cX [in Undecidability.TM.Code.Copy]
MoveValue.cY [in Undecidability.TM.Code.Copy]
MoveValue.I1 [in Undecidability.TM.Code.Copy]
MoveValue.I2 [in Undecidability.TM.Code.Copy]
MoveValue.sig [in Undecidability.TM.Code.Copy]
MoveValue.sigX [in Undecidability.TM.Code.Copy]
MoveValue.sigY [in Undecidability.TM.Code.Copy]
MoveValue.X [in Undecidability.TM.Code.Copy]
MoveValue.Y [in Undecidability.TM.Code.Copy]
Move.cX [in Undecidability.TM.Code.Copy]
Move.I [in Undecidability.TM.Code.Copy]
Move.sig [in Undecidability.TM.Code.Copy]
Move.sigX [in Undecidability.TM.Code.Copy]
Move.X [in Undecidability.TM.Code.Copy]
msum_morphism.Hphi2 [in Undecidability.Shared.Libs.DLW.Utils.sums]
msum_morphism.Hphi1 [in Undecidability.Shared.Libs.DLW.Utils.sums]
msum_morphism.phi [in Undecidability.Shared.Libs.DLW.Utils.sums]
msum_morphism.H2 [in Undecidability.Shared.Libs.DLW.Utils.sums]
msum_morphism.H1 [in Undecidability.Shared.Libs.DLW.Utils.sums]
msum_morphism.u2 [in Undecidability.Shared.Libs.DLW.Utils.sums]
msum_morphism.m2 [in Undecidability.Shared.Libs.DLW.Utils.sums]
msum_morphism.u1 [in Undecidability.Shared.Libs.DLW.Utils.sums]
msum_morphism.m1 [in Undecidability.Shared.Libs.DLW.Utils.sums]
msum_morphism.Y [in Undecidability.Shared.Libs.DLW.Utils.sums]
msum_morphism.X [in Undecidability.Shared.Libs.DLW.Utils.sums]
msum.Hmonoid [in Undecidability.Shared.Libs.DLW.Utils.sums]
msum.m [in Undecidability.Shared.Libs.DLW.Utils.sums]
msum.u [in Undecidability.Shared.Libs.DLW.Utils.sums]
msum.X [in Undecidability.Shared.Libs.DLW.Utils.sums]
MuRecursor.dec'_P [in Undecidability.L.Computability.MuRec]
MuRecursor.P [in Undecidability.L.Computability.MuRec]
MuRecursor.P_proc [in Undecidability.L.Computability.MuRec]
M.M.n [in Complexity.NP.TM.LM_to_mTM]
M2M_Retract.pM [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
M2M_Retract.n [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
M2M_Retract.F [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
M2M_Retract.sigM [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]

N

nat_meet_digits.binary_le_meet_sum_powers.He [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
nat_meet_digits.binary_le_meet_sum_powers.Hg [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
nat_meet_digits.binary_le_meet_sum_powers.Hf [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
nat_meet_digits.binary_le_meet_sum_powers.e [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
nat_meet_digits.binary_le_meet_sum_powers.g [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
nat_meet_digits.binary_le_meet_sum_powers.f [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
nat_meet_digits.binary_le_meet_sum_powers.n [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
nat_meet_digits.double_sum_powers_ortho.dsmpo_1 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
nat_meet_digits.double_sum_powers_ortho.He [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
nat_meet_digits.double_sum_powers_ortho.Hf [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
nat_meet_digits.double_sum_powers_ortho.e [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
nat_meet_digits.double_sum_powers_ortho.f [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
nat_meet_digits.double_sum_powers_ortho.n [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
nat_meet_digits.nat_meet_powers_neq.nat_meet_neq_powers [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
nat_meet_digits.Hr' [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
nat_meet_digits.Hr [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
nat_meet_digits.r [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
nat_meet_digits.Hq [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
nat_meet_digits.q [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
nat_meet_power2_neq.nat_meet_power2_lt [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
nat_lb_def.nat_lb_full [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
nat_swap.j [in Undecidability.Shared.Libs.DLW.Utils.sorting]
nat_swap.i [in Undecidability.Shared.Libs.DLW.Utils.sorting]
nat_minimize.nat_min.min_rec [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
nat_minimize.HP [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
nat_minimize.P [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
nat_rev_bounded_ind.HP [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
nat_rev_bounded_ind.P [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
nat_rev_bounded_ind.k [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
nat_sorted.HP2 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
nat_sorted.HP1 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
nat_sorted.HP0 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
nat_sorted.P [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
Newton_nat.plus_cancel_l' [in Undecidability.Shared.Libs.DLW.Utils.sums]
Nop_Action.sig [in Undecidability.TM.Util.TM_facts]
Nop_Action.n [in Undecidability.TM.Util.TM_facts]
Nop.n [in Undecidability.TM.Compound.Multi]
Nop.sig [in Undecidability.TM.Compound.Multi]
NP_certificate_fix.Y [in Complexity.Complexity.NP]
NP_certificate_fix.X [in Complexity.Complexity.NP]
Nth'_nice.cX [in Complexity.TM.PrettyBounds.BaseCode]
Nth'_nice.X [in Complexity.TM.PrettyBounds.BaseCode]
Nth'_nice.sigX [in Complexity.TM.PrettyBounds.BaseCode]
Nth'.cX [in Undecidability.TM.Code.List.Nth]
Nth'.retr1 [in Undecidability.TM.Code.List.Nth]
Nth'.retr2 [in Undecidability.TM.Code.List.Nth]
Nth'.sig [in Undecidability.TM.Code.List.Nth]
Nth'.sigX [in Undecidability.TM.Code.List.Nth]
Nth'.X [in Undecidability.TM.Code.List.Nth]
N_to_string.loop [in Undecidability.Shared.Libs.DLW.Utils.utils_string]

O

option_eqb.spec [in Undecidability.L.Datatypes.LOptions]
option_eqb.eqb [in Undecidability.L.Datatypes.LOptions]
option_eqb.X [in Undecidability.L.Datatypes.LOptions]
OtherWhileRel.F [in Undecidability.TM.Combinators.While]
OtherWhileRel.n [in Undecidability.TM.Combinators.While]
OtherWhileRel.R [in Undecidability.TM.Combinators.While]
OtherWhileRel.sig [in Undecidability.TM.Combinators.While]

P

Permutation_tools.X [in Undecidability.Shared.Libs.DLW.Utils.php]
php_fun.Hf [in Undecidability.Shared.Libs.DLW.Utils.sorting]
php_fun.f [in Undecidability.Shared.Libs.DLW.Utils.sorting]
php_fun.n [in Undecidability.Shared.Libs.DLW.Utils.sorting]
PHP_rel.Hlm [in Undecidability.Shared.Libs.DLW.Utils.php]
PHP_rel.image_R_l [in Undecidability.Shared.Libs.DLW.Utils.php]
PHP_rel.HR [in Undecidability.Shared.Libs.DLW.Utils.php]
PHP_rel.m [in Undecidability.Shared.Libs.DLW.Utils.php]
PHP_rel.l [in Undecidability.Shared.Libs.DLW.Utils.php]
PHP_rel.R [in Undecidability.Shared.Libs.DLW.Utils.php]
PHP_rel.V [in Undecidability.Shared.Libs.DLW.Utils.php]
PHP_rel.U [in Undecidability.Shared.Libs.DLW.Utils.php]
pigeon_list.X [in Undecidability.Shared.Libs.DLW.Utils.php]
pos_prod.ll_prop [in Undecidability.Shared.Libs.DLW.Vec.pos]
pos_prod.ll [in Undecidability.Shared.Libs.DLW.Vec.pos]
pos_prod.n [in Undecidability.Shared.Libs.DLW.Vec.pos]
pos_left_right_rect.HP2 [in Undecidability.Shared.Libs.DLW.Vec.pos]
pos_left_right_rect.HP1 [in Undecidability.Shared.Libs.DLW.Vec.pos]
pos_left_right_rect.P [in Undecidability.Shared.Libs.DLW.Vec.pos]
pos_left_right_rect.m [in Undecidability.Shared.Libs.DLW.Vec.pos]
pos_left_right_rect.n [in Undecidability.Shared.Libs.DLW.Vec.pos]
pos_invert.pos_invert [in Undecidability.Shared.Libs.DLW.Vec.pos]
pos_invert.pos_invert_t [in Undecidability.Shared.Libs.DLW.Vec.pos]
pos_inv.pos_inv [in Undecidability.Shared.Libs.DLW.Vec.pos]
pos_inv.pos_inv_t [in Undecidability.Shared.Libs.DLW.Vec.pos]
PowerRep.X [in Undecidability.Shared.Libs.PSL.Lists.Power]
power_injective.power_inj_2 [in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
power_injective.power_plus_lt [in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
power_injective.power_2_inj_1 [in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
power_decomp_uniq.lt_minus_cancel [in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
power_decomp_uniq.power_nzero [in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
power_decomp_uniq.Hp [in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
power_decomp_uniq.p [in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
power_decomp.power_nzero [in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
power_decomp.Hp [in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
power_decomp.p [in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
Power.X [in Undecidability.Shared.Libs.PSL.Lists.Power]
pow2_bound.loop_prop [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
pow2_bound.loop [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
prefix.prefix_rect.HP1 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
prefix.prefix_rect.HP0 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
prefix.prefix_rect.P [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
prefix.X [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
prime.prime_rect.HPm [in Undecidability.Shared.Libs.DLW.Utils.prime]
prime.prime_rect.HPp [in Undecidability.Shared.Libs.DLW.Utils.prime]
prime.prime_rect.HP1 [in Undecidability.Shared.Libs.DLW.Utils.prime]
prime.prime_rect.HP0 [in Undecidability.Shared.Libs.DLW.Utils.prime]
prime.prime_rect.P [in Undecidability.Shared.Libs.DLW.Utils.prime]
Private_UnfoldClos.Fix.retr_heap [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
Private_UnfoldClos.Fix.retr_stack [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
Private_UnfoldClos.Fix.Σ [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
prodLists_bound.Y [in Complexity.Libs.CookPrelim.PolyBounds]
prodLists_bound.X [in Complexity.Libs.CookPrelim.PolyBounds]
Properties.P [in Undecidability.Synthetic.InformativeReducibilityFacts]
Properties.P [in Undecidability.Synthetic.ReducibilityFacts]
Properties.Q [in Undecidability.Synthetic.InformativeReducibilityFacts]
Properties.Q [in Undecidability.Synthetic.ReducibilityFacts]
Properties.R [in Undecidability.Synthetic.InformativeReducibilityFacts]
Properties.R [in Undecidability.Synthetic.ReducibilityFacts]
Properties.X [in Undecidability.Synthetic.InformativeReducibilityFacts]
Properties.X [in Undecidability.Synthetic.ReducibilityFacts]
Properties.Y [in Undecidability.Synthetic.InformativeReducibilityFacts]
Properties.Y [in Undecidability.Synthetic.ReducibilityFacts]
Properties.Z [in Undecidability.Synthetic.InformativeReducibilityFacts]
Properties.Z [in Undecidability.Synthetic.ReducibilityFacts]

R

ReadChar.k [in Undecidability.TM.Compound.Multi]
ReadChar.n [in Undecidability.TM.Compound.Multi]
ReadChar.sig [in Undecidability.TM.Basic.Mono]
ReadChar.sig [in Undecidability.TM.Compound.Multi]
ReadChar2.sig [in Undecidability.TM.Basic.Duo]
RegSpec.sig [in Undecidability.TM.Hoare.HoareRegister]
reg_tapes.sig [in Undecidability.L.TM.TMEncoding]
Relabel.F [in Undecidability.TM.Combinators.Combinators]
Relabel.F' [in Undecidability.TM.Combinators.Combinators]
Relabel.n [in Undecidability.TM.Combinators.Combinators]
Relabel.p [in Undecidability.TM.Combinators.Combinators]
Relabel.pM [in Undecidability.TM.Combinators.Combinators]
Relabel.sig [in Undecidability.TM.Combinators.Combinators]
rel_iter_seq.R [in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
rel_iter_bound.Hk' [in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
rel_iter_bound.Hk1 [in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
rel_iter_bound.k [in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
rel_iter_bound.R [in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
rel_iter.R [in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
rel_iter.X [in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
Removal.X [in Undecidability.Shared.Libs.PSL.Lists.Removal]
remove.X [in Complexity.Libs.CookPrelim.MorePrelim]
rem.Hp [in Undecidability.Shared.Libs.DLW.Utils.gcd]
rem.p [in Undecidability.Shared.Libs.DLW.Utils.gcd]
repEl_fixX.X [in Complexity.Libs.CookPrelim.MorePrelim]
rep.X [in Complexity.Libs.Pigeonhole]
Retract_Properties.I [in Undecidability.Shared.Libs.PSL.Retracts]
Retract_Properties.Y [in Undecidability.Shared.Libs.PSL.Retracts]
Retract_Properties.X [in Undecidability.Shared.Libs.PSL.Retracts]
Retract.X [in Undecidability.Shared.Libs.PSL.Retracts]
Retract.Y [in Undecidability.Shared.Libs.PSL.Retracts]
Return.F [in Undecidability.TM.Combinators.Combinators]
Return.F' [in Undecidability.TM.Combinators.Combinators]
Return.n [in Undecidability.TM.Combinators.Combinators]
Return.p [in Undecidability.TM.Combinators.Combinators]
Return.pM [in Undecidability.TM.Combinators.Combinators]
Return.sig [in Undecidability.TM.Combinators.Combinators]
Rev.cX [in Undecidability.TM.Code.List.Rev]
Rev.sig [in Undecidability.TM.Code.List.Rev]
Rev.sigX [in Undecidability.TM.Code.List.Rev]
Rev.X [in Undecidability.TM.Code.List.Rev]
rincl_fin.M [in Undecidability.Shared.Libs.DLW.Wf.wf_incl]
rincl_fin.X [in Undecidability.Shared.Libs.DLW.Wf.wf_incl]

S

Semantics.Canonical_Termination.M [in Undecidability.TM.Util.TM_facts]
Semantics.Canonical_Termination.n [in Undecidability.TM.Util.TM_facts]
Semantics.Canonical_Correctness.pM [in Undecidability.TM.Util.TM_facts]
Semantics.Canonical_Correctness.F [in Undecidability.TM.Util.TM_facts]
Semantics.Canonical_Correctness.n [in Undecidability.TM.Util.TM_facts]
Semantics.sig [in Undecidability.TM.Util.TM_facts]
sequence_of_coprimes.seq_of_coprimes_lt [in Undecidability.Shared.Libs.DLW.Utils.crt]
seteq.X [in Undecidability.Shared.Libs.DLW.Utils.seteq]
Shift.f [in Undecidability.TM.Compound.Shift]
Shift.sig [in Undecidability.TM.Compound.Shift]
sigList_eqb.spec__X [in Complexity.L.TM.CompCode]
sigList_eqb.eqb__X [in Complexity.L.TM.CompCode]
sigList_eqb.X [in Complexity.L.TM.CompCode]
sigOption_eqb.spec__X [in Complexity.L.TM.CompCode]
sigOption_eqb.eqb__X [in Complexity.L.TM.CompCode]
sigOption_eqb.X [in Complexity.L.TM.CompCode]
sigPair_eqb.spec__Y [in Complexity.L.TM.CompCode]
sigPair_eqb.eqb__Y [in Complexity.L.TM.CompCode]
sigPair_eqb.spec__X [in Complexity.L.TM.CompCode]
sigPair_eqb.eqb__X [in Complexity.L.TM.CompCode]
sigPair_eqb.Y [in Complexity.L.TM.CompCode]
sigPair_eqb.X [in Complexity.L.TM.CompCode]
sigSum_eqb.spec__Y [in Complexity.L.TM.CompCode]
sigSum_eqb.eqb__Y [in Complexity.L.TM.CompCode]
sigSum_eqb.spec__X [in Complexity.L.TM.CompCode]
sigSum_eqb.eqb__X [in Complexity.L.TM.CompCode]
sigSum_eqb.Y [in Complexity.L.TM.CompCode]
sigSum_eqb.X [in Complexity.L.TM.CompCode]
sigTape_eqb.spec__X [in Complexity.L.TM.CompCode]
sigTape_eqb.eqb__X [in Complexity.L.TM.CompCode]
sigTape_eqb.X [in Complexity.L.TM.CompCode]
sincl.X [in Undecidability.Shared.Libs.DLW.Wf.wf_incl]
sinc_decidable.decidable [in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
sinc_decidable.unbounded [in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
sinc_decidable.f_ge_n [in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
sinc_decidable.f_smono [in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
sinc_decidable.f_mono [in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
sinc_decidable.HP [in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
sinc_decidable.Hf [in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
sinc_decidable.f [in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
sinc_decidable.P [in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
Small_Step_Semantics.sss_loop.HP2 [in Undecidability.Shared.Libs.DLW.Code.sss]
Small_Step_Semantics.sss_loop.HP1 [in Undecidability.Shared.Libs.DLW.Code.sss]
Small_Step_Semantics.sss_loop.Hp [in Undecidability.Shared.Libs.DLW.Code.sss]
Small_Step_Semantics.sss_loop.p [in Undecidability.Shared.Libs.DLW.Code.sss]
Small_Step_Semantics.sss_loop.i [in Undecidability.Shared.Libs.DLW.Code.sss]
Small_Step_Semantics.sss_loop.HC [in Undecidability.Shared.Libs.DLW.Code.sss]
Small_Step_Semantics.sss_loop.C2 [in Undecidability.Shared.Libs.DLW.Code.sss]
Small_Step_Semantics.sss_loop.C1 [in Undecidability.Shared.Libs.DLW.Code.sss]
Small_Step_Semantics.sss_loop.Hf [in Undecidability.Shared.Libs.DLW.Code.sss]
Small_Step_Semantics.sss_loop.f [in Undecidability.Shared.Libs.DLW.Code.sss]
Small_Step_Semantics.sss_loop.spec [in Undecidability.Shared.Libs.DLW.Code.sss]
Small_Step_Semantics.sss_loop.pre [in Undecidability.Shared.Libs.DLW.Code.sss]
Small_Step_Semantics.sss_loop.P [in Undecidability.Shared.Libs.DLW.Code.sss]
Small_Step_Semantics.sss_compute_max_ind.HQ1 [in Undecidability.Shared.Libs.DLW.Code.sss]
Small_Step_Semantics.sss_compute_max_ind.HQ0 [in Undecidability.Shared.Libs.DLW.Code.sss]
Small_Step_Semantics.sss_compute_max_ind.R [in Undecidability.Shared.Libs.DLW.Code.sss]
Small_Step_Semantics.sss_compute_max_ind.P [in Undecidability.Shared.Libs.DLW.Code.sss]
Small_Step_Semantics.sss_terminates_ind.HR1 [in Undecidability.Shared.Libs.DLW.Code.sss]
Small_Step_Semantics.sss_terminates_ind.HR0 [in Undecidability.Shared.Libs.DLW.Code.sss]
Small_Step_Semantics.sss_terminates_ind.R [in Undecidability.Shared.Libs.DLW.Code.sss]
Small_Step_Semantics.sss_terminates_ind.P [in Undecidability.Shared.Libs.DLW.Code.sss]
Small_Step_Semantics.sss_dec [in Undecidability.Shared.Libs.DLW.Code.sss]
Small_Step_Semantics.sss_fun [in Undecidability.Shared.Libs.DLW.Code.sss]
Small_Step_Semantics.one_step [in Undecidability.Shared.Libs.DLW.Code.sss]
Small_Step_Semantics.data [in Undecidability.Shared.Libs.DLW.Code.sss]
Small_Step_Semantics.instr [in Undecidability.Shared.Libs.DLW.Code.sss]
split_interval.Hh2 [in Undecidability.Shared.Libs.DLW.Utils.sorting]
split_interval.Hh1 [in Undecidability.Shared.Libs.DLW.Utils.sorting]
split_interval.Hg2 [in Undecidability.Shared.Libs.DLW.Utils.sorting]
split_interval.Hg1 [in Undecidability.Shared.Libs.DLW.Utils.sorting]
split_interval.h [in Undecidability.Shared.Libs.DLW.Utils.sorting]
split_interval.g [in Undecidability.Shared.Libs.DLW.Utils.sorting]
split_interval.Hi [in Undecidability.Shared.Libs.DLW.Utils.sorting]
split_interval.i [in Undecidability.Shared.Libs.DLW.Utils.sorting]
split_interval.n [in Undecidability.Shared.Libs.DLW.Utils.sorting]
Star_Pow.R [in Undecidability.TM.Util.Relations]
Star_Pow.X [in Undecidability.TM.Util.Relations]
StateWhileInduction.F1 [in Undecidability.TM.Combinators.StateWhile]
StateWhileInduction.F2 [in Undecidability.TM.Combinators.StateWhile]
StateWhileInduction.n [in Undecidability.TM.Combinators.StateWhile]
StateWhileInduction.R1 [in Undecidability.TM.Combinators.StateWhile]
StateWhileInduction.R2 [in Undecidability.TM.Combinators.StateWhile]
StateWhileInduction.sig [in Undecidability.TM.Combinators.StateWhile]
StateWhile_irrelevant'.defF [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
StateWhile_irrelevant'.pM [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
StateWhile_irrelevant'.F2 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
StateWhile_irrelevant'.F1 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
StateWhile_irrelevant'.n [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
StateWhile_irrelevant'.sig [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
StateWhile_irrelevant.defF [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
StateWhile_irrelevant.pM [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
StateWhile_irrelevant.F2 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
StateWhile_irrelevant.F1 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
StateWhile_irrelevant.sig [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
StateWhile.defF [in Undecidability.TM.Combinators.StateWhile]
StateWhile.F1 [in Undecidability.TM.Combinators.StateWhile]
StateWhile.F2 [in Undecidability.TM.Combinators.StateWhile]
StateWhile.n [in Undecidability.TM.Combinators.StateWhile]
StateWhile.pM [in Undecidability.TM.Combinators.StateWhile]
StateWhile.R [in Undecidability.TM.Combinators.StateWhile]
StateWhile.sig [in Undecidability.TM.Combinators.StateWhile]
StateWhile.StateWhile_TerminatesIn_coind.T [in Undecidability.TM.Combinators.StateWhile]
StateWhile.StateWhile_TerminatesIn.T' [in Undecidability.TM.Combinators.StateWhile]
StateWhile.StateWhile_TerminatesIn.T [in Undecidability.TM.Combinators.StateWhile]
StepMachine.retr_heap_step [in Undecidability.TM.L.HeapInterpreter.StepTM]
StepMachine.retr_closures_step [in Undecidability.TM.L.HeapInterpreter.StepTM]
StepMachine.sigStep [in Undecidability.TM.L.HeapInterpreter.StepTM]
subcode.Q [in Undecidability.Shared.Libs.DLW.Code.subcode]
subcode.X [in Undecidability.Shared.Libs.DLW.Code.subcode]
subsequence.X [in Complexity.Libs.CookPrelim.MorePrelim]
SujectTape.def [in Undecidability.TM.Lifting.LiftAlphabet]
SujectTape.g [in Undecidability.TM.Lifting.LiftAlphabet]
SujectTape.sig [in Undecidability.TM.Lifting.LiftAlphabet]
SujectTape.tau [in Undecidability.TM.Lifting.LiftAlphabet]
sum_eqb.spec__Y [in Undecidability.L.Datatypes.LSum]
sum_eqb.eqb__Y [in Undecidability.L.Datatypes.LSum]
sum_eqb.spec__X [in Undecidability.L.Datatypes.LSum]
sum_eqb.eqb__X [in Undecidability.L.Datatypes.LSum]
sum_eqb.Y [in Undecidability.L.Datatypes.LSum]
sum_eqb.X [in Undecidability.L.Datatypes.LSum]
sum_bounded_permutation.flat_right [in Undecidability.Shared.Libs.DLW.Utils.sorting]
sum_bounded_permutation.flat_left [in Undecidability.Shared.Libs.DLW.Utils.sorting]
sum_bounded_permutation.flat [in Undecidability.Shared.Libs.DLW.Utils.sorting]
sum_bounded_permutation.sum_permutation_1 [in Undecidability.Shared.Libs.DLW.Utils.sorting]
sum_bounded_permutation.sigma_sum_split [in Undecidability.Shared.Libs.DLW.Utils.sorting]
SurjectInject.def [in Undecidability.TM.Code.ChangeAlphabet]
SurjectInject.retr [in Undecidability.TM.Code.ChangeAlphabet]
SurjectInject.sig [in Undecidability.TM.Code.ChangeAlphabet]
SurjectInject.tau [in Undecidability.TM.Code.ChangeAlphabet]
Switch.F [in Undecidability.TM.Combinators.Switch]
Switch.F' [in Undecidability.TM.Combinators.Switch]
Switch.n [in Undecidability.TM.Combinators.Switch]
Switch.pMf [in Undecidability.TM.Combinators.Switch]
Switch.pM1 [in Undecidability.TM.Combinators.Switch]
Switch.sig [in Undecidability.TM.Combinators.Switch]

T

tabulate_vec.X [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
tabulate.A [in Complexity.Libs.CookPrelim.MorePrelim]
Tape_Local.sig [in Undecidability.TM.Util.TM_facts]
Test_def.pM [in Undecidability.TM.Util.TM_facts]
Test_def.F [in Undecidability.TM.Util.TM_facts]
Test_def.sig [in Undecidability.TM.Util.TM_facts]
Test_def.n [in Undecidability.TM.Util.TM_facts]
test.a [in Undecidability.Shared.Libs.DLW.Utils.focus]
test.b [in Undecidability.Shared.Libs.DLW.Utils.focus]
test.c [in Undecidability.Shared.Libs.DLW.Utils.focus]
test.dec_P [in Undecidability.TM.Compound.TMTac]
test.P [in Undecidability.TM.Compound.TMTac]
test.x [in Undecidability.Shared.Libs.DLW.Utils.focus]
test.X [in Undecidability.Shared.Libs.DLW.Utils.focus]
test.y [in Undecidability.Shared.Libs.DLW.Utils.focus]
test.z [in Undecidability.Shared.Libs.DLW.Utils.focus]
TimeHierarchy_Parametric.suplin_t__E [in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
TimeHierarchy_Parametric.mono_t__E [in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
TimeHierarchy_Parametric.n_leq_tn [in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
TimeHierarchy_Parametric.f_TC [in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
TimeHierarchy_Parametric.E__proc [in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
TimeHierarchy_Parametric.E__spec [in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
TimeHierarchy_Parametric.t__E [in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
TimeHierarchy_Parametric.E [in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
TimeHierarchy_Parametric.fT [in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
TimeHierarchy_Parametric.f' [in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
TimeHierarchy_Parametric.start [in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
TimeHierarchy_Parametric.f [in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
TimeHierarchy.f [in Complexity.HierarchyTheorem.TimeHierarchyTheorem]
TimeHierarchy.fT [in Complexity.HierarchyTheorem.TimeHierarchyTheorem]
TimeHierarchy.f_geq_n [in Complexity.HierarchyTheorem.TimeHierarchyTheorem]
TimeHierarchy.TC__f [in Complexity.HierarchyTheorem.TimeHierarchyTheorem]
TM_single.TM [in Complexity.NP.SAT.CookLevin.Subproblems.TM_single]
TM_single.Sigma [in Complexity.NP.SAT.CookLevin.Subproblems.TM_single]
ToSingleTape.DoActions.acts [in Undecidability.TM.Single.StepTM]
ToSingleTape.F [in Undecidability.TM.Single.StepTM]
ToSingleTape.Loop.M_T [in Undecidability.TM.Single.StepTM]
ToSingleTape.Loop.M_R [in Undecidability.TM.Single.StepTM]
ToSingleTape.n [in Undecidability.TM.Single.StepTM]
ToSingleTape.pM [in Undecidability.TM.Single.StepTM]
ToSingleTape.sig [in Undecidability.TM.Single.StepTM]
ToSingleTape.Step.q [in Undecidability.TM.Single.StepTM]
TraceArgument.R [in Complexity.Complexity.SpaceBoundsTime]
TraceArgument.X [in Complexity.Complexity.SpaceBoundsTime]
TranslateAct.X [in Undecidability.TM.Lifting.LiftAlphabet]
TranslateAct.Y [in Undecidability.TM.Lifting.LiftAlphabet]
Translate.cX [in Undecidability.TM.Code.Copy]
Translate.I1 [in Undecidability.TM.Code.Copy]
Translate.I2 [in Undecidability.TM.Code.Copy]
Translate.sig [in Undecidability.TM.Code.Copy]
Translate.sigX [in Undecidability.TM.Code.Copy]
Translate.X [in Undecidability.TM.Code.Copy]
TrueOrDiverge.sec.M' [in Complexity.NP.TM.LM_to_mTM]
TrueOrDiverge.sec.n [in Complexity.NP.TM.LM_to_mTM]
TrueOrDiverge.sec.sig [in Complexity.NP.TM.LM_to_mTM]

U

uiter.f [in Undecidability.L.Functions.UnboundIteration]
uiter.fT [in Undecidability.L.Functions.UnboundIteration]
uiter.X [in Undecidability.L.Functions.UnboundIteration]
uiter.Y [in Undecidability.L.Functions.UnboundIteration]
Undup.X [in Undecidability.Shared.Libs.PSL.Lists.Dupfree]
UnfoldClos.Fix.retr_clos [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
UnfoldClos.Fix.retr_heap [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
UnfoldClos.Fix.retr_stack [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
UnfoldClos.Fix.Σ [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
UnfoldPro.H [in Complexity.L.AbstractMachines.UnfoldHeap]
UnivMultiTimeSpaceTheorem.M [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
UnivMultiTimeSpaceTheorem.n [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
UnivMultiTimeSpaceTheorem.n_ge1 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
UnivMultiTimeSpaceTheorem.sigM [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
Univ_nice.M [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
Univ_nice.sigM [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
Univ.retr_sigTape_sig [in Undecidability.TM.Univ.LowLevel]
Univ.retr_sigGraph_sig [in Undecidability.TM.Univ.LowLevel]
Univ.retr_sigTape_sig [in Undecidability.TM.Univ.Univ]
Univ.retr_sigGraph_sig [in Undecidability.TM.Univ.Univ]
Univ.sig [in Undecidability.TM.Univ.LowLevel]
Univ.sig [in Undecidability.TM.Univ.Univ]
Univ.sigM [in Undecidability.TM.Univ.LowLevel]
Univ.sigM [in Undecidability.TM.Univ.Univ]
uptoc_mixed.uptoc_mixed.fixXeq.X [in Complexity.L.ComparisonTimeBoundDerivation]
uptoc_pure.uptoc_pure.fixXeq.X [in Complexity.L.ComparisonTimeBoundDerivation]
Usefull_Retracts.D [in Undecidability.Shared.Libs.PSL.Retracts]
Usefull_Retracts.C [in Undecidability.Shared.Libs.PSL.Retracts]
Usefull_Retracts.B [in Undecidability.Shared.Libs.PSL.Retracts]
Usefull_Retracts.A [in Undecidability.Shared.Libs.PSL.Retracts]
U.F [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
U.inhSigM [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
U.sigM [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]

V

vector.eq_X_dec [in Undecidability.Shared.Libs.DLW.Vec.vec]
vector.vec_head_tail_prop [in Undecidability.Shared.Libs.DLW.Vec.vec]
vector.vec_head_tail_type [in Undecidability.Shared.Libs.DLW.Vec.vec]
vector.vec_decomp_type [in Undecidability.Shared.Libs.DLW.Vec.vec]
vector.x [in Undecidability.Shared.Libs.DLW.Vec.vec]
vector.X [in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_map_list.X [in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_nat_induction.HP2 [in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_nat_induction.HP1 [in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_nat_induction.HP0 [in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_nat_induction.P [in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_nat_induction.n [in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_plus.n [in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_map.vec_map_def.f [in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_map.Y [in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_map.X [in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_app_split.m [in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_app_split.n [in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_app_split.X [in Undecidability.Shared.Libs.DLW.Vec.vec]

W

wf_chains.HR [in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
wf_chains.R [in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
wf_chains.X [in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
wf_strict_order_finite.Rtrans [in Undecidability.Shared.Libs.DLW.Wf.wf_finite]
wf_strict_order_finite.Rirrefl [in Undecidability.Shared.Libs.DLW.Wf.wf_finite]
wf_strict_order_finite.R [in Undecidability.Shared.Libs.DLW.Wf.wf_finite]
wf_strict_order_finite.HX [in Undecidability.Shared.Libs.DLW.Wf.wf_finite]
wf_strict_order_finite.X [in Undecidability.Shared.Libs.DLW.Wf.wf_finite]
wf_strict_order_list.Hm [in Undecidability.Shared.Libs.DLW.Wf.wf_finite]
wf_strict_order_list.m [in Undecidability.Shared.Libs.DLW.Wf.wf_finite]
wf_strict_order_list.Rtrans [in Undecidability.Shared.Libs.DLW.Wf.wf_finite]
wf_strict_order_list.Rirrefl [in Undecidability.Shared.Libs.DLW.Wf.wf_finite]
wf_strict_order_list.R [in Undecidability.Shared.Libs.DLW.Wf.wf_finite]
wf_strict_order_list.X [in Undecidability.Shared.Libs.DLW.Wf.wf_finite]
WhileCoInduction.F [in Undecidability.TM.Combinators.While]
WhileCoInduction.F1 [in Undecidability.TM.Combinators.StateWhile]
WhileCoInduction.F2 [in Undecidability.TM.Combinators.StateWhile]
WhileCoInduction.n [in Undecidability.TM.Combinators.While]
WhileCoInduction.n [in Undecidability.TM.Combinators.StateWhile]
WhileCoInduction.R [in Undecidability.TM.Combinators.While]
WhileCoInduction.R [in Undecidability.TM.Combinators.StateWhile]
WhileCoInduction.sig [in Undecidability.TM.Combinators.While]
WhileCoInduction.sig [in Undecidability.TM.Combinators.StateWhile]
WhileCoInduction.T [in Undecidability.TM.Combinators.While]
WhileCoInduction.T [in Undecidability.TM.Combinators.StateWhile]
WhileCoInduction.T' [in Undecidability.TM.Combinators.While]
WhileCoInduction.T' [in Undecidability.TM.Combinators.StateWhile]
WhileInduction.F [in Undecidability.TM.Combinators.While]
WhileInduction.n [in Undecidability.TM.Combinators.While]
WhileInduction.R1 [in Undecidability.TM.Combinators.While]
WhileInduction.R2 [in Undecidability.TM.Combinators.While]
WhileInduction.sig [in Undecidability.TM.Combinators.While]
While.defF [in Undecidability.TM.Combinators.While]
While.F [in Undecidability.TM.Combinators.While]
While.n [in Undecidability.TM.Combinators.While]
While.pM [in Undecidability.TM.Combinators.While]
While.R [in Undecidability.TM.Combinators.While]
While.sig [in Undecidability.TM.Combinators.While]
While.While_TerminatesIn_coind.T [in Undecidability.TM.Combinators.While]
While.While_TerminatesIn.T' [in Undecidability.TM.Combinators.While]
While.While_TerminatesIn.T [in Undecidability.TM.Combinators.While]
WriteValue.cX [in Undecidability.TM.Code.WriteValue]
WriteValue.cX [in Undecidability.TM.Code.WriteValue]
WriteValue.sig [in Undecidability.TM.Code.WriteValue]
WriteValue.sig [in Undecidability.TM.Code.WriteValue]
WriteValue.X [in Undecidability.TM.Code.WriteValue]
WriteValue.X [in Undecidability.TM.Code.WriteValue]
Write_String.D [in Undecidability.TM.Compound.WriteString]
Write_String.sig [in Undecidability.TM.Compound.WriteString]

---

Library Index

A

AbstractHeapMachine
AbstractHeapMachineDef
AbstractSubstMachine
AbstractTimeHierarchyTheorem
Acceptability
acc_irr
Ackermann
Alphabets
App
Arbitrary
ArithPrelim
ARS
AutoIndTac

B

Base
BaseCode
BaseCodeSpace
BaseLists
Basic
BasicDefinitions
BasicFinTypes
Bijection
BinaryCC
BinaryCC_to_FSAT
BinNums
BinNumsAdd
BinNumsCompare
BinNumsSub
binomial
BoollistEnc
Boollist_to_Enc
bool_nat
bool_list
bounded_quantification

C

CanEnumTerm
CanEnumTerm_def
Cardinality
Cardinality
CaseBool
CaseCom
CaseFin
CaseList
CaseNat
CasePair
CaseSum
CC
CC_homomorphisms
CC_to_BinaryCC
ChangeAlphabet
Clique
ClosedLAdmissible
Code
CodeTM
Combinators
Compare
CompareValue
ComparisonTimeBoundDerivation
CompCode
Compile
compiler
Compiler
Compiler_facts
Compiler_spec
compiler_correction
Compiler_nat_facts
CompoundFinTypes
Computability
Computable
ComputableDemo
ComputableTactics
ComputableTime
Concat_Repeat
Cons_constant
CookLevin
Copy
CopySymbols
crt

D

Dec
Decidability
DecidabilityFacts
Decode
DecodeBool
DecodeList
DecodeTape
DecodeTapes
Decoding
Decompile
Definitions
Definitions
DepPairs
Duo
Dupfree

E

embed_nat
EncBoolsTM_boolList
EncodableP
EncodeBinNumbers
EncodeTapes
EncodeTapesInvariants
Encoding
Enc_to_Boollist
Enum
EnumerabilityFacts
EnumInt
EqBool
EqDec
Equality
Eval
Eval
EvalForTime
EvalForTimeBool
Extract

F

FCI
Filter
FilterFacts
Fin
finite
FiniteFunction
FiniteTypes
FinNotation
FinTypeEquiv
FinTypeForallExists
FinTypeLookup
FinTypes
fin_dec
fin_quotient
fin_choice
fin_base
fin_bij
fin_upto
Fixpoints
FlatCC
FlatCC_to_BinaryCC
FlatClique
FlatFinTypes
FlatSingleTMGenNP_to_FlatTCC
FlatTCC
FlatTCC_to_FlatCC
FlatUGraph
focus
FormulaEncoding
FSAT
FSAT_to_SAT
FunctionalDefinitions

G

gcd
GenEncode
GenericNary
GenNP
GenNPBool
GenNP_is_hard

H

HeapMachine
Hoare
HoareCombinators
HoareExamples
HoareLegacy
HoareLogic
HoareMult
HoareRegister
HoareStdLib
HoareTactics
HoareTacticsView

I

If
Infinite
InformativeDefinitions
InformativeReducibilityFacts
Inhabited
IntermediateProblems
interval
IterupN

J

JumpTargetTM

K

kSAT
kSAT_to_SAT
kSAT_to_Clique
kSAT_to_FlatClique

L

L
LambdaDepth
LargestVar
LargestVar
Lbeta
Lbeta_nonrefl
LBinNums
LBool
LClos
LClos_Eval
LComparison
LComp_to_TMComp
LDepPair
Length
LFinType
LiftAlphabet
Lifting
LiftTapes
LinTimeDecodable
ListAutomation
ListEnumerabilityFacts
Lists
ListTM
List_enc
List_fold
List_extra
List_in
List_nat
List_eqb
list_bool
List_basics
list_focus
LMBounds
LMBounds_Loop
LMGenNP
LM_heap_def
LM_heap_correct
LM_to_mTM
LNat
Lookup
LookupAssociativeListTM
LookupTM
LoopSum
LoopSum
LOptions
LowLevel
LPro
Lproc
LProd
Lrewrite
Lsimpl
LSum
LTactics
LTDbool
LTDlist
LTDnat
LTD_def
LTerm
LUnit
LVector
L_to_LM
L_facts

M

MaxList
measure_ind
Mirror
mixedTactics
Mono
Monotonic
MoreBase
MoreEnumerabilityFacts
MoreList
MorePrelim
MoveToSymbol
MoveToSymbol_niceSpec
mTM_to_singleTapeTM
Multi
MultiUnivTimeSpaceSimulation
MuRec
M_multi2mono
M_LHeapInterpreter
M_LM2TM
M2MBounds

N

NaryApp
NatSub
NatTM
NP
Nth
NTM
Null
Numbers

O

ONotation
ONotationIsAppropriate

P

Partial
php
Pigeonhole
PolyBounds
PolyTimeComputable
Por
pos
PosAddTM
PosCompareTM
PosDefinitions
PosHelperMachines
PosIncrementTM
Position
PosMultTM
PosPointers
PosShiftTM
Power
power_decomp
Prelim
Prelim
PrettyBounds
prime
Proc
ProgrammingTools
Programs
ProgramsDef
PTCC_Preludes

Q

quotient

R

ReducibilityFacts
Reflection
Relations
rel_iter
Removal
ResourceMeasures
Retracts
Rev
Rice

S

SAT
SAT_inNP
SBTM
Scott
SemiDecidabilityFacts
SequentialComposition
seteq
Seval
Shared
SharedSAT
Shift
SingleTMGenNP
SingleTMGenNP_to_TCC
Size
SizeAnalysisStep
SizeAnalysisUnfoldClos
SizeBounds
sorting
SpaceBounds
SpaceBoundsTime
sss
StateWhile
StepTM
StepTM
StringBase
subcode
Subst
SubstMachine
Subtypes
sums
Switch
Synthetic

T

Tactics
Tactics
TapeDecode
TapeFuns
TCC
TCC_to_CC
TimeHierarchyTheorem
TM
TMEncoding
TMflat
TMflatComp
TMflatEnc
TMflatFun
TMflatten
TMGenNP
TMGenNP_fixed_singleTapeTM_to_FlatFunSingleTMGenNP
TMGenNP_fixed_mTM
TMinL
TMinL_extract
TMTac
TMunflatten
TM_facts
TM_single

U

UGraph
UnboundIteration
Undecidability
UnfoldClos
UnfoldClos
UnfoldHeap
Unfolding
UnfoldTailRec
UniformHomomorphisms
Univ
UnivBounds
UnivDecTime
UnivSpaceBounds
UpToC
UpToCNary
UpToCPoly
utils
utils_tac
utils_nat
utils_list
utils_decidable
utils_string

V

vec
VectorDupfree
VectorFin
VectorPrelim
Vectors

W

wf_chains
wf_incl
wf_finite
While
WriteString
WriteValue

---

Lemma Index

A

Acc_chains [in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
Acc_irrelevance [in Undecidability.Shared.Libs.DLW.Wf.acc_irr]
Acc_eq_total [in Undecidability.Shared.Libs.DLW.Wf.acc_irr]
acc_conj_correct [in Undecidability.L.Computability.Acceptability]
Ack_pos [in Undecidability.L.Functions.Ackermann]
ACom_eqb_spec [in Complexity.L.TM.CompCode]
addC_ext_eq [in Complexity.L.Functions.BinNumsAdd]
addTR_correct [in Undecidability.TM.Code.BinNumbers.PosAddTM]
addTR_rec_correct [in Undecidability.TM.Code.BinNumbers.PosAddTM]
Add_Terminates [in Undecidability.TM.Code.NatTM]
Add_Main_Terminates [in Undecidability.TM.Code.NatTM]
Add_Loop_Terminates [in Undecidability.TM.Code.NatTM]
Add_Computes [in Undecidability.TM.Code.NatTM]
Add_Main_Realise [in Undecidability.TM.Code.NatTM]
Add_Loop_Realise [in Undecidability.TM.Code.NatTM]
Add_Step_Sem [in Undecidability.TM.Code.NatTM]
Add_N_Realise [in Undecidability.TM.Code.BinNumbers.NTM]
Add_SpecT_space [in Undecidability.TM.Hoare.HoareMult]
Add_Loop_SpecT_size [in Undecidability.TM.Hoare.HoareMult]
Add_Step_SpecT_space [in Undecidability.TM.Hoare.HoareMult]
Add_onto_Realise [in Undecidability.TM.Code.BinNumbers.PosAddTM]
Add_Realise [in Undecidability.TM.Code.BinNumbers.PosAddTM]
Add_Loop_Realise [in Undecidability.TM.Code.BinNumbers.PosAddTM]
Add_Step_Realise [in Undecidability.TM.Code.BinNumbers.PosAddTM]
Add_BaseCase_Realise [in Undecidability.TM.Code.BinNumbers.PosAddTM]
Add_SpecT_space [in Undecidability.TM.Hoare.HoareExamples]
Add_SpecT [in Undecidability.TM.Hoare.HoareExamples]
Add_Loop_SpecT_size [in Undecidability.TM.Hoare.HoareExamples]
Add_Loop_SpecT [in Undecidability.TM.Hoare.HoareExamples]
Add_Step_SpecT_space [in Undecidability.TM.Hoare.HoareExamples]
Add_Step_SpecT [in Undecidability.TM.Hoare.HoareExamples]
Add_Loop_Spec [in Undecidability.TM.Hoare.HoareExamples]
Add_Step_Spec [in Undecidability.TM.Hoare.HoareExamples]
Add'_N_Realise [in Undecidability.TM.Code.BinNumbers.NTM]
Add'_Realise [in Undecidability.TM.Code.BinNumbers.PosAddTM]
adress_size [in Complexity.L.AbstractMachines.AbstractHeapMachine]
agreement_prelude [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
agreement_sim [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
agreement_transition [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
agreement_halt [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
agreement_nonhalt [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
agreement_trans_unfold_env [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
agreement_tape [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
agreement_mti [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
agreement_mtl [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
agreement_mtr [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
allFlatCards_size_poly [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
allFlatCards_size_bound [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
allFlatCards_ofFlatType [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
allFlatCards_length_poly [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
allFlatCards_length [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
allFlatCards_poly [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
allFlatCards_time_bound [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
allPairsOfEdges_decb_poly [in Complexity.NP.Clique.FlatClique]
allPairsOfEdges_decb_time_bound [in Complexity.NP.Clique.FlatClique]
allPairsOfEdges_decb_iff [in Complexity.NP.Clique.FlatClique]
allPositions_poly [in Complexity.NP.Clique.kSAT_to_FlatClique]
allPositions_time_bound [in Complexity.NP.Clique.kSAT_to_FlatClique]
allPositions_sound [in Complexity.NP.Clique.kSAT_to_FlatClique]
allSameEntry_poly [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
allSameEntry_time_bound [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
allSameEntry_time_le [in Complexity.L.TM.TMflatComp]
allSameEntry_spec [in Complexity.L.TM.TMunflatten]
allSub [in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
all_vec_correct2 [in Undecidability.TM.Compound.TMTac]
all_vec_correct [in Undecidability.TM.Compound.TMTac]
and_compat [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
appCross_dupfree [in Undecidability.L.Computability.Enum]
appCross_app [in Undecidability.L.Computability.Enum]
appCross_correct [in Undecidability.L.Computability.Enum]
appendNil [in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
append_bit_removeLSB [in Undecidability.TM.Code.BinNumbers.PosDefinitions]
append_bits_bit [in Undecidability.TM.Code.BinNumbers.PosDefinitions]
apply_to_equiv' [in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
apply_to_cons [in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
app_closed [in Undecidability.L.Util.L_facts]
app_converges [in Undecidability.L.Computability.Seval]
app_comm_cons' [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
app_singleton_inv_nil [in Undecidability.TM.Code.BinNumbers.EncodeBinNumbers]
app_singleton_inv [in Undecidability.TM.Code.BinNumbers.EncodeBinNumbers]
app_cons_neq [in Undecidability.TM.Code.CompareValue]
app_eq_proper [in Undecidability.L.Tactics.Lbeta_nonrefl]
App_Com_Terminates [in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
App_Com_Realise [in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
App_ACom_Terminates [in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
App_ACom_Realise [in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
app_fold5 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
App_Const_simpl [in Undecidability.L.Complexity.GenericNary]
App_eqn_3 [in Undecidability.L.Complexity.GenericNary]
App_eqn_2 [in Undecidability.L.Complexity.GenericNary]
App_eqn_1 [in Undecidability.L.Complexity.GenericNary]
app_seperate [in Undecidability.TM.Code.Code]
app_incl_R [in Undecidability.Shared.ListAutomation]
app_incl_l [in Undecidability.Shared.ListAutomation]
APP_right_Spec [in Undecidability.TM.L.CompilerBoolFuns.Compiler]
App_SpecT [in Undecidability.TM.Code.List.App]
App_Terminates [in Undecidability.TM.Code.List.App]
App_Realise [in Undecidability.TM.Code.List.App]
app_or_nil [in Undecidability.TM.Code.List.App]
app_singleton [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
app_length_split [in Complexity.Libs.CookPrelim.MorePrelim]
app_eq_length [in Complexity.Libs.CookPrelim.MorePrelim]
App'_steps_nice [in Complexity.TM.PrettyBounds.BaseCode]
App'_steps_nice [in Undecidability.TM.Code.List.App]
App'_SpecT [in Undecidability.TM.Code.List.App]
App'_Terminates [in Undecidability.TM.Code.List.App]
App'_Realise [in Undecidability.TM.Code.List.App]
asPointwise [in Undecidability.TM.Hoare.HoareLogic]
assgn_varsIn_restrict [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
assgn_varsIn_monotonic [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
assgn_varsIn_app [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
assignment_small_size [in Complexity.NP.SAT.SAT_inNP]
atBit_ext [in Undecidability.TM.Code.BinNumbers.PosPointers]
atBit_moveLeft_atHSB [in Undecidability.TM.Code.BinNumbers.PosPointers]
atBit_moveLeft_cons [in Undecidability.TM.Code.BinNumbers.PosPointers]
atBit_moveRight [in Undecidability.TM.Code.BinNumbers.PosPointers]
atBit_moveRight_cons [in Undecidability.TM.Code.BinNumbers.PosPointers]
atBit_writeMove_movedToLeft [in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
atHSB_ext [in Undecidability.TM.Code.BinNumbers.PosPointers]
atHSB_moveLeft_contains [in Undecidability.TM.Code.BinNumbers.PosPointers]
atLSB_ext [in Undecidability.TM.Code.BinNumbers.PosPointers]
atLSB_moveRight_contains_rev [in Undecidability.TM.Code.BinNumbers.PosPointers]
atStart_contains [in Undecidability.TM.Single.StepTM]
A1p [in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
A2p [in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
A3p [in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
A4p [in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]

B

base_p_uniq [in Undecidability.Shared.Libs.DLW.Utils.prime]
base_p_spec [in Undecidability.Shared.Libs.DLW.Utils.prime]
beta_red [in Undecidability.TM.L.CompilerBoolFuns.NaryApp]
bezout_sc [in Undecidability.Shared.Libs.DLW.Utils.gcd]
bezout_nc [in Undecidability.Shared.Libs.DLW.Utils.gcd]
BinaryCC_to_FSAT [in Complexity.NP.SAT.CookLevin]
BinaryCC_enc_size [in Complexity.NP.SAT.CookLevin.Subproblems.BinaryCC]
BinaryCC_instances_equivalent [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
BinaryCC_instances_wf_equivalent [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
BinaryCC_to_FSAT_poly [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
BinaryCC_wf_dec_poly [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
BinaryCC_wf_dec_time_bound [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
BinaryCC_to_FSAT [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
BinaryCC_wf_dec_correct [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
binary_le_sum_powers_inv [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
binary_le_sum_powers [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
binary_le_power_inv [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
binary_power_split [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
binary_le_mult_power2_inv [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
binary_le_joins_inv' [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
binary_le_joins_inv [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
binary_le_join_inv [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
binary_le_nat_meet [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
binary_le_trans [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
binary_le_eq_lb_mask [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
binary_le_lb_mask [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
binary_le_zero [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
binary_le_zero_inv [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
binary_le_le [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
binary_le_refl [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
binary_le_inv [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
binomial_pascal [in Undecidability.Shared.Libs.DLW.Utils.binomial]
binomial_0n [in Undecidability.Shared.Libs.DLW.Utils.binomial]
binomial_spec [in Undecidability.Shared.Libs.DLW.Utils.binomial]
binomial_sym [in Undecidability.Shared.Libs.DLW.Utils.binomial]
binomial_le [in Undecidability.Shared.Libs.DLW.Utils.binomial]
binomial_thm [in Undecidability.Shared.Libs.DLW.Utils.binomial]
binomial_nn [in Undecidability.Shared.Libs.DLW.Utils.binomial]
binomial_gt [in Undecidability.Shared.Libs.DLW.Utils.binomial]
binomial_n1 [in Undecidability.Shared.Libs.DLW.Utils.binomial]
binomial_SS [in Undecidability.Shared.Libs.DLW.Utils.binomial]
binomial_n0 [in Undecidability.Shared.Libs.DLW.Utils.binomial]
binomial_lt_power [in Undecidability.Shared.Libs.DLW.Utils.sums]
binomial_le_power [in Undecidability.Shared.Libs.DLW.Utils.sums]
binomial_Newton [in Undecidability.Shared.Libs.DLW.Utils.sums]
bin_add_eq_0x0 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
bin_add_eq_00x [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
bits_to_pos_to_bits [in Undecidability.TM.Code.BinNumbers.PosDefinitions]
bits_to_pos_to_bits' [in Undecidability.TM.Code.BinNumbers.PosDefinitions]
bits_to_pos_cons [in Undecidability.TM.Code.BinNumbers.PosDefinitions]
bits_to_pos'_cons [in Undecidability.TM.Code.BinNumbers.PosDefinitions]
BoollistToEnc.Realise [in Undecidability.TM.L.Transcode.Boollist_to_Enc]
BoollistToEnc.Realise__loop [in Undecidability.TM.L.Transcode.Boollist_to_Enc]
BoollistToEnc.Realise__step [in Undecidability.TM.L.Transcode.Boollist_to_Enc]
BoollistToEnc.SpecT [in Undecidability.TM.L.Transcode.Boollist_to_Enc]
BoollistToEnc._Terminates [in Undecidability.TM.L.Transcode.Boollist_to_Enc]
BoollistToEnc._Terminates__loop [in Undecidability.TM.L.Transcode.Boollist_to_Enc]
BoollistToEnc._Terminates__step [in Undecidability.TM.L.Transcode.Boollist_to_Enc]
boollist_enum.boollists_enum_term [in Complexity.NP.L.CanEnumTerm]
boollist_enum.boollist_term_size [in Complexity.NP.L.CanEnumTerm]
boollist_enum.pro_to_boollist_size [in Complexity.NP.L.CanEnumTerm]
boollist_enum.boollist_term_inv [in Complexity.NP.L.CanEnumTerm]
boollist_enum.boollist_term_inv' [in Complexity.NP.L.CanEnumTerm]
boollist_enum._term_boollist_term [in Complexity.NP.L.CanEnumTerm]
boollist_size [in Undecidability.TM.L.Transcode.BoollistEnc]
Boollist2encBoolsTM.loop_SpecT [in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
Boollist2encBoolsTM.Realise [in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
Boollist2encBoolsTM.SpecT [in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
bool_nat [in Undecidability.Shared.Libs.PSL.Prelim]
bool_Prop_false' [in Undecidability.Shared.Libs.PSL.Prelim]
bool_Prop_true' [in Undecidability.Shared.Libs.PSL.Prelim]
bool_Prop_false [in Undecidability.Shared.Libs.PSL.Prelim]
bool_Prop_true [in Undecidability.Shared.Libs.PSL.Prelim]
bool_enum_ok [in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicFinTypes]
bool_encode_prefixInjective [in Complexity.TM.Code.DecodeBool]
bool_encode_injective [in Complexity.TM.Code.DecodeBool]
bool_enc_inv_correct [in Undecidability.L.Computability.Computability]
bool2nat2bool [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
boundary_eqb_spec [in Complexity.L.TM.CompCode]
boundb_spec [in Undecidability.L.Functions.Proc]
bounded_min_d [in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
bounded_choose_d [in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
bounded_search_ni [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
bounded_min [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
bounded_search [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
bound_closed [in Undecidability.L.Util.L_facts]
bound_gt [in Undecidability.L.Util.L_facts]
bound_ge [in Undecidability.L.Util.L_facts]
bound_closed_k [in Undecidability.L.Util.L_facts]
bound_unfolds_id [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
bound_unfolds_id [in Complexity.L.AbstractMachines.AbstractHeapMachine]

C

canEnumTerms_compPoly [in Complexity.NP.L.CanEnumTerm_def]
canonicalHom_is_unique [in Complexity.Libs.UniformHomomorphisms]
canonicalHom_is_homomorphism [in Complexity.Libs.UniformHomomorphisms]
canonical_uniform_homo [in Complexity.Libs.UniformHomomorphisms]
Canonical_TerminatesIn [in Undecidability.TM.Util.TM_facts]
Canonical_Realise [in Undecidability.TM.Util.TM_facts]
cards_list_ind_coversHead_agree [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
card_incl [in Complexity.Libs.Pigeonhole]
card_rem_eq [in Complexity.Libs.Pigeonhole]
card_nel_eq [in Complexity.Libs.Pigeonhole]
card_el_eq [in Complexity.Libs.Pigeonhole]
card_length [in Complexity.Libs.Pigeonhole]
card_length_leq [in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
card_or [in Undecidability.Shared.Libs.PSL.Lists.Cardinality]
card_lt [in Undecidability.Shared.Libs.PSL.Lists.Cardinality]
card_equi [in Undecidability.Shared.Libs.PSL.Lists.Cardinality]
card_ex [in Undecidability.Shared.Libs.PSL.Lists.Cardinality]
card_0 [in Undecidability.Shared.Libs.PSL.Lists.Cardinality]
card_cons_rem [in Undecidability.Shared.Libs.PSL.Lists.Cardinality]
card_eq [in Undecidability.Shared.Libs.PSL.Lists.Cardinality]
card_le [in Undecidability.Shared.Libs.PSL.Lists.Cardinality]
card_not_in_rem [in Undecidability.Shared.Libs.PSL.Lists.Cardinality]
card_in_rem [in Undecidability.Shared.Libs.PSL.Lists.Cardinality]
card_cons' [in Undecidability.Shared.Libs.PSL.Lists.Cardinality]
card_cons [in Undecidability.Shared.Libs.PSL.Lists.Cardinality]
CaseBool_SpecT_size [in Undecidability.TM.Code.CaseBool]
CaseBool_Sem [in Undecidability.TM.Code.CaseBool]
CaseChar_SpecTReg [in Undecidability.TM.Hoare.HoareStdLib]
CaseCom_SpecT_size [in Undecidability.TM.L.CaseCom]
CaseCom_Sem [in Undecidability.TM.L.CaseCom]
CaseFin_SpecT_size [in Undecidability.TM.Code.CaseFin]
CaseFin_Sem [in Undecidability.TM.Code.CaseFin]
CaseList_steps_cons_nice [in Complexity.TM.PrettyBounds.BaseCode]
CaseList_steps_nil_nice [in Complexity.TM.PrettyBounds.BaseCode]
CaseList_steps_nice [in Complexity.TM.PrettyBounds.BaseCode]
CaseList_size1_CasePair_size0_Reset_size_nice [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
CaseList_SpecT_size [in Undecidability.TM.Code.CaseList]
CaseList_Terminates [in Undecidability.TM.Code.CaseList]
CaseList_Realise [in Undecidability.TM.Code.CaseList]
CaseList_size1_Reset_nice [in Complexity.TM.PrettyBounds.BaseCodeSpace]
CaseList_size0_Reset_nice [in Complexity.TM.PrettyBounds.BaseCodeSpace]
CaseList_size1_nice' [in Complexity.TM.PrettyBounds.BaseCodeSpace]
CaseList_size1_nice [in Complexity.TM.PrettyBounds.BaseCodeSpace]
CaseList_size0_nice [in Complexity.TM.PrettyBounds.BaseCodeSpace]
CaseNat_steps_nice [in Complexity.TM.PrettyBounds.BaseCode]
CaseNat_SpecT_size [in Undecidability.TM.Code.CaseNat]
CaseNat_Sem [in Undecidability.TM.Code.CaseNat]
CaseNat_size_nice [in Complexity.TM.PrettyBounds.BaseCodeSpace]
CaseNat_Spec [in Undecidability.TM.Hoare.HoareExamples]
CaseNat_SpecT [in Undecidability.TM.Hoare.HoareExamples]
CaseNat_SpecT_size [in Undecidability.TM.Hoare.HoareExamples]
CaseN_Sem [in Undecidability.TM.Code.BinNumbers.NTM]
CaseOption_steps_nice [in Complexity.TM.PrettyBounds.BaseCode]
CaseOption_SpecT_size [in Undecidability.TM.Code.CaseSum]
CaseOption_Sem [in Undecidability.TM.Code.CaseSum]
CasePair_steps_nice [in Complexity.TM.PrettyBounds.BaseCode]
CasePair_size0_Reset_nice [in Complexity.TM.PrettyBounds.BaseCodeSpace]
CasePair_size1_Reset_nice [in Complexity.TM.PrettyBounds.BaseCodeSpace]
CasePair_size1_nice' [in Complexity.TM.PrettyBounds.BaseCodeSpace]
CasePair_size1_nice [in Complexity.TM.PrettyBounds.BaseCodeSpace]
CasePair_size0_nice [in Complexity.TM.PrettyBounds.BaseCodeSpace]
CasePair_SpecT_size [in Undecidability.TM.Code.CasePair]
CasePair_Terminates [in Undecidability.TM.Code.CasePair]
CasePair_Realise [in Undecidability.TM.Code.CasePair]
CaseSum_steps_nice [in Complexity.TM.PrettyBounds.BaseCode]
CaseSum_SpecT_size [in Undecidability.TM.Code.CaseSum]
CaseSum_Sem [in Undecidability.TM.Code.CaseSum]
cast_registeredAs_TimeComplexity [in Undecidability.L.Tactics.ComputableTime]
cast_computableTime [in Undecidability.L.Tactics.ComputableTactics]
cast_computable [in Undecidability.L.Tactics.ComputableTactics]
cast_registeredAs [in Undecidability.L.Tactics.Computable]
CCCards_poly [in Complexity.NP.SAT.CookLevin.Reductions.FlatTCC_to_FlatCC]
CCCard_ofFlatType_dec_poly [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
CCCard_ofFlatType_dec_time_bound [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
CCCard_of_size_dec_time_bound [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
CCCard_enc_size [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
CCCard_ofFlatType_dec_correct [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
CCCard_of_size_dec_correct [in Complexity.NP.SAT.CookLevin.Subproblems.CC]
CC_homomorphism_inst_iff [in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
CC_homomorphism_iff [in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
CC_cards_time_bound [in Complexity.NP.SAT.CookLevin.Reductions.FlatTCC_to_FlatCC]
CC_to_BinaryCC [in Complexity.NP.SAT.CookLevin.Reductions.CC_to_BinaryCC]
CC_homomorphism_wf [in Complexity.NP.SAT.CookLevin.Reductions.CC_to_BinaryCC]
CC_wf_dec_correct [in Complexity.NP.SAT.CookLevin.Subproblems.CC]
cfind [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
chain_list_app_inv [in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
chain_list_cons_inv [in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
chain_list_nil_inv [in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
chain_list_inv [in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
chain_list_app [in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
chain_list_chain [in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
chain_chain_list [in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
chain_snoc_inv [in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
chain_plus_inv [in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
chain_snoc [in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
chain_plus [in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
chain_inv_S [in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
chain_inv_0 [in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
chain_bounded [in Undecidability.Shared.Libs.DLW.Wf.wf_finite]
chain_list_incl [in Undecidability.Shared.Libs.DLW.Wf.wf_finite]
chain_irrefl [in Undecidability.Shared.Libs.DLW.Wf.wf_finite]
chain_trans [in Undecidability.Shared.Libs.DLW.Wf.wf_finite]
ChangeAlphabet_SpecT_space_pre [in Undecidability.TM.Hoare.HoareRegister]
ChangeAlphabet_Spec_space_pre [in Undecidability.TM.Hoare.HoareRegister]
ChangeAlphabet_SpecT_space_pre_post [in Undecidability.TM.Hoare.HoareRegister]
ChangeAlphabet_Spec_space_pre_post [in Undecidability.TM.Hoare.HoareRegister]
ChangeAlphabet_SpecT_pre [in Undecidability.TM.Hoare.HoareRegister]
ChangeAlphabet_Spec_pre [in Undecidability.TM.Hoare.HoareRegister]
ChangeAlphabet_SpecT_pre_post [in Undecidability.TM.Hoare.HoareRegister]
ChangeAlphabet_Spec_pre_post [in Undecidability.TM.Hoare.HoareRegister]
ChangeAlphabet_SpecT [in Undecidability.TM.Hoare.HoareRegister]
ChangeAlphabet_Spec [in Undecidability.TM.Hoare.HoareRegister]
ChangeAlphabet_Spec_ex [in Undecidability.TM.Hoare.HoareRegister]
CheckEncodesBoolList.Realises'__step [in Complexity.TM.Code.DecodeList]
CheckEncodesBoolList.Realise' [in Complexity.TM.Code.DecodeList]
CheckEncodesBoolList.SpecT [in Complexity.TM.Code.DecodeList]
CheckEncodesBoolList.Terminates' [in Complexity.TM.Code.DecodeList]
CheckEncodesBoolList.Terminates'__step [in Complexity.TM.Code.DecodeList]
CheckEncodesBool.RealisesIn [in Complexity.TM.Code.DecodeBool]
CheckEncodesBool.RealisesIn' [in Complexity.TM.Code.DecodeBool]
CheckEncodesTapes.iter_transitive [in Complexity.TM.Single.DecodeTapes]
CheckEncodesTapes.length_right_tape_move_right [in Complexity.TM.Single.DecodeTapes]
CheckEncodesTapes.Realise [in Complexity.TM.Single.DecodeTapes]
CheckEncodesTapes.Realises_intern [in Complexity.TM.Single.DecodeTapes]
CheckEncodesTapes.R_syntactic__spec [in Complexity.TM.Single.DecodeTapes]
CheckEncodesTapes.Terminates [in Complexity.TM.Single.DecodeTapes]
CheckEncodesTape.f_spec [in Complexity.TM.Single.DecodeTape]
CheckEncodesTape.f'_spec [in Complexity.TM.Single.DecodeTape]
CheckEncodesTape.Realise [in Complexity.TM.Single.DecodeTape]
CheckEncodesTape.Realises_intern [in Complexity.TM.Single.DecodeTape]
CheckEncodesTape.Realises__step [in Complexity.TM.Single.DecodeTape]
CheckEncodesTape.Terminates [in Complexity.TM.Single.DecodeTape]
CheckEncodesTape.Terminates__step [in Complexity.TM.Single.DecodeTape]
CheckTapeContains.Realise [in Complexity.TM.Code.Decode]
CheckTapeContains.Terminates [in Complexity.TM.Code.Decode]
church_rosser [in Undecidability.L.Util.L_facts]
clause_size_total_enc_bound [in Complexity.NP.SAT.SAT_inNP]
clause_size_enc_bound [in Complexity.NP.SAT.SAT_inNP]
clause_maxVar_size_enc_bound [in Complexity.NP.SAT.SAT_inNP]
clause_enc_size_bound [in Complexity.NP.SAT.SAT_inNP]
clause_varsIn_bound [in Complexity.NP.SAT.SAT_inNP]
clause_maxVar_varsIn [in Complexity.NP.SAT.SAT_inNP]
clause_sat_rep3 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
Clique_complete [in Complexity.NP.SAT.CookLevin]
clique_unflatten [in Complexity.NP.Clique.FlatClique]
clique_flatten [in Complexity.NP.Clique.FlatClique]
clique_flat_agree [in Complexity.NP.Clique.FlatClique]
clique_vertex_for_all_clauses [in Complexity.NP.Clique.kSAT_to_Clique]
closedb_spec [in Undecidability.L.Functions.Proc]
closed_dcl_x [in Undecidability.L.Util.L_facts]
closed_star [in Undecidability.L.Util.L_facts]
closed_step [in Undecidability.L.Util.L_facts]
closed_subst [in Undecidability.L.Util.L_facts]
closed_app [in Undecidability.L.Util.L_facts]
closed_dcl [in Undecidability.L.Util.L_facts]
closed_k_bound [in Undecidability.L.Util.L_facts]
closed_compiler_helper [in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
clR [in Undecidability.L.Tactics.Lbeta_nonrefl]
clR' [in Undecidability.L.Tactics.Lbeta_nonrefl]
cnfGetLiteral_size [in Complexity.NP.Clique.kSAT_to_FlatClique]
cnfGetLiteral_poly [in Complexity.NP.Clique.kSAT_to_FlatClique]
cnfGetLiteral_time_bound [in Complexity.NP.Clique.kSAT_to_FlatClique]
cnf_size_total_enc_bound [in Complexity.NP.SAT.SAT_inNP]
cnf_maxVar_size_enc_bound [in Complexity.NP.SAT.SAT_inNP]
cnf_size_enc_bound [in Complexity.NP.SAT.SAT_inNP]
cnf_enc_size_bound [in Complexity.NP.SAT.SAT_inNP]
cnf_varsIn_bound [in Complexity.NP.SAT.SAT_inNP]
cnf_maxVar_varsIn [in Complexity.NP.SAT.SAT_inNP]
cnf_maxVar_app [in Complexity.NP.SAT.SAT_inNP]
cnf_varsIn_monotonic [in Complexity.NP.SAT.SAT]
cnf_varsIn_app [in Complexity.NP.SAT.SAT]
cnf_sat_rep3 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
comb_proc_red [in Undecidability.L.Util.L_facts]
CompareValues_steps_nice [in Complexity.TM.PrettyBounds.BaseCode]
CompareValues_TerminatesIn [in Undecidability.TM.Code.CompareValue]
CompareValues_Realise [in Undecidability.TM.Code.CompareValue]
CompareValue_Spec [in Undecidability.TM.Code.CompareValue]
CompareValue_Spec_size [in Undecidability.TM.Code.CompareValue]
CompareValue_SpecT [in Undecidability.TM.Code.CompareValue]
CompareValue_SpecT_size [in Undecidability.TM.Code.CompareValue]
Compare_Realise [in Undecidability.TM.Code.BinNumbers.PosCompareTM]
Compare_Loop_Realise [in Undecidability.TM.Code.BinNumbers.PosCompareTM]
Compare_Step_Realise [in Undecidability.TM.Code.BinNumbers.PosCompareTM]
Compare_Move_steps_midtape2 [in Undecidability.TM.Compound.Compare]
Compare_Move_steps_midtape1 [in Undecidability.TM.Compound.Compare]
Compare_steps_correct_midtape [in Undecidability.TM.Compound.Compare]
Compare_steps_correct [in Undecidability.TM.Compound.Compare]
Compare_correct_long_midtape [in Undecidability.TM.Compound.Compare]
Compare_correct_short_midtape [in Undecidability.TM.Compound.Compare]
Compare_correct_short [in Undecidability.TM.Compound.Compare]
Compare_correct_swap [in Undecidability.TM.Compound.Compare]
Compare_correct_neq_midtape [in Undecidability.TM.Compound.Compare]
Compare_correct_neq [in Undecidability.TM.Compound.Compare]
Compare_correct_eq_midtape [in Undecidability.TM.Compound.Compare]
Compare_correct_eq [in Undecidability.TM.Compound.Compare]
compare_lists [in Undecidability.TM.Compound.Compare]
Compare_TerminatesIn [in Undecidability.TM.Compound.Compare]
Compare_steps_ge [in Undecidability.TM.Compound.Compare]
Compare_Realise [in Undecidability.TM.Compound.Compare]
Compare_Step_Sem [in Undecidability.TM.Compound.Compare]
CompBeta_sound [in Undecidability.L.Tactics.LClos_Eval]
CompBeta_validComp [in Undecidability.L.Tactics.LClos_Eval]
compiler_complete' [in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
compiler_complete [in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
compiler_complete_step [in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
compiler_sound [in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
compiler_subcode [in Undecidability.Shared.Libs.DLW.Code.compiler]
compiler_length [in Undecidability.Shared.Libs.DLW.Code.compiler]
compiler_correct [in Undecidability.TM.L.CompilerBoolFuns.Compiler]
compileTR_correct [in Complexity.L.AbstractMachines.FlatPro.Computable.Compile]
compileTR'_fuel_leq_size [in Complexity.L.AbstractMachines.FlatPro.Computable.Compile]
compileTR'_correct [in Complexity.L.AbstractMachines.FlatPro.Computable.Compile]
compile_enc_size [in Complexity.L.AbstractMachines.FlatPro.Computable.Compile]
compile_inj_retT [in Undecidability.L.AbstractMachines.FlatPro.Programs]
compile_neq_nil [in Undecidability.L.AbstractMachines.FlatPro.Programs]
compile_inj [in Undecidability.L.AbstractMachines.FlatPro.Programs]
completeness [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
completeness [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
completenessInformative' [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
completenessTime [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
completenessTimeInformative [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
completeness' [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
complete_induction [in Undecidability.Shared.Libs.PSL.Numbers]
complete__decInTime [in Complexity.Complexity.Definitions]
composed_permutation_S [in Undecidability.Shared.Libs.DLW.Utils.sorting]
composed_permutation_extends [in Undecidability.Shared.Libs.DLW.Utils.sorting]
composed_permutation_ext [in Undecidability.Shared.Libs.DLW.Utils.sorting]
compressAssignment_cnf_equiv [in Complexity.NP.SAT.SAT_inNP]
compressAssignment_var_eq [in Complexity.NP.SAT.SAT_inNP]
compressAssignment_small [in Complexity.NP.SAT.SAT_inNP]
CompSeval_sound [in Undecidability.L.Tactics.LClos_Eval]
CompSeval_sound' [in Undecidability.L.Tactics.LClos_Eval]
CompSeval_validComp [in Undecidability.L.Tactics.LClos_Eval]
computableExt [in Undecidability.L.Tactics.Computable]
computableTimeExt [in Undecidability.L.Tactics.ComputableTime]
computableTime_timeLeq [in Undecidability.L.Tactics.ComputableTime]
computableTime_computable [in Undecidability.L.Tactics.ComputableTime]
computesExpStart [in Undecidability.L.Tactics.Computable]
computesExpStep [in Undecidability.L.Tactics.Computable]
computesExt [in Undecidability.L.Tactics.Computable]
computesProc [in Undecidability.L.Tactics.Computable]
computesTimeExpStart [in Undecidability.L.Tactics.ComputableTime]
computesTimeExpStep [in Undecidability.L.Tactics.ComputableTime]
computesTimeExt [in Undecidability.L.Tactics.ComputableTime]
computesTimeIfStart [in Undecidability.L.Tactics.ComputableTime]
computesTimeProc [in Undecidability.L.Tactics.ComputableTime]
computesTimeTyArr_helper [in Undecidability.L.Tactics.ComputableTime]
computesTimeTyB [in Undecidability.L.Tactics.ComputableTime]
computesTime_timeLeq [in Undecidability.L.Tactics.ComputableTime]
computesTime_computes_intern [in Undecidability.L.Tactics.ComputableTime]
computesTime_evalLe [in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
computesTyArr [in Undecidability.L.Tactics.Computable]
computesTyB [in Undecidability.L.Tactics.Computable]
comp_length [in Undecidability.Shared.Libs.DLW.Code.compiler]
comp_app [in Undecidability.Shared.Libs.DLW.Code.compiler]
ConcatRepeat.Realise [in Undecidability.TM.Code.List.Concat_Repeat]
ConcatRepeat.Realise__step [in Undecidability.TM.Code.List.Concat_Repeat]
ConcatRepeat._Terminates [in Undecidability.TM.Code.List.Concat_Repeat]
ConcatRepeat._Terminates__step [in Undecidability.TM.Code.List.Concat_Repeat]
concat_repeat_repeat [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
concat_poly [in Complexity.Libs.CookPrelim.PolyBounds]
concat_time_bound [in Complexity.Libs.CookPrelim.PolyBounds]
concat_time_exp [in Complexity.Libs.CookPrelim.PolyBounds]
concat_eq_inv_borderL [in Complexity.NP.TM.M_multi2mono]
confluence [in Undecidability.L.Util.L_facts]
confluent_CR [in Undecidability.L.Prelim.ARS]
ConsClos_Terminates [in Undecidability.TM.L.HeapInterpreter.StepTM]
ConsClos_Realise [in Undecidability.TM.L.HeapInterpreter.StepTM]
Consequence [in Undecidability.TM.Hoare.HoareLogic]
ConsequenceT [in Undecidability.TM.Hoare.HoareLogic]
ConsequenceT_pre [in Undecidability.TM.Hoare.HoareLogic]
ConsequenceT_post [in Undecidability.TM.Hoare.HoareLogic]
Consequence_post [in Undecidability.TM.Hoare.HoareLogic]
Consequence_pre [in Undecidability.TM.Hoare.HoareLogic]
constructive_dep_choice [in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
constructive_choice' [in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
constructive_choice [in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
Constr_None_steps_nice [in Complexity.TM.PrettyBounds.BaseCode]
Constr_Some_steps_nice [in Complexity.TM.PrettyBounds.BaseCode]
Constr_inr_steps_nice [in Complexity.TM.PrettyBounds.BaseCode]
Constr_inl_steps_nice [in Complexity.TM.PrettyBounds.BaseCode]
Constr_pair_steps_nice [in Complexity.TM.PrettyBounds.BaseCode]
Constr_S_steps_nice [in Complexity.TM.PrettyBounds.BaseCode]
Constr_O_steps_nice [in Complexity.TM.PrettyBounds.BaseCode]
Constr_cons_steps_nice [in Complexity.TM.PrettyBounds.BaseCode]
Constr_nil_steps_nice [in Complexity.TM.PrettyBounds.BaseCode]
Constr_nil_SpecT_size [in Undecidability.TM.Code.CaseList]
Constr_cons_SpecT_size [in Undecidability.TM.Code.CaseList]
Constr_cons_Terminates [in Undecidability.TM.Code.CaseList]
Constr_cons_Realise [in Undecidability.TM.Code.CaseList]
Constr_nil_Sem [in Undecidability.TM.Code.CaseList]
Constr_S_SpecT_size [in Undecidability.TM.Code.CaseNat]
Constr_O_SpecT_size [in Undecidability.TM.Code.CaseNat]
Constr_O_Sem [in Undecidability.TM.Code.CaseNat]
Constr_S_Sem [in Undecidability.TM.Code.CaseNat]
Constr_N0_Sem [in Undecidability.TM.Code.BinNumbers.NTM]
Constr_pair_size_nice [in Complexity.TM.PrettyBounds.BaseCodeSpace]
Constr_cons_size_nice [in Complexity.TM.PrettyBounds.BaseCodeSpace]
Constr_S_size_nice [in Complexity.TM.PrettyBounds.BaseCodeSpace]
Constr_None_SpecT_size [in Undecidability.TM.Code.CaseSum]
Constr_Some_SpecT_size [in Undecidability.TM.Code.CaseSum]
Constr_inr_SpecT_size [in Undecidability.TM.Code.CaseSum]
Constr_inl_SpecT_size [in Undecidability.TM.Code.CaseSum]
Constr_None_Sem [in Undecidability.TM.Code.CaseSum]
Constr_Some_Sem [in Undecidability.TM.Code.CaseSum]
Constr_inr_Sem [in Undecidability.TM.Code.CaseSum]
Constr_inl_Sem [in Undecidability.TM.Code.CaseSum]
Constr_varT_SpecT_size [in Undecidability.TM.L.CaseCom]
Constr_varT_Sem [in Undecidability.TM.L.CaseCom]
Constr_ACom_Sem [in Undecidability.TM.L.CaseCom]
Constr_pair_SpecT_size [in Undecidability.TM.Code.CasePair]
Constr_pair_Terminates [in Undecidability.TM.Code.CasePair]
Constr_pair_Realise [in Undecidability.TM.Code.CasePair]
Constr_S_Spec_con [in Undecidability.TM.Hoare.HoareExamples]
Constr_S_Spec [in Undecidability.TM.Hoare.HoareExamples]
Constr_S_SpecT [in Undecidability.TM.Hoare.HoareExamples]
Constr_S_SpecT_size [in Undecidability.TM.Hoare.HoareExamples]
Constr_O_Spec [in Undecidability.TM.Hoare.HoareExamples]
Constr_O_SpecT [in Undecidability.TM.Hoare.HoareExamples]
Constr_O_SpecT_size [in Undecidability.TM.Hoare.HoareExamples]
Constr_S_Spec_pure [in Undecidability.TM.Hoare.HoareExamples]
Constr_S_SpecT_pure [in Undecidability.TM.Hoare.HoareExamples]
Constr_O_Spec_pure [in Undecidability.TM.Hoare.HoareExamples]
Constr_O_SpecT_pure [in Undecidability.TM.Hoare.HoareExamples]
const_at [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
Const_eqn_2 [in Undecidability.L.Complexity.GenericNary]
Const_eqn_1 [in Undecidability.L.Complexity.GenericNary]
cons_incll [in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
Cons_constant.SpecT [in Undecidability.TM.Code.List.Cons_constant]
Cons_constant.Terminates [in Undecidability.TM.Code.List.Cons_constant]
Cons_constant.Realise [in Undecidability.TM.Code.List.Cons_constant]
cons_injective [in Undecidability.TM.Code.Code]
cons_incl [in Undecidability.Shared.ListAutomation]
ContainsEncoding.functional_true [in Complexity.TM.Code.Decode]
ContainsEncoding.legacy_iff [in Complexity.TM.Code.Decode]
containsState_size_containsState [in Undecidability.TM.Univ.LowLevel]
containsState_size_hasSize [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
containsTrans_size_containsTrans [in Undecidability.TM.Univ.LowLevel]
containsTrans_size_hasSize [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
containsWorkingTape_doAct [in Undecidability.TM.Univ.LowLevel]
containsWorkingTape_current [in Undecidability.TM.Univ.LowLevel]
containsWorkingTape_iff [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
contains_moveRight_atHSB [in Undecidability.TM.Code.BinNumbers.PosPointers]
contains_rev_moveLeft_atLSB [in Undecidability.TM.Code.BinNumbers.PosPointers]
contains_conf_MU'_contains_conf_MU'_size [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
contains_conf_MU_size0_nice [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
contains_conf_MU_size_eq [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
contains_conf_MU_size_contains_conf_MU [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
contains_conf_MU'_size_contains_conf_MU' [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
contains_conf_Univ_size_contains_conf_Univ [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
contains_tapes_iff [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
contains_tapes_injective [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
contains_tapes_inj [in Complexity.NP.TM.M_multi2mono]
contains_translate_eq [in Undecidability.TM.Code.ChangeAlphabet]
contains_size_translate_eq [in Undecidability.TM.Code.ChangeAlphabet]
contains_translate_tau [in Undecidability.TM.Code.ChangeAlphabet]
contains_size_translate_tau [in Undecidability.TM.Code.ChangeAlphabet]
contains_translate_tau2 [in Undecidability.TM.Code.ChangeAlphabet]
contains_size_translate_tau2 [in Undecidability.TM.Code.ChangeAlphabet]
contains_translate_tau1 [in Undecidability.TM.Code.ChangeAlphabet]
contains_size_translate_tau1 [in Undecidability.TM.Code.ChangeAlphabet]
contains_translate_sig [in Undecidability.TM.Code.ChangeAlphabet]
contains_size_translate_sig [in Undecidability.TM.Code.ChangeAlphabet]
contradiction_dec_bipredicate [in Complexity.NP.Clique.kSAT_to_Clique]
converges_equiv [in Undecidability.L.Util.L_facts]
CookLevin [in Complexity.NP.SAT.CookLevin]
CookLevin0 [in Complexity.NP.SAT.CookLevin]
CopyChar_Sem [in Undecidability.TM.Compound.Multi]
CopySymbols_L_Terminates [in Undecidability.TM.Compound.CopySymbols]
CopySymbols_steps_mirror [in Undecidability.TM.Compound.CopySymbols]
CopySymbols_L_Realise [in Undecidability.TM.Compound.CopySymbols]
CopySymbols_mirror' [in Undecidability.TM.Compound.CopySymbols]
CopySymbols_mirror [in Undecidability.TM.Compound.CopySymbols]
CopySymbols_Terminates [in Undecidability.TM.Compound.CopySymbols]
CopySymbols_Realise [in Undecidability.TM.Compound.CopySymbols]
CopySymbols_true [in Undecidability.TM.Compound.CopySymbols]
CopySymbols_false [in Undecidability.TM.Compound.CopySymbols]
CopySymbols_Step_Sem [in Undecidability.TM.Compound.CopySymbols]
CopySymbols_L_steps_moveleft [in Undecidability.TM.Code.Copy]
CopySymbols_L_steps_midtape [in Undecidability.TM.Code.Copy]
CopySymbols_L_steps_local [in Undecidability.TM.Code.Copy]
CopySymbols_steps_moveright [in Undecidability.TM.Code.Copy]
CopySymbols_steps_midtape [in Undecidability.TM.Code.Copy]
CopySymbols_steps_local [in Undecidability.TM.Code.Copy]
CopySymbols_L_correct_moveleft [in Undecidability.TM.Code.Copy]
CopySymbols_L_correct_midtape [in Undecidability.TM.Code.Copy]
CopySymbols_L_correct [in Undecidability.TM.Code.Copy]
CopySymbols_correct_moveright [in Undecidability.TM.Code.Copy]
CopySymbols_correct_midtape [in Undecidability.TM.Code.Copy]
CopySymbols_correct [in Undecidability.TM.Code.Copy]
CopyValue_steps_nice [in Complexity.TM.PrettyBounds.BaseCode]
CopyValue_size_nice' [in Complexity.TM.PrettyBounds.BaseCodeSpace]
CopyValue_size_nice [in Complexity.TM.PrettyBounds.BaseCodeSpace]
CopyValue_Spec [in Undecidability.TM.Code.Copy]
CopyValue_Spec_size [in Undecidability.TM.Code.Copy]
CopyValue_SpecT [in Undecidability.TM.Code.Copy]
CopyValue_SpecT_size [in Undecidability.TM.Code.Copy]
CopyValue_Terminates [in Undecidability.TM.Code.Copy]
CopyValue_Realise [in Undecidability.TM.Code.Copy]
CopyValue_SpecT [in Undecidability.TM.Hoare.HoareExamples]
CopyValue_SpecT_size [in Undecidability.TM.Hoare.HoareExamples]
correctSpace [in Complexity.L.AbstractMachines.AbstractSubstMachine]
correctSpace' [in Complexity.L.AbstractMachines.AbstractSubstMachine]
correctTime [in Complexity.L.AbstractMachines.AbstractSubstMachine]
correctTime [in Complexity.L.AbstractMachines.AbstractHeapMachine]
correctTime' [in Complexity.L.AbstractMachines.AbstractSubstMachine]
correctTime' [in Complexity.L.AbstractMachines.AbstractHeapMachine]
countApp [in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
countDupfree [in Undecidability.Shared.Libs.PSL.Vectors.VectorDupfree]
countIn [in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
countMap [in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
countMapZero [in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
countMap_zero [in Undecidability.TM.Code.Code]
countMap_injective [in Undecidability.TM.Code.Code]
countSplit [in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
countZero [in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
count_in_equiv [in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
count_replace [in Undecidability.Shared.Libs.PSL.Vectors.VectorDupfree]
count0_notIn' [in Undecidability.Shared.Libs.PSL.Vectors.VectorDupfree]
count0_notIn [in Undecidability.Shared.Libs.PSL.Vectors.VectorDupfree]
coversAt_coversHeadInd_rem_at_end [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
coversAt_coversHeadInd_add_at_end [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
coversAt_HeadList_add_at_end [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
coversAt_step [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
coversAt_head [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
coversAt_step [in Complexity.NP.SAT.CookLevin.Subproblems.CC]
coversAt_head [in Complexity.NP.SAT.CookLevin.Subproblems.CC]
coversHeadInd_congruent [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
coversHeadInd_monotonous [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
coversHeadInd_append_invariant [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
coversHeadInd_rem_tail [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
coversHeadInd_tail_invariant [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
coversHeadInd_single [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
coversHeadList_flat_agree [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
coversHeadList_subset [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
coversHead_homomorphism2 [in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
coversHead_homomorphism_iff [in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
coversHead_card_inv [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
coversHead_length_inv [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
coversHead_flat_agree [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
coversHead_length_inv [in Complexity.NP.SAT.CookLevin.Subproblems.CC]
covHeadSim_unique_left [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
covHeadSim_halt [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
covHeadSim_trans [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
covHeadSim_tape_polarityRev [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
covHeadSim_tape [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
covHeadTrans_tape' [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
covHead_tape_sim [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
CPow_trans [in Undecidability.L.Tactics.LClos]
CPow_congR [in Undecidability.L.Tactics.LClos]
CPow_congL [in Undecidability.L.Tactics.LClos]
CRT [in Undecidability.Shared.Libs.DLW.Utils.crt]
CRT_informative [in Undecidability.Shared.Libs.DLW.Utils.crt]
CRT_bin_informative [in Undecidability.Shared.Libs.DLW.Utils.crt]
cumul_spec [in Undecidability.Synthetic.ListEnumerabilityFacts]
cumul_spec__T [in Undecidability.Synthetic.ListEnumerabilityFacts]
cumul_In [in Undecidability.Synthetic.ListEnumerabilityFacts]
cum_ge' [in Undecidability.Synthetic.ListEnumerabilityFacts]
cum_ge [in Undecidability.Synthetic.ListEnumerabilityFacts]
current_chars_surjectTapes [in Undecidability.TM.Lifting.LiftAlphabet]
current_chars_mirror_tapes [in Undecidability.TM.Combinators.Mirror]
current_charsFlat_eq [in Complexity.L.TM.TMflatFun]
current_chars_select [in Undecidability.TM.Lifting.LiftTapes]
c_surj [in Undecidability.L.Computability.Enum]
c_c_inv [in Undecidability.L.Computability.Enum]
C_longenough [in Undecidability.L.Computability.Enum]
C_exhaustive [in Undecidability.L.Computability.Enum]
C_ge [in Undecidability.L.Computability.Enum]
C_S [in Undecidability.L.Computability.Enum]
C_nondec_correct [in Undecidability.L.Functions.EnumInt]
C27 [in Undecidability.L.Computability.Scott]
C27_proc [in Undecidability.L.Computability.Scott]

D

decibable_PER_fp_quotient [in Undecidability.Shared.Libs.DLW.Utils.fin_quotient]
decidable_EQUIV_fin_quotient [in Undecidability.Shared.Libs.DLW.Utils.fin_quotient]
decidable_complement_semi_decidable [in Undecidability.Synthetic.SemiDecidabilityFacts]
decidable_semi_decidable [in Undecidability.Synthetic.SemiDecidabilityFacts]
decidable_sinc [in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
decidable_iff [in Undecidability.Synthetic.DecidabilityFacts]
decInTime_equiv [in Complexity.Complexity.Definitions]
deClos_correct [in Undecidability.L.Tactics.LClos]
deClos_validEnv [in Undecidability.L.Tactics.LClos]
deClos_valComp [in Undecidability.L.Tactics.LClos]
decompile_resSize [in Undecidability.L.AbstractMachines.FlatPro.Programs]
decompile_correct [in Undecidability.L.AbstractMachines.FlatPro.Programs]
decompile_correct' [in Undecidability.L.AbstractMachines.FlatPro.Programs]
dec_transfer [in Undecidability.Shared.Libs.PSL.EqDec]
dec_DM_impl [in Undecidability.Shared.Libs.PSL.EqDec]
dec_DM_and [in Undecidability.Shared.Libs.PSL.EqDec]
dec_DN [in Undecidability.Shared.Libs.PSL.EqDec]
Dec_false' [in Undecidability.Shared.Libs.PSL.EqDec]
Dec_true' [in Undecidability.Shared.Libs.PSL.EqDec]
Dec_false [in Undecidability.Shared.Libs.PSL.EqDec]
Dec_true [in Undecidability.Shared.Libs.PSL.EqDec]
Dec_auto_not [in Undecidability.Shared.Libs.PSL.EqDec]
Dec_auto [in Undecidability.Shared.Libs.PSL.EqDec]
Dec_reflect_eq [in Undecidability.Shared.Libs.PSL.EqDec]
Dec_reflect [in Undecidability.Shared.Libs.PSL.EqDec]
dec_count_enum' [in Undecidability.Synthetic.EnumerabilityFacts]
dec_count_enum [in Undecidability.Synthetic.EnumerabilityFacts]
dec_reflect_remove [in Undecidability.L.Functions.EqBool]
dec_ldec [in Undecidability.L.Computability.Decidability]
dec_acc [in Undecidability.L.Computability.Acceptability]
dec_lacc [in Undecidability.L.Computability.Acceptability]
dec_disj [in Undecidability.Synthetic.DecidabilityFacts]
dec_conj [in Undecidability.Synthetic.DecidabilityFacts]
dec_compl [in Undecidability.Synthetic.DecidabilityFacts]
dec_decidable' [in Undecidability.Synthetic.DecidabilityFacts]
dec_transfer [in Undecidability.Shared.Dec]
dec_DM_impl [in Undecidability.Shared.Dec]
dec_DM_and [in Undecidability.Shared.Dec]
dec_DN [in Undecidability.Shared.Dec]
Dec_false [in Undecidability.Shared.Dec]
Dec_true [in Undecidability.Shared.Dec]
Dec_auto [in Undecidability.Shared.Dec]
Dec_reflect [in Undecidability.Shared.Dec]
dec_P [in Undecidability.L.Computability.MuRec]
dec_enc [in Undecidability.L.Datatypes.LNat]
dec_red [in Undecidability.Synthetic.ReducibilityFacts]
delimC_reprEl [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
denoteTerm_correct [in Undecidability.L.Tactics.Reflection]
destruct_vector_cons [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
destruct_vector_nil [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
destruct_tapes1 [in Undecidability.TM.Single.StepTM]
destruct_vector1 [in Undecidability.TM.PrettyBounds.SizeBounds]
diamond_to_confluent [in Undecidability.L.Prelim.ARS]
diamond_to_semi_confluent [in Undecidability.L.Prelim.ARS]
discrete_list [in Undecidability.Synthetic.DecidabilityFacts]
discrete_option [in Undecidability.Synthetic.DecidabilityFacts]
discrete_sum [in Undecidability.Synthetic.DecidabilityFacts]
discrete_prod [in Undecidability.Synthetic.DecidabilityFacts]
discrete_nat_nat [in Undecidability.Synthetic.DecidabilityFacts]
discrete_nat [in Undecidability.Synthetic.DecidabilityFacts]
discrete_bool [in Undecidability.Synthetic.DecidabilityFacts]
discrete_iff [in Undecidability.Synthetic.DecidabilityFacts]
disjoint_symm [in Undecidability.L.Computability.Enum]
disjoint_app [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
disjoint_cons [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
disjoint_nil' [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
disjoint_nil [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
disjoint_incl [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
disjoint_symm [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
disjoint_forall [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
disjoint_concat [in Undecidability.Shared.Libs.PSL.FiniteTypes.Cardinality]
Diverge_Realise [in Undecidability.TM.Compound.Multi]
divides_bool_spec' [in Undecidability.Shared.Libs.DLW.Utils.prime]
divides_bool_spec [in Undecidability.Shared.Libs.DLW.Utils.prime]
divides_fact [in Undecidability.Shared.Libs.DLW.Utils.binomial]
divides_fact_S [in Undecidability.Shared.Libs.DLW.Utils.binomial]
divides_n_fact_n [in Undecidability.Shared.Libs.DLW.Utils.binomial]
divides_rem_congr [in Undecidability.Shared.Libs.DLW.Utils.gcd]
divides_rem_rem [in Undecidability.Shared.Libs.DLW.Utils.gcd]
divides_dec [in Undecidability.Shared.Libs.DLW.Utils.gcd]
divides_rem_eq [in Undecidability.Shared.Libs.DLW.Utils.gcd]
divides_div [in Undecidability.Shared.Libs.DLW.Utils.gcd]
divides_is_gcd [in Undecidability.Shared.Libs.DLW.Utils.gcd]
divides_mult_inv_l [in Undecidability.Shared.Libs.DLW.Utils.gcd]
divides_fact [in Undecidability.Shared.Libs.DLW.Utils.gcd]
divides_mult_inv [in Undecidability.Shared.Libs.DLW.Utils.gcd]
divides_le [in Undecidability.Shared.Libs.DLW.Utils.gcd]
divides_plus_inv [in Undecidability.Shared.Libs.DLW.Utils.gcd]
divides_plus [in Undecidability.Shared.Libs.DLW.Utils.gcd]
divides_minus [in Undecidability.Shared.Libs.DLW.Utils.gcd]
divides_mult_compat [in Undecidability.Shared.Libs.DLW.Utils.gcd]
divides_mult_r [in Undecidability.Shared.Libs.DLW.Utils.gcd]
divides_mult [in Undecidability.Shared.Libs.DLW.Utils.gcd]
divides_2_inv [in Undecidability.Shared.Libs.DLW.Utils.gcd]
divides_1_inv [in Undecidability.Shared.Libs.DLW.Utils.gcd]
divides_1 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
divides_0_inv [in Undecidability.Shared.Libs.DLW.Utils.gcd]
divides_0 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
divides_trans [in Undecidability.Shared.Libs.DLW.Utils.gcd]
divides_anti [in Undecidability.Shared.Libs.DLW.Utils.gcd]
divides_refl [in Undecidability.Shared.Libs.DLW.Utils.gcd]
division_by_even [in Undecidability.Shared.Libs.DLW.Utils.gcd]
div_2_bool2nat [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
div_2_fix_2 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
div_2_fix_1 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
div_2_fix_0 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
div_by_p_lt [in Undecidability.Shared.Libs.DLW.Utils.gcd]
div_ge_1 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
div_of_0 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
div_eq_0 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
div_prop [in Undecidability.Shared.Libs.DLW.Utils.gcd]
div_rem_uniq [in Undecidability.Shared.Libs.DLW.Utils.gcd]
div_rem_spec2 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
div_rem_spec1 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
div_full [in Undecidability.Shared.Libs.DLW.Utils.gcd]
div2_spec [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
DM_exists [in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
DM_notAll [in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
DM_exists [in Undecidability.Shared.Libs.PSL.Prelim]
DM_or [in Undecidability.Shared.Libs.PSL.Prelim]
DoActions_steps_nice [in Complexity.TM.PrettyBounds.M2MBounds]
DoActions_Loop_steps_cons_nice [in Complexity.TM.PrettyBounds.M2MBounds]
DoActions_Loop_steps_cons_asym_bounded [in Complexity.TM.PrettyBounds.M2MBounds]
DoActions_Loop_steps_cons_asym_bounded' [in Complexity.TM.PrettyBounds.M2MBounds]
DoActions_Loop_steps_cons_asym_monotone [in Complexity.TM.PrettyBounds.M2MBounds]
DoActions_Loop_steps_cons_asym_bounded'' [in Complexity.TM.PrettyBounds.M2MBounds]
DoActions_Loop_steps_cons_asym2_bounded [in Complexity.TM.PrettyBounds.M2MBounds]
DoActions_Loop_steps_cons_nice'' [in Complexity.TM.PrettyBounds.M2MBounds]
DoActions_Step_steps_cons_nice [in Complexity.TM.PrettyBounds.M2MBounds]
DoActions_Step_steps_cons_nice' [in Complexity.TM.PrettyBounds.M2MBounds]
DoActions_Step_steps_cons_nice'' [in Complexity.TM.PrettyBounds.M2MBounds]
DoActions_Terminates [in Undecidability.TM.Single.StepTM]
DoActions_Realise [in Undecidability.TM.Single.StepTM]
DoActions_Loop_Terminates [in Undecidability.TM.Single.StepTM]
DoActions_Loop_Realise [in Undecidability.TM.Single.StepTM]
DoActions_Step_Terminates [in Undecidability.TM.Single.StepTM]
DoActions_Step_Realise [in Undecidability.TM.Single.StepTM]
DoAction_steps_nice [in Complexity.TM.PrettyBounds.M2MBounds]
DoAction_steps_nice' [in Complexity.TM.PrettyBounds.M2MBounds]
DoAction_Terminates [in Undecidability.TM.Single.StepTM]
DoAction_Realise [in Undecidability.TM.Single.StepTM]
DoAction_Sem [in Undecidability.TM.Univ.LowLevel]
DoAction'_Sem [in Undecidability.TM.Univ.LowLevel]
DoAction'_SpecT_space [in Undecidability.TM.Univ.Univ]
doAct_size'' [in Complexity.TM.PrettyBounds.M2MBounds]
doAct_size' [in Complexity.TM.PrettyBounds.M2MBounds]
doAct_size [in Complexity.TM.PrettyBounds.M2MBounds]
doAct_surject [in Undecidability.TM.Lifting.LiftAlphabet]
doAct_mirror_multi [in Undecidability.TM.Combinators.Mirror]
doAct_mirror [in Undecidability.TM.Combinators.Mirror]
DoAct_Sem [in Undecidability.TM.Basic.Mono]
doAct_validFlatTape_Some [in Complexity.L.TM.TMflatComp]
doAct_validFlatTape_None [in Complexity.L.TM.TMflatComp]
doAct_map [in Undecidability.TM.Univ.LowLevel]
doAct_multiFlat [in Complexity.L.TM.TMflatFun]
doAct_select [in Undecidability.TM.Lifting.LiftTapes]
doAct_nop [in Undecidability.TM.Util.TM_facts]
DoAct_SpecTReg [in Undecidability.TM.Hoare.HoareStdLib]
dominatedWith_match_move [in Complexity.TM.PrettyBounds.M2MBounds]
dominatedWith_match_tape [in Complexity.TM.PrettyBounds.M2MBounds]
dominatedWith_add_split [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds_Loop]
dominatedWith_match_Tok [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
dominatedWith_cube [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
dominatedWith_mult3 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
dominatedWith_quad [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
dominatedWith_mult [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
dominatedWith_S''' [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
dominatedWith_add' [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
dominatedWith_refl [in Complexity.TM.PrettyBounds.PrettyBounds]
dominatedWith_mono_c [in Complexity.TM.PrettyBounds.PrettyBounds]
dominatedWith_match_bool [in Complexity.TM.PrettyBounds.PrettyBounds]
dominatedWith_match_sumbool [in Complexity.TM.PrettyBounds.PrettyBounds]
dominatedWith_match_option [in Complexity.TM.PrettyBounds.PrettyBounds]
dominatedWith_match_nat [in Complexity.TM.PrettyBounds.PrettyBounds]
dominatedWith_match_list [in Complexity.TM.PrettyBounds.PrettyBounds]
dominatedWith_match_list' [in Complexity.TM.PrettyBounds.PrettyBounds]
dominatedWith_trans [in Complexity.TM.PrettyBounds.PrettyBounds]
dominatedWith_S'' [in Complexity.TM.PrettyBounds.PrettyBounds]
dominatedWith_S' [in Complexity.TM.PrettyBounds.PrettyBounds]
dominatedWith_S [in Complexity.TM.PrettyBounds.PrettyBounds]
dominatedWith_solve [in Complexity.TM.PrettyBounds.PrettyBounds]
dominatedWith_const [in Complexity.TM.PrettyBounds.PrettyBounds]
dominatedWith_mult_r [in Complexity.TM.PrettyBounds.PrettyBounds]
dominatedWith_mult_l [in Complexity.TM.PrettyBounds.PrettyBounds]
dominatedWith_mult [in Complexity.TM.PrettyBounds.PrettyBounds]
dominatedWith_add_r [in Complexity.TM.PrettyBounds.PrettyBounds]
dominatedWith_add_l [in Complexity.TM.PrettyBounds.PrettyBounds]
dominatedWith_add [in Complexity.TM.PrettyBounds.PrettyBounds]
DoMove_Sem [in Undecidability.TM.Single.StepTM]
double_sum_powers_ortho [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
Downlift_withSpace [in Undecidability.TM.Hoare.HoareRegister]
DoWrite_steps_nice [in Complexity.TM.PrettyBounds.M2MBounds]
DoWrite_steps_nice' [in Complexity.TM.PrettyBounds.M2MBounds]
DoWrite_Terminates [in Undecidability.TM.Single.StepTM]
DoWrite_Realise [in Undecidability.TM.Single.StepTM]
duoton_incl [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
dupfreeb_poly [in Complexity.Libs.CookPrelim.PolyBounds]
dupfreeb_time_bound [in Complexity.Libs.CookPrelim.PolyBounds]
dupfreeb_iff [in Undecidability.L.Datatypes.List.List_in]
dupfreeb_correct [in Undecidability.L.Datatypes.List.List_in]
dupfreeCount [in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
dupfree_not_rep [in Complexity.Libs.Pigeonhole]
dupfree_T [in Undecidability.L.Computability.Enum]
dupfree_elAt [in Undecidability.Shared.Libs.PSL.Lists.Position]
dupfree_dedup [in Complexity.NP.SAT.SAT_inNP]
dupfree_in_power [in Undecidability.Shared.Libs.PSL.Lists.Power]
dupfree_power [in Undecidability.Shared.Libs.PSL.Lists.Power]
dupfree_Nodup [in Undecidability.Shared.Libs.PSL.Lists.Dupfree]
dupfree_undup [in Undecidability.Shared.Libs.PSL.Lists.Dupfree]
dupfree_card [in Undecidability.Shared.Libs.PSL.Lists.Dupfree]
dupfree_dec [in Undecidability.Shared.Libs.PSL.Lists.Dupfree]
dupfree_concat [in Undecidability.Shared.Libs.PSL.Lists.Dupfree]
dupfree_filter [in Undecidability.Shared.Libs.PSL.Lists.Dupfree]
dupfree_map [in Undecidability.Shared.Libs.PSL.Lists.Dupfree]
dupfree_app [in Undecidability.Shared.Libs.PSL.Lists.Dupfree]
dupfree_cons [in Undecidability.Shared.Libs.PSL.Lists.Dupfree]
dupfree_nth_injective [in Undecidability.Shared.Libs.PSL.Vectors.VectorDupfree]
dupfree_map_injective [in Undecidability.Shared.Libs.PSL.Vectors.VectorDupfree]
dupfree_tabulate_injective [in Undecidability.Shared.Libs.PSL.Vectors.VectorDupfree]
dupfree_replace [in Undecidability.Shared.Libs.PSL.Vectors.VectorDupfree]
dupfree_cons [in Undecidability.Shared.Libs.PSL.Vectors.VectorDupfree]
dupfree_concat [in Undecidability.Shared.Libs.PSL.FiniteTypes.Cardinality]
dupfree_length [in Undecidability.Shared.Libs.PSL.FiniteTypes.Cardinality]
dupfree_elements [in Undecidability.Shared.Libs.PSL.FiniteTypes.Cardinality]
dupfree_countOne [in Undecidability.Shared.Libs.PSL.FiniteTypes.Cardinality]
dupfree_map_getPosition [in Complexity.Libs.CookPrelim.MorePrelim]
dupfree_nthe [in Complexity.Libs.CookPrelim.MorePrelim]

E

ecl_sym [in Undecidability.L.Prelim.ARS]
ecl_trans [in Undecidability.L.Prelim.ARS]
Ecnf_dec [in Complexity.NP.Clique.kSAT_to_Clique]
Ecnf_symm [in Complexity.NP.Clique.kSAT_to_Clique]
elAt_el [in Undecidability.Shared.Libs.PSL.Lists.Position]
elAt_app [in Undecidability.Shared.Libs.PSL.Lists.Position]
elem_spec [in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
eliminateOR_enc_size_bound [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
eliminateOR_poly [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
eliminateOR_time_bound [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
eliminateOR_maxVar_eq [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
eliminateOR_varsIn [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
eliminateOR_size [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
eliminateOR_FSAT_equiv [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
eliminateOR_eval [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
el_elAt [in Undecidability.Shared.Libs.PSL.Lists.Position]
el_pos [in Undecidability.Shared.Libs.PSL.Lists.Position]
embedP [in Undecidability.Shared.embed_nat]
Empty_set_enum_ok [in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicFinTypes]
encBoolsL_inj [in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
encBoolsTM_inj [in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
encBoolsTM2boollist.loop_SpecT [in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
encBoolsTM2boollist.Realise [in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
encBoolsTM2boollist.SpecT [in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
encBools_nat_TM [in Undecidability.TM.L.CompilerBoolFuns.Compiler_nat_facts]
encodeCardAt_size [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
encodeCardAt_varsIn [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
encodeCardAt_poly [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
encodeCardAt_time_bound [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
encodeCardAt_encodesPredicate [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
encodeCardsAt_size [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
encodeCardsAt_varsIn [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
encodeCardsAt_poly [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
encodeCardsAt_time_bound [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
encodeCardsAt_encodesPredicate [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
encodeCardsInAllLines_size [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
encodeCardsInAllLines_varsIn [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
encodeCardsInAllLines_poly [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
encodeCardsInAllLines_time_bound [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
encodeCardsInAllLines_encodesPredicate [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
encodeCardsInLineP_size [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
encodeCardsInLineP_varsIn [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
encodeCardsInLineP_poly [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
encodeCardsInLineP_time_bound [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
encodeCardsInLineP_time_bound1 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
encodeCardsInLineP_encodesPredicate [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
encodeCardsInLineP_stepindex_monotone [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
encodeCardsInLineP_stepindex_monotone' [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
encodeCardsInLineP1_poly [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
encodeCardsInLine_size [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
encodeCardsInLine_varsIn [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
encodeCardsInLine_poly [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
encodeCardsInLine_time_bound [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
encodeCardsInLine_encodesPredicate [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
encodeFinalConstraint_size [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
encodeFinalConstraint_varsIn [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
encodeFinalConstraint_poly [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
encodeFinalConstraint_time_bound [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
encodeFinalConstraint_encodesPredicate' [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
encodeFinalConstraint_encodesPredicate [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
encodeListAt_size [in Complexity.NP.SAT.FSAT.FormulaEncoding]
encodeListAt_varsIn [in Complexity.NP.SAT.FSAT.FormulaEncoding]
encodeListAt_poly [in Complexity.NP.SAT.FSAT.FormulaEncoding]
encodeListAt_time_bound [in Complexity.NP.SAT.FSAT.FormulaEncoding]
encodeListAt_encodesPredicate [in Complexity.NP.SAT.FSAT.FormulaEncoding]
encodeList_size_nil [in Complexity.TM.PrettyBounds.BaseCode]
encodeList_size_cons [in Complexity.TM.PrettyBounds.BaseCode]
encodeList_size_app_eq [in Complexity.TM.PrettyBounds.BaseCode]
encodeList_size_app [in Complexity.TM.PrettyBounds.BaseCode]
encodeLiteral_varsIn [in Complexity.NP.SAT.FSAT.FormulaEncoding]
encodeLiteral_size [in Complexity.NP.SAT.FSAT.FormulaEncoding]
encodeLiteral_encodesPredicate [in Complexity.NP.SAT.FSAT.FormulaEncoding]
encodeLiteral_correct [in Complexity.NP.SAT.FSAT.FormulaEncoding]
encodesPredicateAt_extensional [in Complexity.NP.SAT.FSAT.FormulaEncoding]
encodesPredicate_listAnd_map [in Complexity.NP.SAT.FSAT.FormulaEncoding]
encodesPredicate_listOr_map [in Complexity.NP.SAT.FSAT.FormulaEncoding]
encodesPredicate_listAnd_tabulate [in Complexity.NP.SAT.FSAT.FormulaEncoding]
encodesPredicate_listOr_tabulate [in Complexity.NP.SAT.FSAT.FormulaEncoding]
encodesPredicate_or [in Complexity.NP.SAT.FSAT.FormulaEncoding]
encodesPredicate_and [in Complexity.NP.SAT.FSAT.FormulaEncoding]
encodeSubstringInLineP_size [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
encodeSubstringInLineP_varsIn [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
encodeSubstringInLineP_poly [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
encodeSubstringInLineP_time_bound [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
encodeSubstringInLineP_poly1 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
encodeSubstringInLineP_time_bound1 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
encodeSubstringInLineP_encodesPredicate [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
encodeSubstringInLineP_stepindex_monotone [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
encodeSubstringInLineP_stepindex_monotone' [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
encodeSubstringInLine_size [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
encodeSubstringInLine_varsIn [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
encodeSubstringInLine_encodesPredicate [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
encodeTableau_enc_size [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
encodeTableau_size [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
encodeTableau_varsIn [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
encodeTableau_poly [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
encodeTableau_time_bound [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
encodeTableau_encodesPredicate [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
Encode_list_hasSize_ge_length [in Complexity.TM.PrettyBounds.M2MBounds]
Encode_tapes_size_fold [in Complexity.TM.PrettyBounds.M2MBounds]
Encode_tapes_hasSize [in Complexity.TM.PrettyBounds.M2MBounds]
Encode_list_hasSize_el [in Complexity.TM.PrettyBounds.BaseCode]
Encode_option_hasSize_ge1 [in Complexity.TM.PrettyBounds.BaseCode]
Encode_nat_hasSize_ge1 [in Complexity.TM.PrettyBounds.BaseCode]
Encode_pair_hasSize_ge1 [in Complexity.TM.PrettyBounds.BaseCode]
Encode_graph_hasSize_ge2 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
Encode_list_hasSize_ge2 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
Encode_graph_y_hasSize [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
Encode_graph_x_hasSize [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
Encode_state_hasSize [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
Encode_action_hasSize [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
encode_pushHSB [in Undecidability.TM.Code.BinNumbers.PosDefinitions]
Encode_positive_eq_pos_to_bits [in Undecidability.TM.Code.BinNumbers.PosDefinitions]
encode_bits_to_pos [in Undecidability.TM.Code.BinNumbers.PosDefinitions]
encode_bits_to_pos' [in Undecidability.TM.Code.BinNumbers.PosDefinitions]
encode_append_bits [in Undecidability.TM.Code.BinNumbers.PosDefinitions]
Encode_positive_app_xIO [in Undecidability.TM.Code.BinNumbers.PosDefinitions]
Encode_positive_app_xO [in Undecidability.TM.Code.BinNumbers.PosDefinitions]
Encode_positive_app_xI [in Undecidability.TM.Code.BinNumbers.PosDefinitions]
Encode_list_hasSize_ge_length [in Complexity.TM.PrettyBounds.UnivBounds]
Encode_list_hasSize_gt_length [in Complexity.TM.PrettyBounds.UnivBounds]
Encode_Heap_hasSize_ge1 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
Encode_HEntr_hasSize_ge1 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
Encode_Clos_hasSize_ge1 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
Encode_Clos_hasSize' [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
Encode_Clos_hasSize [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
Encode_Heap_hasSize_ge_length [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
Encode_Pro_hasSize_ge_length [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
Encode_Pro_hasSize_ge1 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
Encode_Com_hasSize_ge1 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
Encode_N_hasSize [in Undecidability.TM.Code.BinNumbers.EncodeBinNumbers]
Encode_positive_startsWith_xH [in Undecidability.TM.Code.BinNumbers.EncodeBinNumbers]
Encode_positive_injective [in Undecidability.TM.Code.BinNumbers.EncodeBinNumbers]
Encode_positive_eq_nil [in Undecidability.TM.Code.BinNumbers.EncodeBinNumbers]
Encode_positive_hasSize [in Undecidability.TM.Code.BinNumbers.EncodeBinNumbers]
encode_tape_invariants_partial [in Complexity.TM.Single.EncodeTapesInvariants]
encode_tape_invariants [in Complexity.TM.Single.EncodeTapesInvariants]
Encode_tapes_hasSize_le_sizeOfmTapes [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
Encode_tapes_hasSize [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
Encode_tape_hasSize_le [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
Encode_tape_hasSize [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
Encode_Com_hasSize [in Undecidability.TM.L.Alphabets]
Encode_nat_injective [in Undecidability.TM.Code.Code]
Encode_nat_eq_nil [in Undecidability.TM.Code.Code]
Encode_nat_hasSize [in Undecidability.TM.Code.Code]
Encode_list_injective [in Undecidability.TM.Code.Code]
encode_list_injective [in Undecidability.TM.Code.Code]
encode_list_eq_nil [in Undecidability.TM.Code.Code]
Encode_list_hasSize_app [in Undecidability.TM.Code.Code]
Encode_list_hasSize_ge1 [in Undecidability.TM.Code.Code]
Encode_list_hasSize_skipn [in Undecidability.TM.Code.Code]
Encode_list_hasSize [in Undecidability.TM.Code.Code]
Encode_list_remove [in Undecidability.TM.Code.Code]
encode_list_remove [in Undecidability.TM.Code.Code]
Encode_list_neq_nil [in Undecidability.TM.Code.Code]
encode_list_neq_nil [in Undecidability.TM.Code.Code]
Encode_list_app [in Undecidability.TM.Code.Code]
encode_list_app [in Undecidability.TM.Code.Code]
encode_list_concat [in Undecidability.TM.Code.Code]
Encode_option_injective [in Undecidability.TM.Code.Code]
Encode_option_hasSize [in Undecidability.TM.Code.Code]
Encode_pair_injective [in Undecidability.TM.Code.Code]
Encode_pair_hasSize [in Undecidability.TM.Code.Code]
Encode_sum_injective [in Undecidability.TM.Code.Code]
Encode_sum_hasSize [in Undecidability.TM.Code.Code]
Encode_map_comp [in Undecidability.TM.Code.Code]
Encode_map_id [in Undecidability.TM.Code.Code]
Encode_map_injective [in Undecidability.TM.Code.Code]
Encode_map_hasSize [in Undecidability.TM.Code.Code]
Encode_Finite_injective [in Undecidability.TM.Code.Code]
Encode_Finite_hasSize [in Undecidability.TM.Code.Code]
Encode_Fin_injective [in Undecidability.TM.Code.Code]
Encode_Fin_hasSize [in Undecidability.TM.Code.Code]
Encode_bool_injective [in Undecidability.TM.Code.Code]
Encode_bool_hasSize [in Undecidability.TM.Code.Code]
Encode_unit_injective [in Undecidability.TM.Code.Code]
Encode_unit_hasSize [in Undecidability.TM.Code.Code]
Encode_positive_tl_bits [in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
Encode_positive_is_xH [in Undecidability.TM.Code.BinNumbers.PosShiftTM]
EncToBoollist.SpecT [in Undecidability.TM.L.Transcode.Enc_to_Boollist]
EncToBoollist.SpecT__loop [in Undecidability.TM.L.Transcode.Enc_to_Boollist]
EncToBoollist.SpecT__step [in Undecidability.TM.L.Transcode.Enc_to_Boollist]
enc_sig_exist_eq [in Complexity.L.Datatypes.LDepPair]
enc_sig_eq [in Complexity.L.Datatypes.LDepPair]
enc_vector_eq [in Undecidability.L.Datatypes.LVector]
enc_finType_eq [in Undecidability.L.Datatypes.LFinType]
enc_extinj [in Undecidability.L.Computability.Computability]
enc_bool_perElem_size [in Undecidability.TM.L.Transcode.BoollistEnc]
enc_boollist_helper [in Undecidability.TM.L.Transcode.BoollistEnc]
enc_bool_explicit [in Undecidability.TM.L.Transcode.BoollistEnc]
EndTheorem1 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
EndTheorem2 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
EntailsE [in Undecidability.TM.Hoare.HoareLogic]
Entails_iff [in Undecidability.TM.Hoare.HoareLogic]
enumerable_enumerable_T [in Undecidability.Synthetic.EnumerabilityFacts]
enumerable_semi_decidable [in Undecidability.Synthetic.EnumerabilityFacts]
enumerable_conj [in Undecidability.Synthetic.MoreEnumerabilityFacts]
enumerable_disj [in Undecidability.Synthetic.MoreEnumerabilityFacts]
enumerable_enum [in Undecidability.Synthetic.MoreEnumerabilityFacts]
enumerable_enum [in Undecidability.Synthetic.ListEnumerabilityFacts]
enumerable_conj [in Undecidability.Synthetic.ListEnumerabilityFacts]
enumerable_list [in Undecidability.Synthetic.ListEnumerabilityFacts]
enumerable__T_list_enumerable [in Undecidability.Synthetic.ListEnumerabilityFacts]
enumerable_list_enumerable [in Undecidability.Synthetic.ListEnumerabilityFacts]
enumerable_red [in Undecidability.Synthetic.ReducibilityFacts]
enumerator_enumerable [in Undecidability.Synthetic.EnumerabilityFacts]
enumerator__T_option [in Undecidability.Synthetic.EnumerabilityFacts]
enumerator__T_prod [in Undecidability.Synthetic.EnumerabilityFacts]
enumerator__T_bool [in Undecidability.Synthetic.EnumerabilityFacts]
enumerator__T_unit [in Undecidability.Synthetic.EnumerabilityFacts]
enumerator__T_nat [in Undecidability.Synthetic.EnumerabilityFacts]
enumerator__T_list [in Undecidability.Synthetic.ListEnumerabilityFacts]
enumerator_to_list_enumerator [in Undecidability.Synthetic.ListEnumerabilityFacts]
enum_quotient [in Undecidability.Shared.Libs.DLW.Utils.quotient]
enum_quotient_rec [in Undecidability.Shared.Libs.DLW.Utils.quotient]
enum_ok_fromList [in Undecidability.Shared.Libs.PSL.FiniteTypes.Arbitrary]
enum_enumT [in Undecidability.Synthetic.ListEnumerabilityFacts]
enum_red [in Undecidability.Synthetic.ReducibilityFacts]
envAddSSigma_envBounded [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
envAddSSigma_isFlatEnvOf [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
envAddState_envBounded [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
envAddState_isFlatEnvOf [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
eproc_equiv [in Undecidability.L.Computability.Seval]
eqApp [in Undecidability.L.Util.L_facts]
eqbTime_le_r [in Undecidability.L.Functions.EqBool]
eqbTime_le_l [in Undecidability.L.Functions.EqBool]
eqb_time_bound_r [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
eqb_spec [in Undecidability.L.Functions.EqBool]
eqb_false_iff [in Complexity.Libs.CookPrelim.Tactics]
eqDec_remove [in Undecidability.L.Functions.EqBool]
eqStarT [in Undecidability.L.Util.L_facts]
equal_lb_mask_equiv [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
equal_equiv [in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
Equivalence_property_exists [in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
Equivalence_property_all [in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
equiv_many_app_L [in Undecidability.TM.L.CompilerBoolFuns.NaryApp]
equiv_lambda [in Undecidability.L.Util.L_facts]
equiv_ecl [in Undecidability.L.Util.L_facts]
equiv_eva [in Undecidability.L.Computability.Seval]
equiv_fold_left [in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
equiv_R [in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
equiv_eval_equiv [in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
equi_rotate [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
equi_shift [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
equi_swap [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
equi_dup [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
equi_push [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
eq_ref [in Undecidability.L.Prelim.ARS]
eq_nth_iff' [in Undecidability.TM.Compound.TMTac]
eq_nth_iff' [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
eq_term_dec [in Undecidability.L.Computability.Computability]
Eq_ldec [in Undecidability.L.Computability.Scott]
esim_sim_agree [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Eta [in Undecidability.L.Util.L_facts]
euclid_2 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
euclid_2_div [in Undecidability.Shared.Libs.DLW.Utils.gcd]
evalClause_poly [in Complexity.NP.SAT.SAT_inNP]
evalClause_assgn_equiv [in Complexity.NP.SAT.SAT]
evalClause_app [in Complexity.NP.SAT.SAT]
evalClause_literal_iff [in Complexity.NP.SAT.SAT]
evalClause_step_inv [in Complexity.NP.SAT.SAT]
evalCnf_poly [in Complexity.NP.SAT.SAT_inNP]
evalCnf_assgn_equiv [in Complexity.NP.SAT.SAT]
evalCnf_app_iff [in Complexity.NP.SAT.SAT]
evalCnf_clause_iff [in Complexity.NP.SAT.SAT]
evalCnf_step_inv [in Complexity.NP.SAT.SAT]
evalevaluates_evaluatesIn [in Undecidability.L.Prelim.ARS]
evalFormula_prim_iff [in Complexity.NP.SAT.FSAT.FSAT]
evalFormula_not_iff [in Complexity.NP.SAT.FSAT.FSAT]
evalFormula_or_iff [in Complexity.NP.SAT.FSAT.FSAT]
evalFormula_and_iff' [in Complexity.NP.SAT.FSAT.FSAT]
evalFormula_and_iff [in Complexity.NP.SAT.FSAT.FSAT]
evalForTimeBool_spec [in Complexity.L.AbstractMachines.Computable.EvalForTimeBool]
evalForTime_spec [in Complexity.L.AbstractMachines.Computable.EvalForTime]
evalIn_unique [in Undecidability.L.Util.L_facts]
evalIn_trans [in Undecidability.L.Util.L_facts]
evalIn_mono [in Undecidability.L.Util.L_facts]
evalIn_evalLe [in Undecidability.L.Util.L_facts]
evalIn_refl [in Undecidability.L.Tactics.Lbeta]
evalLe_trans_rev [in Undecidability.L.Util.L_facts]
evalLe_trans [in Undecidability.L.Util.L_facts]
evalLe_evalIn [in Undecidability.L.Util.L_facts]
evalLiteral_true_no_conflict [in Complexity.NP.Clique.kSAT_to_Clique]
evalLiteral_assgn_equiv [in Complexity.NP.SAT.SAT]
evalLiteral_var_iff [in Complexity.NP.SAT.SAT]
EvalL.Spec [in Undecidability.TM.L.Eval]
EvalL.SpecT [in Undecidability.TM.L.Eval]
evalVar_assgn_equiv [in Complexity.NP.SAT.SharedSAT]
evalVar_monotonic [in Complexity.NP.SAT.SharedSAT]
evalVar_in_iff [in Complexity.NP.SAT.SharedSAT]
evalVar_not_assgn_varsIn_false [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
Eval_converges [in Undecidability.L.Functions.Eval]
eval_converges [in Undecidability.L.Functions.Eval]
Eval_eval [in Undecidability.L.Functions.Eval]
eval_Eval [in Undecidability.L.Functions.Eval]
Eval_correct [in Undecidability.L.Functions.Eval]
eval_iff [in Undecidability.L.Util.L_facts]
eval_evalIn [in Undecidability.L.Util.L_facts]
eval_unique [in Undecidability.L.Util.L_facts]
eval_rect [in Undecidability.L.Computability.Seval]
eval_seval [in Undecidability.L.Computability.Seval]
eval_step [in Undecidability.L.Computability.Seval]
eval_converges [in Undecidability.L.Computability.Seval]
eval_refl [in Undecidability.L.Tactics.Lbeta]
eval_helper [in Undecidability.L.Tactics.Lbeta]
eva_Sn_n [in Undecidability.L.Computability.Seval]
eva_n_Sn [in Undecidability.L.Computability.Seval]
eva_equiv [in Undecidability.L.Computability.Seval]
eva_seval_iff [in Undecidability.L.Computability.Seval]
eva_seval [in Undecidability.L.Computability.Seval]
eva_lam [in Undecidability.L.Computability.Seval]
execFlatTM_isValidFlatTapes [in Complexity.NP.SAT.CookLevin.Reductions.TMGenNP_fixed_singleTapeTM_to_FlatFunSingleTMGenNP]
execFlatTM_correct [in Complexity.L.TM.TMflatFun]
execFlat_poly [in Complexity.L.TM.TMflatComp]
exists_dec_fin_t [in Undecidability.Shared.Libs.DLW.Utils.fin_dec]
exists_equiv [in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
exists_assignment [in Complexity.NP.Clique.kSAT_to_Clique]
exists_clique [in Complexity.NP.Clique.kSAT_to_Clique]
exists_clique' [in Complexity.NP.Clique.kSAT_to_Clique]
expandDenote [in Undecidability.L.Tactics.Reflection]
expand_0 [in Undecidability.Shared.Libs.DLW.Utils.prime]
expand_app [in Undecidability.Shared.Libs.DLW.Utils.prime]
expAssgn_to_assgn_inv [in Complexity.NP.SAT.FSAT.FormulaEncoding]
expAssgn_to_assgn [in Complexity.NP.SAT.FSAT.FormulaEncoding]
explicitAssignment_app [in Complexity.NP.SAT.FSAT.FormulaEncoding]
explicitAssignment_nth [in Complexity.NP.SAT.FSAT.FormulaEncoding]
explicitAssignment_length [in Complexity.NP.SAT.FSAT.FormulaEncoding]
explicit_bounds.sat_NP [in Complexity.L.ComparisonTimeBoundDerivation]
explicit_bounds.sat_verifierb_poly [in Complexity.L.ComparisonTimeBoundDerivation]
explicit_bounds.sat_verifierb_time_bound [in Complexity.L.ComparisonTimeBoundDerivation]
explicit_bounds.evalCnf_poly [in Complexity.L.ComparisonTimeBoundDerivation]
explicit_bounds.evalCnf_time_bound [in Complexity.L.ComparisonTimeBoundDerivation]
explicit_bounds.forallb_time_explicit [in Complexity.L.ComparisonTimeBoundDerivation]
explicit_bounds.evalClause_poly [in Complexity.L.ComparisonTimeBoundDerivation]
explicit_bounds.evalClause_time_bound [in Complexity.L.ComparisonTimeBoundDerivation]
explicit_bounds.existsb_time_explicit [in Complexity.L.ComparisonTimeBoundDerivation]
explicit_bounds.evalLiteral_poly [in Complexity.L.ComparisonTimeBoundDerivation]
explicit_bounds.evalLiteral_time_bound [in Complexity.L.ComparisonTimeBoundDerivation]
explicit_bounds.evalVar_poly [in Complexity.L.ComparisonTimeBoundDerivation]
explicit_bounds.evalVar_time_bound [in Complexity.L.ComparisonTimeBoundDerivation]
extApp [in Undecidability.L.Tactics.Computable]
extTApp [in Undecidability.L.Tactics.ComputableTime]
extT_rel_helper [in Undecidability.L.Tactics.Lrewrite]
extT_is_enc [in Undecidability.L.Tactics.ComputableTime]
ext_rel_helper [in Undecidability.L.Tactics.Lrewrite]
ext_is_enc [in Undecidability.L.Tactics.Computable]
E__spec [in Complexity.HierarchyTheorem.TimeHierarchyTheorem]
E_alphabet [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
E_cover_sym_rem_rev [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
E_cover_sym_rem [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
E_cover_sym_rev [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
E_cover_sym [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
E_cover_blank_rev [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
E_cover_blank [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
E_polarityFlip [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
E_length [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]

F

fact_gt_0 [in Undecidability.Shared.Libs.DLW.Utils.binomial]
fact_S [in Undecidability.Shared.Libs.DLW.Utils.binomial]
fact_0 [in Undecidability.Shared.Libs.DLW.Utils.binomial]
False_enum_ok [in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicFinTypes]
FCI.closure [in Undecidability.Shared.Libs.PSL.FCI]
FCI.fip_dec [in Undecidability.Shared.Libs.PSL.FCI]
FCI.fp [in Undecidability.Shared.Libs.PSL.FCI]
FCI.incl [in Undecidability.Shared.Libs.PSL.FCI]
FCI.ind [in Undecidability.Shared.Libs.PSL.FCI]
FCI.it_incl [in Undecidability.Shared.Libs.PSL.FCI]
FCI.pick [in Undecidability.Shared.Libs.PSL.FCI]
fedges_wf_decb_iff [in Complexity.NP.Clique.FlatUGraph]
fedges_symmetric_decb_iff [in Complexity.NP.Clique.FlatUGraph]
fedges_edge_in_decb_iff [in Complexity.NP.Clique.FlatUGraph]
fedges_wf_decb_poly [in Complexity.NP.Clique.FlatClique]
fedges_wf_decb_time_bound [in Complexity.NP.Clique.FlatClique]
fedges_symmetric_decb_poly [in Complexity.NP.Clique.FlatClique]
fedges_symmetric_decb_time_bound [in Complexity.NP.Clique.FlatClique]
fedge_wf_decb_iff [in Complexity.NP.Clique.FlatUGraph]
fedge_eqb_iff [in Complexity.NP.Clique.FlatUGraph]
fedge_eqb_spec [in Complexity.NP.Clique.FlatUGraph]
FG [in Undecidability.Synthetic.Infinite]
fgraph_wf_decb_iff [in Complexity.NP.Clique.FlatUGraph]
fgraph_wf_decb_poly [in Complexity.NP.Clique.FlatClique]
fgraph_wf_decb_time_bound [in Complexity.NP.Clique.FlatClique]
fill_default_not_index [in Undecidability.TM.Lifting.LiftTapes]
fill_not_index [in Undecidability.TM.Lifting.LiftTapes]
fill_correct_nth [in Undecidability.TM.Lifting.LiftTapes]
filterSome_length [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
filterSome_poly [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
filterSome_time_bound [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
filter_length [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
filter_comm [in Undecidability.Shared.FilterFacts]
filter_and [in Undecidability.Shared.FilterFacts]
filter_pq_eq [in Undecidability.Shared.FilterFacts]
filter_pq_mono [in Undecidability.Shared.FilterFacts]
filter_fst' [in Undecidability.Shared.FilterFacts]
filter_fst [in Undecidability.Shared.FilterFacts]
filter_app [in Undecidability.Shared.FilterFacts]
filter_id [in Undecidability.Shared.FilterFacts]
filter_mono [in Undecidability.Shared.FilterFacts]
filter_incl [in Undecidability.Shared.FilterFacts]
filter_map [in Undecidability.Shared.Libs.PSL.Lists.Filter]
filter_comm [in Undecidability.Shared.Libs.PSL.Lists.Filter]
filter_and [in Undecidability.Shared.Libs.PSL.Lists.Filter]
filter_pq_eq [in Undecidability.Shared.Libs.PSL.Lists.Filter]
filter_pq_mono [in Undecidability.Shared.Libs.PSL.Lists.Filter]
filter_fst' [in Undecidability.Shared.Libs.PSL.Lists.Filter]
filter_fst [in Undecidability.Shared.Libs.PSL.Lists.Filter]
filter_app [in Undecidability.Shared.Libs.PSL.Lists.Filter]
filter_id [in Undecidability.Shared.Libs.PSL.Lists.Filter]
filter_mono [in Undecidability.Shared.Libs.PSL.Lists.Filter]
filter_incl [in Undecidability.Shared.Libs.PSL.Lists.Filter]
filter_rev [in Complexity.TM.Single.EncodeTapesInvariants]
finalCondition [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
finalSubstrings_correct [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
final_agree [in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
final_agree [in Complexity.NP.SAT.CookLevin.Reductions.TCC_to_CC]
final_flat_agree [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
final_flat_agree [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
find_pow2_prop [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
find_pow2_geq [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
finfunc_conv [in Undecidability.Shared.Libs.PSL.FiniteTypes.FiniteFunction]
finfunc_correct [in Undecidability.Shared.Libs.PSL.FiniteTypes.FiniteFunction]
finfunc_sound_cor [in Undecidability.Shared.Libs.PSL.FiniteTypes.FiniteFunction]
finfunc_sound [in Undecidability.Shared.Libs.PSL.FiniteTypes.FiniteFunction]
finfunc_comp [in Undecidability.Shared.Libs.PSL.FiniteTypes.FiniteFunction]
finFun_computableTime_const [in Undecidability.L.Functions.FinTypeLookup]
finite_weak_dec [in Undecidability.Shared.Libs.DLW.Utils.fin_dec]
finite_n [in Undecidability.Shared.FinTypeEquiv]
finite_t_discrete_bij_t_pos [in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
finite_t_pos_equiv [in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
finite_t_surj_t [in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
finite_t_weak_dec_rels [in Undecidability.Shared.Libs.DLW.Utils.fin_upto]
finite_t_weak_dec_powerset [in Undecidability.Shared.Libs.DLW.Utils.fin_upto]
finite_t_fin_upto [in Undecidability.Shared.Libs.DLW.Utils.fin_upto]
finite_pigeon_hole [in Undecidability.Shared.Libs.DLW.Utils.php]
finite_php_dup [in Undecidability.Shared.Libs.DLW.Utils.php]
finite_t_sig_bool [in Undecidability.Shared.Libs.DLW.Utils.fin_base]
finite_t_fin_t_dec [in Undecidability.Shared.Libs.DLW.Utils.fin_base]
finite_t_vec [in Undecidability.Shared.Libs.DLW.Utils.fin_base]
finite_t_pos [in Undecidability.Shared.Libs.DLW.Utils.fin_base]
finite_t_option [in Undecidability.Shared.Libs.DLW.Utils.fin_base]
finite_t_list [in Undecidability.Shared.Libs.DLW.Utils.fin_base]
finite_t_bool [in Undecidability.Shared.Libs.DLW.Utils.fin_base]
finite_unit [in Undecidability.Shared.Libs.DLW.Utils.fin_base]
finite_t_unit [in Undecidability.Shared.Libs.DLW.Utils.fin_base]
finite_sum [in Undecidability.Shared.Libs.DLW.Utils.fin_base]
finite_t_sum [in Undecidability.Shared.Libs.DLW.Utils.fin_base]
finite_prod [in Undecidability.Shared.Libs.DLW.Utils.fin_base]
finite_t_prod [in Undecidability.Shared.Libs.DLW.Utils.fin_base]
finite_t_map [in Undecidability.Shared.Libs.DLW.Utils.fin_base]
finite_fin_eq [in Undecidability.Shared.Libs.DLW.Utils.fin_base]
finite_t_fin_t_eq [in Undecidability.Shared.Libs.DLW.Utils.fin_base]
finite_t_finite [in Undecidability.Shared.Libs.DLW.Utils.fin_base]
finite_t_dec_choose_one [in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
finite_discrete_choice [in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
finMax_val [in Undecidability.TM.Single.StepTM]
finMax_ext [in Undecidability.TM.Single.StepTM]
finMin_opt_Some_val [in Undecidability.TM.Single.StepTM]
finMin_opt_Some [in Undecidability.TM.Single.StepTM]
finMin_opt_None [in Undecidability.TM.Single.StepTM]
finMin_val [in Undecidability.TM.Single.StepTM]
finMin_ext [in Undecidability.TM.Single.StepTM]
finMin_O [in Undecidability.TM.Single.StepTM]
finReprElInl [in Complexity.Libs.CookPrelim.FlatFinTypes]
finReprElInr [in Complexity.Libs.CookPrelim.FlatFinTypes]
finReprElNone [in Complexity.Libs.CookPrelim.FlatFinTypes]
finReprElPair [in Complexity.Libs.CookPrelim.FlatFinTypes]
finReprElP_exists [in Complexity.Libs.CookPrelim.FlatFinTypes]
finReprElP_finReprEl [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
finReprElSome [in Complexity.Libs.CookPrelim.FlatFinTypes]
finReprEl_ofFlatType [in Complexity.Libs.CookPrelim.FlatFinTypes]
finReprEl_finReprEl' [in Complexity.Libs.CookPrelim.FlatFinTypes]
finReprOption [in Complexity.Libs.CookPrelim.FlatFinTypes]
finReprProd [in Complexity.Libs.CookPrelim.FlatFinTypes]
finReprSum [in Complexity.Libs.CookPrelim.FlatFinTypes]
finRepr_exists_list [in Complexity.Libs.CookPrelim.FlatFinTypes]
finRepr_exists [in Complexity.Libs.CookPrelim.FlatFinTypes]
finSucc_correct [in Undecidability.TM.Single.StepTM]
finSucc_opt_None' [in Undecidability.TM.Single.StepTM]
finSucc_opt_None [in Undecidability.TM.Single.StepTM]
finSucc_opt_Some' [in Undecidability.TM.Single.StepTM]
finSucc_opt_Some [in Undecidability.TM.Single.StepTM]
finSucc_help' [in Undecidability.TM.Single.StepTM]
finSucc_help [in Undecidability.TM.Single.StepTM]
fintype_forall_exists [in Undecidability.Shared.FinTypeForallExists]
finType_eqb_reflect [in Undecidability.L.Datatypes.LFinType]
finType_enum_list_finReprEl [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
fin_weak_dec [in Undecidability.Shared.Libs.DLW.Utils.fin_dec]
fin_is_2 [in Undecidability.TM.Single.StepTM]
fin_is_1 [in Undecidability.TM.Single.StepTM]
fin_is_0 [in Undecidability.TM.Single.StepTM]
fin_to_nat_S [in Undecidability.TM.Single.StepTM]
fin_to_nat_O [in Undecidability.TM.Single.StepTM]
fin_to_nat_lt [in Undecidability.TM.Single.StepTM]
Fin_cardinality [in Undecidability.Shared.Libs.PSL.FiniteTypes.VectorFin]
Fin_initVect_full [in Undecidability.Shared.Libs.PSL.FiniteTypes.VectorFin]
Fin_initVect_dupfree [in Undecidability.Shared.Libs.PSL.FiniteTypes.VectorFin]
Fin_eqb_L_R [in Undecidability.Shared.Libs.PSL.Vectors.Fin]
Fin_eqb_R_L [in Undecidability.Shared.Libs.PSL.Vectors.Fin]
Fin_eqb_L_L [in Undecidability.Shared.Libs.PSL.Vectors.Fin]
Fin_eqb_R_R [in Undecidability.Shared.Libs.PSL.Vectors.Fin]
Fin_R_fillive [in Undecidability.Shared.Libs.PSL.Vectors.Fin]
Fin_L_fillive [in Undecidability.Shared.Libs.PSL.Vectors.Fin]
fin_destruct_add [in Undecidability.Shared.Libs.PSL.Vectors.Fin]
fin_destruct_O [in Undecidability.Shared.Libs.PSL.Vectors.Fin]
fin_destruct_S [in Undecidability.Shared.Libs.PSL.Vectors.Fin]
fin_t_dec [in Undecidability.Shared.Libs.DLW.Utils.fin_base]
fin_t_vec [in Undecidability.Shared.Libs.DLW.Utils.fin_base]
fin_t_length [in Undecidability.Shared.Libs.DLW.Utils.fin_base]
fin_t_sum [in Undecidability.Shared.Libs.DLW.Utils.fin_base]
fin_t_prod [in Undecidability.Shared.Libs.DLW.Utils.fin_base]
fin_t_equiv [in Undecidability.Shared.Libs.DLW.Utils.fin_base]
fin_t_finite_t [in Undecidability.Shared.Libs.DLW.Utils.fin_base]
fin_t_map [in Undecidability.Shared.Libs.DLW.Utils.fin_base]
fin_t_fin [in Undecidability.Shared.Libs.DLW.Utils.fin_base]
fin_flat_cards_agree [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
fin_flat_preludeCards_agree [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
fin_flat_stateCards_agree [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
fin_flat_haltCards_agree [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
fin_flat_nonhaltCards_agree [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
fin_flat_tapeCards_agree [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
fin_agreement [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
fin_t_dec_choose_one [in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
Fin_cardinality' [in Complexity.NP.Clique.kSAT_to_Clique]
fin_reif_nat [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
fin_reif [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
fip_dec [in Undecidability.Shared.Libs.PSL.FCI]
fip_it_closed [in Undecidability.Shared.Libs.PSL.FCI]
fip_it_sound [in Undecidability.Shared.Libs.PSL.FCI]
fip_least [in Undecidability.Shared.Libs.PSL.FCI]
FirstFixedPoint [in Undecidability.L.Computability.Fixpoints]
firstn_add [in Complexity.Libs.CookPrelim.MorePrelim]
firstn_all_inv [in Complexity.Libs.CookPrelim.MorePrelim]
firstn_skipn_rev [in Complexity.Libs.CookPrelim.MorePrelim]
first_which_ni [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
first_which [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
first_non_zero [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
fixedTM_to_FlatSingleTMGenNP [in Complexity.NP.SAT.CookLevin]
flatAlphabet_poly [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
flatAlphabet_time_bound [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
flatAlphabet_bound [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
FlatCC_to_BinaryCC [in Complexity.NP.SAT.CookLevin]
FlatCC_to_BinaryCC_poly [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
FlatCC_to_BinaryCC [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
FlatCC_wf_dec_poly [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
FlatCC_wf_dec_time_bound [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
FlatCC_enc_size [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
FlatCC_wf_dec_correct [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
FlatClique_in_NP [in Complexity.NP.Clique.FlatClique]
FlatClique_implies_SAT [in Complexity.NP.Clique.kSAT_to_FlatClique]
FlatFunSingleTMGenNP_FlatSingleTMGenNP_equiv [in Complexity.NP.SAT.CookLevin.Subproblems.SingleTMGenNP]
flatGamma_poly [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
flatGamma_time_bound [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
flatGamma_bound [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
flatMTICards_poly [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
flatMTICards_time_bound [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
flatMTLCards_poly [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
flatMTLCards_time_bound [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
flatMTRCards_poly [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
flatMTRCards_time_bound [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
flatPolSigma_poly [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
flatPolSigma_time_bound [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
flatPolSigma_bound [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
flatPreludeCards_ofFlatType [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
flatPreludeCards_length [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
flatPreludeCards_poly [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
flatPreludeCards_time_bound [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
flatPreludeSigP_bound [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
FlatSingleTMGenNP_to_3SAT [in Complexity.NP.SAT.CookLevin]
FlatSingleTMGenNP_to_FlatTCC [in Complexity.NP.SAT.CookLevin]
FlatSingleTMGenNP_to_FlatTCCLang_poly [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
FlatSingleTMGenNP_to_FlatTCC [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
flatStateCards_ofFlatType [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
flatStateCards_length [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
flatStateCards_poly [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
flatStateCards_time_bound [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
flatStateSigma_bound [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
flatStates_poly [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
flatStates_time_bound [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
flatStates_bound [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
flatTapeCards_ofFlatType [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
flatTapeCards_length_poly [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
flatTapeCards_length [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
flatTapeCards_poly [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
flatTapeCards_time_bound [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
flatTapeSigma_bound [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
FlatTCC_to_FlatCC [in Complexity.NP.SAT.CookLevin]
FlatTCC_enc_size [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
FlatTCC_to_FlatCC_poly [in Complexity.NP.SAT.CookLevin.Reductions.FlatTCC_to_FlatCC]
FlatTCC_to_FlatCC [in Complexity.NP.SAT.CookLevin.Reductions.FlatTCC_to_FlatCC]
flattenConfig_isFlatteningConfigOf [in Complexity.L.TM.TMflatten]
flattenHalt_isFlatteningHaltOf [in Complexity.L.TM.TMflatten]
flattenHalt''_correct [in Complexity.L.TM.TMflatten]
flattenHalt''_length [in Complexity.L.TM.TMflatten]
flatteningTapeIsValid [in Complexity.L.TM.TMunflatten]
flattenPolarity_reprEl [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
flattenPreludeSigP_reprEl [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
flattenTapes_isFlatteningTapesOf [in Complexity.L.TM.TMflatten]
flattenTM_isFlatteningTMOf [in Complexity.L.TM.TMflatten]
flattenTrans_isFlatteningTransOf [in Complexity.L.TM.TMflatten]
flat_finalSubstrings_size_poly [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
flat_finalSubstrings_size_bound [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
flat_finalSubstrings_el_bound [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
flat_finalSubstrings_length [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
flat_finalSubstrings_poly [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
flat_finalSubstrings_time_bound [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
flat_finalSubstrings_step_poly [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
flat_finalSubstrings_step_time_bound [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
flat_haltingStates_ofFlatType [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
flat_haltingStates_length [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
flat_haltingStates_poly [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
flat_haltingStates_time_bound [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
flat_initial_string_size_poly [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
flat_initial_string_size_bound [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
flat_initial_string_ofFlatType [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
flat_initial_string_length [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
flat_initial_string_poly [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
flat_initial_string_time_bound [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
flat_baseEnvPrelude_length [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
flat_baseEnvHalt_length [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
flat_baseEnvNone_length [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
flat_baseEnv_length [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
flat_map_single [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
flat_map_flat_map [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
flat_map_app_inv [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
flat_map_app [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
flat_final [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
flat_initial [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
flat_graph [in Complexity.NP.Clique.kSAT_to_FlatClique]
flat_edges [in Complexity.NP.Clique.kSAT_to_FlatClique]
fmap_reifer_bound [in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
fmap_reifier_default [in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
fmap_bound [in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
fmmap_reifer_bound [in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
fmmap_bound [in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
fold_left_vector_to_list [in Undecidability.TM.Util.VectorPrelim]
fold_right_time_bound_env [in Complexity.Libs.CookPrelim.PolyBounds]
forallb_time_bound_env [in Complexity.Libs.CookPrelim.PolyBounds]
forallb_time_const [in Undecidability.L.Datatypes.List.List_fold]
forallb_time_eq [in Undecidability.L.Datatypes.List.List_fold]
Forall_filter [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
Forall_impl [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
Forall_forall_map [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
Forall_map [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
Forall_rev [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
Forall_cons_inv [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
Forall_app [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
forall_proc_help [in Undecidability.TM.L.CompilerBoolFuns.Compiler_nat_facts]
Forall_Forall2 [in Complexity.TM.PrettyBounds.BaseCodeSpace]
Forall_elim [in Complexity.L.TM.TMflatComp]
Forall_zipWith [in Complexity.L.TM.TMflatComp]
Forall_reif_t [in Undecidability.Shared.Libs.DLW.Utils.fin_base]
forall_bound_equiv [in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
Forall2_vec_list [in Undecidability.Shared.Libs.DLW.Vec.vec]
Forall2_Forall [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
Forall2_map_both [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
Forall2_map_right [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
Forall2_map_left [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
Forall2_cons_inv_r [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
Forall2_cons_inv_l [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
Forall2_app_inv_r [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
Forall2_app_inv_l [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
Forall2_cons_inv [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
Forall2_nil_inv_r [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
Forall2_nil_inv_l [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
Forall2_mono [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
Forall2_map [in Complexity.TM.PrettyBounds.BaseCodeSpace]
Forall2_app_inv_r [in Undecidability.Shared.Libs.DLW.Utils.php]
Forall2_right_Forall [in Undecidability.Shared.Libs.DLW.Utils.php]
Forall2_impl [in Undecidability.Shared.Libs.DLW.Utils.php]
Forall2_length [in Undecidability.Shared.Libs.DLW.Utils.php]
Forall2_conj [in Undecidability.Shared.Libs.DLW.Utils.php]
formula_varsIn_monotonic [in Complexity.NP.SAT.FSAT.FormulaEncoding]
formula_maxVar_poly [in Complexity.NP.SAT.FSAT.FSAT]
formula_maxVar_time_bound [in Complexity.NP.SAT.FSAT.FSAT]
formula_total_size_enc_bound [in Complexity.NP.SAT.FSAT.FSAT]
formula_maxVar_enc_bound [in Complexity.NP.SAT.FSAT.FSAT]
formula_size_enc_bound [in Complexity.NP.SAT.FSAT.FSAT]
formula_enc_size_bound [in Complexity.NP.SAT.FSAT.FSAT]
formula_enc_size [in Complexity.NP.SAT.FSAT.FSAT]
formula_varsIn_bound [in Complexity.NP.SAT.FSAT.FSAT]
formula_maxVar_varsIn [in Complexity.NP.SAT.FSAT.FSAT]
fp_nice [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
fp_nice4 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
fp_nice3 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
fp_nice2 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
fp_nice1 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
fp_eq [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
Frame_withSpace [in Undecidability.TM.Hoare.HoareRegister]
FSAT_to_3SAT [in Complexity.NP.SAT.CookLevin]
FSAT_to_SAT [in Complexity.NP.SAT.CookLevin]
FSAT_to_3SAT_poly [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
FSAT_to_SAT_poly [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
FSAT_to_3SAT [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
FSAT_to_SAT [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
functional_uc [in Undecidability.L.Prelim.ARS]
Fun'_simpl [in Undecidability.L.Complexity.GenericNary]
Fun'_eqn_3 [in Undecidability.L.Complexity.GenericNary]
Fun'_eqn_2 [in Undecidability.L.Complexity.GenericNary]
Fun'_eqn_1 [in Undecidability.L.Complexity.GenericNary]
fun2vec_vec2fun [in Undecidability.Shared.Libs.DLW.Vec.vec]
fun2vec_lift [in Undecidability.Shared.Libs.DLW.Vec.vec]
fun2vec_id [in Undecidability.Shared.Libs.DLW.Vec.vec]
F_sur [in Undecidability.Synthetic.Infinite]
F_inj [in Undecidability.Synthetic.Infinite]
F_inj' [in Undecidability.Synthetic.Infinite]
F_lt [in Undecidability.Synthetic.Infinite]
F_el [in Undecidability.Synthetic.Infinite]
F_nel [in Undecidability.Synthetic.Infinite]
f_sur [in Undecidability.Synthetic.Infinite]

G

gcd_spec [in Undecidability.Shared.Libs.DLW.Utils.gcd]
gen [in Undecidability.Synthetic.Infinite]
generateAlphabetFin_canonical [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
generateAlphabetFlat_ofFlatType [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
generateAlphabetFlat_poly [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
generateAlphabetFlat_time_bound [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
generateAlphabetFlat_canonical [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
generateAlphabet_reprEl [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
generateCardFlat_ofFlatType [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
generateCardsForFlatHalt_ofFlatType [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
generateCardsForFlatHalt_length [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
generateCardsForFlatHalt_poly [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
generateCardsForFlatHalt_time_bound [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
generateCardsForFlatNonHalt_ofFlatType [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
generateCardsForFlatNonHalt_length_poly [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
generateCardsForFlatNonHalt_length [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
generateCardsForFlatNonHalt_poly [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
generateCardsForFlatNonHalt_time_bound [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
generateCardsForFlat_length_poly [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
generateCardsForFlat_length [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
generateCardsForFlat_poly [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
generateCardsForFlat_time_bound [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
generateCard_poly [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
generateCard_time_bound [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
generateCard_isFlatCardOf [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
generateCard_Some [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
generateGammaFlat_ofFlatType [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
generateGammaFlat_poly [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
generateGammaFlat_time_bound [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
generatePolarityFlat_ofFlatType [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
generatePolarityFlat_poly [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
generatePolarityFlat_time_bound [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
generatePolSigmaFlat_ofFlatType [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
generatePolSigmaFlat_poly [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
generatePolSigmaFlat_time_bound [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
generatePreludeSigPFlat_poly [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
generatePreludeSigPFlat_time_bound [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
generatePreludeSigP_ofFlatType [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
generateStatesFlat_ofFlatType [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
generateStatesFlat_poly [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
generateStatesFlat_time_bound [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
generateStateSigmaFlat_ofFlatType [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
generateStateSigmaFlat_poly [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
generateStateSigmaFlat_time_bound [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
generateTapeSigmaFlat_ofFlatType [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
generateTapeSigmaFlat_poly [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
generateTapeSigmaFlat_time_bound [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
GenNPBool_complete [in Complexity.NP.L.GenNPBool]
GenNP_to_3SAT [in Complexity.NP.SAT.CookLevin]
GenNP_to_SingleTMGenNP [in Complexity.NP.SAT.CookLevin]
GenNP_to_LMGenNP [in Complexity.NP.SAT.CookLevin]
GenNP_to_TMGenNP [in Complexity.NP.TM.IntermediateProblems]
GenNP_to_LMGenNP [in Complexity.NP.TM.L_to_LM]
gen_compiler_correction [in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
gen_compiler_terminates [in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
gen_compiler_output [in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
gen_compiler_complete [in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
gen_compiler_sound [in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
gen_linker_out [in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
gen_list_spec [in Undecidability.TM.L.CompilerBoolFuns.Compiler_nat_facts]
gen_le_f [in Undecidability.Synthetic.Infinite]
gen_spec [in Undecidability.Synthetic.Infinite]
getatIn [in Undecidability.Shared.FinTypeEquiv]
getPosition_nth [in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
getPosition_correct [in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
getPosition_prodLists [in Complexity.Libs.CookPrelim.MorePrelim]
getPosition_app2 [in Complexity.Libs.CookPrelim.MorePrelim]
getPosition_app1 [in Complexity.Libs.CookPrelim.MorePrelim]
getPosition_map [in Complexity.Libs.CookPrelim.MorePrelim]
get_current [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
get_current [in Complexity.L.AbstractMachines.AbstractHeapMachine]
GF [in Undecidability.Synthetic.Infinite]
Gflat_size_poly [in Complexity.NP.Clique.kSAT_to_FlatClique]
Gflat_size_bound [in Complexity.NP.Clique.kSAT_to_FlatClique]
Gflat_poly [in Complexity.NP.Clique.kSAT_to_FlatClique]
Gflat_time_bound [in Complexity.NP.Clique.kSAT_to_FlatClique]
godel_beta_fun_inv_triples [in Undecidability.Shared.Libs.DLW.Utils.crt]
godel_beta_fun_inv [in Undecidability.Shared.Libs.DLW.Utils.crt]
godel_beta_inv [in Undecidability.Shared.Libs.DLW.Utils.crt]
GoToCurrent_steps_nice [in Complexity.TM.PrettyBounds.M2MBounds]
GoToCurrent_steps'_nice [in Complexity.TM.PrettyBounds.M2MBounds]
GoToCurrent_Terminates [in Undecidability.TM.Single.StepTM]
GoToCurrent_Realise [in Undecidability.TM.Single.StepTM]
GoToHSB_Realise [in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
GoToLSB_start_Realise [in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
GoToLSB_Realise [in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
GoToNext_steps_nice [in Complexity.TM.PrettyBounds.M2MBounds]
GoToNext_steps'_nice [in Complexity.TM.PrettyBounds.M2MBounds]
GoToNext_Terminates [in Undecidability.TM.Single.StepTM]
GoToNext_Realise [in Undecidability.TM.Single.StepTM]
graph_of_TM_In'' [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
graph_of_TM_not_nil [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
graph_of_fun_not_empty [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
graph_of_TM_In' [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
graph_of_TM_In [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
graph_of_fun_lookup [in Undecidability.TM.Univ.LowLevel]
graph_of_fun_In' [in Undecidability.TM.Univ.LowLevel]
graph_of_fun_In [in Undecidability.TM.Univ.LowLevel]
graph_of_fun_functional [in Undecidability.TM.Univ.LowLevel]
graph_of_fun_ext [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
g_T [in Undecidability.L.Computability.Enum]
g_g_inv [in Undecidability.L.Computability.Enum]
g_inv_g [in Undecidability.L.Computability.Enum]
g_nlb_fun [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
g_nondec_correct [in Undecidability.L.Functions.EnumInt]

H

haltConfFlat_time_le [in Complexity.L.TM.TMflatComp]
HaltingProblem [in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
halting_inversion [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
haltRules_statesym [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
haltRules_statesym3 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
haltRules_statesym2 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
haltRules_statesym1 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
haltsim [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
halt_comp [in Undecidability.TM.Combinators.While]
halt_state_steps_k [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
halt_state_steps [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
halt_state_is_halt_state [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
Halt_red [in Undecidability.L.TM.TMinL]
halt_conf_liftL [in Undecidability.TM.Combinators.Switch]
halt_comp' [in Undecidability.TM.Combinators.StateWhile]
halt_comp [in Undecidability.TM.Combinators.StateWhile]
hasSpaceBeta [in Undecidability.L.Complexity.ResourceMeasures]
hasSpaceVal [in Undecidability.L.Complexity.ResourceMeasures]
hasSpace_step [in Undecidability.L.Complexity.ResourceMeasures]
hasSpace_iff [in Undecidability.L.Complexity.ResourceMeasures]
hBinaryCC_size_bound [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
hBinaryCC_poly [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
hBinaryCC_time_bound [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
hcards_size_bound [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
hcards_poly [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
hcards_time_bound [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
hcard_size_bound [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
hcard_poly [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
hcard_time_bound [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
hCC_wf [in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
hd_rev [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
hd_app [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
hd_map [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
heapStep_timeBound_mono [in Complexity.L.AbstractMachines.Computable.HeapMachine]
heapStep_timeBound_mono' [in Complexity.L.AbstractMachines.Computable.HeapMachine]
heapStep_timeBound_le [in Complexity.L.AbstractMachines.Computable.HeapMachine]
heapStep_sound [in Complexity.L.AbstractMachines.FunctionalDefinitions]
heap_greatest_address2_bound [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds_Loop]
helper [in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
helper [in Undecidability.TM.L.CompilerBoolFuns.Compiler]
helperF [in Complexity.L.AbstractMachines.AbstractSubstMachine]
helperF' [in Complexity.L.AbstractMachines.AbstractSubstMachine]
helper_lemma_without_name4 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
helper_lemma_without_name3' [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
helper_lemma_without_name3 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
helper2 [in Complexity.L.AbstractMachines.AbstractSubstMachine]
hfinal_size_bound [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
hfinal_poly [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
hfinal_time_bound [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
hflat_size_bound [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
hflat_length [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
hflat_poly [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
hflat_time_bound [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
hNat_size_bound [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
hNat_poly [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
hNat_time_bound [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
hNat_length [in Complexity.NP.SAT.CookLevin.Reductions.CC_to_BinaryCC]
homo_concat [in Complexity.Libs.UniformHomomorphisms]
homo_cons [in Complexity.Libs.UniformHomomorphisms]
homo_nil [in Complexity.Libs.UniformHomomorphisms]
hP_length [in Complexity.NP.SAT.CookLevin.Reductions.CC_to_BinaryCC]
hP_injective [in Complexity.NP.SAT.CookLevin.Reductions.CC_to_BinaryCC]
hP_inv1 [in Complexity.NP.SAT.CookLevin.Reductions.CC_to_BinaryCC]
h_app_inv [in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
h_app_inv1 [in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
h_multiplier [in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
h_injective [in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
h_unifHom [in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
h_length_multiply [in Complexity.Libs.UniformHomomorphisms]
h_nil_inv [in Complexity.Libs.UniformHomomorphisms]
h_length_inv' [in Complexity.Libs.UniformHomomorphisms]
h_length_inv [in Complexity.Libs.UniformHomomorphisms]
h_nil_cons [in Complexity.Libs.UniformHomomorphisms]
h_multiplier_sp [in Complexity.NP.SAT.CookLevin.Reductions.CC_to_BinaryCC]

I

identityCard_revp [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
If_RealiseIn [in Undecidability.TM.Combinators.If]
If_TerminatesIn' [in Undecidability.TM.Combinators.If]
If_TerminatesIn [in Undecidability.TM.Combinators.If]
If_Realise [in Undecidability.TM.Combinators.If]
If_SpecT_weak' [in Undecidability.TM.Hoare.HoareCombinators]
If_SpecT_weak [in Undecidability.TM.Hoare.HoareCombinators]
If_SpecTReg [in Undecidability.TM.Hoare.HoareCombinators]
If_SpecT [in Undecidability.TM.Hoare.HoareCombinators]
If_Spec [in Undecidability.TM.Hoare.HoareCombinators]
implListE [in Undecidability.TM.Hoare.HoareRegister]
implListI [in Undecidability.TM.Hoare.HoareRegister]
implList_iff [in Undecidability.TM.Hoare.HoareRegister]
inb_spec [in Undecidability.L.Datatypes.List.List_eqb]
incl_app_left [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
incl_lrcons [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
incl_rcons [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
incl_sing [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
incl_lcons [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
incl_shift [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
incl_nil_eq [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
incl_map [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
incl_nil [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
incl_left_right_php [in Undecidability.Shared.Libs.DLW.Utils.php]
incl_right_cons_incl_or_lhd_or_perm [in Undecidability.Shared.Libs.DLW.Utils.php]
incl_left_right_cons [in Undecidability.Shared.Libs.DLW.Utils.php]
incl_right_cons_choose [in Undecidability.Shared.Libs.DLW.Utils.php]
incl_cons_rinv [in Undecidability.Shared.Libs.DLW.Utils.php]
incl_app_rinv [in Undecidability.Shared.Libs.DLW.Utils.php]
incl_cons_linv [in Undecidability.Shared.Libs.DLW.Utils.php]
incl_app_left [in Undecidability.Shared.ListAutomation]
incl_lrcons [in Undecidability.Shared.ListAutomation]
incl_rcons [in Undecidability.Shared.ListAutomation]
incl_lcons [in Undecidability.Shared.ListAutomation]
incl_shift [in Undecidability.Shared.ListAutomation]
incl_nil_eq [in Undecidability.Shared.ListAutomation]
incl_sing [in Undecidability.Shared.ListAutomation]
incl_nil [in Undecidability.Shared.ListAutomation]
incl_seteq [in Undecidability.Shared.Libs.DLW.Utils.seteq]
incl_cntr [in Undecidability.Shared.Libs.DLW.Utils.seteq]
incl_swap [in Undecidability.Shared.Libs.DLW.Utils.seteq]
incl_cons_mono [in Undecidability.Shared.Libs.DLW.Utils.seteq]
InCount [in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
IncrementTwice_SpecT [in Undecidability.TM.Hoare.HoareExamples]
IncrementTwice_Spec [in Undecidability.TM.Hoare.HoareExamples]
IncrementTwice_SpecT_pure [in Undecidability.TM.Hoare.HoareExamples]
IncrementTwice_Spec_pure [in Undecidability.TM.Hoare.HoareExamples]
Increment_Realise [in Undecidability.TM.Code.BinNumbers.PosIncrementTM]
Increment_Loop_Realise [in Undecidability.TM.Code.BinNumbers.PosIncrementTM]
Increment_Step_Realise [in Undecidability.TM.Code.BinNumbers.PosIncrementTM]
Increment_N_Realise [in Undecidability.TM.Code.BinNumbers.NTM]
Incr2_SpecT [in Undecidability.TM.Hoare.HoareExamples]
Incr2_Spec [in Undecidability.TM.Hoare.HoareExamples]
Incr3_SpecT [in Undecidability.TM.Hoare.HoareExamples]
Incr3_Spec [in Undecidability.TM.Hoare.HoareExamples]
index_leq [in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
index_le [in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
index_nth [in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
index_nth_elem_fint [in Complexity.L.TM.TMunflatten]
index_nth_elem [in Complexity.L.TM.TMunflatten]
index_pair [in Complexity.NP.Clique.kSAT_to_FlatClique]
indKClique_iff [in Complexity.NP.Clique.Clique]
informative_evalIn [in Undecidability.L.Computability.Seval]
informative_seval2 [in Undecidability.L.Computability.Seval]
informative_seval [in Undecidability.L.Computability.Seval]
informative_eval2 [in Undecidability.L.Computability.Seval]
informative_eval [in Undecidability.L.Computability.Seval]
inhabited_pTM_lab [in Undecidability.TM.Util.TM_facts]
initFlat_correct [in Complexity.L.TM.TMflatFun]
initialString_validPreludeInitial [in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
initialString_eq [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
initialString_reprConfig [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
initRight_isVoid [in Undecidability.TM.Code.CodeTM]
initRight_isVoid_size [in Undecidability.TM.Code.CodeTM]
initRight_sizeOfTape [in Complexity.NP.TM.LM_to_mTM]
initTapes_MU_correct_size [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
initTapes_MU_correct [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
initTapes_U_correct_size [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
initTapes_U_correct [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
initTape_isFlatteningConfigOf [in Complexity.NP.SAT.CookLevin.Subproblems.SingleTMGenNP]
initTape_mapTape_index [in Complexity.NP.SAT.CookLevin.Subproblems.SingleTMGenNP]
initValue_contains [in Undecidability.TM.Code.CodeTM]
initValue_contains_size [in Undecidability.TM.Code.CodeTM]
initValue_sizeOfTape [in Complexity.NP.TM.LM_to_mTM]
injective_index [in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
injective_composed_permutation [in Undecidability.Shared.Libs.DLW.Utils.sorting]
inject_surject [in Undecidability.TM.Code.ChangeAlphabet]
inl_ofFlatType [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
inl_injective [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
inNP_TMgenericNPCompleteProblem [in Complexity.NP.TM.TMGenNP]
inNP_GenNPBool [in Complexity.NP.L.GenNPBool]
inNP_kSAT [in Complexity.NP.SAT.kSAT_to_SAT]
inNP_intro [in Complexity.Complexity.NP]
inOPoly_comp [in Complexity.Complexity.ONotation]
inOPoly_S [in Complexity.Complexity.ONotation]
inOPoly_pow [in Complexity.Complexity.ONotation]
inOPoly_mul [in Complexity.Complexity.ONotation]
inOPoly_add [in Complexity.Complexity.ONotation]
inOPoly_x [in Complexity.Complexity.ONotation]
inOPoly_c [in Complexity.Complexity.ONotation]
inOPoly_computable [in Complexity.Complexity.Definitions]
ino_inO_incl [in Complexity.Complexity.ONotation]
inO__bound [in Complexity.Complexity.ONotation]
inO_comp_l [in Complexity.Complexity.ONotation]
inO_mul_l [in Complexity.Complexity.ONotation]
inO_leq [in Complexity.Complexity.ONotation]
inO_c [in Complexity.Complexity.ONotation]
inO_mul_c_r [in Complexity.Complexity.ONotation]
inO_mul_c_l [in Complexity.Complexity.ONotation]
inO_add_l [in Complexity.Complexity.ONotation]
inO_size_nat [in Complexity.HierarchyTheorem.TimeHierarchyTheorem]
inO_equiv_pointwise2 [in Complexity.Complexity.ONotationIsAppropriate]
inO_equiv_pointwise [in Complexity.Complexity.ONotationIsAppropriate]
inO_bound_reverse [in Complexity.Complexity.ONotationIsAppropriate]
inr_ofFlatType [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
inr_injective [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
insertKnownSymbols_correct_cons [in Undecidability.TM.Single.StepTM]
insertKnownSymbols_correct [in Undecidability.TM.Single.StepTM]
insertKnownSymbol_correct [in Undecidability.TM.Single.StepTM]
Interpreter_SpecT [in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
Interpreter_Spec [in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
Interpreter_Spec_space [in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
interval_union_right [in Undecidability.Shared.Libs.DLW.Utils.interval]
interval_union_left [in Undecidability.Shared.Libs.DLW.Utils.interval]
interval_dec [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
inTimePoly_compTime [in Complexity.Complexity.NP]
inTime_mono [in Complexity.Complexity.Definitions]
inverse_bijective [in Undecidability.Shared.Libs.PSL.Bijection]
invert_symbols_1_marked [in Complexity.TM.Single.EncodeTapesInvariants]
invert_symbols_0_marked [in Complexity.TM.Single.EncodeTapesInvariants]
involution_invert_eqn2 [in Complexity.Libs.CookPrelim.MorePrelim]
involution_invert_eqn [in Complexity.Libs.CookPrelim.MorePrelim]
in_repEl_iff [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
In_replace' [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
In_replace [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
in_tabulate [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
in_dec_correct [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
In_cons [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
In_nil [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
in_vec_dec_inv [in Undecidability.Shared.Libs.DLW.Vec.vec]
in_vec_inv [in Undecidability.Shared.Libs.DLW.Vec.vec]
in_vec_pos [in Undecidability.Shared.Libs.DLW.Vec.vec]
in_vec_list [in Undecidability.Shared.Libs.DLW.Vec.vec]
in_filter_iff [in Undecidability.Shared.FilterFacts]
in_tabulate_formula_iff [in Complexity.NP.SAT.FSAT.FormulaEncoding]
in_tabulate_step_iff [in Complexity.NP.SAT.FSAT.FormulaEncoding]
in_rem_iff [in Undecidability.Shared.Libs.PSL.Lists.Removal]
in_O_t__E [in Complexity.HierarchyTheorem.TimeHierarchyTheorem]
In_list_assoc [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
in_prefix_1 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
in_prefix_0 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
In_list_in_map_inv [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
In_list_in_map [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
in_concat_iff [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
In_perm [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
In_list_repeat [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
in_list_injective_1 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
in_list_injective_0 [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
In_In_t [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
In_t_In [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
in_concat_iff [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
in_cons_neq [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
in_sing [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
in_filter_iff [in Undecidability.Shared.Libs.PSL.Lists.Filter]
in_out_interval_dec [in Undecidability.Shared.Libs.DLW.Utils.interval]
in_out_interval [in Undecidability.Shared.Libs.DLW.Utils.interval]
in_repeat_iff [in Complexity.L.TM.TMflatComp]
in_dedup_iff [in Complexity.NP.SAT.SAT_inNP]
in_intersect_iff [in Complexity.NP.SAT.SAT_inNP]
in_undup_iff [in Undecidability.Shared.Libs.PSL.FiniteTypes.Arbitrary]
in_allnVecs [in Complexity.L.TM.TMflatten]
in_mkArgList_iff [in Complexity.L.TM.TMflatten]
in_vec_prod_iff [in Complexity.L.TM.TMflatten]
in_flattenHalt'_iff [in Complexity.L.TM.TMflatten]
in_prodLists_iff [in Complexity.L.TM.TMflatten]
In_extend [in Complexity.L.AbstractMachines.AbstractHeapMachine]
in_encode_retract [in Undecidability.TM.Code.ChangeAlphabet]
In_cumul [in Undecidability.Synthetic.ListEnumerabilityFacts]
in_finalSubstrings_iff [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
in_flat_haltingStates_iff [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
in_makeCards_iff [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
in_makeCardsP_iff [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
in_makeAllEvalEnv_iff [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
in_mkVarEnv_iff [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
in_list_prod_iff [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
in_toAssignment_iff [in Complexity.NP.Clique.kSAT_to_Clique]
in_concat_iff [in Undecidability.Shared.ListAutomation]
in_nat_sorted_3 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
in_nat_sorted_2 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
in_nat_sorted_1 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
in_nat_sorted_0 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
in_code_subcode [in Undecidability.Shared.Libs.DLW.Code.subcode]
in_out_code_dec [in Undecidability.Shared.Libs.DLW.Code.subcode]
in_out_code [in Undecidability.Shared.Libs.DLW.Code.subcode]
in_sss_step [in Undecidability.Shared.Libs.DLW.Code.sss]
in_makeEdges_iff [in Complexity.NP.Clique.kSAT_to_FlatClique]
in_allPositions_iff [in Complexity.NP.Clique.kSAT_to_FlatClique]
in_concat_map_iff [in Complexity.Libs.CookPrelim.MorePrelim]
In_explicit [in Complexity.Libs.CookPrelim.MorePrelim]
in_filter_iff [in Complexity.Libs.CookPrelim.MorePrelim]
in_filterSome_iff [in Complexity.Libs.CookPrelim.MorePrelim]
in_prodLists_iff [in Complexity.Libs.CookPrelim.MorePrelim]
in_remove_iff [in Complexity.Libs.CookPrelim.MorePrelim]
ireduces_dependent [in Undecidability.Synthetic.InformativeReducibilityFacts]
ireduces_reduces [in Undecidability.Synthetic.InformativeReducibilityFacts]
ireduces_transitive [in Undecidability.Synthetic.InformativeReducibilityFacts]
ireduces_reflexive [in Undecidability.Synthetic.InformativeReducibilityFacts]
isBoundTransTable_poly [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
isBoundTransTable_time_bound [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
isBoundTransTable_spec [in Complexity.L.TM.TMunflatten]
isBoundTrans_poly [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
isBoundTrans_time_bound [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
isClique_clausesOf_dupfree [in Complexity.NP.Clique.kSAT_to_Clique]
IsCons_Sem [in Undecidability.TM.Single.StepTM]
isfClique_decb_poly [in Complexity.NP.Clique.FlatClique]
isfClique_decb_time_bound [in Complexity.NP.Clique.FlatClique]
isfClique_decb_iff [in Complexity.NP.Clique.FlatClique]
IsFinal_Readcurrent_size_nice [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
IsFinal_size_nice [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
IsFinal_Terminates [in Undecidability.TM.Univ.LowLevel]
IsFinal_Realise [in Undecidability.TM.Univ.LowLevel]
IsFinal_SpecT_space [in Undecidability.TM.Univ.Univ]
isfKClique_decb_poly [in Complexity.NP.Clique.FlatClique]
isfKClique_decb_time_bound [in Complexity.NP.Clique.FlatClique]
isfKClique_decb_iff [in Complexity.NP.Clique.FlatClique]
isFlatCardsOf_hom_agree [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
isFlatCCCardOf_hom_agree [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
isFlatCCOf_equivalence [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
isFlatCCOf_wf_equivalent [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
isFlatCCOf_isValidFlattening [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
isFlatEdgesOf_fedges_wf [in Complexity.NP.Clique.FlatUGraph]
isFlatEnvOf_bound_card_transfer [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
isFlatEnvOf_bound_Alphabet_transfer [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
isFlatFinalOf_hom_agree [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
isFlatGraphOf_wf [in Complexity.NP.Clique.FlatUGraph]
isFlatListOf_list_finReprEl' [in Complexity.Libs.CookPrelim.FlatFinTypes]
isFlatListOf_list_ofFlatType [in Complexity.Libs.CookPrelim.FlatFinTypes]
isFlatListOf_incl2 [in Complexity.Libs.CookPrelim.FlatFinTypes]
isFlatListOf_incl1 [in Complexity.Libs.CookPrelim.FlatFinTypes]
isFlatListOf_Some1 [in Complexity.Libs.CookPrelim.FlatFinTypes]
isFlatListOf_injective [in Complexity.Libs.CookPrelim.FlatFinTypes]
isFlatListOf_functional [in Complexity.Libs.CookPrelim.FlatFinTypes]
isFlatListOf_app [in Complexity.Libs.CookPrelim.FlatFinTypes]
isFlatListOf_cons [in Complexity.Libs.CookPrelim.FlatFinTypes]
isFlatListOf_hom_agree [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
isFlatListOf_app_inv [in Complexity.NP.SAT.CookLevin.Subproblems.SingleTMGenNP]
isFlatListOf_rev [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
isFlatListOf_single [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
isFlatListOf_list_finReprEl [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
isFlatTCardsOf_concat [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
isFlatTCCCardOf_map_index [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
isFlatTCCOf_equivalence [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
isFlatTCCOf_wf_equivalent [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
isFlatTCCOf_isValidFlattening [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
isFlatteningConfigOf_iff [in Complexity.L.TM.TMflat]
isFlatteningTapesOf_iff [in Complexity.L.TM.TMflat]
isFlatteningTransOf_eq [in Complexity.L.TM.TMflatFun]
isFlatteningTrans_validFlatTrans [in Complexity.L.TM.TMunflatten]
isFlattening_is_valid [in Complexity.L.TM.TMunflatten]
isfVertex_decb_iff [in Complexity.NP.Clique.FlatUGraph]
isInjFinfuncTable_poly [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
isInjFinfuncTable_time_bound [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
isInjFinfuncTable_spec [in Complexity.L.TM.TMunflatten]
IsNil_Sem [in Undecidability.TM.Code.CaseList]
IsOne_Sem [in Undecidability.TM.Code.BinNumbers.PosShiftTM]
isRule_length [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
isRule_length [in Complexity.NP.SAT.CookLevin.Subproblems.CC]
isStateSym_isSpecStateSym [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
isUnflattableTape [in Complexity.L.TM.TMunflatten]
isUnflattableTapes [in Complexity.L.TM.TMunflatten]
isValidCert_sizeOfTape [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
isValidFlatCards_app [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
isValidFlatTape_time_le [in Complexity.L.TM.TMflatComp]
isValidFlatTape_spec [in Complexity.L.TM.TMunflatten]
isValidFlatteningDec_poly [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
isValidFlattening_dec_time_bound [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
isValidFlattening_dec_correct [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
isValidFlatTM_poly [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
isValidFlatTM_time_bound [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
isValidFlatTM_spec [in Complexity.L.TM.TMunflatten]
isValidFlatTrans_poly [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
isValidFlatTrans_time_bound [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
isValidFlatTrans_spec [in Complexity.L.TM.TMunflatten]
isVoid_size_sizeOfTape [in Undecidability.TM.Code.CodeTM]
isVoid_isVoid_size [in Undecidability.TM.Code.CodeTM]
isVoid_size_left [in Undecidability.TM.Code.CodeTM]
isVoid_size_right [in Undecidability.TM.Code.CodeTM]
isVoid_right [in Undecidability.TM.Code.CodeTM]
isVoid_size_monotone [in Undecidability.TM.Code.CodeTM]
isVoid_size_isVoid [in Undecidability.TM.Code.CodeTM]
isVoid_size_hasSize [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
is_halt_state_correct [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
is_halt_state_halt [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
is_rel_prime_expo [in Undecidability.Shared.Libs.DLW.Utils.prime]
is_rel_prime_mult [in Undecidability.Shared.Libs.DLW.Utils.prime]
is_digit_fun [in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
is_gcd_rem [in Undecidability.Shared.Libs.DLW.Utils.gcd]
is_lcm_moduplus [in Undecidability.Shared.Libs.DLW.Utils.gcd]
is_lcm_plus [in Undecidability.Shared.Libs.DLW.Utils.gcd]
is_lcm_modulus [in Undecidability.Shared.Libs.DLW.Utils.gcd]
is_lcm_minus [in Undecidability.Shared.Libs.DLW.Utils.gcd]
is_gcd_mult_lcm [in Undecidability.Shared.Libs.DLW.Utils.gcd]
is_gcd_lcm_mult [in Undecidability.Shared.Libs.DLW.Utils.gcd]
is_lcm_mult [in Undecidability.Shared.Libs.DLW.Utils.gcd]
is_gcd_rel_prime [in Undecidability.Shared.Libs.DLW.Utils.gcd]
is_gcd_0 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
is_rel_prime_lcm [in Undecidability.Shared.Libs.DLW.Utils.gcd]
is_rel_prime_div_r [in Undecidability.Shared.Libs.DLW.Utils.gcd]
is_rel_prime_div [in Undecidability.Shared.Libs.DLW.Utils.gcd]
is_lcm_fun [in Undecidability.Shared.Libs.DLW.Utils.gcd]
is_lcm_sym [in Undecidability.Shared.Libs.DLW.Utils.gcd]
is_lcm_0r [in Undecidability.Shared.Libs.DLW.Utils.gcd]
is_lcm_0l [in Undecidability.Shared.Libs.DLW.Utils.gcd]
is_gcd_fun [in Undecidability.Shared.Libs.DLW.Utils.gcd]
is_gcd_refl [in Undecidability.Shared.Libs.DLW.Utils.gcd]
is_gcd_div [in Undecidability.Shared.Libs.DLW.Utils.gcd]
is_gcd_mult [in Undecidability.Shared.Libs.DLW.Utils.gcd]
is_gcd_plus [in Undecidability.Shared.Libs.DLW.Utils.gcd]
is_gcd_moduplus [in Undecidability.Shared.Libs.DLW.Utils.gcd]
is_gcd_minus [in Undecidability.Shared.Libs.DLW.Utils.gcd]
is_gcd_modulus [in Undecidability.Shared.Libs.DLW.Utils.gcd]
is_gcd_1r [in Undecidability.Shared.Libs.DLW.Utils.gcd]
is_gcd_1l [in Undecidability.Shared.Libs.DLW.Utils.gcd]
is_gcd_0r [in Undecidability.Shared.Libs.DLW.Utils.gcd]
is_gcd_0l [in Undecidability.Shared.Libs.DLW.Utils.gcd]
is_gcd_sym [in Undecidability.Shared.Libs.DLW.Utils.gcd]
iterupN_lt [in Complexity.L.Functions.IterupN]
iterupN_geq [in Complexity.L.Functions.IterupN]
iterupN_eq [in Complexity.L.Functions.IterupN]
iter_S [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
iter_swap [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
iter_plus [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
iter_list_bool_next_nil [in Undecidability.Shared.Libs.DLW.Utils.list_bool]
it_fp [in Undecidability.Shared.Libs.PSL.Numbers]
it_ind [in Undecidability.Shared.Libs.PSL.Numbers]
I_proc [in Undecidability.L.Tactics.Lsimpl]
I_neq_Omega [in Undecidability.L.Computability.Scott]

J

join_extension_formula_sat [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
join_extension_cnf_sat [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
join_extension_clause_sat [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
join_extension_literal_sat [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
join_extension_var_sat [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
JumpTarget_steps_nice.JumpTarget_steps_nice [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
JumpTarget_steps_nice.JumpTarget_Loop_steps_nice [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
JumpTarget_steps_nice.JumpTarget_Step_steps_nice' [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
JumpTarget_steps_nice.JumpTarget_Step_steps_nice [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
JumpTarget_steps_nice.JumpTarget_Step_steps_CaseList_nice [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
JumpTarget_steps_nice.JumpTarget_Step_steps_CaseCom_nice [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
JumpTarget_steps_nice.App_Com_steps_nice [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
JumpTarget_steps_nice.App_ACom_steps_nice [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
JumpTarget_steps_nice.App_steps_nice [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
jumpTarget_correct [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
jumpTarget_eq [in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisStep]
jumpTarget_correct [in Undecidability.L.AbstractMachines.FlatPro.Programs]
JumpTarget_Terminates [in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
JumpTarget_Realise [in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
JumpTarget_Loop_Terminates [in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
JumpTarget_Loop_Realise [in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
JumpTarget_Step_Terminates [in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
JumpTarget_Step_Realise [in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]

K

kCNF_decb_poly [in Complexity.NP.SAT.kSAT]
kCNF_decb_time_bound [in Complexity.NP.SAT.kSAT]
kCNF_decb_iff [in Complexity.NP.SAT.kSAT]
kCNF_app [in Complexity.NP.SAT.kSAT]
kCNF_clause_length [in Complexity.NP.SAT.kSAT]
kflat_poly [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
kflat_time_bound [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
kflat_k_eq [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
knowsFirstSymbols_all' [in Undecidability.TM.Single.StepTM]
knowsFirstSymbols_all [in Undecidability.TM.Single.StepTM]
knowsFirstSymbols_nil [in Undecidability.TM.Single.StepTM]
kSAT_to_FlatClique [in Complexity.NP.SAT.CookLevin]
kSAT_reduces_to_Clique [in Complexity.NP.Clique.kSAT_to_Clique]
kSAT_to_SAT [in Complexity.NP.SAT.kSAT_to_SAT]
kSAT_to_FlatClique_poly [in Complexity.NP.Clique.kSAT_to_FlatClique]
kSAT_reduces_to_FlatClique [in Complexity.NP.Clique.kSAT_to_FlatClique]
K_proc [in Undecidability.L.Tactics.Lsimpl]

L

lacc_disj [in Undecidability.L.Computability.Acceptability]
lacc_conj [in Undecidability.L.Computability.Acceptability]
lambdab_spec [in Undecidability.L.Functions.Proc]
lambdaDepthP_compile [in Complexity.L.AbstractMachines.LambdaDepth]
lambdaDepthP_compile' [in Complexity.L.AbstractMachines.LambdaDepth]
lambdaDepthP_min [in Complexity.L.AbstractMachines.LambdaDepth]
lambda_lam [in Undecidability.L.Util.L_facts]
lamOmega [in Undecidability.L.Computability.Rice]
lam_terminal [in Undecidability.L.Util.L_facts]
lam_app_proper [in Undecidability.L.Tactics.Lbeta_nonrefl]
largestVarC_V_leq [in Complexity.L.AbstractMachines.AbstractHeapMachine]
largestVarH_leq [in Complexity.L.AbstractMachines.AbstractHeapMachine]
largestVarH_bound [in Complexity.L.AbstractMachines.AbstractHeapMachine]
largestVarTR_correct [in Complexity.L.AbstractMachines.Computable.LargestVar]
largestVarTR'_fuel_leq_largestVar [in Complexity.L.AbstractMachines.Computable.LargestVar]
largestVarTR'_correct [in Complexity.L.AbstractMachines.Computable.LargestVar]
largestVar_compile [in Undecidability.L.AbstractMachines.FlatPro.Programs]
largestVar_start [in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
largestVar_size [in Undecidability.L.AbstractMachines.LargestVar]
largestVar_term [in Undecidability.L.AbstractMachines.LargestVar]
largestVar_nat [in Undecidability.L.AbstractMachines.LargestVar]
largestVar_prod [in Undecidability.L.AbstractMachines.LargestVar]
last_app_eq [in Complexity.TM.Single.EncodeTapesInvariants]
last_not_default [in Complexity.TM.Compound.MoveToSymbol_niceSpec]
last_app [in Undecidability.TM.Code.BinNumbers.PosShiftTM]
LA_In_f_times_step [in Complexity.HierarchyTheorem.TimeHierarchyTheorem]
LA_In_f_times_step' [in Complexity.HierarchyTheorem.TimeHierarchyTheorem]
LA_In_f_times_step [in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
lb_shift_ortho_meet [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
lb_shift_ortho [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
lb_shift_join [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
lb_shift_meet [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
lb_nat_shift [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
lb_shift_S [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
lb_shift_0 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
lb_join_dio [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
lb_meet_dio [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
lb_minus_plus [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
lb_ortho_plus_id [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
lb_ortho_plus_join [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
lb_ortho_plus [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
lb_plus_spec_0 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
lb_plus_spec [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
lb_plus_fix_2 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
lb_plus_fix_1 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
lb_plus_fix_0 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
lb_succ_bot [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
lb_succ_spec [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
lb_succ_spec_1 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
lb_succ_spec_0 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
lb_mask_equiv_equal [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
lb_mask_eq_binary_le [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
lb_mask_nat [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
lb_nat_lb [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
lb_mask_binary_le [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
lb_nat_app [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
lb_nat_fix_3 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
lb_nat_fix_2 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
lb_nat_fix_1 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
lb_nat_fix_0 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
lb_ortho_mask_nil [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
lb_ortho_join [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
lb_join_nil_eq [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
lb_join_meet_idem [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
lb_meet_join_idem [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
lb_meet_spec [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
lb_join_spec [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
lb_join_assoc [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
lb_meet_assoc [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
lb_meet_join_distr [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
lb_join_meet_distr [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
lb_join_idem [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
lb_meet_idem [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
lb_mask_meet [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
lb_mask_join [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
lb_meet_dec_right [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
lb_join_inc_right [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
lb_meet_dec_left [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
lb_join_inc_left [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
lb_ortho_meet_nil [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
lb_join_mono [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
lb_join_length_le [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
lb_join_cons [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
lb_join_right [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
lb_join_comm [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
lb_join_left [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
lb_meet_app [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
lb_meet_length [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
lb_meet_length_le [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
lb_meet_mono [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
lb_meet_cons [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
lb_meet_right [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
lb_meet_comm [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
lb_meet_left [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
lb_pointwise_mono_left [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
lb_pointwise_sym [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
lb_pointwise_length [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
lb_pointwise_cons [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
lb_pointwise_right [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
lb_pointwise_left [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
lb_pointwise_nil [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
lb_ortho_anti [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
lb_ortho_sym [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
lb_ortho_anti_left [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
lb_ortho_cons_inv [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
lb_mask_equiv_app [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
lb_mask_app [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
lb_mask_equiv_trans [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
lb_mask_equiv_sym [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
lb_mask_equiv_refl [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
lb_mask_trans [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
lb_mask_refl [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
lb_mask_inv_cons_cons [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
lb_mask_inv_cons_nil [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
lb_mask_inv_cons [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
lb_mask_inv_left [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
lb_mask_inv_nil [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
lcm_spec [in Undecidability.Shared.Libs.DLW.Utils.gcd]
lcomp_comp [in Undecidability.L.Computability.Computability]
ldec_disj [in Undecidability.L.Computability.Decidability]
ldec_conj [in Undecidability.L.Computability.Decidability]
ldec_complement [in Undecidability.L.Computability.Decidability]
ldec_proc [in Undecidability.L.Functions.Proc]
ldec_closed [in Undecidability.L.Functions.Proc]
ldec_lambda [in Undecidability.L.Functions.Proc]
leb_iff [in Complexity.Libs.CookPrelim.FlatFinTypes]
leb_strict [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
leb_trans [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
leb_refl [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
leb_time_bound_r [in Complexity.Libs.CookPrelim.PolyBounds]
leb_time_bound_l [in Complexity.Libs.CookPrelim.PolyBounds]
Leftmost_space_bounds_time [in Complexity.Complexity.SpaceBoundsTime]
Leftmost.redWithMaxSizeL_congR [in Undecidability.L.Complexity.ResourceMeasures]
Leftmost.redWithMaxSizeL_congL [in Undecidability.L.Complexity.ResourceMeasures]
Leftmost.spaceBS_eval [in Undecidability.L.Complexity.ResourceMeasures]
Leftmost.spaceBS_correct_lm [in Undecidability.L.Complexity.ResourceMeasures]
Leftmost.spaceBS_ge [in Undecidability.L.Complexity.ResourceMeasures]
Leftmost.step_lm_evaluatesSpace [in Undecidability.L.Complexity.ResourceMeasures]
Leftmost.step_lm_evaluatesIn [in Undecidability.L.Complexity.ResourceMeasures]
Leftmost.step_lm_functional [in Undecidability.L.Complexity.ResourceMeasures]
Leftmost.timeBS_correct_lm [in Undecidability.L.Complexity.ResourceMeasures]
left_inv_inj [in Undecidability.Shared.Libs.PSL.Bijection]
lengthEq_spec [in Undecidability.L.Datatypes.List.List_extra]
Length_steps_nice [in Complexity.TM.PrettyBounds.BaseCode]
Length_Loop_steps_nice [in Complexity.TM.PrettyBounds.BaseCode]
Length_Step_steps_nice_cons [in Complexity.TM.PrettyBounds.BaseCode]
Length_Step_steps_nice_nil [in Complexity.TM.PrettyBounds.BaseCode]
length_cons [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
length_nil [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
length_tape_local_right [in Undecidability.TM.PrettyBounds.SizeBounds]
Length_steps_nice [in Undecidability.TM.Code.List.Length]
Length_Loop_steps_nice [in Undecidability.TM.Code.List.Length]
Length_Terminates [in Undecidability.TM.Code.List.Length]
Length_Computes [in Undecidability.TM.Code.List.Length]
Length_Loop_Terminates [in Undecidability.TM.Code.List.Length]
Length_Loop_Realise [in Undecidability.TM.Code.List.Length]
Length_Step_Terminates [in Undecidability.TM.Code.List.Length]
Length_Step_Realise [in Undecidability.TM.Code.List.Length]
length_compiler_app [in Undecidability.Shared.Libs.DLW.Code.compiler]
Length_size_nice [in Complexity.TM.PrettyBounds.BaseCodeSpace]
Length_Loop_size_nice [in Complexity.TM.PrettyBounds.BaseCodeSpace]
Length_Step_size_nice [in Complexity.TM.PrettyBounds.BaseCodeSpace]
length_TV [in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisStep]
length_H [in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisStep]
length_le_and_incl_implies_dup_or_perm [in Undecidability.Shared.Libs.DLW.Utils.php]
length_compile_leq [in Undecidability.L.AbstractMachines.FlatPro.Programs]
length_TV [in Complexity.L.AbstractMachines.AbstractHeapMachine]
length_H [in Complexity.L.AbstractMachines.AbstractHeapMachine]
length_app_decompose [in Complexity.Libs.CookPrelim.MorePrelim]
length_concat [in Undecidability.L.Prelim.MoreList]
leToC_eta [in Undecidability.L.Complexity.UpToCNary]
leUpToC_clean [in Undecidability.TM.Code.List.Concat_Repeat]
leUpToC_finCases_nary [in Undecidability.L.Complexity.UpToCNary]
leUpToC_finCases [in Undecidability.L.Complexity.UpToC]
le_ge [in Complexity.TM.PrettyBounds.M2MBounds]
le_add_l [in Complexity.Libs.CookPrelim.PolyBounds]
le_add_l [in Complexity.Complexity.UpToCPoly]
le_length_sizeP [in Undecidability.L.AbstractMachines.FlatPro.Programs]
le_pirr [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
LiftAlphabet_RealiseIn [in Undecidability.TM.Lifting.LiftAlphabet]
LiftAlphabet_TerminatesIn [in Undecidability.TM.Lifting.LiftAlphabet]
LiftAlphabet_unlift [in Undecidability.TM.Lifting.LiftAlphabet]
LiftAlphabet_Realise [in Undecidability.TM.Lifting.LiftAlphabet]
LiftAlphabet_lift [in Undecidability.TM.Lifting.LiftAlphabet]
LiftAlphabet_comp_step [in Undecidability.TM.Lifting.LiftAlphabet]
lifted_preludeInitialString [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
lifth_comp' [in Undecidability.TM.Combinators.StateWhile]
lifth_comp [in Undecidability.TM.Combinators.StateWhile]
liftOrig_relpower_p [in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
liftOrig_valid_p [in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
liftPhi_correct [in Undecidability.L.Tactics.Reflection]
liftPrelude_subs_combP [in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
LiftSpec_withSpace [in Undecidability.TM.Hoare.HoareRegister]
LiftSpec_withSpace_single [in Undecidability.TM.Hoare.HoareRegister]
LiftSpec_surjectTapes_tspec' [in Undecidability.TM.Hoare.HoareRegister]
LiftSpec_surjectTapes_tspec [in Undecidability.TM.Hoare.HoareRegister]
LiftSpec_surjectTape_tspec_single' [in Undecidability.TM.Hoare.HoareRegister]
LiftSpec_surjectTape_tspec_single [in Undecidability.TM.Hoare.HoareRegister]
LiftTapes_SpecT_space_con [in Undecidability.TM.Hoare.HoareRegister]
LiftTapes_Spec_space_con [in Undecidability.TM.Hoare.HoareRegister]
LiftTapes_SpecT_space [in Undecidability.TM.Hoare.HoareRegister]
LiftTapes_Spec_space [in Undecidability.TM.Hoare.HoareRegister]
LiftTapes_SpecT_con [in Undecidability.TM.Hoare.HoareRegister]
LiftTapes_SpecT [in Undecidability.TM.Hoare.HoareRegister]
LiftTapes_Spec_con [in Undecidability.TM.Hoare.HoareRegister]
LiftTapes_Spec [in Undecidability.TM.Hoare.HoareRegister]
LiftTapes_Spec_ex [in Undecidability.TM.Hoare.HoareRegister]
LiftTapes_RealiseIn [in Undecidability.TM.Lifting.LiftTapes]
LiftTapes_Terminates [in Undecidability.TM.Lifting.LiftTapes]
LiftTapes_unlift [in Undecidability.TM.Lifting.LiftTapes]
LiftTapes_Realise [in Undecidability.TM.Lifting.LiftTapes]
LiftTapes_eq [in Undecidability.TM.Lifting.LiftTapes]
LiftTapes_comp_eq [in Undecidability.TM.Lifting.LiftTapes]
LiftTapes_lift [in Undecidability.TM.Lifting.LiftTapes]
LiftTapes_comp_step [in Undecidability.TM.Lifting.LiftTapes]
lift_final [in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
lift_initc [in Undecidability.TM.Combinators.Switch]
lift_init [in Undecidability.TM.Combinators.StateWhile]
linDec_polyTimeComputable [in Complexity.Complexity.Definitions]
linker_out_err [in Undecidability.Shared.Libs.DLW.Code.compiler]
linker_out_code [in Undecidability.Shared.Libs.DLW.Code.compiler]
linker_code_end [in Undecidability.Shared.Libs.DLW.Code.compiler]
linker_middle [in Undecidability.Shared.Libs.DLW.Code.compiler]
linker_code_start [in Undecidability.Shared.Libs.DLW.Code.compiler]
linker_in_code [in Undecidability.Shared.Libs.DLW.Code.compiler]
linker_err_code [in Undecidability.Shared.Libs.DLW.Code.compiler]
linker_app [in Undecidability.Shared.Libs.DLW.Code.compiler]
link_fst [in Undecidability.Shared.Libs.DLW.Code.compiler]
link_app [in Undecidability.Shared.Libs.DLW.Code.compiler]
listAnd_size [in Complexity.NP.SAT.FSAT.FormulaEncoding]
listAnd_varsIn [in Complexity.NP.SAT.FSAT.FormulaEncoding]
listAnd_sat_iff [in Complexity.NP.SAT.FSAT.FormulaEncoding]
listOr_size [in Complexity.NP.SAT.FSAT.FormulaEncoding]
listOr_varsIn [in Complexity.NP.SAT.FSAT.FormulaEncoding]
listOr_sat_iff [in Complexity.NP.SAT.FSAT.FormulaEncoding]
list_ofFlatType_repEl [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
list_ofFlatType_map [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
list_ofFlatType_rev [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
list_prod_length [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
list_prod_poly [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
list_prod_time_bound [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
list_vec_iso [in Undecidability.Shared.Libs.DLW.Vec.vec]
list_dec [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
list_first_dec [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
list_choose_dec [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
list_assoc_app [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
list_assoc_In [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
list_assoc_neq [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
list_assoc_eq [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
list_split_middle [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
list_pick [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
list_split_length [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
list_app_inj [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
list_cons_app_cons_eq_inv [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
list_app_cons_eq_inv [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
list_app_eq_inv [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
list_repeat_length [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
list_repeat_plus [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
list_app_head_not_nil [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
list_injective_map [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
list_injective_rect [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
list_injective_inv [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
list_upper_bound [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
list_an_duplicate_inv [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
list_an_app_inv [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
list_an_spec [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
list_an_length [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
list_an_plus [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
list_an_S [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
list_eq_nth_error [in Undecidability.TM.Util.VectorPrelim]
list_cc [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
list_exists_not_incl [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
list_exists_DM [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
list_cycle [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
list_encode_prefixInjective [in Complexity.TM.Code.DecodeList]
list_discrete_bij_nat [in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
list_discrete_bij_pos [in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
list_discr_pos_n [in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
list_ofFlatType_dec_poly [in Complexity.Libs.CookPrelim.FlatFinTypes]
list_ofFlatType_dec_time_bound [in Complexity.Libs.CookPrelim.FlatFinTypes]
list_ofFlatType_dec_correct [in Complexity.Libs.CookPrelim.FlatFinTypes]
list_ofFlatType_cons [in Complexity.Libs.CookPrelim.FlatFinTypes]
list_ofFlatType_app [in Complexity.Libs.CookPrelim.FlatFinTypes]
list_forall_exists [in Undecidability.Shared.FinTypeForallExists]
list_incl_dupfree_size [in Complexity.Libs.CookPrelim.PolyBounds]
list_rem_size_le [in Complexity.Libs.CookPrelim.PolyBounds]
list_dupfree_incl_length [in Complexity.Libs.CookPrelim.PolyBounds]
list_incl_decb_poly [in Complexity.Libs.CookPrelim.PolyBounds]
list_incl_decb_time_bound [in Complexity.Libs.CookPrelim.PolyBounds]
list_in_decb_poly [in Complexity.Libs.CookPrelim.PolyBounds]
list_in_decb_time_bound [in Complexity.Libs.CookPrelim.PolyBounds]
list_size_of_el [in Complexity.Libs.CookPrelim.PolyBounds]
list_size_enc_length [in Complexity.Libs.CookPrelim.PolyBounds]
list_size_length [in Complexity.Libs.CookPrelim.PolyBounds]
list_size_concat [in Complexity.Libs.CookPrelim.PolyBounds]
list_size_app [in Complexity.Libs.CookPrelim.PolyBounds]
list_size_cons [in Complexity.Libs.CookPrelim.PolyBounds]
list_subsequence_size_bound [in Complexity.Libs.CookPrelim.PolyBounds]
list_app_size_r [in Complexity.Libs.CookPrelim.PolyBounds]
list_app_size_l [in Complexity.Libs.CookPrelim.PolyBounds]
list_size_at_least [in Complexity.Libs.CookPrelim.PolyBounds]
list_app_size [in Complexity.Libs.CookPrelim.PolyBounds]
list_el_size_bound [in Complexity.Libs.CookPrelim.PolyBounds]
list_bool_next_total [in Undecidability.Shared.Libs.DLW.Utils.list_bool]
list_bool_succ_rect [in Undecidability.Shared.Libs.DLW.Utils.list_bool]
list_bool_succ_nat [in Undecidability.Shared.Libs.DLW.Utils.list_bool]
list_bool_next_neq_nil [in Undecidability.Shared.Libs.DLW.Utils.list_bool]
list_bool_succ_neq_nil [in Undecidability.Shared.Libs.DLW.Utils.list_bool]
list_bool_succ_neq [in Undecidability.Shared.Libs.DLW.Utils.list_bool]
list_bool_succ_nil [in Undecidability.Shared.Libs.DLW.Utils.list_bool]
list_bool_succ_fun [in Undecidability.Shared.Libs.DLW.Utils.list_bool]
list_One_inj [in Undecidability.Shared.Libs.DLW.Utils.list_bool]
list_One_Zero_not [in Undecidability.Shared.Libs.DLW.Utils.list_bool]
list_One_Zero_inj [in Undecidability.Shared.Libs.DLW.Utils.list_bool]
list_bool_nat_ge_1 [in Undecidability.Shared.Libs.DLW.Utils.list_bool]
list_bool_valid_dec [in Undecidability.Shared.Libs.DLW.Utils.list_bool]
list_bool_decomp [in Undecidability.Shared.Libs.DLW.Utils.list_bool]
list_bool_choose_sym [in Undecidability.Shared.Libs.DLW.Utils.list_bool]
list_bool_choose [in Undecidability.Shared.Libs.DLW.Utils.list_bool]
list_bool_dec [in Undecidability.Shared.Libs.DLW.Utils.list_bool]
list_length_neq [in Undecidability.TM.Code.CompareValue]
list_incl_dupfree_size [in Complexity.Complexity.UpToCPoly]
list_rem_size_le [in Complexity.Complexity.UpToCPoly]
list_dupfree_incl_length [in Complexity.Complexity.UpToCPoly]
list_size_of_el [in Complexity.Complexity.UpToCPoly]
list_size_enc_length [in Complexity.Complexity.UpToCPoly]
list_size_length [in Complexity.Complexity.UpToCPoly]
list_size_concat [in Complexity.Complexity.UpToCPoly]
list_size_app [in Complexity.Complexity.UpToCPoly]
list_size_cons [in Complexity.Complexity.UpToCPoly]
list_subsequence_size_bound [in Complexity.Complexity.UpToCPoly]
list_app_size_r [in Complexity.Complexity.UpToCPoly]
list_app_size_l [in Complexity.Complexity.UpToCPoly]
list_size_at_least [in Complexity.Complexity.UpToCPoly]
list_app_size [in Complexity.Complexity.UpToCPoly]
list_el_size_bound [in Complexity.Complexity.UpToCPoly]
list_exists [in Undecidability.Shared.Libs.DLW.Utils.php]
list_has_dup_map_inv [in Undecidability.Shared.Libs.DLW.Utils.php]
list_has_dup_eq_duplicates [in Undecidability.Shared.Libs.DLW.Utils.php]
list_has_dup_app_inv [in Undecidability.Shared.Libs.DLW.Utils.php]
list_has_dup_app_right [in Undecidability.Shared.Libs.DLW.Utils.php]
list_has_dup_app_left [in Undecidability.Shared.Libs.DLW.Utils.php]
list_hd_cons_inv [in Undecidability.Shared.Libs.DLW.Utils.php]
list_sum_le_max_times_length [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
list_sum_le_upperBound_times_length [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
list_sum_shift [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
list_prod_spec [in Undecidability.Shared.Libs.DLW.Utils.fin_base]
list_eqbTime_bound_r [in Undecidability.L.Datatypes.List.List_eqb]
list_eqb_spec [in Undecidability.L.Datatypes.List.List_eqb]
list_bound [in Complexity.L.AbstractMachines.AbstractHeapMachine]
list_enumerator_to_cumul [in Undecidability.Synthetic.ListEnumerabilityFacts]
list_enumerable__T_enumerable [in Undecidability.Synthetic.ListEnumerabilityFacts]
list_enumerable_enumerable [in Undecidability.Synthetic.ListEnumerabilityFacts]
list_enumerator_enumerator [in Undecidability.Synthetic.ListEnumerabilityFacts]
list_enumerator_to_enumerator [in Undecidability.Synthetic.ListEnumerabilityFacts]
list_choose_dep [in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
list_choose_d [in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
list_incl_decb_iff' [in Undecidability.L.Datatypes.List.List_in]
list_incl_decb_iff [in Undecidability.L.Datatypes.List.List_in]
list_in_decb_iff' [in Undecidability.L.Datatypes.List.List_in]
list_in_decb_iff [in Undecidability.L.Datatypes.List.List_in]
list_isFlatEnvOf_map [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
list_length_le3 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
list_length_le2 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
list_length_le1 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
list_length_le0 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
list_dec_choose_one [in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
list_discrete_choice [in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
list_reif_t [in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
list_has_dup_seteq [in Undecidability.Shared.Libs.DLW.Utils.seteq]
list_eqn_length [in Complexity.Libs.CookPrelim.MorePrelim]
list_eq_nth_error [in Complexity.Libs.CookPrelim.MorePrelim]
list_eq_length [in Complexity.Libs.CookPrelim.MorePrelim]
list_length_split2 [in Complexity.Libs.CookPrelim.MorePrelim]
list_length_split1 [in Complexity.Libs.CookPrelim.MorePrelim]
literalInClause_exists_vertex [in Complexity.NP.Clique.kSAT_to_Clique]
literalsConflict_dec [in Complexity.NP.Clique.kSAT_to_Clique]
literalsConflict_symm [in Complexity.NP.Clique.kSAT_to_Clique]
literalsConflict_decb_iff [in Complexity.NP.Clique.kSAT_to_FlatClique]
LL_F [in Undecidability.Synthetic.Infinite]
LL_f [in Undecidability.Synthetic.Infinite]
LL_cum [in Undecidability.Synthetic.Infinite]
lmax_prop [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
lmax_spec [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
LMGenNP_to_TMGenNP [in Complexity.NP.SAT.CookLevin]
LMGenNP_to_TMGenNP_mTM [in Complexity.NP.TM.LM_to_mTM]
LMtoTM.size_compile_list_bool [in Complexity.NP.TM.M_LM2TM]
LM_Lookup_nice.heap_greatest_address_size [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
LM_Lookup_nice.Encode_list_hasSize_ge_max [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
LM_Lookup_nice.heap_greatest_address_bounded [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
LM_Lookup_nice.heap_global_greatest_address_ge [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
LM_Lookup_nice.heap_greatest_address_leq [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
LM_Lookup_nice.heap_greatest_address_invalid [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
LM_Lookup_nice.Lookup_steps_nice [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
LM_Lookup_nice.max_mult [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
LM_Lookup_nice.max_plus [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
LM_Lookup_nice.Encode_nat_hasSize_max [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
LM_Lookup_nice.ge1_mul [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
LM_Lookup_nice.heap_greatest_address_eq [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
LM_Lookup_nice.Lookup_steps_eq [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
LM_Lookup_nice.Lookup_Step_steps_nice [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
LM_Lookup_nice.Lookup_Step_steps_Nth'_nice [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
LM_Lookup_nice.Lookup_Step_steps_CaseOption_nice [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
LM_Lookup_nice.Lookup_Step_steps_CaseNat_nice [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
LM.ConsClos_steps_nice [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
LM.Encode_Heap_hasSize_ge_length [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
LM.heap_greatest_address_ge [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
LM.jumpTarget_size_fab [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
LM.jumpTarget_size [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
LM.jumpTarget_size' [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
LM.lookup_size [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
LM.Put_steps_nice [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
LM.size_length_heap [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
LM.Step_steps_nice [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
LM.Step_steps_CaseList_nice [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
LM.Step_steps_CaseList'_nice [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
LM.Step_steps_CaseCom_nice [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
LM.Step_var_steps_nice' [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
LM.Step_var_steps_Lookup_nice [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
LM.Step_app_steps_nice [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
LM.Step_app_steps_CaseList_nice [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
LM.Step_app_steps_CaseList'_nice [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
LM.Step_lam_steps_nice [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
LM.Step_lam_steps_nice' [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
LM.Step_lam_steps_JumpTarget_nice [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
LM.TailRec_steps_nice [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
logical [in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
lookupTime_mono [in Complexity.L.AbstractMachines.Computable.Lookup]
lookupTime_leq [in Undecidability.L.Functions.FinTypeLookup]
Lookup_size_nice [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
Lookup_Loop_size_nice [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
lookup_hd_incl [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
Lookup_Step_size_nice_neq [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
Lookup_Step_size_nice_eq [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
lookup_eq [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
lookup_el [in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisUnfoldClos]
lookup_extend [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
lookup_el [in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisStep]
lookup_graph [in Undecidability.TM.Univ.LowLevel]
lookup_map [in Undecidability.TM.Univ.LowLevel]
lookup_In' [in Undecidability.TM.Univ.LowLevel]
lookup_In [in Undecidability.TM.Univ.LowLevel]
lookup_sound' [in Complexity.L.TM.TMunflatten]
lookup_size [in Complexity.L.AbstractMachines.AbstractHeapMachine]
lookup_el [in Complexity.L.AbstractMachines.AbstractHeapMachine]
lookup_extend [in Complexity.L.AbstractMachines.AbstractHeapMachine]
lookup_index_vector_None [in Undecidability.TM.Lifting.LiftTapes]
lookup_index_vector_Some' [in Undecidability.TM.Lifting.LiftTapes]
lookup_index_vector_Some [in Undecidability.TM.Lifting.LiftTapes]
lookup_complete [in Undecidability.L.Functions.FinTypeLookup]
lookup_sound [in Undecidability.L.Functions.FinTypeLookup]
lookup_sound' [in Undecidability.L.Functions.FinTypeLookup]
lookup_funTable [in Undecidability.L.Functions.FinTypeLookup]
Lookup_Terminates [in Undecidability.TM.Univ.LookupAssociativeListTM]
Lookup_Realise [in Undecidability.TM.Univ.LookupAssociativeListTM]
Lookup_SpecT_space [in Undecidability.TM.Univ.LookupAssociativeListTM]
Lookup_Loop_SpecT_space [in Undecidability.TM.Univ.LookupAssociativeListTM]
Lookup_Step_SpecT_space [in Undecidability.TM.Univ.LookupAssociativeListTM]
Lookup_Terminates [in Undecidability.TM.L.HeapInterpreter.LookupTM]
Lookup_Realise [in Undecidability.TM.L.HeapInterpreter.LookupTM]
Lookup_SpecT_space [in Undecidability.TM.L.HeapInterpreter.LookupTM]
Lookup_size_eq [in Undecidability.TM.L.HeapInterpreter.LookupTM]
Lookup_Step_SpecT_space [in Undecidability.TM.L.HeapInterpreter.LookupTM]
lookup_complete [in Undecidability.Shared.Libs.PSL.FiniteTypes.FiniteFunction]
lookup_sound [in Undecidability.Shared.Libs.PSL.FiniteTypes.FiniteFunction]
loopMflat_time_nice [in Complexity.L.TM.TMflatComp]
loopMflat_correct [in Complexity.L.TM.TMflatFun]
loopM_halt' [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
loopM_halt [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
loopM_halt [in Complexity.NP.SAT.CookLevin.Subproblems.TM_single]
loopSum_rel_correct2 [in Undecidability.L.Prelim.LoopSum]
loopSum_sound_rel [in Undecidability.L.Prelim.LoopSum]
Loop_steps_nice [in Complexity.TM.PrettyBounds.M2MBounds]
Loop_steps_asym_bounded' [in Complexity.TM.PrettyBounds.M2MBounds]
Loop_steps_nice_final [in Complexity.TM.PrettyBounds.M2MBounds]
Loop_steps_asym_bounded [in Complexity.TM.PrettyBounds.M2MBounds]
Loop_steps_asym_nice [in Complexity.TM.PrettyBounds.M2MBounds]
Loop_steps_asym_halt [in Complexity.TM.PrettyBounds.M2MBounds]
Loop_Terminates [in Undecidability.TM.Single.StepTM]
Loop_steps_eq [in Undecidability.TM.Single.StepTM]
Loop_Realise [in Undecidability.TM.Single.StepTM]
Loop_steps_nice [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds_Loop]
Loop_steps_nice' [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds_Loop]
loop_split [in Undecidability.TM.Util.Prelim]
loop_merge [in Undecidability.TM.Util.Prelim]
loop_unlift [in Undecidability.TM.Util.Prelim]
loop_lift [in Undecidability.TM.Util.Prelim]
loop_monotone [in Undecidability.TM.Util.Prelim]
loop_eq_0 [in Undecidability.TM.Util.Prelim]
loop_0 [in Undecidability.TM.Util.Prelim]
loop_fulfills [in Undecidability.TM.Util.Prelim]
loop_injective [in Undecidability.TM.Util.Prelim]
loop_step [in Undecidability.TM.Util.Prelim]
loop_relpower_agree [in Complexity.NP.SAT.CookLevin.Subproblems.TM_single]
loop_map [in Undecidability.TM.Lifting.LiftTapes]
Loop_Terminates [in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
Loop_Realise [in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
Loop_size_step [in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
lprod_app [in Undecidability.Shared.Libs.DLW.Utils.prime]
lprod_ge_1 [in Undecidability.Shared.Libs.DLW.Utils.prime]
LrewriteTime_helper_index [in Undecidability.L.Tactics.Lrewrite]
LrewriteTime_helper [in Undecidability.L.Tactics.Lrewrite]
Lrewrite_in_helper [in Undecidability.L.Tactics.Lrewrite]
Lrewrite_equiv_helper [in Undecidability.L.Tactics.Lrewrite]
Lrewrite_helper [in Undecidability.L.Tactics.Lrewrite]
lStep [in Undecidability.L.Tactics.Lbeta_nonrefl]
lsum_le [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
lsum_app [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
ltb_time_bound_l [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
lt_le_rew [in Complexity.NP.Clique.kSAT_to_Clique]
lt_acc [in Undecidability.Synthetic.Infinite]
lt_pirr [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
LX_NoDup [in Undecidability.Synthetic.Infinite]
LX_el [in Undecidability.Synthetic.Infinite]
LX_len [in Undecidability.Synthetic.Infinite]
L_A_notIn_f [in Complexity.HierarchyTheorem.TimeHierarchyTheorem]
L_computable_to_TM_computable [in Undecidability.TM.L.CompilerBoolFuns.LComp_to_TMComp]
L_bool_computable_to_TM_bool_computable [in Undecidability.TM.L.CompilerBoolFuns.LComp_to_TMComp]
L_computable_to_L_bool_computable [in Undecidability.TM.L.CompilerBoolFuns.Compiler_nat_facts]
L_computable_can_closed [in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
L_bool_computable_can_closed [in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
L_bool_computable_function [in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
L_term_card [in Complexity.Complexity.SpaceBoundsTime]
L_Pro_length [in Complexity.Complexity.SpaceBoundsTime]
L_Pro_length' [in Complexity.Complexity.SpaceBoundsTime]
L_Pro_mono [in Complexity.Complexity.SpaceBoundsTime]
L_Pro_in_iff [in Complexity.Complexity.SpaceBoundsTime]
L_list_cumulative [in Undecidability.Synthetic.ListEnumerabilityFacts]
L_recognisable_halt [in Undecidability.L.Computability.Synthetic]
L_recognisable'_recognisable [in Undecidability.L.Computability.Synthetic]
L_enumerable_halt [in Undecidability.L.Computability.Synthetic]
L_enumerable_enum [in Undecidability.L.Computability.Synthetic]
L_enumerable_ext [in Undecidability.L.Computability.Synthetic]
L_enumerable_recognisable [in Undecidability.L.Computability.Synthetic]
L_A_notIn_f [in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]

M

makeAllEvalEnvFlat_length_poly [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
makeAllEvalEnvFlat_length_bound [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
makeAllEvalEnvFlat_envBounded [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
makeAllEvalEnvFlat_envOfFlatTypes [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
makeAllEvalEnvFlat_poly [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
makeAllEvalEnvFlat_time_bound [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
makeAllEvalEnv_isFlatEnvOf' [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
makeAllEvalEnv_isFlatEnvOf [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
makeCardsFlat_ofFlatType [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
makeCardsFlat_length_bound [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
makeCardsFlat_poly [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
makeCardsFlat_time_bound [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
makeCardsP_length [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
makeCardsP_poly [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
makeCardsP_time_bound [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
makeCardsP_isFlatTCardsOf [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
makeCards_isFlatCardOf [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
makeEdges_size_bound [in Complexity.NP.Clique.kSAT_to_FlatClique]
makeEdges_fedges_wf [in Complexity.NP.Clique.kSAT_to_FlatClique]
makeEdges_length [in Complexity.NP.Clique.kSAT_to_FlatClique]
makeEdges_poly [in Complexity.NP.Clique.kSAT_to_FlatClique]
makeEdges_time_bound [in Complexity.NP.Clique.kSAT_to_FlatClique]
makeEdge_poly [in Complexity.NP.Clique.kSAT_to_FlatClique]
makeEdge_time_bound [in Complexity.NP.Clique.kSAT_to_FlatClique]
makeHaltFlat_poly [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
makeHaltFlat_time_bound [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
makeNone_base_flat_poly [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
makeNone_base_flat_time_bound [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
makeNone_base_flat_ofFlatType [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
makePreludeCards_flat_poly [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
makePreludeCards_flat_time_bound [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
makeSingleTape_sizeOfmTapes [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
makeSingleTape_size [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
makeSingleTape_size' [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
makeSingleTape_sizeOfTape' [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
makeSingleTape_sizeOfTape [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
makeSingleTape_correct [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
makeSome_base_flat_poly [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
makeSome_base_flat_time_bound [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
makeSome_base_flat_ofFlatType [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
makeUnivGraphTape_correct [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
makeUnivGraphTape_correct_size [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
makeUnivStartStateTape_correct [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
makeUnivStartStateTape_correct_size [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
makeUnivTapes_size_nice [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
makeUnivTapes_correct [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
makeUnivTapes_correct_size [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
makeUnivWorkingTape_sizeOfTape_nice [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
makeUnivWorkingTape_size' [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
makeUnivWorkingTape_size [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
makeUnivWorkingTape_correct [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
many_var_in [in Undecidability.TM.L.CompilerBoolFuns.NaryApp]
many_subst_closed [in Undecidability.TM.L.CompilerBoolFuns.NaryApp]
many_subst_many_app [in Undecidability.TM.L.CompilerBoolFuns.NaryApp]
many_subst_app [in Undecidability.TM.L.CompilerBoolFuns.NaryApp]
many_beta [in Undecidability.TM.L.CompilerBoolFuns.NaryApp]
many_vars_S [in Undecidability.TM.L.CompilerBoolFuns.NaryApp]
many_app_eq_nat [in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
many_app_eq [in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
many_subst_apply_encs_to [in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
mapTape_isVoid [in Undecidability.TM.Code.CodeTM]
mapTape_isVoid_size [in Undecidability.TM.Code.CodeTM]
mapTape_local [in Undecidability.TM.Util.TM_facts]
mapTape_id [in Undecidability.TM.Util.TM_facts]
mapTape_ext [in Undecidability.TM.Util.TM_facts]
mapTape_mapTape [in Undecidability.TM.Util.TM_facts]
mapTape_inv_midtape [in Undecidability.TM.Util.TM_facts]
mapTape_inv_leftof [in Undecidability.TM.Util.TM_facts]
mapTape_inv_rightof [in Undecidability.TM.Util.TM_facts]
mapTape_inv_niltap [in Undecidability.TM.Util.TM_facts]
mapTape_move_right [in Undecidability.TM.Util.TM_facts]
mapTape_move_left [in Undecidability.TM.Util.TM_facts]
mapTape_right [in Undecidability.TM.Util.TM_facts]
mapTape_left [in Undecidability.TM.Util.TM_facts]
mapTape_current [in Undecidability.TM.Util.TM_facts]
mapTime_upTo [in Undecidability.L.Datatypes.List.List_basics]
map_vect_list_app_drop [in Complexity.TM.PrettyBounds.M2MBounds]
map_vec_pos_equiv [in Undecidability.Shared.Libs.DLW.Vec.vec]
map_vec_map_list [in Undecidability.Shared.Libs.DLW.Vec.vec]
map_pos_list_vec [in Undecidability.Shared.Libs.DLW.Vec.vec]
map_time_const [in Undecidability.L.Datatypes.List.List_basics]
map_vect_list_eq [in Undecidability.TM.Single.StepTM]
map_vect_list_app [in Undecidability.TM.Single.StepTM]
map_vect_list_length [in Undecidability.TM.Single.StepTM]
map_lam [in Undecidability.L.Computability.Enum]
map_retract_prefix_inj [in Complexity.TM.Code.Decode]
map_duplicate_inv [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
map_middle_inv [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
map_app_inv [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
map_cons_inv [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
map_cst_rev [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
map_cst_snoc [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
map_cst_repeat [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
map_list_repeat [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
map_S_list_an [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
map_injective [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
map_eq_app [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
map_eq_cons' [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
map_eq_cons [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
map_eq_nil' [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
map_eq_nil [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
map_repeat [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
map_opt_fold [in Undecidability.TM.Util.Prelim]
map_term [in Undecidability.L.Tactics.ComputableDemo]
map_time_bound_env [in Complexity.Libs.CookPrelim.PolyBounds]
map_time_mono [in Complexity.Libs.CookPrelim.PolyBounds]
map_hNat_size_bound [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
map_time_mono [in Complexity.Complexity.UpToCPoly]
map_length_eq [in Undecidability.TM.Code.ChangeAlphabet]
map_ext' [in Undecidability.L.Tactics.Reflection]
map_app_map_seperate [in Undecidability.TM.Code.Code]
map_removelast [in Undecidability.TM.Code.List.App]
map_repEl [in Complexity.Libs.CookPrelim.MorePrelim]
map_firstn [in Complexity.Libs.CookPrelim.MorePrelim]
map_skipn [in Complexity.Libs.CookPrelim.MorePrelim]
map_involution [in Complexity.Libs.CookPrelim.MorePrelim]
map_dupfree [in Complexity.Libs.CookPrelim.MorePrelim]
maxl_rev [in Undecidability.L.Prelim.MoreList]
maxl_app [in Undecidability.L.Prelim.MoreList]
maxl_leq_l [in Undecidability.L.Prelim.MoreList]
maxl_leq [in Undecidability.L.Prelim.MoreList]
maxSize_enc_size [in Complexity.Complexity.UpToCPoly]
maxSize_bounds_time [in Complexity.Complexity.SpaceBoundsTime]
max_plus_l [in Complexity.TM.PrettyBounds.BaseCode]
max_list_rec_map_monotone' [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
max_list_sumn [in Undecidability.TM.PrettyBounds.SizeBounds]
max_list_rec_eq_foldl [in Undecidability.TM.PrettyBounds.SizeBounds]
Max_Realise [in Undecidability.TM.Code.BinNumbers.PosCompareTM]
max_list_map_repeat [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
max_list_rec_repeat [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
max_list_map_monotone [in Undecidability.TM.PrettyBounds.MaxList]
max_list_map_In [in Undecidability.TM.PrettyBounds.MaxList]
max_list_map_lower_bound [in Undecidability.TM.PrettyBounds.MaxList]
max_list_map_ge [in Undecidability.TM.PrettyBounds.MaxList]
max_list_In [in Undecidability.TM.PrettyBounds.MaxList]
max_list_monotone [in Undecidability.TM.PrettyBounds.MaxList]
max_list_lower_bound [in Undecidability.TM.PrettyBounds.MaxList]
max_list_ge [in Undecidability.TM.PrettyBounds.MaxList]
max_list_rec_In [in Undecidability.TM.PrettyBounds.MaxList]
max_list_rec_gt' [in Undecidability.TM.PrettyBounds.MaxList]
max_list_rec_gt [in Undecidability.TM.PrettyBounds.MaxList]
max_list_rec_el_or_eq [in Undecidability.TM.PrettyBounds.MaxList]
max_list_rec_idem [in Undecidability.TM.PrettyBounds.MaxList]
max_list_rec_max'' [in Undecidability.TM.PrettyBounds.MaxList]
max_list_rec_max' [in Undecidability.TM.PrettyBounds.MaxList]
max_list_rec_lower_bound [in Undecidability.TM.PrettyBounds.MaxList]
max_list_rec_monotone' [in Undecidability.TM.PrettyBounds.MaxList]
max_list_rec_monotone [in Undecidability.TM.PrettyBounds.MaxList]
max_list_rec_ge_el_ge [in Undecidability.TM.PrettyBounds.MaxList]
max_list_rec_ge_el [in Undecidability.TM.PrettyBounds.MaxList]
max_list_rec_ge [in Undecidability.TM.PrettyBounds.MaxList]
max_list_rec_irrelevant [in Undecidability.TM.PrettyBounds.MaxList]
max_list_rec_max [in Undecidability.TM.PrettyBounds.MaxList]
measure_double_rect_fix [in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
measure_double_rect_paired [in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
measure_rect_fix [in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
meet_sum_powers [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
mem_sigma [in Complexity.Libs.Pigeonhole]
mem_dec [in Complexity.Libs.Pigeonhole]
Mfp_nice [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
Mfp_nice3 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
Mfp_nice2 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
Mfp_nice1 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
Mfp_nice0 [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
Mfp_eq [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
Mf_bounded [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
midtape_tape_local_l_cons_right [in Undecidability.TM.Util.TM_facts]
midtape_tape_local_l_cons [in Undecidability.TM.Util.TM_facts]
midtape_tape_local_cons_left [in Undecidability.TM.Util.TM_facts]
midtape_tape_local_cons [in Undecidability.TM.Util.TM_facts]
minimize [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
mirrorConf_injective [in Undecidability.TM.Combinators.Mirror]
mirrorConf_involution [in Undecidability.TM.Combinators.Mirror]
Mirror_RealiseIn [in Undecidability.TM.Combinators.Mirror]
Mirror_Terminates [in Undecidability.TM.Combinators.Mirror]
Mirror_Realise [in Undecidability.TM.Combinators.Mirror]
mirror_unlift [in Undecidability.TM.Combinators.Mirror]
mirror_lift [in Undecidability.TM.Combinators.Mirror]
mirror_step [in Undecidability.TM.Combinators.Mirror]
mirror_acts_involution [in Undecidability.TM.Combinators.Mirror]
mirror_act_involution [in Undecidability.TM.Combinators.Mirror]
mirror_tape_move_right' [in Undecidability.TM.Util.TM_facts]
mirror_tape_move_left' [in Undecidability.TM.Util.TM_facts]
mirror_tapes_nth [in Undecidability.TM.Util.TM_facts]
mirror_move_involution [in Undecidability.TM.Util.TM_facts]
mirror_tapes_injective [in Undecidability.TM.Util.TM_facts]
mirror_tapes_involution [in Undecidability.TM.Util.TM_facts]
mirror_tape_inv_niltape' [in Undecidability.TM.Util.TM_facts]
mirror_tape_inv_rightof' [in Undecidability.TM.Util.TM_facts]
mirror_tape_inv_leftof' [in Undecidability.TM.Util.TM_facts]
mirror_tape_inv_midtape' [in Undecidability.TM.Util.TM_facts]
mirror_tape_inv_niltape [in Undecidability.TM.Util.TM_facts]
mirror_tape_inv_rightof [in Undecidability.TM.Util.TM_facts]
mirror_tape_inv_leftof [in Undecidability.TM.Util.TM_facts]
mirror_tape_inv_midtape [in Undecidability.TM.Util.TM_facts]
mirror_tape_move_right [in Undecidability.TM.Util.TM_facts]
mirror_tape_move_left [in Undecidability.TM.Util.TM_facts]
mirror_tape_injective [in Undecidability.TM.Util.TM_facts]
mirror_tape_involution [in Undecidability.TM.Util.TM_facts]
mirror_tape_current [in Undecidability.TM.Util.TM_facts]
mirror_tape_right [in Undecidability.TM.Util.TM_facts]
mirror_tape_left [in Undecidability.TM.Util.TM_facts]
mkVarEnv_poly [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
mkVarEnv_time_bound [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
mkVarEnv_length [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
MK_isVoid_multi_SpecT [in Undecidability.TM.L.CompilerBoolFuns.Compiler]
MK_isVoid_Spec [in Undecidability.TM.L.CompilerBoolFuns.Compiler]
MK_isVoid_Sem [in Undecidability.TM.L.CompilerBoolFuns.Compiler]
modS_divide [in Undecidability.Shared.Libs.DLW.Utils.prime]
modulo_time_bound [in Complexity.Libs.CookPrelim.PolyBounds]
monotonic_comp [in Complexity.Complexity.Monotonic]
monotonic_x [in Complexity.Complexity.Monotonic]
monotonic_pow_c [in Complexity.Complexity.Monotonic]
monotonic_mul [in Complexity.Complexity.Monotonic]
monotonic_S [in Complexity.Complexity.Monotonic]
monotonic_add [in Complexity.Complexity.Monotonic]
monotonic_c [in Complexity.Complexity.Monotonic]
mono_t__evalForTime [in Complexity.L.AbstractMachines.Computable.EvalForTime]
mono_t__E [in Complexity.HierarchyTheorem.TimeHierarchyTheorem]
mono_map_time [in Complexity.NP.TM.LM_to_mTM]
MoveLeft_Terminates [in Undecidability.TM.Code.Copy]
MoveLeft_Realise [in Undecidability.TM.Code.Copy]
MovePar_Sem [in Undecidability.TM.Compound.Multi]
MoveRight_Terminates [in Undecidability.TM.Code.Copy]
MoveRight_Realise [in Undecidability.TM.Code.Copy]
MoveToStart_steps_nice [in Complexity.TM.PrettyBounds.M2MBounds]
MoveToStart_Terminates [in Undecidability.TM.Single.StepTM]
MoveToStart_Realise [in Undecidability.TM.Single.StepTM]
MoveToSymbol_L_steps_moveleft [in Undecidability.TM.Compound.MoveToSymbol]
MoveToSymbol_L_steps_midtape [in Undecidability.TM.Compound.MoveToSymbol]
MoveToSymbol_L_steps_local [in Undecidability.TM.Compound.MoveToSymbol]
MoveToSymbol_steps_midtape_end [in Undecidability.TM.Compound.MoveToSymbol]
MoveToSymbol_steps_local_end [in Undecidability.TM.Compound.MoveToSymbol]
MoveToSymbol_steps_moveright [in Undecidability.TM.Compound.MoveToSymbol]
MoveToSymbol_steps_midtape [in Undecidability.TM.Compound.MoveToSymbol]
MoveToSymbol_steps_local [in Undecidability.TM.Compound.MoveToSymbol]
MoveToSymbol_L_correct_moveleft [in Undecidability.TM.Compound.MoveToSymbol]
MoveToSymbol_L_correct_midtape [in Undecidability.TM.Compound.MoveToSymbol]
MoveToSymbol_L_correct [in Undecidability.TM.Compound.MoveToSymbol]
MoveToSymbol_correct_midtape_end [in Undecidability.TM.Compound.MoveToSymbol]
MoveToSymbol_correct_moveright [in Undecidability.TM.Compound.MoveToSymbol]
MoveToSymbol_correct_midtape [in Undecidability.TM.Compound.MoveToSymbol]
MoveToSymbol_correct [in Undecidability.TM.Compound.MoveToSymbol]
MoveToSymbol_L_Terminates [in Undecidability.TM.Compound.MoveToSymbol]
MoveToSymbol_steps_mirror [in Undecidability.TM.Compound.MoveToSymbol]
MoveToSymbol_L_Realise [in Undecidability.TM.Compound.MoveToSymbol]
MoveToSymbol_mirror' [in Undecidability.TM.Compound.MoveToSymbol]
MoveToSymbol_mirror [in Undecidability.TM.Compound.MoveToSymbol]
MoveToSymbol_Terminates [in Undecidability.TM.Compound.MoveToSymbol]
MoveToSymbol_Realise [in Undecidability.TM.Compound.MoveToSymbol]
MoveToSymbol_skip [in Undecidability.TM.Compound.MoveToSymbol]
MoveToSymbol_Step_Fun_M2_true [in Undecidability.TM.Compound.MoveToSymbol]
MoveToSymbol_Step_false [in Undecidability.TM.Compound.MoveToSymbol]
MoveToSymbol_Step_true [in Undecidability.TM.Compound.MoveToSymbol]
MoveToSymbol_Step_None [in Undecidability.TM.Compound.MoveToSymbol]
MoveToSymbol_Step_Fun_M2_None [in Undecidability.TM.Compound.MoveToSymbol]
MoveToSymbol_Step_Sem [in Undecidability.TM.Compound.MoveToSymbol]
MoveToSymbol_Fun_is_rel [in Complexity.TM.Compound.MoveToSymbol_niceSpec]
MoveToSymbol_Fun_nice [in Complexity.TM.Compound.MoveToSymbol_niceSpec]
MoveToSymbol_SpecTReg [in Undecidability.TM.Hoare.HoareStdLib]
MoveValue_steps_nice' [in Complexity.TM.PrettyBounds.BaseCode]
MoveValue_steps_nice [in Complexity.TM.PrettyBounds.BaseCode]
MoveValue_size_y_nice [in Complexity.TM.PrettyBounds.BaseCodeSpace]
MoveValue_size_x_nice [in Complexity.TM.PrettyBounds.BaseCodeSpace]
MoveValue_Spec [in Undecidability.TM.Code.Copy]
MoveValue_Spec_size [in Undecidability.TM.Code.Copy]
MoveValue_SpecT [in Undecidability.TM.Code.Copy]
MoveValue_SpecT_size [in Undecidability.TM.Code.Copy]
MoveValue_Terminates [in Undecidability.TM.Code.Copy]
MoveValue_Realise [in Undecidability.TM.Code.Copy]
MoveValue_Spec [in Undecidability.TM.Hoare.HoareExamples]
MoveValue_SpecT [in Undecidability.TM.Hoare.HoareExamples]
MoveValue_SpecT_size [in Undecidability.TM.Hoare.HoareExamples]
Move_Sem [in Undecidability.TM.Basic.Mono]
move_eqb_spec [in Undecidability.L.TM.TMEncoding]
mscal_morph [in Undecidability.Shared.Libs.DLW.Utils.sums]
mscal_mult [in Undecidability.Shared.Libs.DLW.Utils.sums]
mscal_sum [in Undecidability.Shared.Libs.DLW.Utils.sums]
mscal_comm [in Undecidability.Shared.Libs.DLW.Utils.sums]
mscal_plus1 [in Undecidability.Shared.Libs.DLW.Utils.sums]
mscal_plus [in Undecidability.Shared.Libs.DLW.Utils.sums]
mscal_of_unit [in Undecidability.Shared.Libs.DLW.Utils.sums]
mscal_1 [in Undecidability.Shared.Libs.DLW.Utils.sums]
mscal_S [in Undecidability.Shared.Libs.DLW.Utils.sums]
mscal_0 [in Undecidability.Shared.Libs.DLW.Utils.sums]
msum_morph [in Undecidability.Shared.Libs.DLW.Utils.sums]
msum_mscal [in Undecidability.Shared.Libs.DLW.Utils.sums]
msum_first_two [in Undecidability.Shared.Libs.DLW.Utils.sums]
msum_ends [in Undecidability.Shared.Libs.DLW.Utils.sums]
msum_msum [in Undecidability.Shared.Libs.DLW.Utils.sums]
msum_only_one [in Undecidability.Shared.Libs.DLW.Utils.sums]
msum_of_unit [in Undecidability.Shared.Libs.DLW.Utils.sums]
msum_sum [in Undecidability.Shared.Libs.DLW.Utils.sums]
msum_comm [in Undecidability.Shared.Libs.DLW.Utils.sums]
msum_unit [in Undecidability.Shared.Libs.DLW.Utils.sums]
msum_ext [in Undecidability.Shared.Libs.DLW.Utils.sums]
msum_plus1 [in Undecidability.Shared.Libs.DLW.Utils.sums]
msum_plus [in Undecidability.Shared.Libs.DLW.Utils.sums]
msum_1 [in Undecidability.Shared.Libs.DLW.Utils.sums]
msum_S [in Undecidability.Shared.Libs.DLW.Utils.sums]
msum_0 [in Undecidability.Shared.Libs.DLW.Utils.sums]
msum_fold_map [in Undecidability.Shared.Libs.DLW.Utils.sums]
multistep_inversion [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
multistep_halt [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
multistep_simulation [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
MultiToMono.Realise [in Complexity.NP.TM.M_multi2mono]
MultiToMono.Terminates [in Complexity.NP.TM.M_multi2mono]
Mult_Realise [in Undecidability.TM.Code.BinNumbers.PosMultTM]
Mult_Loop_Realise [in Undecidability.TM.Code.BinNumbers.PosMultTM]
Mult_Step_Realise [in Undecidability.TM.Code.BinNumbers.PosMultTM]
mult_TR_correct [in Undecidability.TM.Code.BinNumbers.PosMultTM]
mult_TR_cont_correct [in Undecidability.TM.Code.BinNumbers.PosMultTM]
mult_TR_cont_shift [in Undecidability.TM.Code.BinNumbers.PosMultTM]
Mult_Terminates [in Undecidability.TM.Code.NatTM]
Mult_Main_Terminates [in Undecidability.TM.Code.NatTM]
Mult_Loop_Terminates [in Undecidability.TM.Code.NatTM]
Mult_Step_Terminates [in Undecidability.TM.Code.NatTM]
Mult_Computes [in Undecidability.TM.Code.NatTM]
Mult_Main_Realise [in Undecidability.TM.Code.NatTM]
Mult_Loop_Realise [in Undecidability.TM.Code.NatTM]
Mult_Step_Realise [in Undecidability.TM.Code.NatTM]
Mult_N_Realise [in Undecidability.TM.Code.BinNumbers.NTM]
Mult_SpecT_space [in Undecidability.TM.Hoare.HoareMult]
Mult_Loop_SpecT_size [in Undecidability.TM.Hoare.HoareMult]
Mult_Step_SpecT_size [in Undecidability.TM.Hoare.HoareMult]
mult_2_eq_plus [in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
mult_is_one [in Undecidability.Shared.Libs.DLW.Utils.gcd]
Mult_SpecT_space [in Undecidability.TM.Hoare.HoareExamples]
Mult_SpecT_space [in Undecidability.TM.Hoare.HoareExamples]
Mult_SpecT [in Undecidability.TM.Hoare.HoareExamples]
Mult_Loop_SpecT_size [in Undecidability.TM.Hoare.HoareExamples]
Mult_Loop_SpecT [in Undecidability.TM.Hoare.HoareExamples]
Mult_Step_SpecT_size [in Undecidability.TM.Hoare.HoareExamples]
Mult_Step_SpecT [in Undecidability.TM.Hoare.HoareExamples]
MU_Realises [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
MU_terminatesIn [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
mu_least [in Undecidability.Synthetic.Infinite]
mu_spec [in Undecidability.L.Computability.MuRec]
mu_complete [in Undecidability.L.Computability.MuRec]
mu_sound [in Undecidability.L.Computability.MuRec]
mu_proc [in Undecidability.L.Computability.MuRec]
mu'_complete [in Undecidability.L.Computability.MuRec]
mu'_sound [in Undecidability.L.Computability.MuRec]
mu'_n_true [in Undecidability.L.Computability.MuRec]
mu'_0_false [in Undecidability.L.Computability.MuRec]
mu'_n_false [in Undecidability.L.Computability.MuRec]
mu'_proc [in Undecidability.L.Computability.MuRec]
M_main_SpecT [in Undecidability.TM.L.CompilerBoolFuns.Compiler]
M_main_Spec [in Undecidability.TM.L.CompilerBoolFuns.Compiler]
M_out_SpecT [in Undecidability.TM.L.CompilerBoolFuns.Compiler]
M_init_SpecT [in Undecidability.TM.L.CompilerBoolFuns.Compiler]
M_init'_SpecT [in Undecidability.TM.L.CompilerBoolFuns.Compiler]
M_init_one_Spec [in Undecidability.TM.L.CompilerBoolFuns.Compiler]
M.sizeStart [in Complexity.NP.TM.LM_to_mTM]
M1_Terminates [in Undecidability.TM.Code.CaseList]
M1_Realise [in Undecidability.TM.Code.CaseList]

N

natsLess_S [in Undecidability.L.Prelim.MoreList]
natsLess_in_iff [in Undecidability.L.Prelim.MoreList]
nat_bool [in Undecidability.Shared.Libs.PSL.Prelim]
nat_meet_powers_neq [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
nat_meet_powers_eq [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
nat_ortho_joins [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
nat_ortho_sum_join [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
nat_ortho_joins_left [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
nat_join_eq_0 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
nat_meet_joins [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
nat_ortho_plus_join [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
nat_lb_plus [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
nat_join_euclid2 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
nat_join_mult_power2 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
nat_double_joins_binary_le [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
nat_joins_binary_le [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
nat_joins_binary_le_right [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
nat_joins_binary_le_left [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
nat_join_binary_le [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
nat_meet_joins_distr_l [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
nat_join_monoid [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
nat_meet_join_distr_l [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
nat_join_meet_distr_l [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
nat_join_assoc [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
nat_join_mono [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
nat_join_idem [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
nat_join_n0 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
nat_join_0n [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
nat_join_right [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
nat_join_left [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
nat_join_comm [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
nat_meet_12 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
nat_meet_12n [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
nat_meet_power2_neq [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
nat_meet_assoc [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
nat_meet_idem [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
nat_meet_n0 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
nat_meet_0n [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
nat_meet_euclid_2 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
nat_meet_euclid_power_2 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
nat_meet_mult_power2 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
nat_meet_dio [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
nat_meet_right [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
nat_meet_left [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
nat_meet_comm [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
nat_euclid_pow2_lb [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
nat_pow2_lb_shift [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
nat_lb_length [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
nat_lb_1 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
nat_lb_fix_2 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
nat_lb_fix_1 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
nat_lb_fix_0 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
nat_lb_spec [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
nat_size_le [in Complexity.Libs.CookPrelim.PolyBounds]
nat_size_lt [in Complexity.Libs.CookPrelim.PolyBounds]
nat_mul_size_bound [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
Nat_mult_monoid [in Undecidability.Shared.Libs.DLW.Utils.sums]
Nat_plus_monoid [in Undecidability.Shared.Libs.DLW.Utils.sums]
nat_size_le [in Complexity.Complexity.UpToCPoly]
nat_size_lt [in Complexity.Complexity.UpToCPoly]
nat_size_mul [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
nat_rev_bounded_ind [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
nat_rev_ind [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
nat_sinc_inj [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
nat_sinc [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
nat_sort_sorted [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
nat_sort_eq [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
nat_sort_length [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
nat_list_insert_sorted [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
nat_list_insert_Forall [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
nat_list_insert_incl [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
nat_list_insert_length [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
nat_sorted_injective [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
nat_sorted_rect [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
nat_sorted_head_inv [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
nat_sorted_Forall [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
nat_sorted_cons_inv [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
nat_new_spec [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
nat_size_mul [in Complexity.NP.Clique.kSAT_to_FlatClique]
nat2bool2nat [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
nat2pos_pos2nat [in Undecidability.Shared.Libs.DLW.Vec.pos]
nblank_finReprEl [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
ndelimC_finReprEl [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
negb_not [in Complexity.NP.Clique.kSAT_to_FlatClique]
negb_true_prop [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
Newton_nat_S [in Undecidability.Shared.Libs.DLW.Utils.sums]
Newton_nat [in Undecidability.Shared.Libs.DLW.Utils.sums]
niltape_repr [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
ninit_finReprEl [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
NoDup_vec_list [in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
NoneElement [in Undecidability.Shared.Libs.PSL.FiniteTypes.CompoundFinTypes]
None_ofFlatType [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
Nop_SpecT_con [in Undecidability.TM.Hoare.HoareCombinators]
Nop_SpecT [in Undecidability.TM.Hoare.HoareCombinators]
Nop_Spec [in Undecidability.TM.Hoare.HoareCombinators]
Nop_Sem [in Undecidability.TM.Compound.Multi]
notInZero [in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
not_dupfree_rep [in Complexity.Libs.Pigeonhole]
not_In_list_assoc [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
not_in_cons [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
not_list_an_has_dup [in Undecidability.Shared.Libs.DLW.Utils.php]
not_list_has_dup_an [in Undecidability.Shared.Libs.DLW.Utils.php]
not_dupfree [in Undecidability.Shared.Libs.PSL.Lists.Dupfree]
not_index_reflect_helper2 [in Undecidability.TM.Lifting.LiftTapes]
not_index_reflect_helper [in Undecidability.TM.Lifting.LiftTapes]
not_index_reflect [in Undecidability.TM.Lifting.LiftTapes]
not_coenumerable [in Undecidability.Synthetic.ReducibilityFacts]
not_decidable [in Undecidability.Synthetic.ReducibilityFacts]
not_compat [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
no_common_prime_is_coprime [in Undecidability.Shared.Libs.DLW.Utils.prime]
NPhard_GenNP [in Complexity.NP.L.GenNP_is_hard]
NPhard_GenNPBool [in Complexity.NP.L.GenNPBool]
NPhard_sig [in Complexity.Complexity.NP]
nrep_card_length [in Complexity.Libs.Pigeonhole]
nsig_reprEl [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
nstar_finReprEl [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
nth_tabulate [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
nth_error_none [in Undecidability.Shared.Libs.PSL.Lists.Position]
nth_error_Some_lt [in Undecidability.L.Prelim.MoreBase]
nth_error_time_bound [in Complexity.Libs.CookPrelim.PolyBounds]
nth_error_to_list [in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
nth_index [in Complexity.NP.Clique.kSAT_to_Clique]
nth_map2' [in Undecidability.TM.Util.TM_facts]
nth_map' [in Undecidability.TM.Util.TM_facts]
nth_nth_error [in Complexity.Libs.CookPrelim.MorePrelim]
nth_error_skipn [in Complexity.Libs.CookPrelim.MorePrelim]
nth_error_firstn [in Complexity.Libs.CookPrelim.MorePrelim]
nth_error_step [in Complexity.Libs.CookPrelim.MorePrelim]
nth_error_Some_length [in Complexity.Libs.CookPrelim.MorePrelim]
nth_error_map [in Complexity.Libs.CookPrelim.MorePrelim]
nth_error_nth' [in Complexity.Libs.CookPrelim.MorePrelim]
nth_error_nth [in Complexity.Libs.CookPrelim.MorePrelim]
Nth'_steps_nice [in Complexity.TM.PrettyBounds.BaseCode]
Nth'_Loop_steps_nice [in Complexity.TM.PrettyBounds.BaseCode]
Nth'_Step_steps_nice_cons [in Complexity.TM.PrettyBounds.BaseCode]
Nth'_Step_steps_nice_nil [in Complexity.TM.PrettyBounds.BaseCode]
Nth'_Terminates [in Undecidability.TM.Code.List.Nth]
Nth'_Realise [in Undecidability.TM.Code.List.Nth]
Nth'_SpecT_size [in Undecidability.TM.Code.List.Nth]
Nth'_Loop_SpecT_size [in Undecidability.TM.Code.List.Nth]
Nth'_Step_SpecT_size [in Undecidability.TM.Code.List.Nth]
NullMul [in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
Null_Sem [in Undecidability.TM.Basic.Null]
N_size_nat_add_leq [in Complexity.L.Datatypes.LBinNums]
N_size_nat_monotone [in Complexity.L.Datatypes.LBinNums]
N_size_nat_leq [in Complexity.L.Datatypes.LBinNums]
N_size_nat_eq [in Complexity.L.Datatypes.LBinNums]
N_size_nat_leq' [in Complexity.L.Datatypes.LBinNums]

O

oenc_correct_some [in Undecidability.L.Datatypes.LOptions]
ofFlatType_dec_poly [in Complexity.Libs.CookPrelim.FlatFinTypes]
ofFlatType_dec_time_bound [in Complexity.Libs.CookPrelim.FlatFinTypes]
OmegaLift_proc [in Undecidability.L.Datatypes.LBool]
Omega_diverge [in Undecidability.L.Tactics.Lsimpl]
Omega_closed [in Undecidability.L.Tactics.Lsimpl]
omega_proc [in Undecidability.L.Tactics.Lsimpl]
Omega_diverges [in Undecidability.L.Computability.Seval]
optBound_poly [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
optBound_time_bound [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
optionMap_time_bound_c [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
option_eqb_spec [in Undecidability.L.Datatypes.LOptions]
option_enum_ok [in Undecidability.Shared.Libs.PSL.FiniteTypes.CompoundFinTypes]
opt_generateCardsForFlatNonHalt_ofFlatType [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
opt_generateCardsForFlatNonHalt_poly [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
opt_generateCardsForFlatNonHalt_time_bound [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
opt_finReprElP_None [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
opt_finReprElP_Some [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
opt_finReprElP_case [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
opt_literalsConflict_decb_poly [in Complexity.NP.Clique.kSAT_to_FlatClique]
opt_literalsConflict_decb_time_bound [in Complexity.NP.Clique.kSAT_to_FlatClique]
opt_literalsConflict_decb_iff [in Complexity.NP.Clique.kSAT_to_FlatClique]
orFree_eliminate [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
own_multiple [in Undecidability.Shared.Libs.DLW.Utils.gcd]

P

pair_ofFlatType [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
pair_inv [in Undecidability.TM.Code.CompareValue]
pair_inv [in Undecidability.TM.Code.Copy]
pair_eq [in Undecidability.TM.Code.CasePair]
pair_eq [in Undecidability.TM.Code.List.App]
parametrized_confluence [in Undecidability.L.Prelim.ARS]
parametrized_semi_confluence [in Undecidability.L.Prelim.ARS]
partition_intersection [in Undecidability.Shared.Libs.DLW.Utils.php]
Permutation_In_inv [in Undecidability.Shared.Libs.DLW.Utils.php]
perm_list_has_dup [in Undecidability.Shared.Libs.DLW.Utils.php]
perm_in_head [in Undecidability.Shared.Libs.DLW.Utils.php]
perm_incl_right [in Undecidability.Shared.Libs.DLW.Utils.php]
perm_incl_left [in Undecidability.Shared.Libs.DLW.Utils.php]
perm_seteq [in Undecidability.Shared.Libs.DLW.Utils.seteq]
pFlipAlphabet_pFlipGamma_eqn [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
php_fun [in Undecidability.Shared.Libs.DLW.Utils.sorting]
php_upto [in Undecidability.Shared.Libs.DLW.Utils.php]
PHP_rel [in Undecidability.Shared.Libs.DLW.Utils.php]
pigeonhole [in Complexity.Libs.Pigeonhole]
pigeonhole' [in Complexity.Libs.Pigeonhole]
plus_cancel_l [in Undecidability.Shared.Libs.DLW.Utils.sums]
pm_comp_lift [in Undecidability.Shared.Libs.DLW.Vec.pos]
pm_lift_ext [in Undecidability.Shared.Libs.DLW.Vec.pos]
pm_lift_nxt [in Undecidability.Shared.Libs.DLW.Vec.pos]
pm_lift_fst [in Undecidability.Shared.Libs.DLW.Vec.pos]
polarityFlipGammaInv1 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
polarityFlipGamma_involution [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
polarityFlipSigmaInv1 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
polarityFlipSigma_involution [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
polarityFlipTapeSigmaInv1 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
polarityFlipTapeSigma_involution [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
polarityFlip_involution [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
polarityRev_involution [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
polarity_finRepr [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
polyCertRel_compPoly [in Complexity.Complexity.NP]
polyTimeComputable_sig_out [in Complexity.Complexity.Subtypes]
polyTimeComputable_sig_in [in Complexity.Complexity.Subtypes]
polyTimeComputable_compTime [in Complexity.Complexity.Definitions]
polyTimeComputable_simpl [in Complexity.Complexity.PolyTimeComputable]
polyTimeComputable_eta [in Complexity.Complexity.PolyTimeComputable]
polyTimeComputable_prod [in Complexity.Complexity.PolyTimeComputable]
polyTimeComputable_composition2 [in Complexity.Complexity.PolyTimeComputable]
polyTimeComputable_composition [in Complexity.Complexity.PolyTimeComputable]
Por_correct' [in Undecidability.L.Computability.Por]
Por_correct_2 [in Undecidability.L.Computability.Por]
Por_correct_1 [in Undecidability.L.Computability.Por]
Por_correct_1b [in Undecidability.L.Computability.Por]
Por_correct_1a [in Undecidability.L.Computability.Por]
Por_proc [in Undecidability.L.Computability.Por]
position_in [in Undecidability.Shared.FinTypeEquiv]
Pos_size_nat_leq [in Complexity.L.Datatypes.LBinNums]
pos_size_nat_leq [in Complexity.L.Datatypes.LBinNums]
pos_size_nat_eq [in Complexity.L.Datatypes.LBinNums]
pos_size_eq_log2 [in Complexity.L.Datatypes.LBinNums]
pos_size_shift_left [in Undecidability.TM.Code.BinNumbers.PosMultTM]
pos_size_add_monotone [in Undecidability.TM.Code.BinNumbers.PosMultTM]
pos_size_add [in Undecidability.TM.Code.BinNumbers.PosMultTM]
pos_size_add_carry [in Undecidability.TM.Code.BinNumbers.PosMultTM]
pos_size_lt [in Undecidability.TM.Code.BinNumbers.PosDefinitions]
pos_size_monotone [in Undecidability.TM.Code.BinNumbers.PosDefinitions]
pos_size_correct [in Undecidability.TM.Code.BinNumbers.PosDefinitions]
pos_size_append_bit [in Undecidability.TM.Code.BinNumbers.PosDefinitions]
pos_to_bits_pushHSB [in Undecidability.TM.Code.BinNumbers.PosDefinitions]
pos_to_bits_inj [in Undecidability.TM.Code.BinNumbers.PosDefinitions]
pos_to_bits_append_bits' [in Undecidability.TM.Code.BinNumbers.PosDefinitions]
pos_to_bits_append_bits [in Undecidability.TM.Code.BinNumbers.PosDefinitions]
pos_to_bits_app_bit [in Undecidability.TM.Code.BinNumbers.PosDefinitions]
pos_to_bits_to_pos [in Undecidability.TM.Code.BinNumbers.PosDefinitions]
pos_length [in Undecidability.Shared.Libs.PSL.Lists.Position]
pos_second_S [in Undecidability.Shared.Libs.PSL.Lists.Position]
pos_first_S [in Undecidability.Shared.Libs.PSL.Lists.Position]
pos_None [in Undecidability.Shared.Libs.PSL.Lists.Position]
pos_elAt [in Undecidability.Shared.Libs.PSL.Lists.Position]
pos_nondec_spec [in Undecidability.L.Datatypes.List.List_nat]
pos_dec_rel2fun [in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
pos_dec_reif [in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
pos_reification [in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
pos_reif_t [in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
pos_not_diag_spec [in Undecidability.Shared.Libs.DLW.Vec.pos]
pos_list2nat [in Undecidability.Shared.Libs.DLW.Vec.pos]
pos_sub2nat [in Undecidability.Shared.Libs.DLW.Vec.pos]
pos_list_length [in Undecidability.Shared.Libs.DLW.Vec.pos]
pos_list_prop [in Undecidability.Shared.Libs.DLW.Vec.pos]
pos_left_right_rect [in Undecidability.Shared.Libs.DLW.Vec.pos]
pos_lr_both [in Undecidability.Shared.Libs.DLW.Vec.pos]
pos_both_lr [in Undecidability.Shared.Libs.DLW.Vec.pos]
pos_both_right [in Undecidability.Shared.Libs.DLW.Vec.pos]
pos_both_left [in Undecidability.Shared.Libs.DLW.Vec.pos]
pos_S_invert [in Undecidability.Shared.Libs.DLW.Vec.pos]
pos_O_invert [in Undecidability.Shared.Libs.DLW.Vec.pos]
pos2nat_right [in Undecidability.Shared.Libs.DLW.Vec.pos]
pos2nat_left [in Undecidability.Shared.Libs.DLW.Vec.pos]
pos2nat_nxt [in Undecidability.Shared.Libs.DLW.Vec.pos]
pos2nat_fst [in Undecidability.Shared.Libs.DLW.Vec.pos]
pos2nat_nat2pos [in Undecidability.Shared.Libs.DLW.Vec.pos]
pos2nat_inj [in Undecidability.Shared.Libs.DLW.Vec.pos]
pos2nat_prop [in Undecidability.Shared.Libs.DLW.Vec.pos]
power_2_minus_1_gt [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
power_2_minus_1 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
power_0_inv [in Undecidability.Shared.Libs.DLW.Utils.sums]
power_mono_r [in Undecidability.Shared.Libs.DLW.Utils.sums]
power_smono_l [in Undecidability.Shared.Libs.DLW.Utils.sums]
power_mono_l [in Undecidability.Shared.Libs.DLW.Utils.sums]
power_ge_n [in Undecidability.Shared.Libs.DLW.Utils.sums]
power_sinc [in Undecidability.Shared.Libs.DLW.Utils.sums]
power_ge_1 [in Undecidability.Shared.Libs.DLW.Utils.sums]
power_mult [in Undecidability.Shared.Libs.DLW.Utils.sums]
power_plus [in Undecidability.Shared.Libs.DLW.Utils.sums]
power_of_1 [in Undecidability.Shared.Libs.DLW.Utils.sums]
power_of_0 [in Undecidability.Shared.Libs.DLW.Utils.sums]
power_1 [in Undecidability.Shared.Libs.DLW.Utils.sums]
power_S [in Undecidability.Shared.Libs.DLW.Utils.sums]
power_0 [in Undecidability.Shared.Libs.DLW.Utils.sums]
power_extensional [in Undecidability.Shared.Libs.PSL.Lists.Power]
power_nil [in Undecidability.Shared.Libs.PSL.Lists.Power]
power_incl [in Undecidability.Shared.Libs.PSL.Lists.Power]
power_2_inj [in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
power_decomp_unique' [in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
power_decomp_factor [in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
power_decomp_unique [in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
power_decomp_is_digit [in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
power_decomp_lt [in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
power2_gt_0 [in Undecidability.Shared.Libs.DLW.Utils.sums]
powSk [in Undecidability.L.Util.L_facts]
pow_add [in Undecidability.L.Prelim.ARS]
pow_star [in Undecidability.L.Prelim.ARS]
pow_Rstep [in Complexity.L.AbstractMachines.Computable.EvalForTime]
pow_app_helperR [in Undecidability.L.Tactics.Lrewrite]
pow_app_helperL [in Undecidability.L.Tactics.Lrewrite]
pow_redLe_subrelation' [in Undecidability.L.Tactics.Lrewrite]
pow_app_helper [in Undecidability.L.Tactics.Lrewrite]
pow_trans_lam [in Undecidability.L.Util.L_facts]
pow_trans_lam' [in Undecidability.L.Util.L_facts]
pow_trans [in Undecidability.L.Util.L_facts]
pow_plus [in Undecidability.TM.Util.Relations]
pow_trans_eq [in Undecidability.L.Tactics.Lbeta]
pow_time_bound [in Complexity.Complexity.Definitions]
pow2_dec_ge1 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
pow2_dec_uniq [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
pow2_2n1_dec [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
pow2_ge1 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
pow2_fix1 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
pow2_fix0 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
prefix_app_lft_inv [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
prefix_app_inv [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
prefix_trans [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
prefix_refl [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
prefix_list_inv [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
prefix_inv [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
prefix_app_lft [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
prefix_length [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
preludeInitialString_length [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
preludeSigP_finRepr [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
prelude_ok [in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
prelude_reduction_from_ExPTCC [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
prelude_sound [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
prelude_complete [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
prelude_whole_string_covering_unique [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
prelude_whole_string_covering [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
prelude_left_covering_blank_unique [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
prelude_left_covering_blank [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
prelude_center_covering_state_unique [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
prelude_center_covering_state [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
prelude_right_half_covering_input_unique' [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
prelude_right_half_covering_input_unique [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
prelude_right_half_covering_input [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
prelude_right_half_covering_cert_unique' [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
prelude_right_half_covering_cert_unique [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
prelude_right_half_covering_cert' [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
prelude_right_half_covering_cert [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
prelude_right_half_covering_blank [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
prelude_blank_tape_covering_right_unique [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
prelude_blank_tape_covering_right [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
prime_decomp_uniq [in Undecidability.Shared.Libs.DLW.Utils.prime]
prime_in_decomp [in Undecidability.Shared.Libs.DLW.Utils.prime]
prime_decomp [in Undecidability.Shared.Libs.DLW.Utils.prime]
prime_rect [in Undecidability.Shared.Libs.DLW.Utils.prime]
prime_factor [in Undecidability.Shared.Libs.DLW.Utils.prime]
prime_div_mult [in Undecidability.Shared.Libs.DLW.Utils.prime]
prime_gcd [in Undecidability.Shared.Libs.DLW.Utils.prime]
prime_ge_2 [in Undecidability.Shared.Libs.DLW.Utils.prime]
prime_bool_spec [in Undecidability.Shared.Libs.DLW.Utils.prime]
prime_bool_rec_spec [in Undecidability.Shared.Libs.DLW.Utils.prime]
prime_algo [in Undecidability.Shared.Libs.DLW.Utils.prime]
prime_2 [in Undecidability.Shared.Libs.DLW.Utils.prime]
Private_UnfoldClos.SpecT [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
Private_UnfoldClos.SpecT__loop [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
Private_UnfoldClos.tspec_revertPure [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
Private_UnfoldClos.SpecT__step [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
proc_extT [in Undecidability.L.Tactics.ComputableTime]
proc_test [in Undecidability.L.Computability.Synthetic]
proc_lambda [in Undecidability.L.Tactics.Lproc]
proc_closed [in Undecidability.L.Tactics.Lproc]
proc_ext [in Undecidability.L.Tactics.Computable]
ProdCount [in Undecidability.Shared.Libs.PSL.FiniteTypes.VectorFin]
ProdCount [in Undecidability.Shared.Libs.PSL.FiniteTypes.CompoundFinTypes]
prodLists_poly [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
prodLists_time_bound [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
prodLists_poly [in Complexity.Libs.CookPrelim.PolyBounds]
prodLists_time_bound [in Complexity.Libs.CookPrelim.PolyBounds]
prodLists_length [in Complexity.Libs.CookPrelim.MorePrelim]
prod_eqb_spec [in Undecidability.L.Datatypes.LProd]
prod_nil [in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
prod_enum_ok [in Undecidability.Shared.Libs.PSL.FiniteTypes.VectorFin]
prod_eq [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
prod_enum_ok [in Undecidability.Shared.Libs.PSL.FiniteTypes.CompoundFinTypes]
projection [in Undecidability.Synthetic.MoreEnumerabilityFacts]
projection [in Undecidability.Synthetic.ListEnumerabilityFacts]
projection [in Undecidability.L.Computability.Synthetic]
projection' [in Undecidability.Synthetic.MoreEnumerabilityFacts]
projection' [in Undecidability.Synthetic.ListEnumerabilityFacts]
projVars_mul_offset [in Complexity.NP.SAT.FSAT.FormulaEncoding]
projVars_combined2 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
projVars_combined1 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
projVars_in_ge [in Complexity.NP.SAT.FSAT.FormulaEncoding]
projVars_length_le2 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
projVars_length_le [in Complexity.NP.SAT.FSAT.FormulaEncoding]
projVars_add [in Complexity.NP.SAT.FSAT.FormulaEncoding]
projVars_comp [in Complexity.NP.SAT.FSAT.FormulaEncoding]
projVars_all [in Complexity.NP.SAT.FSAT.FormulaEncoding]
projVars_app3 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
projVars_app2 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
projVars_app1 [in Complexity.NP.SAT.FSAT.FormulaEncoding]
projVars_length [in Complexity.NP.SAT.FSAT.FormulaEncoding]
proveOne [in Undecidability.Shared.Libs.PSL.FiniteTypes.CompoundFinTypes]
pro_enum_term [in Complexity.NP.L.CanEnumTerm]
pTC_pow_c [in Complexity.Complexity.PolyTimeComputable]
pTC_max [in Complexity.Complexity.PolyTimeComputable]
pTC_plus [in Complexity.Complexity.PolyTimeComputable]
pTC_mult [in Complexity.Complexity.PolyTimeComputable]
pTC_S [in Complexity.Complexity.PolyTimeComputable]
pTC_id [in Complexity.Complexity.PolyTimeComputable]
pTC_cnst [in Complexity.Complexity.PolyTimeComputable]
pTC_snd [in Complexity.Complexity.PolyTimeComputable]
pTC_fst [in Complexity.Complexity.PolyTimeComputable]
pTC_destructuringToProj [in Complexity.Complexity.PolyTimeComputable]
pTC_inl [in Complexity.NP.TM.LM_to_mTM]
pTC_Encode_Prog [in Complexity.NP.TM.LM_to_mTM]
pTC_Encode_Com [in Complexity.NP.TM.LM_to_mTM]
pTC_initValue [in Complexity.NP.TM.LM_to_mTM]
pTC_app [in Complexity.NP.TM.LM_to_mTM]
pTC_concat [in Complexity.NP.TM.LM_to_mTM]
pTC_map [in Complexity.NP.TM.LM_to_mTM]
pTC_Vector_cons [in Complexity.NP.TM.LM_to_mTM]
pTC_cons [in Complexity.NP.TM.LM_to_mTM]
pTC_Code_size [in Complexity.NP.TM.LM_to_mTM]
pTC_length [in Complexity.NP.TM.LM_to_mTM]
pure_eq [in Undecidability.Shared.Libs.PSL.FiniteTypes.Arbitrary]
pure_impure [in Undecidability.Shared.Libs.PSL.FiniteTypes.Arbitrary]
pure_equiv [in Undecidability.Shared.Libs.PSL.FiniteTypes.Arbitrary]
purify [in Undecidability.Shared.Libs.PSL.FiniteTypes.Arbitrary]
pushHFS_append2 [in Undecidability.TM.Code.BinNumbers.PosIncrementTM]
pushHFS_append1 [in Undecidability.TM.Code.BinNumbers.PosIncrementTM]
pushHFS_append2' [in Undecidability.TM.Code.BinNumbers.PosAddTM]
pushHFS_append1' [in Undecidability.TM.Code.BinNumbers.PosAddTM]
PushHSB_Sem [in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
putEndAtFirst_to_list [in Complexity.NP.TM.M_multi2mono]
putEndAtFirst_dupfree [in Complexity.NP.TM.M_multi2mono]
putEnd_invL [in Complexity.NP.TM.M_multi2mono]
putFirstAtEnd_to_list [in Complexity.NP.TM.M_multi2mono]
putFirstAtEnd_dupfree [in Complexity.NP.TM.M_multi2mono]
put_extends [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
Put_Terminates [in Undecidability.TM.L.HeapInterpreter.StepTM]
Put_Realise [in Undecidability.TM.L.HeapInterpreter.StepTM]
put_extends [in Complexity.L.AbstractMachines.AbstractHeapMachine]
p_invariant [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
P_NP_incl [in Complexity.Complexity.NP]

Q

quotient_is_enum [in Undecidability.Shared.Libs.DLW.Utils.quotient]

R

rClosed_decb_correct [in Undecidability.L.Tactics.Reflection]
rClosed_decb'_correct [in Undecidability.L.Tactics.Reflection]
rClosed_valid [in Undecidability.L.Tactics.Reflection]
rCompBeta_rValidComp [in Undecidability.L.Tactics.Reflection]
rCompBeta_sound [in Undecidability.L.Tactics.Reflection]
rCompSeval_rValidComp [in Undecidability.L.Tactics.Reflection]
rCompSeval_sound [in Undecidability.L.Tactics.Reflection]
rcomp_comm [in Undecidability.L.Prelim.ARS]
rcomp_1 [in Undecidability.L.Prelim.ARS]
rcomp_eq [in Undecidability.L.Prelim.ARS]
rDeClos_rValidComp [in Undecidability.L.Tactics.Reflection]
rDeClos_reduce [in Undecidability.L.Tactics.Reflection]
ReadChar_at_Sem [in Undecidability.TM.Compound.Multi]
ReadCurrentSymbols_steps_nice [in Complexity.TM.PrettyBounds.M2MBounds]
ReadCurrentSymbols_Loop_steps_cons_nice [in Complexity.TM.PrettyBounds.M2MBounds]
ReadCurrentSymbols_Step_steps_cons_nice [in Complexity.TM.PrettyBounds.M2MBounds]
ReadCurrentSymbols_Terminates [in Undecidability.TM.Single.StepTM]
ReadCurrentSymbols_Realise [in Undecidability.TM.Single.StepTM]
ReadCurrentSymbols_Loop_Terminates [in Undecidability.TM.Single.StepTM]
ReadCurrentSymbols_Loop_Realise [in Undecidability.TM.Single.StepTM]
ReadCurrentSymbols_Step_Terminates [in Undecidability.TM.Single.StepTM]
ReadCurrentSymbols_Step_Realise [in Undecidability.TM.Single.StepTM]
ReadCurrent_Sem [in Undecidability.TM.Single.StepTM]
ReadCurrent_Sem [in Undecidability.TM.Univ.LowLevel]
ReadCurrent'_Sem [in Undecidability.TM.Univ.LowLevel]
ReadCurrent'_SpecT_space [in Undecidability.TM.Univ.Univ]
ReadPosSym_Sem [in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
ReadPosSym2_Sem [in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
RealiseIntroAll [in Undecidability.TM.Hoare.HoareLegacy]
RealiseIn_TerminatesIn [in Undecidability.TM.Util.TM_facts]
RealiseIn_Realise [in Undecidability.TM.Util.TM_facts]
RealiseIn_split [in Undecidability.TM.Util.TM_facts]
RealiseIn_monotone' [in Undecidability.TM.Util.TM_facts]
RealiseIn_monotone [in Undecidability.TM.Util.TM_facts]
RealiseIn_TripleT [in Undecidability.TM.Hoare.HoareLogic]
Realises__mono [in Complexity.NP.TM.M_multi2mono]
Realise_strengthen [in Undecidability.TM.Util.TM_facts]
Realise_total [in Undecidability.TM.Util.TM_facts]
Realise_monotone [in Undecidability.TM.Util.TM_facts]
Realise_TripleT [in Undecidability.TM.Hoare.HoareLogic]
Realise_Triple [in Undecidability.TM.Hoare.HoareLogic]
recRel_prettify_rel [in Undecidability.L.Tactics.ComputableTactics]
recRel_prettify_conj_drop_r [in Undecidability.L.Tactics.ComputableTactics]
recRel_prettify_conj [in Undecidability.L.Tactics.ComputableTactics]
recRel_prettify_forall [in Undecidability.L.Tactics.ComputableTactics]
recRel_prettify_drop [in Undecidability.L.Tactics.ComputableTactics]
redLe_app_helperR [in Undecidability.L.Tactics.Lrewrite]
redLe_app_helperL [in Undecidability.L.Tactics.Lrewrite]
redLe_app_helper [in Undecidability.L.Tactics.Lrewrite]
redLe_trans_eq [in Undecidability.L.Util.L_facts]
redLe_trans [in Undecidability.L.Util.L_facts]
redLe_mono [in Undecidability.L.Util.L_facts]
reducesPolyMO_intro_restrictBy_both [in Complexity.Complexity.Subtypes]
reducesPolyMO_intro_restrictBy_in [in Complexity.Complexity.Subtypes]
reducesPolyMO_intro_restrictBy_out [in Complexity.Complexity.Subtypes]
reducesPolyMO_transitive [in Complexity.Complexity.NP]
reducesPolyMO_reflexive [in Complexity.Complexity.NP]
reducesPolyMO_elim [in Complexity.Complexity.NP]
reduces_ireduces_iff [in Undecidability.Synthetic.InformativeReducibilityFacts]
reduces_ireduces [in Undecidability.Synthetic.InformativeReducibilityFacts]
reduces_dependent [in Undecidability.Synthetic.ReducibilityFacts]
reduces_transitive [in Undecidability.Synthetic.ReducibilityFacts]
reduces_reflexive [in Undecidability.Synthetic.ReducibilityFacts]
reduction_size_bound [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
reduction_poly [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
reduction_time_bound [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
reduction_wf_size_poly [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
reduction_wf_size_bound [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
reduction_wf_poly [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
reduction_wf_time_bound [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
reduction_size_bound [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
reduction_poly [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
reduction_time_bound [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
reduction_correct [in Complexity.NP.SAT.CookLevin.Reductions.TMGenNP_fixed_singleTapeTM_to_FlatFunSingleTMGenNP]
reduction_wf [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
reduction_wf_correct [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
reduction_isFlatTCCOf [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
reduction_to_Clique [in Complexity.NP.Clique.kSAT_to_Clique]
reduction_wf [in Complexity.NP.SAT.CookLevin.Reductions.CC_to_BinaryCC]
reduction_poly [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
reduction_time_bound [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
reduction_poly_size [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
reduction_varBound [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
reduction_size [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
redWithMaxSize_star [in Undecidability.L.Prelim.ARS]
redWithMaxSize_trans [in Undecidability.L.Prelim.ARS]
redWithMaxSize_ge [in Undecidability.L.Prelim.ARS]
red_to_exptpr [in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
red_NPhard [in Complexity.Complexity.NP]
red_inNP [in Complexity.Complexity.NP]
red_comp [in Undecidability.Synthetic.ReducibilityFacts]
reflects_prv [in Undecidability.Synthetic.DecidabilityFacts]
reflects_disj [in Undecidability.Synthetic.DecidabilityFacts]
reflects_conj [in Undecidability.Synthetic.DecidabilityFacts]
reflects_not [in Undecidability.Synthetic.DecidabilityFacts]
registerAs [in Undecidability.L.Tactics.Computable]
registerInjAs [in Undecidability.L.Tactics.Computable]
Relabel_Terminates [in Undecidability.TM.Combinators.Combinators]
Relabel_RealiseIn [in Undecidability.TM.Combinators.Combinators]
Relabel_Realise [in Undecidability.TM.Combinators.Combinators]
Relabel_SpecT_con [in Undecidability.TM.Hoare.HoareCombinators]
Relabel_SpecT [in Undecidability.TM.Hoare.HoareCombinators]
Relabel_Spec_con [in Undecidability.TM.Hoare.HoareCombinators]
Relabel_Spec [in Undecidability.TM.Hoare.HoareCombinators]
relpowerRev_trans [in Complexity.Libs.CookPrelim.MorePrelim]
relpower_valid_map_inl [in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
relpower_comb_split [in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
relpower_inl_liftOrig [in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
relpower_inr_liftPrelude [in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
relpower_inr_liftPrelude' [in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
relpower_valid_agree [in Complexity.NP.SAT.CookLevin.Reductions.TCC_to_CC]
relpower_valid_flat_agree [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
relpower_valid_length_inv [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
relpower_loop_agree [in Complexity.NP.SAT.CookLevin.Subproblems.TM_single]
relpower_valid_to_assignment [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
relpower_valid_flat_agree [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
relpower_valid_list_ofFlatType_invariant [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
relpower_valid_length_inv [in Complexity.NP.SAT.CookLevin.Subproblems.CC]
relpower_add_split [in Complexity.Libs.CookPrelim.MorePrelim]
relpower_relpowerRev [in Complexity.Libs.CookPrelim.MorePrelim]
relpower_congruent [in Complexity.Libs.CookPrelim.MorePrelim]
relpower_monotonous [in Complexity.Libs.CookPrelim.MorePrelim]
relpower_trans [in Complexity.Libs.CookPrelim.MorePrelim]
rel_evalForTime__step [in Complexity.L.AbstractMachines.Computable.EvalForTime]
rel_prime_mult [in Undecidability.Shared.Libs.DLW.Utils.prime]
rel_iter_seq_equiv [in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
rel_iter_iter_seq [in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
rel_iter_seq_iter [in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
rel_iter_bound_equiv [in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
rel_iter_iter_bound [in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
rel_iter_bound_iter [in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
rel_iter_sequence [in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
rel_iter_S [in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
rel_iter_1 [in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
rel_iter_plus [in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
removelast_length [in Undecidability.TM.Single.StepTM]
removelast_cons [in Undecidability.TM.Single.StepTM]
removelast_as_tail [in Complexity.TM.Compound.MoveToSymbol_niceSpec]
removelast_length [in Undecidability.TM.Code.List.App]
removelast_cons [in Undecidability.TM.Code.List.App]
removelast_app_singleton [in Undecidability.TM.Code.List.App]
remove_length_el [in Complexity.Libs.CookPrelim.MorePrelim]
remove_length [in Complexity.Libs.CookPrelim.MorePrelim]
rem_cons_eq' [in Complexity.Libs.Pigeonhole]
rem_cons_eq [in Complexity.Libs.Pigeonhole]
rem_nel_eq [in Complexity.Libs.Pigeonhole]
rem_el [in Complexity.Libs.Pigeonhole]
rem_inclr [in Undecidability.Shared.Libs.PSL.Lists.Removal]
rem_reorder [in Undecidability.Shared.Libs.PSL.Lists.Removal]
rem_id [in Undecidability.Shared.Libs.PSL.Lists.Removal]
rem_fst' [in Undecidability.Shared.Libs.PSL.Lists.Removal]
rem_fst [in Undecidability.Shared.Libs.PSL.Lists.Removal]
rem_comm [in Undecidability.Shared.Libs.PSL.Lists.Removal]
rem_equi [in Undecidability.Shared.Libs.PSL.Lists.Removal]
rem_app' [in Undecidability.Shared.Libs.PSL.Lists.Removal]
rem_app [in Undecidability.Shared.Libs.PSL.Lists.Removal]
rem_neq [in Undecidability.Shared.Libs.PSL.Lists.Removal]
rem_in [in Undecidability.Shared.Libs.PSL.Lists.Removal]
rem_cons' [in Undecidability.Shared.Libs.PSL.Lists.Removal]
rem_cons [in Undecidability.Shared.Libs.PSL.Lists.Removal]
rem_mono [in Undecidability.Shared.Libs.PSL.Lists.Removal]
rem_incl [in Undecidability.Shared.Libs.PSL.Lists.Removal]
rem_not_in [in Undecidability.Shared.Libs.PSL.Lists.Removal]
rem_2_bool2nat [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
rem_app_eq [in Complexity.Libs.CookPrelim.PolyBounds]
rem_app_eq [in Complexity.Complexity.UpToCPoly]
rem_2_lt [in Undecidability.Shared.Libs.DLW.Utils.gcd]
rem_2_fix_2 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
rem_2_fix_1 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
rem_2_fix_0 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
rem_2_mult [in Undecidability.Shared.Libs.DLW.Utils.gcd]
rem_2_is_0_or_1 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
rem_plus_div [in Undecidability.Shared.Libs.DLW.Utils.gcd]
rem_scal [in Undecidability.Shared.Libs.DLW.Utils.gcd]
rem_plus [in Undecidability.Shared.Libs.DLW.Utils.gcd]
rem_lt [in Undecidability.Shared.Libs.DLW.Utils.gcd]
rem_diag [in Undecidability.Shared.Libs.DLW.Utils.gcd]
rem_mult_rem [in Undecidability.Shared.Libs.DLW.Utils.gcd]
rem_plus_rem [in Undecidability.Shared.Libs.DLW.Utils.gcd]
rem_of_0 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
rem_erase [in Undecidability.Shared.Libs.DLW.Utils.gcd]
rem_rem [in Undecidability.Shared.Libs.DLW.Utils.gcd]
rem_idem [in Undecidability.Shared.Libs.DLW.Utils.gcd]
rem_prop [in Undecidability.Shared.Libs.DLW.Utils.gcd]
rem_0 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
repeat_eq_iff [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
repeat_app_eq [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
repeat_S_cons [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
repeat_add_app [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
repeat_choice_two [in Undecidability.Shared.Libs.DLW.Utils.php]
repEl_isFlatListOf [in Complexity.Libs.CookPrelim.FlatFinTypes]
repEl_poly [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
repEl_time_bound [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
repEl_time_mono [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
repEl_app_inv [in Complexity.Libs.CookPrelim.MorePrelim]
repEl_add [in Complexity.Libs.CookPrelim.MorePrelim]
repEl_length [in Complexity.Libs.CookPrelim.MorePrelim]
replace_nth2 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
replace_nth [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
replace_pos [in Undecidability.Shared.Libs.PSL.Lists.Position]
replace_diff [in Undecidability.Shared.Libs.PSL.Lists.Position]
replace_same [in Undecidability.Shared.Libs.PSL.Lists.Position]
replace_nochange [in Undecidability.Shared.Libs.PSL.Vectors.VectorDupfree]
reprC_extend [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
reprC_elim_deep [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
reprC_elim [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
reprC_extend [in Complexity.L.AbstractMachines.AbstractHeapMachine]
reprC_functional [in Complexity.L.AbstractMachines.AbstractHeapMachine]
reprP_elim [in Undecidability.L.AbstractMachines.FlatPro.ProgramsDef]
reprTape_no_isStateSym [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
rep_card_length [in Complexity.Libs.Pigeonhole]
rep_sigma [in Complexity.Libs.Pigeonhole]
rep_plus_nrep [in Complexity.Libs.Pigeonhole]
rep_dupfree_False [in Complexity.Libs.Pigeonhole]
rep_cons [in Complexity.Libs.Pigeonhole]
rep_nil [in Complexity.Libs.Pigeonhole]
rep_dupfree [in Undecidability.Shared.Libs.PSL.Lists.Power]
rep_idempotent [in Undecidability.Shared.Libs.PSL.Lists.Power]
rep_injective [in Undecidability.Shared.Libs.PSL.Lists.Power]
rep_eq [in Undecidability.Shared.Libs.PSL.Lists.Power]
rep_eq' [in Undecidability.Shared.Libs.PSL.Lists.Power]
rep_mono [in Undecidability.Shared.Libs.PSL.Lists.Power]
rep_equi [in Undecidability.Shared.Libs.PSL.Lists.Power]
rep_in [in Undecidability.Shared.Libs.PSL.Lists.Power]
rep_incl [in Undecidability.Shared.Libs.PSL.Lists.Power]
rep_power [in Undecidability.Shared.Libs.PSL.Lists.Power]
rep_cons_eq [in Undecidability.Shared.Libs.PSL.Lists.Power]
rep_cons' [in Undecidability.Shared.Libs.PSL.Lists.Power]
rep_cons [in Undecidability.Shared.Libs.PSL.Lists.Power]
ResetEmpty_Spec [in Undecidability.TM.Code.Copy]
ResetEmpty_Spec_size [in Undecidability.TM.Code.Copy]
ResetEmpty_SpecT [in Undecidability.TM.Code.Copy]
ResetEmpty_SpecT_space [in Undecidability.TM.Code.Copy]
ResetEmpty_Sem [in Undecidability.TM.Code.Copy]
ResetEmpty1_Spec [in Undecidability.TM.Code.Copy]
ResetEmpty1_Spec_size [in Undecidability.TM.Code.Copy]
ResetEmpty1_SpecT [in Undecidability.TM.Code.Copy]
ResetEmpty1_SpecT_space [in Undecidability.TM.Code.Copy]
ResetEmpty1_Sem [in Undecidability.TM.Code.Copy]
Reset_steps_nice [in Complexity.TM.PrettyBounds.BaseCode]
Reset_size_nice [in Complexity.TM.PrettyBounds.BaseCodeSpace]
Reset_Spec [in Undecidability.TM.Code.Copy]
Reset_Spec_size [in Undecidability.TM.Code.Copy]
Reset_SpecT [in Undecidability.TM.Code.Copy]
Reset_SpecT_space [in Undecidability.TM.Code.Copy]
Reset_Realise [in Undecidability.TM.Code.Copy]
Reset_Spec [in Undecidability.TM.Hoare.HoareExamples]
Reset_SpecT [in Undecidability.TM.Hoare.HoareExamples]
Reset_SpecT_space [in Undecidability.TM.Hoare.HoareExamples]
resSizePoly_compSize [in Complexity.Complexity.Definitions]
resSizePoly_prod [in Complexity.Complexity.PolyTimeComputable]
resSizePoly_composition2 [in Complexity.Complexity.PolyTimeComputable]
resSizePoly_composition [in Complexity.Complexity.PolyTimeComputable]
restrict_formula_equisat [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
retract_join [in Undecidability.Shared.Libs.PSL.Retracts]
retract_g_None [in Undecidability.Shared.Libs.PSL.Retracts]
retract_g_Some [in Undecidability.Shared.Libs.PSL.Retracts]
retract_f_injective [in Undecidability.Shared.Libs.PSL.Retracts]
retract_g_surjective [in Undecidability.Shared.Libs.PSL.Retracts]
Return_Terminates [in Undecidability.TM.Combinators.Combinators]
Return_RealiseIn [in Undecidability.TM.Combinators.Combinators]
Return_Realise [in Undecidability.TM.Combinators.Combinators]
Return_SpecT_con [in Undecidability.TM.Hoare.HoareCombinators]
Return_SpecT [in Undecidability.TM.Hoare.HoareCombinators]
Return_Spec_con [in Undecidability.TM.Hoare.HoareCombinators]
Return_Spec [in Undecidability.TM.Hoare.HoareCombinators]
rev_concat_length [in Undecidability.L.Datatypes.List.List_basics]
rev_concat_rev [in Undecidability.L.Datatypes.List.List_basics]
rev_eq_cons [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
rev_eq_nil [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
rev_repeat [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
Rev_SpecT [in Undecidability.TM.Code.List.Rev]
Rev_Terminates [in Undecidability.TM.Code.List.Rev]
Rev_Realise [in Undecidability.TM.Code.List.Rev]
Rev_Append_SpecT [in Undecidability.TM.Code.List.Rev]
Rev_Append_Terminates [in Undecidability.TM.Code.List.Rev]
Rev_Append_Realise [in Undecidability.TM.Code.List.Rev]
Rev_Step_Terminates [in Undecidability.TM.Code.List.Rev]
Rev_Step_Realise [in Undecidability.TM.Code.List.Rev]
rev_repEl [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
rev_E [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
rev_polarityRev [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
rev_fold [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
rev_involution [in Complexity.Libs.CookPrelim.MorePrelim]
rho_lambda [in Undecidability.L.Util.L_facts]
rho_cls [in Undecidability.L.Util.L_facts]
rho_dcls [in Undecidability.L.Util.L_facts]
rho_inj [in Undecidability.L.Tactics.Lsimpl]
rho_correctPow [in Undecidability.L.Tactics.Lsimpl]
rho_correct [in Undecidability.L.Tactics.Lsimpl]
Rice [in Undecidability.L.Computability.Rice]
Rice_classical [in Undecidability.L.Computability.Rice]
Rice1 [in Undecidability.L.Computability.Rice]
Rice2 [in Undecidability.L.Computability.Rice]
right_sizeOfTape [in Undecidability.TM.PrettyBounds.SizeBounds]
right_inv_surjective [in Undecidability.Shared.Libs.PSL.Bijection]
rincl_fin_chain_bounded [in Undecidability.Shared.Libs.DLW.Wf.wf_incl]
rincl_fin_chains [in Undecidability.Shared.Libs.DLW.Wf.wf_incl]
rReduceIntro [in Undecidability.L.Tactics.Reflection]
rStandardize [in Undecidability.L.Tactics.Reflection]
rStandardizeUse [in Undecidability.L.Tactics.Reflection]
rStandardizeUsePow [in Undecidability.L.Tactics.Reflection]
rSubstList_correct [in Undecidability.L.Tactics.Reflection]
R_star [in Undecidability.L.Prelim.ARS]
R_canonical_functional [in Undecidability.TM.Util.TM_facts]

S

satAssgn_sat_cnf [in Complexity.NP.Clique.kSAT_to_Clique]
satAssgn_sat_literals [in Complexity.NP.Clique.kSAT_to_Clique]
satFinal_final_equivalent [in Complexity.NP.SAT.CookLevin.Subproblems.CC]
satFinal_final_monotonous [in Complexity.NP.SAT.CookLevin.Subproblems.CC]
satLiterals_not_conflicting [in Complexity.NP.Clique.kSAT_to_Clique]
satLiterals_sat [in Complexity.NP.Clique.kSAT_to_Clique]
satLiterals_for_all_clauses [in Complexity.NP.Clique.kSAT_to_Clique]
satPositions_valid [in Complexity.NP.Clique.kSAT_to_Clique]
satPositions_non_conflicting [in Complexity.NP.Clique.kSAT_to_Clique]
satPositions_for_all_clauses [in Complexity.NP.Clique.kSAT_to_Clique]
satPositions_dupfree [in Complexity.NP.Clique.kSAT_to_Clique]
sat_NP [in Complexity.NP.SAT.SAT_inNP]
sat_verifierb_correct [in Complexity.NP.SAT.SAT_inNP]
SAT_equiv_FlatClique [in Complexity.NP.Clique.kSAT_to_FlatClique]
SAT_implies_FlatClique [in Complexity.NP.Clique.kSAT_to_FlatClique]
scal_one [in Undecidability.Shared.Libs.DLW.Utils.sums]
scal_one_comm [in Undecidability.Shared.Libs.DLW.Utils.sums]
scal_times [in Undecidability.Shared.Libs.DLW.Utils.sums]
Scott [in Undecidability.L.Computability.Scott]
SecondFixedPoint [in Undecidability.L.Computability.Fixpoints]
select_nth [in Undecidability.TM.Lifting.LiftTapes]
self_div_comb [in Undecidability.L.Computability.Rice]
self_div [in Undecidability.L.Computability.Rice]
semi_confluent_confluent [in Undecidability.L.Prelim.ARS]
semi_decidable_enumerable [in Undecidability.Synthetic.EnumerabilityFacts]
seqeq_incl [in Undecidability.Shared.Libs.DLW.Utils.seteq]
seq_isFlatListOf [in Complexity.Libs.CookPrelim.FlatFinTypes]
seq_of_coprimes [in Undecidability.Shared.Libs.DLW.Utils.crt]
Seq_RealiseIn [in Undecidability.TM.Combinators.SequentialComposition]
Seq_TerminatesIn' [in Undecidability.TM.Combinators.SequentialComposition]
Seq_TerminatesIn [in Undecidability.TM.Combinators.SequentialComposition]
Seq_Realise [in Undecidability.TM.Combinators.SequentialComposition]
Seq_SpecT' [in Undecidability.TM.Hoare.HoareCombinators]
Seq_SpecT [in Undecidability.TM.Hoare.HoareCombinators]
Seq_SpecT_strong [in Undecidability.TM.Hoare.HoareCombinators]
Seq_Spec_swapped' [in Undecidability.TM.Hoare.HoareCombinators]
Seq_Spec_swapped [in Undecidability.TM.Hoare.HoareCombinators]
Seq_Spec' [in Undecidability.TM.Hoare.HoareCombinators]
Seq_Spec [in Undecidability.TM.Hoare.HoareCombinators]
SetBitAndMoveLeft_Sem [in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
seteq_bi_incl [in Undecidability.Shared.Libs.DLW.Utils.seteq]
SetFinal_size_nice [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
SetFinal_Terminates [in Undecidability.TM.Univ.LowLevel]
SetFinal_Realise [in Undecidability.TM.Univ.LowLevel]
SetFinal_SpecT_space [in Undecidability.TM.Univ.Univ]
seval_Eval [in Undecidability.L.Functions.Eval]
seval_rect [in Undecidability.L.Computability.Seval]
seval_eva [in Undecidability.L.Computability.Seval]
seval_S [in Undecidability.L.Computability.Seval]
seval_eval [in Undecidability.L.Computability.Seval]
ShiftLeft_num_Realise [in Undecidability.TM.Code.BinNumbers.PosShiftTM]
ShiftLeft_num_Loop_Realise [in Undecidability.TM.Code.BinNumbers.PosShiftTM]
ShiftLeft_num_Step_Realise [in Undecidability.TM.Code.BinNumbers.PosShiftTM]
ShiftLeft_Realise [in Undecidability.TM.Code.BinNumbers.PosShiftTM]
ShiftRight_num_Realise [in Undecidability.TM.Code.BinNumbers.PosShiftTM]
ShiftRight_num_Loop_Realise [in Undecidability.TM.Code.BinNumbers.PosShiftTM]
ShiftRight_num_Step_Realise [in Undecidability.TM.Code.BinNumbers.PosShiftTM]
ShiftRight_Realise [in Undecidability.TM.Code.BinNumbers.PosShiftTM]
ShiftRight'_Realise [in Undecidability.TM.Code.BinNumbers.PosShiftTM]
shift_left_shift_right [in Undecidability.TM.Code.BinNumbers.PosDefinitions]
shift_left_append_zero [in Undecidability.TM.Code.BinNumbers.PosDefinitions]
Shift_L_TerminatesIn [in Undecidability.TM.Compound.Shift]
Shift_L_fun_correct_midtape_stop [in Undecidability.TM.Compound.Shift]
Shift_L_fun_correct_midtape [in Undecidability.TM.Compound.Shift]
Shift_L_Realise [in Undecidability.TM.Compound.Shift]
Shift_fun_mirror [in Undecidability.TM.Compound.Shift]
Shift_TerminatesIn [in Undecidability.TM.Compound.Shift]
Shift_steps_local [in Undecidability.TM.Compound.Shift]
Shift_fun_correct_midtape_stop [in Undecidability.TM.Compound.Shift]
Shift_fun_correct_midtape [in Undecidability.TM.Compound.Shift]
Shift_Realise [in Undecidability.TM.Compound.Shift]
Shift_fun_move [in Undecidability.TM.Compound.Shift]
Shift_Step_Sem [in Undecidability.TM.Compound.Shift]
sigList_eqb_spec [in Complexity.L.TM.CompCode]
Sigma_finRepr [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
sigNat_eqb_spec [in Complexity.L.TM.CompCode]
sigOption_eqb_spec [in Complexity.L.TM.CompCode]
sigPair_eqb_spec [in Complexity.L.TM.CompCode]
sigSum_eqb_spec [in Complexity.L.TM.CompCode]
sigTape_eqb_spec [in Complexity.L.TM.CompCode]
sig_TM_le [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
simulation [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
sincl_chain_bounded [in Undecidability.Shared.Libs.DLW.Wf.wf_incl]
sincl_chain [in Undecidability.Shared.Libs.DLW.Wf.wf_incl]
sinc_injective [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
sinc_decidable [in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
SingleTMGenNP_to_TCC [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
SingleTMGenNP_to_PTCC [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
singleton_incl [in Complexity.Libs.CookPrelim.Tactics]
sizeOfmTapesFlat_timeBySize [in Complexity.L.TM.TMflatComp]
sizeOfmTapesFlat_eq [in Complexity.L.TM.TMflatFun]
sizeOfmTapes_upperBound [in Undecidability.TM.PrettyBounds.SizeBounds]
sizeOfmTapes_max_list_map [in Undecidability.TM.PrettyBounds.SizeBounds]
sizeOfmTapes_by_size [in Undecidability.L.TM.TMEncoding]
sizeOfTape_tape_contains_size [in Undecidability.TM.Code.CodeTM]
sizeoftape_maptape_eq [in Complexity.L.TM.TMflatFun]
sizeOfTape_by_size [in Undecidability.L.TM.TMEncoding]
sizeOfTape_lcr [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
sizeOfTape_encodeTape_le [in Undecidability.TM.Single.EncodeTapes]
sizeOfTape_encodeTape [in Undecidability.TM.Single.EncodeTapes]
sizeP_le_size [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds_Loop]
sizeP_size [in Undecidability.L.AbstractMachines.FlatPro.Programs]
sizeP_size' [in Undecidability.L.AbstractMachines.FlatPro.Programs]
sizeTR_correct [in Undecidability.L.Functions.Size]
sizeTR'_fuel_leq_size [in Undecidability.L.Functions.Size]
sizeTR'_correct [in Undecidability.L.Functions.Size]
sizeT_le_size [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds_Loop]
sizeT_ge_1 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds_Loop]
sizeT_compile_list_bool [in Complexity.L.AbstractMachines.FlatPro.Computable.Compile]
size_recursion [in Undecidability.Shared.Libs.PSL.Numbers]
size_induction_dep [in Undecidability.Shared.Libs.PSL.Numbers]
size_induction [in Undecidability.Shared.Libs.PSL.Numbers]
size_prod [in Undecidability.L.Datatypes.LProd]
size_final_tapes' [in Complexity.TM.PrettyBounds.M2MBounds]
size_final_tapes [in Complexity.TM.PrettyBounds.M2MBounds]
size_doAct_multi' [in Complexity.TM.PrettyBounds.M2MBounds]
size_doAct_multi [in Complexity.TM.PrettyBounds.M2MBounds]
size_tape_ge1 [in Complexity.TM.PrettyBounds.M2MBounds]
size_doActions' [in Complexity.TM.PrettyBounds.M2MBounds]
size_doActions [in Complexity.TM.PrettyBounds.M2MBounds]
size_tape_bounded [in Complexity.TM.PrettyBounds.M2MBounds]
size_tapes_ge1 [in Complexity.TM.PrettyBounds.M2MBounds]
size_state_le [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
size_state_lt [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
size_char_eq [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
size_HClos_le [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds_Loop]
size_list_le_bound [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds_Loop]
size_list [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds_Loop]
size_le_sizeP [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds_Loop]
size_sizeT_le [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds_Loop]
size_option [in Undecidability.L.Datatypes.LOptions]
size_bool_enc [in Undecidability.L.Datatypes.LBool]
size_bool [in Undecidability.L.Datatypes.LBool]
size_TM [in Complexity.L.TM.TMflatEnc]
size_sum [in Undecidability.L.Datatypes.LSum]
size_list [in Undecidability.TM.PrettyBounds.SizeBounds]
size_Com_singleton [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
size_nat' [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
size_Var [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
size_ACom' [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
size_ACom [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
size_ACom_singleton' [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
size_ACom_singleton [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
size_list_enc_r [in Undecidability.L.Datatypes.Lists]
size_list_In [in Undecidability.L.Datatypes.Lists]
size_rev [in Undecidability.L.Datatypes.Lists]
size_list_cons [in Undecidability.L.Datatypes.Lists]
size_list [in Undecidability.L.Datatypes.Lists]
size_Tok_enc [in Complexity.L.AbstractMachines.FlatPro.Computable.LPro]
size_Tok_enc_r [in Complexity.L.AbstractMachines.FlatPro.Computable.LPro]
size_sigTape [in Complexity.L.TM.CompCode]
size_sigList [in Complexity.L.TM.CompCode]
size_boundary [in Complexity.L.TM.CompCode]
size_S [in Complexity.TM.PrettyBounds.BaseCodeSpace]
size_unit_enc [in Undecidability.L.Datatypes.LUnit]
size_term_enc_r [in Undecidability.L.Datatypes.LTerm]
size_term_enc [in Undecidability.L.Datatypes.LTerm]
size_clos [in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisStep]
size_input_index [in Complexity.NP.SAT.CookLevin.Reductions.TMGenNP_fixed_singleTapeTM_to_FlatFunSingleTMGenNP]
size_finType_any_le_c [in Undecidability.L.Datatypes.LFinType]
size_finType_any_le [in Undecidability.L.Datatypes.LFinType]
size_finType_le [in Undecidability.L.Datatypes.LFinType]
size_geq_1 [in Undecidability.L.AbstractMachines.FlatPro.Programs]
size_flatTapes [in Complexity.L.TM.TMflatFun]
size_flatTape [in Complexity.L.TM.TMflatFun]
size_nat_enc_r [in Undecidability.L.Datatypes.LNat]
size_nat_enc [in Undecidability.L.Datatypes.LNat]
size_cnf_app [in Complexity.NP.SAT.SAT]
size_clause_app [in Complexity.NP.SAT.SAT]
size_cnf_ge_length [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
size'_surj [in Undecidability.L.Functions.Size]
skipn_repeat [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
skipn_repeat_add [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
skipn_length [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
skipn_app [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
skipn_nil [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
skipn_tl [in Undecidability.TM.Code.Code]
skipn_0 [in Undecidability.TM.Code.Code]
skipn_firstn_skipn [in Complexity.Libs.CookPrelim.MorePrelim]
skipn_skipn [in Complexity.Libs.CookPrelim.MorePrelim]
skipn_firstn_shift [in Complexity.Libs.CookPrelim.MorePrelim]
skipn_firstn_rev [in Complexity.Libs.CookPrelim.MorePrelim]
skipn_app3 [in Complexity.Libs.CookPrelim.MorePrelim]
skipn_app2 [in Complexity.Libs.CookPrelim.MorePrelim]
skipn_add [in Complexity.Libs.CookPrelim.MorePrelim]
skipn_tl [in Undecidability.TM.Compound.WriteString]
skipn_S [in Undecidability.TM.Compound.WriteString]
Skip_cons_Terminates [in Undecidability.TM.Code.CaseList]
Skip_cons_Realise [in Undecidability.TM.Code.CaseList]
smallo_equiv.ino_agree_real [in Complexity.Complexity.ONotationIsAppropriate]
smallo_equiv.NtoQ_pos [in Complexity.Complexity.ONotationIsAppropriate]
smallo_equiv.QtoN_ceil [in Complexity.Complexity.ONotationIsAppropriate]
smallo_equiv.NtoQ_id [in Complexity.Complexity.ONotationIsAppropriate]
smallo_equiv.NtoQ_inj_mult [in Complexity.Complexity.ONotationIsAppropriate]
smallo_equiv.NtoQ_inj_add [in Complexity.Complexity.ONotationIsAppropriate]
smallo_equiv.NtoQ_inj_le [in Complexity.Complexity.ONotationIsAppropriate]
smallo_equiv.NtoQ_inj_lt [in Complexity.Complexity.ONotationIsAppropriate]
smpl_dupfree_helper2 [in Undecidability.TM.Lifting.LiftTapes]
smpl_dupfree_helper1 [in Undecidability.TM.Lifting.LiftTapes]
Snd_Terminates [in Undecidability.TM.Code.CasePair]
Snd_Realise [in Undecidability.TM.Code.CasePair]
SN_unfold [in Undecidability.L.Prelim.ARS]
SomeElement [in Undecidability.Shared.Libs.PSL.FiniteTypes.CompoundFinTypes]
Some_ofFlatType [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
Some_injective [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Some_inj [in Undecidability.TM.Lifting.LiftTapes]
soundness [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
soundness [in Complexity.L.AbstractMachines.AbstractHeapMachine]
soundness [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
soundnessTime [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
soundnessTime' [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
soundness' [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
soundness' [in Complexity.L.AbstractMachines.AbstractHeapMachine]
sound_evalForTime__step2' [in Complexity.L.AbstractMachines.Computable.EvalForTime]
sound_evalForTime__step [in Complexity.L.AbstractMachines.Computable.EvalForTime]
sound__decInTime [in Complexity.Complexity.Definitions]
spaceBS_hasSpace [in Undecidability.L.Complexity.ResourceMeasures]
space_constant_correct [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
space_bounds_time [in Complexity.Complexity.SpaceBoundsTime]
spec_evalForTime__step [in Complexity.L.AbstractMachines.Computable.EvalForTime]
spec_extractRes [in Complexity.L.AbstractMachines.Computable.EvalForTime]
spec_L__f [in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
splitAllFin [in Undecidability.TM.Lifting.LiftTapes]
split_interval [in Undecidability.Shared.Libs.DLW.Utils.sorting]
split_nat [in Undecidability.TM.Single.EncodeTapes]
split_vector_correct [in Undecidability.TM.Single.EncodeTapes]
sss_loop_complete [in Undecidability.Shared.Libs.DLW.Code.sss]
sss_loop_sound [in Undecidability.Shared.Libs.DLW.Code.sss]
sss_output_fun [in Undecidability.Shared.Libs.DLW.Code.sss]
sss_compute_fun [in Undecidability.Shared.Libs.DLW.Code.sss]
sss_compute_stop [in Undecidability.Shared.Libs.DLW.Code.sss]
sss_steps_stop [in Undecidability.Shared.Libs.DLW.Code.sss]
sss_compute_step_out_inv [in Undecidability.Shared.Libs.DLW.Code.sss]
sss_compute_inv [in Undecidability.Shared.Libs.DLW.Code.sss]
sss_compute_max_ind [in Undecidability.Shared.Libs.DLW.Code.sss]
sss_terminates_ind [in Undecidability.Shared.Libs.DLW.Code.sss]
sss_steps_stall [in Undecidability.Shared.Libs.DLW.Code.sss]
sss_step_stall_inv [in Undecidability.Shared.Libs.DLW.Code.sss]
sss_stall_step_0 [in Undecidability.Shared.Libs.DLW.Code.sss]
sss_stall_step_stall [in Undecidability.Shared.Libs.DLW.Code.sss]
sss_out_step_stall [in Undecidability.Shared.Libs.DLW.Code.sss]
sss_steps_stall_fun [in Undecidability.Shared.Libs.DLW.Code.sss]
sss_steps_stall_inv [in Undecidability.Shared.Libs.DLW.Code.sss]
sss_steps_compute [in Undecidability.Shared.Libs.DLW.Code.sss]
sss_step_in_code [in Undecidability.Shared.Libs.DLW.Code.sss]
sss_progress_trans [in Undecidability.Shared.Libs.DLW.Code.sss]
sss_compute_progress_trans [in Undecidability.Shared.Libs.DLW.Code.sss]
sss_progress_compute_trans [in Undecidability.Shared.Libs.DLW.Code.sss]
sss_compute_trans [in Undecidability.Shared.Libs.DLW.Code.sss]
sss_progress_compute [in Undecidability.Shared.Libs.DLW.Code.sss]
sss_steps_plus_inv [in Undecidability.Shared.Libs.DLW.Code.sss]
sss_steps_fun [in Undecidability.Shared.Libs.DLW.Code.sss]
sss_steps_S_inv' [in Undecidability.Shared.Libs.DLW.Code.sss]
sss_steps_inv [in Undecidability.Shared.Libs.DLW.Code.sss]
sss_steps_S_inv [in Undecidability.Shared.Libs.DLW.Code.sss]
sss_steps_0_inv [in Undecidability.Shared.Libs.DLW.Code.sss]
sss_steps_trans [in Undecidability.Shared.Libs.DLW.Code.sss]
sss_steps_1 [in Undecidability.Shared.Libs.DLW.Code.sss]
sss_steps_0 [in Undecidability.Shared.Libs.DLW.Code.sss]
sss_step_dec [in Undecidability.Shared.Libs.DLW.Code.sss]
sss_step_supcode [in Undecidability.Shared.Libs.DLW.Code.sss]
sss_step_subcode_inv [in Undecidability.Shared.Libs.DLW.Code.sss]
sss_step_fun [in Undecidability.Shared.Libs.DLW.Code.sss]
sstep_agree2 [in Complexity.NP.SAT.CookLevin.Subproblems.TM_single]
sstep_agree1 [in Complexity.NP.SAT.CookLevin.Subproblems.TM_single]
startRen_spec [in Undecidability.TM.L.CompilerBoolFuns.Compiler]
StartState_irrelevant [in Undecidability.TM.Combinators.StateWhile]
startState_irrelevant' [in Undecidability.TM.Combinators.StateWhile]
startState_irrelevant [in Undecidability.TM.Combinators.StateWhile]
start_not_in [in Undecidability.TM.Code.Copy]
star_ecl [in Undecidability.L.Prelim.ARS]
star_pow [in Undecidability.L.Prelim.ARS]
star_trans [in Undecidability.L.Prelim.ARS]
star_simpl_ind [in Undecidability.L.Prelim.ARS]
star_equiv [in Undecidability.L.Util.L_facts]
star_trans_r [in Undecidability.L.Util.L_facts]
star_trans_l [in Undecidability.L.Util.L_facts]
star_pow [in Undecidability.TM.Util.Relations]
star_trans [in Undecidability.TM.Util.Relations]
stateSigma_incl [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
stateSigma_finRepr [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
states_TM_le [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
states_finRepr [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
StateWhileCoInduction [in Undecidability.TM.Combinators.StateWhile]
StateWhileInduction [in Undecidability.TM.Combinators.StateWhile]
StateWhile_liftStart_halt [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
StateWhile_index_irrelevant [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
StateWhile_halt_irrelevant' [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
StateWhile_halt_irrelevant [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
StateWhile_graph_irrelevant [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
StateWhile_TerminatesIn [in Undecidability.TM.Combinators.StateWhile]
StateWhile_TerminatesIn_ind [in Undecidability.TM.Combinators.StateWhile]
StateWhile_Realise [in Undecidability.TM.Combinators.StateWhile]
StateWhile_merge_break [in Undecidability.TM.Combinators.StateWhile]
StateWhile_merge_repeat [in Undecidability.TM.Combinators.StateWhile]
StateWhile_split [in Undecidability.TM.Combinators.StateWhile]
StateWhile_split_break [in Undecidability.TM.Combinators.StateWhile]
StateWhile_split_repeat [in Undecidability.TM.Combinators.StateWhile]
StateWhile_trans_repeat [in Undecidability.TM.Combinators.StateWhile]
state_index_le [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
state_index_lt [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
stepFlat_time_nice [in Complexity.L.TM.TMflatComp]
stepFlat_eq [in Complexity.L.TM.TMflatFun]
stepf_spec [in Undecidability.L.Computability.Seval]
stepn_spec [in Undecidability.L.Computability.Seval]
stepsim [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
steps_steps_k [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
steps_k_steps [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
step_comp [in Undecidability.TM.Combinators.While]
Step_steps_nice [in Complexity.TM.PrettyBounds.M2MBounds]
Step_steps_nice' [in Complexity.TM.PrettyBounds.M2MBounds]
step_is_halt_state [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
step_functional [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
step_iff [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
step_fun_step [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
step_step_fun [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
step_eval [in Undecidability.L.Util.L_facts]
step_star [in Undecidability.L.Util.L_facts]
step_Lproc [in Undecidability.L.Util.L_facts]
Step_Terminates [in Undecidability.TM.Single.StepTM]
Step_Realise [in Undecidability.TM.Single.StepTM]
Step_steps_nicer [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds_Loop]
step_nop_split [in Undecidability.TM.Combinators.Switch]
step_nop_transition [in Undecidability.TM.Combinators.Switch]
step_comp_liftR [in Undecidability.TM.Combinators.Switch]
step_comp_liftL [in Undecidability.TM.Combinators.Switch]
step_UC [in Complexity.L.AbstractMachines.Computable.UnivDecTime]
step_timeBS [in Undecidability.L.Complexity.ResourceMeasures]
Step_Terminates [in Undecidability.TM.L.HeapInterpreter.StepTM]
Step_Realise [in Undecidability.TM.L.HeapInterpreter.StepTM]
Step_var_Terminates [in Undecidability.TM.L.HeapInterpreter.StepTM]
Step_var_Realise [in Undecidability.TM.L.HeapInterpreter.StepTM]
Step_app_Terminates [in Undecidability.TM.L.HeapInterpreter.StepTM]
Step_app_Realise [in Undecidability.TM.L.HeapInterpreter.StepTM]
Step_lam_Terminates [in Undecidability.TM.L.HeapInterpreter.StepTM]
Step_lam_Realise [in Undecidability.TM.L.HeapInterpreter.StepTM]
step_functional [in Complexity.L.AbstractMachines.AbstractHeapMachine]
step_inversion' [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
step_inversion [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
step_comp [in Undecidability.TM.Combinators.StateWhile]
step_k_inv [in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
stHypo [in Undecidability.L.Tactics.Lbeta]
stop_lemma [in Undecidability.TM.Code.CaseList]
stop_not_in [in Undecidability.TM.Code.Copy]
strict_greatest_upper_bound [in Undecidability.TM.PrettyBounds.MaxList]
stringForConfig_reprConfig [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
stringForTapeHalfP_eq [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
stringForTapeHalf_reprTape [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
string_reprConfig_length [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
string_reprTape_length [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
string_reprTapeP_length [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
subcode_cons_invert_left [in Undecidability.Shared.Libs.DLW.Code.subcode]
subcode_snoc_inv [in Undecidability.Shared.Libs.DLW.Code.subcode]
subcode_cons_inv [in Undecidability.Shared.Libs.DLW.Code.subcode]
subcode_app_inv [in Undecidability.Shared.Libs.DLW.Code.subcode]
subcode_cons_invert_right [in Undecidability.Shared.Libs.DLW.Code.subcode]
subcode_app_invert_right [in Undecidability.Shared.Libs.DLW.Code.subcode]
subcode_cons [in Undecidability.Shared.Libs.DLW.Code.subcode]
subcode_app_end [in Undecidability.Shared.Libs.DLW.Code.subcode]
subcode_right [in Undecidability.Shared.Libs.DLW.Code.subcode]
subcode_left [in Undecidability.Shared.Libs.DLW.Code.subcode]
subcode_out_code [in Undecidability.Shared.Libs.DLW.Code.subcode]
subcode_in_code [in Undecidability.Shared.Libs.DLW.Code.subcode]
subcode_trans [in Undecidability.Shared.Libs.DLW.Code.subcode]
subcode_refl [in Undecidability.Shared.Libs.DLW.Code.subcode]
subcode_start_in_code [in Undecidability.Shared.Libs.DLW.Code.subcode]
subcode_length_le [in Undecidability.Shared.Libs.DLW.Code.subcode]
subcode_length' [in Undecidability.Shared.Libs.DLW.Code.subcode]
subcode_length [in Undecidability.Shared.Libs.DLW.Code.subcode]
subcode_cons_inj [in Undecidability.Shared.Libs.DLW.Code.subcode]
subcode_sss_terminates [in Undecidability.Shared.Libs.DLW.Code.sss]
subcode_sss_steps_stop [in Undecidability.Shared.Libs.DLW.Code.sss]
subcode_sss_steps_inv_1 [in Undecidability.Shared.Libs.DLW.Code.sss]
subcode_sss_subcode_compute_inv [in Undecidability.Shared.Libs.DLW.Code.sss]
subcode_sss_progress_inv [in Undecidability.Shared.Libs.DLW.Code.sss]
subcode_sss_terminates_inv [in Undecidability.Shared.Libs.DLW.Code.sss]
subcode_sss_subcode_inv [in Undecidability.Shared.Libs.DLW.Code.sss]
subcode_sss_step_inv_1 [in Undecidability.Shared.Libs.DLW.Code.sss]
subcode_sss_compute_inv [in Undecidability.Shared.Libs.DLW.Code.sss]
subcode_sss_steps_inv [in Undecidability.Shared.Libs.DLW.Code.sss]
subcode_sss_terminates_instr [in Undecidability.Shared.Libs.DLW.Code.sss]
subcode_sss_step_inv [in Undecidability.Shared.Libs.DLW.Code.sss]
subcode_sss_compute_instr [in Undecidability.Shared.Libs.DLW.Code.sss]
subcode_sss_compute_linstr [in Undecidability.Shared.Libs.DLW.Code.sss]
subcode_sss_compute_trans [in Undecidability.Shared.Libs.DLW.Code.sss]
subcode_sss_compute [in Undecidability.Shared.Libs.DLW.Code.sss]
subcode_sss_progress [in Undecidability.Shared.Libs.DLW.Code.sss]
subcode_sss_steps [in Undecidability.Shared.Libs.DLW.Code.sss]
subcode_sss_step [in Undecidability.Shared.Libs.DLW.Code.sss]
sublist_C [in Undecidability.L.Computability.Enum]
sublist_T [in Undecidability.L.Computability.Enum]
subrel_or2 [in Undecidability.TM.Util.Relations]
subrel_and2 [in Undecidability.TM.Util.Relations]
subrel_or [in Undecidability.TM.Util.Relations]
subrel_and [in Undecidability.TM.Util.Relations]
subsequence_incl [in Complexity.Libs.CookPrelim.MorePrelim]
substList_nil [in Undecidability.L.Tactics.LClos]
substList_closed' [in Undecidability.L.Tactics.LClos]
substList_is_bound [in Undecidability.L.Tactics.LClos]
substList_var [in Undecidability.L.Tactics.LClos]
substList_var' [in Undecidability.L.Tactics.LClos]
substList_closed [in Undecidability.L.Tactics.LClos]
substList_bound [in Undecidability.L.Tactics.LClos]
substP_correct [in Undecidability.L.AbstractMachines.FlatPro.Programs]
substP_correct' [in Undecidability.L.AbstractMachines.FlatPro.Programs]
substP_keepTrack_correct [in Complexity.L.AbstractMachines.FunctionalDefinitions]
substP_keepTrack'_keepsTrack [in Complexity.L.AbstractMachines.FunctionalDefinitions]
substP_keepTrack'_sound [in Complexity.L.AbstractMachines.FunctionalDefinitions]
subst_many_app [in Undecidability.TM.L.CompilerBoolFuns.NaryApp]
subst_many_lam [in Undecidability.TM.L.CompilerBoolFuns.NaryApp]
subst_substList [in Undecidability.L.Tactics.LClos]
subst_gen_list [in Undecidability.TM.L.CompilerBoolFuns.Compiler_nat_facts]
subst_apply_encs_to [in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
subst_closed [in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
subst'_rho [in Undecidability.L.Tactics.Lbeta_nonrefl]
subst'_eq_proper [in Undecidability.L.Tactics.Lbeta_nonrefl]
subst'_int [in Undecidability.L.Tactics.Lbeta_nonrefl]
subst'_cls [in Undecidability.L.Tactics.Lbeta_nonrefl]
subst'_eq [in Undecidability.L.Tactics.Lbeta_nonrefl]
subterm_property [in Complexity.L.AbstractMachines.AbstractHeapMachine]
subterm_largestVar [in Complexity.L.AbstractMachines.AbstractHeapMachine]
subterm_app_r [in Complexity.L.AbstractMachines.AbstractHeapMachine]
subterm_app_l [in Complexity.L.AbstractMachines.AbstractHeapMachine]
subterm_lam_inv [in Complexity.L.AbstractMachines.AbstractHeapMachine]
Subtract_SpecT [in Undecidability.TM.Code.NatSub]
Subtract_Realise [in Undecidability.TM.Code.NatSub]
subtype_extensionality [in Undecidability.Shared.Libs.PSL.FiniteTypes.Arbitrary]
sub_time_bound_r [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
sub_time_bound_l [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
sub_maskC_ext_eq [in Complexity.L.Functions.BinNumsSub]
sub_dec [in Undecidability.Synthetic.Infinite]
succ_size [in Undecidability.TM.Code.BinNumbers.PosMultTM]
sumn_map_le_pointwise [in Undecidability.L.Prelim.MoreBase]
sumn_le_bound [in Undecidability.L.Prelim.MoreBase]
sumn_map_mult_c_l [in Complexity.NP.SAT.SAT_inNP]
sumn_map_const [in Complexity.Libs.CookPrelim.PolyBounds]
sumn_map_mono [in Complexity.Libs.CookPrelim.PolyBounds]
sumn_map_const [in Complexity.Complexity.UpToCPoly]
sumn_map_mono [in Complexity.Complexity.UpToCPoly]
sumn_repeat [in Complexity.NP.TM.LM_to_mTM]
sumn_repeat [in Undecidability.L.Prelim.MoreList]
sumn_concat [in Undecidability.L.Prelim.MoreList]
sumn_le_in [in Undecidability.L.Prelim.MoreList]
sumn_map_c [in Undecidability.L.Prelim.MoreList]
sumn_map_mult_c_r [in Undecidability.L.Prelim.MoreList]
sumn_map_add [in Undecidability.L.Prelim.MoreList]
sumn_map_natsLess [in Undecidability.L.Prelim.MoreList]
sumn_rev [in Undecidability.L.Prelim.MoreList]
sumn_app [in Undecidability.L.Prelim.MoreList]
sum_eqb_spec [in Undecidability.L.Datatypes.LSum]
sum_power_binary_lt_inv [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
sum_powers_binary_le_inv [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
sum_power_binary_lt [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
sum_powers_ortho [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
sum_powers_euclid [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
sum_powers_bound [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
sum_list_rec_ge [in Complexity.TM.PrettyBounds.SpaceBounds]
sum_list_rec_S [in Complexity.TM.PrettyBounds.SpaceBounds]
sum_list_rec_plus [in Complexity.TM.PrettyBounds.SpaceBounds]
sum_bijection [in Undecidability.Shared.Libs.DLW.Utils.sorting]
sum_injective [in Undecidability.Shared.Libs.DLW.Utils.sorting]
sum_composed_permutation [in Undecidability.Shared.Libs.DLW.Utils.sorting]
sum_bounded_permutation [in Undecidability.Shared.Libs.DLW.Utils.sorting]
sum_power_lt [in Undecidability.Shared.Libs.DLW.Utils.sums]
sum_0n_le_one [in Undecidability.Shared.Libs.DLW.Utils.sums]
sum_0n_mono [in Undecidability.Shared.Libs.DLW.Utils.sums]
sum_0n_scal_r [in Undecidability.Shared.Libs.DLW.Utils.sums]
sum_0n_scal_l [in Undecidability.Shared.Libs.DLW.Utils.sums]
sum_fold_map [in Undecidability.Shared.Libs.DLW.Utils.sums]
sum_0n_distr_r [in Undecidability.Shared.Libs.DLW.Utils.sums]
sum_0n_distr_l [in Undecidability.Shared.Libs.DLW.Utils.sums]
sum_0n_scal [in Undecidability.Shared.Libs.DLW.Utils.sums]
sum_2_power_2_injective [in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
sum_0n_distr_in_out [in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
sum_enum_ok [in Undecidability.Shared.Libs.PSL.FiniteTypes.CompoundFinTypes]
suplin_t__evalForTime [in Complexity.L.AbstractMachines.Computable.EvalForTime]
suplin_t__E [in Complexity.HierarchyTheorem.TimeHierarchyTheorem]
supported3 [in Undecidability.L.Tactics.ComputableDemo]
surjectTapes_nth [in Undecidability.TM.Lifting.LiftAlphabet]
surjectTape_isVoid' [in Undecidability.TM.Code.ChangeAlphabet]
surjectTape_isVoid [in Undecidability.TM.Code.ChangeAlphabet]
surjectTape_isVoid'_size [in Undecidability.TM.Code.ChangeAlphabet]
surjectTape_isVoid_size [in Undecidability.TM.Code.ChangeAlphabet]
surjectTape_injectTape [in Undecidability.TM.Code.ChangeAlphabet]
surject_inject_tape [in Undecidability.TM.Lifting.LiftAlphabet]
surject_inject' [in Undecidability.TM.Lifting.LiftAlphabet]
surject_inject_inr [in Undecidability.TM.Code.ChangeAlphabet]
surject_app [in Undecidability.TM.Code.ChangeAlphabet]
surject_cons [in Undecidability.TM.Code.ChangeAlphabet]
surject_inject [in Undecidability.TM.Code.ChangeAlphabet]
surj_t_compose [in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
swap_bounded_permut [in Undecidability.Shared.Libs.DLW.Utils.sorting]
swap_inj [in Undecidability.Shared.Libs.DLW.Utils.sorting]
swap_involutive [in Undecidability.Shared.Libs.DLW.Utils.sorting]
swap_spec [in Undecidability.Shared.Libs.DLW.Utils.sorting]
swap_spec_j [in Undecidability.Shared.Libs.DLW.Utils.sorting]
swap_spec_i [in Undecidability.Shared.Libs.DLW.Utils.sorting]
Switch_RealiseIn [in Undecidability.TM.Combinators.Switch]
Switch_TerminatesIn' [in Undecidability.TM.Combinators.Switch]
Switch_TerminatesIn [in Undecidability.TM.Combinators.Switch]
Switch_Realise [in Undecidability.TM.Combinators.Switch]
Switch_split [in Undecidability.TM.Combinators.Switch]
Switch_merge [in Undecidability.TM.Combinators.Switch]
Switch_SpecTReg [in Undecidability.TM.Hoare.HoareCombinators]
Switch_SpecT_strong [in Undecidability.TM.Hoare.HoareCombinators]
Switch_SpecT [in Undecidability.TM.Hoare.HoareCombinators]
Switch_Spec [in Undecidability.TM.Hoare.HoareCombinators]
syms_diff [in Undecidability.TM.L.CompilerBoolFuns.Compiler]
S_injective [in Complexity.Libs.CookPrelim.Tactics]

T

tabulate_ext [in Undecidability.TM.L.CompilerBoolFuns.NaryApp]
tabulate_formula_length [in Complexity.NP.SAT.FSAT.FormulaEncoding]
tabulate_formula_varsIn [in Complexity.NP.SAT.FSAT.FormulaEncoding]
tabulate_step_length [in Complexity.NP.SAT.FSAT.FormulaEncoding]
tabulate_step_poly [in Complexity.NP.SAT.FSAT.FormulaEncoding]
tabulate_step_time_bound [in Complexity.NP.SAT.FSAT.FormulaEncoding]
tabulate_nth [in Undecidability.TM.L.CompilerBoolFuns.Compiler]
tabulate_In [in Complexity.Libs.CookPrelim.MorePrelim]
tabulate_nth [in Complexity.Libs.CookPrelim.MorePrelim]
tabulate_length [in Complexity.Libs.CookPrelim.MorePrelim]
tailRecursion_compile [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
tailRecursion_length [in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisStep]
tailRecursion_incl [in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisStep]
TailRec_Terminates [in Undecidability.TM.L.HeapInterpreter.StepTM]
TailRec_Realise [in Undecidability.TM.L.HeapInterpreter.StepTM]
tam [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
tam [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
tam [in Undecidability.TM.Univ.Univ]
tamtam [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
tamtam [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
tam_O [in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
tam_I [in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
tapeOrderSwap_dupfree [in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
tapeRules_revp [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
tapeRules_revp' [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
tapes_encode_prefixInjective [in Complexity.TM.Single.DecodeTapes]
tapeToList_map_commute [in Complexity.L.TM.TMunflatten]
tapeToList_lcr [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
tapeToList_move_L [in Undecidability.TM.Util.TM_facts]
tapeToList_move_R [in Undecidability.TM.Util.TM_facts]
tapeToList_move [in Undecidability.TM.Util.TM_facts]
tape_size_sum_le_size [in Complexity.TM.PrettyBounds.M2MBounds]
tape_doAct_right_length [in Complexity.TM.PrettyBounds.M2MBounds]
tape_size_ge1 [in Complexity.TM.PrettyBounds.M2MBounds]
tape_destruct2' [in Undecidability.TM.Compound.CopySymbols]
tape_destruct2 [in Undecidability.TM.Compound.CopySymbols]
tape_contains_rev_size_ext [in Undecidability.TM.Code.CodeTM]
tape_contains_rev_ext [in Undecidability.TM.Code.CodeTM]
tape_contains_size_ext [in Undecidability.TM.Code.CodeTM]
tape_contains_ext [in Undecidability.TM.Code.CodeTM]
tape_contains_rev_size_sizeOfTape [in Undecidability.TM.Code.CodeTM]
tape_contains_size_sizeOfTape [in Undecidability.TM.Code.CodeTM]
tape_contains_rev_contains_rev_size [in Undecidability.TM.Code.CodeTM]
tape_contains_contains_size [in Undecidability.TM.Code.CodeTM]
tape_contains_rev_size_contains [in Undecidability.TM.Code.CodeTM]
tape_contains_size_contains [in Undecidability.TM.Code.CodeTM]
tape_contains_rev_size_isVoid [in Undecidability.TM.Code.CodeTM]
tape_contains_rev_isVoid [in Undecidability.TM.Code.CodeTM]
tape_local_contains_size [in Undecidability.TM.Code.WriteValue]
tape_contains_size_strengthen [in Undecidability.TM.Code.WriteValue]
tape_local_contains [in Undecidability.TM.Code.WriteValue]
tape_sizeOfTape_nice [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
tape_size_nice [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
tape_fulfill_Downlift_select [in Undecidability.TM.Hoare.HoareRegister]
tape_repr_stay_left [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
tape_repr_stay_right [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
tape_repr_rem_left [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
tape_repr_rem_right [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
tape_repr_add_left [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
tape_repr_add_right [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
tape_cover_symm3 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
tape_cover_symm2 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
tape_cover_symm1 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
tape_repr_inv17 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
tape_repr_inv15 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
tape_repr_inv14 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
tape_repr_inv13 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
tape_repr_inv12 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
tape_repr_inv11 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
tape_repr_inv9 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
tape_repr_inv8 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
tape_repr_inv16 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
tape_repr_inv7 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
tape_repr_inv5 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
tape_repr_inv4 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
tape_repr_inv3 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
tape_repr_inv2 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
tape_repr_inv [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
tape_repr_step' [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
tape_repr_step [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
tape_repr_polarityFlip [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
tape_write_current [in Undecidability.TM.Util.TM_facts]
tape_write_current_None [in Undecidability.TM.Util.TM_facts]
tape_write_current_Some [in Undecidability.TM.Util.TM_facts]
tape_write_right [in Undecidability.TM.Util.TM_facts]
tape_write_left [in Undecidability.TM.Util.TM_facts]
tape_move_niltape [in Undecidability.TM.Util.TM_facts]
tape_local_move_right' [in Undecidability.TM.Util.TM_facts]
tape_right_move_right [in Undecidability.TM.Util.TM_facts]
tape_right_move_right' [in Undecidability.TM.Util.TM_facts]
tape_local_l_move_left' [in Undecidability.TM.Util.TM_facts]
tape_right_move_left' [in Undecidability.TM.Util.TM_facts]
tape_left_move_right' [in Undecidability.TM.Util.TM_facts]
tape_left_move_left [in Undecidability.TM.Util.TM_facts]
tape_left_move_left' [in Undecidability.TM.Util.TM_facts]
tape_right_move_left [in Undecidability.TM.Util.TM_facts]
tape_left_move_right [in Undecidability.TM.Util.TM_facts]
tape_local_l_move_left [in Undecidability.TM.Util.TM_facts]
tape_local_move_right [in Undecidability.TM.Util.TM_facts]
tape_local_nil [in Undecidability.TM.Util.TM_facts]
tape_local_l_cons_iff [in Undecidability.TM.Util.TM_facts]
tape_local_cons_iff [in Undecidability.TM.Util.TM_facts]
tape_local_l_left [in Undecidability.TM.Util.TM_facts]
tape_local_right [in Undecidability.TM.Util.TM_facts]
tape_local_l_current_cons [in Undecidability.TM.Util.TM_facts]
tape_local_current_cons [in Undecidability.TM.Util.TM_facts]
tape_local_mirror' [in Undecidability.TM.Util.TM_facts]
tape_local_mirror [in Undecidability.TM.Util.TM_facts]
tape_move_left_right [in Undecidability.TM.Util.TM_facts]
tape_move_right_left [in Undecidability.TM.Util.TM_facts]
tape_is_midtape [in Undecidability.TM.Util.TM_facts]
tape_midtape_current_left [in Undecidability.TM.Util.TM_facts]
tape_midtape_current_right [in Undecidability.TM.Util.TM_facts]
tape_encode_prefixInjective [in Complexity.TM.Single.DecodeTape]
tape_encode_injective [in Complexity.TM.Single.DecodeTape]
TCCCardP_enc_size [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
TCCCardP_inj [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
TCCCard_enc_size [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
TCCCard_inj [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
TCCCard_to_CCCard_size [in Complexity.NP.SAT.CookLevin.Reductions.FlatTCC_to_FlatCC]
TCC_to_CC [in Complexity.NP.SAT.CookLevin.Reductions.TCC_to_CC]
tc_compile [in Complexity.L.AbstractMachines.AbstractSubstMachine]
terminal_noRed [in Undecidability.L.Prelim.ARS]
TerminatesInIntroEx [in Undecidability.TM.Hoare.HoareLegacy]
TerminatesIn_extend [in Undecidability.TM.Util.TM_facts]
TerminatesIn_monotone [in Undecidability.TM.Util.TM_facts]
Terminates__mono [in Complexity.NP.TM.M_multi2mono]
Terminates_False [in Complexity.NP.TM.M_multi2mono]
terms_enum_themselves [in Complexity.NP.L.CanEnumTerm]
termT_map [in Undecidability.L.Tactics.ComputableDemo]
termT_map [in Undecidability.L.Tactics.ComputableDemo]
termT_ackermann [in Undecidability.L.Functions.Ackermann]
term_map [in Undecidability.L.Tactics.ComputableDemo]
term_ackermann [in Undecidability.L.Functions.Ackermann]
term_eqb_spec [in Undecidability.L.Functions.Equality]
test_Some_nat [in Undecidability.L.Tactics.ComputableDemo]
timeBS_rect [in Undecidability.L.Complexity.ResourceMeasures]
timeBS_evalIn [in Undecidability.L.Complexity.ResourceMeasures]
TimeHierarchyTheorem [in Complexity.HierarchyTheorem.TimeHierarchyTheorem]
times_zero_r [in Undecidability.Shared.Libs.DLW.Utils.sums]
times_zero_l [in Undecidability.Shared.Libs.DLW.Utils.sums]
time_uiter_evalForTime__step [in Complexity.L.AbstractMachines.Computable.EvalForTime]
time_decompile_nice_leq [in Complexity.L.AbstractMachines.FlatPro.Computable.Decompile]
time_loopSum_bound_onlyByN [in Undecidability.L.Functions.LoopSum]
time_map2_leq [in Undecidability.L.Datatypes.LVector]
time_space_trace [in Complexity.Complexity.SpaceBoundsTime]
time_Leftmost_space_trace [in Complexity.Complexity.SpaceBoundsTime]
tl_length [in Undecidability.TM.Code.CaseList]
tl_length [in Undecidability.TM.Code.CaseNat]
tl_rev [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
tl_app [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
tl_map [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
tl_length [in Undecidability.TM.Code.CaseSum]
tl_length [in Undecidability.TM.Code.CasePair]
TMGenNP_to_TMGenNP_fixed_singleTapeTM [in Complexity.NP.SAT.CookLevin]
TMGenNP_mTM_to_TMGenNP_singleTM [in Complexity.NP.TM.mTM_to_singleTapeTM]
TMGenNP_fixed_singleTapeTM_to_FlatFunSingleTMGenNP [in Complexity.NP.SAT.CookLevin.Reductions.TMGenNP_fixed_singleTapeTM_to_FlatFunSingleTMGenNP]
tm_trans_isValidFlatAct [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
TM_bool_computable_to_TM_computable [in Undecidability.TM.L.CompilerBoolFuns.Compiler_nat_facts]
tm_step_size [in Complexity.NP.SAT.CookLevin.Subproblems.TM_single]
TM_bool_computable_hoare'_spec [in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
TM_bool_computable_hoare_out'_spec [in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
TM_bool_computable_hoare_in'_spec [in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
TM_bool_computable_hoare_spec [in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
TM_bool_computable_hoare_out_spec [in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
TM_bool_computable_hoare_in_spec [in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
TM_reduction_to_ExPTCC [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
TM_eval_iff [in Undecidability.TM.Util.TM_facts]
ToggleMarked_Sem [in Undecidability.TM.Single.StepTM]
Tok_eqb_spec [in Undecidability.L.AbstractMachines.FlatPro.Programs]
tolist_In [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
tolist_dupfree [in Undecidability.Shared.Libs.PSL.Vectors.VectorDupfree]
ToSingleTape_Terminates' [in Undecidability.TM.Single.StepTM]
ToSingleTape_Realise' [in Undecidability.TM.Single.StepTM]
ToSingleTape_Terminates [in Undecidability.TM.Single.StepTM]
ToSingleTape_Realise [in Undecidability.TM.Single.StepTM]
ToSingleTape_Loop_index [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
ToSingleTape_Loop_halt [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
ToSingleTape_Loop_graph [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
toSubList_count [in Undecidability.Shared.Libs.PSL.FiniteTypes.Arbitrary]
toSumList1_missing [in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
toSumList1_count [in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
toSumList2_missing [in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
toSumList2_count [in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
total_decodable_closed_new [in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
toVertex_poly [in Complexity.NP.Clique.kSAT_to_FlatClique]
toVertex_time_bound [in Complexity.NP.Clique.kSAT_to_FlatClique]
to_list_length [in Undecidability.L.Datatypes.LVector]
to_cumul_spec [in Undecidability.Synthetic.ListEnumerabilityFacts]
to_cumul_cumulative [in Undecidability.Synthetic.ListEnumerabilityFacts]
to_dec [in Undecidability.Shared.ListAutomation]
tpr_ptpr_agree [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
trace_not_dupfree_loop [in Complexity.Complexity.SpaceBoundsTime]
trace_app [in Complexity.Complexity.SpaceBoundsTime]
transEnvAddSM_envBounded [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
transEnvAddS_envBounded [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
transition_graph_injective [in Undecidability.TM.Univ.LowLevel]
Translate_steps_nice [in Complexity.TM.PrettyBounds.BaseCode]
Translate_Spec [in Undecidability.TM.Code.Copy]
Translate_Spec_size [in Undecidability.TM.Code.Copy]
Translate_SpecT [in Undecidability.TM.Code.Copy]
Translate_SpecT_size [in Undecidability.TM.Code.Copy]
Translate_Terminates [in Undecidability.TM.Code.Copy]
Translate_Realise [in Undecidability.TM.Code.Copy]
Translate'_Terminates [in Undecidability.TM.Code.Copy]
Translate'_Realise [in Undecidability.TM.Code.Copy]
transNoneNoneCenter_inv3 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transNoneNoneCenter_inv2 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transNoneNoneCenter_inv1 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transNoneNoneLeft_inv3 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transNoneNoneLeft_inv2 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transNoneNoneLeft_inv1 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transNoneNoneRight_inv3 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transNoneNoneRight_inv2 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transNoneNoneRight_inv1 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transNoneNone_inv3 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transNoneNone_inv2 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transNoneNone_inv1 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transNoneSomeCenter_inv3 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transNoneSomeCenter_inv2 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transNoneSomeCenter_inv1 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transNoneSomeLeft_inv3 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transNoneSomeLeft_inv2 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transNoneSomeLeft_inv1 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transNoneSomeRight_inv3 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transNoneSomeRight_inv2 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transNoneSomeRight_inv1 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transNoneSome_inv3 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transNoneSome_inv2 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transNoneSome_inv1 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transRules_statesym [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transRules_statesym3 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transRules_statesym2 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transRules_statesym1 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transRules_semCasesCenter [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transRules_semCasesRight [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transRules_semCasesLeft [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transSomeNoneCenter_inv3 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transSomeNoneCenter_inv2 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transSomeNoneCenter_inv1 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transSomeNoneLeft_inv3 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transSomeNoneLeft_inv2 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transSomeNoneLeft_inv1 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transSomeNoneRight_inv3 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transSomeNoneRight_inv2 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transSomeNoneRight_inv1 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transSomeNone_inv3 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transSomeNone_inv2 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transSomeNone_inv1 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transSomeSomeCenter_inv3 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transSomeSomeCenter_inv2 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transSomeSomeCenter_inv1 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transSomeSomeLeft_inv3 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transSomeSomeLeft_inv2 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transSomeSomeLeft_inv1 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transSomeSomeRight_inv3 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transSomeSomeRight_inv2 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transSomeSomeRight_inv1 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transSomeSome_inv3 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transSomeSome_inv2 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transSomeSome_inv1 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
trans_map_keys_injective [in Undecidability.TM.Univ.LowLevel]
TripleE [in Undecidability.TM.Hoare.HoareLogic]
TripleTE [in Undecidability.TM.Hoare.HoareLogic]
TripleT_Downlift_withSpace [in Undecidability.TM.Hoare.HoareRegister]
TripleT_RemoveSpace [in Undecidability.TM.Hoare.HoareRegister]
TripleT_introPure [in Undecidability.TM.Hoare.HoareRegister]
TripleT_and_con [in Undecidability.TM.Hoare.HoareLogic]
TripleT_and_pre [in Undecidability.TM.Hoare.HoareLogic]
TripleT_eta_con2 [in Undecidability.TM.Hoare.HoareLogic]
TripleT_eta_con [in Undecidability.TM.Hoare.HoareLogic]
TripleT_eta_pre [in Undecidability.TM.Hoare.HoareLogic]
TripleT_forall_con [in Undecidability.TM.Hoare.HoareLogic]
TripleT_forall_pre [in Undecidability.TM.Hoare.HoareLogic]
TripleT_exists_con [in Undecidability.TM.Hoare.HoareLogic]
TripleT_exists_pre [in Undecidability.TM.Hoare.HoareLogic]
TripleT_TerminatesIn [in Undecidability.TM.Hoare.HoareLogic]
TripleT_Realise [in Undecidability.TM.Hoare.HoareLogic]
TripleT_False [in Undecidability.TM.Hoare.HoareLogic]
TripleT_Triple [in Undecidability.TM.Hoare.HoareLogic]
TripleT_iff [in Undecidability.TM.Hoare.HoareLogic]
Triple_Downlift_withSpace [in Undecidability.TM.Hoare.HoareRegister]
Triple_RemoveSpace [in Undecidability.TM.Hoare.HoareRegister]
Triple_RemoveSpace_ex [in Undecidability.TM.Hoare.HoareRegister]
Triple_introPure [in Undecidability.TM.Hoare.HoareRegister]
Triple_and_con [in Undecidability.TM.Hoare.HoareLogic]
Triple_and_pre [in Undecidability.TM.Hoare.HoareLogic]
Triple_eta_con2 [in Undecidability.TM.Hoare.HoareLogic]
Triple_eta_con [in Undecidability.TM.Hoare.HoareLogic]
Triple_eta_pre [in Undecidability.TM.Hoare.HoareLogic]
Triple_forall_con [in Undecidability.TM.Hoare.HoareLogic]
Triple_forall_pre [in Undecidability.TM.Hoare.HoareLogic]
Triple_exists_con [in Undecidability.TM.Hoare.HoareLogic]
Triple_exists_pre [in Undecidability.TM.Hoare.HoareLogic]
Triple_Realise [in Undecidability.TM.Hoare.HoareLogic]
Triple_True [in Undecidability.TM.Hoare.HoareLogic]
Triple_False [in Undecidability.TM.Hoare.HoareLogic]
Triple_iff [in Undecidability.TM.Hoare.HoareLogic]
trivialNoInstance [in Complexity.NP.Clique.kSAT_to_Clique]
trivialNoInstance_isNoInstance [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
trivialNoInstance_isNoInstance [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
trivialNoInstance_isNoInstance [in Complexity.NP.SAT.CookLevin.Reductions.CC_to_BinaryCC]
trivialNoInstance_isNoInstance [in Complexity.NP.Clique.kSAT_to_FlatClique]
trivial_no_instance_is_no [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
trueOrDiverge_eval [in Undecidability.L.Datatypes.LBool]
trueOrDiverge_true [in Undecidability.L.Datatypes.LBool]
trueOrDiverge_proc [in Undecidability.L.Datatypes.LBool]
TrueOrDiverge.Realise [in Complexity.NP.TM.LM_to_mTM]
TrueOrDiverge.Terminates [in Complexity.NP.TM.LM_to_mTM]
True_enum_ok [in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicFinTypes]
tseytinAnd_3CNF [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
tseytinAnd_cnf_varsIn [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
tseytinAnd_sat [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
tseytinEquiv_3CNF [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
tseytinEquiv_cnf_varsIn [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
tseytinEquiv_sat [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
tseytinNot_3CNF [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
tseytinNot_cnf_varsIn [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
tseytinNot_sat [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
tseytinOr_3CNF [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
tseytinOr_cnf_varsIn [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
tseytinOr_sat [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
tseytinP_poly [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
tseytinP_time_bound [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
tseytinP_varBound [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
tseytinP_nf_bound [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
tseytinP_size [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
tseytinP_3CNF [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
tseytinP_repr [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
tseytinP_nf_monotonic [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
tseytinTrue_3CNF [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
tseytinTrue_cnf_varsIn [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
tseytinTrue_sat [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
tseytin_poly [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
tseytin_time_bound [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
tseytin_varBound [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
tseytin_size [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
tseytin_3CNF [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
tseytin_repr [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
tseytin_formula_repr_s [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
tspecE [in Undecidability.TM.Hoare.HoareRegister]
tspecI [in Undecidability.TM.Hoare.HoareRegister]
tspec_Frame_withSpace' [in Undecidability.TM.Hoare.HoareRegister]
tspec_Downlift_withSpace [in Undecidability.TM.Hoare.HoareRegister]
tspec_space_ext [in Undecidability.TM.Hoare.HoareRegister]
tspec_ext [in Undecidability.TM.Hoare.HoareRegister]
tspec_space_solve [in Undecidability.TM.Hoare.HoareRegister]
tspec_solve [in Undecidability.TM.Hoare.HoareRegister]
tspec_revertPure [in Undecidability.TM.Hoare.HoareRegister]
tspec_introPure [in Undecidability.TM.Hoare.HoareRegister]
tspec_tspec_withSpace [in Undecidability.TM.Hoare.HoareRegister]
tspec_single_tspec_single_withSpace [in Undecidability.TM.Hoare.HoareRegister]
tspec_withSpace_tspec [in Undecidability.TM.Hoare.HoareRegister]
tspec_single_withSpace_tspec_single [in Undecidability.TM.Hoare.HoareRegister]
tspec_Entails [in Undecidability.TM.Hoare.HoareRegister]
tspec_iff [in Undecidability.TM.Hoare.HoareRegister]
tspec_single_Contains_size_Contains [in Undecidability.TM.Hoare.HoareRegister]
T_dup [in Undecidability.L.Computability.Enum]
T_var_not [in Undecidability.L.Computability.Enum]
T_longenough [in Undecidability.L.Computability.Enum]
T_exhaustive [in Undecidability.L.Computability.Enum]
T_lam [in Undecidability.L.Computability.Enum]
T_el_ge [in Undecidability.L.Computability.Enum]
T_app [in Undecidability.L.Computability.Enum]
T_var [in Undecidability.L.Computability.Enum]
T_ge [in Undecidability.L.Computability.Enum]
T_S [in Undecidability.L.Computability.Enum]
T_nondec_correct [in Undecidability.L.Functions.EnumInt]

U

uc_terminal [in Undecidability.L.Prelim.ARS]
uiterTime_computesRel [in Undecidability.L.Functions.UnboundIteration]
uiterTime_bound_recRel [in Undecidability.L.Functions.UnboundIteration]
uiterTime_bound_recRel2 [in Undecidability.L.Functions.UnboundIteration]
uiterTime_bound_onlyByN [in Undecidability.L.Functions.UnboundIteration]
uiter_total_instanceTime [in Undecidability.L.Functions.UnboundIteration]
uiter_sound [in Undecidability.L.Functions.UnboundIteration]
uiter_proc [in Undecidability.L.Functions.UnboundIteration]
undecidability_from_reducibility [in Undecidability.Synthetic.Undecidability]
undecidability_HaltTM [in Undecidability.Synthetic.Undecidability]
undup_idempotent [in Undecidability.Shared.Libs.PSL.Lists.Dupfree]
undup_id [in Undecidability.Shared.Libs.PSL.Lists.Dupfree]
undup_equi [in Undecidability.Shared.Libs.PSL.Lists.Dupfree]
undup_incl [in Undecidability.Shared.Libs.PSL.Lists.Dupfree]
undup_id_equi [in Undecidability.Shared.Libs.PSL.Lists.Dupfree]
unembedP [in Undecidability.Shared.embed_nat]
unenc_correct2 [in Undecidability.L.Datatypes.LNat]
unenc_correct [in Undecidability.L.Datatypes.LNat]
unflattenCarddow [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
unflattenCarddow [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
unflattenCards [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
unflattenCards [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
unflattenCC [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
unflattenFinal [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
unflattenFinal [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
unflattenString [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
unflattenString [in Complexity.Libs.CookPrelim.FlatFinTypes]
unflattenString [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
unflattenTCC [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
unflattenTCCCardP [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
unflattenTM_correct [in Complexity.L.TM.TMunflatten]
unflattenVertex [in Complexity.NP.Clique.kSAT_to_FlatClique]
unflatten_trans_correct [in Complexity.L.TM.TMunflatten]
unflatten_acts_correct [in Complexity.L.TM.TMunflatten]
unflatten_in_correct [in Complexity.L.TM.TMunflatten]
unflatten_single [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
unfoldBoolean_sound [in Complexity.L.AbstractMachines.UnfoldTailRec]
unfoldBoolean_complete [in Complexity.L.AbstractMachines.UnfoldTailRec]
unfoldBool_time_leq [in Complexity.L.AbstractMachines.Computable.Unfolding]
unfoldBool_time_mono [in Complexity.L.AbstractMachines.Computable.Unfolding]
UnfoldClos.SpecT [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
unfoldC_correct_final [in Complexity.L.AbstractMachines.UnfoldHeap]
unfoldC_correct [in Complexity.L.AbstractMachines.UnfoldHeap]
unfoldC_mono [in Complexity.L.AbstractMachines.UnfoldHeap]
unfoldsC_correct2 [in Complexity.L.AbstractMachines.UnfoldHeap]
unfolds_extend [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
unfolds_subst [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
unfolds_subst' [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
unfolds_inv_lam_lam [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
unfolds_bound [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
unfolds_inj [in Complexity.L.AbstractMachines.UnfoldHeap]
unfolds_extend [in Complexity.L.AbstractMachines.AbstractHeapMachine]
unfolds_subst [in Complexity.L.AbstractMachines.AbstractHeapMachine]
unfolds_subst' [in Complexity.L.AbstractMachines.AbstractHeapMachine]
unfolds_bound [in Complexity.L.AbstractMachines.AbstractHeapMachine]
unfolds_functional [in Complexity.L.AbstractMachines.AbstractHeapMachine]
unfoldTailRecStep_largestVar_inv [in Complexity.L.AbstractMachines.UnfoldTailRec]
unfoldTailRecStep_sound [in Complexity.L.AbstractMachines.UnfoldTailRec]
unfoldTailRecStep_sound' [in Complexity.L.AbstractMachines.UnfoldTailRec]
unfoldTailRecStep_complete [in Complexity.L.AbstractMachines.UnfoldTailRec]
unfoldTailRecStep_complete' [in Complexity.L.AbstractMachines.UnfoldTailRec]
unfoldTailRecStep_sizes_correct [in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisUnfoldClos]
unfoldTailRecStep_sizes_correct' [in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisUnfoldClos]
unfoldTailRecStep_complete [in Undecidability.L.AbstractMachines.FlatPro.UnfoldClos]
unfoldTailRecStep_complete' [in Undecidability.L.AbstractMachines.FlatPro.UnfoldClos]
uniform_confluent_confluent [in Undecidability.L.Prelim.ARS]
uniform_confluence_parameterized_both_terminal [in Undecidability.L.Prelim.ARS]
uniform_confluence_parameterized_terminal [in Undecidability.L.Prelim.ARS]
uniform_confluent_noloop [in Undecidability.L.Prelim.ARS]
uniform_confluence [in Undecidability.L.Util.L_facts]
unif_homo_eps_free [in Complexity.Libs.UniformHomomorphisms]
unif_homo_length [in Complexity.Libs.UniformHomomorphisms]
unique_normal_forms [in Undecidability.L.Prelim.ARS]
unique_normal_forms [in Undecidability.L.Util.L_facts]
unit_enum_ok [in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicFinTypes]
univDecTime_complete [in Complexity.L.AbstractMachines.Computable.UnivDecTime]
Univ_size_nice [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
Univ_size_nice' [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
Univ_Step_size_bound3_better [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
Univ_Step_size_nice [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
Univ_Step_size_bound2_lt [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
Univ_nice.Univ_steps_nice [in Complexity.TM.PrettyBounds.UnivBounds]
Univ_nice.Univ_Step_steps_nice [in Complexity.TM.PrettyBounds.UnivBounds]
Univ_nice.Univ_Step_steps_IsFinal_nice [in Complexity.TM.PrettyBounds.UnivBounds]
Univ_nice.Univ_Step_steps_Translate_nice [in Complexity.TM.PrettyBounds.UnivBounds]
Univ_nice.Univ_Step_steps_Lookup_nice [in Complexity.TM.PrettyBounds.UnivBounds]
Univ_nice.Encode_graph_hasSize_ge1 [in Complexity.TM.PrettyBounds.UnivBounds]
Univ_nice.length_graph_is_number_of_states [in Complexity.TM.PrettyBounds.UnivBounds]
Univ_nice.graph_of_fun_length [in Complexity.TM.PrettyBounds.UnivBounds]
Univ_nice.IsFinal_steps_nice [in Complexity.TM.PrettyBounds.UnivBounds]
Univ_nice.Encode_state_hasSize [in Complexity.TM.PrettyBounds.UnivBounds]
Univ_nice.Univ_Step_steps_ResetSymbol_nice [in Complexity.TM.PrettyBounds.UnivBounds]
Univ_nice.Univ_Step_steps_ConstrPair_nice [in Complexity.TM.PrettyBounds.UnivBounds]
Univ_nice.size_state_index_le [in Complexity.TM.PrettyBounds.UnivBounds]
Univ_nice.size_state_index_lt [in Complexity.TM.PrettyBounds.UnivBounds]
Univ_nice.Univ_Step_steps_CasePair_nice [in Complexity.TM.PrettyBounds.UnivBounds]
Univ_nice.ReadCurrent'_steps_nice [in Complexity.TM.PrettyBounds.UnivBounds]
Univ_nice.DoAction'_steps_nice [in Complexity.TM.PrettyBounds.UnivBounds]
Univ_nice.enum_length_ge1 [in Complexity.TM.PrettyBounds.UnivBounds]
Univ_nice.enum_not_nil [in Complexity.TM.PrettyBounds.UnivBounds]
Univ_nice.fin_prod_nil_Y_nil [in Complexity.TM.PrettyBounds.UnivBounds]
Univ_nice.prodLists_nil_Y_nil [in Complexity.TM.PrettyBounds.UnivBounds]
Univ_nice.prodLists_length [in Complexity.TM.PrettyBounds.UnivBounds]
Univ_nice.fin_empty_or_element [in Complexity.TM.PrettyBounds.UnivBounds]
Univ_nice.index_le [in Complexity.TM.PrettyBounds.UnivBounds]
Univ_nice.getPosition_le [in Complexity.TM.PrettyBounds.UnivBounds]
Univ_nice.Lookup_steps_nice' [in Complexity.TM.PrettyBounds.UnivBounds]
Univ_nice.Lookup_steps_nice [in Complexity.TM.PrettyBounds.UnivBounds]
Univ_nice.Lookup_Loop_steps_nice [in Complexity.TM.PrettyBounds.UnivBounds]
Univ_nice.Lookup_Loop_steps_nice' [in Complexity.TM.PrettyBounds.UnivBounds]
Univ_nice.Lookup_Loop_steps_eq [in Complexity.TM.PrettyBounds.UnivBounds]
Univ_nice.Lookup_Step_steps_nice' [in Complexity.TM.PrettyBounds.UnivBounds]
Univ_nice.Lookup_Step_steps_nice [in Complexity.TM.PrettyBounds.UnivBounds]
Univ_nice.Lookup_Step_steps_CaseList_nice [in Complexity.TM.PrettyBounds.UnivBounds]
Univ_nice.Lookup_Step_steps_Compare_nice [in Complexity.TM.PrettyBounds.UnivBounds]
Univ_Terminates [in Undecidability.TM.Univ.Univ]
Univ_Realise [in Undecidability.TM.Univ.Univ]
Univ_SpecT [in Undecidability.TM.Univ.Univ]
Univ_steps_eq [in Undecidability.TM.Univ.Univ]
Univ_Spec_space [in Undecidability.TM.Univ.Univ]
Univ_Step_SpecT [in Undecidability.TM.Univ.Univ]
Univ_Step_SpecT_space [in Undecidability.TM.Univ.Univ]
unsupported [in Undecidability.L.Tactics.ComputableDemo]
unsupported2 [in Undecidability.L.Tactics.ComputableDemo]
upperBound_In [in Undecidability.TM.PrettyBounds.MaxList]
upToC_pow_le_compat_nary [in Undecidability.L.Complexity.UpToCNary]
upToC_pow_r_drop_nary [in Undecidability.L.Complexity.UpToCNary]
upToC_mul_nary [in Undecidability.L.Complexity.UpToCNary]
upToC_S_nary [in Undecidability.L.Complexity.UpToCNary]
upToC_c_nary [in Undecidability.L.Complexity.UpToCNary]
upToC_mul_c_r_nary [in Undecidability.L.Complexity.UpToCNary]
upToC_mul_c_l_nary [in Undecidability.L.Complexity.UpToCNary]
upToC_min_nary [in Undecidability.L.Complexity.UpToCNary]
upToC_max_nary [in Undecidability.L.Complexity.UpToCNary]
upToC_add_nary [in Undecidability.L.Complexity.UpToCNary]
uptoc_mixed.sat_NP [in Complexity.L.ComparisonTimeBoundDerivation]
uptoc_mixed._term_sat_verifierb [in Complexity.L.ComparisonTimeBoundDerivation]
uptoc_mixed.evalCnf_poly [in Complexity.L.ComparisonTimeBoundDerivation]
uptoc_mixed._term_evalCnf [in Complexity.L.ComparisonTimeBoundDerivation]
uptoc_mixed.sumn_map_mult_c_l [in Complexity.L.ComparisonTimeBoundDerivation]
uptoc_mixed.evalClause_poly [in Complexity.L.ComparisonTimeBoundDerivation]
uptoc_mixed._term_evalClause [in Complexity.L.ComparisonTimeBoundDerivation]
uptoc_mixed._term_forallb [in Complexity.L.ComparisonTimeBoundDerivation]
uptoc_mixed._term_existsb [in Complexity.L.ComparisonTimeBoundDerivation]
uptoc_mixed._term_evalLiteral [in Complexity.L.ComparisonTimeBoundDerivation]
uptoc_mixed._term_evalVar [in Complexity.L.ComparisonTimeBoundDerivation]
uptoc_mixed._term_list_in_decb [in Complexity.L.ComparisonTimeBoundDerivation]
uptoc_pure.sat_NP [in Complexity.L.ComparisonTimeBoundDerivation]
uptoc_pure._term_sat_verifierb [in Complexity.L.ComparisonTimeBoundDerivation]
uptoc_pure._term_evalCnf [in Complexity.L.ComparisonTimeBoundDerivation]
uptoc_pure.sumn_map_mult_c_l [in Complexity.L.ComparisonTimeBoundDerivation]
uptoc_pure._term_evalClause [in Complexity.L.ComparisonTimeBoundDerivation]
uptoc_pure._term_forallb [in Complexity.L.ComparisonTimeBoundDerivation]
uptoc_pure._term_existsb [in Complexity.L.ComparisonTimeBoundDerivation]
uptoc_pure._term_evalLiteral [in Complexity.L.ComparisonTimeBoundDerivation]
uptoc_pure._term_evalVar [in Complexity.L.ComparisonTimeBoundDerivation]
uptoc_pure._term_list_in_decb [in Complexity.L.ComparisonTimeBoundDerivation]
uptoc_pure.maxSize_enc_size [in Complexity.L.ComparisonTimeBoundDerivation]
upToC_f__UpToC [in Undecidability.L.Complexity.UpToC]
upToC_le [in Undecidability.L.Complexity.UpToC]
upToC_pow_le_compat [in Undecidability.L.Complexity.UpToC]
upToC_pow_r_drop [in Undecidability.L.Complexity.UpToC]
upToC_mul [in Undecidability.L.Complexity.UpToC]
upToC_S [in Undecidability.L.Complexity.UpToC]
upToC_c [in Undecidability.L.Complexity.UpToC]
upToC_mul_c_r [in Undecidability.L.Complexity.UpToC]
upToC_mul_c_l [in Undecidability.L.Complexity.UpToC]
upToC_min [in Undecidability.L.Complexity.UpToC]
upToC_max [in Undecidability.L.Complexity.UpToC]
upToC_add [in Undecidability.L.Complexity.UpToC]
UpToC_le [in Undecidability.L.Complexity.UpToC]
U_Realises [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
U_terminatesIn [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
U_reflects_U_spec [in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
U_correct [in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
U_spec_helper [in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]

V

validate_spec' [in Undecidability.TM.L.CompilerBoolFuns.Compiler_nat_facts]
validate_spec [in Undecidability.TM.L.CompilerBoolFuns.Compiler_nat_facts]
validate_spec_help [in Undecidability.TM.L.CompilerBoolFuns.Compiler_nat_facts]
validComp_closed [in Undecidability.L.Tactics.LClos]
validComp_step [in Undecidability.L.Tactics.LClos]
validDirect_valid [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
validDirect_valid [in Complexity.NP.SAT.CookLevin.Subproblems.CC]
validEnv_cons [in Undecidability.L.Tactics.LClos]
validEnv'_cons [in Undecidability.L.Tactics.LClos]
validFlatConf_step [in Complexity.L.TM.TMflatComp]
valid_liftOrig_isOrigString [in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
valid_relpower_homomorphism_iff [in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
valid_relpower_homomorphism2 [in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
valid_relpower_homomorphism1 [in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
valid_homomorphism_iff [in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
valid_homomorphism2 [in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
valid_homomorphism1 [in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
valid_agree [in Complexity.NP.SAT.CookLevin.Reductions.TCC_to_CC]
valid_flat_isFlatListOf_invariant [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
valid_flat_agree [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
valid_congruent [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
valid_monotonous [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
valid_iff [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
valid_base [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
valid_length_inv [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
valid_vacuous [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
valid_flat_isFlatListOf_invariant [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
valid_flat_agree [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
valid_list_ofFlatType_invariant [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
valid_conc_inv [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
valid_coversHeadInd_center [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
valid_reprConfig_unfold [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
valid_cards_equivalent [in Complexity.NP.SAT.CookLevin.Subproblems.CC]
valid_cards_monotonous [in Complexity.NP.SAT.CookLevin.Subproblems.CC]
valid_iff [in Complexity.NP.SAT.CookLevin.Subproblems.CC]
valid_multiple_of_offset [in Complexity.NP.SAT.CookLevin.Subproblems.CC]
valid_vacuous [in Complexity.NP.SAT.CookLevin.Subproblems.CC]
valid_length_inv [in Complexity.NP.SAT.CookLevin.Subproblems.CC]
varsOfClause_size [in Complexity.NP.SAT.SAT_inNP]
varsOfClause_correct [in Complexity.NP.SAT.SAT_inNP]
varsOfCnf_size [in Complexity.NP.SAT.SAT_inNP]
varsOfCnf_correct [in Complexity.NP.SAT.SAT_inNP]
varsOfLiteral_size [in Complexity.NP.SAT.SAT_inNP]
varsOfLiteral_correct [in Complexity.NP.SAT.SAT_inNP]
Vcnf_inhabitated [in Complexity.NP.Clique.kSAT_to_Clique]
Vector_nth_R [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
Vector_nth_L [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
vector_nth_rev [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
vector_nth_rev_append_tail_l [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
vector_nth_rev_append_tail_r [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
vector_nth_rev_append_tail_r' [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
vector_fold_left_right [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
vector_fold_left_to_list [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
vector_fold_right_to_list [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
vector_map_to_list [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
vector_rev_to_list [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
vector_rev_append_tail_to_list [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
vector_to_list_length [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
vector_to_list_inj [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
vector_eqb_spec [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
Vector_in_app [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
Vector_map_app [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
Vector_map_tabulate [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
Vector_tabulate_const [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
vector_to_list_inj [in Undecidability.TM.Single.StepTM]
vector_app_to_list [in Undecidability.TM.Util.VectorPrelim]
vector_nth_error_fin [in Undecidability.TM.Util.VectorPrelim]
vector_nth_error_nat [in Undecidability.TM.Util.VectorPrelim]
vector_to_list_In [in Undecidability.TM.Util.VectorPrelim]
vector_to_list_map2_eta [in Undecidability.TM.Util.VectorPrelim]
vector_to_list_eta [in Undecidability.TM.Util.VectorPrelim]
vector_to_list_cast [in Undecidability.TM.Util.VectorPrelim]
vector_to_list_map [in Undecidability.TM.Util.VectorPrelim]
vector_to_list_length [in Undecidability.TM.Util.VectorPrelim]
vector_to_list_correct [in Undecidability.TM.Util.VectorPrelim]
vector_to_list_length [in Complexity.L.TM.TMunflatten]
Vector_of_list_length_eq [in Complexity.L.TM.TMunflatten]
vector_1_eta [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
vector_sum_monotone_plus' [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
vector_sum_monotone_plus [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
vector_sum_monotone [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
vector_to_list_sum [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
vector_sum_shift [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
vector_to_list_cons [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
vector_to_list_nil [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
vector_const_to_list [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
Vector_dupfree_app [in Undecidability.Shared.Libs.PSL.Vectors.VectorDupfree]
vector_tl_nth [in Undecidability.TM.Lifting.LiftTapes]
vector_hd_nth [in Undecidability.TM.Lifting.LiftTapes]
Vector_map2_ext [in Undecidability.TM.Util.TM_facts]
vector_cast_2 [in Undecidability.TM.Single.EncodeTapes]
vector_cast_ext [in Undecidability.TM.Single.EncodeTapes]
vector_cast_refl [in Undecidability.TM.Single.EncodeTapes]
vect_in_map_iff [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
vect_in_map [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
vect_nth_In' [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
vect_nth_In [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
vect_map_injective [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
vec_pos_fun2vec [in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_map_list_plus [in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_map_list_one [in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_map_list_zero [in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_nat_induction [in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_sum_is_nzero [in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_sum_is_zero [in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_sum_one [in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_sum_zero [in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_sum_plus [in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_change_pred [in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_change_succ [in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_plus_cons [in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_one_nxt [in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_one_fst [in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_zero_S [in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_one_spec_neq [in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_one_spec_eq [in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_plus_is_zero [in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_plus_assoc [in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_plus_comm [in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_zero_spec [in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_zero_plus [in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_pos_plus [in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_map_set_pos [in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_pos_map [in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_map_map [in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_list_vec_map [in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_map_ext [in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_in_map_ext [in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_in_map_vec_map_eq [in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_app_cons [in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_app_nil [in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_pos_app_right [in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_pos_app_left [in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_split_app [in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_app_split [in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_list_In_iff [in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_list_inv [in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_list_iso [in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_list_length [in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_list_vec_set_pos [in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_list_In [in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_change_same [in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_change_idem [in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_change_neq [in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_change_eq [in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_pos_set [in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_pos_ext [in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_pos1 [in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_pos_tail [in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_pos0 [in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_cons_inv [in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_head_tail [in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_0_nil [in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_search [in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
vec_case1 [in Complexity.NP.SAT.CookLevin.Subproblems.SingleTMGenNP]
vec_case1 [in Complexity.NP.SAT.CookLevin.Subproblems.TM_single]
vec_reif [in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
vec_reif_t [in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
vec2fun_fun2vec [in Undecidability.Shared.Libs.DLW.Vec.vec]
vertexSatisfied_edge [in Complexity.NP.Clique.kSAT_to_Clique]
vertices_repr [in Complexity.NP.Clique.kSAT_to_FlatClique]

W

wf_chains [in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
wf_rincl_fin [in Undecidability.Shared.Libs.DLW.Wf.wf_incl]
wf_sincl [in Undecidability.Shared.Libs.DLW.Wf.wf_incl]
wf_strict_order_finite [in Undecidability.Shared.Libs.DLW.Wf.wf_finite]
wf_strict_order_list [in Undecidability.Shared.Libs.DLW.Wf.wf_finite]
WhileCoInduction [in Undecidability.TM.Combinators.While]
WhileInduction [in Undecidability.TM.Combinators.While]
While_TerminatesIn [in Undecidability.TM.Combinators.While]
While_TerminatesIn_ind [in Undecidability.TM.Combinators.While]
While_Realise [in Undecidability.TM.Combinators.While]
While_merge_term [in Undecidability.TM.Combinators.While]
While_merge_repeat [in Undecidability.TM.Combinators.While]
While_split_term [in Undecidability.TM.Combinators.While]
While_split_repeat [in Undecidability.TM.Combinators.While]
While_split [in Undecidability.TM.Combinators.While]
While_trans_repeat [in Undecidability.TM.Combinators.While]
While_SpecTReg' [in Undecidability.TM.Hoare.HoareCombinators]
While_SpecTReg [in Undecidability.TM.Hoare.HoareCombinators]
While_SpecT [in Undecidability.TM.Hoare.HoareCombinators]
While_SpecReg [in Undecidability.TM.Hoare.HoareCombinators]
While_Spec [in Undecidability.TM.Hoare.HoareCombinators]
While_Spec0 [in Undecidability.TM.Hoare.HoareCombinators]
workarround [in Undecidability.L.Tactics.ComputableDemo]
WriteMove_Sem [in Undecidability.TM.Basic.Mono]
WriteNumber_Sem [in Undecidability.TM.Code.BinNumbers.NTM]
WriteString_L_current [in Undecidability.TM.Compound.WriteString]
WriteString_L_right [in Undecidability.TM.Compound.WriteString]
WriteString_L_left [in Undecidability.TM.Compound.WriteString]
WriteString_L_local [in Undecidability.TM.Compound.WriteString]
WriteString_Sem [in Undecidability.TM.Compound.WriteString]
WriteString_fix_Sem [in Undecidability.TM.Compound.WriteString]
WriteString_Fun_eq [in Undecidability.TM.Compound.WriteString]
WriteValue_SpecT_size [in Undecidability.TM.Code.WriteValue]
WriteValue_Sem [in Undecidability.TM.Code.WriteValue]
Write_Sem [in Undecidability.TM.Basic.Mono]
Write_String_nil [in Undecidability.TM.Compound.WriteString]

X

X_gen [in Undecidability.Synthetic.Infinite]

Z

zflat_poly [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
zflat_time_bound [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
zflat_z_eq [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
zipWith_length [in Complexity.L.TM.TMflatComp]
zipWith_time_const [in Complexity.L.TM.TMflatComp]
Zmult_monoid [in Undecidability.Shared.Libs.DLW.Utils.sums]
zPflat_poly [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
zPflat_time_bound [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
zPflat_zP_eq [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Zplus_monoid [in Undecidability.Shared.Libs.DLW.Utils.sums]

_

_term_concat [in Undecidability.L.Datatypes.List.List_basics]
_term_rev_concat [in Undecidability.L.Datatypes.List.List_basics]
_term_sat_verifierb [in Complexity.NP.SAT.SAT_inNP]
_term_evalCnf [in Complexity.NP.SAT.SAT_inNP]
_term_evalClause [in Complexity.NP.SAT.SAT_inNP]
_term_forallb [in Complexity.NP.SAT.SAT_inNP]
_term_existsb [in Complexity.NP.SAT.SAT_inNP]
_term_evalLiteral [in Complexity.NP.SAT.SAT_inNP]
_term_evalVar [in Complexity.NP.SAT.SAT_inNP]
_term_list_in_decb [in Complexity.NP.SAT.SAT_inNP]

---

Constructor Index

A

app [in Undecidability.L.L]
appAT [in Undecidability.TM.L.Alphabets]
appT [in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
appT [in Undecidability.L.AbstractMachines.FlatPro.ProgramsDef]

B

bbbC [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
bbdC [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
bbiC [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
bibC [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
bifC [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
bisC [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
blank [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]

C

C [in Undecidability.L.Computability.Synthetic]
closT [in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
CompApp [in Undecidability.L.Tactics.LClos]
CompClos [in Undecidability.L.Tactics.LClos]
CompVar [in Undecidability.L.Tactics.LClos]
Contains [in Undecidability.TM.Hoare.HoareRegister]
Contains_size [in Undecidability.TM.Hoare.HoareRegister]
coversHead_indC [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
CPowApp [in Undecidability.L.Tactics.LClos]
CPowAppL [in Undecidability.L.Tactics.LClos]
CPowAppR [in Undecidability.L.Tactics.LClos]
CPowRefl [in Undecidability.L.Tactics.LClos]
CPowTrans [in Undecidability.L.Tactics.LClos]
CPowVal [in Undecidability.L.Tactics.LClos]
CPowVar [in Undecidability.L.Tactics.LClos]
Custom [in Undecidability.TM.Hoare.HoareRegister]

D

dbbC [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
dclApp [in Undecidability.L.Util.L_facts]
dcllam [in Undecidability.L.Util.L_facts]
dclvar [in Undecidability.L.Util.L_facts]
decInTime_intro [in Complexity.Complexity.Definitions]
delimC [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
dupfreeC [in Undecidability.Shared.Libs.PSL.Lists.Dupfree]
dupfreeN [in Undecidability.Shared.Libs.PSL.Lists.Dupfree]
dupfreeVC [in Undecidability.Shared.Libs.PSL.Vectors.VectorDupfree]
dupfreeVN [in Undecidability.Shared.Libs.PSL.Vectors.VectorDupfree]

E

eclC [in Undecidability.L.Prelim.ARS]
eclR [in Undecidability.L.Prelim.ARS]
eclS [in Undecidability.L.Prelim.ARS]
ehaltCenter [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
ehaltLeft [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
ehaltRight [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
EnoughSpace [in Complexity.L.AbstractMachines.FunctionalDefinitions]
EntailsI [in Undecidability.TM.Hoare.HoareLogic]
eqRef [in Undecidability.L.Util.L_facts]
eqStep [in Undecidability.L.Util.L_facts]
eqSym [in Undecidability.L.Util.L_facts]
eqTrans [in Undecidability.L.Util.L_facts]
EqType [in Undecidability.Shared.Libs.PSL.EqDec]
EqType [in Undecidability.Shared.Dec]
etransHaltC [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
etransNoneLeftCenterC [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
etransNoneLeftLeftC [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
etransNoneLeftRightC [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
etransNoneNoneLeft [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
etransNoneNoneRight [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
etransNoneNoneStay [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
etransNoneRightCenterC [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
etransNoneRightLeftC [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
etransNoneRightRightC [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
etransNoneStayCenterC [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
etransNoneStayLeftC [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
etransNoneStayRightC [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
etransNonHaltC [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
etransSomeLeftCenterC [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
etransSomeLeftLeftC [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
etransSomeLeftRightC [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
etransSomeNoneLeft [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
etransSomeNoneRight [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
etransSomeNoneStay [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
etransSomeRightCenterC [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
etransSomeRightLeftC [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
etransSomeRightRightC [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
etransSomeStayCenterC [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
etransSomeStayLeftC [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
etransSomeStayRightC [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
etransXSomeLeft [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
etransXSomeRight [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
etransXSomeStay [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
eval_app [in Undecidability.L.L]
eval_abs [in Undecidability.L.L]
eval_step [in Undecidability.TM.TM]
eval_halt [in Undecidability.TM.TM]
eval_step [in Undecidability.TM.SBTM]
eval_halt [in Undecidability.TM.SBTM]

F

Fand [in Complexity.NP.SAT.FSAT.FSAT]
fbbC [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
ffbC [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
fffC [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
ffsC [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
FinType [in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
FinTypeC [in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
fip_intro [in Undecidability.Shared.Libs.PSL.FCI]
fnblank [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
fndelimC [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Fneg [in Complexity.NP.SAT.FSAT.FSAT]
fninit [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
fnsigVar [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
fnstar [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
For [in Complexity.NP.SAT.FSAT.FSAT]
fsbC [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
fssBC [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
fssSC [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Ftrue [in Complexity.NP.SAT.FSAT.FSAT]
Fvar [in Complexity.NP.SAT.FSAT.FSAT]

H

ha [in Undecidability.L.Util.L_facts]
haltCenter [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
haltLeft [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
haltRight [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
heapEntryC [in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
hl [in Undecidability.L.Util.L_facts]
hter [in Undecidability.L.Util.L_facts]
hv [in Undecidability.L.Util.L_facts]

I

ibbC [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
identityBBD [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
identityC [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
identityDBB [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
identityTapeC [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
ifbC [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
iffC [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
ifsC [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
indKCliqueNil [in Complexity.NP.Clique.Clique]
indKCliqueS [in Complexity.NP.Clique.Clique]
inj_enc [in Undecidability.L.Tactics.Computable]
inNP_introSpec [in Complexity.Complexity.NP]
int_ext [in Undecidability.L.Tactics.Extract]
in_chain_list_1 [in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
in_chain_list_0 [in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
in_chain_1 [in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
in_chain_0 [in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
in_gnlb_2 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
in_gnlb_1 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
in_gnlb_0 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
in_ble_1 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
in_ble_0 [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
in_lb_ortho_2 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
in_lb_ortho_1 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
in_lb_ortho_0 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
in_lb_mask_2 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
in_lb_mask_1 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
in_lb_mask_0 [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
in_Acc_eq [in Undecidability.Shared.Libs.DLW.Wf.acc_irr]
in_tb [in Undecidability.Shared.Libs.DLW.Utils.sorting]
in_bij [in Undecidability.Shared.Libs.DLW.Utils.sorting]
in_bounded_inj [in Undecidability.Shared.Libs.DLW.Utils.sorting]
in_cp_1 [in Undecidability.Shared.Libs.DLW.Utils.sorting]
in_cp_0 [in Undecidability.Shared.Libs.DLW.Utils.sorting]
in_nat_perm [in Undecidability.Shared.Libs.DLW.Utils.sorting]
in_lbs_1 [in Undecidability.Shared.Libs.DLW.Utils.list_bool]
in_lbs_0 [in Undecidability.Shared.Libs.DLW.Utils.list_bool]
in_list_hd1 [in Undecidability.Shared.Libs.DLW.Utils.php]
in_list_hd0 [in Undecidability.Shared.Libs.DLW.Utils.php]
in_bar_min_1 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
in_bar_min_0 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
in_sss_steps_S [in Undecidability.Shared.Libs.DLW.Code.sss]
in_sss_steps_0 [in Undecidability.Shared.Libs.DLW.Code.sss]
isbC [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
issBC [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
issSC [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]

K

kCNFB [in Complexity.NP.SAT.kSAT]
kCNFS [in Complexity.NP.SAT.kSAT]

L

lam [in Undecidability.L.L]
lamAT [in Undecidability.TM.L.Alphabets]
lambdaComp [in Undecidability.L.Tactics.LClos]
lamT [in Undecidability.L.AbstractMachines.FlatPro.ProgramsDef]
LeftBlank [in Undecidability.TM.Single.EncodeTapes]
Leftmost.spaceBSBeta [in Undecidability.L.Complexity.ResourceMeasures]
Leftmost.spaceBSVal [in Undecidability.L.Complexity.ResourceMeasures]
Leftmost.step_lmAppL [in Undecidability.L.Complexity.ResourceMeasures]
Leftmost.step_lmAppR [in Undecidability.L.Complexity.ResourceMeasures]
Leftmost.step_lmApp [in Undecidability.L.Complexity.ResourceMeasures]
leftof [in Undecidability.TM.TM]
liftOrigC [in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
liftPreludeC [in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
Lmove [in Undecidability.TM.TM]
Lmove [in Undecidability.TM.SBTM]

M

MarkedSymbol [in Undecidability.TM.Single.EncodeTapes]
midtape [in Undecidability.TM.TM]
mkIsFlatCardsOf [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
mkIsFlatCardsOf [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
mkIsFlatCCCardO [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
mkIsFlatCCOf [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
mkIsFlatEdgesOf [in Complexity.NP.Clique.FlatUGraph]
mkIsFlatFinalOf [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
mkIsFlatTCCCardOf [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
mkIsFlatTCCCardPOf [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
mkIsFlatTCCOf [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
mkisFlatteningConfigOf [in Complexity.L.TM.TMflat]
mkIsFlatteningHaltOf [in Complexity.L.TM.TMflat]
mkIsFlatteningTapeOf [in Complexity.L.TM.TMflat]
mkIsFlatteningTMOf [in Complexity.L.TM.TMflat]
mkIsFlatteningTransOf [in Complexity.L.TM.TMflat]
mkUpToC [in Undecidability.L.Complexity.UpToC]
Mk_finite_quotient [in Undecidability.Shared.Libs.DLW.Utils.fin_quotient]
Mk_finite_partial_quotient [in Undecidability.Shared.Libs.DLW.Utils.fin_quotient]
mk_encodable [in Undecidability.L.Tactics.Extract]
mk_monoid [in Undecidability.Shared.Libs.DLW.Utils.sums]
Mk_domain_of_goal [in Undecidability.L.Complexity.GenericNary]
Mk_domain_goal_hint [in Undecidability.L.Complexity.GenericNary]
mk_mconfig [in Undecidability.TM.Util.TM_facts]

N

nblank [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
ndelimC [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
NilBlank [in Undecidability.TM.Single.EncodeTapes]
niltape [in Undecidability.TM.TM]
ninit [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Nmove [in Undecidability.TM.TM]
Nmove [in Undecidability.TM.SBTM]
nsig [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
nstar [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]

O

orFreeAnd [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
orFreeNot [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
orFreeTrue [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
orFreeVar [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]

P

polConst [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
polVar [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
polyBoundedWitness_introSpec [in Complexity.Complexity.NP]
polyTimeComputable_intro [in Complexity.Complexity.Definitions]
pow_S [in Undecidability.TM.Util.Relations]
pow_0 [in Undecidability.TM.Util.Relations]

R

rApp [in Undecidability.L.Tactics.Reflection]
rCompApp [in Undecidability.L.Tactics.Reflection]
rCompClos [in Undecidability.L.Tactics.Reflection]
rCompVar [in Undecidability.L.Tactics.Reflection]
rConst [in Undecidability.L.Tactics.Reflection]
reducesPolyMO_intro [in Complexity.Complexity.NP]
redWithMaxSizeC [in Undecidability.L.Prelim.ARS]
redWithMaxSizeR [in Undecidability.L.Prelim.ARS]
relpowerB [in Complexity.Libs.CookPrelim.MorePrelim]
relpowerRevB [in Complexity.Libs.CookPrelim.MorePrelim]
relpowerRevS [in Complexity.Libs.CookPrelim.MorePrelim]
relpowerS [in Complexity.Libs.CookPrelim.MorePrelim]
repB [in Complexity.Libs.Pigeonhole]
reprCC [in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
reprCC [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
reprPC [in Undecidability.L.AbstractMachines.FlatPro.ProgramsDef]
repS [in Complexity.Libs.Pigeonhole]
retAT [in Undecidability.TM.L.Alphabets]
retT [in Undecidability.L.AbstractMachines.FlatPro.ProgramsDef]
RightBlank [in Undecidability.TM.Single.EncodeTapes]
rightof [in Undecidability.TM.TM]
rLam [in Undecidability.L.Tactics.Reflection]
Rmove [in Undecidability.TM.TM]
Rmove [in Undecidability.TM.SBTM]
rRho [in Undecidability.L.Tactics.Reflection]
rVar [in Undecidability.L.Tactics.Reflection]

S

sbbC [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
seteq_trans [in Undecidability.Shared.Libs.DLW.Utils.seteq]
seteq_sym [in Undecidability.Shared.Libs.DLW.Utils.seteq]
seteq_dup [in Undecidability.Shared.Libs.DLW.Utils.seteq]
seteq_swap [in Undecidability.Shared.Libs.DLW.Utils.seteq]
seteq_skip [in Undecidability.Shared.Libs.DLW.Utils.seteq]
seteq_nil [in Undecidability.Shared.Libs.DLW.Utils.seteq]
sevalR [in Undecidability.L.Computability.Seval]
sevalS [in Undecidability.L.Computability.Seval]
shiftLeftTapeC [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
shiftRightBBBB [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
shiftRightBBBS [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
shiftRightBBS [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
shiftRightBSS [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
shiftRightSBB [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
shiftRightSSB [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
shiftRightSSSB [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
shiftRightSSSS [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
shiftRightTapeC [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
sigList_cons [in Undecidability.TM.Code.Code]
sigList_nil [in Undecidability.TM.Code.Code]
sigList_X [in Undecidability.TM.Code.Code]
sigNat_S [in Undecidability.TM.Code.Code]
sigNat_O [in Undecidability.TM.Code.Code]
sigOption_Some [in Undecidability.TM.Code.Code]
sigOption_None [in Undecidability.TM.Code.Code]
sigOption_X [in Undecidability.TM.Code.Code]
sigPair_Y [in Undecidability.TM.Code.Code]
sigPair_X [in Undecidability.TM.Code.Code]
sigPos_xH [in Undecidability.TM.Code.BinNumbers.EncodeBinNumbers]
sigPos_xO [in Undecidability.TM.Code.BinNumbers.EncodeBinNumbers]
sigPos_xI [in Undecidability.TM.Code.BinNumbers.EncodeBinNumbers]
sigSum_inr [in Undecidability.TM.Code.Code]
sigSum_inl [in Undecidability.TM.Code.Code]
sigSum_Y [in Undecidability.TM.Code.Code]
sigSum_X [in Undecidability.TM.Code.Code]
SNC [in Undecidability.L.Prelim.ARS]
someSigmaVar [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
SpaceBoundReached [in Complexity.L.AbstractMachines.FunctionalDefinitions]
ssbBC [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
ssbSC [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
sssBC [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
sssSBC [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
sssSSC [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
starC [in Undecidability.L.Prelim.ARS]
starC [in Undecidability.TM.Util.Relations]
starR [in Undecidability.L.Prelim.ARS]
starR [in Undecidability.TM.Util.Relations]
START [in Undecidability.TM.Code.CodeTM]
stateSigmaVar [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
StateWhile_T_intro [in Undecidability.TM.Combinators.StateWhile]
StateWhile_Rel_break [in Undecidability.TM.Combinators.StateWhile]
StateWhile_Rel_loop [in Undecidability.TM.Combinators.StateWhile]
stepApp [in Undecidability.L.Util.L_facts]
stepAppL [in Undecidability.L.Util.L_facts]
stepAppR [in Undecidability.L.Util.L_facts]
step_app [in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
step_load [in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
step_beta [in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
step_pushVal [in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
step_load [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
step_beta [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
step_pushVal [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
step_beta [in Complexity.L.AbstractMachines.AbstractSubstMachine]
step_pushVal [in Complexity.L.AbstractMachines.AbstractSubstMachine]
STOP [in Undecidability.TM.Code.CodeTM]
subtermAppL [in Complexity.L.AbstractMachines.AbstractHeapMachine]
subtermAppR [in Complexity.L.AbstractMachines.AbstractHeapMachine]
subtermLam [in Complexity.L.AbstractMachines.AbstractHeapMachine]
subtermR [in Complexity.L.AbstractMachines.AbstractHeapMachine]

T

task.appT [in Complexity.L.AbstractMachines.UnfoldTailRec]
task.closT [in Complexity.L.AbstractMachines.UnfoldTailRec]
task.lamT [in Complexity.L.AbstractMachines.UnfoldTailRec]
timeBSBeta [in Undecidability.L.Complexity.ResourceMeasures]
timeBSVal [in Undecidability.L.Complexity.ResourceMeasures]
tnlc1 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
tnlc2 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
tnll1 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
tnll2 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
tnll3 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
tnlr1 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
tnlr2 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
tnrc1 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
tnrc2 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
tnrl1 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
tnrl2 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
tnrr1 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
tnrr2 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
tnrr3 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
tnsc1 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
tnsc2 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
tnsl1 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
tnsl2 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
tnsr1 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
tnsr2 [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
traceCons [in Complexity.Complexity.SpaceBoundsTime]
traceUn [in Complexity.Complexity.SpaceBoundsTime]
transNNCenter [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transNNCenterCenterC [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transNNCenterLeftC [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transNNCenterRightC [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transNNLeft [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transNNLeftCenterC [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transNNLeftLeftC [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transNNLeftRightC [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transNNRight [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transNNRightCenterC [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transNNRightLeftC [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transNNRightRightC [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transNoneNoneC [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transNoneSomeC [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transNSCenter [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transNSLeft [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transNSLeftCenterC [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transNSLeftLeftC [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transNSLeftRightC [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transNSRight [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transNSRightCenterC [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transNSRightLeftC [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transNSRightRightC [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transNSStayCenterC [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transNSStayLeftC [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transNSStayRightC [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transSNCenter [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transSNLeft [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transSNLeftCenterC [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transSNLeftLeftC [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transSNLeftRightC [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transSNRight [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transSNRightCenterC [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transSNRightLeftC [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transSNRightRightC [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transSNStayCenterC [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transSNStayLeftC [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transSNStayRightC [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transSomeNoneC [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transSomeSomeC [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transSSCenter [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transSSLeft [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transSSLeftCenterC [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transSSLeftLeftC [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transSSLeftRightC [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transSSRight [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transSSRightCenterC [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transSSRightLeftC [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transSSRightRightC [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transSSStayCenterC [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transSSStayLeftC [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transSSStayRightC [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
TripleI [in Undecidability.TM.Hoare.HoareLogic]
TripleTI [in Undecidability.TM.Hoare.HoareLogic]
tslc [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
tsll [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
tslr [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
tsrc [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
tsrl [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
tsrr [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
tssc [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
tssl [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
tssr [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
TyArr [in Undecidability.L.Tactics.Computable]
TyB [in Undecidability.L.Tactics.Computable]

U

unfoldsApp [in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
unfoldsApp [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
unfoldsBound [in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
unfoldsBound [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
unfoldsLam [in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
unfoldsLam [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
unfoldsUnbound [in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
unfoldsUnbound [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
UNKNOWN [in Undecidability.TM.Code.CodeTM]
UnmarkedSymbol [in Undecidability.TM.Single.EncodeTapes]

V

validB [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
validB [in Complexity.NP.SAT.CookLevin.Subproblems.CC]
validCompApp [in Undecidability.L.Tactics.LClos]
validCompClos [in Undecidability.L.Tactics.LClos]
validDirectB [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
validDirectB [in Complexity.NP.SAT.CookLevin.Subproblems.CC]
validDirectS [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
validDirectS [in Complexity.NP.SAT.CookLevin.Subproblems.CC]
validS [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
validS [in Complexity.NP.SAT.CookLevin.Subproblems.CC]
validSA [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
validSA [in Complexity.NP.SAT.CookLevin.Subproblems.CC]
var [in Undecidability.L.L]
varInFormuAndL [in Complexity.NP.SAT.FSAT.FSAT]
varInFormulaAndR [in Complexity.NP.SAT.FSAT.FSAT]
varInFormulaNot [in Complexity.NP.SAT.FSAT.FSAT]
varInFormulaOrL [in Complexity.NP.SAT.FSAT.FSAT]
varInFormulaOrR [in Complexity.NP.SAT.FSAT.FSAT]
varInFormulaV [in Complexity.NP.SAT.FSAT.FSAT]
varT [in Undecidability.L.AbstractMachines.FlatPro.ProgramsDef]
Void [in Undecidability.TM.Hoare.HoareRegister]
Void_size [in Undecidability.TM.Hoare.HoareRegister]

W

While_T_intro [in Undecidability.TM.Combinators.While]
While_Rel''_loop [in Undecidability.TM.Combinators.While]
While_Rel''_one [in Undecidability.TM.Combinators.While]

_

_eqb_spec [in Undecidability.L.Functions.EqBool]

---

Inductive Index

A

Acc_eq [in Undecidability.Shared.Libs.DLW.Wf.acc_irr]
ACom [in Undecidability.TM.L.Alphabets]

B

bar_min [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
bijection [in Undecidability.Shared.Libs.DLW.Utils.sorting]
binary_le [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
bound [in Undecidability.L.Util.L_facts]
boundary [in Undecidability.TM.Code.CodeTM]
bounded_injective [in Undecidability.Shared.Libs.DLW.Utils.sorting]
bounded_permut [in Undecidability.Shared.Libs.DLW.Utils.sorting]

C

chain [in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
chain_list [in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
Comp [in Undecidability.L.Tactics.LClos]
composed_permutation [in Undecidability.Shared.Libs.DLW.Utils.sorting]
coversHeadInd [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
CPow [in Undecidability.L.Tactics.LClos]

D

delim [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Domain_goal_hint [in Undecidability.L.Complexity.GenericNary]
dupfree [in Undecidability.Shared.Libs.PSL.Lists.Dupfree]
dupfree [in Undecidability.Shared.Libs.PSL.Vectors.VectorDupfree]

E

ecl [in Undecidability.L.Prelim.ARS]
ehaltRules [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
encInj [in Undecidability.L.Tactics.Computable]
Entails [in Undecidability.TM.Hoare.HoareLogic]
eqbClass [in Undecidability.L.Functions.EqBool]
equiv [in Undecidability.L.Util.L_facts]
estateRules [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
etransNoneLeft [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
etransNoneRight [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
etransNoneStay [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
etransRules [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
etransSomeLeft [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
etransSomeRight [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
etransSomeStay [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
eval [in Undecidability.L.L]
eval [in Undecidability.TM.TM]
eval [in Undecidability.TM.SBTM]
extracted [in Undecidability.L.Tactics.Extract]

F

fip [in Undecidability.Shared.Libs.PSL.FCI]
formula [in Complexity.NP.SAT.FSAT.FSAT]
fpolarity [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
fpreludeSig' [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
fstateSigma [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]

G

g_nlb [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]

H

haltRules [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
heapEntry [in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
hoas [in Undecidability.L.Util.L_facts]

I

identityRules [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
indKClique [in Complexity.NP.Clique.Clique]
isFlatCardsOf [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
isFlatCCCardOf [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
isFlatCCOf [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
isFlatEdgesOf [in Complexity.NP.Clique.FlatUGraph]
isFlatFinalOf [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
isFlatTCardsOf [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
isFlatTCCCardOf [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
isFlatTCCCardPOf [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
isFlatTCCOf [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
isFlatteningConfigOf [in Complexity.L.TM.TMflat]
isFlatteningHaltOf [in Complexity.L.TM.TMflat]
isFlatteningTapesOf [in Complexity.L.TM.TMflat]
isFlatteningTMOf [in Complexity.L.TM.TMflat]
isFlatteningTransOf [in Complexity.L.TM.TMflat]
is_computable [in Undecidability.L.Computability.Synthetic]

K

kCNF [in Complexity.NP.SAT.kSAT]

L

lamComp [in Undecidability.L.Tactics.LClos]
lb_ortho [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
lb_mask [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
Leftmost.spaceBS [in Undecidability.L.Complexity.ResourceMeasures]
Leftmost.step_lm [in Undecidability.L.Complexity.ResourceMeasures]
liftOrig [in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
liftPrelude [in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
list_bool_succ [in Undecidability.Shared.Libs.DLW.Utils.list_bool]
list_has_dup [in Undecidability.Shared.Libs.DLW.Utils.php]

M

move [in Undecidability.TM.TM]
move [in Undecidability.TM.SBTM]

O

orFree [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]

P

pow [in Undecidability.TM.Util.Relations]
preludeRules [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
preludeSig' [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]

R

rComp [in Undecidability.L.Tactics.Reflection]
redWithMaxSize [in Undecidability.L.Prelim.ARS]
RegSpec [in Undecidability.TM.Hoare.HoareRegister]
relpower [in Complexity.Libs.CookPrelim.MorePrelim]
relpowerRev [in Complexity.Libs.CookPrelim.MorePrelim]
rep [in Complexity.Libs.Pigeonhole]
reprC [in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
reprC [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
reprP [in Undecidability.L.AbstractMachines.FlatPro.ProgramsDef]
rTerm [in Undecidability.L.Tactics.Reflection]

S

seteq [in Undecidability.Shared.Libs.DLW.Utils.seteq]
seval [in Undecidability.L.Computability.Seval]
shiftRightRules [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
sigList [in Undecidability.TM.Code.Code]
sigNat [in Undecidability.TM.Code.Code]
sigOption [in Undecidability.TM.Code.Code]
sigPair [in Undecidability.TM.Code.Code]
sigPos [in Undecidability.TM.Code.BinNumbers.EncodeBinNumbers]
sigSum [in Undecidability.TM.Code.Code]
sigTape [in Undecidability.TM.Single.EncodeTapes]
SN [in Undecidability.L.Prelim.ARS]
sss_steps [in Undecidability.Shared.Libs.DLW.Code.sss]
star [in Undecidability.L.Prelim.ARS]
star [in Undecidability.TM.Util.Relations]
StateWhile_T [in Undecidability.TM.Combinators.StateWhile]
StateWhile_Rel [in Undecidability.TM.Combinators.StateWhile]
step [in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
step [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
step [in Undecidability.L.Util.L_facts]
step [in Complexity.L.AbstractMachines.AbstractSubstMachine]
substStepResult [in Complexity.L.AbstractMachines.FunctionalDefinitions]
subterm [in Complexity.L.AbstractMachines.AbstractHeapMachine]

T

tape [in Undecidability.TM.TM]
tapeRules [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
task [in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
task.task [in Complexity.L.AbstractMachines.UnfoldTailRec]
term [in Undecidability.L.L]
timeBS [in Undecidability.L.Complexity.ResourceMeasures]
Tok [in Undecidability.L.AbstractMachines.FlatPro.ProgramsDef]
trace [in Complexity.Complexity.SpaceBoundsTime]
transNoneLeftCenter [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transNoneLeftLeft [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transNoneLeftRight [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transNoneNone [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transNoneNoneCenter [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transNoneNoneLeft [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transNoneNoneRight [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transNoneRightCenter [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transNoneRightLeft [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transNoneRightRight [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transNoneSome [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transNoneSomeCenter [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transNoneSomeLeft [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transNoneSomeRight [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transNoneStayCenter [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transNoneStayLeft [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transNoneStayRight [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transRules [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transSomeLeftCenter [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transSomeLeftLeft [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transSomeLeftRight [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transSomeNone [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transSomeNoneCenter [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transSomeNoneLeft [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transSomeNoneRight [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transSomeRightCenter [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transSomeRightLeft [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transSomeRightRight [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transSomeSome [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transSomeSomeCenter [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transSomeSomeLeft [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transSomeSomeRight [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transSomeStayCenter [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transSomeStayLeft [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transSomeStayRight [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
triangle_bijection [in Undecidability.Shared.Libs.DLW.Utils.sorting]
Triple [in Undecidability.TM.Hoare.HoareLogic]
TripleT [in Undecidability.TM.Hoare.HoareLogic]
TT [in Undecidability.L.Tactics.Computable]

U

unfolds [in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
unfolds [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]

V

valid [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
valid [in Complexity.NP.SAT.CookLevin.Subproblems.CC]
validComp [in Undecidability.L.Tactics.LClos]
validDirect [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
validDirect [in Complexity.NP.SAT.CookLevin.Subproblems.CC]
varInFormula [in Complexity.NP.SAT.FSAT.FSAT]

W

While_T [in Undecidability.TM.Combinators.While]
While_Rel [in Undecidability.TM.Combinators.While]

---

Projection Index

B

bounds__rSP [in Complexity.Complexity.Definitions]

C

cardEl1 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
cardEl2 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
cardEl3 [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
cards [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
cards [in Complexity.NP.SAT.CookLevin.Subproblems.BinaryCC]
cards [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
cards [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
cards [in Complexity.NP.SAT.CookLevin.Subproblems.CC]
class [in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
compIn__decInTime [in Complexity.Complexity.Definitions]
complete__toTerm [in Complexity.NP.L.CanEnumTerm_def]
complete__pCR [in Complexity.Complexity.NP]
comp__toTerm [in Complexity.NP.L.CanEnumTerm_def]
comp_enc_lin [in Complexity.Complexity.EncodableP]
comp_eqb [in Undecidability.L.Functions.EqBool]
comp__polyTC [in Complexity.Complexity.Definitions]
comp_enc_lin [in Undecidability.L.Complexity.LinDecode.LTD_def]
conc [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
conc [in Complexity.NP.SAT.CookLevin.Subproblems.CC]
correct__UpToC [in Undecidability.L.Complexity.UpToC]
correct__leUpToC [in Undecidability.L.Complexity.UpToC]
correct__decInTime [in Complexity.Complexity.Definitions]
cstate [in Undecidability.TM.Util.TM_facts]
ctapes [in Undecidability.TM.Util.TM_facts]
c__regP [in Complexity.Complexity.EncodableP]
c__leUpToC [in Undecidability.L.Complexity.UpToC]
c__eqbComp [in Undecidability.L.Functions.EqBool]
c__linDec [in Undecidability.L.Complexity.LinDecode.LTD_def]

D

decode [in Undecidability.L.Functions.Decoding]
decode_correct2 [in Undecidability.L.Functions.Decoding]
decode_correct [in Undecidability.L.Functions.Decoding]
default [in Undecidability.Shared.Libs.PSL.Inhabited]
Domain_of_goal_domain [in Undecidability.L.Complexity.GenericNary]
Domain_of_goal_domain_ty [in Undecidability.L.Complexity.GenericNary]

E

E [in Complexity.NP.Clique.UGraph]
enc [in Undecidability.L.Tactics.Extract]
encode [in Undecidability.TM.Code.Code]
enum [in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
enum_ok [in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
eqType_dec [in Undecidability.Shared.Libs.PSL.EqDec]
eqType_X [in Undecidability.Shared.Libs.PSL.EqDec]
eqType_dec [in Undecidability.Shared.Dec]
eqType_X [in Undecidability.Shared.Dec]
ext [in Undecidability.L.Tactics.Computable]
extCorrect [in Undecidability.L.Tactics.Computable]
extT [in Undecidability.L.Tactics.ComputableTime]
extTCorrect [in Undecidability.L.Tactics.ComputableTime]
E_symm [in Complexity.NP.Clique.UGraph]
E_dec [in Complexity.NP.Clique.UGraph]

F

f [in Complexity.Complexity.NP]
final [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
final [in Complexity.NP.SAT.CookLevin.Subproblems.BinaryCC]
final [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
final [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
final [in Complexity.NP.SAT.CookLevin.Subproblems.CC]
flatTrans_bound [in Complexity.L.TM.TMunflatten]
flatTrans_inj [in Complexity.L.TM.TMunflatten]
fpq_Some [in Undecidability.Shared.Libs.DLW.Utils.fin_quotient]
fpq_None [in Undecidability.Shared.Libs.DLW.Utils.fin_quotient]
fpq_eq [in Undecidability.Shared.Libs.DLW.Utils.fin_quotient]
fpq_repr [in Undecidability.Shared.Libs.DLW.Utils.fin_quotient]
fpq_class [in Undecidability.Shared.Libs.DLW.Utils.fin_quotient]
fpq_size [in Undecidability.Shared.Libs.DLW.Utils.fin_quotient]
fq_equiv [in Undecidability.Shared.Libs.DLW.Utils.fin_quotient]
fq_surj [in Undecidability.Shared.Libs.DLW.Utils.fin_quotient]
fq_repr [in Undecidability.Shared.Libs.DLW.Utils.fin_quotient]
fq_class [in Undecidability.Shared.Libs.DLW.Utils.fin_quotient]
fq_size [in Undecidability.Shared.Libs.DLW.Utils.fin_quotient]
f__toTerm [in Complexity.NP.L.CanEnumTerm_def]
f__UpToC [in Undecidability.L.Complexity.UpToC]
f__decInTime [in Complexity.Complexity.Definitions]
f__correct [in Complexity.Complexity.NP]
f__comp [in Complexity.Complexity.NP]

H

halt [in Complexity.L.TM.TMflat]
halt [in Undecidability.TM.TM]

I

init [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
init [in Complexity.NP.SAT.CookLevin.Subproblems.BinaryCC]
init [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
init [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
init [in Complexity.NP.SAT.CookLevin.Subproblems.CC]
inj_enc [in Undecidability.L.Tactics.Computable]
inSize__toTerm [in Complexity.NP.L.CanEnumTerm_def]
int_ext [in Undecidability.L.Tactics.Extract]
isP__mono [in Complexity.Complexity.UpToCPoly]
isP__inOPoly [in Complexity.Complexity.UpToCPoly]
isP__bounds [in Complexity.Complexity.UpToCPoly]
isP__poly [in Complexity.Complexity.UpToCPoly]

M

monoid_assoc [in Undecidability.Shared.Libs.DLW.Utils.sums]
monoid_unit_r [in Undecidability.Shared.Libs.DLW.Utils.sums]
monoid_unit_l [in Undecidability.Shared.Libs.DLW.Utils.sums]
monoIn__toTerm [in Complexity.NP.L.CanEnumTerm_def]
mono__polyTC [in Complexity.Complexity.Definitions]
mono__rSP [in Complexity.Complexity.Definitions]
mono__pCR [in Complexity.Complexity.NP]

N

num_states [in Undecidability.TM.SBTM]

O

offset [in Complexity.NP.SAT.CookLevin.Subproblems.BinaryCC]
offset [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
offset [in Complexity.NP.SAT.CookLevin.Subproblems.CC]

P

Pcards [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
Pfinal [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
Pinit [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
polarityEnv [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
polyIn__toTerm [in Complexity.NP.L.CanEnumTerm_def]
poly__polyTC [in Complexity.Complexity.Definitions]
poly__rSP [in Complexity.Complexity.Definitions]
poly__pCR [in Complexity.Complexity.NP]
prem [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
prem [in Complexity.NP.SAT.CookLevin.Subproblems.CC]
proc_enc [in Undecidability.L.Tactics.Extract]
PSigma [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
Psteps [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
p__pCR [in Complexity.Complexity.NP]

R

resSize__polyTC [in Complexity.Complexity.Definitions]
resSize__rSP [in Complexity.Complexity.Definitions]
Retr_retr [in Undecidability.Shared.Libs.PSL.Retracts]
Retr_g [in Undecidability.Shared.Libs.PSL.Retracts]
Retr_f [in Undecidability.Shared.Libs.PSL.Retracts]
R_NP__correct [in Complexity.Complexity.NP]
R_NP__comp [in Complexity.Complexity.NP]
R_NP [in Complexity.Complexity.NP]

S

sig [in Complexity.L.TM.TMflat]
Sigma [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
Sigma [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
Sigma [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
Sigma [in Complexity.NP.SAT.CookLevin.Subproblems.CC]
sigmaEnv [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
sound__pCR [in Complexity.Complexity.NP]
start [in Complexity.L.TM.TMflat]
start [in Undecidability.TM.TM]
state [in Undecidability.TM.TM]
stateEnv [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
states [in Complexity.L.TM.TMflat]
stateSigmaEnv [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
steps [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
steps [in Complexity.NP.SAT.CookLevin.Subproblems.BinaryCC]
steps [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
steps [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
steps [in Complexity.NP.SAT.CookLevin.Subproblems.CC]

T

tapes [in Complexity.L.TM.TMflat]
time__polyTC [in Complexity.Complexity.Definitions]
trans [in Complexity.L.TM.TMflat]
trans [in Undecidability.TM.TM]
trans [in Undecidability.TM.SBTM]
type [in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]

V

V [in Complexity.NP.Clique.UGraph]

W

width [in Complexity.NP.SAT.CookLevin.Subproblems.BinaryCC]
width [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
width [in Complexity.NP.SAT.CookLevin.Subproblems.CC]

_

_eqb_spec [in Undecidability.L.Functions.EqBool]

---

Section Index

A

abstractDefs [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
abstractDefs.fixCoversHead [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
Acc_irrelevance [in Undecidability.Shared.Libs.DLW.Wf.acc_irr]
AlphabetLifting [in Undecidability.TM.Hoare.HoareRegister]
AlphabetLifting' [in Undecidability.TM.Hoare.HoareRegister]
Analysis [in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisStep]
Analysis [in Complexity.L.AbstractMachines.AbstractHeapMachine]
Append [in Undecidability.TM.Code.List.App]
App_nice [in Complexity.TM.PrettyBounds.BaseCode]
APP_right [in Undecidability.TM.L.CompilerBoolFuns.Compiler]
App_nice [in Undecidability.TM.Code.List.App]

B

base_decomp.base_p [in Undecidability.Shared.Libs.DLW.Utils.prime]
base_decomp [in Undecidability.Shared.Libs.DLW.Utils.prime]
bezout [in Undecidability.Shared.Libs.DLW.Utils.gcd]
bezout.bezout_generalized [in Undecidability.Shared.Libs.DLW.Utils.gcd]
bezout.bezout_rel_prime [in Undecidability.Shared.Libs.DLW.Utils.gcd]
bezout.gcd_lcm [in Undecidability.Shared.Libs.DLW.Utils.gcd]
Bijection [in Undecidability.Shared.Libs.PSL.Bijection]
binomial [in Undecidability.Shared.Libs.DLW.Utils.binomial]
binomial_Newton [in Undecidability.Shared.Libs.DLW.Utils.sums]
bla [in Undecidability.TM.Code.List.Concat_Repeat]
bla [in Undecidability.L.Complexity.UpToCNary]
bla [in Undecidability.L.Complexity.UpToC]
BookKeepingForRead [in Undecidability.TM.Single.StepTM]
BoollistToEnc.M [in Undecidability.TM.L.Transcode.Boollist_to_Enc]
Boollist2encBoolsTM.Fix [in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
bounded_min [in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
bounded_choose_d [in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
bounded_search [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]

C

Cardinality [in Undecidability.Shared.Libs.PSL.Lists.Cardinality]
CaseBool [in Undecidability.TM.Code.CaseBool]
CaseChar [in Undecidability.TM.Basic.Mono]
CaseChar2 [in Undecidability.TM.Basic.Duo]
CaseFin [in Undecidability.TM.Code.CaseFin]
CaseFin [in Undecidability.TM.Code.CaseFin]
CaseList [in Undecidability.TM.Code.CaseList]
CaseList [in Undecidability.TM.Code.CaseList]
CaseList_nice [in Complexity.TM.PrettyBounds.BaseCode]
CaseList_nice [in Complexity.TM.PrettyBounds.BaseCodeSpace]
CaseNat [in Undecidability.TM.Code.CaseNat]
CaseNat_steps_nice [in Complexity.TM.PrettyBounds.BaseCode]
CaseNat.NatConstructor [in Undecidability.TM.Code.CaseNat]
CaseOption [in Undecidability.TM.Code.CaseSum]
CaseOpton [in Undecidability.TM.Code.CaseSum]
CasePair [in Undecidability.TM.Code.CasePair]
CasePair [in Undecidability.TM.Code.CasePair]
CasePair_steps_nice [in Complexity.TM.PrettyBounds.BaseCode]
CasePair_size_nice [in Complexity.TM.PrettyBounds.BaseCodeSpace]
CaseSum [in Undecidability.TM.Code.CaseSum]
CaseSum [in Undecidability.TM.Code.CaseSum]
CaseSum_steps_nice [in Complexity.TM.PrettyBounds.BaseCode]
CaseSum.SumConstr [in Undecidability.TM.Code.CaseSum]
CCCard_of_size [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
ChangeAlphabet [in Undecidability.TM.Code.ChangeAlphabet]
CheckEncodesBoolList.checkEncodesBoolList [in Complexity.TM.Code.DecodeList]
CheckEncodesBoolList.checkEncodesBoolList2 [in Complexity.TM.Code.DecodeList]
CheckEncodesBool.checkEncodesBool [in Complexity.TM.Code.DecodeBool]
CheckEncodesTapes.checkEncodesTapes [in Complexity.TM.Single.DecodeTapes]
CheckEncodesTape.checkEncodesTape [in Complexity.TM.Single.DecodeTape]
CheckTapeContains.fixx [in Complexity.TM.Code.Decode]
comp [in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
Compare [in Undecidability.TM.Compound.Compare]
CompareLists [in Undecidability.TM.Compound.Compare]
CompareValues [in Undecidability.TM.Code.CompareValue]
CompareValues [in Undecidability.TM.Code.CompareValue]
CompareValues_nice [in Complexity.TM.PrettyBounds.BaseCode]
Compare_fun_lemmas [in Undecidability.TM.Compound.Compare]
ComposeRetracts [in Undecidability.Shared.Libs.PSL.Retracts]
Composition [in Undecidability.TM.Combinators.SequentialComposition]
comp.correctness [in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
concat [in Undecidability.L.Datatypes.List.List_basics]
ConcatRepeat.concatRepeat [in Undecidability.TM.Code.List.Concat_Repeat]
concat_fixX [in Complexity.Libs.CookPrelim.PolyBounds]
cons [in Complexity.NP.TM.LM_to_mTM]
Cons_constant.Fix [in Undecidability.TM.Code.List.Cons_constant]
ContainsEncoding.containsEncoding [in Complexity.TM.Code.Decode]
conv_output [in Undecidability.TM.L.CompilerBoolFuns.Compiler]
Copy [in Undecidability.TM.Code.Copy]
Copy [in Undecidability.TM.Compound.Multi]
CopySymbols [in Undecidability.TM.Compound.CopySymbols]
CopyValue [in Undecidability.TM.Code.Copy]
Copy_very_nice [in Complexity.TM.PrettyBounds.BaseCode]
Copy_size_nice [in Complexity.TM.PrettyBounds.BaseCodeSpace]
Count [in Undecidability.Shared.Libs.PSL.Vectors.VectorDupfree]

D

decidable_sinc [in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
defExPTCC [in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
demo [in Undecidability.L.Tactics.ComputableDemo]
demo.PaperExample [in Undecidability.L.Tactics.ComputableDemo]
Diverge [in Undecidability.TM.Compound.Multi]
divides [in Undecidability.Shared.Libs.DLW.Utils.gcd]
division [in Undecidability.Shared.Libs.DLW.Utils.gcd]
DoAct [in Undecidability.TM.Basic.Mono]
DoAct_Derived [in Undecidability.TM.Basic.Mono]
Dupfree [in Undecidability.Shared.Libs.PSL.Lists.Dupfree]
dupfree_dec_time [in Undecidability.L.Datatypes.List.List_in]
dupfree_dec [in Undecidability.L.Datatypes.List.List_in]

E

encBoolsTM2boollist.Fix [in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
encodeList_size_eq [in Complexity.TM.PrettyBounds.BaseCode]
Encode_nat [in Undecidability.TM.Code.Code]
Encode_list [in Undecidability.TM.Code.Code]
Encode_option [in Undecidability.TM.Code.Code]
Encode_pair [in Undecidability.TM.Code.Code]
Encode_sum [in Undecidability.TM.Code.Code]
Encode_map_comp [in Undecidability.TM.Code.Code]
Encode_map [in Undecidability.TM.Code.Code]
Encode_Finite [in Undecidability.TM.Code.Code]
encodings [in Complexity.NP.SAT.FSAT.FormulaEncoding]
encTape [in Complexity.L.TM.CompCode]
EncToBoollist.M [in Undecidability.TM.L.Transcode.Enc_to_Boollist]
enumerator_list_enumerator [in Undecidability.Synthetic.ListEnumerabilityFacts]
enumerator_list_enumerator [in Undecidability.Synthetic.ListEnumerabilityFacts]
enum_red [in Undecidability.Synthetic.ReducibilityFacts]
ep_quotient [in Undecidability.Shared.Libs.DLW.Utils.quotient]
Equi [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
Euclid [in Undecidability.Shared.Libs.DLW.Utils.gcd]
EvalL.Fix [in Undecidability.TM.L.Eval]
exists_equiv [in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
explicit_bounds.explicit_bounds.fixX [in Complexity.L.ComparisonTimeBoundDerivation]
explicit_bounds.explicit_bounds.fixXeq [in Complexity.L.ComparisonTimeBoundDerivation]
explicit_bounds.explicit_bounds [in Complexity.L.ComparisonTimeBoundDerivation]
extraction [in Complexity.NP.SAT.SAT_inNP]
extraction.fixXeq [in Complexity.NP.SAT.SAT_inNP]

F

factorial [in Undecidability.Shared.Libs.DLW.Utils.binomial]
FCI.FCI [in Undecidability.Shared.Libs.PSL.FCI]
Fill [in Undecidability.TM.Lifting.LiftTapes]
Fill.Test [in Undecidability.TM.Lifting.LiftTapes]
Filter [in Undecidability.Shared.FilterFacts]
Filter [in Undecidability.Shared.Libs.PSL.Lists.Filter]
Fin [in Undecidability.TM.Single.StepTM]
finFun [in Undecidability.L.Functions.FinTypeLookup]
finite [in Undecidability.Shared.Libs.DLW.Utils.fin_base]
finite_t_weak_dec_powerset [in Undecidability.Shared.Libs.DLW.Utils.fin_upto]
finite_t_upto [in Undecidability.Shared.Libs.DLW.Utils.fin_upto]
finite_t_dec_choose_one [in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
finite_discrete_choice [in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
finite.filter [in Undecidability.Shared.Libs.DLW.Utils.fin_base]
finType_eqb [in Undecidability.L.Datatypes.LFinType]
fin_reif [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
Fip [in Undecidability.Shared.Libs.PSL.FCI]
first_which_ni [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
fixEqBoolT [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
fixFCCInstance [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
fixfilterSome [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
fixGraph [in Complexity.NP.Clique.Clique]
fixGraph [in Complexity.NP.Clique.FlatClique]
fixH [in Undecidability.L.AbstractMachines.FlatPro.UnfoldClos]
FixInit [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds_Loop]
fixInstance [in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
fixInstance [in Complexity.NP.SAT.CookLevin.Reductions.TCC_to_CC]
fixInstance [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
fixInstance [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
fixInstance [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
fixInstance [in Complexity.NP.SAT.CookLevin.Reductions.CC_to_BinaryCC]
fixInstance [in Complexity.NP.SAT.CookLevin.Subproblems.CC]
fixInstanceA [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
fixIsInjFinfuncTable [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
fixIt [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
fixListProd [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
fixPrelude [in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
fixprodLists [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
fixprodLists [in Undecidability.L.Datatypes.List.List_extra]
fixPTCCInstance [in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
fixPTCCInstance.fixInitial [in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
fixRulePred [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
fixSAT [in Complexity.NP.Clique.kSAT_to_Clique]
fixSAT [in Complexity.NP.Clique.kSAT_to_FlatClique]
fixSAT.Clique_implies_SAT [in Complexity.NP.Clique.kSAT_to_Clique]
fixSAT.SAT_implies_Clique [in Complexity.NP.Clique.kSAT_to_Clique]
fixSig [in Complexity.L.TM.TMflatten]
fixTM [in Complexity.NP.SAT.CookLevin.Reductions.TMGenNP_fixed_singleTapeTM_to_FlatFunSingleTMGenNP]
fixTM [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
fixTM.fixAbstractTypes [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
fixTM.fixEnv [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
fixTM.listDestructLength [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
fixValid [in Complexity.NP.SAT.CookLevin.Subproblems.CC]
FixX [in Undecidability.L.Prelim.ARS]
fixX [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
fixX [in Complexity.NP.SAT.SAT_inNP]
fixX [in Complexity.NP.L.LMGenNP]
fixX [in Complexity.Libs.UniformHomomorphisms]
fixX [in Complexity.Libs.CookPrelim.PolyBounds]
fixX [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
fixX [in Complexity.NP.SAT.CookLevin.Reductions.FlatTCC_to_FlatCC]
fixX [in Complexity.NP.SAT.CookLevin.Subproblems.CC]
fixXEq [in Complexity.Libs.CookPrelim.PolyBounds]
fixXrepEl [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
fixXY [in Complexity.Libs.CookPrelim.PolyBounds]
Fix_XY [in Undecidability.L.Datatypes.LProd]
fix_optReturn [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
fix_option_map [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
Fix_X [in Undecidability.L.Datatypes.List.List_basics]
Fix_X [in Undecidability.L.Datatypes.LOptions]
fix_X [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
Fix_XY [in Undecidability.L.Datatypes.LSum]
Fix_X [in Undecidability.Shared.Libs.PSL.Lists.Position]
Fix_X [in Undecidability.L.Datatypes.List.List_nat]
Fix_Sig.InitTape [in Undecidability.TM.Code.CodeTM]
Fix_Sig.Encodes_Ext [in Undecidability.TM.Code.CodeTM]
Fix_Sig.Tape_Contains [in Undecidability.TM.Code.CodeTM]
Fix_Sig [in Undecidability.TM.Code.CodeTM]
fix_sig.reg_tapes [in Undecidability.L.TM.TapeFuns]
fix_sig [in Undecidability.L.TM.TapeFuns]
Fix_Alphabet [in Undecidability.TM.TM]
Fix_Sigma [in Undecidability.TM.TM]
Fix_X [in Undecidability.L.Datatypes.List.List_eqb]
Fix_X2 [in Undecidability.TM.Util.Relations]
fix_X [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
fix_sig [in Undecidability.L.TM.TMEncoding]
Fix_X [in Undecidability.L.Datatypes.List.List_enc]
Fix_Sigma [in Undecidability.TM.Util.TM_facts]
flat_map [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
foldl_time [in Undecidability.L.Datatypes.List.List_fold]
foldr_time [in Undecidability.L.Datatypes.List.List_fold]
forallb [in Undecidability.L.Datatypes.List.List_fold]
forall_equiv [in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
fp_quotient [in Undecidability.Shared.Libs.DLW.Utils.fin_quotient]
funTable [in Undecidability.L.Functions.FinTypeLookup]
fun2vec [in Undecidability.Shared.Libs.DLW.Vec.vec]

G

gcd_lcm [in Undecidability.Shared.Libs.DLW.Utils.gcd]
GenNP [in Complexity.NP.L.GenNP]
Godel_beta [in Undecidability.Shared.Libs.DLW.Utils.crt]
Graph [in Undecidability.TM.Univ.LowLevel]

H

HeapMachine [in Complexity.L.AbstractMachines.FunctionalDefinitions]
hoas [in Undecidability.L.Functions.Eval]
hoas [in Undecidability.L.Computability.Por]

I

Id [in Undecidability.TM.Combinators.Combinators]
If [in Undecidability.TM.Combinators.If]
incl [in Undecidability.Shared.Libs.DLW.Utils.php]
Inclusion [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
Inclusion [in Undecidability.Shared.ListAutomation]
Inf [in Undecidability.Synthetic.Infinite]
Informative_Chinese_Remainder_theorems.Binary [in Undecidability.Shared.Libs.DLW.Utils.crt]
Informative_Chinese_Remainder_theorems [in Undecidability.Shared.Libs.DLW.Utils.crt]
Inf.Gen [in Undecidability.Synthetic.Infinite]
InitUniv [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
InjectSurject [in Undecidability.TM.Lifting.LiftAlphabet]
InjectTape [in Undecidability.TM.Lifting.LiftAlphabet]
int [in Undecidability.L.Datatypes.LOptions]
int [in Undecidability.L.Datatypes.LSum]
int [in Complexity.L.TM.CompCode]
int [in Complexity.L.TM.CompCode]
int [in Complexity.L.TM.CompCode]
int [in Complexity.L.TM.CompCode]
int [in Complexity.L.TM.CompCode]
int [in Undecidability.L.Datatypes.List.List_eqb]
interval [in Undecidability.Shared.Libs.DLW.Utils.interval]
In_nth [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
In_Dec [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
In_t [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
isVoid [in Undecidability.TM.Code.CodeTM]
iter [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
Iteration [in Undecidability.Shared.Libs.PSL.Numbers]
it_i [in Undecidability.L.Tactics.Extract]

J

Join [in Undecidability.Shared.Libs.PSL.Retracts]

L

lb_mask_nat [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
lb_complement [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
lb_pointwise [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
lemma [in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
lemmas_for_LMGenNP_to_TMGenNP_mTM [in Complexity.NP.TM.M_multi2mono]
Lenght [in Undecidability.TM.Code.List.Length]
length [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
Length_steps_nice [in Complexity.TM.PrettyBounds.BaseCode]
Length_steps_nice [in Undecidability.TM.Code.List.Length]
Length_size_nice [in Complexity.TM.PrettyBounds.BaseCodeSpace]
le_lt_pirr [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
LiftAlphabet [in Undecidability.TM.Lifting.LiftAlphabet]
Lifting [in Undecidability.TM.Hoare.HoareRegister]
LiftNM [in Undecidability.TM.Lifting.LiftTapes]
LiftTapes_Rel [in Undecidability.TM.Lifting.LiftTapes]
lift_sigma_tau [in Undecidability.TM.Lifting.LiftAlphabet]
Lin [in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
linker [in Undecidability.Shared.Libs.DLW.Code.compiler]
linker.comp [in Undecidability.Shared.Libs.DLW.Code.compiler]
linker.linker_in_code [in Undecidability.Shared.Libs.DLW.Code.compiler]
ListStuff [in Undecidability.TM.Code.List.App]
list_discrim [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
list_dec [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
list_first_dec [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
list_assoc [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
list_in_map [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
list_injective [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
list_an [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
list_discr_vec [in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
list_bool_succ_rect [in Undecidability.Shared.Libs.DLW.Utils.list_bool]
list_bool_next [in Undecidability.Shared.Libs.DLW.Utils.list_bool]
list_bool_succ_props [in Undecidability.Shared.Libs.DLW.Utils.list_bool]
list_eqb [in Undecidability.L.Datatypes.List.List_eqb]
list_choose_dep [in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
list_choose_d [in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
list_in_time [in Undecidability.L.Datatypes.List.List_in]
list_in [in Undecidability.L.Datatypes.List.List_in]
LMGenNP_to_TMGenNP_mTM [in Complexity.NP.TM.mTM_to_singleTapeTM]
LMtoTM.sec [in Complexity.NP.TM.M_LM2TM]
LM_Lookup_nice.heap_global_greatest_address_Bound [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
Lookup [in Undecidability.L.Functions.FinTypeLookup]
Lookup [in Undecidability.TM.L.HeapInterpreter.LookupTM]
LookupAssociativeList [in Undecidability.TM.Univ.LookupAssociativeListTM]
Lookup_size_nice [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
Loop [in Undecidability.TM.Util.Prelim]
LoopLift [in Undecidability.TM.Util.Prelim]
loopM [in Undecidability.L.TM.TMinL]
loopM [in Undecidability.L.TM.TMinL.TMinL_extract]
LoopMerge [in Undecidability.TM.Util.Prelim]
loopSum [in Undecidability.L.Functions.LoopSum]
loop_map [in Undecidability.TM.Lifting.LiftTapes]
L_list_def [in Undecidability.Synthetic.ListEnumerabilityFacts]
L_enum_rec [in Undecidability.L.Computability.Synthetic]

M

main [in Undecidability.TM.L.CompilerBoolFuns.Compiler]
MakeSingleTape [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
MakeSingleTape_Bounded_by_sizeOfmTapes [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
map [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
Map [in Undecidability.TM.Util.Prelim]
MapCode [in Undecidability.TM.Code.ChangeAlphabet]
MapTape [in Undecidability.TM.Util.TM_facts]
map_vec_pos_equiv [in Undecidability.Shared.Libs.DLW.Vec.vec]
MatchTapes [in Undecidability.TM.Util.TM_facts]
max_list_map [in Undecidability.TM.PrettyBounds.MaxList]
measure_double_rect.measure_double_rect [in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
measure_double_rect.measure_double_rect_paired [in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
measure_double_rect [in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
measure_rect [in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
measure_rect_123.measure_rect3 [in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
measure_rect_123.measure_rect2 [in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
measure_rect_123.measure_rect [in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
measure_rect_123 [in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
Membership [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
Mirror [in Undecidability.TM.Combinators.Mirror]
MirrorTape [in Undecidability.TM.Util.TM_facts]
Mk_Mono [in Undecidability.TM.Basic.Mono]
mk_init [in Undecidability.TM.L.CompilerBoolFuns.Compiler]
mk_init_one [in Undecidability.TM.L.CompilerBoolFuns.Compiler]
MK_isVoid [in Undecidability.TM.L.CompilerBoolFuns.Compiler]
Mono_Nop [in Undecidability.TM.Basic.Null]
MoreDominationLemmas [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
MoreSums [in Undecidability.Shared.Libs.PSL.Retracts]
Move [in Undecidability.TM.Code.Copy]
MovePar [in Undecidability.TM.Compound.Multi]
MoveToSymbol [in Undecidability.TM.Compound.MoveToSymbol]
MoveToSymbol_Sem [in Undecidability.TM.Compound.MoveToSymbol]
MoveValue [in Undecidability.TM.Code.Copy]
msum [in Undecidability.Shared.Libs.DLW.Utils.sums]
msum_morphism [in Undecidability.Shared.Libs.DLW.Utils.sums]
mTM [in Complexity.NP.TM.TMGenNP_fixed_mTM]
MultiToMono.multiToMono [in Complexity.NP.TM.M_multi2mono]
MuRecursor [in Undecidability.L.Computability.MuRec]
MuRecursor.hoas [in Undecidability.L.Computability.MuRec]
M.M [in Complexity.NP.TM.LM_to_mTM]
M2M_Retract [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]

N

nat_meet_digits.binary_le_meet_sum_powers [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
nat_meet_digits.double_sum_powers_ortho [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
nat_meet_digits.nat_meet_powers_neq [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
nat_meet_digits [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
nat_meet_power2_neq [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
nat_lb_def [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
nat_swap [in Undecidability.Shared.Libs.DLW.Utils.sorting]
nat_minimize.nat_min [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
nat_minimize [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
nat_rev_bounded_ind [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
nat_sorted [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
new [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
Newton_nat [in Undecidability.Shared.Libs.DLW.Utils.sums]
Nop [in Undecidability.TM.Compound.Multi]
Nop_Action [in Undecidability.TM.Util.TM_facts]
NP_certificate_fix [in Complexity.Complexity.NP]
Nth' [in Undecidability.TM.Code.List.Nth]
Nth'_nice [in Complexity.TM.PrettyBounds.BaseCode]
Nth'.Legacy [in Undecidability.TM.Code.List.Nth]
N_to_string [in Undecidability.Shared.Libs.DLW.Utils.utils_string]

O

option_eqb [in Undecidability.L.Datatypes.LOptions]
OtherWhileRel [in Undecidability.TM.Combinators.While]

P

Permutation_tools [in Undecidability.Shared.Libs.DLW.Utils.php]
php_fun [in Undecidability.Shared.Libs.DLW.Utils.sorting]
php_upto [in Undecidability.Shared.Libs.DLW.Utils.php]
PHP_rel [in Undecidability.Shared.Libs.DLW.Utils.php]
pigeon_list [in Undecidability.Shared.Libs.DLW.Utils.php]
pos [in Complexity.L.Datatypes.LBinNums]
pos_sub [in Complexity.L.Functions.BinNumsSub]
pos_prod [in Undecidability.Shared.Libs.DLW.Vec.pos]
pos_nat [in Undecidability.Shared.Libs.DLW.Vec.pos]
pos_map [in Undecidability.Shared.Libs.DLW.Vec.pos]
pos_left_right_rect [in Undecidability.Shared.Libs.DLW.Vec.pos]
pos_invert [in Undecidability.Shared.Libs.DLW.Vec.pos]
pos_inv [in Undecidability.Shared.Libs.DLW.Vec.pos]
Power [in Undecidability.Shared.Libs.PSL.Lists.Power]
PowerRep [in Undecidability.Shared.Libs.PSL.Lists.Power]
power_injective [in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
power_decomp_uniq [in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
power_decomp [in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
pow2_bound [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
prefix [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
prefix.prefix_rect [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
prime [in Undecidability.Shared.Libs.DLW.Utils.prime]
prime.prime_rect [in Undecidability.Shared.Libs.DLW.Utils.prime]
Private_UnfoldClos.Fix [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
prodLists_bound [in Complexity.Libs.CookPrelim.PolyBounds]
Properties [in Undecidability.Synthetic.InformativeReducibilityFacts]
Properties [in Undecidability.Synthetic.ReducibilityFacts]
putFirst [in Complexity.NP.TM.M_multi2mono]
putFirst.printFin [in Complexity.NP.TM.M_multi2mono]

R

ReadChar [in Undecidability.TM.Basic.Mono]
ReadChar [in Undecidability.TM.Compound.Multi]
ReadChar2 [in Undecidability.TM.Basic.Duo]
RegSpec [in Undecidability.TM.Hoare.HoareRegister]
reg_tapes [in Undecidability.L.TM.TMEncoding]
Relabel [in Undecidability.TM.Combinators.Combinators]
rel_iter_seq [in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
rel_iter_bound [in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
rel_iter [in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
rem [in Undecidability.Shared.Libs.DLW.Utils.gcd]
Removal [in Undecidability.Shared.Libs.PSL.Lists.Removal]
remove [in Complexity.Libs.CookPrelim.MorePrelim]
rem_2 [in Undecidability.Shared.Libs.DLW.Utils.gcd]
rep [in Complexity.Libs.Pigeonhole]
repEl_fixX [in Complexity.Libs.CookPrelim.MorePrelim]
Retract [in Undecidability.Shared.Libs.PSL.Retracts]
Retract_Properties [in Undecidability.Shared.Libs.PSL.Retracts]
Return [in Undecidability.TM.Combinators.Combinators]
Rev [in Undecidability.TM.Code.List.Rev]
rincl_fin [in Undecidability.Shared.Libs.DLW.Wf.wf_incl]

S

Semantics [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
Semantics [in Undecidability.TM.Util.TM_facts]
Semantics.Canonical_Termination [in Undecidability.TM.Util.TM_facts]
Semantics.Canonical_Correctness [in Undecidability.TM.Util.TM_facts]
sequence_of_coprimes [in Undecidability.Shared.Libs.DLW.Utils.crt]
seteq [in Undecidability.Shared.Libs.DLW.Utils.seteq]
Shift [in Undecidability.TM.Compound.Shift]
sig [in Complexity.L.Datatypes.LDepPair]
sigList [in Complexity.L.TM.CompCode]
sigList_eqb [in Complexity.L.TM.CompCode]
sigOption_eqb [in Complexity.L.TM.CompCode]
sigPair_eqb [in Complexity.L.TM.CompCode]
sigSum [in Complexity.L.TM.CompCode]
sigSum_eqb [in Complexity.L.TM.CompCode]
sigTape [in Complexity.L.TM.CompCode]
sigTape_eqb [in Complexity.L.TM.CompCode]
sincl [in Undecidability.Shared.Libs.DLW.Wf.wf_incl]
sinc_decidable [in Undecidability.Shared.Libs.DLW.Utils.utils_decidable]
Small_Step_Semantics.sss_loop [in Undecidability.Shared.Libs.DLW.Code.sss]
Small_Step_Semantics.sss_compute_max_ind [in Undecidability.Shared.Libs.DLW.Code.sss]
Small_Step_Semantics.sss_terminates_ind [in Undecidability.Shared.Libs.DLW.Code.sss]
Small_Step_Semantics [in Undecidability.Shared.Libs.DLW.Code.sss]
split_interval [in Undecidability.Shared.Libs.DLW.Utils.sorting]
Star_Pow [in Undecidability.TM.Util.Relations]
StateWhile [in Undecidability.TM.Combinators.StateWhile]
StateWhileInduction [in Undecidability.TM.Combinators.StateWhile]
StateWhile_irrelevant' [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
StateWhile_irrelevant [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
StateWhile.StateWhile_TerminatesIn_coind [in Undecidability.TM.Combinators.StateWhile]
StateWhile.StateWhile_TerminatesIn [in Undecidability.TM.Combinators.StateWhile]
StepMachine [in Undecidability.TM.L.HeapInterpreter.StepTM]
subcode [in Undecidability.Shared.Libs.DLW.Code.subcode]
subsequence [in Complexity.Libs.CookPrelim.MorePrelim]
SubstMachine [in Complexity.L.AbstractMachines.FunctionalDefinitions]
SujectTape [in Undecidability.TM.Lifting.LiftAlphabet]
sum_eqb [in Undecidability.L.Datatypes.LSum]
sum_bijection [in Undecidability.Shared.Libs.DLW.Utils.sorting]
sum_bounded_permutation [in Undecidability.Shared.Libs.DLW.Utils.sorting]
Sum_bounded_by_max [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
SurjectInject [in Undecidability.TM.Code.ChangeAlphabet]
Switch [in Undecidability.TM.Combinators.Switch]

T

tabulate [in Complexity.Libs.CookPrelim.MorePrelim]
tabulate_vec [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
Tape_Local [in Undecidability.TM.Util.TM_facts]
test [in Undecidability.TM.Compound.TMTac]
test [in Undecidability.Shared.Libs.DLW.Utils.focus]
Test_def [in Undecidability.TM.Util.TM_facts]
TimeHierarchy [in Complexity.HierarchyTheorem.TimeHierarchyTheorem]
TimeHierarchy_Parametric [in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
TM_single [in Complexity.NP.SAT.CookLevin.Subproblems.TM_single]
ToSingleTape [in Undecidability.TM.Single.StepTM]
ToSingleTape_bounds [in Complexity.TM.PrettyBounds.M2MBounds]
ToSingleTape.DoActions [in Undecidability.TM.Single.StepTM]
ToSingleTape.GoToCurrent [in Undecidability.TM.Single.StepTM]
ToSingleTape.GoToNext [in Undecidability.TM.Single.StepTM]
ToSingleTape.Loop [in Undecidability.TM.Single.StepTM]
ToSingleTape.MoveToStart [in Undecidability.TM.Single.StepTM]
ToSingleTape.ReadCurrentSymbols [in Undecidability.TM.Single.StepTM]
ToSingleTape.Step [in Undecidability.TM.Single.StepTM]
TraceArgument [in Complexity.Complexity.SpaceBoundsTime]
Translate [in Undecidability.TM.Code.Copy]
TranslateAct [in Undecidability.TM.Lifting.LiftAlphabet]
TrueOrDiverge.sec [in Complexity.NP.TM.LM_to_mTM]

U

U [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
uiter [in Undecidability.L.Functions.UnboundIteration]
Undup [in Undecidability.Shared.Libs.PSL.Lists.Dupfree]
UnfoldClos.Fix [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
UnfoldPro [in Complexity.L.AbstractMachines.UnfoldHeap]
Univ [in Undecidability.TM.Univ.LowLevel]
Univ [in Undecidability.TM.Univ.Univ]
UnivMultiTimeSpaceTheorem [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
Univ_nice [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
Univ_nice.Univ_nice [in Complexity.TM.PrettyBounds.UnivBounds]
Univ_nice.LookupAssociativeList_nice [in Complexity.TM.PrettyBounds.UnivBounds]
Univ.LegacyLemmas [in Undecidability.TM.Univ.Univ]
uptoc_mixed.uptoc_mixed.fixXeq [in Complexity.L.ComparisonTimeBoundDerivation]
uptoc_mixed.uptoc_mixed [in Complexity.L.ComparisonTimeBoundDerivation]
uptoc_pure.uptoc_pure.fixXeq [in Complexity.L.ComparisonTimeBoundDerivation]
uptoc_pure.uptoc_pure [in Complexity.L.ComparisonTimeBoundDerivation]
Usefull_Retracts.Retract_sum [in Undecidability.Shared.Libs.PSL.Retracts]
Usefull_Retracts [in Undecidability.Shared.Libs.PSL.Retracts]

V

Vcons [in Complexity.NP.TM.LM_to_mTM]
vector [in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_map_list [in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_nat_induction [in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_plus [in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_map2 [in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_map.vec_map_def [in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_map [in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_app_split [in Undecidability.Shared.Libs.DLW.Vec.vec]

W

wf_chains [in Undecidability.Shared.Libs.DLW.Wf.wf_chains]
wf_strict_order_finite [in Undecidability.Shared.Libs.DLW.Wf.wf_finite]
wf_strict_order_list [in Undecidability.Shared.Libs.DLW.Wf.wf_finite]
While [in Undecidability.TM.Combinators.While]
WhileCoInduction [in Undecidability.TM.Combinators.While]
WhileCoInduction [in Undecidability.TM.Combinators.StateWhile]
WhileInduction [in Undecidability.TM.Combinators.While]
While.While_TerminatesIn_coind [in Undecidability.TM.Combinators.While]
While.While_TerminatesIn [in Undecidability.TM.Combinators.While]
workaround [in Undecidability.L.Complexity.UpToCNary]
WriteValue [in Undecidability.TM.Code.WriteValue]
WriteValue [in Undecidability.TM.Code.WriteValue]
Write_String [in Undecidability.TM.Compound.WriteString]

---

Instance Index

A

ACom_inhab [in Undecidability.TM.L.Alphabets]
ACom_finType [in Undecidability.TM.L.Alphabets]
ACom_eq_dec [in Undecidability.TM.L.Alphabets]
add_le_mono [in Undecidability.TM.Util.ArithPrelim]
add_lt_lt [in Complexity.Libs.CookPrelim.PolyBounds]
add_lt_lt [in Complexity.Complexity.UpToCPoly]
and_dec [in Undecidability.Shared.Libs.PSL.EqDec]
and_dec [in Undecidability.Shared.Dec]
app_equi_proper [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
app_incl_proper [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
app_equi_proper [in Undecidability.Shared.ListAutomation]
app_incl_proper [in Undecidability.Shared.ListAutomation]

B

BoollistToEnc.retr__bool [in Undecidability.TM.L.Transcode.Boollist_to_Enc]
BoollistToEnc.retr__nat [in Undecidability.TM.L.Transcode.Boollist_to_Enc]
boollist_enum.term_boollist_term [in Complexity.NP.L.CanEnumTerm]
Boollist2encBoolsTM.retr_bool [in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
bool_eq_dec [in Undecidability.Shared.Libs.PSL.EqDec]
bool_dec [in Undecidability.Shared.Libs.PSL.EqDec]
bool_eq_dec [in Undecidability.Shared.Dec]
bool_enc [in Undecidability.L.Functions.Encoding]
boundary_fin [in Undecidability.TM.Code.CodeTM]
boundary_eq [in Undecidability.TM.Code.CodeTM]
bound_dec [in Undecidability.L.Util.L_facts]

C

card_equi_proper [in Undecidability.Shared.Libs.PSL.Lists.Cardinality]
closed_dec [in Undecidability.L.Util.L_facts]
comparison_inhabited [in Undecidability.TM.Code.BinNumbers.PosCompareTM]
comparison_finC [in Undecidability.TM.Code.BinNumbers.PosCompareTM]
comparison_eq_dec [in Undecidability.TM.Code.BinNumbers.PosCompareTM]
ComposeRetract [in Undecidability.Shared.Libs.PSL.Retracts]
cons_equi_proper [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
cons_incl_proper [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
cons_equi_proper [in Undecidability.Shared.ListAutomation]
cons_incl_proper [in Undecidability.Shared.ListAutomation]
converges_proper [in Undecidability.L.Util.L_facts]
CPow'_App_properR [in Undecidability.L.Tactics.LClos]

D

decode_tape [in Complexity.L.TM.TapeDecode]
decode_unit [in Undecidability.L.Functions.Decoding]
decode_bool [in Undecidability.L.Functions.Decoding]
decode_option [in Undecidability.L.Functions.Decoding]
decode_sum [in Undecidability.L.Functions.Decoding]
decode_prod [in Undecidability.L.Functions.Decoding]
decode_list [in Undecidability.L.Functions.Decoding]
decode_term [in Undecidability.L.Functions.Decoding]
decode_nat [in Undecidability.L.Functions.Decoding]
dec_ex_fin [in Undecidability.TM.Hoare.HoareRegister]
delim_finTypeC [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
delim_eqTypeC [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
dominatedWith_leq_Proper [in Complexity.TM.PrettyBounds.PrettyBounds]

E

ecl_Equivalence [in Undecidability.L.Prelim.ARS]
el_dec [in Undecidability.Synthetic.Infinite]
Empty_set_eq_dec [in Undecidability.Shared.Libs.PSL.EqDec]
Empty_set_eq_dec [in Undecidability.Shared.Dec]
encBoolsTM2boollist.retr_bool [in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
encInj_prod_enc [in Undecidability.L.Datatypes.LProd]
encInj_option_enc [in Undecidability.L.Datatypes.LOptions]
encInj_sum_enc [in Undecidability.L.Datatypes.LSum]
encInj_tape_enc [in Undecidability.L.TM.TMEncoding]
encInj_list_enc [in Undecidability.L.Datatypes.List.List_enc]
encodable_sig [in Complexity.L.Datatypes.LDepPair]
encodable_mk_mconfig [in Undecidability.L.TM.TMEncoding]
encodable_mconfig [in Undecidability.L.TM.TMEncoding]
Encode_N [in Undecidability.TM.Code.BinNumbers.EncodeBinNumbers]
Encode_positive [in Undecidability.TM.Code.BinNumbers.EncodeBinNumbers]
Encode_graph [in Undecidability.TM.Univ.LowLevel]
Encode_action [in Undecidability.TM.Univ.LowLevel]
Encode_optSigM [in Undecidability.TM.Univ.LowLevel]
Encode_Heap [in Undecidability.TM.L.Alphabets]
Encode_HEntr [in Undecidability.TM.L.Alphabets]
Encode_HEntr' [in Undecidability.TM.L.Alphabets]
Encode_HClos [in Undecidability.TM.L.Alphabets]
Encode_Prog [in Undecidability.TM.L.Alphabets]
Encode_Com [in Undecidability.TM.L.Alphabets]
Encode_ACom [in Undecidability.TM.L.Alphabets]
Encode_nat [in Undecidability.TM.Code.Code]
Encode_list [in Undecidability.TM.Code.Code]
Encode_option [in Undecidability.TM.Code.Code]
Encode_pair [in Undecidability.TM.Code.Code]
Encode_sum [in Undecidability.TM.Code.Code]
Encode_Finite [in Undecidability.TM.Code.Code]
Encode_Fin [in Undecidability.TM.Code.Code]
Encode_bool [in Undecidability.TM.Code.Code]
Encode_unit [in Undecidability.TM.Code.Code]
Encode_tapes [in Undecidability.TM.Single.EncodeTapes]
Encode_tape [in Undecidability.TM.Single.EncodeTapes]
EncToBoollist.retr__bool [in Undecidability.TM.L.Transcode.Enc_to_Boollist]
EncToBoollist.retr__nat [in Undecidability.TM.L.Transcode.Enc_to_Boollist]
Entails_PO [in Undecidability.TM.Hoare.HoareLogic]
enumerator__T_of_list [in Undecidability.Synthetic.ListEnumerabilityFacts]
enumerator__T_to_list [in Undecidability.Synthetic.ListEnumerabilityFacts]
eqbBool_inst [in Undecidability.L.Functions.EqBool]
eqbBoundary [in Complexity.L.TM.CompCode]
eqbComp_Prod [in Undecidability.L.Datatypes.LProd]
eqbComp_inp [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
eqbComp_Option [in Undecidability.L.Datatypes.LOptions]
eqbComp_sum [in Undecidability.L.Datatypes.LSum]
eqbComp_sigTape [in Complexity.L.TM.CompCode]
eqbComp_sigSum [in Complexity.L.TM.CompCode]
eqbComp_sigOption [in Complexity.L.TM.CompCode]
eqbComp_sigPair [in Complexity.L.TM.CompCode]
eqbComp_ACom [in Complexity.L.TM.CompCode]
eqbComp_sigNat [in Complexity.L.TM.CompCode]
eqbComp_sigList [in Complexity.L.TM.CompCode]
eqbComp_boundary [in Complexity.L.TM.CompCode]
eqbComp_List [in Undecidability.L.Datatypes.LVector]
eqbComp_bool [in Undecidability.L.Functions.EqBool]
eqbComp_List [in Undecidability.L.Datatypes.List.List_eqb]
eqbComp_bool [in Undecidability.L.TM.TMEncoding]
eqbComp_nat [in Undecidability.L.Datatypes.LNat]
eqbComp_nat [in Undecidability.L.Functions.Equality]
eqbFinType [in Undecidability.L.Datatypes.LFinType]
eqbFinType_inst [in Undecidability.L.Datatypes.LFinType]
eqbList [in Undecidability.L.Datatypes.List.List_eqb]
eqbNat_inst [in Undecidability.L.Datatypes.LNat]
eqBool_inp_eqb [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
eqbOption [in Undecidability.L.Datatypes.LOptions]
eqbProd [in Undecidability.L.Datatypes.LProd]
eqbSigList [in Complexity.L.TM.CompCode]
eqbSigNat [in Complexity.L.TM.CompCode]
eqbSigPair [in Complexity.L.TM.CompCode]
eqbSigTape [in Complexity.L.TM.CompCode]
eqbSum [in Undecidability.L.Datatypes.LSum]
eqbTerm [in Undecidability.L.Functions.Equality]
eqbVector [in Undecidability.L.Datatypes.LVector]
eqb_sigSum [in Complexity.L.TM.CompCode]
eqb_sigOption [in Complexity.L.TM.CompCode]
eqb_ACom [in Complexity.L.TM.CompCode]
eqb_move [in Undecidability.L.TM.TMEncoding]
eqrel_eq [in Undecidability.TM.Util.Relations]
eqrel_pre [in Undecidability.TM.Util.Relations]
eqType_depPair [in Undecidability.Shared.Libs.PSL.FiniteTypes.DepPairs]
equiv_eval_proper [in Undecidability.L.Util.L_facts]
equiv_app_proper [in Undecidability.L.Util.L_facts]
equiv_Equivalence [in Undecidability.L.Util.L_facts]
equi_Equivalence [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
equi_Equivalence [in Undecidability.Shared.ListAutomation]
eq_leUpToC_subrelation [in Undecidability.L.Complexity.UpToC]
Eq_in_equivalence [in Undecidability.TM.Util.Relations]
evalForTimeBool__comp [in Complexity.L.AbstractMachines.Computable.EvalForTimeBool]
evalForTime_comp [in Complexity.L.AbstractMachines.Computable.EvalForTime]
evalIn_eval_subrelation [in Undecidability.L.Util.L_facts]
evalIn_evalLe_subrelation [in Undecidability.L.Util.L_facts]
evalLe_redLe_subrelation [in Undecidability.L.Util.L_facts]
evalLe_eval_subrelation [in Undecidability.L.Util.L_facts]
EvalL.retr_heap [in Undecidability.TM.L.Eval]
EvalL.retr_nat_clos_ad [in Undecidability.TM.L.Eval]
EvalL.retr_nat_clos_ad' [in Undecidability.TM.L.Eval]
EvalL.retr_pro_intrp [in Undecidability.TM.L.Eval]
EvalL.retr_clos_intrp [in Undecidability.TM.L.Eval]
EvalL.retr_closs_intrp [in Undecidability.TM.L.Eval]
eval_star_subrelation [in Undecidability.L.Util.L_facts]
explicit_bounds.term_sat_verifierb [in Complexity.L.ComparisonTimeBoundDerivation]
explicit_bounds.term_evalCnf [in Complexity.L.ComparisonTimeBoundDerivation]
explicit_bounds.term_evalClause [in Complexity.L.ComparisonTimeBoundDerivation]
explicit_bounds.term_forallb [in Complexity.L.ComparisonTimeBoundDerivation]
explicit_bounds.term_existsb [in Complexity.L.ComparisonTimeBoundDerivation]
explicit_bounds.term_evalLiteral [in Complexity.L.ComparisonTimeBoundDerivation]
explicit_bounds.term_evalVar [in Complexity.L.ComparisonTimeBoundDerivation]
explicit_bounds.term_list_in_decb [in Complexity.L.ComparisonTimeBoundDerivation]
extApp' [in Undecidability.L.Tactics.Computable]
extended_PO [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
extended_PO [in Complexity.L.AbstractMachines.AbstractHeapMachine]
extEq_refl [in Undecidability.L.Tactics.Computable]
extTApp' [in Undecidability.L.Tactics.ComputableTime]

F

False_eq_dec [in Undecidability.Shared.Libs.PSL.EqDec]
False_dec [in Undecidability.Shared.Libs.PSL.EqDec]
False_eq_dec [in Undecidability.Shared.Dec]
False_dec [in Undecidability.Shared.Dec]
finTypeC_Prod [in Undecidability.Shared.Libs.PSL.FiniteTypes.VectorFin]
finTypeC_False [in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicFinTypes]
finTypeC_True [in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicFinTypes]
finTypeC_unit [in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicFinTypes]
finTypeC_bool [in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicFinTypes]
finTypeC_Empty_set [in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicFinTypes]
finTypeC_sum [in Undecidability.Shared.Libs.PSL.FiniteTypes.CompoundFinTypes]
finTypeC_Option [in Undecidability.Shared.Libs.PSL.FiniteTypes.CompoundFinTypes]
finTypeC_Prod [in Undecidability.Shared.Libs.PSL.FiniteTypes.CompoundFinTypes]
finType_exists_dec [in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
finType_forall_dec [in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
finType_depPair [in Undecidability.Shared.Libs.PSL.FiniteTypes.DepPairs]
Fin_eq_dec [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
Fin_finTypeC [in Undecidability.Shared.Libs.PSL.FiniteTypes.VectorFin]
Fin_eq_dec [in Undecidability.Shared.Libs.PSL.FiniteTypes.Arbitrary]
fold_right_and' [in Undecidability.TM.Hoare.HoareRegister]
fold_right_and [in Undecidability.TM.Hoare.HoareRegister]
fold_right_iff [in Undecidability.TM.Hoare.HoareRegister]
fold_right_impl' [in Undecidability.TM.Hoare.HoareRegister]
Forall2_refl [in Undecidability.TM.Hoare.HoareRegister]
fromListC [in Undecidability.Shared.Libs.PSL.FiniteTypes.Arbitrary]

H

halt_state_dec [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]

I

iff_dec [in Undecidability.Shared.Libs.PSL.EqDec]
iff_dec [in Undecidability.Shared.Dec]
impl_dec [in Undecidability.Shared.Libs.PSL.EqDec]
impl_dec [in Undecidability.Shared.Dec]
incl_equi_proper [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
incl_preorder [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
incl_equi_proper [in Undecidability.Shared.ListAutomation]
incl_preorder [in Undecidability.Shared.ListAutomation]
inf_to_enumerator [in Undecidability.Synthetic.ListEnumerabilityFacts]
inhabited_arrow_prod [in Undecidability.Shared.Libs.PSL.Inhabited]
inhabited_arrow_sum [in Undecidability.Shared.Libs.PSL.Inhabited]
inhabited_arrow_empty [in Undecidability.Shared.Libs.PSL.Inhabited]
inhabited_arrow [in Undecidability.Shared.Libs.PSL.Inhabited]
inhabited_prod [in Undecidability.Shared.Libs.PSL.Inhabited]
inhabited_nat [in Undecidability.Shared.Libs.PSL.Inhabited]
inhabited_fin [in Undecidability.Shared.Libs.PSL.Inhabited]
inhabited_vector [in Undecidability.Shared.Libs.PSL.Inhabited]
inhabited_list [in Undecidability.Shared.Libs.PSL.Inhabited]
inhabited_bool [in Undecidability.Shared.Libs.PSL.Inhabited]
inhabited_option [in Undecidability.Shared.Libs.PSL.Inhabited]
inhabited_inr [in Undecidability.Shared.Libs.PSL.Inhabited]
inhabited_inl [in Undecidability.Shared.Libs.PSL.Inhabited]
inhabited_True [in Undecidability.Shared.Libs.PSL.Inhabited]
inhabited_unit [in Undecidability.Shared.Libs.PSL.Inhabited]
inhabited_TM_Q [in Undecidability.TM.Util.TM_facts]
inhabited_move [in Undecidability.TM.Util.TM_facts]
inOPoly_pointwise_eq [in Complexity.Complexity.ONotation]
inOPoly_pointwise_leq [in Complexity.Complexity.ONotation]
inO_inOPoly_trans [in Complexity.Complexity.ONotation]
inO_pointwise_eq [in Complexity.Complexity.ONotation]
inO_pointwise_leq [in Complexity.Complexity.ONotation]
inO_PreOrder [in Complexity.Complexity.ONotation]
In_dec [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
in_equi_proper [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
in_incl_proper [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
in_equi_proper [in Undecidability.Shared.ListAutomation]
in_incl_proper [in Undecidability.Shared.ListAutomation]
I_x' [in Undecidability.TM.Code.ChangeAlphabet]

L

lambda_dec [in Undecidability.L.Util.L_facts]
Leftmost.pow_step_lm_congR [in Undecidability.L.Complexity.ResourceMeasures]
Leftmost.pow_step_lm_congL [in Undecidability.L.Complexity.ResourceMeasures]
Leftmost.step_lm_step [in Undecidability.L.Complexity.ResourceMeasures]
leUpToC_proper_eq_flip [in Undecidability.L.Complexity.UpToC]
leUpToC_proper_eq [in Undecidability.L.Complexity.UpToC]
leUpToC_preorder [in Undecidability.L.Complexity.UpToC]
le_evalLe_proper [in Undecidability.L.Util.L_facts]
le_redLe_proper [in Undecidability.L.Util.L_facts]
le_preorder [in Undecidability.L.Prelim.MoreBase]
le_leUpToC_subrelation [in Undecidability.L.Complexity.UpToC]
le_lt_impl [in Complexity.Libs.CookPrelim.PolyBounds]
le_lt_impl [in Complexity.Complexity.UpToCPoly]
linDec_sum [in Complexity.Complexity.LinTimeDecodable]
linDec_prod [in Complexity.Complexity.LinTimeDecodable]
linDec_term [in Complexity.Complexity.LinTimeDecodable]
linDec_unit [in Complexity.Complexity.LinTimeDecodable]
linDec_tape [in Complexity.L.TM.TapeDecode]
linDec_nat [in Undecidability.L.Complexity.LinDecode.LTDnat]
linDec_list [in Undecidability.L.Complexity.LinDecode.LTDlist]
linDec_bool [in Undecidability.L.Complexity.LinDecode.LTDbool]
list_eq_dec [in Undecidability.Shared.Libs.PSL.EqDec]
list_exists_dec [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
list_forall_dec [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
list_in_dec [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
list_eq_dec [in Undecidability.Shared.Dec]
list_in_dec [in Undecidability.Shared.ListAutomation]
lt_le_impl [in Complexity.Libs.CookPrelim.PolyBounds]
lt_le_impl [in Complexity.Complexity.UpToCPoly]

M

map_ext_proper [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
max_le_mono [in Undecidability.TM.Util.ArithPrelim]
max_list_rec_proper [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
max_le_proper [in Undecidability.L.Prelim.MoreBase]
max'_le_mono [in Undecidability.TM.Util.ArithPrelim]
min_le_proper [in Undecidability.L.Prelim.MoreBase]
monotonic_pointwise_eq [in Complexity.Complexity.Monotonic]
move_finC [in Undecidability.TM.Util.TM_facts]
move_eq_dec [in Undecidability.TM.Util.TM_facts]
mult_le_mono [in Undecidability.TM.Util.ArithPrelim]
mult_le_proper [in Undecidability.L.Prelim.MoreBase]
mult_lt_le [in Complexity.Libs.CookPrelim.PolyBounds]
mult_lt_le [in Complexity.Complexity.UpToCPoly]

N

nat_le_dec [in Undecidability.Shared.Libs.PSL.Numbers]
nat_eq_dec [in Undecidability.Shared.Libs.PSL.EqDec]
Nat_log2_le_Proper [in Undecidability.L.Prelim.MoreBase]
nat_eq_dec [in Undecidability.Shared.Dec]
not_dec [in Undecidability.Shared.Libs.PSL.EqDec]
not_dec [in Undecidability.Shared.Dec]

O

option_eq_dec [in Undecidability.Shared.Libs.PSL.EqDec]
option_eq_dec [in Undecidability.Shared.Dec]
or_dec [in Undecidability.Shared.Libs.PSL.EqDec]
or_dec [in Undecidability.Shared.Dec]

P

plus_le_proper [in Undecidability.L.Prelim.MoreBase]
pointwise_equivalence [in Undecidability.L.Complexity.UpToCNary]
pointwise_transitive [in Undecidability.L.Complexity.UpToCNary]
pointwise_symmetric [in Undecidability.L.Complexity.UpToCNary]
pointwise_reflexive [in Undecidability.L.Complexity.UpToCNary]
polyTimeComputable_proper_eq_flip [in Complexity.Complexity.PolyTimeComputable]
polyTimeComputable_proper_eq [in Complexity.Complexity.PolyTimeComputable]
Pos_add_le_Proper [in Undecidability.L.Prelim.MoreBase]
Pos_to_nat_le_Proper [in Undecidability.L.Prelim.MoreBase]
pow_ecl_subrel [in Undecidability.L.Prelim.ARS]
pow_redLe_subrelation [in Undecidability.L.Util.L_facts]
pow_star_subrelation [in Undecidability.L.Util.L_facts]
pow_step_congR [in Undecidability.L.Util.L_facts]
pow_step_congL [in Undecidability.L.Util.L_facts]
pow_le_proper [in Undecidability.L.Prelim.MoreBase]
pow0_refl [in Undecidability.L.Util.L_facts]
preludeSigP_finTypeC [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
preludeSigP_eqTypeC [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
prod_eq_dec [in Undecidability.Shared.Libs.PSL.EqDec]
prod_eq_dec [in Undecidability.Shared.Dec]
proper_le_pow [in Complexity.Libs.CookPrelim.PolyBounds]
proper_lt_add [in Complexity.Libs.CookPrelim.PolyBounds]
proper_lt_mul [in Complexity.Libs.CookPrelim.PolyBounds]
proper_le_pow [in Complexity.Complexity.UpToCPoly]
proper_lt_add [in Complexity.Complexity.UpToCPoly]
proper_lt_mul [in Complexity.Complexity.UpToCPoly]
Proper_decidable [in Undecidability.Synthetic.DecidabilityFacts]
Proper_decides [in Undecidability.Synthetic.DecidabilityFacts]
Proper_tabulate [in Undecidability.TM.L.CompilerBoolFuns.Compiler]
put_get [in Complexity.L.AbstractMachines.Computable.Shared]

R

redLe_refl [in Undecidability.L.Util.L_facts]
redLe_star_subrelation [in Undecidability.L.Util.L_facts]
reduce_eval_proper [in Undecidability.L.Util.L_facts]
register_unit [in Undecidability.L.Tactics.ComputableDemo]
register_vector [in Undecidability.L.Datatypes.LVector]
regP_bool [in Complexity.Complexity.EncodableP]
regP_option [in Complexity.Complexity.EncodableP]
regP_list [in Complexity.Complexity.EncodableP]
regP_Prod [in Complexity.Complexity.EncodableP]
regP_term [in Complexity.Complexity.EncodableP]
regP_nat [in Complexity.Complexity.EncodableP]
regP_TM [in Complexity.L.TM.TMflatEnc]
regP_move [in Complexity.L.TM.TMflatEnc]
reg_is_extT [in Undecidability.L.Tactics.ComputableTime]
reg_is_ext [in Undecidability.L.Tactics.Computable]
reprC_extend_Proper [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
reprC_extend_Proper [in Complexity.L.AbstractMachines.AbstractHeapMachine]
Retract_sum7 [in Undecidability.Shared.Libs.PSL.Retracts]
Retract_sum6 [in Undecidability.Shared.Libs.PSL.Retracts]
Retract_sum5 [in Undecidability.Shared.Libs.PSL.Retracts]
Retract_sum4 [in Undecidability.Shared.Libs.PSL.Retracts]
Retract_sum3 [in Undecidability.Shared.Libs.PSL.Retracts]
Retract_join [in Undecidability.Shared.Libs.PSL.Retracts]
Retract_sum [in Undecidability.Shared.Libs.PSL.Retracts]
Retract_inr [in Undecidability.Shared.Libs.PSL.Retracts]
Retract_inl [in Undecidability.Shared.Libs.PSL.Retracts]
Retract_option [in Undecidability.Shared.Libs.PSL.Retracts]
Retract_Empty_right [in Undecidability.Shared.Libs.PSL.Retracts]
Retract_Empty_left [in Undecidability.Shared.Libs.PSL.Retracts]
Retract_Empty [in Undecidability.Shared.Libs.PSL.Retracts]
Retract_id [in Undecidability.Shared.Libs.PSL.Retracts]
Retract_sigOption_sigSum [in Undecidability.TM.Code.CaseSum]
Retract_plus [in Undecidability.TM.Code.ChangeAlphabet]
Retract_sigList_X [in Undecidability.TM.Code.Code]
Retract_sigOption_X [in Undecidability.TM.Code.Code]
Retract_sigPair_Y [in Undecidability.TM.Code.Code]
Retract_sigPair_X [in Undecidability.TM.Code.Code]
Retract_sigSum_Y [in Undecidability.TM.Code.Code]
Retract_sigSum_X [in Undecidability.TM.Code.Code]
retr_X_list' [in Undecidability.TM.Code.List.Nth]
retr_X_list' [in Undecidability.TM.Code.List.Length]

S

sigList_fin [in Undecidability.TM.Code.Code]
sigList_dec [in Undecidability.TM.Code.Code]
sigNat_fin [in Undecidability.TM.Code.Code]
sigNat_eq [in Undecidability.TM.Code.Code]
sigOption_fin [in Undecidability.TM.Code.Code]
sigOption_dec [in Undecidability.TM.Code.Code]
sigPair_fin [in Undecidability.TM.Code.Code]
sigPair_dec [in Undecidability.TM.Code.Code]
sigPos_fin [in Undecidability.TM.Code.BinNumbers.EncodeBinNumbers]
sigPos_eq [in Undecidability.TM.Code.BinNumbers.EncodeBinNumbers]
sigSum_fin [in Undecidability.TM.Code.Code]
sigSum_dec [in Undecidability.TM.Code.Code]
sigTape_fin [in Undecidability.TM.Single.EncodeTapes]
sigTape_eq [in Undecidability.TM.Single.EncodeTapes]
star_ecl_subrel [in Undecidability.L.Prelim.ARS]
star_PO [in Undecidability.L.Prelim.ARS]
star_equiv_subrelation [in Undecidability.L.Util.L_facts]
star_closed_proper [in Undecidability.L.Util.L_facts]
star_step_app_proper [in Undecidability.L.Util.L_facts]
star_PreOrder [in Undecidability.L.Util.L_facts]
star_preorder [in Undecidability.TM.Util.Relations]
step_equiv_subrelation [in Undecidability.L.Util.L_facts]
step_star_subrelation [in Undecidability.L.Util.L_facts]
subtermPO [in Complexity.L.AbstractMachines.AbstractHeapMachine]
subType_eq_dec [in Undecidability.Shared.Libs.PSL.FiniteTypes.Arbitrary]
sub_le_mono [in Complexity.TM.PrettyBounds.M2MBounds]
sum_eq_dec [in Undecidability.Shared.Libs.PSL.EqDec]
sum_eq_dec [in Undecidability.Shared.Dec]
S_le_mono [in Undecidability.TM.Util.ArithPrelim]
S_le_proper [in Undecidability.L.Prelim.MoreBase]

T

termT_init__evalForTime [in Complexity.L.AbstractMachines.Computable.EvalForTime]
termT_evalForTime__step [in Complexity.L.AbstractMachines.Computable.EvalForTime]
termT_extractRes [in Complexity.L.AbstractMachines.Computable.EvalForTime]
termT_Pos_succ [in Complexity.L.Datatypes.LBinNums]
termT_N_NPos [in Complexity.L.Datatypes.LBinNums]
termT_Pos_xO [in Complexity.L.Datatypes.LBinNums]
termT_Pos_xI [in Complexity.L.Datatypes.LBinNums]
termT_rev [in Undecidability.L.Datatypes.List.List_basics]
termT_rev_append [in Undecidability.L.Datatypes.List.List_basics]
termT_append [in Undecidability.L.Datatypes.List.List_basics]
termT_proj1_sig [in Complexity.L.Datatypes.LDepPair]
termT_loopSum [in Undecidability.L.Functions.LoopSum]
termT_S [in Complexity.L.AbstractMachines.Computable.Unfolding]
termT_univStep [in Complexity.L.AbstractMachines.Computable.UnivDecTime]
termT_length [in Undecidability.L.Datatypes.List.List_nat]
termT_nth_error [in Undecidability.L.Datatypes.List.List_nat]
termT_compile [in Complexity.L.AbstractMachines.FlatPro.Computable.Compile]
termT_compileTR' [in Complexity.L.AbstractMachines.FlatPro.Computable.Compile]
termT_N_pred [in Complexity.L.Functions.BinNumsSub]
termT_N_sub [in Complexity.L.Functions.BinNumsSub]
termT_Pos_sub [in Complexity.L.Functions.BinNumsSub]
termT_Pos_sub_mask [in Complexity.L.Functions.BinNumsSub]
termT_Pos_sub_maskC [in Complexity.L.Functions.BinNumsSub]
termT_Pos_predN [in Complexity.L.Functions.BinNumsSub]
termT_Pos_pred [in Complexity.L.Functions.BinNumsSub]
termT_Pos_double_pred_mask [in Complexity.L.Functions.BinNumsSub]
termT_Pos_pred_double [in Complexity.L.Functions.BinNumsSub]
termT_Pos_succ_double_mask [in Complexity.L.Functions.BinNumsSub]
termT_Pos_double_mask [in Complexity.L.Functions.BinNumsSub]
termT_isPos [in Complexity.L.Functions.BinNumsSub]
termT_N_eqb [in Complexity.L.Functions.BinNumsCompare]
termT_N_ltb [in Complexity.L.Functions.BinNumsCompare]
termT_N_leb [in Complexity.L.Functions.BinNumsCompare]
termT_N_compare [in Complexity.L.Functions.BinNumsCompare]
termT_Pos_compare_cont [in Complexity.L.Functions.BinNumsCompare]
termT_closedb [in Undecidability.L.Functions.Proc]
termT_cons [in Undecidability.L.Datatypes.List.List_enc]
TermT_init [in Complexity.L.AbstractMachines.Computable.HeapMachine]
termT_S [in Complexity.L.AbstractMachines.Computable.HeapMachine]
termT_modulo [in Undecidability.L.Datatypes.LNat]
termT_divmod [in Undecidability.L.Datatypes.LNat]
termT_pow [in Undecidability.L.Datatypes.LNat]
termT_nat_max [in Undecidability.L.Datatypes.LNat]
termT_nat_min [in Undecidability.L.Datatypes.LNat]
termT_leb [in Undecidability.L.Datatypes.LNat]
termT_mult [in Undecidability.L.Datatypes.LNat]
termT_plus' [in Undecidability.L.Datatypes.LNat]
termT_pred [in Undecidability.L.Datatypes.LNat]
termT_S [in Undecidability.L.Datatypes.LNat]
termT_largestVar [in Complexity.L.AbstractMachines.Computable.LargestVar]
termT_largestVarTR' [in Complexity.L.AbstractMachines.Computable.LargestVar]
termT_max [in Complexity.L.AbstractMachines.Computable.LargestVar]
termT_cons [in Complexity.NP.TM.LM_to_mTM]
termT_size [in Undecidability.L.Functions.Size]
termT_sizeTR' [in Undecidability.L.Functions.Size]
termT_N_add [in Complexity.L.Functions.BinNumsAdd]
termT_Pos_add [in Complexity.L.Functions.BinNumsAdd]
termT_Pos_addC [in Complexity.L.Functions.BinNumsAdd]
term_snd [in Undecidability.L.Datatypes.LProd]
term_fst [in Undecidability.L.Datatypes.LProd]
term_pair [in Undecidability.L.Datatypes.LProd]
term_doesHaltIn [in Undecidability.L.Functions.Eval]
term_eva [in Undecidability.L.Functions.Eval]
term_reduction [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_isValidFlatTM [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_isValidFlatTrans [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_isBoundTransTable [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_isBoundTrans [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_fst_optBound [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_optBound [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_ltb [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_isInjFinfuncTable [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_allSameEntry [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_allSameEntry_step [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_implb [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_reduction_wf [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_flat_finalSubstrings [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_flat_finalSubstrings_step [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_flat_haltingStates [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_isHalting [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_filter [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_nth [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_flat_initial_string [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_flatInr_flatNsig [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_zPflat [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_zflat [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_kflat [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_repEl [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_allFlatCards [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_flatPreludeCards [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_flat_baseEnvPrelude [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_makePreludeCards [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_flatStateCards [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_generateCardsForFlat [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_generateCardsForFlat_step [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_generateCardsForFlatHalt [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_makeHaltFlat [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_generateCardsForFlatNonHalt [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_opt_generateCardsForFlatNonHalt [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_fOpt [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_flat_baseEnvNone [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_flat_baseEnv [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_makeNoneStayFlat [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_makeNoneLeftFlat [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_makeNoneRightFlat [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_makeNone_base_flat [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_makeSomeStayFlat [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_makeSomeLeftFlat [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_makeSomeRightFlat [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_makeSome_base_flat [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_flatTapeCards [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_flatMTLCards [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_flatMTICards [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_flatMTRCards [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_transEnvAddSM [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_transEnvAddS [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_envAddSSigma [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_envAddState [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_makeCardsFlat [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_makeCards' [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_makeCardsP_flat_step [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_filterSome [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_makeAllEvalEnvFlat [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_prodLists [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_tupToEvalEnv [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_mkVarEnv [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_it [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_mkVarEnv_step [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_listProd [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_generateCard [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_generateAlphabetFlat [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_generatePreludeSigPFlat [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_flatNsig [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_generateGammaFlat [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_generateStatesFlat [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_generateTapeSigmaFlat [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_generatePolSigmaFlat [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_optReturn [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_generateStateSigmaFlat [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_option_map [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_generatePolarityFlat [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_flattenPolarity [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_flatAlphabet [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_flatPreludeSig' [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_flatGamma [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_flatStates [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_flatTapeSigma [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_flatPolSigma [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_flatStateSigma [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_stateEnv [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_stateSigmaEnv [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_sigmaEnv [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_polarityEnv [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_Build_evalEnv [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
term_N_succ [in Complexity.L.Datatypes.LBinNums]
term_N_of_nat [in Complexity.L.Datatypes.LBinNums]
term_Pos_of_succ_nat [in Complexity.L.Datatypes.LBinNums]
term_eq_dec [in Undecidability.L.Util.L_facts]
term_encodeListAt [in Complexity.NP.SAT.FSAT.FormulaEncoding]
term_encodeLiteral [in Complexity.NP.SAT.FSAT.FormulaEncoding]
term_tabulate_formula [in Complexity.NP.SAT.FSAT.FormulaEncoding]
term_tabulate_step [in Complexity.NP.SAT.FSAT.FormulaEncoding]
term_listOr [in Complexity.NP.SAT.FSAT.FormulaEncoding]
term_listAnd [in Complexity.NP.SAT.FSAT.FormulaEncoding]
term_t__E [in Complexity.HierarchyTheorem.TimeHierarchyTheorem]
term_concat [in Undecidability.L.Datatypes.List.List_basics]
term_rev_concat [in Undecidability.L.Datatypes.List.List_basics]
term_repeat [in Undecidability.L.Datatypes.List.List_basics]
term_filter_notime [in Undecidability.L.Datatypes.List.List_basics]
term_filter [in Undecidability.L.Datatypes.List.List_basics]
term_map_noTime [in Undecidability.L.Datatypes.List.List_basics]
term_map [in Undecidability.L.Datatypes.List.List_basics]
term_isSome [in Undecidability.L.Datatypes.LOptions]
term_option_eqb [in Undecidability.L.Datatypes.LOptions]
term_Some [in Undecidability.L.Datatypes.LOptions]
term_orb [in Undecidability.L.Datatypes.LBool]
term_andb [in Undecidability.L.Datatypes.LBool]
term_negb [in Undecidability.L.Datatypes.LBool]
term_FlatTCC_steps [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
term_FlatTCC_final [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
term_FlatTCC_cards [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
term_FlatTCC_init [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
term_FlatTCC_Sigma [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
term_Build_FlatTCC [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
term_conc [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
term_prem [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
term_Build_TCCCard [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
term_TCCCardP_to_list [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
term_cardEl3 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
term_cardEl2 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
term_cardEl1 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
term_Build_TCCCardP [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
term_decompile [in Complexity.L.AbstractMachines.FlatPro.Computable.Decompile]
term_TM_enc [in Complexity.L.TM.TMflatEnc]
term_move_enc [in Complexity.L.TM.TMflatEnc]
term_halt [in Complexity.L.TM.TMflatEnc]
term_start [in Complexity.L.TM.TMflatEnc]
term_trans [in Complexity.L.TM.TMflatEnc]
term_states [in Complexity.L.TM.TMflatEnc]
term_tapes [in Complexity.L.TM.TMflatEnc]
term_sig [in Complexity.L.TM.TMflatEnc]
term_Build_TM [in Complexity.L.TM.TMflatEnc]
term_inr [in Undecidability.L.Datatypes.LSum]
term_inl [in Undecidability.L.Datatypes.LSum]
term_kCNF_decb [in Complexity.NP.SAT.kSAT]
term_clause_length_decb [in Complexity.NP.SAT.kSAT]
term_get [in Complexity.L.AbstractMachines.Computable.Shared]
term_heapEntryC [in Complexity.L.AbstractMachines.Computable.Shared]
term_unfoldBool [in Complexity.L.AbstractMachines.Computable.Unfolding]
term_unfoldTailRecStep [in Complexity.L.AbstractMachines.Computable.Unfolding]
term_validate [in Undecidability.TM.L.CompilerBoolFuns.Compiler_nat_facts]
term_alltrue [in Undecidability.TM.L.CompilerBoolFuns.Compiler_nat_facts]
term_idbool [in Undecidability.TM.L.CompilerBoolFuns.Compiler_nat_facts]
term_forallb'' [in Undecidability.TM.L.CompilerBoolFuns.Compiler_nat_facts]
term_forallb' [in Undecidability.TM.L.CompilerBoolFuns.Compiler_nat_facts]
term_list_ofFlatType_dec [in Complexity.Libs.CookPrelim.FlatFinTypes]
term_ofFlatType_dec [in Complexity.Libs.CookPrelim.FlatFinTypes]
term_flatPair [in Complexity.Libs.CookPrelim.FlatFinTypes]
term_id [in Complexity.Libs.CookPrelim.FlatFinTypes]
term_iterupN [in Complexity.L.Functions.IterupN]
term_varT [in Complexity.L.AbstractMachines.FlatPro.Computable.LPro]
term_encode_tape [in Complexity.L.TM.CompCode]
term_UnmarkedSymbol_X [in Complexity.L.TM.CompCode]
term_MarkedSymbol_X [in Complexity.L.TM.CompCode]
term_RightBlank_X [in Complexity.L.TM.CompCode]
term_LeftBlank_X [in Complexity.L.TM.CompCode]
term_sigSum_X [in Complexity.L.TM.CompCode]
term_sigSum_Y [in Complexity.L.TM.CompCode]
term_sigPair_X [in Complexity.L.TM.CompCode]
term_sigPair_Y [in Complexity.L.TM.CompCode]
term_sigList_X [in Complexity.L.TM.CompCode]
term_on0 [in Undecidability.L.Tactics.ComputableDemo]
term_vector_eqb [in Undecidability.L.Datatypes.LVector]
term_map2 [in Undecidability.L.Datatypes.LVector]
term_vector_map [in Undecidability.L.Datatypes.LVector]
term_to_list [in Undecidability.L.Datatypes.LVector]
term_substT [in Undecidability.L.Functions.Subst]
term_BinaryCC_steps [in Complexity.NP.SAT.CookLevin.Subproblems.BinaryCC]
term_BinaryCC_final [in Complexity.NP.SAT.CookLevin.Subproblems.BinaryCC]
term_BinaryCC_cards [in Complexity.NP.SAT.CookLevin.Subproblems.BinaryCC]
term_BinaryCC_init [in Complexity.NP.SAT.CookLevin.Subproblems.BinaryCC]
term_BinaryCC_width [in Complexity.NP.SAT.CookLevin.Subproblems.BinaryCC]
term_BinaryCC_offset [in Complexity.NP.SAT.CookLevin.Subproblems.BinaryCC]
term_Build_BinaryCC [in Complexity.NP.SAT.CookLevin.Subproblems.BinaryCC]
term_execFlatTM [in Complexity.L.TM.TMflatComp]
term_isValidFlatTapes [in Complexity.L.TM.TMflatComp]
term_isValidFlatTape [in Complexity.L.TM.TMflatComp]
term_isValidFlatTM [in Complexity.L.TM.TMflatComp]
term_isValidFlatTrans [in Complexity.L.TM.TMflatComp]
term_isBoundTransTable [in Complexity.L.TM.TMflatComp]
term_isBoundEntry [in Complexity.L.TM.TMflatComp]
term_isBoundWrite [in Complexity.L.TM.TMflatComp]
term_isBoundRead [in Complexity.L.TM.TMflatComp]
term_isInjFinfuncTable [in Complexity.L.TM.TMflatComp]
term_allSameEntry [in Complexity.L.TM.TMflatComp]
term_allSameEntry_helper [in Complexity.L.TM.TMflatComp]
term_sizeOfmTapesFlat [in Complexity.L.TM.TMflatComp]
term_loopMflat [in Complexity.L.TM.TMflatComp]
term_stepFlat [in Complexity.L.TM.TMflatComp]
term_zipWith [in Complexity.L.TM.TMflatComp]
term_haltConfFlat [in Complexity.L.TM.TMflatComp]
term_pos_nondec [in Undecidability.L.Datatypes.List.List_nat]
term_repeat [in Undecidability.L.Datatypes.List.List_nat]
term_nth [in Undecidability.L.Datatypes.List.List_nat]
term_sat_verifierb [in Complexity.NP.SAT.SAT_inNP]
term_evalCnf [in Complexity.NP.SAT.SAT_inNP]
term_evalClause [in Complexity.NP.SAT.SAT_inNP]
term_forallb [in Complexity.NP.SAT.SAT_inNP]
term_existsb [in Complexity.NP.SAT.SAT_inNP]
term_evalLiteral [in Complexity.NP.SAT.SAT_inNP]
term_evalVar [in Complexity.NP.SAT.SAT_inNP]
term_list_in_decb [in Complexity.NP.SAT.SAT_inNP]
term_bool_eqb [in Complexity.NP.SAT.SAT_inNP]
term_prodLists [in Undecidability.L.Datatypes.List.List_extra]
term_seq [in Undecidability.L.Datatypes.List.List_extra]
term_lengthEq [in Undecidability.L.Datatypes.List.List_extra]
term_lam [in Undecidability.L.Datatypes.LTerm]
term_app [in Undecidability.L.Datatypes.LTerm]
term_var [in Undecidability.L.Datatypes.LTerm]
term_concat [in Complexity.Libs.CookPrelim.PolyBounds]
term_loop [in Undecidability.L.TM.TapeFuns]
term_doAct [in Undecidability.L.TM.TapeFuns]
term_current_chars [in Undecidability.L.TM.TapeFuns]
term_current [in Undecidability.L.TM.TapeFuns]
term_sizeOfmTapes [in Undecidability.L.TM.TapeFuns]
term_sizeOfTape [in Undecidability.L.TM.TapeFuns]
term_tapeToList [in Undecidability.L.TM.TapeFuns]
term_tape_write [in Undecidability.L.TM.TapeFuns]
term_right [in Undecidability.L.TM.TapeFuns]
term_left [in Undecidability.L.TM.TapeFuns]
term_tape_move [in Undecidability.L.TM.TapeFuns]
term_tape_move_right [in Undecidability.L.TM.TapeFuns]
term_tape_move_right' [in Undecidability.L.TM.TapeFuns]
term_tape_move_left [in Undecidability.L.TM.TapeFuns]
term_tape_move_left' [in Undecidability.L.TM.TapeFuns]
term_reduction [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
term_hBinaryCC [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
term_hfinal [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
term_hcards [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
term_hcard [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
term_hflat [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
term_hNat [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
term_repEl [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
term_reduction [in Complexity.NP.SAT.CookLevin.Reductions.TMGenNP_fixed_singleTapeTM_to_FlatFunSingleTMGenNP]
term_index [in Undecidability.L.Datatypes.LFinType]
term_formula_maxVar [in Complexity.NP.SAT.FSAT.FSAT]
term_Fneg [in Complexity.NP.SAT.FSAT.FSAT]
term_For [in Complexity.NP.SAT.FSAT.FSAT]
term_Fand [in Complexity.NP.SAT.FSAT.FSAT]
term_Fvar [in Complexity.NP.SAT.FSAT.FSAT]
term_fgraph_wf_decb [in Complexity.NP.Clique.FlatClique]
term_fedges_wf [in Complexity.NP.Clique.FlatClique]
term_fedge_wf [in Complexity.NP.Clique.FlatClique]
term_fedges_symmetric_decb [in Complexity.NP.Clique.FlatClique]
term_fedges_symmetric_decb_step [in Complexity.NP.Clique.FlatClique]
term_isfKClique_decb [in Complexity.NP.Clique.FlatClique]
term_isfClique_decb [in Complexity.NP.Clique.FlatClique]
term_allPairsOfEdges_decb [in Complexity.NP.Clique.FlatClique]
term_allPairsOfEdges_decb_step [in Complexity.NP.Clique.FlatClique]
term_fedges_edge_in_decb [in Complexity.NP.Clique.FlatClique]
term_list_eqb [in Undecidability.L.Datatypes.List.List_eqb]
term_inb_notime [in Undecidability.L.Datatypes.List.List_eqb]
term_inb [in Undecidability.L.Datatypes.List.List_eqb]
term_lookup [in Complexity.L.AbstractMachines.Computable.Lookup]
term_reduction [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
term_BinaryCC_wf_dec [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
term_encodeTableau [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
term_encodeFinalConstraint [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
term_encodeFinalConstraint_step [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
term_encodeSubstringInLine [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
term_encodeSubstringInLine' [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
term_encodeCardsInAllLines [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
term_encodeCardsInLine [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
term_encodeCardsInLine' [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
term_encodeCardsAt [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
term_encodeCardAt [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
term_isValidFlattening_dec [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
term_CCCard_ofFlatType_dec [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
term_FlatCC_wf_dec [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
term_CCCard_of_size_dec [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
term_FlatCC_steps [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
term_FlatCC_final [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
term_FlatCC_cards [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
term_FlatCC_init [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
term_FlatCC_width [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
term_FlatCC_offset [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
term_FlatCC_Sigma [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
term_Build_FlatCC [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
term_conc [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
term_prem [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
term_Build_CCCard [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
term_c [in Undecidability.L.Functions.EnumInt]
term_eSize [in Undecidability.L.Functions.EnumInt]
term_C [in Undecidability.L.Functions.EnumInt]
term_C_nondec [in Undecidability.L.Functions.EnumInt]
term_g [in Undecidability.L.Functions.EnumInt]
term_g_nondec [in Undecidability.L.Functions.EnumInt]
term_g_inv [in Undecidability.L.Functions.EnumInt]
term_T [in Undecidability.L.Functions.EnumInt]
term_T_nondec [in Undecidability.L.Functions.EnumInt]
term_exh_size [in Undecidability.L.Functions.EnumInt]
term_appCross [in Undecidability.L.Functions.EnumInt]
term_dupfreeb [in Undecidability.L.Datatypes.List.List_in]
term_list_incl_decb [in Undecidability.L.Datatypes.List.List_in]
term_list_in_decb [in Undecidability.L.Datatypes.List.List_in]
term_ctapes [in Undecidability.L.TM.TMEncoding]
term_cstate [in Undecidability.L.TM.TMEncoding]
term_mconfigAsPair [in Undecidability.L.TM.TMEncoding]
term_midtape [in Undecidability.L.TM.TMEncoding]
term_rightof [in Undecidability.L.TM.TMEncoding]
term_leftof [in Undecidability.L.TM.TMEncoding]
term_Pos_compare [in Complexity.L.Functions.BinNumsCompare]
term_lambdab [in Undecidability.L.Functions.Proc]
term_boundb [in Undecidability.L.Functions.Proc]
term_F1 [in Undecidability.L.Computability.Synthetic]
term_unembed_nat [in Undecidability.L.Computability.Synthetic]
term_embed_nat [in Undecidability.L.Computability.Synthetic]
term_F'' [in Undecidability.L.Computability.Synthetic]
term_F' [in Undecidability.L.Computability.Synthetic]
term_L_nat [in Undecidability.L.Computability.Synthetic]
term_opt_to_list [in Undecidability.L.Computability.Synthetic]
term_test [in Undecidability.L.Computability.Synthetic]
term_test [in Undecidability.L.TM.TMinL.TMinL_extract]
term_loopM [in Undecidability.L.TM.TMinL.TMinL_extract]
term_haltConf [in Undecidability.L.TM.TMinL.TMinL_extract]
term_halt [in Undecidability.L.TM.TMinL.TMinL_extract]
term_step' [in Undecidability.L.TM.TMinL.TMinL_extract]
term_doAct_multi [in Undecidability.L.TM.TMinL.TMinL_extract]
term_trans [in Undecidability.L.TM.TMinL.TMinL_extract]
term_lookup [in Undecidability.L.Functions.FinTypeLookup]
term_heapStep [in Complexity.L.AbstractMachines.Computable.HeapMachine]
term_FCC_instance [in Complexity.NP.SAT.CookLevin.Reductions.FlatTCC_to_FlatCC]
term_CC_cards [in Complexity.NP.SAT.CookLevin.Reductions.FlatTCC_to_FlatCC]
term_TCCCard_to_CCCard [in Complexity.NP.SAT.CookLevin.Reductions.FlatTCC_to_FlatCC]
term_fold_right [in Undecidability.L.Datatypes.List.List_fold]
term_fold_left [in Undecidability.L.Datatypes.List.List_fold]
term_forallb [in Undecidability.L.Datatypes.List.List_fold]
term_U_preproc [in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
term_start [in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
term_ltb [in Undecidability.L.Datatypes.LNat]
term_sub [in Undecidability.L.Datatypes.LNat]
term_option_enc [in Undecidability.L.Functions.Encoding]
term_list_enc [in Undecidability.L.Functions.Encoding]
term_prod_enc [in Undecidability.L.Functions.Encoding]
term_term_enc [in Undecidability.L.Functions.Encoding]
term_nat_enc [in Undecidability.L.Functions.Encoding]
term_size' [in Undecidability.L.Functions.Size]
term_reduction [in Complexity.NP.Clique.kSAT_to_FlatClique]
term_Gflat [in Complexity.NP.Clique.kSAT_to_FlatClique]
term_makeEdges [in Complexity.NP.Clique.kSAT_to_FlatClique]
term_makeEdge [in Complexity.NP.Clique.kSAT_to_FlatClique]
term_cnfGetLiteral [in Complexity.NP.Clique.kSAT_to_FlatClique]
term_toVertex [in Complexity.NP.Clique.kSAT_to_FlatClique]
term_opt_literalsConflict_decb [in Complexity.NP.Clique.kSAT_to_FlatClique]
term_literalsConflict_decb [in Complexity.NP.Clique.kSAT_to_FlatClique]
term_allPositions [in Complexity.NP.Clique.kSAT_to_FlatClique]
term_reduction [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
term_tseytin [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
term_tseytin' [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
term_tseytinTrue [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
term_tseytinEquiv [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
term_tseytinNot [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
term_tseytinOr [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
term_tseytinAnd [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
term_eliminateOR [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
Tok_eq_dec [in Undecidability.L.AbstractMachines.FlatPro.ProgramsDef]
TripleT_Entails_Proper [in Undecidability.TM.Hoare.HoareLogic]
Triple_Entails_Proper [in Undecidability.TM.Hoare.HoareLogic]
True_eq_dec [in Undecidability.Shared.Libs.PSL.EqDec]
True_dec [in Undecidability.Shared.Libs.PSL.EqDec]
True_eq_dec [in Undecidability.Shared.Dec]
True_dec [in Undecidability.Shared.Dec]

U

unfold_extend_Proper [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
unfold_extend_Proper [in Complexity.L.AbstractMachines.AbstractHeapMachine]
unit_eq_dec [in Undecidability.Shared.Libs.PSL.EqDec]
unit_eq_dec [in Undecidability.Shared.Dec]
Univ_nice.tam [in Complexity.TM.PrettyBounds.UnivBounds]
uptoc_mixed.term_sat_verifierb [in Complexity.L.ComparisonTimeBoundDerivation]
uptoc_mixed.term_evalCnf [in Complexity.L.ComparisonTimeBoundDerivation]
uptoc_mixed.term_evalClause [in Complexity.L.ComparisonTimeBoundDerivation]
uptoc_mixed.term_forallb [in Complexity.L.ComparisonTimeBoundDerivation]
uptoc_mixed.term_existsb [in Complexity.L.ComparisonTimeBoundDerivation]
uptoc_mixed.term_evalLiteral [in Complexity.L.ComparisonTimeBoundDerivation]
uptoc_mixed.term_evalVar [in Complexity.L.ComparisonTimeBoundDerivation]
uptoc_mixed.term_list_in_decb [in Complexity.L.ComparisonTimeBoundDerivation]
uptoc_pure.term_sat_verifierb [in Complexity.L.ComparisonTimeBoundDerivation]
uptoc_pure.term_evalCnf [in Complexity.L.ComparisonTimeBoundDerivation]
uptoc_pure.term_evalClause [in Complexity.L.ComparisonTimeBoundDerivation]
uptoc_pure.term_forallb [in Complexity.L.ComparisonTimeBoundDerivation]
uptoc_pure.term_existsb [in Complexity.L.ComparisonTimeBoundDerivation]
uptoc_pure.term_evalLiteral [in Complexity.L.ComparisonTimeBoundDerivation]
uptoc_pure.term_evalVar [in Complexity.L.ComparisonTimeBoundDerivation]
uptoc_pure.term_list_in_decb [in Complexity.L.ComparisonTimeBoundDerivation]

V

Vector_eq_dec [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
Vector_finTypeC [in Undecidability.Shared.Libs.PSL.FiniteTypes.VectorFin]
vector_enc_bool [in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]

W

workaround1 [in Undecidability.L.Complexity.UpToCNary]
workaround2 [in Undecidability.L.Complexity.UpToCNary]

---

Abbreviation Index

A

Alphabet [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
assgn [in Complexity.NP.SAT.SharedSAT]
aux [in Undecidability.TM.L.CompilerBoolFuns.Compiler]
aux [in Undecidability.TM.L.CompilerBoolFuns.Compiler]
auxk [in Undecidability.TM.L.CompilerBoolFuns.Compiler]
auxm [in Undecidability.TM.L.CompilerBoolFuns.Compiler]

B

bin_add [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]

C

card [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
card [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
cards [in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
cards [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
cards [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
cards [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
cards [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
cards [in Complexity.NP.SAT.CookLevin.Reductions.CC_to_BinaryCC]
CheckEncodesBoolList.cX [in Complexity.TM.Code.DecodeList]
CheckEncodesBoolList.M__X [in Complexity.TM.Code.DecodeList]
CheckEncodesBoolList.Realises__X [in Complexity.TM.Code.DecodeList]
CheckEncodesBoolList.sigX [in Complexity.TM.Code.DecodeList]
CheckEncodesBoolList.X [in Complexity.TM.Code.DecodeList]
CheckEncodesTape.sig__M [in Complexity.TM.Single.DecodeTape]
clause [in Complexity.NP.SAT.SAT]
clos [in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
clos_notation.clos [in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
cnf [in Complexity.NP.SAT.SAT]
code [in Undecidability.Shared.Libs.DLW.Code.sss]
combP [in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
combSigma [in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
combSigma [in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
covHeadSim [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
covHeadTape [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
cQ [in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
cumul [in Undecidability.Synthetic.ListEnumerabilityFacts]
c_of [in Complexity.Complexity.UpToCPoly]

D

dec [in Undecidability.Shared.Libs.DLW.Utils.quotient]
Decb [in Undecidability.Shared.Libs.PSL.EqDec]

E

E [in Complexity.NP.Clique.Clique]
ecovHeadSim [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
enumerates [in Undecidability.L.Computability.Synthetic]
enumerator__T [in Undecidability.Synthetic.EnumerabilityFacts]
equal_upto [in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
evalVar [in Complexity.NP.SAT.SAT]
explicit_bounds.ntodo [in Complexity.L.ComparisonTimeBoundDerivation]
expo [in Undecidability.Shared.Libs.DLW.Utils.sums]

F

fAlphabet [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
fAlphabet [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
fedge [in Complexity.NP.Clique.FlatUGraph]
Ffalse [in Complexity.NP.SAT.FSAT.FormulaEncoding]
Ffalse [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
fGamma [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
fGamma [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
fgraph [in Complexity.NP.Clique.FlatUGraph]
final [in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
final [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
final [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
final [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
final [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
final [in Complexity.NP.SAT.CookLevin.Reductions.CC_to_BinaryCC]
flatHalt [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
flatSigma [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
flatStart [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
flatstates [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
flatTrans [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
fpolSigma [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
fpolSigma [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
fStates [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
fStates [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
ftapeSigma [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
ftapeSigma [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
FUEL [in Undecidability.L.Tactics.Extract]
fvertex [in Complexity.NP.Clique.FlatUGraph]

H

halftape [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
halt [in Complexity.NP.SAT.CookLevin.Subproblems.TM_single]
halt [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
hcards [in Complexity.NP.SAT.CookLevin.Reductions.CC_to_BinaryCC]
hfinal [in Complexity.NP.SAT.CookLevin.Reductions.CC_to_BinaryCC]
hinit [in Complexity.NP.SAT.CookLevin.Reductions.CC_to_BinaryCC]
hoffset [in Complexity.NP.SAT.CookLevin.Reductions.CC_to_BinaryCC]
hsteps [in Complexity.NP.SAT.CookLevin.Reductions.CC_to_BinaryCC]
hwidth [in Complexity.NP.SAT.CookLevin.Reductions.CC_to_BinaryCC]

I

init [in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
init [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
init [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
init [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
init [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
init [in Complexity.NP.SAT.CookLevin.Reductions.CC_to_BinaryCC]
injective [in Complexity.Libs.CookPrelim.MorePrelim]
injectTape [in Undecidability.TM.Code.ChangeAlphabet]

L

L [in Undecidability.L.TM.TMEncoding]
L [in Undecidability.L.TM.TMinL.TMinL_extract]
lb [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
lb [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
lbeq [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
lbeq [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
liftPrelude [in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
list_enumerator__T [in Undecidability.Synthetic.ListEnumerabilityFacts]
literal [in Complexity.NP.SAT.SAT]
llength [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
lnk [in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
lpreludeRules [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
lprod [in Undecidability.Shared.Libs.DLW.Utils.prime]
lsum [in Undecidability.Shared.Libs.DLW.Code.compiler]

M

M [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
Match [in Undecidability.TM.Combinators.Switch]
MATCH [in Undecidability.TM.Combinators.Switch]
mstates [in Complexity.NP.SAT.CookLevin.Subproblems.TM_single]
mtrans [in Complexity.NP.SAT.CookLevin.Subproblems.TM_single]
MUniv [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
mu' [in Undecidability.Synthetic.Infinite]
M' [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
M' [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
M1 [in Undecidability.TM.Combinators.Switch]

N

N [in Undecidability.L.TM.TMEncoding]
N [in Undecidability.L.TM.TMinL.TMinL_extract]
negative [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
neutral [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
nMax [in Undecidability.TM.Single.StepTM]

O

o [in Undecidability.Shared.Libs.DLW.Utils.sums]
offset [in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
offset [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
offset [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
offset [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
offset [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
offset [in Complexity.NP.SAT.CookLevin.Reductions.CC_to_BinaryCC]
One [in Undecidability.Shared.Libs.DLW.Utils.list_bool]
One [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]

P

pM' [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
pM' [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
polarity [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
pos [in Undecidability.Shared.Libs.DLW.Vec.pos]
positive [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
pos_reif [in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
pos_nxt [in Undecidability.Shared.Libs.DLW.Vec.pos]
pos_fst [in Undecidability.Shared.Libs.DLW.Vec.pos]
pos0 [in Undecidability.Shared.Libs.DLW.Vec.pos]
pos1 [in Undecidability.Shared.Libs.DLW.Vec.pos]
pos10 [in Undecidability.Shared.Libs.DLW.Vec.pos]
pos11 [in Undecidability.Shared.Libs.DLW.Vec.pos]
pos12 [in Undecidability.Shared.Libs.DLW.Vec.pos]
pos13 [in Undecidability.Shared.Libs.DLW.Vec.pos]
pos14 [in Undecidability.Shared.Libs.DLW.Vec.pos]
pos15 [in Undecidability.Shared.Libs.DLW.Vec.pos]
pos16 [in Undecidability.Shared.Libs.DLW.Vec.pos]
pos17 [in Undecidability.Shared.Libs.DLW.Vec.pos]
pos18 [in Undecidability.Shared.Libs.DLW.Vec.pos]
pos19 [in Undecidability.Shared.Libs.DLW.Vec.pos]
pos2 [in Undecidability.Shared.Libs.DLW.Vec.pos]
pos20 [in Undecidability.Shared.Libs.DLW.Vec.pos]
pos3 [in Undecidability.Shared.Libs.DLW.Vec.pos]
pos4 [in Undecidability.Shared.Libs.DLW.Vec.pos]
pos5 [in Undecidability.Shared.Libs.DLW.Vec.pos]
pos6 [in Undecidability.Shared.Libs.DLW.Vec.pos]
pos7 [in Undecidability.Shared.Libs.DLW.Vec.pos]
pos8 [in Undecidability.Shared.Libs.DLW.Vec.pos]
pos9 [in Undecidability.Shared.Libs.DLW.Vec.pos]
power [in Undecidability.Shared.Libs.DLW.Utils.prime]
power [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
power [in Undecidability.Shared.Libs.DLW.Utils.sums]
power [in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
power [in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
power [in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
power [in Undecidability.Shared.Libs.DLW.Utils.power_decomp]
preludeRule [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
preludeSig [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Private_UnfoldClos.i_aux4 [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
Private_UnfoldClos.i_aux3 [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
Private_UnfoldClos.i_aux2 [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
Private_UnfoldClos.i_aux1 [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
Private_UnfoldClos.i_res [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
Private_UnfoldClos.i_stack' [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
Private_UnfoldClos.i_k [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
Private_UnfoldClos.i_P [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
Private_UnfoldClos.i_a [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
Private_UnfoldClos.i_H [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
Pro [in Undecidability.L.AbstractMachines.FlatPro.ProgramsDef]
p1 [in Undecidability.TM.Combinators.Switch]

R

R [in Undecidability.L.TM.TMEncoding]
R [in Undecidability.L.TM.TMinL.TMinL_extract]

S

scal [in Undecidability.Shared.Libs.DLW.Utils.sums]
sconfig [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
sig [in Undecidability.TM.Code.CaseBool]
sig [in Undecidability.TM.Univ.LookupAssociativeListTM]
sigGraph [in Undecidability.TM.Univ.LowLevel]
sigGraph [in Undecidability.TM.Univ.Univ]
sigList [in Undecidability.TM.Code.List.App]
Sigma [in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
Sigma [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
Sigma [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
Sigma [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
Sigma [in Complexity.NP.SAT.CookLevin.Reductions.CC_to_BinaryCC]
sigMU [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
sigMUniv [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
sigN [in Undecidability.TM.Code.BinNumbers.EncodeBinNumbers]
sigPair [in Undecidability.TM.Code.CasePair]
sigSim [in Complexity.TM.PrettyBounds.M2MBounds]
sigSim [in Undecidability.TM.Single.StepTM]
sigState [in Undecidability.TM.Univ.LowLevel]
sstep [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
stape [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
start [in Complexity.NP.SAT.CookLevin.Subproblems.TM_single]
start [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
state [in Complexity.L.AbstractMachines.AbstractSubstMachine]
state [in Undecidability.TM.SBTM]
state [in Undecidability.Shared.Libs.DLW.Code.sss]
states [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
steps [in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
steps [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
steps [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
steps [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
steps [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
steps [in Complexity.NP.SAT.CookLevin.Reductions.CC_to_BinaryCC]
strconfig [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
string [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
string [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
sum_powers [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
surjectTape [in Undecidability.TM.Code.ChangeAlphabet]

T

tape [in Undecidability.TM.Util.TM_facts]
TM [in Undecidability.TM.Util.TM_facts]
todo [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
trans [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]

U

UnfoldClos.i_H [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
UnfoldClos.i_io [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
UnfoldClos.n [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]

V

V [in Complexity.NP.Clique.Clique]
validPreludeInitial [in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
var [in Complexity.NP.SAT.SharedSAT]
var [in Complexity.NP.SAT.SAT]
vec [in Undecidability.Shared.Libs.DLW.Vec.vec]
vec [in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_cons [in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_nil [in Undecidability.Shared.Libs.DLW.Vec.vec]

W

WHILE [in Undecidability.TM.Combinators.While]
width [in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
width [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
width [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
width [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
width [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
width [in Complexity.NP.SAT.CookLevin.Reductions.CC_to_BinaryCC]

Z

z [in Undecidability.Shared.Libs.DLW.Utils.sums]
Zero [in Undecidability.Shared.Libs.DLW.Utils.list_bool]
Zero [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]

---

Definition Index

A

abbreviate [in Undecidability.TM.Hoare.HoareTacticsView]
acc_conj [in Undecidability.L.Computability.Acceptability]
ackermann [in Undecidability.L.Functions.Ackermann]
ACom_eqb [in Complexity.L.TM.CompCode]
ACom2Com [in Undecidability.TM.L.Alphabets]
Add [in Undecidability.TM.Code.NatTM]
Add [in Undecidability.TM.Hoare.HoareMult]
Add [in Undecidability.TM.Code.BinNumbers.PosAddTM]
Add [in Undecidability.TM.Hoare.HoareExamples]
addC [in Complexity.L.Functions.BinNumsAdd]
addTR [in Undecidability.TM.Code.BinNumbers.PosAddTM]
addTR_rec' [in Undecidability.TM.Code.BinNumbers.PosAddTM]
addTR_rec_carry [in Undecidability.TM.Code.BinNumbers.PosAddTM]
addTR_rec [in Undecidability.TM.Code.BinNumbers.PosAddTM]
Add_T [in Undecidability.TM.Code.NatTM]
Add_steps [in Undecidability.TM.Code.NatTM]
Add_Main_T [in Undecidability.TM.Code.NatTM]
Add_Main_steps [in Undecidability.TM.Code.NatTM]
Add_Loop_steps [in Undecidability.TM.Code.NatTM]
Add_Rel [in Undecidability.TM.Code.NatTM]
Add_space3 [in Undecidability.TM.Code.NatTM]
Add_space2 [in Undecidability.TM.Code.NatTM]
Add_Main_Rel [in Undecidability.TM.Code.NatTM]
Add_Loop_Rel [in Undecidability.TM.Code.NatTM]
Add_Step_Rel [in Undecidability.TM.Code.NatTM]
Add_Main [in Undecidability.TM.Code.NatTM]
Add_Loop [in Undecidability.TM.Code.NatTM]
Add_Step [in Undecidability.TM.Code.NatTM]
Add_N_Rel [in Undecidability.TM.Code.BinNumbers.NTM]
Add_N [in Undecidability.TM.Code.BinNumbers.NTM]
Add_space [in Undecidability.TM.Hoare.HoareMult]
Add_steps [in Undecidability.TM.Hoare.HoareMult]
Add_Loop_size [in Undecidability.TM.Hoare.HoareMult]
Add_Loop_steps [in Undecidability.TM.Hoare.HoareMult]
Add_Loop [in Undecidability.TM.Hoare.HoareMult]
Add_Step_size [in Undecidability.TM.Hoare.HoareMult]
Add_Step_steps [in Undecidability.TM.Hoare.HoareMult]
Add_Step [in Undecidability.TM.Hoare.HoareMult]
add_time [in Undecidability.L.Datatypes.LNat]
Add_onto_Rel [in Undecidability.TM.Code.BinNumbers.PosAddTM]
Add_onto [in Undecidability.TM.Code.BinNumbers.PosAddTM]
Add_Rel [in Undecidability.TM.Code.BinNumbers.PosAddTM]
Add_Loop [in Undecidability.TM.Code.BinNumbers.PosAddTM]
Add_Loop_Rel [in Undecidability.TM.Code.BinNumbers.PosAddTM]
Add_Step [in Undecidability.TM.Code.BinNumbers.PosAddTM]
Add_Step_Rel [in Undecidability.TM.Code.BinNumbers.PosAddTM]
Add_BaseCase [in Undecidability.TM.Code.BinNumbers.PosAddTM]
Add_BaseCase_Rel [in Undecidability.TM.Code.BinNumbers.PosAddTM]
add_baseCase [in Undecidability.TM.Code.BinNumbers.PosAddTM]
Add_space [in Undecidability.TM.Hoare.HoareExamples]
Add_steps [in Undecidability.TM.Hoare.HoareExamples]
Add_Loop_size [in Undecidability.TM.Hoare.HoareExamples]
Add_Loop_steps [in Undecidability.TM.Hoare.HoareExamples]
Add_Step_size [in Undecidability.TM.Hoare.HoareExamples]
Add_Step_steps [in Undecidability.TM.Hoare.HoareExamples]
Add_Loop [in Undecidability.TM.Hoare.HoareExamples]
Add_Step_Post [in Undecidability.TM.Hoare.HoareExamples]
Add_Step [in Undecidability.TM.Hoare.HoareExamples]
Add' [in Undecidability.TM.Code.BinNumbers.PosAddTM]
Add'_N_Rel [in Undecidability.TM.Code.BinNumbers.NTM]
Add'_N [in Undecidability.TM.Code.BinNumbers.NTM]
Add'_Rel [in Undecidability.TM.Code.BinNumbers.PosAddTM]
allArgs [in Complexity.L.TM.TMflatten]
allFinCards [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
allFinSimCards [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
allFlatCards [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
allFlatCards_time [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
allFlatSimCards [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
allnVecs [in Complexity.L.TM.TMflatten]
allPairsOfEdges_decb_time [in Complexity.NP.Clique.FlatClique]
allPairsOfEdges_decb_step_time [in Complexity.NP.Clique.FlatClique]
allPairsOfEdges_decb_step [in Complexity.NP.Clique.FlatClique]
allPairsOfEdges_decb [in Complexity.NP.Clique.FlatClique]
allPositions [in Complexity.NP.Clique.kSAT_to_FlatClique]
allPositions_time [in Complexity.NP.Clique.kSAT_to_FlatClique]
allRules [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
allSameEntry [in Complexity.L.TM.TMunflatten]
allSameEntry_time [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
allSameEntry_step_time [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
allSameEntry_step [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
allSameEntry_time [in Complexity.L.TM.TMflatComp]
allSameEntry_helper [in Complexity.L.TM.TMflatComp]
alltrue [in Undecidability.TM.L.CompilerBoolFuns.Compiler_nat_facts]
all_vec [in Undecidability.TM.Compound.TMTac]
all_Fin [in Undecidability.Shared.Libs.PSL.FiniteTypes.Arbitrary]
App [in Undecidability.L.Complexity.GenericNary]
App [in Undecidability.TM.Code.List.App]
appCross [in Undecidability.L.Computability.Enum]
append_bits [in Undecidability.TM.Code.BinNumbers.PosDefinitions]
append_bit [in Undecidability.TM.Code.BinNumbers.PosDefinitions]
apply_encs_to [in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
apply_to [in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
apply_sizeFun [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
appSize [in Undecidability.TM.Hoare.HoareRegister]
App_Com_T [in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
App_Com_steps [in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
App_Com_Rel [in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
App_Com_size [in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
App_Com [in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
App_ACom_T [in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
App_ACom_steps [in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
App_ACom_Rel [in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
App_ACom_size [in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
App_ACom [in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
APP_right [in Undecidability.TM.L.CompilerBoolFuns.Compiler]
App_T [in Undecidability.TM.Code.List.App]
App_steps [in Undecidability.TM.Code.List.App]
App_Rel [in Undecidability.TM.Code.List.App]
App_size [in Undecidability.TM.Code.List.App]
App' [in Undecidability.TM.Code.List.App]
App'_sizeV [in Undecidability.TM.Code.List.App]
App'_T [in Undecidability.TM.Code.List.App]
App'_steps [in Undecidability.TM.Code.List.App]
App'_Rel [in Undecidability.TM.Code.List.App]
App'_size [in Undecidability.TM.Code.List.App]
arem [in Undecidability.Shared.Libs.DLW.Utils.gcd]
argument_types [in Undecidability.L.Tactics.Extract]
Assert [in Undecidability.TM.Hoare.HoareLogic]
assgn_varsIn [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
assignment_small [in Complexity.NP.SAT.SAT_inNP]
atBit [in Undecidability.TM.Code.BinNumbers.PosPointers]
atCons [in Undecidability.TM.Single.StepTM]
atCons_current [in Undecidability.TM.Single.StepTM]
atCons_current_rightof [in Undecidability.TM.Single.StepTM]
atCons_current_midtape [in Undecidability.TM.Single.StepTM]
atCons_current_leftof [in Undecidability.TM.Single.StepTM]
atCons_current_niltape [in Undecidability.TM.Single.StepTM]
atHSB [in Undecidability.TM.Code.BinNumbers.PosPointers]
atLSB [in Undecidability.TM.Code.BinNumbers.PosPointers]
atNil [in Undecidability.TM.Single.StepTM]
atStart [in Undecidability.TM.Single.StepTM]

B

base_p [in Undecidability.Shared.Libs.DLW.Utils.prime]
benchTerm [in Undecidability.L.Tactics.Reflection]
bezout_generalized [in Undecidability.Shared.Libs.DLW.Utils.gcd]
bezout_generalized_lt [in Undecidability.Shared.Libs.DLW.Utils.gcd]
bezout_rel_prime [in Undecidability.Shared.Libs.DLW.Utils.gcd]
bezout_rel_prime_lt [in Undecidability.Shared.Libs.DLW.Utils.gcd]
bijective [in Undecidability.Shared.Libs.PSL.Bijection]
bij_t [in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
BinaryCCLang [in Complexity.NP.SAT.CookLevin.Subproblems.BinaryCC]
BinaryCC_wellformed [in Complexity.NP.SAT.CookLevin.Subproblems.BinaryCC]
BinaryCC_wf_dec_time [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
BinaryCC_wf_dec [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
binomial [in Undecidability.Shared.Libs.DLW.Utils.binomial]
bits_to_pos [in Undecidability.TM.Code.BinNumbers.PosDefinitions]
bits_to_pos' [in Undecidability.TM.Code.BinNumbers.PosDefinitions]
bitToSigPos [in Undecidability.TM.Code.BinNumbers.PosDefinitions]
bitToSigPos' [in Undecidability.TM.Code.BinNumbers.PosDefinitions]
BoollistToEnc.M [in Undecidability.TM.L.Transcode.Boollist_to_Enc]
BoollistToEnc.M__loop [in Undecidability.TM.L.Transcode.Boollist_to_Enc]
BoollistToEnc.M__step [in Undecidability.TM.L.Transcode.Boollist_to_Enc]
BoollistToEnc.Rel [in Undecidability.TM.L.Transcode.Boollist_to_Enc]
BoollistToEnc.Rel__loop [in Undecidability.TM.L.Transcode.Boollist_to_Enc]
BoollistToEnc.Rel__step [in Undecidability.TM.L.Transcode.Boollist_to_Enc]
BoollistToEnc.Ter [in Undecidability.TM.L.Transcode.Boollist_to_Enc]
BoollistToEnc.Terminates [in Undecidability.TM.L.Transcode.Boollist_to_Enc]
BoollistToEnc.Terminates__loop [in Undecidability.TM.L.Transcode.Boollist_to_Enc]
BoollistToEnc.Terminates__step [in Undecidability.TM.L.Transcode.Boollist_to_Enc]
BoollistToEnc.Ter' [in Undecidability.TM.L.Transcode.Boollist_to_Enc]
boollist_enum.pro_to_boollist [in Complexity.NP.L.CanEnumTerm]
Boollist2encBoolsTM.M [in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
Boollist2encBoolsTM.M__loop [in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
Boollist2encBoolsTM.M__step [in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
bool_add_with_rem [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
bool_enum [in Undecidability.Synthetic.EnumerabilityFacts]
bool_decode [in Undecidability.L.Functions.Decoding]
bool_enc_inv [in Undecidability.L.Computability.Computability]
bool2nat [in Undecidability.Shared.Libs.PSL.Prelim]
bool2nat [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
bool2optunit [in Undecidability.TM.L.HeapInterpreter.StepTM]
boundary_eqb [in Complexity.L.TM.CompCode]
boundb [in Undecidability.L.Functions.Proc]
boundHeap [in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisUnfoldClos]
boundVar [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
bound_card [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
bound_CardP [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
bound_Alphabet [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
bound_preludeSig' [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
bound_Gamma [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
bound_States [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
bound_tapeSigma [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
bound_polSigma [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
bound_stateSigma [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
bound_polarity [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]

C

c [in Undecidability.L.Computability.Enum]
C [in Undecidability.L.Computability.Enum]
callTime [in Undecidability.L.Tactics.ComputableTime]
callTime2 [in Undecidability.L.Tactics.ComputableTime]
canonicalHom [in Complexity.Libs.UniformHomomorphisms]
Canonical_T [in Undecidability.TM.Util.TM_facts]
Canonical_Rel [in Undecidability.TM.Util.TM_facts]
card [in Complexity.Libs.Pigeonhole]
card [in Undecidability.Shared.Libs.PSL.Lists.Cardinality]
Cardinality [in Undecidability.Shared.Libs.PSL.FiniteTypes.Cardinality]
cardPred [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
cardPred_subs [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
cards_list_ind_agree [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
CaseBool [in Undecidability.TM.Code.CaseBool]
CaseBool_size [in Undecidability.TM.Code.CaseBool]
CaseBool_steps [in Undecidability.TM.Code.CaseBool]
CaseBool_Rel [in Undecidability.TM.Code.CaseBool]
CaseChar [in Undecidability.TM.Basic.Mono]
CaseChar_Sem [in Undecidability.TM.Basic.Mono]
CaseChar_Rel [in Undecidability.TM.Basic.Mono]
CaseChar_TM [in Undecidability.TM.Basic.Mono]
CaseChar2 [in Undecidability.TM.Basic.Duo]
CaseChar2_Sem [in Undecidability.TM.Basic.Duo]
CaseChar2_Rel [in Undecidability.TM.Basic.Duo]
CaseChar2_TM [in Undecidability.TM.Basic.Duo]
CaseCom [in Undecidability.TM.L.CaseCom]
CaseCom_steps [in Undecidability.TM.L.CaseCom]
CaseCom_Rel [in Undecidability.TM.L.CaseCom]
CaseCom_size [in Undecidability.TM.L.CaseCom]
CaseFin [in Undecidability.TM.Code.CaseFin]
CaseFin_size [in Undecidability.TM.Code.CaseFin]
CaseFin_steps [in Undecidability.TM.Code.CaseFin]
CaseFin_Rel [in Undecidability.TM.Code.CaseFin]
CaseList [in Undecidability.TM.Code.CaseList]
CaseList_size [in Undecidability.TM.Code.CaseList]
CaseList_steps [in Undecidability.TM.Code.CaseList]
CaseList_steps_nil [in Undecidability.TM.Code.CaseList]
CaseList_steps_cons [in Undecidability.TM.Code.CaseList]
CaseList_Rel [in Undecidability.TM.Code.CaseList]
CaseList_size1 [in Undecidability.TM.Code.CaseList]
CaseList_size0 [in Undecidability.TM.Code.CaseList]
CaseN [in Undecidability.TM.Code.BinNumbers.NTM]
CaseNat [in Undecidability.TM.Code.CaseNat]
CaseNat_size [in Undecidability.TM.Code.CaseNat]
CaseNat_steps [in Undecidability.TM.Code.CaseNat]
CaseNat_Rel [in Undecidability.TM.Code.CaseNat]
CaseNat_size [in Undecidability.TM.Hoare.HoareExamples]
CaseN_steps [in Undecidability.TM.Code.BinNumbers.NTM]
CaseN_Rel [in Undecidability.TM.Code.BinNumbers.NTM]
CaseOption [in Undecidability.TM.Code.CaseSum]
CaseOption_size [in Undecidability.TM.Code.CaseSum]
CaseOption_steps [in Undecidability.TM.Code.CaseSum]
CaseOption_Rel [in Undecidability.TM.Code.CaseSum]
CaseOption_size_None [in Undecidability.TM.Code.CaseSum]
CaseOption_size_Some [in Undecidability.TM.Code.CaseSum]
CasePair [in Undecidability.TM.Code.CasePair]
CasePair_size [in Undecidability.TM.Code.CasePair]
CasePair_T [in Undecidability.TM.Code.CasePair]
CasePair_steps [in Undecidability.TM.Code.CasePair]
CasePair_Rel [in Undecidability.TM.Code.CasePair]
CasePair_size1 [in Undecidability.TM.Code.CasePair]
CasePair_size0 [in Undecidability.TM.Code.CasePair]
CaseSum [in Undecidability.TM.Code.CaseSum]
CaseSum_steps [in Undecidability.TM.Code.CaseSum]
CaseSum_Rel [in Undecidability.TM.Code.CaseSum]
caseS' [in Undecidability.Shared.Libs.DLW.Vec.vec]
case0 [in Undecidability.Shared.Libs.DLW.Vec.vec]
CCCard_ofFlatType_dec_time [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
CCCard_of_size_dec_time [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
CCCard_ofFlatType_dec [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
CCCard_ofFlatType [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
CCCard_of_size_dec [in Complexity.NP.SAT.CookLevin.Subproblems.CC]
CCCard_of_size [in Complexity.NP.SAT.CookLevin.Subproblems.CC]
cChoice [in Undecidability.L.Computability.Seval]
cChoice [in Undecidability.L.Computability.Computability]
CCLang [in Complexity.NP.SAT.CookLevin.Subproblems.CC]
CC_instance [in Complexity.NP.SAT.CookLevin.Reductions.TCC_to_CC]
CC_cards [in Complexity.NP.SAT.CookLevin.Reductions.TCC_to_CC]
CC_cards_size [in Complexity.NP.SAT.CookLevin.Reductions.FlatTCC_to_FlatCC]
CC_cards_time [in Complexity.NP.SAT.CookLevin.Reductions.FlatTCC_to_FlatCC]
CC_wf_dec [in Complexity.NP.SAT.CookLevin.Subproblems.CC]
CC_wellformed [in Complexity.NP.SAT.CookLevin.Subproblems.CC]
cHalt [in Undecidability.L.TM.TMinL.TMinL_extract]
ChangeAlphabet [in Undecidability.TM.Code.ChangeAlphabet]
changeResType [in Undecidability.L.Tactics.Computable]
changeResType_TimeComplexity [in Undecidability.L.Tactics.ComputableTime]
CheckEncodesBoolList.M [in Complexity.TM.Code.DecodeList]
CheckEncodesBoolList.M' [in Complexity.TM.Code.DecodeList]
CheckEncodesBoolList.M'__step [in Complexity.TM.Code.DecodeList]
CheckEncodesBoolList.R'__step [in Complexity.TM.Code.DecodeList]
CheckEncodesBool.M [in Complexity.TM.Code.DecodeBool]
CheckEncodesTapes.M [in Complexity.TM.Single.DecodeTapes]
CheckEncodesTapes.R_syntactic [in Complexity.TM.Single.DecodeTapes]
CheckEncodesTapes.Ter [in Complexity.TM.Single.DecodeTapes]
CheckEncodesTape.f [in Complexity.TM.Single.DecodeTape]
CheckEncodesTape.f__step [in Complexity.TM.Single.DecodeTape]
CheckEncodesTape.M [in Complexity.TM.Single.DecodeTape]
CheckEncodesTape.M__step [in Complexity.TM.Single.DecodeTape]
CheckEncodesTape.M' [in Complexity.TM.Single.DecodeTape]
CheckEncodesTape.Ter [in Complexity.TM.Single.DecodeTape]
CheckTapeContains.M [in Complexity.TM.Code.Decode]
church_rosser [in Undecidability.L.Prelim.ARS]
classical [in Undecidability.L.Prelim.ARS]
clauseGetLiteral [in Complexity.NP.Clique.kSAT_to_Clique]
clausesOf [in Complexity.NP.Clique.kSAT_to_Clique]
clause_length_decb_time [in Complexity.NP.SAT.kSAT]
clause_length_decb [in Complexity.NP.SAT.kSAT]
clause_maxVar [in Complexity.NP.SAT.SAT_inNP]
clause_varsIn [in Complexity.NP.SAT.SAT]
Clique [in Complexity.NP.Clique.Clique]
closed [in Undecidability.L.Util.L_facts]
closedb [in Undecidability.L.Functions.Proc]
cmp_sub [in Undecidability.Shared.Libs.DLW.Utils.gcd]
cnfGetClause [in Complexity.NP.Clique.kSAT_to_Clique]
cnfGetLiteral [in Complexity.NP.Clique.kSAT_to_Clique]
cnfGetLiteral_time [in Complexity.NP.Clique.kSAT_to_FlatClique]
cnf_maxVar [in Complexity.NP.SAT.SAT_inNP]
cnf_varsIn [in Complexity.NP.SAT.SAT]
cnst [in Undecidability.L.Tactics.ComputableTime]
cnst_conc [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
cnst_prem [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
cnst_cardEl3 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
cnst_cardEl2 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
cnst_cardEl1 [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
cnst_conc [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
cnst_prem [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
code [in Undecidability.Shared.Libs.DLW.Code.subcode]
code_length [in Undecidability.Shared.Libs.DLW.Code.subcode]
code_end [in Undecidability.Shared.Libs.DLW.Code.subcode]
code_start [in Undecidability.Shared.Libs.DLW.Code.subcode]
combinedLength [in Complexity.NP.SAT.FSAT.FormulaEncoding]
combinedStart [in Complexity.NP.SAT.FSAT.FormulaEncoding]
combP [in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
comp [in Undecidability.Shared.Libs.DLW.Code.compiler]
CompAppCount [in Undecidability.L.Tactics.LClos_Eval]
Compare [in Undecidability.TM.Code.BinNumbers.PosCompareTM]
Compare [in Undecidability.TM.Compound.Compare]
CompareValues [in Undecidability.TM.Code.CompareValue]
CompareValues_T [in Undecidability.TM.Code.CompareValue]
CompareValues_steps [in Undecidability.TM.Code.CompareValue]
CompareValues_Rel [in Undecidability.TM.Code.CompareValue]
Compare_Rel [in Undecidability.TM.Code.BinNumbers.PosCompareTM]
Compare_Loop_Rel [in Undecidability.TM.Code.BinNumbers.PosCompareTM]
Compare_Loop [in Undecidability.TM.Code.BinNumbers.PosCompareTM]
Compare_Step [in Undecidability.TM.Code.BinNumbers.PosCompareTM]
Compare_Step_Rel [in Undecidability.TM.Code.BinNumbers.PosCompareTM]
Compare_T [in Undecidability.TM.Compound.Compare]
Compare_Rel [in Undecidability.TM.Compound.Compare]
Compare_fun_measure [in Undecidability.TM.Compound.Compare]
Compare_Step_Rel [in Undecidability.TM.Compound.Compare]
Compare_Step [in Undecidability.TM.Compound.Compare]
CompBeta [in Undecidability.L.Tactics.LClos_Eval]
compile [in Undecidability.L.AbstractMachines.FlatPro.ProgramsDef]
compiler [in Undecidability.Shared.Libs.DLW.Code.compiler]
compileTR' [in Complexity.L.AbstractMachines.FlatPro.Computable.Compile]
compileTR'_fuel [in Complexity.L.AbstractMachines.FlatPro.Computable.Compile]
complement [in Undecidability.L.Computability.Decidability]
complement [in Undecidability.Synthetic.Definitions]
compressAssignment [in Complexity.NP.SAT.SAT_inNP]
CompSeval [in Undecidability.L.Tactics.LClos_Eval]
compSizeFun [in Undecidability.TM.Code.CodeTM]
computes [in Undecidability.L.Tactics.Computable]
computesExp [in Undecidability.L.Tactics.Computable]
computesRel [in Undecidability.L.Prelim.ARS]
computesTime [in Undecidability.L.Tactics.ComputableTime]
computesTimeExp [in Undecidability.L.Tactics.ComputableTime]
computesTimeIf [in Undecidability.L.Tactics.ComputableTime]
comp_t__E [in Complexity.HierarchyTheorem.TimeHierarchyTheorem]
Comp_ind_deep [in Undecidability.L.Tactics.LClos]
Comp_ind_deep' [in Undecidability.L.Tactics.LClos]
Com_to_sum [in Undecidability.TM.L.Alphabets]
ConcatRepeat.M [in Undecidability.TM.Code.List.Concat_Repeat]
ConcatRepeat.M__step [in Undecidability.TM.Code.List.Concat_Repeat]
ConcatRepeat.Rel [in Undecidability.TM.Code.List.Concat_Repeat]
ConcatRepeat.Rel__step [in Undecidability.TM.Code.List.Concat_Repeat]
ConcatRepeat.Ter [in Undecidability.TM.Code.List.Concat_Repeat]
ConcatRepeat.Terminates [in Undecidability.TM.Code.List.Concat_Repeat]
ConcatRepeat.Terminates__step [in Undecidability.TM.Code.List.Concat_Repeat]
ConcatRepeat.Ter__step [in Undecidability.TM.Code.List.Concat_Repeat]
concat_time [in Complexity.Libs.CookPrelim.PolyBounds]
configState [in Complexity.NP.SAT.CookLevin.Subproblems.TM_single]
confluent [in Undecidability.L.Prelim.ARS]
conj [in Undecidability.L.Computability.Decidability]
ConsClos [in Undecidability.TM.L.HeapInterpreter.StepTM]
ConsClos_T [in Undecidability.TM.L.HeapInterpreter.StepTM]
ConsClos_steps [in Undecidability.TM.L.HeapInterpreter.StepTM]
ConsClos_Rel [in Undecidability.TM.L.HeapInterpreter.StepTM]
ConsClos_size [in Undecidability.TM.L.HeapInterpreter.StepTM]
Const [in Undecidability.L.Complexity.GenericNary]
Constr_cons_sizefun [in Undecidability.TM.Code.CaseList]
Constr_cons_steps [in Undecidability.TM.Code.CaseList]
Constr_cons_Rel [in Undecidability.TM.Code.CaseList]
Constr_cons_size [in Undecidability.TM.Code.CaseList]
Constr_cons [in Undecidability.TM.Code.CaseList]
Constr_nil_steps [in Undecidability.TM.Code.CaseList]
Constr_nil_Rel [in Undecidability.TM.Code.CaseList]
Constr_nil [in Undecidability.TM.Code.CaseList]
Constr_O_steps [in Undecidability.TM.Code.CaseNat]
Constr_O [in Undecidability.TM.Code.CaseNat]
Constr_O_size [in Undecidability.TM.Code.CaseNat]
Constr_S_steps [in Undecidability.TM.Code.CaseNat]
Constr_S [in Undecidability.TM.Code.CaseNat]
Constr_Npos_Sem [in Undecidability.TM.Code.BinNumbers.NTM]
Constr_Npos_Rel [in Undecidability.TM.Code.BinNumbers.NTM]
Constr_Npos [in Undecidability.TM.Code.BinNumbers.NTM]
Constr_N0_steps [in Undecidability.TM.Code.BinNumbers.NTM]
Constr_N0_Rel [in Undecidability.TM.Code.BinNumbers.NTM]
Constr_N0 [in Undecidability.TM.Code.BinNumbers.NTM]
Constr_None_steps [in Undecidability.TM.Code.CaseSum]
Constr_None [in Undecidability.TM.Code.CaseSum]
Constr_None_Rel [in Undecidability.TM.Code.CaseSum]
Constr_Some_steps [in Undecidability.TM.Code.CaseSum]
Constr_Some [in Undecidability.TM.Code.CaseSum]
Constr_Some_Rel [in Undecidability.TM.Code.CaseSum]
Constr_inr_steps [in Undecidability.TM.Code.CaseSum]
Constr_inl_steps [in Undecidability.TM.Code.CaseSum]
Constr_inr [in Undecidability.TM.Code.CaseSum]
Constr_inl [in Undecidability.TM.Code.CaseSum]
Constr_inr_Rel [in Undecidability.TM.Code.CaseSum]
Constr_inl_Rel [in Undecidability.TM.Code.CaseSum]
Constr_varT_steps [in Undecidability.TM.L.CaseCom]
Constr_varT_Rel [in Undecidability.TM.L.CaseCom]
Constr_varT [in Undecidability.TM.L.CaseCom]
Constr_ACom_steps [in Undecidability.TM.L.CaseCom]
Constr_ACom_Rel [in Undecidability.TM.L.CaseCom]
Constr_ACom [in Undecidability.TM.L.CaseCom]
Constr_pair_sizefun [in Undecidability.TM.Code.CasePair]
Constr_pair_T [in Undecidability.TM.Code.CasePair]
Constr_pair_steps [in Undecidability.TM.Code.CasePair]
Constr_pair [in Undecidability.TM.Code.CasePair]
Constr_pair_Rel [in Undecidability.TM.Code.CasePair]
Constr_pair_size [in Undecidability.TM.Code.CasePair]
Const' [in Undecidability.L.Complexity.GenericNary]
Cons_constant.time [in Undecidability.TM.Code.List.Cons_constant]
Cons_constant.Rel [in Undecidability.TM.Code.List.Cons_constant]
Cons_constant.M [in Undecidability.TM.Code.List.Cons_constant]
ContainsEncoding.Rel [in Complexity.TM.Code.Decode]
ContainsEncoding.Rel_legacy [in Complexity.TM.Code.Decode]
containsHaltingState [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
containsState [in Undecidability.TM.Univ.LowLevel]
containsState_size [in Undecidability.TM.Univ.LowLevel]
containsTrans [in Undecidability.TM.Univ.LowLevel]
containsTrans_size [in Undecidability.TM.Univ.LowLevel]
containsWorkingTape [in Undecidability.TM.Univ.LowLevel]
ContainsWorkingTape [in Undecidability.TM.Univ.Univ]
contains_tapes [in Undecidability.TM.Single.StepTM]
contains_conf_MU_size_exact_size [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
contains_conf_MU_size [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
contains_conf_MU [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
contains_conf_MU'_size [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
contains_conf_MU' [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
contains_conf_U_size [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
contains_conf_U [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
contains_conf_U'_size [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
contains_conf_U' [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
contains_conf_Univ_size [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
contains_conf_Univ [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
converges [in Undecidability.L.Util.L_facts]
convert [in Undecidability.L.Util.L_facts]
CopyChar [in Undecidability.TM.Compound.Multi]
CopyChar_Rel [in Undecidability.TM.Compound.Multi]
CopySymbols [in Undecidability.TM.Compound.CopySymbols]
CopySymbols_L_Rel [in Undecidability.TM.Compound.CopySymbols]
CopySymbols_L [in Undecidability.TM.Compound.CopySymbols]
CopySymbols_Rel [in Undecidability.TM.Compound.CopySymbols]
CopySymbols_Step_Rel [in Undecidability.TM.Compound.CopySymbols]
CopySymbols_Step [in Undecidability.TM.Compound.CopySymbols]
CopyValue [in Undecidability.TM.Code.Copy]
CopyValue_sizefun [in Undecidability.TM.Code.Copy]
CopyValue_steps [in Undecidability.TM.Code.Copy]
CopyValue_Rel [in Undecidability.TM.Code.Copy]
CopyValue_size [in Undecidability.TM.Code.Copy]
CopyValue_sizefun [in Undecidability.TM.Hoare.HoareExamples]
count [in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
count [in Undecidability.Shared.Libs.PSL.Vectors.VectorDupfree]
coversAt [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
coversAt [in Complexity.NP.SAT.CookLevin.Subproblems.CC]
coversHead [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
coversHead [in Complexity.NP.SAT.CookLevin.Subproblems.CC]
coversHeadAbstract [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
coversHeadList [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
cumulative [in Undecidability.Synthetic.ListEnumerabilityFacts]
curr [in Undecidability.TM.SBTM]
current [in Undecidability.TM.TM]
current_chars [in Undecidability.TM.Util.TM_facts]
c__reduction [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__isValidFlatTM [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__isValidFlatTrans [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__isBoundTransTable [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__isBoundTrans [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__fstOptBound [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__optBound [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__ltb [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__isInjFinfuncTable [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__allSameEntry [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__allSameEntryStep [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__implb [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__reductionWf [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__finalSubstrings [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__flatFinalSubstringsStep [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__flatHaltingStates [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__isHalting [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__filter [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__nth [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__flatInitialString [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__flatInrflatNsig [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__zPflat [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__zflat [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__kflat [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__repEl [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__flatPreludeCards [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__flatBaseEnvPrelude [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__makePreludeCardsFlat [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__flatStateCards [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__generateCardsForFlat2 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__generateCardsForFlat1 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__generateCardsForFlatStep [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__makeHaltFlat [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__generateCardsForFlatNonHalt [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__genSome [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__genNone [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__optGenerateCardsForFlatNonHalt [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__fOpt [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__flatBaseEnvNone [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__flatBaseEnv [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__makeNoneStayFlat [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__makeNoneLeftFlat [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__makeNoneRightFlat [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__makeNoneBaseFlat2 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__makeNoneBaseFlat1 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__makeSomeStayFlat [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__makeSomeLeftFlat [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__makeSomeRightFlat [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__makeSomeBaseFlat2 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__makeSomeBaseFlat1 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__flatTapeCards [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__flatMTLCards [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__flatMTICards [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__flatMTRCards [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__transEnvAddSM [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__transEnvAddS [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__envAddSSigma [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__envAddState [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__makeCardsFlat [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__makeCards' [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__makeCardsPFlatStep [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__filterSome [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__makeAllEvalEnvFlat2 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__makeAllEvalEnvFlat1 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__prodLists2 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__prodLists1 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__tupToEvalEnv [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__mkVarEnvB2 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__mkVarEnvB1 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__mkVarEnv [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__it [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__mkVarEnvStep [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__listProd2 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__listProd1 [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__generateCard [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__generateAlphabetFlat [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__generatePreludeSigPFlat [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__flatNsig [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__generateGammaFlat [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__generateStatesFlat [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__generateTapeSigmaFlat [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__generatePolSigmaFlat [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__generateStateSigmaFlat [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__optionMap [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__generatePolarityFlat [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__flattenPolarity [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__flatAlphabet [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__flatPreludeSig' [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__flatGamma [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__flatStates [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__flatTapeSigma [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__flatPolSigma [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__flatStateSigma [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__flatAlphabetS [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__flatPreludeSigPS [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__flatGammaS [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__flatTapeSigmaS [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__flatPolSigmaS [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__stateEnv [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__stateSigmaEnv [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__sigmaEnv [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__polarityEnv [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
c__encodeListAt [in Complexity.NP.SAT.FSAT.FormulaEncoding]
c__encodeLiteral [in Complexity.NP.SAT.FSAT.FormulaEncoding]
c__tabulateFormula [in Complexity.NP.SAT.FSAT.FormulaEncoding]
c__tabulateStep [in Complexity.NP.SAT.FSAT.FormulaEncoding]
c__listOr [in Complexity.NP.SAT.FSAT.FormulaEncoding]
c__listAnd [in Complexity.NP.SAT.FSAT.FormulaEncoding]
c__rev [in Undecidability.L.Datatypes.List.List_basics]
c__map [in Undecidability.L.Datatypes.List.List_basics]
c__app [in Undecidability.L.Datatypes.List.List_basics]
c__sizeBool [in Undecidability.L.Datatypes.LBool]
c__sizeFlatTCC [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
c__steps [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
c__final [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
c__cards [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
c__init [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
c__Sigma [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
c__sizeTCCCard [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
c__TCCCardPToList [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
c__sizeTCCCardP [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
c_inv [in Undecidability.L.Computability.Enum]
c__encTM [in Complexity.L.TM.TMflatEnc]
c__kCNFDecbBound2 [in Complexity.NP.SAT.kSAT]
c__kCNFDecbBound1 [in Complexity.NP.SAT.kSAT]
c__kCNFDecb [in Complexity.NP.SAT.kSAT]
c__clauseLengthDecb [in Complexity.NP.SAT.kSAT]
c__listsizeNil [in Undecidability.L.Datatypes.Lists]
c__listsizeCons [in Undecidability.L.Datatypes.Lists]
c__listOfFlatTypeDecBound [in Complexity.Libs.CookPrelim.FlatFinTypes]
c__listOfFlatTypeDec [in Complexity.Libs.CookPrelim.FlatFinTypes]
c__ofFlatTypeDecBound [in Complexity.Libs.CookPrelim.FlatFinTypes]
c__ofFlatTypeDec [in Complexity.Libs.CookPrelim.FlatFinTypes]
c__flatPair [in Complexity.Libs.CookPrelim.FlatFinTypes]
c__steps [in Complexity.NP.SAT.CookLevin.Subproblems.BinaryCC]
c__final [in Complexity.NP.SAT.CookLevin.Subproblems.BinaryCC]
c__cards [in Complexity.NP.SAT.CookLevin.Subproblems.BinaryCC]
c__init [in Complexity.NP.SAT.CookLevin.Subproblems.BinaryCC]
c__width [in Complexity.NP.SAT.CookLevin.Subproblems.BinaryCC]
c__offset [in Complexity.NP.SAT.CookLevin.Subproblems.BinaryCC]
c__length [in Undecidability.L.Datatypes.List.List_nat]
c__ntherror [in Undecidability.L.Datatypes.List.List_nat]
c__eqbBool [in Complexity.NP.SAT.SAT_inNP]
c__cnfSize1 [in Complexity.NP.SAT.SAT_inNP]
c__clauseSize1 [in Complexity.NP.SAT.SAT_inNP]
c__prodLists2 [in Undecidability.L.Datatypes.List.List_extra]
c__prodLists1 [in Undecidability.L.Datatypes.List.List_extra]
c__seq [in Undecidability.L.Datatypes.List.List_extra]
c__termsize [in Undecidability.L.Datatypes.LTerm]
c__moduloBound [in Complexity.Libs.CookPrelim.PolyBounds]
c__concat [in Complexity.Libs.CookPrelim.PolyBounds]
c__reduction [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
c__hBinaryCCSize2 [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
c__hBinaryCCSize [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
c__hBinaryCC2 [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
c__hBinaryCC [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
c__hfinalSize [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
c__hfinalBound [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
c__hfinal [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
c__hcardsSize2 [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
c__hcardsSize1 [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
c__hcardsBound [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
c__hcards [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
c__hcardSize2 [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
c__hcardSize1 [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
c__hcard [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
c__hflatSize [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
c__hNatSize [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
c__hflat [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
c__hNatBound [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
c__hNat [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
c__repEl [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
c__repEl2 [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
c__compileTR' [in Complexity.L.AbstractMachines.FlatPro.Computable.Compile]
c__size [in Complexity.L.AbstractMachines.FlatPro.Computable.Compile]
c__sizeInputIndex [in Complexity.NP.SAT.CookLevin.Reductions.TMGenNP_fixed_singleTapeTM_to_FlatFunSingleTMGenNP]
c__reduction [in Complexity.NP.SAT.CookLevin.Reductions.TMGenNP_fixed_singleTapeTM_to_FlatFunSingleTMGenNP]
c__formulaMaxVarBound1 [in Complexity.NP.SAT.FSAT.FSAT]
c__formulaMaxVar [in Complexity.NP.SAT.FSAT.FSAT]
c__formulaBound2 [in Complexity.NP.SAT.FSAT.FSAT]
c__formulaBound1 [in Complexity.NP.SAT.FSAT.FSAT]
c__fgraphWfDecb [in Complexity.NP.Clique.FlatClique]
c__fedgesWfDecb [in Complexity.NP.Clique.FlatClique]
c__fedgeWfDecb [in Complexity.NP.Clique.FlatClique]
c__fedgesSymmetricDecb [in Complexity.NP.Clique.FlatClique]
c__fedgesSymmetricDecbStep [in Complexity.NP.Clique.FlatClique]
c__isfKCliqueDecb [in Complexity.NP.Clique.FlatClique]
c__isfCliqueDecb [in Complexity.NP.Clique.FlatClique]
c__allPairsOfEdgesDecbBound2 [in Complexity.NP.Clique.FlatClique]
c__allPairsOfEdgesDecbBound1 [in Complexity.NP.Clique.FlatClique]
c__allPairsOfEdgesDecb [in Complexity.NP.Clique.FlatClique]
c__allPairsOfEdgesDecbStep [in Complexity.NP.Clique.FlatClique]
c__fedgesEdgeInDecb [in Complexity.NP.Clique.FlatClique]
c__reduction [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
c__BinaryCCWfDecBound [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
c__BinaryCCWfDec [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
c__encodeTableau [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
c__encodeFinalConstraint [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
c__encodeFinalConstraintStep [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
c__encodeSubstringInLine [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
c__encodeSubstringInLine' [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
c__encodeCardsInAllLines [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
c__encodeCardsInLine [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
c__encodeCardsInLineP [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
c__encodeCardsAt [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
c__encodeCardAt [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
c__isValidFlatteningDecBound [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
c__isValidFlatteningDec [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
c__CCCardOfFlatTypeDecBound [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
c__CCCardOfFlatTypeDec [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
c__FlatCCWfDecBound [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
c__FlatCCWfDec [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
c__prcardOfSizeDecBound [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
c__prcardOfSizeDec [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
c__steps [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
c__final [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
c__cards [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
c__init [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
c__width [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
c__offset [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
c__Sigma [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
c__sizeCCCard [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
C_nondec [in Undecidability.L.Functions.EnumInt]
c__dupfreeb [in Undecidability.L.Datatypes.List.List_in]
c__list_incl_decb [in Undecidability.L.Datatypes.List.List_in]
c__listInDecb [in Undecidability.L.Datatypes.List.List_in]
c__trans [in Undecidability.L.TM.TMinL.TMinL_extract]
c__FCC_instance [in Complexity.NP.SAT.CookLevin.Reductions.FlatTCC_to_FlatCC]
c__CCCardsBound [in Complexity.NP.SAT.CookLevin.Reductions.FlatTCC_to_FlatCC]
c__CCCards [in Complexity.NP.SAT.CookLevin.Reductions.FlatTCC_to_FlatCC]
c__TCCCardToCCCardSize [in Complexity.NP.SAT.CookLevin.Reductions.FlatTCC_to_FlatCC]
c__TCCCardToCCCard [in Complexity.NP.SAT.CookLevin.Reductions.FlatTCC_to_FlatCC]
c__fold_right [in Undecidability.L.Datatypes.List.List_fold]
c__fold_left2 [in Undecidability.L.Datatypes.List.List_fold]
c__fold_left [in Undecidability.L.Datatypes.List.List_fold]
c__forallb [in Undecidability.L.Datatypes.List.List_fold]
c__powBound [in Complexity.Complexity.Definitions]
c__natsizeS [in Undecidability.L.Datatypes.LNat]
c__natsizeO [in Undecidability.L.Datatypes.LNat]
c__modulo [in Undecidability.L.Datatypes.LNat]
c__divmod [in Undecidability.L.Datatypes.LNat]
c__pow2 [in Undecidability.L.Datatypes.LNat]
c__pow1 [in Undecidability.L.Datatypes.LNat]
c__max2 [in Undecidability.L.Datatypes.LNat]
c__max1 [in Undecidability.L.Datatypes.LNat]
c__min2 [in Undecidability.L.Datatypes.LNat]
c__min1 [in Undecidability.L.Datatypes.LNat]
c__ltb [in Undecidability.L.Datatypes.LNat]
c__leb2 [in Undecidability.L.Datatypes.LNat]
c__leb [in Undecidability.L.Datatypes.LNat]
c__sub [in Undecidability.L.Datatypes.LNat]
c__sub1 [in Undecidability.L.Datatypes.LNat]
c__mult [in Undecidability.L.Datatypes.LNat]
c__mult1 [in Undecidability.L.Datatypes.LNat]
c__add1 [in Undecidability.L.Datatypes.LNat]
c__add [in Undecidability.L.Datatypes.LNat]
c__reduction [in Complexity.NP.Clique.kSAT_to_FlatClique]
c__Gflat [in Complexity.NP.Clique.kSAT_to_FlatClique]
c__makeEdges [in Complexity.NP.Clique.kSAT_to_FlatClique]
c__makeEdge [in Complexity.NP.Clique.kSAT_to_FlatClique]
c__cnfGetLiteral [in Complexity.NP.Clique.kSAT_to_FlatClique]
c__toVertex [in Complexity.NP.Clique.kSAT_to_FlatClique]
c__optLiteralsConflictDecb [in Complexity.NP.Clique.kSAT_to_FlatClique]
c__literalsConflictDecb [in Complexity.NP.Clique.kSAT_to_FlatClique]
c__allPositions [in Complexity.NP.Clique.kSAT_to_FlatClique]
c__reduction [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
c__tseytin [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
c__tseytinPBound1 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
c__tseytinP2 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
c__tseytinP1 [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
c__tseytinTrue [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
c__tseytinEquiv [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
c__tseytinNot [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
c__tseytinOr [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
c__tseytinAnd [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
c__eliminateOR [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
c__redFSize [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
c__tseytinSize [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
c__eliminateOrSize [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
c1 [in Complexity.L.AbstractMachines.FlatPro.Computable.Compile]
c2 [in Complexity.L.AbstractMachines.FlatPro.Computable.Compile]

D

Dec [in Undecidability.Shared.Libs.PSL.EqDec]
dec [in Undecidability.Shared.Libs.PSL.EqDec]
Dec [in Undecidability.Shared.Dec]
dec [in Undecidability.Shared.Dec]
decidable [in Undecidability.Synthetic.Definitions]
decider [in Undecidability.Synthetic.Definitions]
decides [in Undecidability.L.Computability.Decidability]
deClos [in Undecidability.L.Tactics.LClos]
decompile [in Undecidability.L.AbstractMachines.FlatPro.Programs]
dec2bool [in Undecidability.Shared.Libs.PSL.EqDec]
dec2bool [in Undecidability.Shared.Dec]
dedup [in Complexity.NP.SAT.SAT_inNP]
def [in Complexity.L.TM.TMunflatten]
defFin [in Complexity.L.TM.TMunflatten]
denoteComp [in Undecidability.L.Tactics.Reflection]
denoteTerm [in Undecidability.L.Tactics.Reflection]
depth [in Complexity.L.AbstractMachines.UnfoldHeap]
diamond [in Undecidability.L.Prelim.ARS]
discrete [in Undecidability.Synthetic.DecidabilityFacts]
disj [in Undecidability.L.Computability.Decidability]
disjoint [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
div [in Undecidability.Shared.Libs.DLW.Utils.gcd]
Diverge [in Undecidability.TM.Compound.Multi]
Diverge_Rel [in Undecidability.TM.Compound.Multi]
divides [in Undecidability.Shared.Libs.DLW.Utils.gcd]
divides_bool [in Undecidability.Shared.Libs.DLW.Utils.prime]
divmod_time [in Undecidability.L.Datatypes.LNat]
div2 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
div2_2p0 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
div2_2p1 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
DoAct [in Undecidability.TM.Basic.Mono]
doAct [in Undecidability.TM.Util.TM_facts]
DoAction [in Undecidability.TM.Single.StepTM]
DoAction [in Undecidability.TM.Univ.LowLevel]
DoActions [in Undecidability.TM.Single.StepTM]
DoActions_Loop_steps_cons_asym2 [in Complexity.TM.PrettyBounds.M2MBounds]
DoActions_Loop_steps_cons_asym [in Complexity.TM.PrettyBounds.M2MBounds]
DoActions_T [in Undecidability.TM.Single.StepTM]
DoActions_steps [in Undecidability.TM.Single.StepTM]
DoActions_Rel [in Undecidability.TM.Single.StepTM]
DoActions_Loop_T [in Undecidability.TM.Single.StepTM]
DoActions_Loop_steps_cons [in Undecidability.TM.Single.StepTM]
DoActions_Loop_steps_nil [in Undecidability.TM.Single.StepTM]
DoActions_Loop_Rel [in Undecidability.TM.Single.StepTM]
DoActions_Loop [in Undecidability.TM.Single.StepTM]
DoActions_Step_T [in Undecidability.TM.Single.StepTM]
DoActions_Step_steps_nil [in Undecidability.TM.Single.StepTM]
DoActions_Step_steps_cons [in Undecidability.TM.Single.StepTM]
DoActions_Step [in Undecidability.TM.Single.StepTM]
DoActions_Step_Rel [in Undecidability.TM.Single.StepTM]
DoAction_T [in Undecidability.TM.Single.StepTM]
DoAction_steps [in Undecidability.TM.Single.StepTM]
DoAction_Rel [in Undecidability.TM.Single.StepTM]
DoAction_size [in Undecidability.TM.Univ.LowLevel]
DoAction_Rel [in Undecidability.TM.Univ.LowLevel]
DoAction' [in Undecidability.TM.Univ.LowLevel]
DoAction'_steps [in Undecidability.TM.Univ.LowLevel]
DoAction'_Rel [in Undecidability.TM.Univ.LowLevel]
DoAction'_size [in Undecidability.TM.Univ.Univ]
DoAct_Rel [in Undecidability.TM.Basic.Mono]
DoAct_TM [in Undecidability.TM.Basic.Mono]
doAct_multi [in Undecidability.TM.Util.TM_facts]
doesHaltIn [in Undecidability.L.Functions.Eval]
dominatedWith [in Complexity.TM.PrettyBounds.PrettyBounds]
DoMove [in Undecidability.TM.Single.StepTM]
DoMove_steps [in Undecidability.TM.Single.StepTM]
DoMove_Rel [in Undecidability.TM.Single.StepTM]
Downlift [in Undecidability.TM.Hoare.HoareRegister]
DoWrite [in Undecidability.TM.Single.StepTM]
DoWrite_T [in Undecidability.TM.Single.StepTM]
DoWrite_steps [in Undecidability.TM.Single.StepTM]
DoWrite_Rel [in Undecidability.TM.Single.StepTM]
dummy [in Undecidability.Synthetic.Infinite]
dummy_sizes [in Undecidability.TM.Hoare.HoareRegister]
dummy_size [in Undecidability.TM.Hoare.HoareRegister]
dupfreeb [in Undecidability.L.Datatypes.List.List_in]
dupfreeb_time [in Undecidability.L.Datatypes.List.List_in]

E

E [in Complexity.HierarchyTheorem.TimeHierarchyTheorem]
E [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Ecnf [in Complexity.NP.Clique.kSAT_to_Clique]
elAt [in Undecidability.Shared.Libs.PSL.Lists.Position]
elem [in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
eliminateOR [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
eliminateOR_time [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
el_T [in Undecidability.Synthetic.ListEnumerabilityFacts]
embed [in Undecidability.Shared.embed_nat]
embedState [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
encBoolsL [in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
encBoolsListTM [in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
encBoolsTM [in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
encBoolsTM2boollist.M [in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
encBoolsTM2boollist.M__loop [in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
encBoolsTM2boollist.M__step [in Undecidability.TM.L.CompilerBoolFuns.EncBoolsTM_boolList]
encNatL [in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
encNatTM [in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
encodable_finType [in Undecidability.L.Datatypes.LFinType]
encodeCardAt [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
encodeCardAt_time [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
encodeCardsAt [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
encodeCardsAt_time [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
encodeCardsInAllLines [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
encodeCardsInAllLines_time [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
encodeCardsInLine [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
encodeCardsInLineP_time [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
encodeCardsInLine_time [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
encodeCardsInLine' [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
encodeFinalConstraint [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
encodeFinalConstraint_time [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
encodeFinalConstraint_step_time [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
encodeFinalConstraint_step [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
encodeFinalConstraint' [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
encodeListAt [in Complexity.NP.SAT.FSAT.FormulaEncoding]
encodeListAt_time [in Complexity.NP.SAT.FSAT.FormulaEncoding]
encodeLiteral [in Complexity.NP.SAT.FSAT.FormulaEncoding]
encodesPredicateAt [in Complexity.NP.SAT.FSAT.FormulaEncoding]
encodeSubstringInLine [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
encodeSubstringInLineP_time [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
encodeSubstringInLine_time [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
encodeSubstringInLine' [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
encodeTableau [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
encodeTableau_time [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
Encode_tape_hasSize [in Complexity.TM.PrettyBounds.M2MBounds]
encode_arguments [in Undecidability.L.Tactics.Extract]
encode_arguments [in Undecidability.L.Tactics.GenEncode]
Encode_N_size [in Undecidability.TM.Code.BinNumbers.EncodeBinNumbers]
encode_pos [in Undecidability.TM.Code.BinNumbers.EncodeBinNumbers]
Encode_tape_size [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
Encode_Com_size [in Undecidability.TM.L.Alphabets]
Encode_list_size [in Undecidability.TM.Code.Code]
encode_list [in Undecidability.TM.Code.Code]
Encode_option_size [in Undecidability.TM.Code.Code]
Encode_pair_size [in Undecidability.TM.Code.Code]
Encode_sum_size [in Undecidability.TM.Code.Code]
Encode_map [in Undecidability.TM.Code.Code]
encode_tapes [in Undecidability.TM.Single.EncodeTapes]
encode_tape [in Undecidability.TM.Single.EncodeTapes]
EncToBoollist.M [in Undecidability.TM.L.Transcode.Enc_to_Boollist]
EncToBoollist.M__loop [in Undecidability.TM.L.Transcode.Enc_to_Boollist]
EncToBoollist.M__step [in Undecidability.TM.L.Transcode.Enc_to_Boollist]
enc_bool_closing [in Undecidability.TM.L.Transcode.BoollistEnc]
enc_bool_nil [in Undecidability.TM.L.Transcode.BoollistEnc]
enc_bool_perElem [in Undecidability.TM.L.Transcode.BoollistEnc]
enumerable [in Undecidability.Synthetic.Definitions]
enumerable__T [in Undecidability.Synthetic.EnumerabilityFacts]
enumerator [in Undecidability.Synthetic.Definitions]
enumerator__T' [in Undecidability.Synthetic.EnumerabilityFacts]
envAddSSigma [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
envAddState [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
envBounded [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
envConst_bound [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
envOfFlatTypes [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
eqb [in Undecidability.L.Functions.EqBool]
eqdec [in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
eqrel [in Undecidability.TM.Util.Relations]
eqType_CS [in Undecidability.Shared.Libs.PSL.EqDec]
eqType_CS [in Undecidability.Shared.Dec]
equi [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
equi [in Undecidability.Shared.ListAutomation]
eq_inductive [in Undecidability.L.Tactics.Extract]
Eq_in [in Undecidability.TM.Util.Relations]
esimRules [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
eSize [in Undecidability.L.Computability.Enum]
euclid [in Undecidability.Shared.Libs.DLW.Utils.gcd]
eva [in Undecidability.L.Computability.Seval]
Eval [in Undecidability.L.Functions.Eval]
eval [in Undecidability.L.Util.L_facts]
evalClause [in Complexity.NP.SAT.SAT]
evalClause_time [in Complexity.NP.SAT.SAT_inNP]
evalCnf [in Complexity.NP.SAT.SAT]
evalCnf_time [in Complexity.NP.SAT.SAT_inNP]
evalEnvFin [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
evalEnvFlat [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
evalFormula [in Complexity.NP.SAT.FSAT.FSAT]
evalForTime [in Complexity.L.AbstractMachines.Computable.EvalForTime]
evalForTimeBool [in Complexity.L.AbstractMachines.Computable.EvalForTimeBool]
evalForTime__step [in Complexity.L.AbstractMachines.Computable.EvalForTime]
evalIn [in Undecidability.L.Util.L_facts]
evalLe [in Undecidability.L.Util.L_facts]
evalLiteral [in Complexity.NP.SAT.SAT]
evalLiteral_time [in Complexity.NP.SAT.SAT_inNP]
EvalL.M [in Undecidability.TM.L.Eval]
EvalL.retr_interpreter [in Undecidability.TM.L.Eval]
EvalL.retr_unfolder [in Undecidability.TM.L.Eval]
EvalL.steps [in Undecidability.TM.L.Eval]
EvalL.Σintern [in Undecidability.TM.L.Eval]
evalTime [in Undecidability.L.Tactics.ComputableTime]
evaluates [in Undecidability.L.Prelim.ARS]
evaluatesIn [in Undecidability.L.Prelim.ARS]
evalVar [in Complexity.NP.SAT.SharedSAT]
evalVar_time [in Complexity.NP.SAT.SAT_inNP]
execFlatTM [in Complexity.L.TM.TMflatFun]
execFlatTM_time [in Complexity.L.TM.TMflatComp]
execTM [in Undecidability.TM.Util.TM_facts]
execTM_p [in Undecidability.TM.Util.TM_facts]
execution [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
exh_size [in Undecidability.L.Computability.Enum]
existsb_time [in Complexity.NP.SAT.SAT_inNP]
expand [in Undecidability.Shared.Libs.DLW.Utils.prime]
explicitAssignment [in Complexity.NP.SAT.FSAT.FormulaEncoding]
explicit_bounds.poly__satVerifierb [in Complexity.L.ComparisonTimeBoundDerivation]
explicit_bounds.sat_verifierb_time [in Complexity.L.ComparisonTimeBoundDerivation]
explicit_bounds.c__satVerifierb [in Complexity.L.ComparisonTimeBoundDerivation]
explicit_bounds.poly__evalCnf [in Complexity.L.ComparisonTimeBoundDerivation]
explicit_bounds.evalCnf_time [in Complexity.L.ComparisonTimeBoundDerivation]
explicit_bounds.c__evalCnf [in Complexity.L.ComparisonTimeBoundDerivation]
explicit_bounds.poly__evalClause [in Complexity.L.ComparisonTimeBoundDerivation]
explicit_bounds.evalClause_time [in Complexity.L.ComparisonTimeBoundDerivation]
explicit_bounds.c__evalClause [in Complexity.L.ComparisonTimeBoundDerivation]
explicit_bounds.forallb_time [in Complexity.L.ComparisonTimeBoundDerivation]
explicit_bounds.c__forallb [in Complexity.L.ComparisonTimeBoundDerivation]
explicit_bounds.existsb_time [in Complexity.L.ComparisonTimeBoundDerivation]
explicit_bounds.c__existsb [in Complexity.L.ComparisonTimeBoundDerivation]
explicit_bounds.poly__evalLiteral [in Complexity.L.ComparisonTimeBoundDerivation]
explicit_bounds.evalLiteral_time [in Complexity.L.ComparisonTimeBoundDerivation]
explicit_bounds.c__evalLiteral [in Complexity.L.ComparisonTimeBoundDerivation]
explicit_bounds.poly__evalVar [in Complexity.L.ComparisonTimeBoundDerivation]
explicit_bounds.evalVar_time [in Complexity.L.ComparisonTimeBoundDerivation]
explicit_bounds.c__evalVar [in Complexity.L.ComparisonTimeBoundDerivation]
explicit_bounds.TODO [in Complexity.L.ComparisonTimeBoundDerivation]
explicit_bounds.list_in_decb_time [in Complexity.L.ComparisonTimeBoundDerivation]
explicit_bounds.c__listInDecb [in Complexity.L.ComparisonTimeBoundDerivation]
ExPTCC [in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
extended [in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
extended [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
extEq [in Undecidability.L.Tactics.Computable]
extract [in Undecidability.L.Tactics.Extract]
extractRes [in Complexity.L.AbstractMachines.Computable.EvalForTime]
extract_constr [in Undecidability.L.Tactics.Extract]

F

F [in Undecidability.Synthetic.Infinite]
f [in Undecidability.Synthetic.Infinite]
fact [in Undecidability.Shared.Libs.DLW.Utils.binomial]
FCC_instance_time [in Complexity.NP.SAT.CookLevin.Reductions.FlatTCC_to_FlatCC]
FCC_instance [in Complexity.NP.SAT.CookLevin.Reductions.FlatTCC_to_FlatCC]
FCI.C [in Undecidability.Shared.Libs.PSL.FCI]
FCI.F [in Undecidability.Shared.Libs.PSL.FCI]
fedges_wf_decb [in Complexity.NP.Clique.FlatUGraph]
fedges_symmetric_decb [in Complexity.NP.Clique.FlatUGraph]
fedges_edge_in_decb [in Complexity.NP.Clique.FlatUGraph]
fedges_wf [in Complexity.NP.Clique.FlatUGraph]
fedges_symmetric [in Complexity.NP.Clique.FlatUGraph]
fedges_wf_decb_time [in Complexity.NP.Clique.FlatClique]
fedges_symmetric_decb_time [in Complexity.NP.Clique.FlatClique]
fedges_symmetric_decb_step_time [in Complexity.NP.Clique.FlatClique]
fedges_symmetric_decb_step [in Complexity.NP.Clique.FlatClique]
fedges_edge_in_decb_time [in Complexity.NP.Clique.FlatClique]
fedge_wf_decb [in Complexity.NP.Clique.FlatUGraph]
fedge_eqb [in Complexity.NP.Clique.FlatUGraph]
fedge_wf [in Complexity.NP.Clique.FlatUGraph]
fedge_wf_decb_time [in Complexity.NP.Clique.FlatClique]
FGamma [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
fgraph_wf_decb [in Complexity.NP.Clique.FlatUGraph]
fgraph_edge_in_decb [in Complexity.NP.Clique.FlatUGraph]
fgraph_wf [in Complexity.NP.Clique.FlatUGraph]
fgraph_wf_decb_time [in Complexity.NP.Clique.FlatClique]
fill [in Undecidability.TM.Lifting.LiftTapes]
fill_default [in Undecidability.TM.Lifting.LiftTapes]
filterSome [in Complexity.Libs.CookPrelim.MorePrelim]
filterSome_time [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
fin [in Undecidability.Shared.Libs.DLW.Utils.fin_base]
finalSubstrings [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
find_max_fun [in Undecidability.Shared.Libs.DLW.Utils.sorting]
find_pow2 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
finfunc_table [in Undecidability.Shared.Libs.PSL.FiniteTypes.FiniteFunction]
finhBinaryCC [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
finite [in Undecidability.Shared.Libs.DLW.Utils.fin_base]
finite_t_upto [in Undecidability.Shared.Libs.DLW.Utils.fin_upto]
finite_t [in Undecidability.Shared.Libs.DLW.Utils.fin_base]
finite_t_dec_choice [in Undecidability.Shared.Libs.DLW.Utils.fin_choice]
finMax [in Undecidability.TM.Single.StepTM]
finMax' [in Undecidability.TM.Single.StepTM]
finMin [in Undecidability.TM.Single.StepTM]
finMin_opt [in Undecidability.TM.Single.StepTM]
finMTICards [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
finMTLCards [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
finMTRCards [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
finPreludeCards [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
FinR [in Undecidability.TM.Util.Prelim]
finRepr [in Complexity.Libs.CookPrelim.FlatFinTypes]
finReprEl [in Complexity.Libs.CookPrelim.FlatFinTypes]
finReprEl' [in Complexity.Libs.CookPrelim.FlatFinTypes]
finStateCards [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
finSucc [in Undecidability.TM.Single.StepTM]
finSucc_opt [in Undecidability.TM.Single.StepTM]
finSucc' [in Undecidability.TM.Single.StepTM]
finTapeCards [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
finType_cc [in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
finType_CS [in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
finType_eqb [in Undecidability.L.Datatypes.LFinType]
fin_to_nat [in Undecidability.TM.Single.StepTM]
Fin_initVect_nth [in Undecidability.Shared.Libs.PSL.FiniteTypes.VectorFin]
Fin_initVect [in Undecidability.Shared.Libs.PSL.FiniteTypes.VectorFin]
fin_t_upto [in Undecidability.Shared.Libs.DLW.Utils.fin_upto]
fin_t [in Undecidability.Shared.Libs.DLW.Utils.fin_base]
fin_baseEnvPrelude [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
fin_baseEnvHalt [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
fin_baseEnvNone [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
fin_baseEnv [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
fip_it [in Undecidability.Shared.Libs.PSL.FCI]
fip_closed [in Undecidability.Shared.Libs.PSL.FCI]
fip_monotone [in Undecidability.Shared.Libs.PSL.FCI]
flatAlphabet [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
flatAlphabet_time [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
FlatCCLang [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
FlatCC_wf_dec_time [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
FlatCC_wf_dec [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
FlatCC_wellformed [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
FlatClique [in Complexity.NP.Clique.FlatClique]
flatDelim [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
flatDelimC [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
FlatFunSingleTMGenNP [in Complexity.NP.SAT.CookLevin.Subproblems.SingleTMGenNP]
flatGamma [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
flatGamma_time [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
flatInl [in Complexity.Libs.CookPrelim.FlatFinTypes]
flatInr [in Complexity.Libs.CookPrelim.FlatFinTypes]
flatInr_flatNsig_time [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
flatInr_flatNsig [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
flatM [in Complexity.NP.SAT.CookLevin.Reductions.TMGenNP_fixed_singleTapeTM_to_FlatFunSingleTMGenNP]
flatMTICards [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
flatMTICards_time [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
flatMTLCards [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
flatMTLCards_time [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
flatMTRCards [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
flatMTRCards_time [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
flatNblank [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
flatNdelimC [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
flatNinit [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
flatNone [in Complexity.Libs.CookPrelim.FlatFinTypes]
flatNsig [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
flatNstar [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
flatOption [in Complexity.Libs.CookPrelim.FlatFinTypes]
flatPair [in Complexity.Libs.CookPrelim.FlatFinTypes]
flatPair_time [in Complexity.Libs.CookPrelim.FlatFinTypes]
flatPolarity [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
flatPolSigma [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
flatPolSigma_time [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
flatPreludeCards [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
flatPreludeCards_time [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
flatPreludeSig' [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
flatProd [in Complexity.Libs.CookPrelim.FlatFinTypes]
FlatSingleTMGenNP [in Complexity.NP.SAT.CookLevin.Subproblems.SingleTMGenNP]
flatSome [in Complexity.Libs.CookPrelim.FlatFinTypes]
flatStateCards [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
flatStateCards_time [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
flatStates [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
flatStateSigma [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
flatStates_time [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
flatSum [in Complexity.Libs.CookPrelim.FlatFinTypes]
flatTapeCards [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
flatTapeCards_time [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
flatTapeSigma [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
flatTapeSigma_time [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
FlatTCCLang [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
FlatTCC_wellformed [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
flattenConfig [in Complexity.L.TM.TMflatten]
flattenHalt [in Complexity.L.TM.TMflatten]
flattenHalt' [in Complexity.L.TM.TMflatten]
flattenHalt'' [in Complexity.L.TM.TMflatten]
flattenPolarity [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
flattenPreludeSig' [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
flattenTapes [in Complexity.L.TM.TMflatten]
flattenTM [in Complexity.L.TM.TMflatten]
flattenTrans [in Complexity.L.TM.TMflatten]
flat_finalSubstrings_time [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
flat_finalSubstrings_step_time [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
flat_finalSubstrings_step [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
flat_haltingStates_time [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
flat_initial_string_time [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
flat_finalSubstrings [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
flat_haltingStates [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
flat_initial_string [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
flat_baseEnvPrelude [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
flat_baseEnvHalt [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
flat_baseEnvNone [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
flat_baseEnv [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
fmap_reifier_t_default [in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
fmap_reifier_t [in Undecidability.Shared.Libs.DLW.Utils.bounded_quantification]
fold_opt [in Undecidability.TM.Util.Prelim]
fold_right_time [in Undecidability.L.Datatypes.List.List_fold]
fold_left_time [in Undecidability.L.Datatypes.List.List_fold]
fOpt [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
forallb_time [in Complexity.NP.SAT.SAT_inNP]
forallb_time [in Undecidability.L.Datatypes.List.List_fold]
forallb' [in Undecidability.TM.L.CompilerBoolFuns.Compiler_nat_facts]
forallb'' [in Undecidability.TM.L.CompilerBoolFuns.Compiler_nat_facts]
formula_maxVar_time [in Complexity.NP.SAT.FSAT.FSAT]
formula_size [in Complexity.NP.SAT.FSAT.FSAT]
formula_maxVar [in Complexity.NP.SAT.FSAT.FSAT]
formula_varsIn [in Complexity.NP.SAT.FSAT.FSAT]
formula_repr [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
FP [in Undecidability.Shared.Libs.PSL.Numbers]
fp [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
Fpolarity [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Frame [in Undecidability.TM.Hoare.HoareRegister]
FSAT [in Complexity.NP.SAT.FSAT.FSAT]
FstateSigma [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
fst_optBound_time [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
fst_optBound [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
fullAdder [in Undecidability.TM.Code.BinNumbers.PosAddTM]
fullInput [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
funcomp [in Undecidability.TM.Util.Prelim]
functional [in Undecidability.L.Prelim.ARS]
functional [in Undecidability.TM.Util.Relations]
funTable [in Undecidability.L.Functions.FinTypeLookup]
Fun' [in Undecidability.L.Complexity.GenericNary]
fun2vec [in Undecidability.Shared.Libs.DLW.Vec.vec]
f_map [in Undecidability.L.Functions.EnumInt]
f_filter [in Undecidability.L.Functions.EnumInt]
F' [in Undecidability.L.Computability.Synthetic]
F'' [in Undecidability.L.Computability.Synthetic]
F1 [in Undecidability.L.Computability.Synthetic]

G

g [in Undecidability.L.Computability.Enum]
G [in Undecidability.Synthetic.Infinite]
Gamma [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
garb [in Undecidability.TM.L.CompilerBoolFuns.Compiler]
gcd [in Undecidability.Shared.Libs.DLW.Utils.gcd]
Gcnf [in Complexity.NP.Clique.kSAT_to_Clique]
generateAlphabetFin [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
generateAlphabetFlat [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
generateAlphabetFlat_time [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
generateCanonical [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
generateCard [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
generateCardFlat [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
generateCardsForFin [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
generateCardsForFinHalt [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
generateCardsForFinNonHalt [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
generateCardsForFlat [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
generateCardsForFlatHalt [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
generateCardsForFlatHalt_time [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
generateCardsForFlatNonHalt [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
generateCardsForFlatNonHalt_time [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
generateCardsForFlat_time [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
generateCardsForFlat_step [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
generateCard_time [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
generateGammaFin [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
generateGammaFlat [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
generateGammaFlat_time [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
generatePolarityFin [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
generatePolarityFlat [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
generatePolarityFlat_time [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
generatePolarityVar [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
generatePolSigmaFin [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
generatePolSigmaFlat [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
generatePolSigmaFlat_time [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
generatePreludeSigPFin [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
generatePreludeSigPFlat [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
generatePreludeSigPFlat_time [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
generateSigVar [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
generateStatesFin [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
generateStatesFlat [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
generateStatesFlat_time [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
generateStateSigmaFin [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
generateStateSigmaFlat [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
generateStateSigmaFlat_time [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
generateStateSigmaVar [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
generateStateVar [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
generateTapeSigmaFin [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
generateTapeSigmaFlat [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
generateTapeSigmaFlat_time [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
generating [in Undecidability.Synthetic.Infinite]
GenNP [in Complexity.NP.L.GenNP]
GenNPBool [in Complexity.NP.L.GenNPBool]
GenNP' [in Complexity.NP.L.GenNP]
genTrans [in Complexity.L.TM.TMflatten]
gen_compiler [in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
gen_linker [in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
gen_constructor [in Undecidability.L.Tactics.Extract]
gen_list [in Undecidability.TM.L.CompilerBoolFuns.Compiler_nat_facts]
gen' [in Undecidability.Synthetic.Infinite]
get [in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
getat [in Undecidability.Shared.FinTypeEquiv]
getPosition [in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
Gflat [in Complexity.NP.Clique.kSAT_to_FlatClique]
Gflat_time [in Complexity.NP.Clique.kSAT_to_FlatClique]
godel_beta [in Undecidability.Shared.Libs.DLW.Utils.crt]
GoToCurrent [in Undecidability.TM.Single.StepTM]
GoToCurrent_T [in Undecidability.TM.Single.StepTM]
GoToCurrent_steps [in Undecidability.TM.Single.StepTM]
GoToCurrent_steps' [in Undecidability.TM.Single.StepTM]
GoToCurrent_Rel [in Undecidability.TM.Single.StepTM]
GoToHSB [in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
GoToHSB_Rel [in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
GoToLSB [in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
GoToLSB_start_Rel [in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
GoToLSB_start [in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
GoToLSB_Rel [in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
GoToNext [in Undecidability.TM.Single.StepTM]
GoToNext_T [in Undecidability.TM.Single.StepTM]
GoToNext_steps [in Undecidability.TM.Single.StepTM]
GoToNext_steps' [in Undecidability.TM.Single.StepTM]
GoToNext_Rel [in Undecidability.TM.Single.StepTM]
graph_of_TM [in Undecidability.TM.Univ.LowLevel]
graph_function [in Undecidability.TM.Univ.LowLevel]
graph_of_fun [in Undecidability.TM.Univ.LowLevel]
greatest_tape [in Complexity.TM.PrettyBounds.M2MBounds]
g_inv [in Undecidability.L.Computability.Enum]
g_nondec [in Undecidability.L.Functions.EnumInt]

H

h [in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
h [in Complexity.NP.SAT.CookLevin.Reductions.CC_to_BinaryCC]
HAdd [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
Halt [in Undecidability.L.TM.TMinL]
haltConf [in Undecidability.TM.Util.TM_facts]
haltConfFlat [in Complexity.L.TM.TMflatFun]
haltConfFlat_time [in Complexity.L.TM.TMflatComp]
haltingStates [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
HaltL [in Undecidability.L.L]
HaltMTM [in Undecidability.TM.TM]
halts [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
HaltSBTM [in Undecidability.TM.SBTM]
HaltSBTMu [in Undecidability.TM.SBTM]
HaltsOrDiverges_mTM_fixed [in Complexity.NP.TM.TMGenNP_fixed_mTM]
HaltsTM [in Undecidability.TM.TM]
halts_k [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
haltTime [in Undecidability.L.TM.TMinL.TMinL_extract]
HaltTM [in Undecidability.TM.TM]
halt_state [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
halt_liftL [in Undecidability.TM.Combinators.Switch]
Halt' [in Undecidability.L.TM.TMinL]
hasSpace [in Undecidability.L.Complexity.ResourceMeasures]
hasTime [in Undecidability.L.Complexity.ResourceMeasures]
hBinaryCC [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
hBinaryCC [in Complexity.NP.SAT.CookLevin.Reductions.CC_to_BinaryCC]
hBinaryCC_time [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
hcard [in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
hcard [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
hcards [in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
hcards [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
hcards_time [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
hcard_time [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
hCC [in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
HClos [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
hd [in Undecidability.L.Tactics.Extract]
head_of_const [in Undecidability.L.Tactics.Extract]
Heap [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
heapStep [in Complexity.L.AbstractMachines.FunctionalDefinitions]
heapStep_timeBound [in Complexity.L.AbstractMachines.Computable.HeapMachine]
heapStep_time [in Complexity.L.AbstractMachines.Computable.HeapMachine]
HEntr [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
hfinal [in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
hfinal [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
hfinal_time [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
hflat [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
hflat_time [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
hinit [in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
hinit [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
hNat [in Complexity.NP.SAT.CookLevin.Reductions.CC_to_BinaryCC]
hNat_time [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
hoffset [in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
hoffset [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
homomorphism [in Complexity.Libs.UniformHomomorphisms]
hsteps [in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
hsteps [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
hwidth [in Complexity.NP.SAT.CookLevin.Reductions.CC_homomorphisms]
hwidth [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
h' [in Complexity.NP.SAT.CookLevin.Reductions.CC_to_BinaryCC]

I

I [in Undecidability.L.Util.L_facts]
Id [in Undecidability.TM.Combinators.Combinators]
idbool [in Undecidability.TM.L.CompilerBoolFuns.Compiler_nat_facts]
If [in Undecidability.TM.Combinators.If]
ignoreParam [in Undecidability.TM.Util.Relations]
implList [in Undecidability.TM.Hoare.HoareRegister]
inb [in Undecidability.L.Datatypes.List.List_eqb]
inclp [in Undecidability.Shared.Libs.PSL.Lists.BaseLists]
Increment [in Undecidability.TM.Code.BinNumbers.PosIncrementTM]
IncrementTwice [in Undecidability.TM.Hoare.HoareExamples]
IncrementTwice_steps [in Undecidability.TM.Hoare.HoareExamples]
Increment_Rel [in Undecidability.TM.Code.BinNumbers.PosIncrementTM]
Increment_Loop [in Undecidability.TM.Code.BinNumbers.PosIncrementTM]
Increment_Loop_Rel [in Undecidability.TM.Code.BinNumbers.PosIncrementTM]
Increment_Step [in Undecidability.TM.Code.BinNumbers.PosIncrementTM]
Increment_Step_Rel [in Undecidability.TM.Code.BinNumbers.PosIncrementTM]
Increment_N_Rel [in Undecidability.TM.Code.BinNumbers.NTM]
Increment_N [in Undecidability.TM.Code.BinNumbers.NTM]
Incr2 [in Undecidability.TM.Hoare.HoareExamples]
Incr2_steps [in Undecidability.TM.Hoare.HoareExamples]
Incr3 [in Undecidability.TM.Hoare.HoareExamples]
Incr3_steps [in Undecidability.TM.Hoare.HoareExamples]
index [in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
index_const_Time [in Complexity.NP.SAT.CookLevin.Reductions.TMGenNP_fixed_singleTapeTM_to_FlatFunSingleTMGenNP]
inferHead [in Undecidability.L.Tactics.Extract]
inferHead' [in Undecidability.L.Tactics.Extract]
infinite [in Undecidability.Synthetic.Infinite]
inf_reduces [in Undecidability.Synthetic.InformativeDefinitions]
inf_semi_decidable [in Undecidability.Synthetic.InformativeDefinitions]
inf_enumerable [in Undecidability.Synthetic.InformativeDefinitions]
inf_decidable [in Undecidability.Synthetic.InformativeDefinitions]
inf_list_enumerable__T [in Undecidability.Synthetic.ListEnumerabilityFacts]
init [in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
init [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
init [in Complexity.L.AbstractMachines.AbstractSubstMachine]
initc [in Undecidability.TM.Util.TM_facts]
initialString [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
initLMGen [in Complexity.NP.L.LMGenNP]
initRight [in Undecidability.TM.Code.CodeTM]
initTapes [in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
initTapes_MU [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
initTapes_U [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
initTape_singleTapeTM [in Complexity.NP.TM.TMGenNP_fixed_mTM]
initValue [in Undecidability.TM.Code.CodeTM]
init__evalForTime [in Complexity.L.AbstractMachines.Computable.EvalForTime]
injective [in Undecidability.Shared.Libs.PSL.Bijection]
injective [in Undecidability.Synthetic.Infinite]
injectSizeFun [in Undecidability.TM.Code.CodeTM]
injectSymbols [in Undecidability.TM.Code.ChangeAlphabet]
injectTape [in Undecidability.TM.Lifting.LiftAlphabet]
injectTapes [in Undecidability.TM.Lifting.LiftAlphabet]
ino [in Complexity.Complexity.ONotation]
inO [in Complexity.Complexity.ONotation]
inOPoly [in Complexity.Complexity.ONotation]
inO_time_t__E [in Complexity.HierarchyTheorem.TimeHierarchyTheorem]
inP [in Complexity.Complexity.NP]
inp_eqb [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
insertCast [in Undecidability.L.Tactics.Computable]
insertKnownSymbol [in Undecidability.TM.Single.StepTM]
insertKnownSymbols [in Undecidability.TM.Single.StepTM]
insert_params [in Undecidability.L.Tactics.Extract]
instruction_compiler_sound [in Undecidability.Shared.Libs.DLW.Code.compiler_correction]
intersect [in Complexity.NP.SAT.SAT_inNP]
interval [in Undecidability.Shared.Libs.DLW.Utils.interval]
interval_union [in Undecidability.Shared.Libs.DLW.Utils.interval]
interval_disjoint [in Undecidability.Shared.Libs.DLW.Utils.interval]
inTimeo [in Complexity.Complexity.Definitions]
inTimeO [in Complexity.Complexity.Definitions]
inTimePoly [in Complexity.Complexity.NP]
inverse [in Undecidability.Shared.Libs.PSL.Bijection]
involution [in Complexity.Libs.CookPrelim.MorePrelim]
in_dec [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
in_vec [in Undecidability.Shared.Libs.DLW.Vec.vec]
In_t [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
in_interval [in Undecidability.Shared.Libs.DLW.Utils.interval]
in_code [in Undecidability.Shared.Libs.DLW.Code.subcode]
isBoundEntry [in Complexity.L.TM.TMflatComp]
isBoundRead [in Complexity.L.TM.TMflatComp]
isBoundTrans [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
isBoundTransTable [in Complexity.L.TM.TMunflatten]
isBoundTransTable_time [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
isBoundTransTable' [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
isBoundTrans_time [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
isBoundWrite [in Complexity.L.TM.TMflatComp]
isCard [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
isClique [in Complexity.NP.Clique.Clique]
IsCons [in Undecidability.TM.Single.StepTM]
IsCons_steps [in Undecidability.TM.Single.StepTM]
IsCons_Rel [in Undecidability.TM.Single.StepTM]
isfClique [in Complexity.NP.Clique.FlatClique]
isfClique_decb_time [in Complexity.NP.Clique.FlatClique]
isfClique_decb [in Complexity.NP.Clique.FlatClique]
IsFinal [in Undecidability.TM.Univ.LowLevel]
IsFinal_T [in Undecidability.TM.Univ.LowLevel]
IsFinal_steps [in Undecidability.TM.Univ.LowLevel]
IsFinal_Rel [in Undecidability.TM.Univ.LowLevel]
IsFinal_size [in Undecidability.TM.Univ.LowLevel]
IsFinal_size' [in Undecidability.TM.Univ.Univ]
isfKClique [in Complexity.NP.Clique.FlatClique]
isfKClique_decb_time [in Complexity.NP.Clique.FlatClique]
isfKClique_decb [in Complexity.NP.Clique.FlatClique]
isFlatEnvOf [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
isFlatGraphOf [in Complexity.NP.Clique.FlatUGraph]
isFlatListOf [in Complexity.Libs.CookPrelim.FlatFinTypes]
isFlatVertexOf [in Complexity.NP.Clique.FlatUGraph]
isFlatVerticesOf [in Complexity.NP.Clique.FlatUGraph]
isfVertex [in Complexity.NP.Clique.FlatUGraph]
isfVertex_decb [in Complexity.NP.Clique.FlatUGraph]
isHalting [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
isHalting_time [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
isInjFinfuncTable [in Complexity.L.TM.TMunflatten]
isInjFinfuncTable_time [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
isInjFinfuncTable_time [in Complexity.L.TM.TMflatComp]
isKClique [in Complexity.NP.Clique.Clique]
isLeftBlank [in Undecidability.TM.Single.EncodeTapes]
isMarked [in Undecidability.TM.Single.EncodeTapes]
isMarked' [in Undecidability.TM.Single.StepTM]
IsNil [in Undecidability.TM.Code.CaseList]
isNilBlank [in Undecidability.TM.Single.EncodeTapes]
isNilCons [in Undecidability.TM.Single.StepTM]
IsNil_steps [in Undecidability.TM.Code.CaseList]
IsNil_Rel [in Undecidability.TM.Code.CaseList]
IsOne [in Undecidability.TM.Code.BinNumbers.PosShiftTM]
IsOne_steps [in Undecidability.TM.Code.BinNumbers.PosShiftTM]
IsOne_Rel [in Undecidability.TM.Code.BinNumbers.PosShiftTM]
isOrigString [in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
isPreludeString [in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
isReturnMarker [in Undecidability.TM.Single.StepTM]
isRule [in Complexity.NP.SAT.CookLevin.Subproblems.CC]
isSome [in Undecidability.L.Datatypes.LOptions]
isSpecStateSym [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
isStart [in Undecidability.TM.Single.StepTM]
isStart [in Undecidability.TM.Code.Copy]
isStateSym [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
isStop [in Undecidability.TM.Code.Copy]
isSymbol [in Undecidability.TM.Single.EncodeTapes]
isValidCert [in Complexity.NP.SAT.CookLevin.Subproblems.SingleTMGenNP]
isValidFlatAct [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
isValidFlatCards [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
isValidFlatCards [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
isValidFlatFinal [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
isValidFlatFinal [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
isValidFlatInitial [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
isValidFlatInitial [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
isValidFlatStateSig [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
isValidFlatTape [in Complexity.L.TM.TMunflatten]
isValidFlatTapes [in Complexity.L.TM.TMunflatten]
isValidFlatTapes_time [in Complexity.L.TM.TMflatComp]
isValidFlatTape_time [in Complexity.L.TM.TMflatComp]
isValidFlattening [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
isValidFlattening [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
isValidFlattening_dec_time [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
isValidFlattening_dec [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
isValidFlatTM [in Complexity.L.TM.TMunflatten]
isValidFlatTM_time [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
isValidFlatTM_time [in Complexity.L.TM.TMflatComp]
isValidFlatTrans [in Complexity.L.TM.TMunflatten]
isValidFlatTrans_time [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
isValidInitialString [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
isValidInput [in Complexity.NP.SAT.CookLevin.Subproblems.SingleTMGenNP]
isVoid [in Undecidability.TM.Code.CodeTM]
isVoidBlank [in Undecidability.TM.Single.EncodeTapes]
isVoid_size [in Undecidability.TM.Code.CodeTM]
isxH [in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
isxH' [in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
is_halt_state [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
is_true [in Undecidability.Shared.Dec]
is_seq [in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
is_digit [in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
is_lcm [in Undecidability.Shared.Libs.DLW.Utils.gcd]
is_gcd [in Undecidability.Shared.Libs.DLW.Utils.gcd]
it [in Undecidability.Shared.Libs.PSL.Numbers]
iter [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
iterupN [in Complexity.L.Functions.IterupN]
it_time [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
it_i [in Undecidability.L.Tactics.Extract]
it_i' [in Undecidability.L.Tactics.Extract]

J

join [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
joinable [in Undecidability.L.Prelim.ARS]
jumpTarget [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
jumpTarget [in Undecidability.L.AbstractMachines.FlatPro.Programs]
JumpTarget [in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
JumpTarget_T [in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
JumpTarget_steps [in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
JumpTarget_Rel [in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
JumpTarget_size [in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
JumpTarget_Loop_T [in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
JumpTarget_Loop_steps [in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
JumpTarget_Loop_Rel [in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
JumpTarget_Loop_size [in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
JumpTarget_Loop [in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
jumpTarget_k [in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
JumpTarget_Step_T [in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
JumpTarget_Step_steps [in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
JumpTarget_Step_steps_CaseList [in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
JumpTarget_Step_steps_CaseCom [in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
JumpTarget_Step_Rel [in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
JumpTarget_Step_size [in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
JumpTarget_Step [in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]

K

K [in Undecidability.L.Util.L_facts]
k [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
kCNF_decb_time [in Complexity.NP.SAT.kSAT]
kCNF_decb [in Complexity.NP.SAT.kSAT]
kflat [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
kflat_time [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
knowsFirstSymbols [in Undecidability.TM.Single.StepTM]
kSAT [in Complexity.NP.SAT.kSAT]

L

l [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
L [in Undecidability.Synthetic.ReducibilityFacts]
lacc [in Undecidability.L.Computability.Acceptability]
lambda [in Undecidability.L.Util.L_facts]
lambdab [in Undecidability.L.Functions.Proc]
lambdaDepth [in Complexity.L.AbstractMachines.LambdaDepth]
lambdaDepthP [in Complexity.L.AbstractMachines.LambdaDepth]
largestVar [in Undecidability.L.AbstractMachines.LargestVar]
largestVarC [in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
largestVarC [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
largestVarCs [in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
largestVarCs [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
largestVarH [in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
largestVarH [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
largestVarHE [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
largestVarP [in Undecidability.L.AbstractMachines.FlatPro.Programs]
largestVarState [in Complexity.L.AbstractMachines.UnfoldTailRec]
largestVarT [in Undecidability.L.AbstractMachines.FlatPro.Programs]
largestVarTR' [in Complexity.L.AbstractMachines.Computable.LargestVar]
largestVarTR'_fuel [in Complexity.L.AbstractMachines.Computable.LargestVar]
lb_shift [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
lb_bots [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
lb_plus [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
lb_succ [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
lb_nat [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
lb_minus [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
lb_complement [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
lb_join [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
lb_meet [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
lb_pointwise [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
lb_mask_equiv [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
lb_mask_leb [in Undecidability.Shared.Libs.DLW.Utils.bool_list]
lcm [in Undecidability.Shared.Libs.DLW.Utils.gcd]
ldec [in Undecidability.L.Computability.Decidability]
leb_time [in Undecidability.L.Datatypes.LNat]
left [in Undecidability.TM.SBTM]
left [in Undecidability.TM.Util.TM_facts]
Leftmost.redWithMaxSizeL [in Undecidability.L.Complexity.ResourceMeasures]
left_inverse [in Undecidability.Shared.Libs.PSL.Bijection]
Length [in Undecidability.TM.Code.List.Length]
lengthEq [in Undecidability.L.Datatypes.List.List_extra]
lengthEq_time [in Undecidability.L.Datatypes.List.List_extra]
Length_T [in Undecidability.TM.Code.List.Length]
Length_steps [in Undecidability.TM.Code.List.Length]
Length_Rel [in Undecidability.TM.Code.List.Length]
Length_size [in Undecidability.TM.Code.List.Length]
Length_Loop_T [in Undecidability.TM.Code.List.Length]
Length_Loop_steps [in Undecidability.TM.Code.List.Length]
Length_Loop_Rel [in Undecidability.TM.Code.List.Length]
Length_Loop_size [in Undecidability.TM.Code.List.Length]
Length_Loop [in Undecidability.TM.Code.List.Length]
Length_Step_T [in Undecidability.TM.Code.List.Length]
Length_Step_steps [in Undecidability.TM.Code.List.Length]
Length_Step_Rel [in Undecidability.TM.Code.List.Length]
Length_Step_size [in Undecidability.TM.Code.List.Length]
Length_Step [in Undecidability.TM.Code.List.Length]
length_compiler [in Undecidability.Shared.Libs.DLW.Code.compiler]
lenumerates [in Undecidability.L.Computability.Synthetic]
le_f [in Undecidability.Synthetic.Infinite]
le_indd [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
LHaltsOrDiverges [in Complexity.NP.L.GenNP]
lift [in Undecidability.TM.Combinators.StateWhile]
LiftAlphabet [in Undecidability.TM.Lifting.LiftAlphabet]
LiftAlphabet_TM [in Undecidability.TM.Lifting.LiftAlphabet]
lifth [in Undecidability.TM.Combinators.StateWhile]
liftPhi [in Undecidability.L.Tactics.Reflection]
LiftSpec [in Undecidability.TM.Hoare.HoareRegister]
LiftSpec_single [in Undecidability.TM.Hoare.HoareRegister]
liftState [in Undecidability.TM.Combinators.StateWhile]
LiftTapes [in Undecidability.TM.Lifting.LiftTapes]
LiftTapes_TM [in Undecidability.TM.Lifting.LiftTapes]
LiftTapes_trans [in Undecidability.TM.Lifting.LiftTapes]
LiftTapes_T [in Undecidability.TM.Lifting.LiftTapes]
LiftTapes_Rel [in Undecidability.TM.Lifting.LiftTapes]
LiftTapes_eq_Rel [in Undecidability.TM.Lifting.LiftTapes]
LiftTapes_select_Rel [in Undecidability.TM.Lifting.LiftTapes]
lift_confR [in Undecidability.TM.Combinators.Switch]
lift_confL [in Undecidability.TM.Combinators.Switch]
lift_trans [in Undecidability.TM.Lifting.LiftAlphabet]
lift_sigma_tau_T [in Undecidability.TM.Lifting.LiftAlphabet]
lift_sigma_tau_Rel [in Undecidability.TM.Lifting.LiftAlphabet]
link [in Undecidability.Shared.Libs.DLW.Code.compiler]
linker [in Undecidability.Shared.Libs.DLW.Code.compiler]
listAnd [in Complexity.NP.SAT.FSAT.FormulaEncoding]
listAnd_time [in Complexity.NP.SAT.FSAT.FormulaEncoding]
listOr [in Complexity.NP.SAT.FSAT.FormulaEncoding]
listOr_time [in Complexity.NP.SAT.FSAT.FormulaEncoding]
listPreludeRules [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
list_weak_dec [in Undecidability.Shared.Libs.DLW.Utils.fin_dec]
list_prod_time [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
list_vec_full [in Undecidability.Shared.Libs.DLW.Vec.vec]
list_vec [in Undecidability.Shared.Libs.DLW.Vec.vec]
list_constructors [in Undecidability.L.Tactics.Extract]
list_discrim [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
list_assoc [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
list_in_map [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
list_repeat [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
list_injective [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
list_fun_inv [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
list_an [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
list_ofFlatType_dec_time [in Complexity.Libs.CookPrelim.FlatFinTypes]
list_ofFlatType_dec [in Complexity.Libs.CookPrelim.FlatFinTypes]
list_finReprEl' [in Complexity.Libs.CookPrelim.FlatFinTypes]
list_ofFlatType [in Complexity.Libs.CookPrelim.FlatFinTypes]
list_in_decb_time [in Complexity.NP.SAT.SAT_inNP]
list_bool_next_spec [in Undecidability.Shared.Libs.DLW.Utils.list_bool]
list_bool_next [in Undecidability.Shared.Libs.DLW.Utils.list_bool]
list_bool_nat [in Undecidability.Shared.Libs.DLW.Utils.list_bool]
list_bool_invalid [in Undecidability.Shared.Libs.DLW.Utils.list_bool]
list_bool_valid [in Undecidability.Shared.Libs.DLW.Utils.list_bool]
list_nat_bool [in Undecidability.Shared.Libs.DLW.Utils.list_bool]
list_has_dup_equiv [in Undecidability.Shared.Libs.DLW.Utils.php]
list_has_dup_cons_inv [in Undecidability.Shared.Libs.DLW.Utils.php]
list_sum [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
list_prod [in Undecidability.Shared.Libs.DLW.Utils.fin_base]
list_comperasion_cons [in Undecidability.TM.Compound.Compare]
list_comperasion [in Undecidability.TM.Compound.Compare]
list_eqbTime_leq [in Undecidability.L.Datatypes.List.List_eqb]
list_eqbTime [in Undecidability.L.Datatypes.List.List_eqb]
list_eqb [in Undecidability.L.Datatypes.List.List_eqb]
list_enumerable__T [in Undecidability.Synthetic.ListEnumerabilityFacts]
list_enumerator__T' [in Undecidability.Synthetic.ListEnumerabilityFacts]
list_enumerable [in Undecidability.Synthetic.ListEnumerabilityFacts]
list_enumerator [in Undecidability.Synthetic.ListEnumerabilityFacts]
list_incl_decb_time [in Undecidability.L.Datatypes.List.List_in]
list_in_decb_time [in Undecidability.L.Datatypes.List.List_in]
list_incl_decb [in Undecidability.L.Datatypes.List.List_in]
list_in_decb [in Undecidability.L.Datatypes.List.List_in]
list_finReprEl [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
list_isFlatEnvOf [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
list_prod [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
list_decode [in Undecidability.L.Functions.Decoding]
literalsConflict [in Complexity.NP.Clique.kSAT_to_Clique]
literalsConflict_decb_time [in Complexity.NP.Clique.kSAT_to_FlatClique]
literalsConflict_decb [in Complexity.NP.Clique.kSAT_to_FlatClique]
LL [in Undecidability.Synthetic.Infinite]
llength [in Undecidability.TM.Compound.MoveToSymbol]
llength [in Undecidability.TM.Compound.CopySymbols]
llength' [in Undecidability.TM.Compound.CopySymbols]
lmax [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
LMGenNP [in Complexity.NP.L.LMGenNP]
LMGenNP' [in Complexity.NP.L.LMGenNP]
LMHaltsOrDiverges [in Complexity.NP.L.LMGenNP]
LMtoTM.M [in Complexity.NP.TM.M_LM2TM]
LMtoTM.Realise [in Complexity.NP.TM.M_LM2TM]
LMtoTM.Rel [in Complexity.NP.TM.M_LM2TM]
LMtoTM.retr__nat [in Complexity.NP.TM.M_LM2TM]
LMtoTM.retr__pro [in Complexity.NP.TM.M_LM2TM]
LMtoTM.retr__HClos [in Complexity.NP.TM.M_LM2TM]
LMtoTM.retr__Heap [in Complexity.NP.TM.M_LM2TM]
LMtoTM.retr__listHClos [in Complexity.NP.TM.M_LM2TM]
LMtoTM.Ter [in Complexity.NP.TM.M_LM2TM]
LMtoTM.Terminates [in Complexity.NP.TM.M_LM2TM]
LMtoTM._Terminates [in Complexity.NP.TM.M_LM2TM]
LM_Lookup_nice.heap_global_greatest_address [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
LM_Lookup_nice.heap_global_greatest_address_helper [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
LM_Lookup_nice.heap_greatest_address2 [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
LM_Lookup_nice.heap_greatest_address [in Complexity.L.AbstractMachines.TM_LHeapInterpreter.LMBounds]
Lock [in Undecidability.Shared.Libs.PSL.Tactics.Tactics]
lookup [in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
lookup [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
lookup [in Undecidability.L.Functions.FinTypeLookup]
Lookup [in Undecidability.TM.Univ.LookupAssociativeListTM]
lookup [in Undecidability.TM.Univ.LookupAssociativeListTM]
Lookup [in Undecidability.TM.L.HeapInterpreter.LookupTM]
lookup [in Undecidability.Shared.Libs.PSL.FiniteTypes.FiniteFunction]
lookupTime [in Complexity.L.AbstractMachines.Computable.Lookup]
lookupTime [in Undecidability.L.Functions.FinTypeLookup]
lookup_hd [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
lookup_index_vector [in Undecidability.TM.Lifting.LiftTapes]
Lookup_T [in Undecidability.TM.Univ.LookupAssociativeListTM]
Lookup_steps [in Undecidability.TM.Univ.LookupAssociativeListTM]
Lookup_Rel [in Undecidability.TM.Univ.LookupAssociativeListTM]
Lookup_size [in Undecidability.TM.Univ.LookupAssociativeListTM]
Lookup_Loop_steps [in Undecidability.TM.Univ.LookupAssociativeListTM]
Lookup_Loop_size [in Undecidability.TM.Univ.LookupAssociativeListTM]
Lookup_Loop [in Undecidability.TM.Univ.LookupAssociativeListTM]
Lookup_Step_steps [in Undecidability.TM.Univ.LookupAssociativeListTM]
Lookup_Step_steps_CaseList [in Undecidability.TM.Univ.LookupAssociativeListTM]
Lookup_Step_steps_Compare [in Undecidability.TM.Univ.LookupAssociativeListTM]
Lookup_Step_size [in Undecidability.TM.Univ.LookupAssociativeListTM]
Lookup_Step [in Undecidability.TM.Univ.LookupAssociativeListTM]
Lookup_T [in Undecidability.TM.L.HeapInterpreter.LookupTM]
Lookup_steps [in Undecidability.TM.L.HeapInterpreter.LookupTM]
Lookup_Rel [in Undecidability.TM.L.HeapInterpreter.LookupTM]
Lookup_size [in Undecidability.TM.L.HeapInterpreter.LookupTM]
Lookup_Step_steps [in Undecidability.TM.L.HeapInterpreter.LookupTM]
Lookup_Step_steps_Nth' [in Undecidability.TM.L.HeapInterpreter.LookupTM]
Lookup_Step_steps_CaseOption [in Undecidability.TM.L.HeapInterpreter.LookupTM]
Lookup_Step_steps_CaseNat [in Undecidability.TM.L.HeapInterpreter.LookupTM]
Lookup_Step_size [in Undecidability.TM.L.HeapInterpreter.LookupTM]
Lookup_Step [in Undecidability.TM.L.HeapInterpreter.LookupTM]
Loop [in Undecidability.TM.Single.StepTM]
loop [in Undecidability.TM.Util.Prelim]
Loop [in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
loopM [in Undecidability.TM.Util.TM_facts]
loopMflat [in Complexity.L.TM.TMflatFun]
loopMflat_timeNice [in Complexity.L.TM.TMflatComp]
loopMflat_time [in Complexity.L.TM.TMflatComp]
loopSum [in Undecidability.L.Prelim.LoopSum]
loopSum_mono [in Undecidability.L.Prelim.LoopSum]
loopTime [in Undecidability.L.TM.TapeFuns]
Loop_steps_asym [in Complexity.TM.PrettyBounds.M2MBounds]
Loop_T [in Undecidability.TM.Single.StepTM]
Loop_steps [in Undecidability.TM.Single.StepTM]
Loop_Rel [in Undecidability.TM.Single.StepTM]
Loop_T [in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
Loop_steps [in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
Loop_Rel [in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
Loop_size [in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
lsum [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
ltb_time [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
ltb_time [in Undecidability.L.Datatypes.LNat]
LX [in Undecidability.Synthetic.Infinite]
L__f [in Complexity.HierarchyTheorem.TimeHierarchyTheorem]
L_computable [in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
L_bool_computable [in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
L_facts_mp [in Undecidability.L.Tactics.GenEncode]
L_bool_computable_closed [in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
L_computable_closed [in Undecidability.TM.L.CompilerBoolFuns.ClosedLAdmissible]
L_computable [in Undecidability.L.L]
L_Pro [in Complexity.Complexity.SpaceBoundsTime]
L_T [in Undecidability.Synthetic.ListEnumerabilityFacts]
L_list [in Undecidability.Synthetic.ListEnumerabilityFacts]
L_enum [in Undecidability.L.Computability.Synthetic]
L_nat [in Undecidability.L.Computability.Synthetic]
L_recognisable' [in Undecidability.L.Computability.Synthetic]
L_recognisable [in Undecidability.L.Computability.Synthetic]
L_enumerable [in Undecidability.L.Computability.Synthetic]
L_decidable [in Undecidability.L.Computability.Synthetic]
L__f [in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]

M

makeAllEvalEnv [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
makeAllEvalEnvFin [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
makeAllEvalEnvFlat [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
makeAllEvalEnvFlat_time [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
makeCards [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
makeCardsFin [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
makeCardsFlat [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
makeCardsFlat_time [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
makeCardsP_flat_time [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
makeCardsP_flat [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
makeCardsP_flat_step_time [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
makeCardsP_flat_step [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
makeCardsT [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
makeCards' [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
makeEdge [in Complexity.NP.Clique.kSAT_to_FlatClique]
makeEdges [in Complexity.NP.Clique.kSAT_to_FlatClique]
makeEdges_time [in Complexity.NP.Clique.kSAT_to_FlatClique]
makeEdge_time [in Complexity.NP.Clique.kSAT_to_FlatClique]
makeHalt [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
makeHaltFlat [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
makeHaltFlat_time [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
makeHalt_rules [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
makeNoneLeft [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
makeNoneLeftFlat [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
makeNoneLeft_rules [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
makeNoneRight [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
makeNoneRightFlat [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
makeNoneRight_rules [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
makeNoneStay [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
makeNoneStayFlat [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
makeNoneStay_rules [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
makeNone_base_flat_time [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
makeNone_base_flat [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
makeNone_base [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
makePreludeCards [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
makePreludeCards_flat_time [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
makePreludeCards_flat [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
makeSingleTape [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
makeSomeLeft [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
makeSomeLeftFlat [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
makeSomeLeft_rules [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
makeSomeRight [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
makeSomeRightFlat [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
makeSomeRight_rules [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
makeSomeStay [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
makeSomeStayFlat [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
makeSomeStay_rules [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
makeSome_base_flat_time [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
makeSome_base_flat [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
makeSome_base [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
makeUnivGraphTape [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
makeUnivStartStateTape [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
makeUnivTapes [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
makeUnivWorkingTape [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
many_subst [in Undecidability.TM.L.CompilerBoolFuns.NaryApp]
many_vars [in Undecidability.TM.L.CompilerBoolFuns.NaryApp]
many_app [in Undecidability.TM.L.CompilerBoolFuns.NaryApp]
many_lam [in Undecidability.TM.L.CompilerBoolFuns.NaryApp]
mapPolarity [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
mapTape [in Undecidability.TM.Util.TM_facts]
mapTapes [in Undecidability.TM.Util.TM_facts]
map_time [in Undecidability.L.Datatypes.List.List_basics]
map_vect_list [in Undecidability.TM.Single.StepTM]
map_act [in Undecidability.TM.Lifting.LiftAlphabet]
map_snd [in Undecidability.TM.Util.Prelim]
map_fst [in Undecidability.TM.Util.Prelim]
map_inr [in Undecidability.TM.Util.Prelim]
map_inl [in Undecidability.TM.Util.Prelim]
map_opt [in Undecidability.TM.Util.Prelim]
map_pair [in Undecidability.TM.Univ.LowLevel]
matchlem [in Undecidability.L.Tactics.GenEncode]
Max [in Undecidability.TM.Code.BinNumbers.PosCompareTM]
maxl [in Undecidability.L.Prelim.MoreList]
maxP [in Undecidability.L.Prelim.MoreBase]
maxSize [in Complexity.Complexity.UpToCPoly]
Max_Rel [in Undecidability.TM.Code.BinNumbers.PosCompareTM]
max_time [in Undecidability.L.Datatypes.LNat]
max_list_map_rec [in Undecidability.TM.PrettyBounds.MaxList]
max_list_map [in Undecidability.TM.PrettyBounds.MaxList]
max_list [in Undecidability.TM.PrettyBounds.MaxList]
max_list_rec [in Undecidability.TM.PrettyBounds.MaxList]
mconfigAsPair [in Undecidability.L.TM.TMEncoding]
mconfigFlat [in Complexity.L.TM.TMflat]
mconfig_for_sconfig [in Complexity.NP.SAT.CookLevin.Subproblems.TM_single]
measure_double_rect [in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
measure_rect [in Undecidability.Shared.Libs.DLW.Wf.measure_ind]
measure_rect3 [in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
measure_rect2 [in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
measure_rect [in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
Mf [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
Mfp [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
min_time [in Undecidability.L.Datatypes.LNat]
min_dec [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
Mirror [in Undecidability.TM.Combinators.Mirror]
mirrorConf [in Undecidability.TM.Combinators.Mirror]
MirrorTM [in Undecidability.TM.Combinators.Mirror]
Mirror_T [in Undecidability.TM.Combinators.Mirror]
Mirror_Rel [in Undecidability.TM.Combinators.Mirror]
Mirror_trans [in Undecidability.TM.Combinators.Mirror]
mirror_acts [in Undecidability.TM.Combinators.Mirror]
mirror_act [in Undecidability.TM.Combinators.Mirror]
mirror_move [in Undecidability.TM.Util.TM_facts]
mirror_tapes [in Undecidability.TM.Util.TM_facts]
mirror_tape [in Undecidability.TM.Util.TM_facts]
mkApp [in Undecidability.L.Tactics.Extract]
mkAppList [in Undecidability.L.Tactics.Extract]
mkArgList [in Complexity.L.TM.TMflatten]
mkFixMatch [in Undecidability.L.Tactics.Extract]
mkLam [in Undecidability.L.Tactics.Extract]
mkLApp [in Undecidability.L.Tactics.GenEncode]
mkMatch [in Undecidability.L.Tactics.GenEncode]
mkNat [in Undecidability.L.Tactics.Extract]
mkVar [in Undecidability.L.Tactics.Extract]
mkVarEnv [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
mkVarEnv_time [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
mkVarEnv_step_time [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
mkVarEnv_step [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
Mk_R_p [in Undecidability.TM.Basic.Mono]
Mk_Mono_TM [in Undecidability.TM.Basic.Mono]
MK_isVoid_multi [in Undecidability.TM.L.CompilerBoolFuns.Compiler]
MK_isVoid [in Undecidability.TM.L.CompilerBoolFuns.Compiler]
modulo_time [in Undecidability.L.Datatypes.LNat]
monotonic [in Complexity.Complexity.Monotonic]
Move [in Undecidability.TM.Basic.Mono]
movedToLeft [in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
MoveLeft [in Undecidability.TM.Code.Copy]
MoveLeft_steps [in Undecidability.TM.Code.Copy]
MoveLeft_Rel [in Undecidability.TM.Code.Copy]
MovePar [in Undecidability.TM.Compound.Multi]
MovePar_R [in Undecidability.TM.Compound.Multi]
MoveRight [in Undecidability.TM.Code.Copy]
MoveRight_steps [in Undecidability.TM.Code.Copy]
MoveRight_Rel [in Undecidability.TM.Code.Copy]
MoveToStart [in Undecidability.TM.Single.StepTM]
MoveToStart_T [in Undecidability.TM.Single.StepTM]
MoveToStart_steps [in Undecidability.TM.Single.StepTM]
MoveToStart_Rel [in Undecidability.TM.Single.StepTM]
MoveToSymbol [in Undecidability.TM.Compound.MoveToSymbol]
MoveToSymbol_L_Rel [in Undecidability.TM.Compound.MoveToSymbol]
MoveToSymbol_L [in Undecidability.TM.Compound.MoveToSymbol]
MoveToSymbol_Rel [in Undecidability.TM.Compound.MoveToSymbol]
MoveToSymbol_Step_Rel [in Undecidability.TM.Compound.MoveToSymbol]
MoveToSymbol_Step_Fun [in Undecidability.TM.Compound.MoveToSymbol]
MoveToSymbol_Step [in Undecidability.TM.Compound.MoveToSymbol]
MoveToSymbol_Rel_nice [in Complexity.TM.Compound.MoveToSymbol_niceSpec]
MoveValue [in Undecidability.TM.Code.Copy]
MoveValue_size [in Undecidability.TM.Code.Copy]
MoveValue_steps [in Undecidability.TM.Code.Copy]
MoveValue_Rel [in Undecidability.TM.Code.Copy]
MoveValue_size_y [in Undecidability.TM.Code.Copy]
MoveValue_size_x [in Undecidability.TM.Code.Copy]
MoveValue_size [in Undecidability.TM.Hoare.HoareExamples]
Move_Rel [in Undecidability.TM.Basic.Mono]
move_eqb [in Undecidability.L.TM.TMEncoding]
mscal [in Undecidability.Shared.Libs.DLW.Utils.sums]
msum [in Undecidability.Shared.Libs.DLW.Utils.sums]
mtiRules [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
mtlRules [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
mTMGenNP_fixed [in Complexity.NP.TM.TMGenNP_fixed_mTM]
mTMGenNP_fixed' [in Complexity.NP.TM.TMGenNP_fixed_mTM]
mtrRules [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
MU [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
mu [in Undecidability.Synthetic.Infinite]
mu [in Undecidability.L.Computability.MuRec]
Mult [in Undecidability.TM.Code.BinNumbers.PosMultTM]
Mult [in Undecidability.TM.Code.NatTM]
Mult [in Undecidability.TM.Hoare.HoareMult]
Mult [in Undecidability.TM.Hoare.HoareExamples]
MultiToMono.M [in Complexity.NP.TM.M_multi2mono]
MultiToMono.Rel [in Complexity.NP.TM.M_multi2mono]
MultiToMono.Ter [in Complexity.NP.TM.M_multi2mono]
Mult_Rel [in Undecidability.TM.Code.BinNumbers.PosMultTM]
Mult_Loop [in Undecidability.TM.Code.BinNumbers.PosMultTM]
Mult_Loop_Rel [in Undecidability.TM.Code.BinNumbers.PosMultTM]
Mult_Step [in Undecidability.TM.Code.BinNumbers.PosMultTM]
Mult_Step_Rel [in Undecidability.TM.Code.BinNumbers.PosMultTM]
mult_TR [in Undecidability.TM.Code.BinNumbers.PosMultTM]
mult_TR_cont [in Undecidability.TM.Code.BinNumbers.PosMultTM]
Mult_T [in Undecidability.TM.Code.NatTM]
Mult_steps [in Undecidability.TM.Code.NatTM]
Mult_Main_T [in Undecidability.TM.Code.NatTM]
Mult_Main_steps [in Undecidability.TM.Code.NatTM]
Mult_Loop_steps [in Undecidability.TM.Code.NatTM]
Mult_Step_steps [in Undecidability.TM.Code.NatTM]
Mult_Rel [in Undecidability.TM.Code.NatTM]
Mult_Main_Rel [in Undecidability.TM.Code.NatTM]
Mult_Loop_Rel [in Undecidability.TM.Code.NatTM]
Mult_Loop_space34 [in Undecidability.TM.Code.NatTM]
Mult_Step_Rel [in Undecidability.TM.Code.NatTM]
Mult_Main [in Undecidability.TM.Code.NatTM]
Mult_Loop [in Undecidability.TM.Code.NatTM]
Mult_Step [in Undecidability.TM.Code.NatTM]
Mult_N_Rel [in Undecidability.TM.Code.BinNumbers.NTM]
Mult_N [in Undecidability.TM.Code.BinNumbers.NTM]
Mult_size [in Undecidability.TM.Hoare.HoareMult]
Mult_steps [in Undecidability.TM.Hoare.HoareMult]
Mult_Loop_size [in Undecidability.TM.Hoare.HoareMult]
Mult_Loop_steps [in Undecidability.TM.Hoare.HoareMult]
Mult_Loop [in Undecidability.TM.Hoare.HoareMult]
Mult_Step_space [in Undecidability.TM.Hoare.HoareMult]
Mult_Step_steps [in Undecidability.TM.Hoare.HoareMult]
Mult_Step [in Undecidability.TM.Hoare.HoareMult]
mult_time [in Undecidability.L.Datatypes.LNat]
Mult_size [in Undecidability.TM.Hoare.HoareExamples]
Mult_size_bug [in Undecidability.TM.Hoare.HoareExamples]
Mult_steps [in Undecidability.TM.Hoare.HoareExamples]
Mult_Loop_size [in Undecidability.TM.Hoare.HoareExamples]
Mult_Loop_steps [in Undecidability.TM.Hoare.HoareExamples]
Mult_Loop [in Undecidability.TM.Hoare.HoareExamples]
Mult_Step_space [in Undecidability.TM.Hoare.HoareExamples]
Mult_Step_steps [in Undecidability.TM.Hoare.HoareExamples]
Mult_Step_Post [in Undecidability.TM.Hoare.HoareExamples]
Mult_Step [in Undecidability.TM.Hoare.HoareExamples]
MU_Rel [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
MU_size [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
MU_T [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
MU_steps [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
mu' [in Undecidability.L.Computability.MuRec]
mv [in Undecidability.TM.TM]
mv [in Undecidability.TM.SBTM]
M__mono [in Complexity.NP.TM.M_multi2mono]
M_main [in Undecidability.TM.L.CompilerBoolFuns.Compiler]
M_out [in Undecidability.TM.L.CompilerBoolFuns.Compiler]
M_init [in Undecidability.TM.L.CompilerBoolFuns.Compiler]
M_init' [in Undecidability.TM.L.CompilerBoolFuns.Compiler]
M_init_one [in Undecidability.TM.L.CompilerBoolFuns.Compiler]
M.M [in Complexity.NP.TM.LM_to_mTM]
M.Realise [in Complexity.NP.TM.LM_to_mTM]
M.Rel [in Complexity.NP.TM.LM_to_mTM]
M.Retr1 [in Complexity.NP.TM.LM_to_mTM]
M.Retr2 [in Complexity.NP.TM.LM_to_mTM]
M.sig [in Complexity.NP.TM.LM_to_mTM]
M.sig__reg [in Complexity.NP.TM.LM_to_mTM]
M.Terminates [in Complexity.NP.TM.LM_to_mTM]
M.time [in Complexity.NP.TM.LM_to_mTM]
M.ts__start [in Complexity.NP.TM.LM_to_mTM]
M1 [in Undecidability.TM.Code.CaseList]
M1_Rel [in Undecidability.TM.Code.CaseList]

N

name_of [in Undecidability.L.Tactics.Extract]
name_after_dot [in Undecidability.L.Prelim.StringBase]
name_after_dot' [in Undecidability.L.Prelim.StringBase]
natsLess [in Undecidability.L.Prelim.MoreList]
natToDigit [in Undecidability.Shared.Libs.DLW.Utils.utils_string]
nat_join [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
nat_meet [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
nat_lb_nat [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
nat_lb [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
nat_enum [in Undecidability.Synthetic.EnumerabilityFacts]
nat_enum_cls [in Undecidability.Shared.Libs.DLW.Utils.quotient]
nat_enc [in Undecidability.L.L]
nat_unenc [in Undecidability.L.Datatypes.LNat]
nat_sort [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
nat_list_insert [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
nat_sorted [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
nat_new [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
nat_pos [in Undecidability.Shared.Libs.DLW.Vec.pos]
nat2bool [in Undecidability.Shared.Libs.PSL.Prelim]
nat2bool [in Undecidability.Shared.Libs.DLW.Utils.bool_nat]
nat2pos [in Undecidability.Shared.Libs.DLW.Vec.pos]
Ncl [in Complexity.NP.Clique.kSAT_to_Clique]
Ncl [in Complexity.NP.Clique.kSAT_to_FlatClique]
Nop [in Undecidability.TM.Compound.Multi]
nop_action [in Undecidability.TM.Util.TM_facts]
Nop_Rel [in Undecidability.TM.Compound.Multi]
notHigherOrder [in Undecidability.L.Tactics.ComputableTime]
not_indexb [in Undecidability.TM.Lifting.LiftTapes]
not_index [in Undecidability.TM.Lifting.LiftTapes]
NPcomplete [in Complexity.Complexity.NP]
NPhard [in Complexity.Complexity.NP]
nth_error_time [in Undecidability.L.Datatypes.List.List_nat]
Nth' [in Undecidability.TM.Code.List.Nth]
Nth'_T [in Undecidability.TM.Code.List.Nth]
Nth'_Rel [in Undecidability.TM.Code.List.Nth]
Nth'_steps [in Undecidability.TM.Code.List.Nth]
Nth'_size [in Undecidability.TM.Code.List.Nth]
Nth'_Loop_steps [in Undecidability.TM.Code.List.Nth]
Nth'_Loop [in Undecidability.TM.Code.List.Nth]
Nth'_Loop_size [in Undecidability.TM.Code.List.Nth]
Nth'_Step_steps_CaseList [in Undecidability.TM.Code.List.Nth]
Nth'_Step_steps [in Undecidability.TM.Code.List.Nth]
Nth'_Step [in Undecidability.TM.Code.List.Nth]
Nth'_Step_size [in Undecidability.TM.Code.List.Nth]
NToDigit [in Undecidability.Shared.Libs.DLW.Utils.utils_string]
Null [in Undecidability.TM.Basic.Null]
NullTM [in Undecidability.TM.Basic.Null]
Null_Rel [in Undecidability.TM.Basic.Null]
N_to_optionPos [in Undecidability.TM.Code.BinNumbers.EncodeBinNumbers]
n_main [in Undecidability.TM.L.CompilerBoolFuns.Compiler]

O

ofClause [in Complexity.NP.Clique.kSAT_to_Clique]
ofFlatType [in Complexity.Libs.CookPrelim.FlatFinTypes]
ofFlatType_dec_time [in Complexity.Libs.CookPrelim.FlatFinTypes]
ofFlatType_dec [in Complexity.Libs.CookPrelim.FlatFinTypes]
Omega [in Undecidability.L.Util.L_facts]
omega [in Undecidability.L.Util.L_facts]
OmegaLift [in Undecidability.L.Datatypes.LBool]
on0 [in Undecidability.L.Tactics.ComputableDemo]
optBind [in Complexity.Libs.CookPrelim.MorePrelim]
optBound [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
optBound_time [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
optionFToSum [in Undecidability.L.Prelim.LoopSum]
optionMap_time [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
option_eqb [in Undecidability.L.Datatypes.LOptions]
option_enum [in Undecidability.Synthetic.EnumerabilityFacts]
option_decode [in Undecidability.L.Functions.Decoding]
optReturn [in Complexity.Libs.CookPrelim.MorePrelim]
opt_generateCardsForFlatNonHalt_time [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
opt_to_sum_unit [in Undecidability.TM.Single.StepTM]
opt_to_sum [in Undecidability.TM.Code.CaseSum]
opt_generateCardsForFlatNonHalt [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
opt_finReprEl' [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
opt_literalsConflict [in Complexity.NP.Clique.kSAT_to_Clique]
opt_to_list [in Undecidability.L.Computability.Synthetic]
opt_literalsConflict_decb_time [in Complexity.NP.Clique.kSAT_to_FlatClique]
opt_literalsConflict_decb [in Complexity.NP.Clique.kSAT_to_FlatClique]
out_interval [in Undecidability.Shared.Libs.DLW.Utils.interval]
out_code [in Undecidability.Shared.Libs.DLW.Code.subcode]
O_Rel [in Undecidability.TM.Code.CaseNat]

P

pFlipAlphabet [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
pi [in Undecidability.L.Computability.Acceptability]
pickx [in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
plus' [in Undecidability.TM.Util.Prelim]
pM [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
pm_id [in Undecidability.Shared.Libs.DLW.Vec.pos]
pm_comp [in Undecidability.Shared.Libs.DLW.Vec.pos]
pm_lift [in Undecidability.Shared.Libs.DLW.Vec.pos]
pm_ext_eq [in Undecidability.Shared.Libs.DLW.Vec.pos]
polarityFlip [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
polarityFlipGamma [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
polarityFlipSigma [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
polarityFlipTapeSigma [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
polarityRev [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
polSigma [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
poly__reductionSize [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
poly__reduction [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
poly__isValidFlatTM [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
poly__isValidFlatTrans [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
poly__isBoundTransTable [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
poly__isBoundTrans [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
poly__optBound [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
poly__isInjFinfuncTable [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
poly__allSameEntry [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
poly__reductionWfSize [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
poly__reductionWf [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
poly__flatFinalSubstringsSize [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
poly__finalSubstrings [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
poly__flatFinalSubstringsStep [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
poly__flatHaltingStates [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
poly__flatInitialStringSize [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
poly__flatInitialString [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
poly__zPflat [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
poly__zflat [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
poly__kflat [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
poly__allFlatCardsSize [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
poly__allFlatCardsLength [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
poly__allFlatCards [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
poly__flatPreludeCards [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
poly__makePreludeCardsFlat [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
poly__flatStateCards [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
poly__generateCardsForFlatLength [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
poly__generateCardsForFlat [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
poly__generateCardsForFlatHalt [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
poly__makeHaltFlat [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
poly__generateCardsForFlatNonHaltLength [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
poly__generateCardsForFlatNonHalt [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
poly__optGenerateCardsForFlatNonHalt [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
poly__makeNoneBaseFlat [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
poly__makeSomeBaseFlat [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
poly__flatTapeCardsLength [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
poly__flatTapeCards [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
poly__flatMTLCards [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
poly__flatMTICards [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
poly__flatMTRCards [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
poly__makeCardsFlat [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
poly__makeCards' [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
poly__filterSome [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
poly__makeAllEvalEnvFlatLength [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
poly__makeAllEvalEnvFlat [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
poly__prodLists [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
poly__mkVarEnv [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
poly__listProd [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
poly__generateCard [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
poly__generateAlphabetFlat [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
poly__generatePreludeSigPFlat [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
poly__generateGammaFlat [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
poly__generateStatesFlat [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
poly__generateTapeSigmaFlat [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
poly__generatePolSigmaFlat [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
poly__generateStateSigmaFlat [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
poly__generatePolarityFlat [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
poly__flatAlphabet [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
poly__flatGamma [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
poly__flatStates [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
poly__flatPolSigma [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
poly__encodeListAt [in Complexity.NP.SAT.FSAT.FormulaEncoding]
poly__tabulateStep [in Complexity.NP.SAT.FSAT.FormulaEncoding]
poly__kCNFDecb [in Complexity.NP.SAT.kSAT]
poly__listOfFlatTypeDec [in Complexity.Libs.CookPrelim.FlatFinTypes]
poly__ofFlatTypeDec [in Complexity.Libs.CookPrelim.FlatFinTypes]
poly__prodLists [in Complexity.Libs.CookPrelim.PolyBounds]
poly__concat [in Complexity.Libs.CookPrelim.PolyBounds]
poly__dupfreeb [in Complexity.Libs.CookPrelim.PolyBounds]
poly__listInclDecb [in Complexity.Libs.CookPrelim.PolyBounds]
poly__listInDecb [in Complexity.Libs.CookPrelim.PolyBounds]
poly__reduction [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
poly__hBinaryCC [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
poly__hfinal [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
poly__hcards [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
poly__hcard [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
poly__hflat [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
poly__hNat [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
poly__repEl [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
poly__formulaMaxVar [in Complexity.NP.SAT.FSAT.FSAT]
poly__fgraphWfDecb [in Complexity.NP.Clique.FlatClique]
poly__fedgesWfDecb [in Complexity.NP.Clique.FlatClique]
poly__fedgesSymmetricDecb [in Complexity.NP.Clique.FlatClique]
poly__isfKCliqueDecb [in Complexity.NP.Clique.FlatClique]
poly__isfCliqueDecb [in Complexity.NP.Clique.FlatClique]
poly__allPairsOfEdgesDecb [in Complexity.NP.Clique.FlatClique]
poly__BinaryCCWfDec [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
poly__encodeTableau [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
poly__encodeFinalConstraint [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
poly__encodeSubstringInLine' [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
poly__encodeSubstringInLineP1 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
poly__encodeCardsInAllLines [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
poly__encodeCardsInLine [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
poly__encodeCardsInLine' [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
poly__encodeCardsInLineP1 [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
poly__encodeCardsAt [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
poly__encodeCardAt [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
poly__isValidFlatteningDec [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
poly__CCCardOfFlatTypeDec [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
poly__FlatCCWfDec [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
poly__CCCards [in Complexity.NP.SAT.CookLevin.Reductions.FlatTCC_to_FlatCC]
poly__GflatSize [in Complexity.NP.Clique.kSAT_to_FlatClique]
poly__Gflat [in Complexity.NP.Clique.kSAT_to_FlatClique]
poly__makeEdges [in Complexity.NP.Clique.kSAT_to_FlatClique]
poly__makeEdge [in Complexity.NP.Clique.kSAT_to_FlatClique]
poly__cnfGetLiteral [in Complexity.NP.Clique.kSAT_to_FlatClique]
poly__toVertex [in Complexity.NP.Clique.kSAT_to_FlatClique]
poly__optLiteralsConflictDecb [in Complexity.NP.Clique.kSAT_to_FlatClique]
poly__allPositions [in Complexity.NP.Clique.kSAT_to_FlatClique]
poly__reduction [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
poly__tseytin [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
poly__tseytin' [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
poly__eliminateOR [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
Por [in Undecidability.L.Computability.Por]
pos [in Undecidability.Shared.Libs.PSL.Lists.Position]
posIn [in Undecidability.Shared.FinTypeEquiv]
position [in Undecidability.Shared.FinTypeEquiv]
pos_def [in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
pos_size [in Undecidability.TM.Code.BinNumbers.PosDefinitions]
pos_to_bits [in Undecidability.TM.Code.BinNumbers.PosDefinitions]
pos_nondec [in Undecidability.L.Datatypes.List.List_nat]
pos_not_diag [in Undecidability.Shared.Libs.DLW.Vec.pos]
pos_sub [in Undecidability.Shared.Libs.DLW.Vec.pos]
pos_nat [in Undecidability.Shared.Libs.DLW.Vec.pos]
pos_map [in Undecidability.Shared.Libs.DLW.Vec.pos]
pos_list [in Undecidability.Shared.Libs.DLW.Vec.pos]
pos_lr [in Undecidability.Shared.Libs.DLW.Vec.pos]
pos_both [in Undecidability.Shared.Libs.DLW.Vec.pos]
pos_right [in Undecidability.Shared.Libs.DLW.Vec.pos]
pos_left [in Undecidability.Shared.Libs.DLW.Vec.pos]
pos_eq_dec [in Undecidability.Shared.Libs.DLW.Vec.pos]
pos_O_any [in Undecidability.Shared.Libs.DLW.Vec.pos]
pos_nxt_inj [in Undecidability.Shared.Libs.DLW.Vec.pos]
pos_S_inv [in Undecidability.Shared.Libs.DLW.Vec.pos]
pos_O_inv [in Undecidability.Shared.Libs.DLW.Vec.pos]
pos_iso [in Undecidability.Shared.Libs.DLW.Vec.pos]
pos2nat [in Undecidability.Shared.Libs.DLW.Vec.pos]
pow [in Undecidability.L.Prelim.ARS]
power [in Undecidability.Shared.Libs.PSL.Lists.Power]
power_mono [in Undecidability.Shared.Libs.DLW.Utils.sums]
pow_time [in Undecidability.L.Datatypes.LNat]
pow2 [in Undecidability.Shared.Libs.DLW.Utils.utils_nat]
predicate [in Complexity.NP.SAT.FSAT.FormulaEncoding]
prefix [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
prefix [in Complexity.Libs.CookPrelim.MorePrelim]
prefixInjective [in Complexity.TM.Code.Decode]
prefix_spec [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
prefix_rect [in Undecidability.Shared.Libs.DLW.Utils.utils_list]
pRel [in Undecidability.TM.Util.TM_facts]
preludeInitialPred [in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
preludeInitialString [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
prime [in Undecidability.Shared.Libs.DLW.Utils.prime]
prime_or_div [in Undecidability.Shared.Libs.DLW.Utils.prime]
prime_bool [in Undecidability.Shared.Libs.DLW.Utils.prime]
prime_bool_rec [in Undecidability.Shared.Libs.DLW.Utils.prime]
Private_UnfoldClos.steps [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
Private_UnfoldClos.M [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
Private_UnfoldClos.steps_loop [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
Private_UnfoldClos.M__loop [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
Private_UnfoldClos.steps_step [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
Private_UnfoldClos.M__step [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
Private_UnfoldClos.Lookup [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
Private_UnfoldClos.retr_nat_stack [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
Private_UnfoldClos.retr_stackEl [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
Private_UnfoldClos.retr_nat_clos_var [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
Private_UnfoldClos.retr_nat_clos_var' [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
Private_UnfoldClos.retr_nat_clos_ad [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
Private_UnfoldClos.retr_nat_clos_ad' [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
Private_UnfoldClos.retr_com [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
Private_UnfoldClos.retr_pro [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
Private_UnfoldClos.retr_clos [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
proc [in Undecidability.L.Util.L_facts]
Proc [in Undecidability.L.Tactics.Reflection]
prodLists [in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
prodLists_time [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
prodLists_time [in Undecidability.L.Datatypes.List.List_extra]
prod_eqb [in Undecidability.L.Datatypes.LProd]
prod_enum [in Undecidability.Synthetic.EnumerabilityFacts]
prod_decode [in Undecidability.L.Functions.Decoding]
projVars [in Complexity.NP.SAT.FSAT.FormulaEncoding]
PTCCLang [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
PTCC_wellformed [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
pTM [in Undecidability.TM.Util.TM_facts]
pure [in Undecidability.Shared.Libs.PSL.FiniteTypes.Arbitrary]
pushHSB [in Undecidability.TM.Code.BinNumbers.PosDefinitions]
PushHSB [in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
PushHSB_steps [in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
PushHSB_Rel [in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
put [in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
put [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
Put [in Undecidability.TM.L.HeapInterpreter.StepTM]
putEndAtFirst [in Complexity.NP.TM.M_multi2mono]
putFirstAtEnd [in Complexity.NP.TM.M_multi2mono]
Put_T [in Undecidability.TM.L.HeapInterpreter.StepTM]
Put_steps [in Undecidability.TM.L.HeapInterpreter.StepTM]
Put_Rel [in Undecidability.TM.L.HeapInterpreter.StepTM]
Put_size [in Undecidability.TM.L.HeapInterpreter.StepTM]

Q

quotient [in Undecidability.Shared.Libs.DLW.Utils.quotient]

R

R [in Undecidability.L.Util.L_facts]
r [in Undecidability.L.Util.L_facts]
Rarrow [in Undecidability.L.Complexity.GenericNary]
rClosed [in Undecidability.L.Tactics.Reflection]
rClosed_decb [in Undecidability.L.Tactics.Reflection]
rClosed_decb' [in Undecidability.L.Tactics.Reflection]
rcomp [in Undecidability.L.Prelim.ARS]
rcomp [in Undecidability.TM.Util.Relations]
rCompAppCount [in Undecidability.L.Tactics.Reflection]
rCompBeta [in Undecidability.L.Tactics.Reflection]
rCompSeval [in Undecidability.L.Tactics.Reflection]
rCompSeval' [in Undecidability.L.Tactics.Reflection]
rComp_ind_deep [in Undecidability.L.Tactics.Reflection]
rComp_ind_deep' [in Undecidability.L.Tactics.Reflection]
rDeClos [in Undecidability.L.Tactics.Reflection]
ReadChar [in Undecidability.TM.Basic.Mono]
ReadChar_Sem [in Undecidability.TM.Basic.Mono]
ReadChar_Rel [in Undecidability.TM.Basic.Mono]
ReadChar_at_Rel [in Undecidability.TM.Compound.Multi]
ReadChar_at [in Undecidability.TM.Compound.Multi]
ReadChar2 [in Undecidability.TM.Basic.Duo]
ReadChar2_Sem [in Undecidability.TM.Basic.Duo]
ReadChar2_Rel [in Undecidability.TM.Basic.Duo]
ReadCurrent [in Undecidability.TM.Single.StepTM]
ReadCurrent [in Undecidability.TM.Univ.LowLevel]
ReadCurrentSymbols [in Undecidability.TM.Single.StepTM]
ReadCurrentSymbols_T [in Undecidability.TM.Single.StepTM]
ReadCurrentSymbols_steps [in Undecidability.TM.Single.StepTM]
ReadCurrentSymbols_Rel [in Undecidability.TM.Single.StepTM]
ReadCurrentSymbols_Loop_T [in Undecidability.TM.Single.StepTM]
ReadCurrentSymbols_Loop_steps_cons [in Undecidability.TM.Single.StepTM]
ReadCurrentSymbols_Loop_steps_nil [in Undecidability.TM.Single.StepTM]
ReadCurrentSymbols_Loop_Rel [in Undecidability.TM.Single.StepTM]
ReadCurrentSymbols_Loop [in Undecidability.TM.Single.StepTM]
ReadCurrentSymbols_Step_T [in Undecidability.TM.Single.StepTM]
ReadCurrentSymbols_Step_steps_nil [in Undecidability.TM.Single.StepTM]
ReadCurrentSymbols_Step_steps_cons [in Undecidability.TM.Single.StepTM]
ReadCurrentSymbols_Step [in Undecidability.TM.Single.StepTM]
ReadCurrentSymbols_Step_Rel [in Undecidability.TM.Single.StepTM]
ReadCurrent_steps [in Undecidability.TM.Single.StepTM]
ReadCurrent_Rel [in Undecidability.TM.Single.StepTM]
ReadCurrent_size [in Undecidability.TM.Univ.LowLevel]
ReadCurrent_Rel [in Undecidability.TM.Univ.LowLevel]
ReadCurrent' [in Undecidability.TM.Univ.LowLevel]
ReadCurrent'_steps [in Undecidability.TM.Univ.LowLevel]
ReadCurrent'_Rel [in Undecidability.TM.Univ.LowLevel]
ReadCurrent'_size [in Undecidability.TM.Univ.Univ]
ReadPosSym [in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
ReadPosSym_Rel [in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
ReadPosSym2 [in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
ReadPosSym2_Rel [in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
Realise [in Undecidability.TM.Util.TM_facts]
RealiseIn [in Undecidability.TM.Util.TM_facts]
rect2 [in Undecidability.Shared.Libs.DLW.Vec.vec]
redLe [in Undecidability.L.Util.L_facts]
reduces [in Undecidability.Synthetic.Definitions]
reduction [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
reduction [in Complexity.NP.SAT.CookLevin.Reductions.TMGenNP_fixed_singleTapeTM_to_FlatFunSingleTMGenNP]
reduction [in Undecidability.Synthetic.Definitions]
reduction [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
reduction [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
reduction [in Complexity.NP.Clique.kSAT_to_Clique]
reduction [in Complexity.NP.SAT.CookLevin.Reductions.CC_to_BinaryCC]
reduction [in Complexity.NP.Clique.kSAT_to_FlatClique]
reduction [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
reduction_time [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
reduction_wf_time [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
reduction_time [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
reduction_time [in Complexity.NP.SAT.CookLevin.Reductions.TMGenNP_fixed_singleTapeTM_to_FlatFunSingleTMGenNP]
reduction_time [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
reduction_wf [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
reduction_time [in Complexity.NP.Clique.kSAT_to_FlatClique]
reduction_time [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
redWithMaxSizeS [in Complexity.L.AbstractMachines.AbstractSubstMachine]
reflects [in Undecidability.Synthetic.Definitions]
reflexive [in Undecidability.L.Prelim.ARS]
Rel [in Undecidability.TM.Util.Relations]
Relabel [in Undecidability.TM.Combinators.Combinators]
rel_iter_seq [in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
rel_iter_bound [in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
rel_iter [in Undecidability.Shared.Libs.DLW.Utils.rel_iter]
rem [in Complexity.Libs.Pigeonhole]
rem [in Undecidability.Shared.Libs.PSL.Lists.Removal]
rem [in Undecidability.Shared.Libs.DLW.Utils.gcd]
removeLSB [in Undecidability.TM.Code.BinNumbers.PosDefinitions]
rep [in Undecidability.Shared.Libs.PSL.Lists.Power]
repEl [in Complexity.Libs.CookPrelim.MorePrelim]
repEl_time [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
replace [in Undecidability.Shared.Libs.PSL.Lists.Position]
reprConfig [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
reprConfig' [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
reprTape [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
reprTape' [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
Reset [in Undecidability.TM.Code.Copy]
ResetEmpty [in Undecidability.TM.Code.Copy]
ResetEmpty_steps [in Undecidability.TM.Code.Copy]
ResetEmpty_Rel [in Undecidability.TM.Code.Copy]
ResetEmpty_size [in Undecidability.TM.Code.Copy]
ResetEmpty1 [in Undecidability.TM.Code.Copy]
ResetEmpty1_steps [in Undecidability.TM.Code.Copy]
ResetEmpty1_Rel [in Undecidability.TM.Code.Copy]
ResetEmpty1_size [in Undecidability.TM.Code.Copy]
Reset_Terminates [in Undecidability.TM.Code.Copy]
Reset_steps [in Undecidability.TM.Code.Copy]
Reset_Rel [in Undecidability.TM.Code.Copy]
Reset_size [in Undecidability.TM.Code.Copy]
restrict [in Undecidability.TM.Util.Relations]
restrict [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
restrictBy [in Complexity.Complexity.Subtypes]
resType [in Undecidability.L.Tactics.Computable]
retract [in Undecidability.Shared.Libs.PSL.Retracts]
retract_join_g [in Undecidability.Shared.Libs.PSL.Retracts]
retract_join_f [in Undecidability.Shared.Libs.PSL.Retracts]
retract_sum_g [in Undecidability.Shared.Libs.PSL.Retracts]
retract_sum_f [in Undecidability.Shared.Libs.PSL.Retracts]
retract_inr_g [in Undecidability.Shared.Libs.PSL.Retracts]
retract_inr_f [in Undecidability.Shared.Libs.PSL.Retracts]
retract_inl_g [in Undecidability.Shared.Libs.PSL.Retracts]
retract_inl_f [in Undecidability.Shared.Libs.PSL.Retracts]
retract_g_inv [in Undecidability.Shared.Libs.PSL.Retracts]
retract_g_adjoint [in Undecidability.Shared.Libs.PSL.Retracts]
retr_comp_g [in Undecidability.Shared.Libs.PSL.Retracts]
retr_comp_f [in Undecidability.Shared.Libs.PSL.Retracts]
retr_value_sig [in Undecidability.TM.Univ.LowLevel]
retr_value_sigGraph [in Undecidability.TM.Univ.LowLevel]
retr_key_sig [in Undecidability.TM.Univ.LowLevel]
retr_key_sigGraph [in Undecidability.TM.Univ.LowLevel]
retr_act_sig [in Undecidability.TM.Univ.LowLevel]
retr_act_sigGraph [in Undecidability.TM.Univ.LowLevel]
retr_sigCurrentSymbol_sig [in Undecidability.TM.Univ.LowLevel]
retr_sigCurrentSymbol_sigGraph [in Undecidability.TM.Univ.LowLevel]
retr_sigNextState_sig [in Undecidability.TM.Univ.LowLevel]
retr_sigNextState_sigGraph [in Undecidability.TM.Univ.LowLevel]
retr_sigCurrentStateFinal_sig [in Undecidability.TM.Univ.LowLevel]
retr_sigCurrentStateFinal_sigGraph [in Undecidability.TM.Univ.LowLevel]
retr_sigCurrentState_sig [in Undecidability.TM.Univ.LowLevel]
retr_sigCurrentState_sigGraph [in Undecidability.TM.Univ.LowLevel]
retr_sigCurrentStateNumber_sig [in Undecidability.TM.Univ.LowLevel]
retr_sigCurrentStateNumber_sigGraph [in Undecidability.TM.Univ.LowLevel]
retr_sigSimTape_sigUniv [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
retr_sigSimGraph_sigUniv [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
retr_nat_prog [in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
retr_closure_step [in Undecidability.TM.L.HeapInterpreter.StepTM]
retr_hent_step [in Undecidability.TM.L.HeapInterpreter.StepTM]
retr_hent'_step [in Undecidability.TM.L.HeapInterpreter.StepTM]
retr_clos_step_hent [in Undecidability.TM.L.HeapInterpreter.StepTM]
retr_nat_step_hent [in Undecidability.TM.L.HeapInterpreter.StepTM]
retr_nat_step_clos_var [in Undecidability.TM.L.HeapInterpreter.StepTM]
retr_nat_clos_var [in Undecidability.TM.L.HeapInterpreter.StepTM]
retr_nat_step_clos_ad [in Undecidability.TM.L.HeapInterpreter.StepTM]
retr_nat_clos_ad [in Undecidability.TM.L.HeapInterpreter.StepTM]
retr_tok_step [in Undecidability.TM.L.HeapInterpreter.StepTM]
retr_pro_step [in Undecidability.TM.L.HeapInterpreter.StepTM]
retr_pro_clos [in Undecidability.TM.L.HeapInterpreter.StepTM]
retr_clos_step [in Undecidability.TM.L.HeapInterpreter.StepTM]
retr_closures_step [in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
retr_heap_step [in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
retr_sig_sigY [in Undecidability.TM.Univ.LookupAssociativeListTM]
retr_sig_sigX [in Undecidability.TM.Univ.LookupAssociativeListTM]
retr_hent'_lookup [in Undecidability.TM.L.HeapInterpreter.LookupTM]
retr_hent'_heap [in Undecidability.TM.L.HeapInterpreter.LookupTM]
retr_hent_lookup [in Undecidability.TM.L.HeapInterpreter.LookupTM]
retr_hent_heap [in Undecidability.TM.L.HeapInterpreter.LookupTM]
retr_clos_lookup_heap [in Undecidability.TM.L.HeapInterpreter.LookupTM]
retr_clos_heap [in Undecidability.TM.L.HeapInterpreter.LookupTM]
retr_nat_lookup_entry [in Undecidability.TM.L.HeapInterpreter.LookupTM]
retr_nat_heap_entry [in Undecidability.TM.L.HeapInterpreter.LookupTM]
retr_nat_lookup_clos_var [in Undecidability.TM.L.HeapInterpreter.LookupTM]
retr_nat_clos_var [in Undecidability.TM.L.HeapInterpreter.LookupTM]
retr_nat_lookup_clos_ad [in Undecidability.TM.L.HeapInterpreter.LookupTM]
retr_nat_clos_ad [in Undecidability.TM.L.HeapInterpreter.LookupTM]
retr_pro [in Undecidability.TM.L.CompilerBoolFuns.Compiler]
retr_clos [in Undecidability.TM.L.CompilerBoolFuns.Compiler]
retr_closs [in Undecidability.TM.L.CompilerBoolFuns.Compiler]
retr_intern [in Undecidability.TM.L.CompilerBoolFuns.Compiler]
retr_bools [in Undecidability.TM.L.CompilerBoolFuns.Compiler]
Return [in Undecidability.TM.Combinators.Combinators]
Rev [in Undecidability.TM.Code.List.Rev]
rev_concat [in Undecidability.L.Datatypes.List.List_basics]
Rev_T [in Undecidability.TM.Code.List.Rev]
Rev_steps [in Undecidability.TM.Code.List.Rev]
Rev_Rel [in Undecidability.TM.Code.List.Rev]
Rev_size [in Undecidability.TM.Code.List.Rev]
Rev_Append_T [in Undecidability.TM.Code.List.Rev]
Rev_Append_steps [in Undecidability.TM.Code.List.Rev]
Rev_Append_Rel [in Undecidability.TM.Code.List.Rev]
Rev_Append_size [in Undecidability.TM.Code.List.Rev]
Rev_Append [in Undecidability.TM.Code.List.Rev]
Rev_Step_T [in Undecidability.TM.Code.List.Rev]
Rev_Step_steps [in Undecidability.TM.Code.List.Rev]
Rev_Step_Rel [in Undecidability.TM.Code.List.Rev]
Rev_Step_size [in Undecidability.TM.Code.List.Rev]
Rev_Step [in Undecidability.TM.Code.List.Rev]
rev_string [in Undecidability.L.Prelim.StringBase]
rfix [in Undecidability.TM.Util.Relations]
rho [in Undecidability.L.Util.L_facts]
right [in Undecidability.TM.SBTM]
right [in Undecidability.TM.Util.TM_facts]
right_inverse [in Undecidability.Shared.Libs.PSL.Bijection]
rimplication [in Undecidability.TM.Util.Relations]
rincl_fin [in Undecidability.Shared.Libs.DLW.Wf.wf_incl]
rIntersection [in Undecidability.TM.Util.Relations]
rintersection [in Undecidability.TM.Util.Relations]
rlength [in Undecidability.TM.Compound.MoveToSymbol]
rlength [in Undecidability.TM.Compound.CopySymbols]
rlength' [in Undecidability.TM.Compound.CopySymbols]
rPow [in Undecidability.L.Tactics.Reflection]
rSubstList [in Undecidability.L.Tactics.Reflection]
Rtuple [in Undecidability.L.Complexity.GenericNary]
rUnion [in Undecidability.TM.Util.Relations]
runion [in Undecidability.TM.Util.Relations]
rValidComp [in Undecidability.L.Tactics.Reflection]
R__step [in Complexity.L.AbstractMachines.Computable.EvalForTime]

S

SAT [in Complexity.NP.SAT.SAT]
satAssgn [in Complexity.NP.Clique.kSAT_to_Clique]
satFinal [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
satFinal [in Complexity.NP.SAT.CookLevin.Subproblems.CC]
satisfies [in Complexity.NP.SAT.FSAT.FSAT]
satisfies [in Complexity.NP.SAT.SAT]
satLiterals [in Complexity.NP.Clique.kSAT_to_Clique]
satPositions [in Complexity.NP.Clique.kSAT_to_Clique]
sat_verifierb_time [in Complexity.NP.SAT.SAT_inNP]
sat_verifierb [in Complexity.NP.SAT.SAT_inNP]
sat_verifier [in Complexity.NP.SAT.SAT_inNP]
sconfig [in Complexity.NP.SAT.CookLevin.Subproblems.TM_single]
sconfig_for_mconfig [in Complexity.NP.SAT.CookLevin.Subproblems.TM_single]
select [in Undecidability.TM.Lifting.LiftTapes]
selectConf [in Undecidability.TM.Lifting.LiftTapes]
self_diverging_comb [in Undecidability.L.Computability.Rice]
self_diverging [in Undecidability.L.Computability.Rice]
semi_confluent [in Undecidability.L.Prelim.ARS]
semi_decidable [in Undecidability.Synthetic.Definitions]
semi_decider [in Undecidability.Synthetic.Definitions]
Seq [in Undecidability.TM.Combinators.SequentialComposition]
seq_time [in Undecidability.L.Datatypes.List.List_extra]
SetBitAndMoveLeft [in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
SetBitAndMoveLeft_Rel [in Undecidability.TM.Code.BinNumbers.PosHelperMachines]
SetFinal [in Undecidability.TM.Univ.LowLevel]
SetFinal_T [in Undecidability.TM.Univ.LowLevel]
SetFinal_steps [in Undecidability.TM.Univ.LowLevel]
SetFinal_Rel [in Undecidability.TM.Univ.LowLevel]
SetFinal_size [in Undecidability.TM.Univ.LowLevel]
Shift [in Undecidability.TM.Compound.Shift]
ShiftLeft [in Undecidability.TM.Code.BinNumbers.PosShiftTM]
ShiftLeft_num_Rel [in Undecidability.TM.Code.BinNumbers.PosShiftTM]
ShiftLeft_num [in Undecidability.TM.Code.BinNumbers.PosShiftTM]
ShiftLeft_num_Loop [in Undecidability.TM.Code.BinNumbers.PosShiftTM]
ShiftLeft_num_Loop_Rel [in Undecidability.TM.Code.BinNumbers.PosShiftTM]
ShiftLeft_num_Step [in Undecidability.TM.Code.BinNumbers.PosShiftTM]
ShiftLeft_num_Step_Rel [in Undecidability.TM.Code.BinNumbers.PosShiftTM]
ShiftLeft_Rel [in Undecidability.TM.Code.BinNumbers.PosShiftTM]
ShiftRight [in Undecidability.TM.Code.BinNumbers.PosShiftTM]
ShiftRight_num_Rel [in Undecidability.TM.Code.BinNumbers.PosShiftTM]
ShiftRight_num [in Undecidability.TM.Code.BinNumbers.PosShiftTM]
ShiftRight_num_Loop [in Undecidability.TM.Code.BinNumbers.PosShiftTM]
ShiftRight_num_Loop_Rel [in Undecidability.TM.Code.BinNumbers.PosShiftTM]
ShiftRight_num_Step [in Undecidability.TM.Code.BinNumbers.PosShiftTM]
ShiftRight_num_Step_Rel [in Undecidability.TM.Code.BinNumbers.PosShiftTM]
ShiftRight_Rel [in Undecidability.TM.Code.BinNumbers.PosShiftTM]
ShiftRight' [in Undecidability.TM.Code.BinNumbers.PosShiftTM]
ShiftRight'_Rel [in Undecidability.TM.Code.BinNumbers.PosShiftTM]
shift_right [in Undecidability.TM.Code.BinNumbers.PosDefinitions]
shift_left [in Undecidability.TM.Code.BinNumbers.PosDefinitions]
Shift_L_Rel [in Undecidability.TM.Compound.Shift]
Shift_L_fun_measure [in Undecidability.TM.Compound.Shift]
Shift_L [in Undecidability.TM.Compound.Shift]
Shift_steps [in Undecidability.TM.Compound.Shift]
Shift_Rel [in Undecidability.TM.Compound.Shift]
Shift_fun_measure [in Undecidability.TM.Compound.Shift]
Shift_Step [in Undecidability.TM.Compound.Shift]
Shift_Step_Rel [in Undecidability.TM.Compound.Shift]
sigCom [in Undecidability.TM.L.Alphabets]
sigCom_fin [in Undecidability.TM.L.Alphabets]
sigGraph [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
sigHAdd [in Undecidability.TM.L.Alphabets]
sigHAdd_fin [in Undecidability.TM.L.Alphabets]
sigHClos [in Undecidability.TM.L.Alphabets]
sigHClos_fin [in Undecidability.TM.L.Alphabets]
sigHeap [in Undecidability.TM.L.Alphabets]
sigHeap_fin [in Undecidability.TM.L.Alphabets]
sigHEntr [in Undecidability.TM.L.Alphabets]
sigHEntr_fin [in Undecidability.TM.L.Alphabets]
sigHEntr' [in Undecidability.TM.L.Alphabets]
sigHEntr'_fin [in Undecidability.TM.L.Alphabets]
sigList_eqb [in Complexity.L.TM.CompCode]
sigM' [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
sigNat_eqb [in Complexity.L.TM.CompCode]
sigOption_eqb [in Complexity.L.TM.CompCode]
sigPair_eqb [in Complexity.L.TM.CompCode]
sigPro [in Undecidability.TM.L.Alphabets]
sigPro_fin [in Undecidability.TM.L.Alphabets]
sigStep [in Undecidability.TM.L.HeapInterpreter.M_LHeapInterpreter]
sigSum_eqb [in Complexity.L.TM.CompCode]
sigTape_eqb [in Complexity.L.TM.CompCode]
sigU [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
sigUniv [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
sigUniv' [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
simRules [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
sincl [in Undecidability.Shared.Libs.DLW.Wf.wf_incl]
SingleTMGenNP [in Complexity.NP.SAT.CookLevin.Subproblems.SingleTMGenNP]
size [in Undecidability.L.Util.L_facts]
size [in Undecidability.TM.Code.Code]
sizeC [in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
sizeH [in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
sizeHE [in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
sizeOfmTapes [in Undecidability.TM.Util.TM_facts]
sizeOfmTapesFlat [in Complexity.L.TM.TMflatFun]
sizeOfmTapesFlat_timeSize [in Complexity.L.TM.TMflatComp]
sizeOfmTapesFlat_time [in Complexity.L.TM.TMflatComp]
sizeOfTape [in Undecidability.TM.Util.TM_facts]
sizeP [in Undecidability.L.AbstractMachines.FlatPro.Programs]
sizePN [in Complexity.L.AbstractMachines.FunctionalDefinitions]
sizeSt [in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
sizeSt [in Complexity.L.AbstractMachines.AbstractSubstMachine]
sizeT [in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
sizeT [in Undecidability.L.AbstractMachines.FlatPro.Programs]
sizeTN [in Complexity.L.AbstractMachines.FunctionalDefinitions]
sizeTR' [in Undecidability.L.Functions.Size]
sizeTR'_fuel [in Undecidability.L.Functions.Size]
size_cnf [in Complexity.NP.SAT.SAT]
size_clause [in Complexity.NP.SAT.SAT]
size' [in Undecidability.L.Util.L_facts]
Skip_cons_Rel [in Undecidability.TM.Code.CaseList]
Skip_cons [in Undecidability.TM.Code.CaseList]
smallo_equiv.liftR [in Complexity.Complexity.ONotationIsAppropriate]
smallo_equiv.QtoNceil [in Complexity.Complexity.ONotationIsAppropriate]
smallo_equiv.NtoQ [in Complexity.Complexity.ONotationIsAppropriate]
smallo_equiv.inoR [in Complexity.Complexity.ONotationIsAppropriate]
Snd [in Undecidability.TM.Code.CasePair]
Snd_T [in Undecidability.TM.Code.CasePair]
Snd_steps [in Undecidability.TM.Code.CasePair]
Snd_Rel [in Undecidability.TM.Code.CasePair]
Snd_size [in Undecidability.TM.Code.CasePair]
space_constant [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
Spec [in Undecidability.TM.Hoare.HoareRegister]
SpecV [in Undecidability.TM.Hoare.HoareRegister]
SpecVTrue [in Undecidability.TM.Hoare.HoareRegister]
split_head_symbol [in Undecidability.L.Tactics.Extract]
split_vector [in Undecidability.TM.Single.EncodeTapes]
sss_compute_max [in Undecidability.Shared.Libs.DLW.Code.sss]
sss_step_stall [in Undecidability.Shared.Libs.DLW.Code.sss]
sss_stall [in Undecidability.Shared.Libs.DLW.Code.sss]
sss_terminates [in Undecidability.Shared.Libs.DLW.Code.sss]
sss_output [in Undecidability.Shared.Libs.DLW.Code.sss]
sss_compute [in Undecidability.Shared.Libs.DLW.Code.sss]
sss_progress [in Undecidability.Shared.Libs.DLW.Code.sss]
sss_step [in Undecidability.Shared.Libs.DLW.Code.sss]
sstep [in Complexity.NP.SAT.CookLevin.Subproblems.TM_single]
sstepRel [in Complexity.NP.SAT.CookLevin.Subproblems.TM_single]
stack [in Undecidability.L.Tactics.Extract]
startRen [in Undecidability.TM.L.CompilerBoolFuns.Compiler]
state [in Complexity.L.AbstractMachines.AbstractHeapMachineDef]
state [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
States [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
stateSigma [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
StateWhile [in Undecidability.TM.Combinators.StateWhile]
StateWhileTM [in Undecidability.TM.Combinators.StateWhile]
StateWhile_part [in Undecidability.TM.Combinators.StateWhile]
StateWhile_halt [in Undecidability.TM.Combinators.StateWhile]
StateWhile_trans [in Undecidability.TM.Combinators.StateWhile]
StateWhile_states [in Undecidability.TM.Combinators.StateWhile]
Step [in Undecidability.TM.Single.StepTM]
Step [in Undecidability.TM.L.HeapInterpreter.StepTM]
step [in Undecidability.TM.Util.TM_facts]
stepf [in Undecidability.L.Computability.Seval]
stepFlat [in Complexity.L.TM.TMflatFun]
stepFlat_timeNice [in Complexity.L.TM.TMflatComp]
stepFlat_time [in Complexity.L.TM.TMflatComp]
stepn [in Undecidability.L.Computability.Seval]
steps [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
steps_k [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
step_fun [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
Step_T [in Undecidability.TM.Single.StepTM]
Step_steps [in Undecidability.TM.Single.StepTM]
Step_Rel [in Undecidability.TM.Single.StepTM]
Step_T [in Undecidability.TM.L.HeapInterpreter.StepTM]
Step_steps [in Undecidability.TM.L.HeapInterpreter.StepTM]
Step_steps_CaseList [in Undecidability.TM.L.HeapInterpreter.StepTM]
Step_steps_CaseList' [in Undecidability.TM.L.HeapInterpreter.StepTM]
Step_steps_CaseCom [in Undecidability.TM.L.HeapInterpreter.StepTM]
Step_Rel [in Undecidability.TM.L.HeapInterpreter.StepTM]
Step_size [in Undecidability.TM.L.HeapInterpreter.StepTM]
Step_var_T [in Undecidability.TM.L.HeapInterpreter.StepTM]
Step_var_steps [in Undecidability.TM.L.HeapInterpreter.StepTM]
Step_var_steps_Lookup [in Undecidability.TM.L.HeapInterpreter.StepTM]
Step_var [in Undecidability.TM.L.HeapInterpreter.StepTM]
Step_var_Rel [in Undecidability.TM.L.HeapInterpreter.StepTM]
Step_var_size [in Undecidability.TM.L.HeapInterpreter.StepTM]
Step_app_T [in Undecidability.TM.L.HeapInterpreter.StepTM]
Step_app_steps [in Undecidability.TM.L.HeapInterpreter.StepTM]
Step_app_steps_CaseList [in Undecidability.TM.L.HeapInterpreter.StepTM]
Step_app_steps_CaseList' [in Undecidability.TM.L.HeapInterpreter.StepTM]
Step_app [in Undecidability.TM.L.HeapInterpreter.StepTM]
Step_app_Rel [in Undecidability.TM.L.HeapInterpreter.StepTM]
Step_app_size [in Undecidability.TM.L.HeapInterpreter.StepTM]
Step_lam_T [in Undecidability.TM.L.HeapInterpreter.StepTM]
Step_lam_steps [in Undecidability.TM.L.HeapInterpreter.StepTM]
Step_lam_steps_JumpTarget [in Undecidability.TM.L.HeapInterpreter.StepTM]
Step_lam [in Undecidability.TM.L.HeapInterpreter.StepTM]
Step_lam_Rel [in Undecidability.TM.L.HeapInterpreter.StepTM]
Step_lam_size [in Undecidability.TM.L.HeapInterpreter.StepTM]
Step_Lookup [in Undecidability.TM.L.HeapInterpreter.StepTM]
step' [in Undecidability.L.TM.TMinL.TMinL_extract]
stop [in Undecidability.TM.Code.CaseList]
stopAfterFirst [in Undecidability.TM.Code.CasePair]
stopAtStart [in Undecidability.TM.Code.CasePair]
strans [in Complexity.NP.SAT.CookLevin.Subproblems.TM_single]
stringForConfig [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
stringForTapeHalf [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
stringForTapeHalf' [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
string_of_int [in Undecidability.L.Tactics.Extract]
string_of_nat [in Undecidability.Shared.Libs.DLW.Utils.utils_string]
string_of_N [in Undecidability.Shared.Libs.DLW.Utils.utils_string]
subcode [in Undecidability.Shared.Libs.DLW.Code.subcode]
subrel [in Undecidability.TM.Util.Relations]
subsequence [in Complexity.Libs.CookPrelim.MorePrelim]
subst [in Undecidability.L.L]
substList [in Undecidability.L.Tactics.LClos]
substP [in Undecidability.L.AbstractMachines.FlatPro.Programs]
substP_keepTrack [in Complexity.L.AbstractMachines.FunctionalDefinitions]
substP_keepTrack' [in Complexity.L.AbstractMachines.FunctionalDefinitions]
substring [in Complexity.Libs.CookPrelim.MorePrelim]
substStep [in Complexity.L.AbstractMachines.FunctionalDefinitions]
subst' [in Undecidability.L.Tactics.Lbeta_nonrefl]
Subtract [in Undecidability.TM.Code.NatSub]
Subtract_Rel [in Undecidability.TM.Code.NatSub]
subtype [in Undecidability.Shared.Libs.PSL.FiniteTypes.Arbitrary]
sub_maskC [in Complexity.L.Functions.BinNumsSub]
sub_time [in Undecidability.L.Datatypes.LNat]
sumn [in Undecidability.L.Prelim.MoreList]
sumNmap [in Complexity.L.AbstractMachines.FunctionalDefinitions]
sumNmap' [in Complexity.L.AbstractMachines.FunctionalDefinitions]
sum_eqb [in Undecidability.L.Datatypes.LSum]
sum_list_rec [in Complexity.TM.PrettyBounds.SpaceBounds]
sum_decode [in Undecidability.L.Functions.Decoding]
surject [in Undecidability.TM.Lifting.LiftAlphabet]
surjectConf [in Undecidability.TM.Lifting.LiftAlphabet]
surjective [in Undecidability.Shared.Libs.PSL.Bijection]
surjective [in Undecidability.TM.Util.Relations]
surjectReadSymbols [in Undecidability.TM.Lifting.LiftAlphabet]
surjectSymbols [in Undecidability.TM.Code.ChangeAlphabet]
surjectTape [in Undecidability.TM.Lifting.LiftAlphabet]
surjectTapes [in Undecidability.TM.Lifting.LiftAlphabet]
surj_t [in Undecidability.Shared.Libs.DLW.Utils.fin_bij]
swap [in Undecidability.Shared.Libs.DLW.Utils.sorting]
swap [in Undecidability.TM.Compound.Compare]
swap [in Undecidability.Shared.Libs.DLW.Utils.utils_tac]
Switch [in Undecidability.TM.Combinators.Switch]
SwitchTM [in Undecidability.TM.Combinators.Switch]
Switch_p [in Undecidability.TM.Combinators.Switch]
Switch_halt [in Undecidability.TM.Combinators.Switch]
Switch_trans [in Undecidability.TM.Combinators.Switch]
symmetric [in Undecidability.L.Prelim.ARS]
sym_b [in Undecidability.TM.L.CompilerBoolFuns.Compiler]
sym_s [in Undecidability.TM.L.CompilerBoolFuns.Compiler]
S_Rel [in Undecidability.TM.Code.CaseNat]

T

T [in Undecidability.L.Computability.Enum]
tabulate [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
tabulate [in Complexity.Libs.CookPrelim.MorePrelim]
tabulate_formula_time [in Complexity.NP.SAT.FSAT.FormulaEncoding]
tabulate_step_time [in Complexity.NP.SAT.FSAT.FormulaEncoding]
tabulate_formula [in Complexity.NP.SAT.FSAT.FormulaEncoding]
tabulate_step [in Complexity.NP.SAT.FSAT.FormulaEncoding]
TailRec [in Undecidability.TM.L.HeapInterpreter.StepTM]
tailRecursion [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_def]
TailRec_T [in Undecidability.TM.L.HeapInterpreter.StepTM]
TailRec_steps [in Undecidability.TM.L.HeapInterpreter.StepTM]
TailRec_Rel [in Undecidability.TM.L.HeapInterpreter.StepTM]
TailRec_size [in Undecidability.TM.L.HeapInterpreter.StepTM]
tape [in Undecidability.TM.SBTM]
tapeOrderSwap [in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
tapes [in Undecidability.TM.Util.TM_facts]
tapeSigma [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
tapeToList [in Undecidability.TM.Util.TM_facts]
tape_size_sum [in Complexity.TM.PrettyBounds.M2MBounds]
tape_size [in Complexity.TM.PrettyBounds.M2MBounds]
tape_dir [in Undecidability.TM.Single.StepTM]
tape_decode [in Complexity.L.TM.TapeDecode]
tape_contains_rev_size [in Undecidability.TM.Code.CodeTM]
tape_contains_rev [in Undecidability.TM.Code.CodeTM]
tape_contains_size [in Undecidability.TM.Code.CodeTM]
tape_contains [in Undecidability.TM.Code.CodeTM]
tape_local_l [in Undecidability.TM.Util.TM_facts]
tape_local [in Undecidability.TM.Util.TM_facts]
tape_write [in Undecidability.TM.Util.TM_facts]
tape_move [in Undecidability.TM.Util.TM_facts]
tape_move_left [in Undecidability.TM.Util.TM_facts]
tape_move_left' [in Undecidability.TM.Util.TM_facts]
tape_move_right [in Undecidability.TM.Util.TM_facts]
tape_move_right' [in Undecidability.TM.Util.TM_facts]
tc [in Complexity.L.AbstractMachines.AbstractSubstMachine]
TCCCardP_ofFlatType [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
TCCCardP_to_list [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
TCCCard_to_CCCard [in Complexity.NP.SAT.CookLevin.Reductions.TCC_to_CC]
TCCCard_ofFlatType [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
TCCLang [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
TCC_wellformed [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
tcompl [in Undecidability.L.Computability.Decidability]
tconj [in Undecidability.L.Computability.Decidability]
tdisj [in Undecidability.L.Computability.Decidability]
terminal [in Undecidability.L.Prelim.ARS]
terminates [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
TerminatesIn [in Undecidability.TM.Util.TM_facts]
term_evalForTime [in Complexity.L.AbstractMachines.Computable.EvalForTime]
term_eq_dec_proc [in Undecidability.L.Util.L_facts]
term_test [in Undecidability.L.TM.TMinL]
term_kn [in Undecidability.L.Tactics.Extract]
term_mp [in Undecidability.L.Tactics.Extract]
term_decode [in Undecidability.L.Functions.Decoding]
term_eqb [in Undecidability.L.Functions.Equality]
test [in Undecidability.L.Computability.Synthetic]
TH [in Undecidability.L.Util.L_facts]
timeComplexity [in Undecidability.L.Tactics.ComputableTime]
timeComplexity_leq [in Undecidability.L.Tactics.ComputableTime]
timeConstructible [in Complexity.Complexity.Definitions]
timeConstructible_inO [in Complexity.Complexity.Definitions]
timeConstructible_computableTime' [in Complexity.Complexity.Definitions]
time_evalForTime__step [in Complexity.L.AbstractMachines.Computable.EvalForTime]
time_N_of_nat [in Complexity.L.Datatypes.LBinNums]
time_decompile_nice [in Complexity.L.AbstractMachines.FlatPro.Computable.Decompile]
time_decompile [in Complexity.L.AbstractMachines.FlatPro.Computable.Decompile]
time_loopSum [in Undecidability.L.Functions.LoopSum]
time_unfoldTailRecStep [in Complexity.L.AbstractMachines.Computable.Unfolding]
time_map2 [in Undecidability.L.Datatypes.LVector]
time_isValidFlatTrans [in Complexity.L.TM.TMflatComp]
time_compile [in Complexity.L.AbstractMachines.FlatPro.Computable.Compile]
tmArgsOfConstructor [in Undecidability.L.Tactics.Extract]
tmEncode [in Undecidability.L.Tactics.Extract]
tmExtract [in Undecidability.L.Tactics.Extract]
tmExtractConstr [in Undecidability.L.Tactics.Extract]
tmExtractConstr' [in Undecidability.L.Tactics.Extract]
tmGenEncode [in Undecidability.L.Tactics.GenEncode]
tmGenEncodeInj [in Undecidability.L.Tactics.GenEncode]
TMGenNP [in Complexity.NP.TM.TMGenNP]
TMGenNP_fixed [in Complexity.NP.TM.TMGenNP_fixed_mTM]
TMGenNP' [in Complexity.NP.TM.TMGenNP]
tmGetMyOption [in Undecidability.L.Tactics.Extract]
tmGetOption [in Undecidability.L.Tactics.Extract]
tmInstanceRed [in Undecidability.L.Tactics.Extract]
tmIsType [in Undecidability.L.Tactics.Extract]
tmMatchCorrect [in Undecidability.L.Tactics.GenEncode]
tmNumConstructors [in Undecidability.L.Tactics.Extract]
tmTryInfer [in Undecidability.L.Tactics.Extract]
tmTypeOf [in Undecidability.L.Tactics.Extract]
tmUnfoldTerm [in Undecidability.L.Tactics.Extract]
TM_Correct_noSwitchAuto [in Undecidability.TM.Combinators.Combinators]
TM_computable [in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
TM_bool_computable [in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
TM_bool_computable_hoare' [in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
TM_bool_computable_hoare_out' [in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
TM_bool_computable_hoare_in' [in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
TM_bool_computable_hoare [in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
TM_bool_computable_hoare_out [in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
TM_bool_computable_hoare_in [in Undecidability.TM.L.CompilerBoolFuns.Compiler_facts]
TM1GenNP [in Complexity.NP.TM.TMGenNP]
TM₁_bool_computable [in Undecidability.TM.L.CompilerBoolFuns.Compiler_spec]
toAssignment [in Complexity.NP.Clique.kSAT_to_Clique]
ToggleMarked [in Undecidability.TM.Single.StepTM]
ToggleMarked_Rel [in Undecidability.TM.Single.StepTM]
toggle_marked [in Undecidability.TM.Single.StepTM]
Tok_eqb [in Undecidability.L.AbstractMachines.FlatPro.Programs]
toLiterals [in Complexity.NP.Clique.kSAT_to_Clique]
toOptionList [in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
toPos [in Complexity.NP.Clique.kSAT_to_Clique]
ToSingleTape [in Undecidability.TM.Single.StepTM]
ToSingleTape_T' [in Undecidability.TM.Single.StepTM]
ToSingleTape_Rel' [in Undecidability.TM.Single.StepTM]
ToSingleTape_T [in Undecidability.TM.Single.StepTM]
ToSingleTape_Rel [in Undecidability.TM.Single.StepTM]
ToSingleTape_inj [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
ToSingleTape_Loop_inj [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
ToSingleTape_steps [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
toSubList [in Undecidability.Shared.Libs.PSL.FiniteTypes.Arbitrary]
toSumList1 [in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
toSumList2 [in Undecidability.Shared.Libs.PSL.FiniteTypes.BasicDefinitions]
toVertex [in Complexity.NP.Clique.kSAT_to_FlatClique]
toVertex_time [in Complexity.NP.Clique.kSAT_to_FlatClique]
to_cumul [in Undecidability.Synthetic.ListEnumerabilityFacts]
to_list [in Undecidability.L.Prelim.StringBase]
to_string [in Undecidability.L.Prelim.StringBase]
transEnvAddS [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transEnvAddSM [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transitive [in Undecidability.L.Prelim.ARS]
Translate [in Undecidability.TM.Code.Copy]
translate [in Undecidability.TM.Code.Copy]
Translate_T [in Undecidability.TM.Code.Copy]
Translate_steps [in Undecidability.TM.Code.Copy]
Translate_Rel [in Undecidability.TM.Code.Copy]
Translate' [in Undecidability.TM.Code.Copy]
Translate'_steps [in Undecidability.TM.Code.Copy]
Translate'_Rel [in Undecidability.TM.Code.Copy]
transNoneLeftCenter_inv [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transNoneLeftLeft_inv [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transNoneLeftRight_inv [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transNoneNoneCenter_inv [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transNoneNoneLeft_inv [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transNoneNoneRight_inv [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transNoneNone_inv [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transNoneRightCenter_inv [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transNoneRightLeft_inv [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transNoneRightRight_inv [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transNoneSomeCenter_inv [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transNoneSomeLeft_inv [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transNoneSomeRight_inv [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transNoneSome_inv [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transNoneStayCenter_inv [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transNoneStayLeft_inv [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transNoneStayRight_inv [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transRule [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transRules_inv [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transSomeLeftCenter_inv [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transSomeLeftLeft_inv [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transSomeLeftRight_inv [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transSomeNoneCenter_inv [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transSomeNoneLeft_inv [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transSomeNoneRight_inv [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transSomeNone_inv [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transSomeRightCenter_inv [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transSomeRightLeft_inv [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transSomeRightRight_inv [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transSomeSomeCenter_inv [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transSomeSomeLeft_inv [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transSomeSomeRight_inv [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transSomeSome_inv [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transSomeStayCenter_inv [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transSomeStayLeft_inv [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transSomeStayRight_inv [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
transTime [in Undecidability.L.TM.TMinL.TMinL_extract]
trans_map_values [in Undecidability.TM.Univ.LowLevel]
trans_map_keys [in Undecidability.TM.Univ.LowLevel]
tRel [in Undecidability.TM.Util.TM_facts]
Triple_TRel [in Undecidability.TM.Hoare.HoareLogic]
Triple_Rel [in Undecidability.TM.Hoare.HoareLogic]
trivialNoInstance [in Complexity.NP.SAT.CookLevin.Reductions.FlatCC_to_BinaryCC]
trivialNoInstance [in Complexity.NP.SAT.CookLevin.Reductions.BinaryCC_to_FSAT]
trivialNoInstance [in Complexity.NP.SAT.CookLevin.Reductions.CC_to_BinaryCC]
trivialNoInstance [in Complexity.NP.Clique.kSAT_to_FlatClique]
trivial_no_instance [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
trueOrDiverge [in Undecidability.L.Datatypes.LBool]
TrueOrDiverge.M [in Complexity.NP.TM.LM_to_mTM]
tseytin [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
tseytinAnd [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
tseytinEquiv [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
tseytinNot [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
tseytinOr [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
tseytinP_time [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
tseytinTrue [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
tseytin_time [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
tseytin_formula_repr [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
tseytin' [in Complexity.NP.SAT.FSAT.FSAT_to_SAT]
tspec [in Undecidability.TM.Hoare.HoareRegister]
tspec_single [in Undecidability.TM.Hoare.HoareRegister]
tupToEvalEnv [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
t__evalForTime [in Complexity.L.AbstractMachines.Computable.EvalForTime]
t__E [in Complexity.HierarchyTheorem.TimeHierarchyTheorem]
t__evalForTimeBool [in Complexity.L.AbstractMachines.Computable.EvalForTimeBool]
T_nondec [in Undecidability.L.Functions.EnumInt]
T_nondec_helper [in Undecidability.L.Functions.EnumInt]

U

U [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
U [in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
uiter [in Undecidability.L.Functions.UnboundIteration]
uiterTime [in Undecidability.L.Functions.UnboundIteration]
Uncurry [in Undecidability.L.Complexity.GenericNary]
undecidable [in Undecidability.Synthetic.Undecidability]
undup [in Undecidability.Shared.Libs.PSL.Lists.Dupfree]
unembed [in Undecidability.Shared.embed_nat]
unflattenTM [in Complexity.L.TM.TMunflatten]
unflatten_in [in Complexity.L.TM.TMunflatten]
unflatten_halt [in Complexity.L.TM.TMunflatten]
unflatten_trans [in Complexity.L.TM.TMunflatten]
unflatten_acts [in Complexity.L.TM.TMunflatten]
unflatten_acts' [in Complexity.L.TM.TMunflatten]
unflatten_symb [in Complexity.L.TM.TMunflatten]
unfoldBoolean [in Complexity.L.AbstractMachines.UnfoldTailRec]
unfoldBool_time [in Complexity.L.AbstractMachines.Computable.Unfolding]
unfoldC [in Complexity.L.AbstractMachines.UnfoldHeap]
UnfoldClos.M [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
UnfoldClos.retr_nat_stack [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
UnfoldClos.retr_stackEl [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
UnfoldClos.retr_clos_stack [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
UnfoldClos.retr_pro [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
UnfoldClos.steps [in Undecidability.TM.L.HeapInterpreter.UnfoldClos]
unfolds_rect [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
unfolds_ind' [in Undecidability.L.AbstractMachines.FlatPro.LM_heap_correct]
unfoldTailRecStep [in Complexity.L.AbstractMachines.UnfoldTailRec]
unfoldTailRecStep [in Undecidability.L.AbstractMachines.FlatPro.UnfoldClos]
unfoldTailRecStep_sizes [in Complexity.L.AbstractMachines.FlatPro.SizeAnalysisUnfoldClos]
uniform_confluent [in Undecidability.L.Prelim.ARS]
uniform_homomorphism [in Complexity.Libs.UniformHomomorphisms]
unit_enum [in Undecidability.Synthetic.EnumerabilityFacts]
unit_enc [in Undecidability.L.Tactics.ComputableDemo]
unit_decode [in Undecidability.L.Functions.Decoding]
Univ [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
Univ [in Undecidability.TM.Univ.Univ]
univDecTime [in Complexity.L.AbstractMachines.Computable.UnivDecTime]
univDecTime_time [in Complexity.L.AbstractMachines.Computable.UnivDecTime]
univStep [in Complexity.L.AbstractMachines.Computable.UnivDecTime]
Univ_size_bound [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
Univ_size_bound4 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
Univ_size_bound3 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
Univ_size_bound2 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
Univ_Step_tape2_trice [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
Univ_Step_tape2_twice [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
Univ_Step_size_bound5 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
Univ_Step_size_bound4 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
Univ_Step_size_bound3 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
Univ_Step_size_bound2 [in Complexity.TM.PrettyBounds.UnivSpaceBounds]
Univ_nice.number_of_states [in Complexity.TM.PrettyBounds.UnivBounds]
Univ_T [in Undecidability.TM.Univ.Univ]
Univ_Rel [in Undecidability.TM.Univ.Univ]
Univ_steps [in Undecidability.TM.Univ.Univ]
Univ_size [in Undecidability.TM.Univ.Univ]
Univ_Step [in Undecidability.TM.Univ.Univ]
Univ_Step_steps [in Undecidability.TM.Univ.Univ]
Univ_Step_steps_IsFinal [in Undecidability.TM.Univ.Univ]
Univ_Step_steps_Translate [in Undecidability.TM.Univ.Univ]
Univ_Step_steps_CasePair [in Undecidability.TM.Univ.Univ]
Univ_Step_steps_Lookup [in Undecidability.TM.Univ.Univ]
Univ_Step_steps_ResetSymbol [in Undecidability.TM.Univ.Univ]
Univ_Step_steps_ConstrPair [in Undecidability.TM.Univ.Univ]
Univ_Step_size [in Undecidability.TM.Univ.Univ]
Unnamed_thm [in Complexity.Libs.Pigeonhole]
Unnamed_thm [in Undecidability.TM.Combinators.While]
Unnamed_thm [in Undecidability.L.Prelim.ARS]
Unnamed_thm3 [in Undecidability.TM.Compound.TMTac]
Unnamed_thm2 [in Undecidability.TM.Compound.TMTac]
Unnamed_thm1 [in Undecidability.TM.Compound.TMTac]
Unnamed_thm0 [in Undecidability.TM.Compound.TMTac]
Unnamed_thm [in Undecidability.TM.Compound.TMTac]
Unnamed_thm [in Undecidability.TM.Code.CaseList]
Unnamed_thm0 [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
Unnamed_thm [in Undecidability.Shared.Libs.PSL.Vectors.Vectors]
Unnamed_thm [in Undecidability.L.Util.L_facts]
Unnamed_thm1 [in Undecidability.L.Complexity.UpToCNary]
Unnamed_thm0 [in Undecidability.L.Complexity.UpToCNary]
Unnamed_thm [in Undecidability.L.Complexity.UpToCNary]
Unnamed_thm [in Undecidability.TM.Code.BinNumbers.PosDefinitions]
Unnamed_thm [in Undecidability.TM.Code.CaseNat]
Unnamed_thm [in Undecidability.TM.Code.NatTM]
Unnamed_thm2 [in Undecidability.L.Tactics.ComputableDemo]
Unnamed_thm1 [in Undecidability.L.Tactics.ComputableDemo]
Unnamed_thm0 [in Undecidability.L.Tactics.ComputableDemo]
Unnamed_thm0 [in Undecidability.L.Tactics.ComputableDemo]
Unnamed_thm0 [in Undecidability.L.Tactics.ComputableDemo]
Unnamed_thm0 [in Undecidability.L.Tactics.ComputableDemo]
Unnamed_thm [in Undecidability.L.Tactics.ComputableDemo]
Unnamed_thm [in Undecidability.Shared.Libs.PSL.Vectors.Fin]
Unnamed_thm0 [in Undecidability.L.Complexity.UpToC]
Unnamed_thm [in Undecidability.L.Complexity.UpToC]
Unnamed_thm [in Undecidability.TM.Code.CaseSum]
Unnamed_thm [in Undecidability.L.Computability.Fixpoints]
Unnamed_thm [in Undecidability.TM.L.HeapInterpreter.JumpTargetTM]
Unnamed_thm [in Undecidability.L.Computability.Acceptability]
Unnamed_thm0 [in Undecidability.Shared.Libs.PSL.Vectors.VectorDupfree]
Unnamed_thm [in Undecidability.Shared.Libs.PSL.Vectors.VectorDupfree]
Unnamed_thm2 [in Undecidability.TM.Lifting.LiftTapes]
Unnamed_thm1 [in Undecidability.TM.Lifting.LiftTapes]
Unnamed_thm0 [in Undecidability.TM.Lifting.LiftTapes]
Unnamed_thm [in Undecidability.TM.Lifting.LiftTapes]
Unnamed_thm0 [in Undecidability.L.Computability.Rice]
Unnamed_thm [in Undecidability.L.Computability.Rice]
Unnamed_thm0 [in Undecidability.TM.Util.TM_facts]
Unnamed_thm [in Undecidability.TM.Util.TM_facts]
Unnamed_thm [in Undecidability.TM.Code.CasePair]
Unnamed_thm [in Undecidability.L.Computability.Scott]
Unnamed_thm [in Undecidability.TM.Single.EncodeTapes]
Unnamed_thm [in Complexity.TM.PrettyBounds.PrettyBounds]
uptoc_mixed.sat_verifierb_time [in Complexity.L.ComparisonTimeBoundDerivation]
uptoc_mixed.evalCnf_time [in Complexity.L.ComparisonTimeBoundDerivation]
uptoc_mixed.evalClause_time [in Complexity.L.ComparisonTimeBoundDerivation]
uptoc_mixed.forallb_time [in Complexity.L.ComparisonTimeBoundDerivation]
uptoc_mixed.existsb_time [in Complexity.L.ComparisonTimeBoundDerivation]
uptoc_mixed.evalLiteral_time [in Complexity.L.ComparisonTimeBoundDerivation]
uptoc_mixed.evalVar_time [in Complexity.L.ComparisonTimeBoundDerivation]
uptoc_mixed.list_in_decb_time [in Complexity.L.ComparisonTimeBoundDerivation]
uptoc_pure.sat_verifierb_time [in Complexity.L.ComparisonTimeBoundDerivation]
uptoc_pure.evalCnf_time [in Complexity.L.ComparisonTimeBoundDerivation]
uptoc_pure.evalClause_time [in Complexity.L.ComparisonTimeBoundDerivation]
uptoc_pure.forallb_time [in Complexity.L.ComparisonTimeBoundDerivation]
uptoc_pure.existsb_time [in Complexity.L.ComparisonTimeBoundDerivation]
uptoc_pure.evalLiteral_time [in Complexity.L.ComparisonTimeBoundDerivation]
uptoc_pure.evalVar_time [in Complexity.L.ComparisonTimeBoundDerivation]
uptoc_pure.list_in_decb_time [in Complexity.L.ComparisonTimeBoundDerivation]
uptoc_pure.maxSize [in Complexity.L.ComparisonTimeBoundDerivation]
U_Rel [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
U_T [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
U_steps [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
U_spec [in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]
U_preproc [in Complexity.HierarchyTheorem.AbstractTimeHierarchyTheorem]

V

validate [in Undecidability.TM.L.CompilerBoolFuns.Compiler_nat_facts]
validEnv [in Undecidability.L.Tactics.LClos]
validEnv' [in Undecidability.L.Tactics.LClos]
validExplicit [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
validExplicit [in Complexity.NP.SAT.CookLevin.Subproblems.CC]
validFlatConf [in Complexity.L.TM.TMunflatten]
validFlatTape [in Complexity.L.TM.TMunflatten]
validFlatTM [in Complexity.L.TM.TMunflatten]
validPreludeInitial [in Complexity.NP.SAT.CookLevin.Reductions.PTCC_Preludes]
valuation_one_union [in Undecidability.Shared.Libs.DLW.Utils.interval]
valuation_union [in Undecidability.Shared.Libs.DLW.Utils.interval]
varInClause [in Complexity.NP.SAT.SAT]
varInCnf [in Complexity.NP.SAT.SAT]
varInLiteral [in Complexity.NP.SAT.SAT]
varsOfClause [in Complexity.NP.SAT.SAT_inNP]
varsOfCnf [in Complexity.NP.SAT.SAT_inNP]
varsOfLiteral [in Complexity.NP.SAT.SAT_inNP]
Vcnf [in Complexity.NP.Clique.kSAT_to_Clique]
vector_drop [in Complexity.TM.PrettyBounds.M2MBounds]
vector_to_list [in Undecidability.TM.Util.VectorPrelim]
Vector_pow [in Undecidability.Shared.Libs.PSL.FiniteTypes.VectorFin]
Vector_of_list_length [in Complexity.L.TM.TMunflatten]
vector_sum [in Complexity.TM.Univ.MultiUnivTimeSpaceSimulation]
vec_map_list [in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_sum [in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_one [in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_zero [in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_plus [in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_map2 [in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_in_map [in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_map [in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_split [in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_app [in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_list [in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_eq_dec [in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_change [in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_set_pos [in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_pos [in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_tail [in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_head [in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_decomp [in Undecidability.Shared.Libs.DLW.Vec.vec]
vec_prod [in Complexity.L.TM.TMflatten]
vec2fun [in Undecidability.Shared.Libs.DLW.Vec.vec]
vertexSatisfied [in Complexity.NP.Clique.kSAT_to_Clique]
verticesClauseGe [in Complexity.NP.Clique.kSAT_to_Clique]
Vf [in Complexity.NP.Clique.kSAT_to_FlatClique]

W

While [in Undecidability.TM.Combinators.While]
WhileTM [in Undecidability.TM.Combinators.While]
While_Rel' [in Undecidability.TM.Combinators.While]
While_part [in Undecidability.TM.Combinators.While]
While_trans [in Undecidability.TM.Combinators.While]
withSpace [in Undecidability.TM.Hoare.HoareRegister]
withSpace_single [in Undecidability.TM.Hoare.HoareRegister]
wo [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
wr [in Undecidability.TM.TM]
wr [in Undecidability.TM.SBTM]
Write [in Undecidability.TM.Basic.Mono]
WriteMove [in Undecidability.TM.Basic.Mono]
WriteMove_Rel [in Undecidability.TM.Basic.Mono]
writeNatAux [in Undecidability.Shared.Libs.DLW.Utils.utils_string]
writeNAux [in Undecidability.Shared.Libs.DLW.Utils.utils_string]
WriteNumber [in Undecidability.TM.Code.BinNumbers.NTM]
WriteNumber_steps [in Undecidability.TM.Code.BinNumbers.NTM]
WriteNumber_Rel [in Undecidability.TM.Code.BinNumbers.NTM]
WriteString [in Undecidability.TM.Compound.WriteString]
WriteString_Rel [in Undecidability.TM.Compound.WriteString]
WriteString_steps [in Undecidability.TM.Compound.WriteString]
WriteString_sem_fix [in Undecidability.TM.Compound.WriteString]
WriteString_Fun [in Undecidability.TM.Compound.WriteString]
WriteValue [in Undecidability.TM.Code.WriteValue]
WriteValue_sizefun [in Undecidability.TM.Code.WriteValue]
WriteValue_steps [in Undecidability.TM.Code.WriteValue]
WriteValue_Rel [in Undecidability.TM.Code.WriteValue]
WriteValue_size [in Undecidability.TM.Code.WriteValue]
Write_Rel [in Undecidability.TM.Basic.Mono]

Z

z [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
zflat [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
zflat_time [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
zipWith [in Complexity.L.TM.TMflatFun]
zipWith_time [in Complexity.L.TM.TMflatComp]
zPflat [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
zPflat_time [in Complexity.NP.SAT.CookLevin.Reductions.FlatSingleTMGenNP_to_FlatTCC]
z' [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]

_

_term_encode_tape [in Complexity.L.TM.CompCode]
_flag_DisableWarning [in Undecidability.TM.Lifting.LiftTapes]
_Flag_DisableWarning [in Undecidability.TM.Lifting.LiftTapes]

other

Σ [in Undecidability.TM.L.CompilerBoolFuns.Compiler]

---

Record Index

B

BinaryCC [in Complexity.NP.SAT.CookLevin.Subproblems.BinaryCC]

C

canEnumTerms [in Complexity.NP.L.CanEnumTerm_def]
CC [in Complexity.NP.SAT.CookLevin.Subproblems.CC]
CCCard [in Complexity.NP.SAT.CookLevin.Subproblems.CC]
codable [in Undecidability.TM.Code.Code]
computable [in Undecidability.L.Tactics.Computable]
computableTime [in Undecidability.L.Tactics.ComputableTime]

D

decInTime [in Complexity.Complexity.Definitions]
decodable [in Undecidability.L.Functions.Decoding]
Domain_of_goal [in Undecidability.L.Complexity.GenericNary]

E

encInj [in Undecidability.L.Tactics.Computable]
encodable [in Undecidability.L.Tactics.Extract]
encodableP [in Complexity.Complexity.EncodableP]
eqbClass [in Undecidability.L.Functions.EqBool]
eqbCompT [in Undecidability.L.Functions.EqBool]
eqType [in Undecidability.Shared.Libs.PSL.EqDec]
eqType [in Undecidability.Shared.Dec]
evalEnv [in Complexity.NP.SAT.CookLevin.Reductions.SingleTMGenNP_to_TCC]
extracted [in Undecidability.L.Tactics.Extract]

F

finType [in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
finTypeC [in Undecidability.Shared.Libs.PSL.FiniteTypes.FinTypes]
fin_quotient [in Undecidability.Shared.Libs.DLW.Utils.fin_quotient]
FlatCC [in Complexity.NP.SAT.CookLevin.Subproblems.FlatCC]
FlatTCC [in Complexity.NP.SAT.CookLevin.Subproblems.FlatTCC]
flatTM [in Complexity.L.TM.TMflat]
fp_quotient [in Undecidability.Shared.Libs.DLW.Utils.fin_quotient]

I

inhabitedC [in Undecidability.Shared.Libs.PSL.Inhabited]
inNP [in Complexity.Complexity.NP]
isPoly [in Complexity.Complexity.UpToCPoly]

L

leUpToC [in Undecidability.L.Complexity.UpToC]
linTimeDecodable [in Undecidability.L.Complexity.LinDecode.LTD_def]

M

mconfig [in Undecidability.TM.Util.TM_facts]
monoid_theory [in Undecidability.Shared.Libs.DLW.Utils.sums]

P

polyCertRel [in Complexity.Complexity.NP]
polyTimeComputable [in Complexity.Complexity.Definitions]
PTCC [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]

R

reducesPolyMO [in Complexity.Complexity.NP]
resSizePoly [in Complexity.Complexity.Definitions]
Retract [in Undecidability.Shared.Libs.PSL.Retracts]

S

SBTM [in Undecidability.TM.SBTM]

T

TCC [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
TCCCard [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
TCCCardP [in Complexity.NP.SAT.CookLevin.Subproblems.TCC]
TM [in Undecidability.TM.TM]

U

UGraph [in Complexity.NP.Clique.UGraph]
UpToC [in Undecidability.L.Complexity.UpToC]

V

validFlatTrans [in Complexity.L.TM.TMunflatten]

---

Global Index

A

B

C

D

E

F

G

H

I

J

K

L

M

N

O

P

Q

R

S

T

U

V

W

X

Y

Z

_

other

(46433 entries)

Notation Index

A

B

C

D

E

F

G

H

I

J

K

L

M

N

O

P

Q

R

S

T

U

V

W

X

Y

Z

_

other

(334 entries)

Binder Index

A

B

C

D

E

F

G

H

I

J

K

L

M

N

O

P

Q

R

S

T

U

V

W

X

Y

Z

_

other

(33591 entries)

Module Index

A

B

C

D

E

F

G

H

I

J

K

L

M

N

O

P

Q

R

S

T

U

V

W

X

Y

Z

_

other

(44 entries)

Variable Index

A

B

C

D

E

F

G

H

I

J

K

L

M

N

O

P

Q

R

S

T

U

V

W

X

Y

Z

_

other

(1429 entries)

Library Index

A

B

C

D

E

F

G

H

I

J

K

L

M

N

O

P

Q

R

S

T

U

V

W

X

Y

Z

_

other

(389 entries)

Lemma Index

A

B

C

D

E

F

G

H

I

J

K

L

M

N

O

P

Q

R

S

T

U

V

W

X

Y

Z

_

other

(5088 entries)

Constructor Index

A

B

C

D

E

F

G

H

I

J

K

L

M

N

O

P

Q

R

S

T

U

V

W

X

Y

Z

_

other

(444 entries)

Inductive Index

A

B

C

D

E

F

G

H

I

J

K

L

M

N

O

P

Q

R

S

T

U

V

W

X

Y

Z

_

other

(168 entries)

Projection Index

A

B

C

D

E

F

G

H

I

J

K

L

M

N

O

P

Q

R

S

T

U

V

W

X

Y

Z

_

other

(150 entries)

Section Index

A

B

C

D

E

F

G

H

I

J

K

L

M

N

O

P

Q

R

S

T

U

V

W

X

Y

Z

_

other

(522 entries)

Instance Index

A

B

C

D

E

F

G

H

I

J

K

L

M

N

O

P

Q

R

S

T

U

V

W

X

Y

Z

_

other

(838 entries)

Abbreviation Index

A

B

C

D

E

F

G

H

I

J

K

L

M

N

O

P

Q

R

S

T

U

V

W

X

Y

Z

_

other

(241 entries)

Definition Index

A

B

C

D

E

F

G

H

I

J

K

L

M

N

O

P

Q

R

S

T

U

V

W

X

Y

Z

_

other

(3148 entries)

Record Index

A

B

C

D

E

F

G

H

I

J

K

L

M

N

O

P

Q

R

S

T

U

V

W

X

Y

Z

_

other

(47 entries)