On a Generality Condition in Proof‐Theoretic Semantics
Bibliographic Data
| ID | 20142040 |
|---|---|
| Authors | Bogdan Dicher (0000-0002-2587-0649, University of Cagliari, corresponding author) |
| Year | 2017 |
| Volume | 83 |
| Issue | 4 |
| Pages | 394-418 |
| Publication date | 2017-12-01 |
| Peer Reviewed | Yes |
| Open Access | Yes |
| Type | ARTICLE |
| Venue | Theoria (JOURNAL) |
| Journal identifiers | ISSN: 0040-5825 • E-ISSN: 1755-2567 |
| Publisher | Wiley (PUBLISHER • GB) |
| DOI | 10.1111/theo.12131 |
| OpenAlex | W2766146685 |
| Language | EN |
| References cited | 40 |
In the recent literature on proof‐theoretic semantics, there is mention of a generality condition on defining rules. According to this condition, the schematic formulation of the defining rules must be maximally general, in the sense that no restrictions should be placed on the contexts of these rules. In particular, context variables must always be present in the schematic rules and they should range over arbitrary collections of formulae. I argue against imposing such a condition, by showing that it has undesirable results and that it is ill‐supported by the arguments brought in its favour
Context (archaeology) · Epistemology · Generality · Mathematical economics · Programming language · Range (aeronautics) · Schematic · Semantics (computer science) · Advanced Algebra and Logic · Computer Science · Logic, programming, and type systems · Logic, Reasoning, and Knowledge · Mathematics · Philosophy · Psychology
| Citation velocity | historical |
|---|---|
| Highly cited | No |