This introductory graduate text covers modern mathematical logic from propositional, first-order, higher-order and infinite logic and Godel's Incompleteness Theorems to extensive introductions to set theory, model theory and recursion (computability) theory. Based on the author's more than 35 years of teaching experience, the book develops students' intuition by presenting complex ideas in the simplest context for which they make sense. He also provides extensive introductions to set theory, model theory and recursion (computability) theory, which allows this book to be used as a classroom text, for self-study, and as a reference on the state of modern logic.

This collection of papers, celebrating the contributions of Swedish logician Dag Prawitz to Proof Theory, has been assembled from those presented at the Natural Deduction conference organized in Rio de Janeiro to honour his seminal research. Dag Prawitz's work forms the basis of intuitionistic type theory and his inversion principle constitutes the foundation of most modern accounts of proof-theoretic semantics in Logic, Linguistics and Theoretical Computer Science.

The range of contributions includes material on the extension of natural deduction with higher-order rules, as opposed to higher-order connectives, and a paper discussing the application of natural deduction rules to dealing with equality in predicate calculus. The volume continues with a key chapter summarizing work on the extension of the Curry-Howard isomorphism (itself a by-product of the work on natural deduction), via methods of category theory that have been successfully applied to linear logic, as well as many other contributions from highly regarded authorities. With an illustrious group of contributors addressing a wealth of topics and applications, this volume is a valuable addition to the libraries of academics in the multiple disciplines whose development has been given added scope by the methodologies supplied by natural deduction. The volume is representative of the rich and varied directions that Prawitz work has inspired in the area of natural deduction.
"

Every mathematician agrees that every mathematician must know some set theory; the disagreement begins in trying to decide how much is some. This book contains my answer to that question. The purpose of the book is to tell the beginning student of advanced mathematics the basic set theoretic facts of life, and to do so with the minimum of philosophical discourse and logical formalism. The point of view throughout is that of a prospective mathematician anxious to study groups, or integrals, or manifolds. From this point of view the concepts and methods of this book are merely some of the standard mathematical tools; the expert specialist will find nothing new here. Scholarly bibliographical credits and references are out of place in a purely expository book such as this one. The student who gets interested in set theory for its own sake should know, however, that there is much more to the subject than there is in this book. One of the most beautiful sources of set-theoretic wisdom is still Hausdorff's Set theory. A recent and highly readable addition to the literature, with an extensive and up-to-date bibliography, is Axiomatic set theory by Suppes.

This volume honours the life and work of Solomon Feferman, one of the most prominent mathematical logicians of the latter half of the 20th century. In the collection of essays presented here, researchers examine Feferman's work on mathematical as well as specific methodological and philosophical issues that tie into mathematics. Feferman's work was largely based in mathematical logic (namely model theory, set theory, proof theory and computability theory), but also branched out into methodological and philosophical issues, making it well known beyond the borders of the mathematics community. With regard to methodological issues, Feferman supported concrete projects. On the one hand, these projects calibrate the proof theoretic strength of subsystems of analysis and set theory and provide ways of overcoming the limitations imposed by Goedel's incompleteness theorems through appropriate conceptual expansions. On the other, they seek to identify novel axiomatic foundations for mathematical practice, truth theories, and category theory. In his philosophical research, Feferman explored questions such as "What is logic?" and proposed particular positions regarding the foundations of mathematics including, for example, his "conceptual structuralism." The contributing authors of the volume examine all of the above issues. Their papers are accompanied by an autobiography presented by Feferman that reflects on the evolution and intellectual contexts of his work. The contributing authors critically examine Feferman's work and, in part, actively expand on his concrete mathematical projects. The volume illuminates Feferman's distinctive work and, in the process, provides an enlightening perspective on the foundations of mathematics and logic.

Data structures and tools from computational geometry help to solve problems in computer graphics; these methods have been widely adopted by the computer graphics community yielding elegant and efficient algorithms. This book focuses on algorithms and data structures that have proven to be versatile, efficient, fundamental, and easy to implement. The book familiarizes students, as well as practitioners in the field of computer graphics, with a wide range of data structures. The authors describe each data structure in detail, highlight fundamental properties, and present algorithms based on the data structure. A number of recent representative and useful algorithms from computer graphics are described in detail, illuminating the utilization of the data structure in a creative way.

The series is devoted to the publication of high-level monographs on all areas of mathematical logic and its applications. It is addressed to advanced students and research mathematicians, and may also serve as a guide for lectures and for seminars at the graduate level.

Together with its compagnion volume this book presents a practical introduction to computing spline functions, the fundamental tools for fitting curves and surfaces in computer-aided design (CAD) and computer graphics.

