# Which Quantifiers Are Logical? A Combined Semantical and Inferential Criterion

• Solomon Feferman
Chapter
Part of the Synthese Library book series (SYLI, volume 373)

## Abstract

The aim of logic is to characterize the forms of reasoning that lead invariably from true sentences to true sentences, independently of the subject matter; thus its concerns combine semantical and inferential notions in an essential way. Up to now most proposed characterizations of logicality of sentence generating operations have been given either in semantical or inferential terms. This paper offers a combined semantical and inferential criterion for logicality (improving one originally proposed by Jeffery Zucker) and shows that any quantifier that is to be counted as logical according to that criterion is definable in first order logic.

## Keywords

Atomic Formula First Order Logic Propositional Variable Natural Deduction Logical Constant
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

## Notes

### Acknowledgements

I would like to thank Jeremy Avigad, Denis Bonnay, Fredrik Engström, Lauri Hella, Michael Rathjen, Dag Westerståhl and Jeffery Zucker for their useful comments on a draft of this article.

## References

1. 1.
Barwise, J., and S. Feferman. (eds.). 1985. Model-theoretic logics, Perspectives in mathematical logic series. New York: Springer.Google Scholar
2. 2.
Feferman, S. 1968. Lectures on proof theory. Proceedings of the summer school in logic, Leeds. Lecture notes in mathematics, vol. 70, 1–107.
3. 3.
Feferman, S. 1968. Persistent and invariant formulas for outer extensions. Compositio Mathematica 20: 29–52.Google Scholar
4. 4.
Feferman, S. 1999. Logic, logics and logicism. Notre Dame Journal of Formal Logic 40: 31–54.
5. 5.
Feferman, S. 2010. Set-theoretical invariance criteria for logicality. Notre Dame Journal of Formal Logic 51: 3–20.
6. 6.
Gentzen, G. 1935. Untersuchungen über das logische Schliessen. Mathematische Zeitschrift 39: 176–210; 405–431. (English translation in Gentzen [7], 68–131).Google Scholar
7. 7.
Gentzen, G. 1969. The collected papers of Gerhard Gentzen, ed. M.E. Szabo. Amsterdam: North-Holland.Google Scholar
8. 8.
Gómez-Torrente, M. 2002. The problem of logical constants. Bulletin of Symbolic Logic 8: 1–37.
9. 9.
Hacking, I. 1997. What is logic? Journal of Philosophy 76: 285–319.
10. 10.
Keisler, J. 1970. Logic with the quantifier “there exist uncountably many”. Annals of Mathematical Logic 1: 1–93.
11. 11.
Lindström, P. 1966. First order predicate logic with generalized quantifiers. Theoria 32: 186–195.Google Scholar
12. 12.
McGee, V. 1996. Logical operations. Journal of Philosophical Logic 25: 567–580.
13. 13.
Peters, S., and D. Westerståhl. 2006. Quantifiers in language and logic. Oxford: Clarendon Press.Google Scholar
14. 14.
Prawitz, D. 1965. Natural deduction. A proof-theoretical study; 2nd edn. (2006). Mineola: Dover Publications.Google Scholar
15. 15.
Quine, W.V.O. 1986. The philosophy of logic, 2nd ed. Cambridge: Harvard University Press.Google Scholar
16. 16.
Sher, G. 1991. The bounds of logic. Cambridge: MIT.Google Scholar
17. 17.
Tarski, A. 1986. What are logical notions? History and Philosophy of Logic 7: 143–154.
18. 18.
Zucker, J.I. 1978. The adequacy problem for classical logic. Journal of Philosophical Logic 7: 517–535.Google Scholar
19. 19.
Zucker, J.I., and R.S. Tragesser. 1978. The adequacy problem for inferential logic. Journal of Philosophical Logic 7: 501–516.Google Scholar