LEADER 05478nam 22006735 450 001 996466269303316 005 20200630172239.0 010 $a3-540-48442-6 024 7 $a10.1007/3-540-58140-5 035 $a(CKB)1000000000234126 035 $a(SSID)ssj0000324536 035 $a(PQKBManifestationID)11234388 035 $a(PQKBTitleCode)TC0000324536 035 $a(PQKBWorkID)10314207 035 $a(PQKB)11463724 035 $a(DE-He213)978-3-540-48442-4 035 $a(PPN)155181408 035 $a(EXLCZ)991000000000234126 100 $a20121227d1994 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aLogical Foundations of Computer Science$b[electronic resource] $eThird International Symposium, LFCS '94, St. Petersburg, Russia, July 11-14, 1994. Proceedings /$fedited by Anil Nerode, Yu.V. Matiyasevich 205 $a1st ed. 1994. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d1994. 215 $a1 online resource (XI, 397 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v813 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-58140-5 327 $aLower bounds for probabilistic space complexity: Communication-automata approach -- On model checking infinite-state systems -- Concurrency problem for Horn fragment of Girard's Linear Logic -- Referential data structures and labeled modal logic -- Yet another correctness criterion for Multiplicative Linear Logic with MIX -- An approach to effective model-checking of real-time Finite-State Machines in mu-calculus -- Allegories of circuits -- The complexity of propositional modal theories and the complexity of consistency of propositional modal theories -- Multiplicative Linear Logic for resource transformation nets -- The parameterized complexity of some problems in logic and linguistics -- Foundations of proof search strategies design in linear logic -- On extreme points of convex compact turing located set -- Application of typed lambda calculi in the untyped lambda calculus -- Classes with pairwise equivalent enumerations -- Strong normalization in a non-deterministic typed lambda-calculus -- On expressive completeness of modal logic -- Comparing models of the non-extensional typed ?-calculus extended abstract -- Coalgebras and approximation -- Computational and concurrency models of linear logic -- The longest perpetual reductions in Orthogonal Expression Reduction Systems -- The notion of rank and games -- A predicate logic of well-founded actions -- Predicative recurrence in finite types -- Arity vs. alternation in second order logic -- Hereditarily sequential functionals -- Propositional linear temporal logic and language homomorphisms -- An abstract property of confluence applied to the study of the lazy partial lambda calculus -- On specialization of derivations in axiomatic equality theories -- Preserving of admissible inference rules in modal logic -- Pure Type Systems with definitions -- Craig interpolation property in modal logics with provability interpretation -- Representing null values in logic programming -- Comparing cubes -- A logic of capabilities -- Weak orthogonality implies confluence: The higher-order case. 330 $aThis volume presents the refereed papers accepted for the international symposium Logical Foundations of Computer Science '94, Logic at St. Petersburg, held in St. Petersburg, Russia in July 1994. The symposium was the third in a series of joint efforts of logicians from both the former Soviet Union and the West. The volume reflects that the interaction of logic and computer science is an especially fertile ground for interdisciplinary work providing mutual understanding and benefits. The totally 35 papers are devoted to topics as linear logic, Horn clauses, model-checking, lambda-calculi, modal logic, and problem complexity. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v813 606 $aComputers 606 $aMathematical logic 606 $aComputer logic 606 $aAlgorithms 606 $aTheory of Computation$3https://scigraph.springernature.com/ontologies/product-market-codes/I16005 606 $aMathematical Logic and Foundations$3https://scigraph.springernature.com/ontologies/product-market-codes/M24005 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 $aAlgorithm Analysis and Problem Complexity$3https://scigraph.springernature.com/ontologies/product-market-codes/I16021 615 0$aComputers. 615 0$aMathematical logic. 615 0$aComputer logic. 615 0$aAlgorithms. 615 14$aTheory of Computation. 615 24$aMathematical Logic and Foundations. 615 24$aMathematical Logic and Formal Languages. 615 24$aLogics and Meanings of Programs. 615 24$aAlgorithm Analysis and Problem Complexity. 676 $a004/.01/5113 702 $aNerode$b Anil$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aMatiyasevich$b Yu.V$4edt$4http://id.loc.gov/vocabulary/relators/edt 906 $aBOOK 912 $a996466269303316 996 $aLogical Foundations of Computer Science$9772536 997 $aUNISA