Kategoria BISAC: Mathematics >> Logic

In this volume the author develops and applies methods for proving, from large cardinals, the determinacy of definable games of countable length on natural numbers. The determinacy is ultimately derived from iteration strategies, connecting games on natural numbers with the specific iteration games that come up in the study of large cardinals.

The games considered in this text range in strength, from games of fixed countable length, through games where the length is clocked by natural numbers, to games in which a run is complete when its length is uncountable in an inner model (or a...

This book is devoted to the foundation of the most popular formal methods for the specification and verification of reactive systems. In...

Speech recognition technology is being increasingly employed in human-machine interfaces. A remaining problem however is the robustness of this technology to non-native accents, which still cause considerable difficulties for current systems.
In this book, methods to overcome this problem are described. A speaker adaptation algorithm that is capable of adapting to the current speaker with just a few words of speaker-specific data based on the MLLR principle is developed and combined with confidence measures that focus on phone durations as well as on acoustic features. Furthermore, a...

Formal methods have been applied successfully to the verification of medium-sized programs in protocol and hardware design. However, their application to more complex systems, resulting from the object-oriented and the more recent component-based software engineering paradigms, requires further development of specification and verification techniques supporting the concepts of reusability and modifiability.

This book presents revised tutorial lectures given by invited speakers at the Second International Symposium on Formal Methods for Components and Objects, FMCO 2003, held in...

Absolute values and their completions -like the p-adic number fields- play an important role in number theory. Krull's generalization of absolute values to valuations made applications in other branches of mathematics, such as algebraic geometry, possible. In valuation theory, the notion of a completion has to be replaced by that of the so-called Henselization.

In this book, the theory of valuations as well as of Henselizations is developed. The presentation is based on the knowledge acquired in a standard graduate course in algebra. The last chapter presents three applications of...

This book constitutes the refereed proceedings of the First International Conference on Algebra and Coalgebra in Computer Science, CALCO 2005, held in Swansea, UK in September 2005. The biennial conference was created by joining the International Workshop on Coalgebraic Methods in Computer Science (CMCS) and the Workshop on Algebraic Development Techniques (WADT). It addresses two basic areas of application for algebras and coalgebras - as mathematical objects as well as their application in computer science.

The 25 revised full papers presented together with 3 invited papers were...

This book constitutes the refereed proceedings of the 14th International Conference on Automated Reasoning with Analytic Tableaux and Related Methods, TABLEAUX 2005, held in Koblenz, Germany, in September 2005.

The 18 revised research papers presented together with 7 system descriptions as well as 4 invited talks were carefully reviewed and selected from 46 submissions. All aspects of the mechanization of reasoning with tableaux and related methods are focused: analytic tableaux for various logics, related techniques and concepts, new calculi and methods for theorem proving in classical...

Parameterized complexity theory is a recent branch of computational complexity theory that provides a framework for a refined analysis of hard algorithmic problems. The central notion of the theory, fixed-parameter tractability, has led to the development of various new algorithmic techniques and a whole new theory of intractability.

This book is a state-of-the-art introduction to both algorithmic techniques for fixed-parameter tractability and the structural theory of parameterized complexity classes, and it presents detailed proofs of recent advanced results that have not appeared...

Commemorating the 50th anniversary of the first time a mathematical theorem was proven by a computer system, Freek Wiedijk initiated the present book in 2004 by inviting formalizations of a proof of the irrationality of the square root of two from scientists using various theorem proving systems.

The 17 systems included in this volume are among the most relevant ones for the formalization of mathematics. The systems are showcased by presentation of the formalized proof and a description in the form of answers to a standard questionnaire. The 17 systems presented are HOL, Mizar,...

This book studies the relationship between automata and monadic second-order logic, focusing on classes of automata that describe the concurrent behavior of distributed systems. It provides a unifying theory of communicating automata and their logical properties. Based on Hanf's Theorem and Thomas's graph acceptors, it develops a result that allows characterization of many popular models of distributed computation in terms of the existential fragment of monadic second-order logic.

This book constitutes the refereed proceedings of the 11th International Conference on Implementation and Application of Automata, CIAA 2006, held in Taipei, Taiwan, in August 2006. The 22 revised full papers and 7 revised poster papers presented together with the extended abstracts of 3 invited lectures were carefully reviewed and selected from 76 submissions. The papers cover various topics in the theory, implementation, and applications of automata and related structures.