Inconsistent Models (and Infinite Models) for Arithmetics with Constructible Falsity

Thomas Macaulay Ferguson



An earlier paper on formulating arithmetic in a connexive logic ended with a conjecture concerning C♯ , the closure of the Peano axioms in Wansing’s connexive logic C. Namely, the paper conjectured that C♯ is Post consistent relative to Heyting arithmetic, i.e., is nontrivial if Heyting arithmetic is nontrivial. The present paper borrows techniques from relevant logic to demonstrate that C♯ is Post consistent simpliciter, rendering the earlier conjecture redundant. Given the close relationship between C and Nelson’s paraconsistent N4, this also supplements Nelson’s own proof of the Post consistency of N4♯ . Insofar as the present technique allows infinite models, this resolves Nelson’s concern that N4♯ is of interest only to those accepting that there are finitely many natural numbers.


strong negation; connexive logic; constructible falsity; first-order arithmetic; connexive arithmetic; Post consistency; paraconsistent logic

Full Text:



Dunn, J.M., “A theorem in 3-valued model theory with connections to number theory, type theory, and relevant logic”, Studia Logica 38, 2 (1979): 149–169. DOI:

Ferguson, T.M., “On arithmetic formulated connexively”, IFCoLog Journal of Logics and Their Applications 3, 3 (2016): 357–376.

Ferguson, T.M., “Dunn-Priest quotients of many-valued structures”, Notre Dame Journal of Formal Logic 58, 2 (2017): 221–239. DOI:

Hasuo, I., and R. Kashima, “Kripke completeness of first-order constructive logics with strong negation”, Logic Journal of the IGPL 11, 6 (2003): 615–646. DOI:

Kapsner, A., Logics and Falsifications: A New Perspective on Constructivist Semantics, vol. 40 of Trends in Logic, Springer, 2014. DOI:

Meyer, R.K., “Arithmetic formulated relevantly” (Unpublished manuscript), Canberra, 1976.

Meyer, R.K., and C. Mortensen, “Inconsistent models for relevant arithmetics”, Journal of Symbolic Logic 49, 3 (1984): 917–929. DOI:

Nelson, D., “Constructible falsity”, Journal of Symbolic Logic 14, 1 (1949): 16–26. DOI:

Nelson, D., “Negation and separation of concepts in constructive systems”, pages 208–225 in A. Heyting (ed.), Constructivity in Mathematics , North-Holland, Amsterdam, 1959.

Nelson, D., and A. Almukdad, “Constructible falsity and inexact predicates”, Journal of Symbolic Logic 49, 1 (1984): 231–233. DOI:

Odintsov, S., and H. Wansing, “Inconsistency-tolerant description logic: Motivation and basic systems”, , pages 301–335 in V. Hendricks and J. Malinowski (eds.), Trends in Logic: 50 Years of Studia Logica, Kluwer Academic Publishers, Dordrecht, 2003.

Priest, G.,“Minimally inconsistent LP”, Studia Logica 50, 2 (1991): 321–331. DOI:

Priest, G., “Inconsistent models for arithmetic I. Finite models”, Journal of Philosophical Logic 26, 2 (1997): 223–235. DOI:

Priest, G., “Negation as cancellation and connexive logic”, Topoi 18, 2 (1999): 141–148. DOI:

Slaney, J.K., R.K. Meyer, and G. Restall, “Linear arithmetic desecsed”, Logique et Analyse 39, 155–156 (1996): 379–387.

Thomason, R.H., “A semantical study of constructible falsity”, Zeitschrift für Mathematische Logik und Grundlagen der Mathematik 15, 16–18 (1969): 247–257. DOI:

Wansing, H., “Connexive modal logic”, pages 367–383 in R. Schmidt, I. Pratt-Hartmann, M. Reynolds and H. Wansing (eds.), Advances in Modal Logic vol. 5, Kings College Publications, London, 2005.

Wansing, H., “Natural deduction for bi-connexive logic and a two-sorted typed λ-calculus”, IFCoLog Journal of Logics and Their Applications (2016): 413–439.

Wansing, H., H. Omori and T.M. Ferguson, “The tenacity of connexive logic”, IFCoLog Journal of Logics and Their Applications (2016): 279–296.

Print ISSN: 1425-3305
Online ISSN: 2300-9802

Partnerzy platformy czasopism