Many believe mathematics is only about calculations, formulas, numbers, and strange letters. But mathematics is much more than just crunching numbers or manipulating symbols. Mathematics is about discovering patterns, uncovering hidden structures, finding counterexamples, and thinking logically. Mathematics is a way of thinking. It is an activity that is both highly creative and challenging. This book offers an introduction to mathematical reasoning for beginning university or college students, providing a solid foundation for further study in mathematics, computer science, and related disciplines. Written in a manner that directly conveys the sense of excitement and discovery at the heart of doing science, its 25 short and visually appealing chapters cover the basics of set theory, logic, proof methods, combinatorics, graph theory, and much more. In the book you will, among other things, find answers to: What is a proof? What is a counterexample? What does it mean to say that something follows logically from a set of premises? What does it mean to abstract over something? How can knowledge and information be represented and used in calculations? What is the connection between Morse code and Fibonacci numbers? Why could it take billions of years to solve Hanoi's Tower? Logical Methods is especially appropriate for students encountering such concepts for the very first time. Designed to ease the transition to a university or college level study of mathematics or computer science, it also provides an accessible and fascinating gateway to logical thinking for students of all disciplines.

Examines how the racial lenses of the social sciences and the subscription of social scientists to whites' racial common sense have limited their understanding of racial matters and handicapped their capacity to appreciate the significance of the "race effect" (they call it the "racial stratification effect"). With an assemblage of leading scholars, White Logic, White Methods explores the possibilities and necessary dethroning of current social research practices, and demands a complete overhaul of current methods, towards a multicultural and pluralist approach to what we know, think, and question. Readers in various social sciences will find useful the chapters in the collection, but all will agree that the introductory and concluding chapters to the volume (Towards a Definition of White Logic and White Methods, and Telling the Real Tale of the Hunt: Towards a Race Conscious Sociology of Racial Stratification) are likely to become classics in the field of racial and ethnic relations.

The twenty-six papers in this volume reflect the wide and still expanding range of Anil Nerode's work. A conference on Logical Methods was held in honor of Nerode's sixtieth birthday (4 June 1992) at the Mathematical Sciences Institute, Cornell University, 1-3 June 1992. Some of the conference papers are here, but others are from students, co-workers and other colleagues. The intention of the conference was to look forward, and to see the directions currently being pursued, in the development of work by, or with, Nerode. Here is a brief summary of the contents of this book. We give a retrospective view of Nerode's work. A number of specific areas are readily discerned: recursive equivalence types, recursive algebra and model theory, the theory of Turing degrees and r.e. sets, polynomial-time computability and computer science. Nerode began with automata theory and has also taken a keen interest in the history of mathematics. All these areas are represented. The one area missing is Nerode's applied mathematical work relating to the environment. Kozen's paper builds on Nerode's early work on automata. Recursive equivalence types are covered by Dekker and Barback, the latter using directly a fundamental metatheorem of Nerode. Recursive algebra is treated by Ge & Richards (group representations). Recursive model theory is the subject of papers by Hird, Moses, and Khoussainov & Dadajanov, while a combinatorial problem in recursive model theory is discussed in Cherlin & Martin's paper. Cenzer presents a paper on recursive dynamics.

This widely used textbook of modern formal logic now offers a number of new features. Incorporating updated notations, selective answers to exercises, expanded treatment of natural deduction, and new discussions of predicate-functor logic and the affinities between higher set theory and the elementary logic of terms, W. V. Quine's new edition will serve admirably for both classroom and independent use.

Using a new, systematic framework, this illuminating book turns ideation into a task anybody with sound logic and a determination to learn can do, and do well, by separating the process from the outcome. In a competitive marketplace, all firms must constantly innovate to create sustained shareholder value. The main roadblock in innovation is ideation: the identification of value-creating ideas, often seen as the work of innately creative people. This first-of-its-kind textbook demonstrates that anyone can ideate through specific logical processes that require no creativity when used, but generate valuable and creative outcomes. To help students master and apply these methods, the book is filled with innovation examples across many sectors that can be explained and recreated using a specific LCT method. The book also includes exercises that enable readers to practice applying each method to solve real life innovation challenges. Upper-level undergraduate and postgraduate students of innovation, creativity, and new product development will appreciate the demystification of ideation into a problem that can be solved by applying a series of rigorous, defined methods that can be followed without ambiguity.

Here, the authors strive to change the way logic and discrete math are taught in computer science and mathematics: while many books treat logic simply as another topic of study, this one is unique in its willingness to go one step further. The book traets logic as a basic tool which may be applied in essentially every other area.

This comprehensive text demonstrates how various notions of logic can be viewed as notions of universal algebra. It is aimed primarily for logisticians in mathematics, philosophy, computer science and linguistics with an interest in algebraic logic, but is also accessible to those from a non-logistics background. It is suitable for researchers, graduates and advanced undergraduates who have an introductory knowledge of algebraic logic providing more advanced concepts, as well as more theoretical aspects. The main theme is that standard algebraic results (representations) translate into standard logical results (completeness). Other themes involve identification of a class of algebras appropriate for classical and non-classical logic studies, including: gaggles, distributoids, partial- gaggles, and tonoids. An imporatant sub title is that logic is fundamentally information based, with its main elements being propositions, that can be understood as sets of information states. Logics are considered in various senses e.g. systems of theorems, consequence relations and, symmetric consequence relations.