| 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 | (2366 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 | (150 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 | (2 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 | (225 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 | (63 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 | (943 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 | (72 entries) |
| Axiom 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 | (1 entry) |
| 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 | (78 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 | (17 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 | (73 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 | (156 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 | (36 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 | (536 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 | (14 entries) |
Global Index
A
A [definition, in FOL.Tennenbaum.Tennenbaum_insep]A [definition, in FOL.Completeness.TarskiCompleteness]
abstract [section, in FOL.Incompleteness.abstract_incompleteness]
Abstract [section, in FOL.Incompleteness.Abstract]
Abstract [library]
AbstractReflectionDefinitions [section, in FOL.Reification.GeneralReflection]
abstract_incompleteness [library]
Abstract_coding [library]
Abstract.consistency [variable, in FOL.Incompleteness.Abstract]
abstract.halt [section, in FOL.Incompleteness.abstract_incompleteness]
abstract.halt [section, in FOL.Incompleteness.abstract_incompleteness]
abstract.halt.fs' [variable, in FOL.Incompleteness.abstract_incompleteness]
abstract.halt.Hext [variable, in FOL.Incompleteness.abstract_incompleteness]
abstract.halt.Hrepr [variable, in FOL.Incompleteness.abstract_incompleteness]
abstract.halt.Hrepr [variable, in FOL.Incompleteness.abstract_incompleteness]
abstract.halt.r [variable, in FOL.Incompleteness.abstract_incompleteness]
abstract.halt.r [variable, in FOL.Incompleteness.abstract_incompleteness]
abstract.halt.snd [variable, in FOL.Incompleteness.abstract_incompleteness]
abstract.insep [section, in FOL.Incompleteness.abstract_incompleteness]
abstract.insep [section, in FOL.Incompleteness.abstract_incompleteness]
abstract.insep [section, in FOL.Incompleteness.abstract_incompleteness]
abstract.insep.fs' [variable, in FOL.Incompleteness.abstract_incompleteness]
abstract.insep.fs'_extension [variable, in FOL.Incompleteness.abstract_incompleteness]
abstract.insep.Hrepr [variable, in FOL.Incompleteness.abstract_incompleteness]
abstract.insep.Hrepr [variable, in FOL.Incompleteness.abstract_incompleteness]
abstract.insep.Hrepr [variable, in FOL.Incompleteness.abstract_incompleteness]
abstract.insep.r [variable, in FOL.Incompleteness.abstract_incompleteness]
abstract.insep.r [variable, in FOL.Incompleteness.abstract_incompleteness]
abstract.insep.r [variable, in FOL.Incompleteness.abstract_incompleteness]
Abstract.models [variable, in FOL.Incompleteness.Abstract]
Abstract.neg [variable, in FOL.Incompleteness.Abstract]
Abstract.neg_inj [variable, in FOL.Incompleteness.Abstract]
Abstract.neg_dec [variable, in FOL.Incompleteness.Abstract]
Abstract.provable [variable, in FOL.Incompleteness.Abstract]
Abstract.provable_enum [variable, in FOL.Incompleteness.Abstract]
Abstract.Reduction [section, in FOL.Incompleteness.Abstract]
Abstract.Reduction.F [variable, in FOL.Incompleteness.Abstract]
Abstract.Reduction.F_standard [variable, in FOL.Incompleteness.Abstract]
Abstract.Reduction.F_provable [variable, in FOL.Incompleteness.Abstract]
Abstract.Reduction.p [variable, in FOL.Incompleteness.Abstract]
Abstract.Reduction.X [variable, in FOL.Incompleteness.Abstract]
Abstract.sat [variable, in FOL.Incompleteness.Abstract]
Abstract.sentences [variable, in FOL.Incompleteness.Abstract]
Abstract.sentences_discrete [variable, in FOL.Incompleteness.Abstract]
Abstract.soundness [variable, in FOL.Incompleteness.Abstract]
Abstract.standard [variable, in FOL.Incompleteness.Abstract]
Abstract.standard_exists [variable, in FOL.Incompleteness.Abstract]
abstract.theta [variable, in FOL.Incompleteness.abstract_incompleteness]
abstract.theta_universal [variable, in FOL.Incompleteness.abstract_incompleteness]
abstr_complete_decidable [lemma, in FOL.Incompleteness.Abstract]
Absurd [constructor, in FOL.Deduction.FragmentSequent]
abs_reduction_theorem [lemma, in FOL.Incompleteness.Abstract]
addRelIndex [definition, in FOL.Reification.GeneralReflection]
add_assoc [lemma, in FOL.Reification.DemoPA]
add_comm [lemma, in FOL.Reification.DemoPA]
add_succ_r [lemma, in FOL.Reification.DemoPA]
add_zero_r [lemma, in FOL.Reification.DemoPA]
add_zero_l [lemma, in FOL.Reification.DemoPA]
add_succ_l [lemma, in FOL.Reification.DemoPA]
add_comm [lemma, in FOL.Proofmode.DemoPA]
add_succ_r [lemma, in FOL.Proofmode.DemoPA]
add_zero_r [lemma, in FOL.Proofmode.DemoPA]
add_zero_num [lemma, in FOL.Incompleteness.qdec]
add_rec_swap2 [lemma, in FOL.Incompleteness.qdec]
add_rec_swap [lemma, in FOL.Incompleteness.qdec]
add_zero_swap [lemma, in FOL.Incompleteness.qdec]
Add_rec [lemma, in FOL.Tennenbaum.Peano]
add_le_mono [lemma, in FOL.Tennenbaum.Peano]
add_lt_mono [lemma, in FOL.Tennenbaum.Peano]
add_eq [lemma, in FOL.Tennenbaum.Peano]
add_asso [lemma, in FOL.Tennenbaum.Peano]
add_comm [lemma, in FOL.Tennenbaum.Peano]
add_rec_r [lemma, in FOL.Tennenbaum.Peano]
add_zero_r [lemma, in FOL.Tennenbaum.Peano]
add_rec [lemma, in FOL.Tennenbaum.Peano]
add_zero [lemma, in FOL.Tennenbaum.Peano]
add_assoc [lemma, in FOL.Reification.DemoPAExtensional]
add_comm [lemma, in FOL.Reification.DemoPAExtensional]
add_succ_r [lemma, in FOL.Reification.DemoPAExtensional]
add_zero_r [lemma, in FOL.Reification.DemoPAExtensional]
add_zero_l [lemma, in FOL.Reification.DemoPAExtensional]
add_succ_l [lemma, in FOL.Reification.DemoPAExtensional]
AL [constructor, in FOL.Deduction.FullSequent]
AllE [projection, in FOL.Proofmode.ProofMode]
AllEquivAll [lemma, in FOL.Utils.PrenexNormalForm]
AllI [projection, in FOL.Proofmode.ProofMode]
AllL [constructor, in FOL.Deduction.FragmentSequent]
AllL [constructor, in FOL.Deduction.FullSequent]
AllR [constructor, in FOL.Deduction.FragmentSequent]
AllR [constructor, in FOL.Deduction.FullSequent]
and_ldec [lemma, in FOL.Completeness.TarskiCompleteness]
anyVariableOf [definition, in FOL.Reification.GeneralReflection]
appendAndLift [definition, in FOL.Reification.GeneralReflection]
appendZero [definition, in FOL.Reification.GeneralReflection]
applyRecursively [definition, in FOL.Reification.GeneralReflection]
applyRecursivelyNP [definition, in FOL.Reification.GeneralReflection]
AR [constructor, in FOL.Deduction.FullSequent]
arbitrary_completeness_is_MP_prop [lemma, in FOL.Completeness.TarskiCompleteness]
arbitrary_completeness_is_LEM [lemma, in FOL.Completeness.TarskiCompleteness]
Arithmetic [section, in FOL.Incompleteness.PA_incompleteness]
ArithmeticalHierarchyEquiv [section, in FOL.ArithmeticalHierarchy.ArithmeticalHierarchyEquiv]
ArithmeticalHierarchyEquiv [library]
ArithmeticalHierarchySemantic [section, in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySemantic]
ArithmeticalHierarchySemantic [library]
ArithmeticalHierarchySemantic.list_vec_nat_inv [variable, in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySemantic]
ArithmeticalHierarchySemantic.list_vec_to_nat [variable, in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySemantic]
ArithmeticalHierarchySemantic.nat_list_vec_inv [variable, in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySemantic]
ArithmeticalHierarchySemantic.nat_to_list_vec [variable, in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySemantic]
ArithmeticalHierarchySemantic.nat_vec_inv [variable, in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySemantic]
ArithmeticalHierarchySemantic.nat_to_vec [variable, in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySemantic]
ArithmeticalHierarchySemantic.vec_nat_inv [variable, in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySemantic]
ArithmeticalHierarchySemantic.vec_to_nat [variable, in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySemantic]
ArithmeticalHierarchySyntactic [section, in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySyntactic]
ArithmeticalHierarchySyntactic [library]
_ ≡ _ [notation, in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySyntactic]
Arithmetics [library]
Arithmetic.Model [section, in FOL.Incompleteness.PA_incompleteness]
Arithmetic.Model.D [variable, in FOL.Incompleteness.PA_incompleteness]
Arithmetic.Model.ext_I [variable, in FOL.Incompleteness.PA_incompleteness]
Arithmetic.Model.I [variable, in FOL.Incompleteness.PA_incompleteness]
Arithmetic.Theory [section, in FOL.Incompleteness.PA_incompleteness]
Arithmetic.Theory.Incl [variable, in FOL.Incompleteness.PA_incompleteness]
Arithmetic.Theory.Std [variable, in FOL.Incompleteness.PA_incompleteness]
Arithmetic.Theory.T [variable, in FOL.Incompleteness.PA_incompleteness]
Ax [constructor, in FOL.Deduction.FragmentSequent]
Ax [constructor, in FOL.Deduction.FullSequent]
Axiomatisations [library]
Axioms [projection, in FOL.Proofmode.ProofMode]
ax_eq_elem [definition, in FOL.Proofmode.DemoZF]
ax_trans [definition, in FOL.Proofmode.DemoZF]
ax_sym [definition, in FOL.Proofmode.DemoZF]
ax_refl [definition, in FOL.Proofmode.DemoZF]
B
B [definition, in FOL.Tennenbaum.Tennenbaum_insep]baseConnectiveReifier [definition, in FOL.Reification.GeneralReflection]
baseConnectiveReifierNP [definition, in FOL.Reification.GeneralReflection]
baseConnectiveVars [definition, in FOL.Reification.GeneralReflection]
baseLogicConn [abbreviation, in FOL.Reification.GeneralReflection]
baseLogicConn [abbreviation, in FOL.Reification.GeneralReflection]
baseLogicConnHelper [projection, in FOL.Reification.GeneralReflection]
baseLogicVarHelper [projection, in FOL.Reification.GeneralReflection]
bAtom [constructor, in FOL.Proofmode.Hoas]
bBin [constructor, in FOL.Proofmode.Hoas]
bcompleteness [lemma, in FOL.Completeness.HeytingCompleteness]
bEmbedForm [constructor, in FOL.Proofmode.Hoas]
bEmbedT [constructor, in FOL.Proofmode.Hoas]
bFal [constructor, in FOL.Proofmode.Hoas]
bform [inductive, in FOL.Proofmode.Hoas]
bform_sind [definition, in FOL.Proofmode.Hoas]
bform_rec [definition, in FOL.Proofmode.Hoas]
bform_ind [definition, in FOL.Proofmode.Hoas]
bform_rect [definition, in FOL.Proofmode.Hoas]
bFree [constructor, in FOL.Proofmode.Hoas]
bFunc [constructor, in FOL.Proofmode.Hoas]
big_or [definition, in FOL.Deduction.FullSequentFacts]
bij [definition, in FOL.Tennenbaum.SyntheticInType]
bijection [definition, in FOL.Tennenbaum.CantorPairing]
Bij_Nat_NatNat [lemma, in FOL.Tennenbaum.CantorPairing]
binary [definition, in FOL.Tennenbaum.Church]
binary [definition, in FOL.Tennenbaum.Coding]
binary [definition, in FOL.Tennenbaum.Formulas]
bind [definition, in FOL.Reification.GeneralReflection]
binZ' [definition, in FOL.Incompleteness.Axiomatisations]
bin_bounded_forall_iff [lemma, in FOL.Incompleteness.bin_qdec]
bin_qdec.lemmas [section, in FOL.Incompleteness.bin_qdec]
bin_qdec [section, in FOL.Incompleteness.bin_qdec]
bin_qdec [library]
boolean [definition, in FOL.Semantics.Heyting.Heyting]
boolean_completion [lemma, in FOL.Completeness.HeytingCompleteness]
bool_to_nat [definition, in FOL.Incompleteness.epf]
Bot [projection, in FOL.Semantics.Heyting.Heyting]
bot_deriv_stable_k [lemma, in FOL.Completeness.KripkeCompleteness]
bot_valid_stable [lemma, in FOL.Completeness.KripkeCompleteness]
bot_deriv_stable_enum_k [lemma, in FOL.Completeness.KripkeCompleteness]
bot_closed [lemma, in FOL.Incompleteness.Abstract]
bot_deriv_stable_enum [lemma, in FOL.Completeness.TarskiCompleteness]
bot_deriv_stable_Sigma_0_1 [lemma, in FOL.Completeness.TarskiCompleteness]
bot_deriv_stable [lemma, in FOL.Completeness.TarskiCompleteness]
bot_valid_stable [lemma, in FOL.Completeness.TarskiCompleteness]
Bot1 [projection, in FOL.Semantics.Heyting.Heyting]
bounded_closed [lemma, in FOL.Incompleteness.Abstract]
bounded_coding [lemma, in FOL.Tennenbaum.Abstract_coding]
bounded_exist_times [lemma, in FOL.Incompleteness.sigma1]
bQuant [constructor, in FOL.Proofmode.Hoas]
BSoundness [lemma, in FOL.Semantics.Heyting.Soundness]
BSoundness [section, in FOL.Semantics.Heyting.Soundness]
BSoundness' [lemma, in FOL.Semantics.Heyting.Soundness]
bterm [inductive, in FOL.Proofmode.Hoas]
bterm_sind [definition, in FOL.Proofmode.Hoas]
bterm_rec [definition, in FOL.Proofmode.Hoas]
bterm_ind [definition, in FOL.Proofmode.Hoas]
bterm_rect [definition, in FOL.Proofmode.Hoas]
buildDefaultTarski [definition, in FOL.Reification.GeneralReflection]
bunion_swap [lemma, in FOL.Proofmode.DemoZF]
bunion_eset [lemma, in FOL.Proofmode.DemoZF]
bvalid [definition, in FOL.Completeness.HeytingCompleteness]
bVar [constructor, in FOL.Proofmode.Hoas]
C
Cantor [section, in FOL.Tennenbaum.CantorPairing]CantorBound [lemma, in FOL.Tennenbaum.CantorPairing]
CantorPairing [library]
case_help_T [lemma, in FOL.Proofmode.ProofMode]
case_help [lemma, in FOL.Proofmode.ProofMode]
cast [definition, in FOL.Proofmode.ProofMode]
cast_embed [lemma, in FOL.Incompleteness.PA_incompleteness]
cast_extists_eq [lemma, in FOL.Incompleteness.PA_incompleteness]
cblackbox [definition, in FOL.Proofmode.ProofMode]
ccons [definition, in FOL.Proofmode.ProofMode]
CE_undec_Z [lemma, in FOL.Incompleteness.Axiomatisations]
CE_undec_Z' [lemma, in FOL.Incompleteness.Axiomatisations]
CE1 [projection, in FOL.Proofmode.ProofMode]
CE2 [projection, in FOL.Proofmode.ProofMode]
CHAEval [section, in FOL.Semantics.Heyting.Heyting]
CHAEval.hinter_Pr [variable, in FOL.Semantics.Heyting.Heyting]
CHAProperty [section, in FOL.Semantics.Heyting.Heyting]
_ <~> _ (type_scope) [notation, in FOL.Semantics.Heyting.Heyting]
Church [library]
ChurchThesis [section, in FOL.Tennenbaum.Church]
CI [projection, in FOL.Proofmode.ProofMode]
Classical [section, in FOL.Proofmode.ProofMode]
ClassicalDeductionRules [record, in FOL.Proofmode.ProofMode]
class_Q_to_H10p [lemma, in FOL.Incompleteness.PA_incompleteness]
clb_alg_boolean [lemma, in FOL.Completeness.HeytingCompleteness]
clb_Pr [definition, in FOL.Completeness.HeytingCompleteness]
clb_calg [instance, in FOL.Completeness.HeytingCompleteness]
clb_alg [instance, in FOL.Completeness.HeytingCompleteness]
closed [definition, in FOL.Incompleteness.Abstract]
closed_term_is_num [lemma, in FOL.Tennenbaum.Peano]
closed_enum [lemma, in FOL.Incompleteness.Abstract]
closed_discrete [lemma, in FOL.Incompleteness.Abstract]
closed_dec [lemma, in FOL.Incompleteness.Abstract]
closed_mere [lemma, in FOL.Incompleteness.Abstract]
closed_num [lemma, in FOL.Tennenbaum.Formulas]
closed_term_is_num [lemma, in FOL.Incompleteness.fol_utils]
cnil [definition, in FOL.Proofmode.ProofMode]
code [definition, in FOL.Tennenbaum.CantorPairing]
code_next [lemma, in FOL.Tennenbaum.CantorPairing]
Coding [section, in FOL.Tennenbaum.Abstract_coding]
Coding [library]
Coding_Dec_ct [lemma, in FOL.Tennenbaum.Tennenbaum_diagonal]
Coding_Dec [lemma, in FOL.Tennenbaum.Tennenbaum_diagonal]
Coding_nonstd_binary [lemma, in FOL.Tennenbaum.Coding]
Coding_nonStd_unary [lemma, in FOL.Tennenbaum.Coding]
Coding_model_binary [lemma, in FOL.Tennenbaum.Coding]
Coding_model_unary [lemma, in FOL.Tennenbaum.Coding]
Coding_nat [lemma, in FOL.Tennenbaum.Coding]
Coding_nat' [lemma, in FOL.Tennenbaum.Coding]
Coding.H_extend [variable, in FOL.Tennenbaum.Abstract_coding]
Coding.H_empty [variable, in FOL.Tennenbaum.Abstract_coding]
Coding.In [variable, in FOL.Tennenbaum.Abstract_coding]
_ ∈ _ [notation, in FOL.Tennenbaum.Abstract_coding]
complete [definition, in FOL.Incompleteness.formal_systems]
complete [definition, in FOL.Incompleteness.Axiomatisations]
CompleteHeytingAlgebra [record, in FOL.Semantics.Heyting.Heyting]
completeness [definition, in FOL.Incompleteness.Abstract]
Completeness [section, in FOL.Completeness.TarskiCompleteness]
completeness_decidable [lemma, in FOL.Incompleteness.Abstract]
completeness_enumerable [definition, in FOL.Completeness.TarskiCompleteness]
completeness_Sigma_0_1 [definition, in FOL.Completeness.TarskiCompleteness]
completeness_arbitrary [definition, in FOL.Completeness.TarskiCompleteness]
completeness_standard_stability' [lemma, in FOL.Completeness.TarskiCompleteness]
completeness_classical_stability [lemma, in FOL.Completeness.TarskiCompleteness]
completeness_standard_stability [lemma, in FOL.Completeness.TarskiCompleteness]
Completeness.BotModel [section, in FOL.Completeness.TarskiCompleteness]
Completeness.BotModel.Hcon [variable, in FOL.Completeness.TarskiCompleteness]
Completeness.BotModel.T [variable, in FOL.Completeness.TarskiCompleteness]
Completeness.BotModel.T_closed [variable, in FOL.Completeness.TarskiCompleteness]
Completeness.eF [variable, in FOL.Completeness.TarskiCompleteness]
Completeness.eP [variable, in FOL.Completeness.TarskiCompleteness]
Completeness.ExplodingCompleteness [section, in FOL.Completeness.TarskiCompleteness]
Completeness.ExplodingCompletenessConstr [section, in FOL.Completeness.TarskiCompleteness]
Completeness.ExplodingCompletenessConstr.HT [variable, in FOL.Completeness.TarskiCompleteness]
Completeness.ExplodingCompletenessConstr.T [variable, in FOL.Completeness.TarskiCompleteness]
Completeness.FragmentCompleteness [section, in FOL.Completeness.TarskiCompleteness]
Completeness.FragmentCompleteness [section, in FOL.Completeness.TarskiCompleteness]
Completeness.FragmentModel [section, in FOL.Completeness.TarskiCompleteness]
Completeness.FragmentModel.GBot [variable, in FOL.Completeness.TarskiCompleteness]
Completeness.FragmentModel.GBot_closed [variable, in FOL.Completeness.TarskiCompleteness]
Completeness.FragmentModel.T [variable, in FOL.Completeness.TarskiCompleteness]
Completeness.FragmentModel.T_closed [variable, in FOL.Completeness.TarskiCompleteness]
Completeness.LEM_Equivalence [section, in FOL.Completeness.TarskiCompleteness]
Completeness.MPStrongCompleteness [section, in FOL.Completeness.TarskiCompleteness]
Completeness.MPStrongCompleteness.He [variable, in FOL.Completeness.TarskiCompleteness]
Completeness.MPStrongCompleteness.Hphi [variable, in FOL.Completeness.TarskiCompleteness]
Completeness.MPStrongCompleteness.HT [variable, in FOL.Completeness.TarskiCompleteness]
Completeness.MPStrongCompleteness.mp [variable, in FOL.Completeness.TarskiCompleteness]
Completeness.MPStrongCompleteness.phi [variable, in FOL.Completeness.TarskiCompleteness]
Completeness.MPStrongCompleteness.T [variable, in FOL.Completeness.TarskiCompleteness]
Completeness.MP_Equivalence [section, in FOL.Completeness.TarskiCompleteness]
Completeness.MP_prop_Equivalence.T_sigma.A_matches_T [variable, in FOL.Completeness.TarskiCompleteness]
Completeness.MP_prop_Equivalence.T_sigma.HA_T [variable, in FOL.Completeness.TarskiCompleteness]
Completeness.MP_prop_Equivalence.T_sigma.A_T_cumul [variable, in FOL.Completeness.TarskiCompleteness]
Completeness.MP_prop_Equivalence.T_sigma.A_T [variable, in FOL.Completeness.TarskiCompleteness]
Completeness.MP_prop_Equivalence.T_sigma.T_cls [variable, in FOL.Completeness.TarskiCompleteness]
Completeness.MP_prop_Equivalence.T_sigma [section, in FOL.Completeness.TarskiCompleteness]
Completeness.MP_prop_Equivalence [section, in FOL.Completeness.TarskiCompleteness]
Completeness.StandardCompleteness [section, in FOL.Completeness.TarskiCompleteness]
Completeness.StandardCompleteness.Hphi [variable, in FOL.Completeness.TarskiCompleteness]
Completeness.StandardCompleteness.HT [variable, in FOL.Completeness.TarskiCompleteness]
Completeness.StandardCompleteness.phi [variable, in FOL.Completeness.TarskiCompleteness]
Completeness.StandardCompleteness.T [variable, in FOL.Completeness.TarskiCompleteness]
complete_decidable [lemma, in FOL.Incompleteness.formal_systems]
complete_reduction [lemma, in FOL.Incompleteness.Axiomatisations]
complete_decidable [lemma, in FOL.Incompleteness.Axiomatisations]
completion_calgebra [definition, in FOL.Completeness.HeytingMacNeille]
completion_algebra [definition, in FOL.Completeness.HeytingMacNeille]
Composition [section, in FOL.Completeness.TarskiConstructions]
compress_free3 [lemma, in FOL.Incompleteness.ctq]
compress_free [lemma, in FOL.Incompleteness.ctq]
computational_explosion_is_sane [definition, in FOL.Incompleteness.Axiomatisations]
computational_explosion [definition, in FOL.Incompleteness.Axiomatisations]
comp_part_partial [definition, in FOL.Incompleteness.utils]
comp_part_total [definition, in FOL.Incompleteness.utils]
cons [definition, in FOL.Completeness.KripkeCompleteness]
conservativity [section, in FOL.Incompleteness.sigma1]
Consistency [section, in FOL.Completeness.Consistency]
Consistency [library]
consistency_inheritance [lemma, in FOL.Completeness.Consistency]
Consistency.Classical [section, in FOL.Completeness.Consistency]
Consistency.Classical.XM [variable, in FOL.Completeness.Consistency]
consistent [projection, in FOL.Incompleteness.formal_systems]
consistent [definition, in FOL.Completeness.Consistency]
consistent_max_out2 [lemma, in FOL.Completeness.Consistency]
consistent_max_impl [lemma, in FOL.Completeness.Consistency]
consistent_max_out [lemma, in FOL.Completeness.Consistency]
consistent_neg2 [lemma, in FOL.Completeness.Consistency]
consistent_neg [lemma, in FOL.Completeness.Consistency]
consistent_prv [lemma, in FOL.Completeness.Consistency]
consistent_max [definition, in FOL.Completeness.Consistency]
consistent_join_step [lemma, in FOL.Completeness.TarskiConstructions]
constructForm [definition, in FOL.Reification.GeneralReflection]
ConstructionInputs [record, in FOL.Completeness.TarskiConstructions]
ConstructionOutputs [record, in FOL.Completeness.TarskiConstructions]
constructTerm [definition, in FOL.Reification.GeneralReflection]
construct_construction [lemma, in FOL.Completeness.TarskiConstructions]
cons_ctx [definition, in FOL.Completeness.KripkeCompleteness]
contains_rem [lemma, in FOL.Proofmode.Theories]
contains_extend3 [lemma, in FOL.Proofmode.Theories]
contains_extend2 [lemma, in FOL.Proofmode.Theories]
contains_extend1 [lemma, in FOL.Proofmode.Theories]
contains_app [lemma, in FOL.Proofmode.Theories]
contains_cons2 [lemma, in FOL.Proofmode.Theories]
contains_cons [lemma, in FOL.Proofmode.Theories]
contains_nil [lemma, in FOL.Proofmode.Theories]
ContextUtil [section, in FOL.Proofmode.ProofMode]
ContextUtil.p [variable, in FOL.Proofmode.ProofMode]
context_shift [lemma, in FOL.Deduction.FullSequentFacts]
Contr [constructor, in FOL.Deduction.FragmentSequent]
Contr [constructor, in FOL.Deduction.FullSequent]
contradiction_help_T [lemma, in FOL.Proofmode.ProofMode]
contradiction_help [lemma, in FOL.Proofmode.ProofMode]
conv [definition, in FOL.Proofmode.Hoas]
convert [definition, in FOL.Proofmode.Hoas]
convert_PNF_PNF [lemma, in FOL.Utils.PrenexNormalForm]
convert_PNF [definition, in FOL.Utils.PrenexNormalForm]
conv_form_noQuant [lemma, in FOL.Utils.PrenexNormalForm]
conv_form [definition, in FOL.Utils.PrenexNormalForm]
conv_list [definition, in FOL.Utils.PrenexNormalForm]
conv_term [definition, in FOL.Proofmode.Hoas]
CoqRosser [module, in FOL.Tennenbaum.HA_insep]
CoqRosser.CoqRosser [section, in FOL.Tennenbaum.HA_insep]
CoqRosser.rosser [definition, in FOL.Tennenbaum.HA_insep]
CoqRosser.rosser_disj [lemma, in FOL.Tennenbaum.HA_insep]
CoqRosser.rosser_equiv [lemma, in FOL.Tennenbaum.HA_insep]
core [projection, in FOL.Incompleteness.utils]
core_valid [definition, in FOL.Incompleteness.utils]
createEnvTerms [definition, in FOL.Reification.GeneralReflection]
ctq [section, in FOL.Incompleteness.ctq]
ctq [section, in FOL.Incompleteness.ctq]
CTQ [definition, in FOL.Incompleteness.ctq]
ctq [section, in FOL.Incompleteness.ctq]
ctq [library]
ctq_strong_sepr [lemma, in FOL.Incompleteness.ctq]
ctq_weak_repr [lemma, in FOL.Incompleteness.ctq]
ctq_repr [section, in FOL.Incompleteness.ctq]
ctq_epfn [lemma, in FOL.Incompleteness.ctq]
ctq_epf [section, in FOL.Incompleteness.ctq]
ctq_ctq_total [lemma, in FOL.Incompleteness.ctq]
CTQ_total [definition, in FOL.Incompleteness.ctq]
ctq.theta [variable, in FOL.Incompleteness.ctq]
ctq.theta_mu_universal [variable, in FOL.Incompleteness.ctq]
ctq.theta_universal [variable, in FOL.Incompleteness.ctq]
ctq.wrepr [variable, in FOL.Incompleteness.ctq]
ctq.φ [variable, in FOL.Incompleteness.ctq]
ctq.φ1_bounded [variable, in FOL.Incompleteness.ctq]
ctq.φ1_qdec [variable, in FOL.Incompleteness.ctq]
Ctx [projection, in FOL.Proofmode.ProofMode]
ctx_incl [definition, in FOL.Completeness.KripkeCompleteness]
ctx_in [lemma, in FOL.Deduction.FullSequentFacts]
ctx_out [lemma, in FOL.Deduction.FullSequentFacts]
CT_RTw [lemma, in FOL.Tennenbaum.Church]
CT_RTs [lemma, in FOL.Tennenbaum.Church]
CT_WCT [lemma, in FOL.Tennenbaum.Church]
CT_Q [definition, in FOL.Tennenbaum.Church]
CT_Insep_form [lemma, in FOL.Tennenbaum.Tennenbaum_insep]
CT_Insep_pred [lemma, in FOL.Tennenbaum.Tennenbaum_insep]
cumul_list_max [lemma, in FOL.Completeness.TarskiCompleteness]
curry [lemma, in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySemantic]
curry_to_uncurry [lemma, in FOL.Tennenbaum.HA_insep]
curry0 [lemma, in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySemantic]
curry1 [lemma, in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySemantic]
curry2 [lemma, in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySemantic]
cutfree_seq_ND [lemma, in FOL.Deduction.FragmentSequentFacts]
cycle_shift_subject [lemma, in FOL.Deduction.FullSequentFacts]
cycle_shift_shift [lemma, in FOL.Deduction.FullSequentFacts]
cycle_shift [definition, in FOL.Deduction.FullSequentFacts]
D
D [projection, in FOL.Reification.GeneralReflection]dclosed [definition, in FOL.Completeness.HeytingMacNeille]
DE [projection, in FOL.Proofmode.ProofMode]
Dec [definition, in FOL.Tennenbaum.SyntheticInType]
dec [definition, in FOL.Tennenbaum.SyntheticInType]
decider [definition, in FOL.Tennenbaum.SyntheticInType]
decide_string_eq [definition, in FOL.Reification.GeneralReflection]
decode [definition, in FOL.Tennenbaum.CantorPairing]
dec_contraposition [lemma, in FOL.Tennenbaum.Tennenbaum_diagonal]
dec_div_2 [lemma, in FOL.Tennenbaum.Tennenbaum_diagonal]
dec_div [lemma, in FOL.Tennenbaum.Tennenbaum_diagonal]
Dec_sigT_prime [lemma, in FOL.Tennenbaum.NumberUtils]
dec_irred_factor [lemma, in FOL.Tennenbaum.NumberUtils]
dec_irred_factor' [lemma, in FOL.Tennenbaum.NumberUtils]
dec_help_2 [lemma, in FOL.Tennenbaum.NumberUtils]
dec_help_1 [lemma, in FOL.Tennenbaum.NumberUtils]
Dec_sigT_irred [lemma, in FOL.Tennenbaum.NumberUtils]
dec_eq_nat [abbreviation, in FOL.Tennenbaum.NumberUtils]
dec_help_1 [lemma, in FOL.Incompleteness.Abstract]
Dec_equivalent_predicates [lemma, in FOL.Tennenbaum.SyntheticInType]
dec_Dec_sig_T [lemma, in FOL.Tennenbaum.SyntheticInType]
Dec_sigT_decider [lemma, in FOL.Tennenbaum.SyntheticInType]
Dec_decider_nat [lemma, in FOL.Tennenbaum.SyntheticInType]
Dec_transport [lemma, in FOL.Tennenbaum.SyntheticInType]
Dec_decider [lemma, in FOL.Tennenbaum.SyntheticInType]
Dec_sigT [definition, in FOL.Tennenbaum.SyntheticInType]
dec_lt_bounded_forall [lemma, in FOL.Tennenbaum.MoreDecidabilityFacts]
dec_lt_bounded_exist [lemma, in FOL.Tennenbaum.MoreDecidabilityFacts]
dec_lt_bounded_exist' [lemma, in FOL.Tennenbaum.MoreDecidabilityFacts]
dec_lt_bounded_sig [lemma, in FOL.Tennenbaum.MoreDecidabilityFacts]
Dec_sigT_transport [lemma, in FOL.Tennenbaum.MoreDecidabilityFacts]
dec_in_ex [lemma, in FOL.Completeness.TarskiCompleteness]
decΔ1syn [definition, in FOL.ArithmeticalHierarchy.ArithmeticalHierarchyEquiv]
decΣ1syn [definition, in FOL.ArithmeticalHierarchy.ArithmeticalHierarchyEquiv]
decΣ1syn_incl_1 [lemma, in FOL.ArithmeticalHierarchy.ArithmeticalHierarchyEquiv]
decΣ1syn_decΔ1syn [lemma, in FOL.ArithmeticalHierarchy.ArithmeticalHierarchyEquiv]
DeductionRules [record, in FOL.Proofmode.ProofMode]
dedup [definition, in FOL.Reification.GeneralReflection]
defaultExtensions [definition, in FOL.Reification.GeneralReflection]
Definite [definition, in FOL.Tennenbaum.SyntheticInType]
definite [definition, in FOL.Tennenbaum.SyntheticInType]
def_HA_Insep [definition, in FOL.Tennenbaum.Variants]
Delta1_absoluteness [lemma, in FOL.Tennenbaum.Tennenbaum_insep]
DemoMinZF [library]
DemoPA [library]
DemoPA [library]
DemoPAExtensional [library]
DemoZF [library]
digit_to_string [definition, in FOL.Proofmode.ProofMode]
Discrete [definition, in FOL.Tennenbaum.SyntheticInType]
Discrete_sum [lemma, in FOL.Tennenbaum.SyntheticInType]
Discrete_equiv [lemma, in FOL.Tennenbaum.SyntheticInType]
discriminate [lemma, in FOL.Reification.DemoPA]
discriminate [lemma, in FOL.Reification.DemoPAExtensional]
Disjoint_AB [lemma, in FOL.Tennenbaum.Tennenbaum_insep]
distributive [lemma, in FOL.Tennenbaum.Peano]
div [definition, in FOL.Tennenbaum.Tennenbaum_insep]
Div [definition, in FOL.Tennenbaum.NumberUtils]
div [definition, in FOL.Tennenbaum.Coding]
Divides_num [lemma, in FOL.Tennenbaum.Coding]
division_theorem [lemma, in FOL.Proofmode.DemoPA]
div_pi [definition, in FOL.Tennenbaum.Variants]
Div_nat [definition, in FOL.Tennenbaum.Variants]
div_pi [definition, in FOL.Tennenbaum.Tennenbaum_insep]
Div_nat [definition, in FOL.Tennenbaum.Tennenbaum_insep]
div_num [definition, in FOL.Tennenbaum.Tennenbaum_insep]
div_pi [definition, in FOL.Tennenbaum.Tennenbaum_diagonal]
div_num [definition, in FOL.Tennenbaum.Tennenbaum_diagonal]
Div_lt [lemma, in FOL.Tennenbaum.NumberUtils]
div_pi [definition, in FOL.Tennenbaum.Coding]
Div_nat [definition, in FOL.Tennenbaum.Coding]
div_num [definition, in FOL.Tennenbaum.Coding]
DI1 [projection, in FOL.Proofmode.ProofMode]
DI2 [projection, in FOL.Proofmode.ProofMode]
DN [definition, in FOL.Utils.PrenexNormalForm]
DN [module, in FOL.Tennenbaum.DN_Utils]
DN [lemma, in FOL.Tennenbaum.SyntheticInType]
DN [definition, in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySemantic]
DN [definition, in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySyntactic]
DNE [definition, in FOL.Tennenbaum.SyntheticInType]
DNE_Overspill [lemma, in FOL.Tennenbaum.Coding]
DN_to_IndependenceOfGeneralPremises [lemma, in FOL.Utils.PrenexNormalForm]
DN_bounded_lem [lemma, in FOL.Tennenbaum.Coding]
DN_Dec_equiv [lemma, in FOL.Tennenbaum.SyntheticInType]
DN_forall_stable [lemma, in FOL.Tennenbaum.SyntheticInType]
DN_chaining [lemma, in FOL.Tennenbaum.SyntheticInType]
DN_remove [lemma, in FOL.Tennenbaum.SyntheticInType]
DN_coding [lemma, in FOL.Tennenbaum.Abstract_coding]
DN_bounded_lem [lemma, in FOL.Tennenbaum.Abstract_coding]
DN_Markov [lemma, in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySemantic]
DN_Utils [library]
DN.bind_ [definition, in FOL.Tennenbaum.DN_Utils]
DN.dne_ [definition, in FOL.Tennenbaum.DN_Utils]
DN.lem_ [definition, in FOL.Tennenbaum.DN_Utils]
DN.remove_ [definition, in FOL.Tennenbaum.DN_Utils]
DN.ret_ [definition, in FOL.Tennenbaum.DN_Utils]
down [definition, in FOL.Completeness.HeytingMacNeille]
down_inf [lemma, in FOL.Completeness.HeytingMacNeille]
down_impl [lemma, in FOL.Completeness.HeytingMacNeille]
down_join [lemma, in FOL.Completeness.HeytingMacNeille]
down_meet [lemma, in FOL.Completeness.HeytingMacNeille]
down_top [lemma, in FOL.Completeness.HeytingMacNeille]
down_bot [lemma, in FOL.Completeness.HeytingMacNeille]
down_mono [lemma, in FOL.Completeness.HeytingMacNeille]
down_inj [lemma, in FOL.Completeness.HeytingMacNeille]
down_normal [lemma, in FOL.Completeness.HeytingMacNeille]
DPexp1 [definition, in FOL.Completeness.TarskiConstructions]
DPexp2 [definition, in FOL.Completeness.TarskiConstructions]
DPexp3 [definition, in FOL.Completeness.TarskiConstructions]
dprm_definable [lemma, in FOL.Incompleteness.epf_mu]
DR1 [lemma, in FOL.Incompleteness.weak_strong]
DR1' [lemma, in FOL.Incompleteness.weak_strong]
DR2 [lemma, in FOL.Incompleteness.weak_strong]
D_eq_dec [lemma, in FOL.Tennenbaum.Peano]
E
econsistency_trans [lemma, in FOL.Completeness.TarskiConstructions]econsistency_inheritance [lemma, in FOL.Completeness.TarskiConstructions]
econsistent [definition, in FOL.Completeness.TarskiConstructions]
econsistent_prv [lemma, in FOL.Completeness.TarskiConstructions]
econsistent_Omega [lemma, in FOL.Completeness.TarskiConstructions]
econsistent_join_sub [lemma, in FOL.Completeness.TarskiConstructions]
econsistent_join [definition, in FOL.Completeness.TarskiConstructions]
embed [definition, in FOL.Completeness.HeytingMacNeille]
embed [definition, in FOL.Deduction.FragmentSequentFacts]
embed_eval [lemma, in FOL.Incompleteness.epf_mu]
embed_poly_bound [lemma, in FOL.Incompleteness.epf_mu]
embed_poly [definition, in FOL.Incompleteness.epf_mu]
embed' [definition, in FOL.Incompleteness.ctq]
embed'_unembed' [lemma, in FOL.Incompleteness.ctq]
embed'_expl [lemma, in FOL.Incompleteness.ctq]
emptyEnv [projection, in FOL.Reification.GeneralReflection]
enum [projection, in FOL.Completeness.TarskiConstructions]
Enumerable [definition, in FOL.Tennenbaum.SyntheticInType]
enumerable [definition, in FOL.Tennenbaum.SyntheticInType]
enumerable_Q_prv [lemma, in FOL.Tennenbaum.Tennenbaum_insep]
enumerable_equiv [lemma, in FOL.Incompleteness.Axiomatisations]
enumerable_equiv [lemma, in FOL.Incompleteness.Abstract]
enumerable_surjection [lemma, in FOL.Tennenbaum.SyntheticInType]
enumerable_equiv [lemma, in FOL.Tennenbaum.SyntheticInType]
enumerable_nat [lemma, in FOL.Tennenbaum.SyntheticInType]
enumerable_completeness_is_MP [lemma, in FOL.Completeness.TarskiCompleteness]
enumerable_separable [lemma, in FOL.Incompleteness.utils]
Enumeration [section, in FOL.Completeness.EnumerationUtils]
EnumerationUtils [library]
Enumeration.eF [variable, in FOL.Completeness.EnumerationUtils]
Enumeration.eP [variable, in FOL.Completeness.EnumerationUtils]
Enumeration.nat_inject [section, in FOL.Completeness.EnumerationUtils]
enumT_quantop [lemma, in FOL.Deduction.FragmentSequentFacts]
enumT_binop [lemma, in FOL.Deduction.FragmentSequentFacts]
enum_ZF_preds [definition, in FOL.Incompleteness.Axiomatisations]
enum_ZF_syms [definition, in FOL.Incompleteness.Axiomatisations]
enum_PA_preds [definition, in FOL.Incompleteness.Axiomatisations]
enum_PA_syms [definition, in FOL.Incompleteness.Axiomatisations]
enum_stprv [lemma, in FOL.Deduction.FragmentSequentFacts]
enum_sprv [lemma, in FOL.Deduction.FragmentSequentFacts]
enum_form' [instance, in FOL.Deduction.FragmentSequentFacts]
enum_term' [instance, in FOL.Deduction.FragmentSequentFacts]
enum_quantop [instance, in FOL.Deduction.FragmentSequentFacts]
enum_binop [instance, in FOL.Deduction.FragmentSequentFacts]
enum_bounded [projection, in FOL.Completeness.TarskiConstructions]
enum_enum [projection, in FOL.Completeness.TarskiConstructions]
EnvConstructor [section, in FOL.Reification.GeneralReflection]
EnvHelpers [section, in FOL.Reification.GeneralReflection]
epf [section, in FOL.Incompleteness.epf]
epf [library]
epf_nat_bool [lemma, in FOL.Incompleteness.epf]
epf_nat_bool [section, in FOL.Incompleteness.epf]
EPF_N [definition, in FOL.Incompleteness.epf]
EPF_B [definition, in FOL.Incompleteness.epf]
epf_mu_ctq [lemma, in FOL.Incompleteness.ctq]
epf_mu_uctq [lemma, in FOL.Incompleteness.ctq]
epf_n_uctq [lemma, in FOL.Incompleteness.ctq]
epf_mu [library]
epf.theta [variable, in FOL.Incompleteness.epf]
epf.theta_universal [variable, in FOL.Incompleteness.epf]
eq [projection, in FOL.Proofmode.ProofMode]
eqdec_preds [instance, in FOL.Proofmode.DemoPA]
eqdec_funcs [instance, in FOL.Proofmode.DemoPA]
eqdec_ZF_preds [instance, in FOL.Incompleteness.Axiomatisations]
eqdec_ZF_syms [instance, in FOL.Incompleteness.Axiomatisations]
eqdec_PA_preds [instance, in FOL.Incompleteness.Axiomatisations]
eqdec_PA_syms [instance, in FOL.Incompleteness.Axiomatisations]
EqDec_preds [instance, in FOL.Incompleteness.Axiomatisations]
EqDec_funcs [instance, in FOL.Incompleteness.Axiomatisations]
eqdec_preds' [instance, in FOL.Proofmode.DemoMinZF]
eqdec_sig_empty [instance, in FOL.Proofmode.DemoMinZF]
EqDec_preds [instance, in FOL.Incompleteness.Abstract]
EqDec_syms [instance, in FOL.Incompleteness.Abstract]
eqdec_on [instance, in FOL.Incompleteness.Abstract]
eqdec_quantop [instance, in FOL.Deduction.FragmentSequentFacts]
eqdec_binop [instance, in FOL.Deduction.FragmentSequentFacts]
eqdec_preds [instance, in FOL.Proofmode.DemoZF]
eqdec_funcs [instance, in FOL.Proofmode.DemoZF]
eqH [definition, in FOL.Semantics.Heyting.Heyting]
eqhd [lemma, in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySemantic]
eqtl [lemma, in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySemantic]
equivToCoq [lemma, in FOL.Utils.PrenexNormalForm]
equivTrans [lemma, in FOL.Utils.PrenexNormalForm]
equiv_HA_refl [instance, in FOL.Semantics.Heyting.Heyting]
equiv_HA [definition, in FOL.Semantics.Heyting.Heyting]
equiv_subst [lemma, in FOL.Tennenbaum.Tennenbaum_insep]
equiv_sdec_functions [lemma, in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySemantic]
equiv_DN_sdec [lemma, in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySemantic]
equiv_form [definition, in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySyntactic]
eq_mult [lemma, in FOL.Tennenbaum.Peano]
eq_add [lemma, in FOL.Tennenbaum.Peano]
eq_succ [lemma, in FOL.Tennenbaum.Peano]
eq_trans [lemma, in FOL.Tennenbaum.Peano]
eq_sym [lemma, in FOL.Tennenbaum.Peano]
eq_dec_ff [instance, in FOL.Incompleteness.Axiomatisations]
eq_subst_help [lemma, in FOL.Proofmode.ProofMode]
eq_pred_congr [projection, in FOL.Proofmode.ProofMode]
eq_func_congr [projection, in FOL.Proofmode.ProofMode]
eq_sym [projection, in FOL.Proofmode.ProofMode]
eq_refl [projection, in FOL.Proofmode.ProofMode]
eq_binary [projection, in FOL.Proofmode.ProofMode]
Eq_pred [projection, in FOL.Proofmode.ProofMode]
eq_dec_full_logic_quant [instance, in FOL.Proofmode.ProofMode]
eq_dec_full_operators [instance, in FOL.Proofmode.ProofMode]
erase_ra_rel [lemma, in FOL.Incompleteness.epf_mu]
Euclid [definition, in FOL.Tennenbaum.NumberUtils]
eval_num [lemma, in FOL.Tennenbaum.Peano]
eval_ident [lemma, in FOL.Completeness.TarskiCompleteness]
example [lemma, in FOL.Reification.DemoPA]
ExE [projection, in FOL.Proofmode.ProofMode]
ExEquivEx [lemma, in FOL.Utils.PrenexNormalForm]
ExI [projection, in FOL.Proofmode.ProofMode]
exists_fin_disj [lemma, in FOL.Incompleteness.qdec]
exists_compression [lemma, in FOL.Incompleteness.sigma1]
exists_compression_2 [lemma, in FOL.Incompleteness.sigma1]
exist_times [definition, in FOL.Tennenbaum.Peano]
exist_times_Σ1 [lemma, in FOL.Incompleteness.sigma1]
ExL [constructor, in FOL.Deduction.FullSequent]
Exp [projection, in FOL.Proofmode.ProofMode]
Exp [constructor, in FOL.Deduction.FullSequent]
Exp [definition, in FOL.Completeness.TarskiConstructions]
exp [definition, in FOL.Completeness.TarskiConstructions]
exploding [definition, in FOL.Completeness.TarskiConstructions]
exploding_inherit [lemma, in FOL.Completeness.TarskiConstructions]
expl_interp [definition, in FOL.Completeness.TarskiCompleteness]
Exp_exploding [lemma, in FOL.Completeness.TarskiConstructions]
Exp_closed [lemma, in FOL.Completeness.TarskiConstructions]
Exp_econsistent [lemma, in FOL.Completeness.TarskiConstructions]
Exp_sub [lemma, in FOL.Completeness.TarskiConstructions]
exp_axiom_lift [lemma, in FOL.Completeness.TarskiConstructions]
exp_axiom_closed [lemma, in FOL.Completeness.TarskiConstructions]
exp_axiom [definition, in FOL.Completeness.TarskiConstructions]
ExR [constructor, in FOL.Deduction.FullSequent]
extend [definition, in FOL.Proofmode.Theories]
extension [definition, in FOL.Incompleteness.formal_systems]
extensional_model [definition, in FOL.Tennenbaum.Peano]
extensional_Πsyn [lemma, in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySyntactic]
extensional_Σsyn [lemma, in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySyntactic]
extract_from_class [lemma, in FOL.Incompleteness.PA_incompleteness]
ext_nat [definition, in FOL.Incompleteness.PA_incompleteness]
F
Factor [lemma, in FOL.Tennenbaum.NumberUtils]factorial [definition, in FOL.Tennenbaum.NumberUtils]
factorial_divisible [lemma, in FOL.Tennenbaum.NumberUtils]
factorial_divisible_n [lemma, in FOL.Tennenbaum.NumberUtils]
factorial_positive [lemma, in FOL.Tennenbaum.NumberUtils]
facts [section, in FOL.Incompleteness.formal_systems]
Fac_eq [lemma, in FOL.Tennenbaum.NumberUtils]
Fac_unique [lemma, in FOL.Tennenbaum.NumberUtils]
FAeq [definition, in FOL.Proofmode.DemoPA]
FAI [definition, in FOL.Proofmode.DemoPA]
fail [constructor, in FOL.Reification.GeneralReflection]
FailureMonad [inductive, in FOL.Reification.GeneralReflection]
FailureMonad [section, in FOL.Reification.GeneralReflection]
FailureMonad_sind [definition, in FOL.Reification.GeneralReflection]
FailureMonad_rec [definition, in FOL.Reification.GeneralReflection]
FailureMonad_ind [definition, in FOL.Reification.GeneralReflection]
FailureMonad_rect [definition, in FOL.Reification.GeneralReflection]
_ <- _ ;; _ [notation, in FOL.Reification.GeneralReflection]
fail_fmap' [definition, in FOL.Reification.GeneralReflection]
fail_fmap [definition, in FOL.Reification.GeneralReflection]
FalsityDeductionRules [record, in FOL.Proofmode.ProofMode]
Fapply [section, in FOL.Proofmode.ProofMode]
fapply_equiv_r_T [lemma, in FOL.Proofmode.ProofMode]
fapply_equiv_l_T [lemma, in FOL.Proofmode.ProofMode]
fapply_equiv_r [lemma, in FOL.Proofmode.ProofMode]
fapply_equiv_l [lemma, in FOL.Proofmode.ProofMode]
Fapply.p [variable, in FOL.Proofmode.ProofMode]
Fassert [section, in FOL.Proofmode.ProofMode]
fassert_help_T [lemma, in FOL.Proofmode.ProofMode]
fassert_help [lemma, in FOL.Proofmode.ProofMode]
Fdestruct [section, in FOL.Proofmode.ProofMode]
fdestruct_discharge_premises_T [lemma, in FOL.Proofmode.ProofMode]
fdestruct_discharge_premises [lemma, in FOL.Proofmode.ProofMode]
ff [instance, in FOL.Tennenbaum.Church]
findPropRepresentation [definition, in FOL.Reification.GeneralReflection]
findPropRepresentationNP [definition, in FOL.Reification.GeneralReflection]
findTermRepresentation [definition, in FOL.Reification.GeneralReflection]
findTermRepresentationNP [definition, in FOL.Reification.GeneralReflection]
findUBAnd [definition, in FOL.Reification.GeneralReflection]
findUBBase [definition, in FOL.Reification.GeneralReflection]
findUBExists [definition, in FOL.Reification.GeneralReflection]
findUBFalse [definition, in FOL.Reification.GeneralReflection]
findUBIff [definition, in FOL.Reification.GeneralReflection]
findUBNot [definition, in FOL.Reification.GeneralReflection]
findUBOr [definition, in FOL.Reification.GeneralReflection]
findUBRecursively [definition, in FOL.Reification.GeneralReflection]
findUBTrue [definition, in FOL.Reification.GeneralReflection]
findUnboundVariablesForm [definition, in FOL.Reification.GeneralReflection]
findUnboundVariablesTerm [definition, in FOL.Reification.GeneralReflection]
findVarsTerm [definition, in FOL.Reification.DemoPAExtensional]
FiniteSets [library]
Fintro [section, in FOL.Proofmode.ProofMode]
Fintro.p [variable, in FOL.Proofmode.ProofMode]
fin_to_n_bound [lemma, in FOL.Incompleteness.epf_mu]
fin_to_n [definition, in FOL.Incompleteness.epf_mu]
fin_disj_subst [lemma, in FOL.Incompleteness.qdec]
fin_conj [definition, in FOL.Incompleteness.qdec]
fin_disj [definition, in FOL.Incompleteness.qdec]
FixSignature [section, in FOL.Incompleteness.Axiomatisations]
FixSignature.Axiomatisations [section, in FOL.Incompleteness.Axiomatisations]
FixSignature.Axiomatisations.enum_T [variable, in FOL.Incompleteness.Axiomatisations]
FixSignature.Axiomatisations.T [variable, in FOL.Incompleteness.Axiomatisations]
FixSignature.Reduction [section, in FOL.Incompleteness.Axiomatisations]
FixSignature.Reduction.f [variable, in FOL.Incompleteness.Axiomatisations]
FixSignature.Reduction.hyp1 [variable, in FOL.Incompleteness.Axiomatisations]
FixSignature.Reduction.hyp2 [variable, in FOL.Incompleteness.Axiomatisations]
FixSignature.Reduction.hyp3 [variable, in FOL.Incompleteness.Axiomatisations]
FixSignature.Reduction.P [variable, in FOL.Incompleteness.Axiomatisations]
FixSignature.Reduction.standard [variable, in FOL.Incompleteness.Axiomatisations]
FixSignature.Reduction.T [variable, in FOL.Incompleteness.Axiomatisations]
FixSignature.Reduction.X [variable, in FOL.Incompleteness.Axiomatisations]
flatten_monad [definition, in FOL.Reification.GeneralReflection]
focus_el [lemma, in FOL.Deduction.FullSequentFacts]
fol [section, in FOL.Incompleteness.fol_incompleteness]
fol [section, in FOL.Incompleteness.epf_mu]
fol_incomplete_strong_repr [lemma, in FOL.Incompleteness.fol_incompleteness]
fol_undecidable_strong_repr [lemma, in FOL.Incompleteness.fol_incompleteness]
fol_fs [definition, in FOL.Incompleteness.fol_incompleteness]
fol_fs.p [variable, in FOL.Incompleteness.fol_incompleteness]
fol_fs [section, in FOL.Incompleteness.fol_incompleteness]
fol_utils [library]
fol_incompleteness [library]
fol.dprm [section, in FOL.Incompleteness.epf_mu]
fol.dprm.P [variable, in FOL.Incompleteness.epf_mu]
fol.incomplete_strong_repr.Hrepr [variable, in FOL.Incompleteness.fol_incompleteness]
fol.incomplete_strong_repr.r [variable, in FOL.Incompleteness.fol_incompleteness]
fol.incomplete_strong_repr.T'enum [variable, in FOL.Incompleteness.fol_incompleteness]
fol.incomplete_strong_repr.T'_T [variable, in FOL.Incompleteness.fol_incompleteness]
fol.incomplete_strong_repr.T' [variable, in FOL.Incompleteness.fol_incompleteness]
fol.incomplete_strong_repr.Tconsis [variable, in FOL.Incompleteness.fol_incompleteness]
fol.incomplete_strong_repr.Tenum [variable, in FOL.Incompleteness.fol_incompleteness]
fol.incomplete_strong_repr.T [variable, in FOL.Incompleteness.fol_incompleteness]
fol.incomplete_strong_repr.theta_universal [variable, in FOL.Incompleteness.fol_incompleteness]
fol.incomplete_strong_repr.theta [variable, in FOL.Incompleteness.fol_incompleteness]
fol.incomplete_strong_repr.p [variable, in FOL.Incompleteness.fol_incompleteness]
fol.incomplete_strong_repr [section, in FOL.Incompleteness.fol_incompleteness]
fol.Q_incomplete.Tconsis [variable, in FOL.Incompleteness.fol_incompleteness]
fol.Q_incomplete.Tenum [variable, in FOL.Incompleteness.fol_incompleteness]
fol.Q_incomplete.T_Q [variable, in FOL.Incompleteness.fol_incompleteness]
fol.Q_incomplete.T [variable, in FOL.Incompleteness.fol_incompleteness]
fol.Q_incomplete.ctq [variable, in FOL.Incompleteness.fol_incompleteness]
fol.Q_incomplete.p [variable, in FOL.Incompleteness.fol_incompleteness]
fol.Q_incomplete [section, in FOL.Incompleteness.fol_incompleteness]
fol.Q_weakly_represents.Penum [variable, in FOL.Incompleteness.epf_mu]
fol.Q_weakly_represents.P [variable, in FOL.Incompleteness.epf_mu]
fol.Q_weakly_represents.mu_universal [variable, in FOL.Incompleteness.epf_mu]
fol.Q_weakly_represents [section, in FOL.Incompleteness.epf_mu]
forall_bound_iff [lemma, in FOL.Incompleteness.qdec]
forall_fin_disj_conj [lemma, in FOL.Incompleteness.qdec]
forall__neg_exists_neg [lemma, in FOL.Tennenbaum.SyntheticInType]
form [abbreviation, in FOL.Reification.GeneralReflection]
form [abbreviation, in FOL.Reification.GeneralReflection]
formal_systems [library]
formReifierReifyHelper [projection, in FOL.Reification.GeneralReflection]
formReifierVarHelper [projection, in FOL.Reification.GeneralReflection]
Formulas [library]
form_default_is_bounded [lemma, in FOL.Completeness.EnumerationUtils]
form_default_is_enum [lemma, in FOL.Completeness.EnumerationUtils]
form_enum_with_default [definition, in FOL.Completeness.EnumerationUtils]
form_list_bounded_is_enum [lemma, in FOL.Completeness.EnumerationUtils]
form_list_is_enum [lemma, in FOL.Completeness.EnumerationUtils]
form_list_enum_bounded [definition, in FOL.Completeness.EnumerationUtils]
form_list_enum [definition, in FOL.Completeness.EnumerationUtils]
form_enumerable [lemma, in FOL.Incompleteness.Axiomatisations]
form_discrete [lemma, in FOL.Incompleteness.Axiomatisations]
fprv [projection, in FOL.Incompleteness.formal_systems]
fprv [inductive, in FOL.Deduction.FullSequent]
fprv_sind [definition, in FOL.Deduction.FullSequent]
fprv_ind [definition, in FOL.Deduction.FullSequent]
FragmentSequent [library]
FragmentSequentFacts [library]
FragmentSyntax [library]
FrewriteEquiv [section, in FOL.Proofmode.ProofMode]
frewrite_equiv_switch_T [lemma, in FOL.Proofmode.ProofMode]
frewrite_equiv_quant_T [lemma, in FOL.Proofmode.ProofMode]
frewrite_equiv_bin_lr_T [lemma, in FOL.Proofmode.ProofMode]
frewrite_equiv_bin_r_T [lemma, in FOL.Proofmode.ProofMode]
frewrite_equiv_bin_l_T [lemma, in FOL.Proofmode.ProofMode]
frewrite_equiv_switch [lemma, in FOL.Proofmode.ProofMode]
frewrite_equiv_quant [lemma, in FOL.Proofmode.ProofMode]
frewrite_equiv_bin_lr [lemma, in FOL.Proofmode.ProofMode]
frewrite_equiv_bin_r [lemma, in FOL.Proofmode.ProofMode]
frewrite_equiv_bin_l [lemma, in FOL.Proofmode.ProofMode]
from_to_form [lemma, in FOL.Completeness.EnumerationUtils]
from_form [definition, in FOL.Completeness.EnumerationUtils]
Fr_pres [definition, in FOL.Incompleteness.PA_incompleteness]
Fr_embed [lemma, in FOL.Incompleteness.PA_incompleteness]
Fr_exists_eq [lemma, in FOL.Incompleteness.PA_incompleteness]
fs [projection, in FOL.Reification.GeneralReflection]
FS [record, in FOL.Incompleteness.formal_systems]
FUEL [definition, in FOL.Reification.GeneralReflection]
FullLogic [section, in FOL.Proofmode.DemoPA]
FullLogic.p [variable, in FOL.Proofmode.DemoPA]
_ == _ (hoas_scope) [notation, in FOL.Proofmode.DemoPA]
_ ⊗ _ (hoas_scope) [notation, in FOL.Proofmode.DemoPA]
_ ⊕ _ (hoas_scope) [notation, in FOL.Proofmode.DemoPA]
σ _ (hoas_scope) [notation, in FOL.Proofmode.DemoPA]
_ ≤ _ [notation, in FOL.Proofmode.DemoPA]
FullSequent [section, in FOL.Deduction.FullSequent]
FullSequent [library]
FullSequentFacts [library]
_ ⊢f _ [notation, in FOL.Deduction.FullSequent]
FullSyntax [library]
fun_ext_prop_ext [lemma, in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySemantic]
F_P [definition, in FOL.Completeness.KripkeCompleteness]
F_sup [projection, in FOL.Completeness.HeytingMacNeille]
F_inf [projection, in FOL.Completeness.HeytingMacNeille]
F_impl [projection, in FOL.Completeness.HeytingMacNeille]
F_join [projection, in FOL.Completeness.HeytingMacNeille]
F_meet [projection, in FOL.Completeness.HeytingMacNeille]
F_bot [projection, in FOL.Completeness.HeytingMacNeille]
F_mono [projection, in FOL.Completeness.HeytingMacNeille]
F_inj [projection, in FOL.Completeness.HeytingMacNeille]
f2t [definition, in FOL.Reification.GeneralReflection]
G
gaussian_sum [lemma, in FOL.Incompleteness.ctq]GDN [lemma, in FOL.Completeness.TarskiConstructions]
GDP [lemma, in FOL.Completeness.TarskiConstructions]
GenCons [section, in FOL.Completeness.TarskiConstructions]
GenCons.Explosion [section, in FOL.Completeness.TarskiConstructions]
GenCons.Explosion.e [variable, in FOL.Completeness.TarskiConstructions]
GenCons.Explosion.Hclosed [variable, in FOL.Completeness.TarskiConstructions]
GenCons.Explosion.He [variable, in FOL.Completeness.TarskiConstructions]
GenCons.Explosion.T [variable, in FOL.Completeness.TarskiConstructions]
GenCons.GBot [variable, in FOL.Completeness.TarskiConstructions]
GenCons.GBot_closed [variable, in FOL.Completeness.TarskiConstructions]
GenCons.Henkin [section, in FOL.Completeness.TarskiConstructions]
GenCons.Henkin.e [variable, in FOL.Completeness.TarskiConstructions]
GenCons.Henkin.Hbounded [variable, in FOL.Completeness.TarskiConstructions]
GenCons.Henkin.Hclosed [variable, in FOL.Completeness.TarskiConstructions]
GenCons.Henkin.He [variable, in FOL.Completeness.TarskiConstructions]
GenCons.Henkin.Hexp [variable, in FOL.Completeness.TarskiConstructions]
GenCons.Henkin.T [variable, in FOL.Completeness.TarskiConstructions]
GenCons.Omega [section, in FOL.Completeness.TarskiConstructions]
GenCons.Omega.e [variable, in FOL.Completeness.TarskiConstructions]
GenCons.Omega.He [variable, in FOL.Completeness.TarskiConstructions]
GenCons.Omega.Hexp [variable, in FOL.Completeness.TarskiConstructions]
GenCons.Omega.Hhenkin [variable, in FOL.Completeness.TarskiConstructions]
GenCons.Omega.T [variable, in FOL.Completeness.TarskiConstructions]
_ ∘ _ [notation, in FOL.Completeness.TarskiConstructions]
GenCons.Union [section, in FOL.Completeness.TarskiConstructions]
GenCons.Union.econsistent_f [variable, in FOL.Completeness.TarskiConstructions]
GenCons.Union.f [variable, in FOL.Completeness.TarskiConstructions]
GenCons.Union.f_le [variable, in FOL.Completeness.TarskiConstructions]
_ ⊢TG _ [notation, in FOL.Completeness.TarskiConstructions]
_ ⊢G _ [notation, in FOL.Completeness.TarskiConstructions]
¬' _ [notation, in FOL.Completeness.TarskiConstructions]
∃' _ [notation, in FOL.Completeness.TarskiConstructions]
⊥' [notation, in FOL.Completeness.TarskiConstructions]
GeneralReflection [library]
general_post_dec [lemma, in FOL.Incompleteness.utils]
general_post [lemma, in FOL.Incompleteness.utils]
Gentzen [section, in FOL.Deduction.FragmentSequent]
Gentzen [section, in FOL.Deduction.FragmentSequentFacts]
Gentzen.CutElimination [section, in FOL.Deduction.FragmentSequentFacts]
Gentzen.Enumerability [section, in FOL.Deduction.FragmentSequentFacts]
Gentzen.Enumerability.enum_Preds' [variable, in FOL.Deduction.FragmentSequentFacts]
Gentzen.Enumerability.enum_Funcs' [variable, in FOL.Deduction.FragmentSequentFacts]
Gentzen.Enumerability.eq_dec_Preds [variable, in FOL.Deduction.FragmentSequentFacts]
Gentzen.Enumerability.eq_dec_Funcs [variable, in FOL.Deduction.FragmentSequentFacts]
Gentzen.Enumerability.list_Preds [variable, in FOL.Deduction.FragmentSequentFacts]
Gentzen.Enumerability.list_Funcs [variable, in FOL.Deduction.FragmentSequentFacts]
Gentzen.Soundness [section, in FOL.Deduction.FragmentSequentFacts]
Gentzen.Weakening [section, in FOL.Deduction.FragmentSequentFacts]
_ ;; _ ⊢s _ [notation, in FOL.Deduction.FragmentSequent]
_ ⊢S _ [notation, in FOL.Deduction.FragmentSequent]
GExE [lemma, in FOL.Completeness.TarskiConstructions]
GExI [lemma, in FOL.Completeness.TarskiConstructions]
GExp [lemma, in FOL.Completeness.TarskiConstructions]
glb_calg_iff [lemma, in FOL.Completeness.HeytingCompleteness]
glb_Pr [definition, in FOL.Completeness.HeytingCompleteness]
glb_calg [instance, in FOL.Completeness.HeytingCompleteness]
glb_alg_iff [lemma, in FOL.Completeness.HeytingCompleteness]
glb_alg [instance, in FOL.Completeness.HeytingCompleteness]
glindenbaum_eqH [lemma, in FOL.Completeness.HeytingCompleteness]
glindenbaum_hsat [lemma, in FOL.Completeness.HeytingCompleteness]
GXM [lemma, in FOL.Completeness.TarskiConstructions]
H
H [projection, in FOL.Semantics.Heyting.Heyting]HA [projection, in FOL.Semantics.Heyting.Heyting]
halt_incompleteness [lemma, in FOL.Incompleteness.abstract_incompleteness]
halt_incompleteness' [lemma, in FOL.Incompleteness.abstract_incompleteness]
halt_undecidability [lemma, in FOL.Incompleteness.abstract_incompleteness]
HAProperty [section, in FOL.Semantics.Heyting.Heyting]
_ ≡ _ [notation, in FOL.Semantics.Heyting.Heyting]
HA_Insep_undec [lemma, in FOL.Tennenbaum.Variants]
HA_Insep [lemma, in FOL.Tennenbaum.Variants]
HA_insep [section, in FOL.Tennenbaum.HA_insep]
HA_insep [library]
hcompleteness [lemma, in FOL.Completeness.HeytingCompleteness]
helperFormReifierType [definition, in FOL.Reification.GeneralReflection]
helperFormVarsType [definition, in FOL.Reification.GeneralReflection]
helperTermReifierType [definition, in FOL.Reification.GeneralReflection]
helperTermVarsType [definition, in FOL.Reification.GeneralReflection]
Henkin [definition, in FOL.Completeness.TarskiConstructions]
henkin [definition, in FOL.Completeness.TarskiConstructions]
Henkin_T [lemma, in FOL.Completeness.TarskiConstructions]
Henkin_is_Henkin [lemma, in FOL.Completeness.TarskiConstructions]
Henkin_consistent [lemma, in FOL.Completeness.TarskiConstructions]
henkin_le [lemma, in FOL.Completeness.TarskiConstructions]
henkin_bounded [lemma, in FOL.Completeness.TarskiConstructions]
henkin_axiom_bounded [lemma, in FOL.Completeness.TarskiConstructions]
henkin_axiom [definition, in FOL.Completeness.TarskiConstructions]
Heyting [library]
HeytingAlgebra [record, in FOL.Semantics.Heyting.Heyting]
HeytingCompleteness [library]
HeytingMacNeille [library]
HeytingMorphism [record, in FOL.Completeness.HeytingMacNeille]
HiddenTerm [definition, in FOL.Reification.GeneralReflection]
Hoas [library]
Homomorphism [section, in FOL.Tennenbaum.NumberUtils]
Homomorphism.m [variable, in FOL.Tennenbaum.NumberUtils]
D _ [notation, in FOL.Tennenbaum.NumberUtils]
M _ [notation, in FOL.Tennenbaum.NumberUtils]
hom_agree_inu [lemma, in FOL.Tennenbaum.Peano]
hsat [definition, in FOL.Semantics.Heyting.Heyting]
hsat_L [definition, in FOL.Semantics.Heyting.Heyting]
hset [definition, in FOL.Completeness.HeytingMacNeille]
hset_inf1 [lemma, in FOL.Completeness.HeytingMacNeille]
hset_impl1 [lemma, in FOL.Completeness.HeytingMacNeille]
hset_join1 [lemma, in FOL.Completeness.HeytingMacNeille]
hset_meet1 [lemma, in FOL.Completeness.HeytingMacNeille]
hset_bot1 [lemma, in FOL.Completeness.HeytingMacNeille]
hset_impl_normal [lemma, in FOL.Completeness.HeytingMacNeille]
hset_impl_equiv [lemma, in FOL.Completeness.HeytingMacNeille]
hset_impl_proper [instance, in FOL.Completeness.HeytingMacNeille]
hset_impl [definition, in FOL.Completeness.HeytingMacNeille]
hset_inf_normal [lemma, in FOL.Completeness.HeytingMacNeille]
hset_inf [definition, in FOL.Completeness.HeytingMacNeille]
hset_join_normal [lemma, in FOL.Completeness.HeytingMacNeille]
hset_join_proper [instance, in FOL.Completeness.HeytingMacNeille]
hset_join [definition, in FOL.Completeness.HeytingMacNeille]
hset_meet_normal [lemma, in FOL.Completeness.HeytingMacNeille]
hset_meet_proper [instance, in FOL.Completeness.HeytingMacNeille]
hset_meet [definition, in FOL.Completeness.HeytingMacNeille]
hset_bot_normal [lemma, in FOL.Completeness.HeytingMacNeille]
hset_bot [definition, in FOL.Completeness.HeytingMacNeille]
hset_sub_proper [instance, in FOL.Completeness.HeytingMacNeille]
hset_elem_proper [instance, in FOL.Completeness.HeytingMacNeille]
hset_equiv_equiv [instance, in FOL.Completeness.HeytingMacNeille]
hset_equiv [definition, in FOL.Completeness.HeytingMacNeille]
hset_sub [definition, in FOL.Completeness.HeytingMacNeille]
hset_elem [definition, in FOL.Completeness.HeytingMacNeille]
hvalid [definition, in FOL.Completeness.HeytingCompleteness]
H10p_to_class_Q [lemma, in FOL.Incompleteness.PA_incompleteness]
I
I [projection, in FOL.Reification.GeneralReflection]Ident [constructor, in FOL.Proofmode.ProofMode]
ident_name_sind [definition, in FOL.Proofmode.ProofMode]
ident_name_rec [definition, in FOL.Proofmode.ProofMode]
ident_name_ind [definition, in FOL.Proofmode.ProofMode]
ident_name_rect [definition, in FOL.Proofmode.ProofMode]
ident_name [inductive, in FOL.Proofmode.ProofMode]
IE [projection, in FOL.Proofmode.ProofMode]
ieq_congr_add [lemma, in FOL.Reification.DemoPA]
ieq_congr_succ [lemma, in FOL.Reification.DemoPA]
ieq_trans [lemma, in FOL.Reification.DemoPA]
ieq_sym [lemma, in FOL.Reification.DemoPA]
ieq_refl [lemma, in FOL.Reification.DemoPA]
iEuclid [lemma, in FOL.Tennenbaum.Peano]
iEuclid' [lemma, in FOL.Tennenbaum.Peano]
iFac_unique [lemma, in FOL.Tennenbaum.Peano]
iFac_unique1 [lemma, in FOL.Tennenbaum.Peano]
iffT [definition, in FOL.Tennenbaum.NumberUtils]
iffT [definition, in FOL.Tennenbaum.SyntheticInType]
iff_iff [lemma, in FOL.Incompleteness.weak_strong]
II [projection, in FOL.Proofmode.ProofMode]
IL [constructor, in FOL.Deduction.FragmentSequent]
IL [constructor, in FOL.Deduction.FullSequent]
Impl [projection, in FOL.Semantics.Heyting.Heyting]
implication_neg_swap [lemma, in FOL.Tennenbaum.HA_insep]
Impl1 [projection, in FOL.Semantics.Heyting.Heyting]
Imp_bot [lemma, in FOL.Semantics.Heyting.Heyting]
Imp2 [lemma, in FOL.Semantics.Heyting.Heyting]
inclusionΣinΣ1andΠinΠi_syn [lemma, in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySyntactic]
incl_rem2 [lemma, in FOL.Proofmode.Theories]
incl_rem1 [lemma, in FOL.Proofmode.Theories]
incompleteness [lemma, in FOL.Incompleteness.Abstract]
incompleteness_Q [lemma, in FOL.Incompleteness.PA_incompleteness]
incompleteness_ZF [lemma, in FOL.Incompleteness.Axiomatisations]
incompleteness_PA [lemma, in FOL.Incompleteness.Axiomatisations]
inconsistent [lemma, in FOL.Completeness.Consistency]
IndependenceOfGeneralPremises [definition, in FOL.Utils.PrenexNormalForm]
independent [definition, in FOL.Incompleteness.formal_systems]
induction [lemma, in FOL.Tennenbaum.Peano]
induction1 [lemma, in FOL.Tennenbaum.Peano]
induction2 [lemma, in FOL.Tennenbaum.Peano]
Inf [projection, in FOL.Semantics.Heyting.Heyting]
infty_irred [lemma, in FOL.Tennenbaum.NumberUtils]
Inf_indexed1 [lemma, in FOL.Semantics.Heyting.Heyting]
Inf_indexed [definition, in FOL.Semantics.Heyting.Heyting]
Inf1 [projection, in FOL.Semantics.Heyting.Heyting]
Inf2 [lemma, in FOL.Semantics.Heyting.Heyting]
inj [definition, in FOL.Tennenbaum.CantorPairing]
inj [definition, in FOL.Tennenbaum.SyntheticInType]
inj_decode [lemma, in FOL.Tennenbaum.CantorPairing]
inj_next [lemma, in FOL.Tennenbaum.CantorPairing]
inj_Irred [lemma, in FOL.Tennenbaum.NumberUtils]
input_fragment [definition, in FOL.Completeness.TarskiCompleteness]
input_bot [definition, in FOL.Completeness.TarskiCompleteness]
Insep_form [definition, in FOL.Tennenbaum.Tennenbaum_insep]
Insep_pred [definition, in FOL.Tennenbaum.Tennenbaum_insep]
insep_essential_undecidability [lemma, in FOL.Incompleteness.abstract_incompleteness]
insep_essential_incompleteness [lemma, in FOL.Incompleteness.abstract_incompleteness]
insep_incompleteness [lemma, in FOL.Incompleteness.abstract_incompleteness]
insep_undecidability [lemma, in FOL.Incompleteness.abstract_incompleteness]
Instantiation [section, in FOL.Incompleteness.Abstract]
interp_nat [instance, in FOL.Tennenbaum.Peano]
interp_nat_noeq [definition, in FOL.Tennenbaum.Peano]
interp_nat [definition, in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySyntactic]
IntroPattern [section, in FOL.Proofmode.ProofMode]
intro_or_destruct_T [lemma, in FOL.Proofmode.ProofMode]
intro_and_destruct_T [lemma, in FOL.Proofmode.ProofMode]
intro_or_destruct [lemma, in FOL.Proofmode.ProofMode]
intro_and_destruct [lemma, in FOL.Proofmode.ProofMode]
intro_pattern_sind [definition, in FOL.Proofmode.ProofMode]
intro_pattern_rec [definition, in FOL.Proofmode.ProofMode]
intro_pattern_ind [definition, in FOL.Proofmode.ProofMode]
intro_pattern_rect [definition, in FOL.Proofmode.ProofMode]
intro_pattern [inductive, in FOL.Proofmode.ProofMode]
int_notEx_Allnot [lemma, in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySemantic]
inu [definition, in FOL.Tennenbaum.Peano]
inu [abbreviation, in FOL.Tennenbaum.Coding]
inum [definition, in FOL.Reification.DemoPAExtensional]
inu_I [lemma, in FOL.Tennenbaum.Peano]
inu_nat_id [lemma, in FOL.Tennenbaum.Peano]
inu_mult_hom [lemma, in FOL.Tennenbaum.Peano]
inu_add_hom [lemma, in FOL.Tennenbaum.Peano]
inu_inj [lemma, in FOL.Tennenbaum.Peano]
inv [definition, in FOL.Tennenbaum.CantorPairing]
invariant_subst_list [lemma, in FOL.Tennenbaum.Variants]
inv_cd [lemma, in FOL.Tennenbaum.CantorPairing]
inv_dc [lemma, in FOL.Tennenbaum.CantorPairing]
inv_std_mult [lemma, in FOL.Tennenbaum.Coding]
inv_std_mult_right [lemma, in FOL.Tennenbaum.Coding]
inv_std_add [lemma, in FOL.Tennenbaum.Coding]
in_theory [definition, in FOL.Proofmode.Theories]
in_theory [definition, in FOL.Tennenbaum.Peano]
In_T_closed [projection, in FOL.Completeness.TarskiConstructions]
In_T [projection, in FOL.Completeness.TarskiConstructions]
IR [constructor, in FOL.Deduction.FragmentSequent]
IR [constructor, in FOL.Deduction.FullSequent]
Irred [definition, in FOL.Tennenbaum.NumberUtils]
irred [definition, in FOL.Tennenbaum.NumberUtils]
irred_Irred [lemma, in FOL.Tennenbaum.NumberUtils]
irred_integral_domain [lemma, in FOL.Tennenbaum.NumberUtils]
irred_Mod_eq [lemma, in FOL.Tennenbaum.NumberUtils]
irred_factor [lemma, in FOL.Tennenbaum.NumberUtils]
irred_bounded [lemma, in FOL.Tennenbaum.NumberUtils]
irred' [definition, in FOL.Tennenbaum.NumberUtils]
isD [projection, in FOL.Reification.GeneralReflection]
isIn [definition, in FOL.Reification.GeneralReflection]
isPNF_bool [definition, in FOL.Utils.PrenexNormalForm]
is_sup [abbreviation, in FOL.Semantics.Heyting.Heyting]
is_inf [abbreviation, in FOL.Semantics.Heyting.Heyting]
is_provable [lemma, in FOL.Incompleteness.formal_systems]
is_universal [definition, in FOL.Incompleteness.epf]
is_Henkin_inherit [lemma, in FOL.Completeness.TarskiConstructions]
is_Henkin [definition, in FOL.Completeness.TarskiConstructions]
isΔform [definition, in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySyntactic]
isΔf_ind [definition, in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySyntactic]
isΔsyn [definition, in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySyntactic]
isΠall [constructor, in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySyntactic]
isΠex [constructor, in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySyntactic]
isΠform [definition, in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySyntactic]
isΠf_ind_isΣf_ind_ind [definition, in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySyntactic]
isΠf_ind_sind [definition, in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySyntactic]
isΠf_ind_ind [definition, in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySyntactic]
isΠf_ind [inductive, in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySyntactic]
isΠinΠpLsyn [lemma, in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySyntactic]
isΠinΠ1 [lemma, in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySyntactic]
isΠnoQuant [constructor, in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySyntactic]
isΠsem [inductive, in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySemantic]
isΠsemA [lemma, in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySemantic]
isΠsemS [constructor, in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySemantic]
isΠsemTwoAll [lemma, in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySemantic]
isΠsem_isΣsem_ind [definition, in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySemantic]
isΠsem_sind [definition, in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySemantic]
isΠsem_ind [definition, in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySemantic]
isΠsem0 [constructor, in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySemantic]
isΠsyn [definition, in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySyntactic]
isΣall [constructor, in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySyntactic]
isΣex [constructor, in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySyntactic]
isΣform [definition, in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySyntactic]
isΣf_ind_isΠf_ind_ind [definition, in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySyntactic]
isΣf_ind_sind [definition, in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySyntactic]
isΣf_ind_ind [definition, in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySyntactic]
isΣf_ind [inductive, in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySyntactic]
isΣinΣpLsyn [lemma, in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySyntactic]
isΣinΣ1 [lemma, in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySyntactic]
isΣnoQuant [constructor, in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySyntactic]
isΣnsyn_in_isΣsem [lemma, in FOL.ArithmeticalHierarchy.ArithmeticalHierarchyEquiv]
isΣsem [inductive, in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySemantic]
isΣsemE [lemma, in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySemantic]
isΣsemListΣ [lemma, in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySemantic]
isΣsemS [constructor, in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySemantic]
isΣsemTwoEx [lemma, in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySemantic]
isΣsem_in_isΣsyn [lemma, in FOL.ArithmeticalHierarchy.ArithmeticalHierarchyEquiv]
isΣsem_and_closed [lemma, in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySemantic]
isΣsem_m_red_closed [lemma, in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySemantic]
isΣsem_isΠsem_ind [definition, in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySemantic]
isΣsem_sind [definition, in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySemantic]
isΣsem_ind [definition, in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySemantic]
isΣsem0 [constructor, in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySemantic]
isΣsyn [definition, in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySyntactic]
isΣΠball [lemma, in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySemantic]
isΣΠf_iff_PNF [lemma, in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySyntactic]
isΣΠf_PNF [lemma, in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySyntactic]
isΣΠn_In_ΠΣSn [lemma, in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySemantic]
isΣΠn_In_ΣΠSn [lemma, in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySemantic]
isΣΠsem0 [lemma, in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySemantic]
iter_add_S [lemma, in FOL.Utils.PrenexNormalForm]
I' [definition, in FOL.Tennenbaum.Variants]
I' [definition, in FOL.Tennenbaum.Tennenbaum_insep]
I' [definition, in FOL.Tennenbaum.Peano]
I' [definition, in FOL.Tennenbaum.Coding]
I'' [definition, in FOL.Tennenbaum.Peano]
iμ_standard [lemma, in FOL.Incompleteness.fol_utils]
J
Join [projection, in FOL.Semantics.Heyting.Heyting]join [definition, in FOL.Tennenbaum.Peano]
Join_com [lemma, in FOL.Semantics.Heyting.Heyting]
Join1 [projection, in FOL.Semantics.Heyting.Heyting]
Join2 [lemma, in FOL.Semantics.Heyting.Heyting]
Join3 [lemma, in FOL.Semantics.Heyting.Heyting]
K
kcompleteness_implies_LEM [lemma, in FOL.Completeness.KripkeCompleteness]kcompleteness_arbitrary [definition, in FOL.Completeness.KripkeCompleteness]
kcompleteness_enum_implies_MP [lemma, in FOL.Completeness.KripkeCompleteness]
kcompleteness_enumerable [definition, in FOL.Completeness.KripkeCompleteness]
kcompleteness_implies_stability [lemma, in FOL.Completeness.KripkeCompleteness]
KripkeCompleteness [section, in FOL.Completeness.KripkeCompleteness]
KripkeCompleteness [library]
KripkeCompleteness.BottomlessCompleteness [section, in FOL.Completeness.KripkeCompleteness]
KripkeCompleteness.Contexts [section, in FOL.Completeness.KripkeCompleteness]
_ ⊩⊥( _ , _ ) _ [notation, in FOL.Completeness.KripkeCompleteness]
KripkeCompleteness.ExplodingCompleteness [section, in FOL.Completeness.KripkeCompleteness]
KripkeCompleteness.LEM_Equivalence [section, in FOL.Completeness.KripkeCompleteness]
KripkeCompleteness.MP_Equivalence [section, in FOL.Completeness.KripkeCompleteness]
KripkeCompleteness.Stability [section, in FOL.Completeness.KripkeCompleteness]
KripkeCompleteness.StandardCompleteness [section, in FOL.Completeness.KripkeCompleteness]
_ ;; _ ⊢sC _ [notation, in FOL.Completeness.KripkeCompleteness]
_ ⊢SC _ [notation, in FOL.Completeness.KripkeCompleteness]
_ <<=C _ [notation, in FOL.Completeness.KripkeCompleteness]
ksoundness_seq [lemma, in FOL.Deduction.FragmentSequentFacts]
K_completeness [definition, in FOL.Completeness.KripkeCompleteness]
K_std_seq_ksoundness [lemma, in FOL.Completeness.KripkeCompleteness]
K_std_completeness [lemma, in FOL.Completeness.KripkeCompleteness]
K_std_ksat [lemma, in FOL.Completeness.KripkeCompleteness]
K_std_sprv' [lemma, in FOL.Completeness.KripkeCompleteness]
K_std_sprv [lemma, in FOL.Completeness.KripkeCompleteness]
K_std_correct [lemma, in FOL.Completeness.KripkeCompleteness]
K_std [instance, in FOL.Completeness.KripkeCompleteness]
K_bottomless_completeness [lemma, in FOL.Completeness.KripkeCompleteness]
K_exp_seq_ksoundness [lemma, in FOL.Completeness.KripkeCompleteness]
K_exp_ksoundness [lemma, in FOL.Completeness.KripkeCompleteness]
K_exp_completeness [lemma, in FOL.Completeness.KripkeCompleteness]
K_ctx_exploding [lemma, in FOL.Completeness.KripkeCompleteness]
K_ctx_ksat [lemma, in FOL.Completeness.KripkeCompleteness]
K_ctx_subst [lemma, in FOL.Completeness.KripkeCompleteness]
K_ctx_sprv [lemma, in FOL.Completeness.KripkeCompleteness]
K_ctx_correct [lemma, in FOL.Completeness.KripkeCompleteness]
K_ctx_ksat_exp [lemma, in FOL.Completeness.KripkeCompleteness]
K_ctx_constraint_exp [lemma, in FOL.Completeness.KripkeCompleteness]
K_ctx_subst_exp [lemma, in FOL.Completeness.KripkeCompleteness]
K_ctx_sprv_exp [lemma, in FOL.Completeness.KripkeCompleteness]
K_ctx_correct_exp [lemma, in FOL.Completeness.KripkeCompleteness]
K_ctx [instance, in FOL.Completeness.KripkeCompleteness]
L
large [lemma, in FOL.Reification.DemoPA]lb [definition, in FOL.Completeness.HeytingMacNeille]
lb_calg_iff [lemma, in FOL.Completeness.HeytingCompleteness]
lb_Pr [definition, in FOL.Completeness.HeytingCompleteness]
lb_calg [instance, in FOL.Completeness.HeytingCompleteness]
lb_alg_iff [lemma, in FOL.Completeness.HeytingCompleteness]
lb_alg [instance, in FOL.Completeness.HeytingCompleteness]
lb_normal [lemma, in FOL.Completeness.HeytingMacNeille]
lb_proper [instance, in FOL.Completeness.HeytingMacNeille]
ldec [abbreviation, in FOL.Completeness.TarskiCompleteness]
ldecidable [definition, in FOL.Utils.MPFacts]
ldecidable [definition, in FOL.Incompleteness.Abstract]
ldec_bounded [lemma, in FOL.Completeness.TarskiCompleteness]
ldec_forall [lemma, in FOL.Completeness.TarskiCompleteness]
leibniz [lemma, in FOL.Proofmode.ProofMode]
Leibniz [record, in FOL.Proofmode.ProofMode]
leibniz_term [lemma, in FOL.Proofmode.ProofMode]
LEM [definition, in FOL.Incompleteness.Axiomatisations]
LEM [definition, in FOL.Completeness.KripkeCompleteness]
LEM [definition, in FOL.Tennenbaum.SyntheticInType]
LEM [definition, in FOL.Completeness.TarskiCompleteness]
lemmas [section, in FOL.Incompleteness.fol_utils]
LEM_DNE [lemma, in FOL.Tennenbaum.SyntheticInType]
LEM_is_arbitrary_completeness [lemma, in FOL.Completeness.TarskiCompleteness]
leq [definition, in FOL.Proofmode.DemoPA]
lessthen_num [lemma, in FOL.Tennenbaum.Peano]
le_swap_fin_disj [lemma, in FOL.Incompleteness.qdec]
le_fin_disj [lemma, in FOL.Incompleteness.qdec]
le_le_trans [lemma, in FOL.Tennenbaum.Peano]
Lindenbaum [section, in FOL.Completeness.HeytingCompleteness]
lindenbaum_eqH [lemma, in FOL.Completeness.HeytingCompleteness]
lindenbaum_hsat [lemma, in FOL.Completeness.HeytingCompleteness]
Lindenbaum.Completeness [section, in FOL.Completeness.HeytingCompleteness]
Lindenbaum.Completeness [section, in FOL.Completeness.HeytingCompleteness]
Lindenbaum.Completeness.gAllE [variable, in FOL.Completeness.HeytingCompleteness]
Lindenbaum.Completeness.gAllI [variable, in FOL.Completeness.HeytingCompleteness]
Lindenbaum.Completeness.gCE1 [variable, in FOL.Completeness.HeytingCompleteness]
Lindenbaum.Completeness.gCE2 [variable, in FOL.Completeness.HeytingCompleteness]
Lindenbaum.Completeness.gCI [variable, in FOL.Completeness.HeytingCompleteness]
Lindenbaum.Completeness.gCtx [variable, in FOL.Completeness.HeytingCompleteness]
Lindenbaum.Completeness.gDE [variable, in FOL.Completeness.HeytingCompleteness]
Lindenbaum.Completeness.gDI1 [variable, in FOL.Completeness.HeytingCompleteness]
Lindenbaum.Completeness.gDI2 [variable, in FOL.Completeness.HeytingCompleteness]
Lindenbaum.Completeness.gExE [variable, in FOL.Completeness.HeytingCompleteness]
Lindenbaum.Completeness.gExI [variable, in FOL.Completeness.HeytingCompleteness]
Lindenbaum.Completeness.gExp [variable, in FOL.Completeness.HeytingCompleteness]
Lindenbaum.Completeness.gIE [variable, in FOL.Completeness.HeytingCompleteness]
Lindenbaum.Completeness.gII [variable, in FOL.Completeness.HeytingCompleteness]
Lindenbaum.Completeness.gnameless_equiv_ex' [variable, in FOL.Completeness.HeytingCompleteness]
Lindenbaum.Completeness.gnameless_equiv_all' [variable, in FOL.Completeness.HeytingCompleteness]
Lindenbaum.Completeness.gprv [variable, in FOL.Completeness.HeytingCompleteness]
Lindenbaum.Completeness.gWeak [variable, in FOL.Completeness.HeytingCompleteness]
_ ⊢ _ [notation, in FOL.Completeness.HeytingCompleteness]
_ ⊢E _ [notation, in FOL.Completeness.HeytingCompleteness]
list_noQuant_PNF [lemma, in FOL.Utils.PrenexNormalForm]
list_enum_to_enum [definition, in FOL.Completeness.EnumerationUtils]
list_theory [definition, in FOL.Incompleteness.Axiomatisations]
list_quantop [definition, in FOL.Deduction.FragmentSequentFacts]
list_binop [definition, in FOL.Deduction.FragmentSequentFacts]
list_theory_enumerable [lemma, in FOL.Incompleteness.fol_utils]
lowerRelIndex [definition, in FOL.Reification.GeneralReflection]
lt_le_trans [lemma, in FOL.Tennenbaum.Peano]
lt_S [lemma, in FOL.Tennenbaum.Peano]
lt_le_equiv1 [lemma, in FOL.Tennenbaum.Peano]
lt_neq [lemma, in FOL.Tennenbaum.Peano]
lt_SS [lemma, in FOL.Tennenbaum.Peano]
lt_nat_equiv [lemma, in FOL.Tennenbaum.NumberUtils]
lt_rect [lemma, in FOL.Tennenbaum.NumberUtils]
lt_equiv [lemma, in FOL.Tennenbaum.Coding]
lu_idem [lemma, in FOL.Completeness.HeytingMacNeille]
lu_sub [lemma, in FOL.Completeness.HeytingMacNeille]
L_tseq [definition, in FOL.Deduction.FragmentSequentFacts]
L_seq [definition, in FOL.Deduction.FragmentSequentFacts]
M
MacNeille [section, in FOL.Completeness.HeytingMacNeille]_ ≡ _ [notation, in FOL.Completeness.HeytingMacNeille]
_ ⊆ _ [notation, in FOL.Completeness.HeytingMacNeille]
_ ∈ _ [notation, in FOL.Completeness.HeytingMacNeille]
MainReificationFunctions [section, in FOL.Reification.GeneralReflection]
Makholm [lemma, in FOL.Tennenbaum.Variants]
mAnd [definition, in FOL.Reification.GeneralReflection]
mapT [definition, in FOL.Proofmode.Theories]
mapT_step [lemma, in FOL.Proofmode.ProofMode]
map_def_fail [definition, in FOL.Reification.GeneralReflection]
map_branch_fail [definition, in FOL.Reification.GeneralReflection]
map_predicate_fail [definition, in FOL.Reification.GeneralReflection]
map_monad [definition, in FOL.Reification.GeneralReflection]
map_shift_up_down_eq [lemma, in FOL.Proofmode.Theories]
map_shift_up_down_contains [lemma, in FOL.Proofmode.Theories]
map_subst [lemma, in FOL.Semantics.Heyting.Soundness]
Markov [definition, in FOL.Tennenbaum.SyntheticInType]
Markov [definition, in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySemantic]
Markov_Forster [lemma, in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySemantic]
matchBaseLogicConn [definition, in FOL.Reification.GeneralReflection]
maximal [definition, in FOL.Completeness.TarskiConstructions]
maximal_prv [lemma, in FOL.Completeness.TarskiConstructions]
maximal_Omega [lemma, in FOL.Completeness.TarskiConstructions]
maybeD [definition, in FOL.Reification.GeneralReflection]
McCarty [lemma, in FOL.Tennenbaum.Variants]
Meet [projection, in FOL.Semantics.Heyting.Heyting]
meet_sup_expansion [lemma, in FOL.Semantics.Heyting.Heyting]
meet_sup_distr [lemma, in FOL.Semantics.Heyting.Heyting]
meet_join_expansion [lemma, in FOL.Semantics.Heyting.Heyting]
meet_join_distr [lemma, in FOL.Semantics.Heyting.Heyting]
Meet_extend [lemma, in FOL.Semantics.Heyting.Heyting]
Meet_assoc [lemma, in FOL.Semantics.Heyting.Heyting]
Meet_left [lemma, in FOL.Semantics.Heyting.Heyting]
Meet_com [lemma, in FOL.Semantics.Heyting.Heyting]
Meet_hsat_L [lemma, in FOL.Semantics.Heyting.Soundness]
Meet1 [projection, in FOL.Semantics.Heyting.Heyting]
Meet2 [lemma, in FOL.Semantics.Heyting.Heyting]
Meet3 [lemma, in FOL.Semantics.Heyting.Heyting]
mergeAnd [definition, in FOL.Reification.GeneralReflection]
mergeEqProp [definition, in FOL.Reification.DemoPAExtensional]
mergeExists [definition, in FOL.Reification.GeneralReflection]
mergeFalse [definition, in FOL.Reification.GeneralReflection]
mergeForall [definition, in FOL.Reification.GeneralReflection]
mergeForm [definition, in FOL.Reification.GeneralReflection]
mergeFormBase [definition, in FOL.Reification.GeneralReflection]
mergeFormProto [definition, in FOL.Reification.GeneralReflection]
mergeFormProtoType [definition, in FOL.Reification.GeneralReflection]
mergeIff [definition, in FOL.Reification.GeneralReflection]
mergeImpl [definition, in FOL.Reification.GeneralReflection]
mergeNot [definition, in FOL.Reification.GeneralReflection]
mergeNum [definition, in FOL.Reification.DemoPAExtensional]
mergeOr [definition, in FOL.Reification.GeneralReflection]
mergeTerm [definition, in FOL.Reification.GeneralReflection]
mergeTermBase [definition, in FOL.Reification.GeneralReflection]
mergeTermProto [definition, in FOL.Reification.GeneralReflection]
mergeTermProtoType [definition, in FOL.Reification.GeneralReflection]
mergeTrue [definition, in FOL.Reification.GeneralReflection]
MetaCoqUtils [section, in FOL.Reification.GeneralReflection]
mExists [definition, in FOL.Reification.GeneralReflection]
mFalse [definition, in FOL.Reification.GeneralReflection]
mForall [definition, in FOL.Reification.GeneralReflection]
mIff [definition, in FOL.Reification.GeneralReflection]
mImpl [definition, in FOL.Reification.GeneralReflection]
MinZF [section, in FOL.Proofmode.DemoMinZF]
MinZF_Leibniz [instance, in FOL.Proofmode.DemoMinZF]
MinZF.p [variable, in FOL.Proofmode.DemoMinZF]
minZ' [definition, in FOL.Incompleteness.Axiomatisations]
mNot [definition, in FOL.Reification.GeneralReflection]
Mod [definition, in FOL.Tennenbaum.NumberUtils]
Model [section, in FOL.Tennenbaum.Variants]
Model [section, in FOL.Tennenbaum.Tennenbaum_insep]
Model [section, in FOL.Tennenbaum.Tennenbaum_diagonal]
Model [section, in FOL.Tennenbaum.Coding]
Models [section, in FOL.Tennenbaum.Peano]
Models.D [variable, in FOL.Tennenbaum.Peano]
Models.I [variable, in FOL.Tennenbaum.Peano]
Models.PA_Model.Euclid [section, in FOL.Tennenbaum.Peano]
_ i≤ _ [notation, in FOL.Tennenbaum.Peano]
Models.PA_Model.Induction.pred [variable, in FOL.Tennenbaum.Peano]
Models.PA_Model.Induction.phi [variable, in FOL.Tennenbaum.Peano]
_ [[ _ ]] [notation, in FOL.Tennenbaum.Peano]
Models.PA_Model.Induction [section, in FOL.Tennenbaum.Peano]
Models.PA_Model [section, in FOL.Tennenbaum.Peano]
i0 (PA_Notation) [notation, in FOL.Tennenbaum.Peano]
_ ⊏ _ [notation, in FOL.Tennenbaum.Peano]
_ ∈ _ [notation, in FOL.Tennenbaum.Peano]
_ i⧀ _ [notation, in FOL.Tennenbaum.Peano]
_ i⊗ _ [notation, in FOL.Tennenbaum.Peano]
_ i⊕ _ [notation, in FOL.Tennenbaum.Peano]
_ i= _ [notation, in FOL.Tennenbaum.Peano]
iσ _ [notation, in FOL.Tennenbaum.Peano]
⊨ _ [notation, in FOL.Tennenbaum.Peano]
model_bot [instance, in FOL.Completeness.KripkeCompleteness]
model_fragment_classical [lemma, in FOL.Completeness.TarskiCompleteness]
model_fragment_correct [lemma, in FOL.Completeness.TarskiCompleteness]
model_fragment [instance, in FOL.Completeness.TarskiCompleteness]
model_bot_exploding [lemma, in FOL.Completeness.TarskiCompleteness]
model_expl_correct [lemma, in FOL.Completeness.TarskiCompleteness]
model_bot_classical [lemma, in FOL.Completeness.TarskiCompleteness]
model_bot_correct [lemma, in FOL.Completeness.TarskiCompleteness]
model_bot [instance, in FOL.Completeness.TarskiCompleteness]
Model.axioms [variable, in FOL.Tennenbaum.Tennenbaum_insep]
Model.axioms [variable, in FOL.Tennenbaum.Tennenbaum_diagonal]
Model.axioms [variable, in FOL.Tennenbaum.Coding]
Model.Coding [section, in FOL.Tennenbaum.Coding]
Model.Coding.Hψ [variable, in FOL.Tennenbaum.Coding]
Model.Coding.notStd [section, in FOL.Tennenbaum.Coding]
Model.Coding.notStd.notStd [variable, in FOL.Tennenbaum.Coding]
Model.Coding.notStd.stable_std [variable, in FOL.Tennenbaum.Coding]
Model.Coding.ψ [variable, in FOL.Tennenbaum.Coding]
Model.D [variable, in FOL.Tennenbaum.Variants]
Model.D [variable, in FOL.Tennenbaum.Tennenbaum_insep]
Model.D [variable, in FOL.Tennenbaum.Tennenbaum_diagonal]
Model.D [variable, in FOL.Tennenbaum.Coding]
Model.Facts [section, in FOL.Tennenbaum.Coding]
Model.HA_insep [section, in FOL.Tennenbaum.Variants]
Model.Hψ [variable, in FOL.Tennenbaum.Variants]
Model.Hψ [variable, in FOL.Tennenbaum.Tennenbaum_insep]
Model.Hψ [variable, in FOL.Tennenbaum.Tennenbaum_diagonal]
Model.I [variable, in FOL.Tennenbaum.Variants]
Model.I [variable, in FOL.Tennenbaum.Tennenbaum_insep]
Model.I [variable, in FOL.Tennenbaum.Tennenbaum_diagonal]
Model.I [variable, in FOL.Tennenbaum.Coding]
Model.McCarty [section, in FOL.Tennenbaum.Variants]
Model.obj_Coding [variable, in FOL.Tennenbaum.Variants]
Model.Overspill [section, in FOL.Tennenbaum.Coding]
Model.Pred [section, in FOL.Tennenbaum.Coding]
i0 (PA_Notation) [notation, in FOL.Tennenbaum.Variants]
i0 (PA_Notation) [notation, in FOL.Tennenbaum.Tennenbaum_insep]
i0 (PA_Notation) [notation, in FOL.Tennenbaum.Tennenbaum_diagonal]
i0 (PA_Notation) [notation, in FOL.Tennenbaum.Coding]
_ i⧀ _ [notation, in FOL.Tennenbaum.Variants]
_ i⊗ _ [notation, in FOL.Tennenbaum.Variants]
_ i⊕ _ [notation, in FOL.Tennenbaum.Variants]
_ i= _ [notation, in FOL.Tennenbaum.Variants]
_ i⧀ _ [notation, in FOL.Tennenbaum.Tennenbaum_insep]
_ i⊗ _ [notation, in FOL.Tennenbaum.Tennenbaum_insep]
_ i⊕ _ [notation, in FOL.Tennenbaum.Tennenbaum_insep]
_ i= _ [notation, in FOL.Tennenbaum.Tennenbaum_insep]
_ i⧀ _ [notation, in FOL.Tennenbaum.Tennenbaum_diagonal]
_ i⊗ _ [notation, in FOL.Tennenbaum.Tennenbaum_diagonal]
_ i⊕ _ [notation, in FOL.Tennenbaum.Tennenbaum_diagonal]
_ i= _ [notation, in FOL.Tennenbaum.Tennenbaum_diagonal]
_ i⧀ _ [notation, in FOL.Tennenbaum.Coding]
_ i⊗ _ [notation, in FOL.Tennenbaum.Coding]
_ i⊕ _ [notation, in FOL.Tennenbaum.Coding]
_ i= _ [notation, in FOL.Tennenbaum.Coding]
iσ _ [notation, in FOL.Tennenbaum.Variants]
iσ _ [notation, in FOL.Tennenbaum.Tennenbaum_insep]
iσ _ [notation, in FOL.Tennenbaum.Tennenbaum_diagonal]
iσ _ [notation, in FOL.Tennenbaum.Coding]
N⊨ _ [notation, in FOL.Tennenbaum.Tennenbaum_diagonal]
⊨ _ [notation, in FOL.Tennenbaum.Tennenbaum_diagonal]
Model.ψ [variable, in FOL.Tennenbaum.Variants]
Model.ψ [variable, in FOL.Tennenbaum.Tennenbaum_insep]
Model.ψ [variable, in FOL.Tennenbaum.Tennenbaum_diagonal]
ModMod_is_Mod [lemma, in FOL.Tennenbaum.NumberUtils]
Mod_mult_hom [lemma, in FOL.Tennenbaum.NumberUtils]
Mod_mult_hom_l [lemma, in FOL.Tennenbaum.NumberUtils]
Mod_add_hom [lemma, in FOL.Tennenbaum.NumberUtils]
Mod_plus_multiple [lemma, in FOL.Tennenbaum.NumberUtils]
Mod_id [lemma, in FOL.Tennenbaum.NumberUtils]
Mod_le [lemma, in FOL.Tennenbaum.NumberUtils]
Mod_divides [lemma, in FOL.Tennenbaum.NumberUtils]
Mod_lt [lemma, in FOL.Tennenbaum.NumberUtils]
Mod_bound [lemma, in FOL.Tennenbaum.NumberUtils]
Mod0_is_0 [lemma, in FOL.Tennenbaum.NumberUtils]
mono_inj [lemma, in FOL.Tennenbaum.NumberUtils]
mon_F [lemma, in FOL.Completeness.KripkeCompleteness]
mOr [definition, in FOL.Reification.GeneralReflection]
MoreDecidabilityFacts [library]
move_to_front_incl [lemma, in FOL.Proofmode.ProofMode]
move_to_front [definition, in FOL.Proofmode.ProofMode]
MP [definition, in FOL.Utils.MPFacts]
MP [definition, in FOL.Tennenbaum.SyntheticInType]
MPFacts [library]
MP_Discrete_stable_std [lemma, in FOL.Tennenbaum.Tennenbaum_diagonal]
MP_stable_enumerable [lemma, in FOL.Utils.MPFacts]
MP_Post [lemma, in FOL.Utils.MPFacts]
MP_dec [lemma, in FOL.Utils.MPFacts]
MP_Dec_stable [lemma, in FOL.Tennenbaum.SyntheticInType]
MP_Markov_nat [lemma, in FOL.Tennenbaum.SyntheticInType]
MP_is_enumerable_completeness [lemma, in FOL.Completeness.TarskiCompleteness]
MP_prop_is_arbitrary_completeness [lemma, in FOL.Completeness.TarskiCompleteness]
MP_prop_to_MP_pred [lemma, in FOL.Completeness.TarskiCompleteness]
MP_pred [definition, in FOL.Completeness.TarskiCompleteness]
MP_prop [definition, in FOL.Completeness.TarskiCompleteness]
mp_standard_completeness [lemma, in FOL.Completeness.TarskiCompleteness]
mp_tprv_stability [lemma, in FOL.Completeness.TarskiCompleteness]
mTrue [definition, in FOL.Reification.GeneralReflection]
mu [section, in FOL.Incompleteness.epf_mu]
mu [definition, in FOL.Utils.MPFacts]
mu [definition, in FOL.Incompleteness.Abstract]
mu [definition, in FOL.Incompleteness.utils]
Mult_rec [lemma, in FOL.Tennenbaum.Peano]
mult_le_mono [lemma, in FOL.Tennenbaum.Peano]
mult_asso [lemma, in FOL.Tennenbaum.Peano]
mult_comm [lemma, in FOL.Tennenbaum.Peano]
mult_rec_r [lemma, in FOL.Tennenbaum.Peano]
mult_zero_r [lemma, in FOL.Tennenbaum.Peano]
mult_rec [lemma, in FOL.Tennenbaum.Peano]
mult_zero [lemma, in FOL.Tennenbaum.Peano]
mul_comm [lemma, in FOL.Reification.DemoPA]
mul_succ_r [lemma, in FOL.Reification.DemoPA]
mul_zero_r [lemma, in FOL.Reification.DemoPA]
mul_succ_l [lemma, in FOL.Reification.DemoPA]
mul_zero_l [lemma, in FOL.Reification.DemoPA]
mul_comm [lemma, in FOL.Reification.DemoPAExtensional]
mul_succ_r [lemma, in FOL.Reification.DemoPAExtensional]
mul_zero_r [lemma, in FOL.Reification.DemoPAExtensional]
mul_succ_l [lemma, in FOL.Reification.DemoPAExtensional]
mul_zero_l [lemma, in FOL.Reification.DemoPAExtensional]
mu_recursive_definable [lemma, in FOL.Incompleteness.epf_mu]
mu_semi_decidable_enumerable [lemma, in FOL.Incompleteness.epf_mu]
mu_step [definition, in FOL.Incompleteness.epf_mu]
mu_semi_decidable [definition, in FOL.Incompleteness.epf_mu]
mu.mu_universal [variable, in FOL.Incompleteness.epf_mu]
N
n [section, in FOL.Incompleteness.fol_utils]named_var [definition, in FOL.Proofmode.ProofMode]
named_quant [definition, in FOL.Proofmode.ProofMode]
nameless_equiv_ex [lemma, in FOL.Deduction.FullSequentFacts]
nameless_equiv_all [lemma, in FOL.Deduction.FullSequentFacts]
nameless_equiv_ex' [lemma, in FOL.Deduction.FullSequentFacts]
nameless_equiv_all' [lemma, in FOL.Deduction.FullSequentFacts]
naryGFunc [definition, in FOL.Reification.GeneralReflection]
naryProp [definition, in FOL.Reification.GeneralReflection]
nary3GFunc [definition, in FOL.Reification.GeneralReflection]
nat_recalg_nat [lemma, in FOL.Incompleteness.epf_mu]
nat_recalg [definition, in FOL.Incompleteness.epf_mu]
nat_recalg' [definition, in FOL.Incompleteness.epf_mu]
nat_hom [definition, in FOL.Tennenbaum.Peano]
nat_eq_dec [lemma, in FOL.Tennenbaum.Tennenbaum_diagonal]
nat_to_bool [definition, in FOL.Incompleteness.epf]
nat_to_string [definition, in FOL.Proofmode.ProofMode]
nat_to_string' [definition, in FOL.Proofmode.ProofMode]
NBot [projection, in FOL.Completeness.TarskiConstructions]
NBot_closed [projection, in FOL.Completeness.TarskiConstructions]
ND [section, in FOL.Tennenbaum.Peano]
ND.p [variable, in FOL.Tennenbaum.Peano]
neg_dec [lemma, in FOL.Incompleteness.Abstract]
neg_lt_bounded_forall [lemma, in FOL.Tennenbaum.MoreDecidabilityFacts]
negΣinΠsem [lemma, in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySemantic]
negΣinΠsyn [lemma, in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySyntactic]
neq_le [lemma, in FOL.Proofmode.DemoPA]
next [definition, in FOL.Tennenbaum.CantorPairing]
NNN_N [lemma, in FOL.Tennenbaum.SyntheticInType]
nolessthen_zero [lemma, in FOL.Tennenbaum.Peano]
nonStd [definition, in FOL.Tennenbaum.Peano]
nonStd_notStd [lemma, in FOL.Tennenbaum.Peano]
noProofDummy [definition, in FOL.Reification.GeneralReflection]
noQuand_ind_inv [lemma, in FOL.Utils.PrenexNormalForm]
noQuant_ind_subst [lemma, in FOL.Utils.PrenexNormalForm]
noQuant_agree [lemma, in FOL.Utils.PrenexNormalForm]
noQuant_ind_rec [definition, in FOL.Utils.PrenexNormalForm]
noQuant_ind_sind [definition, in FOL.Utils.PrenexNormalForm]
noQuant_ind_ind [definition, in FOL.Utils.PrenexNormalForm]
noQuant_ind [inductive, in FOL.Utils.PrenexNormalForm]
noQuant_bool [definition, in FOL.Utils.PrenexNormalForm]
noQuant_dec [lemma, in FOL.ArithmeticalHierarchy.ArithmeticalHierarchyEquiv]
normal [definition, in FOL.Completeness.HeytingMacNeille]
normal [definition, in FOL.Deduction.FragmentSequentFacts]
normal_bot [lemma, in FOL.Completeness.HeytingMacNeille]
normal_dclosed [lemma, in FOL.Completeness.HeytingMacNeille]
normal_proper [instance, in FOL.Completeness.HeytingMacNeille]
notStd [definition, in FOL.Tennenbaum.Peano]
not_lt_zero_prv [lemma, in FOL.Tennenbaum.Peano]
not_lt_zero_prv' [lemma, in FOL.Tennenbaum.Peano]
not_AllI [definition, in FOL.Deduction.FragmentSequentFacts]
not_II [definition, in FOL.Deduction.FragmentSequentFacts]
no_recursively_separating [lemma, in FOL.Incompleteness.epf]
nQ_bin [constructor, in FOL.Utils.PrenexNormalForm]
nQ_atom [constructor, in FOL.Utils.PrenexNormalForm]
nQ_false [constructor, in FOL.Utils.PrenexNormalForm]
num [definition, in FOL.Proofmode.DemoPA]
num [definition, in FOL.Reification.DemoPAExtensional]
NumberUtils [library]
num_mult_homomorphism' [lemma, in FOL.Proofmode.DemoPA]
num_add_homomorphism' [lemma, in FOL.Proofmode.DemoPA]
num_mult_homomorphism [lemma, in FOL.Proofmode.DemoPA]
num_add_homomorphism [lemma, in FOL.Proofmode.DemoPA]
num_le_nonStd [lemma, in FOL.Tennenbaum.Tennenbaum_insep]
num_lt_dec [lemma, in FOL.Tennenbaum.Peano]
num_nlt [lemma, in FOL.Tennenbaum.Peano]
num_lt [lemma, in FOL.Tennenbaum.Peano]
num_eq_dec [lemma, in FOL.Tennenbaum.Peano]
num_neq [lemma, in FOL.Tennenbaum.Peano]
num_eq [lemma, in FOL.Tennenbaum.Peano]
num_mult_homomorphism [lemma, in FOL.Tennenbaum.Peano]
num_add_homomorphism [lemma, in FOL.Tennenbaum.Peano]
num_subst [lemma, in FOL.Tennenbaum.Peano]
num_lt_nonStd_converse [lemma, in FOL.Tennenbaum.Coding]
num_lt_nonStd [lemma, in FOL.Tennenbaum.Coding]
n00_next [lemma, in FOL.Tennenbaum.CantorPairing]
O
OL [constructor, in FOL.Deduction.FullSequent]Omega [definition, in FOL.Completeness.TarskiConstructions]
omega [definition, in FOL.Completeness.TarskiConstructions]
Omega_all [lemma, in FOL.Completeness.TarskiConstructions]
Omega_impl [lemma, in FOL.Completeness.TarskiConstructions]
Omega_T [lemma, in FOL.Completeness.TarskiConstructions]
Omega_prv [lemma, in FOL.Completeness.TarskiConstructions]
omega_le [lemma, in FOL.Completeness.TarskiConstructions]
only_logic [lemma, in FOL.Reification.DemoPA]
on_std_equiv [lemma, in FOL.Tennenbaum.Coding]
orelse [definition, in FOL.Reification.GeneralReflection]
or_single [lemma, in FOL.Deduction.FullSequentFacts]
or_weak [lemma, in FOL.Deduction.FullSequentFacts]
or_el [lemma, in FOL.Deduction.FullSequentFacts]
or_char [lemma, in FOL.Deduction.FullSequentFacts]
or_subst [lemma, in FOL.Deduction.FullSequentFacts]
or_ldec [lemma, in FOL.Completeness.TarskiCompleteness]
OR1 [constructor, in FOL.Deduction.FullSequent]
OR2 [constructor, in FOL.Deduction.FullSequent]
output_fragment [definition, in FOL.Completeness.TarskiCompleteness]
output_bot [definition, in FOL.Completeness.TarskiCompleteness]
Out_T_impl [projection, in FOL.Completeness.TarskiConstructions]
Out_T_all [projection, in FOL.Completeness.TarskiConstructions]
Out_T_prv [projection, in FOL.Completeness.TarskiConstructions]
Out_T_sub [projection, in FOL.Completeness.TarskiConstructions]
Out_T_econsistent [projection, in FOL.Completeness.TarskiConstructions]
Out_T [projection, in FOL.Completeness.TarskiConstructions]
Overspill [lemma, in FOL.Tennenbaum.Coding]
Overspill_DN [lemma, in FOL.Tennenbaum.Coding]
Overspill_DN' [lemma, in FOL.Tennenbaum.Coding]
P
PAeq_enum [lemma, in FOL.Incompleteness.Axiomatisations]PAle_num_eq [lemma, in FOL.Incompleteness.qdec]
PAle_succ [lemma, in FOL.Incompleteness.qdec]
PAle_sigma_neq [lemma, in FOL.Incompleteness.qdec]
PAle_zero_eq [lemma, in FOL.Incompleteness.qdec]
PAle'_num_eq [lemma, in FOL.Incompleteness.qdec]
PAle'_succ [lemma, in FOL.Incompleteness.qdec]
PAle'_sigma_neq [lemma, in FOL.Incompleteness.qdec]
PAle'_zero_eq [lemma, in FOL.Incompleteness.qdec]
PAQ [definition, in FOL.Tennenbaum.HA_insep]
PAQ_proves_cases [lemma, in FOL.Tennenbaum.HA_insep]
parse_intro_pattern [definition, in FOL.Proofmode.ProofMode]
parse_intro_pattern' [definition, in FOL.Proofmode.ProofMode]
part [record, in FOL.Incompleteness.utils]
partialise [definition, in FOL.Incompleteness.utils]
part_functional [lemma, in FOL.Incompleteness.utils]
part_eval [definition, in FOL.Incompleteness.utils]
PAsat [definition, in FOL.Tennenbaum.Peano]
patAnd [constructor, in FOL.Proofmode.ProofMode]
patId [constructor, in FOL.Proofmode.ProofMode]
patOr [constructor, in FOL.Proofmode.ProofMode]
patRewrite [constructor, in FOL.Proofmode.ProofMode]
patRewriteBack [constructor, in FOL.Proofmode.ProofMode]
PA_induction [lemma, in FOL.Reification.DemoPA]
PA_reflector [instance, in FOL.Reification.DemoPA]
pa_eq_dec [lemma, in FOL.Proofmode.DemoPA]
PA_Leibniz [instance, in FOL.Proofmode.DemoPA]
PA_std_axioms [lemma, in FOL.Tennenbaum.Peano]
PA_induction [lemma, in FOL.Reification.DemoPAExtensional]
PA_reflector_ext [instance, in FOL.Reification.DemoPAExtensional]
PA_reflector [instance, in FOL.Reification.DemoPAExtensional]
PA_undec3 [lemma, in FOL.Incompleteness.Axiomatisations]
PA_undec2 [lemma, in FOL.Incompleteness.Axiomatisations]
PA_undec1 [lemma, in FOL.Incompleteness.Axiomatisations]
PA_consistent [lemma, in FOL.Tennenbaum.Formulas]
PA_extends_Q [lemma, in FOL.Tennenbaum.HA_insep]
PA_Leibniz [instance, in FOL.Incompleteness.fol_utils]
PA_incompleteness [library]
Pc [projection, in FOL.Proofmode.ProofMode]
Peano [library]
Perm [constructor, in FOL.Deduction.FullSequent]
Pi_Delta [constructor, in FOL.Incompleteness.sigma1]
Pi_forall [constructor, in FOL.Incompleteness.sigma1]
PM [section, in FOL.Proofmode.ProofMode]
pm [definition, in FOL.Proofmode.ProofMode]
PM [section, in FOL.Incompleteness.fol_utils]
PNFrules [section, in FOL.Utils.PrenexNormalForm]
PNF_equiv_DN [lemma, in FOL.Utils.PrenexNormalForm]
PNF_equiv [lemma, in FOL.Utils.PrenexNormalForm]
PNF_equiv_bin_op [lemma, in FOL.Utils.PrenexNormalForm]
PNF_agree [lemma, in FOL.Utils.PrenexNormalForm]
PNF_ind_rec [definition, in FOL.Utils.PrenexNormalForm]
PNF_ind_inversion [lemma, in FOL.Utils.PrenexNormalForm]
PNF_ind_sind [definition, in FOL.Utils.PrenexNormalForm]
PNF_ind_ind [definition, in FOL.Utils.PrenexNormalForm]
PNF_quant [constructor, in FOL.Utils.PrenexNormalForm]
PNF_noQuant [constructor, in FOL.Utils.PrenexNormalForm]
PNF_ind [inductive, in FOL.Utils.PrenexNormalForm]
PNF_notAll [lemma, in FOL.Utils.PrenexNormalForm]
PNF_notExists [lemma, in FOL.Utils.PrenexNormalForm]
PNF_implExists [lemma, in FOL.Utils.PrenexNormalForm]
PNF_implAll [lemma, in FOL.Utils.PrenexNormalForm]
PNF_existsImpl [lemma, in FOL.Utils.PrenexNormalForm]
PNF_allImpl [lemma, in FOL.Utils.PrenexNormalForm]
PNF_allImpl2 [lemma, in FOL.Utils.PrenexNormalForm]
PNF_allImpl1 [lemma, in FOL.Utils.PrenexNormalForm]
PNF_orExists [lemma, in FOL.Utils.PrenexNormalForm]
PNF_existsOr [lemma, in FOL.Utils.PrenexNormalForm]
PNF_andExists [lemma, in FOL.Utils.PrenexNormalForm]
PNF_existsAnd [lemma, in FOL.Utils.PrenexNormalForm]
PNF_orAll [lemma, in FOL.Utils.PrenexNormalForm]
PNF_allOr [lemma, in FOL.Utils.PrenexNormalForm]
PNF_all_Or2 [lemma, in FOL.Utils.PrenexNormalForm]
PNF_all_Or1 [lemma, in FOL.Utils.PrenexNormalForm]
PNF_andAll [lemma, in FOL.Utils.PrenexNormalForm]
PNF_allAnd [lemma, in FOL.Utils.PrenexNormalForm]
PNF_isΣorΠ_syn [lemma, in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySyntactic]
popListStart [definition, in FOL.Reification.GeneralReflection]
popNElements [definition, in FOL.Reification.GeneralReflection]
PredExt [axiom, in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySemantic]
predicate_equiv [lemma, in FOL.Tennenbaum.Coding]
preds [abbreviation, in FOL.Reification.GeneralReflection]
preds [abbreviation, in FOL.Reification.GeneralReflection]
PrenexNormalForm [section, in FOL.Utils.PrenexNormalForm]
PrenexNormalForm [library]
preorder_HA [instance, in FOL.Semantics.Heyting.Heyting]
prime [definition, in FOL.Tennenbaum.NumberUtils]
PrimeDec [section, in FOL.Tennenbaum.NumberUtils]
PrimeInf [section, in FOL.Tennenbaum.NumberUtils]
_ ! [notation, in FOL.Tennenbaum.NumberUtils]
prime_div_relation [lemma, in FOL.Tennenbaum.Church]
prime_irred_equiv [lemma, in FOL.Tennenbaum.NumberUtils]
ProductWO [lemma, in FOL.Tennenbaum.MoreDecidabilityFacts]
proj1 [definition, in FOL.Reification.DemoPA]
proj1 [definition, in FOL.Reification.DemoPAExtensional]
ProofMode [library]
proper_HA_Inf_indexed [instance, in FOL.Semantics.Heyting.Heyting]
proper_HA_Sup_indexed [instance, in FOL.Semantics.Heyting.Heyting]
proper_HA_Sup [instance, in FOL.Semantics.Heyting.Heyting]
proper_HA_Inf [instance, in FOL.Semantics.Heyting.Heyting]
proper_HA_Impl [instance, in FOL.Semantics.Heyting.Heyting]
proper_HA_Join [instance, in FOL.Semantics.Heyting.Heyting]
proper_HA_Meet [instance, in FOL.Semantics.Heyting.Heyting]
propFinderReifier [definition, in FOL.Reification.GeneralReflection]
propFinderVars [definition, in FOL.Reification.GeneralReflection]
prv_split [lemma, in FOL.Tennenbaum.Church]
prv_iff_symmetry [lemma, in FOL.Tennenbaum.Tennenbaum_insep]
prv_to_min [lemma, in FOL.Proofmode.DemoMinZF]
prv_to_min_om2 [lemma, in FOL.Proofmode.DemoMinZF]
prv_to_min_om1 [lemma, in FOL.Proofmode.DemoMinZF]
prv_to_min_inductive [lemma, in FOL.Proofmode.DemoMinZF]
prv_to_min_power [lemma, in FOL.Proofmode.DemoMinZF]
prv_to_min_union [lemma, in FOL.Proofmode.DemoMinZF]
prv_to_min_pair [lemma, in FOL.Proofmode.DemoMinZF]
prv_to_min_eset [lemma, in FOL.Proofmode.DemoMinZF]
prv_to_min_ext [lemma, in FOL.Proofmode.DemoMinZF]
prv_to_min_elem [lemma, in FOL.Proofmode.DemoMinZF]
prv_to_min_trans [lemma, in FOL.Proofmode.DemoMinZF]
prv_to_min_sym [lemma, in FOL.Proofmode.DemoMinZF]
prv_to_min_refl [lemma, in FOL.Proofmode.DemoMinZF]
prv_WeakClass [instance, in FOL.Proofmode.ProofMode]
prv_FalsityDeductionRules [instance, in FOL.Proofmode.ProofMode]
prv_ClassicalDeductionRules [instance, in FOL.Proofmode.ProofMode]
prv_DeductionRules [instance, in FOL.Proofmode.ProofMode]
prv_lt_lt_bottom [lemma, in FOL.Tennenbaum.HA_insep]
prv_leq_S [lemma, in FOL.Tennenbaum.HA_insep]
prv_0_leq_x [lemma, in FOL.Tennenbaum.HA_insep]
prv_contraposition [lemma, in FOL.Tennenbaum.HA_insep]
prv_equiv [lemma, in FOL.Tennenbaum.HA_insep]
prv_utils [section, in FOL.Tennenbaum.HA_insep]
prv_enumerable [lemma, in FOL.Incompleteness.ctq]
ps [projection, in FOL.Reification.GeneralReflection]
P_semi_decidable [projection, in FOL.Incompleteness.formal_systems]
Q
Q [abbreviation, in FOL.Tennenbaum.Variants]Q [abbreviation, in FOL.Tennenbaum.Church]
Q [abbreviation, in FOL.Tennenbaum.Tennenbaum_insep]
Q [abbreviation, in FOL.Tennenbaum.Peano]
Q [abbreviation, in FOL.Tennenbaum.Peano]
Q [abbreviation, in FOL.Tennenbaum.Peano]
Q [abbreviation, in FOL.Tennenbaum.Tennenbaum_diagonal]
Q [abbreviation, in FOL.Tennenbaum.Coding]
Q [abbreviation, in FOL.Tennenbaum.Formulas]
Qdec [definition, in FOL.Incompleteness.qdec]
Qdec [section, in FOL.Incompleteness.qdec]
qdec [library]
Qdec_bounded_exists_comm [lemma, in FOL.Incompleteness.qdec]
Qdec_bounded_exists [lemma, in FOL.Incompleteness.qdec]
Qdec_bounded_forall [lemma, in FOL.Incompleteness.qdec]
Qdec_fin_disj [lemma, in FOL.Incompleteness.qdec]
Qdec_fin_conj [lemma, in FOL.Incompleteness.qdec]
Qdec_le [lemma, in FOL.Incompleteness.qdec]
Qdec_eq [lemma, in FOL.Incompleteness.qdec]
Qdec_impl [lemma, in FOL.Incompleteness.qdec]
Qdec_or [lemma, in FOL.Incompleteness.qdec]
Qdec_and [lemma, in FOL.Incompleteness.qdec]
Qdec_bot [lemma, in FOL.Incompleteness.qdec]
Qdec_iff' [lemma, in FOL.Incompleteness.qdec]
Qdec_iff [lemma, in FOL.Incompleteness.qdec]
Qdec_subst [lemma, in FOL.Incompleteness.qdec]
Qdec_bin_bounded_forall [lemma, in FOL.Incompleteness.bin_qdec]
Qdec_kernel_Insep [lemma, in FOL.Tennenbaum.Tennenbaum_insep]
Qdec.lemmas [section, in FOL.Incompleteness.qdec]
Qeq [definition, in FOL.Incompleteness.fol_utils]
Qeq_def [lemma, in FOL.Incompleteness.fol_utils]
Qsdec_le [lemma, in FOL.Incompleteness.qdec]
quant_list_to_form_rename_free_up [lemma, in FOL.Utils.PrenexNormalForm]
quant_list_to_form_rename_free [lemma, in FOL.Utils.PrenexNormalForm]
quant_list_to_form_equiv [lemma, in FOL.Utils.PrenexNormalForm]
quant_list_to_form [definition, in FOL.Utils.PrenexNormalForm]
quoteNumber [definition, in FOL.Reification.GeneralReflection]
Q_incomplete [lemma, in FOL.Incompleteness.fol_incompleteness]
Q_undecidable [lemma, in FOL.Incompleteness.fol_incompleteness]
Q_weak_repr [lemma, in FOL.Incompleteness.epf_mu]
Q_leibniz [lemma, in FOL.Incompleteness.qdec]
Q_leibniz_t [lemma, in FOL.Incompleteness.qdec]
Q_eqdec [lemma, in FOL.Incompleteness.qdec]
Q_add_assoc2 [lemma, in FOL.Incompleteness.bin_qdec]
Q_add_assoc1 [lemma, in FOL.Incompleteness.bin_qdec]
Q_prv [section, in FOL.Tennenbaum.Peano]
Q_prv [section, in FOL.Tennenbaum.Peano]
Q_std_axioms [lemma, in FOL.Tennenbaum.Peano]
Q_consistent [lemma, in FOL.Tennenbaum.Formulas]
Q_num_inj [lemma, in FOL.Incompleteness.ctq]
Q' [definition, in FOL.Incompleteness.Axiomatisations]
R
R [projection, in FOL.Semantics.Heyting.Heyting]raiseEnvTerm [definition, in FOL.Reification.GeneralReflection]
read_name [definition, in FOL.Proofmode.ProofMode]
recalg_nat [definition, in FOL.Incompleteness.epf_mu]
recalg_enum [section, in FOL.Incompleteness.epf_mu]
recoverVector [definition, in FOL.Reification.GeneralReflection]
recursively_separating_diverge [lemma, in FOL.Incompleteness.epf]
recursively_separates [definition, in FOL.Incompleteness.epf]
reduction_theorem [lemma, in FOL.Incompleteness.PA_incompleteness]
reduction_theorem_class [lemma, in FOL.Incompleteness.Axiomatisations]
reduction_theorem [lemma, in FOL.Incompleteness.Axiomatisations]
reduction_consistency [lemma, in FOL.Incompleteness.Axiomatisations]
reduction_equiv [lemma, in FOL.Incompleteness.Abstract]
reduction_valid [lemma, in FOL.Incompleteness.Abstract]
reduction_provable [lemma, in FOL.Incompleteness.Abstract]
red_union_valid [lemma, in FOL.Incompleteness.Axiomatisations]
red_union_prv [lemma, in FOL.Incompleteness.Axiomatisations]
red_union_prv' [lemma, in FOL.Incompleteness.Axiomatisations]
red_sub_valid [lemma, in FOL.Incompleteness.Axiomatisations]
red_sub_prv [lemma, in FOL.Incompleteness.Axiomatisations]
red_prv_valid [lemma, in FOL.Incompleteness.Axiomatisations]
red_prv_prv [lemma, in FOL.Incompleteness.Axiomatisations]
red_finite_prv [lemma, in FOL.Incompleteness.Axiomatisations]
red_finite_valid [lemma, in FOL.Incompleteness.Axiomatisations]
refined_undec_Z' [lemma, in FOL.Incompleteness.Axiomatisations]
refl [lemma, in FOL.Proofmode.ProofMode]
reflecting [definition, in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySyntactic]
reflecting_neq [lemma, in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySyntactic]
reflexivity [lemma, in FOL.Tennenbaum.Peano]
refutable_semi_decidable [lemma, in FOL.Incompleteness.formal_systems]
refutable_enum [lemma, in FOL.Incompleteness.Abstract]
ReificationExample [section, in FOL.Reification.DemoPA]
ReificationExample [section, in FOL.Reification.DemoPAExtensional]
ReificationExample.ReflectionExtension [section, in FOL.Reification.DemoPAExtensional]
ReificationHelpers [section, in FOL.Reification.GeneralReflection]
reifyAnd [definition, in FOL.Reification.GeneralReflection]
reifyAndNP [definition, in FOL.Reification.GeneralReflection]
reifyBase [definition, in FOL.Reification.GeneralReflection]
reifyBaseNP [definition, in FOL.Reification.GeneralReflection]
reifyBLC [definition, in FOL.Reification.DemoPAExtensional]
reifyCoqEq [definition, in FOL.Reification.DemoPAExtensional]
reifyExist [definition, in FOL.Reification.GeneralReflection]
reifyExistNP [definition, in FOL.Reification.GeneralReflection]
reifyFalse [definition, in FOL.Reification.GeneralReflection]
reifyFalseNP [definition, in FOL.Reification.GeneralReflection]
reifyForm [definition, in FOL.Reification.GeneralReflection]
reifyFormNP [definition, in FOL.Reification.GeneralReflection]
reifyIff [definition, in FOL.Reification.GeneralReflection]
reifyIffNP [definition, in FOL.Reification.GeneralReflection]
reifyNot [definition, in FOL.Reification.GeneralReflection]
reifyNotNP [definition, in FOL.Reification.GeneralReflection]
reifyOr [definition, in FOL.Reification.GeneralReflection]
reifyOrNP [definition, in FOL.Reification.GeneralReflection]
reifyTerm [definition, in FOL.Reification.GeneralReflection]
reifyTerm [definition, in FOL.Reification.DemoPAExtensional]
reifyTermNP [definition, in FOL.Reification.GeneralReflection]
reifyTrue [definition, in FOL.Reification.GeneralReflection]
reifyTrueNP [definition, in FOL.Reification.GeneralReflection]
rem [definition, in FOL.Proofmode.Theories]
remove_n_incl [lemma, in FOL.Proofmode.ProofMode]
remove_n [definition, in FOL.Proofmode.ProofMode]
replace [definition, in FOL.Proofmode.ProofMode]
replace_incl [lemma, in FOL.Proofmode.ProofMode]
representableF [definition, in FOL.Reification.GeneralReflection]
representableP [definition, in FOL.Reification.GeneralReflection]
represents [definition, in FOL.Tennenbaum.Church]
representsF [definition, in FOL.Reification.GeneralReflection]
representsP [definition, in FOL.Reification.GeneralReflection]
ret [constructor, in FOL.Reification.GeneralReflection]
rosser [definition, in FOL.Tennenbaum.HA_insep]
Rosser [section, in FOL.Tennenbaum.HA_insep]
rosser_inherit [lemma, in FOL.Tennenbaum.HA_insep]
rosser_disj [lemma, in FOL.Tennenbaum.HA_insep]
rosser_disj' [lemma, in FOL.Tennenbaum.HA_insep]
rosser_anitsymmetry [lemma, in FOL.Tennenbaum.HA_insep]
rosser_equiv [lemma, in FOL.Tennenbaum.HA_insep]
Rref [projection, in FOL.Semantics.Heyting.Heyting]
RT [definition, in FOL.Tennenbaum.Church]
Rtra [projection, in FOL.Semantics.Heyting.Heyting]
RT_weak [definition, in FOL.Tennenbaum.Church]
RT_strong [definition, in FOL.Tennenbaum.Church]
S
sat_exist_times [lemma, in FOL.Incompleteness.epf_mu]sat_embed [lemma, in FOL.Incompleteness.PA_incompleteness]
sat_Fr_context [lemma, in FOL.Incompleteness.PA_incompleteness]
sat_Fr_formula [lemma, in FOL.Incompleteness.PA_incompleteness]
sat_Q_axioms [lemma, in FOL.Tennenbaum.Peano]
sat_PAle [lemma, in FOL.Incompleteness.ctq]
sat_single_nat [lemma, in FOL.Incompleteness.fol_utils]
sat_single_PA [lemma, in FOL.Incompleteness.fol_utils]
self_halting_undec [lemma, in FOL.Incompleteness.epf]
self_halting_diverge [lemma, in FOL.Incompleteness.epf]
self_halting [definition, in FOL.Incompleteness.epf]
semi_dec_iff_Σ1 [lemma, in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySemantic]
semi_completeness_fragment [lemma, in FOL.Completeness.TarskiCompleteness]
semi_completeness_exploding [lemma, in FOL.Completeness.TarskiCompleteness]
semi_completeness_standard [lemma, in FOL.Completeness.TarskiCompleteness]
semi_completeness_standard_classical_model [lemma, in FOL.Completeness.TarskiCompleteness]
Separated [definition, in FOL.Tennenbaum.SyntheticInType]
Separated_sum [lemma, in FOL.Tennenbaum.SyntheticInType]
Separated_equiv [lemma, in FOL.Tennenbaum.SyntheticInType]
⋁ _ [notation, in FOL.Deduction.FullSequentFacts]
Sequent_def [section, in FOL.Deduction.FullSequentFacts]
seq_ND_T [lemma, in FOL.Deduction.FragmentSequentFacts]
seq_ND [lemma, in FOL.Deduction.FragmentSequentFacts]
seq_nameless_equiv_all' [lemma, in FOL.Deduction.FragmentSequentFacts]
seq_subst_Weak [lemma, in FOL.Deduction.FragmentSequentFacts]
seq_Weak [lemma, in FOL.Deduction.FragmentSequentFacts]
seq_consistent [lemma, in FOL.Deduction.FragmentSequentFacts]
Sets [library]
SE_cut [lemma, in FOL.Completeness.KripkeCompleteness]
shift [abbreviation, in FOL.Utils.PrenexNormalForm]
shift_quant_1 [lemma, in FOL.Utils.PrenexNormalForm]
shift_quant_add [lemma, in FOL.Utils.PrenexNormalForm]
shift_quant_0 [lemma, in FOL.Utils.PrenexNormalForm]
shift_one_more [lemma, in FOL.Utils.PrenexNormalForm]
shift_quant_explicit [lemma, in FOL.Utils.PrenexNormalForm]
shift_quant [definition, in FOL.Utils.PrenexNormalForm]
shift_down [definition, in FOL.Proofmode.Theories]
Sigma_Delta [constructor, in FOL.Incompleteness.sigma1]
Sigma_exists [constructor, in FOL.Incompleteness.sigma1]
Sigma_0_1_cumul [lemma, in FOL.Completeness.TarskiCompleteness]
Sigma_0_1 [definition, in FOL.Completeness.TarskiCompleteness]
Sigma1 [section, in FOL.Incompleteness.sigma1]
Sigma1 [section, in FOL.Incompleteness.sigma1]
sigma1 [library]
Sigma1completeness [section, in FOL.Incompleteness.sigma1]
Sigma1completeness [section, in FOL.Incompleteness.sigma1]
size_rect [lemma, in FOL.Tennenbaum.CantorPairing]
sless [definition, in FOL.Tennenbaum.Peano]
sless_subst [lemma, in FOL.Tennenbaum.Peano]
sound [definition, in FOL.Incompleteness.formal_systems]
Soundness [lemma, in FOL.Semantics.Heyting.Soundness]
Soundness [section, in FOL.Semantics.Heyting.Soundness]
Soundness [library]
Soundness' [lemma, in FOL.Semantics.Heyting.Soundness]
sprv [inductive, in FOL.Deduction.FragmentSequent]
sprv_sind [definition, in FOL.Deduction.FragmentSequent]
sprv_ind [definition, in FOL.Deduction.FragmentSequent]
Stable [definition, in FOL.Tennenbaum.SyntheticInType]
stable [definition, in FOL.Tennenbaum.SyntheticInType]
stable [definition, in FOL.Completeness.TarskiCompleteness]
Stable_std_negn_nonStd__sdtMobel_equiv [lemma, in FOL.Tennenbaum.Tennenbaum_diagonal]
Stable_std_stable_stdModel [lemma, in FOL.Tennenbaum.Tennenbaum_diagonal]
Stable_neg_exists_neg__forall [lemma, in FOL.Tennenbaum.SyntheticInType]
StandardModel [section, in FOL.Tennenbaum.Peano]
std [definition, in FOL.Tennenbaum.Peano]
stdModel [section, in FOL.Tennenbaum.Peano]
stdModel [definition, in FOL.Tennenbaum.Peano]
stdModel_eqiv [lemma, in FOL.Tennenbaum.Peano]
stdModel' [definition, in FOL.Tennenbaum.Peano]
stdModel.axioms [variable, in FOL.Tennenbaum.Peano]
stdModel.D [variable, in FOL.Tennenbaum.Peano]
stdModel.I [variable, in FOL.Tennenbaum.Peano]
i0 (PA_Notation) [notation, in FOL.Tennenbaum.Peano]
_ i⧀ _ [notation, in FOL.Tennenbaum.Peano]
_ i⊗ _ [notation, in FOL.Tennenbaum.Peano]
_ i⊕ _ [notation, in FOL.Tennenbaum.Peano]
_ i= _ [notation, in FOL.Tennenbaum.Peano]
iσ _ [notation, in FOL.Tennenbaum.Peano]
std_T_consistent [lemma, in FOL.Incompleteness.PA_incompleteness]
stprv [definition, in FOL.Deduction.FragmentSequent]
string [abbreviation, in FOL.Reification.GeneralReflection]
StringToIdent [library]
string_eq_decidable [instance, in FOL.Reification.GeneralReflection]
stripneg [definition, in FOL.Incompleteness.Axiomatisations]
stripneg_spec [lemma, in FOL.Incompleteness.Axiomatisations]
strongly_separates [definition, in FOL.Incompleteness.formal_systems]
strong_repr [definition, in FOL.Tennenbaum.Church]
strong_separability_extension [lemma, in FOL.Incompleteness.abstract_incompleteness]
subrelation_HA_flip [instance, in FOL.Semantics.Heyting.Heyting]
subrelation_HA [instance, in FOL.Semantics.Heyting.Heyting]
subset_trans [lemma, in FOL.Proofmode.Theories]
subset_refl [lemma, in FOL.Proofmode.Theories]
subset_T [definition, in FOL.Proofmode.Theories]
subst [definition, in FOL.Reification.GeneralReflection]
subst_closed [lemma, in FOL.Incompleteness.qdec]
subst_t_closed [lemma, in FOL.Incompleteness.qdec]
subst_forall_prv [lemma, in FOL.Tennenbaum.Peano]
subst_exist_prv [lemma, in FOL.Tennenbaum.Peano]
subst_zero_term [lemma, in FOL.Proofmode.ProofMode]
subst_zero [lemma, in FOL.Proofmode.ProofMode]
subst_bound [lemma, in FOL.Tennenbaum.Formulas]
subst_bound_t [lemma, in FOL.Tennenbaum.Formulas]
subst_Weak [lemma, in FOL.Deduction.FullSequentFacts]
Succ_inj [lemma, in FOL.Tennenbaum.Peano]
succ_inj' [lemma, in FOL.Tennenbaum.Peano]
succ_inj [lemma, in FOL.Tennenbaum.Peano]
sum_is_zero [lemma, in FOL.Tennenbaum.Peano]
Sup [definition, in FOL.Semantics.Heyting.Heyting]
Sup_indexed1 [lemma, in FOL.Semantics.Heyting.Heyting]
Sup_indexed [definition, in FOL.Semantics.Heyting.Heyting]
Sup1 [lemma, in FOL.Semantics.Heyting.Heyting]
Sup2 [lemma, in FOL.Semantics.Heyting.Heyting]
surj [definition, in FOL.Tennenbaum.SyntheticInType]
surj_form [definition, in FOL.Tennenbaum.Tennenbaum_insep]
surj_form_ [lemma, in FOL.Tennenbaum.Tennenbaum_insep]
swap_quant [definition, in FOL.Utils.PrenexNormalForm]
switch_imp_T [lemma, in FOL.Proofmode.Theories]
switch_up_num [lemma, in FOL.Tennenbaum.Peano]
switch_num [lemma, in FOL.Tennenbaum.Peano]
switch_nat_num [lemma, in FOL.Tennenbaum.Formulas]
sym [lemma, in FOL.Proofmode.ProofMode]
symmetry [lemma, in FOL.Tennenbaum.Peano]
syms [abbreviation, in FOL.Reification.GeneralReflection]
syms [abbreviation, in FOL.Reification.GeneralReflection]
SyntheticInType [library]
T
TAbsurd [constructor, in FOL.Deduction.FragmentSequentFacts]takeMultiple [definition, in FOL.Reification.GeneralReflection]
TAllE [constructor, in FOL.Deduction.FragmentSequentFacts]
TAllI [constructor, in FOL.Deduction.FragmentSequentFacts]
TAllL [constructor, in FOL.Deduction.FragmentSequentFacts]
TAllR [constructor, in FOL.Deduction.FragmentSequentFacts]
TarskiCompleteness [library]
TarskiConstructions [library]
TarskiMerging [section, in FOL.Reification.GeneralReflection]
tarski_reflector_extensions [record, in FOL.Reification.GeneralReflection]
tarski_reflector [record, in FOL.Reification.GeneralReflection]
TAx [constructor, in FOL.Deduction.FragmentSequentFacts]
tblackbox [definition, in FOL.Proofmode.ProofMode]
tcons [definition, in FOL.Proofmode.ProofMode]
TContr [constructor, in FOL.Deduction.FragmentSequentFacts]
TCtx [constructor, in FOL.Deduction.FragmentSequentFacts]
TD_undec_ZF [lemma, in FOL.Incompleteness.Axiomatisations]
tembed [definition, in FOL.Deduction.FragmentSequentFacts]
Tennenbaum_inseparable [lemma, in FOL.Tennenbaum.Tennenbaum_insep]
Tennenbaum_diagonal_ct [lemma, in FOL.Tennenbaum.Tennenbaum_diagonal]
Tennenbaum_diagonal [lemma, in FOL.Tennenbaum.Tennenbaum_diagonal]
Tennenbaum_diagonal [library]
Tennenbaum_insep [library]
term [abbreviation, in FOL.Reification.GeneralReflection]
term [abbreviation, in FOL.Reification.GeneralReflection]
term [abbreviation, in FOL.Reification.GeneralReflection]
termFinderReifier [definition, in FOL.Reification.GeneralReflection]
termFinderVars [definition, in FOL.Reification.GeneralReflection]
termReifier [definition, in FOL.Reification.GeneralReflection]
termReifierNP [definition, in FOL.Reification.GeneralReflection]
termReifierReifyHelper [projection, in FOL.Reification.GeneralReflection]
termReifierVarHelper [projection, in FOL.Reification.GeneralReflection]
term_lt_dec [lemma, in FOL.Tennenbaum.Peano]
term_eq_dec [lemma, in FOL.Tennenbaum.Peano]
test [definition, in FOL.Reification.DemoPAExtensional]
TExp [constructor, in FOL.Deduction.FragmentSequentFacts]
tfprv [definition, in FOL.Deduction.FullSequent]
Theories [section, in FOL.Proofmode.Theories]
Theories [section, in FOL.Proofmode.Theories]
Theories [library]
Theories [library]
theory [definition, in FOL.Proofmode.Theories]
theory [definition, in FOL.Tennenbaum.Peano]
theta_mu [definition, in FOL.Incompleteness.epf_mu]
theta_self_return_enumerable [lemma, in FOL.Incompleteness.epf]
theta_self_return_semi_decidable [lemma, in FOL.Incompleteness.epf]
theta_self_return [definition, in FOL.Incompleteness.epf]
theta_mu_enumerable [lemma, in FOL.Incompleteness.ctq]
theta_ψ [lemma, in FOL.Incompleteness.ctq]
TIE [constructor, in FOL.Deduction.FragmentSequentFacts]
TII [constructor, in FOL.Deduction.FragmentSequentFacts]
TIL [constructor, in FOL.Deduction.FragmentSequentFacts]
TIR [constructor, in FOL.Deduction.FragmentSequentFacts]
tnil [definition, in FOL.Proofmode.ProofMode]
Top [definition, in FOL.Semantics.Heyting.Heyting]
top_hsat_L [lemma, in FOL.Semantics.Heyting.Heyting]
Top1 [lemma, in FOL.Semantics.Heyting.Heyting]
totalise [lemma, in FOL.Incompleteness.utils]
totalise_part [lemma, in FOL.Incompleteness.utils]
to_form_contradictory [lemma, in FOL.Completeness.EnumerationUtils]
to_form_closed [lemma, in FOL.Completeness.EnumerationUtils]
to_from_form [lemma, in FOL.Completeness.EnumerationUtils]
to_form [definition, in FOL.Completeness.EnumerationUtils]
tpm [definition, in FOL.Proofmode.ProofMode]
tprv [definition, in FOL.Proofmode.Theories]
tprv [inductive, in FOL.Deduction.FragmentSequentFacts]
tprv_enumerable [lemma, in FOL.Incompleteness.Axiomatisations]
tprv_intu [definition, in FOL.Incompleteness.Axiomatisations]
tprv_class [definition, in FOL.Incompleteness.Axiomatisations]
tprv_WeakClass [instance, in FOL.Proofmode.ProofMode]
tprv_FalsityDeductionRules [instance, in FOL.Proofmode.ProofMode]
tprv_ClassicalDeductionRules [instance, in FOL.Proofmode.ProofMode]
tprv_DeductionRules [instance, in FOL.Proofmode.ProofMode]
tprv_sind [definition, in FOL.Deduction.FragmentSequentFacts]
tprv_rec [definition, in FOL.Deduction.FragmentSequentFacts]
tprv_ind [definition, in FOL.Deduction.FragmentSequentFacts]
tprv_rect [definition, in FOL.Deduction.FragmentSequentFacts]
transitivity [lemma, in FOL.Tennenbaum.Peano]
treduction [definition, in FOL.Incompleteness.Axiomatisations]
trichotomy [lemma, in FOL.Tennenbaum.Peano]
tsprv [inductive, in FOL.Deduction.FragmentSequentFacts]
tsprv_sind [definition, in FOL.Deduction.FragmentSequentFacts]
tsprv_rec [definition, in FOL.Deduction.FragmentSequentFacts]
tsprv_ind [definition, in FOL.Deduction.FragmentSequentFacts]
tsprv_rect [definition, in FOL.Deduction.FragmentSequentFacts]
turnFalsityOn [definition, in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySyntactic]
turnFalsityOn_isΣΠf_ind [lemma, in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySyntactic]
turnFalsityOn_noQuant [lemma, in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySyntactic]
turnFalsityOn_eqiv [lemma, in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySyntactic]
tvalid [definition, in FOL.Incompleteness.Axiomatisations]
T_Pc [lemma, in FOL.Proofmode.Theories]
T_DE [lemma, in FOL.Proofmode.Theories]
T_DI2 [lemma, in FOL.Proofmode.Theories]
T_DI1 [lemma, in FOL.Proofmode.Theories]
T_CE2 [lemma, in FOL.Proofmode.Theories]
T_CE1 [lemma, in FOL.Proofmode.Theories]
T_CI [lemma, in FOL.Proofmode.Theories]
T_Ctx [lemma, in FOL.Proofmode.Theories]
T_Exp [lemma, in FOL.Proofmode.Theories]
T_ExE [lemma, in FOL.Proofmode.Theories]
T_ExI [lemma, in FOL.Proofmode.Theories]
T_AllE [lemma, in FOL.Proofmode.Theories]
T_AllI [lemma, in FOL.Proofmode.Theories]
T_IE [lemma, in FOL.Proofmode.Theories]
T_II [lemma, in FOL.Proofmode.Theories]
T_class_Q_to_H10p [lemma, in FOL.Incompleteness.PA_incompleteness]
T_prv_sig [lemma, in FOL.Completeness.TarskiCompleteness]
U
ub [definition, in FOL.Completeness.HeytingMacNeille]ub_join [lemma, in FOL.Completeness.HeytingMacNeille]
ub_proper [instance, in FOL.Completeness.HeytingMacNeille]
UC [definition, in FOL.Tennenbaum.SyntheticInType]
uCTQ [definition, in FOL.Incompleteness.ctq]
uctq_ctq [lemma, in FOL.Incompleteness.ctq]
UC_Discrete [lemma, in FOL.Tennenbaum.Variants]
UC_no_nonStd [lemma, in FOL.Tennenbaum.Variants]
UC_unary_DN_Dec' [lemma, in FOL.Tennenbaum.Variants]
UC_unary_DN_Dec [lemma, in FOL.Tennenbaum.Variants]
UC_Def_Dec [lemma, in FOL.Tennenbaum.SyntheticInType]
unary [definition, in FOL.Tennenbaum.Church]
unary [definition, in FOL.Tennenbaum.Coding]
unary [definition, in FOL.Tennenbaum.Formulas]
unary_DN_bounded_definite [lemma, in FOL.Tennenbaum.Variants]
unary_ext [lemma, in FOL.Tennenbaum.Variants]
unary_rosser [lemma, in FOL.Tennenbaum.HA_insep]
unboundEnv [definition, in FOL.Reification.GeneralReflection]
undec_class_T [lemma, in FOL.Incompleteness.PA_incompleteness]
undec_class_Q [lemma, in FOL.Incompleteness.PA_incompleteness]
undec_prv_class [lemma, in FOL.Incompleteness.Axiomatisations]
undec_class_binZ' [lemma, in FOL.Incompleteness.Axiomatisations]
undec_prv_intu [lemma, in FOL.Incompleteness.Axiomatisations]
undec_valid [lemma, in FOL.Incompleteness.Axiomatisations]
undec_binZ' [lemma, in FOL.Incompleteness.Axiomatisations]
undec_minZ' [lemma, in FOL.Incompleteness.Axiomatisations]
undec_ZF [lemma, in FOL.Incompleteness.Axiomatisations]
undec_Z [lemma, in FOL.Incompleteness.Axiomatisations]
undec_Z' [lemma, in FOL.Incompleteness.Axiomatisations]
undec_standard_valid [lemma, in FOL.Incompleteness.Axiomatisations]
undec_standard_prv [lemma, in FOL.Incompleteness.Axiomatisations]
undec_PA [lemma, in FOL.Incompleteness.Axiomatisations]
undec_Q [lemma, in FOL.Incompleteness.Axiomatisations]
undec_Q' [lemma, in FOL.Incompleteness.Axiomatisations]
unembed' [definition, in FOL.Incompleteness.ctq]
unembed'_embed' [lemma, in FOL.Incompleteness.ctq]
unfold_sless [lemma, in FOL.Tennenbaum.Peano]
union [definition, in FOL.Completeness.TarskiConstructions]
union_closed [lemma, in FOL.Completeness.TarskiConstructions]
union_econsistent [lemma, in FOL.Completeness.TarskiConstructions]
union_sub [lemma, in FOL.Completeness.TarskiConstructions]
union_f [lemma, in FOL.Completeness.TarskiConstructions]
unique [lemma, in FOL.Tennenbaum.NumberUtils]
Uniqueness [section, in FOL.Tennenbaum.NumberUtils]
Uniqueness.m [variable, in FOL.Tennenbaum.NumberUtils]
unitFunc [definition, in FOL.Proofmode.StringToIdent]
universal_interp_eval [lemma, in FOL.Completeness.KripkeCompleteness]
Unnamed_thm [definition, in FOL.Utils.PrenexNormalForm]
Unnamed_thm2 [definition, in FOL.Proofmode.DemoPA]
Unnamed_thm1 [definition, in FOL.Proofmode.DemoPA]
Unnamed_thm1 [definition, in FOL.Proofmode.DemoPA]
Unnamed_thm1 [definition, in FOL.Proofmode.DemoPA]
Unnamed_thm0 [definition, in FOL.Proofmode.DemoPA]
Unnamed_thm [definition, in FOL.Proofmode.DemoPA]
Unnamed_thm [definition, in FOL.Tennenbaum.NumberUtils]
Unnamed_thm [definition, in FOL.Tennenbaum.HA_insep]
Unnamed_thm0 [definition, in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySemantic]
Unnamed_thm [definition, in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySemantic]
upN [abbreviation, in FOL.Utils.PrenexNormalForm]
upNup [lemma, in FOL.Utils.PrenexNormalForm]
upN_explicit [lemma, in FOL.Utils.PrenexNormalForm]
up_equiv [lemma, in FOL.Utils.PrenexNormalForm]
up_decompose [lemma, in FOL.Tennenbaum.Peano]
up_n [definition, in FOL.Proofmode.ProofMode]
utils [library]
V
valid [definition, in FOL.Incompleteness.Abstract]valid [projection, in FOL.Incompleteness.utils]
valid_T_fragment [lemma, in FOL.Completeness.TarskiCompleteness]
valid_T_model_exploding [lemma, in FOL.Completeness.TarskiCompleteness]
valid_T_model_bot [lemma, in FOL.Completeness.TarskiCompleteness]
value_disjoint.weak_strong.φ2_syn [variable, in FOL.Incompleteness.weak_strong]
value_disjoint.weak_strong.φ1_syn [variable, in FOL.Incompleteness.weak_strong]
value_disjoint.weak_strong.φ2_qdec [variable, in FOL.Incompleteness.weak_strong]
value_disjoint.weak_strong.φ1_Σ [variable, in FOL.Incompleteness.weak_strong]
value_disjoint.weak_strong.φ2_bounded [variable, in FOL.Incompleteness.weak_strong]
value_disjoint.weak_strong.φ1_bounded [variable, in FOL.Incompleteness.weak_strong]
value_disjoint.weak_strong.φ2 [variable, in FOL.Incompleteness.weak_strong]
value_disjoint.weak_strong.φ1 [variable, in FOL.Incompleteness.weak_strong]
value_disjoint.weak_strong [section, in FOL.Incompleteness.weak_strong]
value_disjoint.value_disjoint'.φ2_syn [variable, in FOL.Incompleteness.weak_strong]
value_disjoint.value_disjoint'.φ1_syn [variable, in FOL.Incompleteness.weak_strong]
value_disjoint.value_disjoint'.φ2_qdec [variable, in FOL.Incompleteness.weak_strong]
value_disjoint.value_disjoint'.φ1_qdec [variable, in FOL.Incompleteness.weak_strong]
value_disjoint.value_disjoint'.φ2_bounded [variable, in FOL.Incompleteness.weak_strong]
value_disjoint.value_disjoint'.φ1_bounded [variable, in FOL.Incompleteness.weak_strong]
value_disjoint.value_disjoint'.φ2 [variable, in FOL.Incompleteness.weak_strong]
value_disjoint.value_disjoint'.φ1 [variable, in FOL.Incompleteness.weak_strong]
value_disjoint.value_disjoint' [section, in FOL.Incompleteness.weak_strong]
value_disjoint.P_disjoint [variable, in FOL.Incompleteness.weak_strong]
value_disjoint.P2 [variable, in FOL.Incompleteness.weak_strong]
value_disjoint.P1 [variable, in FOL.Incompleteness.weak_strong]
value_disjoint [section, in FOL.Incompleteness.weak_strong]
variant [projection, in FOL.Completeness.TarskiConstructions]
Variants [library]
varsBLC [definition, in FOL.Reification.DemoPAExtensional]
varsCoqEq [definition, in FOL.Reification.DemoPAExtensional]
vec [abbreviation, in FOL.Utils.PrenexNormalForm]
vec [abbreviation, in FOL.Proofmode.Theories]
vec [abbreviation, in FOL.Proofmode.Hoas]
vec [abbreviation, in FOL.ArithmeticalHierarchy.ArithmeticalHierarchyEquiv]
vec [abbreviation, in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySemantic]
vec [abbreviation, in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySyntactic]
VecForall2 [definition, in FOL.Proofmode.ProofMode]
vectorCons [abbreviation, in FOL.Reification.GeneralReflection]
vectorNil [abbreviation, in FOL.Reification.GeneralReflection]
vec_append1 [lemma, in FOL.Incompleteness.epf_mu]
vec_pos_default_append [lemma, in FOL.Incompleteness.epf_mu]
vec_pos_default_default [lemma, in FOL.Incompleteness.epf_mu]
vec_pos_default_fin [lemma, in FOL.Incompleteness.epf_mu]
vec_pos_default [definition, in FOL.Incompleteness.epf_mu]
vec_de_cons [lemma, in FOL.Tennenbaum.Peano]
vec_de_nil [lemma, in FOL.Tennenbaum.Peano]
vec_bEmbedT [definition, in FOL.Proofmode.Hoas]
vec_bEmbedT' [definition, in FOL.Proofmode.Hoas]
vec_bterm [definition, in FOL.Proofmode.Hoas]
vec_term [definition, in FOL.Proofmode.Hoas]
vec_map_preimage [lemma, in FOL.Tennenbaum.Formulas]
vec_to_env [definition, in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySyntactic]
vec_singleton [lemma, in FOL.Incompleteness.utils]
vec_2_inv [lemma, in FOL.Incompleteness.utils]
vec_1_inv [lemma, in FOL.Incompleteness.utils]
vec_0_nil [lemma, in FOL.Incompleteness.utils]
W
WCT_WRTs [lemma, in FOL.Tennenbaum.Church]WCT_Q [definition, in FOL.Tennenbaum.Church]
WCT_potentiall_Insep_form [lemma, in FOL.Tennenbaum.Tennenbaum_insep]
WCT_Insep_pred [lemma, in FOL.Tennenbaum.Tennenbaum_insep]
Weak [projection, in FOL.Proofmode.ProofMode]
Weak [constructor, in FOL.Deduction.FullSequent]
WeakClass [record, in FOL.Proofmode.ProofMode]
weaken [lemma, in FOL.Deduction.FullSequentFacts]
weakly_represents [definition, in FOL.Incompleteness.formal_systems]
weakly_representable_decidable [lemma, in FOL.Incompleteness.abstract_incompleteness]
weakly_representable_decidable' [lemma, in FOL.Incompleteness.abstract_incompleteness]
weakPost [lemma, in FOL.Utils.MPFacts]
weakPost [lemma, in FOL.Incompleteness.Abstract]
WeakT [lemma, in FOL.Proofmode.Theories]
WeakT [lemma, in FOL.Incompleteness.Axiomatisations]
weak_repr [definition, in FOL.Tennenbaum.Church]
weak_strong [lemma, in FOL.Incompleteness.weak_strong]
weak_strong' [lemma, in FOL.Incompleteness.weak_strong]
weak_strong [library]
Witnessing [definition, in FOL.Tennenbaum.SyntheticInType]
witnessing [definition, in FOL.Tennenbaum.SyntheticInType]
Witnessing_equiv [lemma, in FOL.Tennenbaum.SyntheticInType]
Witnessing_natnat [lemma, in FOL.Tennenbaum.MoreDecidabilityFacts]
Witnessing_nat [definition, in FOL.Tennenbaum.MoreDecidabilityFacts]
WRT_weak [definition, in FOL.Tennenbaum.Church]
WRT_strong [definition, in FOL.Tennenbaum.Church]
Z
zero_or_next [lemma, in FOL.Tennenbaum.CantorPairing]Zero_succ [lemma, in FOL.Tennenbaum.Peano]
zero_or_succ [lemma, in FOL.Tennenbaum.Peano]
zero_succ [lemma, in FOL.Tennenbaum.Peano]
ZF [definition, in FOL.Proofmode.DemoZF]
ZF [section, in FOL.Proofmode.DemoZF]
ZF_undec3 [lemma, in FOL.Incompleteness.Axiomatisations]
ZF_undec2 [lemma, in FOL.Incompleteness.Axiomatisations]
ZF_undec1 [lemma, in FOL.Incompleteness.Axiomatisations]
ZF_bunion_el2 [lemma, in FOL.Proofmode.DemoZF]
ZF_bunion_el1 [lemma, in FOL.Proofmode.DemoZF]
ZF_eq_sig [lemma, in FOL.Proofmode.DemoZF]
ZF_sig_el [lemma, in FOL.Proofmode.DemoZF]
ZF_eq_bunion [lemma, in FOL.Proofmode.DemoZF]
ZF_bunion_inv' [lemma, in FOL.Proofmode.DemoZF]
ZF_bunion_el' [lemma, in FOL.Proofmode.DemoZF]
ZF_eq_union [lemma, in FOL.Proofmode.DemoZF]
ZF_sub_union [lemma, in FOL.Proofmode.DemoZF]
ZF_union_el' [lemma, in FOL.Proofmode.DemoZF]
ZF_eq_pair' [lemma, in FOL.Proofmode.DemoZF]
ZF_sub_pair' [lemma, in FOL.Proofmode.DemoZF]
ZF_Leibniz [instance, in FOL.Proofmode.DemoZF]
ZF.p [variable, in FOL.Proofmode.DemoZF]
Z' [definition, in FOL.Incompleteness.Axiomatisations]
other
_ ↔ _ (hoas_scope) [notation, in FOL.Proofmode.Hoas]¬ _ (hoas_scope) [notation, in FOL.Proofmode.Hoas]
_ → _ (hoas_scope) [notation, in FOL.Proofmode.Hoas]
_ ∨ _ (hoas_scope) [notation, in FOL.Proofmode.Hoas]
_ ∧ _ (hoas_scope) [notation, in FOL.Proofmode.Hoas]
⊥ (hoas_scope) [notation, in FOL.Proofmode.Hoas]
∃' _ .. _ , _ (hoas_scope) [notation, in FOL.Proofmode.Hoas]
∀' _ .. _ , _ (hoas_scope) [notation, in FOL.Proofmode.Hoas]
Free _ .. _ , _ (hoas_scope) [notation, in FOL.Proofmode.Hoas]
_ ⧀ _ (PA_Notation) [notation, in FOL.Tennenbaum.Peano]
[notation, in FOL.Proofmode.ProofMode]
[notation, in FOL.Proofmode.ProofMode]
_ [notation, in FOL.Proofmode.ProofMode]
_ [notation, in FOL.Proofmode.ProofMode]
_ [notation, in FOL.Proofmode.ProofMode]
_ [notation, in FOL.Proofmode.ProofMode]
_ <= _ [notation, in FOL.Semantics.Heyting.Heyting]
_ >>= _ [notation, in FOL.Reification.GeneralReflection]
_ <- _ ;; _ [notation, in FOL.Reification.GeneralReflection]
_ ⋄ _ [notation, in FOL.Proofmode.Theories]
_ ⊑ _ [notation, in FOL.Proofmode.Theories]
_ ⊩I _ [notation, in FOL.Proofmode.Theories]
_ ⊩C _ [notation, in FOL.Proofmode.Theories]
_ ⊩ _ [notation, in FOL.Proofmode.Theories]
_ ⊏ _ [notation, in FOL.Proofmode.Theories]
_ t∈ _ [notation, in FOL.Proofmode.Theories]
_ ⊬F _ [notation, in FOL.Incompleteness.formal_systems]
_ ⊢F _ [notation, in FOL.Incompleteness.formal_systems]
_ ⊩SE _ [notation, in FOL.Deduction.FragmentSequent]
_ ;; _ ⊢sE _ [notation, in FOL.Deduction.FragmentSequent]
_ ⊢SE _ [notation, in FOL.Deduction.FragmentSequent]
_ ;; _ ⊢s _ [notation, in FOL.Deduction.FragmentSequent]
_ ⊢S _ [notation, in FOL.Deduction.FragmentSequent]
_ ∣ _ [notation, in FOL.Tennenbaum.Variants]
_ <<= _ [notation, in FOL.Tennenbaum.Variants]
_ el _ [notation, in FOL.Tennenbaum.Variants]
_ ∣ _ [notation, in FOL.Tennenbaum.Church]
_ <<= _ [notation, in FOL.Tennenbaum.Church]
_ el _ [notation, in FOL.Tennenbaum.Church]
_ ∣ _ [notation, in FOL.Tennenbaum.Tennenbaum_insep]
_ <<= _ [notation, in FOL.Tennenbaum.Tennenbaum_insep]
_ el _ [notation, in FOL.Tennenbaum.Tennenbaum_insep]
_ ∗ _ [notation, in FOL.Tennenbaum.Peano]
_ ∣ _ [notation, in FOL.Tennenbaum.Tennenbaum_diagonal]
_ ⪯T _ [notation, in FOL.Incompleteness.Axiomatisations]
_ ⊨T _ [notation, in FOL.Incompleteness.Axiomatisations]
_ ⊨=T _ [notation, in FOL.Incompleteness.Axiomatisations]
_ ⊨= _ [notation, in FOL.Incompleteness.Axiomatisations]
_ <<= _ [notation, in FOL.Incompleteness.Axiomatisations]
_ ≡ _ [notation, in FOL.Completeness.HeytingMacNeille]
_ ⊆ _ [notation, in FOL.Completeness.HeytingMacNeille]
_ ∈ _ [notation, in FOL.Completeness.HeytingMacNeille]
_ ∣ _ [notation, in FOL.Tennenbaum.Coding]
_ <<= _ [notation, in FOL.Tennenbaum.Coding]
_ el _ [notation, in FOL.Tennenbaum.Coding]
_ <=> _ [notation, in FOL.Tennenbaum.SyntheticInType]
_ ━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━ _ [notation, in FOL.Proofmode.ProofMode]
_ ━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━ _ [notation, in FOL.Proofmode.ProofMode]
_ _ : _ [notation, in FOL.Proofmode.ProofMode]
_ _ : _ [notation, in FOL.Proofmode.ProofMode]
_ ∣ _ [notation, in FOL.Tennenbaum.Formulas]
_ ⪯ₘ _ [notation, in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySemantic]
_ ⊢f _ [notation, in FOL.Deduction.FullSequentFacts]
_ ⊢f _ [notation, in FOL.Deduction.FullSequent]
_ -\ _ [notation, in FOL.Incompleteness.utils]
_ ▷ _ [notation, in FOL.Incompleteness.utils]
_ ; _ ⊨ _ [notation, in FOL.Incompleteness.fol_utils]
_ ⊨=L _ [notation, in FOL.Incompleteness.fol_utils]
partial _ [notation, in FOL.Incompleteness.utils]
PA⊨ _ [notation, in FOL.Tennenbaum.Peano]
<< _ [notation, in FOL.Proofmode.Hoas]
∀ _ .. _ , _ [notation, in FOL.Proofmode.ProofMode]
∃ _ .. _ , _ [notation, in FOL.Proofmode.ProofMode]
⊨ _ [notation, in FOL.Tennenbaum.Peano]
⋁ _ [notation, in FOL.Deduction.FullSequentFacts]
Π1 [inductive, in FOL.Incompleteness.sigma1]
Π1sem_notΣ1_MP_inv [lemma, in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySemantic]
Π1sem_notΣ1_MP [lemma, in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySemantic]
Π1_subst [lemma, in FOL.Incompleteness.sigma1]
Π1_sind [definition, in FOL.Incompleteness.sigma1]
Π1_ind [definition, in FOL.Incompleteness.sigma1]
Σ [definition, in FOL.Tennenbaum.CantorPairing]
Σ0sem_notΠ0_int [lemma, in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySemantic]
Σ1 [inductive, in FOL.Incompleteness.sigma1]
Σ1sem_notΠ1_int [lemma, in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySemantic]
Σ1syn_notΠ1_int [lemma, in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySyntactic]
Σ1_witness [lemma, in FOL.Incompleteness.sigma1]
Σ1_completeness [lemma, in FOL.Incompleteness.sigma1]
Σ1_soundness [lemma, in FOL.Incompleteness.sigma1]
Σ1_conservativity [lemma, in FOL.Incompleteness.sigma1]
Σ1_completeness_intu [lemma, in FOL.Incompleteness.sigma1]
Σ1_compression [lemma, in FOL.Incompleteness.sigma1]
Σ1_exist_times [lemma, in FOL.Incompleteness.sigma1]
Σ1_subst [lemma, in FOL.Incompleteness.sigma1]
Σ1_sind [definition, in FOL.Incompleteness.sigma1]
Σ1_ind [definition, in FOL.Incompleteness.sigma1]
Φ [definition, in FOL.Tennenbaum.Tennenbaum_insep]
φ1_sem [lemma, in FOL.Incompleteness.weak_strong]
φ1' [definition, in FOL.Incompleteness.weak_strong]
φ1'_qdec [lemma, in FOL.Incompleteness.weak_strong]
φ1'_bounded [lemma, in FOL.Incompleteness.weak_strong]
φ2_sem [lemma, in FOL.Incompleteness.weak_strong]
φ2' [definition, in FOL.Incompleteness.weak_strong]
φ2'_qdec [lemma, in FOL.Incompleteness.weak_strong]
φ2'_bounded [lemma, in FOL.Incompleteness.weak_strong]
ψ [definition, in FOL.Incompleteness.ctq]
ψ_equiv_2 [lemma, in FOL.Tennenbaum.Variants]
ψ_equiv_1 [lemma, in FOL.Tennenbaum.Variants]
ψ_equiv [lemma, in FOL.Tennenbaum.Coding]
ψ_repr [lemma, in FOL.Tennenbaum.Coding]
ψ_functional [lemma, in FOL.Incompleteness.ctq]
ψ_theta [lemma, in FOL.Incompleteness.ctq]
ψ_φ [lemma, in FOL.Incompleteness.ctq]
ψ_subst [lemma, in FOL.Incompleteness.ctq]
ψ_Σ1 [lemma, in FOL.Incompleteness.ctq]
ψ_bounded [lemma, in FOL.Incompleteness.ctq]
ψ' [definition, in FOL.Incompleteness.ctq]
ψ'_subst [lemma, in FOL.Incompleteness.ctq]
ψ'_Qdec [lemma, in FOL.Incompleteness.ctq]
ψ'_bounded [lemma, in FOL.Incompleteness.ctq]
Notation Index
A
_ ≡ _ [in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySyntactic]C
_ <~> _ (type_scope) [in FOL.Semantics.Heyting.Heyting]_ ∈ _ [in FOL.Tennenbaum.Abstract_coding]
F
_ <- _ ;; _ [in FOL.Reification.GeneralReflection]_ == _ (hoas_scope) [in FOL.Proofmode.DemoPA]
_ ⊗ _ (hoas_scope) [in FOL.Proofmode.DemoPA]
_ ⊕ _ (hoas_scope) [in FOL.Proofmode.DemoPA]
σ _ (hoas_scope) [in FOL.Proofmode.DemoPA]
_ ≤ _ [in FOL.Proofmode.DemoPA]
_ ⊢f _ [in FOL.Deduction.FullSequent]
G
_ ∘ _ [in FOL.Completeness.TarskiConstructions]_ ⊢TG _ [in FOL.Completeness.TarskiConstructions]
_ ⊢G _ [in FOL.Completeness.TarskiConstructions]
¬' _ [in FOL.Completeness.TarskiConstructions]
∃' _ [in FOL.Completeness.TarskiConstructions]
⊥' [in FOL.Completeness.TarskiConstructions]
_ ;; _ ⊢s _ [in FOL.Deduction.FragmentSequent]
_ ⊢S _ [in FOL.Deduction.FragmentSequent]
H
_ ≡ _ [in FOL.Semantics.Heyting.Heyting]D _ [in FOL.Tennenbaum.NumberUtils]
M _ [in FOL.Tennenbaum.NumberUtils]
K
_ ⊩⊥( _ , _ ) _ [in FOL.Completeness.KripkeCompleteness]_ ;; _ ⊢sC _ [in FOL.Completeness.KripkeCompleteness]
_ ⊢SC _ [in FOL.Completeness.KripkeCompleteness]
_ <<=C _ [in FOL.Completeness.KripkeCompleteness]
L
_ ⊢ _ [in FOL.Completeness.HeytingCompleteness]_ ⊢E _ [in FOL.Completeness.HeytingCompleteness]
M
_ ≡ _ [in FOL.Completeness.HeytingMacNeille]_ ⊆ _ [in FOL.Completeness.HeytingMacNeille]
_ ∈ _ [in FOL.Completeness.HeytingMacNeille]
_ i≤ _ [in FOL.Tennenbaum.Peano]
_ [[ _ ]] [in FOL.Tennenbaum.Peano]
i0 (PA_Notation) [in FOL.Tennenbaum.Peano]
_ ⊏ _ [in FOL.Tennenbaum.Peano]
_ ∈ _ [in FOL.Tennenbaum.Peano]
_ i⧀ _ [in FOL.Tennenbaum.Peano]
_ i⊗ _ [in FOL.Tennenbaum.Peano]
_ i⊕ _ [in FOL.Tennenbaum.Peano]
_ i= _ [in FOL.Tennenbaum.Peano]
iσ _ [in FOL.Tennenbaum.Peano]
⊨ _ [in FOL.Tennenbaum.Peano]
i0 (PA_Notation) [in FOL.Tennenbaum.Variants]
i0 (PA_Notation) [in FOL.Tennenbaum.Tennenbaum_insep]
i0 (PA_Notation) [in FOL.Tennenbaum.Tennenbaum_diagonal]
i0 (PA_Notation) [in FOL.Tennenbaum.Coding]
_ i⧀ _ [in FOL.Tennenbaum.Variants]
_ i⊗ _ [in FOL.Tennenbaum.Variants]
_ i⊕ _ [in FOL.Tennenbaum.Variants]
_ i= _ [in FOL.Tennenbaum.Variants]
_ i⧀ _ [in FOL.Tennenbaum.Tennenbaum_insep]
_ i⊗ _ [in FOL.Tennenbaum.Tennenbaum_insep]
_ i⊕ _ [in FOL.Tennenbaum.Tennenbaum_insep]
_ i= _ [in FOL.Tennenbaum.Tennenbaum_insep]
_ i⧀ _ [in FOL.Tennenbaum.Tennenbaum_diagonal]
_ i⊗ _ [in FOL.Tennenbaum.Tennenbaum_diagonal]
_ i⊕ _ [in FOL.Tennenbaum.Tennenbaum_diagonal]
_ i= _ [in FOL.Tennenbaum.Tennenbaum_diagonal]
_ i⧀ _ [in FOL.Tennenbaum.Coding]
_ i⊗ _ [in FOL.Tennenbaum.Coding]
_ i⊕ _ [in FOL.Tennenbaum.Coding]
_ i= _ [in FOL.Tennenbaum.Coding]
iσ _ [in FOL.Tennenbaum.Variants]
iσ _ [in FOL.Tennenbaum.Tennenbaum_insep]
iσ _ [in FOL.Tennenbaum.Tennenbaum_diagonal]
iσ _ [in FOL.Tennenbaum.Coding]
N⊨ _ [in FOL.Tennenbaum.Tennenbaum_diagonal]
⊨ _ [in FOL.Tennenbaum.Tennenbaum_diagonal]
P
_ ! [in FOL.Tennenbaum.NumberUtils]S
⋁ _ [in FOL.Deduction.FullSequentFacts]i0 (PA_Notation) [in FOL.Tennenbaum.Peano]
_ i⧀ _ [in FOL.Tennenbaum.Peano]
_ i⊗ _ [in FOL.Tennenbaum.Peano]
_ i⊕ _ [in FOL.Tennenbaum.Peano]
_ i= _ [in FOL.Tennenbaum.Peano]
iσ _ [in FOL.Tennenbaum.Peano]
other
_ ↔ _ (hoas_scope) [in FOL.Proofmode.Hoas]¬ _ (hoas_scope) [in FOL.Proofmode.Hoas]
_ → _ (hoas_scope) [in FOL.Proofmode.Hoas]
_ ∨ _ (hoas_scope) [in FOL.Proofmode.Hoas]
_ ∧ _ (hoas_scope) [in FOL.Proofmode.Hoas]
⊥ (hoas_scope) [in FOL.Proofmode.Hoas]
∃' _ .. _ , _ (hoas_scope) [in FOL.Proofmode.Hoas]
∀' _ .. _ , _ (hoas_scope) [in FOL.Proofmode.Hoas]
Free _ .. _ , _ (hoas_scope) [in FOL.Proofmode.Hoas]
_ ⧀ _ (PA_Notation) [in FOL.Tennenbaum.Peano]
[in FOL.Proofmode.ProofMode]
[in FOL.Proofmode.ProofMode]
_ [in FOL.Proofmode.ProofMode]
_ [in FOL.Proofmode.ProofMode]
_ [in FOL.Proofmode.ProofMode]
_ [in FOL.Proofmode.ProofMode]
_ <= _ [in FOL.Semantics.Heyting.Heyting]
_ >>= _ [in FOL.Reification.GeneralReflection]
_ <- _ ;; _ [in FOL.Reification.GeneralReflection]
_ ⋄ _ [in FOL.Proofmode.Theories]
_ ⊑ _ [in FOL.Proofmode.Theories]
_ ⊩I _ [in FOL.Proofmode.Theories]
_ ⊩C _ [in FOL.Proofmode.Theories]
_ ⊩ _ [in FOL.Proofmode.Theories]
_ ⊏ _ [in FOL.Proofmode.Theories]
_ t∈ _ [in FOL.Proofmode.Theories]
_ ⊬F _ [in FOL.Incompleteness.formal_systems]
_ ⊢F _ [in FOL.Incompleteness.formal_systems]
_ ⊩SE _ [in FOL.Deduction.FragmentSequent]
_ ;; _ ⊢sE _ [in FOL.Deduction.FragmentSequent]
_ ⊢SE _ [in FOL.Deduction.FragmentSequent]
_ ;; _ ⊢s _ [in FOL.Deduction.FragmentSequent]
_ ⊢S _ [in FOL.Deduction.FragmentSequent]
_ ∣ _ [in FOL.Tennenbaum.Variants]
_ <<= _ [in FOL.Tennenbaum.Variants]
_ el _ [in FOL.Tennenbaum.Variants]
_ ∣ _ [in FOL.Tennenbaum.Church]
_ <<= _ [in FOL.Tennenbaum.Church]
_ el _ [in FOL.Tennenbaum.Church]
_ ∣ _ [in FOL.Tennenbaum.Tennenbaum_insep]
_ <<= _ [in FOL.Tennenbaum.Tennenbaum_insep]
_ el _ [in FOL.Tennenbaum.Tennenbaum_insep]
_ ∗ _ [in FOL.Tennenbaum.Peano]
_ ∣ _ [in FOL.Tennenbaum.Tennenbaum_diagonal]
_ ⪯T _ [in FOL.Incompleteness.Axiomatisations]
_ ⊨T _ [in FOL.Incompleteness.Axiomatisations]
_ ⊨=T _ [in FOL.Incompleteness.Axiomatisations]
_ ⊨= _ [in FOL.Incompleteness.Axiomatisations]
_ <<= _ [in FOL.Incompleteness.Axiomatisations]
_ ≡ _ [in FOL.Completeness.HeytingMacNeille]
_ ⊆ _ [in FOL.Completeness.HeytingMacNeille]
_ ∈ _ [in FOL.Completeness.HeytingMacNeille]
_ ∣ _ [in FOL.Tennenbaum.Coding]
_ <<= _ [in FOL.Tennenbaum.Coding]
_ el _ [in FOL.Tennenbaum.Coding]
_ <=> _ [in FOL.Tennenbaum.SyntheticInType]
_ ━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━ _ [in FOL.Proofmode.ProofMode]
_ ━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━ _ [in FOL.Proofmode.ProofMode]
_ _ : _ [in FOL.Proofmode.ProofMode]
_ _ : _ [in FOL.Proofmode.ProofMode]
_ ∣ _ [in FOL.Tennenbaum.Formulas]
_ ⪯ₘ _ [in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySemantic]
_ ⊢f _ [in FOL.Deduction.FullSequentFacts]
_ ⊢f _ [in FOL.Deduction.FullSequent]
_ -\ _ [in FOL.Incompleteness.utils]
_ ▷ _ [in FOL.Incompleteness.utils]
_ ; _ ⊨ _ [in FOL.Incompleteness.fol_utils]
_ ⊨=L _ [in FOL.Incompleteness.fol_utils]
partial _ [in FOL.Incompleteness.utils]
PA⊨ _ [in FOL.Tennenbaum.Peano]
<< _ [in FOL.Proofmode.Hoas]
∀ _ .. _ , _ [in FOL.Proofmode.ProofMode]
∃ _ .. _ , _ [in FOL.Proofmode.ProofMode]
⊨ _ [in FOL.Tennenbaum.Peano]
⋁ _ [in FOL.Deduction.FullSequentFacts]
Module Index
C
CoqRosser [in FOL.Tennenbaum.HA_insep]D
DN [in FOL.Tennenbaum.DN_Utils]Variable Index
A
Abstract.consistency [in FOL.Incompleteness.Abstract]abstract.halt.fs' [in FOL.Incompleteness.abstract_incompleteness]
abstract.halt.Hext [in FOL.Incompleteness.abstract_incompleteness]
abstract.halt.Hrepr [in FOL.Incompleteness.abstract_incompleteness]
abstract.halt.Hrepr [in FOL.Incompleteness.abstract_incompleteness]
abstract.halt.r [in FOL.Incompleteness.abstract_incompleteness]
abstract.halt.r [in FOL.Incompleteness.abstract_incompleteness]
abstract.halt.snd [in FOL.Incompleteness.abstract_incompleteness]
abstract.insep.fs' [in FOL.Incompleteness.abstract_incompleteness]
abstract.insep.fs'_extension [in FOL.Incompleteness.abstract_incompleteness]
abstract.insep.Hrepr [in FOL.Incompleteness.abstract_incompleteness]
abstract.insep.Hrepr [in FOL.Incompleteness.abstract_incompleteness]
abstract.insep.Hrepr [in FOL.Incompleteness.abstract_incompleteness]
abstract.insep.r [in FOL.Incompleteness.abstract_incompleteness]
abstract.insep.r [in FOL.Incompleteness.abstract_incompleteness]
abstract.insep.r [in FOL.Incompleteness.abstract_incompleteness]
Abstract.models [in FOL.Incompleteness.Abstract]
Abstract.neg [in FOL.Incompleteness.Abstract]
Abstract.neg_inj [in FOL.Incompleteness.Abstract]
Abstract.neg_dec [in FOL.Incompleteness.Abstract]
Abstract.provable [in FOL.Incompleteness.Abstract]
Abstract.provable_enum [in FOL.Incompleteness.Abstract]
Abstract.Reduction.F [in FOL.Incompleteness.Abstract]
Abstract.Reduction.F_standard [in FOL.Incompleteness.Abstract]
Abstract.Reduction.F_provable [in FOL.Incompleteness.Abstract]
Abstract.Reduction.p [in FOL.Incompleteness.Abstract]
Abstract.Reduction.X [in FOL.Incompleteness.Abstract]
Abstract.sat [in FOL.Incompleteness.Abstract]
Abstract.sentences [in FOL.Incompleteness.Abstract]
Abstract.sentences_discrete [in FOL.Incompleteness.Abstract]
Abstract.soundness [in FOL.Incompleteness.Abstract]
Abstract.standard [in FOL.Incompleteness.Abstract]
Abstract.standard_exists [in FOL.Incompleteness.Abstract]
abstract.theta [in FOL.Incompleteness.abstract_incompleteness]
abstract.theta_universal [in FOL.Incompleteness.abstract_incompleteness]
ArithmeticalHierarchySemantic.list_vec_nat_inv [in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySemantic]
ArithmeticalHierarchySemantic.list_vec_to_nat [in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySemantic]
ArithmeticalHierarchySemantic.nat_list_vec_inv [in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySemantic]
ArithmeticalHierarchySemantic.nat_to_list_vec [in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySemantic]
ArithmeticalHierarchySemantic.nat_vec_inv [in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySemantic]
ArithmeticalHierarchySemantic.nat_to_vec [in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySemantic]
ArithmeticalHierarchySemantic.vec_nat_inv [in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySemantic]
ArithmeticalHierarchySemantic.vec_to_nat [in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySemantic]
Arithmetic.Model.D [in FOL.Incompleteness.PA_incompleteness]
Arithmetic.Model.ext_I [in FOL.Incompleteness.PA_incompleteness]
Arithmetic.Model.I [in FOL.Incompleteness.PA_incompleteness]
Arithmetic.Theory.Incl [in FOL.Incompleteness.PA_incompleteness]
Arithmetic.Theory.Std [in FOL.Incompleteness.PA_incompleteness]
Arithmetic.Theory.T [in FOL.Incompleteness.PA_incompleteness]
C
CHAEval.hinter_Pr [in FOL.Semantics.Heyting.Heyting]Coding.H_extend [in FOL.Tennenbaum.Abstract_coding]
Coding.H_empty [in FOL.Tennenbaum.Abstract_coding]
Coding.In [in FOL.Tennenbaum.Abstract_coding]
Completeness.BotModel.Hcon [in FOL.Completeness.TarskiCompleteness]
Completeness.BotModel.T [in FOL.Completeness.TarskiCompleteness]
Completeness.BotModel.T_closed [in FOL.Completeness.TarskiCompleteness]
Completeness.eF [in FOL.Completeness.TarskiCompleteness]
Completeness.eP [in FOL.Completeness.TarskiCompleteness]
Completeness.ExplodingCompletenessConstr.HT [in FOL.Completeness.TarskiCompleteness]
Completeness.ExplodingCompletenessConstr.T [in FOL.Completeness.TarskiCompleteness]
Completeness.FragmentModel.GBot [in FOL.Completeness.TarskiCompleteness]
Completeness.FragmentModel.GBot_closed [in FOL.Completeness.TarskiCompleteness]
Completeness.FragmentModel.T [in FOL.Completeness.TarskiCompleteness]
Completeness.FragmentModel.T_closed [in FOL.Completeness.TarskiCompleteness]
Completeness.MPStrongCompleteness.He [in FOL.Completeness.TarskiCompleteness]
Completeness.MPStrongCompleteness.Hphi [in FOL.Completeness.TarskiCompleteness]
Completeness.MPStrongCompleteness.HT [in FOL.Completeness.TarskiCompleteness]
Completeness.MPStrongCompleteness.mp [in FOL.Completeness.TarskiCompleteness]
Completeness.MPStrongCompleteness.phi [in FOL.Completeness.TarskiCompleteness]
Completeness.MPStrongCompleteness.T [in FOL.Completeness.TarskiCompleteness]
Completeness.MP_prop_Equivalence.T_sigma.A_matches_T [in FOL.Completeness.TarskiCompleteness]
Completeness.MP_prop_Equivalence.T_sigma.HA_T [in FOL.Completeness.TarskiCompleteness]
Completeness.MP_prop_Equivalence.T_sigma.A_T_cumul [in FOL.Completeness.TarskiCompleteness]
Completeness.MP_prop_Equivalence.T_sigma.A_T [in FOL.Completeness.TarskiCompleteness]
Completeness.MP_prop_Equivalence.T_sigma.T_cls [in FOL.Completeness.TarskiCompleteness]
Completeness.StandardCompleteness.Hphi [in FOL.Completeness.TarskiCompleteness]
Completeness.StandardCompleteness.HT [in FOL.Completeness.TarskiCompleteness]
Completeness.StandardCompleteness.phi [in FOL.Completeness.TarskiCompleteness]
Completeness.StandardCompleteness.T [in FOL.Completeness.TarskiCompleteness]
Consistency.Classical.XM [in FOL.Completeness.Consistency]
ContextUtil.p [in FOL.Proofmode.ProofMode]
ctq.theta [in FOL.Incompleteness.ctq]
ctq.theta_mu_universal [in FOL.Incompleteness.ctq]
ctq.theta_universal [in FOL.Incompleteness.ctq]
ctq.wrepr [in FOL.Incompleteness.ctq]
ctq.φ [in FOL.Incompleteness.ctq]
ctq.φ1_bounded [in FOL.Incompleteness.ctq]
ctq.φ1_qdec [in FOL.Incompleteness.ctq]
E
Enumeration.eF [in FOL.Completeness.EnumerationUtils]Enumeration.eP [in FOL.Completeness.EnumerationUtils]
epf.theta [in FOL.Incompleteness.epf]
epf.theta_universal [in FOL.Incompleteness.epf]
F
Fapply.p [in FOL.Proofmode.ProofMode]Fintro.p [in FOL.Proofmode.ProofMode]
FixSignature.Axiomatisations.enum_T [in FOL.Incompleteness.Axiomatisations]
FixSignature.Axiomatisations.T [in FOL.Incompleteness.Axiomatisations]
FixSignature.Reduction.f [in FOL.Incompleteness.Axiomatisations]
FixSignature.Reduction.hyp1 [in FOL.Incompleteness.Axiomatisations]
FixSignature.Reduction.hyp2 [in FOL.Incompleteness.Axiomatisations]
FixSignature.Reduction.hyp3 [in FOL.Incompleteness.Axiomatisations]
FixSignature.Reduction.P [in FOL.Incompleteness.Axiomatisations]
FixSignature.Reduction.standard [in FOL.Incompleteness.Axiomatisations]
FixSignature.Reduction.T [in FOL.Incompleteness.Axiomatisations]
FixSignature.Reduction.X [in FOL.Incompleteness.Axiomatisations]
fol_fs.p [in FOL.Incompleteness.fol_incompleteness]
fol.dprm.P [in FOL.Incompleteness.epf_mu]
fol.incomplete_strong_repr.Hrepr [in FOL.Incompleteness.fol_incompleteness]
fol.incomplete_strong_repr.r [in FOL.Incompleteness.fol_incompleteness]
fol.incomplete_strong_repr.T'enum [in FOL.Incompleteness.fol_incompleteness]
fol.incomplete_strong_repr.T'_T [in FOL.Incompleteness.fol_incompleteness]
fol.incomplete_strong_repr.T' [in FOL.Incompleteness.fol_incompleteness]
fol.incomplete_strong_repr.Tconsis [in FOL.Incompleteness.fol_incompleteness]
fol.incomplete_strong_repr.Tenum [in FOL.Incompleteness.fol_incompleteness]
fol.incomplete_strong_repr.T [in FOL.Incompleteness.fol_incompleteness]
fol.incomplete_strong_repr.theta_universal [in FOL.Incompleteness.fol_incompleteness]
fol.incomplete_strong_repr.theta [in FOL.Incompleteness.fol_incompleteness]
fol.incomplete_strong_repr.p [in FOL.Incompleteness.fol_incompleteness]
fol.Q_incomplete.Tconsis [in FOL.Incompleteness.fol_incompleteness]
fol.Q_incomplete.Tenum [in FOL.Incompleteness.fol_incompleteness]
fol.Q_incomplete.T_Q [in FOL.Incompleteness.fol_incompleteness]
fol.Q_incomplete.T [in FOL.Incompleteness.fol_incompleteness]
fol.Q_incomplete.ctq [in FOL.Incompleteness.fol_incompleteness]
fol.Q_incomplete.p [in FOL.Incompleteness.fol_incompleteness]
fol.Q_weakly_represents.Penum [in FOL.Incompleteness.epf_mu]
fol.Q_weakly_represents.P [in FOL.Incompleteness.epf_mu]
fol.Q_weakly_represents.mu_universal [in FOL.Incompleteness.epf_mu]
FullLogic.p [in FOL.Proofmode.DemoPA]
G
GenCons.Explosion.e [in FOL.Completeness.TarskiConstructions]GenCons.Explosion.Hclosed [in FOL.Completeness.TarskiConstructions]
GenCons.Explosion.He [in FOL.Completeness.TarskiConstructions]
GenCons.Explosion.T [in FOL.Completeness.TarskiConstructions]
GenCons.GBot [in FOL.Completeness.TarskiConstructions]
GenCons.GBot_closed [in FOL.Completeness.TarskiConstructions]
GenCons.Henkin.e [in FOL.Completeness.TarskiConstructions]
GenCons.Henkin.Hbounded [in FOL.Completeness.TarskiConstructions]
GenCons.Henkin.Hclosed [in FOL.Completeness.TarskiConstructions]
GenCons.Henkin.He [in FOL.Completeness.TarskiConstructions]
GenCons.Henkin.Hexp [in FOL.Completeness.TarskiConstructions]
GenCons.Henkin.T [in FOL.Completeness.TarskiConstructions]
GenCons.Omega.e [in FOL.Completeness.TarskiConstructions]
GenCons.Omega.He [in FOL.Completeness.TarskiConstructions]
GenCons.Omega.Hexp [in FOL.Completeness.TarskiConstructions]
GenCons.Omega.Hhenkin [in FOL.Completeness.TarskiConstructions]
GenCons.Omega.T [in FOL.Completeness.TarskiConstructions]
GenCons.Union.econsistent_f [in FOL.Completeness.TarskiConstructions]
GenCons.Union.f [in FOL.Completeness.TarskiConstructions]
GenCons.Union.f_le [in FOL.Completeness.TarskiConstructions]
Gentzen.Enumerability.enum_Preds' [in FOL.Deduction.FragmentSequentFacts]
Gentzen.Enumerability.enum_Funcs' [in FOL.Deduction.FragmentSequentFacts]
Gentzen.Enumerability.eq_dec_Preds [in FOL.Deduction.FragmentSequentFacts]
Gentzen.Enumerability.eq_dec_Funcs [in FOL.Deduction.FragmentSequentFacts]
Gentzen.Enumerability.list_Preds [in FOL.Deduction.FragmentSequentFacts]
Gentzen.Enumerability.list_Funcs [in FOL.Deduction.FragmentSequentFacts]
H
Homomorphism.m [in FOL.Tennenbaum.NumberUtils]L
Lindenbaum.Completeness.gAllE [in FOL.Completeness.HeytingCompleteness]Lindenbaum.Completeness.gAllI [in FOL.Completeness.HeytingCompleteness]
Lindenbaum.Completeness.gCE1 [in FOL.Completeness.HeytingCompleteness]
Lindenbaum.Completeness.gCE2 [in FOL.Completeness.HeytingCompleteness]
Lindenbaum.Completeness.gCI [in FOL.Completeness.HeytingCompleteness]
Lindenbaum.Completeness.gCtx [in FOL.Completeness.HeytingCompleteness]
Lindenbaum.Completeness.gDE [in FOL.Completeness.HeytingCompleteness]
Lindenbaum.Completeness.gDI1 [in FOL.Completeness.HeytingCompleteness]
Lindenbaum.Completeness.gDI2 [in FOL.Completeness.HeytingCompleteness]
Lindenbaum.Completeness.gExE [in FOL.Completeness.HeytingCompleteness]
Lindenbaum.Completeness.gExI [in FOL.Completeness.HeytingCompleteness]
Lindenbaum.Completeness.gExp [in FOL.Completeness.HeytingCompleteness]
Lindenbaum.Completeness.gIE [in FOL.Completeness.HeytingCompleteness]
Lindenbaum.Completeness.gII [in FOL.Completeness.HeytingCompleteness]
Lindenbaum.Completeness.gnameless_equiv_ex' [in FOL.Completeness.HeytingCompleteness]
Lindenbaum.Completeness.gnameless_equiv_all' [in FOL.Completeness.HeytingCompleteness]
Lindenbaum.Completeness.gprv [in FOL.Completeness.HeytingCompleteness]
Lindenbaum.Completeness.gWeak [in FOL.Completeness.HeytingCompleteness]
M
MinZF.p [in FOL.Proofmode.DemoMinZF]Models.D [in FOL.Tennenbaum.Peano]
Models.I [in FOL.Tennenbaum.Peano]
Models.PA_Model.Induction.pred [in FOL.Tennenbaum.Peano]
Models.PA_Model.Induction.phi [in FOL.Tennenbaum.Peano]
Model.axioms [in FOL.Tennenbaum.Tennenbaum_insep]
Model.axioms [in FOL.Tennenbaum.Tennenbaum_diagonal]
Model.axioms [in FOL.Tennenbaum.Coding]
Model.Coding.Hψ [in FOL.Tennenbaum.Coding]
Model.Coding.notStd.notStd [in FOL.Tennenbaum.Coding]
Model.Coding.notStd.stable_std [in FOL.Tennenbaum.Coding]
Model.Coding.ψ [in FOL.Tennenbaum.Coding]
Model.D [in FOL.Tennenbaum.Variants]
Model.D [in FOL.Tennenbaum.Tennenbaum_insep]
Model.D [in FOL.Tennenbaum.Tennenbaum_diagonal]
Model.D [in FOL.Tennenbaum.Coding]
Model.Hψ [in FOL.Tennenbaum.Variants]
Model.Hψ [in FOL.Tennenbaum.Tennenbaum_insep]
Model.Hψ [in FOL.Tennenbaum.Tennenbaum_diagonal]
Model.I [in FOL.Tennenbaum.Variants]
Model.I [in FOL.Tennenbaum.Tennenbaum_insep]
Model.I [in FOL.Tennenbaum.Tennenbaum_diagonal]
Model.I [in FOL.Tennenbaum.Coding]
Model.obj_Coding [in FOL.Tennenbaum.Variants]
Model.ψ [in FOL.Tennenbaum.Variants]
Model.ψ [in FOL.Tennenbaum.Tennenbaum_insep]
Model.ψ [in FOL.Tennenbaum.Tennenbaum_diagonal]
mu.mu_universal [in FOL.Incompleteness.epf_mu]
N
ND.p [in FOL.Tennenbaum.Peano]S
stdModel.axioms [in FOL.Tennenbaum.Peano]stdModel.D [in FOL.Tennenbaum.Peano]
stdModel.I [in FOL.Tennenbaum.Peano]
U
Uniqueness.m [in FOL.Tennenbaum.NumberUtils]V
value_disjoint.weak_strong.φ2_syn [in FOL.Incompleteness.weak_strong]value_disjoint.weak_strong.φ1_syn [in FOL.Incompleteness.weak_strong]
value_disjoint.weak_strong.φ2_qdec [in FOL.Incompleteness.weak_strong]
value_disjoint.weak_strong.φ1_Σ [in FOL.Incompleteness.weak_strong]
value_disjoint.weak_strong.φ2_bounded [in FOL.Incompleteness.weak_strong]
value_disjoint.weak_strong.φ1_bounded [in FOL.Incompleteness.weak_strong]
value_disjoint.weak_strong.φ2 [in FOL.Incompleteness.weak_strong]
value_disjoint.weak_strong.φ1 [in FOL.Incompleteness.weak_strong]
value_disjoint.value_disjoint'.φ2_syn [in FOL.Incompleteness.weak_strong]
value_disjoint.value_disjoint'.φ1_syn [in FOL.Incompleteness.weak_strong]
value_disjoint.value_disjoint'.φ2_qdec [in FOL.Incompleteness.weak_strong]
value_disjoint.value_disjoint'.φ1_qdec [in FOL.Incompleteness.weak_strong]
value_disjoint.value_disjoint'.φ2_bounded [in FOL.Incompleteness.weak_strong]
value_disjoint.value_disjoint'.φ1_bounded [in FOL.Incompleteness.weak_strong]
value_disjoint.value_disjoint'.φ2 [in FOL.Incompleteness.weak_strong]
value_disjoint.value_disjoint'.φ1 [in FOL.Incompleteness.weak_strong]
value_disjoint.P_disjoint [in FOL.Incompleteness.weak_strong]
value_disjoint.P2 [in FOL.Incompleteness.weak_strong]
value_disjoint.P1 [in FOL.Incompleteness.weak_strong]
Z
ZF.p [in FOL.Proofmode.DemoZF]Library Index
A
Abstractabstract_incompleteness
Abstract_coding
ArithmeticalHierarchyEquiv
ArithmeticalHierarchySemantic
ArithmeticalHierarchySyntactic
Arithmetics
Axiomatisations
B
bin_qdecC
CantorPairingChurch
Coding
Consistency
ctq
D
DemoMinZFDemoPA
DemoPA
DemoPAExtensional
DemoZF
DN_Utils
E
EnumerationUtilsepf
epf_mu
F
FiniteSetsfol_utils
fol_incompleteness
formal_systems
Formulas
FragmentSequent
FragmentSequentFacts
FragmentSyntax
FullSequent
FullSequentFacts
FullSyntax
G
GeneralReflectionH
HA_insepHeyting
HeytingCompleteness
HeytingMacNeille
Hoas
K
KripkeCompletenessM
MoreDecidabilityFactsMPFacts
N
NumberUtilsP
PA_incompletenessPeano
PrenexNormalForm
ProofMode
Q
qdecS
Setssigma1
Soundness
StringToIdent
SyntheticInType
T
TarskiCompletenessTarskiConstructions
Tennenbaum_diagonal
Tennenbaum_insep
Theories
Theories
U
utilsV
VariantsW
weak_strongLemma Index
A
abstr_complete_decidable [in FOL.Incompleteness.Abstract]abs_reduction_theorem [in FOL.Incompleteness.Abstract]
add_assoc [in FOL.Reification.DemoPA]
add_comm [in FOL.Reification.DemoPA]
add_succ_r [in FOL.Reification.DemoPA]
add_zero_r [in FOL.Reification.DemoPA]
add_zero_l [in FOL.Reification.DemoPA]
add_succ_l [in FOL.Reification.DemoPA]
add_comm [in FOL.Proofmode.DemoPA]
add_succ_r [in FOL.Proofmode.DemoPA]
add_zero_r [in FOL.Proofmode.DemoPA]
add_zero_num [in FOL.Incompleteness.qdec]
add_rec_swap2 [in FOL.Incompleteness.qdec]
add_rec_swap [in FOL.Incompleteness.qdec]
add_zero_swap [in FOL.Incompleteness.qdec]
Add_rec [in FOL.Tennenbaum.Peano]
add_le_mono [in FOL.Tennenbaum.Peano]
add_lt_mono [in FOL.Tennenbaum.Peano]
add_eq [in FOL.Tennenbaum.Peano]
add_asso [in FOL.Tennenbaum.Peano]
add_comm [in FOL.Tennenbaum.Peano]
add_rec_r [in FOL.Tennenbaum.Peano]
add_zero_r [in FOL.Tennenbaum.Peano]
add_rec [in FOL.Tennenbaum.Peano]
add_zero [in FOL.Tennenbaum.Peano]
add_assoc [in FOL.Reification.DemoPAExtensional]
add_comm [in FOL.Reification.DemoPAExtensional]
add_succ_r [in FOL.Reification.DemoPAExtensional]
add_zero_r [in FOL.Reification.DemoPAExtensional]
add_zero_l [in FOL.Reification.DemoPAExtensional]
add_succ_l [in FOL.Reification.DemoPAExtensional]
AllEquivAll [in FOL.Utils.PrenexNormalForm]
and_ldec [in FOL.Completeness.TarskiCompleteness]
arbitrary_completeness_is_MP_prop [in FOL.Completeness.TarskiCompleteness]
arbitrary_completeness_is_LEM [in FOL.Completeness.TarskiCompleteness]
B
bcompleteness [in FOL.Completeness.HeytingCompleteness]Bij_Nat_NatNat [in FOL.Tennenbaum.CantorPairing]
bin_bounded_forall_iff [in FOL.Incompleteness.bin_qdec]
boolean_completion [in FOL.Completeness.HeytingCompleteness]
bot_deriv_stable_k [in FOL.Completeness.KripkeCompleteness]
bot_valid_stable [in FOL.Completeness.KripkeCompleteness]
bot_deriv_stable_enum_k [in FOL.Completeness.KripkeCompleteness]
bot_closed [in FOL.Incompleteness.Abstract]
bot_deriv_stable_enum [in FOL.Completeness.TarskiCompleteness]
bot_deriv_stable_Sigma_0_1 [in FOL.Completeness.TarskiCompleteness]
bot_deriv_stable [in FOL.Completeness.TarskiCompleteness]
bot_valid_stable [in FOL.Completeness.TarskiCompleteness]
bounded_closed [in FOL.Incompleteness.Abstract]
bounded_coding [in FOL.Tennenbaum.Abstract_coding]
bounded_exist_times [in FOL.Incompleteness.sigma1]
BSoundness [in FOL.Semantics.Heyting.Soundness]
BSoundness' [in FOL.Semantics.Heyting.Soundness]
bunion_swap [in FOL.Proofmode.DemoZF]
bunion_eset [in FOL.Proofmode.DemoZF]
C
CantorBound [in FOL.Tennenbaum.CantorPairing]case_help_T [in FOL.Proofmode.ProofMode]
case_help [in FOL.Proofmode.ProofMode]
cast_embed [in FOL.Incompleteness.PA_incompleteness]
cast_extists_eq [in FOL.Incompleteness.PA_incompleteness]
CE_undec_Z [in FOL.Incompleteness.Axiomatisations]
CE_undec_Z' [in FOL.Incompleteness.Axiomatisations]
class_Q_to_H10p [in FOL.Incompleteness.PA_incompleteness]
clb_alg_boolean [in FOL.Completeness.HeytingCompleteness]
closed_term_is_num [in FOL.Tennenbaum.Peano]
closed_enum [in FOL.Incompleteness.Abstract]
closed_discrete [in FOL.Incompleteness.Abstract]
closed_dec [in FOL.Incompleteness.Abstract]
closed_mere [in FOL.Incompleteness.Abstract]
closed_num [in FOL.Tennenbaum.Formulas]
closed_term_is_num [in FOL.Incompleteness.fol_utils]
code_next [in FOL.Tennenbaum.CantorPairing]
Coding_Dec_ct [in FOL.Tennenbaum.Tennenbaum_diagonal]
Coding_Dec [in FOL.Tennenbaum.Tennenbaum_diagonal]
Coding_nonstd_binary [in FOL.Tennenbaum.Coding]
Coding_nonStd_unary [in FOL.Tennenbaum.Coding]
Coding_model_binary [in FOL.Tennenbaum.Coding]
Coding_model_unary [in FOL.Tennenbaum.Coding]
Coding_nat [in FOL.Tennenbaum.Coding]
Coding_nat' [in FOL.Tennenbaum.Coding]
completeness_decidable [in FOL.Incompleteness.Abstract]
completeness_standard_stability' [in FOL.Completeness.TarskiCompleteness]
completeness_classical_stability [in FOL.Completeness.TarskiCompleteness]
completeness_standard_stability [in FOL.Completeness.TarskiCompleteness]
complete_decidable [in FOL.Incompleteness.formal_systems]
complete_reduction [in FOL.Incompleteness.Axiomatisations]
complete_decidable [in FOL.Incompleteness.Axiomatisations]
compress_free3 [in FOL.Incompleteness.ctq]
compress_free [in FOL.Incompleteness.ctq]
consistency_inheritance [in FOL.Completeness.Consistency]
consistent_max_out2 [in FOL.Completeness.Consistency]
consistent_max_impl [in FOL.Completeness.Consistency]
consistent_max_out [in FOL.Completeness.Consistency]
consistent_neg2 [in FOL.Completeness.Consistency]
consistent_neg [in FOL.Completeness.Consistency]
consistent_prv [in FOL.Completeness.Consistency]
consistent_join_step [in FOL.Completeness.TarskiConstructions]
construct_construction [in FOL.Completeness.TarskiConstructions]
contains_rem [in FOL.Proofmode.Theories]
contains_extend3 [in FOL.Proofmode.Theories]
contains_extend2 [in FOL.Proofmode.Theories]
contains_extend1 [in FOL.Proofmode.Theories]
contains_app [in FOL.Proofmode.Theories]
contains_cons2 [in FOL.Proofmode.Theories]
contains_cons [in FOL.Proofmode.Theories]
contains_nil [in FOL.Proofmode.Theories]
context_shift [in FOL.Deduction.FullSequentFacts]
contradiction_help_T [in FOL.Proofmode.ProofMode]
contradiction_help [in FOL.Proofmode.ProofMode]
convert_PNF_PNF [in FOL.Utils.PrenexNormalForm]
conv_form_noQuant [in FOL.Utils.PrenexNormalForm]
CoqRosser.rosser_disj [in FOL.Tennenbaum.HA_insep]
CoqRosser.rosser_equiv [in FOL.Tennenbaum.HA_insep]
ctq_strong_sepr [in FOL.Incompleteness.ctq]
ctq_weak_repr [in FOL.Incompleteness.ctq]
ctq_epfn [in FOL.Incompleteness.ctq]
ctq_ctq_total [in FOL.Incompleteness.ctq]
ctx_in [in FOL.Deduction.FullSequentFacts]
ctx_out [in FOL.Deduction.FullSequentFacts]
CT_RTw [in FOL.Tennenbaum.Church]
CT_RTs [in FOL.Tennenbaum.Church]
CT_WCT [in FOL.Tennenbaum.Church]
CT_Insep_form [in FOL.Tennenbaum.Tennenbaum_insep]
CT_Insep_pred [in FOL.Tennenbaum.Tennenbaum_insep]
cumul_list_max [in FOL.Completeness.TarskiCompleteness]
curry [in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySemantic]
curry_to_uncurry [in FOL.Tennenbaum.HA_insep]
curry0 [in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySemantic]
curry1 [in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySemantic]
curry2 [in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySemantic]
cutfree_seq_ND [in FOL.Deduction.FragmentSequentFacts]
cycle_shift_subject [in FOL.Deduction.FullSequentFacts]
cycle_shift_shift [in FOL.Deduction.FullSequentFacts]
D
dec_contraposition [in FOL.Tennenbaum.Tennenbaum_diagonal]dec_div_2 [in FOL.Tennenbaum.Tennenbaum_diagonal]
dec_div [in FOL.Tennenbaum.Tennenbaum_diagonal]
Dec_sigT_prime [in FOL.Tennenbaum.NumberUtils]
dec_irred_factor [in FOL.Tennenbaum.NumberUtils]
dec_irred_factor' [in FOL.Tennenbaum.NumberUtils]
dec_help_2 [in FOL.Tennenbaum.NumberUtils]
dec_help_1 [in FOL.Tennenbaum.NumberUtils]
Dec_sigT_irred [in FOL.Tennenbaum.NumberUtils]
dec_help_1 [in FOL.Incompleteness.Abstract]
Dec_equivalent_predicates [in FOL.Tennenbaum.SyntheticInType]
dec_Dec_sig_T [in FOL.Tennenbaum.SyntheticInType]
Dec_sigT_decider [in FOL.Tennenbaum.SyntheticInType]
Dec_decider_nat [in FOL.Tennenbaum.SyntheticInType]
Dec_transport [in FOL.Tennenbaum.SyntheticInType]
Dec_decider [in FOL.Tennenbaum.SyntheticInType]
dec_lt_bounded_forall [in FOL.Tennenbaum.MoreDecidabilityFacts]
dec_lt_bounded_exist [in FOL.Tennenbaum.MoreDecidabilityFacts]
dec_lt_bounded_exist' [in FOL.Tennenbaum.MoreDecidabilityFacts]
dec_lt_bounded_sig [in FOL.Tennenbaum.MoreDecidabilityFacts]
Dec_sigT_transport [in FOL.Tennenbaum.MoreDecidabilityFacts]
dec_in_ex [in FOL.Completeness.TarskiCompleteness]
decΣ1syn_incl_1 [in FOL.ArithmeticalHierarchy.ArithmeticalHierarchyEquiv]
decΣ1syn_decΔ1syn [in FOL.ArithmeticalHierarchy.ArithmeticalHierarchyEquiv]
Delta1_absoluteness [in FOL.Tennenbaum.Tennenbaum_insep]
Discrete_sum [in FOL.Tennenbaum.SyntheticInType]
Discrete_equiv [in FOL.Tennenbaum.SyntheticInType]
discriminate [in FOL.Reification.DemoPA]
discriminate [in FOL.Reification.DemoPAExtensional]
Disjoint_AB [in FOL.Tennenbaum.Tennenbaum_insep]
distributive [in FOL.Tennenbaum.Peano]
Divides_num [in FOL.Tennenbaum.Coding]
division_theorem [in FOL.Proofmode.DemoPA]
Div_lt [in FOL.Tennenbaum.NumberUtils]
DN [in FOL.Tennenbaum.SyntheticInType]
DNE_Overspill [in FOL.Tennenbaum.Coding]
DN_to_IndependenceOfGeneralPremises [in FOL.Utils.PrenexNormalForm]
DN_bounded_lem [in FOL.Tennenbaum.Coding]
DN_Dec_equiv [in FOL.Tennenbaum.SyntheticInType]
DN_forall_stable [in FOL.Tennenbaum.SyntheticInType]
DN_chaining [in FOL.Tennenbaum.SyntheticInType]
DN_remove [in FOL.Tennenbaum.SyntheticInType]
DN_coding [in FOL.Tennenbaum.Abstract_coding]
DN_bounded_lem [in FOL.Tennenbaum.Abstract_coding]
DN_Markov [in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySemantic]
down_inf [in FOL.Completeness.HeytingMacNeille]
down_impl [in FOL.Completeness.HeytingMacNeille]
down_join [in FOL.Completeness.HeytingMacNeille]
down_meet [in FOL.Completeness.HeytingMacNeille]
down_top [in FOL.Completeness.HeytingMacNeille]
down_bot [in FOL.Completeness.HeytingMacNeille]
down_mono [in FOL.Completeness.HeytingMacNeille]
down_inj [in FOL.Completeness.HeytingMacNeille]
down_normal [in FOL.Completeness.HeytingMacNeille]
dprm_definable [in FOL.Incompleteness.epf_mu]
DR1 [in FOL.Incompleteness.weak_strong]
DR1' [in FOL.Incompleteness.weak_strong]
DR2 [in FOL.Incompleteness.weak_strong]
D_eq_dec [in FOL.Tennenbaum.Peano]
E
econsistency_trans [in FOL.Completeness.TarskiConstructions]econsistency_inheritance [in FOL.Completeness.TarskiConstructions]
econsistent_prv [in FOL.Completeness.TarskiConstructions]
econsistent_Omega [in FOL.Completeness.TarskiConstructions]
econsistent_join_sub [in FOL.Completeness.TarskiConstructions]
embed_eval [in FOL.Incompleteness.epf_mu]
embed_poly_bound [in FOL.Incompleteness.epf_mu]
embed'_unembed' [in FOL.Incompleteness.ctq]
embed'_expl [in FOL.Incompleteness.ctq]
enumerable_Q_prv [in FOL.Tennenbaum.Tennenbaum_insep]
enumerable_equiv [in FOL.Incompleteness.Axiomatisations]
enumerable_equiv [in FOL.Incompleteness.Abstract]
enumerable_surjection [in FOL.Tennenbaum.SyntheticInType]
enumerable_equiv [in FOL.Tennenbaum.SyntheticInType]
enumerable_nat [in FOL.Tennenbaum.SyntheticInType]
enumerable_completeness_is_MP [in FOL.Completeness.TarskiCompleteness]
enumerable_separable [in FOL.Incompleteness.utils]
enumT_quantop [in FOL.Deduction.FragmentSequentFacts]
enumT_binop [in FOL.Deduction.FragmentSequentFacts]
enum_stprv [in FOL.Deduction.FragmentSequentFacts]
enum_sprv [in FOL.Deduction.FragmentSequentFacts]
epf_nat_bool [in FOL.Incompleteness.epf]
epf_mu_ctq [in FOL.Incompleteness.ctq]
epf_mu_uctq [in FOL.Incompleteness.ctq]
epf_n_uctq [in FOL.Incompleteness.ctq]
eqhd [in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySemantic]
eqtl [in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySemantic]
equivToCoq [in FOL.Utils.PrenexNormalForm]
equivTrans [in FOL.Utils.PrenexNormalForm]
equiv_subst [in FOL.Tennenbaum.Tennenbaum_insep]
equiv_sdec_functions [in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySemantic]
equiv_DN_sdec [in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySemantic]
eq_mult [in FOL.Tennenbaum.Peano]
eq_add [in FOL.Tennenbaum.Peano]
eq_succ [in FOL.Tennenbaum.Peano]
eq_trans [in FOL.Tennenbaum.Peano]
eq_sym [in FOL.Tennenbaum.Peano]
eq_subst_help [in FOL.Proofmode.ProofMode]
erase_ra_rel [in FOL.Incompleteness.epf_mu]
eval_num [in FOL.Tennenbaum.Peano]
eval_ident [in FOL.Completeness.TarskiCompleteness]
example [in FOL.Reification.DemoPA]
ExEquivEx [in FOL.Utils.PrenexNormalForm]
exists_fin_disj [in FOL.Incompleteness.qdec]
exists_compression [in FOL.Incompleteness.sigma1]
exists_compression_2 [in FOL.Incompleteness.sigma1]
exist_times_Σ1 [in FOL.Incompleteness.sigma1]
exploding_inherit [in FOL.Completeness.TarskiConstructions]
Exp_exploding [in FOL.Completeness.TarskiConstructions]
Exp_closed [in FOL.Completeness.TarskiConstructions]
Exp_econsistent [in FOL.Completeness.TarskiConstructions]
Exp_sub [in FOL.Completeness.TarskiConstructions]
exp_axiom_lift [in FOL.Completeness.TarskiConstructions]
exp_axiom_closed [in FOL.Completeness.TarskiConstructions]
extensional_Πsyn [in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySyntactic]
extensional_Σsyn [in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySyntactic]
extract_from_class [in FOL.Incompleteness.PA_incompleteness]
F
Factor [in FOL.Tennenbaum.NumberUtils]factorial_divisible [in FOL.Tennenbaum.NumberUtils]
factorial_divisible_n [in FOL.Tennenbaum.NumberUtils]
factorial_positive [in FOL.Tennenbaum.NumberUtils]
Fac_eq [in FOL.Tennenbaum.NumberUtils]
Fac_unique [in FOL.Tennenbaum.NumberUtils]
fapply_equiv_r_T [in FOL.Proofmode.ProofMode]
fapply_equiv_l_T [in FOL.Proofmode.ProofMode]
fapply_equiv_r [in FOL.Proofmode.ProofMode]
fapply_equiv_l [in FOL.Proofmode.ProofMode]
fassert_help_T [in FOL.Proofmode.ProofMode]
fassert_help [in FOL.Proofmode.ProofMode]
fdestruct_discharge_premises_T [in FOL.Proofmode.ProofMode]
fdestruct_discharge_premises [in FOL.Proofmode.ProofMode]
fin_to_n_bound [in FOL.Incompleteness.epf_mu]
fin_disj_subst [in FOL.Incompleteness.qdec]
focus_el [in FOL.Deduction.FullSequentFacts]
fol_incomplete_strong_repr [in FOL.Incompleteness.fol_incompleteness]
fol_undecidable_strong_repr [in FOL.Incompleteness.fol_incompleteness]
forall_bound_iff [in FOL.Incompleteness.qdec]
forall_fin_disj_conj [in FOL.Incompleteness.qdec]
forall__neg_exists_neg [in FOL.Tennenbaum.SyntheticInType]
form_default_is_bounded [in FOL.Completeness.EnumerationUtils]
form_default_is_enum [in FOL.Completeness.EnumerationUtils]
form_list_bounded_is_enum [in FOL.Completeness.EnumerationUtils]
form_list_is_enum [in FOL.Completeness.EnumerationUtils]
form_enumerable [in FOL.Incompleteness.Axiomatisations]
form_discrete [in FOL.Incompleteness.Axiomatisations]
frewrite_equiv_switch_T [in FOL.Proofmode.ProofMode]
frewrite_equiv_quant_T [in FOL.Proofmode.ProofMode]
frewrite_equiv_bin_lr_T [in FOL.Proofmode.ProofMode]
frewrite_equiv_bin_r_T [in FOL.Proofmode.ProofMode]
frewrite_equiv_bin_l_T [in FOL.Proofmode.ProofMode]
frewrite_equiv_switch [in FOL.Proofmode.ProofMode]
frewrite_equiv_quant [in FOL.Proofmode.ProofMode]
frewrite_equiv_bin_lr [in FOL.Proofmode.ProofMode]
frewrite_equiv_bin_r [in FOL.Proofmode.ProofMode]
frewrite_equiv_bin_l [in FOL.Proofmode.ProofMode]
from_to_form [in FOL.Completeness.EnumerationUtils]
Fr_embed [in FOL.Incompleteness.PA_incompleteness]
Fr_exists_eq [in FOL.Incompleteness.PA_incompleteness]
fun_ext_prop_ext [in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySemantic]
G
gaussian_sum [in FOL.Incompleteness.ctq]GDN [in FOL.Completeness.TarskiConstructions]
GDP [in FOL.Completeness.TarskiConstructions]
general_post_dec [in FOL.Incompleteness.utils]
general_post [in FOL.Incompleteness.utils]
GExE [in FOL.Completeness.TarskiConstructions]
GExI [in FOL.Completeness.TarskiConstructions]
GExp [in FOL.Completeness.TarskiConstructions]
glb_calg_iff [in FOL.Completeness.HeytingCompleteness]
glb_alg_iff [in FOL.Completeness.HeytingCompleteness]
glindenbaum_eqH [in FOL.Completeness.HeytingCompleteness]
glindenbaum_hsat [in FOL.Completeness.HeytingCompleteness]
GXM [in FOL.Completeness.TarskiConstructions]
H
halt_incompleteness [in FOL.Incompleteness.abstract_incompleteness]halt_incompleteness' [in FOL.Incompleteness.abstract_incompleteness]
halt_undecidability [in FOL.Incompleteness.abstract_incompleteness]
HA_Insep_undec [in FOL.Tennenbaum.Variants]
HA_Insep [in FOL.Tennenbaum.Variants]
hcompleteness [in FOL.Completeness.HeytingCompleteness]
Henkin_T [in FOL.Completeness.TarskiConstructions]
Henkin_is_Henkin [in FOL.Completeness.TarskiConstructions]
Henkin_consistent [in FOL.Completeness.TarskiConstructions]
henkin_le [in FOL.Completeness.TarskiConstructions]
henkin_bounded [in FOL.Completeness.TarskiConstructions]
henkin_axiom_bounded [in FOL.Completeness.TarskiConstructions]
hom_agree_inu [in FOL.Tennenbaum.Peano]
hset_inf1 [in FOL.Completeness.HeytingMacNeille]
hset_impl1 [in FOL.Completeness.HeytingMacNeille]
hset_join1 [in FOL.Completeness.HeytingMacNeille]
hset_meet1 [in FOL.Completeness.HeytingMacNeille]
hset_bot1 [in FOL.Completeness.HeytingMacNeille]
hset_impl_normal [in FOL.Completeness.HeytingMacNeille]
hset_impl_equiv [in FOL.Completeness.HeytingMacNeille]
hset_inf_normal [in FOL.Completeness.HeytingMacNeille]
hset_join_normal [in FOL.Completeness.HeytingMacNeille]
hset_meet_normal [in FOL.Completeness.HeytingMacNeille]
hset_bot_normal [in FOL.Completeness.HeytingMacNeille]
H10p_to_class_Q [in FOL.Incompleteness.PA_incompleteness]
I
ieq_congr_add [in FOL.Reification.DemoPA]ieq_congr_succ [in FOL.Reification.DemoPA]
ieq_trans [in FOL.Reification.DemoPA]
ieq_sym [in FOL.Reification.DemoPA]
ieq_refl [in FOL.Reification.DemoPA]
iEuclid [in FOL.Tennenbaum.Peano]
iEuclid' [in FOL.Tennenbaum.Peano]
iFac_unique [in FOL.Tennenbaum.Peano]
iFac_unique1 [in FOL.Tennenbaum.Peano]
iff_iff [in FOL.Incompleteness.weak_strong]
implication_neg_swap [in FOL.Tennenbaum.HA_insep]
Imp_bot [in FOL.Semantics.Heyting.Heyting]
Imp2 [in FOL.Semantics.Heyting.Heyting]
inclusionΣinΣ1andΠinΠi_syn [in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySyntactic]
incl_rem2 [in FOL.Proofmode.Theories]
incl_rem1 [in FOL.Proofmode.Theories]
incompleteness [in FOL.Incompleteness.Abstract]
incompleteness_Q [in FOL.Incompleteness.PA_incompleteness]
incompleteness_ZF [in FOL.Incompleteness.Axiomatisations]
incompleteness_PA [in FOL.Incompleteness.Axiomatisations]
inconsistent [in FOL.Completeness.Consistency]
induction [in FOL.Tennenbaum.Peano]
induction1 [in FOL.Tennenbaum.Peano]
induction2 [in FOL.Tennenbaum.Peano]
infty_irred [in FOL.Tennenbaum.NumberUtils]
Inf_indexed1 [in FOL.Semantics.Heyting.Heyting]
Inf2 [in FOL.Semantics.Heyting.Heyting]
inj_decode [in FOL.Tennenbaum.CantorPairing]
inj_next [in FOL.Tennenbaum.CantorPairing]
inj_Irred [in FOL.Tennenbaum.NumberUtils]
insep_essential_undecidability [in FOL.Incompleteness.abstract_incompleteness]
insep_essential_incompleteness [in FOL.Incompleteness.abstract_incompleteness]
insep_incompleteness [in FOL.Incompleteness.abstract_incompleteness]
insep_undecidability [in FOL.Incompleteness.abstract_incompleteness]
intro_or_destruct_T [in FOL.Proofmode.ProofMode]
intro_and_destruct_T [in FOL.Proofmode.ProofMode]
intro_or_destruct [in FOL.Proofmode.ProofMode]
intro_and_destruct [in FOL.Proofmode.ProofMode]
int_notEx_Allnot [in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySemantic]
inu_I [in FOL.Tennenbaum.Peano]
inu_nat_id [in FOL.Tennenbaum.Peano]
inu_mult_hom [in FOL.Tennenbaum.Peano]
inu_add_hom [in FOL.Tennenbaum.Peano]
inu_inj [in FOL.Tennenbaum.Peano]
invariant_subst_list [in FOL.Tennenbaum.Variants]
inv_cd [in FOL.Tennenbaum.CantorPairing]
inv_dc [in FOL.Tennenbaum.CantorPairing]
inv_std_mult [in FOL.Tennenbaum.Coding]
inv_std_mult_right [in FOL.Tennenbaum.Coding]
inv_std_add [in FOL.Tennenbaum.Coding]
irred_Irred [in FOL.Tennenbaum.NumberUtils]
irred_integral_domain [in FOL.Tennenbaum.NumberUtils]
irred_Mod_eq [in FOL.Tennenbaum.NumberUtils]
irred_factor [in FOL.Tennenbaum.NumberUtils]
irred_bounded [in FOL.Tennenbaum.NumberUtils]
is_provable [in FOL.Incompleteness.formal_systems]
is_Henkin_inherit [in FOL.Completeness.TarskiConstructions]
isΠinΠpLsyn [in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySyntactic]
isΠinΠ1 [in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySyntactic]
isΠsemA [in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySemantic]
isΠsemTwoAll [in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySemantic]
isΣinΣpLsyn [in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySyntactic]
isΣinΣ1 [in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySyntactic]
isΣnsyn_in_isΣsem [in FOL.ArithmeticalHierarchy.ArithmeticalHierarchyEquiv]
isΣsemE [in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySemantic]
isΣsemListΣ [in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySemantic]
isΣsemTwoEx [in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySemantic]
isΣsem_in_isΣsyn [in FOL.ArithmeticalHierarchy.ArithmeticalHierarchyEquiv]
isΣsem_and_closed [in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySemantic]
isΣsem_m_red_closed [in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySemantic]
isΣΠball [in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySemantic]
isΣΠf_iff_PNF [in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySyntactic]
isΣΠf_PNF [in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySyntactic]
isΣΠn_In_ΠΣSn [in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySemantic]
isΣΠn_In_ΣΠSn [in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySemantic]
isΣΠsem0 [in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySemantic]
iter_add_S [in FOL.Utils.PrenexNormalForm]
iμ_standard [in FOL.Incompleteness.fol_utils]
J
Join_com [in FOL.Semantics.Heyting.Heyting]Join2 [in FOL.Semantics.Heyting.Heyting]
Join3 [in FOL.Semantics.Heyting.Heyting]
K
kcompleteness_implies_LEM [in FOL.Completeness.KripkeCompleteness]kcompleteness_enum_implies_MP [in FOL.Completeness.KripkeCompleteness]
kcompleteness_implies_stability [in FOL.Completeness.KripkeCompleteness]
ksoundness_seq [in FOL.Deduction.FragmentSequentFacts]
K_std_seq_ksoundness [in FOL.Completeness.KripkeCompleteness]
K_std_completeness [in FOL.Completeness.KripkeCompleteness]
K_std_ksat [in FOL.Completeness.KripkeCompleteness]
K_std_sprv' [in FOL.Completeness.KripkeCompleteness]
K_std_sprv [in FOL.Completeness.KripkeCompleteness]
K_std_correct [in FOL.Completeness.KripkeCompleteness]
K_bottomless_completeness [in FOL.Completeness.KripkeCompleteness]
K_exp_seq_ksoundness [in FOL.Completeness.KripkeCompleteness]
K_exp_ksoundness [in FOL.Completeness.KripkeCompleteness]
K_exp_completeness [in FOL.Completeness.KripkeCompleteness]
K_ctx_exploding [in FOL.Completeness.KripkeCompleteness]
K_ctx_ksat [in FOL.Completeness.KripkeCompleteness]
K_ctx_subst [in FOL.Completeness.KripkeCompleteness]
K_ctx_sprv [in FOL.Completeness.KripkeCompleteness]
K_ctx_correct [in FOL.Completeness.KripkeCompleteness]
K_ctx_ksat_exp [in FOL.Completeness.KripkeCompleteness]
K_ctx_constraint_exp [in FOL.Completeness.KripkeCompleteness]
K_ctx_subst_exp [in FOL.Completeness.KripkeCompleteness]
K_ctx_sprv_exp [in FOL.Completeness.KripkeCompleteness]
K_ctx_correct_exp [in FOL.Completeness.KripkeCompleteness]
L
large [in FOL.Reification.DemoPA]lb_calg_iff [in FOL.Completeness.HeytingCompleteness]
lb_alg_iff [in FOL.Completeness.HeytingCompleteness]
lb_normal [in FOL.Completeness.HeytingMacNeille]
ldec_bounded [in FOL.Completeness.TarskiCompleteness]
ldec_forall [in FOL.Completeness.TarskiCompleteness]
leibniz [in FOL.Proofmode.ProofMode]
leibniz_term [in FOL.Proofmode.ProofMode]
LEM_DNE [in FOL.Tennenbaum.SyntheticInType]
LEM_is_arbitrary_completeness [in FOL.Completeness.TarskiCompleteness]
lessthen_num [in FOL.Tennenbaum.Peano]
le_swap_fin_disj [in FOL.Incompleteness.qdec]
le_fin_disj [in FOL.Incompleteness.qdec]
le_le_trans [in FOL.Tennenbaum.Peano]
lindenbaum_eqH [in FOL.Completeness.HeytingCompleteness]
lindenbaum_hsat [in FOL.Completeness.HeytingCompleteness]
list_noQuant_PNF [in FOL.Utils.PrenexNormalForm]
list_theory_enumerable [in FOL.Incompleteness.fol_utils]
lt_le_trans [in FOL.Tennenbaum.Peano]
lt_S [in FOL.Tennenbaum.Peano]
lt_le_equiv1 [in FOL.Tennenbaum.Peano]
lt_neq [in FOL.Tennenbaum.Peano]
lt_SS [in FOL.Tennenbaum.Peano]
lt_nat_equiv [in FOL.Tennenbaum.NumberUtils]
lt_rect [in FOL.Tennenbaum.NumberUtils]
lt_equiv [in FOL.Tennenbaum.Coding]
lu_idem [in FOL.Completeness.HeytingMacNeille]
lu_sub [in FOL.Completeness.HeytingMacNeille]
M
Makholm [in FOL.Tennenbaum.Variants]mapT_step [in FOL.Proofmode.ProofMode]
map_shift_up_down_eq [in FOL.Proofmode.Theories]
map_shift_up_down_contains [in FOL.Proofmode.Theories]
map_subst [in FOL.Semantics.Heyting.Soundness]
Markov_Forster [in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySemantic]
maximal_prv [in FOL.Completeness.TarskiConstructions]
maximal_Omega [in FOL.Completeness.TarskiConstructions]
McCarty [in FOL.Tennenbaum.Variants]
meet_sup_expansion [in FOL.Semantics.Heyting.Heyting]
meet_sup_distr [in FOL.Semantics.Heyting.Heyting]
meet_join_expansion [in FOL.Semantics.Heyting.Heyting]
meet_join_distr [in FOL.Semantics.Heyting.Heyting]
Meet_extend [in FOL.Semantics.Heyting.Heyting]
Meet_assoc [in FOL.Semantics.Heyting.Heyting]
Meet_left [in FOL.Semantics.Heyting.Heyting]
Meet_com [in FOL.Semantics.Heyting.Heyting]
Meet_hsat_L [in FOL.Semantics.Heyting.Soundness]
Meet2 [in FOL.Semantics.Heyting.Heyting]
Meet3 [in FOL.Semantics.Heyting.Heyting]
model_fragment_classical [in FOL.Completeness.TarskiCompleteness]
model_fragment_correct [in FOL.Completeness.TarskiCompleteness]
model_bot_exploding [in FOL.Completeness.TarskiCompleteness]
model_expl_correct [in FOL.Completeness.TarskiCompleteness]
model_bot_classical [in FOL.Completeness.TarskiCompleteness]
model_bot_correct [in FOL.Completeness.TarskiCompleteness]
ModMod_is_Mod [in FOL.Tennenbaum.NumberUtils]
Mod_mult_hom [in FOL.Tennenbaum.NumberUtils]
Mod_mult_hom_l [in FOL.Tennenbaum.NumberUtils]
Mod_add_hom [in FOL.Tennenbaum.NumberUtils]
Mod_plus_multiple [in FOL.Tennenbaum.NumberUtils]
Mod_id [in FOL.Tennenbaum.NumberUtils]
Mod_le [in FOL.Tennenbaum.NumberUtils]
Mod_divides [in FOL.Tennenbaum.NumberUtils]
Mod_lt [in FOL.Tennenbaum.NumberUtils]
Mod_bound [in FOL.Tennenbaum.NumberUtils]
Mod0_is_0 [in FOL.Tennenbaum.NumberUtils]
mono_inj [in FOL.Tennenbaum.NumberUtils]
mon_F [in FOL.Completeness.KripkeCompleteness]
move_to_front_incl [in FOL.Proofmode.ProofMode]
MP_Discrete_stable_std [in FOL.Tennenbaum.Tennenbaum_diagonal]
MP_stable_enumerable [in FOL.Utils.MPFacts]
MP_Post [in FOL.Utils.MPFacts]
MP_dec [in FOL.Utils.MPFacts]
MP_Dec_stable [in FOL.Tennenbaum.SyntheticInType]
MP_Markov_nat [in FOL.Tennenbaum.SyntheticInType]
MP_is_enumerable_completeness [in FOL.Completeness.TarskiCompleteness]
MP_prop_is_arbitrary_completeness [in FOL.Completeness.TarskiCompleteness]
MP_prop_to_MP_pred [in FOL.Completeness.TarskiCompleteness]
mp_standard_completeness [in FOL.Completeness.TarskiCompleteness]
mp_tprv_stability [in FOL.Completeness.TarskiCompleteness]
Mult_rec [in FOL.Tennenbaum.Peano]
mult_le_mono [in FOL.Tennenbaum.Peano]
mult_asso [in FOL.Tennenbaum.Peano]
mult_comm [in FOL.Tennenbaum.Peano]
mult_rec_r [in FOL.Tennenbaum.Peano]
mult_zero_r [in FOL.Tennenbaum.Peano]
mult_rec [in FOL.Tennenbaum.Peano]
mult_zero [in FOL.Tennenbaum.Peano]
mul_comm [in FOL.Reification.DemoPA]
mul_succ_r [in FOL.Reification.DemoPA]
mul_zero_r [in FOL.Reification.DemoPA]
mul_succ_l [in FOL.Reification.DemoPA]
mul_zero_l [in FOL.Reification.DemoPA]
mul_comm [in FOL.Reification.DemoPAExtensional]
mul_succ_r [in FOL.Reification.DemoPAExtensional]
mul_zero_r [in FOL.Reification.DemoPAExtensional]
mul_succ_l [in FOL.Reification.DemoPAExtensional]
mul_zero_l [in FOL.Reification.DemoPAExtensional]
mu_recursive_definable [in FOL.Incompleteness.epf_mu]
mu_semi_decidable_enumerable [in FOL.Incompleteness.epf_mu]
N
nameless_equiv_ex [in FOL.Deduction.FullSequentFacts]nameless_equiv_all [in FOL.Deduction.FullSequentFacts]
nameless_equiv_ex' [in FOL.Deduction.FullSequentFacts]
nameless_equiv_all' [in FOL.Deduction.FullSequentFacts]
nat_recalg_nat [in FOL.Incompleteness.epf_mu]
nat_eq_dec [in FOL.Tennenbaum.Tennenbaum_diagonal]
neg_dec [in FOL.Incompleteness.Abstract]
neg_lt_bounded_forall [in FOL.Tennenbaum.MoreDecidabilityFacts]
negΣinΠsem [in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySemantic]
negΣinΠsyn [in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySyntactic]
neq_le [in FOL.Proofmode.DemoPA]
NNN_N [in FOL.Tennenbaum.SyntheticInType]
nolessthen_zero [in FOL.Tennenbaum.Peano]
nonStd_notStd [in FOL.Tennenbaum.Peano]
noQuand_ind_inv [in FOL.Utils.PrenexNormalForm]
noQuant_ind_subst [in FOL.Utils.PrenexNormalForm]
noQuant_agree [in FOL.Utils.PrenexNormalForm]
noQuant_dec [in FOL.ArithmeticalHierarchy.ArithmeticalHierarchyEquiv]
normal_bot [in FOL.Completeness.HeytingMacNeille]
normal_dclosed [in FOL.Completeness.HeytingMacNeille]
not_lt_zero_prv [in FOL.Tennenbaum.Peano]
not_lt_zero_prv' [in FOL.Tennenbaum.Peano]
no_recursively_separating [in FOL.Incompleteness.epf]
num_mult_homomorphism' [in FOL.Proofmode.DemoPA]
num_add_homomorphism' [in FOL.Proofmode.DemoPA]
num_mult_homomorphism [in FOL.Proofmode.DemoPA]
num_add_homomorphism [in FOL.Proofmode.DemoPA]
num_le_nonStd [in FOL.Tennenbaum.Tennenbaum_insep]
num_lt_dec [in FOL.Tennenbaum.Peano]
num_nlt [in FOL.Tennenbaum.Peano]
num_lt [in FOL.Tennenbaum.Peano]
num_eq_dec [in FOL.Tennenbaum.Peano]
num_neq [in FOL.Tennenbaum.Peano]
num_eq [in FOL.Tennenbaum.Peano]
num_mult_homomorphism [in FOL.Tennenbaum.Peano]
num_add_homomorphism [in FOL.Tennenbaum.Peano]
num_subst [in FOL.Tennenbaum.Peano]
num_lt_nonStd_converse [in FOL.Tennenbaum.Coding]
num_lt_nonStd [in FOL.Tennenbaum.Coding]
n00_next [in FOL.Tennenbaum.CantorPairing]
O
Omega_all [in FOL.Completeness.TarskiConstructions]Omega_impl [in FOL.Completeness.TarskiConstructions]
Omega_T [in FOL.Completeness.TarskiConstructions]
Omega_prv [in FOL.Completeness.TarskiConstructions]
omega_le [in FOL.Completeness.TarskiConstructions]
only_logic [in FOL.Reification.DemoPA]
on_std_equiv [in FOL.Tennenbaum.Coding]
or_single [in FOL.Deduction.FullSequentFacts]
or_weak [in FOL.Deduction.FullSequentFacts]
or_el [in FOL.Deduction.FullSequentFacts]
or_char [in FOL.Deduction.FullSequentFacts]
or_subst [in FOL.Deduction.FullSequentFacts]
or_ldec [in FOL.Completeness.TarskiCompleteness]
Overspill [in FOL.Tennenbaum.Coding]
Overspill_DN [in FOL.Tennenbaum.Coding]
Overspill_DN' [in FOL.Tennenbaum.Coding]
P
PAeq_enum [in FOL.Incompleteness.Axiomatisations]PAle_num_eq [in FOL.Incompleteness.qdec]
PAle_succ [in FOL.Incompleteness.qdec]
PAle_sigma_neq [in FOL.Incompleteness.qdec]
PAle_zero_eq [in FOL.Incompleteness.qdec]
PAle'_num_eq [in FOL.Incompleteness.qdec]
PAle'_succ [in FOL.Incompleteness.qdec]
PAle'_sigma_neq [in FOL.Incompleteness.qdec]
PAle'_zero_eq [in FOL.Incompleteness.qdec]
PAQ_proves_cases [in FOL.Tennenbaum.HA_insep]
part_functional [in FOL.Incompleteness.utils]
PA_induction [in FOL.Reification.DemoPA]
pa_eq_dec [in FOL.Proofmode.DemoPA]
PA_std_axioms [in FOL.Tennenbaum.Peano]
PA_induction [in FOL.Reification.DemoPAExtensional]
PA_undec3 [in FOL.Incompleteness.Axiomatisations]
PA_undec2 [in FOL.Incompleteness.Axiomatisations]
PA_undec1 [in FOL.Incompleteness.Axiomatisations]
PA_consistent [in FOL.Tennenbaum.Formulas]
PA_extends_Q [in FOL.Tennenbaum.HA_insep]
PNF_equiv_DN [in FOL.Utils.PrenexNormalForm]
PNF_equiv [in FOL.Utils.PrenexNormalForm]
PNF_equiv_bin_op [in FOL.Utils.PrenexNormalForm]
PNF_agree [in FOL.Utils.PrenexNormalForm]
PNF_ind_inversion [in FOL.Utils.PrenexNormalForm]
PNF_notAll [in FOL.Utils.PrenexNormalForm]
PNF_notExists [in FOL.Utils.PrenexNormalForm]
PNF_implExists [in FOL.Utils.PrenexNormalForm]
PNF_implAll [in FOL.Utils.PrenexNormalForm]
PNF_existsImpl [in FOL.Utils.PrenexNormalForm]
PNF_allImpl [in FOL.Utils.PrenexNormalForm]
PNF_allImpl2 [in FOL.Utils.PrenexNormalForm]
PNF_allImpl1 [in FOL.Utils.PrenexNormalForm]
PNF_orExists [in FOL.Utils.PrenexNormalForm]
PNF_existsOr [in FOL.Utils.PrenexNormalForm]
PNF_andExists [in FOL.Utils.PrenexNormalForm]
PNF_existsAnd [in FOL.Utils.PrenexNormalForm]
PNF_orAll [in FOL.Utils.PrenexNormalForm]
PNF_allOr [in FOL.Utils.PrenexNormalForm]
PNF_all_Or2 [in FOL.Utils.PrenexNormalForm]
PNF_all_Or1 [in FOL.Utils.PrenexNormalForm]
PNF_andAll [in FOL.Utils.PrenexNormalForm]
PNF_allAnd [in FOL.Utils.PrenexNormalForm]
PNF_isΣorΠ_syn [in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySyntactic]
predicate_equiv [in FOL.Tennenbaum.Coding]
prime_div_relation [in FOL.Tennenbaum.Church]
prime_irred_equiv [in FOL.Tennenbaum.NumberUtils]
ProductWO [in FOL.Tennenbaum.MoreDecidabilityFacts]
prv_split [in FOL.Tennenbaum.Church]
prv_iff_symmetry [in FOL.Tennenbaum.Tennenbaum_insep]
prv_to_min [in FOL.Proofmode.DemoMinZF]
prv_to_min_om2 [in FOL.Proofmode.DemoMinZF]
prv_to_min_om1 [in FOL.Proofmode.DemoMinZF]
prv_to_min_inductive [in FOL.Proofmode.DemoMinZF]
prv_to_min_power [in FOL.Proofmode.DemoMinZF]
prv_to_min_union [in FOL.Proofmode.DemoMinZF]
prv_to_min_pair [in FOL.Proofmode.DemoMinZF]
prv_to_min_eset [in FOL.Proofmode.DemoMinZF]
prv_to_min_ext [in FOL.Proofmode.DemoMinZF]
prv_to_min_elem [in FOL.Proofmode.DemoMinZF]
prv_to_min_trans [in FOL.Proofmode.DemoMinZF]
prv_to_min_sym [in FOL.Proofmode.DemoMinZF]
prv_to_min_refl [in FOL.Proofmode.DemoMinZF]
prv_lt_lt_bottom [in FOL.Tennenbaum.HA_insep]
prv_leq_S [in FOL.Tennenbaum.HA_insep]
prv_0_leq_x [in FOL.Tennenbaum.HA_insep]
prv_contraposition [in FOL.Tennenbaum.HA_insep]
prv_equiv [in FOL.Tennenbaum.HA_insep]
prv_enumerable [in FOL.Incompleteness.ctq]
Q
Qdec_bounded_exists_comm [in FOL.Incompleteness.qdec]Qdec_bounded_exists [in FOL.Incompleteness.qdec]
Qdec_bounded_forall [in FOL.Incompleteness.qdec]
Qdec_fin_disj [in FOL.Incompleteness.qdec]
Qdec_fin_conj [in FOL.Incompleteness.qdec]
Qdec_le [in FOL.Incompleteness.qdec]
Qdec_eq [in FOL.Incompleteness.qdec]
Qdec_impl [in FOL.Incompleteness.qdec]
Qdec_or [in FOL.Incompleteness.qdec]
Qdec_and [in FOL.Incompleteness.qdec]
Qdec_bot [in FOL.Incompleteness.qdec]
Qdec_iff' [in FOL.Incompleteness.qdec]
Qdec_iff [in FOL.Incompleteness.qdec]
Qdec_subst [in FOL.Incompleteness.qdec]
Qdec_bin_bounded_forall [in FOL.Incompleteness.bin_qdec]
Qdec_kernel_Insep [in FOL.Tennenbaum.Tennenbaum_insep]
Qeq_def [in FOL.Incompleteness.fol_utils]
Qsdec_le [in FOL.Incompleteness.qdec]
quant_list_to_form_rename_free_up [in FOL.Utils.PrenexNormalForm]
quant_list_to_form_rename_free [in FOL.Utils.PrenexNormalForm]
quant_list_to_form_equiv [in FOL.Utils.PrenexNormalForm]
Q_incomplete [in FOL.Incompleteness.fol_incompleteness]
Q_undecidable [in FOL.Incompleteness.fol_incompleteness]
Q_weak_repr [in FOL.Incompleteness.epf_mu]
Q_leibniz [in FOL.Incompleteness.qdec]
Q_leibniz_t [in FOL.Incompleteness.qdec]
Q_eqdec [in FOL.Incompleteness.qdec]
Q_add_assoc2 [in FOL.Incompleteness.bin_qdec]
Q_add_assoc1 [in FOL.Incompleteness.bin_qdec]
Q_std_axioms [in FOL.Tennenbaum.Peano]
Q_consistent [in FOL.Tennenbaum.Formulas]
Q_num_inj [in FOL.Incompleteness.ctq]
R
recursively_separating_diverge [in FOL.Incompleteness.epf]reduction_theorem [in FOL.Incompleteness.PA_incompleteness]
reduction_theorem_class [in FOL.Incompleteness.Axiomatisations]
reduction_theorem [in FOL.Incompleteness.Axiomatisations]
reduction_consistency [in FOL.Incompleteness.Axiomatisations]
reduction_equiv [in FOL.Incompleteness.Abstract]
reduction_valid [in FOL.Incompleteness.Abstract]
reduction_provable [in FOL.Incompleteness.Abstract]
red_union_valid [in FOL.Incompleteness.Axiomatisations]
red_union_prv [in FOL.Incompleteness.Axiomatisations]
red_union_prv' [in FOL.Incompleteness.Axiomatisations]
red_sub_valid [in FOL.Incompleteness.Axiomatisations]
red_sub_prv [in FOL.Incompleteness.Axiomatisations]
red_prv_valid [in FOL.Incompleteness.Axiomatisations]
red_prv_prv [in FOL.Incompleteness.Axiomatisations]
red_finite_prv [in FOL.Incompleteness.Axiomatisations]
red_finite_valid [in FOL.Incompleteness.Axiomatisations]
refined_undec_Z' [in FOL.Incompleteness.Axiomatisations]
refl [in FOL.Proofmode.ProofMode]
reflecting_neq [in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySyntactic]
reflexivity [in FOL.Tennenbaum.Peano]
refutable_semi_decidable [in FOL.Incompleteness.formal_systems]
refutable_enum [in FOL.Incompleteness.Abstract]
remove_n_incl [in FOL.Proofmode.ProofMode]
replace_incl [in FOL.Proofmode.ProofMode]
rosser_inherit [in FOL.Tennenbaum.HA_insep]
rosser_disj [in FOL.Tennenbaum.HA_insep]
rosser_disj' [in FOL.Tennenbaum.HA_insep]
rosser_anitsymmetry [in FOL.Tennenbaum.HA_insep]
rosser_equiv [in FOL.Tennenbaum.HA_insep]
S
sat_exist_times [in FOL.Incompleteness.epf_mu]sat_embed [in FOL.Incompleteness.PA_incompleteness]
sat_Fr_context [in FOL.Incompleteness.PA_incompleteness]
sat_Fr_formula [in FOL.Incompleteness.PA_incompleteness]
sat_Q_axioms [in FOL.Tennenbaum.Peano]
sat_PAle [in FOL.Incompleteness.ctq]
sat_single_nat [in FOL.Incompleteness.fol_utils]
sat_single_PA [in FOL.Incompleteness.fol_utils]
self_halting_undec [in FOL.Incompleteness.epf]
self_halting_diverge [in FOL.Incompleteness.epf]
semi_dec_iff_Σ1 [in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySemantic]
semi_completeness_fragment [in FOL.Completeness.TarskiCompleteness]
semi_completeness_exploding [in FOL.Completeness.TarskiCompleteness]
semi_completeness_standard [in FOL.Completeness.TarskiCompleteness]
semi_completeness_standard_classical_model [in FOL.Completeness.TarskiCompleteness]
Separated_sum [in FOL.Tennenbaum.SyntheticInType]
Separated_equiv [in FOL.Tennenbaum.SyntheticInType]
seq_ND_T [in FOL.Deduction.FragmentSequentFacts]
seq_ND [in FOL.Deduction.FragmentSequentFacts]
seq_nameless_equiv_all' [in FOL.Deduction.FragmentSequentFacts]
seq_subst_Weak [in FOL.Deduction.FragmentSequentFacts]
seq_Weak [in FOL.Deduction.FragmentSequentFacts]
seq_consistent [in FOL.Deduction.FragmentSequentFacts]
SE_cut [in FOL.Completeness.KripkeCompleteness]
shift_quant_1 [in FOL.Utils.PrenexNormalForm]
shift_quant_add [in FOL.Utils.PrenexNormalForm]
shift_quant_0 [in FOL.Utils.PrenexNormalForm]
shift_one_more [in FOL.Utils.PrenexNormalForm]
shift_quant_explicit [in FOL.Utils.PrenexNormalForm]
Sigma_0_1_cumul [in FOL.Completeness.TarskiCompleteness]
size_rect [in FOL.Tennenbaum.CantorPairing]
sless_subst [in FOL.Tennenbaum.Peano]
Soundness [in FOL.Semantics.Heyting.Soundness]
Soundness' [in FOL.Semantics.Heyting.Soundness]
Stable_std_negn_nonStd__sdtMobel_equiv [in FOL.Tennenbaum.Tennenbaum_diagonal]
Stable_std_stable_stdModel [in FOL.Tennenbaum.Tennenbaum_diagonal]
Stable_neg_exists_neg__forall [in FOL.Tennenbaum.SyntheticInType]
stdModel_eqiv [in FOL.Tennenbaum.Peano]
std_T_consistent [in FOL.Incompleteness.PA_incompleteness]
stripneg_spec [in FOL.Incompleteness.Axiomatisations]
strong_separability_extension [in FOL.Incompleteness.abstract_incompleteness]
subset_trans [in FOL.Proofmode.Theories]
subset_refl [in FOL.Proofmode.Theories]
subst_closed [in FOL.Incompleteness.qdec]
subst_t_closed [in FOL.Incompleteness.qdec]
subst_forall_prv [in FOL.Tennenbaum.Peano]
subst_exist_prv [in FOL.Tennenbaum.Peano]
subst_zero_term [in FOL.Proofmode.ProofMode]
subst_zero [in FOL.Proofmode.ProofMode]
subst_bound [in FOL.Tennenbaum.Formulas]
subst_bound_t [in FOL.Tennenbaum.Formulas]
subst_Weak [in FOL.Deduction.FullSequentFacts]
Succ_inj [in FOL.Tennenbaum.Peano]
succ_inj' [in FOL.Tennenbaum.Peano]
succ_inj [in FOL.Tennenbaum.Peano]
sum_is_zero [in FOL.Tennenbaum.Peano]
Sup_indexed1 [in FOL.Semantics.Heyting.Heyting]
Sup1 [in FOL.Semantics.Heyting.Heyting]
Sup2 [in FOL.Semantics.Heyting.Heyting]
surj_form_ [in FOL.Tennenbaum.Tennenbaum_insep]
switch_imp_T [in FOL.Proofmode.Theories]
switch_up_num [in FOL.Tennenbaum.Peano]
switch_num [in FOL.Tennenbaum.Peano]
switch_nat_num [in FOL.Tennenbaum.Formulas]
sym [in FOL.Proofmode.ProofMode]
symmetry [in FOL.Tennenbaum.Peano]
T
TD_undec_ZF [in FOL.Incompleteness.Axiomatisations]Tennenbaum_inseparable [in FOL.Tennenbaum.Tennenbaum_insep]
Tennenbaum_diagonal_ct [in FOL.Tennenbaum.Tennenbaum_diagonal]
Tennenbaum_diagonal [in FOL.Tennenbaum.Tennenbaum_diagonal]
term_lt_dec [in FOL.Tennenbaum.Peano]
term_eq_dec [in FOL.Tennenbaum.Peano]
theta_self_return_enumerable [in FOL.Incompleteness.epf]
theta_self_return_semi_decidable [in FOL.Incompleteness.epf]
theta_mu_enumerable [in FOL.Incompleteness.ctq]
theta_ψ [in FOL.Incompleteness.ctq]
top_hsat_L [in FOL.Semantics.Heyting.Heyting]
Top1 [in FOL.Semantics.Heyting.Heyting]
totalise [in FOL.Incompleteness.utils]
totalise_part [in FOL.Incompleteness.utils]
to_form_contradictory [in FOL.Completeness.EnumerationUtils]
to_form_closed [in FOL.Completeness.EnumerationUtils]
to_from_form [in FOL.Completeness.EnumerationUtils]
tprv_enumerable [in FOL.Incompleteness.Axiomatisations]
transitivity [in FOL.Tennenbaum.Peano]
trichotomy [in FOL.Tennenbaum.Peano]
turnFalsityOn_isΣΠf_ind [in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySyntactic]
turnFalsityOn_noQuant [in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySyntactic]
turnFalsityOn_eqiv [in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySyntactic]
T_Pc [in FOL.Proofmode.Theories]
T_DE [in FOL.Proofmode.Theories]
T_DI2 [in FOL.Proofmode.Theories]
T_DI1 [in FOL.Proofmode.Theories]
T_CE2 [in FOL.Proofmode.Theories]
T_CE1 [in FOL.Proofmode.Theories]
T_CI [in FOL.Proofmode.Theories]
T_Ctx [in FOL.Proofmode.Theories]
T_Exp [in FOL.Proofmode.Theories]
T_ExE [in FOL.Proofmode.Theories]
T_ExI [in FOL.Proofmode.Theories]
T_AllE [in FOL.Proofmode.Theories]
T_AllI [in FOL.Proofmode.Theories]
T_IE [in FOL.Proofmode.Theories]
T_II [in FOL.Proofmode.Theories]
T_class_Q_to_H10p [in FOL.Incompleteness.PA_incompleteness]
T_prv_sig [in FOL.Completeness.TarskiCompleteness]
U
ub_join [in FOL.Completeness.HeytingMacNeille]uctq_ctq [in FOL.Incompleteness.ctq]
UC_Discrete [in FOL.Tennenbaum.Variants]
UC_no_nonStd [in FOL.Tennenbaum.Variants]
UC_unary_DN_Dec' [in FOL.Tennenbaum.Variants]
UC_unary_DN_Dec [in FOL.Tennenbaum.Variants]
UC_Def_Dec [in FOL.Tennenbaum.SyntheticInType]
unary_DN_bounded_definite [in FOL.Tennenbaum.Variants]
unary_ext [in FOL.Tennenbaum.Variants]
unary_rosser [in FOL.Tennenbaum.HA_insep]
undec_class_T [in FOL.Incompleteness.PA_incompleteness]
undec_class_Q [in FOL.Incompleteness.PA_incompleteness]
undec_prv_class [in FOL.Incompleteness.Axiomatisations]
undec_class_binZ' [in FOL.Incompleteness.Axiomatisations]
undec_prv_intu [in FOL.Incompleteness.Axiomatisations]
undec_valid [in FOL.Incompleteness.Axiomatisations]
undec_binZ' [in FOL.Incompleteness.Axiomatisations]
undec_minZ' [in FOL.Incompleteness.Axiomatisations]
undec_ZF [in FOL.Incompleteness.Axiomatisations]
undec_Z [in FOL.Incompleteness.Axiomatisations]
undec_Z' [in FOL.Incompleteness.Axiomatisations]
undec_standard_valid [in FOL.Incompleteness.Axiomatisations]
undec_standard_prv [in FOL.Incompleteness.Axiomatisations]
undec_PA [in FOL.Incompleteness.Axiomatisations]
undec_Q [in FOL.Incompleteness.Axiomatisations]
undec_Q' [in FOL.Incompleteness.Axiomatisations]
unembed'_embed' [in FOL.Incompleteness.ctq]
unfold_sless [in FOL.Tennenbaum.Peano]
union_closed [in FOL.Completeness.TarskiConstructions]
union_econsistent [in FOL.Completeness.TarskiConstructions]
union_sub [in FOL.Completeness.TarskiConstructions]
union_f [in FOL.Completeness.TarskiConstructions]
unique [in FOL.Tennenbaum.NumberUtils]
universal_interp_eval [in FOL.Completeness.KripkeCompleteness]
upNup [in FOL.Utils.PrenexNormalForm]
upN_explicit [in FOL.Utils.PrenexNormalForm]
up_equiv [in FOL.Utils.PrenexNormalForm]
up_decompose [in FOL.Tennenbaum.Peano]
V
valid_T_fragment [in FOL.Completeness.TarskiCompleteness]valid_T_model_exploding [in FOL.Completeness.TarskiCompleteness]
valid_T_model_bot [in FOL.Completeness.TarskiCompleteness]
vec_append1 [in FOL.Incompleteness.epf_mu]
vec_pos_default_append [in FOL.Incompleteness.epf_mu]
vec_pos_default_default [in FOL.Incompleteness.epf_mu]
vec_pos_default_fin [in FOL.Incompleteness.epf_mu]
vec_de_cons [in FOL.Tennenbaum.Peano]
vec_de_nil [in FOL.Tennenbaum.Peano]
vec_map_preimage [in FOL.Tennenbaum.Formulas]
vec_singleton [in FOL.Incompleteness.utils]
vec_2_inv [in FOL.Incompleteness.utils]
vec_1_inv [in FOL.Incompleteness.utils]
vec_0_nil [in FOL.Incompleteness.utils]
W
WCT_WRTs [in FOL.Tennenbaum.Church]WCT_potentiall_Insep_form [in FOL.Tennenbaum.Tennenbaum_insep]
WCT_Insep_pred [in FOL.Tennenbaum.Tennenbaum_insep]
weaken [in FOL.Deduction.FullSequentFacts]
weakly_representable_decidable [in FOL.Incompleteness.abstract_incompleteness]
weakly_representable_decidable' [in FOL.Incompleteness.abstract_incompleteness]
weakPost [in FOL.Utils.MPFacts]
weakPost [in FOL.Incompleteness.Abstract]
WeakT [in FOL.Proofmode.Theories]
WeakT [in FOL.Incompleteness.Axiomatisations]
weak_strong [in FOL.Incompleteness.weak_strong]
weak_strong' [in FOL.Incompleteness.weak_strong]
Witnessing_equiv [in FOL.Tennenbaum.SyntheticInType]
Witnessing_natnat [in FOL.Tennenbaum.MoreDecidabilityFacts]
Z
zero_or_next [in FOL.Tennenbaum.CantorPairing]Zero_succ [in FOL.Tennenbaum.Peano]
zero_or_succ [in FOL.Tennenbaum.Peano]
zero_succ [in FOL.Tennenbaum.Peano]
ZF_undec3 [in FOL.Incompleteness.Axiomatisations]
ZF_undec2 [in FOL.Incompleteness.Axiomatisations]
ZF_undec1 [in FOL.Incompleteness.Axiomatisations]
ZF_bunion_el2 [in FOL.Proofmode.DemoZF]
ZF_bunion_el1 [in FOL.Proofmode.DemoZF]
ZF_eq_sig [in FOL.Proofmode.DemoZF]
ZF_sig_el [in FOL.Proofmode.DemoZF]
ZF_eq_bunion [in FOL.Proofmode.DemoZF]
ZF_bunion_inv' [in FOL.Proofmode.DemoZF]
ZF_bunion_el' [in FOL.Proofmode.DemoZF]
ZF_eq_union [in FOL.Proofmode.DemoZF]
ZF_sub_union [in FOL.Proofmode.DemoZF]
ZF_union_el' [in FOL.Proofmode.DemoZF]
ZF_eq_pair' [in FOL.Proofmode.DemoZF]
ZF_sub_pair' [in FOL.Proofmode.DemoZF]
other
Π1sem_notΣ1_MP_inv [in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySemantic]Π1sem_notΣ1_MP [in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySemantic]
Π1_subst [in FOL.Incompleteness.sigma1]
Σ0sem_notΠ0_int [in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySemantic]
Σ1sem_notΠ1_int [in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySemantic]
Σ1syn_notΠ1_int [in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySyntactic]
Σ1_witness [in FOL.Incompleteness.sigma1]
Σ1_completeness [in FOL.Incompleteness.sigma1]
Σ1_soundness [in FOL.Incompleteness.sigma1]
Σ1_conservativity [in FOL.Incompleteness.sigma1]
Σ1_completeness_intu [in FOL.Incompleteness.sigma1]
Σ1_compression [in FOL.Incompleteness.sigma1]
Σ1_exist_times [in FOL.Incompleteness.sigma1]
Σ1_subst [in FOL.Incompleteness.sigma1]
φ1_sem [in FOL.Incompleteness.weak_strong]
φ1'_qdec [in FOL.Incompleteness.weak_strong]
φ1'_bounded [in FOL.Incompleteness.weak_strong]
φ2_sem [in FOL.Incompleteness.weak_strong]
φ2'_qdec [in FOL.Incompleteness.weak_strong]
φ2'_bounded [in FOL.Incompleteness.weak_strong]
ψ_equiv_2 [in FOL.Tennenbaum.Variants]
ψ_equiv_1 [in FOL.Tennenbaum.Variants]
ψ_equiv [in FOL.Tennenbaum.Coding]
ψ_repr [in FOL.Tennenbaum.Coding]
ψ_functional [in FOL.Incompleteness.ctq]
ψ_theta [in FOL.Incompleteness.ctq]
ψ_φ [in FOL.Incompleteness.ctq]
ψ_subst [in FOL.Incompleteness.ctq]
ψ_Σ1 [in FOL.Incompleteness.ctq]
ψ_bounded [in FOL.Incompleteness.ctq]
ψ'_subst [in FOL.Incompleteness.ctq]
ψ'_Qdec [in FOL.Incompleteness.ctq]
ψ'_bounded [in FOL.Incompleteness.ctq]
Constructor Index
A
Absurd [in FOL.Deduction.FragmentSequent]AL [in FOL.Deduction.FullSequent]
AllL [in FOL.Deduction.FragmentSequent]
AllL [in FOL.Deduction.FullSequent]
AllR [in FOL.Deduction.FragmentSequent]
AllR [in FOL.Deduction.FullSequent]
AR [in FOL.Deduction.FullSequent]
Ax [in FOL.Deduction.FragmentSequent]
Ax [in FOL.Deduction.FullSequent]
B
bAtom [in FOL.Proofmode.Hoas]bBin [in FOL.Proofmode.Hoas]
bEmbedForm [in FOL.Proofmode.Hoas]
bEmbedT [in FOL.Proofmode.Hoas]
bFal [in FOL.Proofmode.Hoas]
bFree [in FOL.Proofmode.Hoas]
bFunc [in FOL.Proofmode.Hoas]
bQuant [in FOL.Proofmode.Hoas]
bVar [in FOL.Proofmode.Hoas]
C
Contr [in FOL.Deduction.FragmentSequent]Contr [in FOL.Deduction.FullSequent]
E
ExL [in FOL.Deduction.FullSequent]Exp [in FOL.Deduction.FullSequent]
ExR [in FOL.Deduction.FullSequent]
F
fail [in FOL.Reification.GeneralReflection]I
Ident [in FOL.Proofmode.ProofMode]IL [in FOL.Deduction.FragmentSequent]
IL [in FOL.Deduction.FullSequent]
IR [in FOL.Deduction.FragmentSequent]
IR [in FOL.Deduction.FullSequent]
isΠall [in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySyntactic]
isΠex [in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySyntactic]
isΠnoQuant [in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySyntactic]
isΠsemS [in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySemantic]
isΠsem0 [in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySemantic]
isΣall [in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySyntactic]
isΣex [in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySyntactic]
isΣnoQuant [in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySyntactic]
isΣsemS [in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySemantic]
isΣsem0 [in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySemantic]
N
nQ_bin [in FOL.Utils.PrenexNormalForm]nQ_atom [in FOL.Utils.PrenexNormalForm]
nQ_false [in FOL.Utils.PrenexNormalForm]
O
OL [in FOL.Deduction.FullSequent]OR1 [in FOL.Deduction.FullSequent]
OR2 [in FOL.Deduction.FullSequent]
P
patAnd [in FOL.Proofmode.ProofMode]patId [in FOL.Proofmode.ProofMode]
patOr [in FOL.Proofmode.ProofMode]
patRewrite [in FOL.Proofmode.ProofMode]
patRewriteBack [in FOL.Proofmode.ProofMode]
Perm [in FOL.Deduction.FullSequent]
Pi_Delta [in FOL.Incompleteness.sigma1]
Pi_forall [in FOL.Incompleteness.sigma1]
PNF_quant [in FOL.Utils.PrenexNormalForm]
PNF_noQuant [in FOL.Utils.PrenexNormalForm]
R
ret [in FOL.Reification.GeneralReflection]S
Sigma_Delta [in FOL.Incompleteness.sigma1]Sigma_exists [in FOL.Incompleteness.sigma1]
T
TAbsurd [in FOL.Deduction.FragmentSequentFacts]TAllE [in FOL.Deduction.FragmentSequentFacts]
TAllI [in FOL.Deduction.FragmentSequentFacts]
TAllL [in FOL.Deduction.FragmentSequentFacts]
TAllR [in FOL.Deduction.FragmentSequentFacts]
TAx [in FOL.Deduction.FragmentSequentFacts]
TContr [in FOL.Deduction.FragmentSequentFacts]
TCtx [in FOL.Deduction.FragmentSequentFacts]
TExp [in FOL.Deduction.FragmentSequentFacts]
TIE [in FOL.Deduction.FragmentSequentFacts]
TII [in FOL.Deduction.FragmentSequentFacts]
TIL [in FOL.Deduction.FragmentSequentFacts]
TIR [in FOL.Deduction.FragmentSequentFacts]
W
Weak [in FOL.Deduction.FullSequent]Axiom Index
P
PredExt [in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySemantic]Projection Index
A
AllE [in FOL.Proofmode.ProofMode]AllI [in FOL.Proofmode.ProofMode]
Axioms [in FOL.Proofmode.ProofMode]
B
baseLogicConnHelper [in FOL.Reification.GeneralReflection]baseLogicVarHelper [in FOL.Reification.GeneralReflection]
Bot [in FOL.Semantics.Heyting.Heyting]
Bot1 [in FOL.Semantics.Heyting.Heyting]
C
CE1 [in FOL.Proofmode.ProofMode]CE2 [in FOL.Proofmode.ProofMode]
CI [in FOL.Proofmode.ProofMode]
consistent [in FOL.Incompleteness.formal_systems]
core [in FOL.Incompleteness.utils]
Ctx [in FOL.Proofmode.ProofMode]
D
D [in FOL.Reification.GeneralReflection]DE [in FOL.Proofmode.ProofMode]
DI1 [in FOL.Proofmode.ProofMode]
DI2 [in FOL.Proofmode.ProofMode]
E
emptyEnv [in FOL.Reification.GeneralReflection]enum [in FOL.Completeness.TarskiConstructions]
enum_bounded [in FOL.Completeness.TarskiConstructions]
enum_enum [in FOL.Completeness.TarskiConstructions]
eq [in FOL.Proofmode.ProofMode]
eq_pred_congr [in FOL.Proofmode.ProofMode]
eq_func_congr [in FOL.Proofmode.ProofMode]
eq_sym [in FOL.Proofmode.ProofMode]
eq_refl [in FOL.Proofmode.ProofMode]
eq_binary [in FOL.Proofmode.ProofMode]
Eq_pred [in FOL.Proofmode.ProofMode]
ExE [in FOL.Proofmode.ProofMode]
ExI [in FOL.Proofmode.ProofMode]
Exp [in FOL.Proofmode.ProofMode]
F
formReifierReifyHelper [in FOL.Reification.GeneralReflection]formReifierVarHelper [in FOL.Reification.GeneralReflection]
fprv [in FOL.Incompleteness.formal_systems]
fs [in FOL.Reification.GeneralReflection]
F_sup [in FOL.Completeness.HeytingMacNeille]
F_inf [in FOL.Completeness.HeytingMacNeille]
F_impl [in FOL.Completeness.HeytingMacNeille]
F_join [in FOL.Completeness.HeytingMacNeille]
F_meet [in FOL.Completeness.HeytingMacNeille]
F_bot [in FOL.Completeness.HeytingMacNeille]
F_mono [in FOL.Completeness.HeytingMacNeille]
F_inj [in FOL.Completeness.HeytingMacNeille]
H
H [in FOL.Semantics.Heyting.Heyting]HA [in FOL.Semantics.Heyting.Heyting]
I
I [in FOL.Reification.GeneralReflection]IE [in FOL.Proofmode.ProofMode]
II [in FOL.Proofmode.ProofMode]
Impl [in FOL.Semantics.Heyting.Heyting]
Impl1 [in FOL.Semantics.Heyting.Heyting]
Inf [in FOL.Semantics.Heyting.Heyting]
Inf1 [in FOL.Semantics.Heyting.Heyting]
In_T_closed [in FOL.Completeness.TarskiConstructions]
In_T [in FOL.Completeness.TarskiConstructions]
isD [in FOL.Reification.GeneralReflection]
J
Join [in FOL.Semantics.Heyting.Heyting]Join1 [in FOL.Semantics.Heyting.Heyting]
M
Meet [in FOL.Semantics.Heyting.Heyting]Meet1 [in FOL.Semantics.Heyting.Heyting]
N
NBot [in FOL.Completeness.TarskiConstructions]NBot_closed [in FOL.Completeness.TarskiConstructions]
O
Out_T_impl [in FOL.Completeness.TarskiConstructions]Out_T_all [in FOL.Completeness.TarskiConstructions]
Out_T_prv [in FOL.Completeness.TarskiConstructions]
Out_T_sub [in FOL.Completeness.TarskiConstructions]
Out_T_econsistent [in FOL.Completeness.TarskiConstructions]
Out_T [in FOL.Completeness.TarskiConstructions]
P
Pc [in FOL.Proofmode.ProofMode]ps [in FOL.Reification.GeneralReflection]
P_semi_decidable [in FOL.Incompleteness.formal_systems]
R
R [in FOL.Semantics.Heyting.Heyting]Rref [in FOL.Semantics.Heyting.Heyting]
Rtra [in FOL.Semantics.Heyting.Heyting]
T
termReifierReifyHelper [in FOL.Reification.GeneralReflection]termReifierVarHelper [in FOL.Reification.GeneralReflection]
V
valid [in FOL.Incompleteness.utils]variant [in FOL.Completeness.TarskiConstructions]
W
Weak [in FOL.Proofmode.ProofMode]Inductive Index
B
bform [in FOL.Proofmode.Hoas]bterm [in FOL.Proofmode.Hoas]
F
FailureMonad [in FOL.Reification.GeneralReflection]fprv [in FOL.Deduction.FullSequent]
I
ident_name [in FOL.Proofmode.ProofMode]intro_pattern [in FOL.Proofmode.ProofMode]
isΠf_ind [in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySyntactic]
isΠsem [in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySemantic]
isΣf_ind [in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySyntactic]
isΣsem [in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySemantic]
N
noQuant_ind [in FOL.Utils.PrenexNormalForm]P
PNF_ind [in FOL.Utils.PrenexNormalForm]S
sprv [in FOL.Deduction.FragmentSequent]T
tprv [in FOL.Deduction.FragmentSequentFacts]tsprv [in FOL.Deduction.FragmentSequentFacts]
other
Π1 [in FOL.Incompleteness.sigma1]Σ1 [in FOL.Incompleteness.sigma1]
Instance Index
C
clb_calg [in FOL.Completeness.HeytingCompleteness]clb_alg [in FOL.Completeness.HeytingCompleteness]
E
enum_form' [in FOL.Deduction.FragmentSequentFacts]enum_term' [in FOL.Deduction.FragmentSequentFacts]
enum_quantop [in FOL.Deduction.FragmentSequentFacts]
enum_binop [in FOL.Deduction.FragmentSequentFacts]
eqdec_preds [in FOL.Proofmode.DemoPA]
eqdec_funcs [in FOL.Proofmode.DemoPA]
eqdec_ZF_preds [in FOL.Incompleteness.Axiomatisations]
eqdec_ZF_syms [in FOL.Incompleteness.Axiomatisations]
eqdec_PA_preds [in FOL.Incompleteness.Axiomatisations]
eqdec_PA_syms [in FOL.Incompleteness.Axiomatisations]
EqDec_preds [in FOL.Incompleteness.Axiomatisations]
EqDec_funcs [in FOL.Incompleteness.Axiomatisations]
eqdec_preds' [in FOL.Proofmode.DemoMinZF]
eqdec_sig_empty [in FOL.Proofmode.DemoMinZF]
EqDec_preds [in FOL.Incompleteness.Abstract]
EqDec_syms [in FOL.Incompleteness.Abstract]
eqdec_on [in FOL.Incompleteness.Abstract]
eqdec_quantop [in FOL.Deduction.FragmentSequentFacts]
eqdec_binop [in FOL.Deduction.FragmentSequentFacts]
eqdec_preds [in FOL.Proofmode.DemoZF]
eqdec_funcs [in FOL.Proofmode.DemoZF]
equiv_HA_refl [in FOL.Semantics.Heyting.Heyting]
eq_dec_ff [in FOL.Incompleteness.Axiomatisations]
eq_dec_full_logic_quant [in FOL.Proofmode.ProofMode]
eq_dec_full_operators [in FOL.Proofmode.ProofMode]
F
ff [in FOL.Tennenbaum.Church]G
glb_calg [in FOL.Completeness.HeytingCompleteness]glb_alg [in FOL.Completeness.HeytingCompleteness]
H
hset_impl_proper [in FOL.Completeness.HeytingMacNeille]hset_join_proper [in FOL.Completeness.HeytingMacNeille]
hset_meet_proper [in FOL.Completeness.HeytingMacNeille]
hset_sub_proper [in FOL.Completeness.HeytingMacNeille]
hset_elem_proper [in FOL.Completeness.HeytingMacNeille]
hset_equiv_equiv [in FOL.Completeness.HeytingMacNeille]
I
interp_nat [in FOL.Tennenbaum.Peano]K
K_std [in FOL.Completeness.KripkeCompleteness]K_ctx [in FOL.Completeness.KripkeCompleteness]
L
lb_calg [in FOL.Completeness.HeytingCompleteness]lb_alg [in FOL.Completeness.HeytingCompleteness]
lb_proper [in FOL.Completeness.HeytingMacNeille]
M
MinZF_Leibniz [in FOL.Proofmode.DemoMinZF]model_bot [in FOL.Completeness.KripkeCompleteness]
model_fragment [in FOL.Completeness.TarskiCompleteness]
model_bot [in FOL.Completeness.TarskiCompleteness]
N
normal_proper [in FOL.Completeness.HeytingMacNeille]P
PA_reflector [in FOL.Reification.DemoPA]PA_Leibniz [in FOL.Proofmode.DemoPA]
PA_reflector_ext [in FOL.Reification.DemoPAExtensional]
PA_reflector [in FOL.Reification.DemoPAExtensional]
PA_Leibniz [in FOL.Incompleteness.fol_utils]
preorder_HA [in FOL.Semantics.Heyting.Heyting]
proper_HA_Inf_indexed [in FOL.Semantics.Heyting.Heyting]
proper_HA_Sup_indexed [in FOL.Semantics.Heyting.Heyting]
proper_HA_Sup [in FOL.Semantics.Heyting.Heyting]
proper_HA_Inf [in FOL.Semantics.Heyting.Heyting]
proper_HA_Impl [in FOL.Semantics.Heyting.Heyting]
proper_HA_Join [in FOL.Semantics.Heyting.Heyting]
proper_HA_Meet [in FOL.Semantics.Heyting.Heyting]
prv_WeakClass [in FOL.Proofmode.ProofMode]
prv_FalsityDeductionRules [in FOL.Proofmode.ProofMode]
prv_ClassicalDeductionRules [in FOL.Proofmode.ProofMode]
prv_DeductionRules [in FOL.Proofmode.ProofMode]
S
string_eq_decidable [in FOL.Reification.GeneralReflection]subrelation_HA_flip [in FOL.Semantics.Heyting.Heyting]
subrelation_HA [in FOL.Semantics.Heyting.Heyting]
T
tprv_WeakClass [in FOL.Proofmode.ProofMode]tprv_FalsityDeductionRules [in FOL.Proofmode.ProofMode]
tprv_ClassicalDeductionRules [in FOL.Proofmode.ProofMode]
tprv_DeductionRules [in FOL.Proofmode.ProofMode]
U
ub_proper [in FOL.Completeness.HeytingMacNeille]Z
ZF_Leibniz [in FOL.Proofmode.DemoZF]Section Index
A
abstract [in FOL.Incompleteness.abstract_incompleteness]Abstract [in FOL.Incompleteness.Abstract]
AbstractReflectionDefinitions [in FOL.Reification.GeneralReflection]
abstract.halt [in FOL.Incompleteness.abstract_incompleteness]
abstract.halt [in FOL.Incompleteness.abstract_incompleteness]
abstract.insep [in FOL.Incompleteness.abstract_incompleteness]
abstract.insep [in FOL.Incompleteness.abstract_incompleteness]
abstract.insep [in FOL.Incompleteness.abstract_incompleteness]
Abstract.Reduction [in FOL.Incompleteness.Abstract]
Arithmetic [in FOL.Incompleteness.PA_incompleteness]
ArithmeticalHierarchyEquiv [in FOL.ArithmeticalHierarchy.ArithmeticalHierarchyEquiv]
ArithmeticalHierarchySemantic [in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySemantic]
ArithmeticalHierarchySyntactic [in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySyntactic]
Arithmetic.Model [in FOL.Incompleteness.PA_incompleteness]
Arithmetic.Theory [in FOL.Incompleteness.PA_incompleteness]
B
bin_qdec.lemmas [in FOL.Incompleteness.bin_qdec]bin_qdec [in FOL.Incompleteness.bin_qdec]
BSoundness [in FOL.Semantics.Heyting.Soundness]
C
Cantor [in FOL.Tennenbaum.CantorPairing]CHAEval [in FOL.Semantics.Heyting.Heyting]
CHAProperty [in FOL.Semantics.Heyting.Heyting]
ChurchThesis [in FOL.Tennenbaum.Church]
Classical [in FOL.Proofmode.ProofMode]
Coding [in FOL.Tennenbaum.Abstract_coding]
Completeness [in FOL.Completeness.TarskiCompleteness]
Completeness.BotModel [in FOL.Completeness.TarskiCompleteness]
Completeness.ExplodingCompleteness [in FOL.Completeness.TarskiCompleteness]
Completeness.ExplodingCompletenessConstr [in FOL.Completeness.TarskiCompleteness]
Completeness.FragmentCompleteness [in FOL.Completeness.TarskiCompleteness]
Completeness.FragmentCompleteness [in FOL.Completeness.TarskiCompleteness]
Completeness.FragmentModel [in FOL.Completeness.TarskiCompleteness]
Completeness.LEM_Equivalence [in FOL.Completeness.TarskiCompleteness]
Completeness.MPStrongCompleteness [in FOL.Completeness.TarskiCompleteness]
Completeness.MP_Equivalence [in FOL.Completeness.TarskiCompleteness]
Completeness.MP_prop_Equivalence.T_sigma [in FOL.Completeness.TarskiCompleteness]
Completeness.MP_prop_Equivalence [in FOL.Completeness.TarskiCompleteness]
Completeness.StandardCompleteness [in FOL.Completeness.TarskiCompleteness]
Composition [in FOL.Completeness.TarskiConstructions]
conservativity [in FOL.Incompleteness.sigma1]
Consistency [in FOL.Completeness.Consistency]
Consistency.Classical [in FOL.Completeness.Consistency]
ContextUtil [in FOL.Proofmode.ProofMode]
CoqRosser.CoqRosser [in FOL.Tennenbaum.HA_insep]
ctq [in FOL.Incompleteness.ctq]
ctq [in FOL.Incompleteness.ctq]
ctq [in FOL.Incompleteness.ctq]
ctq_repr [in FOL.Incompleteness.ctq]
ctq_epf [in FOL.Incompleteness.ctq]
E
Enumeration [in FOL.Completeness.EnumerationUtils]Enumeration.nat_inject [in FOL.Completeness.EnumerationUtils]
EnvConstructor [in FOL.Reification.GeneralReflection]
EnvHelpers [in FOL.Reification.GeneralReflection]
epf [in FOL.Incompleteness.epf]
epf_nat_bool [in FOL.Incompleteness.epf]
F
facts [in FOL.Incompleteness.formal_systems]FailureMonad [in FOL.Reification.GeneralReflection]
Fapply [in FOL.Proofmode.ProofMode]
Fassert [in FOL.Proofmode.ProofMode]
Fdestruct [in FOL.Proofmode.ProofMode]
Fintro [in FOL.Proofmode.ProofMode]
FixSignature [in FOL.Incompleteness.Axiomatisations]
FixSignature.Axiomatisations [in FOL.Incompleteness.Axiomatisations]
FixSignature.Reduction [in FOL.Incompleteness.Axiomatisations]
fol [in FOL.Incompleteness.fol_incompleteness]
fol [in FOL.Incompleteness.epf_mu]
fol_fs [in FOL.Incompleteness.fol_incompleteness]
fol.dprm [in FOL.Incompleteness.epf_mu]
fol.incomplete_strong_repr [in FOL.Incompleteness.fol_incompleteness]
fol.Q_incomplete [in FOL.Incompleteness.fol_incompleteness]
fol.Q_weakly_represents [in FOL.Incompleteness.epf_mu]
FrewriteEquiv [in FOL.Proofmode.ProofMode]
FullLogic [in FOL.Proofmode.DemoPA]
FullSequent [in FOL.Deduction.FullSequent]
G
GenCons [in FOL.Completeness.TarskiConstructions]GenCons.Explosion [in FOL.Completeness.TarskiConstructions]
GenCons.Henkin [in FOL.Completeness.TarskiConstructions]
GenCons.Omega [in FOL.Completeness.TarskiConstructions]
GenCons.Union [in FOL.Completeness.TarskiConstructions]
Gentzen [in FOL.Deduction.FragmentSequent]
Gentzen [in FOL.Deduction.FragmentSequentFacts]
Gentzen.CutElimination [in FOL.Deduction.FragmentSequentFacts]
Gentzen.Enumerability [in FOL.Deduction.FragmentSequentFacts]
Gentzen.Soundness [in FOL.Deduction.FragmentSequentFacts]
Gentzen.Weakening [in FOL.Deduction.FragmentSequentFacts]
H
HAProperty [in FOL.Semantics.Heyting.Heyting]HA_insep [in FOL.Tennenbaum.HA_insep]
Homomorphism [in FOL.Tennenbaum.NumberUtils]
I
Instantiation [in FOL.Incompleteness.Abstract]IntroPattern [in FOL.Proofmode.ProofMode]
K
KripkeCompleteness [in FOL.Completeness.KripkeCompleteness]KripkeCompleteness.BottomlessCompleteness [in FOL.Completeness.KripkeCompleteness]
KripkeCompleteness.Contexts [in FOL.Completeness.KripkeCompleteness]
KripkeCompleteness.ExplodingCompleteness [in FOL.Completeness.KripkeCompleteness]
KripkeCompleteness.LEM_Equivalence [in FOL.Completeness.KripkeCompleteness]
KripkeCompleteness.MP_Equivalence [in FOL.Completeness.KripkeCompleteness]
KripkeCompleteness.Stability [in FOL.Completeness.KripkeCompleteness]
KripkeCompleteness.StandardCompleteness [in FOL.Completeness.KripkeCompleteness]
L
lemmas [in FOL.Incompleteness.fol_utils]Lindenbaum [in FOL.Completeness.HeytingCompleteness]
Lindenbaum.Completeness [in FOL.Completeness.HeytingCompleteness]
Lindenbaum.Completeness [in FOL.Completeness.HeytingCompleteness]
M
MacNeille [in FOL.Completeness.HeytingMacNeille]MainReificationFunctions [in FOL.Reification.GeneralReflection]
MetaCoqUtils [in FOL.Reification.GeneralReflection]
MinZF [in FOL.Proofmode.DemoMinZF]
Model [in FOL.Tennenbaum.Variants]
Model [in FOL.Tennenbaum.Tennenbaum_insep]
Model [in FOL.Tennenbaum.Tennenbaum_diagonal]
Model [in FOL.Tennenbaum.Coding]
Models [in FOL.Tennenbaum.Peano]
Models.PA_Model.Euclid [in FOL.Tennenbaum.Peano]
Models.PA_Model.Induction [in FOL.Tennenbaum.Peano]
Models.PA_Model [in FOL.Tennenbaum.Peano]
Model.Coding [in FOL.Tennenbaum.Coding]
Model.Coding.notStd [in FOL.Tennenbaum.Coding]
Model.Facts [in FOL.Tennenbaum.Coding]
Model.HA_insep [in FOL.Tennenbaum.Variants]
Model.McCarty [in FOL.Tennenbaum.Variants]
Model.Overspill [in FOL.Tennenbaum.Coding]
Model.Pred [in FOL.Tennenbaum.Coding]
mu [in FOL.Incompleteness.epf_mu]
N
n [in FOL.Incompleteness.fol_utils]ND [in FOL.Tennenbaum.Peano]
P
PM [in FOL.Proofmode.ProofMode]PM [in FOL.Incompleteness.fol_utils]
PNFrules [in FOL.Utils.PrenexNormalForm]
PrenexNormalForm [in FOL.Utils.PrenexNormalForm]
PrimeDec [in FOL.Tennenbaum.NumberUtils]
PrimeInf [in FOL.Tennenbaum.NumberUtils]
prv_utils [in FOL.Tennenbaum.HA_insep]
Q
Qdec [in FOL.Incompleteness.qdec]Qdec.lemmas [in FOL.Incompleteness.qdec]
Q_prv [in FOL.Tennenbaum.Peano]
Q_prv [in FOL.Tennenbaum.Peano]
R
recalg_enum [in FOL.Incompleteness.epf_mu]ReificationExample [in FOL.Reification.DemoPA]
ReificationExample [in FOL.Reification.DemoPAExtensional]
ReificationExample.ReflectionExtension [in FOL.Reification.DemoPAExtensional]
ReificationHelpers [in FOL.Reification.GeneralReflection]
Rosser [in FOL.Tennenbaum.HA_insep]
S
Sequent_def [in FOL.Deduction.FullSequentFacts]Sigma1 [in FOL.Incompleteness.sigma1]
Sigma1 [in FOL.Incompleteness.sigma1]
Sigma1completeness [in FOL.Incompleteness.sigma1]
Sigma1completeness [in FOL.Incompleteness.sigma1]
Soundness [in FOL.Semantics.Heyting.Soundness]
StandardModel [in FOL.Tennenbaum.Peano]
stdModel [in FOL.Tennenbaum.Peano]
T
TarskiMerging [in FOL.Reification.GeneralReflection]Theories [in FOL.Proofmode.Theories]
Theories [in FOL.Proofmode.Theories]
U
Uniqueness [in FOL.Tennenbaum.NumberUtils]V
value_disjoint.weak_strong [in FOL.Incompleteness.weak_strong]value_disjoint.value_disjoint' [in FOL.Incompleteness.weak_strong]
value_disjoint [in FOL.Incompleteness.weak_strong]
Z
ZF [in FOL.Proofmode.DemoZF]Abbreviation Index
B
baseLogicConn [in FOL.Reification.GeneralReflection]baseLogicConn [in FOL.Reification.GeneralReflection]
D
dec_eq_nat [in FOL.Tennenbaum.NumberUtils]F
form [in FOL.Reification.GeneralReflection]form [in FOL.Reification.GeneralReflection]
I
inu [in FOL.Tennenbaum.Coding]is_sup [in FOL.Semantics.Heyting.Heyting]
is_inf [in FOL.Semantics.Heyting.Heyting]
L
ldec [in FOL.Completeness.TarskiCompleteness]P
preds [in FOL.Reification.GeneralReflection]preds [in FOL.Reification.GeneralReflection]
Q
Q [in FOL.Tennenbaum.Variants]Q [in FOL.Tennenbaum.Church]
Q [in FOL.Tennenbaum.Tennenbaum_insep]
Q [in FOL.Tennenbaum.Peano]
Q [in FOL.Tennenbaum.Peano]
Q [in FOL.Tennenbaum.Peano]
Q [in FOL.Tennenbaum.Tennenbaum_diagonal]
Q [in FOL.Tennenbaum.Coding]
Q [in FOL.Tennenbaum.Formulas]
S
shift [in FOL.Utils.PrenexNormalForm]string [in FOL.Reification.GeneralReflection]
syms [in FOL.Reification.GeneralReflection]
syms [in FOL.Reification.GeneralReflection]
T
term [in FOL.Reification.GeneralReflection]term [in FOL.Reification.GeneralReflection]
term [in FOL.Reification.GeneralReflection]
U
upN [in FOL.Utils.PrenexNormalForm]V
vec [in FOL.Utils.PrenexNormalForm]vec [in FOL.Proofmode.Theories]
vec [in FOL.Proofmode.Hoas]
vec [in FOL.ArithmeticalHierarchy.ArithmeticalHierarchyEquiv]
vec [in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySemantic]
vec [in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySyntactic]
vectorCons [in FOL.Reification.GeneralReflection]
vectorNil [in FOL.Reification.GeneralReflection]
Definition Index
A
A [in FOL.Tennenbaum.Tennenbaum_insep]A [in FOL.Completeness.TarskiCompleteness]
addRelIndex [in FOL.Reification.GeneralReflection]
anyVariableOf [in FOL.Reification.GeneralReflection]
appendAndLift [in FOL.Reification.GeneralReflection]
appendZero [in FOL.Reification.GeneralReflection]
applyRecursively [in FOL.Reification.GeneralReflection]
applyRecursivelyNP [in FOL.Reification.GeneralReflection]
ax_eq_elem [in FOL.Proofmode.DemoZF]
ax_trans [in FOL.Proofmode.DemoZF]
ax_sym [in FOL.Proofmode.DemoZF]
ax_refl [in FOL.Proofmode.DemoZF]
B
B [in FOL.Tennenbaum.Tennenbaum_insep]baseConnectiveReifier [in FOL.Reification.GeneralReflection]
baseConnectiveReifierNP [in FOL.Reification.GeneralReflection]
baseConnectiveVars [in FOL.Reification.GeneralReflection]
bform_sind [in FOL.Proofmode.Hoas]
bform_rec [in FOL.Proofmode.Hoas]
bform_ind [in FOL.Proofmode.Hoas]
bform_rect [in FOL.Proofmode.Hoas]
big_or [in FOL.Deduction.FullSequentFacts]
bij [in FOL.Tennenbaum.SyntheticInType]
bijection [in FOL.Tennenbaum.CantorPairing]
binary [in FOL.Tennenbaum.Church]
binary [in FOL.Tennenbaum.Coding]
binary [in FOL.Tennenbaum.Formulas]
bind [in FOL.Reification.GeneralReflection]
binZ' [in FOL.Incompleteness.Axiomatisations]
boolean [in FOL.Semantics.Heyting.Heyting]
bool_to_nat [in FOL.Incompleteness.epf]
bterm_sind [in FOL.Proofmode.Hoas]
bterm_rec [in FOL.Proofmode.Hoas]
bterm_ind [in FOL.Proofmode.Hoas]
bterm_rect [in FOL.Proofmode.Hoas]
buildDefaultTarski [in FOL.Reification.GeneralReflection]
bvalid [in FOL.Completeness.HeytingCompleteness]
C
cast [in FOL.Proofmode.ProofMode]cblackbox [in FOL.Proofmode.ProofMode]
ccons [in FOL.Proofmode.ProofMode]
clb_Pr [in FOL.Completeness.HeytingCompleteness]
closed [in FOL.Incompleteness.Abstract]
cnil [in FOL.Proofmode.ProofMode]
code [in FOL.Tennenbaum.CantorPairing]
complete [in FOL.Incompleteness.formal_systems]
complete [in FOL.Incompleteness.Axiomatisations]
completeness [in FOL.Incompleteness.Abstract]
completeness_enumerable [in FOL.Completeness.TarskiCompleteness]
completeness_Sigma_0_1 [in FOL.Completeness.TarskiCompleteness]
completeness_arbitrary [in FOL.Completeness.TarskiCompleteness]
completion_calgebra [in FOL.Completeness.HeytingMacNeille]
completion_algebra [in FOL.Completeness.HeytingMacNeille]
computational_explosion_is_sane [in FOL.Incompleteness.Axiomatisations]
computational_explosion [in FOL.Incompleteness.Axiomatisations]
comp_part_partial [in FOL.Incompleteness.utils]
comp_part_total [in FOL.Incompleteness.utils]
cons [in FOL.Completeness.KripkeCompleteness]
consistent [in FOL.Completeness.Consistency]
consistent_max [in FOL.Completeness.Consistency]
constructForm [in FOL.Reification.GeneralReflection]
constructTerm [in FOL.Reification.GeneralReflection]
cons_ctx [in FOL.Completeness.KripkeCompleteness]
conv [in FOL.Proofmode.Hoas]
convert [in FOL.Proofmode.Hoas]
convert_PNF [in FOL.Utils.PrenexNormalForm]
conv_form [in FOL.Utils.PrenexNormalForm]
conv_list [in FOL.Utils.PrenexNormalForm]
conv_term [in FOL.Proofmode.Hoas]
CoqRosser.rosser [in FOL.Tennenbaum.HA_insep]
core_valid [in FOL.Incompleteness.utils]
createEnvTerms [in FOL.Reification.GeneralReflection]
CTQ [in FOL.Incompleteness.ctq]
CTQ_total [in FOL.Incompleteness.ctq]
ctx_incl [in FOL.Completeness.KripkeCompleteness]
CT_Q [in FOL.Tennenbaum.Church]
cycle_shift [in FOL.Deduction.FullSequentFacts]
D
dclosed [in FOL.Completeness.HeytingMacNeille]Dec [in FOL.Tennenbaum.SyntheticInType]
dec [in FOL.Tennenbaum.SyntheticInType]
decider [in FOL.Tennenbaum.SyntheticInType]
decide_string_eq [in FOL.Reification.GeneralReflection]
decode [in FOL.Tennenbaum.CantorPairing]
Dec_sigT [in FOL.Tennenbaum.SyntheticInType]
decΔ1syn [in FOL.ArithmeticalHierarchy.ArithmeticalHierarchyEquiv]
decΣ1syn [in FOL.ArithmeticalHierarchy.ArithmeticalHierarchyEquiv]
dedup [in FOL.Reification.GeneralReflection]
defaultExtensions [in FOL.Reification.GeneralReflection]
Definite [in FOL.Tennenbaum.SyntheticInType]
definite [in FOL.Tennenbaum.SyntheticInType]
def_HA_Insep [in FOL.Tennenbaum.Variants]
digit_to_string [in FOL.Proofmode.ProofMode]
Discrete [in FOL.Tennenbaum.SyntheticInType]
div [in FOL.Tennenbaum.Tennenbaum_insep]
Div [in FOL.Tennenbaum.NumberUtils]
div [in FOL.Tennenbaum.Coding]
div_pi [in FOL.Tennenbaum.Variants]
Div_nat [in FOL.Tennenbaum.Variants]
div_pi [in FOL.Tennenbaum.Tennenbaum_insep]
Div_nat [in FOL.Tennenbaum.Tennenbaum_insep]
div_num [in FOL.Tennenbaum.Tennenbaum_insep]
div_pi [in FOL.Tennenbaum.Tennenbaum_diagonal]
div_num [in FOL.Tennenbaum.Tennenbaum_diagonal]
div_pi [in FOL.Tennenbaum.Coding]
Div_nat [in FOL.Tennenbaum.Coding]
div_num [in FOL.Tennenbaum.Coding]
DN [in FOL.Utils.PrenexNormalForm]
DN [in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySemantic]
DN [in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySyntactic]
DNE [in FOL.Tennenbaum.SyntheticInType]
DN.bind_ [in FOL.Tennenbaum.DN_Utils]
DN.dne_ [in FOL.Tennenbaum.DN_Utils]
DN.lem_ [in FOL.Tennenbaum.DN_Utils]
DN.remove_ [in FOL.Tennenbaum.DN_Utils]
DN.ret_ [in FOL.Tennenbaum.DN_Utils]
down [in FOL.Completeness.HeytingMacNeille]
DPexp1 [in FOL.Completeness.TarskiConstructions]
DPexp2 [in FOL.Completeness.TarskiConstructions]
DPexp3 [in FOL.Completeness.TarskiConstructions]
E
econsistent [in FOL.Completeness.TarskiConstructions]econsistent_join [in FOL.Completeness.TarskiConstructions]
embed [in FOL.Completeness.HeytingMacNeille]
embed [in FOL.Deduction.FragmentSequentFacts]
embed_poly [in FOL.Incompleteness.epf_mu]
embed' [in FOL.Incompleteness.ctq]
Enumerable [in FOL.Tennenbaum.SyntheticInType]
enumerable [in FOL.Tennenbaum.SyntheticInType]
enum_ZF_preds [in FOL.Incompleteness.Axiomatisations]
enum_ZF_syms [in FOL.Incompleteness.Axiomatisations]
enum_PA_preds [in FOL.Incompleteness.Axiomatisations]
enum_PA_syms [in FOL.Incompleteness.Axiomatisations]
EPF_N [in FOL.Incompleteness.epf]
EPF_B [in FOL.Incompleteness.epf]
eqH [in FOL.Semantics.Heyting.Heyting]
equiv_HA [in FOL.Semantics.Heyting.Heyting]
equiv_form [in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySyntactic]
Euclid [in FOL.Tennenbaum.NumberUtils]
exist_times [in FOL.Tennenbaum.Peano]
Exp [in FOL.Completeness.TarskiConstructions]
exp [in FOL.Completeness.TarskiConstructions]
exploding [in FOL.Completeness.TarskiConstructions]
expl_interp [in FOL.Completeness.TarskiCompleteness]
exp_axiom [in FOL.Completeness.TarskiConstructions]
extend [in FOL.Proofmode.Theories]
extension [in FOL.Incompleteness.formal_systems]
extensional_model [in FOL.Tennenbaum.Peano]
ext_nat [in FOL.Incompleteness.PA_incompleteness]
F
factorial [in FOL.Tennenbaum.NumberUtils]FAeq [in FOL.Proofmode.DemoPA]
FAI [in FOL.Proofmode.DemoPA]
FailureMonad_sind [in FOL.Reification.GeneralReflection]
FailureMonad_rec [in FOL.Reification.GeneralReflection]
FailureMonad_ind [in FOL.Reification.GeneralReflection]
FailureMonad_rect [in FOL.Reification.GeneralReflection]
fail_fmap' [in FOL.Reification.GeneralReflection]
fail_fmap [in FOL.Reification.GeneralReflection]
findPropRepresentation [in FOL.Reification.GeneralReflection]
findPropRepresentationNP [in FOL.Reification.GeneralReflection]
findTermRepresentation [in FOL.Reification.GeneralReflection]
findTermRepresentationNP [in FOL.Reification.GeneralReflection]
findUBAnd [in FOL.Reification.GeneralReflection]
findUBBase [in FOL.Reification.GeneralReflection]
findUBExists [in FOL.Reification.GeneralReflection]
findUBFalse [in FOL.Reification.GeneralReflection]
findUBIff [in FOL.Reification.GeneralReflection]
findUBNot [in FOL.Reification.GeneralReflection]
findUBOr [in FOL.Reification.GeneralReflection]
findUBRecursively [in FOL.Reification.GeneralReflection]
findUBTrue [in FOL.Reification.GeneralReflection]
findUnboundVariablesForm [in FOL.Reification.GeneralReflection]
findUnboundVariablesTerm [in FOL.Reification.GeneralReflection]
findVarsTerm [in FOL.Reification.DemoPAExtensional]
fin_to_n [in FOL.Incompleteness.epf_mu]
fin_conj [in FOL.Incompleteness.qdec]
fin_disj [in FOL.Incompleteness.qdec]
flatten_monad [in FOL.Reification.GeneralReflection]
fol_fs [in FOL.Incompleteness.fol_incompleteness]
form_enum_with_default [in FOL.Completeness.EnumerationUtils]
form_list_enum_bounded [in FOL.Completeness.EnumerationUtils]
form_list_enum [in FOL.Completeness.EnumerationUtils]
fprv_sind [in FOL.Deduction.FullSequent]
fprv_ind [in FOL.Deduction.FullSequent]
from_form [in FOL.Completeness.EnumerationUtils]
Fr_pres [in FOL.Incompleteness.PA_incompleteness]
FUEL [in FOL.Reification.GeneralReflection]
F_P [in FOL.Completeness.KripkeCompleteness]
f2t [in FOL.Reification.GeneralReflection]
G
glb_Pr [in FOL.Completeness.HeytingCompleteness]H
helperFormReifierType [in FOL.Reification.GeneralReflection]helperFormVarsType [in FOL.Reification.GeneralReflection]
helperTermReifierType [in FOL.Reification.GeneralReflection]
helperTermVarsType [in FOL.Reification.GeneralReflection]
Henkin [in FOL.Completeness.TarskiConstructions]
henkin [in FOL.Completeness.TarskiConstructions]
henkin_axiom [in FOL.Completeness.TarskiConstructions]
HiddenTerm [in FOL.Reification.GeneralReflection]
hsat [in FOL.Semantics.Heyting.Heyting]
hsat_L [in FOL.Semantics.Heyting.Heyting]
hset [in FOL.Completeness.HeytingMacNeille]
hset_impl [in FOL.Completeness.HeytingMacNeille]
hset_inf [in FOL.Completeness.HeytingMacNeille]
hset_join [in FOL.Completeness.HeytingMacNeille]
hset_meet [in FOL.Completeness.HeytingMacNeille]
hset_bot [in FOL.Completeness.HeytingMacNeille]
hset_equiv [in FOL.Completeness.HeytingMacNeille]
hset_sub [in FOL.Completeness.HeytingMacNeille]
hset_elem [in FOL.Completeness.HeytingMacNeille]
hvalid [in FOL.Completeness.HeytingCompleteness]
I
ident_name_sind [in FOL.Proofmode.ProofMode]ident_name_rec [in FOL.Proofmode.ProofMode]
ident_name_ind [in FOL.Proofmode.ProofMode]
ident_name_rect [in FOL.Proofmode.ProofMode]
iffT [in FOL.Tennenbaum.NumberUtils]
iffT [in FOL.Tennenbaum.SyntheticInType]
IndependenceOfGeneralPremises [in FOL.Utils.PrenexNormalForm]
independent [in FOL.Incompleteness.formal_systems]
Inf_indexed [in FOL.Semantics.Heyting.Heyting]
inj [in FOL.Tennenbaum.CantorPairing]
inj [in FOL.Tennenbaum.SyntheticInType]
input_fragment [in FOL.Completeness.TarskiCompleteness]
input_bot [in FOL.Completeness.TarskiCompleteness]
Insep_form [in FOL.Tennenbaum.Tennenbaum_insep]
Insep_pred [in FOL.Tennenbaum.Tennenbaum_insep]
interp_nat_noeq [in FOL.Tennenbaum.Peano]
interp_nat [in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySyntactic]
intro_pattern_sind [in FOL.Proofmode.ProofMode]
intro_pattern_rec [in FOL.Proofmode.ProofMode]
intro_pattern_ind [in FOL.Proofmode.ProofMode]
intro_pattern_rect [in FOL.Proofmode.ProofMode]
inu [in FOL.Tennenbaum.Peano]
inum [in FOL.Reification.DemoPAExtensional]
inv [in FOL.Tennenbaum.CantorPairing]
in_theory [in FOL.Proofmode.Theories]
in_theory [in FOL.Tennenbaum.Peano]
Irred [in FOL.Tennenbaum.NumberUtils]
irred [in FOL.Tennenbaum.NumberUtils]
irred' [in FOL.Tennenbaum.NumberUtils]
isIn [in FOL.Reification.GeneralReflection]
isPNF_bool [in FOL.Utils.PrenexNormalForm]
is_universal [in FOL.Incompleteness.epf]
is_Henkin [in FOL.Completeness.TarskiConstructions]
isΔform [in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySyntactic]
isΔf_ind [in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySyntactic]
isΔsyn [in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySyntactic]
isΠform [in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySyntactic]
isΠf_ind_isΣf_ind_ind [in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySyntactic]
isΠf_ind_sind [in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySyntactic]
isΠf_ind_ind [in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySyntactic]
isΠsem_isΣsem_ind [in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySemantic]
isΠsem_sind [in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySemantic]
isΠsem_ind [in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySemantic]
isΠsyn [in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySyntactic]
isΣform [in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySyntactic]
isΣf_ind_isΠf_ind_ind [in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySyntactic]
isΣf_ind_sind [in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySyntactic]
isΣf_ind_ind [in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySyntactic]
isΣsem_isΠsem_ind [in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySemantic]
isΣsem_sind [in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySemantic]
isΣsem_ind [in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySemantic]
isΣsyn [in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySyntactic]
I' [in FOL.Tennenbaum.Variants]
I' [in FOL.Tennenbaum.Tennenbaum_insep]
I' [in FOL.Tennenbaum.Peano]
I' [in FOL.Tennenbaum.Coding]
I'' [in FOL.Tennenbaum.Peano]
J
join [in FOL.Tennenbaum.Peano]K
kcompleteness_arbitrary [in FOL.Completeness.KripkeCompleteness]kcompleteness_enumerable [in FOL.Completeness.KripkeCompleteness]
K_completeness [in FOL.Completeness.KripkeCompleteness]
L
lb [in FOL.Completeness.HeytingMacNeille]lb_Pr [in FOL.Completeness.HeytingCompleteness]
ldecidable [in FOL.Utils.MPFacts]
ldecidable [in FOL.Incompleteness.Abstract]
LEM [in FOL.Incompleteness.Axiomatisations]
LEM [in FOL.Completeness.KripkeCompleteness]
LEM [in FOL.Tennenbaum.SyntheticInType]
LEM [in FOL.Completeness.TarskiCompleteness]
leq [in FOL.Proofmode.DemoPA]
list_enum_to_enum [in FOL.Completeness.EnumerationUtils]
list_theory [in FOL.Incompleteness.Axiomatisations]
list_quantop [in FOL.Deduction.FragmentSequentFacts]
list_binop [in FOL.Deduction.FragmentSequentFacts]
lowerRelIndex [in FOL.Reification.GeneralReflection]
L_tseq [in FOL.Deduction.FragmentSequentFacts]
L_seq [in FOL.Deduction.FragmentSequentFacts]
M
mAnd [in FOL.Reification.GeneralReflection]mapT [in FOL.Proofmode.Theories]
map_def_fail [in FOL.Reification.GeneralReflection]
map_branch_fail [in FOL.Reification.GeneralReflection]
map_predicate_fail [in FOL.Reification.GeneralReflection]
map_monad [in FOL.Reification.GeneralReflection]
Markov [in FOL.Tennenbaum.SyntheticInType]
Markov [in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySemantic]
matchBaseLogicConn [in FOL.Reification.GeneralReflection]
maximal [in FOL.Completeness.TarskiConstructions]
maybeD [in FOL.Reification.GeneralReflection]
mergeAnd [in FOL.Reification.GeneralReflection]
mergeEqProp [in FOL.Reification.DemoPAExtensional]
mergeExists [in FOL.Reification.GeneralReflection]
mergeFalse [in FOL.Reification.GeneralReflection]
mergeForall [in FOL.Reification.GeneralReflection]
mergeForm [in FOL.Reification.GeneralReflection]
mergeFormBase [in FOL.Reification.GeneralReflection]
mergeFormProto [in FOL.Reification.GeneralReflection]
mergeFormProtoType [in FOL.Reification.GeneralReflection]
mergeIff [in FOL.Reification.GeneralReflection]
mergeImpl [in FOL.Reification.GeneralReflection]
mergeNot [in FOL.Reification.GeneralReflection]
mergeNum [in FOL.Reification.DemoPAExtensional]
mergeOr [in FOL.Reification.GeneralReflection]
mergeTerm [in FOL.Reification.GeneralReflection]
mergeTermBase [in FOL.Reification.GeneralReflection]
mergeTermProto [in FOL.Reification.GeneralReflection]
mergeTermProtoType [in FOL.Reification.GeneralReflection]
mergeTrue [in FOL.Reification.GeneralReflection]
mExists [in FOL.Reification.GeneralReflection]
mFalse [in FOL.Reification.GeneralReflection]
mForall [in FOL.Reification.GeneralReflection]
mIff [in FOL.Reification.GeneralReflection]
mImpl [in FOL.Reification.GeneralReflection]
minZ' [in FOL.Incompleteness.Axiomatisations]
mNot [in FOL.Reification.GeneralReflection]
Mod [in FOL.Tennenbaum.NumberUtils]
mOr [in FOL.Reification.GeneralReflection]
move_to_front [in FOL.Proofmode.ProofMode]
MP [in FOL.Utils.MPFacts]
MP [in FOL.Tennenbaum.SyntheticInType]
MP_pred [in FOL.Completeness.TarskiCompleteness]
MP_prop [in FOL.Completeness.TarskiCompleteness]
mTrue [in FOL.Reification.GeneralReflection]
mu [in FOL.Utils.MPFacts]
mu [in FOL.Incompleteness.Abstract]
mu [in FOL.Incompleteness.utils]
mu_step [in FOL.Incompleteness.epf_mu]
mu_semi_decidable [in FOL.Incompleteness.epf_mu]
N
named_var [in FOL.Proofmode.ProofMode]named_quant [in FOL.Proofmode.ProofMode]
naryGFunc [in FOL.Reification.GeneralReflection]
naryProp [in FOL.Reification.GeneralReflection]
nary3GFunc [in FOL.Reification.GeneralReflection]
nat_recalg [in FOL.Incompleteness.epf_mu]
nat_recalg' [in FOL.Incompleteness.epf_mu]
nat_hom [in FOL.Tennenbaum.Peano]
nat_to_bool [in FOL.Incompleteness.epf]
nat_to_string [in FOL.Proofmode.ProofMode]
nat_to_string' [in FOL.Proofmode.ProofMode]
next [in FOL.Tennenbaum.CantorPairing]
nonStd [in FOL.Tennenbaum.Peano]
noProofDummy [in FOL.Reification.GeneralReflection]
noQuant_ind_rec [in FOL.Utils.PrenexNormalForm]
noQuant_ind_sind [in FOL.Utils.PrenexNormalForm]
noQuant_ind_ind [in FOL.Utils.PrenexNormalForm]
noQuant_bool [in FOL.Utils.PrenexNormalForm]
normal [in FOL.Completeness.HeytingMacNeille]
normal [in FOL.Deduction.FragmentSequentFacts]
notStd [in FOL.Tennenbaum.Peano]
not_AllI [in FOL.Deduction.FragmentSequentFacts]
not_II [in FOL.Deduction.FragmentSequentFacts]
num [in FOL.Proofmode.DemoPA]
num [in FOL.Reification.DemoPAExtensional]
O
Omega [in FOL.Completeness.TarskiConstructions]omega [in FOL.Completeness.TarskiConstructions]
orelse [in FOL.Reification.GeneralReflection]
output_fragment [in FOL.Completeness.TarskiCompleteness]
output_bot [in FOL.Completeness.TarskiCompleteness]
P
PAQ [in FOL.Tennenbaum.HA_insep]parse_intro_pattern [in FOL.Proofmode.ProofMode]
parse_intro_pattern' [in FOL.Proofmode.ProofMode]
partialise [in FOL.Incompleteness.utils]
part_eval [in FOL.Incompleteness.utils]
PAsat [in FOL.Tennenbaum.Peano]
pm [in FOL.Proofmode.ProofMode]
PNF_ind_rec [in FOL.Utils.PrenexNormalForm]
PNF_ind_sind [in FOL.Utils.PrenexNormalForm]
PNF_ind_ind [in FOL.Utils.PrenexNormalForm]
popListStart [in FOL.Reification.GeneralReflection]
popNElements [in FOL.Reification.GeneralReflection]
prime [in FOL.Tennenbaum.NumberUtils]
proj1 [in FOL.Reification.DemoPA]
proj1 [in FOL.Reification.DemoPAExtensional]
propFinderReifier [in FOL.Reification.GeneralReflection]
propFinderVars [in FOL.Reification.GeneralReflection]
Q
Qdec [in FOL.Incompleteness.qdec]Qeq [in FOL.Incompleteness.fol_utils]
quant_list_to_form [in FOL.Utils.PrenexNormalForm]
quoteNumber [in FOL.Reification.GeneralReflection]
Q' [in FOL.Incompleteness.Axiomatisations]
R
raiseEnvTerm [in FOL.Reification.GeneralReflection]read_name [in FOL.Proofmode.ProofMode]
recalg_nat [in FOL.Incompleteness.epf_mu]
recoverVector [in FOL.Reification.GeneralReflection]
recursively_separates [in FOL.Incompleteness.epf]
reflecting [in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySyntactic]
reifyAnd [in FOL.Reification.GeneralReflection]
reifyAndNP [in FOL.Reification.GeneralReflection]
reifyBase [in FOL.Reification.GeneralReflection]
reifyBaseNP [in FOL.Reification.GeneralReflection]
reifyBLC [in FOL.Reification.DemoPAExtensional]
reifyCoqEq [in FOL.Reification.DemoPAExtensional]
reifyExist [in FOL.Reification.GeneralReflection]
reifyExistNP [in FOL.Reification.GeneralReflection]
reifyFalse [in FOL.Reification.GeneralReflection]
reifyFalseNP [in FOL.Reification.GeneralReflection]
reifyForm [in FOL.Reification.GeneralReflection]
reifyFormNP [in FOL.Reification.GeneralReflection]
reifyIff [in FOL.Reification.GeneralReflection]
reifyIffNP [in FOL.Reification.GeneralReflection]
reifyNot [in FOL.Reification.GeneralReflection]
reifyNotNP [in FOL.Reification.GeneralReflection]
reifyOr [in FOL.Reification.GeneralReflection]
reifyOrNP [in FOL.Reification.GeneralReflection]
reifyTerm [in FOL.Reification.GeneralReflection]
reifyTerm [in FOL.Reification.DemoPAExtensional]
reifyTermNP [in FOL.Reification.GeneralReflection]
reifyTrue [in FOL.Reification.GeneralReflection]
reifyTrueNP [in FOL.Reification.GeneralReflection]
rem [in FOL.Proofmode.Theories]
remove_n [in FOL.Proofmode.ProofMode]
replace [in FOL.Proofmode.ProofMode]
representableF [in FOL.Reification.GeneralReflection]
representableP [in FOL.Reification.GeneralReflection]
represents [in FOL.Tennenbaum.Church]
representsF [in FOL.Reification.GeneralReflection]
representsP [in FOL.Reification.GeneralReflection]
rosser [in FOL.Tennenbaum.HA_insep]
RT [in FOL.Tennenbaum.Church]
RT_weak [in FOL.Tennenbaum.Church]
RT_strong [in FOL.Tennenbaum.Church]
S
self_halting [in FOL.Incompleteness.epf]Separated [in FOL.Tennenbaum.SyntheticInType]
shift_quant [in FOL.Utils.PrenexNormalForm]
shift_down [in FOL.Proofmode.Theories]
Sigma_0_1 [in FOL.Completeness.TarskiCompleteness]
sless [in FOL.Tennenbaum.Peano]
sound [in FOL.Incompleteness.formal_systems]
sprv_sind [in FOL.Deduction.FragmentSequent]
sprv_ind [in FOL.Deduction.FragmentSequent]
Stable [in FOL.Tennenbaum.SyntheticInType]
stable [in FOL.Tennenbaum.SyntheticInType]
stable [in FOL.Completeness.TarskiCompleteness]
std [in FOL.Tennenbaum.Peano]
stdModel [in FOL.Tennenbaum.Peano]
stdModel' [in FOL.Tennenbaum.Peano]
stprv [in FOL.Deduction.FragmentSequent]
stripneg [in FOL.Incompleteness.Axiomatisations]
strongly_separates [in FOL.Incompleteness.formal_systems]
strong_repr [in FOL.Tennenbaum.Church]
subset_T [in FOL.Proofmode.Theories]
subst [in FOL.Reification.GeneralReflection]
Sup [in FOL.Semantics.Heyting.Heyting]
Sup_indexed [in FOL.Semantics.Heyting.Heyting]
surj [in FOL.Tennenbaum.SyntheticInType]
surj_form [in FOL.Tennenbaum.Tennenbaum_insep]
swap_quant [in FOL.Utils.PrenexNormalForm]
T
takeMultiple [in FOL.Reification.GeneralReflection]tblackbox [in FOL.Proofmode.ProofMode]
tcons [in FOL.Proofmode.ProofMode]
tembed [in FOL.Deduction.FragmentSequentFacts]
termFinderReifier [in FOL.Reification.GeneralReflection]
termFinderVars [in FOL.Reification.GeneralReflection]
termReifier [in FOL.Reification.GeneralReflection]
termReifierNP [in FOL.Reification.GeneralReflection]
test [in FOL.Reification.DemoPAExtensional]
tfprv [in FOL.Deduction.FullSequent]
theory [in FOL.Proofmode.Theories]
theory [in FOL.Tennenbaum.Peano]
theta_mu [in FOL.Incompleteness.epf_mu]
theta_self_return [in FOL.Incompleteness.epf]
tnil [in FOL.Proofmode.ProofMode]
Top [in FOL.Semantics.Heyting.Heyting]
to_form [in FOL.Completeness.EnumerationUtils]
tpm [in FOL.Proofmode.ProofMode]
tprv [in FOL.Proofmode.Theories]
tprv_intu [in FOL.Incompleteness.Axiomatisations]
tprv_class [in FOL.Incompleteness.Axiomatisations]
tprv_sind [in FOL.Deduction.FragmentSequentFacts]
tprv_rec [in FOL.Deduction.FragmentSequentFacts]
tprv_ind [in FOL.Deduction.FragmentSequentFacts]
tprv_rect [in FOL.Deduction.FragmentSequentFacts]
treduction [in FOL.Incompleteness.Axiomatisations]
tsprv_sind [in FOL.Deduction.FragmentSequentFacts]
tsprv_rec [in FOL.Deduction.FragmentSequentFacts]
tsprv_ind [in FOL.Deduction.FragmentSequentFacts]
tsprv_rect [in FOL.Deduction.FragmentSequentFacts]
turnFalsityOn [in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySyntactic]
tvalid [in FOL.Incompleteness.Axiomatisations]
U
ub [in FOL.Completeness.HeytingMacNeille]UC [in FOL.Tennenbaum.SyntheticInType]
uCTQ [in FOL.Incompleteness.ctq]
unary [in FOL.Tennenbaum.Church]
unary [in FOL.Tennenbaum.Coding]
unary [in FOL.Tennenbaum.Formulas]
unboundEnv [in FOL.Reification.GeneralReflection]
unembed' [in FOL.Incompleteness.ctq]
union [in FOL.Completeness.TarskiConstructions]
unitFunc [in FOL.Proofmode.StringToIdent]
Unnamed_thm [in FOL.Utils.PrenexNormalForm]
Unnamed_thm2 [in FOL.Proofmode.DemoPA]
Unnamed_thm1 [in FOL.Proofmode.DemoPA]
Unnamed_thm1 [in FOL.Proofmode.DemoPA]
Unnamed_thm1 [in FOL.Proofmode.DemoPA]
Unnamed_thm0 [in FOL.Proofmode.DemoPA]
Unnamed_thm [in FOL.Proofmode.DemoPA]
Unnamed_thm [in FOL.Tennenbaum.NumberUtils]
Unnamed_thm [in FOL.Tennenbaum.HA_insep]
Unnamed_thm0 [in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySemantic]
Unnamed_thm [in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySemantic]
up_n [in FOL.Proofmode.ProofMode]
V
valid [in FOL.Incompleteness.Abstract]varsBLC [in FOL.Reification.DemoPAExtensional]
varsCoqEq [in FOL.Reification.DemoPAExtensional]
VecForall2 [in FOL.Proofmode.ProofMode]
vec_pos_default [in FOL.Incompleteness.epf_mu]
vec_bEmbedT [in FOL.Proofmode.Hoas]
vec_bEmbedT' [in FOL.Proofmode.Hoas]
vec_bterm [in FOL.Proofmode.Hoas]
vec_term [in FOL.Proofmode.Hoas]
vec_to_env [in FOL.ArithmeticalHierarchy.ArithmeticalHierarchySyntactic]
W
WCT_Q [in FOL.Tennenbaum.Church]weakly_represents [in FOL.Incompleteness.formal_systems]
weak_repr [in FOL.Tennenbaum.Church]
Witnessing [in FOL.Tennenbaum.SyntheticInType]
witnessing [in FOL.Tennenbaum.SyntheticInType]
Witnessing_nat [in FOL.Tennenbaum.MoreDecidabilityFacts]
WRT_weak [in FOL.Tennenbaum.Church]
WRT_strong [in FOL.Tennenbaum.Church]
Z
ZF [in FOL.Proofmode.DemoZF]Z' [in FOL.Incompleteness.Axiomatisations]
other
Π1_sind [in FOL.Incompleteness.sigma1]Π1_ind [in FOL.Incompleteness.sigma1]
Σ [in FOL.Tennenbaum.CantorPairing]
Σ1_sind [in FOL.Incompleteness.sigma1]
Σ1_ind [in FOL.Incompleteness.sigma1]
Φ [in FOL.Tennenbaum.Tennenbaum_insep]
φ1' [in FOL.Incompleteness.weak_strong]
φ2' [in FOL.Incompleteness.weak_strong]
ψ [in FOL.Incompleteness.ctq]
ψ' [in FOL.Incompleteness.ctq]
Record Index
C
ClassicalDeductionRules [in FOL.Proofmode.ProofMode]CompleteHeytingAlgebra [in FOL.Semantics.Heyting.Heyting]
ConstructionInputs [in FOL.Completeness.TarskiConstructions]
ConstructionOutputs [in FOL.Completeness.TarskiConstructions]
D
DeductionRules [in FOL.Proofmode.ProofMode]F
FalsityDeductionRules [in FOL.Proofmode.ProofMode]FS [in FOL.Incompleteness.formal_systems]
H
HeytingAlgebra [in FOL.Semantics.Heyting.Heyting]HeytingMorphism [in FOL.Completeness.HeytingMacNeille]
L
Leibniz [in FOL.Proofmode.ProofMode]P
part [in FOL.Incompleteness.utils]T
tarski_reflector_extensions [in FOL.Reification.GeneralReflection]tarski_reflector [in FOL.Reification.GeneralReflection]
W
WeakClass [in FOL.Proofmode.ProofMode]| 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 | (2366 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 | (150 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 | (2 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 | (225 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 | (63 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 | (943 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 | (72 entries) |
| Axiom 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 | (1 entry) |
| 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 | (78 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 | (17 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 | (73 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 | (156 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 | (36 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 | (536 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 | (14 entries) |