A Categorical Integration of Logical Connectives via Higher Category Theory
Fuente:
arXiv
Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866915290057539584 |
|---|---|
| author | Reizi, Barreto Joaquim |
| author_facet | Reizi, Barreto Joaquim |
| contents | This paper develops a systematic framework for integrating local categories that model logical connectives using higher category theory. By extending these local categories into a unified two-category enriched with natural isomorphisms, the universal properties of logical operations such as negation, conjunction, disjunction, and implication are rigorously captured. Advanced techniques including pseudo-limits, pseudo-colimits, and strictification are employed to transform the resulting weak structure into a strict two-category, thereby simplifying composition rules and coherence verification without loss of semantic content. The framework is validated through detailed diagrammatic proofs and concrete examples, demonstrating its robustness and potential impact in areas such as type theory, programming language semantics, and formal verification. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2503_16570 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | A Categorical Integration of Logical Connectives via Higher Category Theory Reizi, Barreto Joaquim General Mathematics This paper develops a systematic framework for integrating local categories that model logical connectives using higher category theory. By extending these local categories into a unified two-category enriched with natural isomorphisms, the universal properties of logical operations such as negation, conjunction, disjunction, and implication are rigorously captured. Advanced techniques including pseudo-limits, pseudo-colimits, and strictification are employed to transform the resulting weak structure into a strict two-category, thereby simplifying composition rules and coherence verification without loss of semantic content. The framework is validated through detailed diagrammatic proofs and concrete examples, demonstrating its robustness and potential impact in areas such as type theory, programming language semantics, and formal verification. |
| title | A Categorical Integration of Logical Connectives via Higher Category Theory |
| topic | General Mathematics |
| url | https://arxiv.org/abs/2503.16570 |