05085nam a22005655i 4500001001800000003000900018005001700027007001500044008004100059020003700100024003100137050001700168072001500185072001600200072002300216072002300239082001700262245019600279264006100475300003300536336002600569337002600595338003600621347002400657490005800681505262900739520054303368650002203911650001503933650002003948650002403968650002203992650002704014650004504041650003704086650004004123700002804163700002704191710003404218773002004252776003604272830005804308856004404366912001404410912001404424912001404438942001204452950003804464999001704502978-3-540-69065-8DE-He21320170515111447.0cr nn 008mamaa121227s1997 gw | s |||| 0|eng d a97835406906589978-3-540-69065-87 a10.1007/3-540-63045-72doi 4aQA75.5-76.95 7aUY2bicssc 7aUYA2bicssc 7aCOM0140002bisacsh 7aCOM0310002bisacsh04a004.015122310aLogical Foundations of Computer Scienceh[electronic resource] :b4th International Symposium, LFCS'97 Yaroslavl, Russia, July 6–12, 1997 Proceedings /cedited by Sergei Adian, Anil Nerode. 1aBerlin, Heidelberg :bSpringer Berlin Heidelberg,c1997. aIX, 436 p.bonline resource. atextbtxt2rdacontent acomputerbc2rdamedia aonline resourcebcr2rdacarrier atext filebPDF2rda1 aLecture Notes in Computer Science,x0302-9743 ;v12340 aTopological 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. aThis 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 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. 0aComputer science. 0aComputers. 0aComputer logic. 0aMathematical logic.14aComputer Science.24aTheory of Computation.24aMathematical Logic and Formal Languages.24aLogics and Meanings of Programs.24aMathematical Logic and Foundations.1 aAdian, Sergei.eeditor.1 aNerode, Anil.eeditor.2 aSpringerLink (Online service)0 tSpringer eBooks08iPrinted edition:z9783540630456 0aLecture Notes in Computer Science,x0302-9743 ;v123440uhttp://dx.doi.org/10.1007/3-540-63045-7 aZDB-2-SCS aZDB-2-LNC aZDB-2-BAE 2ddccEB aComputer Science (Springer-11645) c14311d14311