Graphs with ∏ 1 0 (K)Y-sections

Archive for Mathematical Logic 32 (4):259-273 (1993)
  Copy   BIBTEX

Abstract

We prove that a Borel subset of the product of two internal setsX andY all of whoseY-sections are ∏ 1 0 (K)(∑ 1 0 (K)) sets is the intersection (union) of a countable sequence of Borel graphs with internalY-sections. As a consequence we prove some standard results about the domains of graphs in the product of two topological spaces all of whose horizontal section are compact (open) sets. A version of classical Vitali-Lusin theorem for those types of graphs is given as well as a new proof (and an extension) of a classical result of Kunugui

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,757

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Every Borel function is monotone Borel.Boško Živaljević - 1991 - Annals of Pure and Applied Logic 54 (1):87-99.
Domatic partitions of computable graphs.Matthew Jura, Oscar Levin & Tyler Markkanen - 2014 - Archive for Mathematical Logic 53 (1-2):137-155.
Borel Line Graphs.James Anderson & Anton Bernshteyn - forthcoming - Journal of Symbolic Logic:1-22.
Index sets for some classes of structures.Ekaterina B. Fokina - 2009 - Annals of Pure and Applied Logic 157 (2-3):139-147.
Unprovability threshold for the planar graph minor theorem.Andrey Bovykin - 2010 - Annals of Pure and Applied Logic 162 (3):175-181.
Located sets and reverse mathematics.Mariagnese Giusto & Stephen Simpson - 2000 - Journal of Symbolic Logic 65 (3):1451-1480.
On some sets of dictionaries whose ω ‐powers have a given.Olivier Finkel - 2010 - Mathematical Logic Quarterly 56 (5):452-460.

Analytics

Added to PP
2013-11-23

Downloads
23 (#949,443)

6 months
9 (#509,115)

Historical graph of downloads
How can I increase my downloads?