Logic from Computer Science: Proceedings of a Workshop held November 13–17, 1989: Mathematical Sciences Research Institute Publications, cartea 21
Editat de Yiannis N. Moschovakisen Limba Engleză Paperback – 18 sep 2011
Din seria Mathematical Sciences Research Institute Publications
- 20%
Preț: 749.79 lei - 11%
Preț: 415.74 lei -
Preț: 449.51 lei -
Preț: 357.46 lei - 14%
Preț: 831.70 lei - 14%
Preț: 804.77 lei - 18%
Preț: 852.05 lei - 15%
Preț: 614.11 lei - 18%
Preț: 751.49 lei - 15%
Preț: 619.45 lei - 15%
Preț: 619.75 lei - 18%
Preț: 698.87 lei -
Preț: 386.37 lei - 18%
Preț: 1177.01 lei - 15%
Preț: 612.55 lei - 15%
Preț: 619.91 lei - 18%
Preț: 917.87 lei - 18%
Preț: 961.53 lei - 15%
Preț: 627.14 lei -
Preț: 370.46 lei - 15%
Preț: 610.82 lei - 18%
Preț: 697.07 lei - 15%
Preț: 670.97 lei - 15%
Preț: 615.05 lei -
Preț: 437.50 lei -
Preț: 459.00 lei - 15%
Preț: 625.26 lei - 11%
Preț: 405.22 lei -
Preț: 354.81 lei -
Preț: 357.88 lei -
Preț: 436.84 lei -
Preț: 321.80 lei -
Preț: 299.24 lei - 11%
Preț: 420.01 lei -
Preț: 357.31 lei -
Preț: 350.66 lei
Preț: 631.08 lei
Preț vechi: 742.45 lei
-15% Nou
Puncte Express: 947
Preț estimativ în valută:
111.67€ • 131.12$ • 98.02£
111.67€ • 131.12$ • 98.02£
Carte tipărită la comandă
Livrare economică 27 ianuarie-10 februarie 26
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9781461276852
ISBN-10: 1461276853
Pagini: 624
Ilustrații: XI, 608 p.
Dimensiuni: 155 x 235 x 33 mm
Greutate: 0.86 kg
Ediția:Softcover reprint of the original 1st ed. 1992
Editura: Springer
Colecția Springer
Seria Mathematical Sciences Research Institute Publications
Locul publicării:New York, NY, United States
ISBN-10: 1461276853
Pagini: 624
Ilustrații: XI, 608 p.
Dimensiuni: 155 x 235 x 33 mm
Greutate: 0.86 kg
Ediția:Softcover reprint of the original 1st ed. 1992
Editura: Springer
Colecția Springer
Seria Mathematical Sciences Research Institute Publications
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.