Logical foundations of computer science - Tver '92 : second international symposium, Tver, Russia, July 20-24, 1992 proceedings
This volume presents the papers selected for the Symposium Logic at Tver '92, held at Sokol, near Tver, Russia in July 1992. It is the second in a series of international symposia on logical foundations of computer science held in Russia. The meeting is a joint effort of scholars from both the...
Zapisane w:
| Korporacja: | |
|---|---|
| Kolejni autorzy: | , |
| Format: | Livre numérique |
| Język: | Anglais |
| Wydane: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Seria: | Lecture notes in computer science
620 |
| Hasła przedmiotowe: | |
| Dostęp online: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Komentarz: |
Actes d'un symposium tenu à Tver du 20 au 24 juillet 1992, d'après l écran-titre 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, Tver '92, second international symposium, Tver, Russia, July 20-24, 1992 proceedings, A. Nerode, M. Taitslin (eds.), Berlin, Springer-Verlag, 1992, 1 vol. (ix, 514 p.), Lecture notes in computer science, 3-540-55707-5 • Logical Foundations of Computer Science - Tver '92, Texte imprimé, 9783662164761 |
| LEADER | 06124nam a22004337a 4500 | ||
|---|---|---|---|
| 001 | 945454 | ||
| 008 | 110927q2000 xxe ||| |||| 00| 0 eng d | ||
| 009 | PPN155228307 | ||
| 020 | |a 9783540472766 (PDF) | ||
| 041 | 0 | |a eng | |
| 082 | |a 004 | ||
| 111 | 2 | |a International Symposium on Logical Foundations of Computer Science |n (2nd |c :Tver) |d (1992. | |
| 245 | 1 | 0 | |a Logical foundations of computer science - Tver '92 : |b second international symposium, Tver, Russia, July 20-24, 1992 proceedings |c [edited by] A. Nerode, M. Taitslin. |
| 260 | |a Berlin [etc.] : |b Springer. | ||
| 260 | |a Cham : |b Springer Nature, |c [20..]. | ||
| 490 | 0 | |a Lecture notes in computer science |v 620 |x 1611-3349 | |
| 500 | |a Actes d'un symposium tenu à Tver du 20 au 24 juillet 1992, d'après l écran-titre | ||
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 505 | 0 | |a Modal Linear Logic -- Machine learning of higher order programs -- Quantifying the amount of verboseness (extended abstract) -- Strictness logic and polymorphic invariance -- Preference logics and nonmonotonicity in logic programming -- The Ehrenfeucht-Fraïssé games for transitive closure -- Feasibility of finite and infinite paths in data dependent programs -- An interleaving model for real-time systems -- Incremental evaluation of natural semantics specifications -- Denotations for classical proofs -Preliminary results- -- Ordinal arithmetic with list structures (preliminary version) -- Many-valued non-monotonic modal logics -- Automated deduction in additive and multiplicative linear logic -- Intensionally stable functions -- A constructive proof that tree are well-quasi-ordered under minors (detailed abstract) -- Banishing robust Turing completeness -- Balanced formulas, BCK-minimal formulas and their proofs -- Non-stable models of linear logic -- Ordering optimisations for concurrent logic programs -- A categorical interpretation of partial function logic and Hoare logic -- The polynomial complexity of conjunctive normal form satisfiability, when the number of conjunctions and negations is limited -- Typed ?-calculus with recursive definitions -- Set theoretic foundations for fuzzy set theory, and their applications -- Constructive specifications of abstract data types using temporal logic -- An interval-based modal logic for system specification -- A unifying theory of dependent types: the schematic approach -- MSL A Mathematical Specification Language -- Partial algebra + order-sorted algebra = galactic algebra -- Minimal negation and Hereditary Harrop formulae -- Kleene automata and recursion theory -- Incremental polymorphic type checking with update -- Operators on lattices of?-Herbrand interpretations -- Sequential calculus for proving the properties of regular programs -- Complete sequential calculi for the first order symmetrical linear temporal logic with until and since -- Non modularity and expressibility for nets of relations (extended abstract) -- Correctness of generic modules -- An and-parallelism cooperative scheme for full prolog interpreters on a transputer-based architecture -- A sequent calculus for a first order linear temporal logic with equality -- On the expressive power of modal logics on trees -- Propositional dynamic logic with fixed points: Algorithmic tools for verification of finite state machines -- Effective operators and continuity revisited -- Logical characterizations of bounded query classes I: Logspace oracle machines -- Solving equational constraints in polymorphic types -- Gentzen-style and Novikov-style cut-elimination -- Graded modalities in epistemic logic. | |
| 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 volume presents the papers selected for the Symposium Logic at Tver '92, held at Sokol, near Tver, Russia in July 1992. It is the second in a series of international symposia on logical foundations of computer science held in Russia. The meeting is a joint effort of scholars from both the former Soviet Union and the West, and indicates a new era of international cooperation. Sponsors of the meeting include: the Association for Computing Machinery, the Association for Symbolic Logic, andthe Committee on Mathematical Foundations of Computer Science of IEEE. The book is a unique source of information on the state of computer science research in the former Soviet Union and presents important discoveries in the area of logical foundations of computer science. | ||
| 650 | |a Informatique | ||
| 650 | |a Algorithmes | ||
| 650 | |a Logique symbolique et mathématique | ||
| 650 | |a Informatique |x Mathématiques | ||
| 650 | |a Logique | ||
| 650 | |a Actes de congrès | ||
| 700 | 1 | |a Nerode, Anil, |d 1932- |4 pbd | |
| 700 | 1 | |a Taitslin, Mikhail A., |d 1936- |4 pbd | |
| 776 | 0 | |0 014269813 |t Logical foundations of computer science, Tver '92 |o second international symposium, Tver, Russia, July 20-24, 1992 proceedings |f A. Nerode, M. Taitslin (eds.) |c Berlin |n Springer-Verlag |d 1992 |p 1 vol. (ix, 514 p.) |s Lecture notes in computer science |z 3-540-55707-5 | |
| 776 | 0 | |t Logical Foundations of Computer Science - Tver '92 |b Texte imprimé |z 9783662164761 | |
| 856 | 4 | |q PDF |u https://doi.org/10.1007/BFb0023857 |z Accès sur la plateforme de l'éditeur | |
| 856 | 4 | |u https://revue-sommaire.istex.fr/ark:/67375/8Q1-1WP5DWC0-1 |z Accès sur la plateforme Istex | |
| 856 | 4 | |5 452349901:747910367 |u https://ezproxy.univ-orleans.fr/login?url=https://doi.org/10.1007/BFb0023857 |z Accès Université d'Orléans | |
| 856 | 4 | |5 180339901:750923253 |u https://ezproxy.insa-cvl.fr/login?qurl=https://doi.org/10.1007/BFb0023857 |z Accès INSA CVL | |
| 997 | |0 945454 |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/ | ||