Questions and dependency in intuitionistic logic
This paper shows how the inquisitive logic and dependence logic which allow for a logical analysis of questions and dependencies between propositions can be developed on the intuitionistic basis. As a result, the intuitionistic inquisitive logic (\textsf{InqI}) is introduced, which deals not only with intuitionistic statements, but also with questions and formulas that express dependencies. To this effect, the authors develop a kind of Kripke-semantics for intuitionistic logic based on the notion of support at a team, rather than on the notion of truth at a possible world. Namely, having a standard intuitionistic Kripke model \(M = \langle W, R, V \rangle\), a \emph{team} in \(M\) is defined as a set of worlds \(t \subseteq W\). Moreover, a team \(t^\prime\) is an extension of a team \(t\) iff \(t \subseteq R[t]\), where \(R[t] : = \bigcup_{w \in t} R[w] \) (\(R[w] = \{ w^\prime : wRw^\prime \}\)). Then one defines the intuitionistic notion of support with respect to a team in a Kripke model, so that, e.g., an atomic proposition \(p\) is supported by a team \(t\) in \(M\) iff \(p\) is true at every world \(w\) from this team: \(M, t \models p \Leftrightarrow V(w, p) = 1\) for all \(w \in t\). This definition is then naturally extended to compound formulas. To deal with questions one enriches the standard intuitionistic language with a new connective `inquisitive disjunction' (\(\scriptstyle\mathbb{V}\)), where \(\varphi \:{\scriptstyle\mathbb{V}}\: \psi\) is regarded as a question whether \(\varphi\) or \(\psi\). The support condition for inquisitive disjunction is then as follows: \(M, t \models \varphi \:{\scriptstyle\mathbb{V}}\: \psi \Leftrightarrow M, t \models \varphi \mbox{ or } M, t \models \psi \). It turns out that a question \(\mu\) determines another question \(\nu\) in a team \(t\) of a model \(M\) iff the team \(t\) supports the implication \(\mu \rightarrow\nu\). The authors introduce the notion of entailment between formulas of \textsf{InqI} and construct a natural deduction system which is obtained from the respective system for classical inquisitive logic by simply dropping the double negation elimination rule. This system is sound and complete with respect to the proposed semantics. Thus, the authors conclude, ``the only difference between the classical and the intuitionistic version of inquisitive logic lies in the underlying logic of statements, while the relation between statements and questions is the same in both cases.
- A generalization of inquisitive semantics
- A Multi-type Calculus for Inquisitive Logic
- A Van Benthem Theorem for Modal Team Semantics
- Algebras of information states
- Bisimulation in inquisitive modal logic
- Characterizing relative frame definability in team semantics via the universal modality
- Dependence and independence
- Dependence logic. A new approach to independence friendly logic
- Dependency as question entailment
- Expressing second-order sentences in intuitionistic dependence logic
- Extended modal dependence logic \(\mathcal{EMDL}\)
- From IF to BI. A tale of dependence and separation
- scientific article; zbMATH DE number 6680142 (Why is no real title available?)
- scientific article; zbMATH DE number 1003731 (Why is no real title available?)
- scientific article; zbMATH DE number 3464827 (Why is no real title available?)
- Inclusion and exclusion dependencies in team semantics -- on some logics of imperfect information
- Inquisitive dynamic epistemic logic
- Inquisitive logic
- Modal dependence logic
- Modal dependence logics: axiomatizations and model-theoretic properties
- Modalities in the realm of questions: axiomatizing inquisitive epistemic logic
- On an interpretation of second order quantification in first order intuitionistic propositional logic
- On the semantics and logic of declaratives and interrogatives
- Propositional inquisitive logic: a survey
- Propositional logics of dependence
- Propositional team logics
- Questions as information types
- SUBSTRUCTURAL INQUISITIVE LOGICS
- Weak negation in inquisitive semantics
- Expressing second-order sentences in intuitionistic dependence logic
- Inquisitive Heyting algebras
- Completeness for the classical antecedent fragment of inquisitive first-order logic
- On intermediate inquisitive and dependence logics: an algebraic study
- Inquisitive logic as an epistemic logic of knowing how
- Interrogative Dependencies and the Constructive Content of Inquisitive Proofs
- Question dependency in terms of compliance and erotetic implication
- Goldblatt-Thomason-style characterization for intuitionistic inquisitive logic
- Dependency as question entailment
- COMPLETE LOGICS FOR ELEMENTARY TEAM PROPERTIES
- Structural completeness and superintuitionistic inquisitive logics
- Intermediate logics in the setting of team semantics
- Modular SAT-based techniques for reasoning tasks in team semantics
- Information types in intuitionistic predicate logic with constant domains
- Constructive validity of a generalized Kreisel-Putnam rule
- The flattening operator in team-based logics
- Inquisitive split and structural completeness
- State-based modal logics for free choice
- Geometric theories in inquisitive modal logic
- A proof-theoretic interpolation theorem for inquisitive propositional logic
- Connecting state-based and team-based inquisitive logic
- A relevant logic of questions
This page was built for publication: Questions and dependency in intuitionistic logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2176408)
