Leroux, Jérôme When reachability meets Grzegorczyk. (English) Zbl 07299453 Proceedings of the 2020 35th annual ACM/IEEE symposium on logic in computer science, LICS 2020, virtual event, July 8–11, 2020. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-7104-9). 1-6 (2020). Reviewer: Reviewer (Berlin) MSC: 68Q85 PDF BibTeX XML Cite \textit{J. Leroux}, in: Proceedings of the 2020 35th annual ACM/IEEE symposium on logic in computer science, LICS 2020, virtual event, July 8--11, 2020. New York, NY: Association for Computing Machinery (ACM). 1--6 (2020; Zbl 07299453) Full Text: DOI
Mohsenipour, Shahram; Shelah, Saharon Note on finitary Hindman numbers. (English) Zbl 1449.05238 Combinatorica 39, No. 5, 1185-1189 (2019). Reviewer: Ioan Tomescu (Bucureşti) MSC: 05D10 PDF BibTeX XML Cite \textit{S. Mohsenipour} and \textit{S. Shelah}, Combinatorica 39, No. 5, 1185--1189 (2019; Zbl 1449.05238) Full Text: DOI
Fujita, Ken-etsu The Church-Rosser theorem and quantitative analysis of witnesses. (English) Zbl 1436.03104 Inf. Comput. 263, 52-56 (2018). Reviewer: Reviewer (Berlin) MSC: 03B40 PDF BibTeX XML Cite \textit{K.-e. Fujita}, Inf. Comput. 263, 52--56 (2018; Zbl 1436.03104) Full Text: DOI
Ketema, Jeroen; Simonsen, Jakob Grue Least upper bounds on the size of confluence and Church-Rosser diagrams in term rewriting and \(\lambda\)-calculus. (English) Zbl 1354.68143 ACM Trans. Comput. Log. 14, No. 4, Article No. 31, 28 p. (2013). Reviewer: Reviewer (Berlin) MSC: 68Q42 03B40 03D20 PDF BibTeX XML Cite \textit{J. Ketema} and \textit{J. G. Simonsen}, ACM Trans. Comput. Log. 14, No. 4, Article No. 31, 28 p. (2013; Zbl 1354.68143) Full Text: DOI
Spoors, Elliott J.; Wainer, Stanley S. A hierarchy of ramified theories below PRA. (English) Zbl 1303.03091 Berger, Ulrich (ed.) et al., Logic, construction, computation. Dedicated to the 70th birthday of Helmut Schwichtenberg. Frankfurt am Main: Ontos Verlag; Berlin: De Gruyter (ISBN 978-3-11-032453-2/hbk; 978-3-86838-158-0/hbk; 978-3-11-032492-1/ebook). Ontos Mathematical Logic 3, 475-499 (2012). Reviewer: Roman Murawski (Poznań) MSC: 03F30 03D20 PDF BibTeX XML Cite \textit{E. J. Spoors} and \textit{S. S. Wainer}, Ontos Math. Log. 3, 475--499 (2012; Zbl 1303.03091)
Yanofsky, Noson S. Towards a definition of an algorithm. (English) Zbl 1214.68459 J. Log. Comput. 21, No. 2, 253-286 (2011). Reviewer: Reviewer (Berlin) MSC: 68W01 18B20 PDF BibTeX XML Cite \textit{N. S. Yanofsky}, J. Log. Comput. 21, No. 2, 253--286 (2011; Zbl 1214.68459) Full Text: DOI arXiv
Tent, Katrin; Ziegler, Martin Computable functions of reals. (English) Zbl 1234.03030 Münster J. Math. 3, No. 1, 43-66 (2010). Reviewer: Dieter Spreen (Siegen) MSC: 03D78 03D15 03F60 PDF BibTeX XML Cite \textit{K. Tent} and \textit{M. Ziegler}, Münster J. Math. 3, No. 1, 43--66 (2010; Zbl 1234.03030) Full Text: arXiv
Marchenkov, S. S. On the complexity of the \({\mathcal E}^2\) Grzegorczyk class. (English. Russian original) Zbl 1217.03027 Discrete Math. Appl. 20, No. 1, 61-73 (2010); translation from Diskretn. Mat. 22, No. 1, 5-16 (2010). Reviewer: Marat M. Arslanov (Kazan) MSC: 03D20 03D15 PDF BibTeX XML Cite \textit{S. S. Marchenkov}, Discrete Math. Appl. 20, No. 1, 61--73 (2010; Zbl 1217.03027); translation from Diskretn. Mat. 22, No. 1, 5--16 (2010) Full Text: DOI
Volkov, S. A. Finite generability of some groups of recursive permutations. (English. Russian original) Zbl 1177.20011 Discrete Math. Appl. 18, No. 6, 607-624 (2008); translation from Diskretn. Mat. 20, No. 4, 61-78 (2008). Reviewer: Reviewer (Berlin) MSC: 20B35 03D20 20F05 PDF BibTeX XML Cite \textit{S. A. Volkov}, Discrete Math. Appl. 18, No. 6, 607--624 (2008; Zbl 1177.20011); translation from Diskretn. Mat. 20, No. 4, 61--78 (2008) Full Text: DOI
Krajewski, Stanisław; Woleński, Jan Andrzej Grzegorczyk: logic and philosophy. (English) Zbl 1137.01021 Fundam. Inform. 81, No. 1-3, 1-17 (2007). Reviewer: Leon Harkleroad (Wilton) MSC: 01A70 03-03 01A60 PDF BibTeX XML Cite \textit{S. Krajewski} and \textit{J. Woleński}, Fundam. Inform. 81, No. 1--3, 1--17 (2007; Zbl 1137.01021)
Bournez, Olivier; Hainry, Emmanuel Elementarily computable functions over the real numbers and \(\mathbb R\)-sub-recursive functions. (English) Zbl 1087.03025 Theor. Comput. Sci. 348, No. 2-3, 130-147 (2005). Reviewer: Tao Renji (Beijing) MSC: 03D20 03F60 PDF BibTeX XML Cite \textit{O. Bournez} and \textit{E. Hainry}, Theor. Comput. Sci. 348, No. 2--3, 130--147 (2005; Zbl 1087.03025) Full Text: DOI
Niggl, Karl-Heinz Control structures in programs and computational complexity. (English) Zbl 1064.68029 Ann. Pure Appl. Logic 133, No. 1-3, 247-273 (2005). Reviewer: Reviewer (Berlin) MSC: 68N30 68Q15 68N15 68N18 03D20 PDF BibTeX XML Cite \textit{K.-H. Niggl}, Ann. Pure Appl. Logic 133, No. 1--3, 247--273 (2005; Zbl 1064.68029) Full Text: DOI
Bournez, Olivier; Hainry, Emmanuel An analog characterization of elementarily computable functions over the real numbers. (English) Zbl 1098.03047 Díaz, Josep (ed.) et al., Automata, languages and programming. 31st international colloquium, ICALP 2004, Turku, Finland, July 12–16, 2004. Proceedings. Berlin: Springer (ISBN 3-540-22849-7/pbk). Lecture Notes in Computer Science 3142, 269-280 (2004). Reviewer: Reviewer (Berlin) MSC: 03D20 03F60 PDF BibTeX XML Cite \textit{O. Bournez} and \textit{E. Hainry}, Lect. Notes Comput. Sci. 3142, 269--280 (2004; Zbl 1098.03047) Full Text: DOI
Kristiansen, L.; Niggl, K.-H. On the computational complexity of imperative programming languages. (English) Zbl 1048.03030 Theor. Comput. Sci. 318, No. 1-2, 139-161 (2004). Reviewer: Reviewer (Berlin) MSC: 03D10 03D15 03D20 68Q15 68N15 PDF BibTeX XML Cite \textit{L. Kristiansen} and \textit{K. H. Niggl}, Theor. Comput. Sci. 318, No. 1--2, 139--161 (2004; Zbl 1048.03030) Full Text: DOI
Campagnolo, Manuel Lameiras; Moore, Cristopher; Costa, José Félix An analog characterization of the Grzegorczyk hierarchy. (English) Zbl 1030.68047 J. Complexity 18, No. 4, 977-1000 (2002). Reviewer: Reviewer (Berlin) MSC: 68Q10 03D20 PDF BibTeX XML Cite \textit{M. L. Campagnolo} et al., J. Complexity 18, No. 4, 977--1000 (2002; Zbl 1030.68047) Full Text: DOI
Weiermann, Andreas Slow versus fast growing. (English) Zbl 1024.03039 Synthese 133, No. 1-2, 13-29 (2002). Reviewer: Helmut Pfeiffer (Hannover) MSC: 03D20 03F15 03F35 PDF BibTeX XML Cite \textit{A. Weiermann}, Synthese 133, No. 1--2, 13--29 (2002; Zbl 1024.03039) Full Text: DOI
Mazzanti, Stefano Plain bases for classes of primitive recursive functions. (English) Zbl 1017.03018 Math. Log. Q. 48, No. 1, 93-104 (2002). Reviewer: Hrant B. Marandjian (Erevan) MSC: 03D20 68Q15 PDF BibTeX XML Cite \textit{S. Mazzanti}, Math. Log. Q. 48, No. 1, 93--104 (2002; Zbl 1017.03018) Full Text: DOI
Çağman, Naim; Ostrin, Geoffrey E.; Wainer, Stanley S. Proof theoretic complexity of low subrecursive classes. (English) Zbl 0985.03050 Bauer, Friedrich L. (ed.) et al., Foundations of secure computation. 20th international summer school, Marktoberdorf, Germany, July 27 - August 8, 1999. Amsterdam: IOS Press. NATO ASI Ser., Ser. F, Comput. Syst. Sci. 175, 249-285 (2000). Reviewer: Roman Murawski (Poznań) MSC: 03F30 03D20 03F20 03D15 PDF BibTeX XML Cite \textit{N. Çağman} et al., NATO ASI Ser., Ser. F, Comput. Syst. Sci. 175, 249--285 (2000; Zbl 0985.03050)
Zhou, Qing Grzegorczyk’s hierarchy of computable analysis. (English) Zbl 0945.03090 Theor. Comput. Sci. 243, No. 1-2, 449-466 (2000). Reviewer: Reviewer (Berlin) MSC: 03F60 03D20 PDF BibTeX XML Cite \textit{Q. Zhou}, Theor. Comput. Sci. 243, No. 1--2, 449--466 (2000; Zbl 0945.03090) Full Text: DOI
Danner, Norman; Leivant, Daniel Stratified polymorphism and primitive recursion. (English) Zbl 0935.03024 Math. Struct. Comput. Sci. 9, No. 4, 507-522 (1999). Reviewer: Reviewer (Berlin) MSC: 03B40 68N18 03B70 03D20 PDF BibTeX XML Cite \textit{N. Danner} and \textit{D. Leivant}, Math. Struct. Comput. Sci. 9, No. 4, 507--522 (1999; Zbl 0935.03024) Full Text: DOI
Niggl, Karl-Heinz Subrecursive functions on partial sequences. (English) Zbl 0938.03062 Arch. Math. Logic 38, No. 3, 163-193 (1999). Reviewer: U.Schöning (Ulm) MSC: 03D20 03D15 68Q25 68Q10 68Q55 PDF BibTeX XML Cite \textit{K.-H. Niggl}, Arch. Math. Logic 38, No. 3, 163--193 (1999; Zbl 0938.03062) Full Text: DOI
Murawski, Roman The contribution of Polish logicians to recursion theory. (English) Zbl 1018.03005 Kijania-Placek, Katarzyna (ed.) et al., The Lvov-Warsaw school and contemporary philosophy. Papers from the conference, Lviv (Lvov), Ukraine, November 15-17, 1995 and Warsaw, Poland, November 19-21, 1995. Dordrecht: Kluwer Academic Publishers. Synth. Libr. 273, 265-282 (1998). Reviewer: Roman Murawski (Poznań) MSC: 03-03 03Dxx 01A60 PDF BibTeX XML Cite \textit{R. Murawski}, Synth. Libr. 273, 265--282 (1998; Zbl 1018.03005)
Bellantoni, Stephen J.; Niggl, Karl-Heinz Ranking primitive recursions: The low Grzegorczyk classes revisited. (English) Zbl 0939.03042 SIAM J. Comput. 29, No. 2, 401-415 (1998). Reviewer: Reviewer (Berlin) MSC: 03D20 68Q15 03D15 PDF BibTeX XML Cite \textit{S. J. Bellantoni} and \textit{K.-H. Niggl}, SIAM J. Comput. 29, No. 2, 401--415 (1998; Zbl 0939.03042) Full Text: DOI
Zhou, Qing Subclasses of computable real valued functions. (English) Zbl 0883.03047 Jiang, Tao (ed.) et al., Computing and combinatorics. 3rd annual international conference, COCOON ’97. Shanghai, China. August 20–22, 1997. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1276, 156-165 (1997). Reviewer: Zheng Xizhong (Hagen) MSC: 03F60 03D20 68Q99 PDF BibTeX XML Cite \textit{Q. Zhou}, Lect. Notes Comput. Sci. 1276, 156--165 (1997; Zbl 0883.03047)
Deuber, Walter A.; Thumser, Wolfgang A combinatorial approach to complexity theory via ordinal hierarchies. (English) Zbl 0949.03523 Bollobás, Béla (ed.) et al., Combinatorics, geometry and probability. A tribute to Paul Erdős. Proceedings of the conference dedicated to Paul Erdős on the occasion of his 80th birthday, Cambridge, UK, 26 March 1993. Cambridge: Cambridge University Press. 179-192 (1997). Reviewer: Reviewer (Berlin) MSC: 03D20 03D15 PDF BibTeX XML Cite \textit{W. A. Deuber} and \textit{W. Thumser}, in: Combinatorics, geometry and probability. A tribute to Paul Erdős. Proceedings of the conference dedicated to Paul Erdős on the occasion of his 80th birthday, Cambridge, UK, 26 March 1993. Cambridge: Cambridge University Press. 179--192 (1997; Zbl 0949.03523)
Sprenger, Klaus-Hilmar Some hierarchies of primitive recursive functions on term algebras. (English) Zbl 0871.03031 Math. Log. Q. 43, No. 2, 251-286 (1997). Reviewer: W.I.Gasarch (College Park) MSC: 03D20 03D15 PDF BibTeX XML Cite \textit{K.-H. Sprenger}, Math. Log. Q. 43, No. 2, 251--286 (1997; Zbl 0871.03031) Full Text: DOI
Gakwaya, Jean-Sylvestre Extended Grzegorczyk hierarchy in the BSS model of computability. (English) Zbl 0867.68055 Cucker, Felipe (ed.) et al., Foundations of computational mathematics. Selected papers of a conference, held at IMPA in Rio de Janeiro, Brazil, January 1997. Berlin: Springer. 127-151 (1997). Reviewer: Reviewer (Berlin) MSC: 68Q15 PDF BibTeX XML Cite \textit{J.-S. Gakwaya}, in: Foundations of computational mathematics. Selected papers of a conference, held at IMPA in Rio de Janeiro, Brazil, January 1997. Berlin: Springer. 127--151 (1997; Zbl 0867.68055) Full Text: DOI
Kohlenbach, Ulrich Mathematically strong subsystems of analysis with low rate of growth of provably recursive functionals. (English) Zbl 0882.03050 Arch. Math. Logic 36, No. 1, 31-71 (1996). Reviewer: G.Mints (Stanford) MSC: 03F03 03D65 03F10 03F35 PDF BibTeX XML Cite \textit{U. Kohlenbach}, Arch. Math. Logic 36, No. 1, 31--71 (1996; Zbl 0882.03050) Full Text: DOI
Sprenger, Klaus-Hilmar Hierarchies of primitive recursive functions on term algebras. (English) Zbl 0942.03530 Berichte aus der Mathematik. Aachen: Shaker. Siegen: Univ.-GH Siegen, FB Math. 1995, 59 p (1996). Reviewer: Reviewer (Berlin) MSC: 03D20 03D15 PDF BibTeX XML Cite \textit{K.-H. Sprenger}, Hierarchies of primitive recursive functions on term algebras. Aachen: Shaker; Siegen: Univ.-GH Siegen, FB Math. 1995 (1996; Zbl 0942.03530)
Mashuryan, A. S. Representability of functions in finite models. Arithmetical theories. (English. Russian original) Zbl 0852.03017 J. Contemp. Math. Anal., Armen. Acad. Sci. 30, No. 1, 56-74 (1995); translation from Izv. Nats. Akad. Nauk Armen., Mat. 30, No. 1, 66-88 (1995). Reviewer: Reviewer (Berlin) MSC: 03D20 03C13 PDF BibTeX XML Cite \textit{A. S. Mashuryan}, J. Contemp. Math. Anal., Armen. Acad. Sci. 30, No. 1, 56--74 (1995; Zbl 0852.03017); translation from Izv. Nats. Akad. Nauk Armen., Mat. 30, No. 1, 66--88 (1995)
Weiermann, Andreas Investigations on slow versus fast growing: How to majorize slow growing functions nontrivially by fast growing ones. (English) Zbl 0842.03040 Arch. Math. Logic 34, No. 5, 313-330 (1995). Reviewer: Reviewer (Berlin) MSC: 03F15 03D20 03F35 03D15 68Q15 PDF BibTeX XML Cite \textit{A. Weiermann}, Arch. Math. Logic 34, No. 5, 313--330 (1995; Zbl 0842.03040) Full Text: DOI
Zelmanov, E. More on Burnside’s problem. (English) Zbl 0849.20031 Duncan, Andrew J. (ed.) et al., Combinatorial and geometric group theory. Proceedings of a workshop held at Heriot-Watt University, Edinburgh, GB, spring of 1993. Cambridge: Cambridge University Press. Lond. Math. Soc. Lect. Note Ser. 204, 314-321 (1995). Reviewer: E.Khukhro (Cardiff) MSC: 20F50 20D15 20D60 20F40 20E10 17B60 PDF BibTeX XML Cite \textit{E. Zelmanov}, Lond. Math. Soc. Lect. Note Ser. 204, 314--321 (1995; Zbl 0849.20031)
Cornaros, Ch. On Grzegorczyk induction. (English) Zbl 0826.03027 Ann. Pure Appl. Logic 74, No. 1, 1-21 (1995). Reviewer: R.Murawski (Poznań) MSC: 03F30 PDF BibTeX XML Cite \textit{Ch. Cornaros}, Ann. Pure Appl. Logic 74, No. 1, 1--21 (1995; Zbl 0826.03027) Full Text: DOI
Friedman, Harvey; Sheard, Michael Elementary descent recursion and proof theory. (English) Zbl 0821.03027 Ann. Pure Appl. Logic 71, No. 1, 1-45 (1995). Reviewer: G.Mints (Stanford) MSC: 03F03 03F30 03F15 03D20 PDF BibTeX XML Cite \textit{H. Friedman} and \textit{M. Sheard}, Ann. Pure Appl. Logic 71, No. 1, 1--45 (1995; Zbl 0821.03027) Full Text: DOI
Deuber, Walter A.; Thumser, Wolfgang A combinatorial approach to complexity theory via ordinal hierarchies. (English) Zbl 0814.03032 Comb. Probab. Comput. 3, No. 2, 177-190 (1994). Reviewer: Qian Lei (Nanjing) MSC: 03D20 03D15 PDF BibTeX XML Cite \textit{W. A. Deuber} and \textit{W. Thumser}, Comb. Probab. Comput. 3, No. 2, 177--190 (1994; Zbl 0814.03032) Full Text: DOI
Amir, Amihood; Smith, Carl H. The syntax of parallelism. (English) Zbl 0785.68034 Ann. Soc. Math. Pol., Ser. IV, Fundam. Inf. 19, No. 3-4, 383-402 (1993). Reviewer: Reviewer (Berlin) MSC: 68Q10 68N20 PDF BibTeX XML Cite \textit{A. Amir} and \textit{C. H. Smith}, Ann. Soc. Math. Pol., Ser. IV, Fundam. Inf. 19, No. 3--4, 383--402 (1993; Zbl 0785.68034)
Zheng, Xizhong Double recursive functions and their hierarchy. (Chinese. English summary) Zbl 0777.03014 J. Math. Res. Expo. 13, No. 2, 303-308 (1993). Reviewer: Zheng Xizhong (Nanjing) MSC: 03D20 PDF BibTeX XML Cite \textit{X. Zheng}, J. Math. Res. Expo. 13, No. 2, 303--308 (1993; Zbl 0777.03014)
Mo, Shaokui The solution of Scholz problems. (Chinese) Zbl 0729.03004 Chin. Ann. Math., Ser. A 12, No. 1, 89-97 (1991). Reviewer: Mo Shaokui MSC: 03B10 03C13 03D20 PDF BibTeX XML Cite \textit{S. Mo}, Chin. Ann. Math., Ser. A 12, No. 1, 89--97 (1991; Zbl 0729.03004)
Sieg, Wilfried Herbrand analyses. (English) Zbl 0722.03040 Arch. Math. Logic 30, No. 5-6, 409-441 (1991). Reviewer: M.Yasuhara (Princeton) MSC: 03F03 03F30 03F35 PDF BibTeX XML Cite \textit{W. Sieg}, Arch. Math. Logic 30, No. 5--6, 409--441 (1991; Zbl 0722.03040) Full Text: DOI
Reingold, Edward M.; Shen, Xiaojun More nearly optimal algorithms for unbounded searching. II: The transfinite case. (English) Zbl 0716.68047 SIAM J. Comput. 20, No. 1, 184-208 (1991). Reviewer: Reviewer (Berlin) MSC: 68Q25 94A45 26A12 68W10 03E10 PDF BibTeX XML Cite \textit{E. M. Reingold} and \textit{X. Shen}, SIAM J. Comput. 20, No. 1, 184--208 (1991; Zbl 0716.68047) Full Text: DOI
Marchenkov, S. S. Superposition bases in classes of recursive functions. (Russian) Zbl 0745.03033 Mat. Vopr. Kibern. 3, 115-139 (1991). Reviewer: M.M.Arslanov (Kazan’) MSC: 03D20 PDF BibTeX XML Cite \textit{S. S. Marchenkov}, Mat. Vopr. Kibern. 3, 115--139 (1991; Zbl 0745.03033)
Leivant, Daniel Stratified polymorphism. (English) Zbl 0716.68019 Logic in computer science, Proc. 4th Annual Symp., Pacific Grove/CA (USA) 1989, 39-47 (1989). Reviewer: Reviewer (Berlin) MSC: 68N15 03B40 03D20 68N01 PDF BibTeX XML
Thumser, Wolfgang On upper bounds for Kanamori McAloon functions. (English) Zbl 0693.03030 Bielefeld: Univ. Bielefeld, Fac. Math., Thesis. 64 p. (1989). Reviewer: M.Yasuhara MSC: 03D99 05C55 03D20 03-02 PDF BibTeX XML
Madlener, Klaus; Otto, Friedrich Pseudo-natural algorithms for finitely generated presentations of monoids and groups. (English) Zbl 0665.20019 J. Symb. Comput. 5, No. 3, 339-358 (1988). Reviewer: M.Garzon MSC: 20F10 20F05 20M05 20M35 68Q45 PDF BibTeX XML Cite \textit{K. Madlener} and \textit{F. Otto}, J. Symb. Comput. 5, No. 3, 339--358 (1988; Zbl 0665.20019) Full Text: DOI
Kutyłowski, Mirosław Small Grzegorczyk classes. (English) Zbl 0641.03029 J. Lond. Math. Soc., II. Ser. 36, No. 1-2, 193-210 (1987). Reviewer: M.Zimand MSC: 03D20 PDF BibTeX XML Cite \textit{M. Kutyłowski}, J. Lond. Math. Soc., II. Ser. 36, No. 1--2, 193--210 (1987; Zbl 0641.03029) Full Text: DOI
Kutyłowski, Mirosław A generalized Grzegorczyk hierarchy and low complexity classes. (English) Zbl 0637.03036 Inf. Comput. 72, 133-149 (1987). Reviewer: G.B.Marandzjan MSC: 03D15 03D20 03D10 PDF BibTeX XML Cite \textit{M. Kutyłowski}, Inf. Comput. 72, 133--149 (1987; Zbl 0637.03036) Full Text: DOI
Buzeţeanu, Şerban; Calude, Cristian Functions having the graph in the \(n\)-th Grzegorczyk class. (English) Zbl 0625.03020 Found. Control Eng. 11, 61-67 (1986). Reviewer: Reviewer (Berlin) MSC: 03D15 03D20 PDF BibTeX XML Cite \textit{Ş. Buzeţeanu} and \textit{C. Calude}, Found. Control Eng. 11, 61--67 (1986; Zbl 0625.03020)
Madlener, K.; Otto, F. Derivation-bounded groups. (English) Zbl 0614.03041 Rev. Colomb. Mat. 19, 131-161 (1985). Reviewer: O.V.Belegradek MSC: 03D40 20F10 03D20 PDF BibTeX XML Cite \textit{K. Madlener} and \textit{F. Otto}, Rev. Colomb. Mat. 19, 131--161 (1985; Zbl 0614.03041) Full Text: EuDML
Gandy, R. O. Some relations between classes of low computational complexity. (English) Zbl 0567.03018 Bull. Lond. Math. Soc. 16, 127-134 (1984). Reviewer: E.Heinrich MSC: 03D20 03D15 PDF BibTeX XML Cite \textit{R. O. Gandy}, Bull. Lond. Math. Soc. 16, 127--134 (1984; Zbl 0567.03018) Full Text: DOI
Calude, Cristian; Tătărăm, Monica Universal sequences of primitive recursive functions. (English) Zbl 0535.03017 Rev. Roum. Math. Pures Appl. 28, 381-389 (1983). Reviewer: Reviewer (Berlin) MSC: 03D20 PDF BibTeX XML Cite \textit{C. Calude} and \textit{M. Tătărăm}, Rev. Roum. Math. Pures Appl. 28, 381--389 (1983; Zbl 0535.03017)
Börger, Egon Note on bounded diophantine representation of subrecursive sets. (English) Zbl 0531.03026 Ber., Abt. Inf., Univ. Dortm. 138, 11 p. (1982). Reviewer: Reviewer (Berlin) MSC: 03D25 11D99 03D20 PDF BibTeX XML
Schmerl, Ulf R. Über die schwach und die stark wachsende Hierarchie zahlentheoretischer Funktionen. (German) Zbl 0501.03028 Sitzungsber., Bayer. Akad. Wiss., Math.-Naturwiss. Kl. 1981, 1-18 (1982). MSC: 03D55 PDF BibTeX XML Cite \textit{U. R. Schmerl}, Sitzungsber., Bayer. Akad. Wiss., Math.-Naturwiss. Kl. 1981, 1--18 (1982; Zbl 0501.03028)
Proskurin, A. V. Positive rudimentarity of the graphs of Ackermann and Grzegorczyk. (English) Zbl 0493.03017 J. Sov. Math. 20, 2363-2366 (1982). MSC: 03D20 PDF BibTeX XML Cite \textit{A. V. Proskurin}, J. Sov. Math. 20, 2363--2366 (1982; Zbl 0493.03017) Full Text: DOI
Bel’tyukov, A. P. A machine description and the hierarchy of initial Grzegorczyk classes. (English) Zbl 0493.03012 J. Sov. Math. 20, 2280-2289 (1982). MSC: 03D10 03D15 03D20 PDF BibTeX XML Cite \textit{A. P. Bel'tyukov}, J. Sov. Math. 20, 2280--2289 (1982; Zbl 0493.03012) Full Text: DOI
Schmerl, James H.; Simpson, Stephen G. On the role of Ramsey quantifiers in first order arithmetic. (English) Zbl 0492.03015 J. Symb. Log. 47, 423-435 (1982). MSC: 03C80 03F30 03B25 03C10 03C62 PDF BibTeX XML Cite \textit{J. H. Schmerl} and \textit{S. G. Simpson}, J. Symb. Log. 47, 423--435 (1982; Zbl 0492.03015) Full Text: DOI
Avenhaus, J.; Madlener, K. An algorithm for the word problem in HNN extensions and the dependence of its complexity on the group representation. (English) Zbl 0494.20020 RAIRO, Inf. Théor. 15, 355-371 (1981). MSC: 20F10 20E06 20D15 03D45 03D20 PDF BibTeX XML Cite \textit{J. Avenhaus} and \textit{K. Madlener}, RAIRO, Inf. Théor. 15, 355--371 (1981; Zbl 0494.20020) Full Text: EuDML
Matrosov, V. L. Complexity of computable functions for a generalized storage measure. (English) Zbl 0492.68042 Math. Notes 29, 457-462 (1981). MSC: 68Q25 03D60 03D20 03D15 PDF BibTeX XML Cite \textit{V. L. Matrosov}, Math. Notes 29, 457--462 (1981; Zbl 0492.68042) Full Text: DOI
Matrosov, V. L. Complexity of computable functions for a generalized measure of memory. (Russian) Zbl 0481.68050 Mat. Zametki 29, 895-905 (1981). MSC: 68Q25 03D20 03D60 03D15 PDF BibTeX XML Cite \textit{V. L. Matrosov}, Mat. Zametki 29, 895--905 (1981; Zbl 0481.68050)
Calude, Cristian Darboux property and primitive recursive functions. (English) Zbl 0481.03028 Rev. Roum. Math. Pures Appl. 26, 1187-1192 (1981). MSC: 03D55 03D20 PDF BibTeX XML Cite \textit{C. Calude}, Rev. Roum. Math. Pures Appl. 26, 1187--1192 (1981; Zbl 0481.03028)
Tao, Ren-ji On the computational power of automata with time or space bounded by Ackermann’s or superexponential functions. (English) Zbl 0475.03018 Theor. Comput. Sci. 16, 115-148 (1981). MSC: 03D20 03D10 03D15 03D60 03D05 PDF BibTeX XML Cite \textit{R.-j. Tao}, Theor. Comput. Sci. 16, 115--148 (1981; Zbl 0475.03018) Full Text: DOI
Dima, Nelu Sudan function is universal for the class of primitive recursive functions. (Romanian) Zbl 0467.03039 Stud. Cercet. Mat. 33, 59-67 (1981). MSC: 03D20 03D55 PDF BibTeX XML Cite \textit{N. Dima}, Stud. Cercet. Mat. 33, 59--67 (1981; Zbl 0467.03039)
Amihud, Amir; Choueka, Yaacov Loop-programs and polynomially computable functions. (English) Zbl 0456.68049 Int. J. Comput. Math. 9, 195-205 (1981). MSC: 03D60 03D20 68N01 PDF BibTeX XML Cite \textit{A. Amihud} and \textit{Y. Choueka}, Int. J. Comput. Math. 9, 195--205 (1981; Zbl 0456.68049) Full Text: DOI
Bel’tyukov, A. P. An iterative description of the class \(\mathcal E^1\) of Grzegorczyk’s hierarchy. (English) Zbl 0449.03033 J. Sov. Math. 14, 1429-1436 (1980). MSC: 03D20 03D10 03D15 PDF BibTeX XML Cite \textit{A. P. Bel'tyukov}, J. Sov. Math. 14, 1429--1436 (1980; Zbl 0449.03033) Full Text: DOI
Naumovic, Jovan Klassifizierungen der einstelligen primitiv-rekursiven Funktionen nach der Anzahl der Iterationen. (German) Zbl 0434.03026 Fachbereich Mathematik-Informatik der Gesamthochschule Paderborn. 49 S. (1980). MSC: 03D20 PDF BibTeX XML
Proskurin, A. V. Positive rudimentarity of the graphs of Ackermann’s and Grzegorczyk’s functions. (Russian) Zbl 0429.03023 Zap. Nauchn. Semin. Leningr. Otd. Mat. Inst. Steklova 88, 186-191 (1979). MSC: 03D20 PDF BibTeX XML Cite \textit{A. V. Proskurin}, Zap. Nauchn. Semin. Leningr. Otd. Mat. Inst. Steklova 88, 186--191 (1979; Zbl 0429.03023) Full Text: EuDML
Bel’tyukov, A. P. A machine description and a hierarchy of initial Grzegorczyk’s classes. (Russian) Zbl 0429.03017 Zap. Nauchn. Semin. Leningr. Otd. Mat. Inst. Steklova 88, 30-46 (1979). MSC: 03D10 03D15 03D20 PDF BibTeX XML Cite \textit{A. P. Bel'tyukov}, Zap. Nauchn. Semin. Leningr. Otd. Mat. Inst. Steklova 88, 30--46 (1979; Zbl 0429.03017) Full Text: EuDML
Verbeek, Rutger On the naturalness of the Grzegorczyk hierarchy. (English) Zbl 0426.03041 Fundamentals of computation theory ’79, Proc. Conf., Berlin/ Wendisch- Rietz 1979, 483-490 (1979). MSC: 03D20 03D15 PDF BibTeX XML
Klette, R.; Goetze, B. Ein Normalformentheorem für \(\Sigma_2\)-Funktionen. (German) Zbl 0403.03030 Elektron. Inform.-verarb. Kybernetik 14, 251-256 (1978). MSC: 03D20 PDF BibTeX XML Cite \textit{R. Klette} and \textit{B. Goetze}, Elektron. Informationsverarbeitung Kybernetik 14, 251--256 (1978; Zbl 0403.03030)
Kosovskij, N. K. On classes of functions defined by addition. (Russian) Zbl 0429.03025 Vychisl. Tekh. Vopr. Kibern. 14, 54-60 (1977). MSC: 03D20 PDF BibTeX XML Cite \textit{N. K. Kosovskij}, Vychisl. Tekh. Vopr. Kibern. 14, 54--60 (1977; Zbl 0429.03025)
Pakhomov, S. V. A simple syntactic definition of all classes of the Grzegorczyk hierarchy. (English) Zbl 0404.03035 J. Sov. Math. 8, 334-337 (1977). MSC: 03D55 PDF BibTeX XML Cite \textit{S. V. Pakhomov}, J. Sov. Math. 8, 334--337 (1977; Zbl 0404.03035) Full Text: DOI
Vinogradov, A. K.; Kosovskij, N. K. Hierarchy of Diophantine representations of primitive recursive predicates. (Russian) Zbl 0448.03030 Vychisl. Tekh. Vopr. Kibern. 12, 99-107 (1975). MSC: 03D20 PDF BibTeX XML Cite \textit{A. K. Vinogradov} and \textit{N. K. Kosovskij}, Vychisl. Tekh. Vopr. Kibern. 12, 99--107 (1975; Zbl 0448.03030)
Ausiello, G. Un linguaggio di programmazione per le funzioni subricorsive. (Italian) Zbl 0427.03030 Quad., Ser. III, Ist. Appl. Calcolo 8, 5-43 (1974). MSC: 03D20 03D15 68N01 PDF BibTeX XML Cite \textit{G. Ausiello}, Quad., Ser. III, Ist. Appl. Calcolo 8, 5--43 (1974; Zbl 0427.03030)