Choice functions and well-orderings over the infinite binary tree
DOI10.2478/S11533-010-0046-ZzbMATH Open1215.03054OpenAlexW2030037063MaRDI QIDQ607442FDOQ607442
Authors: Arnaud Carayol, Christof Löding, Damian Niwiński, Igor Walukiewicz 
Publication date: 22 November 2010
Published in: Central European Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2478/s11533-010-0046-z
Recommendations
- Choice Functions on Tree Quasi-Orders
- Uniformization, choice functions and well orders in the class of trees
- On well-quasi-ordering infinite trees---Nash-Williams's theorem revisited
- scientific article; zbMATH DE number 4040813
- THE STRENGTH OF AN AXIOM OF FINITE CHOICE FOR BRANCHES IN TREES
- On trees and tree dimension of ordered sets
- Selection theorems and treeability
- A remark on the tree property in a choiceless context
- Decidable inequalities over infinite trees
- Choice functions on posets
Automata and formal grammars in connection with logical questions (03D05) Decidability of theories and sets of sentences (03B25) Logic in computer science (03B70)
Cites Work
- Rabin's uniformization problem
- MSO on the Infinite Binary Tree: Choice and Order
- Title not available (Why is that?)
- Decidability of Second-Order Theories and Automata on Infinite Trees
- Automata, logics, and infinite games. A guide to current research
- Deciding Equivalence of Finite Tree Automata
- On the Equivalence and Containment Problems for Unambiguous Regular Expressions, Regular Grammars and Finite Automata
- Title not available (Why is that?)
- Uniformization and skolem functions in the class of trees
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the synthesis of strategies in infinite games
- Church’s Problem and a Tour through Automata Theory
- Testing and generating infinite sequences by a finite automaton
- Title not available (Why is that?)
- Title not available (Why is that?)
- Solving Sequential Conditions by Finite-State Strategies
- Rational \(\omega\)-languages are non-ambiguous
- Complementation, Disambiguation, and Determinization of Büchi Automata Unified
- The recursive sets in certain monadic second order fragments of arithmetic
- Systolic tree \(\omega\)-languages: The operational and the logical view
- On decidability of monadic logic of order over the naturals extended by monadic predicates
- Uniformization, choice functions and well orders in the class of trees
- Title not available (Why is that?)
- The Descriptive Complexity of Parity Games
- Title not available (Why is that?)
- FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
Cited In (14)
- Monoidal-closed categories of tree automata
- Title not available (Why is that?)
- Unambiguous Büchi Is Weak
- Automata on infinite trees
- On well-quasi-ordering infinite trees---Nash-Williams's theorem revisited
- Unambiguous languages exhaust the index hierarchy
- On monadic theories of monadic predicates
- Title not available (Why is that?)
- Unambiguity in automata theory
- On degrees of ambiguity for Büchi tree automata
- MSO on the Infinite Binary Tree: Choice and Order
- Solving Infinite Games in the Baire Space
- On the strength of unambiguous tree automata
- On the expressive power of non-deterministic and unambiguous Petri nets over infinite words
This page was built for publication: Choice functions and well-orderings over the infinite binary tree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q607442)
