The present volume is a sequel to Deontic Logic: Introductory and Systematic Readings (D. Reidel Publishing Company, Dordrecht 1971): its purpose is to offer a view of some of the main directions of research in contemporary deontic logic. Most of the articles included in Introductory and Systematic Readings represent what may be called the standard modal approach to deontic logic, in which de on tic logic is treated as a branch of modal logic, and the normative concepts of obligation, permission and prohibition are regarded as analogous to the "alethic" modalities necessity, possibility and impossibility. As Simo Knuuttila shows in his contribution to the present volume, this approach goes back to late medieval philosophy. Several 14th century philosophers observed the analogies between deontic and alethic modalities and discussed the deontic interpretations of various laws of modal logic. In contemporary deontic logic the modal approach was revived by G. H. von Wright's classic paper 'Deontic Logic' (1951). Certain analogies between deontic and alethic modalities are obvious and uncontroversial, but the standard approach has often been criticized on the ground that it exaggerates the analogies and tends to ignore those features of normative concepts which distinguish them from other modalities.

Very Short Introductions: Brilliant, Sharp, Inspiring Kurt Goedel first published his celebrated theorem, showing that no axiomatization can determine the whole truth and nothing but the truth concerning arithmetic, nearly a century ago. The theorem challenged prevalent presuppositions about the nature of mathematics and was consequently of considerable mathematical interest, while also raising various deep philosophical questions. Goedel's Theorem has since established itself as a landmark intellectual achievement, having a profound impact on today's mathematical ideas. Goedel and his theorem have attracted something of a cult following, though his theorem is often misunderstood. This Very Short Introduction places the theorem in its intellectual and historical context, and explains the key concepts as well as common misunderstandings of what it actually states. A. W. Moore provides a clear statement of the theorem, presenting two proofs, each of which has something distinctive to teach about its content. Moore also discusses the most important philosophical implications of the theorem. In particular, Moore addresses the famous question of whether the theorem shows the human mind to have mathematical powers beyond those of any possible computer ABOUT THE SERIES: The Very Short Introductions series from Oxford University Press contains hundreds of titles in almost every subject area. These pocket-sized books are the perfect way to get ahead in a new subject quickly. Our expert authors combine facts, analysis, perspective, new ideas, and enthusiasm to make interesting and challenging topics highly readable.

The ultimate lateral-thinking challenge. If you relish a serious mental workout, this collection of 100 brain teasers will demand your very best lateral thinking skills and mathematical rigour to solve. These puzzles will amuse and perplex in equal measure. But do not worry, full, detailed solutions are found at the back of the book so you can get into the head of these fiendish setters! These mental puzzles require serious application, imagination and skill to solve. Some demand a logical approach, others a methodical, mathematical mind. Are you up to the challenge of solving these rigorous but entertaining mathematical puzzles?

Using set theory in the first part of his book, and proof theory in the second, Gaisi Takeuti gives us two examples of how mathematical logic can be used to obtain results previously derived in less elegant fashion by other mathematical techniques, especially analysis. In Part One, he applies Scott- Solovay's Boolean-valued models of set theory to analysis by means of complete Boolean algebras of projections. In Part Two, he develops classical analysis including complex analysis in Peano's arithmetic, showing that any arithmetical theorem proved in analytic number theory is a theorem in Peano's arithmetic. In doing so, the author applies Gentzen's cut elimination theorem. Although the results of Part One may be regarded as straightforward consequences of the spectral theorem in function analysis, the use of Boolean- valued models makes explicit and precise analogies used by analysts to lift results from ordinary analysis to operators on a Hilbert space. Essentially expository in nature, Part Two yields a general method for showing that analytic proofs of theorems in number theory can be replaced by elementary proofs. Originally published in 1978. The Princeton Legacy Library uses the latest print-on-demand technology to again make available previously out-of-print books from the distinguished backlist of Princeton University Press. These editions preserve the original texts of these important books while presenting them in durable paperback and hardcover editions. The goal of the Princeton Legacy Library is to vastly increase access to the rich scholarly heritage found in the thousands of books published by Princeton University Press since its founding in 1905.

