Logic from Computer Science
Editat de Yiannis N. Moschovakisen Limba Engleză Paperback – 18 sep 2011
Preț: 629.86 lei
Preț vechi: 741.01 lei
-15%
Puncte Express: 945
Preț estimativ în valută:
111.38€ • 127.72$ • 96.26£
111.38€ • 127.72$ • 96.26£
Carte tipărită la comandă
Livrare economică 27 aprilie-11 mai
Specificații
ISBN-13: 9781461276852
ISBN-10: 1461276853
Pagini: 624
Ilustrații: XI, 608 p.
Dimensiuni: 155 x 235 x 34 mm
Greutate: 0.93 kg
Ediția:Softcover reprint of the original 1st ed. 1992
Editura: Springer
Locul publicării:New York, NY, United States
ISBN-10: 1461276853
Pagini: 624
Ilustrații: XI, 608 p.
Dimensiuni: 155 x 235 x 34 mm
Greutate: 0.93 kg
Ediția:Softcover reprint of the original 1st ed. 1992
Editura: Springer
Locul publicării:New York, NY, United States
Public țintă
ResearchCuprins
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.