Melnikov, Alexander G.; Selivanov, Victor L.; Yamaleev, Mars M. Turing reducibility in the fine hierarchy. (English) Zbl 07207183 Ann. Pure Appl. Logic 171, No. 7, Article ID 102766, 16 p. (2020). MSC: 03D28 03D55 03D30 03D28 PDF BibTeX XML Cite \textit{A. G. Melnikov} et al., Ann. Pure Appl. Logic 171, No. 7, Article ID 102766, 16 p. (2020; Zbl 07207183) Full Text: DOI
Bilanovic, Iva; Chubb, Jennifer; Roven, Sam Detecting properties from descriptions of groups. (English) Zbl 07184233 Arch. Math. Logic 59, No. 3-4, 293-312 (2020). MSC: 03D80 20F10 06F15 03D40 20F05 PDF BibTeX XML Cite \textit{I. Bilanovic} et al., Arch. Math. Logic 59, No. 3--4, 293--312 (2020; Zbl 07184233) Full Text: DOI
Selivanov, V. L.; Yamaleev, M. M. Turing degrees in refinements of the arithmetical hierarchy. (English. Russian original) Zbl 07001970 Algebra Logic 57, No. 3, 222-236 (2018); translation from Algebra Logika 57, No. 3, 338-361 (2018). MSC: 03D28 03D25 03D55 PDF BibTeX XML Cite \textit{V. L. Selivanov} and \textit{M. M. Yamaleev}, Algebra Logic 57, No. 3, 222--236 (2018; Zbl 07001970); translation from Algebra Logika 57, No. 3, 338--361 (2018) Full Text: DOI
Selivanov, Victor L.; Yamaleev, Mars M. Extending Cooper’s theorem to \(\Delta_3^0\) Turing degrees. (English) Zbl 1435.03071 Computability 7, No. 2-3, 289-300 (2018). MSC: 03D28 03D25 03D55 PDF BibTeX XML Cite \textit{V. L. Selivanov} and \textit{M. M. Yamaleev}, Computability 7, No. 2--3, 289--300 (2018; Zbl 1435.03071) Full Text: DOI
Cooper, S. Barry; Gay, James; Harris, Charles M.; Lee, Kyung Il; Morphett, Anthony Linearisations and the Ershov hierarchy. (English) Zbl 1435.03075 Computability 7, No. 2-3, 143-169 (2018). MSC: 03D45 03D55 PDF BibTeX XML Cite \textit{S. B. Cooper} et al., Computability 7, No. 2--3, 143--169 (2018; Zbl 1435.03075) Full Text: DOI
Leike, Jan; Hutter, Marcus On the computability of Solomonoff induction and AIXI. (English) Zbl 1388.68253 Theor. Comput. Sci. 716, 28-49 (2018). MSC: 68T05 03D15 68Q30 PDF BibTeX XML Cite \textit{J. Leike} and \textit{M. Hutter}, Theor. Comput. Sci. 716, 28--49 (2018; Zbl 1388.68253) Full Text: DOI
Zetzsche, Georg; Kuske, Dietrich; Lohrey, Markus On Boolean closed full trios and rational Kripke frames. (English) Zbl 1366.68155 Theory Comput. Syst. 60, No. 3, 438-472 (2017). MSC: 68Q45 PDF BibTeX XML Cite \textit{G. Zetzsche} et al., Theory Comput. Syst. 60, No. 3, 438--472 (2017; Zbl 1366.68155) Full Text: DOI
Xu, Zhaowei; Zhang, Wenhui; Sui, Yuefei Completeness of Hoare logic relative to the standard model. (English) Zbl 1444.03122 Steffen, Bernhard (ed.) et al., SOFSEM 2017: theory and practice of computer science. 43rd international conference on current trends in theory and practice of computer science, Limerick, Ireland, January 16–20, 2017, Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10139, 119-131 (2017). MSC: 03B70 03C62 03F30 PDF BibTeX XML Cite \textit{Z. Xu} et al., Lect. Notes Comput. Sci. 10139, 119--131 (2017; Zbl 1444.03122) Full Text: DOI
Cummings, Rachel; Doty, David; Soloveichik, David Probability 1 computation with chemical reaction networks. (English) Zbl 1415.68077 Nat. Comput. 15, No. 2, 245-261 (2016). MSC: 68Q05 68Q10 68Q87 92E20 PDF BibTeX XML Cite \textit{R. Cummings} et al., Nat. Comput. 15, No. 2, 245--261 (2016; Zbl 1415.68077) Full Text: DOI
Simpson, Stephen G. Implicit definability in arithmetic. (English) Zbl 1401.03082 Notre Dame J. Formal Logic 57, No. 3, 329-339 (2016). MSC: 03D55 03D30 03D28 03C40 03D80 PDF BibTeX XML Cite \textit{S. G. Simpson}, Notre Dame J. Formal Logic 57, No. 3, 329--339 (2016; Zbl 1401.03082) Full Text: DOI Euclid
Nourani, Cyrus F. Algebraic computability and enumeration models. Recursion theory and descriptive complexity. (English) Zbl 1439.03006 Boca Raton, FL: CRC Press/Apple Academic Press (ISBN 978-1-77188-247-7/hbk; 978-1-77188-248-4/ebook). xiv, 295 p. (2016). MSC: 03-02 03D20 03D15 03D65 PDF BibTeX XML Cite \textit{C. F. Nourani}, Algebraic computability and enumeration models. Recursion theory and descriptive complexity. Boca Raton, FL: CRC Press/Apple Academic Press (2016; Zbl 1439.03006) Full Text: DOI
Leike, Jan; Hutter, Marcus On the computability of Solomonoff induction and knowledge-seeking. (English) Zbl 1388.68252 Chaudhuri, Kamalika (ed.) et al., Algorithmic learning theory. 26th international conference, ALT 2015, Banff, AB, Canada, October 4–6, 2015. Proceedings. Cham: Springer (ISBN 978-3-319-24485-3/pbk; 978-3-319-24486-0/ebook). Lecture Notes in Computer Science 9355. Lecture Notes in Artificial Intelligence, 364-378 (2015). MSC: 68T05 03D15 68Q30 PDF BibTeX XML Cite \textit{J. Leike} and \textit{M. Hutter}, Lect. Notes Comput. Sci. 9355, 364--378 (2015; Zbl 1388.68252) Full Text: DOI
Kalinina, I. S.; Marchenkov, S. S. On complexity of problem of satisfiability for systems of countable-valued functional equations. (English. Russian original) Zbl 1337.39006 Russ. Math. 59, No. 8, 19-24 (2015); translation from Izv. Vyssh. Uchebn. Zaved., Mat. 2015, No. 8, 25–32 (2015). Reviewer: Hark-Mahn Kim (Daejeon) MSC: 39B72 39B32 PDF BibTeX XML Full Text: DOI
Bosserhoff, Volker; Hertling, Peter Effective subsets under homeomorphisms of \(\mathbb{R}^n\). (English) Zbl 1337.03066 Inf. Comput. 245, 197-212 (2015). Reviewer: Danko Ilik (Paris) MSC: 03D78 03F60 PDF BibTeX XML Cite \textit{V. Bosserhoff} and \textit{P. Hertling}, Inf. Comput. 245, 197--212 (2015; Zbl 1337.03066) Full Text: DOI
Jeandel, Emmanuel; Vanier, Pascal Hardness of conjugacy, embedding and factorization of multidimensional subshifts. (English) Zbl 1328.68074 J. Comput. Syst. Sci. 81, No. 8, 1648-1664 (2015). MSC: 68Q17 37B50 PDF BibTeX XML Cite \textit{E. Jeandel} and \textit{P. Vanier}, J. Comput. Syst. Sci. 81, No. 8, 1648--1664 (2015; Zbl 1328.68074) Full Text: DOI
Boyer, L.; Delacourt, M.; Poupet, V.; Sablik, M.; Theyssier, G. \(\mu\)-limit sets of cellular automata from a computational complexity perspective. (English) Zbl 1329.68178 J. Comput. Syst. Sci. 81, No. 8, 1623-1647 (2015). Reviewer: Cristian S. Calude (Auckland) MSC: 68Q80 68Q25 PDF BibTeX XML Cite \textit{L. Boyer} et al., J. Comput. Syst. Sci. 81, No. 8, 1623--1647 (2015; Zbl 1329.68178) Full Text: DOI
Sureson, Claude Random reals as measures of natural open sets. (English) Zbl 1327.03035 Theor. Comput. Sci. 589, 1-23 (2015). Reviewer: Ludwig Staiger (Halle/Saale) MSC: 03D32 68Q30 PDF BibTeX XML Cite \textit{C. Sureson}, Theor. Comput. Sci. 589, 1--23 (2015; Zbl 1327.03035) Full Text: DOI
Lohrey, Markus; Zetzsche, Georg On Boolean closed full trios and rational Kripke frames. (English) Zbl 1359.68174 Mayr, Ernst W. (ed.) et al., 31st international symposium on theoretical aspects of computer science, STACS’ 14, Lyon, France, March 5–8, 2014. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-65-1). LIPIcs – Leibniz International Proceedings in Informatics 25, 530-541 (2014). MSC: 68Q45 PDF BibTeX XML Cite \textit{M. Lohrey} and \textit{G. Zetzsche}, LIPIcs -- Leibniz Int. Proc. Inform. 25, 530--541 (2014; Zbl 1359.68174) Full Text: DOI
Faizrakhmanov, M. Kh. On arithmetical level of the class of superhigh sets. (English. Russian original) Zbl 06362762 Russ. Math. 58, No. 5, 43-47 (2014); translation from Izv. Vyssh. Uchebn. Zaved., Mat. 2014, No. 5, 53-58 (2014). MSC: 03D30 03D25 03D32 PDF BibTeX XML Cite \textit{M. Kh. Faizrakhmanov}, Russ. Math. 58, No. 5, 43--47 (2014; Zbl 06362762); translation from Izv. Vyssh. Uchebn. Zaved., Mat. 2014, No. 5, 53--58 (2014) Full Text: DOI
Badillo, Liliana; Harris, Charles M. Avoiding uniformity in the \(\Delta_2^0\) enumeration degrees. (English) Zbl 1351.03030 Ann. Pure Appl. Logic 165, No. 9, 1355-1379 (2014). MSC: 03D30 03D15 03D25 03D55 PDF BibTeX XML Cite \textit{L. Badillo} and \textit{C. M. Harris}, Ann. Pure Appl. Logic 165, No. 9, 1355--1379 (2014; Zbl 1351.03030) Full Text: DOI
Kalociński, Dariusz On computability and learnability of the pumping lemma function. (English) Zbl 1407.68260 Dediu, Adrian-Horia (ed.) et al., Language and automata theory and applications. 8th international conference, LATA 2014, Madrid, Spain, March 10–14, 2014. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 8370, 433-440 (2014). MSC: 68Q45 03D20 68Q32 PDF BibTeX XML Cite \textit{D. Kalociński}, Lect. Notes Comput. Sci. 8370, 433--440 (2014; Zbl 1407.68260) Full Text: DOI
Leivant, Daniel M. Alternating Turing machines for inductive languages. (English) Zbl 1322.03030 Log. Methods Comput. Sci. 9, No. 3, Paper No. 31, 12 p. (2013). Reviewer: Stela K. Nikolova (Sofia) MSC: 03D10 03D60 03D70 PDF BibTeX XML Cite \textit{D. M. Leivant}, Log. Methods Comput. Sci. 9, No. 3, Paper No. 31, 12 p. (2013; Zbl 1322.03030) Full Text: DOI
Kuske, Dietrich; Liu, Jiamou; Lohrey, Markus The isomorphism problem on classes of automatic structures with transitive relations. (English) Zbl 1308.03049 Trans. Am. Math. Soc. 365, No. 10, 5103-5151 (2013). Reviewer: Marat M. Arslanov (Kazan) MSC: 03D05 03D45 03C57 PDF BibTeX XML Cite \textit{D. Kuske} et al., Trans. Am. Math. Soc. 365, No. 10, 5103--5151 (2013; Zbl 1308.03049) Full Text: DOI
Gheorghe, Marian; Stannett, Mike Membrane system models for super-Turing paradigms. (English) Zbl 1339.68081 Nat. Comput. 11, No. 2, 253-259 (2012). MSC: 68Q05 PDF BibTeX XML Cite \textit{M. Gheorghe} and \textit{M. Stannett}, Nat. Comput. 11, No. 2, 253--259 (2012; Zbl 1339.68081) Full Text: DOI
Kjos-Hanssen, Bjørn; Stephan, Frank; Teutsch, Jason Arithmetic complexity via effective names for random sequences. (English) Zbl 1352.03047 ACM Trans. Comput. Log. 13, No. 3, Article No. 24, 18 p. (2012). MSC: 03D32 03D25 PDF BibTeX XML Cite \textit{B. Kjos-Hanssen} et al., ACM Trans. Comput. Log. 13, No. 3, Article No. 24, 18 p. (2012; Zbl 1352.03047) Full Text: DOI arXiv
Jeż, Artur; Okhotin, Alexander Representing hyper-arithmetical sets by equations over sets of integers. (English) Zbl 1279.68158 Theory Comput. Syst. 51, No. 2, 196-228 (2012). MSC: 68Q45 PDF BibTeX XML Cite \textit{A. Jeż} and \textit{A. Okhotin}, Theory Comput. Syst. 51, No. 2, 196--228 (2012; Zbl 1279.68158) Full Text: DOI
van Leeuwen, Jan; Wiedermann, Jiří Computation as an unbounded process. (English) Zbl 1279.68089 Theor. Comput. Sci. 429, 202-212 (2012). MSC: 68Q05 68Q15 PDF BibTeX XML Cite \textit{J. van Leeuwen} and \textit{J. Wiedermann}, Theor. Comput. Sci. 429, 202--212 (2012; Zbl 1279.68089) Full Text: DOI
Schnabl, Andreas; Simonsen, Jakob Grue The exact hardness of deciding derivational and runtime complexity. (English) Zbl 1247.03072 Bezem, Marc (ed.), Computer science logic (CSL’11). 25th international workshop, 20th annual conference of the EACSL, Bergen, Norway, September 12–15, 2011. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-32-3). LIPIcs – Leibniz International Proceedings in Informatics 12, 481-495, electronic only (2011). MSC: 03D15 03B25 68Q42 PDF BibTeX XML Cite \textit{A. Schnabl} and \textit{J. G. Simonsen}, LIPIcs -- Leibniz Int. Proc. Inform. 12, 481--495 (2011; Zbl 1247.03072) Full Text: DOI Link
Barmpalias, George; Nies, André Upper bounds on ideals in the computably enumerable Turing degrees. (English) Zbl 1227.03055 Ann. Pure Appl. Logic 162, No. 6, 465-473 (2011). Reviewer: Roland Sh. Omanadze (Tbilisi) MSC: 03D25 PDF BibTeX XML Cite \textit{G. Barmpalias} and \textit{A. Nies}, Ann. Pure Appl. Logic 162, No. 6, 465--473 (2011; Zbl 1227.03055) Full Text: DOI
Statman, Rick Cartesian monoids. (English) Zbl 1343.03047 Mislove, Michael (ed.) et al., Proceedings of the 26th conference on the mathematical foundations of programming semantics (MFPS 2010), Ottawa, Canada, May 6–10, 2010. Amsterdam: Elsevier. Electronic Notes in Theoretical Computer Science 265, 437-451 (2010). MSC: 03G25 03B40 68N30 PDF BibTeX XML Cite \textit{R. Statman}, Electron. Notes Theor. Comput. Sci. 265, 437--451 (2010; Zbl 1343.03047) Full Text: DOI
Jeż, Artur; Okhotin, Alexander On equations over sets of integers. (English) Zbl 1230.68132 Marion, Jean-Yves (ed.) et al., STACS 2010. 27th international symposium on theoretical aspects of computer science, Nancy, France, March 4–6, 2010. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-16-3). LIPIcs – Leibniz International Proceedings in Informatics 5, 477-488, electronic only (2010). MSC: 68Q45 03B70 PDF BibTeX XML Cite \textit{A. Jeż} and \textit{A. Okhotin}, LIPIcs -- Leibniz Int. Proc. Inform. 5, 477--488 (2010; Zbl 1230.68132) Full Text: DOI Link
Hemmerling, Armin Function operators spanning the arithmetical and the polynomial hierarchy. (English) Zbl 1213.68294 RAIRO, Theor. Inform. Appl. 44, No. 3, 379-418 (2010). MSC: 68Q15 03D15 03D55 PDF BibTeX XML Cite \textit{A. Hemmerling}, RAIRO, Theor. Inform. Appl. 44, No. 3, 379--418 (2010; Zbl 1213.68294) Full Text: DOI EuDML
Cintula, Petr; Hájek, Petr Triangular norm based predicate fuzzy logics. (English) Zbl 1200.03020 Fuzzy Sets Syst. 161, No. 3, 311-346 (2010). Reviewer: Brunella Gerla (Varese) MSC: 03B52 03B50 03C90 PDF BibTeX XML Cite \textit{P. Cintula} and \textit{P. Hájek}, Fuzzy Sets Syst. 161, No. 3, 311--346 (2010; Zbl 1200.03020) Full Text: DOI
Conidis, Chris J. On the complexity of radicals in noncommutative rings. (English) Zbl 1182.03073 J. Algebra 322, No. 10, 3670-3680 (2009). Reviewer: Jeffry L. Hirst (Boone) MSC: 03D45 03E15 16N80 PDF BibTeX XML Cite \textit{C. J. Conidis}, J. Algebra 322, No. 10, 3670--3680 (2009; Zbl 1182.03073) Full Text: DOI
Hájek, Petr Arithmetical complexity of fuzzy predicate logics – a survey. II. (English) Zbl 1182.03050 Ann. Pure Appl. Logic 161, No. 2, 212-219 (2009). MSC: 03B52 03D55 PDF BibTeX XML Cite \textit{P. Hájek}, Ann. Pure Appl. Logic 161, No. 2, 212--219 (2009; Zbl 1182.03050) Full Text: DOI
Finkel, Olivier Highly undecidable problems for infinite computations. (English) Zbl 1171.03024 Theor. Inform. Appl. 43, No. 2, 339-364 (2009). MSC: 03D35 03D05 68Q05 68Q45 PDF BibTeX XML Cite \textit{O. Finkel}, Theor. Inform. Appl. 43, No. 2, 339--364 (2009; Zbl 1171.03024) Full Text: DOI EuDML
Podzorov, S. Yu. Arithmetical m-degrees. (Russian, English) Zbl 1224.03021 Sib. Mat. Zh. 49, No. 6, 1391-1410 (2008); translation in Sib. Math. J. 49, No. 6, 1109-1123 (2008). MSC: 03D45 03D25 PDF BibTeX XML Cite \textit{S. Yu. Podzorov}, Sib. Mat. Zh. 49, No. 6, 1391--1410 (2008; Zbl 1224.03021); translation in Sib. Math. J. 49, No. 6, 1109--1123 (2008) Full Text: EMIS EuDML
Knight, Julia F. The Kleene-Mostowski hierarchy and the Davis-Mostowski hierarchy. (English) Zbl 1180.03038 Ehrenfeucht, A. (ed.) et al., Andrzej Mostowski and foundational studies. Amsterdam: IOS Press (ISBN 978-1-58603-782-6/hbk). 171-197 (2008). Reviewer: Marat M. Arslanov (Kazan) MSC: 03C57 03D55 PDF BibTeX XML Cite \textit{J. F. Knight}, in: Andrzej Mostowski and foundational studies. Amsterdam: IOS Press. 171--197 (2008; Zbl 1180.03038)
Podzorov, Sergei Upper semilattices in many-one degrees. (English) Zbl 1142.03352 Beckmann, Arnold (ed.) et al., Logic and theory of algorithms. 4th conference on computability in Europe, CiE 2008, Athens, Greece, June 15–20, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-69405-2/pbk). Lecture Notes in Computer Science 5028, 491-497 (2008). MSC: 03D30 03D25 PDF BibTeX XML Cite \textit{S. Podzorov}, Lect. Notes Comput. Sci. 5028, 491--497 (2008; Zbl 1142.03352) Full Text: DOI
Stephan, Frank; Teutsch, Jason Immunity and hyperimmunity for sets of minimal indices. (English) Zbl 1142.03024 Notre Dame J. Formal Logic 49, No. 2, 107-125 (2008). Reviewer: Leon Harkleroad (Wilton) MSC: 03D28 03D30 03D45 03D55 PDF BibTeX XML Cite \textit{F. Stephan} and \textit{J. Teutsch}, Notre Dame J. Formal Logic 49, No. 2, 107--125 (2008; Zbl 1142.03024) Full Text: DOI
Hitchcock, John M.; Lutz, Jack H.; Terwijn, Sebastiaan A. The arithmetical complexity of dimension and randomness. (English) Zbl 1407.03057 ACM Trans. Comput. Log. 8, No. 2, Article No. 13, 22 p. (2007). MSC: 03D32 03D80 68Q30 PDF BibTeX XML Cite \textit{J. M. Hitchcock} et al., ACM Trans. Comput. Log. 8, No. 2, Article No. 13, 22 p. (2007; Zbl 1407.03057) Full Text: DOI
Domaratzki, Michael; Okhotin, Alexander; Shallit, Jeffrey Enumeration of context-free languages and related structures. (English) Zbl 1149.68046 J. Autom. Lang. Comb. 12, No. 1-2, 79-95 (2007). MSC: 68Q45 68Q42 PDF BibTeX XML Cite \textit{M. Domaratzki} et al., J. Autom. Lang. Comb. 12, No. 1--2, 79--95 (2007; Zbl 1149.68046) Full Text: DOI
Rovan, Branislav; Steskal, L’uboš Infinite computations and a hierarchy in \(\Delta _{3}\). (English) Zbl 1150.03316 Cooper, S. Barry (ed.) et al., Computation and logic in the real world. Third conference on computability in Europe, CiE 2007, Siena, Italy, June 18–23, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-73000-2/pbk). Lecture Notes in Computer Science 4497, 660-669 (2007). MSC: 03D10 03D55 03D05 PDF BibTeX XML Cite \textit{B. Rovan} and \textit{L. Steskal}, Lect. Notes Comput. Sci. 4497, 660--669 (2007; Zbl 1150.03316) Full Text: DOI
Hamkins, Joel D.; Linetsky, David; Miller, Russell The complexity of quickly ORM-decidable sets. (English) Zbl 1150.03321 Cooper, S. Barry (ed.) et al., Computation and logic in the real world. Third conference on computability in Europe, CiE 2007, Siena, Italy, June 18–23, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-73000-2/pbk). Lecture Notes in Computer Science 4497, 488-496 (2007). MSC: 03D60 03D10 03D55 PDF BibTeX XML Cite \textit{J. D. Hamkins} et al., Lect. Notes Comput. Sci. 4497, 488--496 (2007; Zbl 1150.03321) Full Text: DOI
Badaev, S. A.; Goncharov, S. S.; Sorbi, A. Isomorphism types of Rogers semilattices for families from different levels of the arithmetical hierarchy. (Russian, English) Zbl 1164.03340 Algebra Logika 45, No. 6, 637-654 (2006); translation in Algebra Logic 45, No. 6, 361-370 (2006). MSC: 03D25 03D45 03D55 PDF BibTeX XML Cite \textit{S. A. Badaev} et al., Algebra Logika 45, No. 6, 637--654 (2006; Zbl 1164.03340); translation in Algebra Logic 45, No. 6, 361--370 (2006) Full Text: DOI
Durand-Lose, Jérôme Forecasting black holes in abstract geometrical computation is highly unpredictable. (English) Zbl 1117.03045 Cai, Jin-Yi (ed.) et al., Theory and applications of models of computation. Third international conference, TAMC 2006, Beijing, China, May 15–20, 2006. Proceedings. Berlin: Springer (ISBN 3-540-34021-1/pbk). Lecture Notes in Computer Science 3959, 644-653 (2006). MSC: 03D10 68Q05 68Q80 PDF BibTeX XML Cite \textit{J. Durand-Lose}, Lect. Notes Comput. Sci. 3959, 644--653 (2006; Zbl 1117.03045) Full Text: DOI
Batyrshin, Ilnur I. Quasi-completeness and functions without fixed-points. (English) Zbl 1110.03026 Math. Log. Q. 52, No. 6, 595-601 (2006). MSC: 03D28 03D30 68Q30 PDF BibTeX XML Cite \textit{I. I. Batyrshin}, Math. Log. Q. 52, No. 6, 595--601 (2006; Zbl 1110.03026) Full Text: DOI
Hemmerling, Armin The Hausdorff-Ershov hierarchy in Euclidean spaces. (English) Zbl 1095.03031 Arch. Math. Logic 45, No. 3, 323-350 (2006). Reviewer: Ning Zhong (Cincinnati) MSC: 03D65 03D55 03E15 PDF BibTeX XML Cite \textit{A. Hemmerling}, Arch. Math. Logic 45, No. 3, 323--350 (2006; Zbl 1095.03031) Full Text: DOI
Badaev, S. A.; Goncharov, S. S.; Sorbi, Andrea Elementary theories for Rogers semilattices. (Russian, English) Zbl 1106.03041 Algebra Logika 44, No. 3, 261-268 (2005); translation in Algebra Logic 44, No. 3, 143-147 (2005). MSC: 03D45 PDF BibTeX XML Cite \textit{S. A. Badaev} et al., Algebra Logika 44, No. 3, 261--268 (2005; Zbl 1106.03041); translation in Algebra Logic 44, No. 3, 143--147 (2005) Full Text: DOI
Hájek, Petr A non-arithmetical Gödel logic. (English) Zbl 1086.03018 Log. J. IGPL 13, No. 4, 435-441 (2005). Reviewer: Vilém Novák (Ostrava) MSC: 03B52 PDF BibTeX XML Cite \textit{P. Hájek}, Log. J. IGPL 13, No. 4, 435--441 (2005; Zbl 1086.03018) Full Text: DOI
Prunescu, Mihai Two situations with unit-cost: ordered abelian semi-groups and some commutative rings. (English) Zbl 1096.03054 J. Complexity 21, No. 4, 579-592 (2005). MSC: 03D75 03D15 68Q15 03D10 03C60 06F05 PDF BibTeX XML Cite \textit{M. Prunescu}, J. Complexity 21, No. 4, 579--592 (2005; Zbl 1096.03054) Full Text: DOI
Bordihn, Henning; Bolzer, Markus; Kutrib, Martin Unsolvability levels of operation problems for subclasses of context-free languages. (English) Zbl 1097.68055 Int. J. Found. Comput. Sci. 16, No. 3, 423-440 (2005). MSC: 68Q45 68Q42 PDF BibTeX XML Cite \textit{H. Bordihn} et al., Int. J. Found. Comput. Sci. 16, No. 3, 423--440 (2005; Zbl 1097.68055) Full Text: DOI
Montagna, Franco On the predicate logics of continuous t-norm BL-algebras. (English) Zbl 1070.03013 Arch. Math. Logic 44, No. 1, 97-114 (2005). Reviewer: Rostislav Horcik (Praha) MSC: 03B52 03D15 03G25 03D35 PDF BibTeX XML Cite \textit{F. Montagna}, Arch. Math. Logic 44, No. 1, 97--114 (2005; Zbl 1070.03013) Full Text: DOI
Burr, Wolfgang The intuitionistic arithmetical hierarchy. (English) Zbl 1061.03064 van Eijck, Jan (ed.) et al., Logic colloquium ’99. Proceedings of the annual European summer meeting of the Association for Symbolic Logic, Utrecht, Netherlands, August 1–6, 1999. Natick, MA: A K Peters; Urbana, IL: Association for Symbolic Logic (ISBN 1-56881-203-5/pbk; 1-56881-199-3/hbk). Lecture Notes in Logic 17, 51-59 (2004). MSC: 03F30 03F55 PDF BibTeX XML Cite \textit{W. Burr}, Lect. Notes Log. 17, 51--59 (2004; Zbl 1061.03064)
Hemmerling, Armin Characterizations of the class \(\Delta^{\text{ta}}_{2}\) over Euclidean spaces. (English) Zbl 1058.03045 Math. Log. Q. 50, No. 4-5, 507-519 (2004). MSC: 03D65 03D55 03E15 03F60 26E40 68Q01 PDF BibTeX XML Cite \textit{A. Hemmerling}, Math. Log. Q. 50, No. 4--5, 507--519 (2004; Zbl 1058.03045) Full Text: DOI
Plisko, V. E. Predicate logics of constructive mathematical theories. (Russian) Zbl 1105.03063 Chebyshevskiĭ Sb. 4, No. 4(8), 121-136 (2003). Reviewer: Branislav Boričić (Beograd) MSC: 03F50 03D35 03F55 03-02 PDF BibTeX XML Cite \textit{V. E. Plisko}, Chebyshevskiĭ Sb. 4, No. 4(8), 121--136 (2003; Zbl 1105.03063)
Hemmerling, Armin Approximate decidability in Euclidean spaces. (English) Zbl 1024.03045 Math. Log. Q. 49, No. 1, 34-56 (2003). Reviewer: Oleg V.Belegradek (İstanbul) MSC: 03D80 03D45 03F60 68Q05 26E40 03D10 PDF BibTeX XML Cite \textit{A. Hemmerling}, Math. Log. Q. 49, No. 1, 34--56 (2003; Zbl 1024.03045) Full Text: DOI
Czenzer, Douglas; Remmel, Jeffrey B. Index sets for \(\omega\)-languages. (English) Zbl 1031.03064 Math. Log. Q. 49, No. 1, 22-33 (2003). Reviewer: Ludwig Staiger (Halle/Saale) MSC: 03D80 03D25 03D55 68Q45 PDF BibTeX XML Cite \textit{D. Czenzer} and \textit{J. B. Remmel}, Math. Log. Q. 49, No. 1, 22--33 (2003; Zbl 1031.03064) Full Text: DOI
Dobritsa, V. P. On index sets in generalized computable numberings. (Russian) Zbl 1132.03345 Mat. Zh. 2, No. 1, 38-42 (2002). MSC: 03D45 PDF BibTeX XML Cite \textit{V. P. Dobritsa}, Mat. Zh. 2, No. 1, 38--42 (2002; Zbl 1132.03345)
Goncharov, S. S.; Khusainov, B. Kh. Complexity of categorical theories with computable models. (English. Russian original) Zbl 1144.03307 Dokl. Math. 66, No. 1, 52-54 (2002); translation from Dokl. Akad. Nauk 385, No. 3, 299-301 (2002). MSC: 03C57 03D15 03C35 PDF BibTeX XML Cite \textit{S. S. Goncharov} and \textit{B. Kh. Khusainov}, Dokl. Math. 66, No. 1, 52--54 (2002; Zbl 1144.03307); translation from Dokl. Akad. Nauk 385, No. 3, 299--301 (2002)
Hájek, Petr Monadic fuzzy predicate logics. (English) Zbl 1006.03023 Stud. Log. 71, No. 2, 165-175 (2002). Reviewer: Vilém Novák (Ostrava) MSC: 03B52 03B50 PDF BibTeX XML Cite \textit{P. Hájek}, Stud. Log. 71, No. 2, 165--175 (2002; Zbl 1006.03023) Full Text: DOI
Chopra, Samir; Martin, Eric Generalized logical consequence: Making room for induction in the logic of science. (English) Zbl 1003.03006 J. Philos. Log. 31, No. 3, 245-280 (2002). MSC: 03A05 03B48 03B22 PDF BibTeX XML Cite \textit{S. Chopra} and \textit{E. Martin}, J. Philos. Log. 31, No. 3, 245--280 (2002; Zbl 1003.03006) Full Text: DOI
Hájek, Petr Fuzzy logic and arithmetical hierarchy. III. (English) Zbl 0988.03042 Stud. Log. 68, No. 1, 129-142 (2001). Reviewer: Siegfried Johannes Gottwald (Leipzig) MSC: 03B52 03D15 03B25 03B50 68Q17 PDF BibTeX XML Cite \textit{P. Hájek}, Stud. Log. 68, No. 1, 129--142 (2001; Zbl 0988.03042) Full Text: DOI
Zheng, Xizhong; Weihrauch, Klaus The arithmetical hierarchy of real numbers. (English) Zbl 0968.03075 Math. Log. Q. 47, No. 1, 51-65 (2001). Reviewer: Armin Hemmerling (Greifswald) MSC: 03F60 03D55 26E40 PDF BibTeX XML Cite \textit{X. Zheng} and \textit{K. Weihrauch}, Math. Log. Q. 47, No. 1, 51--65 (2001; Zbl 0968.03075) Full Text: DOI
Gentilini, Paolo Proof-theoretic modal PA-completeness. II: The syntactic countermodel. (English) Zbl 0952.03070 Stud. Log. 63, No. 2, 245-268 (1999). Reviewer: Mladen Vuković (Zagreb) MSC: 03F45 03F30 03B45 PDF BibTeX XML Cite \textit{P. Gentilini}, Stud. Log. 63, No. 2, 245--268 (1999; Zbl 0952.03070) Full Text: DOI
Zheng, Xizhong; Weihrauch, Klaus The arithmetical hierarchy of real numbers. (English) Zbl 0955.03066 Kutyłowski, Mirosław (ed.) et al., Mathematical foundations of computer science 1999. 24th international symposium, MFCS ’99, Szklarska Porȩba, Poland, September 6-10, 1999. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1672, 23-33 (1999). Reviewer: A.Hemmerling (Greifswald) MSC: 03F60 03D55 26E40 PDF BibTeX XML Cite \textit{X. Zheng} and \textit{K. Weihrauch}, Lect. Notes Comput. Sci. 1672, 23--33 (1999; Zbl 0955.03066)
Bournez, Olivier Achilles and the tortoise climbing up the hyper-arithmetical hierarchy. (English) Zbl 0912.68032 Theor. Comput. Sci. 210, No. 1, 21-71 (1999). MSC: 68Q05 03D55 PDF BibTeX XML Cite \textit{O. Bournez}, Theor. Comput. Sci. 210, No. 1, 21--71 (1999; Zbl 0912.68032) Full Text: DOI
Baaz, Matthias; Hájek, Petr; Krajíček, Jan; Švejda, David Embedding logics into product logic. (English) Zbl 0962.03019 Stud. Log. 61, No. 1, 35-47 (1998). MSC: 03B50 03B52 03D15 68Q17 PDF BibTeX XML Cite \textit{M. Baaz} et al., Stud. Log. 61, No. 1, 35--47 (1998; Zbl 0962.03019) Full Text: DOI
Podzorov, S. Yu. Arithmetical complexity of definable subsets of recursive Boolean algebras. (Russian) Zbl 0932.03050 Vychisl. Sist. 161, 129-140 (1998). Reviewer: A.S.Morozov (Novosibirsk) MSC: 03D45 03C57 06E05 PDF BibTeX XML Cite \textit{S. Yu. Podzorov}, Vychisl. Sist. 161, 129--140 (1998; Zbl 0932.03050)
Odintsov, S. P. Generally constructive Boolean algebras. (English) Zbl 0940.03048 Ershov, Yu. L. (ed.) et al., Handbook of recursive mathematics. Vol. 2: Recursive algebra, analysis and combinatorics. Amsterdam: Elsevier. Stud. Logic Found. Math. 139, 1319-1354 (1998). MSC: 03C57 06E05 03-02 PDF BibTeX XML Cite \textit{S. P. Odintsov}, Stud. Logic Found. Math. 139, 1319--1354 (1998; Zbl 0940.03048)
Slaman, Theodore A. Mathematical definability. (English) Zbl 0932.03054 Dales, H. G. (ed.) et al., Truth in mathematics. Lectures of a conference, Mussomeli, Sicily, Italy, September 13–20, 1995. Oxford: Clarendon Press. Oxford Science Publications. 233-251 (1998). Reviewer: Joseph S.Ullian (St.Louis) MSC: 03D55 03D80 03E45 03F35 03F30 PDF BibTeX XML Cite \textit{T. A. Slaman}, in: Truth in mathematics. Lectures of a conference, Mussomeli, Sicily, Italy, September 13--20, 1995. Oxford: Clarendon Press. 233--251 (1998; Zbl 0932.03054)
Burr, Wolfgang Functionals in set theory and arithmetic. (English) Zbl 0940.03064 Münster: Univ. Münster, FB Mathematik und Informatik, ix, 138 p. (1998). Reviewer: Benjamin Blankertz (Münster) MSC: 03F10 03-02 PDF BibTeX XML Cite \textit{W. Burr}, Functionals in set theory and arithmetic. Münster: Univ. Münster, FB Mathematik und Informatik (1998; Zbl 0940.03064)
Arai, Toshiyasu Variations on a theme by Weiermann. (English) Zbl 0919.03043 J. Symb. Log. 63, No. 3, 897-925 (1998). Reviewer: A.Cantini (Firenze) MSC: 03F30 03F15 03F20 03F05 PDF BibTeX XML Cite \textit{T. Arai}, J. Symb. Log. 63, No. 3, 897--925 (1998; Zbl 0919.03043) Full Text: DOI
Kotlarski, Henryk Other proofs of old results. (English) Zbl 0924.03109 Math. Log. Q. 44, No. 4, 474-480 (1998). Reviewer: M.Tetruašvili (Tbilisi) MSC: 03F30 PDF BibTeX XML Cite \textit{H. Kotlarski}, Math. Log. Q. 44, No. 4, 474--480 (1998; Zbl 0924.03109) Full Text: DOI
Serebryanyj, A. I. Definability of the set of all true propositions of arithmetic by passage to the limit. (English. Russian original) Zbl 0920.03059 Russ. Math. Surv. 52, No. 2, 422-423 (1997); translation from Usp. Mat. Nauk 52, No. 2, 185-186 (1997). Reviewer: R.Kossak (New York) MSC: 03F30 03D20 PDF BibTeX XML Cite \textit{A. I. Serebryanyj}, Russ. Math. Surv. 52, No. 2, 422--423 (1997; Zbl 0920.03059); translation from Usp. Mat. Nauk 52, No. 2, 185--186 (1997) Full Text: DOI
Nykänen, Matti Querying string databases with modal logic. (English) Zbl 0895.68030 Helsinki: Univ. of Helsinki, vii, 150 p. (1997). MSC: 68P15 68-02 03B45 68P05 PDF BibTeX XML Cite \textit{M. Nykänen}, Querying string databases with modal logic. Helsinki: Univ. of Helsinki (1997; Zbl 0895.68030)
Lempp, Steffen The computational complexity of torsion-freeness of finitely presented groups. (English) Zbl 0889.03033 Bull. Aust. Math. Soc. 56, No. 2, 273-277 (1997). Reviewer: C.Calude (Auckland) MSC: 03D40 20F10 PDF BibTeX XML Cite \textit{S. Lempp}, Bull. Aust. Math. Soc. 56, No. 2, 273--277 (1997; Zbl 0889.03033) Full Text: DOI
McBeth, Muhammad Ali Combinatorial number theory. A treatise on growth, based on the Goodstein-Skolem hierarchy, including a critique of non-constructive or first-order logic. Corr. reprint of the 1994 ed. (English) Zbl 0861.03045 Lewiston, NY: Edwin Mellen Press. ii, 430 p. (1996). MSC: 03F30 03-02 11-02 11B75 11U99 11Y99 03D20 PDF BibTeX XML Cite \textit{M. A. McBeth}, Combinatorial number theory. A treatise on growth, based on the Goodstein-Skolem hierarchy, including a critique of non-constructive or first-order logic. Corr. reprint of the 1994 ed. Lewiston, NY: Edwin Mellen Press (1996; Zbl 0861.03045)
Goldstern, Martin The complexity of uniform distribution. (English) Zbl 0820.03031 Math. Slovaca 44, No. 5, 491-500 (1994). MSC: 03D80 11B50 11K45 03D20 03E15 03D55 PDF BibTeX XML Cite \textit{M. Goldstern}, Math. Slovaca 44, No. 5, 491--500 (1994; Zbl 0820.03031) Full Text: EuDML
Antonelli, Gian Aldo A revision-theoretic analysis of the arithmetical hierarchy. (English) Zbl 0835.03008 Notre Dame J. Formal Logic 35, No. 2, 204-218 (1994). Reviewer: E.Mendelson (Flushing) MSC: 03D20 03D30 PDF BibTeX XML Cite \textit{G. A. Antonelli}, Notre Dame J. Formal Logic 35, No. 2, 204--218 (1994; Zbl 0835.03008) Full Text: DOI
McBeth, Muhammad Ali Combinatorial number theory. A treatise on growth, based on the Goodstein-Skolem hierarchy, incl. a critique of non-constructive or first-order logic. (English) Zbl 0829.03039 Lampeter, Dyfed, Wales: Edwin Mellen Press, Ltd. 430 p. (1994). Reviewer: A.A.Mullin (Huntsville) MSC: 03F30 03-02 11-02 11B75 11U99 11Y99 03D20 PDF BibTeX XML Cite \textit{M. A. McBeth}, Combinatorial number theory. A treatise on growth, based on the Goodstein-Skolem hierarchy, incl. a critique of non-constructive or first-order logic. Lampeter, Dyfed, Wales: Edwin Mellen Press, Ltd. (1994; Zbl 0829.03039)
Tanaka, Hisao Determining the levels of some special complexity classes of sets in the Kleene arithmetical hierarchy. (English) Zbl 0809.68071 Tokyo J. Math. 17, No. 1, 125-133 (1994). MSC: 68Q15 03D15 PDF BibTeX XML Cite \textit{H. Tanaka}, Tokyo J. Math. 17, No. 1, 125--133 (1994; Zbl 0809.68071) Full Text: DOI
Wehner, Stephan The index set of injectively enumerable classes of recursively enumerable sets is \(\Sigma_ 5\)-complete. (English) Zbl 0806.03029 Math. Log. Q. 40, No. 1, 87-94 (1994). MSC: 03D25 03D45 PDF BibTeX XML Cite \textit{S. Wehner}, Math. Log. Q. 40, No. 1, 87--94 (1994; Zbl 0806.03029) Full Text: DOI
Dzhaparidze, Giorgie The logic of arithmetical hierarchy. (English) Zbl 0804.03045 Ann. Pure Appl. Logic 66, No. 2, 89-112 (1994). Reviewer: G.Dzhaparidze MSC: 03F30 03B45 PDF BibTeX XML Cite \textit{G. Dzhaparidze}, Ann. Pure Appl. Logic 66, No. 2, 89--112 (1994; Zbl 0804.03045) Full Text: DOI
Arslanov, M. M. The completeness of arithmetic sets under operations of set theory. (English. Russian original) Zbl 0833.03016 Russ. Math. 37, No. 9, 1-5 (1993); translation from Izv. Vyssh. Uchebn. Zaved., Mat. 1993, No. 9, 3-7 (1993). MSC: 03D55 03F30 PDF BibTeX XML Cite \textit{M. M. Arslanov}, Russ. Math. 37, No. 9, 1--5 (1993; Zbl 0833.03016); translation from Izv. Vyssh. Uchebn. Zaved., Mat. 1993, No. 9, 3--7 (1993)
Staiger, Ludwig Recursive automata on infinite words. (English) Zbl 0799.68139 Enjalbert, Patrice (ed.) et al., STACS 93. 10th annual symposium on theoretical aspects of computer science, Würzburg, Germany, February 25-27, 1993. Proceedings. Berlin: Springer-Verlag. Lect. Notes Comput. Sci. 665, 629-639 (1993). MSC: 68Q45 68Q60 PDF BibTeX XML Cite \textit{L. Staiger}, Lect. Notes Comput. Sci. 665, 629--639 (1993; Zbl 0799.68139)
Oberschelp, Arnold Recursion theory. (Rekursionstheorie.) (German) Zbl 0787.03029 Mannheim: B. I. Wissenschaftsverlag. 339 p. (1993). Reviewer: R.Murawski (Poznań) MSC: 03Dxx 03-01 03-02 PDF BibTeX XML Cite \textit{A. Oberschelp}, Rekursionstheorie. Mannheim: B. I. Wissenschaftsverlag (1993; Zbl 0787.03029)
Cucker, Felipe The arithmetical hierarchy over the reals. (English) Zbl 0765.03020 J. Log. Comput. 2, No. 3, 375-395 (1992). Reviewer: S.P.Yukna (Dortmund) MSC: 03D55 03E15 03D35 PDF BibTeX XML Cite \textit{F. Cucker}, J. Log. Comput. 2, No. 3, 375--395 (1992; Zbl 0765.03020) Full Text: DOI
Ditchev, Angel Examples of structures which do not admit recursive presentations. (English) Zbl 0815.03023 God. Sofij. Univ., Fak. Mat. Inform. 85(1993), No. 1, 3-11 (1991). MSC: 03C57 PDF BibTeX XML Cite \textit{A. Ditchev}, God. Sofiĭ. Univ., Fak. Mat. Inform. 85, No. 1, 3--11 (1991; Zbl 0815.03023)
Zaurbekov, S. S. The number of finitely axiomatizable completions. (English. Russian original) Zbl 0781.03020 Sib. Math. J. 32, No. 1, 141-145 (1991); translation from Sib. Mat. Zh. 32, No. 1(185), 174-178 (1991). MSC: 03C57 03D55 PDF BibTeX XML Cite \textit{S. S. Zaurbekov}, Sib. Math. J. 32, No. 1, 141--145 (1991; Zbl 0781.03020); translation from Sib. Mat. Zh. 32, No. 1(185), 174--178 (1991) Full Text: DOI
Tanaka, Kazuyuki Weak axioms of determinacy and subsystems of analysis. I: \(\Delta ^ 0_ 2\) games. (English) Zbl 0729.03032 Z. Math. Logik Grundlagen Math. 36, No. 6, 481-491 (1990). Reviewer: P.Štěpánek (Praha) MSC: 03F35 03E60 03D55 91A05 PDF BibTeX XML Cite \textit{K. Tanaka}, Z. Math. Logik Grundlagen Math. 36, No. 6, 481--491 (1990; Zbl 0729.03032) Full Text: DOI
Marchenkov, S. S. On representation of lexicographic predicates of an arithmetical hierarchy. (Russian) Zbl 0714.03039 Diskretn. Mat. 2, No. 1, 87-93 (1990). Reviewer: A.Kreczmar MSC: 03D55 03D40 PDF BibTeX XML Cite \textit{S. S. Marchenkov}, Diskretn. Mat. 2, No. 1, 87--93 (1990; Zbl 0714.03039)
Kučera, Antonin Randomness and generalizations of fixed point free functions. (English) Zbl 0705.03021 Recursion theory week, Proc. Conf., Oberwolfach/FRG 1989, Lect. Notes Math. 1432, 245-254 (1990). Reviewer: C.Calude MSC: 03D30 PDF BibTeX XML
Chomicki, Jan; Subrahmanian, V. S. Generalized closed world assumption is \(\Pi ^ 0_ 2\)-complete. (English) Zbl 0695.68064 Inf. Process. Lett. 34, No. 6, 289-291 (1990). MSC: 68T99 03D35 03D55 PDF BibTeX XML Cite \textit{J. Chomicki} and \textit{V. S. Subrahmanian}, Inf. Process. Lett. 34, No. 6, 289--291 (1990; Zbl 0695.68064) Full Text: DOI
Murawski, Roman Recursive functions and elements of metamathematics. Problems of completeness, decidability and Gödel’s theorems. (Funkcje rekurencyjne i elementy metamatematyki. Problemy zupełności, rozstrzygalności, twierdzenia Gödla.) (Polish) Zbl 0719.03001 Seria Matematyka, Uniwersytet Im. Adama Mickiewicza w Poznaniu, 11. Poznań: Wydawnictwo Naukowe Uniwersytetu Im. Adama Mickiewicza w Poznaniu. 186 p. (1990). Reviewer: O.V.Belegradek (Kemerovo) MSC: 03-01 03D20 03F30 03B25 03-03 03D10 03D35 03A05 PDF BibTeX XML Cite \textit{R. Murawski}, Funkcje rekurencyjne i elementy metamatematyki. Problemy zupełności, rozstrzygalności, twierdzenia Gödla (Polish). Poznań: Wydawnictwo Naukowe Uniwersytetu Im. Adama Mickiewicza w Poznaniu (1990; Zbl 0719.03001)
Ivanov, Ljubomir L. Abstract hierarchies and degrees. (English) Zbl 0688.03030 J. Symb. Log. 54, No. 1, 16-25 (1989). Reviewer: L.Harkleroad MSC: 03D75 03D55 03D30 PDF BibTeX XML Cite \textit{L. L. Ivanov}, J. Symb. Log. 54, No. 1, 16--25 (1989; Zbl 0688.03030) Full Text: DOI
Istrail, Sorin An arithmetical hierarchy in propositional dynamic logic. (English) Zbl 0671.03022 Inf. Comput. 81, No. 3, 280-289 (1989). Reviewer: M.K.Valiev MSC: 03B70 68N01 68Q65 PDF BibTeX XML Cite \textit{S. Istrail}, Inf. Comput. 81, No. 3, 280--289 (1989; Zbl 0671.03022) Full Text: DOI
McCarty, Charles Constructive validity is nonarithmetic. (English) Zbl 0724.03034 J. Symb. Log. 53, No. 4, 1036-1041 (1988). MSC: 03F35 03C35 03C62 03F55 03C57 PDF BibTeX XML Cite \textit{C. McCarty}, J. Symb. Log. 53, No. 4, 1036--1041 (1988; Zbl 0724.03034) Full Text: DOI
Burgin, M. S. The arithmetical hierarchy and inductive Turing machines. (English. Russian original) Zbl 0683.03022 Sov. Math., Dokl. 37, No. 2, 390-393 (1988); translation from Dokl. Akad. Nauk SSSR 299, No. 3, 530-533 (1988). MSC: 03D10 03D55 PDF BibTeX XML Cite \textit{M. S. Burgin}, Sov. Math., Dokl. 37, No. 2, 390--393 (1988; Zbl 0683.03022); translation from Dokl. Akad. Nauk SSSR 299, No. 3, 530--533 (1988)
Khisamiev, N. G. Arithmetic hierarchy of Abelian groups. (English. Russian original) Zbl 0679.20047 Sib. Math. J. 29, No. 6, 987-999 (1988); translation from Sib. Mat. Zh. 29, No. 6(172), 144-159 (1988). MSC: 20K25 20A15 03D55 20K20 PDF BibTeX XML Cite \textit{N. G. Khisamiev}, Sib. Math. J. 29, No. 6, 987--999 (1988; Zbl 0679.20047); translation from Sib. Mat. Zh. 29, No. 6(172), 144--159 (1988) Full Text: DOI