'A wealth of examples to which solutions are given permeate the text so the reader will certainly be active.'The Mathematical GazetteThis is the final book written by the late great puzzle master and logician, Dr. Raymond Smullyan.This book is a sequel to my Beginner's Guide to Mathematical Logic.The previous volume deals with elements of propositional and first-order logic, contains a bit on formal systems and recursion, and concludes with chapters on Gödel's famous incompleteness theorem, along with related results.The present volume begins with a bit more on propositional and first-order logic, followed by what I would call a 'fein' chapter, which simultaneously generalizes some results from recursion theory, first-order arithmetic systems, and what I dub a 'decision machine.' Then come five chapters on formal systems, recursion theory and metamathematical applications in a general setting. The concluding five chapters are on the beautiful subject of combinatory logic, which is not only intriguing in its own right, but has important applications to computer science. Argonne National Laboratory is especially involved in these applications, and I am proud to say that its members have found use for some of my results in combinatory logic.This book does not cover such important subjects as set theory, model theory, proof theory, and modern developments in recursion theory, but the reader, after studying this volume, will be amply prepared for the study of these more advanced topics.

Combining stories of great writers and philosophers with quotations and riddles, this original text for first courses in mathematical logic examines problems related to proofs, propositional logic and first-order logic, undecidability, and other topics. 2014 edition.

The year's finest mathematical writing from around the world This annual anthology brings together the year's finest mathematics writing from around the world. Featuring promising new voices alongside some of the foremost names in the field, The Best Writing on Mathematics 2019 makes available to a wide audience many articles not easily found anywhere else—and you don't need to be a mathematician to enjoy them. These essays delve into the history, philosophy, teaching, and everyday aspects of math, offering surprising insights into its nature, meaning, and practice—and taking readers behind the scenes of today's hottest mathematical debates. In this volume, Moon Duchin explains how geometric-statistical methods can be used to combat gerrymandering, Jeremy Avigad illustrates the growing use of computation in making and verifying mathematical hypotheses, and Kokichi Sugihara describes how to construct geometrical objects with unusual visual properties. In other essays, Neil Sloane presents some recent additions to the vast database of integer sequences he has catalogued, and Alessandro Di Bucchianico and his colleagues highlight how mathematical methods have been successfully applied to big-data problems. And there's much, much more. In addition to presenting the year's most memorable math writing, this must-have anthology includes an introduction by the editor and a bibliography of other notable writings on mathematics. This is a must-read for anyone interested in where math has taken us—and where it is headed.

This book collects, for the first time in one volume, contributions honoring Professor Raymond Smullyan’s work on self-reference. It serves not only as a tribute to one of the great thinkers in logic, but also as a celebration of self-reference in general, to be enjoyed by all lovers of this field. Raymond Smullyan, mathematician, philosopher, musician and inventor of logic puzzles, made a lasting impact on the study of mathematical logic; accordingly, this book spans the many personalities through which Professor Smullyan operated, offering extensions and re-evaluations of his academic work on self-reference, applying self-referential logic to art and nature, and lastly, offering new puzzles designed to communicate otherwise esoteric concepts in mathematical logic, in the manner for which Professor Smullyan was so well known. This book is suitable for students, scholars and logicians who are interested in learning more about Raymond Smullyan's work and life.

This is the final book written by the late great puzzle master and logician, Dr. Raymond Smullyan. This book is a sequel to my Beginner's Guide to Mathematical Logic. The previous volume deals with elements of propositional and first-order logic, contains a bit on formal systems and recursion, and concludes with chapters on GOdel's famous incompleteness theorem, along with related results. The present volume begins with a bit more on propositional and first-order logic, followed by what I would call a "fein" chapter, which simultaneously generalizes some results from recursion theory, first-order arithmetic systems, and what I dub a "decision machine." Then come five chapters on formal systems, recursion theory and metamathematical applications in a general setting. The concluding five chapters are on the beautiful subject of combinatory logic, which is not only intriguing in its own right, but has important applications to computer science. Argonne National Laboratory is especially involved in these applications, and I am proud to say that its members have found use for some of my results in combinatory logic. This book does not cover such important subjects as set theory, model theory, proof theory, and modern developments in recursion theory, but the reader, after studying this volume, will be amply prepared for the study of these more advanced topics.

This book constructs an idealized version of what the author calls syntacticism, a school of thought in the philosophy of logic which is congenial to analytical philosophy, logical positivism, and anti-metaphysical nominalism. It examines in detail both technical metalogical and broad philosophic issues associated with this way of thinking about logic, and specifically addresses anomalies around symbolic expressivity, which is crucial for this approach, with a view to provide both a deeper understanding and a critique. The range of fields and interests addressed include: the philosophy of logic, formal logic and mathematical logic, the analytical school of philosophy, logical positivism and nominalism, parallels between thinking about logic and the formalist school in the philosophy of mathematics, the history of modern logic, Wittgenstein’s Tractatus, Leśniewski’s protothetic, dialogue logic, and combinatorial logic.

This useful guide introduces the reader to the so-called 'father of modern philosophy' - Rene Descartes.

In this Beginner’s Guide, Peter Hacker, the leading authority on the philosophy of Wittgenstein and author of a dozen books on his work, introduces the later philosophy of Wittgenstein to those with an enquiring mind. It selects an array of topics that will capture the interest of all educated readers: the nature of language and linguistic meaning, the analysis of necessity and its roots in convention, the relation of thought and language, the nature of the mind and its relation to behavior, self-consciousness, and knowledge of other minds. No philosophical knowledge is presupposed – only curiosity and a willingness to shed prejudices. Written in a laid-back colloquial style and interspersed by dialogues between the author and questioners, the book is amusing and entertaining to read. Nothing comparable to this exists in the literature on Wittgenstein. Wittgenstein’s ideas are presented in all their profundity for the widest possible audience, in a style that is intellectually stimulating and provocative.

This book takes the reader on a journey from familiar high school mathematics to undergraduate algebra and number theory. The journey starts with the basic idea that new number systems arise from solving different equations, leading to (abstract) algebra. Along this journey, the reader will be exposed to important ideas of mathematics, and will learn a little about how mathematics is really done. Starting at an elementary level, the book gradually eases the reader into the complexities of higher mathematics; in particular, the formal structure of mathematical writing (definitions, theorems and proofs) is introduced in simple terms. The book covers a range of topics, from the very foundations (numbers, set theory) to basic abstract algebra (groups, rings, fields), driven throughout by the need to understand concrete equations and problems, such as determining which numbers are sums of squares. Some topics usually reserved for a more advanced audience, such as Eisenstein integers or quadratic reciprocity, are lucidly presented in an accessible way. The book also introduces the reader to open source software for computations, to enhance understanding of the material and nurture basic programming skills. For the more adventurous, a number of Outlooks included in the text offer a glimpse of possible mathematical excursions. This book supports readers in transition from high school to university mathematics, and will also benefit university students keen to explore the beginnings of algebraic number theory. It can be read either on its own or as a supporting text for first courses in algebra or number theory, and can also be used for a topics course on Diophantine equations.

With newly uncovered personal papers, this volume offers in-depth analysis of Wesley Hohfeld's pioneering contributions to legal theory.