Results 1 to 10 of about 1,929,870 (338)

New Directions in Descriptive Set Theory [PDF]

open access: yesBulletin of Symbolic Logic, 1999
§1. I will start with a quick definition of descriptive set theory: It is the study of the structure of definable sets and functions in separable completely metrizable spaces. Such spaces are usually calledPolish spaces. Typical examples are ℝn, ℂn, (separable) Hilbert space and more generally all separable Banach spaces, theCantor space2ℕ, theBaire ...
Kechris, Alexander S.
core   +8 more sources

ITERATED PRIORITY ARGUMENTS IN DESCRIPTIVE SET THEORY [PDF]

open access: yesThe Bulletin of Symbolic Logic, 2022
AbstractWe present the true stages machinery and illustrate its applications to descriptive set theory. We use this machinery to provide new proofs of the Hausdorff–Kuratowski and Wadge theorems on the structure of $\mathbf {\Delta }^0_\xi $ , Louveau and Saint Raymond’s separation theorem, and Louveau’s separation theorem.
ADAM DAY   +3 more
openaire   +4 more sources

Contributions to Descriptive Set Theory

open access: gold, 2016
Assume AD+V=L(R). In the first chapter, let W^1_1 denote the club measure on \omega_1. We analyze the embedding j_{W^1_1}\restr HOD from the point of view of inner model theory. We use our analysis to answer a question of Jackson-Ketchersid about codes for ordinals less than \omega_\omega.
Cody Dance
semanticscholar   +5 more sources

The descriptive set-theoretic complexity of the set of points of continuity of a multi-valued function (Extended Abstract) [PDF]

open access: yesElectronic Proceedings in Theoretical Computer Science, 2010
In this article we treat a notion of continuity for a multi-valued function F and we compute the descriptive set-theoretic complexity of the set of all x for which F is continuous at x.
Vassilios Gregoriades
doaj   +4 more sources

RANDOMNESS VIA INFINITE COMPUTATION AND EFFECTIVE DESCRIPTIVE SET THEORY [PDF]

open access: bronzeJournal of Symbolic Logic (JSL), 2018
We study randomness beyond ${\rm{\Pi }}_1^1$-randomness and its Martin-Löf type variant, which was introduced in [16] and further studied in [3]. Here we focus on a class strictly between ${\rm{\Pi }}_1^1$ and ${\rm{\Sigma }}_2^1$ that is given by the ...
Merlin Carl, Philipp Schlicht
openalex   +3 more sources

The descriptive set-theoretic complexity of the set of points of continuity of a multi-valued function [PDF]

open access: yesLogical Methods in Computer Science, 2011
In this article we treat a notion of continuity for a multi-valued function $F$ and we compute the descriptive set-theoretic complexity of the set of all $x$ for which $F$ is continuous at $x$.
Vassilios Gregoriades
doaj   +3 more sources

Chain conditions, elementary amenable groups, and descriptive set theory [PDF]

open access: yes, 2016
We first consider three well-known chain conditions in the space of marked groups: the minimal condition on centralizers, the maximal condition on subgroups, and the maximal condition on normal subgroups. For each condition, we produce a characterization
Wesolek, Phillip, Williams, Jay
core   +4 more sources

Hierarchies of effective descriptive set theory [PDF]

open access: bronzeTransactions of the American Mathematical Society, 1969
1. Introduction and summary. The theory of hierarchies deals with the classification of objects according to some measure of their complexity. Such classifications have been fruitful in several areas of mathematics: analysis (descriptive set theory), recursion theory, and the theory of models.
Peter G. Hinman
openalex   +3 more sources

Generalized Descriptive Set Theory and Classification Theory [PDF]

open access: greenMemoirs of the American Mathematical Society, 2012
Descriptive set theory is mainly concerned with studying subsets of the space of all countable binary sequences. In this paper we study the generalization where countable is replaced by uncountable. We explore properties of generalized Baire and Cantor spaces, equivalence relations and their Borel reducibility.
Sy‐David Friedman   +2 more
openalex   +5 more sources

Naive Descriptive Set Theory [PDF]

open access: green, 2021
The paper is a naive introduction to descriptive set theory. It is aimed mathematicians without a background in logic. The goal is to provide the basic facts used for applications of descriptive set theory to other areas of mathematics, particularly analysis and dynamical systems.
Matthew Foreman
openalex   +3 more sources

Home - About - Disclaimer - Privacy