Alfred Tarski, one of the greatest logicians of all time, is widely thought of as 'the man who defined truth'. His mathematical work on the concepts of truth and logical consequence are cornerstones of modern logic, influencing developments in philosophy, linguistics and computer science. Tarski was a charismatic teacher and zealous promoter of his view of logic as the foundation of all rational thought, a bon-vivant and a womanizer, who played the 'great man' to the hilt. Born in Warsaw in 1901 to Jewish parents, he changed his name and converted to Catholicism, but was never able to obtain a professorship in his home country. A fortuitous trip to the United States at the outbreak of war saved his life and turned his career around, even while it separated him from his family for years. By the war's end he was established as a professor of mathematics at the University of California, Berkeley. There Tarski built an empire in logic and methodology that attracted students and distinguished researchers from all over the world. From the cafes of Warsaw and Vienna to the mountains and deserts of California, this first full length biography places Tarski in the social, intellectual and historical context of his times and presents a frank, vivid picture of a personally and professionally passionate man, interlaced with an account of his major scientific achievements.

This undergraduate textbook covers the key material for a typical first course in logic, in particular presenting a full mathematical account of the most important result in logic, the Completeness Theorem for first-order logic. Looking at a series of interesting systems, increasing in complexity, then proving and discussing the Completeness Theorem for each, the author ensures that the number of new concepts to be absorbed at each stage is manageable, whilst providing lively mathematical applications throughout. Unfamiliar terminology is kept to a minimum, no background in formal set-theory is required, and the book contains proofs of all the required set theoretical results. The reader is taken on a journey starting with K??nig's Lemma, and progressing via order relations, Zorn's Lemma, Boolean algebras, and propositional logic, to completeness and compactness of first-order logic. As applications of the work on first-order logic, two final chapters provide introductions to model theory and nonstandard analysis.

Mathematics and logic have been central topics of concern since the dawn of philosophy. Since logic is the study of correct reasoning, it is a fundamental branch of epistemology and a priority in any philosophical system. Philosophers have focused on mathematics as a case study for general philosophical issues and for its role in overall knowledge- gathering. Today, philosophy of mathematics and logic remain central disciplines in contemporary philosophy, as evidenced by the regular appearance of articles on these topics in the best mainstream philosophical journals; in fact, the last decade has seen an explosion of scholarly work in these areas.
This volume covers these disciplines in a comprehensive and accessible manner, giving the reader an overview of the major problems, positions, and battle lines. The 26 contributed chapters are by established experts in the field, and their articles contain both exposition and criticism as well as substantial development of their own positions. The essays, which are substantially self-contained, serve both to introduce the reader to the subject and to engage in it at its frontiers. Certain major positions are represented by two chapters--one supportive and one critical.
The Oxford Handbook of Philosophy of Math and Logic is a ground-breaking reference like no other in its field. It is a central resource to those wishing to learn about the philosophy of mathematics and the philosophy of logic, or some aspect thereof, and to those who actively engage in the discipline, from advanced undergraduates to professional philosophers, mathematicians, and historians.

Recent applications to biomolecular science and DNA computing have created a new audience for automata theory and formal languages. This is the only introductory book to cover such applications. It begins with a clear and readily understood exposition of the fundamentals that assumes only a background in discrete mathematics. The first five chapters give a gentle but rigorous coverage of basic ideas as well as topics not found in other texts at this level, including codes, retracts and semiretracts. Chapter 6 introduces combinatorics on words and uses it to describe a visually inspired approach to languages. The final chapter explains recently-developed language theory coming from developments in bioscience and DNA computing. With over 350 exercises (for which solutions are available), many examples and illustrations, this text will make an ideal contemporary introduction for students; others, new to the field, will welcome it for self-learning.

