Book Description
Table of contents
Author : G. Gierz
Publisher : Cambridge University Press
Page : 640 pages
File Size : 25,23 MB
Release : 2003-03-06
Category : Mathematics
ISBN : 9780521803380
Table of contents
Author : George Grätzer
Publisher : Springer
Page : 472 pages
File Size : 42,39 MB
Release : 2014-08-27
Category : Mathematics
ISBN : 3319064134
George Grätzer's Lattice Theory: Foundation is his third book on lattice theory (General Lattice Theory, 1978, second edition, 1998). In 2009, Grätzer considered updating the second edition to reflect some exciting and deep developments. He soon realized that to lay the foundation, to survey the contemporary field, to pose research problems, would require more than one volume and more than one person. So Lattice Theory: Foundation provided the foundation. Now we complete this project with Lattice Theory: Special Topics and Applications, written by a distinguished group of experts, to cover some of the vast areas not in Foundation. This first volume is divided into three parts. Part I. Topology and Lattices includes two chapters by Klaus Keimel, Jimmie Lawson and Ales Pultr, Jiri Sichler. Part II. Special Classes of Finite Lattices comprises four chapters by Gabor Czedli, George Grätzer and Joseph P. S. Kung. Part III. Congruence Lattices of Infinite Lattices and Beyond includes four chapters by Friedrich Wehrung and George Grätzer.
Author : G. Gierz
Publisher : Springer Science & Business Media
Page : 390 pages
File Size : 32,84 MB
Release : 2012-12-06
Category : Mathematics
ISBN : 3642676782
A mathematics book with six authors is perhaps a rare enough occurrence to make a reader ask how such a collaboration came about. We begin, therefore, with a few words on how we were brought to the subject over a ten-year period, during part of which time we did not all know each other. We do not intend to write here the history of continuous lattices but rather to explain our own personal involvement. History in a more proper sense is provided by the bibliography and the notes following the sections of the book, as well as by many remarks in the text. A coherent discussion of the content and motivation of the whole study is reserved for the introduction. In October of 1969 Dana Scott was lead by problems of semantics for computer languages to consider more closely partially ordered structures of function spaces. The idea of using partial orderings to correspond to spaces of partially defined functions and functionals had appeared several times earlier in recursive function theory; however, there had not been very sustained interest in structures of continuous functionals. These were the ones Scott saw that he needed. His first insight was to see that - in more modern terminology - the category of algebraic lattices and the (so-called) Scott-continuous functions is cartesian closed.
Author : A. Jung
Publisher :
Page : 122 pages
File Size : 13,83 MB
Release : 1989
Category : Closed categories (Mathematics)
ISBN :
Author : K.P. Hart
Publisher : Elsevier
Page : 537 pages
File Size : 13,79 MB
Release : 2003-11-18
Category : Mathematics
ISBN : 0080530869
This book is designed for the reader who wants to get a general view of the terminology of General Topology with minimal time and effort. The reader, whom we assume to have only a rudimentary knowledge of set theory, algebra and analysis, will be able to find what they want if they will properly use the index. However, this book contains very few proofs and the reader who wants to study more systematically will find sufficiently many references in the book.Key features:• More terms from General Topology than any other book ever published• Short and informative articles• Authors include the majority of top researchers in the field• Extensive indexing of terms
Author : Yanwen Wu
Publisher : Springer
Page : 630 pages
File Size : 36,66 MB
Release : 2011-10-22
Category : Computers
ISBN : 3642250025
This book constitutes the refereed post-proceedings of the Second International Conference on High Performance Networking, Computing, and Communication systems, ICHCC 2011, held in Singapore in May 2011. The conference was held together with the Second International Conference on Theoretical and Mathematical Foundations of Computer Science, ICTMF 2011, which proceedings are published in CCIS 164. The 84 revised selected papers presented were carefully reviewed and selected for inclusion in the book. The topics covered range from computational science, engineering and technology to digital signal processing, and computational biology to game theory, and other related topices.
Author : Diana Cristea
Publisher : Springer
Page : 355 pages
File Size : 26,41 MB
Release : 2019-06-14
Category : Computers
ISBN : 3030214621
This book constitutes the proceedings of the 15th International Conference on Formal Concept Analysis, ICFCA 2019, held in Frankfurt am Main, Germany, in June 2019. The 15 full papers and 5 short papers presented in this volume were carefully reviewed and selected from 36 submissions. The book also contains four invited contributions in full paper length. The field of Formal Concept Analysis (FCA) originated in the 1980s in Darmstadt as a subfield of mathematical order theory, with prior developments in other research groups. Its original motivation was to consider complete lattices as lattices of concepts, drawing motivation from philosophy and mathematics alike. FCA has since then developed into a wide research area with applications much beyond its original motivation, for example in logic, data mining, learning, and psychology.
Author : Jean Goubault-Larrecq
Publisher : Cambridge University Press
Page : 499 pages
File Size : 40,8 MB
Release : 2013-03-28
Category : Computers
ISBN : 1107034132
Introduces the basic concepts of topology with an emphasis on non-Hausdorff topology, which is crucial for theoretical computer science.
Author : Roy L. Crole
Publisher : Cambridge University Press
Page : 362 pages
File Size : 37,99 MB
Release : 1993
Category : Computers
ISBN : 9780521457019
This textbook explains the basic principles of categorical type theory and the techniques used to derive categorical semantics for specific type theories. It introduces the reader to ordered set theory, lattices and domains, and this material provides plenty of examples for an introduction to category theory, which covers categories, functors, natural transformations, the Yoneda lemma, cartesian closed categories, limits, adjunctions and indexed categories. Four kinds of formal system are considered in detail, namely algebraic, functional, polymorphic functional, and higher order polymorphic functional type theory. For each of these the categorical semantics are derived and results about the type systems are proved categorically. Issues of soundness and completeness are also considered. Aimed at advanced undergraduates and beginning graduates, this book will be of interest to theoretical computer scientists, logicians and mathematicians specializing in category theory.
Author : Klaus Keimel
Publisher : Springer Science & Business Media
Page : 283 pages
File Size : 44,37 MB
Release : 2012-12-06
Category : Philosophy
ISBN : 9401006547
Domain theory is a rich interdisciplinary area at the intersection of logic, computer science, and mathematics. This volume contains selected papers presented at the International Symposium on Domain Theory which took place in Shanghai in October 1999. Topics of papers range from the encounters between topology and domain theory, sober spaces, Lawson topology, real number computability and continuous functionals to fuzzy modelling, logic programming, and pi-calculi. This book is a valuable reference for researchers and students interested in this rapidly developing area of theoretical computer science.