On the indispensability of theoretical terms and entities
Bibliographic Data
| ID | 10809769 |
|---|---|
| Authors | Eric Johannesson (0000-0001-9128-2565, Stockholm University, corresponding author) |
| Year | 2022 |
| Volume | 200 |
| Issue | 2 |
| Publication date | 2022-04-01 |
| Open Access | Yes |
| Type | ARTICLE |
| Venue | Synthese (JOURNAL) |
| Journal identifiers | ISSN: 0039-7857 • E-ISSN: 1573-0964 |
| Publisher | Springer Science and Business Media LLC (PUBLISHER) |
| DOI | 10.1007/s11229-022-03683-1 |
| OpenAlex | W4223595231 |
| Language | EN |
| Citations received | 1 |
| References cited | 15 |
Some realists claim that theoretical entities like numbers and electrons are indispensable for describing the empirical world. Motivated by the meta-ontology of Quine, I take this claim to imply that, for some first-order theory T and formula $$\delta (x)$$ δ ( x ) such that $$T \vdash \exists x \delta \wedge \exists x \lnot \delta $$ T ⊢ ∃ x δ ∧ ∃ x ¬ δ , where $$\delta (x)$$ δ ( x ) is intended to apply to all and only empirical entities, there is no first-order theory $$T'$$ T ′ such that (a) T and $$T'$$ T ′ describe the $$\delta $$ δ :s in the same way, (b) $$T' \vdash \forall x \delta $$ T ′ ⊢ ∀ x δ , and (c) $$T'$$ T ′ is at least as attractive as T in terms of other theoretical virtues. In an attempt to refute the realist claim, I try to solve the general problem of nominalizing T (with respect to $$\delta $$ δ ), namely to find a theory $$T'$$ T ′ satisfying conditions (a)–(c) under various precisifications thereof. In particular, I note that condition (a) can be understood either in terms of syntactic or semantic equivalence, where the latter is strictly stronger than the former. The results are somewhat mixed. On the positive side, even under the stronger precisification of (a), I establish that (1) if the vocabulary of T is finite, a nominalizing theory can always be found that is recursive if T is, and (2) if T postulates infinitely many $$\delta $$ δ :s, a nominalizing theory can always be found that is no more computationally complex than T . On the negative side, even under the weaker precisification of (a), I establish that (3) certain finite theories cannot be nominalized by a finite theory
Algorithm · Advanced Topology and Set Theory · Artificial Intelligence · Computer Science · Philosophy and History of Science · Quantum Mechanics and Applications
| Citations per year | 0.5 |
|---|---|
| Citation span | 2024 - 2024 (1) |
| Highly cited | No |