Petri nets are a popular and powerful formal model for the analysis and modelling of concurrent systems, and a rich theory has developed around them. Petri nets are taught to undergraduates, and also used by industrial practitioners. This book focuses on a particular class of petri nets, free choice petri nets, which play a central role in the theory. The text is very clearly organised, with every notion carefully explained and every result proved. Clear exposition is given for place invariants, siphons, traps and many other important analysis techniques. The material is organised along the lines of a course book, and each chapter contains numerous exercises, making this book ideal for graduate students and research workers alike.

Alfred Tarski, one of the greatest logicians of all time, is widely thought of as 'the man who defined truth'. His mathematical work on the concepts of truth and logical consequence are cornerstones of modern logic, influencing developments in philosophy, linguistics and computer science. Tarski was a charismatic teacher and zealous promoter of his view of logic as the foundation of all rational thought, a bon-vivant and a womanizer, who played the 'great man' to the hilt. Born in Warsaw in 1901 to Jewish parents, he changed his name and converted to Catholicism, but was never able to obtain a professorship in his home country. A fortuitous trip to the United States at the outbreak of war saved his life and turned his career around, even while it separated him from his family for years. By the war's end he was established as a professor of mathematics at the University of California, Berkeley. There Tarski built an empire in logic and methodology that attracted students and distinguished researchers from all over the world. From the cafes of Warsaw and Vienna to the mountains and deserts of California, this first full length biography places Tarski in the social, intellectual and historical context of his times and presents a frank, vivid picture of a personally and professionally passionate man, interlaced with an account of his major scientific achievements.

Diese kompakte Einfuhrung in die Theoretische Informatik stellt die wichtigsten Modelle fur zentrale Probleme der Informatik vor. Dabei werden u.a. folgende Fragestellungen behandelt:

Welche Probleme sind algorithmisch losbar? (Theorie der Berechenbarkeit und Entscheidbarkeit)

Wie schwierig ist es algorithmische Probleme zu losen? (Theorie der Berechnungskomplexitat, NP-Theorie)

Wie sind informationsverarbeitende Systeme prinzipiell aufgebaut? (Theorie der endlichen Automaten)

Welche Strukturen besitzen Programmiersprachen? (Theorie der formalen Sprachen)

In der Erarbeitung dieser Themen wird der Abstraktionsprozess von den realen Gegenstanden der Informatik zu den in der Theoretischen Infromatik etabliertern Modellen, wie z.B. Random-Access-Maschinen, Turingmaschinen und endliche Automaten, nachvollzogen und umgekehrt verdeutlicht, was diese Modelle aufgrund der uber sie gewonnenen Erkenntnisse fur die Praxis leisten konnen."

Demonstrating the different roles that logic plays in the disciplines of computer science, mathematics, and philosophy, this concise undergraduate textbook covers select topics from three different areas of logic: proof theory, computability theory, and nonclassical logic. The book balances accessibility, breadth, and rigor, and is designed so that its materials will fit into a single semester. Its distinctive presentation of traditional logic material will enhance readers' capabilities and mathematical maturity.

The proof theory portion presents classical propositional logic and first-order logic using a computer-oriented (resolution) formal system. Linear resolution and its connection to the programming language Prolog are also treated. The computability component offers a machine model and mathematical model for computation, proves the equivalence of the two approaches, and includes famous decision problems unsolvable by an algorithm. The section on nonclassical logic discusses the shortcomings of classical logic in its treatment of implication and an alternate approach that improves upon it: Anderson and Belnap's relevance logic. Applications are included in each section. The material on a four-valued semantics for relevance logic is presented in textbook form for the first time.

Aimed at upper-level undergraduates of moderate analytical background, "Three Views of Logic" will be useful in a variety of classroom settings.Gives an exceptionally broad view of logicTreats traditional logic in a modern formatPresents relevance logic with applicationsProvides an ideal text for a variety of one-semester upper-level undergraduate courses

Philosophical considerations, which are often ignored or treated casually, are given careful consideration in this introduction. Thomas Forster places the notion of inductively defined sets (recursive datatypes) at the center of his exposition resulting in an original analysis of well established topics. The presentation illustrates difficult points and includes many exercises. Little previous knowledge of logic is required and only a knowledge of standard undergraduate mathematics is assumed.

