Free Preview of Well-quasi Orders In Computation, Logic, Language And Reasoning: A Unifying Concept Of Proof Theory, Automata Theory, Formal Languages And Descriptive Set Theory
Well-quasi Orders In Computation, Logic, Language And Reasoning: A Unifying Concept Of Proof Theory, Automata Theory, Formal Languages And Descriptive Set Theory
Simply sign in or create your free Kobo account to get started. Read eBooks on any Kobo eReader or with the free Kobo App.
Why Kobo?
With over 6 million of the world’s best eBooks to choose from, Kobo offers you a whole world of reading. Go shelf-less with your library and enjoy reward points with every purchase.
*Valid January 13, 2025 - March 2, 2025 at Canadian stores and at indigo.ca with $30.00 or more purchase of eligible in-stock product(s) in a single transaction before taxes, and after discounts. Not valid on previous purchases or in conjunction with other offers.
Well-quasi Orders In Computation, Logic, Language And Reasoning: A Unifying Concept Of Proof Theory, Automata Theory, Formal Languages And Descriptive Set Theory/en-ca/well-quasi-orders-in-computation-logic-language-and-reasoning-a-unifying-concept-of-proof-theory-automata-theory-formal-languages-and-descriptive-set-theory/DD31F9D2-52B7-45D4-93E8-D9353DF0D8D0.htmlDD31F9D2-52B7-45D4-93E8-D9353DF0D8D0
Well-quasi Orders In Computation, Logic, Language And Reasoning: A Unifying Concept Of Proof Theory, Automata Theory, Formal Languages And Descriptive Set Theory
Well-Quasi Orders in Computation, Logic, Language and Reasoning: A Unifying Concept of Proof Theory, Automata Theory, Formal Languages and Descriptive Set Theory