Isbn: 9783642228063 - logic and games on automatic structures: playing with quantifiers and decompositions: 6810 (lecture notes in computer science) (8 resultados)

ISBN
Refinar con la Búsqueda avanzada

Filtrar la búsqueda

  • Libros (8)

a

Intervalo de precios personalizado (EUR)

a

  • Idioma: Inglés

    Editorial: Springer-Verlag Berlin and Heidelberg GmbH and Co. KG, DE, 2011

    3642228062 / 9783642228063

    • Tapa blanda

    Librería: Rarewaves.com USA, London, LONDO, Reino UnidoRarewaves.com USA

    Vendedor de 5 estrellas
    Contactar con el vendedor

    Condición: Nuevo

    EUR 65,08

     Gastos de envío gratis 
    Se envía de Reino Unido a Estados Unidos de America

    Cantidad disponible: Más de 20 disponibles

    Paperback. Condición: New. 2011 ed. 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.

  • Idioma: Inglés

    Editorial: Springer, 2011

    3642228062 / 9783642228063

    • Tapa blanda

    Librería: Ria Christie Collections, Uxbridge, Reino UnidoRia Christie Collections

    Vendedor de 5 estrellas
    Contactar con el vendedor

    Condición: Nuevo

    EUR 59,34

    Envío por EUR 10,94 
    Se envía de Reino Unido a Estados Unidos de America

    Cantidad disponible: Más de 20 disponibles

    Condición: New. In English.

  • Idioma: Inglés

    Editorial: Springer 2011-07, 2011

    3642228062 / 9783642228063

    • Tapa blanda

    Librería: Chiron Media, Wallingford, Reino UnidoChiron Media

    Vendedor de 5 estrellas
    Contactar con el vendedor

    Condición: Nuevo

    EUR 56,99

    Envío por EUR 18,09 
    Se envía de Reino Unido a Estados Unidos de America

    Cantidad disponible: 10 disponibles

    PF. Condición: New.

  • Idioma: Inglés

    Editorial: Springer-Verlag New York Inc, 2011

    3642228062 / 9783642228063

    • Tapa blanda

    Librería: Revaluation Books, Exeter, Reino UnidoRevaluation Books

    Vendedor de 5 estrellas
    Contactar con el vendedor

    Condición: Nuevo

    EUR 76,80

    Envío por EUR 11,68 
    Se envía de Reino Unido a Estados Unidos de America

    Cantidad disponible: 2 disponibles

    Paperback. Condición: Brand New. 130 pages. 9.10x6.10x0.30 inches. In Stock.

  • Idioma: Inglés

    Editorial: Springer Berlin Heidelberg, 2011

    3642228062 / 9783642228063

    • Tapa blanda

    Librería: moluna, Greven, Alemaniamoluna

    Vendedor de 5 estrellas
    Contactar con el vendedor

    Condición: Nuevo

    EUR 48,74

    Envío por EUR 48,99 
    Se envía de Alemania a Estados Unidos de America

    Cantidad disponible: Más de 20 disponibles

    Kartoniert / Broschiert. Condición: New.

  • Idioma: Inglés

    Editorial: Springer-Verlag Berlin and Heidelberg GmbH and Co. KG, DE, 2011

    3642228062 / 9783642228063

    • Tapa blanda

    Librería: Rarewaves.com UK, London, Reino UnidoRarewaves.com UK

    Vendedor de 5 estrellas
    Contactar con el vendedor

    Condición: Nuevo

    EUR 62,39

    Envío por EUR 75,90 
    Se envía de Reino Unido a Estados Unidos de America

    Cantidad disponible: Más de 20 disponibles

    Paperback. Condición: New. 2011 ed. 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.

  • Idioma: Inglés

    Editorial: Springer-Verlag GmbH, 2011

    3642228062 / 9783642228063

    • Tapa blanda

    Librería: Buchpark, Trebbin, AlemaniaBuchpark

    Vendedor de 5 estrellas
    Contactar con el vendedor

    Condición: Usado - Excelente

    EUR 43,93

    Envío por EUR 105,00 
    Se envía de Alemania a Estados Unidos de America

    Cantidad disponible: 1 disponibles

    Condición: Sehr gut. Zustand: Sehr gut | Sprache: Englisch | Produktart: Bücher | Keine Beschreibung verfügbar.

  • Idioma: Inglés

    Editorial: Springer Verlag, 2011

    3642228062 / 9783642228063

    • Tapa blanda
    • Impresión bajo demanda

    Librería: Brook Bookstore On Demand, Napoli, NA, ItaliaBrook Bookstore On Demand

    Vendedor de 5 estrellas
    Contactar con el vendedor

    Condición: Nuevo

    EUR 46,22

    Envío por EUR 4,00 
    Se envía de Italia a Estados Unidos de America

    Cantidad disponible: Más de 20 disponibles

    Condición: new. Questo è un articolo print on demand.