There Is A Problem with Substitutional Quantification
Bibliographic Data
| ID | 20142353 |
|---|---|
| Authors | Philip Hugly (University of Nebraska–Lincoln), Charles Sayward (University of Nebraska–Lincoln) |
| Year | 2002 |
| Volume | 68 |
| Issue | 1 |
| Pages | 4-12 |
| Publication date | 2002-04-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/j.1755-2567.2002.tb00117.x |
| OpenAlex | W1981414159 |
| Language | EN |
| Citations received | 1 |
| References cited | 2 |
Whereas arithmetical quantification is substitutional in the sense that a particular quantification is true only if some instance of it is true, it does not follow (and, in fact, is not true) that an account of the truth‐conditions of the sentences of a language of arithmetic can be given by a substitutional semantics. A substitutional semantics fails in a most fundamental fashion: It fails to articulate the truth‐conditions of the quantifications with which it is concerned. This is what is defended in the paper. In particular, it is defended against remarks to the contrary by Saul Kripke in a well known paper on the topic
Arithmetic function · Discrete mathematics · Epistemology · Linguistics · Programming language · Semantics (computer science) · Computability, Logic, AI Algorithms · Computer Science · Logic, Reasoning, and Knowledge · Mathematics · Philosophy · Philosophy and Theoretical Science
| Unique citing works | 1 |
|---|---|
| Citations per year | 0,2 |
| Citation span | 2021 - 2021 (1) |
| Citation velocity | historical |
| Highly cited | No |
| Citation types | Neutral: 1 |