Related papers: Flat modal fixpoint logics with the converse modal…
A symmetric bilinear form on a certain subspace $\widehat{\mathbb T}^{\bf b}$ of a completion of the Fock space $\mathbb T^{{\bf b}}$ is defined. The canonical and dual canonical bases of $\widehat{\mathbb T}^{\bf b}$ are dual with respect…
We study the finitary version of the coalgebraic logic introduced by L. Moss. The syntax of this logic, which is introduced uniformly with respect to a coalgebraic type functor, required to preserve weak pullbacks, extends that of classical…
We develop a fixed-point extension of quantitative equational logic and give semantics in one-bounded complete quantitative algebras. Unlike previous related work about fixed-points in metric spaces, we are working with the notion of…
In this paper we study frame definability in finitely-valued modal logics and establish two main results via suitable translations: (1) in finitely-valued modal logics one cannot define more classes of frames than are already definable in…
Farkas' lemma is an ubiquitous tool in optimisation, as it provides necessary and sufficient conditions to have $b \in A(P)$, where $P$ is a closed convex cone, $A$ is a (continuous) linear mapping and $b$ is a fixed vector. The standard…
Tableaux-based decision procedures for satisfiability of modal and description logics behave quite well in practice, but it is sometimes hard to obtain exact worst-case complexity results using these approaches, especially for…
Following F. William Lawvere, we show that many self-referential paradoxes, incompleteness theorems and fixed point theorems fall out of the same simple scheme. We demonstrate these similarities by showing how this simple scheme encompasses…
In this article, we make a generalization of classical fixed point theorems by using the concept of half-continuity and then apply it to improve the nonuniqueness result for solutions to the vacuum Einstein conformal equations shown by the…
The Lefschetz fixed point theorem and its converse have many generalizations. One of these generalizations is to endomorphisms of a space relative to a fixed subspace. In this paper we define relative Lefschetz numbers and Reidemeister…
We study the completeness problem for propositionally quantified modal logics on quantifiable general frames, where the admissible sets are the propositions the quantifiers can range over and expressible sets of worlds are admissible, and…
Hybrid logic is a modal logic with additional operators specifying nominals and is highly expressive. For example, there is no formula corresponding to the irreflexivity of Kripke frames in basic modal logic, but there is in hybrid logic.…
This paper studies the complexity of classical modal logics and of their extension with fixed-point operators, using translations to transfer results across logics. In particular, we show several complexity results for multi-agent logics…
This paper presents a new framework for constructing congruence closure of a finite set of ground equations over uninterpreted symbols and interpreted symbols for the group axioms. In this framework, ground equations are flattened into…
Using the theory of coalgebra, we introduce a uniform framework for adding modalities to the language of propositional geometric logic. Models for this logic are based on coalgebras for an endofunctor on some full subcategory of the…
We establish Flat Torus Theorem type results for groups acting on small cancellation complexes satisfying C(6), C(4)-T(4) and C(3)-T(6) conditions. For C(3)-T(6) complexes the result closely parallels the CAT(0) setting. For C(6) complexes…
We bring forward a logical system of transition algebras that enhances many-sorted first-order logic using features from dynamic logics. The sentences we consider include compositions, unions, and transitive closures of transition…
We develop a general criterion for cut elimination in sequent calculi for propositional modal logics, which rests on absorption of cut, contraction, weakening and inversion by the purely modal part of the rule system. Our criterion applies…
The infinitary lambda calculi pioneered by Kennaway et al. extend the basic lambda calculus by metric completion to infinite terms and reductions. Depending on the chosen metric, the resulting infinitary calculi exhibit different notions of…
We see how nested sequents, a natural generalisation of hypersequents, allow us to develop a systematic proof theory for modal logics. As opposed to other prominent formalisms, such as the display calculus and labelled sequents, nested…
We revisit the issue of connections between two leading formalisms in nonmonotonic reasoning: autoepistemic logic and default logic. For each logic we develop a comprehensive semantic framework based on the notion of a belief pair. The set…