A Multi-type Calculus for Inquisitive Logic

DOI10.1007/978-3-662-52921-8_14MaRDI QIDQ2820696zbMATH OpenOpenAlexFDO

Authors Sabine Frittella, Giuseppe Greco, Alessandra Palmigiano, Fan Yang

Publication date 9 September 2016

Published in Logic, Language, Information, and Computation (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1604.00936

Mathematics Subject Classification ID

Logic of natural languages (03B65)

Abstract: In this paper, we define a multi-type calculus for inquisitive logic, which is sound, complete and enjoys Belnap-style cut-elimination and subformula property. Inquisitive logic is the logic of inquisitive semantics, a semantic framework developed by Groenendijk, Roelofsen and Ciardelli which captures both assertions and questions in natural language. Inquisitive logic is sound and complete w.r.t. the so-called state semantics (also known as team semantics). The Hilbert-style presentation of inquisitive logic is not closed under uniform substitution; indeed, some occurrences of formulas are restricted to a certain subclass of formulas, called flat formulas. This and other features make the quest for analytic calculi for this logic not straightforward. We develop a certain algebraic and order-theoretic analysis of the team semantics, which provides the guidelines for the design of a multi-type environment which accounts for two domains of interpretation, for flat and for general formulas, as well as for their interaction. This multi-type environment in its turn provides the semantic environment for the multi-type calculus for inquisitive logic we introduce in this paper.

Recommendations

• Labelled sequent calculus for inquisitive logic
• Quantified multimodal logics in simple type theory
• Sound and Complete Tree-Sequent Calculus for Inquisitive Logic
• Calculi for many-valued logics
• scientific article; zbMATH DE number 3928982
• Multimodal and intuitionistic logics in simple type theory
• scientific article; zbMATH DE number 7585721
• Multi-type display calculus for semi De Morgan logic
• scientific article; zbMATH DE number 516994
• A refinement calculus for logic programs

Cites work

• Algebraic foundations for the semantic treatment of inquisitive content
• Compositional semantics for a language of imperfect information
• Dependence logic. A new approach to independence friendly logic
• Display logic
• Dynamic epistemic logic displayed
• Eine Unableitbarkeitsbeweismethode für den Intuitionistischen Aussagenkalkül
• From IF to BI. A tale of dependence and separation
• scientific article; zbMATH DE number 3448545 (Why is no real title available?)
• Inquisitive logic
• Inquisitive Semantics: Two Possibilities for Disjunction
• Multi-type display calculus for propositional dynamic logic
• On maximal intermediate logics with the disjunction property
• Propositional logics of dependence
• Questions as information types
• Sound and Complete Tree-Sequent Calculus for Inquisitive Logic
• Towards a Logic of Information Exchange

Cited in

(25)

• Mints type deductive calculi for logic programming
• Labelled sequent calculus for inquisitive logic
• Semi De Morgan logic properly displayed
• Inquisitive Heyting algebras
• Propositional union closed team logics
• Questions and dependency in intuitionistic logic
• Algorithmic correspondence and canonicity for non-distributive logics
• Bilattice logic properly displayed
• Proper multi-type display calculi for rough algebras
• Non-normal modal logics and conditional logics: semantic analysis and proof theory
• First-order inquisitive pair logic
• Sound and Complete Tree-Sequent Calculus for Inquisitive Logic
• THE LOGIC OF RESOURCES AND CAPABILITIES
• Syntactic Completeness of Proper Display Calculi
• A first-order framework for inquisitive modal logic
• Constructive canonicity of inductive inequalities
• GAMES AND CARDINALITIES IN INQUISITIVE FIRST-ORDER LOGIC
• Linear Logic Properly Displayed
• Structural completeness and superintuitionistic inquisitive logics
• Algebraic proof theory for LE-logics
• Information types in intuitionistic predicate logic with constant domains
• Bounded inquisitive logics: sequent calculi and schematic validity
• Inductive sequents for distributive modal logic
• Axiomatizing modal inclusion logic and its variants
• Inquisitive split and structural completeness

This page was built for publication: A Multi-type Calculus for Inquisitive Logic

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2820696)