This book serves both as a completely self-contained introduction and as an exposition of new results in the field of recursive function theory and its application to formal systems.

This book serves both as a completely self-contained introduction and as an exposition of new results in the field of recursive function theory and its application to formal systems.

Type theory is a fast-evolving field at the crossroads of logic, computer science and mathematics. This gentle step-by-step introduction is ideal for graduate students and researchers who need to understand the ins and outs of the mathematical machinery, the role of logical rules therein, the essential contribution of definitions and the decisive nature of well-structured proofs. The authors begin with untyped lambda calculus and proceed to several fundamental type systems, including the well-known and powerful Calculus of Constructions. The book also covers the essence of proof checking and proof development, and the use of dependent type theory to formalise mathematics. The only prerequisite is a basic knowledge of undergraduate mathematics. Carefully chosen examples illustrate the theory throughout. Each chapter ends with a summary of the content, some historical context, suggestions for further reading and a selection of exercises to help readers familiarise themselves with the material.

This book bridges fundamental gaps between control theory and formal methods. Although it focuses on discrete-time linear and piecewise affine systems, it also provides general frameworks for abstraction, analysis, and control of more general models. The book is self-contained, and while some mathematical knowledge is necessary, readers are not expected to have a background in formal methods or control theory. It rigorously defines concepts from formal methods, such as transition systems, temporal logics, model checking and synthesis. It then links these to the infinite state dynamical systems through abstractions that are intuitive and only require basic convex-analysis and control-theory terminology, which is provided in the appendix. Several examples and illustrations help readers understand and visualize the concepts introduced throughout the book.

The central topic of this book is the mathematical analysis of social systems, understood in the following rather classical way: social systems consist of social actors who interact according to specific rules of interactions; the dynamics of social systems is then the consequences of these interactions, viz., the self-organization of social systems. According to particular demands of their environment, social systems are able to behave in an adaptive manner, that is they can change their rules of interaction by certain meta rules and thus generate a meta dynamics. It is possible to model and analyse mathematically both dynamics and meta dynamics, using cellular automata and genetic algorithms. These tools allow social systems theory to be carried through as precisely as the theories of natural systems, a feat that has not previously been possible. Readership: Researchers and graduate students in the fields of theoretical sociology and social and general systems theory and other interested scientists. No specialised knowledge of mathematics and/or computer science is required.

This work makes available to readers without specialized training in mathematics complete proofs of the fundamental metatheorems of standard (i.e., basically truth-functional) first order logic. Included is a complete proof, accessible to non-mathematicians, of the undecidability of first order logic, the most important fact about logic to emerge from the work of the last half-century. Hunter explains concepts of mathematics and set theory along the way for the benefit of non-mathematicians. He also provides ample exercises with comprehensive answers.