中文
相关论文

相关论文: A large Pi-1-2 set absolute for set forcing

200 篇论文

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

We derive properties of $\pi(x)$ reminiscent of those of the logarithm and absolute value functions. Two of these properties are similar to the relations defining the linearity of a function. Several applications of these properties of…

数论 · 数学 2011-08-16 Boris B. Benyaminov

A space has $\sigma$-compact tightness if the closures of $\sigma$-compact subsets determines the topology. We consider a dense set variant that we call densely k-separable. We consider the question of whether every densely k-separable…

一般拓扑 · 数学 2018-10-12 Alan Dow , Istvan Juhasz

We construct a variety of inner models exhibiting features usually obtained by forcing over universes with large cardinals. For example, if there is a supercompact cardinal, then there is an inner model with a Laver indestructible…

逻辑 · 数学 2011-11-04 Arthur Apter , Victoria Gitman , Joel David Hamkins

We systematically investigate the complexity of model checking the existential positive fragment of first-order logic. In particular, for a set of existential positive sentences, we consider model checking where the sentence is restricted…

计算机科学中的逻辑 · 计算机科学 2015-03-20 Hubie Chen

B. D. Acharya has conjectured that if $\bigl(A_i: i=1, 2, ..., 2^{|X|}-1\bigr)$ is a permutation of all nonempty subsets of a set $X$ with at least two elements such that for each even positive integer $j<2^{|X|}-1$, $A_{j-1}\triangle…

组合数学 · 数学 2008-04-05 A. R. Mehta , G. R. Vijayakumar

A relational structure ${\mathbb X}$ is said to be reversible iff every bijective endomorphism $f:X\rightarrow X$ is an automorphism. We define a sequence of non-zero cardinals $\langle \kappa_i :i\in I\rangle$ to be reversible iff each…

逻辑 · 数学 2017-09-28 Miloš S. Kurilić , Nenad Morača

The main goal of this paper is to develop a concept of approximate differentiability of higher order for subsets of the Euclidean space that allows to characterize higher order rectifiable sets, extending somehow well known facts for…

经典分析与常微分方程 · 数学 2020-07-20 Mario Santilli

Let $\mathbf{M}$ be the basic set theory that consists of the axioms of extensionality, emptyset, pair, union, powerset, infinity, transitive containment, $\Delta_0$-separation and set foundation. This paper studies the relative strength of…

逻辑 · 数学 2019-01-11 Zachiri McKenzie

For which choices of $X,Y,Z\in\{\Sigma^1_1,\Pi^1_1\}$ does no sufficiently strong $X$-sound and $Y$-definable extension theory prove its own $Z$-soundness? We give a complete answer, thereby delimiting the generalizations of G\"odel's…

逻辑 · 数学 2026-01-28 Henry Towsner , James Walsh

We define, in a purely algebraic way, 1-motives $Alb^{+}(X)$, $Alb^{-}(X)$, $Pic^{+}(X)$ and $Pic^{-}(X)$ associated with any algebraic scheme $X$ over an algebraically closed field of characteristic zero. For $X$ over $\C$ of dimension $n$…

代数几何 · 数学 2007-05-23 L. Barbieri Viale , V. Srinivas

We consider two basic problems of algebraic topology, the extension problem and the computation of higher homotopy groups, from the point of view of computability and computational complexity. The extension problem is the following: Given…

计算几何 · 计算机科学 2013-02-12 Martin Cadek , Marek Krcal , Jiri Matousek , Lukas Vokrinek , Uli Wagner

For some fixed alphabet A, a language L of A* is in the class L(1/2) of the Straubing-Therien hierarchy if and only if it can be expressed as a finite union of languages A*aA*bA*...A*cA*, where a,b,...,c are letters. The class L(1) is…

计算复杂性 · 计算机科学 2016-01-18 Heinz Schmitz , Klaus W. Wagner

Recently it has been proved that, assuming that there is an almost disjoint family of cardinality (2^{\mathfrak c}) in (\mathfrak c) (which is assured, for instance, by either Martin's Axiom, or CH, or even $2^{<\mathfrak c=\mathfrak c$})…

泛函分析 · 数学 2012-07-13 Jose Luis Gamez-Merino , Juan B. Seoane-Sepulveda

What sets A \subset Z^n can be written in the form (K-K) \cap Z^n, where K is a compact subset of R^n such that K+Z^n=R^n? Such sets A are called achievable, and it is known that if A is achievable, then < A >=Z^n. This condition completely…

数论 · 数学 2011-03-08 Krishanu Sankar

We investigate the set of Pi-1-2 sentences which are Pi-1-1 conservative over the theories of reverse mathematics RCA0+ISigma_n and ACA0. We exhibit new elements of these sets and conclude that the sets are Pi_2 complete. Along the way, we…

逻辑 · 数学 2013-08-26 Henry Towsner

We introduce a forcing that adds a $\square(\aleph_2,\aleph_0)$-sequence with countable conditions under CH. Assuming the consistency of a weakly compact cardinal, we can find a forcing extension by our new poset in which both…

逻辑 · 数学 2026-03-17 Maxwell Levine

On every set A there is a rigid binary relation i.e. such a relation R \subseteq A \times A that there is no homomorphism (A,R) \rightarrow (A,R) except the identity (Vop{\v{e}}nka et al. [1965]). We prove that for each infinite cardinal…

逻辑 · 数学 2007-05-23 Apoloniusz Tyszka

Generalizing the notion of a tight almost disjoint family, we introduce the notions of a {\em tight eventually different} family of functions in Baire space and a {\em tight eventually different set of permutations} of $\omega$. Such sets…

逻辑 · 数学 2024-05-22 Vera Fischer , Corey Bacal Switzer

We define a weak iterability notion that is sufficient for a number of arguments concerning $\Sigma_1$-definability at uncountable regular cardinals. In particular we give its exact consistency strength firstly in terms of the second…

逻辑 · 数学 2019-01-18 P. D. Welch