(IX): a set of propositions is consistent when some world lies in all of them.
- Con X = (⋂₀ X).Nonempty
Used by incr, Con.anti, con_of_forall_mem, incr_eq_union, not_mem_incr, update_eq, con_clausal, con_scalar, K_neg_not_mem_update
Docs / Studies / Studies.Gazdar1979
Gazdar, G. (1979). Academic Press
This file formalizes Gazdar's projection of implicatures. Asserting a sentence commits the speaker to knowing it, in Hintikka's logic of what the speaker knows and leaves possible, and the sentence potentially implicates that the speaker leaves possible each clause it leaves open and its negation, and knows false the stronger scalar alternative of each part it entails. The context adds these in that order, each only so far as it fits, so that John did it or Mary did it implicates not both and John did it or Mary did it or both of them did it does not, though the two are truth-conditionally equivalent.
EpistemicLogic with the speaker as their one agent. In the examples a
world pairs a valuation of two atoms with the valuations the speaker's information leaves open,
so that knowledge is S5 there, a special case of the S4 Gazdar takes from Hintikka.⟨and, or⟩ and ⟨all, some⟩.(IX): a set of propositions is consistent when some world lies in all of them.
Used by incr, Con.anti, con_of_forall_mem, incr_eq_union, not_mem_incr, update_eq, con_clausal, con_scalar, K_neg_not_mem_update
(XVI): the satisfiable incrementation of X by Y adds to X the members of Y whose
addition keeps every consistent subset of X ∪ Y consistent.
Built from
Used by incr_eq_union, not_mem_incr, update, K_neg_mem_of_scalar_first
The proposition a sentence expresses, the worlds at which it is true.
Used by scalar, update, forall_mem_clausal, forall_mem_scalar, update_eq, den_K_neg_inter_den_P, con_clausal, con_scalar, K_neg_not_mem_update, den_K_moore, instDecidablePredWorldMemSetDenFinOfNatNatInfo, exclusive, K_neg_mem_of_scalar_first, notAll, rows_reading
The parts of a sentence, its subformulas, the ψ of X⌢ψ⌢Y in (IV) and (V).
Used by scalar, forall_mem_clausal, forall_mem_scalar
(V): the clausal implicatures of φ, that the speaker leaves possible each part ψ that φ
neither entails nor contradicts, and leaves its negation possible.
The definition is too large to print here; read it in the source.
Used by update, forall_mem_clausal, update_eq, con_clausal, con_scalar, K_neg_not_mem_update, K_neg_mem_of_scalar_first
(IV): the scalar implicatures of φ on a scale s giving the stronger alternative of a part,
that the speaker knows false the stronger alternative of each part that φ entails.
Built from ,
Used by update, forall_mem_scalar, update_eq, con_scalar, K_neg_mem_of_scalar_first
(XV) and (XVII): the context after asserting φ in the context c, which adds that the
speaker knows φ, then the clausal and then the scalar implicatures that fit.
Built from , , ,
Used by update_eq, K_neg_not_mem_update, exclusive, notAll, rows_reading
Built from , ,
Built from , ,
Built from , , , ,
Built from
Built from , ,
Built from , , ,
(XVII) and p. 136: a scalar implicature that the speaker knows not χ is cancelled when a
clausal implicature that the speaker leaves χ possible is added before it.
Built from , , ,
Asserting φ but I do not know that φ commits the speaker to knowing it, which is necessarily false, Hintikka's solution to Moore's problem.
Built from
A world of the examples is a valuation of two atoms with the set of valuations the speaker's information leaves open, among the admissible ones; the speaker's alternatives to a world are the worlds with the same set.
The worlds over the admissible valuations adm of two atoms.
Used by instFintypeWorld, info, instDecidablePredWorldMemSetDenFinOfNatNatInfo
Built from
The model of the speaker's information about two atoms.
The definition is too large to print here; read it in the source.
Built from
Used by instDecidablePredWorldMemSetDenFinOfNatNatInfo, exclusive, K_neg_mem_of_scalar_first, notAll, rows_reading
Built from , ,
The scale ⟨and, or⟩ (p. 59): the stronger alternative of a disjunction is the conjunction.
Used by exclusive, K_neg_mem_of_scalar_first, rows_reading
The scale ⟨all, some⟩ (52) on the atoms some of the students were there (0) and all of
them were (1).
Used by notAll, rows_reading
The valuations on which all of the students being there entails some being there.
Used by notAll, rows_reading
(18)-(20): John did it or Mary did it implicates that the speaker knows not (John did it and Mary did it), and the truth-conditionally equivalent John did it or Mary did it or both of them did it does not, its clausal implicature that the speaker leaves (20) possible excluding the scalar one.
Built from , , ,
Built from , , , , ,
(21)-(23): some of the students were there implicates that the speaker knows not all of them were, and some, if not all, of the students were there does not, its clausal implicature that the speaker leaves (23) possible excluding the scalar one.
Built from , , , ,
The judged readings of (18), (19), (21) and (22): a sentence has the reading not both or not all exactly when its update adds the scalar implicature.
Built from , , , , ,