Public announcement logic is an extension of multiagent epistemic logic with dynamic operators to model the informational consequences of announcements to the entire group of agents. We propose an extension of public announcement logic with a dynamic modal operator that expresses what is true after any announcement: after which , does it hold that Kφ? We give various semantic results and show completeness for a Hilbert-style axiomatization of this logic. There is a natural generalization to a logic for arbitrary events.

We propose two alternatives to Xu’s axiomatization of Chellas’s STIT. The first one simplifies its presentation, and also provides an alternative axiomatization of the deliberative STIT. The second one starts from the idea that the historic necessity operator can be defined as an abbreviation of operators of agency, and can thus be eliminated from the logic of Chellas’s STIT. The second axiomatization also allows us to establish that the problem of deciding the satisfiability of a STIT formula without temporal operators (...) is NP-complete in the single-agent case, and is NEXPTIME-complete in the multiagent case, both for the deliberative and Chellas’s STIT. (shrink)

The paper presents a new logic for reasoning about the formation of beliefs through perception or through inference in non-omniscient resource-bounded agents. The logic distinguishes the concept of explicit belief from the concept of background knowledge. This distinction is reflected in its formal semantics and axiomatics: we use a non-standard semantics putting together a neighborhood semantics for explicit beliefs and relational semantics for background knowledge, and we have specific axioms in the logic highlighting the relationship between the two concepts. Mental (...) operations of perceptive type and inferential type, having effects on epistemic states of agents, are primitives in the object language of the logic. At the semantic level, they are modelled as special kinds of model-update operations, in the style of dynamic epistemic logic. Results about axiomatization, decidability and complexity for the logic are given in the paper. (shrink)

In the ordinary modal language, KD is the modal logic determined by the class of all serial frames. In this paper, we demonstrate that KD is nullary.

The problem of unification in a normal modal logic $L$ can be defined as follows: given a formula $\varphi$, determine whether there exists a substitution $\sigma$ such that $\sigma $ is in $L$. In this paper, we prove that for several non-symmetric non-transitive modal logics, there exists unifiable formulas that possess no minimal complete set of unifiers.

Epistemic logics are essential to the design of logical systems that capture elements of reasoning about knowledge. In this paper, we study the computability of unifiability and the unification types in several epistemic logics.

The unification problem in a normal modal logic is to determine, given a formula.

We introduce frame-equivalence games tailored for reasoning about the size, modal depth, number of occurrences of symbols and number of different propositional variables of modal formulae defining a given frame property. Using these games, we prove lower bounds on the above measures for a number of well-known modal axioms; what is more, for some of the axioms, we show that they are optimal among the formulae defining the respective class of frames.

is an extension of public announcement logic. It is based on a modal operator that expresses what is true after any arbitrary announcement. An incorrect Truth Lemma has been stated and ‘demonstrated’ in Balbiani et al. . In this paper, we put right the wording and the proof of the Truth Lemma for.

It is already known that unifiable formulas in normal modal logic |$\textbf {K}+\square ^{2}\bot $| are either finitary or unitary and unifiable formulas in normal modal logic |$\textbf {Alt}_{1}+\square ^{2}\bot $| are unitary. In this paper, we prove that for all |$d{\geq }3$|⁠, unifiable formulas in normal modal logic |$\textbf {K}+\square ^{d}\bot $| are either finitary or unitary and unifiable formulas in normal modal logic |$\textbf {Alt}_{1}+\square ^{d}\bot $| are unitary.

We introduce and study a variety of modal logics of parallelism, orthogonality, and affine geometries, for which we establish several completeness, decidability and complexity results and state a number of related open, and apparently difficult problems. We also demonstrate that lack of the finite model property of modal logics for sufficiently rich affine or projective geometries (incl. the real affine and projective planes) is a rather common phenomenon.

