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...
Uloženo v:
| Korporativní autor: | |
|---|---|
| Další autoři: | , |
| Médium: | Livre numérique |
| Jazyk: | Anglais |
| Vydáno: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Edice: | Lecture notes in computer science
620 |
| Témata: | |
| On-line přístup: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Poznámka: |
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 |
Obsah:
- 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.