This volume presents articles from four outstanding researchers who work at the cusp of analysis and logic. The emphasis is on active research topics; many results are presented that have not been published before and open problems are formulated. Considerable effort has been made by the authors to make their articles accessible to mathematicians new to the area

Dieses Buch basiert auf Vorlesungen, die der Autor in Kaiserslautern gehalten hat. Ihr wesentliches Anliegen war, die Turing-berechenbaren Wortfunktionen auf eine von jeglichem Maschinenmodell unabhangige Weise zu charakterisieren, namlich als die partiell Wort-rekursiven Wortfunktionen. Wortfunktionen lassen sich mittels arithmetischer Funktionen darstellen und zwar so, dass die partiell rekursiven arithmetischen Funktionen den partiell Wort-rekursiven Wortfunktionen entsprechen, was fur sich gesehen schon nicht auf der Hand liegt. Auf diese Weise erhalt man den Begriff der Turing-Berechenbarkeit auch fur arithmetische Funktionen. Der Satz also, dass die Turing-berechenbaren Wortfunktionen gerade die partiell rekursiven Wortfunktionen sind, ist uberhaupt nicht selbstverstandlich, so dass auf dem Wege zu diesem Satz eine ganze Reihe hoch interessanter weiterer Satze zu beweisen sind. Dies alles ist hier aufgeschrieben.

How has computer science changed mathematical thinking? In this first ever comprehensive survey of the subject for popular science readers, Arturo Sangalli explains how computers have brought a new practicality to mathematics and mathematical applications. By using fuzzy logic and related concepts, programmers have been able to sidestep the traditional and often cumbersome search for perfect mathematical solutions to embrace instead solutions that are "good enough." If mathematicians want their work to be relevant to the problems of the modern world, Sangalli shows, they must increasingly recognize "the importance of being fuzzy."

As Sangalli explains, fuzzy logic is a technique that allows computers to work with imprecise terms--to answer questions with "maybe" rather than just "yes" and "no." The practical implications of this flexible type of mathematical thinking are remarkable. Japanese programmers have used fuzzy logic to develop the city of Sendai's unusually energy-efficient and smooth-running subway system--one that does not even require drivers. Similar techniques have been used in fields as diverse as medical diagnosis, image understanding by robots, the engineering of automatic transmissions, and the forecasting of currency exchange rates. Sangalli also explores in his characteristically clear and engaging manner the limits of classical computing, reviewing many of the central ideas of Turing and Godel. He shows us how "genetic algorithms" can solve problems by an evolutionary process in which chance plays a fundamental role. He introduces us to "neural networks," which recognize ill-defined patterns without an explicit set of rules--much as a dog can be trained to scent drugs without ever having an exact definition of "drug." Sangalli argues that even though "fuzziness" and related concepts are often compared to human thinking, they can be understood only through mathematics--but the math he uses in the book is straightforward and easy to grasp.

Of equal appeal to specialists and the general reader, "The Importance of Being Fuzzy" reveals how computer science is changing both the nature of mathematical practice and the shape of the world around us.

In funf sorgfaltig aufeinander abgestimmten Teilen behandelt das Buch die wesentlichen mathematischen Elemente der formalen Spezifikation von Systemen und der Aussagen- und Pradikatenlogik, die fur das Verstandnis des formalisierten Problemlosens entscheidend und damit fur Informatiker unerlasslich sind. Eine Einfuhrung in die intuitive Mengentheorie vermittelt zunachst notwendige mathematische Grundlagen. Motiviert durch das Konzept von Datenstrukturen und abstrakten Datentypen werden dann algebraische Strukturen in der Informatik behandelt. Danach werden Aussagen- und Pradikatenlogik aus der Sicht der Mathematik und Informatik dargestellt. Schliesslich fuhrt die Kategorientheorie fur Informatiker in die Welt der abstrakten Behandlung mathematischer Strukturen ein.
Die Neuauflage wurde erweitert um Darstellungen zur Modellalgebra und zur Implementierung. Ubungsaufgaben wurden erganzt."

