Skip to main content
Elsevier
View Cart

Books in Theory and mathematics

Our portfolio includes foundational theories, algorithms, formal methods, and computational complexity. Featuring rigorous research, mathematical frameworks, and practical applications, these titles support theorists, mathematicians, and computer scientists in advancing the theoretical underpinnings of computing. Addressing emerging areas like quantum algorithms and formal verification, the collection fuels innovation and scientific discovery.

BooksJournals

    • Provability, Computability and Reflection

      • 1st Edition
      • Volume 20
      • Lev D. Beklemishev
      • English
      Studies in Logic publishes monographs and occasionally edited volumes in the area of mathematical logic and its applications.

    • Soft Computing and Intelligent Systems

      Theory and Applications
      • 1st Edition
      • Madan M. Gupta
      • Naresh K. Sinha
      • English
      The field of soft computing is emerging from the cutting edge research over the last ten years devoted to fuzzy engineering and genetic algorithms. The subject is being called soft computing and computational intelligence. With acceptance of the research fundamentals in these important areas, the field is expanding into direct applications through engineering and systems science.This book cover the fundamentals of this emerging filed, as well as direct applications and case studies. There is a need for practicing engineers, computer scientists, and system scientists to directly apply "fuzzy" engineering into a wide array of devices and systems.

    • Handbook of Computability Theory

      • 1st Edition
      • Volume 140
      • E.R. Griffor
      • English
      The chapters of this volume all have their own level of presentation. The topics have been chosen based on the active research interest associated with them. Since the interest in some topics is older than that in others, some presentations contain fundamental definitions and basic results while others relate very little of the elementary theory behind them and aim directly toward an exposition of advanced results. Presentations of the latter sort are in some cases restricted to a short survey of recent results (due to the complexity of the methods and proofs themselves). Hence the variation in level of presentation from chapter to chapter only reflects the conceptual situation itself. One example of this is the collective efforts to develop an acceptable theory of computation on the real numbers. The last two decades has seen at least two new definitions of effective operations on the real numbers.

    • Compression Algorithms for Real Programmers

      • 1st Edition
      • Peter Wayner
      • English
      In life, time is money, and on the Internet, the size of data is money. Small programs and small files take less disk space and cost less to send over the Internet. Compression Algorithms for Real Programmers describes the basic algorithms and approaches for compressing information so you can create the smallest files possible. These new algorithms are making it possible for people to take impossibly large audio and video files and compress them enough that they can flow over the Internet.

    • Admissibility of Logical Inference Rules

      • 1st Edition
      • Volume 136
      • V.V. Rybakov
      • English
      The aim of this book is to present the fundamental theoretical results concerning inference rules in deductive formal systems. Primary attention is focused on:• admissible or permissible inference rules• the derivability of the admissible inference rules• the structural completeness of logics• the bases for admissible and valid inference rules.There is particular emphasis on propositional non-standard logics (primary, superintuitionistic and modal logics) but general logical consequence relations and classical first-order theories are also considered.The book is basically self-contained and special attention has been made to present the material in a convenient manner for the reader. Proofs of results, many of which are not readily available elsewhere, are also included.The book is written at a level appropriate for first-year graduate students in mathematics or computer science. Although some knowledge of elementary logic and universal algebra are necessary, the first chapter includes all the results from universal algebra and logic that the reader needs. For graduate students in mathematics and computer science the book is an excellent textbook.

Related subjects

Analysis of algorithms and problem complexity

Computation by abstract devices

Logics and meanings of programs

Mathematical logic and formal languages

Natural computation

Quantum computing

Theory and mathematics general