Feasible mathematics II. Based on a workshop, held at the Cornell University, Ithaca, NY, USA, May 28-30, 1992 (Q1345817)

The articles of this volume will be reviewed individually. Indexed articles: \textit{Ajtai, Miklós}, On the existence of modulo \(p\) cardinality functions, 1-14 [Zbl 0834.03010] \textit{Bellantoni, Stephen}, Predicative recursion and the polytime hierarchy, 15-29 [Zbl 0841.03022] \textit{Bonet, Maria Luisa; Buss, Samuel R.; Pitassi, Toniann}, Are there hard examples for Frege systems?, 30-56 [Zbl 0834.03021] \textit{Buss, Samuel R.}, On Gödel's theorems on lengths of proofs. II: Lower bounds for recognizing \(k\) symbol provability, 57-90 [Zbl 0829.03034] \textit{Cenzer, Douglas; Remmel, Jeffrey}, Feasibly categorical Abelian groups, 91-153 [Zbl 0846.03014] \textit{Clote, Peter; Takeuti, Gaisi}, First order bounded arithmetic and small Boolean circuit complexity classes, 154-218 [Zbl 0838.03043] \textit{Downey, Rodney G.; Fellows, Michael R.}, Parameterized computational feasibility, 219-244 [Zbl 0834.68046] \textit{Karchmer, Mauricio}, On proving lower bounds for circuit size, 245-255 [Zbl 0834.68047] \textit{Khoussainov, Bakhadyr; Nerode, Anil}, Effective properties of finitely generated r.e. algebras, 256-283 [Zbl 0837.03037] \textit{Krajíček, Jan}, On Frege and extended Frege proof systems, 284-319 [Zbl 0843.03033] \textit{Leivant, Daniel}, Ramified recurrence and computational complexity. I: Word recurrence and poly-time, 320-343 [Zbl 0844.03024] \textit{Razborov, Alexander A.}, Bounded arithmetic and lower bounds in Boolean complexity, 344-386 [Zbl 0838.03044] \textit{Schwichtenberg, Helmut; Wainer, Stanley S.}, Ordinal bounds for programs, 387-406 [Zbl 0864.03037] \textit{Seth, Anil}, Turing machine characterizations of feasible functionals of all finite types, 407-428 [Zbl 0836.03024] \textit{Verbrugge, Rineke}, The complexity of feasible interpretability, 429-447 [Zbl 0836.03030]