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
- Preț: 460.54 lei
- Preț: 352.67 lei
- Preț: 442.20 lei
- 14% Preț: 788.66 lei
- 18% Preț: 886.43 lei
- 15% Preț: 638.76 lei
- 18% Preț: 781.77 lei
- 15% Preț: 644.30 lei
- 15% Preț: 644.63 lei
- 18% Preț: 727.00 lei
- Preț: 401.61 lei
- 18% Preț: 1224.68 lei
- 15% Preț: 637.13 lei
- 18% Preț: 790.14 lei
- 15% Preț: 644.82 lei
- 18% Preț: 954.93 lei
- 18% Preț: 1000.39 lei
- 15% Preț: 652.31 lei
- Preț: 385.08 lei
- 15% Preț: 635.31 lei
- 18% Preț: 725.13 lei
- 15% Preț: 647.08 lei
- 15% Preț: 639.73 lei
- Preț: 429.70 lei
- Preț: 452.07 lei
- 15% Preț: 650.37 lei
- Preț: 448.23 lei
- Preț: 349.91 lei
- Preț: 353.10 lei
- Preț: 429.00 lei
- Preț: 315.54 lei
- Preț: 310.97 lei
- Preț: 465.54 lei
- Preț: 352.50 lei
- Preț: 345.59 lei
- 18% Preț: 955.40 lei
Preț: 656.43 lei
Preț vechi: 772.26 lei
-15% Nou
Puncte Express: 985
Preț estimativ în valută:
125.62€ • 129.60$ • 106.32£
125.62€ • 129.60$ • 106.32£
Carte tipărită la comandă
Livrare economică 04-18 martie
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.