Intuitionistic double negation as a necessity operator.
Kripke models with relative accessibility and their applications to inferences from incomplete information
Le fantôme de la modalité
Le texte philosophique comme lieu d'étude sur la logique usuelle
Les modalités de la correction totale
Liberated versions of T, S4, and S5.
Logiche modali con la proprietà del punto fisso
We introduce various kinds of fixed-point properties for modal logics, and we classify the most prominent systems according to these. Our goal is to do a first step towards a complete characterization of provability logics of (possibly non standard) derivability predicates for Peano Arithmetic.
Logics for stable and unstable mereological relations
In this paper we present logics about stable and unstable versions of several well-known relations from mereology: part-of, overlap and underlap. An intuitive semantics is given for the stable and unstable relations, describing them as dynamic counterparts of the base mereological relations. Stable relations are described as ones that always hold, while unstable relations hold sometimes. A set of first-order sentences is provided to serve as axioms for the stable and unstable relations, and representation...
Logique modale propositionnelle : une vue cavalière
Many-sorted coalgebraic modal logic : a model-theoretic study
This paper gives a semantical underpinning for a many-sorted modal logic associated with certain dynamical systems, like transition systems, automata or classes in object-oriented languages. These systems will be described as coalgebras of so-called polynomial functors, built up from constants and identities, using products, coproducts and powersets. The semantical account involves Boolean algebras with operators indexed by polynomial functors, called MBAOs, for Many-sorted Boolean Algebras with...
Many-Sorted Coalgebraic Modal Logic: a Model-theoretic Study
This paper gives a semantical underpinning for a many-sorted modal logic associated with certain dynamical systems, like transition systems, automata or classes in object-oriented languages. These systems will be described as coalgebras of so-called polynomial functors, built up from constants and identities, using products, coproducts and powersets. The semantical account involves Boolean algebras with operators indexed by polynomial functors, called MBAOs, for Many-sorted Boolean Algebras with...
Minimal modal systems in which Heyting and classical logic can be embedded.
Modal operators on ordered sets
Modal operators on symmetrical Heyting algebras
Modal Translations of Heyting and Peano Arithmetic
Modality in open Institutions with Concrete Syntax
Model existence theorem in superrelevant predicate logics.
Model-theoretic properties of cause-and-effect structures
Modified modus ponens and modal logic
Negation And Contradiction.