scholarly journals Inferential erotetic logic meets inquisitive semantics

Synthese ◽  
2015 ◽  
Vol 192 (6) ◽  
pp. 1585-1608 ◽  
Author(s):  
Andrzej Wiśniewski ◽  
Dorota Leszczyńska-Jasion
2020 ◽  
pp. 1-22
Author(s):  
MORITZ CORDES

Abstract This paper contributes to the calculization of evocation and erotetic implication as defined by Inferential Erotetic Logic (IEL). There is a straightforward approach to calculizing (propositional) erotetic implication which cannot be applied to evocation. First-order evocation is proven to be uncalculizable, i.e. there is no proof system, say FOE, such that for all $X, Q$ : X evokes Q iff there is an FOE-proof for the evocation of Q by X. These results suggest a critique of the represented approaches to calculizing IEL. This critique is expanded into a programmatic reconsideration of the IEL-definitions of evocation and erotetic implication. From a different point of view these definitions should be seen as desiderata that may or may not play the role of a point of orientation when setting up “rules of asking.”


1988 ◽  
Vol 4 (3-4) ◽  
pp. 29-46
Author(s):  
James W. Garrison ◽  
C. J.B. Macmillan

2019 ◽  
Vol 29 ◽  
pp. 22
Author(s):  
Jos Tellings

Temporal questions with when and their counterparts in other languages display tense restrictions: they are incompatible with the present tense that is interpreted as 'currently ongoing', and English when-questions are incompatible with the present perfect. The existence of tense restrictions is one of the reasons why a theory of the semantics of questions should include an account of tense and aspect. I first propose an explanation of the tense restrictions based on the pragmatics of questions and partial answers. Then, I discuss how tense and aspectual operators can be added to Inquisitive Semantics (Ciardelli, Groenendijk & Roelofsen 2018).


2016 ◽  
Vol 26 ◽  
pp. 732 ◽  
Author(s):  
Ivano Ciardelli

This paper describes how any theory which assigns propositions to conditional sentences can be lifted to the setting of inquisitive semantics, where antecedents and consequents may be associated with multiple propositions. We show that the lifted account improves on the original account in two ways: first, it leads to a better analysis of disjunctive antecedents, which are treated as introducing multiple assumptions; second, it extends the original account to cover two further classes of conditional constructions, namely, unconditionals and conditional questions. 


2019 ◽  
Vol 12 (2) ◽  
pp. 296-330 ◽  
Author(s):  
VÍT PUNČOCHÁŘ

AbstractThis paper shows that any propositional logic that extends a basic substructural logic BSL (a weak, nondistributive, nonassociative, and noncommutative version of Full Lambek logic with a paraconsistent negation) can be enriched with questions in the style of inquisitive semantics and logic. We introduce a relational semantic framework for substructural logics that enables us to define the notion of an inquisitive extension of λ, denoted as ${\lambda ^?}$, for any logic λ that is at least as strong as BSL. A general theory of these “inquisitive extensions” is worked out. In particular, it is shown how to axiomatize ${\lambda ^?}$, given the axiomatization of λ. Furthermore, the general theory is applied to some prominent logical systems in the class: classical logic Cl, intuitionistic logic Int, and t-norm based fuzzy logics, including for example Łukasiewicz fuzzy logic Ł. For the inquisitive extensions of these logics, axiomatization is provided and a suitable semantics found.


2019 ◽  
Vol 37 (6) ◽  
pp. 7711-7723
Author(s):  
Li-Li Xie ◽  
Xiu-Yun Wu

Sign in / Sign up

Export Citation Format

Share Document