Knowledge (XXG)

Inquisitive semantics

Source 📝

1397:
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
30:. 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. It was originally developed by Ivano Ciardelli, 977: 515: 633: 875: 1219: 770: 1180: 430: 270: 173: 1534:
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
116: 1224:
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
1139: 1058: 725: 1518: 1444: 1242: 701: 675: 80:
Inquisitive propositions encode informational content via the region of logical space that their information states cover. For instance, the inquisitive proposition
569: 322: 296: 1620: 1586: 1478: 1388: 1347: 1313: 1279: 2585: 362: 342: 213: 193: 881: 1887: 450: 2361: 574: 2229: 1896: 786: 435:
The informational content of an inquisitive proposition can be isolated by pooling its constituent information states as shown below.
2578: 1855: 2876: 1186: 2316: 1551:}. Rather, learning this would show that the issue raised by our toy proposition is unresolvable. As a result, the proposition 1970: 2437: 2311: 1880: 27: 2089: 1910: 733: 2886: 2871: 2571: 1798: 1150: 367: 2732: 1975: 2063: 2625: 2457: 2119: 1940: 2462: 2412: 2174: 1873: 542: 225: 128: 2517: 2381: 1960: 1845: 1712: 1732: 2630: 2512: 2058: 1820: 2542: 2214: 2184: 2159: 2099: 1998: 1930: 1776: 83: 2881: 2615: 2442: 2301: 2189: 2164: 2008: 1925: 1754: 1648: 2765: 2706: 2668: 2663: 2610: 2427: 2234: 2013: 1668: 1064: 983: 706: 2845: 2678: 2594: 2507: 2422: 2366: 2269: 2254: 2224: 2204: 2179: 2048: 2033: 526: 2866: 2840: 2755: 2620: 2552: 2477: 2452: 2417: 2397: 2326: 2306: 2244: 2239: 2149: 2139: 2124: 2068: 1673: 1658: 648: 644: 522: 432:
encodes the same information but does not raise an issue since it contains only one alternative.
31: 1503: 2830: 2795: 2783: 2760: 2747: 2737: 2724: 2532: 2487: 2472: 2432: 2371: 2341: 2321: 2114: 2043: 1851: 1429: 1227: 364:
while conveying the information that it must be one or the other. The inquisitive proposition
680: 654: 2788: 2537: 2467: 2356: 2134: 73: 547: 301: 275: 2775: 2691: 2686: 2648: 2346: 2249: 2144: 2109: 1784:
Proceedings of the 7th International Tbilisi Symposium on Language, Logic, and Computation
530: 218:
An inquisitive proposition encodes inquisitive content via its maximal elements, known as
62: 1591: 1554: 1449: 1356: 1318: 1284: 1247: 2527: 2522: 2447: 2331: 2209: 2104: 1945: 347: 327: 198: 178: 1865: 1762:
Proceedings of the 12th Conference on Theoretical Aspacts of Rationality and Knowledge
2860: 2219: 2194: 2028: 1860: 1806:
Proceedings of the ILCLI International Workshop on Semantics, Pragmatics and Rhetoric
1693: 1144:
The operators ! and ? are used as abbreviations in the manner shown below.
972:{\displaystyle \!]=\{s\subseteq W\mid s\cap t=\emptyset {\text{ for all }}t\in \!]\}} 2696: 2602: 2482: 2407: 2274: 2154: 2038: 2018: 510:{\displaystyle \operatorname {info} (P)=\{w\mid w\in t{\text{ for some }}t\in P\}} 2714: 2640: 2402: 2376: 2259: 2023: 1950: 1653: 45: 628:{\displaystyle \{s\subseteq W\mid s\cap t=\emptyset {\text{ for all }}t\in P\}} 2653: 2547: 2199: 1965: 1920: 1915: 1755:"Generalized inquisitive logic: completeness via intuitionistic Kripke models" 2807: 2658: 2351: 2169: 2094: 2073: 2003: 1955: 1935: 1315:, but it may differ in that it raises no nontrivial issues. For example, if 703:
respectively. Thus inquisitive propositions can be assigned to formulas of
2264: 2053: 1663: 2800: 2563: 1698:
Institute for Logic, Language and Computation, University of Amsterdam
534: 1844:
Ciardelli, Ivano; Groenendijk, Jeroen; and Roelofsen, Floris (2019)
521:
Inquisitive propositions can be used to provide a semantics for the
2129: 23: 1711:
Ciardelli, Ivano; Groenendijk, Jeroen; Roelofsen, Floris (2019).
2812: 870:{\displaystyle \!]=\{s\subseteq W\mid \forall w\in s,V(w,p)=1\}} 2567: 1869: 712: 42:
The essential notion in inquisitive semantics is that of an
1520:. This proposition conveys that the actual world is either 324:. Thus, it raises the issue of whether the actual world is 1777:"Inquisitive semantics: Two possibilities for disjunction" 1214:{\displaystyle ?\varphi \equiv \varphi \lor \neg \varphi } 1594: 1557: 1506: 1452: 1432: 1359: 1321: 1287: 1250: 1230: 1189: 1153: 1067: 986: 884: 789: 736: 709: 683: 657: 577: 550: 453: 370: 350: 330: 304: 278: 228: 201: 181: 131: 86: 2823: 2774: 2746: 2723: 2705: 2677: 2639: 2601: 2500: 2390: 2294: 2287: 2082: 1991: 1984: 1903: 765:{\displaystyle {\mathfrak {M}}=\langle W,V\rangle } 125:} is the actual world. The inquisitive proposition 1861:https://projects.illc.uva.nl/inquisitivesemantics/ 1614: 1580: 1512: 1472: 1438: 1382: 1341: 1307: 1273: 1236: 1213: 1175:{\displaystyle !\varphi \equiv \neg \neg \varphi } 1174: 1133: 1052: 971: 869: 764: 719: 695: 669: 627: 563: 509: 425:{\displaystyle \{\{w,v\},\{w\},\{v\},\emptyset \}} 424: 356: 336: 316: 290: 264: 207: 187: 167: 110: 1608: 1598: 1574: 1561: 1466: 1456: 1376: 1363: 1335: 1325: 1301: 1291: 1267: 1254: 1127: 1117: 1107: 1097: 1087: 1071: 1046: 1036: 1026: 1016: 1006: 990: 962: 952: 901: 888: 803: 793: 16:Framework in logic and natural language semantics 2362:Segmented discourse representation theory (SDRT) 1797:Groenendijk, Jeroen; Roelofsen, Floris (2009). 1733:"Inquisitive semantics and intermediate logics" 537:relation. For instance, for every proposition 34:, Salvador Mascarenhas, and Floris Roelofsen. 2579: 1881: 8: 1753:Ciardelli, Ivano; Roelofsen, Floris (2009). 966: 908: 864: 810: 759: 747: 622: 578: 504: 472: 419: 410: 404: 398: 392: 386: 374: 371: 311: 305: 285: 279: 259: 250: 244: 238: 232: 229: 222:. For instance, the inquisitive proposition 162: 153: 147: 141: 135: 132: 105: 96: 90: 87: 1828:Master Thesis, ILLC University of Amsterdam 1740:Master Thesis, ILLC University of Amsterdam 2586: 2572: 2564: 2291: 1988: 1888: 1874: 1866: 265:{\displaystyle \{\{w\},\{v\},\emptyset \}} 168:{\displaystyle \{\{w\},\{v\},\emptyset \}} 1593: 1556: 1505: 1451: 1431: 1358: 1320: 1286: 1249: 1229: 1188: 1152: 1066: 985: 938: 883: 788: 738: 737: 735: 711: 710: 708: 682: 656: 608: 576: 555: 549: 490: 452: 369: 349: 329: 303: 277: 227: 200: 180: 130: 85: 175:encodes that the actual world is either 1685: 1799:"Inquisitive semantics and pragmatics" 2317:Discourse representation theory (DRT) 7: 111:{\displaystyle \{\{w\},\emptyset \}} 2230:Quantificational variability effect 1897:Formal semantics (natural language) 739: 1507: 1281:expresses the same information as 1205: 1166: 1163: 935: 892: 825: 635:. Similarly, any two propositions 605: 416: 256: 159: 102: 14: 1821:"Inquisitive semantics and logic" 1694:"What is inquisitive semantics?" 1353:from a few paragraphs ago, then 776:is a set of possible worlds and 1390:is the inquisitive proposition 1349:is the inquisitive proposition 1134:{\displaystyle \!]=\!]\cup \!]} 1053:{\displaystyle \!]=\!]\cap \!]} 2312:Combinatory categorial grammar 1819:Mascarenhas, Salvador (2009). 1609: 1605: 1599: 1595: 1575: 1571: 1562: 1558: 1467: 1463: 1457: 1453: 1377: 1373: 1364: 1360: 1336: 1332: 1326: 1322: 1302: 1298: 1292: 1288: 1268: 1264: 1255: 1251: 1244:, the inquisitive proposition 1128: 1124: 1118: 1114: 1108: 1104: 1098: 1094: 1088: 1084: 1072: 1068: 1047: 1043: 1037: 1033: 1027: 1023: 1017: 1013: 1007: 1003: 991: 987: 963: 959: 953: 949: 902: 898: 889: 885: 855: 843: 804: 800: 794: 790: 720:{\displaystyle {\mathcal {L}}} 466: 460: 443:of an inquisitive proposition 1: 2090:Antecedent-contained deletion 272:has two alternatives, namely 118:encodes the information that 2733:Ontology (computer science) 1850:. Oxford University Press. 1775:Jeroen Groenendijk (2009). 1588:contains all the states of 2903: 2626:Intuitionistic type theory 1971:Syntax–semantics interface 1720:. Oxford University Press. 1639:} and all of its subsets. 1513:{\displaystyle \emptyset } 76:set of information states. 28:natural language semantics 2463:Question under discussion 2413:Conversational scoreboard 2190:Intersective modification 2175:Homogeneity (linguistics) 1426:, and consider a formula 780:is a valuation function: 543:relative pseudocomplement 2518:Distributional semantics 1439:{\displaystyle \varphi } 1237:{\displaystyle \varphi } 2877:Systems of formal logic 2631:Constructive set theory 2513:Computational semantics 2255:Subsective modification 2059:Propositional attitudes 696:{\displaystyle P\cup Q} 670:{\displaystyle P\cap Q} 70:inquisitive proposition 2543:Philosophy of language 2185:Inalienable possession 2165:Free choice inferences 2160:Faultless disagreement 1931:Generalized quantifier 1731:Ciardelli, I. (2009). 1616: 1582: 1514: 1474: 1440: 1384: 1343: 1309: 1275: 1238: 1215: 1176: 1135: 1054: 973: 871: 766: 721: 697: 671: 629: 565: 511: 426: 358: 338: 318: 292: 266: 209: 189: 169: 112: 2616:Constructive analysis 2443:Plural quantification 2337:Inquisitive semantics 2302:Alternative semantics 1847:Inquisitive Semantics 1714:Inquisitive Semantics 1649:Alternative semantics 1617: 1583: 1515: 1475: 1441: 1385: 1344: 1310: 1276: 1239: 1216: 1177: 1136: 1055: 974: 872: 767: 722: 698: 672: 630: 566: 564:{\displaystyle P^{*}} 512: 441:informational content 427: 359: 339: 319: 317:{\displaystyle \{v\}} 293: 291:{\displaystyle \{w\}} 267: 210: 190: 170: 113: 59:classical proposition 20:Inquisitive semantics 2669:Fuzzy set operations 2664:Fuzzy finite element 2611:Intuitionistic logic 2428:Function application 2235:Responsive predicate 2225:Privative adjectives 1669:Responsive predicate 1592: 1555: 1504: 1450: 1430: 1357: 1319: 1285: 1248: 1228: 1187: 1151: 1065: 984: 882: 787: 734: 707: 681: 655: 575: 548: 533:when ordered by the 492: for some  451: 368: 348: 328: 302: 276: 226: 199: 179: 129: 84: 2887:Philosophical logic 2872:Non-classical logic 2846:Non-monotonic logic 2595:Non-classical logic 2508:Cognitive semantics 2423:Existential closure 2367:Situation semantics 2270:Temperature paradox 2240:Rising declaratives 2205:Modal subordination 2180:Hurford disjunction 2140:Discourse relations 1615:{\displaystyle \!]} 1581:{\displaystyle \!]} 1473:{\displaystyle \!]} 1383:{\displaystyle \!]} 1342:{\displaystyle \!]} 1308:{\displaystyle \!]} 1274:{\displaystyle \!]} 940: for all  610: for all  571:, which amounts to 527:propositional logic 2841:Intermediate logic 2621:Heyting arithmetic 2553:Semantics of logic 2478:Strict conditional 2453:Quantifier raising 2418:Downward entailing 2398:Autonomy of syntax 2327:Generative grammar 2307:Categorial grammar 2245:Scalar implicature 2150:Epistemic modality 2125:De dicto and de re 1786:. Springer: 80–94. 1674:Rising declarative 1659:Intermediate logic 1612: 1578: 1510: 1470: 1436: 1380: 1339: 1305: 1271: 1234: 1211: 1172: 1131: 1050: 969: 867: 762: 717: 693: 667: 651:, which amount to 625: 561: 529:since they form a 507: 422: 354: 334: 314: 288: 262: 205: 185: 165: 108: 32:Jeroen Groenendijk 22:is a framework in 2854: 2853: 2836:Inquisitive logic 2831:Dynamic semantics 2784:Three-state logic 2738:Ontology language 2561: 2560: 2533:Logic translation 2496: 2495: 2488:Universal grinder 2473:Squiggle operator 2433:Meaning postulate 2372:Supervaluationism 2342:Intensional logic 2322:Dynamic semantics 2283: 2282: 2115:Crossover effects 2064:Tense–aspect–mood 2044:Lexical semantics 1500:}, and of course 1398:possible worlds, 941: 611: 493: 357:{\displaystyle v} 337:{\displaystyle w} 208:{\displaystyle v} 188:{\displaystyle w} 55:information state 2894: 2789:Tri-state buffer 2588: 2581: 2574: 2565: 2538:Linguistics wars 2468:Semantic parsing 2357:Montague grammar 2292: 2135:Deontic modality 1989: 1976:Truth conditions 1911:Compositionality 1904:Central concepts 1890: 1883: 1876: 1867: 1832: 1831: 1825: 1816: 1810: 1809: 1803: 1794: 1788: 1787: 1781: 1772: 1766: 1765: 1759: 1750: 1744: 1743: 1737: 1728: 1722: 1721: 1719: 1708: 1702: 1701: 1690: 1638: 1621: 1619: 1618: 1613: 1587: 1585: 1584: 1579: 1550: 1519: 1517: 1516: 1511: 1499: 1489: 1479: 1477: 1476: 1471: 1445: 1443: 1442: 1437: 1389: 1387: 1386: 1381: 1348: 1346: 1345: 1340: 1314: 1312: 1311: 1306: 1280: 1278: 1277: 1272: 1243: 1241: 1240: 1235: 1220: 1218: 1217: 1212: 1181: 1179: 1178: 1173: 1140: 1138: 1137: 1132: 1059: 1057: 1056: 1051: 978: 976: 975: 970: 942: 939: 876: 874: 873: 868: 771: 769: 768: 763: 743: 742: 727:as shown below. 726: 724: 723: 718: 716: 715: 702: 700: 699: 694: 676: 674: 673: 668: 634: 632: 631: 626: 612: 609: 570: 568: 567: 562: 560: 559: 516: 514: 513: 508: 494: 491: 431: 429: 428: 423: 363: 361: 360: 355: 343: 341: 340: 335: 323: 321: 320: 315: 297: 295: 294: 289: 271: 269: 268: 263: 214: 212: 211: 206: 194: 192: 191: 186: 174: 172: 171: 166: 124: 117: 115: 114: 109: 2902: 2901: 2897: 2896: 2895: 2893: 2892: 2891: 2857: 2856: 2855: 2850: 2819: 2770: 2742: 2719: 2701: 2692:Relevance logic 2687:Structural rule 2673: 2649:Degree of truth 2635: 2597: 2592: 2562: 2557: 2492: 2386: 2347:Lambda calculus 2279: 2250:Sloppy identity 2210:Opaque contexts 2145:Donkey anaphora 2110:Counterfactuals 2078: 1980: 1899: 1894: 1841: 1839:Further reading 1836: 1835: 1823: 1818: 1817: 1813: 1801: 1796: 1795: 1791: 1779: 1774: 1773: 1769: 1757: 1752: 1751: 1747: 1735: 1730: 1729: 1725: 1717: 1710: 1709: 1705: 1692: 1691: 1687: 1682: 1645: 1637: 1630: 1623: 1590: 1589: 1553: 1552: 1549: 1542: 1535: 1533: 1526: 1502: 1501: 1498: 1491: 1488: 1481: 1448: 1447: 1428: 1427: 1425: 1418: 1411: 1404: 1355: 1354: 1317: 1316: 1283: 1282: 1246: 1245: 1226: 1225: 1185: 1184: 1149: 1148: 1063: 1062: 982: 981: 880: 879: 785: 784: 732: 731: 705: 704: 679: 678: 653: 652: 573: 572: 551: 546: 545: 541:there exists a 531:Heyting algebra 449: 448: 366: 365: 346: 345: 326: 325: 300: 299: 274: 273: 224: 223: 197: 196: 177: 176: 127: 126: 119: 82: 81: 74:downward-closed 63:possible worlds 57:(alternately a 40: 17: 12: 11: 5: 2900: 2898: 2890: 2889: 2884: 2879: 2874: 2869: 2859: 2858: 2852: 2851: 2849: 2848: 2843: 2838: 2833: 2827: 2825: 2821: 2820: 2818: 2817: 2816: 2815: 2805: 2804: 2803: 2793: 2792: 2791: 2780: 2778: 2772: 2771: 2769: 2768: 2763: 2758: 2752: 2750: 2744: 2743: 2741: 2740: 2735: 2729: 2727: 2721: 2720: 2718: 2717: 2711: 2709: 2707:Paraconsistent 2703: 2702: 2700: 2699: 2694: 2689: 2683: 2681: 2675: 2674: 2672: 2671: 2666: 2661: 2656: 2651: 2645: 2643: 2637: 2636: 2634: 2633: 2628: 2623: 2618: 2613: 2607: 2605: 2603:Intuitionistic 2599: 2598: 2593: 2591: 2590: 2583: 2576: 2568: 2559: 2558: 2556: 2555: 2550: 2545: 2540: 2535: 2530: 2528:Inferentialism 2525: 2523:Formal grammar 2520: 2515: 2510: 2504: 2502: 2498: 2497: 2494: 2493: 2491: 2490: 2485: 2480: 2475: 2470: 2465: 2460: 2455: 2450: 2448:Possible world 2445: 2440: 2435: 2430: 2425: 2420: 2415: 2410: 2405: 2400: 2394: 2392: 2388: 2387: 2385: 2384: 2379: 2374: 2369: 2364: 2359: 2354: 2349: 2344: 2339: 2334: 2332:Glue semantics 2329: 2324: 2319: 2314: 2309: 2304: 2298: 2296: 2295:Formal systems 2289: 2285: 2284: 2281: 2280: 2278: 2277: 2272: 2267: 2262: 2257: 2252: 2247: 2242: 2237: 2232: 2227: 2222: 2220:Polarity items 2217: 2212: 2207: 2202: 2197: 2192: 2187: 2182: 2177: 2172: 2167: 2162: 2157: 2152: 2147: 2142: 2137: 2132: 2127: 2122: 2117: 2112: 2107: 2105:Conservativity 2102: 2097: 2092: 2086: 2084: 2080: 2079: 2077: 2076: 2071: 2069:Quantification 2066: 2061: 2056: 2051: 2046: 2041: 2036: 2031: 2026: 2021: 2016: 2011: 2006: 2001: 1995: 1993: 1986: 1982: 1981: 1979: 1978: 1973: 1968: 1963: 1958: 1953: 1948: 1946:Presupposition 1943: 1938: 1933: 1928: 1923: 1918: 1913: 1907: 1905: 1901: 1900: 1895: 1893: 1892: 1885: 1878: 1870: 1864: 1863: 1858: 1840: 1837: 1834: 1833: 1811: 1789: 1767: 1745: 1723: 1703: 1684: 1683: 1681: 1678: 1677: 1676: 1671: 1666: 1661: 1656: 1651: 1644: 1641: 1635: 1628: 1611: 1607: 1604: 1601: 1597: 1577: 1573: 1570: 1567: 1564: 1560: 1547: 1540: 1531: 1524: 1509: 1496: 1486: 1469: 1465: 1462: 1459: 1455: 1435: 1423: 1416: 1409: 1402: 1379: 1375: 1372: 1369: 1366: 1362: 1338: 1334: 1331: 1328: 1324: 1304: 1300: 1297: 1294: 1290: 1270: 1266: 1263: 1260: 1257: 1253: 1233: 1222: 1221: 1210: 1207: 1204: 1201: 1198: 1195: 1192: 1182: 1171: 1168: 1165: 1162: 1159: 1156: 1142: 1141: 1130: 1126: 1123: 1120: 1116: 1113: 1110: 1106: 1103: 1100: 1096: 1093: 1090: 1086: 1083: 1080: 1077: 1074: 1070: 1060: 1049: 1045: 1042: 1039: 1035: 1032: 1029: 1025: 1022: 1019: 1015: 1012: 1009: 1005: 1002: 999: 996: 993: 989: 979: 968: 965: 961: 958: 955: 951: 948: 945: 937: 934: 931: 928: 925: 922: 919: 916: 913: 910: 907: 904: 900: 897: 894: 891: 887: 877: 866: 863: 860: 857: 854: 851: 848: 845: 842: 839: 836: 833: 830: 827: 824: 821: 818: 815: 812: 809: 806: 802: 799: 796: 792: 761: 758: 755: 752: 749: 746: 741: 730:Given a model 714: 692: 689: 686: 666: 663: 660: 624: 621: 618: 615: 607: 604: 601: 598: 595: 592: 589: 586: 583: 580: 558: 554: 519: 518: 506: 503: 500: 497: 489: 486: 483: 480: 477: 474: 471: 468: 465: 462: 459: 456: 421: 418: 415: 412: 409: 406: 403: 400: 397: 394: 391: 388: 385: 382: 379: 376: 373: 353: 333: 313: 310: 307: 287: 284: 281: 261: 258: 255: 252: 249: 246: 243: 240: 237: 234: 231: 204: 184: 164: 161: 158: 155: 152: 149: 146: 143: 140: 137: 134: 107: 104: 101: 98: 95: 92: 89: 78: 77: 72:is a nonempty 66: 61:) is a set of 39: 36: 15: 13: 10: 9: 6: 4: 3: 2: 2899: 2888: 2885: 2883: 2880: 2878: 2875: 2873: 2870: 2868: 2865: 2864: 2862: 2847: 2844: 2842: 2839: 2837: 2834: 2832: 2829: 2828: 2826: 2822: 2814: 2811: 2810: 2809: 2806: 2802: 2799: 2798: 2797: 2794: 2790: 2787: 2786: 2785: 2782: 2781: 2779: 2777: 2776:Digital logic 2773: 2767: 2764: 2762: 2759: 2757: 2754: 2753: 2751: 2749: 2745: 2739: 2736: 2734: 2731: 2730: 2728: 2726: 2722: 2716: 2713: 2712: 2710: 2708: 2704: 2698: 2695: 2693: 2690: 2688: 2685: 2684: 2682: 2680: 2679:Substructural 2676: 2670: 2667: 2665: 2662: 2660: 2657: 2655: 2652: 2650: 2647: 2646: 2644: 2642: 2638: 2632: 2629: 2627: 2624: 2622: 2619: 2617: 2614: 2612: 2609: 2608: 2606: 2604: 2600: 2596: 2589: 2584: 2582: 2577: 2575: 2570: 2569: 2566: 2554: 2551: 2549: 2546: 2544: 2541: 2539: 2536: 2534: 2531: 2529: 2526: 2524: 2521: 2519: 2516: 2514: 2511: 2509: 2506: 2505: 2503: 2499: 2489: 2486: 2484: 2481: 2479: 2476: 2474: 2471: 2469: 2466: 2464: 2461: 2459: 2456: 2454: 2451: 2449: 2446: 2444: 2441: 2439: 2436: 2434: 2431: 2429: 2426: 2424: 2421: 2419: 2416: 2414: 2411: 2409: 2406: 2404: 2401: 2399: 2396: 2395: 2393: 2389: 2383: 2380: 2378: 2375: 2373: 2370: 2368: 2365: 2363: 2360: 2358: 2355: 2353: 2350: 2348: 2345: 2343: 2340: 2338: 2335: 2333: 2330: 2328: 2325: 2323: 2320: 2318: 2315: 2313: 2310: 2308: 2305: 2303: 2300: 2299: 2297: 2293: 2290: 2286: 2276: 2273: 2271: 2268: 2266: 2263: 2261: 2258: 2256: 2253: 2251: 2248: 2246: 2243: 2241: 2238: 2236: 2233: 2231: 2228: 2226: 2223: 2221: 2218: 2216: 2215:Performatives 2213: 2211: 2208: 2206: 2203: 2201: 2198: 2196: 2195:Logophoricity 2193: 2191: 2188: 2186: 2183: 2181: 2178: 2176: 2173: 2171: 2168: 2166: 2163: 2161: 2158: 2156: 2153: 2151: 2148: 2146: 2143: 2141: 2138: 2136: 2133: 2131: 2128: 2126: 2123: 2121: 2118: 2116: 2113: 2111: 2108: 2106: 2103: 2101: 2098: 2096: 2093: 2091: 2088: 2087: 2085: 2081: 2075: 2072: 2070: 2067: 2065: 2062: 2060: 2057: 2055: 2052: 2050: 2047: 2045: 2042: 2040: 2037: 2035: 2032: 2030: 2029:Evidentiality 2027: 2025: 2022: 2020: 2017: 2015: 2012: 2010: 2007: 2005: 2002: 2000: 1997: 1996: 1994: 1990: 1987: 1983: 1977: 1974: 1972: 1969: 1967: 1964: 1962: 1959: 1957: 1954: 1952: 1949: 1947: 1944: 1942: 1939: 1937: 1934: 1932: 1929: 1927: 1924: 1922: 1919: 1917: 1914: 1912: 1909: 1908: 1906: 1902: 1898: 1891: 1886: 1884: 1879: 1877: 1872: 1871: 1868: 1862: 1859: 1857: 1856:9780198814788 1853: 1849: 1848: 1843: 1842: 1838: 1829: 1822: 1815: 1812: 1807: 1800: 1793: 1790: 1785: 1778: 1771: 1768: 1764:. ACM: 71–80. 1763: 1756: 1749: 1746: 1741: 1734: 1727: 1724: 1716: 1715: 1707: 1704: 1699: 1695: 1689: 1686: 1679: 1675: 1672: 1670: 1667: 1665: 1662: 1660: 1657: 1655: 1652: 1650: 1647: 1646: 1642: 1640: 1634: 1627: 1622:, along with 1602: 1568: 1565: 1546: 1539: 1530: 1523: 1495: 1485: 1460: 1433: 1422: 1415: 1408: 1401: 1395: 1393: 1370: 1367: 1352: 1329: 1295: 1261: 1258: 1231: 1208: 1202: 1199: 1196: 1193: 1190: 1183: 1169: 1160: 1157: 1154: 1147: 1146: 1145: 1121: 1111: 1101: 1091: 1081: 1078: 1075: 1061: 1040: 1030: 1020: 1010: 1000: 997: 994: 980: 956: 946: 943: 932: 929: 926: 923: 920: 917: 914: 911: 905: 895: 878: 861: 858: 852: 849: 846: 840: 837: 834: 831: 828: 822: 819: 816: 813: 807: 797: 783: 782: 781: 779: 775: 756: 753: 750: 744: 728: 690: 687: 684: 664: 661: 658: 650: 646: 642: 638: 619: 616: 613: 602: 599: 596: 593: 590: 587: 584: 581: 556: 552: 544: 540: 536: 532: 528: 524: 501: 498: 495: 487: 484: 481: 478: 475: 469: 463: 457: 454: 446: 442: 438: 437: 436: 433: 413: 407: 401: 395: 389: 383: 380: 377: 351: 331: 308: 282: 253: 247: 241: 235: 221: 216: 202: 182: 156: 150: 144: 138: 123: 99: 93: 75: 71: 67: 64: 60: 56: 52: 51: 50: 48: 47: 38:Basic notions 37: 35: 33: 29: 25: 21: 2882:Intuitionism 2835: 2756:Three-valued 2697:Linear logic 2483:Type shifter 2458:Quantization 2408:Continuation 2336: 2275:Veridicality 2155:Exhaustivity 2120:Cumulativity 2039:Indexicality 2019:Definiteness 2014:Conditionals 1941:Logical form 1846: 1827: 1814: 1805: 1792: 1783: 1770: 1761: 1748: 1739: 1726: 1713: 1706: 1697: 1688: 1632: 1625: 1544: 1537: 1528: 1521: 1493: 1483: 1420: 1413: 1406: 1399: 1396: 1391: 1350: 1223: 1143: 777: 773: 729: 640: 636: 538: 520: 444: 440: 434: 220:alternatives 219: 217: 121: 79: 69: 58: 54: 44:inquisitive 43: 41: 19: 18: 2796:Four-valued 2766:Łukasiewicz 2761:Four-valued 2748:Many-valued 2725:Description 2715:Dialetheism 2403:Context set 2377:Type theory 2260:Subtrigging 2024:Disjunction 1951:Proposition 1654:Disjunction 523:connectives 46:proposition 2861:Categories 2654:Fuzzy rule 2548:Pragmatics 2200:Mirativity 1966:Speech act 1921:Entailment 1916:Denotation 1680:References 1446:such that 2867:Semantics 2808:IEEE 1164 2659:Fuzzy set 2352:Mereology 2288:Formalism 2170:Givenness 2095:Cataphora 2083:Phenomena 2074:Vagueness 2004:Ambiguity 1956:Reference 1936:Intension 1926:Extension 1603:φ 1569:φ 1508:∅ 1480:contains 1461:φ 1434:φ 1371:φ 1330:φ 1296:φ 1262:φ 1232:φ 1209:φ 1206:¬ 1203:∨ 1200:φ 1197:≡ 1194:φ 1170:φ 1167:¬ 1164:¬ 1161:≡ 1158:φ 1122:ψ 1112:∪ 1102:φ 1082:ψ 1079:∨ 1076:φ 1041:ψ 1031:∩ 1021:φ 1001:ψ 998:∧ 995:φ 957:φ 947:∈ 936:∅ 927:∩ 921:∣ 915:⊆ 896:φ 893:¬ 832:∈ 826:∀ 823:∣ 817:⊆ 760:⟩ 748:⟨ 688:∪ 662:∩ 617:∈ 606:∅ 597:∩ 591:∣ 585:⊆ 557:∗ 499:∈ 485:∈ 479:∣ 458:⁡ 417:∅ 257:∅ 160:∅ 103:∅ 2501:See also 2391:Concepts 2265:Telicity 2100:Coercion 2054:Negation 2049:Modality 1999:Anaphora 1808:: 41–72. 1664:Question 1643:See also 2801:Verilog 2009:Binding 643:have a 2824:Others 2438:Monads 1985:Topics 1854:  1419:, and 772:where 647:and a 535:subset 2641:Fuzzy 2130:De se 2034:Focus 1992:Areas 1961:Scope 1824:(PDF) 1802:(PDF) 1780:(PDF) 1758:(PDF) 1736:(PDF) 1718:(PDF) 24:logic 2813:VHDL 1852:ISBN 677:and 649:join 645:meet 639:and 455:info 439:The 298:and 26:and 2382:TTR 1527:or 1490:}, 525:of 447:is 344:or 215:. 195:or 68:An 53:An 2863:: 1826:. 1804:. 1782:. 1760:. 1738:. 1696:. 1631:, 1543:, 1412:, 1405:, 1394:. 49:. 2587:e 2580:t 2573:v 1889:e 1882:t 1875:v 1830:. 1742:. 1700:. 1636:4 1633:w 1629:3 1626:w 1624:{ 1610:] 1606:] 1600:[ 1596:[ 1576:] 1572:] 1566:? 1563:[ 1559:[ 1548:4 1545:w 1541:3 1538:w 1536:{ 1532:2 1529:w 1525:1 1522:w 1497:2 1494:w 1492:{ 1487:1 1484:w 1482:{ 1468:] 1464:] 1458:[ 1454:[ 1424:4 1421:w 1417:3 1414:w 1410:2 1407:w 1403:1 1400:w 1392:Q 1378:] 1374:] 1368:! 1365:[ 1361:[ 1351:P 1337:] 1333:] 1327:[ 1323:[ 1303:] 1299:] 1293:[ 1289:[ 1269:] 1265:] 1259:! 1256:[ 1252:[ 1191:? 1155:! 1129:] 1125:] 1119:[ 1115:[ 1109:] 1105:] 1099:[ 1095:[ 1092:= 1089:] 1085:] 1073:[ 1069:[ 1048:] 1044:] 1038:[ 1034:[ 1028:] 1024:] 1018:[ 1014:[ 1011:= 1008:] 1004:] 992:[ 988:[ 967:} 964:] 960:] 954:[ 950:[ 944:t 933:= 930:t 924:s 918:W 912:s 909:{ 906:= 903:] 899:] 890:[ 886:[ 865:} 862:1 859:= 856:) 853:p 850:, 847:w 844:( 841:V 838:, 835:s 829:w 820:W 814:s 811:{ 808:= 805:] 801:] 798:p 795:[ 791:[ 778:V 774:W 757:V 754:, 751:W 745:= 740:M 713:L 691:Q 685:P 665:Q 659:P 641:Q 637:P 623:} 620:P 614:t 603:= 600:t 594:s 588:W 582:s 579:{ 553:P 539:P 517:. 505:} 502:P 496:t 488:t 482:w 476:w 473:{ 470:= 467:) 464:P 461:( 445:P 420:} 414:, 411:} 408:v 405:{ 402:, 399:} 396:w 393:{ 390:, 387:} 384:v 381:, 378:w 375:{ 372:{ 352:v 332:w 312:} 309:v 306:{ 286:} 283:w 280:{ 260:} 254:, 251:} 248:v 245:{ 242:, 239:} 236:w 233:{ 230:{ 203:v 183:w 163:} 157:, 154:} 151:v 148:{ 145:, 142:} 139:w 136:{ 133:{ 122:w 120:{ 106:} 100:, 97:} 94:w 91:{ 88:{ 65:.

Index

logic
natural language semantics
Jeroen Groenendijk
proposition
possible worlds
downward-closed
connectives
propositional logic
Heyting algebra
subset
relative pseudocomplement
meet
join
Alternative semantics
Disjunction
Intermediate logic
Question
Responsive predicate
Rising declarative
"What is inquisitive semantics?"
Inquisitive Semantics
"Inquisitive semantics and intermediate logics"
"Generalized inquisitive logic: completeness via intuitionistic Kripke models"
"Inquisitive semantics: Two possibilities for disjunction"
"Inquisitive semantics and pragmatics"
"Inquisitive semantics and logic"
Inquisitive Semantics
ISBN
9780198814788
https://projects.illc.uva.nl/inquisitivesemantics/

Text is available under the Creative Commons Attribution-ShareAlike License. Additional terms may apply.

↑