English
Related papers

Related papers: Non-Commutation Chains in Pre- and Post-Selection …

200 papers

Causal structures give us a way to understand the origin of observed correlations. These were developed for classical scenarios, but quantum mechanical experiments necessitate their generalisation. Here we study causal structures in a broad…

Quantum Physics · Physics 2021-06-30 Mirjam Weilenmann , Roger Colbeck

We mainly investigate model of set theory with restricted choice, e.g., ZF + DC + "the family of countable subsets of lambda is well ordered for every lambda" (really local version for a given lambda). In this frame much of pcf theory can…

Logic · Mathematics 2019-01-29 Saharon Shelah

Before we apply nonlinear techniques, for example those inspired by chaos theory, to dynamical phenomena occurring in nature, it is necessary to first ask if the use of such advanced techniques is justified "by the data". While many…

chao-dyn · Physics 2009-10-31 Thomas Schreiber , Andreas Schmitz

We introduce an algorithm that conjectures the structure of a permutation class in the form of a disjoint cover of "rules"; similar to generalized grid classes. The cover is usually easily verified by a human and translated into an…

Combinatorics · Mathematics 2017-05-12 Christian Bean , Bjarki Gudmundsson , Henning Ulfarsson

The paper studies a probabilistic notion of causes in Markov chains that relies on the counterfactuality principle and the probability-raising property. This notion is motivated by the use of causes for monitoring purposes where the aim is…

Logic in Computer Science · Computer Science 2021-07-09 Christel Baier , Florian Funke , Simon Jantsch , Jakob Piribauer , Robin Ziemek

Networks play a central role in modern data analysis, enabling us to reason about systems by studying the relationships between their parts. Most often in network analysis, the edges are given. However, in many systems it is difficult or…

Machine Learning · Statistics 2014-02-06 Scott W. Linderman , Ryan P. Adams

The concept of uncertainty quanta for a general system is introduced and applied to some important problems in physics and mathematics. EPR paradox gives new clue to the further understanding of particle correlation which turns out to be…

Quantum Physics · Physics 2007-05-23 Wang Zhen

When combining data sets to perform parameter inference, the results will be unreliable if there are unknown systematics in data or models. Here we introduce a flexible methodology, BACCUS: BAyesian Conservative Constraints and Unknown…

Cosmology and Nongalactic Astrophysics · Physics 2018-07-04 José Luis Bernal , John A. Peacock

We report an inconsistency found in probability theory (also referred to as measure-theoretic probability). For probability measures induced by real-valued random variables, we deduce an "equality" such that one side of the "equality" is a…

General Mathematics · Mathematics 2017-03-01 Guang-Liang Li , Victor O. K. Li

The Union Closed Sets Conjecture states that in every finite, nontrivial set family closed under taking unions there is an element contained in at least half of all the sets of the family. We investigate two new directions with respect to…

Combinatorics · Mathematics 2023-04-05 Nicolas Nagel

Chain conditions are one of the major tools used in the theory of forcing. We say that a partial order has the countable chain condition if every antichain (in the sense of forcing) is countable. Without the axiom of choice antichains tend…

Logic · Mathematics 2022-11-15 Asaf Karagila , Noah Schweber

It is well-known that Choice and Regularity are independent of each other but have important common consequences of logical character (reflection principles, representations of classes by sets, etc.). We explain this phenomenon by isolating…

Logic · Mathematics 2007-09-20 Denis I. Saveliev

Recent work on the logical structure of non-locality has constructed scenarios where observations of multi-partite systems cannot be adequately described by compositions of non-signaling subsystems. In this paper we apply these frameworks…

Computer Science and Game Theory · Computer Science 2015-12-10 William Zeng , Philipp Zahn

In this article, we present a leap-forward expansion to the study of explainability in neural networks by considering explanations as answers to abstract reasoning-based questions. With $P$ as the prediction from a neural network, these…

Machine Learning · Computer Science 2022-02-25 Ghassan AlRegib , Mohit Prabhushankar

Experimental evidene of the last decades has made the status of "collapses of the wave function" even more shaky than it already was on conceptual grounds: interference effects turn out to be detectable even when collapses are typically…

History and Philosophy of Physics · Physics 2019-01-08 Dennis Dieks

We upgrade [1] to a complete proof of the conjecture NP = PSPACE. [1]: L. Gordeev, E. H. Haeusler, Proof Compression and NP Versus PSPACE, Studia Logica (107) (1): 55-83 (2019)

Logic in Computer Science · Computer Science 2022-01-11 Lev Gordeev

Results of measurements give legitimacy to a physical theory. What if acquiring these results in the first place necessitates what the same theory considers to be an interaction? In this note, we assume that theories account for…

Quantum Physics · Physics 2019-05-01 Arne Hansen , Stefan Wolf

The occurrence of Simpson's paradox (SP) in $2\times 2$ contingency tables has been well studied. The present work comprehensively revisits this problem using a combination of philosophical reflections, causal considerations, and…

Statistics Theory · Mathematics 2021-09-23 Palash Sarkar , Prasanta S. Bandyopadhyay

In this paper we investigate the complexity of abduction, a fundamental and important form of non-monotonic reasoning. Given a knowledge base explaining the world's behavior it aims at finding an explanation for some observed manifestation.…

Computational Complexity · Computer Science 2010-06-28 Nadia Creignou , Johannes Schmidt , Michael Thomas

We consider natural cardinal invariants hm_n and prove several duality theorems, saying roughly: if I is a suitably definable ideal and provably cov(I)>=hm_n, then non(I) is provably small. The proofs integrate the determinacy theory,…

Logic · Mathematics 2007-05-23 Saharon Shelah , Jindrich Zapletal
‹ Prev 1 4 5 6 7 8 10 Next ›