Idioma: Inglés
Publicado por Springer-Verlag Berlin and Heidelberg GmbH and Co. KG, DE, 2011
ISBN 10: 3642228062 ISBN 13: 9783642228063
Librería: Rarewaves.com USA, London, LONDO, Reino Unido
EUR 63,71
Cantidad disponible: Más de 20 disponibles
Añadir al carritoPaperback. Condición: New. 2011 ed.
Librería: Ria Christie Collections, Uxbridge, Reino Unido
EUR 58,14
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New. In.
Librería: Chiron Media, Wallingford, Reino Unido
EUR 56,25
Cantidad disponible: 10 disponibles
Añadir al carritoPF. Condición: New.
Idioma: Inglés
Publicado por Springer Berlin Heidelberg, 2011
ISBN 10: 3642228062 ISBN 13: 9783642228063
Librería: moluna, Greven, Alemania
EUR 48,74
Cantidad disponible: Más de 20 disponibles
Añadir al carritoKartoniert / Broschiert. Condición: New.
Librería: Rarewaves.com UK, London, Reino Unido
EUR 59,43
Cantidad disponible: Más de 20 disponibles
Añadir al carritoPaperback. Condición: New. 2011th.
Librería: Buchpark, Trebbin, Alemania
EUR 29,90
Cantidad disponible: 1 disponibles
Añadir al carritoCondición: Sehr gut. Zustand: Sehr gut | Sprache: Englisch | Produktart: Bücher | Keine Beschreibung verfügbar.
Idioma: Inglés
Publicado por Springer, Berlin, Springer, 2011
ISBN 10: 3642228062 ISBN 13: 9783642228063
Librería: AHA-BUCH GmbH, Einbeck, Alemania
EUR 77,74
Cantidad disponible: 2 disponibles
Añadir al carritoTaschenbuch. Condición: Neu. Neuware - The evaluation of a logical formula can be viewed as a game played by two opponents, one trying to show that the formula is true and the other trying to prove it is false. This correspondence has been known for a very long time and has inspired numerous research directions. In this book, the author extends this connection between logic and games to the class of automatic structures, where relations are recognized by synchronous finite automata.In model-checking games for automatic structures, two coalitions play against each other with a particular kind of hierarchical imperfect information. The investigation of such games leads to the introduction of a game quantifier on automatic structures, which connects alternating automata with the classical model-theoretic notion of a game quantifier. This study is then extended, determining the memory needed for strategies in infinitary games on the one hand, and characterizing regularity-preserving Lindström quantifiers on the other. Counting quantifiers are investigated in depth: it is shown that all countable omega-automatic structures are in fact finite-word automatic and that the infinity and uncountability set quantifiers are definable in MSO over countable linear orders and over labeled binary trees.This book is based on the PhD thesis of Lukasz Kaiser, which was awarded with the E.W. Beth award for outstanding dissertations in the fields of logic, language, and information in 2009. The work constitutes an innovative study in the area of algorithmic model theory, demonstrating the deep interplay between logic and computability in automatic structures. It displays very high technical and presentational quality and originality, advances significantly the field of algorithmic model theory and raises interesting new questions, thus emerging as a fruitful and inspiring source for future research.
Librería: Brook Bookstore On Demand, Napoli, NA, Italia
EUR 46,22
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: new. Questo è un articolo print on demand.