Heyting Algebras

This book presents an English translation of a classic Russian text on duality theory for Heyting algebras. Written by Georgian mathematician Leo Esakia, the text proved popular among Russian-speaking logicians. This translation helps make the ideas accessible to a wider audience and pays tribute to an influential mind in mathematical logic. The book discusses the theory of Heyting algebras and closure algebras, as well as the corresponding intuitionistic and modal logics. The author introduces the key notion of a hybrid that “crossbreeds” topology (Stone spaces) and order (Kripke frames), resulting in the structures now known as Esakia spaces. The main theorems include a duality between the categories of closure algebras and of hybrids, and a duality between the categories of Heyting algebras and of so-called strict hybrids. Esakia’s book was originally published in 1985. It was the first of a planned two-volume monograph on Heyting algebras. But after the collapse of the Soviet Union, the publishing house closed and the project died with it. Fortunately, this important work now lives on in this accessible translation. The Appendix of the book discusses the planned contents of the lost second volume.

This volume composed of twenty four research articles which are selected from the keynote speakers and invited lectures presented in the 3rd International Congress in Algebra and Combinatorics (ICAC2017) held on 25-28 August 2017 in Hong Kong and one additional invited article. This congress was specially dedicated to Professor Leonid Bokut on the occasion of his 80th birthday.

This book is an introduction to a functorial model theory based on infinitary language categories. The author introduces the properties and foundation of these categories before developing a model theory for functors starting with a countable fragment of an infinitary language. He also presents a new technique for generating generic models with categories by inventing infinite language categories and functorial model theory. In addition, the book covers string models, limit models, and functorial models.

This book constitutes the proceedings of the Third International Conference on Algebra and Coalgebra in Computer Science, CALCO 2009, formed in 2005 by joining CMCS and WADT. This year the conference was held in Udine, Italy, September 7-10, 2009. The 23 full papers were carefully reviewed and selected from 42 submissions. They are presented together with four invited talks and workshop papers from the CALCO-tools Workshop. The conference was divided into the following sessions: algebraic effects and recursive equations, theory of coalgebra, coinduction, bisimulation, stone duality, game theory, graph transformation, and software development techniques.

"The text can serve as an introduction to fundamentals in the respective areas from a residuated-maps perspective and with an eye on coordinatization. The historical notes that are interspersed are also worth mentioning....The exposition is thorough and all proofs that the reviewer checked were highly polished....Overall, the book is a well-done introduction from a distinct point of view and with exposure to the author’s research expertise." --MATHEMATICAL REVIEWS

Covers key rough computing research, surveying a full range of topics and examining defining issues of the field.

This volume honors Professor Andrzej Grzegorczyk, the nestor of Polish logicians, on his 85th anniversary. The editors would like to express the respect and sympathy they have for him. His textbook The Outline of Mathematical Logic has been published in many editions and translated into several languages. It was this textbook that introduced many of us into the world of mathematical logic. Professor Grzegorczyk has made fundamental contributions to logic and to philosophy. His results, mainly on hierarchy of primitive recursive functions, known as the Grzegorczyk hierarchy, are of fundamental importance to theoretical computer science. In particular, they were precursory for the computational complexity theory. The editors would like to stress that this special publication celebrates a scientist who is still actively pursuing genuinely innovative directions of research. Quite recently, Andrzej Grzegorczyk gave a new proof of undecidability of the first order functional calculus. His proof does not use the arithmetization of Kurt Gödel. In recognition of his merits, the University of Clermont-Ferrand conferred to Professor Andrzej Grzegorczyk the Doctorat Honoris Causa. The work and life of Professor Andrzej Grzegorczyk is presented in the article by Professors Stanislaw Krajewski and Jan Wolenski. The papers in this collection have been submitted on invitational basis.

This book offers a concise introduction to both proof-theory and algebraic methods, the core of the syntactic and semantic study of logic respectively. The importance of combining these two has been increasingly recognized in recent years. It highlights the contrasts between the deep, concrete results using the former and the general, abstract ones using the latter. Covering modal logics, many-valued logics, superintuitionistic and substructural logics, together with their algebraic semantics, the book also provides an introduction to nonclassical logic for undergraduate or graduate level courses.The book is divided into two parts: Proof Theory in Part I and Algebra in Logic in Part II. Part I presents sequent systems and discusses cut elimination and its applications in detail. It also provides simplified proof of cut elimination, making the topic more accessible. The last chapter of Part I is devoted to clarification of the classes of logics that are discussed in the second part. Part II focuses on algebraic semantics for these logics. At the same time, it is a gentle introduction to the basics of algebraic logic and universal algebra with many examples of their applications in logic. Part II can be read independently of Part I, with only minimum knowledge required, and as such is suitable as a textbook for short introductory courses on algebra in logic.

This book is an example of fruitful interaction between (non-classical) propo sitionallogics and (classical) model theory which was made possible due to categorical logic. Its main aim consists in investigating the existence of model completions for equational theories arising from propositional logics (such as the theory of Heyting algebras and various kinds of theories related to proposi tional modal logic ). The existence of model-completions turns out to be related to proof-theoretic facts concerning interpretability of second order propositional logic into ordinary propositional logic through the so-called 'Pitts' quantifiers' or 'bisimulation quantifiers'. On the other hand, the book develops a large number of topics concerning the categorical structure of finitely presented al gebras, with related applications to propositional logics, both standard (like Beth's theorems) and new (like effectiveness of internal equivalence relations, projectivity and definability of dual connectives such as difference). A special emphasis is put on sheaf representation, showing that much of the nice categor ical structure of finitely presented algebras is in fact only a restriction of natural structure in sheaves. Applications to the theory of classifying toposes are also covered, yielding new examples. The book has to be considered mainly as a research book, reporting recent and often completely new results in the field; we believe it can also be fruitfully used as a complementary book for graduate courses in categorical and algebraic logic, universal algebra, model theory, and non-classical logics. 1.