Logical methods. In honor of Anil Nerode's 60th birthday (Q1345481)

The articles of this volume will be reviewed individually. Indexed articles: \textit{Remmel, J. B.; Crossley, J. N.}, The work of Anil Nerode: A retrospective, 1-85 [Zbl 0824.03001] Bibliography of Anil Nerode, 86-91 [Zbl 0824.03002] \textit{Ambos-Spies, Klaus; Ding, Decheng; Fejer, Peter A.}, Embedding distributive lattices preserving 1 below a nonzero recursively enumerable Turing degree, 92-129 [Zbl 0819.03031] \textit{Barback, J.}, Prime isols and the theorems of Fermat and Wilson, 130-142 [Zbl 0824.03021] \textit{Cenzer, Douglas}, Effective real dynamics, 162-177 [Zbl 0823.03034] \textit{Cherlin, Gregory; Martin, Gary}, An integer lattice arising in the model theory of wreath products, 178-193 [Zbl 0824.03012] \textit{Cholak, Peter; Downey, Rod}, Undecidability and definability for parametrized polynomial time \(m\)- reducibilities, 194-221 [Zbl 0820.03026] \textit{Crossley, John N.; Shepherdson, John C.}, Extracting programs from proofs by an extension of the Curry-Howard process, 222-288 [Zbl 0821.03017] \textit{Dekker, J. C. E.}, A bird's-eye view of twilight combinatorics, 289-313 [Zbl 0820.03029] \textit{Downey, R. G.; Remmel, Jeffrey B.}, Effectively and noneffectively nowhere simple subspaces, 314-351 [Zbl 0824.03019] \textit{Gasarch, William; Martin, Georgia}, Index sets in recursive combinatorics, 352-385 [Zbl 0824.03023] \textit{Ge, Xiaolin; Richards, J. Ian}, Computability in unitary representations of compact groups, 386-421 [Zbl 0839.22002] \textit{Hird, Geoffrey}, Recursive properties of intervals of recursive linear orders, 422-437 [Zbl 0816.03020] \textit{Khoussainov, B. M.; Dadajanov, R.}, Algorithmic stability of models, 438-466 [Zbl 0818.03017] \textit{Kontostathis, Kyriakos}, The combinatorics of the Friedberg-Muchnick theorem, 467-489 [Zbl 0820.03024] \textit{Kozen, D.}, Partial automata and finitely generated congruences: An extension of Nerode's theorem, 490-511 [Zbl 0824.68076] \textit{Lempp, S.; Lerman, M.; Weber, F.}, Minimal pair constructions and iterated trees of strategies, 512-554 [Zbl 0819.03033] \textit{Lubarsky, Robert S.}, Intuitionistic L, 555-571 [Zbl 0823.03028] \textit{Moses, Michael}, \(n\)-recursive linear orders without \((n+1)\)-recursive copies, 572-592 [Zbl 0824.03020] \textit{Ng, Raymond; Subrahmanian, V. S.}, Dempster-Shafer logic programs and stable semantics, 654-704 [Zbl 0824.68021] \textit{Plotkin, J. M.}, Who put the ``back'' in back-and-forth?, 705-712 [Zbl 0856.01018] \textit{Remmel, Jeffrey B.}, Polynomial time categoricity and linear orderings, 713-746 [Zbl 0832.03020] \textit{Scowcroft, Philip}, The disjunction and numerical existence properties for intuitionistic analysis, 747-781 [Zbl 0827.03036] \textit{Shore, Richard A.}, On the strength of Fraïssé's conjecture, 782-813 [Zbl 0820.03037]