Logicality and Model Classes release_dtbnyplemrbojfafcfzc7iu5jq

by Juliette Kennedy, Jouko Väänänen

Released as a article .

2021  

Abstract

We ask, when is a property of a model a logical property? According to the so-called Tarski-Sher criterion this is the case when the property is preserved by isomorphisms. We relate this to model-theoretic characteristics of abstract logics in which the model class is definable. This results in a graded concept of logicality in the terminology of Sagi. We investigate which characteristics of logics, such as variants of the Löwenheim-Skolem Theorem, Completeness Theorem, and absoluteness, are relevant from the logicality point of view, continuing earlier work by Bonnay, Feferman, and Sagi. We suggest that a logic is the more logical the closer it is to first order logic. We also offer a refinement of the result of McGee that logical properties of models can be expressed in L_∞∞ if the expression is allowed to depend on the cardinality of the model, based on replacing L_∞∞ by a “tamer" logic.
In text/plain format

Archived Files and Locations

application/pdf  777.6 kB
file_6frdxr3j7jbb7frv3qozwx5he4
arxiv.org (repository)
web.archive.org (webarchive)
Read Archived PDF
Preserved and Accessible
Type  article
Stage   submitted
Date   2021-06-25
Version   v1
Language   en ?
arXiv  2106.13506v1
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: 839d6af3-8119-46b2-808b-80a0099bb486
API URL: JSON