Related papers: Tense logic based on finite orthomodular posets

We suggest solving the measurement problem by postulating the existence of a special future final boundary condition for the universe. Although this is an extension of the way boundary conditions are usually chosen (in terrestrial…

We study operator algebras arising from monomial ideals in the ring of polynomials in noncommuting variables, through the apparatus of subproduct systems and C*-correspondences. We provide a full comparison amongst the related operator…

We show that descriptive complexity's result extends in High Order Logic to capture the expressivity of Turing Machine which have a finite number of alternation and whose time or space is bounded by a finite tower of exponential. Hence we…

In the absence of a satisfactory interpretation of quantum theory, physical law lacks physical basis. This paper reviews the orthodox, or Dirac-von Neumann interpretation, and makes explicit that Hilbert space describes propositions about…

In this paper we study the set of tensors that admit a special type of decomposition called an orthogonal tensor train decomposition. Finding equations defining varieties of low-rank tensors is generally a hard problem, however, the set of…

The time-convolutionless quantum master equation is an exact description of the nonequilibrium dynamics of open quantum systems, with the advantage of being local in time. We derive a perturbative expansion to arbitrary order in the…

Formal properties represent a cornerstone of the system-correctness proofs based on formal verification techniques such as model checking. Formalizing requirements into temporal properties may be very complex and error prone, due not only…

We obtain, for the first time, a modular many-valued semantics for combined logics, which is built directly from many-valued semantics for the logics being combined, by means of suitable universal operations over partial non-deterministic…

We involve a certain propositional logic based on ortholattices. We characterize the implicational reduct of such a logic and we show that its algebraic counterpart is the so-called orthosemilattice. Properties of congruences and congruence…

We discuss the introduction of boundary Hilbert spaces for a class of physical systems for which it is not possible to factor their state spaces as tensor products of Hilbert spaces naturally associated to their boundaries and bulks…

We give a linear nested sequent calculus for the basic normal tense logic Kt. We show that the calculus enables backwards proof-search, counter-model construction and syntactic cut-elimination. Linear nested sequents thus provide the…

Numerous logics have been developed to reason either about threshold-induced opinion diffusion in a network, or about similarity-driven network structure evolution, or about both. In this paper, we first introduce a logic containing…

Unconditionally stable implicit time-marching methods are powerful in solving stiff differential equations efficiently. In this work, a novel framework to handle stiff physical terms implicitly is proposed. Both physical and numerical…

It is shown that quantum logic is a logic in the very same way in which classical logic is a logic. Soundness and completeness of both quantum and classical logics have been proved for novel lattice models that are not orthomodular and…

In this note we collect several observations on state extensions. They may be instrumental to anyone who pursues the theory of quantum logics. In particular, we find out when extensions (resp. signed extensions) exist in the "concrete"…

We provide a synopsis of an effective approach to the problem of time in the semiclassical regime. The essential features of this new approach to evaluating relational quantum dynamics in constrained systems are illustrated by means of a…

Choice constructs are an important part of the language of logic programming, yet the study of their semantics has been a challenging task. So far, only two-valued semantics have been studied, and the different proposals for such semantics…

Logical formalisms provide a natural and concise means for specifying and reasoning about preferences. In this paper, we propose lexicographic logic, an extension of classical propositional logic that can express a variety of preferences,…

A temporal logic is presented for reasoning about the correctness of timed concurrent constraint programs. The logic is based on modalities which allow one to specify what a process produces as a reaction to what its environment inputs.…

We consider a simple modal logic whose non-modal part has conjunction and disjunction as connectives and whose modalities come in adjoint pairs, but are not in general closure operators. Despite absence of negation and implication, and of…