Related papers: Tense logic based on finite orthomodular posets
The paper proposes and studies temporal logics for attributed words, that is, data words with a (finite) set of (attribute,value)-pairs at each position. It considers a basic logic which is a semantical fragment of the logic…
A sound and complete embedding of conditional logics into classical higher-order logic is presented. This embedding enables the application of off-the-shelf higher-order automated theorem provers and model finders for reasoning within and…
We study what we call topological cylindric algebras and tense cylindric algebras defined for every ordinal $\alpha$. The former are cylindric algebras of dimension $\alpha$ expanded with $\sf S4$ modalities indexed by $\alpha$. The…
Two recent arguments for linear dynamics in quantum theory are critically re-examined. Neither argument is found to be satisfactory as it stands, although an improved version of one of the arguments can in fact be given. This improved…
Machine teaching is an algorithmic framework for teaching a target hypothesis via a sequence of examples or demonstrations. We investigate machine teaching for temporal logic formulas -- a novel and expressive hypothesis class amenable to…
In probabilistic transition systems, behavioural metrics provide a more fine-grained and stable measure of system equivalence than crisp notions of bisimilarity. They correlate strongly to quantitative probabilistic logics, and in fact the…
In this paper we extensively investigate the class of conditionally positive definite operators, namely operators generating conditionally positive definite sequences. This class itself contains subnormal operators, $2$- and $3$-isometries…
Classical evaluations of configurations of intertwined quantum contexts induce relations, such as true-implies-false, true-implies-true, but also nonseparability among the input and output terminals. When combined, these exploitable…
Pomset logic introduced by Retor\'e is an extension of linear logic with a self-dual noncommutative connective. The logic is defined by means of proof-nets, rather than a sequent calculus. Later a deep inference system BV was developed with…
We design temporal description logics suitable for reasoning about temporal conceptual data models and investigate their computational complexity. Our formalisms are based on DL-Lite logics with three types of concept inclusions (ranging…
Two important classes of quantum structures, namely orthomodular posets and orthomodular lattices, can be characterized in a classical context, using notions like partial information and points of view. Using the formalism of representation…
Monadic second order logic and linear temporal logic are two logical formalisms that can be used to describe classes of infinite words, i.e., first-order models based on the natural numbers with order, successor, and finitely many unary…
An important characteristic of many logics for Artificial Intelligence is their nonmonotonicity. This means that adding a formula to the premises can invalidate some of the consequences. There may, however, exist formulae that can always be…
Operational frameworks are very useful to study the foundations of quantum mechanics, and are sometimes used to promote antirealist attitudes towards the theory. The aim of this paper is to review three arguments aiming at defending an…
Temporal logics stands for a widely adopted family of formalisms for the verification of computational devices, enriching propositional logics by operators predicating on the step-wise behaviour of a system. Its quantified extensions allow…
We propose a timed and soft extension of Concurrent Constraint Programming. The time extension is based on the hypothesis of bounded asynchrony: the computation takes a bounded period of time and is measured by a discrete global clock.…
We study bipartite unitary operators which stay invariant under the local actions of diagonal unitary and orthogonal groups. We investigate structural properties of these operators, arguing that the diagonal symmetry makes them suitable for…
In contrast to the Copenhagen interpretation we consider quantum mechanics as universally valid and query whether classical physics is really intuitive and plausible. - We discuss these problems within the quantum logic approach to quantum…
We study orthogonally additive operators between Riesz spaces without the Dedekind completeness assumption on the range space. Our first result gives necessary and sufficient conditions on a pair of Riesz spaces $(E,F)$ for which every…
A probabilistic propositional logic, endowed with an epistemic component for asserting (non-)compatibility of diagonizable and bounded observables, is presented and illustrated for reasoning about the random results of projective…