The theory presented in this book is developed constructively, is based on a few axioms encapsulating the notion of objects (points and sets) being apart, and encompasses both point-set topology and the theory of uniform spaces. While the classical-logic-based theory of proximity spaces provides some guidance for the theory of apartness, the notion of nearness/proximity does not embody enough algorithmic information for a deep constructive development. The use of constructive (intuitionistic) logic in this book requires much more technical ingenuity than one finds in classical proximity theory -- algorithmic information does not come cheaply -- but it often reveals distinctions that are rendered invisible by classical logic. In the first chapter the authors outline informal constructive logic and set theory, and, briefly, the basic notions and notations for metric and topological spaces. In the second they introduce axioms for a point-set apartness and then explore some of the consequences of those axioms. In particular, they examine a natural topology associated with an apartness space, and relations between various types of continuity of mappings. In the third chapter the authors extend the notion of point-set (pre-)apartness axiomatically to one of (pre-)apartness between subsets of an inhabited set. They then provide axioms for a quasiuniform space, perhaps the most important type of set-set apartness space. Quasiuniform spaces play a major role in the remainder of the chapter, which covers such topics as the connection between uniform and strong continuity (arguably the most technically difficult part of the book), apartness and convergence in function spaces, types of completeness, and neat compactness. Each chapter has a Notes section, in which are found comments on the definitions, results, and proofs, as well as occasional pointers to future work. The book ends with a Postlude that refers to other constructive approaches to topology, with emphasis on the relation between apartness spaces and formal topology. Largely an exposition of the authors' own research, this is the first book dealing with the apartness approach to constructive topology, and is a valuable addition to the literature on constructive mathematics and on topology in computer science. It is aimed at graduate students and advanced researchers in theoretical computer science, mathematics, and logic who are interested in constructive/algorithmic aspects of topology.

This anthology reviews the programmes in the foundations of mathematics from the classical period and assesses their possible relevance for contemporary philosophy of mathematics. A special section is concerned with constructive mathematics.

This book explores the latest advances in algebraic structures and applications, and focuses on mathematical concepts, methods, structures, problems, algorithms and computational methods important in the natural sciences, engineering and modern technologies. In particular, it features mathematical methods and models of non-commutative and non-associative algebras, hom-algebra structures, generalizations of differential calculus, quantum deformations of algebras, Lie algebras and their generalizations, semi-groups and groups, constructive algebra, matrix analysis and its interplay with topology, knot theory, dynamical systems, functional analysis, stochastic processes, perturbation analysis of Markov chains, and applications in network analysis, financial mathematics and engineering mathematics. The book addresses both theory and applications, which are illustrated with a wealth of ideas, proofs and examples to help readers understand the material and develop new mathematical methods and concepts of their own. The high-quality chapters share a wealth of new methods and results, review cutting-edge research and discuss open problems and directions for future research. Taken together, they offer a source of inspiration for a broad range of researchers and research students whose work involves algebraic structures and their applications, probability theory and mathematical statistics, applied mathematics, engineering mathematics and related areas.

This book constitutes the refereed proceedings of the International Symposium on Logical Foundations of Computer Science, LFCS 2016, held in Deerfield Beach, FL, USA in January 2016. The 27 revised full papers were carefully reviewed and selected from 46 submissions. The scope of the Symposium is broad and includes constructive mathematics and type theory; homotopy type theory; logic, automata, and automatic structures; computability and randomness; logical foundations of programming; logical aspects of computational complexity; parameterized complexity; logic programming and constraints; automated deduction and interactive theorem proving; logical methods in protocol and program verification; logical methods in program specification and extraction; domain theory logics; logical foundations of database theory; equational logic and term rewriting; lambda and combinatory calculi; categorical logic and topological semantics; linear logic; epistemic and temporal logics; intelligent and multiple-agent system logics; logics of proof and justification; non-monotonic reasoning; logic in game theory and social software; logic of hybrid systems; distributed system logics; mathematical fuzzy logic; system design logics; and other logics in computer science.

Constructive mathematics – mathematics in which 'there exists' always means 'we can construct' – is enjoying a renaissance. fifty years on from Bishop's groundbreaking account of constructive analysis, constructive mathematics has spread out to touch almost all areas of mathematics and to have profound influence in theoretical computer science. This handbook gives the most complete overview of modern constructive mathematics, with contributions from leading specialists surveying the subject's myriad aspects. Major themes include: constructive algebra and geometry, constructive analysis, constructive topology, constructive logic and foundations of mathematics, and computational aspects of constructive mathematics. A series of introductory chapters provides graduate students and other newcomers to the subject with foundations for the surveys that follow. Edited by four of the most eminent experts in the field, this is an indispensable reference for constructive mathematicians and a fascinating vista of modern constructivism for the increasing number of researchers interested in constructive approaches.

This book carries forward recent work on visual patterns and structures in digital images and introduces a near set-based a topology of digital images. Visual patterns arise naturally in digital images viewed as sets of non-abstract points endowed with some form of proximity (nearness) relation. Proximity relations make it possible to construct uniform topologies on the sets of points that constitute a digital image. In keeping with an interest in gaining an understanding of digital images themselves as a rich source of patterns, this book introduces the basics of digital images from a computer vision perspective. In parallel with a computer vision perspective on digital images, this book also introduces the basics of proximity spaces. Not only the traditional view of spatial proximity relations but also the more recent descriptive proximity relations are considered. The beauty of the descriptive proximity approach is that it is possible to discover visual set patterns among sets that are non-overlapping and non-adjacent spatially. By combining the spatial proximity and descriptive proximity approaches, the search for salient visual patterns in digital images is enriched, deepened and broadened. A generous provision of Matlab and Mathematica scripts are used in this book to lay bare the fabric and essential features of digital images for those who are interested in finding visual patterns in images. The combination of computer vision techniques and topological methods lead to a deep understanding of images.