Choice functions and well-orderings over the infinite binary tree
type: Item
instance of: scholarly article
title: Choice functions and well-orderings over the infinite binary tree
zbMATH Open document ID: 1215.03054
author: Arnaud Carayol
author: Christof Löding
author: Damian Niwiński
author: Igor Walukiewicz
published in: Central European Journal of Mathematics
publication date: 2010-11-22T00:00:00Z
Mathematics Subject Classification ID: 03D05
Mathematics Subject Classification ID: 03B15
Mathematics Subject Classification ID: 03B25
Mathematics Subject Classification ID: 03B70
zbMATH DE Number: 5818020
zbMATH Keywords: monadic second-order logic
zbMATH Keywords: definability
zbMATH Keywords: choice function
MaRDI profile type: Publication
full work available at URL: s11533-010-0046-z
OpenAlex ID: W2030037063
cites work: Rational \(\omega\)-languages are non-ambiguous
cites work: Q5525343
cites work: Solving Sequential Conditions by Finite-State Strategies
cites work: FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
cites work: MSO on the Infinite Binary Tree: Choice and Order
cites work: Q4708567
cites work: Q5725991
cites work: The Descriptive Complexity of Parity Games
cites work: Q4850061
cites work: Automata, logics, and infinite games. A guide to current research
cites work: Rabin's uniformization problem
cites work: Complementation, Disambiguation, and Determinization of Büchi Automata Unified
cites work: Uniformization, choice functions and well orders in the class of trees
cites work: Uniformization and skolem functions in the class of trees
cites work: Testing and generating infinite sequences by a finite automaton
cites work: Systolic tree \(\omega\)-languages: The operational and the logical view
cites work: Q3753490
cites work: Decidability of Second-Order Theories and Automata on Infinite Trees
cites work: Q4074888
cites work: On decidability of monadic logic of order over the naturals extended by monadic predicates
cites work: Deciding Equivalence of Finite Tree Automata
cites work: Q3346281
cites work: The recursive sets in certain monadic second order fragments of arithmetic
cites work: On the Equivalence and Containment Problems for Unambiguous Regular Expressions, Regular Grammars and Finite Automata
cites work: Q4385530
cites work: On the synthesis of strategies in infinite games
cites work: Church’s Problem and a Tour through Automata Theory
DOI: 10.2478/S11533-010-0046-Z
Recommended article: Choice Functions on Tree Quasi-Orders
Recommended article: Uniformization, choice functions and well orders in the class of trees
Recommended article: On well-quasi-ordering infinite trees---Nash-Williams's theorem revisited
Recommended article: Q3779426
Recommended article: THE STRENGTH OF AN AXIOM OF FINITE CHOICE FOR BRANCHES IN TREES
Recommended article: On trees and tree dimension of ordered sets
Recommended article: Selection theorems and treeability
Recommended article: A remark on the tree property in a choiceless context
Recommended article: Decidable Inequalities over Infinite Trees
Recommended article: Choice functions on posets
description: scientific article; zbMATH DE number 5818020