Hostname: page-component-848d4c4894-4rdrl Total loading time: 0 Render date: 2024-06-27T17:26:50.130Z Has data issue: false hasContentIssue false

ABSTRACT FORMS OF QUANTIFICATION IN THE QUANTIFIED ARGUMENT CALCULUS

Published online by Cambridge University Press:  08 March 2021

EDI PAVLOVIĆ*
Affiliation:
DEPARTMENT OF PHILOSOPHY, HISTORY AND ART STUDIES UNIVERSITY OF HELSINKI P.O. BOX 24, FI-00014 HELSINKI, FINLAND
NORBERT GRATZL
Affiliation:
FAKULTÄT FÜR PHILOSOPHIE WISSENSCHAFTSTHEORIE UND RELIGIONSWISSENSCHAFT MUNICH CENTER FOR MATHEMATICAL PHILOSOPHY (MCMP) LUDWIG-MAXIMILIANS UNIVERSITÄT MÜNCHEN GESCHWISTER SCHOLL PLATZ 1, D-80539 MÜNCHEN, GERMANY E-mail: N.Gratzl@lmu.de

Abstract

The Quantified argument calculus (Quarc) has received a lot of attention recently as an interesting system of quantified logic which eschews the use of variables and unrestricted quantification, but nonetheless achieves results similar to the Predicate calculus (PC) by employing quantifiers applied directly to predicates instead. Despite this noted similarity, the issue of the relationship between Quarc and PC has so far not been definitively resolved. We address this question in the present paper, and then expand upon that result.

Utilizing recent developments in structural proof theory, we develop a G3-style sequent calculus for Quarc and briefly demonstrate its structural properties. We put these properties to use immediately to construct direct proofs of the meta-theoretical properties of the system. We then incorporate an abstract (and, as we shall see, logical) predicate into the system in a way that preserves all the structural properties. This allows us to identify a system of Quarc which is deductively equivalent to PC, and also yields a constructive method of demonstrating the Craig interpolation theorem (which speaks in favor of the aforementioned predicate being logical). We further generalize this extension to develop a bivalent system of Quarc with defining clauses that still maintains all the desirable properties of a good proof system.

Type
Research Article
Copyright
© The Author(s), 2021. Published by Cambridge University Press on behalf of The Association for Symbolic Logic

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Ben-Yami, H. (2004). Logic & Natural Language: On Plural Reference and Its Semantic and Logical Significance . Farnham, UK: Ashgate.Google Scholar
Ben-Yami, H., (2014). The quantified argument calculus. The Review of Symbolic Logic , 7(1), 120146.CrossRefGoogle Scholar
Ben-Yami, H., (2020). The Barcan formulas and necessary existence: The view from Quarc. Synthese, 1–36. https://doi.org/10.1007/s11229-020-02771-4 CrossRefGoogle Scholar
Ben-Yami, H., (2021). The Quantified argument calculus and natural logic. Dialectica. Forthcoming.Google Scholar
Ben-Yami, H., & Pavlović, E. (n.d.). Completeness of the Quantified Argument Calculus on the Truth-Valuational Approach. Forthcoming.Google Scholar
Boolos, G. S., Burgess, J. P., & Jeffrey, R. C. (1974). Computability and logic . Cambridge: Cambridge University Press.Google Scholar
Buss, S. R. (1998). An introduction to proof theory. In Buss, S. R., editor. Handbook of Proof Theory , Vol. 137. Amsterdam: Elsevier, pp. 178.CrossRefGoogle Scholar
Craig, W. (1957). Three uses of the Herbrand–Gentzen theorem in relating model theory and proof theory. The Journal of Symbolic Logic , 22(3), 269285.CrossRefGoogle Scholar
Gentzen, G. (1935). Untersuchungen über das logische Schließen. I. Mathematische Zeitschrift , 39(1), 176210.CrossRefGoogle Scholar
Gentzen, G., (1969). The Collected Papers . Amsterdam: North-Holland Publishing Company.Google Scholar
Lanzet, R. (2017). A three-valued quantified argument calculus: Domain-free model-theory, completeness, and embedding of FOL. The Review of Symbolic Logic , 10(3), 549582.CrossRefGoogle Scholar
Lanzet, R., & Ben-Yami, H. (2004). Logical inquiries into a new formal system with plural reference. In Hendricks, V., Neuhaus, F., Scheffler, U., Pedersen, S. A., and Wansing, H., editors. First-Order Logic Revisited . Logische Philosophie. Berlin: Logos Verlag, pp. 173223.Google Scholar
Maehara, S. (1960). Craig no interpolation theorem. Suugaku , 12, 235237.Google Scholar
Maffezioli, P., & Orlandelli, E. (2019). Full cut elimination and interpolation for intuitionistic logic with existence predicate. Bulletin of the Section of Logic , 48(2), 137158.CrossRefGoogle Scholar
Negri, S., & von Plato, J. (2001). Structural Proof Theory . Cambridge: Cambridge University Press.CrossRefGoogle Scholar
Ono, H. (1998). Proof-theoretic methods in nonclassical logic—An introduction. Theories of Types and Proofs , 2, 207254.CrossRefGoogle Scholar
Pavlović, E. (2017). The Quantified Argument Calculus: An Inquiry into Its Logical Properties and Applications. Ph.D. Thesis, Central European University, Budapest.Google Scholar
Pavlović, E., & Gratzl, N. (2019a). Free logic and the quantified argument calculus. In Mras, G. M., Weingartner, P., and Ritter, B., editors. Philosophy of Logic and Mathematics: Proceedings of the 41 st International Ludwig Wittgenstein Symposium . Vol. 27. Berlin: Walter de Gruyter GmbH, p. 105.CrossRefGoogle Scholar
Pavlović, E., (2019b). Proof-theoretic analysis of the quantified argument calculus. The Review of Symbolic Logic , 12(4), 607636.CrossRefGoogle Scholar
Pavlović, E., (2020). A more unified approach to free logics. Journal of Philosophical Logic , 50, 117148.CrossRefGoogle Scholar
Raab, J. (2016). The Relationship of QUARC and Classical Logic. Master’s Thesis, LMU, Munich.Google Scholar
Raab, J., (2018). Aristotle, logic, and QUARC. History and Philosophy of Logic , 39(4), 305340.CrossRefGoogle Scholar
Schütte, K. (1960). Beweistheorie . In Grundlehren der mathematischen Wissenschaften . Vol. 103. Berlin: Springer.Google Scholar