These volumes present a practical introduction to computing spline functions, the fundamental tools for fitting curves and surfaces in computer-aided deisgn (CAD) and computer graphics.

Fuzzy social choice theory is useful for modeling the uncertainty and imprecision prevalent in social life yet it has been scarcely applied and studied in the social sciences. Filling this gap, Application of Fuzzy Logic to Social Choice Theory provides a comprehensive study of fuzzy social choice theory. The book explains the concept of a fuzzy maximal subset of a set of alternatives, fuzzy choice functions, the factorization of a fuzzy preference relation into the "union" (conorm) of a strict fuzzy relation and an indifference operator, fuzzy non-Arrowian results, fuzzy versions of Arrow's theorem, and Black's median voter theorem for fuzzy preferences. It examines how unambiguous and exact choices are generated by fuzzy preferences and whether exact choices induced by fuzzy preferences satisfy certain plausible rationality relations. The authors also extend known Arrowian results involving fuzzy set theory to results involving intuitionistic fuzzy sets as well as the Gibbard-Satterthwaite theorem to the case of fuzzy weak preference relations. The final chapter discusses Georgescu's degree of similarity of two fuzzy choice functions.

Intellectual property owners must continually exploit new ways of reproducing, distributing, and marketing their products. However, the threat of piracy looms as a major problem with digital distribution and storage technologies. Multimedia Encryption and Authentication Techniques and Applications covers current and future trends in the design of modern systems that use encryption and authentication to protect multimedia content. Containing the works of contributing authors who are worldwide experts in their fields, this volume is intended for researchers and practitioners, as well as for those who want a broad understanding of multimedia security. In the wake of the explosive growth of digital entertainment and Internet applications, this book is a definitive resource for scientists, researchers, programmers, engineers, business managers, entrepreneurs, and investors. Features Describes and evaluates the state of the art in multimedia encryption and authentication techniques and related technologies, architectures, standards, and applications Includes advanced topics, such as chaotic encryption techniques for digital images and video, as well as streaming media encryption Focuses on digital rights management issues for video and for consumer devices Covers key management and protection for IP multimedia, digital media fingerprinting, and signature-based media authentication

Originally published in 1931. This inquiry investigates and develops John Cook Wilson's view of the province of logic. It bases the study on the posthumous collected papers Statement and Inference. The author seeks to answer questions on the nature of logic using Cook Wilson's thought. The chapters introduce and consider topics from metaphysics to grammar and from psychology to knowledge. An early conception of logic in the sciences and presenting the work of an important twentieth century philosopher, this is an engaging work.

This book addresses the argument in the history of the philosophy of science between the positivists and the anti-positivists. The author starts from a point of firm conviction that all science and philosophy must start with the given... But that the range of the given is not definite. He begins with an examination of science from the outside and then the inside, explaining his position on metaphysics and attempts to formulate the character of operational acts before a general theory of symbolism is explored. The last five chapters constitute a treatise to show that the development from one stage of symbolismto the next is inevitable, consequently that explanatory science represents the culmination of knowledge.

Originally published in 1973. This book presents a valid mode of reasoning that is different to mathematical probability. This inductive logic is investigated in terms of scientific investigation. The author presents his criteria of adequacy for analysing inductive support for hypotheses and discusses each of these criteria in depth. The chapters cover philosophical problems and paradoxes about experimental support, probability and justifiability, ending with a system of logical syntax of induction. Each section begins with a summary of its contents and there is a glossary of technical terms to aid the reader.

Originally published in 1981. This is a book for the final year undergraduate or first year graduate who intends to proceed with serious research in philosophical logic. It will be welcomed by both lecturers and students for its careful consideration of main themes ranging from Gricean accounts of meaning to two dimensional modal logic. The first part of the book is concerned with the nature of the semantic theorist's project, and particularly with the crucial concepts of meaning, truth, and semantic structure. The second and third parts deal with various constructions that are found in natural languages: names, quantifiers, definite descriptions, and modal operators. Throughout, while assuming some familiarity with philosophical logic and elementary formal logic, the text provides a clear exposition. It brings together related ideas, and in some places refines and improves upon existing accounts.

Originally published in 1966. This is a self-instructional course intended for first-year university students who have not had previous acquaintance with Logic. The book deals with "propositional" logic by the truth-table method, briefly introducing axiomatic procedures, and proceeds to the theory of the syllogism, the logic of one-place predicates, and elementary parts of the logic of many-place predicates. Revision material is provided covering the main parts of the course. The course represents from eight to twenty hours work. depending on the student's speed of work and on whether optional chapters are taken.

