Wadge hierarchy and Veblen hierarchy Part I: Borel sets of finite rank

From MaRDI portal
Publication:2732268

DOI10.2307/2694911zbMath0979.03039OpenAlexW1974868602MaRDI QIDQ2732268

Jacques Duparc

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




Related Items

On omega context free languages which are Borel sets of infinite rank.Recursion and topology on \(2^{\leq\omega}\) for possibly infinite computationsGAMES CHARACTERIZING LIMSUP FUNCTIONS AND BAIRE CLASS 1 FUNCTIONSThe Wadge Hierarchy of Petri Nets ω-LanguagesA quasi-order on continuous functionsInside the Muchnik degrees. I: Discontinuity, learnability and constructivismDescriptive set theory, from Cantor to Wadge and beyondA game theoretical approach to the algebraic counterpart of the Wagner hierarchy : Part IA Game Theoretical Approach to The Algebraic Counterpart of The Wagner Hierarchy : Part IIWadge-like degrees of Borel bqo-valued functionsOn the High Complexity of Petri Nets $$\omega $$-LanguagesA syntactic approach to Borel functions: some extensions of Louveau's theoremTowards a descriptive theory of cb0-spacesTHE WADGE ORDER ON THE SCOTT DOMAIN IS NOT A WELL-QUASI-ORDERA GAME CHARACTERIZING BAIRE CLASS 1 FUNCTIONSAmbiguity in omega context free languagesA hierarchy of deterministic context-free \(\omega\)-languages.Borel hierarchy and omega context free languages.The Algebraic Counterpart of the Wagner HierarchyInside the Muchnik degrees. II: The degree structures induced by the arithmetical hierarchy of countably continuous functionsOn the structure of the Wadge degrees of bqo-valued Borel functionsSome complete \(\omega\)-powers of a one-counter language, for any Borel class of finite rankGame characterizations and lower cones in the Weihrauch degreesWell-Quasi Orders and Hierarchy TheoryTopological complexity of locally finite \(\omega\)-languagesPlaying in the first Baire classSome remarks on Baire's grand theoremGame characterizations and lower cones in the Weihrauch degreesComputer science and the fine structure of Borel setsClassical and effective descriptive complexities of \(\omega \)-powersOn some sets of dictionaries whose ω -powers have a givenTopological properties of omega context-free languagesWadge hierarchy of omega context-free languagesThe uniform Martin’s conjecture for many-one degreesExpressive power of first-order recurrent neural networks determined by their attractor dynamicsGame representations of classes of piecewise definable functionsThe Steel hierarchy of ordinal valued Borel mappingsLocally finite ω-languages and effective analytic sets have the same topological complexityLinear Game Automata: Decidable Hierarchy Problems for Stripped-Down Alternating Tree AutomataWadge-Wagner hierarchiesA Tentative Approach for the Wadge-Wagner Hierarchy of Regular Tree Languages of Index [0, 2] ⋮ An upper bound on the complexity of recognizable tree languagesOn the Expressive Power of Non-deterministic and Unambiguous Petri Nets over Infinite WordsGames 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