fbpx
Wikipedia

Inquisitive semantics

Inquisitive semantics is a framework in logic and natural language semantics. In inquisitive semantics, the semantic content of a sentence captures both the information that the sentence conveys and the issue that it raises. The framework provides a foundation for the linguistic analysis of statements and questions.[1][2] It was originally developed by Ivano Ciardelli, Jeroen Groenendijk, Salvador Mascarenhas, and Floris Roelofsen.[3][4][5][6][7]

Basic notions edit

The essential notion in inquisitive semantics is that of an inquisitive proposition.

  • An information state (alternately a classical proposition) is a set of possible worlds.
  • An inquisitive proposition is a nonempty downward-closed set of information states.

Inquisitive propositions encode informational content via the region of logical space that their information states cover. For instance, the inquisitive proposition   encodes the information that {w} is the actual world. The inquisitive proposition   encodes that the actual world is either   or  .

An inquisitive proposition encodes inquisitive content via its maximal elements, known as alternatives. For instance, the inquisitive proposition   has two alternatives, namely   and  . Thus, it raises the issue of whether the actual world is   or   while conveying the information that it must be one or the other. The inquisitive proposition   encodes the same information but does not raise an issue since it contains only one alternative.

The informational content of an inquisitive proposition can be isolated by pooling its constituent information states as shown below.

  • The informational content of an inquisitive proposition P is  .

Inquisitive propositions can be used to provide a semantics for the connectives of propositional logic since they form a Heyting algebra when ordered by the subset relation. For instance, for every proposition P there exists a relative pseudocomplement  , which amounts to  . Similarly, any two propositions P and Q have a meet and a join, which amount to   and   respectively. Thus inquisitive propositions can be assigned to formulas of   as shown below.

Given a model   where W is a set of possible worlds and V is a valuation function:

  1.  
  2.  
  3.  
  4.  

The operators ! and ? are used as abbreviations in the manner shown below.

  1.  
  2.  

Conceptually, the !-operator can be thought of as cancelling the issues raised by whatever it applies to while leaving its informational content untouched. For any formula  , the inquisitive proposition   expresses the same information as  , but it may differ in that it raises no nontrivial issues. For example, if   is the inquisitive proposition P from a few paragraphs ago, then   is the inquisitive proposition Q.

The ?-operator trivializes the information expressed by whatever it applies to, while converting information states that would establish that its issues are unresolvable into states that resolve it. This is very abstract, so consider another example. Imagine that logical space consists of four possible worlds, w1, w2, w3, and w4, and consider a formula   such that   contains {w1}, {w2}, and of course  . This proposition conveys that the actual world is either w1 or w2 and raises the issue of which of those worlds it actually is. Therefore, the issue it raises would not be resolved if we learned that the actual world is in the information state {w3, w4}. Rather, learning this would show that the issue raised by our toy proposition is unresolvable. As a result, the proposition   contains all the states of  , along with {w3, w4} and all of its subsets.

See also edit

References edit

  1. ^ "What is inquisitive semantics?". Institute for Logic, Language and Computation, University of Amsterdam.
  2. ^ Ciardelli, Ivano; Groenendijk, Jeroen; Roelofsen, Floris (2019). Inquisitive Semantics (PDF). Oxford University Press.
  3. ^ Ciardelli, I. (2009). "Inquisitive semantics and intermediate logics" (PDF). Master Thesis, ILLC University of Amsterdam.
  4. ^ Ciardelli, Ivano; Roelofsen, Floris (2009). "Generalized inquisitive logic: completeness via intuitionistic Kripke models" (PDF). Proceedings of the 12th Conference on Theoretical Aspacts of Rationality and Knowledge. ACM: 71–80.
  5. ^ Jeroen Groenendijk (2009). "Inquisitive semantics: Two possibilities for disjunction" (PDF). Proceedings of the 7th International Tbilisi Symposium on Language, Logic, and Computation. Springer: 80–94.
  6. ^ Groenendijk, Jeroen; Roelofsen, Floris (2009). "Inquisitive semantics and pragmatics" (PDF). Proceedings of the ILCLI International Workshop on Semantics, Pragmatics and Rhetoric: 41–72.
  7. ^ Mascarenhas, Salvador (2009). "Inquisitive semantics and logic" (PDF). Master Thesis, ILLC University of Amsterdam.

Further reading edit

