A conversation can be conceived as aiming to circumscribe a set of possibilities that are relevant to the goals of the conversation. This set of possibilities may be conceived as determined by the goals and objective circumstances of the interlocutors and not by their propositional attitudes. An indicative conditional can be conceived as circumscribing a set of possibilities that have a certain property: If the set of relevant possibilities is subsequently restricted to one in which the antecedent holds, then it (...) will be restricted as well to one in which the consequent holds. We will identify a number of desiderata concerning the validity of arguments; we will develop a formally precise semantics for conditionals conceived in this way that satisfies the desiderata, and we will present a deductive calculus that is sound and complete with respect to the semantics. Finally, we will argue that the semantics compares well, both formally and foundationally, with two other semantic theories of indicative conditionals that satisfy the desiderata, namely, those of Gillies and Bledin. (shrink)

Expressivists about epistemic modals deny that ‘Jane might be late’ canonically serves to express the speaker’s acceptance of a certain propositional content. Instead, they hold that it expresses a lack of acceptance. Prominent expressivists embrace pragmatic expressivism: the doxastic property expressed by a declarative is not helpfully identified with that sentence’s compositional semantic value. Against this, we defend semantic expressivism about epistemic modals: the semantic value of a declarative from this domain is the property of doxastic attitudes it canonically serves (...) to express. In support, we synthesize data from the critical literature on expressivism—largely reflecting interactions between modals and disjunctions—and present a semantic expressivism that readily predicts the data. This contrasts with salient competitors, including: pragmatic expressivism based on domain semantics or dynamic semantics; semantic expressivism à la Moss [2015]; and the bounded relational semantics of Mandelkern [2019]. (shrink)

Inquisitive first order logic is an extension of first order classical logic, introducing questions and studying the logical relations between questions and quantifiers. It is not known whether is recursively axiomatizable, even though an axiomatization has been found for fragments of the logic. In this paper we define the \—classical antecedent—fragment, together with an axiomatization and a proof of its strong completeness. This result extends the ones presented in the literature and introduces a new approach to study the axiomatization problem (...) for fragments of the logic. (shrink)

In recent years, the logic of questions and dependencies has been investigated in the closely related frameworks of inquisitive logic and dependence logic. These investigations have assumed classical logic as the background logic of statements, and added formulas expressing questions and dependencies to this classical core. In this paper, we broaden the scope of these investigations by studying questions and dependency in the context of intuitionistic logic. We propose an intuitionistic team semantics, where teams are embedded within intuitionistic Kripke models. (...) The associated logic is a conservative extension of intuitionistic logic with questions and dependence formulas. We establish a number of results about this logic, including a normal form result, a completeness result, and translations to classical inquisitive logic and modal dependence logic. (shrink)

This paper argues that questions have an important role to to play in logic, both semantically and proof-theoretically. Semantically, we show that by generalizing the classical notion of entailment to questions, we can capture not only the standard relation of logical consequence, which holds between pieces of information, but also the relation of logical dependency, which holds between information types. Proof-theoretically, we show that questions may be used in inferences as placeholders for arbitrary information of a given type; by manipulating (...) such placeholders, we may construct formal proofs of dependencies. Finally, we show that such proofs have a specific kind of constructive content: they do not just witness the existence of a certain dependency, but actually encode a method for transforming information of the types described by the assumptions into information of the type described by the conclusion. (shrink)

Inquisitive first-order logic, InqBQ, is a system which extends classical first-order logic with formulas expressing questions. From a mathematical point of view, formulas in this logic express properties of sets of relational structures. This paper makes two contributions to the study of this logic. First, we describe an Ehrenfeucht–Fraïssé game for InqBQ and show that it characterizes the distinguishing power of the logic. Second, we use the game to study cardinality quantifiers in the inquisitive setting. That is, we study what (...) statements and questions can be expressed in InqBQ about the number of individuals satisfying a given predicate. As special cases, we show that several variants of the question how many individuals satisfy α(x) are not expressible in InqBQ, both in the general case and in restriction to finite models. (shrink)

Proof-theoretic methods are developed for subsystems of Johansson’s logic obtained by extending the positive fragment of intuitionistic logic with weak negations. These methods are exploited to establish properties of the logical systems. In particular, cut-free complete sequent calculi are introduced and used to provide a proof of the fact that the systems satisfy the Craig interpolation property. Alternative versions of the calculi are later obtained by means of an appropriate loop-checking history mechanism. Termination of the new calculi is proved, and (...) used to conclude that the considered logical systems are PSPACE-complete. (shrink)

This article provides an algebraic study of the propositional system$\mathtt {InqB}$of inquisitive logic. We also investigate the wider class of$\mathtt {DNA}$-logics, which are negative variants of intermediate logics, and the corresponding algebraic structures,$\mathtt {DNA}$-varieties. We prove that the lattice of$\mathtt {DNA}$-logics is dually isomorphic to the lattice of$\mathtt {DNA}$-varieties. We characterise maximal and minimal intermediate logics with the same negative variant, and we prove a suitable version of Birkhoff’s classic variety theorems. We also introduce locally finite$\mathtt {DNA}$-varieties and show that (...) these varieties are axiomatised by the analogues of Jankov formulas. Finally, we prove that the lattice of extensions of$\mathtt {InqB}$is dually isomorphic to the ordinal$\omega +1$and give an axiomatisation of these logics via Jankov$\mathtt {DNA}$-formulas. This shows that these extensions coincide with the so-called inquisitive hierarchy of [9].1. (shrink)