Logical Methods: In Honor of Anil Nerode’s Sixtieth Birthday: Progress in Computer Science and Applied Logic, cartea 12
Editat de John N. Crossley, Jeffrey B. Remmel, Richard Shore, Moss E. Sweedleren Limba Engleză Hardback – 26 ian 1994
Toate formatele și edițiile | Preț | Express |
---|---|---|
Paperback (1) | 927.91 lei 38-44 zile | |
Birkhäuser Boston – 14 feb 2013 | 927.91 lei 38-44 zile | |
Hardback (1) | 1003.11 lei 6-8 săpt. | |
Birkhäuser Boston – 26 ian 1994 | 1003.11 lei 6-8 săpt. |
Din seria Progress in Computer Science and Applied Logic
- 20% Preț: 337.05 lei
- Preț: 373.87 lei
- 20% Preț: 327.96 lei
- 15% Preț: 581.34 lei
- 20% Preț: 334.79 lei
- 20% Preț: 611.79 lei
- 20% Preț: 329.11 lei
- 20% Preț: 644.82 lei
- Preț: 381.27 lei
- 15% Preț: 578.14 lei
- 20% Preț: 576.83 lei
- 20% Preț: 466.88 lei
- Preț: 404.00 lei
- Preț: 387.15 lei
- Preț: 396.98 lei
- 15% Preț: 635.86 lei
- 15% Preț: 635.55 lei
- 20% Preț: 635.90 lei
- 20% Preț: 333.97 lei
- 15% Preț: 687.18 lei
- 15% Preț: 642.79 lei
- 18% Preț: 718.48 lei
- Preț: 392.61 lei
- 20% Preț: 420.91 lei
- 20% Preț: 329.43 lei
- Preț: 373.51 lei
- Preț: 374.64 lei
- 20% Preț: 329.25 lei
Preț: 1003.11 lei
Preț vechi: 1253.89 lei
-20% Nou
Puncte Express: 1505
Preț estimativ în valută:
191.97€ • 199.100$ • 159.61£
191.97€ • 199.100$ • 159.61£
Carte tipărită la comandă
Livrare economică 08-22 februarie 25
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9780817636906
ISBN-10: 0817636900
Pagini: 816
Ilustrații: XIV, 816 p.
Dimensiuni: 155 x 235 x 44 mm
Greutate: 1.33 kg
Ediția:1993
Editura: Birkhäuser Boston
Colecția Birkhäuser
Seria Progress in Computer Science and Applied Logic
Locul publicării:Boston, MA, United States
ISBN-10: 0817636900
Pagini: 816
Ilustrații: XIV, 816 p.
Dimensiuni: 155 x 235 x 44 mm
Greutate: 1.33 kg
Ediția:1993
Editura: Birkhäuser Boston
Colecția Birkhäuser
Seria Progress in Computer Science and Applied Logic
Locul publicării:Boston, MA, United States
Public țintă
ResearchCuprins
The Work of Anil Nerode: A Retrospective.- Embedding Distributive Lattices Preserving 1 Below A Nonzero Recursively Enumerable Turing Degree.- Prime Isols and the Theorems of Fermat and Wilson.- Problem Solving Strategies for the Derivation of Programs.- Effective Real Dynamics.- An Integer Lattice Arising in the Model Theory of Wreath Products.- Undecidability and Definability for Parametrized Polynomial Time m-Reducibilities.- Extracting Programs from Proofs by an Extension of the Curry-Howard Process.- A Bird’s-Eye View of Twilight Combinatorics.- Effectively and Noneffectively Nowhere Simple Subspaces.- Index Sets in Recursive Combinatorics.- Computability in Unitary Representations of Compact Groups.- Recursive Properties of Intervals of Recursive Linear Orders.- Algorithmic Stability of Models.- The Combinatorics of the Friedberg-Muchnick Theorem.- Partial Automata and Finitely Generated Congruences: An Extension of Nerode’s Theorem.- Minimal Pair Constructions and Iterated Treesof Strategies.- Intuitionistic L.- n-Recursive Linear Orders Without (n + 1)-Recursive Copies.- Multiple Agent Autonomous Control — A Hybrid Systems Architecture.- Distributed Concurrent Programs as Strategies in Games.- Dempster-Shafer Logic Programs and Stable Semantics.- Who Put the “Back” in Back-and-Forth?.- Polynomial Time Categoricity and Linear Orderings.- The Disjunction and Numerical Existence Properties for Intuitionistic Analysis.- On the Strength of Fraïssé’s Conjecture.