structure
definition
LogicRealization
show as:
view math explainer →
open explainer
Generate a durable explainer page for this declaration.
open lean source
IndisputableMonolith.Foundation.LogicRealization on GitHub at line 32.
browse module
All declarations in this module, on Recognition.
explainer page
depends on
-
nontrivial -
of -
step -
LogicNat -
succ -
ArithmeticOf -
of -
identity -
is -
of -
from -
is -
of -
interpret -
interpret_step -
interpret_zero -
is -
of -
is -
Cost -
succ -
identity
used by
-
ArithmeticOf -
canonical -
canonical_peanoSurface -
equivOfInitial -
extracted -
extracted_peanoSurface -
PeanoSurface -
realizationFold -
realization_initial -
realizationLift -
realizationLift_unique_fun -
realizationPeano -
canonicalCategoricalRealization -
categorical_arithmetic_invariant -
bool_arithmetic_invariant -
bool_hasIdentityStep -
boolRealization -
FaithfulArithmeticInterpretation -
hasIdentityStep -
hasIdentityStep_of_nontrivial -
ofPositiveRatioComparison -
positiveRatio_faithful -
modular_arithmetic_invariant -
modularRealization -
natOrderedRealization -
ordered_arithmetic_invariant -
ordered_faithful -
physics_arithmetic_invariant -
physics_faithful -
physicsRealization -
RealityCertificate -
arithmetic_invariant -
arithmeticOf -
arith_universal_initial -
continuous_positive_ratio_arithmetic_invariant -
peano_surface -
universal_forcing -
biologyRealization -
categoricalRealization -
continuousRealization
formal source
29order, category, or discrete structure through the propositions carried here.
30The invariant target is not the ambient carrier; it is the arithmetic object
31extracted from the identity/step data. -/
32structure LogicRealization where
33 Carrier : Type u
34 Cost : Type v
35 zeroCost : Zero Cost
36 compare : Carrier → Carrier → Cost
37 zero : Carrier
38 step : Carrier → Carrier
39 Orbit : Type u
40 orbitZero : Orbit
41 orbitStep : Orbit → Orbit
42 interpret : Orbit → Carrier
43 interpret_zero : interpret orbitZero = zero
44 interpret_step : ∀ n : Orbit, interpret (orbitStep n) = step (interpret n)
45 orbit_no_confusion : ∀ n : Orbit, orbitZero ≠ orbitStep n
46 orbit_step_injective : Function.Injective orbitStep
47 orbit_induction :
48 ∀ P : Orbit → Prop,
49 P orbitZero →
50 (∀ n, P n → P (orbitStep n)) →
51 ∀ n, P n
52 orbitEquivLogicNat : Orbit ≃ LogicNat
53 orbitEquiv_zero : orbitEquivLogicNat orbitZero = LogicNat.zero
54 orbitEquiv_step : ∀ n : Orbit,
55 orbitEquivLogicNat (orbitStep n) = LogicNat.succ (orbitEquivLogicNat n)
56 identity : ∀ x : Carrier, compare x x = 0
57 nonContradiction : ∀ x y : Carrier, compare x y = compare y x
58 excludedMiddle : Prop
59 composition : Prop
60 actionInvariant : Prop
61 nontrivial : ∃ x : Carrier, compare x zero ≠ 0
62
papers checked against this theorem (showing 1 of 1)
-
TTD homomorphism yields low-memory split-beam dictionary
"Corollary 1. ∀Φ1, Φ2 ∈ V1, PΦ1+Φ2 = PΦ1 ⋆ PΦ2; <PT, ⋆> defines a group structure"