Logical Constants and Unrestricted Quantification
DOI:
https://doi.org/10.36253/jpm-2935Keywords:
logical consequence, logical constants, permutation criteria for logical constants, absolutely unrestricted quantification, second-order logicAbstract
Variants of the so-called permutation criterion have been used for distinguishing between logical and non-logical operations or expressions. Roughly, an operation is defined as logical if, and only if, it is invariant under arbitrary permutations on every domain. Thus a logical operation behaves on all objects in the same way. An expression is logical if, and only if, the operation expressed by it is logical. I consider a variant of the permutation criterion that eliminates domains: An operation is permutation-invariant if, and only if, it is invariant under arbitrary permutations of the universe. An expression is logical if, and only if, it expresses an operation that is permutation-invariant in this sense. This domain-free definition of the invariance criterion matches definitions of logical consequence without domains where first-order quantifiers are taken to range over all (first-order) objects in all interpretations. Without domains some problems of the invariance criterion disappear. In particular, an operation can behave on all objects of any domain in the same way, while still behaving very differently in each domain. On the criterion without domains, a logical operation always behaves on all objects in the same way, not only on all objects of any given domain.
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2024 Volker Halbach
This work is licensed under a Creative Commons Attribution 4.0 International License.
- Copyright on any open access article in JPM published by FUP is retained by the author(s).
- Authors grant FUP a license to publish the article and identify itself as the original publisher.
- Authors also grant any third party the right to use the article freely as long as its integrity is maintained and its original authors, citation details and publisher are identified.
- The Creative Commons Attribution License 4.0 formalizes these and other terms and conditions of publishing articles.
- In accordance with our Open Data policy, the Creative Commons CC0 1.0 Public Domain Dedication waiver applies to all published data in JPM open access articles.