Related papers: Characterizing Relative Frame Definability in Team…
This article develops a novel framework for modal logic based on the idea of stratified actualization, rather than the classical model of global possible worlds. Traditional Kripke semantics treat modal operators as quantification over…
We present a unitary approach to the construction of representations and intertwining operators. We apply it to the $C^*$-algebras, groups, Gabor type unitary systems and wavelets. We give an application of our method to the theory of…
We introduce a systematic mathematical language for describing fixed point models and apply it to the study to topological phases of matter. The framework is reminiscent of state-sum models and lattice topological quantum field theories,…
We consider quantified pretransitive Horn modal logic. It is known that such logics are complete with respect to predicate Kripke frames with expanding domains. In this paper we prove that they are also complete with respect to…
We study probabilistic team semantics which is a semantical framework allowing the study of logical and probabilistic dependencies simultaneously. We examine and classify the expressive power of logical formalisms arising by different…
In this paper we enrich the orthomodular structure by adding a modal operator, following a physical motivation. A logical system is developed, obtaining algebraic completeness and completeness with respect to a Kripke-style semantic founded…
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…
Machine Learning (ML) provides important techniques for classification and predictions. Most of these are black-box models for users and do not provide decision-makers with an explanation. For the sake of transparency or more validity of…
A theorem of L\"utkebohmert states that a rigid group homomorphism from the formal multiplicative group to a smooth commutative rigid group $G$, with relatively compact image, can be extended to a homomorphism from the rigid multiplicative…
A predicate linear temporal logic LTL_{\lambda,=} without quantifiers but with predicate abstraction mechanism and equality is considered. The models of LTL_{\lambda,=} can be naturally seen as the systems of pebbles (flexible constants)…
Structures based on polarities have been used to provide relational semantics for propositional logics that are modelled algebraically by non-distributive lattices with additional operators. This article develops a first order notion of…
It is well known that the propositional modal logic $\mathbf{GL}$ of provability satisfies the de Jongh-Sambin fixed-point property. On the other hand, Montagna showed that the predicate modal system $\mathbf{QGL}$, which is the natural…
We study an extension of $\mtl$ in pointwise time with rational expression guarded modality $\reg_I(\re)$ where $\re$ is a rational expression over subformulae. We study the decidability and expressiveness of this extension ($\mtl$+$\varphi…
A specification given as a formula in linear temporal logic (LTL) defines a system by its set of traces. However, certain features such as information flow security constraints are rather modeled as so-called hyperproperties, which are sets…
It is a long-standing open problem whether modal logics of the form $\mathbf{K} \oplus \Box^n p \to \Box^m p$ for $n>m>1$ have the finite model property (FMP). We solve this by showing that any modal logic axiomatized by formulas of the…
We study a new extension of the weak MSO logic, talking about boundedness. Instead of a previously considered quantifier U, expressing the fact that there exist arbitrarily large finite sets satisfying a given property, we consider a…
The literature on concurrency theory offers a wealth of examples of characteristic-formula constructions for various behavioural relations over finite labelled transition systems and Kripke structures that are defined in terms of fixed…
Inquisitive modal logic InqML is a generalisation of standard Kripke-style modal logic. In its epistemic incarnation, it extends standard epistemic logic to capture not just the information that agents have, but also the questions that they…
Representations are essential to mathematically model phenomena, but there are many options available. While each of those options provides useful properties with which to solve problems related to the phenomena in study, comparing results…
A definition of summability is put forward in the framework of general Carleman ultraholomorphic classes in sectors, so generalizing $k-$summability theory as developed by J.-P. Ramis. Departing from a strongly regular sequence of positive…