Invariance and definability, with and without equality
Denis Bonnay, Fredrik Engstr\"om

TL;DR
This paper explores the relationship between invariance under transformations and definability in logic, extending classical correspondences to include cases relevant to the logicality debate, such as logics without equality.
Contribution
It generalizes Krasner's correspondence to cover quantifiers and logics without equality, and proves optimality results for characterizing subgroups of permutation groups.
Findings
Extended Krasner's correspondence to new logical cases
Proved McGee's theorem as a special case
Established optimality results for automorphism groups
Abstract
The dual character of invariance under transformations and definability by some operations has been used in classical work 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 paper, we generalize a correspondence due to Krasner between invariance under groups of permutations and definability in so as to cover the cases (quantifiers, logics without equality) that are of interest in the logicality debates, getting McGee's theorem about quantifiers invariant under all permutations and definability in pure as a particular case. We also prove some optimality results along the way, regarding the kind of relations which are needed so that every subgroup of the full permutation group is characterizable as a group of automorphisms.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