ABSTRACT A spatial logic is a modal logic of which the models are the mathematical models of space. Successively considering the mathematical models of space that are the incidence geometry and the projective geometry, we will successively establish the language, the semantical basis, the axiomatical presentation, the proof of the decidability and the proof of the completeness of INC, the modal multilogic of incidence geometry, and PRO, the modal multilogic of projective geometry.

ABSTRACT In this paper we introduce and investigate various classes of multimodal logics based on frames with relative accessibility relations. We discuss their applicability to representation and analysis of incomplete information. We provide axiom systems for these logics and we prove their completeness.

In topological spaces, the relation of extended contact is a ternary relation that holds between regular closed subsets A, B and D if the intersection of A and B is included in D. The algebraic counterpart of this mereotopological relation is the notion of extended contact algebra which is a Boolean algebra extended with a ternary relation. In this paper, we are interested in the relational representation theory for extended contact algebras. In this respect, we study the correspondences between point-free (...) and point-based models of space in terms of extended contact. More precisely, we prove new representation theorems for extended contact algebras. (shrink)

One of the important extensions of PDL is PDL with intersection of programs. We devote this paper to its complete axiomatization.

The aim of this paper is to give new kinds of modal logics suitable for reasoning about regions in discrete spaces. We call them dynamic logics of the region-based theory of discrete spaces. These modal logics are linguistic restrictions of propositional dynamic logic with the global diamond E. Their formulas are equivalent to Boolean combinations of modal formulas like E(A ∧ ⟨α⟩ B) where A and B are Boolean terms and α is a relational term. Examining what we can say (...) about dynamic models when we use formulas to describe them, we successively address the axiomatization/completeness issue and the decidability/complexity issue of our dynamic logics of the region-based theory of discrete spaces. (shrink)

ABSTRACT We consider the question of the complete axiomatization of a relative modal logic with composition and intersection.

(2012). Modal logics for reasoning about infinite unions and intersections of binary relations. Journal of Applied Non-Classical Logics: Vol. 22, No. 4, pp. 275-294. doi: 10.1080/11663081.2012.705960.

We prove that $\textbf {K}5$ and some of its extensions that do not contain $\textbf {K}4$ are of unification type $1$.

The product of two |$\textbf {Alt}$| logics possesses the polynomial product finite model property and its membership problem is |$\textbf {coNP}$|-complete. Using a reduction from an undecidable domino-tiling problem, we prove that its admissibility problem is undecidable.

This paper is devoted to the completeness issue of RMLCI — the relative modal logic with composition and intersection— a restriction of the propositional dynamic logic with intersection. The trouble with RMLCI is that the operation of intersection is not modally definable. Using the notion of mosaics, we give a new proof of a theorem considered in a previous paper “Complete axiomatization of a relative modal logic with composition and intersection”. The theorem asserts that the proof theory of RMLCI is (...) complete for the standard Kripke semantics of RMLCI. (shrink)

This paper is devoted to the complete axiomatization of dynamic extensions of arrow logic based on a restriction of propositional dynamic logic with intersection. Our deductive systems contain an unorthodox inference rule: the inference rule of intersection. The proof of the completeness of our deductive systems uses the technique of the canonical model.

ABSTRACT This paper presents the axioinatization—without the rule of irreflexivity—of the modal logic of inequality as well as a method for proving its completeness. This method uses the technics of the frame of subordination.

This paper sets out a new way of combining Kripke-complete modal logics: lexicographic product. It discusses some basic properties of the lexicographic product construction and proves axiomatization/completeness results.

ABSTRACT We consider the question of the complete axiomatization of a relative modal logic with composition and intersection.

In this paper, we study indiscernibility relations and complementarity relations in hyper arrow structures. A first-order characterization of indiscernibility and complementarity is obtained through a duality result between hyper arrow structures and certain structures of relational type characterized by first-order conditions. A modal analysis of indiscernibility and complementarity is performed through a modal logic which modalities correspond to indiscernibility relations and complementarity relations in hyper arrow structures.