000 05306nam a22005775i 4500
001 978-3-540-69065-8
003 DE-He213
005 20240423132559.0
007 cr nn 008mamaa
008 121227s1997 gw | s |||| 0|eng d
020 _a9783540690658
_9978-3-540-69065-8
024 7 _a10.1007/3-540-63045-7
_2doi
050 4 _aQA75.5-76.95
072 7 _aUYA
_2bicssc
072 7 _aCOM014000
_2bisacsh
072 7 _aUYA
_2thema
082 0 4 _a004.0151
_223
245 1 0 _aLogical Foundations of Computer Science
_h[electronic resource] :
_b4th International Symposium, LFCS'97, Yaroslavl, Russia, July, 6 - 12, 1997, Proceedings /
_cedited by Sergei Adian, Anil Nerode.
250 _a1st ed. 1997.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c1997.
300 _aIX, 436 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v1234
505 0 _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 -- 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.
520 _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.
650 0 _aComputer science.
650 0 _aMachine theory.
650 0 _aMathematical logic.
650 1 4 _aTheory of Computation.
650 2 4 _aFormal Languages and Automata Theory.
650 2 4 _aComputer Science Logic and Foundations of Programming.
650 2 4 _aMathematical Logic and Foundations.
700 1 _aAdian, Sergei.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aNerode, Anil.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783540630456
776 0 8 _iPrinted edition:
_z9783662202043
830 0 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v1234
856 4 0 _uhttps://doi.org/10.1007/3-540-63045-7
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
912 _aZDB-2-BAE
942 _cSPRINGER
999 _c189354
_d189354