Choice functions and well-orderings over the infinite binary tree (Q607442): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(5 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.2478/s11533-010-0046-z / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.2478/s11533-010-0046-z / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2030037063 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rational \(\omega\)-languages are non-ambiguous / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5525343 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Sequential Conditions by Finite-State Strategies / rank
 
Normal rank
Property / cites work
 
Property / cites work: FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: MSO on the Infinite Binary Tree: Choice and Order / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4708567 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5725991 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Descriptive Complexity of Parity Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4850061 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata, logics, and infinite games. A guide to current research / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rabin's uniformization problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complementation, Disambiguation, and Determinization of Büchi Automata Unified / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uniformization, choice functions and well orders in the class of trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uniformization and skolem functions in the class of trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing and generating infinite sequences by a finite automaton / rank
 
Normal rank
Property / cites work
 
Property / cites work: Systolic tree \(\omega\)-languages: The operational and the logical view / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3753490 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decidability of Second-Order Theories and Automata on Infinite Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4074888 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On decidability of monadic logic of order over the naturals extended by monadic predicates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deciding Equivalence of Finite Tree Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3346281 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The recursive sets in certain monadic second order fragments of arithmetic / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Equivalence and Containment Problems for Unambiguous Regular Expressions, Regular Grammars and Finite Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385530 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the synthesis of strategies in infinite games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Church’s Problem and a Tour through Automata Theory / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.2478/S11533-010-0046-Z / rank
 
Normal rank

Latest revision as of 22:26, 9 December 2024

scientific article
Language Label Description Also known as
English
Choice functions and well-orderings over the infinite binary tree
scientific article

    Statements

    Choice functions and well-orderings over the infinite binary tree (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    22 November 2010
    0 references
    monadic second-order logic
    0 references
    definability
    0 references
    choice function
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references