Related papers: Modal definability in Euclidean modal logics
We axiomatize the provability logic of $\HA$ and prove its decidability. Furthermore, we axiomatize the preservativity and relative admissibility relations for several modal logics extending iK4. A principal technical tool is the…
Characteristic formulae give a complete logical description of the behaviour of processes modulo some chosen notion of behavioural semantics. They allow one to reduce equivalence or preorder checking to model checking, and are exactly the…
We introduce a framework for reasoning about the security of computer systems using modal logic. This framework is sufficiently expressive to capture a variety of known security properties, while also being intuitive and independent of…
Characteristic formulae give a complete logical description of the behaviour of processes modulo some chosen notion of behavioural semantics. They allow one to reduce equivalence or preorder checking to model checking, and are exactly the…
It is well-known that the basic modal logic of all topological spaces is $S4$. However, the structure of basic modal and hybrid logics of classes of spaces satisfying various separation axioms was until present unclear. We prove that modal…
In temporal logics, a central question is about the choice of modalities and their relative expressive power, in comparison to the complexity of decision problems such as satisfiability. In this tutorial, we will illustrate the study of…
The logic programming paradigm provides the basis for a new intensional view of higher-order notions. This view is realized primarily by employing the terms of a typed lambda calculus as representational devices and by using a richer form…
If ${\cal D}$ is a definable category then it may contain no nonzero finitely presented modules but, by a result of Makkai, there is a $\varinjlim$-generating set of strictly ${\cal D}$-atomic modules. These modules share some key…
Inspired by Quantum Mechanics, we reformulate Hilbert's tenth problem in the domain of integer arithmetics into problems involving either a set of infinitely-coupled non-linear differential equations or a class of linear Schr\"odinger…
We resolve an open problem concerning finite logical implication for path functional dependencies (PFDs).
In this paper we consider, from a computational point of view, the problem of classifying logics within the Leibniz and Frege hierarchies typical of abstract algebraic logic. The main result states that, for logics presented syntactically,…
We study the relative succinctness and expressiveness of modal logics, and prove that these relationships can be as complex as any countable partial order. For this, we use two uniform formalisms to define modal operators, and obtain…
The importance of transformations and normal forms in logic programming, and generally in computer science, is well documented. This paper investigates transformations and normal forms in the context of Defeasible Logic, a simple but…
We develop an algebraic notion of recognizability for languages of words indexed by countable linear orderings. We prove that this notion is effectively equivalent to definability in monadic second-order (MSO) logic. We also provide three…
A computable ring is a ring equipped with mechanical procedure to add and multiply elements. In most natural computable integral domains, there is a computational procedure to determine if a given element is prime/irreducible. However,…
We prove strong completeness results for some modal logics with the universal modality, with respect to their topological semantics over 0-dimensional dense-in-themselves metric spaces. We also use failure of compactness to show that, for…
We prove undecidability for every positive relevant logic extending the system axiomatized by hypothetical syllogism, prefixing, and suffixing and contained in the logic of the semilattice frame $(P_{\mathrm{fin}}(\mathbb{N}), \cup,…
We analyse so-called computable laws, i.e., laws that can be enforced by automatic procedures. These laws should be logically perfect and unambiguous, but sometimes they are not. We use a regulation on road transport to illustrate this…
We consider the decidability of the verification problem of programs \emph{modulo axioms} --- that is, verifying whether programs satisfy their assertions, when the functions and relations it uses are assumed to interpreted by arbitrary…
We prove several representation theorems for infinitary predicate modal logic