Logical Foundations of Computer Science 4th International Symposium, LFCS'97, Yaroslavl, Russia, July, 6 - 12, 1997, Proceedings /

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Adian, Sergei (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt), Nerode, Anil (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 1997.
• Έκδοση: 1st ed. 1997.
• Σειρά: Lecture Notes in Computer Science, 1234
• Θέματα: Computers.; Mathematical logic.; Computer logic.; Theory of Computation.; Mathematical Logic and Formal Languages.; Logics and Meanings of Programs.; Mathematical Logic and Foundations.

This book constitutes the refereed proceedings of the 4th International Symposium on Logical Foundations of Computer Science, LFCS'97, held in Yaroslavl, Russia, in July 1997. The volume presents 42 revised refereed papers carefully selected by the program committee. All current issues of compu...

Πίνακας περιεχομένων:

• 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
• Capturing bisimulation-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.