English
Related papers

Related papers: A van Benthem Theorem for Atomic and Molecular Log…

200 papers

We define a variant of team semantics called multiteam semantics based on multisets and study the properties of various logics in this framework. In particular, we define natural probabilistic versions of inclusion and independence atoms…

Logic in Computer Science · Computer Science 2015-12-22 Arnaud Durand , Miika Hannula , Juha Kontinen , Arne Meier , Jonni Virtema

We present a modal logic based approach to the so-called endophysical quantum universe. In particular, we treat the problem of preferred bases and that of state reduction by employing an eclectic collection of methods including Baltag's…

Quantum Physics · Physics 2007-05-23 A. M. Lisewski

This paper provides theorems aimed at shedding light on issues in the foundations of quantum mechanics. These theorems can be used to propose new interpretations to the theory, or to better understand, evaluate and improve current…

Quantum Physics · Physics 2022-02-04 Roberto H. Schonmann

This paper presents a substructural logic of sequents with very restricted exchange and weakening rules. It is sound with respect to sequences of measurements of a quantic system. A sound and complete semantics is provided. The semantic…

Quantum Physics · Physics 2023-07-19 Daniel Lehmann

In this article we present a possible way to make usual quantum mechanics fully compatible with physical realism, defined as the statement that the goal of physics is to study entities of the natural world, existing independently from any…

Quantum Physics · Physics 2022-01-04 Alexia Auffèves , Philippe Grangier

We prove expressive completeness results for convex propositional and modal team logics, where a logic is convex if, for each formula, if it is true in two teams $t$ and $u$ and $t\subseteq s\subseteq u$, then it is also true in $s$. We…

Logic · Mathematics 2025-03-31 Aleksi Anttila , Søren Brinck Knudstorp

In this paper, we study an extension of the stable model semantics for disjunctive logic programs where each true atom in a model is associated with an algebraic expression (in terms of rule labels) that represents its justifications. As in…

Logic in Computer Science · Computer Science 2016-10-12 Pedro Cabalar , Jorge Fandinno

We use sets of assignments, a.k.a. teams, and measures on them to define probabilities of first-order formulas in given data. We then axiomatise first-order properties of such probabilities and prove a completeness theorem for our…

Logic · Mathematics 2016-09-09 Tapani Hyttinen , Gianluca Paolini , Jouko Väänänen

We look at non-classical negations and their corresponding adjustment connectives from a modal viewpoint, over complete distributive lattices, and apply a very general mechanism in order to offer adequate analytic proof systems to logics…

Logic in Computer Science · Computer Science 2016-06-24 Ori Lahav , João Marcos , Yoni Zohar

We deduce Levinson\'{}s theorem in non-relativistic quantum mechanics in one dimension as a sum rule for the spectral density constructed from asymptotic data. We assume a self-adjoint hamiltonian which guarantees completeness; the…

Quantum Physics · Physics 2007-05-23 L. J. Boya , J. Casahorran

The stochastic theory of relativistic quantum mechanics presented here is modelled on the one that has been proposed previously and that was claimed to be a promising substitute to the orthodox theory in the non-relativistic domain. So it…

Quantum Physics · Physics 2020-06-09 Maurice Godart

We prove a general criterion for a von Neumann algebra $M$ in order to be in standard form. It is formulated in terms of an everywhere defined, invertible, antilinear, a priori not necessarily bounded operator, intertwining $M$ with its…

Operator Algebras · Mathematics 2015-05-20 Francesco Fidaleo , László Zsidó

We study single- and two-atom van der Waals interactions of ground-state atoms which are both polarizable and paramagnetizable in the presence of magneto-electric bodies within the framework of macroscopic quantum electrodynamics. Starting…

Quantum Physics · Physics 2010-01-04 Hassan Safari , Dirk-Gunnar Welsch , Stefan Yoshi Buhmann , Stefan Scheel

The paper is a contribution both to the theoretical foundations and to the actual construction of efficient automatizable proof procedures for non-classical logics. We focus here on the case of finite-valued logics, and exhibit: (i) a…

Logic in Computer Science · Computer Science 2014-08-19 Carlos Caleiro , João Marcos , Marco Volpe

Graded modal types systems and coeffects are becoming a standard formalism to deal with context-dependent computations where code usage plays a central role. The theory of program equivalence for modal and coeffectful languages, however, is…

Logic in Computer Science · Computer Science 2021-03-08 Ugo Dal Lago , Francesco Gavazzo

We expose the information flow capabilities of pure bipartite entanglement as a theorem -- which embodies the exact statement on the `seemingly acausal flow of information' in protocols such as teleportation. We use this theorem to…

Quantum Physics · Physics 2007-05-23 Bob Coecke

Open bisimilarity is defined for open process terms in which free variables may appear. The insight is, in order to characterise open bisimilarity, we move to the setting of intuitionistic modal logics. The intuitionistic modal logic…

Logic in Computer Science · Computer Science 2023-06-22 Ki Yung Ahn , Ross Horne , Alwen Tiu

The conventional postulate for the probabilistic interpretation of quantum mechanics is asymmetric in preparation and measurement, making retrodiction reliant on inference by use of Bayes' theorem. Here, a more fundamental symmetric…

Quantum Physics · Physics 2009-11-07 David T. Pegg , Stephen M. Barnett , John Jeffers

We study bisimulations for useful description logics. The simplest among the considered logics is $\mathcal{ALC}_{reg}$ (a variant of PDL). The others extend that logic with inverse roles, nominals, quantified number restrictions, the…

Logic in Computer Science · Computer Science 2015-02-20 Ali Rezaei Divroodi , Linh Anh Nguyen

In order to reason about effects, we can define quantitative formulas to describe behavioural aspects of effectful programs. These formulas can for example express probabilities that (or sets of correct starting states for which) a program…

Logic in Computer Science · Computer Science 2019-04-29 Niels Voorneveld
‹ Prev 1 4 5 6 7 8 10 Next ›