Abstract
We present what is known about the reverse mathematical strength of weak theorems involving Borel sets.
BibTeX - Entry
@InProceedings{westrick:LIPIcs:2021:13438,
author = {Linda Westrick},
title = {{Borel Sets in Reverse Mathematics (Invited Talk)}},
booktitle = {29th EACSL Annual Conference on Computer Science Logic (CSL 2021)},
pages = {4:1--4:2},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-175-7},
ISSN = {1868-8969},
year = {2021},
volume = {183},
editor = {Christel Baier and Jean Goubault-Larrecq},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2021/13438},
URN = {urn:nbn:de:0030-drops-134387},
doi = {10.4230/LIPIcs.CSL.2021.4},
annote = {Keywords: Borel sets, reverse mathematics, measure, category}
}
Keywords: |
|
Borel sets, reverse mathematics, measure, category |
Collection: |
|
29th EACSL Annual Conference on Computer Science Logic (CSL 2021) |
Issue Date: |
|
2021 |
Date of publication: |
|
13.01.2021 |