Extending computational trinitarianism
Logic Journal of the IGPL · 27.07.2026 · 34 (4)
DOI: 10.1093/jigpal/jzag037 ↗Kurz gefasst
Fachartikel in der Zeitschrift Logic Journal of the IGPL, online erschienen am 08.06.2026. Verfasst von Fernando Cano-Jorge. Die Arbeit nennt 62 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: Marsden Fund, Royal Society of New Zealand, PAPIIT project.
Abstract (Originalsprache)
Computational trinitarianism is the view that a single notion of computation has three different manifestations: in logic as proofs, in typed $\lambda $-calculus as programs, and in category theory as morphisms. This idea has traditionally been closely associated with intuitionistic logic but here we argue that the connection is not exclusive. We provide a logician friendly, self-contained introduction to this topic by presenting the trinities for linear, affine, and relevant logic. The ground we set for that goal is then used to show how to obtain paraconsistent trinities by including the De Morgan negation.
Förderung
- Marsden Fund
- Royal Society of New Zealand
- PAPIIT project
Zitieren
APA
Cano-Jorge, F. (2026). Extending computational trinitarianism. Logic Journal of the IGPL, 34(4). https://doi.org/10.1093/jigpal/jzag037
Vancouver
Cano-Jorge F. Extending computational trinitarianism. Logic Journal of the IGPL. 2026;34(4). doi:10.1093/jigpal/jzag037
BibTeX
@article{CanoJorge2026,
author = {Cano-Jorge, Fernando},
title = {Extending computational trinitarianism},
journal = {Logic Journal of the IGPL},
year = {2026},
volume = {34},
number = {4},
doi = {10.1093/jigpal/jzag037}
}
EUVIMED