2013
DOI: 10.1080/01445340.2013.764962
|View full text |Cite
|
Sign up to set email alerts
|

The Cube, the Square and the Problem of Existential Import

Abstract: We re-examine the problem of existential import by using classical predicate logic. Our problem is: How to distribute the existential import among the quantified propositions in order for all the relations of the logical square to be valid? After defining existential import and scrutinizing the available solutions, we distinguish between three possible cases: explicit import, implicit non-import, explicit negative import and formalize the propositions accordingly. Then, we examine the 16 combinations between t… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
19
0

Year Published

2015
2015
2022
2022

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 30 publications
(19 citation statements)
references
References 7 publications
0
19
0
Order By: Relevance
“…12 Note, however, that the second lowest value in the 8-range is reached by some system in S ‡ , since |Π FOL(AX ) (F ‡ )| = 5. The weakest logical system FOL(∅) thus yields the highest bitstring length (16), while the strongest logical system FOL(AX ) yields the lowest (attainable) bitstring length (5). This suggests an inverse correlation between logical strength and bitstring length: stronger logical systems yield shorter bitstrings.…”
Section: Theoretical Analysismentioning
confidence: 90%
See 3 more Smart Citations
“…12 Note, however, that the second lowest value in the 8-range is reached by some system in S ‡ , since |Π FOL(AX ) (F ‡ )| = 5. The weakest logical system FOL(∅) thus yields the highest bitstring length (16), while the strongest logical system FOL(AX ) yields the lowest (attainable) bitstring length (5). This suggests an inverse correlation between logical strength and bitstring length: stronger logical systems yield shorter bitstrings.…”
Section: Theoretical Analysismentioning
confidence: 90%
“…Informally: even though the fragment parameter is fixed to F, varying the logical system parameter within S suffices to reach all values in the |F|-range. In other words, all bitstring lengths that might theoretically be necessary to represent fragments of the same size as F, are already needed to represent F itself, under the different logical systems in S. 5 To illustrate this account of context-sensitivity, we will consider the case of 4-formula fragments, i.e. the case of Aristotelian squares.…”
Section: This Proposal Has Two Limiting Casesmentioning
confidence: 99%
See 2 more Smart Citations
“…18 For a brief overview of the debate concerning existential presupposition and categorical statements see [4]. 19 The logical analysis of the predicate "be such an individual that is identical with the King of France" is λxλw […”
Section: Existential Import Of Categorical Statements and The Square mentioning
confidence: 99%