LEADER 05709nam 22006375 450 001 9910144921603321 005 20251117003621.0 010 $a3-540-69065-4 024 7 $a10.1007/3-540-63045-7 035 $a(CKB)1000000000234642 035 $a(SSID)ssj0000324537 035 $a(PQKBManifestationID)11224802 035 $a(PQKBTitleCode)TC0000324537 035 $a(PQKBWorkID)10312558 035 $a(PQKB)10620906 035 $a(DE-He213)978-3-540-69065-8 035 $a(PPN)155203967 035 $a(EXLCZ)991000000000234642 100 $a20121227d1997 u| 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aLogical Foundations of Computer Science $e4th International Symposium, LFCS'97, Yaroslavl, Russia, July, 6 - 12, 1997, Proceedings /$fedited by Sergei Adian, Anil Nerode 205 $a1st ed. 1997. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d1997. 215 $a1 online resource (IX, 436 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v1234 300 $aBibliographic Level Mode of Issuance: Monograph 311 08$a3-540-63045-7 327 $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. 330 $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. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v1234 606 $aComputers 606 $aLogic, Symbolic and mathematical 606 $aComputer logic 606 $aTheory of Computation$3https://scigraph.springernature.com/ontologies/product-market-codes/I16005 606 $aMathematical Logic and Formal Languages$3https://scigraph.springernature.com/ontologies/product-market-codes/I16048 606 $aLogics and Meanings of Programs$3https://scigraph.springernature.com/ontologies/product-market-codes/I1603X 606 $aMathematical Logic and Foundations$3https://scigraph.springernature.com/ontologies/product-market-codes/M24005 615 0$aComputers. 615 0$aLogic, Symbolic and mathematical. 615 0$aComputer logic. 615 14$aTheory of Computation. 615 24$aMathematical Logic and Formal Languages. 615 24$aLogics and Meanings of Programs. 615 24$aMathematical Logic and Foundations. 676 $a004/.01/5113 702 $aAdi?a?n$b S. I.$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aNerode$b Anil$4edt$4http://id.loc.gov/vocabulary/relators/edt 712 12$aLFCS '97 906 $aBOOK 912 $a9910144921603321 996 $aLogical Foundations of Computer Science$9772536 997 $aUNINA