arXiv 0801.43642008-01-28math.LO

Scott's problem for proper Scott sets

Victoria Gitman

英文摘要：

I show that assuming PFA, every proper Scott set is the standard system of a model of PA. A Scott set X is proper if it is arithmetically closed and the quotient Boolean algebra X/Fin is a proper partial order.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

Representing Scott sets in algebraic settings

We prove that for every Scott set $S$ there are $S$-saturated real closed fields and models of Presburger arithmetic.

2014-07-21math.LO

Turing Incomparability in Scott Sets

For every Scott set F and every nonrecursive set X in F, there is a Y in F such that X and Y are Turing incomparable.

2006-08-13math.LO

A Hofmann-Mislove Theorem for Scott open sets

We consider the intersection map on the family of non-empty $ω$-Scott-open sets of the lattice of opens of a topological space. We prove that in a certain class of topological spaces the intersection map forms a continuous retraction onto the space of countably compact subsets of the space equipped with (the sequentialisation of) the upper Vietoris topology. This class consists of all sequential spaces which are sequentially Hausdorff.

2015-01-26math.LO

Weakly 2-randoms and 1-generics in Scott sets

Let $S$ be a Scott set, or even an $ω$-model of $\mathsf{WWKL}$. Then for each $A\in S$, either there is $X \in S$ that is weakly 2-random relative to $A$, or there is $X\in S$ that is 1-generic relative to $A$. It follows that if $A_1,\dots, A_n \in S$ are non-computable, there is $X \in S$ such that each $A_i$ is Turing incomparable with $X$, answering a question of Kučera and Slaman. More generally, any $\forall\exists$ sentence in the language of partial orders that holds in $\mathcal D$ also holds in $\mathcal D_S$, where $\mathcal D_S$ is the partial order of Turing degrees of elements o…

2017-11-01math.LO

结构复杂度与计算复杂度

Structural vs. computational complexity

Hofstra University（霍夫斯特拉大学）；Technische Universität Wien（维也纳工业大学）；Victoria University of Wellington（惠灵顿维多利亚大学）

研究可计算结构理论中Scott秩的高度概念，将其刻画为计算特定Δ^0_β集的能力，并讨论给定Scott秩结构的指标集。

2026-06-16math.LO

Wadge Hardness in Scott Spaces and Its Effectivization

We prove some results on the Wadge order on the space of sets of natural numbers endowed with Scott topology, and more generally, on omega-continuous domains. Using alternating decreasing chains we characterize the property of Wadge hardness for the classes of the Hausdorff difference hierarchy (iterated differences of open sets). A similar characterization holds for Wadge one-to-one and finite-to-one completeness. We consider the same questions for the effectivization of the Wadge relation. We also show that for the space of sets of natural numbers endowed with the Scott topology, in each cla…

2013-11-02cs.LOmath.LO

更多相关论文收起更多论文

A note on standard systems and ultrafilters

Let $(M,\scott X) \models \ACA$ be such that $P_\scott X$, the collection of all unbounded sets in $\scott X$, admits a definable complete ultrafilter and let $T$ be a theory extending first order arithmetic coded in $\scott X$ such that $M$ thinks $T$ is consistent. We prove that there is an end-extension $N \models T$ of $M$ such that the subsets of $M$ coded in $N$ are precisely those in $\scott X$. As a special case we get that any Scott set with a definable ultrafilter coding a consistent theory $T$ extending first order arithmetic is the standard system of a recursively saturated model o…

2008-04-25math.LO

On Non-standard Models of Arithmetic with Uncountable Standard Systems

In 1960s, Dana Scott gave a recursion theoretic characterization of standard systems of countable non-standard models of arithmetic, i.e., collections of sets of standard natural numbers coded in non-standard models. Later, Knight and Nadel proved that Scott's characterization also applies to non-standard models of arithmetic with cardinality $\aleph_1$. But the question, whether the limit on cardinality can be removed from the above characterization, remains a long standing question, known as the Scott Set Problem. This article presents two constructions of non-standard models of arithmetic w…

2020-07-12math.LO

Scott Ranks of Classifications of the Admissibility Equivalence Relation

Let $\mathscr{L}$ be a recursive language. Let $S(\mathscr{L})$ be the set of $\mathscr{L}$-structures with domain $ω$. Let $Φ: {}^ω2 \rightarrow S(\mathscr{L})$ be a $Δ_1^1$ function with the property that for all $x,y \in {}^ω2$, $ω_1^x = ω_1^y$ if and only if $Φ(x) \approx_{\mathscr{L}} Φ(y)$. Then there is some $x \in {}^ω2$ so that $\mathrm{SR}(Φ(x)) = ω_1^x + 1$.

2017-12-03math.LO

域、信息框架、粗糙集：范畴的等价性

Domains, Information Frames, Rough Sets: An Equivalence of Categories

本文通过相对化Scott信息系统中的一致性谓词，提出信息框架以精确刻画连续域，并证明信息框架范畴与域范畴等价，同时细化了Wu和Xu关于CF-近似空间范畴的等价性结果。

2025-05-27cs.LOmath.LO

Level Theory, parts 1-3

This document comprises Level Theory, parts 1-3. PART 1. The following bare-bones story introduces the idea of a cumulative hierarchy of pure sets: 'Sets are arranged in stages. Every set is found at some stage. At any stage S: for any sets found before S, we find a set whose members are exactly those sets. We find nothing else at S.' Surprisingly, this story already guarantees that the sets are arranged in well-ordered levels, and suffices for quasi-categoricity. I show this by presenting Level Theory, a simplifiation of set theories due to Scott, Montague, Derrick, and Potter. PART 2. Potent…

2021-12-01math.LO