Computer Science Logic: 9th International Workshop, CSL'95 Annual Conference of the EACSL Paderborn, Germany, September 22-29, 1995 Selected Papers (Lecture Notes in Computer Science, 1092, Band 1092) - Taschenbuch

EAN (ISBN-13): 9783540613770
ISBN (ISBN-10): 3540613773
Gebundene Ausgabe
Taschenbuch
Erscheinungsjahr: 1996
Herausgeber: Springer Berlin
487 Seiten
Gewicht: 0,754 kg

Buch in der Datenbank seit 2007-05-29T12:49:59+02:00 (Berlin)
Detailseite zuletzt geändert am 2022-11-19T18:26:13+01:00 (Berlin)
ISBN/EAN: 3540613773

ISBN - alternative Schreibweisen:
3-540-61377-3, 978-3-540-61377-0

---

Daten vom Verlag:

Autor/in: Hans Kleine Buening
Titel: Lecture Notes in Computer Science; Computer Science Logic - 9th International Workshop, CSl '95, Annual Conference of the EACSL Paderborn, Germany, September 22-29, 1995. Selected Papers
Verlag: Springer; Springer Berlin
492 Seiten
Erscheinungsjahr: 1996-06-05
Berlin; Heidelberg; DE
Gedruckt / Hergestellt in Deutschland.
Gewicht: 1,540 kg
Sprache: Englisch
96,29 € (DE)
98,99 € (AT)
120,12 CHF (CH)
POD
VIII, 492 p.

BC; Book; Hardcover, Softcover / Informatik, EDV/Informatik; Theoretische Informatik; Verstehen; computer; formal language; logic; proof theory; proving; selection; theorem proving; C; Theory of Computation; Programming Languages, Compilers, Interpreters; Computer System Implementation; Mathematical Logic and Formal Languages; Artificial Intelligence; Logics and Meanings of Programs; Theory of Computation; Compilers and Interpreters; Computer System Implementation; Formal Languages and Automata Theory; Artificial Intelligence; Computer Science Logic and Foundations of Programming; Computer Science; Compiler und Übersetzer; Systemanalyse und -design; Künstliche Intelligenz; EA

Incompleteness of a first-order gödel logic and some temporal logics of programs.- Semantics of non-terminating rewrite systems using minimal coverings.- Congruence Types.- Deduction by combining semantic tableaux and integer programming.- leanEA: A lean evolving algebra compiler.- A proof system for finite trees.- Representing unification in a logical framework.- Decision procedures using model building techniques.- A note on the relation between polynomial time functionals and Constable's class K.- First order logic, fixed point logic and linear order.- Simultaneous rigid E-unification is undecidable.- An evolving algebra abstract machine.- Rewriting with extensional polymorphic ?-calculus.- Languages and logical definability in concurrency monoids.- Generalized implicit definitions on finite structures.- The railroad crossing problem: An experiment with instantaneous actions and immediate reactions.- A logical aspect of parametric polymorphism.- On the modal logic K plus theories.- Improved decision procedures for the modal logics K, T and S4.- A fully abstract denotational model for observational precongruence.- On sharply bounded length induction.- Effective strategies for enumeration games.- Bounded fixed-point definability and tabular recognition of languages.- Equivalences among various logical frameworks of partial algebras.- Some extensions to propositional mean-value calculus: Expressiveness and decidability.- Theorem proving modulo associativity.- Positive deduction modulo regular theories.