If a man supports Arsenal one day and Spurs the next then he is fickle but not necessarily illogical. From this starting point, and assuming no previous knowledge of logic, Wilfrid Hodges takes the reader through the whole gamut of logical expressions in a simple and lively way. Readers who are more mathematically adventurous will find optional sections introducing rather more challenging material.

How a computational framework can account for the successes and failures of human cognition At the heart of human intelligence rests a fundamental puzzle: How are we incredibly smart and stupid at the same time? No existing machine can match the power and flexibility of human perception, language, and reasoning. Yet, we routinely commit errors that reveal the failures of our thought processes. What Makes Us Smart makes sense of this paradox by arguing that our cognitive errors are not haphazard. Rather, they are the inevitable consequences of a brain optimized for efficient inference and decision making within the constraints of time, energy, and memory-in other words, data and resource limitations. Framing human intelligence in terms of these constraints, Samuel Gershman shows how a deeper computational logic underpins the "stupid" errors of human cognition. Embarking on a journey across psychology, neuroscience, computer science, linguistics, and economics, Gershman presents unifying principles that govern human intelligence. First, inductive bias: any system that makes inferences based on limited data must constrain its hypotheses in some way before observing data. Second, approximation bias: any system that makes inferences and decisions with limited resources must make approximations. Applying these principles to a range of computational errors made by humans, Gershman demonstrates that intelligent systems designed to meet these constraints yield characteristically human errors. Examining how humans make intelligent and maladaptive decisions, What Makes Us Smart delves into the successes and failures of cognition.

This book contains contributions that on the one hand represent modern developments in the area of mathematical morphology, and on the other hand may be of particular interest to an audience of (theoretical) computer scientists. The introductory chapter summarizes some basic notions and concepts of mathematical morphology. In this chapter, a novice reader learns, among other things, that complete lattice theory is generally accepted as the appropriate algebraic framework for mathematical morphology. In the following chapter it is explained that, for a number of cases, the complete lattice framework is too limited, and that one should, instead, work on (complete) inf-semilattices. Other chapters discuss granulometries, analytical aspects of mathematical morphology, and the geometric character of mathematical morphology. Also, connectivity, the watershed transform and a formal language for morphological transformations are being discussed. This book has many interesting things to offer to researches in computer science, mathematics, physics, electrical engineering and other disciplines.

What is algebra? For some, it is an abstract language of x's and y's. For mathematics majors and professional mathematicians, it is a world of axiomatically defined constructs like groups, rings, and fields. "Taming the Unknown" considers how these two seemingly different types of algebra evolved and how they relate. Victor Katz and Karen Parshall explore the history of algebra, from its roots in the ancient civilizations of Egypt, Mesopotamia, Greece, China, and India, through its development in the medieval Islamic world and medieval and early modern Europe, to its modern form in the early twentieth century.

Defining algebra originally as a collection of techniques for determining unknowns, the authors trace the development of these techniques from geometric beginnings in ancient Egypt and Mesopotamia and classical Greece. They show how similar problems were tackled in Alexandrian Greece, in China, and in India, then look at how medieval Islamic scholars shifted to an algorithmic stage, which was further developed by medieval and early modern European mathematicians. With the introduction of a flexible and operative symbolism in the sixteenth and seventeenth centuries, algebra entered into a dynamic period characterized by the analytic geometry that could evaluate curves represented by equations in two variables, thereby solving problems in the physics of motion. This new symbolism freed mathematicians to study equations of degrees higher than two and three, ultimately leading to the present abstract era.

"Taming the Unknown" follows algebra's remarkable growth through different epochs around the globe.

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.

