In 1936 the notion of intuitive computability was operationalized in two different ways: via Turing machines and via lambda-calculus. The difference consisted i
This handbook with exercises reveals in formalisms, hitherto mainly used for hardware and software design and verification, unexpected mathematical beauty. The
Introducing Stone-Priestley duality theory and its applications to logic and theoretical computer science, this book equips graduate students and researchers wi
The revised edition contains a new chapter which provides an elegant description of the semantics. The various classes of lambda calculus models are described i
Chapter “ABECTO: An ABox Evaluation and Comparison Tool for Ontologies” is available open access under a Creative Commons Attribution 4.0 International Lice