Originally published in 1965. This is a textbook of modern deductive logic, designed for beginners but leading further into the heart of the subject than most other books of the kind. The fields covered are the Propositional Calculus, the more elementary parts of the Predicate Calculus, and Syllogistic Logic treated from a modern point of view. In each of the systems discussed the main emphases are on Decision Procedures and Axiomatisation, and the material is presented with as much formal rigour as is compatible with clarity of exposition. The techniques used are not only described but given a theoretical justification. Proofs of Consistency, Completeness and Independence are set out in detail. The fundamental characteristics of the various systems studies, and their relations to each other are established by meta-logical proofs, which are used freely in all sections of the book. Exercises are appended to most of the chapters, and answers are provided.

Regression Analysis and Its Application: A Data-Oriented Approach answers the need for researchers and students who would like a better understanding of classical regression analysis. Useful either as a textbook or as a reference source, this book bridges the gap between the purely theoretical coverage of regression analysis and its practical application. The book presents regression analysis in the general context of data analysis. Using a teach-by-example format, it contains ten major data sets along with several smaller ones to illustrate the common characteristics of regression data and properties of statistics that are employed in regression analysis. The book covers model misspecification, residual analysis, multicollinearity, and biased regression estimators. It also focuses on data collection, model assumptions, and the interpretation of parameter estimates. Complete with an extensive bibliography, Regression Analysis and Its Application is suitable for statisticians, graduate and upper-level undergraduate students, and research scientists in biometry, business, ecology, economics, education, engineering, mathematics, physical sciences, psychology, and sociology. In addition, data collection agencies in the government and private sector will benefit from the book.

This book offers an original and informative view of the development of fundamental concepts of computability theory. The treatment is put into historical context, emphasizing the motivation for ideas as well as their logical and formal development. In Part I the author introduces computability theory, with chapters on the foundational crisis of mathematics in the early twentieth century, and formalism. In Part II he explains classical computability theory, with chapters on the quest for formalization, the Turing Machine, and early successes such as defining incomputable problems, c.e. (computably enumerable) sets, and developing methods for proving incomputability. In Part III he explains relative computability, with chapters on computation with external help, degrees of unsolvability, the Turing hierarchy of unsolvability, the class of degrees of unsolvability, c.e. degrees and the priority method, and the arithmetical hierarchy. Finally, in the new Part IV the author revisits the computability (Church-Turing) thesis in greater detail. He offers a systematic and detailed account of its origins, evolution, and meaning, he describes more powerful, modern versions of the thesis, and he discusses recent speculative proposals for new computing paradigms such as hypercomputing.  This is a gentle introduction from the origins of computability theory up to current research, and it will be of value as a textbook and guide for advanced undergraduate and graduate students and researchers in the domains of computability theory and theoretical computer science. This new edition is completely revised, with almost one hundred pages of new material. In particular the author applied more up-to-date, more consistent terminology, and he addressed some notational redundancies and minor errors. He developed a glossary relating to computability theory, expanded the bibliographic references with new entries, and added the new part described above and other new sections.

This textbook prepares graduate students for research in numerical analysis/computational mathematics by giving to them a mathematical framework embedded in functional analysis and focused on numerical analysis. This helps the student to move rapidly into a research program. The text covers basic results of functional analysis, approximation theory, Fourier analysis and wavelets, iteration methods for nonlinear equations, finite difference methods, Sobolev spaces and weak formulations of boundary value problems, finite element methods, elliptic variational inequalities and their numerical solution, numerical methods for solving integral equations of the second kind, and boundary integral equations for planar regions. The presentation of each topic is meant to be an introduction with certain degree of depth. Comprehensive references on a particular topic are listed at the end of each chapter for further reading and study.

Because of the relevance in solving real world problems, multivariable polynomials are playing an ever more important role in research and applications. In this third editon, a new chapter on this topic has been included and some major changes are made on two chapters from the previous edition. In addition, there are numerous minor changes throughout the entire text and new exercises are added.

Review of earlier edition:

..".the book is clearly written, quite pleasant to read, and contains a lot of important material; and the authors have done an excellent job at balancing theoretical developments, interesting examples and exercises, numerical experiments, and bibliographical references."

R. Glowinski, SIAM Review, 2003

For computer scientists, especially those in the security field, the use of chaos has been limited to the computation of a small collection of famous but unsuitable maps that offer no explanation of why chaos is relevant in the considered contexts. Discrete Dynamical Systems and Chaotic Machines: Theory and Applications shows how to make finite machines, such as computers, neural networks, and wireless sensor networks, work chaotically as defined in a rigorous mathematical framework. Taking into account that these machines must interact in the real world, the authors share their research results on the behaviors of discrete dynamical systems and their use in computer science. Covering both theoretical and practical aspects, the book presents: Key mathematical and physical ideas in chaos theory Computer science fundamentals, clearly establishing that chaos properties can be satisfied by finite state machines Concrete applications of chaotic machines in computer security, including pseudorandom number generators, hash functions, digital watermarking, and steganography Concrete applications of chaotic machines in wireless sensor networks, including secure data aggregation and video surveillance Until the authors' recent research, the practical implementation of the mathematical theory of chaos on finite machines raised several issues. This self-contained book illustrates how chaos theory enables the study of computer security problems, such as steganalysis, that otherwise could not be tackled. It also explains how the theory reinforces existing cryptographically secure tools and schemes.

