|
|
|
|
| LEADER |
04876nmm a2200385 u 4500 |
| 001 |
EB000657759 |
| 003 |
EBX01000000000000001349359 |
| 005 |
00000000000000.0 |
| 007 |
cr||||||||||||||||||||| |
| 008 |
140122 ||| eng |
| 020 |
|
|
|a 9783540472766
|
| 100 |
1 |
|
|a Nerode, Anil
|e [editor]
|
| 245 |
0 |
0 |
|a Logical Foundations of Computer Science - Tver '92
|h Elektronische Ressource
|b Second International Symposium, Tver, Russia, July 20-24, 1992. Proceedings
|c edited by Anil Nerode, Mikhail Taitslin
|
| 250 |
|
|
|a 1st ed. 1992
|
| 260 |
|
|
|a Berlin, Heidelberg
|b Springer Berlin Heidelberg
|c 1992, 1992
|
| 300 |
|
|
|a XI, 517 p
|b online resource
|
| 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 --
|
| 505 |
0 |
|
|a 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 --
|
| 505 |
0 |
|
|a 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
|
| 653 |
|
|
|a Computer Science Logic and Foundations of Programming
|
| 653 |
|
|
|a Computer science
|
| 653 |
|
|
|a Mathematical logic
|
| 653 |
|
|
|a Algorithms
|
| 653 |
|
|
|a Formal Languages and Automata Theory
|
| 653 |
|
|
|a Machine theory
|
| 653 |
|
|
|a Mathematical Logic and Foundations
|
| 653 |
|
|
|a Theory of Computation
|
| 700 |
1 |
|
|a Taitslin, Mikhail
|e [editor]
|
| 041 |
0 |
7 |
|a eng
|2 ISO 639-2
|
| 989 |
|
|
|b SBA
|a Springer Book Archives -2004
|
| 490 |
0 |
|
|a Lecture Notes in Computer Science
|
| 028 |
5 |
0 |
|a 10.1007/BFb0023857
|
| 856 |
4 |
0 |
|u https://doi.org/10.1007/BFb0023857?nosfx=y
|x Verlag
|3 Volltext
|
| 082 |
0 |
|
|a 004.0151
|
| 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
|