Categories, Allegories

Categories, Allegories
Author: P.J. Freyd
Publisher: Elsevier
Total Pages: 315
Release: 1990-11-08
Genre: Mathematics
ISBN: 0080887015

General concepts and methods that occur throughout mathematics – and now also in theoretical computer science – are the subject of this book. It is a thorough introduction to Categories, emphasizing the geometric nature of the subject and explaining its connections to mathematical logic. The book should appeal to the inquisitive reader who has seen some basic topology and algebra and would like to learn and explore further.The first part contains a detailed treatment of the fundamentals of Geometric Logic, which combines four central ideas: natural transformations, sheaves, adjoint functors, and topoi. A special feature of the work is a general calculus of relations presented in the second part. This calculus offers another, often more amenable framework for concepts and methods discussed in part one. Some aspects of this approach find their origin in the relational calculi of Peirce and Schroeder from the last century, and in the 1940's in the work of Tarski and others on relational algebras. The representation theorems discussed are an original feature of this approach.

Category Theory and Computer Science

Category Theory and Computer Science
Author: Eugenio Moggi
Publisher: Springer Science & Business Media
Total Pages: 328
Release: 1997-08-20
Genre: Computers
ISBN: 9783540634553

This book constitutes the refereed proceedings of the 7th International Conference on Category Theory and Computer Science, CTCS'97, held in Santa Margheria Ligure, Italy, in September 1997. Category theory attracts interest in the theoretical computer science community because of its ability to establish connections between different areas in computer science and mathematics and to provide a few generic principles for organizing mathematical theories. This book presents a selection of 15 revised full papers together with three invited contributions. The topics addressed include reasoning principles for types, rewriting, program semantics, and structuring of logical systems.

Relational and Kleene-Algebraic Methods in Computer Science

Relational and Kleene-Algebraic Methods in Computer Science
Author: R. Berghammer
Publisher: Springer Science & Business Media
Total Pages: 291
Release: 2004-06-01
Genre: Mathematics
ISBN: 354022145X

This book constitutes the thoroughly refereed joint postproceedings of the 7th International Seminar on Relational Methods in Computer Science and the 2nd International Workshop on Applications of Kleene Algebra held in Bad Malente, Germany in May 2003. The 21 revised full papers presented were carefully selected during two rounds of reviewing and improvement. The papers address foundational and methodological aspects of the calculi of relations and Kleene algebra as well as applications of such methods in various areas of computer science and information processing.

Relations and Kleene Algebra in Computer Science

Relations and Kleene Algebra in Computer Science
Author: Rudolf Berghammer
Publisher: Springer Science & Business Media
Total Pages: 374
Release: 2009-10-05
Genre: Computers
ISBN: 364204638X

The book constitutes the joint refereed proceedings of the 11th International Conference on Relational Methods in Computer Science, RelMiCS 2009, and the 6th International Conference on Applications of Kleene Algebras, AKA 2009, held in Doha, Qatar in November 2009. The 22 revised full papers presented together with 2 invited papers were carefully reviewed and selected from numerous submissions. The papers describe the calculus of relations and similar algebraic formalisms as methodological and conceptual tools with special focus on formal methods for software engineering, logics of programs and links to neighbouring disciplines. Their scope comprises relation relation algebras and Kleene algebras, related formalisms such as process algebras, fixed point calculi, idempotent semirings, quantales, allegories, dynamic algebras, cylindric algebras and their applications in areas such as verification, analysis and development of programs and algorithms relational formal methods such as B or Z, tabular methods, algebraic approaches to logics of programs, modal and dynamic logics, interval and temporal logics, algebraic semantics of programming languages , graph theory and combinatorial optimization, games, automata and language theory, mechanised and automated reasoning, decision procedures, spatio-temporal reasoning, knowledge acquisition, preference and scaling methods or information systems.

Goguen Categories

Goguen Categories
Author: Michael Winter
Publisher: Springer Science & Business Media
Total Pages: 217
Release: 2007-08-14
Genre: Philosophy
ISBN: 1402061641

