inductive
definition
LogicNat
show as:
view math explainer →
open explainer
Generate a durable explainer page for this declaration.
open lean source
IndisputableMonolith.Foundation.ArithmeticFromLogic on GitHub at line 66.
browse module
All declarations in this module, on Recognition.
explainer page
depends on
used by
-
add -
add_assoc -
add_comm -
add_def -
add_left_cancel -
add_right_cancel -
add_succ -
add_zero -
back -
embed -
embed_add -
embed_eq_pow -
embed_injective -
embed_le_iff_of_one_lt -
embed_lt_iff_of_one_lt -
embed_pos -
embed_strictMono_of_one_lt -
embed_succ -
embed_zero -
eq_iff_toNat_eq -
equivNat -
fromNat -
fromNat_toNat -
generatorOfLawsOfLogic -
induction -
le -
le_antisymm -
le_def -
le_refl -
le_succ -
le_trans -
log_generator_ne_zero -
lt -
lt_def -
lt_iff_le_and_ne -
lt_iff_succ_le -
lt_irrefl -
lt_trans -
mul -
mul_add
formal source
63generator. The two-constructor structure mirrors the orbit
64{1, γ, γ², γ³, ...} as the smallest subset of ℝ₊ closed under
65multiplication by γ and containing 1. -/
66inductive LogicNat : Type
67 | identity : LogicNat
68 | step : LogicNat → LogicNat
69 deriving DecidableEq, Repr
70
71namespace LogicNat
72
73/-! ## 2. Zero and Successor (Peano Primitives) -/
74
75/-- Zero is the identity comparison: a thing compared with itself,
76costing zero in J. -/
77@[simp] def zero : LogicNat := .identity
78
79/-- Successor is one more application of the generator. -/
80@[simp] def succ (n : LogicNat) : LogicNat := .step n
81
82/-! ## 3. Peano Axioms as Theorems
83
84Each axiom is a theorem of the inductive structure. None is posited.
85-/
86
87/-- **Peano P1 (zero is not a successor)**: the identity is
88distinguishable from any iterate of the generator. -/
89theorem zero_ne_succ (n : LogicNat) : zero ≠ succ n := by
90 intro h; cases h
91
92/-- **Peano P1, contrapositive**: every successor differs from zero. -/
93theorem succ_ne_zero (n : LogicNat) : succ n ≠ zero := by
94 intro h; cases h
95
96/-- **Peano P2 (successor injectivity)**: forced by the constructor
papers checked against this theorem (showing 30 of 508)
-
McNemar test flags LLM degradations from 0.3% accuracy drops
"Fact 1 (Model Degradation). The accuracy β ... is worse ... iff the degradation probability q↓ > 1/2"
-
Graph edits raise class homophily to lift GNN fairness
"modified supervised contrastive loss and environmental loss"
-
Sharded aggregation matches FedAvg while bounding leakage
"convergence bound (5) under Assumptions 3.1-3.2 (L-smoothness, unbiased estimator with variance C1,C2)"
-
Epistemic regret minimization fixes LLM causal shortcuts
"Interventional Grounding Theorem ... AGM representation theorem"
-
Visual Para-Thinker: Divide-and-Conquer Reasoning for Visual Comprehension
"To maintain path independence ... integrates Pa-Attention alongside LPRoPE ... Mi,j = 1(j≤i)·1(is visible(i,j)) ... k(i)m = Rm(k(i)m + ei)"
-
Reason-IAD boosts industrial anomaly detection with latent reasoning
"iterative exploration within a compact latent space using optimizable latent think tokens"
-
Augmented LMs fix key limits of standard language models
"reasoning is decomposing a potentially complex task into simpler subtasks"
-
Latent draft raises agent safety accuracy from 63 to 91 percent
"excess risk decomposes as Extraction Error + Readout Error"
-
Krylov staggering parameter marks topological phase in Kitaev chain
"the balanced short-range Kitaev chain in Majorana form is exactly the SSH chain ... Krylov recursion ... preserves this alternating-bond matrix structure"
-
Pre-assigned slots fix causal order in quantum measurements
"time-division model as the fundamental feature of the coordination layer"
-
Relational models beat single-table ones on expanded database benchmark
"RELBENCHv2 adds four large-scale relational datasets... autocomplete tasks... Temporal Graph Benchmark integration"
-
Monoid structure fixes space for out-of-order product
"For monoids, we establish a trichotomy: the space complexity is either Θ(1), Θ(log n), or Θ(n)... constant-space solution for commutative monoids... FL∨Com... all remaining monoids require Ω(n) space."
-
Mirror descent view adds convex constraints to EMML
"establish the convergence of the resulting algorithm toward a solution of the constrained maximum-likelihood problem"
-
Rule-based scripts outperform LLMs at ACSL annotation for C verification
"Using a filtered subset of the CASP benchmark, we evaluate generated annotations through Frama-C’s WP plugin with multiple SMT solvers"
-
Learning corpus associations improves multi-hop retrieval recall by 8.6 points
"AAR is transductive: the association model is trained on co-occurrence pairs drawn from the same corpus on which it is evaluated"
-
Fine-tuned embeddings beat pre-trained ones for AAV viability
"We systematically evaluate multiple ProtBERT and ESM2 embedding variants as sequence representations, using the adeno-associated virus capsid as a case study"
-
Complex matching distance bounds resolution stability
"the complex matching distance on bounded complexes of finitely generated projective P-modules"
-
Graph engine keeps semantic state stable at microsecond speeds
"Bounded Local Generator Classes for Deterministic State Evolution"
-
Algorithm maps workflow nets to POWL models preserving behavior
"The algorithm recursively identifies structural patterns within the WF-net and translates them into their POWL representation."
-
Framework derives motion equations for deformable bodies joined by engineering joints
"engineering joints ... primitive constraints DP1, DP2, DIST, CD ... revolute joint ... 5 scalar constraints"
-
Krylov bounds match quantum Fisher information exactly for low-rank states
"K_n := span{i[ρ,H], R_ρ(i[ρ,H]), …, R_ρ^{n-1}(i[ρ,H])} … n* ≤ N[S] ≤ r(r+1)/2"
-
Large sizes enable both inductive and coinductive types
"size-indexed functor F[3−] ... fix(λi.λX.F(3iX)) ... μF := ∃i.(μ³F)i"
-
Complex instantons suppress tunneling at Toda points
"tunneling suppression takes place at the so-called Toda lattice points … critical point … monopole point … anomalous scaling as a function of ℏ"
-
Polynomial root decides if vectors admit equal-angle sectors
"Corollary 1 … root among the divisors of its constant term … rational root theorem"
-
Short-trained models generate audio over 5 minutes from video
"We adopt the Mamba-2 architecture [6], which inherently supports sequence modeling without explicit positional embeddings... Non-Causal Mamba-2 [37] for two key reasons: 1) video conditions are available offline... 2) multimodal fusion across multiple modalities is difficult without a predefined order."
-
Nonlinearity stabilizes chiral modes in modulated oscillators
"the equations of motion are unchanged upon simultaneously advancing time by T/3 and increasing the oscillator coordinate index by one"
-
Intersection attack traces each Tor onion service relay
"long-lived introduction circuits... 18–24 hours... short execution time 0.5–1.5 s"
-
Instruction-driven model handles multiple recommendation tasks
"hybrid item tokenization method that combines SID prefixes with unique item IDs... three-step item generation procedure integrated with an adaptive probabilistic fusion mechanism"
-
Rendered slides let agents fix presentations on the fly
"extrinsic verification ... mitigates self-verification bias"
-
Gossip lets agents agree on rankings without a center
"convergence rate O(e^{-ct/2}) for Borda and Copeland consensus"