Results 21 to 30 of about 23,702 (247)

A FIRST-ORDER FRAMEWORK FOR INQUISITIVE MODAL LOGIC [PDF]

The Review of Symbolic Logic, 2021
AbstractWe present a natural standard translation of inquisitive modal logic $\mathrm{InqML}$ into first-order logic over the natural two-sorted relational representations of the intended models, which captures the built-in higher-order features of $\mathrm{InqML}$ .
Silke Meißner, Martin Otto
openalex   +4 more sources

Undefinability in Inquisitive Logic with Tensor [PDF]

, 2019
Logics based on team semantics, such as inquisitive logic and dependence logic, are not closed under uniform substitution. This leads to an interesting separation between expressive power and definability: it may be that an operator O can be added to a language without a gain in expressive power, yet O is not definable in that language.
Ivano Ciardelli, Fausto Barbero
openalex   +4 more sources

GAMES AND CARDINALITIES IN INQUISITIVE FIRST-ORDER LOGIC [PDF]

The Review of Symbolic Logic, 2021
AbstractInquisitive 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.
Gianluca Grilletti, Ivano Ciardelli
openalex   +4 more sources

GLOBAL SUPERVENIENCE IN INQUISITIVE MODAL LOGIC [PDF]

The Review of Symbolic Logic
AbstractThe notion of global supervenience captures the idea that the overall distribution of certain properties in the world is fixed by the overall distribution of certain other properties. A formal implementation of this idea in constant-domain Kripke models is as follows: predicates $Q_1,\dots ,Q_m$ globally supervene on predicates $P_1,\dots ...
Ivano Ciardelli
openalex   +3 more sources

On the expressive power of inquisitive team logic and inquisitive first-order logic [PDF]

Inquisitive team logic is a variant of inquisitive logic interpreted in team semantics, which has been argued to provide a natural setting for the regimentation of dependence claims. With respect to sentences, this logic is known to be expressively equivalent with first-order logic. In this article we show that, on the contrary, the expressive power of
Juha Kontinen, Ivano Ciardelli
  +5 more sources

On intermediate inquisitive and dependence logics: An algebraic study

Annals of Pure and Applied Logic, 2022
This article provides an algebraic study of intermediate inquisitive and dependence logics. While these logics are usually investigated using team semantics, here we introduce an alternative algebraic semantics and we prove it is complete for all intermediate inquisitive and dependence logics.
Davide Emilio Quadrellaro
openalex   +4 more sources

ON THE EXPRESSIVE POWER OF INQUISITIVE EPISTEMIC LOGIC [PDF]

The Journal of Symbolic Logic
Abstract Inquisitive modal logic, InqML, in its epistemic incarnation, extends standard epistemic logic to capture not just the information that agents have, but also the questions that they are interested in. We use the natural notion of bisimulation equivalence in the setting of InqML, as introduced in [7], to characterise the expressiveness of ...
Ivano Ciardelli, Martin Otto
openalex   +4 more sources

Structural completeness in propositional logics of dependence [PDF]

, 2015
In this paper we prove that three of the main propositional logics of dependence (including propositional dependence logic and inquisitive logic), none of which is structural, are structurally complete with respect to a class of substitutions under which
Iemhoff, Rosalie, Yang, Fan
core   +8 more sources

Group Inquiry [PDF]

, 2022
Group agents can act, they can have knowledge. How should we understand the species of collective action which aims at knowledge? In this paper, I present an account of group inquiry.
Habgood-Coote, Joshua
core   +2 more sources

Selection method for inquisitive modal logic [PDF]

Reports on Mathematical Logic
The selection method is one of the methods to prove that various modal logics have the finite model property. For a given formula that is satisfiable in some model, we select a finite tree-like submodel, while preserving the satisfiability of the observed formula. In this paper, we adapt the selection method for the inquisitive modal logic InqML.
Stipe Marić, Tin Perkov
openalex   +3 more sources