Choice functions and well-orderings over the infinite binary tree
From MaRDI portal
Publication:607442
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
Cites work
- scientific article; zbMATH DE number 3880651 (Why is no real title available?)
- scientific article; zbMATH DE number 3990873 (Why is no real title available?)
- scientific article; zbMATH DE number 3492660 (Why is no real title available?)
- scientific article; zbMATH DE number 1142314 (Why is no real title available?)
- scientific article; zbMATH DE number 1929935 (Why is no real title available?)
- scientific article; zbMATH DE number 803291 (Why is no real title available?)
- scientific article; zbMATH DE number 3237829 (Why is no real title available?)
- scientific article; zbMATH DE number 3189696 (Why is no real title available?)
- Automata, logics, and infinite games. A guide to current research
- Church’s Problem and a Tour through Automata Theory
- Complementation, Disambiguation, and Determinization of Büchi Automata Unified
- Decidability of Second-Order Theories and Automata on Infinite Trees
- Deciding Equivalence of Finite Tree Automata
- FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
- MSO on the Infinite Binary Tree: Choice and Order
- On decidability of monadic logic of order over the naturals extended by monadic predicates
- On the Equivalence and Containment Problems for Unambiguous Regular Expressions, Regular Grammars and Finite Automata
- On the synthesis of strategies in infinite games
- Rabin's uniformization problem
- Rational \(\omega\)-languages are non-ambiguous
- Solving Sequential Conditions by Finite-State Strategies
- Systolic tree \(\omega\)-languages: The operational and the logical view
- Testing and generating infinite sequences by a finite automaton
- The Descriptive Complexity of Parity Games
- The recursive sets in certain monadic second order fragments of arithmetic
- Uniformization and skolem functions in the class of trees
- Uniformization, choice functions and well orders in the class of trees
Cited in
(14)- On degrees of ambiguity for Büchi tree automata
- Unambiguous languages exhaust the index hierarchy
- MSO on the Infinite Binary Tree: Choice and Order
- Unambiguous Büchi Is Weak
- Automata on infinite trees
- On well-quasi-ordering infinite trees---Nash-Williams's theorem revisited
- On monadic theories of monadic predicates
- Monoidal-closed categories of tree automata
- On the expressive power of non-deterministic and unambiguous Petri nets over infinite words
- Solving Infinite Games in the Baire Space
- scientific article; zbMATH DE number 7559451 (Why is no real title available?)
- Unambiguity in automata theory
- On the strength of unambiguous tree automata
- scientific article; zbMATH DE number 7407790 (Why is no real title available?)
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)