Goguen categories extend the relational calculus and its categorical formalization to the fuzzy world. Starting from the fundamental concepts of sets, binary relations and lattices, this book introduces several categorical formulations of an abstract theory of relations such as allegories, Dedekind categories and related structures. It is shown that neither theory is sufficiently rich to describe basic operations on fuzzy relations.

Relational and Algebraic Methods in Computer Science

Relational and Algebraic Methods in Computer Science
Author: Wolfram Kahl
Publisher: Springer
Total Pages: 401
Release: 2015-09-24
Genre: Mathematics
ISBN: 3319247042

This book constitutes the proceedings of the 15th International Conference on Relational and Algebraic Methods in Computer Science, RAMiCS 2015, held in Braga, Portugal, in September/October 2015. The 20 revised full papers and 3 invited papers presented were carefully selected from 25 submissions. The papers deal with the theory of relation algebras and Kleene algebras, process algebras; fixed point calculi; idempotent semirings; quantales, allegories, and dynamic algebras; cylindric algebras, and about their application in areas such as verification, analysis and development of programs and algorithms, algebraic approaches to logics of programs, modal and dynamic logics, interval and temporal logics.

Relational and Algebraic Methods in Computer Science

Relational and Algebraic Methods in Computer Science
Author: Peter Höfner
Publisher: Springer
Total Pages: 335
Release: 2017-05-08
Genre: Mathematics
ISBN: 3319574183

This book constitutes the proceedings of the 16th International Conference on Relational and Algebraic Methods in Computer Science, RAMiCS 2017, held in Lyon, France, in May 2017. The 17 revised full papers and 2 invited papers presented together with 1 invited abstract were carefully selected from 28 submissions. Topics covered range from mathematical foundations to applications as conceptual and methodological tools in computer science and beyond.

Higher Dimensional Categories: From Double To Multiple Categories

Higher Dimensional Categories: From Double To Multiple Categories
Author: Marco Grandis
Publisher: World Scientific
Total Pages: 535
Release: 2019-09-09
Genre: Mathematics
ISBN: 9811205124

The study of higher dimensional categories has mostly been developed in the globular form of 2-categories, n-categories, omega-categories and their weak versions. Here we study a different form: double categories, n-tuple categories and multiple categories, with their weak and lax versions.We want to show the advantages of this form for the theory of adjunctions and limits. Furthermore, this form is much simpler in higher dimension, starting with dimension three where weak 3-categories (also called tricategories) are already quite complicated, much more than weak or lax triple categories.This book can be used as a textbook for graduate and postgraduate studies, and as a basis for research. Notions are presented in a 'concrete' way, with examples and exercises; the latter are endowed with a solution or hints. Part I, devoted to double categories, starts at basic category theory and is kept at a relatively simple level. Part II, on multiple categories, can be used independently by a reader acquainted with 2-dimensional categories.

Cut Elimination in Categories

Cut Elimination in Categories
Author: K. Dosen
Publisher: Springer Science & Business Media
Total Pages: 240
Release: 2013-04-18
Genre: Philosophy
ISBN: 9401712077

Proof theory and category theory were first drawn together by Lambek some 30 years ago but, until now, the most fundamental notions of category theory (as opposed to their embodiments in logic) have not been explained systematically in terms of proof theory. Here it is shown that these notions, in particular the notion of adjunction, can be formulated in such as way as to be characterised by composition elimination. Among the benefits of these composition-free formulations are syntactical and simple model-theoretical, geometrical decision procedures for the commuting of diagrams of arrows. Composition elimination, in the form of Gentzen's cut elimination, takes in categories, and techniques inspired by Gentzen are shown to work even better in a purely categorical context than in logic. An acquaintance with the basic ideas of general proof theory is relied on only for the sake of motivation, however, and the treatment of matters related to categories is also in general self contained. Besides familiar topics, presented in a novel, simple way, the monograph also contains new results. It can be used as an introductory text in categorical proof theory.