Jump to content

User:Magnap/Inquisitive Semantics Proposal: Difference between revisions

→‎Inquisitive semantics: Consider explaining presupposition
(→‎TODO proposal details: Let's not forget «rí»)
(→‎Inquisitive semantics: Consider explaining presupposition)
Line 22: Line 22:


An important thing to bear in mind about inquisitive semantics is that it does not give us a Boolean algebra, but only a Heyting algebra, meaning that <math>\neg\neg\text{P} = \text{P}</math> is not guaranteed. In fact, the non-inquisitive projection operator <math>\lambda \text{P}. !\text{P}</math>, which collapses all the alternatives of a proposition into just one (called <math>\text{info}\left(\text{P}\right)</math>) which contains them all, thus keeping the assertion the same but ensuring that no question is asked, ''is'' just <math>\lambda \text{P}. \neg\neg\text{P}</math>. Another important operator is the non-informative projection operator <math>\lambda \text{P}. ?\text{P} = \lambda \text{P}. \text{P} \lor \neg\text{P}</math>, which ensures that a proposition does not assert anything by adding an alternative which covers all worlds that would otherwise have been ruled out. Finally (TODO source! well tbf I made it up initially but it ''is'' attested, at least in one presentation by one of the inqsem guys) there's the presupposition operator <math>\lambda \text{P}. ;\text{P} = \lambda \text{P}. \left(\text{P} | \text{info}\left(\text{P}\right)\right)</math>.
An important thing to bear in mind about inquisitive semantics is that it does not give us a Boolean algebra, but only a Heyting algebra, meaning that <math>\neg\neg\text{P} = \text{P}</math> is not guaranteed. In fact, the non-inquisitive projection operator <math>\lambda \text{P}. !\text{P}</math>, which collapses all the alternatives of a proposition into just one (called <math>\text{info}\left(\text{P}\right)</math>) which contains them all, thus keeping the assertion the same but ensuring that no question is asked, ''is'' just <math>\lambda \text{P}. \neg\neg\text{P}</math>. Another important operator is the non-informative projection operator <math>\lambda \text{P}. ?\text{P} = \lambda \text{P}. \text{P} \lor \neg\text{P}</math>, which ensures that a proposition does not assert anything by adding an alternative which covers all worlds that would otherwise have been ruled out. Finally (TODO source! well tbf I made it up initially but it ''is'' attested, at least in one presentation by one of the inqsem guys) there's the presupposition operator <math>\lambda \text{P}. ;\text{P} = \lambda \text{P}. \left(\text{P} | \text{info}\left(\text{P}\right)\right)</math>.
TODO explain how adding presupposition to InqB would work in more detail?
Since this proposal is, after all, suggesting that we base the formal language of our semantics on InqB+presupposition.


===Examples===
===Examples===
17

edits