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

    • Dynamic Programming

      Sequential Scientific Management
      • 1st Edition
      • Volume 37
      • A. Kaufmann + 1 more
      • English
      This work discusses the value of dynamic programming as a method of optimization for the sequential phenomena encountered in economic studies or in advanced technological programs such as those associated with space flights. The dynamic programs which are considered are defined for a deterministic universe, or one with probabilities; both categories are of equal importance in the practice of operations research or of scientific management.

    • Probabilities and Potential, C

      Potential Theory for Discrete and Continuous Semigroups
      • 1st Edition
      • Volume 151
      • C. Dellacherie + 1 more
      • English
      This third volume of the monograph examines potential theory. The first chapter develops potential theory with respect to a single kernel (or discrete time semigroup). All the essential ideas of the theory are presented: excessive functions, reductions, sweeping, maximum principle. The second chapter begins with a study of the notion of reduction in the most general situation possible - the ``gambling house'' of Dubins and Savage. The beautiful results presented have never been made accessible to a wide public. These are then connected with the theory of sweeping with respect to a cone of continuous functions, and the integral representation in compact convex sets. The third chapter presents new or little-known results, with the aim of illustrating the effectiveness of capacitary methods in the most varied fields. The last two chapters are concerned with the theory of resolvents.The fourth and last part of the English edition will be devoted to the theory of Markov processes.

    • Theories of Computational Complexity

      • 1st Edition
      • Volume 35
      • C. Calude
      • English
      This volume presents four machine-independent theories of computational complexity, which have been chosen for their intrinsic importance and practical relevance. The book includes a wealth of results - classical, recent, and others which have not been published before.In developing the mathematics underlying the size, dynamic and structural complexity measures, various connections with mathematical logic, constructive topology, probability and programming theories are established. The facts are presented in detail. Extensive examples are provided, to help clarify notions and constructions. The lists of exercises and problems include routine exercises, interesting results, as well as some open problems.

    • Handbook of Logic and Language

      • 2nd Edition
      • Johan F.A.K. van Benthem + 1 more
      • English
      The logical study of language is becoming more interdisciplinary, playing a role in fields such as computer science, artificial intelligence, cognitive science and game theory. This new edition, written by the leading experts in the field, presents an overview of the latest developments at the interface of logic and linguistics as well as a historical perspective. It is divided into three parts covering Frameworks, General Topics and Descriptive Themes.

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