Abstract
The paper concerns interpretations of the paraconsistent logic LP which model theories properly containing all the sentences of first order arithmetic. The paper demonstrates the existence of such models and provides a complete taxonomy of the finite ones.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
REFERENCES
van Bendegem, Jean-Paul (1993): Strict, yet rich finitism, pp. 61–79 of Z. W. Wolkowski (ed.) First International Symposium on Gödel's Theorems, World Scientific, Singapore.
Boolos, G. and Jeffrey, R. (1984): Computability and Logic, Cambridge University Press, Cambridge.
Dunn, J. M. (1979): A theorem in 3-valued model theory, with connections to number theory, type theory and relevance logic, Studia Logica 38, 149–169.
Kaye, R. (1991): Models of Peano Arithmetic, Clarendon Press, Oxford.
Meyer, R. K. (1978): Relevant arithmetic, Bulletin of the Section of Logic, Polish Academy of Sciences 5, 133–137.
Meyer, R. K. and Mortensen, C. (1984): Inconsistent models for relevant arithmetic, Journal of Symbolic Logic 49, 917–929.
Mortensen, C. (1995): Inconsistent Mathematics, Kluwer Academic Publishers, Dordrecht.
Priest, G. (1987): In Contradiction, Nijhoff, Dordrecht.
Priest, G. (1991): Minimally inconsistent LP, Studia Logica 50, 321–331.
Priest, G. (1994): Is arithmetic consistent?, Mind 103, 337–349.
Priest, G., Routley, R. and Norman, J. (1989): Paraconsistent Logics, Philosophia Verlag, Munich.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Priest, G. Inconsistent Models of Arithmetic Part I: Finite Models. Journal of Philosophical Logic 26, 223–235 (1997). https://doi.org/10.1023/A:1004251506208
Issue Date:
DOI: https://doi.org/10.1023/A:1004251506208