Professional Documents
Culture Documents
Fine Truth and Logic
Fine Truth and Logic
Paulo Santos
1 Background
2 Truth-value approach
nice1 is vague
I n is nice1 if n > 15
I n is not nice1 if n < 13
nice2 is ambiguous (over-determined meaning)
I n is nice iff n > 15
2
I n is nice iff n > 14
2
Truth-value approach
I specification
I valuation
I natural constraints: F - Fidelity Condition; S - Stability Condition
Specification-space approach: specification points and partial
ordering – extends (≥)
the Super-truth theory
the fidelity constraint (F) states that a sentence is true (or false) for
a complete specification iff it is classically true (or false);
the Stability condition (S) states that if a sentence has a definite
truth-value under a specification t it enjoys the same definite
truth-value under any specification u that extends t
I u extends t if u assigns the an atomic sentence any definite truth-value
assigned by t
the fidelity constraint (F) states that a sentence is true (or false) for
a complete specification iff it is classically true (or false);
the Stability condition (S) states that if a sentence has a definite
truth-value under a specification t it enjoys the same definite
truth-value under any specification u that extends t
I u extends t if u assigns the an atomic sentence any definite truth-value
assigned by t
hS , ≥i
I S: non-empty set of elements: specification points
I ≥: partial ordering (read as: extends) on the set
I a space is appropriate if each point corresponds to a precisification,
one point for each precisification
I each point is assigned a specification that is appropriate to the
precisification to which it corresponds
I points extend one another just in case they correspond to
precisifications that extend one another in the natural sense
I truth-valuation in this sense would be based on the specification space
(i.e. on the specification points that correspond to the different ways of
making the language more precise)
I a specification space is, in effect, a collection of specifications partially
ordered by the natural extension-relation
hS , ≥i
I S: non-empty set of elements: specification points
I ≥: partial ordering (read as: extends) on the set
I a space is appropriate if each point corresponds to a precisification,
one point for each precisification
I each point is assigned a specification that is appropriate to the
precisification to which it corresponds
I points extend one another just in case they correspond to
precisifications that extend one another in the natural sense
I truth-valuation in this sense would be based on the specification space
(i.e. on the specification points that correspond to the different ways of
making the language more precise)
I a specification space is, in effect, a collection of specifications partially
ordered by the natural extension-relation
hS , ≥i
I S: non-empty set of elements: specification points
I ≥: partial ordering (read as: extends) on the set
I a space is appropriate if each point corresponds to a precisification,
one point for each precisification
I each point is assigned a specification that is appropriate to the
precisification to which it corresponds
I points extend one another just in case they correspond to
precisifications that extend one another in the natural sense
I truth-valuation in this sense would be based on the specification space
(i.e. on the specification points that correspond to the different ways of
making the language more precise)
I a specification space is, in effect, a collection of specifications partially
ordered by the natural extension-relation
hS , ≥i
I S: non-empty set of elements: specification points
I ≥: partial ordering (read as: extends) on the set
I a space is appropriate if each point corresponds to a precisification,
one point for each precisification
I each point is assigned a specification that is appropriate to the
precisification to which it corresponds
I points extend one another just in case they correspond to
precisifications that extend one another in the natural sense
I truth-valuation in this sense would be based on the specification space
(i.e. on the specification points that correspond to the different ways of
making the language more precise)
I a specification space is, in effect, a collection of specifications partially
ordered by the natural extension-relation
hS , ≥i
I S: non-empty set of elements: specification points
I ≥: partial ordering (read as: extends) on the set
I a space is appropriate if each point corresponds to a precisification,
one point for each precisification
I each point is assigned a specification that is appropriate to the
precisification to which it corresponds
I points extend one another just in case they correspond to
precisifications that extend one another in the natural sense
I truth-valuation in this sense would be based on the specification space
(i.e. on the specification points that correspond to the different ways of
making the language more precise)
I a specification space is, in effect, a collection of specifications partially
ordered by the natural extension-relation
hS , ≥i
I S: non-empty set of elements: specification points
I ≥: partial ordering (read as: extends) on the set
I a space is appropriate if each point corresponds to a precisification,
one point for each precisification
I each point is assigned a specification that is appropriate to the
precisification to which it corresponds
I points extend one another just in case they correspond to
precisifications that extend one another in the natural sense
I truth-valuation in this sense would be based on the specification space
(i.e. on the specification points that correspond to the different ways of
making the language more precise)
I a specification space is, in effect, a collection of specifications partially
ordered by the natural extension-relation
∀t ∃u ≥ t (u complete)
t |= A and u ≥ t → u |= A
∀t ∃u ≥ t (u complete)
t |= A and u ≥ t → u |= A
∀t ∃u ≥ t (u complete)
t |= A and u ≥ t → u |= A
a vague sentence is true iff it is true for all admissible and complete
specifications
an intensional version of the theory is that a sentence is true if it is
true for all ways of making it completely precise
super-truth is better than the other approaches for two reasons:
I it covers all cases of penumbral connections
F Resolution condition R (p. 278): an indefinite atomic sentence can be
resolved in either way upon improvement of precision
I it follows an optimising strategy: maximize one’s advantage within the
given constraints
I the resolution condition R should hold for all sentences, so that any
indefinite sentence can be resolved in either one of two ways (bipolar
resolution)
a vague sentence is true iff it is true for all admissible and complete
specifications
an intensional version of the theory is that a sentence is true if it is
true for all ways of making it completely precise
super-truth is better than the other approaches for two reasons:
I it covers all cases of penumbral connections
F Resolution condition R (p. 278): an indefinite atomic sentence can be
resolved in either way upon improvement of precision
I it follows an optimising strategy: maximize one’s advantage within the
given constraints
I the resolution condition R should hold for all sentences, so that any
indefinite sentence can be resolved in either one of two ways (bipolar
resolution)
a vague sentence is true iff it is true for all admissible and complete
specifications
an intensional version of the theory is that a sentence is true if it is
true for all ways of making it completely precise
super-truth is better than the other approaches for two reasons:
I it covers all cases of penumbral connections
F Resolution condition R (p. 278): an indefinite atomic sentence can be
resolved in either way upon improvement of precision
I it follows an optimising strategy: maximize one’s advantage within the
given constraints
I the resolution condition R should hold for all sentences, so that any
indefinite sentence can be resolved in either one of two ways (bipolar
resolution)