This book is a state-of-the-art introduction into both algorithmic techniques for fixed-parameter tractability and the structural theory of parameterized complexity classes. It presents detailed proofs of recent advanced results that have not appeared in book form before and replaces the earlier publication "Parameterized Complexity" by Downey and Fellows as the definitive book on this subject. The book will interest computer scientists, mathematicians and graduate students engaged with algorithms and problem complexity.

This careful, self-contained introduction to first-order logic includes an exposition of certain topics not usually found in introductory texts (such as Trachtenbrot's undecidability theorem, Fraisse's characterization of elementary equivalence, and Lindström's theorem on the maximality of first-order logic). The presentation is detailed and systematic without being long-winded or tedious. The role of first-order logic in the foundations of mathematics is worked out clearly, particularly the two basic questions of the range of the axiomatic method and of theorem-proving by machines. Many exercises accompany the text. (view table of contents)