Frege is widely regarded as having set much of the agenda of contemporary analytic philosophy. As standardly read, he meant to introduce-and make crucial contributions to-the project of giving an account of the workings of (an improved version of) natural language. Yet, despite the great admiration most contemporary philosophers feel for Frege, it is widely believed that he committed a large number of serious, and inexplicable, blunders. For, if Frege really meant to be constructing a theory of the workings of (some version of) natural language, then a significant number of his stated views-including views that he claimed to be central to his philosophical picture-are straightforwardly wrong. But did Frege mean to be giving an account of the workings of language? He himself never actually claimed to be doing this, and, indeed, never even described such a project. Taking Frege at his Word offers an interpretation that is based on a different approach to his writings. Rather than using the contributions he is taken to have made to contemporary work in the philosophy of language to infer what his projects were, Joan Weiner gives priority to Frege's own accounts of what he means to be doing. She provides a very different view of Frege's project. One might suspect that, on such a reading, Frege's writings would have purely antiquarian interest, but this would be a mistake. The final two chapters show that Frege offers us new ways of addressing some of the philosophical problems that worry us today.

Exploring Mathematics gives students experience with doing mathematics - interrogating mathematical claims, exploring definitions, forming conjectures, attempting proofs, and presenting results - and engages them with examples, exercises, and projects that pique their interest. Written with a minimal number of pre-requisites, this text can be used by college students in their first and second years of study, and by independent readers who want an accessible introduction to theoretical mathematics. Core topics include proof techniques, sets, functions, relations, and cardinality, with selected additional topics that provide many possibilities for further exploration. With a problem-based approach to investigating the material, students develop interesting examples and theorems through numerous exercises and projects. In-text exercises, with complete solutions or robust hints included in an appendix, help students explore and master the topics being presented. The end-of-chapter exercises and projects provide students with opportunities to confirm their understanding of core material, learn new concepts, and develop mathematical creativity.

Now the most used texbook for introductory cryptography courses in both mathematics and computer science, the Third Edition builds upon previous editions by offering several new sections, topics, and exercises. The authors present the core principles of modern cryptography, with emphasis on formal definitions, rigorous proofs of security.

An accessible explanation of Kurt Goedel's groundbreaking work in mathematical logic In 1931 Kurt Goedel published his fundamental paper, "On Formally Undecidable Propositions of Principia Mathematica and Related Systems." This revolutionary paper challenged certain basic assumptions underlying much research in mathematics and logic. Goedel received public recognition of his work in 1951 when he was awarded the first Albert Einstein Award for achievement in the natural sciences-perhaps the highest award of its kind in the United States. The award committee described his work in mathematical logic as "one of the greatest contributions to the sciences in recent times." However, few mathematicians of the time were equipped to understand the young scholar's complex proof. Ernest Nagel and James Newman provide a readable and accessible explanation to both scholars and non-specialists of the main ideas and broad implications of Goedel's discovery. It offers every educated person with a taste for logic and philosophy the chance to understand a previously difficult and inaccessible subject. New York University Press is proud to publish this special edition of one of its bestselling books. With a new introduction by Douglas R. Hofstadter, this book will appeal students, scholars, and professionals in the fields of mathematics, computer science, logic and philosophy, and science.

The treatment here of Boolean algebra, deeper than in most elementary texts, can serve as a supplement or an introduction to graduate-level study. The explanations of switching and logic circuits refer to combinatorial circuits. The theory in both of these areas is illustrated and amplified by many problems with detailed solutions, giving students a secure grounding. Supplementary problems provide a complete review of the material.

