Logical Foundations of Computer Science

by Artemov, Sergei N.; Nerode, Anil

• ISBN13: 9783540727323
• ISBN10: 3540727329
• Format: Paperback
• Copyright: 2007-07-11
• Publisher: Springer-Verlag New York Inc

Summary

This book constitutes the refereed proceedings of the International Symposium on Logical Foundations of Computer Science, LFCS 2007, held in New York, NY, USA in June 2007. The volume presents 36 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.

Table of Contents

Justified and common knowledge : limited conservativity	p. 1
The intensional Lambda calculus	p. 12
Generalized non-deterministic matrices and (n,k)-ary quantifiers	p. 26
Elementary differential calculus on discrete and hybrid structures	p. 41
Weighted distributed systems and their logics	p. 54
Weighted O-minimal hybrid systems are more decidable than weighted timed automata!	p. 69
On decidability and expressiveness of propositional interval neighborhood logics	p. 84
Reasoning about sequences of memory states	p. 100
Cut elimination in deduction modulo by abstract completion	p. 115
Density elimination and rational completeness for first-order logics	p. 132
Extracting the resolution algorithm from a completeness proof for the propositional calculus	p. 147
Topological semantics and bisimulations for intuitionistic modal logics and their classical companion logics	p. 162
A decidable temporal logic of repeating values	p. 180
Model checking knowledge and linear time : PSPACE cases	p. 195
Realizations and LP	p. 212
Successive abstractions of hybrid automata for monotonic CTL model checking	p. 224
Explicit proofs in formal provability logic	p. 241
A synthesis algorithm for hybrid systems	p. 254
Including the past in 'topologic'	p. 269
A note on rewriting proofs and Fibonacci numbers	p. 284
On complexity of Ehrenfeucht-Fraisse games	p. 293
The law of the iterated logarithm for algorithmically random Brownian motion	p. 310
Hypersequent calculus for intuitionistic logic with classical atoms	p. 318
Proof identity for classical logic : generalizing to normality	p. 332
On the constructive Dedekind reals : extended abstract	p. 349
Verifying balanced trees	p. 363
Compactness properties for stable semantics of logic programs	p. 379
Uniform circuits, & Boolean proof nets	p. 401
Finite automata presentable Abelian groups	p. 422
Embeddings into free heyting algebras and translations into intuitionistic propositional logic	p. 437
Some puzzles about probability and probabilistic conditionals	p. 449
A temporal dynamic logic for verifying hybrid system invariants	p. 457
Multiplexor categories and models of soft linear logic	p. 472
Until-since temporal logic based on parallel time with common past : deciding algorithms	p. 486
Total public announcements	p. 498
Table of Contents provided by Blackwell. All Rights Reserved.