Logic and Games on Automatic Structures / Najlacnejšie knihy
Logic and Games on Automatic Structures

Kod: 01658513

Logic and Games on Automatic Structures

Autor ukasz Kaiser

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 an ... więcej

58.83


Dostępna u dostawcy w małych ilościach
Wysyłamy za 10 - 14 dni

Potrzebujesz więcej egzemplarzy?Jeżeli jesteś zainteresowany zakupem większej ilości egzemplarzy, skontaktuj się z nami, aby sprawdzić ich dostępność.


Dodaj do schowka

Zobacz książki o podobnej tematyce

Bon podarunkowy: Radość gwarantowana

Wzór bonu podarunkowegoDowiedz się więcej

Więcej informacji o Logic and Games on Automatic Structures

Za ten zakup dostaniesz 147 punkty

Opis

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 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 Ph.D thesis of ukasz Kaiser, that was awarded with the E.W. Beth award for outstanding dissertations in the fields of logic, language, and information in 2009. The work is 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.

Szczegóły książki

Kategoria Książki po angielsku Computing & information technology Computer science Artificial intelligence

58.83

Ulubione w innej kategorii



Osobní odběr Bratislava a 2642 dalších

Copyright ©2008-24 najlacnejsie-knihy.sk Wszelkie prawa zastrzeżonePrywatnieCookies


Konto: Logowanie
Všetky knihy sveta na jednom mieste. Navyše za skvelé ceny.

Nákupní košík ( prázdný )

Nakupte za 59,99 € a
máte doručení zdarma.

Twoja lokalizacja: