Errata Corrige to “Pragmatic and dialogic interpretation of bi-intuitionism. Part I”
Journal Title: Logic and Logical Philosophy - Year 2016, Vol 25, Issue 2
Abstract
The goal of [3] is to sketch the construction of a syntactic categorical model of the bi-intuitionistic logic of assertions and hypotheses AH, axiomatized in a sequent calculus AH-G1, and to show that such a model has a chirality-like structure inspired by the notion of dialogue chirality by P-A. Melliès [8]. A chirality consists of a pair of adjoint functors L ⊣ R, with L: A → B, R: B → A, and of a functor (.)* : A → Bop(0,1) satisfying certain conditions. The definition of the logic AH in [3] needs to be modified so that our categories A and B are actually dual. With this modification, a more complex structure emerges.
Authors and Affiliations
Gianluigi Bellin, Alessandro Menti, Massimiliano Carrara, Daniele Chiffi
Keywords
Related Articles
- EP ID EP201852
- DOI 10.12775/LLP.2015.005
- Views 75
- Downloads 0
Sweet SIXTEEN: Automation via Embedding into Classical Higher-Order Logic
An embedding of many-valued logics based on SIXTEEN in classical higher-order logic is presented. SIXTEEN generalizes the four-valued set of truth degrees of Dunn/Belnap’s system to a lattice of sixteen truth degrees wit...
Mereology and truth-making
Many mereological propositions are true contingently, so we are entitled to ask why they are true. One frequently given type of answer to such questions evokes truth-makers, that is, entities in virtue of whose existence...
Composition, identity, and emergence
Composition as Identity (CAI) is the thesis that a whole is, strictly and literally, identical to its parts, considered collectively. McDaniel [2008] argues against CAI in that it prohibits emergent properties. Recently...
Mereology and Infinity
This paper deals with the treatment of infinity and finiteness in mereology. After an overview of some first-order mereological theories, finiteness axioms are introduced along with a mereological definition of “x is fin...
Simple cut elimination proof for hybrid logic
In the paper we present a relatively simple proof of cut elimination theorem for variety of hybrid logics in the language with satisfaction operators and universal modality. The proof is based on the strategy introduced...