全部 标题 作者
关键词 摘要

OALib Journal期刊
ISSN: 2333-9721
费用:99美元

查看量下载量

相关文章

更多...

The δ-Calculus: From Distinction to Arithmetic

DOI: 10.4236/apm.2026.169035, PP. 705-739

Keywords: Distinction, -Calculus, Constructive Arithmetic, Choice-Free Number Tower, Recognition Quotients

Full-Text   Cite this paper   Add to My Lib

Abstract:

Let δ denote the primitive act of distinction, formally realized as the one-step extension r?Sr of a finite record. We study the generated δ -orbit and its arithmetic presentation ? δ . We prove that the δ -orbit is initial among δ -algebras: every δ -algebra admits a unique structure-preserving map from the orbit. The map is injective when the successor operation is injective and the base point is not a successor. If the δ -algebra also satisfies induction for all predicates, the map is bijective and gives the unique isomorphism with the generated δ -orbit. The corresponding δ -calculus is an intuitionistic first-order proof system over the signature { 0,S,+,? } . The name is independent of δ -reduction in the λ -calculus: here δ generates the arithmetic carrier, and is not a term rewriting rule. Each derivation carries a ledger recording the use of the law of excluded middle, the limited principle of omniscience, Markov’s principle, and induction on quantified formulas. The last entry does not affect whether a derivation is forced. Every closed formula derivable in the forced fragment is true in the standard model. Starting from δ , we construct the choice-free number tower

References

[1]  Spencer-Brown, G. (1969) Laws of Form. George Allen and Unwin.
[2]  Wengert, R.G. (1965) The Development of the Doctrine of the Formal Distinction in the Lectura Prima of John Duns Scotus. Monist, 49, 571-587.
https://doi.org/10.5840/monist196549435
[3]  Wheeler, J.A. (1992) Recent Thinking about the Nature of the Physical World: It from Bit. Annals of the New York Academy of Sciences, 655, 349-364.
https://doi.org/10.1111/j.1749-6632.1992.tb17083.x
[4]  Crvenkovi?, S., Mitrovi?, M. and Romano, D.A. (2013) Semigroups with Apartness. Mathematical Logic Quarterly, 59, 407-414.
https://doi.org/10.1002/malq.201200107
[5]  Crvenkovi?, S., Mitrovi?, M. and Romano, D.A. (2016) Basic Notions of (Constructive) Semigroups with Apartness. Semigroup Forum, 92, 659-674.
https://doi.org/10.1007/s00233-016-9776-y
[6]  Mitrovi?, M., Hounkonnou, M.N. and Baroni, M.A. (2022) Theory of Constructive Semigroups with Apartness—Foundations, Development and Practice. Fundamenta Informaticae, 184, 233-271.
https://doi.org/10.3233/fi-2021-2098
[7]  Martin-L?f, P. (1984) Intuitionistic Type Theory. Bibliopolis.
[8]  Coquand, T. and Huet, G. (1988) The Calculus of Constructions. Information and Computation, 76, 95-120.
https://doi.org/10.1016/0890-5401(88)90005-3
[9]  Ishihara, H. (2006) Reverse Mathematics in Bishop’s Constructive Mathematics. Philosophia Scientiae, 6, 43-59.
https://doi.org/10.4000/philosophiascientiae.406
[10]  Diener, H. (2018) Constructive Reverse Mathematics: Habilitationsschrift, Universit?t Siegen. arXiv:1804.05495.
[11]  Lawvere, F.W. (1964) An Elementary Theory of the Category of Sets. Proceedings of the National Academy of Sciences, 52, 1506-1511.
https://doi.org/10.1073/pnas.52.6.1506
[12]  Barendregt, H.P. (1984) The Lambda Calculus: Its Syntax and Semantics. In: Studies in Logic and the Foundations of Mathematics, Vol. 103, North-Holland, 621 p.
[13]  Birkhoff, G. (1935) On the Structure of Abstract Algebras. Mathematical Proceedings of the Cambridge Philosophical Society, 31, 433-454.
https://doi.org/10.1017/s0305004100013463
[14]  Clifford, A.H. and Preston, G.B. (1961) The Algebraic Theory of Semigroups, Volume I. American Mathematical Society.
https://doi.org/10.1090/surv/007.1
[15]  de Bruijn, N.G. (1972) Lambda Calculus Notation with Nameless Dummies, a Tool for Automatic Formula Manipulation, with Application to the Church-Rosser Theorem. Indagationes Mathematicae (Proceedings), 75, 381-392.
https://doi.org/10.1016/1385-7258(72)90034-0
[16]  van Dalen, D. (2013) Logic and Structure. 5th Edition, Springer.
[17]  Bishop, E. (1967) Foundations of Constructive Analysis. McGraw-Hill.
[18]  Washburn, J., Zlatanovi?, M. and Allahyarov, E. (2026) Recognition Geometry. Axioms, 15, Article 90.
https://doi.org/10.3390/axioms15020090
[19]  Moura, L.d. and Ullrich, S. (2021) The Lean 4 Theorem Prover and Programming Language. In: Platzer, A. and Sutcliffe, G., Eds., Lecture Notes in Computer Science, Springer International Publishing, 625-635.
https://doi.org/10.1007/978-3-030-79876-5_37
[20]  The Mathlib Community (2020) The Lean Mathematical Library. Proceedings of the 9th ACM SIGPLAN International Conference on Certified Programs and Proofs, New Orleans, 20-21 January 2020, 367-381.
https://doi.org/10.1145/3372885.3373824

Full-Text

Contact Us

service@oalib.com

QQ:3279437679

WhatsApp +8615387084133