FROM THE PRESENTER OF THE TEDx TALK 'You weren't bad at maths - you just weren't looking at it the right way' 'Compelling and wonderfully readable' - Ian Stewart, bestselling author of Seventeen Equations that Changed the World 'AI is powerful, but human thinking is differently powerful, and Junaid Mubeen deftly shows us how' - Eugenia Cheng, author of How to Bake Pi There's so much talk about the threat posed by intelligent machines that it sometimes seems as though we should surrender to our robot overlords now. But Junaid Mubeen isn't ready to throw in the towel just yet. As far as he is concerned, we have the edge over machines because of a remarkable system of thought developed over the millennia. It's familiar to us all, but often badly taught and misrepresented in popular discourse - maths. Computers are brilliant at totting up sums, pattern-seeking and performing, well, computation. For all things calculation, machines reign supreme. But Junaid identifies seven areas of intelligence where humans can retain a crucial edge. And in exploring these areas, he opens up a fascinating world where we can develop our uniquely human mathematical superpowers.

Kurt Gödel was the most outstanding logician of the twentieth century, famous for his work on the completeness of logic, the incompleteness of number theory, and the consistency of the axiom of choice and the continuum hypothesis. He is also noted for his work on constructivity, the decision problem, and the foundations of computation theory, as well as for the strong individuality of his writings on the philosophy of mathematics. Less well-known is his discovery of unusual cosmological models for Einstein's equations, permitting "time-travel" into the past. This second volume of a comprehensive edition of Gödel's works collects together all his publications from 1938 to 1974. Together with Volume I (Publications 1929-1936), it makes available for the first time in a single source all of his previously published work. Continuing the format established in the earlier volume, the present text includes introductory notes that provide extensive explanatory and historical commentary on each of the papers, a facing English translation of the one German original, and a complete bibliography. Succeeding volumes are to contain unpublished manuscripts, lectures, correspondence, and extracts from the notebooks. Collected Works is designed to be accessible and useful to as wide an audience as possible without sacrificing scientific or historical accuracy. The only complete edition available in English, it will be an essential part of the working library of professionals and students in logic, mathematics, philosophy, history of science, and computer science. These volumes will also interest scientists and all others who wish to be acquainted with one of the great minds of the twentieth century.

Die zentrale Aufgabe einer zukunftsorientierten Computerlinguistik ist die Entwicklung kognitiver Maschinen, mit denen Menschen in ihrer jeweiligen Sprache frei reden kAnnen. Langfristig umfaAt diese Zielsetzung eine funktional ausgerichtete Theoriebildung, eine objektive Verifikationsmethode und eine FA1/4lle praktischer Anwendungen.
FA1/4r die natA1/4rlichsprachliche Kommunikation wird nicht nur Sprachverarbeitung, sondern auch nichtsprachliche Wahrnehmung und Handlung benAtigt. Deshalb ist der Inhalt dieses Lehrbuchs als Sprachtheorie fA1/4r die Konstruktion sprechender Roboter organisiert. Sein zentrales Thema ist die Kommunikationsmechanik natA1/4rlicher Sprachen - beim Sprecher und beim HArer. Der Inhalt ist in folgende vier Teile mit je sechs Kapiteln gegliedert: Sprachtheorie; Formale Grammatik; Morphologie und Syntax; Semantik und Pragmatik. Insgesamt 772 Aoebungsaufgaben dienen der VerstAndniskontrolle und -vertiefung.

The initial volume of a comprehensive edition of Gödel's works, this book makes available for the first time in a single source all his publications from 1929 to 1936. The volume begins with an informative overview of Gödel's life and work and features facing English translations for all German originals, extensive explanatory and historical notes, and a complete biography. Volume 2 will contain the remainder of Gödel's published work, and subsequent volumes will include unpublished manuscripts, lectures, correspondence and extracts from the notebooks.