Logical foundations of computer science : 4th International Symposium, LFCS'97, Yaroslavl, Russia, July 6 12, 1997 : proceedings

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...

Ful tanımlama

Kaydedildi:
Detaylı Bibliyografya
Müşterek Yazar: International symposium on logical foundations of computer science :Yaroslavl, Russie
Diğer Yazarlar: Adân, Sergej Ivanovič, 1931-2020 (Yayın yönetmeni), Nerode, Anil, 1932- (Yayın yönetmeni)
Materyal Türü: Livre numérique
Dil:Anglais
Baskı/Yayın Bilgisi: Berlin [etc.] : Springer [20..].
Cham : Springer Nature
Seri Bilgileri:Lecture notes in computer science 1234
Konular:
Online Erişim:Accès sur la plateforme de l'éditeur
Accès sur la plateforme Istex
Accès Université d'Orléans
Accès INSA CVL
Not: Archives Springer e-books (Licence nationale)
Archives Springer e-books (Licence nationale)
Autres localisations: Voir dans le Sudoc
Edition sous un autre format:• Logical foundations of computer science, 4th international symposium, LFCS ±97, Yaroslavl, Russia, July 1997, proceedings, Sergei Adian, Anil Nerode (eds.), 1997, Berlin, Springer, 1 vol. (IX-429 p.), Lecture notes in computer science, 3-540-63045-7
• Logical Foundations of Computer Science, Texte imprimé, 9783662202043
LEADER 05609nam a22003977a 4500
001 944843
008 110927q2000 xxe ||| |||| 00| 0 eng d
009 PPN155203967
020 |a 9783540690658 (PFG) 
041 0 |a eng 
082 |a 004 
111 2 |a International symposium on logical foundations of computer science  |n (04  |d  :1997  |c  :Yaroslavl, Russie). 
245 1 0 |a Logical foundations of computer science :  |b 4th International Symposium, LFCS'97, Yaroslavl, Russia, July 6 12, 1997 : proceedings   |c [edited by] Sergei Adian, Anil Nerode. 
260 |a Berlin [etc.] :  |b Springer. 
260 |a Cham :  |b Springer Nature,  |c [20..]. 
490 0 |a Lecture notes in computer science  |v 1234  |x 1611-3349 
500 |a Archives Springer e-books (Licence nationale) 
500 |a Archives Springer e-books (Licence nationale) 
505 0 |a 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 -- 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. 
506 |a Accès en ligne pour les établissements français bénéficiaires des licences nationales 
506 |a Accès soumis à abonnement pour tout autre établissement 
506 |a Conditions particulières de réutilisation pour les bénéficiaires des licences nationales. https://www.licencesnationales.fr/springer-nature-ebooks-contrat-licence-ln-2017 
520 |a 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 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 |a Informatique 
650 |a Logique symbolique et mathématique 
650 |a Ordinateurs 
650 |a Actes de congrès 
700 1 |a Adân, Sergej Ivanovič,  |d 1931-2020.  |4 pbd 
700 1 |a Nerode, Anil,  |d 1932-  |4 pbd 
776 0 |0 030042054  |t Logical foundations of computer science  |o 4th international symposium, LFCS ±97, Yaroslavl, Russia, July 1997  |o proceedings  |f Sergei Adian, Anil Nerode (eds.)  |d 1997  |c Berlin  |n Springer  |p 1 vol. (IX-429 p.)  |s Lecture notes in computer science  |z 3-540-63045-7 
776 0 |t Logical Foundations of Computer Science  |b Texte imprimé  |z 9783662202043 
856 4 |q PDF  |u https://doi.org/10.1007/3-540-63045-7  |z Accès sur la plateforme de l'éditeur 
856 4 |u https://revue-sommaire.istex.fr/ark:/67375/8Q1-L9QK615B-W  |z Accès sur la plateforme Istex 
856 4 |5 452349901:747915970  |u https://ezproxy.univ-orleans.fr/login?url=https://doi.org/10.1007/3-540-63045-7  |z Accès Université d'Orléans 
856 4 |5 180339901:750928611  |u https://ezproxy.insa-cvl.fr/login?qurl=https://doi.org/10.1007/3-540-63045-7  |z Accès INSA CVL 
997 |0 944843  |1 Livre numérique  |a Ressource numérique  |b INSA  |b ENSA  |c 0/Bibliothèque numérique/  |c 1/Bibliothèque numérique/Autre ressource numérique/