English
Related papers

Related papers: Weakly complete axiomatization of exogenous quantu…

200 papers

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

Quantum Hoare logic (QHL) is a formal verification tool specifically designed to ensure the correctness of quantum programs. There has been an ongoing challenge to achieve a relatively complete satisfaction-based QHL with while-loop since…

Logic in Computer Science · Computer Science 2024-05-06 Xin Sun , Xingchi Su , Xiaoning Bian , Huiwen Wu

This paper considers the complexity and properties of KLM-style preferential reasoning in the setting of propositional logic with team semantics and dependence atoms, also known as propositional dependence logic. Preferential team-based…

Artificial Intelligence · Computer Science 2025-05-14 Kai Sauerwald , Arne Meier , Juha Kontinen

This paper concerns a goal directed proof procedure for the propositional fragment of the adaptive logic ACLuN1. At the propositional level, it forms an algorithm for final derivability. If extended to the predicative level, it provides a…

Logic in Computer Science · Computer Science 2007-05-23 Diderik Batens

We study Polynomial Lawvere logic PL, a logic defined over the Lawvere quantale of extended positive reals with sum as tensor, to which we add multiplication, thereby obtaining a semiring structure. PL is designed for complex quantitative…

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

In a recent letter (Phys. Lett. A 377 (2013) 1076, arXiv:0905.3801), the authors presented an impossibility proof of quantum bit commitment, which attempted to cover all possible protocols that involve both quantum and classical…

Quantum Physics · Physics 2013-06-25 Guang Ping He

In this paper, we prove existence of \emph{very weak solutions} to nonhomogeneous quasilinear parabolic equations beyond the duality pairing. The main ingredients are a priori esitmates in suitable weighted spaces combined with the…

Analysis of PDEs · Mathematics 2019-01-16 Karthik Adimurthi , Sun-Sig Byun , Wontae Kim

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

The exponential modalities of linear logic have been used by various authors to model infinite-dimensional quantum systems. This paper explains how these modalities can also give rise to the complementarity principle of quantum mechanics.…

Category Theory · Mathematics 2022-11-04 Robin Cockett , Priyaa Varshinee Srinivasan

In this paper, we design and analysis a modified weak Galerkin (MWG) finite element method for $\boldsymbol{H}(\mathrm{curl})-$elliptic problem. We first introduce a new discrete weak curl operator and the MWG finite element space. The…

Numerical Analysis · Mathematics 2022-03-25 Ming Tang , Liuqiang Zhong , Yingying Xie

The term proposition usually denotes in quantum mechanics (QM) an element of (standard) quantum logic (QL). Within the orthodox interpretation of QM the propositions of QL cannot be associated with sentences of a language stating properties…

Quantum Physics · Physics 2007-05-23 Claudio Garola , Sandro Sozzo

We applied the method of finite-part integration [Galapon E.A Proc.R.Soc A 473, 20160567(2017)] to evaluate in closed-form the exact one-loop integral representations of the Heisenberg-Euler Lagrangian from QED for a constant magnetic field…

Mathematical Physics · Physics 2024-02-20 Christian D. Tica , Eric A. Galapon

We prove that the problem of determining whether a finite logical matrix determines an algebraizable logic is complete for EXPTIME. The same result holds for the classes of order algebraizable, weakly algebraizable, equivalential and…

Logic · Mathematics 2019-08-05 T. Moraschini

I show that the application of the quantum-mechanical (QM) which-way weak measurement scheme of Vaidman may lead to logical inconsistencies. To this end, I study weak values of projection operators. Weak values are (normalized) amplitudes,…

Quantum Physics · Physics 2018-04-16 B. E. Y. Svensson

We introduce propositional team-based logics expressively complete for (quasi) downward and (quasi) upward closed properties in a syntactically dual way, by using variants of the inclusion atom. In particular, the variants of the primitive…

Logic · Mathematics 2026-03-06 Matilda Häggblom

We present a way to apply quantum logic to the study of quantum programs. This is made possible by using an extension of the usual propositional language in order to make transformations performed on the system appear explicitly. This way,…

Quantum Physics · Physics 2007-05-23 Olivier Brunet , Philippe Jorrand

Weak-value amplification employs postselection to enhance the measurement of small parameters of interest. The amplification comes at the expense of reduced success probability, hindering the utility of this technique as a tool for…

Quantum Physics · Physics 2020-12-29 Muthumanimaran Vetrivelan , Sai Vinjanampathy

This paper presents a recent formalization of a Henkin-style completeness proof for the propositional modal logic S5 using the Lean theorem prover. The proof formalized is close to that of Hughes and Cresswell, but the system, based on a…

Logic in Computer Science · Computer Science 2021-10-26 Bruno Bentzen

The quantum electrodynamic formalism is presented for the systematic and exact in $Z\,\alpha$ derivation of nuclear recoil corrections in hydrogenic systems.

Atomic Physics · Physics 2024-08-30 Krzysztof Pachucki , Vladimir A. Yerokhin

Extensional higher-order logic programming has been introduced as a generalization of classical logic programming. An important characteristic of this paradigm is that it preserves all the well-known properties of traditional logic…

Programming Languages · Computer Science 2020-02-19 Angelos Charalambidis , Zoltán Ésik , Panos Rondogiannis
‹ Prev 1 3 4 5 6 7 10 Next ›