- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
Ω-powers and descriptive set theory
Journal of Symbolic Logic 70 (4):1210-1232 (2005)
Abstract
We study the sets of the infinite sentences constructible with a dictionary over a finite alphabet, from the viewpoint of descriptive set theory. Among others, this gives some true co-analytic sets. The case where the dictionary is finite is studied and gives a natural example of a set at level ω of the Wadge hierarchy.Other Versions
No versions found
Links
PhilArchive
External links
(no proxy)
Setup an account with your affiliations in order to access resources via your University's proxy server
Through your library
- Sign in / register and customize your OpenURL resolver
- Configure custom resolver
My notes
Similar books and articles
On some sets of dictionaries whose ω ‐powers have a given.Olivier Finkel - 2010 - Mathematical Logic Quarterly 56 (5):452-460.
Topological complexity of locally finite ω-languages.Olivier Finkel - 2008 - Archive for Mathematical Logic 47 (6):625-651.
Wadge hierarchy and veblen hierarchy part I: Borel sets of finite rank.J. Duparc - 2001 - Journal of Symbolic Logic 66 (1):56-86.
Classical and effective descriptive complexities of ω -powers.Olivier Finkel & Dominique Lecomte - 2009 - Annals of Pure and Applied Logic 160 (2):163-191.
Two consistency results on set mappings.Peter Komjath & Saharon Shelah - 2000 - Journal of Symbolic Logic 65 (1):333-338.
Locally finite ω‐languages and effective analytic sets have the same topological complexity.Olivier Finkel - 2016 - Mathematical Logic Quarterly 62 (4-5):303-318.
A co-analytic maximal set of orthogonal measures.Vera Fischer & Asger Törnquist - 2010 - Journal of Symbolic Logic 75 (4):1403-1414.
Combinatorial properties of filters and open covers for sets of real numbers.Claude Laflamme & Marion Scheepers - 1999 - Journal of Symbolic Logic 64 (3):1243-1260.
Notions of relative ubiquity for invariant sets of relational structures.Paul Bankston & Wim Ruitenburg - 1990 - Journal of Symbolic Logic 55 (3):948-986.
Some Ramsey theory in Boolean algebra for complexity classes.Gregory L. McColm - 1992 - Mathematical Logic Quarterly 38 (1):293-298.
Analytics
Added to PP
2010-08-24
Downloads
148 (#288,220)
6 months
45 (#188,141)
2010-08-24
Downloads
148 (#288,220)
6 months
45 (#188,141)
Historical graph of downloads
Citations of this work
Classical and effective descriptive complexities of ω -powers.Olivier Finkel & Dominique Lecomte - 2009 - Annals of Pure and Applied Logic 160 (2):163-191.
Some complete $$\omega $$-powers of a one-counter language, for any Borel class of finite rank.Olivier Finkel & Dominique Lecomte - 2020 - Archive for Mathematical Logic 60 (1-2):161-187.
On some sets of dictionaries whose ω ‐powers have a given.Olivier Finkel - 2010 - Mathematical Logic Quarterly 56 (5):452-460.
Wadge degrees of Δ20$\mathbf{\Delta }^0_2$ omega‐powers. [REVIEW]Dominique Lecomte & Olivier Finkel - 2024 - Mathematical Logic Quarterly 70 (3):286-293.
References found in this work
Try MATCHA Writer if you're interested in citing directly from PhilPapers and certifying your authorship.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation