Logic is a celebrated representation language because of its formal generality. But there are two senses in which a logic may be considered general, one that concerns a technical ability to discriminate between different types of individuals, and another that concerns constitutive norms for reasoning as such. This essay embraces the former, permutation-invariance conception of logic and rejects the latter, Fregean conception of logic. The question of how to apply logic under this pure invariantist view is addressed, and a methodology (...) is given. The pure invariantist view is contrasted with logical pluralism, and a methodology for applied logic is demonstrated in remarks on a variety of issues concerning non-monotonic logic and non-monotonic inference, including Charles Morgan’s impossibility results for non-monotonic logic, David Makinson’s normative constraints for non-monotonic inference, and Igor Douven and Timothy Williamson’s proposed formal constraints on rational acceptance. (shrink)

Consider any logical system, what is its natural repertoire of logical operations? This question has been raised in particular for first-order logic and its extensions with generalized quantifiers, and various characterizations in terms of semantic invariance have been proposed. In this paper, our main concern is with modal and dynamic logics. Drawing on previous work on invariance for first-order operations, we find an abstract connection between the kind of logical operations a system uses and the kind of invariance conditions the (...) system respects. This analysis yields (a) a characterization of invariance and safety under bisimulation as natural conditions for logical operations in modal and dynamic logics, and (b) some new transfer results between first-order logic and modal logic. (shrink)

In standard model-theoretic semantics, the meaning of logical terms is said to be fixed in the system while that of nonlogical terms remains variable. Much effort has been devoted to characterizing logical terms, those terms that should be fixed, but little has been said on their role in logical systems: on what fixing their meaning precisely amounts to. My proposal is that when a term is considered logical in model theory, what gets fixed is its intension rather than its extension. (...) I provide a rigorous way of spelling out this idea, and show that it leads to a graded account of logicality: the less structure a term requires in order for its intension to be fixed, the more logical it is. Finally, I focus on the class of terms that are invariant under isomorphisms, as they render themselves more easily to mathematical treatment. I propose a mathematical measure for the logicality of such terms based on their associated Löwenheim numbers. (shrink)

Invariance criteria are widely accepted as a means to demarcate the logical vocabulary of a language. In previous work, I proposed a framework of “semantic constraints” for model theoretic consequence which does not rely on a strict distinction between logical and nonlogical terms, but rather on a range of constraints on models restricting the interpretations of terms in the language in different ways. In this paper I show how invariance criteria can be generalized so as to apply to semantic constraints (...) on models. Some obviously unpalatable semantic constraints turn out to be invariant under isomorphisms. I shall connect our discussion to known counterexamples to invariance criteria for logical terms, and so the generalization will also shed light on the current existing debate on logicality. I analyse the failure of invariance to fulfil its role as a criterion for logicality, and argue that invariance conditions should best be thought of as merely methodological meta-constraints restricting the ways the model-theoretic apparatus should be used. (shrink)

In the paper the following questions are discussed: What is logical consequence? What are logical constants? What is a logical system? What is logical pluralism? What is logic? In the conclusion, the main tendencies of development of modern logic are pointed out.

The isomorphism invariance criterion of logical nature has much to commend it. It can be philosophically motivated by the thought that logic is distinctively general or topic neutral. It is capable of precise set-theoretic formulation. And it delivers an extension of ‘logical constant’ which respects the intuitively clear cases. Despite its attractions, the criterion has recently come under attack. Critics such as Feferman, MacFarlane and Bonnay argue that the criterion overgenerates by incorrectly judging mathematical notions as logical. We consider five (...) possible precisifications of the overgeneration argument and find them all unconvincing. (shrink)

What is a logical constant? The question is addressed in the tradition of Tarski's definition of logical operations as operations which are invariant under permutation. The paper introduces a general setting in which invariance criteria for logical operations can be compared and argues for invariance under potential isomorphism as the most natural characterization of logical operations.

The 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. (shrink)