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) | 1003.48 lei 38-45 zile | |
| Birkhäuser Boston – 14 feb 2013 | 1003.48 lei 38-45 zile | |
| Hardback (1) | 980.69 lei 6-8 săpt. | |
| Birkhäuser Boston – 26 ian 1994 | 980.69 lei 6-8 săpt. |
Din seria Progress in Computer Science and Applied Logic
- 20%
Preț: 329.74 lei -
Preț: 365.82 lei - 20%
Preț: 320.86 lei - 15%
Preț: 568.52 lei - 20%
Preț: 661.59 lei - 20%
Preț: 321.98 lei - 20%
Preț: 630.51 lei -
Preț: 373.03 lei - 20%
Preț: 564.08 lei - 20%
Preț: 456.63 lei -
Preț: 395.25 lei -
Preț: 378.78 lei - 15%
Preț: 621.80 lei - 15%
Preț: 621.48 lei - 20%
Preț: 326.72 lei - 15%
Preț: 671.94 lei - 15%
Preț: 628.56 lei - 18%
Preț: 701.91 lei -
Preț: 384.13 lei - 20%
Preț: 483.83 lei - 20%
Preț: 322.29 lei -
Preț: 365.45 lei -
Preț: 366.56 lei - 20%
Preț: 322.11 lei
Preț: 980.69 lei
Preț vechi: 1225.85 lei
-20%
Puncte Express: 1471
Preț estimativ în valută:
173.37€ • 202.96$ • 151.39£
173.37€ • 202.96$ • 151.39£
Carte tipărită la comandă
Livrare economică 06-20 martie
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.