Mathematical Foundations of Computer Science 2011

1981

This volume contains papers which were contributed for presentation at the 10th Symposium on Mathematical Foundations of Computer Science-MFCS'81, held at ~trbsk4 Pleso, Czechoslovakia, from August 31-September 4, 1981. The symposium is the tenth in the series of annual international meetings which take place alternately in Poland and Czechoslovakia.

Springer eBooks, 1996

Lecture Notes in Computer Science, 2018

The use of general descriptive names, registered names, trademarks, service marks, etc. in this publication does not imply, even in the absence of a specific statement, that such names are exempt from the relevant protective laws and regulations and therefore free for general use. The publisher, the authors and the editors are safe to assume that the advice and information in this book are believed to be true and accurate at the date of publication. Neither the publisher nor the authors or the editors give a warranty, express or implied, with respect to the material contained herein or for any errors or omissions that may have been made. The publisher remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Lecture Notes in Computer Science, 1998

Lecture Notes in Computer Science, 1988

Springer eBooks, 2008

2006

A book on ���Abstract��� or ���Modern��� Algebra is a commonplace thing in today's mathematical milieu. Even a book for well-prepared, serious beginning graduate students who intend to become research mathematicians is not so strange any longer. But, the genesis of this book, which is intended for serious, well-prepared graduate students, is somewhat strange.

Leibniz International Proceedings in Informatics, 2019

LIPIcs is a series of high-quality conference proceedings across all fields in informatics. LIPIcs volumes are published according to the principle of Open Access, i.e., they are available online and free of charge.

Lecture Notes in Mathematics -Springer-verlag-

Abstrac.t:. We 'introduce the notion of gens'Mc '8xampz'es as a unifying principle for vari ous phenomena in computer science, such as initia.i: st-Fuctures-in the area of abstrayt data types. Armstrong relations in the area ot dat~ pases. Generic examples are also useful in defining the semantics of logic progra,{IlIIliP-g, in tb,e formal theory of program te~ting and in compleXity theory. We .characterize initial structures in terms of their genericity propertjes ano: give a syntactic chara<;terization of first order theories . a.dmitting initial structures. The latter c~n 'be \,lsed to explain why Horn formuias have gained such a predominant role in various areas of computer science.