inquisitive, semantics, framework, logic, natural, language, semantics, inquisitive, semantics, semantic, content, sentence, captures, both, information, that, sentence, conveys, issue, that, raises, framework, provides, foundation, linguistic, analysis, state. Inquisitive semantics is a framework in logic and natural language semantics In inquisitive semantics the semantic content of a sentence captures both the information that the sentence conveys and the issue that it raises The framework provides a foundation for the linguistic analysis of statements and questions 1 2 It was originally developed by Ivano Ciardelli Jeroen Groenendijk Salvador Mascarenhas and Floris Roelofsen 3 4 5 6 7 Contents 1 Basic notions 2 See also 3 References 4 Further readingBasic notions editThe essential notion in inquisitive semantics is that of an inquisitive proposition An information state alternately a classical proposition is a set of possible worlds An inquisitive proposition is a nonempty downward closed set of information states Inquisitive propositions encode informational content via the region of logical space that their information states cover For instance the inquisitive proposition w displaystyle w emptyset nbsp encodes the information that w is the actual world The inquisitive proposition w v displaystyle w v emptyset nbsp encodes that the actual world is either w displaystyle w nbsp or v displaystyle v nbsp An inquisitive proposition encodes inquisitive content via its maximal elements known as alternatives For instance the inquisitive proposition w v displaystyle w v emptyset nbsp has two alternatives namely w displaystyle w nbsp and v displaystyle v nbsp Thus it raises the issue of whether the actual world is w displaystyle w nbsp or v displaystyle v nbsp while conveying the information that it must be one or the other The inquisitive proposition w v w v displaystyle w v w v emptyset nbsp encodes the same information but does not raise an issue since it contains only one alternative The informational content of an inquisitive proposition can be isolated by pooling its constituent information states as shown below The informational content of an inquisitive proposition P is info P w w t for some t P displaystyle operatorname info P w mid w in t text for some t in P nbsp Inquisitive propositions can be used to provide a semantics for the connectives of propositional logic since they form a Heyting algebra when ordered by the subset relation For instance for every proposition P there exists a relative pseudocomplement P displaystyle P nbsp which amounts to s W s t for all t P displaystyle s subseteq W mid s cap t emptyset text for all t in P nbsp Similarly any two propositions P and Q have a meet and a join which amount to P Q displaystyle P cap Q nbsp and P Q displaystyle P cup Q nbsp respectively Thus inquisitive propositions can be assigned to formulas of L displaystyle mathcal L nbsp as shown below Given a model M W V displaystyle mathfrak M langle W V rangle nbsp where W is a set of possible worlds and V is a valuation function p s W w s V w p 1 displaystyle p s subseteq W mid forall w in s V w p 1 nbsp f s W s t for all t f displaystyle neg varphi s subseteq W mid s cap t emptyset text for all t in varphi nbsp f ps f ps displaystyle varphi land psi varphi cap psi nbsp f ps f ps displaystyle varphi lor psi varphi cup psi nbsp The operators and are used as abbreviations in the manner shown below f f displaystyle varphi equiv neg neg varphi nbsp f f f displaystyle varphi equiv varphi lor neg varphi nbsp Conceptually the operator can be thought of as cancelling the issues raised by whatever it applies to while leaving its informational content untouched For any formula f displaystyle varphi nbsp the inquisitive proposition f displaystyle varphi nbsp expresses the same information as f displaystyle varphi nbsp but it may differ in that it raises no nontrivial issues For example if f displaystyle varphi nbsp is the inquisitive proposition P from a few paragraphs ago then f displaystyle varphi nbsp is the inquisitive proposition Q The operator trivializes the information expressed by whatever it applies to while converting information states that would establish that its issues are unresolvable into states that resolve it This is very abstract so consider another example Imagine that logical space consists of four possible worlds w1 w2 w3 and w4 and consider a formula f displaystyle varphi nbsp such that f displaystyle varphi nbsp contains w1 w2 and of course displaystyle emptyset nbsp This proposition conveys that the actual world is either w1 or w2 and raises the issue of which of those worlds it actually is Therefore the issue it raises would not be resolved if we learned that the actual world is in the information state w3 w4 Rather learning this would show that the issue raised by our toy proposition is unresolvable As a result the proposition f displaystyle varphi nbsp contains all the states of f displaystyle varphi nbsp along with w3 w4 and all of its subsets See also editAlternative semantics Disjunction Intermediate logic Question Responsive predicate Rising declarativeReferences edit What is inquisitive semantics Institute for Logic Language and Computation University of Amsterdam Ciardelli Ivano Groenendijk Jeroen Roelofsen Floris 2019 Inquisitive Semantics PDF Oxford University Press Ciardelli I 2009 Inquisitive semantics and intermediate logics PDF Master Thesis ILLC University of Amsterdam Ciardelli Ivano Roelofsen Floris 2009 Generalized inquisitive logic completeness via intuitionistic Kripke models PDF Proceedings of the 12th Conference on Theoretical Aspacts of Rationality and Knowledge ACM 71 80 Jeroen Groenendijk 2009 Inquisitive semantics Two possibilities for disjunction PDF Proceedings of the 7th International Tbilisi Symposium on Language Logic and Computation Springer 80 94 Groenendijk Jeroen Roelofsen Floris 2009 Inquisitive semantics and pragmatics PDF Proceedings of the ILCLI International Workshop on Semantics Pragmatics and Rhetoric 41 72 Mascarenhas Salvador 2009 Inquisitive semantics and logic PDF Master Thesis ILLC University of Amsterdam Further reading editCiardelli Ivano Groenendijk Jeroen and Roelofsen Floris 2019 Inquisitive Semantics Oxford University Press ISBN 9780198814788 https projects illc uva nl inquisitivesemantics Retrieved from https en wikipedia org w index php title Inquisitive semantics amp oldid 1070274791, wikipedia, wiki, book, books, library,

article

, read, download, free, free download, mp3, video, mp4, 3gp, jpg, jpeg, gif, png, picture, music, song, movie, book, game, games.