Logical Foundations of Computer Science

53.49 €

Order
Logical Foundations of Computer Science
This book constitutes the refereed proceedings of the International Symposium on Logical Foundations of Computer Science, LFCS 2009, held in Deerfield Beach, Florida, USA in January 2008. The volume presents 31 revised refereed papers carefully selected by the program committee. All current aspects of logic in computer science are addressed, including constructive mathematics and type theory, logical foundations of programming, logical aspects of computational complexity, logic programming and constraints, automated deduction and interactive theorem proving, logical methods in protocol and program verification and in program specification and extraction, domain theory logics, logical foundations of database theory, equational logic and term rewriting, lambda and combinatory calculi, categorical logic and topological semantics, linear logic, epistemic and temporal logics, intelligent and multiple agent system logics, logics of proof and justification, nonmonotonic reasoning, logic in game theory and social software, logic of hybrid systems, distributed system logics, system design logics, as well as other logics in computer science.

More from the series "Lecture Notes in Computer Science"

More from the series "Theoretical Computer Science and General Issues"

Log in to get access to this book and to automatically save your books and your progress.

Purchase this book or upgrade to dav Pro to read this book.

When you buy this book, you can access it regardless of your plan. You can also download the book file and read it in another app or on an Ebook reader.

80 % of the price goes directly to the author.

ISBN: 9783540926863

Language: English

Publication date: 18.12.2008

Number of pages: 469

Our shipping costs are a flat rate of €2.50, regardless of the order.
Currently, we only ship within Germany.

Shipping is free for PocketLib Pro users.

An error occured. Please check your internet connection or try it again later.