Notre Dame Journal of Formal Logic 59 (1):109-133 (2018)
AbstractThe dual character of invariance under transformations and definability by some operations has been used in classical works by, for example, Galois and Klein. Following Tarski, philosophers of logic have claimed that logical notions themselves could be characterized in terms of invariance. In this article, we generalize a correspondence due to Krasner between invariance under groups of permutations and definability in L∞∞ so as to cover the cases that are of interest in the logicality debates, getting McGee’s theorem about quantifiers invariant under all permutations and definability in pure L∞∞ as a particular case. We also prove some optimality results along the way, regarding the kinds of relations which are needed so that every subgroup of the full permutation group is characterizable as a group of automorphisms.
Similar books and articles
Set-theoretical Invariance Criteria for Logicality.Solomon Feferman - 2010 - Notre Dame Journal of Formal Logic 51 (1):3-20.
Definability and Invariance.N. C. A. da Costa & A. A. M. Rodrigues - 2007 - Studia Logica 86 (1):1-30.
Definability of Second Order Generalized Quantifiers.Juha Kontinen - 2004 - Dissertation,
Characterizing Definability of Second-Order Generalized Quantifiers.Juha Kontinen & Jakub Szymanik - 2011 - In L. Beklemishev & R. de Queiroz (eds.), Proceedings of the 18th Workshop on Logic, Language, Information and Computation, Lecture Notes in Artificial Intelligence 6642. Springer.
On the expressive power of monotone natural language quantifiers over finite models.Jouko Väänänen & Dag Westerståhl - 2002 - Journal of Philosophical Logic 31 (4):327-358.
Directions in Generalized Quantifier Theory.Dag Westerståhl & J. F. A. K. van Benthem - 1995 - Studia Logica 55 (3):389-419.
Henkin quantifiers and the definability of truth.Tapani Hyttinen & Gabriel Sandu - 2000 - Journal of Philosophical Logic 29 (5):507-527.
Definability in infinitary languages and invariance by automorphims.Alexandre Rodrigues, Ricardo Filho & Edelcio de Souza - 2010 - Reports on Mathematical Logic:119-133.
Modal languages for topology: Expressivity and definability.Balder ten Cate, David Gabelaia & Dmitry Sustretov - 2009 - Annals of Pure and Applied Logic 159 (1-2):146-170.
Definability of polyadic lifts of generalized quantifiers.Lauri Hella, Jouko Väänänen & Dag Westerståhl - 1997 - Journal of Logic, Language and Information 6 (3):305-335.
On Σ‐definability without equality over the real numbers.Andrei S. Morozov & Margarita V. Korovina - 2008 - Mathematical Logic Quarterly 54 (5):535-544.
One Connection between Standard Invariance Conditions on Modal Formulas and Generalized Quantifiers.Dorit Ben Shalom - 2003 - Journal of Logic, Language and Information 12 (1):47-52.
On definability in multimodal logic: On definability in multimodal logic.Joseph Y. Halpern - 2009 - Review of Symbolic Logic 2 (3):451-468.
Added to PP
Historical graph of downloads
References found in this work
What Does It Mean to Say That Logic is Formal?John MacFarlane - 2000 - Dissertation, University of Pittsburgh
First order predicate logic with generalized quantifiers.Per Lindström - 1966 - Theoria 32 (3):186--195.