中文
相关论文

相关论文: On Cantor's Theorem

200 篇论文

Prediction is the making of statements, usually probabilistic, about future events based on current information. Retrodiction is the making of statements about past events based on current information. We present the foundations of quantum…

量子物理 · 物理学 2021-03-29 Stephen M. Barnett , John Jeffers , David T. Pegg

We present a surprisingly new connection between two well-studied combinatorial classes: rooted connected chord diagrams on one hand, and rooted bridgeless combinatorial maps on the other hand. We describe a bijection between these two…

组合数学 · 数学 2017-10-18 Julien Courtiel , Karen Yeats , Noam Zeilberger

We introduce the notion of a critical cardinal as the critical point of sufficiently strong elementary embedding between transitive sets. Assuming the axiom of choice this is equivalent to measurability, but it is well-known that choice is…

逻辑 · 数学 2020-05-07 Yair Hayut , Asaf Karagila

What makes sets, or more precisely, the category {\bf Set} important in Mathematics are the well known {\it two} specific ways in which arbitrary mappings $f : X \longrightarrow Y$ between any two sets $X, Y$ can {\it fail} to be…

综合数学 · 数学 2010-04-12 Elemer E Rosinger

A proof of G\"odel's incompleteness theorem is given. With this new proof a transfinite extension of G\"odel's theorem is considered. It is shown that if one assumes the set theory ZFC on the meta level as well as on the object level, a…

逻辑 · 数学 2009-05-25 Hitoshi Kitada

Doubts are raised concerning the usual interpretation of the alleged failure, by quantum mechanics, of the distributive law of classical logic. The difficulty raised by incompatible sets of observables is overcome within an epistemic…

量子物理 · 物理学 2015-04-27 Alfredo B. Henriques , Amílcar Sernadas

For a cardinal lambda<lambda_{omega_1} we give a ccc forcing notion P which forces that for some Borel subset B of the Cantor space (1) there a sequence (eta_alpha:alpha<lambda) of distinct elements such that |(eta_alpha+B) cap…

逻辑 · 数学 2018-06-19 Andrzej Roslanowski , Saharon Shelah

In this paper, we argue that while the concept of a set-theoretic paradox (or paradoxical set) can be relatively well-defined within a formal setting, the concept of a set-theoretic hypodox (or hypodoxical set) remains significantly less…

逻辑 · 数学 2025-01-31 Timotej Šujan

Pattern avoidance classes of permutations that cannot be expressed as unions of proper subclasses can be described as the set of subpermutations of a single bijection. In the case that this bijection is a permutation of the natural numbers…

组合数学 · 数学 2007-05-23 M. D. Atkinson , M. M. Murphy , N. Ruskuc

This paper exposes a contradiction in the Zermelo-Fraenkel set theory with the axiom of choice (ZFC). While Godel's incompleteness theorems state that a consistent system cannot prove its consistency, they do not eliminate proofs using a…

计算机科学中的逻辑 · 计算机科学 2017-01-03 Minseong Kim

The Schr\"oder-Bernstein theorem states that, for any two sets P and Q, if there exists an injection from P to Q and an injection from Q to P, then there must exist a bijection between the two sets. Classically, it follows that the ordering…

计算机科学中的逻辑 · 计算机科学 2025-07-28 Grant Jurgensen

We obtain a criterion for an analytic subset of a Euclidean space to contain points of differentiability of a typical Lipschitz function, namely, that it cannot be covered by countably many sets, each of which is closed and purely…

泛函分析 · 数学 2020-11-11 Michael Dymond , Olga Maleva

Transfinite set theory including the axiom of choice supplies the following basic theorems: (1) Mappings between infinite sets can always be completed, such that at least one of the sets is exhausted. (2) The real numbers can be well…

综合数学 · 数学 2007-05-23 W. Mueckenheim

We argue that Godel's completeness theorem is equivalent to completability of consistent theories, and Godel's incompleteness theorem is equivalent to the fact that this completion is not constructive, in the sense that there are some…

逻辑 · 数学 2019-07-02 Saeed Salehi

We consider Proof Complexity in light of the unusual binary encoding of certain combinatorial principles. We contrast this Proof Complexity with the normal unary encoding in several refutation systems, based on Resolution and Integer Linear…

计算机科学中的逻辑 · 计算机科学 2022-04-06 Stefan Dantchev , Nicola Galesi , Abdul Ghani , Barnaby Martin

In this note, we present a conjecture on intersections of set families, and a rephrasing of the conjecture in terms of principal downsets of Boolean lattices. The conjecture informally states that, whenever we can express the measure of a…

组合数学 · 数学 2024-01-30 Antoine Amarilli , Mikaël Monet , Dan Suciu

Let $\mathcal{C}\subseteq[0,1]$ be a Cantor set. In the classical $\mathcal{C}\pm\mathcal{C}$ problems, modifying the ``size'' of $\mathcal{C}$ has a magnified effect on $\mathcal{C}\pm\mathcal{C}$. However, any gain in $\mathcal{C}$…

经典分析与常微分方程 · 数学 2026-03-23 Piotr Nowakowski , Cheng-Han Pan

Set-theoretical, physical, and intuitive notions of continuum are compared. It is shown that the independence of the continuum hypothesis determines status and properties of the set of intermediate cardinality. The intermediate set is a…

量子物理 · 物理学 2007-05-23 O. Yaremchuk

While it is widely agreed that Bell's theorem is an important result in the foundations of quantum physics, there is much disagreement about what exactly Bell's theorem shows. It is agreed that Bell derived a contradiction with experimental…

量子物理 · 物理学 2016-06-07 Roderich Tumulka

If a mathematical theory contains incompatible postulates then it is likely that the theory will produce theorems or results that are contradictory. It will be shown that this is the case with Dirac field theory. An example of such a…

量子物理 · 物理学 2007-05-23 Dan Solomon