Table of Contents: :: Library Catalog

Gardado en:

Detalles Bibliográficos
Autor Principal:	Carroll, Jeremy H.
Formato:	Recurso digital
Idioma:	inglés
Publicado:	Zenodo 2026
Subjects:	Finite Descent Authority Finite Obstruction Calculus applied proof theory category theory finite reasoning Semantics obstruction calculus obstruction theory Mathematical logic verification theory formal methods finite certified regime proof certificates authority factorization LLM no silent mutation finite authority systems
Acceso en liña:	https://doi.org/10.5281/zenodo.20195157
Tags:	Engadir etiqueta Sen Etiquetas, Sexa o primeiro en etiquetar este rexistro!

Table of Contents:

Finite Descent Authority (FDA) is a formal doctrine of operational authority. It states that a proposal does not become authority-bearing merely by being represented, predicted, generated, routed, explained, or embedded in a global structure. A proposal earns authority only when it enters a finite certified regime, is verified inside that regime, and terminalizes into a declared authority-bearing status. The central normal form is: Auth(p) = tau_s(V_s(P_s, eta_s(p))), where s = rho(p) and P_s = D(s). Here, rho routes a proposal to a sector, eta_s realizes it inside that sector, D constructs the finite descent packet, V verifies the packet-relative candidate fiber, and tau terminalizes the verified result into an authority-bearing or non-authority status. The paper develops the core FDA principles: proposal non-authority, finite descent necessity, authority factorization, descent packet soundness, and terminal authority. It also relates FDA to Finite Obstruction Calculus (FOC), where obstruction calculus supplies the local verifier and FDA supplies the global authority doctrine. The work separates operational authority from fluency, representation, fallback output, completion, and heuristic success. This publication-facing version keeps the main definitions and theorem statements in the publication spine. Full proofs are preserved separately in the proof archive, while implementation-specific ledgers, LLM/Kaggle material, quantum examples, and speculative extensions are kept outside the main paper.

Títulos similares