$omega_{1}$ under $Pi_{1}$-Collection
英文摘要：
We describe a proof-theoretic bound on $Sigma_{2}$-definable countable ordinals in Kripke-Platek set theory with $Pi_{1}$-Collection and the existence of $omega_{1}$.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
相关论文
Reflection and Weakly Collectionwise Hausdorff Spaces
We show that square(theta) implies that there is a first countable <theta-collectionwise Hausdorff space that is not weakly theta-collectionwise Hausdorff. We also show that in the model obtained by Levy collapsing a weakly compact (supercompact) cardinal to omega_2, first countable aleph_1-collectionwise Hausdorff spaces are weakly aleph_2-collectionwise Hausdorff (weakly collectionwise Hausdorff). In the last section we show that assuming E^omega_theta, a certain theta-family of integer valued functions exists and that in the model obtained by Levy collapsing a supercompact cardinal to omega…
math.LO
SRT22 does not imply RT22 in omega-models
We complete a 40-year old program on the computability-theoretic analysis of Ramsey's theorem, starting with Jockusch in 1972, and improving a result of Chong, Slaman and Yang in 2014. Given a set $X$, let $[X]^n$ be the collection of all $n$-element subsets of $X$. Ramsey's theorem for $n$-tuples asserts the existence, for every finite coloring of $[ω]^n$, of an infinite set $X \subseteq ω$ such that $[X]^n$ is monochromatic. The meta-mathematical study of Ramsey has a rich history, with several long-standing open problems and seminal theorems, including Seetapun's theorem in 1995 and Liu's t…
math.LO
Closure Properties of Locally Finite Omega Languages
Locally finite omega languages were introduced by Ressayre in [Journal of Symbolic Logic, Volume 53, No. 4, p.1009-1026]. They generalize omega languages accepted by finite automata or defined by monadic second order sentences. We study here closure properties of the family LOC_omega of locally finite omega languages. In particular we show that the class LOC_omega is neither closed under intersection nor under complementation, giving an answer to a question of Ressayre.
cs.LOmath.LO
Lusin sequences under CH and under Martin's Axiom
Assuming the continuum hypothesis there is an inseparable sequence of length omega_1 that contains no Lusin subsequence, while if Martin's Axiom and the negation of CH is assumed then every inseparable sequence (of length omega_1) is a union of countably many Lusin subsequences.
math.LO
On strong measure zero subsets of {}^kappa 2 .
This paper answers three questions posed by the first author. In Theorem 2.6 we show that the family of strong measure zero subsets of {}^{omega_1}2 is 2^{aleph_1}-additive under GMA and CH. In Theorem 3.1 we prove that the generalized Borel conjecture is false in {}^{omega_1}2 assuming ZFC+CH. Next, in Theorem 4.2, we show that the family of subsets of {}^{omega_1}2 with the property of Baire is not closed under the Souslin operation.
math.LO
Optimal asymptotic bounds on the oracle use in computations from Chaitin's Omega
Chaitin's number Omega is the halting probability of a universal prefix-free machine, and although it depends on the underlying enumeration of prefix-free machines, it is always Turing-complete. It can be observed, in fact, that for every computably enumerable (c.e.) real, there exists a Turing functional via which Omega computes it, and such that the number of bits of omega that are needed for the computation of the first n bits of the given number (i.e. the use on argument n) is bounded above by a computable function h(n) = n+o(n). We characterise the asymptotic upper bounds on the use of Ch…
cs.CCcs.LOmath.LO
更多相关论文收起更多论文
Automorphisms and strongly invariant relations
We investigate characterizations of the Galois connection sInv-Aut between sets of finitary relations on a base set A and their automorphisms. In particular, for A=omega_1, we construct a countable set R of relations that is closed under all invariant operations on relations and under arbitray intersections, but is not closed under sInv(Aut(-)). Our structure (A,R) has an omega-categorical first order theory. A higher order definable well-order makes it rigid, but any reduct to a finite language is homogeneous.
math.LOmath.RA
