Abstract
AbstractThis paper deals with the problem of giving a principled characterization of the class of logical constants. According to the so-called Tarski–Sher thesis, an operation is logical iff it is invariant under permutation. In the model-theoretic tradition, this criterion has been widely accepted as giving a necessary condition for an operation to be logical. But it has been also widely criticized on the account that it counts too many operations as logical, failing thus to provide a sufficient condition.Our aim is to solve this problem of overgeneration by modifying the invariance criterion. We introduce a general notion of invariance under a similarity relation and present the connection between similarity relations and classes of invariant operations. The next task is to isolate a similarity relation well-suited for a definition of logicality. We argue that the standard arguments in favor of invariance under permutation, which rely on the generality and the formality of logic, should be modified. The revised arguments are shown to support an alternative to Tarski's criterion, according to which an operation is logical iff it is invariant under potential isomorphism.
Publisher
Cambridge University Press (CUP)
Reference24 articles.
1. What are logical notions?
2. MacFarlane J.G. [2000], What does itmean to say that logic is formal, Ph.D.Dissertation, University of Pittsburgh.
Cited by
78 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Figure Credits;Concepts at the Interface;2024-09-05
2. Concluding Thoughts;Concepts at the Interface;2024-09-05
3. Metacognition;Concepts at the Interface;2024-09-05
4. Representational Structure;Concepts at the Interface;2024-09-05
5. Drawing on Meaning;Concepts at the Interface;2024-09-05