Abstract
Without introducing quantifiers, minimal axiomatic systems have already been constructed for Peirce's triadic logics. The present paper constructs a dual pair of axiomatic systems which can be used to introduce quantifiers into Peirce's preferred system of triadic logic. It is assumed (on the basis of textual evidence) that Peirce would prefer a system which rejects the absurd but tolerates the absolutely undecidable. The systems which are introduced are shown to be absolutely consistent, deductively complete, and minimal. These dual axiomatic systems reveal an interesting elegance, independent of their historical motivation.
Similar content being viewed by others
References
R. Feys and F. B. Fitch, Dictionary of symbols of mathematical logic, North-Holland, Amsterdam 1969.
M. Fisch and A. Turquette, Peirce's triadic logic, Transactions of the Charles S. Peirce Society 11 (1966), pp. 71–85.
W. Heisenberg, Physics and philosophy, Harper, New York 1958.
A. Mostowski, Sentences undecidable in formalized arithmetic, North-Holland, Amsterdam 1952.
L. Pacholski, Logic Colloquium '77, Wrocław, Poland, The Journal of Symbolic Logic 44 (1979), pp. 441–468.
J. B. Rosser and A. R. Turquette, Many-valued logics, North-Holland, Amsterdam 1952.
A. Tarski, A. Mostowski and R. M. Robinson, Undecidable theories, North-Holland, Amsterdam 1953.
A. R. Turquette, Minimal axioms for Peirce's triadic logic, Zeitschrift für Mathematische Logik und Grundlagen der Mathematik 22 (1976), pp. 169–176.
A. R. Turquette, Alternative axioms for Peirce's triadic logic, ibidem, 24 (1978), pp. 443–444.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Turquette, A.R. Quantification for Peirce's preferred system of triadic logic. Stud Logica 40, 373–382 (1981). https://doi.org/10.1007/BF00401655
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF00401655