English
Related papers

Related papers: Computability Superselection Rule and its physical…

200 papers

The paper was withdrawn due to another possible solution to the dataset that is significantly different in nature. This issue will be addressed shortly and clarified with an additional data point.

Astrophysics · Physics 2008-11-26 J. S. Jenkins , H. R. A. Jones , J. R. Barnes , M. I. Jones , P. Rojo , S. Hoyer , A. C. Day-Jones

This paper has been withdrawn because the content has been substantially improved in a later paper, arXiv:0806.1165.

General Physics · Physics 2008-06-11 David J. BenDaniel

Mass-superselection rule (MSR) states that in the non-relativistic quantum theory superpositions of states with different masses are unphysical. While MSR features even in textbooks, its validity, physical content and consequences remain…

Quantum Physics · Physics 2019-06-11 Magdalena Zych , Daniel M. Greenberger

In this short note we report on results on a computational search for a counterexample to the strong coincidence conjecture. In particular, we discuss the method used so that further searches can be conducted.

Dynamical Systems · Mathematics 2017-06-19 Scott Balchin

Whenever P is a proper definable forcing for adding a real, the countable support iteration of P has all the preservation properties it can possibly have, within a wide syntactically identified class of properties.

Logic · Mathematics 2007-05-23 Jindrich Zapletal

This paper introduces a new simplified version of the countable branching recurrence of Computability Logic, proves its equivalence to the old one, and shows that the basic logic induced by it is a proper superset of the basic logic induced…

Logic in Computer Science · Computer Science 2011-07-20 Wenyan Xu , Sanyang Liu

This note provides a summary of the meaning of the term `Superselection Rule' in Quantum Mechanics and Quantum-Field Theory. It is a slightly extended version of a contribution to the Compendium of Quantum Physics: Concepts, Experiments,…

Quantum Physics · Physics 2009-05-13 Domenico Giulini

Reproducibility is an important feature of science; experiments are retested, and analyses are repeated. Trust in the findings increases when consistent results are achieved. Despite the importance of reproducibility, significant work is…

Digital Libraries · Computer Science 2023-01-12 Akhil Pandey Akella , Hamed Alhoori , David Koop

The paper was withdrawn because of its significant overlap with a paper appeared recently.

Combinatorics · Mathematics 2008-06-30 Marilena Barnabei , Flavio Bonetti , Matteo Silimbani

For $\lambda$ inaccessible, we may consider $(< \lambda)$-support iteration of some specific $(<\lambda)$-complete $\lambda^+$-c.c. forcing notion. But this fails a "preservation by restricting to a sub-sequence of the forcing, we "correct"…

Logic · Mathematics 2022-09-07 Saharon Shelah

This paper has been withdrawn due to some errors in the reported discussion, and needs a thorough revision

Superconductivity · Physics 2007-08-15 S. K. Bose

Reproducibility is a confused terminology. In this paper, I take a fundamental view on reproducibility rooted in the scientific method. The scientific method is analysed and characterised in order to develop the terminology required to…

Machine Learning · Computer Science 2022-01-19 Odd Erik Gundersen

Computer science is also an experimental science. This is particularly the case for parallel computing, which is in a total state of flux, and where experiments are necessary to substantiate, complement, and challenge theoretical modeling…

Distributed, Parallel, and Cluster Computing · Computer Science 2013-08-19 Sascha Hunold , Jesper Larsson Träff

This paper has been withdrawn due to the adherance to the double submission policies of a refereed journal. Our apologies.

This article reformulates the theory of computable physical models, previously introduced by the author, as a branch of applied model theory in first-order logic. It provides a semantic approach to the philosophy of science that…

Logic · Mathematics 2023-10-03 Matthew P. Szudzik

This submission is being withdrawn due to serious errors in the achievability proofs. The reviewers of the journal I had submitted to had found errors back in 2006. I had forgotten about this paper until I saw the CFP for a JSAC issue on…

Information Theory · Computer Science 2011-09-02 Saravanan Vijayakumaran

Two typos in the published paper are pointed out. Both are just typos and the calculations in that paper are based on the correct formulism.

Condensed Matter · Physics 2007-05-23 M. W. Wu

In this article, the decidability and computability issues of dynamic probability logic (DPL) are addressed. Firstly, a proof system $\mathcal{H}_{DPL}$ is introduced for DPL and shown that it is weakly complete. Furthermore, this logic has…

Logic in Computer Science · Computer Science 2024-06-25 Somayeh Chopoghloo , Mahdi Heidarpoor , Massoud Pourmahdian

I survey recent progress on a classic and challenging problem in social choice: the fair division of indivisible items. I discuss how a computational perspective has provided interesting insights into and understanding of how to divide…

Artificial Intelligence · Computer Science 2020-05-12 Toby Walsh

We reconstruct finite-dimensional quantum theory with superselection rules, which can describe hybrid quantum-classical systems, from four purely operational postulates: symmetric sharpness, complete mixing, filtering, and local equality.…

Quantum Physics · Physics 2026-05-26 Kenji Nakahira