• Corpus ID: 18901358

Structural Multi-type Sequent Calculus for Inquisitive Logic

@article{Frittella2016StructuralMS,
  title={Structural Multi-type Sequent Calculus for Inquisitive Logic},
  author={Sabine Frittella and Giuseppe Greco and Alessandra Palmigiano and Fan Yang},
  journal={ArXiv},
  year={2016},
  volume={abs/1604.00936}
}
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… 
Title Algebraic and topological semantics for inquisitive logic via choice-free duality Permalink
We introduce new algebraic and topological semantics for inquisitive logic. The algebraic semantics is based on special Heyting algebras, which we call inquisitive algebras, with propositional
Algebraic and Topological Semantics for Inquisitive Logic via Choice-Free Duality
TLDR
While a Boolean algebra B is realized as the Boolean algebra of compact regular open elements of a UV-space dual to B, it is shown that H(B) is realizing as the algebra of CompactOpen elements of this space, which yields a new topological semantics for inquisitive logic.
An Algebraic Approach to Inquisitive and DNA-Logics
This article provides an algebraic study of the propositional system InqB of inquisitive logic. We also investigate the wider class of DNA-logics, which are negative variants of intermediate logics,
Bilattice logic properly displayed
Unified Correspondence as a Proof-Theoretic Tool
TLDR
The present paper aims at establishing formal connections between correspondence phenomena, well known from the area of modal logic, and the theory of display calculi, originated by Belnap, and applies unified correspondence theory, with its tools and insights, to extend Kracht's results and prove his claims in the setting of DLE-logics.
Lattice Logic Properly Displayed
TLDR
This work introduces a proper display calculus for (non-distributive) Lattice Logic which is sound, complete, conservative, and enjoys cut-elimination and sub-formula property and applies the guidelines of the multi-type methodology in the design of display calculi.
Measurable Kleene algebras and structural control ∗
Kleene algebras are the mathematical structures modelling the behaviour of so called regular expressions in automata theory, introduced by S.C. Kleene [16] with the same syntactic laws that have been
Algebraic semantics of refinement modal logic
TLDR
Algebraic semantics of refinement modal logic is developed using duality theory and it is shown that refinement modAL logic is sound and complete with respect to the algebraic semantics introduced.
LOSS Revisited. II. The Relative Rates of Different Types of Supernovae Vary between Low- and High-mass Galaxies
In Paper I of this series, we showed that the ratio between stripped-envelope (SE) supernova (SN) and Type II SN rates reveals a significant SE SN deficiency in galaxies with stellar masses $\lesssim
...
...

References

SHOWING 1-10 OF 39 REFERENCES
Sound and Complete Tree-Sequent Calculus for Inquisitive Logic
TLDR
A tree-sequent calculus for inquisitive logic (Groenendijk 2008) is introduced as a special form of labelled deductive system (Gabbay 1996) and it is established that it is sound and complete and decidable and enjoys cut-elimination theorem.
Multi-type Sequent Calculi
TLDR
A proof-theoretic setting is discussed, inspired both to Belnap's Display Logic and to Sambin's Basic Logic, which generalises these calculi in two directions: by explicitly allowing different types, and by weakening the so-called display and visibility properties.
Algebraic foundations for the semantic treatment of inquisitive content
TLDR
It is argued that propositions, in order to embody both informative and inquisitive content in a satisfactory way, should be defined as non-empty, downward closed sets of possibilities, where each possibility in turn is a set of possible worlds.
From IF to BI
TLDR
It is shown how Hodges’ semantics can be seen as a special case of a general construction, which provides a context for a useful completeness theorem with respect to a wider class of models, and proves a full abstraction result in the style of Hodges, in which the intuitionistic implication plays a very natural rôle.
Dynamic Epistemic Logic Displayed
TLDR
A display calculus for the logic of Epistemic Actions and Knowledge EAK of Baltag-Moss-Solecki is introduced, which revives the interest in the global semantics for dynamic epistemic logics pursued among others by Baltag, Cirstea and Sadrzadeh.
Unified Correspondence as a Proof-Theoretic Tool
TLDR
The present paper aims at establishing formal connections between correspondence phenomena, well known from the area of modal logic, and the theory of display calculi, originated by Belnap, and applies unified correspondence theory, with its tools and insights, to extend Kracht's results and prove his claims in the setting of DLE-logics.
Multi-type display calculus for dynamic epistemic logic
TLDR
It is proved that the Dynamic Calculus adequately captures Baltag-Moss-Solecki’s dynamic epistemic logic, and enjoys Belnap-style cut elimination.
Compositional Semantics for a Language of Imperfect Information
  • W. Hodges
  • Philosophy, Computer Science
    Log. J. IGPL
  • 1997
TLDR
A compositional semantics for this logic is described, which gives a compositional meaning to formulas of the ‘information-friendly’ language of Hintikka and Sandu, and proves that two formulas have the same interpretation in all structures.
Some Strange Quantifiers
  • W. Hodges
  • Computer Science
    Structures in Logic and Computer Science
  • 1997
TLDR
A recent Tarski-style semantics for a language which includes the branching quantifiers on which Andrzej Ehrenfeucht made the first breakthrough in 1958 is reported, providing a compositional and fully abstract semantics for the slightly more limited syntax of Hintikka and Sandu.
A proof-theoretic semantic analysis of dynamic epistemic logic
TLDR
An analysis of the existing proof systems for dynamic epistemic logic from the viewpoint of proof-theoretic semantics, and a generalisation of Belnap’s cut elimination metatheorem for display calculi and a revised version of the display-style calculus D.EAK are provided.
...
...