An introduction to applying predicate logic to testing and verification of software and digital circuits that focuses on applications rather than theory. Computer scientists use logic for testing and verification of software and digital circuits, but many computer science students study logic only in the context of traditional mathematics, encountering the subject in a few lectures and a handful of problem sets in a discrete math course. This book offers a more substantive and rigorous approach to logic that focuses on applications in computer science. Topics covered include predicate logic, equation-based software, automated testing and theorem proving, and large-scale computation. Formalism is emphasized, and the book employs three formal notations: traditional algebraic formulas of propositional and predicate logic; digital circuit diagrams; and the widely used partially automated theorem prover, ACL2, which provides an accessible introduction to mechanized formalism. For readers who want to see formalization in action, the text presents examples using Proof Pad, a lightweight ACL2 environment. Readers will not become ALC2 experts, but will learn how mechanized logic can benefit software and hardware engineers. In addition, 180 exercises, some of them extremely challenging, offer opportunities for problem solving. There are no prerequisites beyond high school algebra. Programming experience is not required to understand the book's equation-based approach. The book can be used in undergraduate courses in logic for computer science and introduction to computer science and in math courses for computer science students.

Hilbert's Programs & Beyond presents the foundational work of David Hilbert in a sequence of thematically organized essays. They first trace the roots of Hilbert's work to the radical transformation of mathematics in the 19th century and bring out his pivotal role in creating mathematical logic and proof theory. They then analyze techniques and results of "classical" proof theory as well as their dramatic expansion in modern proof theory. This intellectual experience finally opens horizons for reflection on the nature of mathematics in the 21st century: Sieg articulates his position of reductive structuralism and explores mathematical capacities via computational models.

Einsatzfertige Lerneinheiten vermitteln fundamentale mathematische Techniken, die weit uber die Unterstufe hinaus von Bedeutung sind. Die Lerninhalte eignen sich auch zur gezielten Vorbereitung auf Mathematikwettbewerbe. Die Schuler*innen lernen das Schubfachprinzip und den Eulerschen Polyedersatz kennen und fuhren Beweise in verschiedenen Kontexten. Es werden abwechslungsreiche Bewegungsaufgaben und vielfaltige Fragestellungen aus der Kombinatorik in unterschiedlichen Schwierigkeitsgraden bearbeitet. Die Aufgaben foerdern die mathematische Denkfahigkeit, Phantasie und Kreativitat. Die ausfuhrlichen Musterloesungen sind auch fur Nicht-Mathematiker*innen verstandlich.

This classic undergraduate treatment examines the deductive method in its first part and explores applications of logic and methodology in constructing mathematical theories in its second part. Exercises appear throughout.

An Introduction to Proof Theory provides an accessible introduction to the theory of proofs, with details of proofs worked out and examples and exercises to aid the reader's understanding. It also serves as a companion to reading the original pathbreaking articles by Gerhard Gentzen. The first half covers topics in structural proof theory, including the Goedel-Gentzen translation of classical into intuitionistic logic (and arithmetic), natural deduction and the normalization theorems (for both NJ and NK), the sequent calculus, including cut-elimination and mid-sequent theorems, and various applications of these results. The second half examines ordinal proof theory, specifically Gentzen's consistency proof for first-order Peano Arithmetic. The theory of ordinal notations and other elements of ordinal theory are developed from scratch, and no knowledge of set theory is presumed. The proof methods needed to establish proof-theoretic results, especially proof by induction, are introduced in stages throughout the text. Mancosu, Galvan, and Zach's introduction will provide a solid foundation for those looking to understand this central area of mathematical logic and the philosophy of mathematics.

Einsatzfertige Lerneinheiten vermitteln fundamentale mathematische Techniken, die weit uber die Unterstufe hinaus von Bedeutung sind. Die Lerninhalte eignen sich auch zur gezielten Vorbereitung auf Mathematikwettbewerbe. Die Schuler*innen lernen den Euklidischen Algorithmus kennen und anzuwenden, und die Modulo-Rechnung wird ausfuhrlich behandelt. Stellenwertsysteme und ungewoehnliche Anwendungen der binomischen Formeln runden diesen Band ab. Zu allen Themengebieten fuhren die Schuler*innen Beweise und lernen unterschiedliche Beweistechniken. Die Aufgaben foerdern die mathematische Denkfahigkeit, Phantasie und Kreativitat. Die ausfuhrlichen Musterloesungen sind auch fur Nicht-Mathematiker*innen verstandlich.