Kategoria BISAC: Mathematics >> Logic

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...

This book argues that languages are composed of sets of signs, rather than strings . This notion, first posited by de Saussure in the early 20^th century, has for decades been neglected by linguists, particularly following Chomsky s heavy critiques of the 1950s. Yet since the emergence of formal semantics in the 1970s, the issue of compositionality has gained traction in the theoretical debate, becoming a selling point for linguistic theories.

Yet the concept of compositionality itself remains ill-defined, an issue this book addresses. Positioning compositionality as a...

This book is about philosophy, mathematics and logic, giving a philosophical account of Pluralism which is a family of positions in the philosophy of mathematics. There are four parts to this book, beginning with a look at motivations for Pluralism by way of Realism, Maddy's Naturalism, Shapiro's Structuralism and Formalism.

In the second part of this book the author covers: the philosophical presentation of Pluralism; using a formal theory of logic metaphorically; rigour and proof for the Pluralist; and mathematical fixtures. In the third part the author goes on to focus on the...

The focus of this book is on bridging the gap between two extreme methods for developing software. On the one hand, there are texts and approaches that are so formal that they scare off all but the most dedicated theoretical computer scientists. On the other, there are some who believe that any measure of formality is a waste of time, resulting in software that is developed by following gut feelings and intuitions.

Kourie and Watson advocate an approach known as "correctness-by-construction," a technique to derive algorithms that relies on formal theory, but that requires such theory...

Discrete mathematics, including (combinatorial) number theory and set theory has always been a stronghold of Hungarian mathematics. The present volume honouring Vera Sos and Andras Hajnal contains survey articles (with classical theorems and state-of-the-art results) and cutting edge expository research papers with new theorems and proofs in the area of the classical Hungarian subjects, like extremal combinatorics, colorings, combinatorial number theory, etc. The open problems and the latest results in the papers inspire further research.

The volume is recommended to experienced...

The topic of this book is the following optimisation problem: given a set of discrete variables and a set of functions, each depending on a subset of the variables, minimise the sum of the functions over all variables. This fundamental research problem has been studied within several different contexts of discrete mathematics, computer science and artificial intelligence under different names: Min-Sum problems, MAP inference in Markov random fields (MRFs) and conditional random fields (CRFs), Gibbs energy minimisation, valued constraint satisfaction problems (VCSPs), and, for two-state...

M-Solid Varieties of Algebras provides a complete and systematic introduction to the fundamentals of the hyperequational theory of universal algebra, offering the newest results on M-solid varieties of semirings and semigroups. The book aims to develop the theory of M-solid varieties as a system of mathematical discourse that is applicable in several concrete situations. It applies the general theory to two classes of algebraic structures, semigroups and semirings. Both these varieties and their subvarieties play an important role in computer science.

A...

This monograph presents an application of concepts and methods from algebraic topology to models of concurrent processes in computer science and their analysis.

Taking well-known discrete models for concurrent processes in resource management as a point of departure, the book goes on to refine combinatorial and topological models. In the process, it develops tools and invariants for the new discipline directed algebraic topology, which is driven by fundamental research interests as well as by applications, primarily in the static analysis of concurrent...