Computer Science Logic: 6th Workshop, CSL'92, San Miniato, Italy, September 28 - October 2, 1992. Selected Papers (Lecture Notes in Computer Science 702) - Taschenbuch

EAN (ISBN-13): 9783540569923
ISBN (ISBN-10): 3540569928
Gebundene Ausgabe
Taschenbuch
Erscheinungsjahr: 1993
Herausgeber: Springer Berlin Heidelberg Core >1 >T
439 Seiten
Gewicht: 0,684 kg

Buch in der Datenbank seit 2007-06-12T06:14:12+02:00 (Vienna)
Detailseite zuletzt geändert am 2024-04-14T19:56:25+02:00 (Vienna)
ISBN/EAN: 9783540569923

ISBN - alternative Schreibweisen:
3-540-56992-8, 978-3-540-56992-3
Alternative Schreibweisen und verwandte Suchbegriffe:
Autor des Buches: richter simone, hans jäger, martini, michael jäger, egon börger, jaeger michael, jaeger gerhard, klein hans, egon jger, egon brger, gerhard simon, kleine büning, ger hans, borger, boerger, michael white, bunin, martin richter, rger, kleene, martin borg, jager und
Titel des Buches: computer science, logic, october, selected papers nuclear archaeological, september, logi, science 1992, science notes

---

Daten vom Verlag:

Autor/in: Egon Börger; Gerhard Jäger; Hans Kleine Büning; Simone Martini; Michael M. Richter
Titel: Lecture Notes in Computer Science; Computer Science Logic - 6th Workshop, CSL'92, San Miniato, Italy, September 28 - October 2, 1992. Selected Papers
Verlag: Springer; Springer Berlin
439 Seiten
Erscheinungsjahr: 1993-08-11
Berlin; Heidelberg; DE
Sprache: Englisch
53,49 € (DE)
54,99 € (AT)
59,00 CHF (CH)
Available
IX, 439 p.

BC; Hardcover, Softcover / Informatik, EDV/Informatik; Theoretische Informatik; Verstehen; Resolution; computer; computer science; lambda calculus; logic; optimization; programming; semantics; algorithm analysis and problem complexity; Theory of Computation; Software Engineering; Mathematical Logic and Foundations; Computer Science Logic and Foundations of Programming; Formal Languages and Automata Theory; Algorithms; Software Engineering; Mathematik: Logik; Mathematische Grundlagen; Algorithmen und Datenstrukturen; EA

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.