English
Related papers

Related papers: Pseudo PCF

200 papers

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

We deal with relatives of GCH which are provable. In particular we deal with rank version of the revised GCH. Our motivation was to find such results when only weak versions of the axiom of choice are assumed but some of the results gives…

Logic · Mathematics 2010-03-03 Saharon Shelah

Some new semantic and syntactic characterizations of the members of the power pseudovariety $\mathbf{PCS}$ are obtained. This leads in particular to new algorithms for deciding membership in $\mathbf{PCS}$.

Group Theory · Mathematics 2012-09-05 K. Auinger

The concept of presence has been extensively explored in philosophy, yet the notion of particle presence within quantum theory remains under-examined. In this article, we explore particle presence through an analysis of a paradox arising…

History and Philosophy of Physics · Physics 2025-03-26 Bethany Terris

We develop a formal theory of the weak values with emphasis on the consistency conditions and a probabilistic interpretation in the counter-factual processes. We present the condition for the choice of the post-selected state to give a…

Quantum Physics · Physics 2010-08-19 Akio Hosoya , Yutaka Shikano

This paper explores the well known approximation approach to decide weak bisimilarity of Basic Parallel Processes. We look into how different refinement functions can be used to prove weak bisimilarity decidable for certain subclasses. We…

Formal Languages and Automata Theory · Computer Science 2012-08-15 Piotr Hofman , Patrick Totzke

This work provides some general theorems about unconditional and conditional weak convergence of empirical processes in the case of Poisson sampling designs. The theorems presented in this work are stronger than previously published…

Statistics Theory · Mathematics 2019-06-12 Leo Pasquazzi

We limit ourselves basically to the SU(2) flavor sector of the CKM matrix, as probed in processes like nuclear $\beta$-decay, normal and radiative muon capture and neutrino reactions. Current interests in this primarily stem from our…

Nuclear Theory · Physics 2007-05-23 Nimai C. Mukhopadhyay

We discuss the (twisted) weak positivity theorem. We also treat some applications.

Algebraic Geometry · Mathematics 2015-07-03 Osamu Fujino

This article establishes a new and comprehensive estimation and inference theory for principal component analysis (PCA) under the weak factor model that allow for cross-sectional dependent idiosyncratic components under the nearly minimal…

Methodology · Statistics 2024-10-02 Jianqing Fan , Yuling Yan , Yuheng Zheng

We characterize the situation of small cardinality for a product of cardinals divided by an ultrafilter. We develop the notion of weak normality. We include an application to Boolean Algebras.

Logic · Mathematics 2018-04-24 Shimon Garti , Saharon Shelah

Pseudopotential theory has greatly driven first-principles calculations in materials, replacing the explicit treatment of the chemically inert core electrons with an effective potential acting only on the valence states. This is inherently…

Materials Science · Physics 2026-05-07 Matteo Quinzi , Tommaso Chiarotti , Nicola Marzari

We introduce a new higher categorical structure called a weakly globular n-fold category. This structure is based on iterated internal categories and on the notion of weak globularity. We identify a suitable class of pseudo-functors whose…

Category Theory · Mathematics 2016-05-24 Simona Paoli

We extend the idea of weak measurements to the general case, provide a complete treatment and obtain results for both the regime when the pre-selected and post-selected states (PPS) are almost orthogonal and the regime when they are exactly…

Quantum Physics · Physics 2015-03-17 Shengjun Wu , Yang Li

A PCP is a proof system for NP in which the proof can be checked by a probabilistic verifier. The verifier is only allowed to read a very small portion of the proof, and in return is allowed to err with some bounded probability. The…

Computational Complexity · Computer Science 2014-03-19 Irit Dinur , Or Meir

We deal with values taken by various pseudopower functions at a singular cardinal that is not a fixed point of the aleph function.

Logic · Mathematics 2024-01-17 Pierre Matet

The meaning and its possible applications of post-selected weak amplification in optomechanical system is concisely reviewed.

Quantum Physics · Physics 2015-09-04 Tao Wang , Gang Li

We give a reduction from {\sc clique} to establish that sparse PCA is NP-hard. The reduction has a gap which we use to exclude an FPTAS for sparse PCA (unless P=NP). Under weaker complexity assumptions, we also exclude polynomial…

Machine Learning · Computer Science 2015-02-23 Malik Magdon-Ismail

We prove a compactness theorem for pseudopower operations of the form $pp_{\Gamma(\mu,\sigma)}(\mu)$ where $\aleph_0<\sigma=cf(\sigma)\leq cf(\mu)$. Our main tool is a result that has Shelah's cov vs. pp Theorem as a consequence. We also…

Logic · Mathematics 2019-06-25 Todd Eisworth

Conventional quantum mechanics describes a pre- and post-selected system in terms of virtual (Feynman) paths via which the final state can be reached. In the absence of probabilities, a weak measurement (WM) determines the probability…

Quantum Physics · Physics 2016-04-20 D. Sokolovski
‹ Prev 1 2 3 10 Next ›