English
Related papers

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

200 papers

We reconstruct the transformations of quantum theory using a physically motivated postulate. This postulate states that transformations should be locally applicable, and recovers the linear isometries from pure quantum theory, as well as…

Quantum Physics · Physics 2026-03-17 Matt Wilson , Nick Ormrod

We define a family of intuitionistic non-normal modal logics; they can bee seen as intuitionistic counterparts of classical ones. We first consider monomodal logics, which contain only one between Necessity and Possibility. We then consider…

Logic in Computer Science · Computer Science 2019-01-30 Tiziano Dalmonte , Charles Grellois , Nicola Olivetti

We introduce a new variant of dependence logic called Boolean dependence logic. In Boolean dependence logic dependence atoms are of the type =(x_1,...,x_n,\alpha), where \alpha is a Boolean variable. Intuitively, with Boolean dependence…

Logic · Mathematics 2014-06-30 Johannes Ebbing , Lauri Hella , Peter Lohmann , Jonni Virtema

Neighbourhood structures are the standard semantic tool used to reason about non-normal modal logics. The logic of all neighbourhood models is called classical modal logic. In coalgebraic terms, a neighbourhood frame is a coalgebra for the…

Logic in Computer Science · Computer Science 2015-07-01 Helle Hvid Hansen , Clemens Kupke , Eric Pacuit

We intend to investigate the metalogical property of 'omitting types' for a wide variety of quantifier logics (that can also be seen as multimodal logics upon identifying existential quantifiers with modalities syntactically and…

Logic · Mathematics 2019-12-30 Tarek Sayed Ahmed

We prove a compactness theorem in the context of Hennessy-Milner logic. It is used to derive a sufficient condition on modal characterizations for the Approximation Induction Principle to be sound modulo the corresponding process…

Logic in Computer Science · Computer Science 2009-11-12 Maciej Gazda , Wan Fokkink

In this paper we introduce Commutative/Non-Commutative Logic (CNC logic) and two categorical models for CNC logic. This work abstracts Benton's Linear/Non-Linear Logic by removing the existence of the exchange structural rule. One should…

Logic in Computer Science · Computer Science 2019-04-16 Jiaming Jiang , Harley Eades , Valeria de Paiva

We present a heuristic derivation of Born's rule and unitary transforms in Quantum Mechanics, from a simple set of axioms built upon a physical phenomenology of quantization. This approach naturally leads to the usual quantum formalism,…

Quantum Physics · Physics 2022-01-04 Alexia Auffeves , Philippe Grangier

The logical consistency of a description of Quantum Theory in the context of General Relativity, which includes Minimal Coupling Principle, is analyzed from the point of view of Feynman's formulation in terms of path integrals. We will…

General Relativity and Quantum Cosmology · Physics 2011-09-16 Abel Camacho Quintana

Recently, Baltag and van Benthem introduced a decidable logic of functional dependence (LFD) that extends the logic of Cylindrical Relativized Set Algebras (CRS) with atomic local dependence statements. Its semantics can be given in terms…

Logic in Computer Science · Computer Science 2021-09-20 Raoul Koudijs

We study hidden-variable models from quantum mechanics, and their abstractions in purely probabilistic and relational frameworks, by means of logics of dependence and independence, based on team semantics. We show that common desirable…

Logic in Computer Science · Computer Science 2022-01-28 Rafael Albert , Erich Grädel

Intuitionistic logic extended with decidable propositional atoms combines classical properties in its propositional part and intuitionistic properties for derivable formulas not containing propositional symbols. Sequent calculus is used as…

General Mathematics · Mathematics 2007-05-23 Alexander Sakharov

Coinductive reasoning about infinitary structures such as streams is widely applicable. However, practical frameworks for developing coinductive proofs and finding reasoning principles that help structure such proofs remain a challenge,…

Programming Languages · Computer Science 2020-01-13 Yannick Zakowski , Paul He , Chung-Kil Hur , Steve Zdancewic

We consider a proper propositional quantum logic and show that it has multiple disjoint lattice models, only one of which is an orthomodular lattice (algebra) underlying Hilbert (quantum) space. We give an equivalent proof for the classical…

Quantum Physics · Physics 2016-09-19 Mladen Pavicic

The finite-basis, pair formulation of the Spectral Theory of chemical bonding is briefly surveyed. Solutions of the Born-Oppenheimer polyatomic Hamiltonian totally antisymmetric in electron exchange are obtained from diagonalization of an…

Chemical Physics · Physics 2023-02-07 Jeffrey D. Mills

Kernel theorems, in general, provide a convenient representation of bounded linear operators. For the operator acting on a concrete function space, this means that its action on any element of the space can be expressed as a generalised…

Functional Analysis · Mathematics 2024-05-22 Dimitri Bytchenkoff , Michael Speckbacher , Peter Balazs

It is argued that quantum mechanics follows naturally from the assumptions that there are no fundamental causal laws but only probabilities for physical processes that are constrained by symmetries, and reality is relational in the sense…

Quantum Physics · Physics 2014-11-18 Jeeva Anandan

Our understanding about things is conceptual. By stating that we reason about objects, it is in fact not the objects but concepts referring to them that we manipulate. Now, so long just as we acknowledge infinitely extending notions such as…

Artificial Intelligence · Computer Science 2015-04-21 Ryuta Arisaka

Larsen and Skou characterized probabilistic bisimilarity over reactive probabilistic systems with a logic including true, negation, conjunction, and a diamond modality decorated with a probabilistic lower bound. Later on, Desharnais,…

Logic in Computer Science · Computer Science 2016-10-25 Marco Bernardo , Marino Miculan

In this paper a conditional logic is defined and studied. This conditional logic, DmBL, is constructed as close as possible to the Bayesian and is unrestricted, that is one is able to use any operator without restriction. A notion of…

Logic · Mathematics 2016-09-07 Frederic Dambreville