Longley, John Bar recursion is not computable via iteration. (English) Zbl 07153149 Computability 8, No. 2, 119-153 (2019). MSC: 03D65 03F35 PDF BibTeX XML Cite \textit{J. Longley}, Computability 8, No. 2, 119--153 (2019; Zbl 07153149) Full Text: DOI
Andréka, Hajnal; van Benthem, Johan; Bezhanishvili, Nick; Németi, István Changing a semantics: opportunism or courage? (English) Zbl 1347.03014 Manzano, María (ed.) et al., The life and work of Leon Henkin. Essays on his contributions. Cham: Birkhäuser/Springer (ISBN 978-3-319-09718-3/pbk; 978-3-319-09719-0/ebook). Studies in Universal Logic, 307-337 (2014). MSC: 03B15 03C85 03C98 PDF BibTeX XML Cite \textit{H. Andréka} et al., in: The life and work of Leon Henkin. Essays on his contributions. Cham: Birkhäuser/Springer. 307--337 (2014; Zbl 1347.03014) Full Text: DOI arXiv
Downey, Rod; Greenberg, Noam Totally \(< \omega^{ \omega }\) computably enumerable and \(m\)-topped degrees. (English) Zbl 1109.03039 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, 46-60 (2006). MSC: 03D60 03D25 PDF BibTeX XML Cite \textit{R. Downey} and \textit{N. Greenberg}, Lect. Notes Comput. Sci. 3959, 46--60 (2006; Zbl 1109.03039) Full Text: DOI
Normann, Dag Definability and reducibility in higher types over the reals. (English) Zbl 1102.03042 Stoltenberg-Hansen, Viggo (ed.) et al., Logic colloquium ’03. Proceedings of the annual European summer meeting of the Association for Symbolic Logic (ASL), Helsinki, Finland, August 14–20, 2003. Wellesley, MA: A K Peters; Urbana, IL: Association for Symbolic Logic (ASL) (ISBN 1-56881-293-0/hbk; 1-56881-294-9/pbk). Lecture Notes in Logic 24, 200-220 (2006). MSC: 03D65 03E15 PDF BibTeX XML Cite \textit{D. Normann}, Lect. Notes Log. 24, 200--220 (2006; Zbl 1102.03042)
Puzarenko, V. G. Generalized numerations and definability of the field \(\mathbb R\) in admissible sets. (Russian) Zbl 1033.03029 Vestn. Novosib. Gos. Univ., Ser. Mat. Mekh. Inform. 3, No. 2, 107-117 (2003). Reviewer: A. S. Morozov (Novosibirsk) MSC: 03D60 03D45 03C57 PDF BibTeX XML Cite \textit{V. G. Puzarenko}, Vestn. Novosib. Gos. Univ., Ser. Mat. Mekh. Inform. 3, No. 2, 107--117 (2003; Zbl 1033.03029)
Morozov, A. S. Presentability of groups of \(\Sigma\)-definable permutations over admissible sets. (Russian, English) Zbl 1016.03042 Algebra Logika 41, No. 4, 459-480 (2002); translation in Algebra Logic 41, No. 4, 254-266 (2002). Reviewer: A.N.Ryaskin (Novosibirsk) MSC: 03D60 03C57 20A15 PDF BibTeX XML Cite \textit{A. S. Morozov}, Algebra Logika 41, No. 4, 459--480 (2002; Zbl 1016.03042); translation in Algebra Logic 41, No. 4, 254--266 (2002) Full Text: EuDML
Moschovakis, Yiannis N. What is an algorithm? (English) Zbl 1025.03037 Engquist, Björn (ed.) et al., Mathematics unlimited - 2001 and beyond. Berlin: Springer. 919-936 (2001). Reviewer: Jerzy Mycka (Lublin) MSC: 03D75 68Q05 PDF BibTeX XML Cite \textit{Y. N. Moschovakis}, in: Mathematics unlimited---2001 and beyond. Berlin: Springer. 919--936 (2001; Zbl 1025.03037)
Romina, A. V. Definability of Boolean algebras in \({\mathbb {HF}}\)-superstructures. (English. Russian original) Zbl 0965.03048 Algebra Logika 39, No. 6, 711-719 (2000); translation in Algebra Logic 39, No. 6, 407-411 (2000). Reviewer: A.S.Morozov (Novosibirsk) MSC: 03C57 03D60 PDF BibTeX XML Cite \textit{A. V. Romina}, Algebra Logika 39, No. 6, 711--719 (2000; Zbl 0965.03048); translation in Algebra Logic 39, No. 6, 407--411 (2000) Full Text: EuDML
Cooper, S. B. Upper cones as automorphism bases. (English) Zbl 0937.03051 Sib. Adv. Math. 9, No. 3, 17-77 (1999). Reviewer: A.S.Morozov (Novosibirsk) MSC: 03D28 03D30 08A35 PDF BibTeX XML Cite \textit{S. B. Cooper}, Sib. Adv. Math. 9, No. 3, 17--77 (1999; Zbl 0937.03051)
Beckmann, Arnold; Pohlers, Wolfram Applications of cut-free infinitary derivations to generalized recursion theory. (English) Zbl 0924.03087 Ann. Pure Appl. Logic 94, No. 1-3, 7-19 (1998). MSC: 03D60 03E15 03D55 03F05 03F35 PDF BibTeX XML Cite \textit{A. Beckmann} and \textit{W. Pohlers}, Ann. Pure Appl. Logic 94, No. 1--3, 7--19 (1998; Zbl 0924.03087) Full Text: DOI
Hájek, Petr; Pudlák, Pavel Metamathematics of first-order arithmetic. 2nd printing. (English) Zbl 0889.03053 Perspectives in Mathematical Logic. Berlin: Springer. xiv, 460 p. (1998). MSC: 03F30 03-02 03D15 PDF BibTeX XML Cite \textit{P. Hájek} and \textit{P. Pudlák}, Metamathematics of first-order arithmetic. 2nd printing. Berlin: Springer (1998; Zbl 0889.03053)
Khisamiev, A. N. Numberings and definability in the hereditarily finite superstructure of a model. (English) Zbl 0924.03055 Sib. Adv. Math. 7, No. 3, 63-74 (1997). Reviewer: A.S.Morozov (Novosibirsk) MSC: 03C57 03D45 03D60 PDF BibTeX XML Cite \textit{A. N. Khisamiev}, Sib. Adv. Math. 7, No. 3, 63--74 (1997; Zbl 0924.03055)
Korovina, M. V. On the universal recursive function and on abstract machines on real numbers with the list superstructure. (Russian) Zbl 0902.03029 Vychisl. Sist. 156, 24-43 (1996). MSC: 03D60 03D10 68Q05 PDF BibTeX XML Cite \textit{M. V. Korovina}, Vychisl. Sist. 156, 24--43 (1996; Zbl 0902.03029)
Ershov, Yu. L. Definability and computability. Transl. from the Russian. (English) Zbl 0870.03019 Siberian School of Algebra and Logic. New York, NY: Consultants Bureau. xiv, 264 p. (1996). Reviewer: H.B.Marandjian (Erevan) MSC: 03D60 03-02 03-01 68-02 68-01 PDF BibTeX XML Cite \textit{Yu. L. Ershov}, Definability and computability. Transl. from the Russian. New York, NY: Consultants Bureau (1996; Zbl 0870.03019)
Michalski, Grzegorz Relatively recursively enumerable versus relatively \(\Sigma_ 1\) in models of Peano arithmetic. (English) Zbl 0837.03038 Math. Log. Q. 41, No. 4, 515-522 (1995). MSC: 03D99 03F30 03H15 03C62 PDF BibTeX XML Cite \textit{G. Michalski}, Math. Log. Q. 41, No. 4, 515--522 (1995; Zbl 0837.03038) Full Text: DOI
Hájek, Petr; Pudlák, Pavel Metamathematics of first-order arithmetic. (English) Zbl 0781.03047 Perspectives in Mathematical Logic. Berlin: Springer-Verlag. xiv, 460 p. (1993). Reviewer: R.Murawski (Poznań) MSC: 03F30 03D15 03-02 PDF BibTeX XML Cite \textit{P. Hájek} and \textit{P. Pudlák}, Metamathematics of first-order arithmetic. Berlin: Springer-Verlag (1993; Zbl 0781.03047)
Barua, Rana Complexity of winning strategies for \({\Delta{}}^ 0_ 2\) games. (English) Zbl 0769.03030 Proc. Am. Math. Soc. 117, No. 1, 227-233 (1993). MSC: 03E15 03D65 PDF BibTeX XML Cite \textit{R. Barua}, Proc. Am. Math. Soc. 117, No. 1, 227--233 (1993; Zbl 0769.03030) Full Text: DOI
Odifreddi, Piergiorgio; Shore, Richard Global properties of local structures of degrees. (English) Zbl 0729.03021 Boll. Unione Mat. Ital., VII. Ser., B 5, No. 1, 97-120 (1991). Reviewer: J.S.Ullian (St.Louis) MSC: 03D30 PDF BibTeX XML Cite \textit{P. Odifreddi} and \textit{R. Shore}, Boll. Unione Mat. Ital., VII. Ser., B 5, No. 1, 97--120 (1991; Zbl 0729.03021)
Allen, Bill Arithmetizing uniform \(NC\). (English) Zbl 0741.03019 Ann. Pure Appl. Logic 53, No. 1, 1-50 (1991). Reviewer: A.Leitsch (Wien) MSC: 03D15 03F30 68Q15 PDF BibTeX XML Cite \textit{B. Allen}, Ann. Pure Appl. Logic 53, No. 1, 1--50 (1991; Zbl 0741.03019) Full Text: DOI
Cooper, S. Barry The jump is definable in the structure of the degrees of unsolvability. (English) Zbl 0709.03035 Bull. Am. Math. Soc., New Ser. 23, No. 1, 151-158 (1990). Reviewer: J.S.Ullian MSC: 03D30 PDF BibTeX XML Cite \textit{S. B. Cooper}, Bull. Am. Math. Soc., New Ser. 23, No. 1, 151--158 (1990; Zbl 0709.03035) Full Text: DOI
Büchi, J. Richard; Senger, Steven Coding in the existential theory of concatenation. (English) Zbl 0646.03040 Arch. Math. Logik Grundlagenforsch. 26(1986/87), 101-106 (1987). MSC: 03D40 20M05 94A45 PDF BibTeX XML Cite \textit{J. R. Büchi} and \textit{S. Senger}, Arch. Math. Logik Grundlagenforsch. 26, 101--106 (1986; Zbl 0646.03040) Full Text: DOI EuDML
Odifreddi, Piergiorgio Global properties (automorphisms and definability) of m-degrees. (Italian. English summary) Zbl 0582.03026 Boll. Unione Mat. Ital., VI. Ser., A 4, 71-76 (1985). Reviewer: C.Calude MSC: 03D30 PDF BibTeX XML Cite \textit{P. Odifreddi}, Boll. Unione Mat. Ital., VI. Ser., A 4, 71--76 (1985; Zbl 0582.03026)
Girard, Jean-Yves; Normann, Dag Set recursion and \(\Pi ^ 1_ 2\)-logic. (English) Zbl 0575.03034 Ann. Pure Appl. Logic 28, 255-286 (1985). MSC: 03D60 03F15 PDF BibTeX XML Cite \textit{J.-Y. Girard} and \textit{D. Normann}, Ann. Pure Appl. Logic 28, 255--286 (1985; Zbl 0575.03034) Full Text: DOI
Clote, P. Partition relations in arithmetic. (English) Zbl 0567.03029 Methods in mathematical logic, Proc. 6th Latin Amer. Symp., Caracas/Venez. 1983, Lect. Notes Math. 1130, 32-68 (1985). MSC: 03F30 03C62 03D55 03H15 PDF BibTeX XML
Kranakis, Evangelos Stepping up lemmas in definable partitions. (English) Zbl 0576.03034 J. Symb. Log. 49, 22-31 (1984). MSC: 03E45 03D60 PDF BibTeX XML Cite \textit{E. Kranakis}, J. Symb. Log. 49, 22--31 (1984; Zbl 0576.03034) Full Text: DOI
Baeten, Jos Filters and ultrafilters over definable subsets of admissible ordinals. (English) Zbl 0562.03024 Models and sets, Proc. Logic Colloq., Aachen 1983, Part I, Lect. Notes Math. 1103, 1-8 (1984). MSC: 03D60 03E45 03E55 03E05 PDF BibTeX XML
Yasugi, Mariko Definability in the abstract theory of integration. (English) Zbl 0524.03050 Comment. Math. Univ. St. Pauli 32, 137-161 (1983). MSC: 03F65 46S30 03D70 28A25 PDF BibTeX XML Cite \textit{M. Yasugi}, Comment. Math. Univ. St. Pauli 32, 137--161 (1983; Zbl 0524.03050)
Martin, Donald A.; Moschovakis, Yiannis N.; Steel, John R. The extent of definable scales. (English) Zbl 0509.03025 Bull. Am. Math. Soc., New Ser. 6, 435-440 (1982). MSC: 03E15 03E60 03D60 PDF BibTeX XML Cite \textit{D. A. Martin} et al., Bull. Am. Math. Soc., New Ser. 6, 435--440 (1982; Zbl 0509.03025) Full Text: DOI
Kranakis, Evangelos Reflection and partition properties of admissible ordinals. (English) Zbl 0494.03030 Ann. Math. Logic 22, 213-242 (1982). MSC: 03D60 03E55 PDF BibTeX XML Cite \textit{E. Kranakis}, Ann. Math. Logic 22, 213--242 (1982; Zbl 0494.03030) Full Text: DOI
Terlouw, Jan On definition trees of ordinal recursive functionals: Reduction of the recursion orders by means of type level raising. (English) Zbl 0488.03030 J. Symb. Log. 47, 395-402 (1982). MSC: 03F10 03F15 PDF BibTeX XML Cite \textit{J. Terlouw}, J. Symb. Log. 47, 395--402 (1982; Zbl 0488.03030) Full Text: DOI
Harrington, Leo; Shore, Richard A. Definable degrees and automorphisms of D. (English) Zbl 0452.03033 Bull. Am. Math. Soc., New Ser. 4, 97-100 (1981). MSC: 03D30 03D55 PDF BibTeX XML Cite \textit{L. Harrington} and \textit{R. A. Shore}, Bull. Am. Math. Soc., New Ser. 4, 97--100 (1981; Zbl 0452.03033) Full Text: DOI
Kechris, Alexander S. Countable ordinals and the analytical hierarchy. II. (English) Zbl 0449.03047 Ann. Math. Logic 15, 193-223 (1978). MSC: 03E15 03D55 03D60 03D65 03E60 PDF BibTeX XML Cite \textit{A. S. Kechris}, Ann. Math. Logic 15, 193--223 (1978; Zbl 0449.03047) Full Text: DOI