Wadge hierarchy and Veblen hierarchy Part I: Borel sets of finite rank
From MaRDI portal
Publication:2732268
DOI10.2307/2694911zbMath0979.03039OpenAlexW1974868602MaRDI QIDQ2732268
Publication date: 17 February 2002
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2694911
Borel hierarchyWadge hierarchyWadge gameVeblen hierarchyordinal exponentiationordinal additionBorel sets of finite rankordinal multiplicationself-dual setsWadge degree
Related Items
On omega context free languages which are Borel sets of infinite rank. ⋮ Recursion and topology on \(2^{\leq\omega}\) for possibly infinite computations ⋮ GAMES CHARACTERIZING LIMSUP FUNCTIONS AND BAIRE CLASS 1 FUNCTIONS ⋮ The Wadge Hierarchy of Petri Nets ω-Languages ⋮ A quasi-order on continuous functions ⋮ Inside the Muchnik degrees. I: Discontinuity, learnability and constructivism ⋮ Descriptive set theory, from Cantor to Wadge and beyond ⋮ A game theoretical approach to the algebraic counterpart of the Wagner hierarchy : Part I ⋮ A Game Theoretical Approach to The Algebraic Counterpart of The Wagner Hierarchy : Part II ⋮ Wadge-like degrees of Borel bqo-valued functions ⋮ On the High Complexity of Petri Nets $$\omega $$-Languages ⋮ A syntactic approach to Borel functions: some extensions of Louveau's theorem ⋮ Towards a descriptive theory of cb0-spaces ⋮ THE WADGE ORDER ON THE SCOTT DOMAIN IS NOT A WELL-QUASI-ORDER ⋮ A GAME CHARACTERIZING BAIRE CLASS 1 FUNCTIONS ⋮ Ambiguity in omega context free languages ⋮ A hierarchy of deterministic context-free \(\omega\)-languages. ⋮ Borel hierarchy and omega context free languages. ⋮ The Algebraic Counterpart of the Wagner Hierarchy ⋮ Inside the Muchnik degrees. II: The degree structures induced by the arithmetical hierarchy of countably continuous functions ⋮ On the structure of the Wadge degrees of bqo-valued Borel functions ⋮ Some complete \(\omega\)-powers of a one-counter language, for any Borel class of finite rank ⋮ Game characterizations and lower cones in the Weihrauch degrees ⋮ Well-Quasi Orders and Hierarchy Theory ⋮ Topological complexity of locally finite \(\omega\)-languages ⋮ Playing in the first Baire class ⋮ Some remarks on Baire's grand theorem ⋮ Game characterizations and lower cones in the Weihrauch degrees ⋮ Computer science and the fine structure of Borel sets ⋮ Classical and effective descriptive complexities of \(\omega \)-powers ⋮ On some sets of dictionaries whose ω -powers have a given ⋮ Topological properties of omega context-free languages ⋮ Wadge hierarchy of omega context-free languages ⋮ The uniform Martin’s conjecture for many-one degrees ⋮ Expressive power of first-order recurrent neural networks determined by their attractor dynamics ⋮ Game representations of classes of piecewise definable functions ⋮ The Steel hierarchy of ordinal valued Borel mappings ⋮ Locally finite ω-languages and effective analytic sets have the same topological complexity ⋮ Linear Game Automata: Decidable Hierarchy Problems for Stripped-Down Alternating Tree Automata ⋮ Wadge-Wagner hierarchies ⋮ A Tentative Approach for the Wadge-Wagner Hierarchy of Regular Tree Languages of Index [0, 2] ⋮ An upper bound on the complexity of recognizable tree languages ⋮ On the Expressive Power of Non-deterministic and Unambiguous Petri Nets over Infinite Words ⋮ Games with winning conditions of high Borel complexity
Cites Work
This page was built for publication: Wadge hierarchy and Veblen hierarchy Part I: Borel sets of finite rank