English
Related papers

Related papers: Generalized quantifiers in Dependence Logic

200 papers

The main formal structures of Generalized Quantum Theory are summarized. Recent progress has sharpened some of the concepts, in particular the notion of an observable, the action of an observable on states (putting more emphasis on the role…

Quantum Physics · Physics 2015-03-25 Thomas Filk , Hartmann Römer

We introduce the notion of BMT independence, allowing us to take arbitrary mixtures of boolean, monotone, and tensor independence and generalizing the notion of BM independence of Wysoczanski. Pair-wise independence relations are encoded…

Operator Algebras · Mathematics 2025-07-30 Octavio Arizmendi , Saul Rogelio Mendoza , Josué Vazquez-Becerra

In [14] we introduced a new class of algebras, which we named \textit{quantum generalized Heisenberg algebras} and which depend on a parameter $q$ and two polynomials $f,g$. We have shown that this class includes all generalized Heisenberg…

Rings and Algebras · Mathematics 2020-09-14 Samuel A. Lopes , Farrokh Razavinia

In a recent work, arXiv:2503.05884, we proposed a unified notion of nonclassicality that applies to arbitrary processes in quantum theory, including individual quantum states, measurements, channels, set of these, etc. This notion is…

Quantum Physics · Physics 2025-04-07 Yujie Zhang , Yìlè Yīng , David Schmid

The Dirac method of canonical quantization of theories with second class constraints has to be modified if the constraints depend on time explicitly. A solution of the problem was given by Gitman and Tyutin. In the present work we propose…

High Energy Physics - Theory · Physics 2008-11-26 S. A. Gadjiev , R. G. Jafarov

We introduce the concepts of dependence and independence in a very general framework. We use a concept of rank to study dependence and independence. By means of the rank we identify (total) dependence with inability to create more…

Logic in Computer Science · Computer Science 2021-09-27 Pietro Galliani , Jouko Väänänen

We propose a semantic foundation for logics for reasoning in settings that possess a distinction between equality of variables, a coarser equivalence of variables, and a notion of conditional independence between variables. We show that…

Logic in Computer Science · Computer Science 2026-05-18 Alex Simpson

Considerable attention has been given to the problem of non-monotonic reasoning in a belief function framework. Earlier work (M. Ginsberg) proposed solutions introducing meta-rules which recognized conditional independencies in a…

Artificial Intelligence · Computer Science 2013-04-05 Mary McLeish

A positive, diffeomorphism-invariant generalized measure on the space of metrics of a two-dimensional smooth manifold is constructed. We use the term generalized measure analogously with the generalized measures of Ashtekar and Lewandowski…

General Relativity and Quantum Cosmology · Physics 2009-10-28 Stephen Sawin

Unlike classical and free independence, the boolean and monotone notions of independence lack of the property of independent constants. In the scalar case, this leads to restrictions for the central limit theorems, as observed by F.…

Probability · Mathematics 2021-09-14 Carlos Dias-Aguilera , Tulio Gaxiola , Jorge Santos , Carlos Vargas

We introduce a family of modal expansions of {\L}ukasiewicz logic that are designed to accommodate modal translations of generalized basic logic (as formulated with exchange, weakening, and falsum). We further exhibit algebraic semantics…

Logic · Mathematics 2021-06-11 Wesley Fussner , William Zuluaga Botero

We generalize Goodstein's theorem (Goodstein 1944) and Cichon's independence proof (Cichon 1983) to $\Pi^1_1-\mathrm{CA}_0$ using results from (Wilken 2026). The method is generalizable to stronger notation systems that provide unique terms…

Logic · Mathematics 2026-05-06 Gunnar Wilken

The formalism of generalized Wigner transformations developped in a previous paper, is applied to kinetic equations of the Lindblad type for quantum harmonic oscillator models. It is first applied to an oscillator coupled to an equilibrium…

Quantum Physics · Physics 2007-05-23 C. Tzanakis , A. P. Grecos , P. Hatjimanolaki

We consider a first-order logic for the integers with addition. This logic extends classical first-order logic by modulo-counting, threshold-counting and exact-counting quantifiers, all applied to tuples of variables (here, residues are…

Logic in Computer Science · Computer Science 2024-02-14 Peter Habermehl , Dietrich Kuske

In 1995 Doebner and Mann introduced an approach to the ray representations of the Galilei group in ($1+1$)-dimensions, giving rise to quantum generators with an explicit dependence on time. Recently (2004) Wawrzycki proposed a…

Mathematical Physics · Physics 2014-11-25 Gianluigi Filippelli

In this paper, we investigate the parameterized complexity of model checking for Dependence Logic which is a well studied logic in the area of Team Semantics. We start with a list of nine immediate parameterizations for this problem,…

Logic in Computer Science · Computer Science 2021-09-21 Juha Kontinen , Arne Meier , Yasir Mahmood

The integration of lexical semantics and pragmatics in the analysis of the meaning of natural lan- guage has prompted changes to the global framework derived from Montague. In those works, the original lexicon, in which words were assigned…

Computation and Language · Computer Science 2013-09-05 Bruno Mery , Christian Retoré

The quantum-mechanical framework in which observables are associated with Hermitian operators is too narrow to discuss measurements of such important physical quantities as elapsed time or harmonic-oscillator phase. We introduce a broader…

Quantum Physics · Physics 2009-10-28 Samuel L. Braunstein , Carlton M. Caves , G. J. Milburn

The distinctive features of quantum mechanics, which set it apart from other physical theories, challenge our notions of realism. Recovering realism from purely philosophical grounds, a quantitative and operational criterion was proposed in…

Quantum Physics · Physics 2024-04-15 D. M. Fucci , R. M. Angelo

Dependency quantified Boolean formulas (DQBFs) are a powerful formalism, which subsumes quantified Boolean formulas (QBFs) and allows an explicit specification of dependencies of existential variables on universal variables. Driven by the…

Logic in Computer Science · Computer Science 2021-02-04 Aile Ge-Ernst , Christoph Scholl , Juraj Síč , Ralf Wimmer
‹ Prev 1 4 5 6 7 8 10 Next ›