Premium
On a Generality Condition in Proof‐Theoretic Semantics
Author(s) -
Dicher Bogdan
Publication year - 2017
Publication title -
theoria
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.34
H-Index - 16
eISSN - 1755-2567
pISSN - 0040-5825
DOI - 10.1111/theo.12131
Subject(s) - generality , schematic , semantics (computer science) , context (archaeology) , computer science , range (aeronautics) , mathematical economics , calculus (dental) , mathematics , epistemology , programming language , philosophy , psychology , paleontology , materials science , electronic engineering , engineering , composite material , psychotherapist , biology , medicine , dentistry
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.