Logical Foundations of Computer Science
Springer Berlin (Verlag)
978-3-540-63045-6 (ISBN)
The volume presents 42 revised refereed papers carefully selected by the program committee. All current issues of computer science logic are addressed. There is a certain emphasis on reporting the progress achieved by scientists from various parts of the former Soviet Union; but there are also many other strong papers from the international research community.
Topological semantics for hybrid systems.- Domain-free pure type systems.- Generic queries over quasi-o-minimal domains.- Towards computing distances between programs via Scott domains.- A safe recursion scheme for exponential time.- Finite model theory, universal algebra and graph grammars.- Complexity of query answering in logic databases with complex values.- Recognition of deductive data base stability.- The concurrency complexity for the Horn fragment of linear logic.- Studying algorithmic problems for free semi-groups and groups.- Learning small programs with additional information.- Cut elimination for the second order propositional logic with Hilbert's ?-symbol, extensionality, and full comprehension.- Finite bases of admissible rules for the logic S52 C.- An algebraic correctness criterion for intuitionistic proof-nets.- Towards a theory of recursive structures.- On the complexity of prefix formulas in modal logic of subset spaces.- The undecidability of second order linear affine logic.- Operational logic of proofs with functionality condition on proof predicate.- On linear ordering of strongly extensional finitely-branching graphs and non-well-founded sets.- Functions for the general solution of parametric word equations.- A proof procedure for hereditary Harrop formulas with free equality.- Basic forward chaining construction for logic programs.- Decidability and undecidability of the halting problem on Turing machines, a survey.- Case study: Additive linear logic and lattices.- Some decision problems for traces.- Existential instantiation and strong normalization.- Models for the logic of proofs.- Interpretation of the full computation tree logic CTL* on sets of infinite sequences.- Type introduction for equational rewriting.- Capturingbisimulation-invariant Ptime.- Equivalence of multiplicative fragments of cyclic linear logic and noncommutative linear logic.- A decidable fragment of second order linear logic.- Some results on Propositional Dynamic Logic with fixed points.- Quasi-characteristic inference rules for modal logics.- Provability logic with operations on proofs.- Formal verification of logic programs: Foundations and implementation.- Unification of terms with term-indexed variables.- Back-forth equivalences for design of concurrent systems.- Association nets: An alternative formalization of common thinking.- Simulating ?-expansions with ?-reductions in the second-order polymorphic ?-rcalculus.- Logical schemes for first order theories.- Verification of PLTL formulae by means of monotone disjunctive normal forms.
| Erscheint lt. Verlag | 28.5.1997 |
|---|---|
| Reihe/Serie | Lecture Notes in Computer Science |
| Zusatzinfo | IX, 436 p. |
| Verlagsort | Berlin |
| Sprache | englisch |
| Maße | 155 x 235 mm |
| Gewicht | 586 g |
| Themenwelt | Mathematik / Informatik ► Informatik ► Theorie / Studium |
| Mathematik / Informatik ► Mathematik ► Allgemeines / Lexika | |
| Mathematik / Informatik ► Mathematik ► Logik / Mengenlehre | |
| Schlagworte | bisimulation • Calculus • Complexity • Computer Science Logic • Cut-elimination theorem • Endliche Modelltheorie • Ersetzungssysteme • Finite model theory • Hardcover, Softcover / Informatik, EDV/Informatik • HC/Informatik, EDV/Informatik • Informatik • Informatik-Logik • Logic • Logical Foundations • Logische Grundlagen • Mathematische Logik • Nichtklassische Logiken • Nonclassical Logics • Proof • Rewriting Systems • Sets • Variable • verification |
| ISBN-10 | 3-540-63045-7 / 3540630457 |
| ISBN-13 | 978-3-540-63045-6 / 9783540630456 |
| Zustand | Neuware |
| Haben Sie eine Frage zum Produkt? |
aus dem Bereich
