Logic from Computer Science
Springer-Verlag New York Inc. (Hersteller)
978-0-387-97667-9 (ISBN)
- Titel ist leider vergriffen;
keine Neuauflage - Artikel merken
Preface.- The Imperative Future: Past Successes Future Actions.- A Logical Operational Semantics of Full Prolog: Part III. Built-in Predicates for Files, Terms, Arithmetic and Input-Output.- Computability and Complexity of Higher Type Functions.- Constructively Equivalent Propositions and Isomorphisms of Objects, or Terms as Natural Transfomrations.- Logics for Termination and Correctness of Functional Programs.- Transparent Grammars.- Designing Unification Procedures Using Transformations: A survey.- NormaL Forms and Cut-Free Proofs as Natural Transformations.- Computer Implementation and Applications of Kleene’s S-M-N and Recursion Theorems.- 0–1 Laws for Fragments of Second-Order Logic: an Overview.- No Counter-Example Interpretation and Interactive Computation.- Semantic Characterizations of Number Theories.- Constructive Kripke Semantics and Realizability.- Splitting and Density for the Recursive Sets of a Fixed Time Complexity.- Reals and Forcing with an Elementary Topos.- Completeness Theorems for Logics of Feature Structures.- Concurrent Programs as Strategies in Games.- Finite and Infinite Dialogues.- Some Relations Between Subsystems of Arithmetic and Complexity of Computations.- Logics for Negation as Failure.- Normal Varieties of Combinators.- Complexity of Proofs in Classical Propositional Logic.
| Zusatzinfo | Illustrations |
|---|---|
| Verlagsort | New York, NY |
| Sprache | englisch |
| Themenwelt | Mathematik / Informatik ► Mathematik ► Logik / Mengenlehre |
| ISBN-10 | 0-387-97667-1 / 0387976671 |
| ISBN-13 | 978-0-387-97667-9 / 9780387976679 |
| Zustand | Neuware |
| Haben Sie eine Frage zum Produkt? |
