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ț: 451.28 lei
- Preț: 345.60 lei
- Preț: 433.30 lei
- 14% Preț: 772.70 lei
- 18% Preț: 868.48 lei
- 15% Preț: 625.84 lei
- 18% Preț: 765.93 lei
- 15% Preț: 631.27 lei
- 15% Preț: 631.61 lei
- 18% Preț: 712.30 lei
- Preț: 393.55 lei
- 18% Preț: 1199.84 lei
- 15% Preț: 624.26 lei
- 18% Preț: 774.15 lei
- 15% Preț: 631.77 lei
- 18% Preț: 935.58 lei
- 18% Preț: 980.11 lei
- 15% Preț: 639.12 lei
- Preț: 377.34 lei
- 15% Preț: 622.48 lei
- 18% Preț: 710.45 lei
- 15% Preț: 634.00 lei
- 15% Preț: 626.80 lei
- Preț: 421.06 lei
- Preț: 442.96 lei
- 15% Preț: 637.21 lei
- Preț: 439.23 lei
- Preț: 342.89 lei
- Preț: 346.03 lei
- Preț: 420.38 lei
- Preț: 309.24 lei
- Preț: 304.73 lei
- Preț: 456.17 lei
- Preț: 345.44 lei
- Preț: 338.67 lei
- 18% Preț: 936.02 lei
Preț: 643.15 lei
Preț vechi: 756.64 lei
-15% Nou
Puncte Express: 965
Preț estimativ în valută:
123.09€ • 127.85$ • 102.24£
123.09€ • 127.85$ • 102.24£
Carte tipărită la comandă
Livrare economică 03-17 februarie 25
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.