Abstract

In this paper, I argue against the thesis that the meaning of ‘computability’ is logic-dependent. I do this from a category-theoretic perspective. Applying a method due to Mortensen and Lavers [26], I show that we can dualize the internal logic of the effective topos, in order to obtain a model of paraconsistent computability theory. Since the dualization leaves the structural properties of universal constructions in the topos unchanged, in particular the properties of the natural numbers object, I conclude that, at least in this case, changing the logic does not change our characterization of computability.

This article is published and distributed under the terms of the Oxford University Press, Standard Journals Publication Model (https://dbpia.nl.go.kr/pages/standard-publication-reuse-rights)
You do not currently have access to this article.