Seems you have not registered as a member of localhost.saystem.shop!
You may have to register before you can download all our books and magazines, click the sign up button below to create a free account.
Number Theoretic And Algebraic Methods In Computer Science - Proceedings Of The International Conference
NTAMCS '93 brought to Moscow researchers from areas of computer science and mathematics that traditionally have been apart, but which use similar number theoretic and algebraic methods. An incomplete list of such areas includes cryptography, coding theory, computational algebra and number theory, and numerical analysis. The papers in this volume emphasise the common principles and the essential unity of the computational and mathematical sciences.
Derivation and Computation
An introduction to simple type theory, containing 200 exercises with complete solutions.
A First Course in the Sporadic SICs
This book focuses on the Symmetric Informationally Complete quantum measurements (SICs) in dimensions 2 and 3, along with one set of SICs in dimension 8. These objects stand out in ways that have earned them the moniker of "sporadic SICs". By some standards, they are more approachable than the other known SICs, while by others they are simply atypical. The author forays into quantum information theory using them as examples, and the author explores their connections with other exceptional objects like the Leech lattice and integral octonions. The sporadic SICs take readers from the classification of finite simple groups to Bell's theorem and the discovery that "hidden variables" cannot explain away quantum uncertainty. While no one department teaches every subject to which the sporadic SICs pertain, the topic is approachable without too much background knowledge. The book includes exercises suitable for an elective at the graduate or advanced undergraduate level.
Algebraic Combinatorics
Algebraic combinatorics is the study of combinatorial objects as an extension of the study of finite permutation groups, or, in other words, group theory without groups. In the spirit of Delsarte's theory, this book studies combinatorial objects such as graphs, codes, designs, etc. in the general framework of association schemes, providing a comprehensive overview of the theory as well as pointing out to extensions.
Basic Simple Type Theory
Type theory is one of the most important tools in the design of higher-level programming languages, such as ML. This book introduces and teaches its techniques by focusing on one particularly neat system and studying it in detail. By concentrating on the principles that make the theory work in practice, the author covers all the key ideas without getting involved in the complications of more advanced systems. This book takes a type-assignment approach to type theory, and the system considered is the simplest polymorphic one. The author covers all the basic ideas, including the system's relation to propositional logic, and gives a careful treatment of the type-checking algorithm that lies at the heart of every such system. Also featured are two other interesting algorithms that until now have been buried in inaccessible technical literature. The mathematical presentation is rigorous but clear, making it the first book at this level that can be used as an introduction to type theory for computer scientists.
Basic Proof Theory
This introduction to the basic ideas of structural proof theory contains a thorough discussion and comparison of various types of formalization of first-order logic. Examples are given of several areas of application, namely: the metamathematics of pure first-order logic (intuitionistic as well as classical); the theory of logic programming; category theory; modal logic; linear logic; first-order arithmetic and second-order logic. In each case the aim is to illustrate the methods in relatively simple situations and then apply them elsewhere in much more complex settings. There are numerous exercises throughout the text. In general, the only prerequisite is a standard course in first-order logic, making the book ideal for graduate students and beginning researchers in mathematical logic, theoretical computer science and artificial intelligence. For the new edition, many sections have been rewritten to improve clarity, new sections have been added on cut elimination, and solutions to selected exercises have been included.
Algebraic, Extremal and Metric Combinatorics 1986
This book represents a comprehensive overview of the present state of progress in three related areas of combinatorics. It comprises selected papers from a conference held at the University of Montreal. Topics covered in the articles include association schemes, extremal problems, combinatorial geometrics and matroids, and designs. All the papers contain new results and many are extensive surveys of particular areas of research. Particularly valuable will be Ivanov's paper on recent Soviet research in these areas. Consequently this volume will be of great attraction to all researchers in combinatorics and to research students requiring a rapid introduction to some of the open problems in the subject.
Concurrency Verification
An advanced 2001 textbook on verification of concurrent programs using a semantic approach which highlights concepts clearly.
Modal Logic
This is an advanced 2001 textbook on modal logic, a field which caught the attention of computer scientists in the late 1970s. Researchers in areas ranging from economics to computational linguistics have since realised its worth. The book is for novices and for more experienced readers, with two distinct tracks clearly signposted at the start of each chapter. The development is mathematical; prior acquaintance with first-order logic and its semantics is assumed, and familiarity with the basic mathematical notions of set theory is required. The authors focus on the use of modal languages as tools to analyze the properties of relational structures, including their algorithmic and algebraic aspects, and applications to issues in logic and computer science such as completeness, computability and complexity are considered. Three appendices supply basic background information and numerous exercises are provided. Ideal for anyone wanting to learn modern modal logic.
