Entries and citation numbers follow the retained manuscript. Citation keys keep links stable. These links do not establish what a cited source proves.
[1] komorebi-space
Komorebi P. Komorebi Space: Coherent Realizations, Obstructions, and Descent. Monograph, 2026. The finite proof-field view construction here is a relative application of its strict coherent realization principle, not a claim of unrestricted semantic completeness.
[2] buss
S. R. Buss, editor. Handbook of Proof Theory. Elsevier, 1998.
[3] cover-thomas
T. M. Cover and J. A. Thomas. Elements of Information Theory. Second edition, Wiley, 2006.
[4] diestel
R. Diestel. Graph Theory. Fifth edition, Springer, 2017.
[5] garey-johnson
M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, 1979.
[6] knuth
D. E. Knuth. Literate Programming. CSLI Publications, 1992.
[7] maclane
S. Mac Lane. Categories for the Working Mathematician. Second edition, Springer, 1998.
[8] nemhauser
G. L. Nemhauser, L. A. Wolsey, and M. L. Fisher. An analysis of approximations for maximizing submodular set functions I. Mathematical Programming, 14:265–294, 1978.
[9] troelstra
A. S. Troelstra and H. Schwichtenberg. Basic Proof Theory. Second edition, Cambridge University Press, 2000.