This introduction to mathematical logic takes Goedel's incompleteness theorem as a starting point. It goes beyond a standard text book and should interest everyone from mathematicians to philosophers and general readers who wish to understand the foundations and limitations of modern mathematics.

Wearing Gauss's Jersey focuses on "Gauss problems," problems that can be very tedious and time consuming when tackled in a traditional, straightforward way but if approached in a more insightful fashion, can yield the solution much more easily and elegantly. The book shows how mathematical problem solving can be fun and how students can improve their mathematical insight, regardless of their initial level of knowledge. Illustrating the underlying unity in mathematics, it also explores how problems seemingly unrelated on the surface are actually extremely connected to each other. Each chapter starts with easy problems that demonstrate the simple insight/mathematical tools necessary to solve problems more efficiently. The text then uses these simple tools to solve more difficult problems, such as Olympiad-level problems, and develop more complex mathematical tools. The longest chapters investigate combinatorics as well as sequences and series, which are some of the most well-known Gauss problems. These topics would be very tedious to handle in a straightforward way but the book shows that there are easier ways of tackling them.

Presents Results from a Very Active Area of Research Exploring an active area of mathematics that studies the complexity of equivalence relations and classification problems, Invariant Descriptive Set Theory presents an introduction to the basic concepts, methods, and results of this theory. It brings together techniques from various areas of mathematics, such as algebra, topology, and logic, which have diverse applications to other fields. After reviewing classical and effective descriptive set theory, the text studies Polish groups and their actions. It then covers Borel reducibility results on Borel, orbit, and general definable equivalence relations. The author also provides proofs for numerous fundamental results, such as the Glimm-Effros dichotomy, the Burgess trichotomy theorem, and the Hjorth turbulence theorem. The next part describes connections with the countable model theory of infinitary logic, along with Scott analysis and the isomorphism relation on natural classes of countable models, such as graphs, trees, and groups. The book concludes with applications to classification problems and many benchmark equivalence relations. By illustrating the relevance of invariant descriptive set theory to other fields of mathematics, this self-contained book encourages readers to further explore this very active area of research.

Researchers and practitioners of cryptography and information security are constantly challenged to respond to new attacks and threats to information systems. Authentication Codes and Combinatorial Designs presents new findings and original work on perfect authentication codes characterized in terms of combinatorial designs, namely strong partially balanced designs (SPBD). Beginning with examples illustrating the concepts of authentication schemes and combinatorial designs, the book considers the probability of successful deceptions followed by schemes involving three and four participants, respectively. From this point, the author constructs the perfect authentication schemes and explores encoding rules for such schemes in some special cases. Using rational normal curves in projective spaces over finite fields, the author constructs a new family of SPBD. He then presents some established combinatorial designs that can be used to construct perfect schemes, such as t-designs, orthogonal arrays of index unity, and designs constructed by finite geometry. The book concludes by studying definitions of perfect secrecy, properties of perfectly secure schemes, and constructions of perfect secrecy schemes with and without authentication. Supplying an appendix of construction schemes for authentication and secrecy schemes, Authentication Codes and Combinatorial Designs points to new applications of combinatorial designs in cryptography.

Boolean algebras have historically played a special role in the development of the theory of general or "universal" algebraic systems, providing important links between algebra and analysis, set theory, mathematical logic, and computer science. It is not surprising then that focusing on specific properties of Boolean algebras has lead to new directions in universal algebra. In the first unified study of polynomial completeness, Polynomial Completeness in Algebraic Systems focuses on and systematically extends another specific property of Boolean algebras: the property of affine completeness. The authors present full proof that all affine complete varieties are congruence distributive and that they are finitely generated if and only if they can be presented using only a finite number of basic operations. In addition to these important findings, the authors describe the different relationships between the properties of lattices of equivalence relations and the systems of functions compatible with them. An introductory chapter surveys the appropriate background material, exercises in each chapter allow readers to test their understanding, and open problems offer new research possibilities. Thus Polynomial Completeness in Algebraic Systems constitutes an accessible, coherent presentation of this rich topic valuable to both researchers and graduate students in general algebraic systems.