Well-Quasi Orders in Computation, Logic, Language and Reasoning : A Unifying Concept of Proof Theory, Automata Theory, Formal Languages and Descriptive Set Theory / Peter M. Schuster, Monika Seisenberger, Andreas Weiermann editors

• Pubblicazione: Cham, : Springer, 2020
• Titolo uniforme: Well-Quasi Orders in Computation, Logic, Language and Reasoning
• Descrizione fisica: x, 391 p. : ill. ; 24 cm
• Soggetto topico: 03-XX - Mathematical logic and foundations [MSC 2020]; 03Exx - Set theory [MSC 2020]; 00B25 - Proceedings of conferences of miscellaneous specific interest [MSC 2020]; 06A05 - Total order [MSC 2020]; 03Fxx - Proof theory and constructive mathematics [MSC 2020]
• Soggetto non controllato: Analytic combinatorics; Braid Groups; Combinatorics; Commutative algebra; Computational content of classical proofs; Constructive mathematics; Descriptive set theory; Discrete mathematics; Graph theory; Graph-minor Theorem; Kriz's Theorem; Maximal Order Type; Ordinal Notation System; Proof Theory; Reverse Mathematics; Subrecursive hierarchies; Termination Proofs; Theorem Proving and Verification; Theory of relations; Well Quasi-order
• Persona (resp. second.): Schuster, Peter M.; Seisenberger, Monika; Weiermann, Andreas
• Titolo autorizzato: Well-Quasi Orders in Computation, Logic, Language and Reasoning
• Formato: Materiale a stampa
• Livello bibliografico: Monografia
• Lingua di pubblicazione: Inglese
• Record Nr.: VAN0250035
• Lo trovi qui: Univ. Vanvitelli
• Localizzazioni e accesso elettronico: http://doi.org/10.1007/978-3-030-30229-0
• Serie: Trends in logic : studia logica library Berlin [etc.] . -Springer ; 53