| |
|
|
|
|
|
|
|
|
1. |
Record Nr. |
UNISA996466156403316 |
|
|
Titolo |
Computer Science Logic [[electronic resource] ] : 6th Workshop, CSL'92, San Miniato, Italy, September 28 - October 2, 1992. Selected Papers / / edited by Egon Börger, Gerhard Jäger, Hans Kleine Büning, Simone Martini, Michael M. Richter |
|
|
|
|
|
|
|
Pubbl/distr/stampa |
|
|
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1993 |
|
|
|
|
|
|
|
|
|
ISBN |
|
|
|
|
|
|
Edizione |
[1st ed. 1993.] |
|
|
|
|
|
Descrizione fisica |
|
1 online resource (IX, 439 p.) |
|
|
|
|
|
|
Collana |
|
Lecture Notes in Computer Science, , 0302-9743 ; ; 702 |
|
|
|
|
|
|
Disciplina |
|
|
|
|
|
|
Soggetti |
|
Computers |
Software engineering |
Mathematical logic |
Computer logic |
Algorithms |
Theory of Computation |
Software Engineering/Programming and Operating Systems |
Mathematical Logic and Foundations |
Logics and Meanings of Programs |
Mathematical Logic and Formal Languages |
Algorithm Analysis and Problem Complexity |
|
|
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Monografia |
|
|
|
|
|
Note generali |
|
Bibliographic Level Mode of Issuance: Monograph |
|
|
|
|
|
|
Nota di contenuto |
|
A universal Turing machine -- Recursive inseparability in linear logic -- The basic logic of proofs -- Algorithmic structuring of cut-free proofs -- Optimization problems: Expressibility, approximation properties and expected asymptotic growth of optimal solutions -- Linear ?-calculus and categorical models revisited -- A self-interpreter of lambda calculus having a normal form -- An “Ehrenfeucht-Fraïssé game” for fixpoint logic and stratified fixpoint logic -- The class of problems that are linearly equivalent to satisfiability or a uniform method for proving NP-completeness -- Model building by resolution -- Comparative transition system semantics -- Reasoning with higher order partial |
|
|
|
|
|
|
|
|
|
|
|
functions -- Communicating evolving algebras -- On the completeness of narrowing as the operational semantics of functional logic programming -- Inductive definability with counting on finite structures -- Linear time algorithms and NP-complete problems -- The semantics of the C programming language -- A theory of classes for a functional language with effects -- Logical definability of NP-optimisation problems with monadic auxiliary predicates -- Universes in the theories of types and names -- Notes on sconing and relators -- Solving 3-satisfiability in less than 1, 579n steps -- Kleene's slash and existence of values of open terms in type theory -- Negation-complete logic programs -- Logical characterization of bounded query classes II: Polynomial-time oracle machines -- On asymptotic probabilities of monadic second order properties. |
|
|
|
|
|
|
Sommario/riassunto |
|
This volume presents the proceedings of the Computer Science Logic Workshop CSL '92, held in Pisa, Italy, in September/October 1992. CSL '92 was the sixth of the series and the first one held as Annual Conference of the European Association for Computer Science Logic (EACSL). Full versions of the workshop contributions were collected after their presentation and reviewed. On the basis of 58 reviews, 26 papers were selected for publication, and appear here in revised final form. Topics covered in the volume include: Turing machines, linear logic, logic of proofs, optimization problems, lambda calculus, fixpoint logic, NP-completeness, resolution, transition system semantics, higher order partial functions, evolving algebras, functional logic programming, inductive definability, semantics of C, classes for a functional language, NP-optimization problems, theory of types and names, sconing and relators, 3-satisfiability, Kleene's slash, negation-complete logic programs, polynomial-time oracle machines, and monadic second-order properties. |
|
|
|
|
|
|
|
| |