English
Related papers

Related papers: A characterization of Continuous Logic by using qu…

200 papers

Dependence logic provides an elegant approach for introducing dependencies between variables into the object language of first-order logic. In [1] generalized quantifiers were introduced in this context. However, a satisfactory account was…

Logic · Mathematics 2024-04-29 Fredrik Engström

The aim of this note is to recast somewhat informal axiom system of quantum mechanics used by physicists (Dirac calculus) in the language of Continuous Logic. We note an analogy between Tarski's notion of cylindric algebras, as a tool of…

Logic · Mathematics 2025-12-23 Boris Zilber

In this paper, we present a generalized effective completeness theorem for continuous logic. The primary result is that any continuous theory is satisfied in a structure which admits a presentation of the same Turing degree. It then follows…

Logic · Mathematics 2022-02-24 Caleb Camrud

We extend the main result of (G. Badia and G. Olkhovikov. A Lindstr\"om theorem for intuitionistic propositional logic. Notre Dame Journal of Formal Logic, 61 (1): 11--30 (2020)) to the first-order intuitionistic logic (with and without…

Logic · Mathematics 2021-04-01 Grigory Olkhovikov , Guillermo Badia , Reihane Zoghifard

We consider logics derived from Euclidean spaces $\mathbb{R}^n$. Each Euclidean space carries relations consisting of those pairs that are, respectively, distance more than 1 apart, distance less than 1 apart, and distance 1 apart. Each…

For probability measures on a complete separable metric space, we present sufficient conditions for the existence of a solution to the Kantorovich transportation problem. We also obtain sufficient conditions (which sometimes also become…

Probability · Mathematics 2007-06-13 S. Ekisheva , C. Houdré

General relativity required the abandonment of Euclidean geometry. Here we show that quantum theory requires the abandonment of classical logic. We show that the Hilbert space representation of quantum theory is logically inevitable. There…

Quantum Physics · Physics 2021-11-23 Lars M. Johansen

Curved Boolean Logic (CBL) generalizes propositional logic by allowing local truth assignments that do not extend to a single global valuation, analogous to curvature in geometry. We give equivalent sheaf and exclusivity-graph semantics and…

Logic in Computer Science · Computer Science 2025-10-14 Maximilian R. P. von Liechtenstein

We take quantum theory and replace $\mathbb{C}$ by $\mathbb{C}[\varepsilon]$ where $\varepsilon^2=0$, i.e. we extend quantum theory to the ring of dual complex numbers. The aim is to develop a common language in which to treat continuous…

Quantum Physics · Physics 2026-03-19 P. Arrighi , D. Bakircioglu , N. L. Houyet

Lawvere showed that generalised metric spaces are categories enriched over $[0, \infty]$, the quantale of the positive extended reals. The statement of enrichment is a quantitative analogue of being a preorder. Towards seeking a logic for…

Logic in Computer Science · Computer Science 2024-02-14 Giorgio Bacci , Radu Mardare , Prakash Panangaden , Gordon Plotkin

Input/Output (I/O) logic is a general framework for reasoning about conditional norms and/or causal relations. We streamline Bochman's causal I/O logics via proof-search-oriented sequent calculi. Our calculi establish a natural syntactic…

Logic in Computer Science · Computer Science 2023-06-19 Agata Ciabattoni , Dmitry Rozplokhas

The Cahill-Glauber approach for quantum mechanics on phase-space is extended to the finite dimensional case through the use of discrete coherent states. All properties and features of the continuous formalism are appropriately generalized.…

Quantum Physics · Physics 2007-05-23 M. Ruzzi , M. A. Marchiolli , D. Galetti

We extend Painlev\'e's determinateness theorem from the theory of ordinary differential equations in the complex domain allowing more general 'multiple-valued' Cauchy's problems. We study $C^0-$continuability (near singularities) of…

Complex Variables · Mathematics 2007-05-23 Claudio Meneghini

The framework of quantitative equational logic has been successfully applied to reason about algebras whose carriers are metric spaces and operations are nonexpansive. We extend this framework in two orthogonal directions: algebras endowed…

Logic in Computer Science · Computer Science 2022-01-25 Matteo Mio , Ralph Sarkis , Valeria Vignudelli

Based on ideas of quantum theory of open systems we propose the consistent approach to the formulation of logic of plausible propositions. To this end we associate with every plausible proposition diagonal matrix of its likelihood and…

Quantum Physics · Physics 2015-06-05 E. D. Vol

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

Propositional inquisitive logic is the limit of its $n$-bounded approximations. In the predicate setting, however, this does not hold anymore, as discovered by Ciardelli and Grilletti, who also found complete axiomatizations of $n$-bounded…

Logic in Computer Science · Computer Science 2025-07-21 Tadeusz Litak , Katsuhiko Sano

Recently, a self-contained trajectory-based formulation of non-relativistic quantum mechanics was developed [Ann. Phys. 315, 505 (2005); Chem. Phys. 370, 4 (2010); J. Chem. Phys. 136, 031102 (2012)], that makes no use of wavefunctions or…

Quantum Physics · Physics 2012-08-31 Bill Poirier

An upper bound for the Kantorovich transport distance between probability measures on multidimensional Euclidean spaces is given in terms of transport distances between one dimensional projections. This quantifies the Cram\'er-Wold…

Probability · Mathematics 2026-01-14 Sergey G. Bobkov , Friedrich Götze

We present a bisequent calculus (BSC) for the minimal theory of definite descriptions (DD) in the setting of neutral free logic, where formulae with non-denoting terms have no truth value. The treatment of quantifiers, atomic formulae and…

Logic in Computer Science · Computer Science 2024-12-03 Andrzej Indrzejczak , Yaroslav Petrukhin
‹ Prev 1 2 3 10 Next ›