Zoethout, Jetze Third-order functionals on partial combinatory algebras. (English) Zbl 07628767 Ann. Pure Appl. Logic 174, No. 2, Article ID 103205, 36 p. (2023). Reviewer: Hirokazu Nishimura (Tsukuba) MSC: 18B25 68Q09 03B40 03G30 03D65 18B20 PDF BibTeX XML Cite \textit{J. Zoethout}, Ann. Pure Appl. Logic 174, No. 2, Article ID 103205, 36 p. (2023; Zbl 07628767) Full Text: DOI arXiv OpenURL
Iljazović, Zvonko; Validžić, Lucija Effective compactness and orbits of points under the isometry group. (English) Zbl 07628760 Ann. Pure Appl. Logic 174, No. 2, Article ID 103198, 34 p. (2023). MSC: 03D78 03F60 03D80 54H99 PDF BibTeX XML Cite \textit{Z. Iljazović} and \textit{L. Validžić}, Ann. Pure Appl. Logic 174, No. 2, Article ID 103198, 34 p. (2023; Zbl 07628760) Full Text: DOI OpenURL
Avigad, Jeremy Mathematical logic and computation. (English) Zbl 07565705 Cambridge: Cambridge University Press (ISBN 978-1-108-47875-5/hbk; 978-1-108-77875-6/ebook). xii, 513 p. (2023). MSC: 03-01 03Dxx 03Fxx 68-01 68Vxx PDF BibTeX XML Cite \textit{J. Avigad}, Mathematical logic and computation. Cambridge: Cambridge University Press (2023; Zbl 07565705) Full Text: DOI OpenURL
Mileti, Joseph Modern mathematical logic. (English) Zbl 07553161 Cambridge Mathematical Textbooks. Cambridge: Cambridge University Press (ISBN 978-1-108-83314-1/hbk; 978-1-108-97310-6/ebook). xiv, 502 p. (2023). MSC: 03-01 03B05 03B10 03Cxx 03E10 03E30 03Dxx 03F40 PDF BibTeX XML Cite \textit{J. Mileti}, Modern mathematical logic. Cambridge: Cambridge University Press (2023; Zbl 07553161) Full Text: DOI OpenURL
Bazhenov, Nikolay; Mustafa, Manat Computable embeddability for algebraic structures. (English) Zbl 07648876 Asian-Eur. J. Math. 15, No. 7, Article ID 2250126, 20 p. (2022). MSC: 03C57 03D45 03D30 PDF BibTeX XML Cite \textit{N. Bazhenov} and \textit{M. Mustafa}, Asian-Eur. J. Math. 15, No. 7, Article ID 2250126, 20 p. (2022; Zbl 07648876) Full Text: DOI OpenURL
Kucukoglu, Irem; Milovanović, Gradimir V.; Simsek, Yilmaz Analysis of generating functions for special words and numbers and algorithms for computation. (English) Zbl 07648632 Mediterr. J. Math. 19, No. 6, Paper No. 268, 22 p. (2022). MSC: 03D40 05A05 05A15 11-XX 65Q20 68R15 PDF BibTeX XML Cite \textit{I. Kucukoglu} et al., Mediterr. J. Math. 19, No. 6, Paper No. 268, 22 p. (2022; Zbl 07648632) Full Text: DOI OpenURL
Potgieter, Petrus H. Computability of sets in Euclidean space. (English) Zbl 07644700 PU.M.A., Pure Math. Appl. 30, No. 3, 65-77 (2022). MSC: 03D80 03D78 PDF BibTeX XML Cite \textit{P. H. Potgieter}, PU.M.A., Pure Math. Appl. 30, No. 3, 65--77 (2022; Zbl 07644700) Full Text: DOI OpenURL
Rybakov, M. Computational complexity of the word problem in modal and Heyting algebras with a small number of generators. (English. Russian original) Zbl 07644547 Russ. Math. 66, No. 5, 33-48 (2022); translation from Izv. Vyssh. Uchebn. Zaved., Mat. 2022, No. 5, 42-60 (2022). MSC: 03Dxx 68Qxx 03Bxx PDF BibTeX XML Cite \textit{M. Rybakov}, Russ. Math. 66, No. 5, 33--48 (2022; Zbl 07644547); translation from Izv. Vyssh. Uchebn. Zaved., Mat. 2022, No. 5, 42--60 (2022) Full Text: DOI OpenURL
Japaridze, Giorgi; Lamichhane, Bikal Cirquent calculus in a nutshell. (English) Zbl 07642576 Log. Issled. 28, No. 1, 125-141 (2022). MSC: 03-XX PDF BibTeX XML Cite \textit{G. Japaridze} and \textit{B. Lamichhane}, Log. Issled. 28, No. 1, 125--141 (2022; Zbl 07642576) Full Text: DOI arXiv OpenURL
Selivanov, Victor Non-collapse of the effective Wadge hierarchy. (English) Zbl 07641236 Computability 11, No. 3, 335-358 (2022). MSC: 03Dxx PDF BibTeX XML Cite \textit{V. Selivanov}, Computability 11, No. 3, 335--358 (2022; Zbl 07641236) Full Text: DOI OpenURL
Marcone, Alberto; Valenti, Manlio Effective aspects of Hausdorff and Fourier dimension. (English) Zbl 07641235 Computability 11, No. 3, 299-333 (2022). MSC: 03Dxx PDF BibTeX XML Cite \textit{A. Marcone} and \textit{M. Valenti}, Computability 11, No. 3, 299--333 (2022; Zbl 07641235) Full Text: DOI arXiv OpenURL
Goh, Jun Le; Lempp, Steffen; Ng, Keng Meng; Soskova, Mariya I. Extensions of two constructions of Ahmad. (English) Zbl 07641234 Computability 11, No. 3, 269-297 (2022). MSC: 03Dxx PDF BibTeX XML Cite \textit{J. Le Goh} et al., Computability 11, No. 3, 269--297 (2022; Zbl 07641234) Full Text: DOI OpenURL
Cholak, Peter; Gerdes, Peter Extending properly \(n\)-REA sets. (English) Zbl 07641233 Computability 11, No. 3, 241-267 (2022). MSC: 03Dxx PDF BibTeX XML Cite \textit{P. Cholak} and \textit{P. Gerdes}, Computability 11, No. 3, 241--267 (2022; Zbl 07641233) Full Text: DOI arXiv OpenURL
Calvert, Wesley; Cenzer, Douglas; Harizanov, Valentina Generically and coarsely computable isomorphisms. (English) Zbl 07641232 Computability 11, No. 3, 223-239 (2022). MSC: 03Dxx PDF BibTeX XML Cite \textit{W. Calvert} et al., Computability 11, No. 3, 223--239 (2022; Zbl 07641232) Full Text: DOI OpenURL
Bazhenov, Nikolay; Ng, Keng Meng; San Mauro, Luca; Sorbi, Andrea Primitive recursive equivalence relations and their primitive recursive complexity. (English) Zbl 07641231 Computability 11, No. 3, 187-221 (2022). MSC: 03Dxx PDF BibTeX XML Cite \textit{N. Bazhenov} et al., Computability 11, No. 3, 187--221 (2022; Zbl 07641231) Full Text: DOI arXiv OpenURL
Michailovskaya, Y. A.; Frolov, A. N. Computable linear orders and the ershov hierarchy. (English. Russian original) Zbl 07640111 Russ. Math. 66, No. 1, 71-74 (2022); translation from Izv. Vyssh. Uchebn. Zaved., Mat. 2022, No. 1, 85-89 (2022). MSC: 03Dxx 03Cxx 06Axx PDF BibTeX XML Cite \textit{Y. A. Michailovskaya} and \textit{A. N. Frolov}, Russ. Math. 66, No. 1, 71--74 (2022; Zbl 07640111); translation from Izv. Vyssh. Uchebn. Zaved., Mat. 2022, No. 1, 85--89 (2022) Full Text: DOI OpenURL
Miller, Russell G. Effectivizing Lusin’s theorem. (English) Zbl 07639629 J. Log. Anal. 14, Paper No. 3, 32 p. (2022). MSC: 03D80 03D78 03F60 03E15 26A21 26A15 PDF BibTeX XML Cite \textit{R. G. Miller}, J. Log. Anal. 14, Paper No. 3, 32 p. (2022; Zbl 07639629) Full Text: DOI arXiv OpenURL
Petrakis, Iosif Strict computability models over categories and presheaves. (English) Zbl 07638211 J. Log. Comput. 32, No. 8, 1815-1838 (2022). MSC: 03-XX 68-XX PDF BibTeX XML Cite \textit{I. Petrakis}, J. Log. Comput. 32, No. 8, 1815--1838 (2022; Zbl 07638211) Full Text: DOI OpenURL
Normann, Dag; Sanders, Sam On the computational properties of basic mathematical notions. (English) Zbl 07638209 J. Log. Comput. 32, No. 8, 1747-1795 (2022). MSC: 03-XX 68-XX PDF BibTeX XML Cite \textit{D. Normann} and \textit{S. Sanders}, J. Log. Comput. 32, No. 8, 1747--1795 (2022; Zbl 07638209) Full Text: DOI arXiv OpenURL
Krogman, Richard; Cenzer, Douglas Complexity of injection structures induced by finite state transducers. (English) Zbl 07638199 J. Log. Comput. 32, No. 8, 1504-1530 (2022). MSC: 03-XX 68-XX PDF BibTeX XML Cite \textit{R. Krogman} and \textit{D. Cenzer}, J. Log. Comput. 32, No. 8, 1504--1530 (2022; Zbl 07638199) Full Text: DOI OpenURL
Ramos, Thiago Mendonça Ferreira; Almeida, Ariane Alves; Ayala-Rincón, Mauricio Formalization of the computational theory of a Turing complete functional language model. (English) Zbl 07632098 J. Autom. Reasoning 66, No. 4, 1031-1063 (2022). MSC: 68V15 PDF BibTeX XML Cite \textit{T. M. F. Ramos} et al., J. Autom. Reasoning 66, No. 4, 1031--1063 (2022; Zbl 07632098) Full Text: DOI OpenURL
Chebotarev, A. N. Constructing a \(-\omega\)-regular expression specified by a graph of elementary extensions. (English. Ukrainian original) Zbl 07630497 Cybern. Syst. Anal. 58, No. 2, 165-170 (2022); translation from Kibern. Sist. Anal. 58, No. 2, 3-9 (2022). MSC: 68Qxx 03Dxx PDF BibTeX XML Cite \textit{A. N. Chebotarev}, Cybern. Syst. Anal. 58, No. 2, 165--170 (2022; Zbl 07630497); translation from Kibern. Sist. Anal. 58, No. 2, 3--9 (2022) Full Text: DOI OpenURL
Persiau, Floris; De Bock, Jasper; de Cooman, Gert On the (dis)similarities between stationary imprecise and non-stationary precise uncertainty models in algorithmic randomness. (English) Zbl 07629284 Int. J. Approx. Reasoning 151, 272-291 (2022). MSC: 68T37 PDF BibTeX XML Cite \textit{F. Persiau} et al., Int. J. Approx. Reasoning 151, 272--291 (2022; Zbl 07629284) Full Text: DOI arXiv OpenURL
Baldan, Paolo; Ranzato, Francesco; Zhang, Linpeng Intensional Kleene and Rice theorems for abstract program semantics. (English) Zbl 07629146 Inf. Comput. 289, Part A, Article ID 104953, 27 p. (2022). MSC: 68Qxx PDF BibTeX XML Cite \textit{P. Baldan} et al., Inf. Comput. 289, Part A, Article ID 104953, 27 p. (2022; Zbl 07629146) Full Text: DOI arXiv OpenURL
Case, Adam; Porter, Christopher P. The intersection of algorithmically random closed sets and effective dimension. (English) Zbl 07628979 ACM Trans. Comput. Log. 23, No. 4, Paper No. 24, 19 p. (2022). MSC: 03B70 68-XX PDF BibTeX XML Cite \textit{A. Case} and \textit{C. P. Porter}, ACM Trans. Comput. Log. 23, No. 4, Paper No. 24, 19 p. (2022; Zbl 07628979) Full Text: DOI arXiv OpenURL
Carl, Merlin Lower bounds on \(\beta (\alpha)\). (English) Zbl 07627918 Berger, Ulrich (ed.) et al., Revolutions and revelations in computability. 18th conference on computability in Europe, CiE 2022, Swansea, UK, July 11–15, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13359, 64-73 (2022). MSC: 68Qxx PDF BibTeX XML Cite \textit{M. Carl}, Lect. Notes Comput. Sci. 13359, 64--73 (2022; Zbl 07627918) Full Text: DOI OpenURL
Normann, Dag; Sanders, Sam On the uncountability OF \(\mathbb{R}\). (English) Zbl 07620698 J. Symb. Log. 87, No. 4, 1474-1521 (2022). MSC: 03B30 03F35 03D55 03D30 PDF BibTeX XML Cite \textit{D. Normann} and \textit{S. Sanders}, J. Symb. Log. 87, No. 4, 1474--1521 (2022; Zbl 07620698) Full Text: DOI arXiv OpenURL
Imbs, Damien; Raynal, Michel; Taubenfeld, Gadi Election in fully anonymous shared memory systems: tight space bounds and algorithms. (English) Zbl 07615857 Parter, Merav (ed.), Structural information and communication complexity. 29th international colloquium, SIROCCO 2022, Paderborn, Germany, June 27–29, 2022, Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13298, 174-190 (2022). MSC: 68Mxx 68Q11 68R10 PDF BibTeX XML Cite \textit{D. Imbs} et al., Lect. Notes Comput. Sci. 13298, 174--190 (2022; Zbl 07615857) Full Text: DOI arXiv OpenURL
Alaev, Pavel Quotient structures and groups computable in polynomial time. (English) Zbl 07615729 Kulikov, Alexander S. (ed.) et al., Computer science – theory and applications. 17th international computer science symposium in Russia, CSR 2022, virtual event, June 29 – July 1, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13296, 35-45 (2022). MSC: 68Qxx PDF BibTeX XML Cite \textit{P. Alaev}, Lect. Notes Comput. Sci. 13296, 35--45 (2022; Zbl 07615729) Full Text: DOI OpenURL
Day, Adam R.; Downey, Rod; Westrick, Linda Three topological reducibilities for discontinuous functions. (English) Zbl 07608893 Trans. Am. Math. Soc., Ser. B 9, 859-895 (2022). MSC: 03D30 03D78 PDF BibTeX XML Cite \textit{A. R. Day} et al., Trans. Am. Math. Soc., Ser. B 9, 859--895 (2022; Zbl 07608893) Full Text: DOI arXiv OpenURL
McInerney, Michael; Ng, Keng Meng Multiple genericity: a new transfinite hierarchy of genericity notions. (English) Zbl 07606042 Isr. J. Math. 250, No. 1, 1-51 (2022). MSC: 03Dxx 68Qxx 68-XX PDF BibTeX XML Cite \textit{M. McInerney} and \textit{K. M. Ng}, Isr. J. Math. 250, No. 1, 1--51 (2022; Zbl 07606042) Full Text: DOI OpenURL
Alaev, P. E. Finitely generated structures computable in polynomial time. (English. Russian original) Zbl 07596643 Sib. Math. J. 63, No. 5, 801-818 (2022); translation from Sib. Mat. Zh. 63, No. 5, 953-974 (2022). MSC: 03Dxx 03Cxx 13Pxx PDF BibTeX XML Cite \textit{P. E. Alaev}, Sib. Math. J. 63, No. 5, 801--818 (2022; Zbl 07596643); translation from Sib. Mat. Zh. 63, No. 5, 953--974 (2022) Full Text: DOI OpenURL
Mosconi, Jean (ed.); Bourdeau, Michel (ed.) Caculability anthology. Birth and development of the theory of computability from the 1920s to the 1970s. Historical introduction by Serge Grigorieff. (Anthologie de la caculabilité. Naissance et développements de la théorie de la calculabilité des années 1920 à 1970. Introduction historique par Serge Grigorieff.) (French) Zbl 1496.03009 Paris: Cassini (ISBN 978-2-84225-094-2/hbk). xvi, 798 p. (2022). MSC: 03-06 68-06 03-03 68-03 01A60 03Dxx 68Qxx 00B15 PDF BibTeX XML Cite \textit{J. Mosconi} (ed.) and \textit{M. Bourdeau} (ed.), Anthologie de la caculabilité. Naissance et développements de la théorie de la calculabilité des années 1920 à 1970. Introduction historique par Serge Grigorieff. Paris: Cassini (2022; Zbl 1496.03009) OpenURL
Patil, Jayashree; Hardan, Basel; Hamoud, Ahmed A.; Bachhav, Amol; Emadifar, Homan A new result on Branciari metric space using \((\alpha, \gamma)\)-contractive mappings. (English) Zbl 07595121 Topol. Algebra Appl. 10, 103-112 (2022). MSC: 47H10 47H09 03D60 PDF BibTeX XML Cite \textit{J. Patil} et al., Topol. Algebra Appl. 10, 103--112 (2022; Zbl 07595121) Full Text: DOI OpenURL
Ishchenko, R. A. Number of labelings of definite automata graphs. (English. Russian original) Zbl 07584509 Mosc. Univ. Math. Bull. 77, No. 2, 102-107 (2022); translation from Vestn. Mosk. Univ., Ser. I 77, No. 2, 71-75 (2022). MSC: 68Qxx 03Dxx 05Cxx PDF BibTeX XML Cite \textit{R. A. Ishchenko}, Mosc. Univ. Math. Bull. 77, No. 2, 102--107 (2022; Zbl 07584509); translation from Vestn. Mosk. Univ., Ser. I 77, No. 2, 71--75 (2022) Full Text: DOI OpenURL
Vishnikin, M. E. Unique typed basic categorial grammars. (English. Russian original) Zbl 07584507 Mosc. Univ. Math. Bull. 77, No. 2, 93-96 (2022); translation from Vestn. Mosk. Univ., Ser. I 77, No. 2, 64-67 (2022). MSC: 03Bxx 68Qxx 03Dxx PDF BibTeX XML Cite \textit{M. E. Vishnikin}, Mosc. Univ. Math. Bull. 77, No. 2, 93--96 (2022; Zbl 07584507); translation from Vestn. Mosk. Univ., Ser. I 77, No. 2, 64--67 (2022) Full Text: DOI OpenURL
Shojaei-Fard, Ali Non-perturbative graph languages, halting problem and complexity. (English) Zbl 07583895 Forum Math. 34, No. 5, 1159-1185 (2022). MSC: 03D80 05C63 68Q42 68Q45 81T18 PDF BibTeX XML Cite \textit{A. Shojaei-Fard}, Forum Math. 34, No. 5, 1159--1185 (2022; Zbl 07583895) Full Text: DOI OpenURL
Calvert, Wesley; Cenzer, Douglas; Harizanov, Valentina Densely computable structures. (English) Zbl 07582718 J. Log. Comput. 32, No. 3, 581-607 (2022). MSC: 03-XX 68-XX PDF BibTeX XML Cite \textit{W. Calvert} et al., J. Log. Comput. 32, No. 3, 581--607 (2022; Zbl 07582718) Full Text: DOI OpenURL
Marks, Dennis W. Binary encoded recursive generation of quantum space-times. (English) Zbl 07582665 Adv. Appl. Clifford Algebr. 32, No. 4, Paper No. 51, 21 p. (2022). MSC: 14L35 55R45 03D80 03F15 15A67 70S10 83F05 PDF BibTeX XML Cite \textit{D. W. Marks}, Adv. Appl. Clifford Algebr. 32, No. 4, Paper No. 51, 21 p. (2022; Zbl 07582665) Full Text: DOI OpenURL
Lange, Karen Calibrating computational complexity via definability: the work of Julia F. Knight. (English) Zbl 1496.03005 Notices Am. Math. Soc. 69, No. 3, 351-362 (2022). MSC: 03-03 03Dxx 01A70 PDF BibTeX XML Cite \textit{K. Lange}, Notices Am. Math. Soc. 69, No. 3, 351--362 (2022; Zbl 1496.03005) Full Text: DOI OpenURL
Baumgart, Matthew; Heckman, Jonathan J.; Thomas, Logan CFTs blueshift tensor fluctuations universally. (English) Zbl 07579200 J. Cosmol. Astropart. Phys. 2022, No. 7, Paper No. 34, 25 p. (2022). MSC: 83C35 83E05 83C30 81V80 47A10 53C18 81V22 03D55 83-05 PDF BibTeX XML Cite \textit{M. Baumgart} et al., J. Cosmol. Astropart. Phys. 2022, No. 7, Paper No. 34, 25 p. (2022; Zbl 07579200) Full Text: DOI arXiv OpenURL
Exibard, Léo; Filiot, Emmanuel; Lhote, Nathan; Reynier, Pierre-Alain Computability of data-word transductions over different data domains. (English) Zbl 07577573 Log. Methods Comput. Sci. 18, No. 3, Paper No. 9, 41 p. (2022). MSC: 03B70 68-XX PDF BibTeX XML Cite \textit{L. Exibard} et al., Log. Methods Comput. Sci. 18, No. 3, Paper No. 9, 41 p. (2022; Zbl 07577573) Full Text: arXiv Link OpenURL
Kasymov, N. Kh.; Ibragimov, F. N. Computably separable models. (English. Russian original) Zbl 07576924 J. Math. Sci., New York 264, No. 6, 746-767 (2022); translation from Sovrem. Mat., Fundam. Napravl. 64, No. 4, 682-705 (2018). MSC: 03Dxx 03Cxx 08Axx PDF BibTeX XML Cite \textit{N. Kh. Kasymov} and \textit{F. N. Ibragimov}, J. Math. Sci., New York 264, No. 6, 746--767 (2022; Zbl 07576924); translation from Sovrem. Mat., Fundam. Napravl. 64, No. 4, 682--705 (2018) Full Text: DOI OpenURL
Andrews, Uri; Sorbi, Andrea Initial segments of the degrees of ceers. (English) Zbl 07576907 J. Symb. Log. 87, No. 3, 1260-1282 (2022). Reviewer: Leon Harkleroad (Bowdoinham) MSC: 03D30 PDF BibTeX XML Cite \textit{U. Andrews} and \textit{A. Sorbi}, J. Symb. Log. 87, No. 3, 1260--1282 (2022; Zbl 07576907) Full Text: DOI OpenURL
Alvir, Rachael; Calvert, Wesley; Goodman, Grant; Harizanov, Valentina; Knight, Julia; Miller, Russell; Morozov, Andrey; Soskova, Alexandra; Weisshaar, Rose Interpreting a field in its Heisenberg group. (English) Zbl 07576904 J. Symb. Log. 87, No. 3, 1215-1230 (2022). MSC: 03C57 03D45 20H20 12L12 PDF BibTeX XML Cite \textit{R. Alvir} et al., J. Symb. Log. 87, No. 3, 1215--1230 (2022; Zbl 07576904) Full Text: DOI arXiv OpenURL
Alvir, Rachael; Burchfield, Hannah; Knight, Julia F. Copying one of a pair of structures. (English) Zbl 07576903 J. Symb. Log. 87, No. 3, 1201-1214 (2022). MSC: 03D99 PDF BibTeX XML Cite \textit{R. Alvir} et al., J. Symb. Log. 87, No. 3, 1201--1214 (2022; Zbl 07576903) Full Text: DOI OpenURL
Johnston, Reese; Raghavan, Dilip Complexity of index sets of descriptive set-theoretic notions. (English) Zbl 07576891 J. Symb. Log. 87, No. 3, 894-911 (2022). MSC: 03D60 03E15 PDF BibTeX XML Cite \textit{R. Johnston} and \textit{D. Raghavan}, J. Symb. Log. 87, No. 3, 894--911 (2022; Zbl 07576891) Full Text: DOI OpenURL
Chen, Chien-Yuan A exact quantum learning algorithm for the 2-junta problem in constant time. (English) Zbl 07573482 Int. J. Theor. Phys. 61, No. 8, Paper No. 212, 9 p. (2022). MSC: 68Qxx 03Dxx 68Txx PDF BibTeX XML Cite \textit{C.-Y. Chen}, Int. J. Theor. Phys. 61, No. 8, Paper No. 212, 9 p. (2022; Zbl 07573482) Full Text: DOI OpenURL
Dave, Vrunda; Filiot, Emmanuel; Krishna, Shankara Narayanan; Lhote, Nathan Synthesis of computable regular functions of infinite words. (English) Zbl 07566079 Log. Methods Comput. Sci. 18, No. 2, Paper No. 23, 29 p. (2022). MSC: 03B70 68-XX PDF BibTeX XML Cite \textit{V. Dave} et al., Log. Methods Comput. Sci. 18, No. 2, Paper No. 23, 29 p. (2022; Zbl 07566079) Full Text: arXiv Link OpenURL
Larchey-Wendling, Dominique; Forster, Yannick Hilbert’s tenth problem in Coq (extended version). (English) Zbl 07566048 Log. Methods Comput. Sci. 18, No. 1, Paper No. 35, 41 p. (2022). MSC: 03B70 68-XX PDF BibTeX XML Cite \textit{D. Larchey-Wendling} and \textit{Y. Forster}, Log. Methods Comput. Sci. 18, No. 1, Paper No. 35, 41 p. (2022; Zbl 07566048) Full Text: arXiv Link OpenURL
de Melo, Alexsander Andrade; de Oliveira Oliveira, Mateus Second-order finite automata. (English) Zbl 07562756 Theory Comput. Syst. 66, No. 4, 861-909 (2022). MSC: 68Qxx 03Dxx 03Cxx PDF BibTeX XML Cite \textit{A. A. de Melo} and \textit{M. de Oliveira Oliveira}, Theory Comput. Syst. 66, No. 4, 861--909 (2022; Zbl 07562756) Full Text: DOI OpenURL
Hitchcock, John M.; Shafei, Hadi Nonuniform reductions and NP-completeness. (English) Zbl 07562750 Theory Comput. Syst. 66, No. 4, 743-757 (2022). MSC: 68Qxx 03Dxx 68Wxx PDF BibTeX XML Cite \textit{J. M. Hitchcock} and \textit{H. Shafei}, Theory Comput. Syst. 66, No. 4, 743--757 (2022; Zbl 07562750) Full Text: DOI OpenURL
Andrews, Uri; Gerdes, Peter M.; Lempp, Steffen; Miller, Joseph S.; Schweber, Noah D. Computability and the symmetric difference operator. (English) Zbl 1494.03083 Log. J. IGPL 30, No. 3, 499-518 (2022). MSC: 03D25 PDF BibTeX XML Cite \textit{U. Andrews} et al., Log. J. IGPL 30, No. 3, 499--518 (2022; Zbl 1494.03083) Full Text: DOI OpenURL
Burr, Michael; Das, Suddhasattwa; Wolf, Christian; Yang, Yun Computability of topological pressure on compact shift spaces beyond finite type. (English) Zbl 07559743 Nonlinearity 35, No. 8, 4250-4282 (2022). MSC: 03D80 37B10 37D35 37A35 37B40 37M99 PDF BibTeX XML Cite \textit{M. Burr} et al., Nonlinearity 35, No. 8, 4250--4282 (2022; Zbl 07559743) Full Text: DOI arXiv OpenURL
Carlucci, Lorenzo; Tavernelli, Daniele Hindman’s theorem for sums along the full binary tree, \(\Sigma^0_2\)-induction and the pigeonhole principle for trees. (English) Zbl 07557512 Arch. Math. Logic 61, No. 5-6, 827-839 (2022). Reviewer: Jeffry L. Hirst (Boone) MSC: 03D80 03B30 03F35 11B30 05D10 PDF BibTeX XML Cite \textit{L. Carlucci} and \textit{D. Tavernelli}, Arch. Math. Logic 61, No. 5--6, 827--839 (2022; Zbl 07557512) Full Text: DOI OpenURL
Carl, Merlin; Schlicht, Philipp; Welch, Philip Decision times of infinite computations. (English) Zbl 07556131 Notre Dame J. Formal Logic 63, No. 2, 197-212 (2022). MSC: 03D60 03E15 PDF BibTeX XML Cite \textit{M. Carl} et al., Notre Dame J. Formal Logic 63, No. 2, 197--212 (2022; Zbl 07556131) Full Text: DOI arXiv OpenURL
Kihara, Takayuki; Selivanov, Victor Wadge-like degrees of Borel BQO-valued functions. (English) Zbl 07554406 Proc. Am. Math. Soc. 150, No. 9, 3989-4003 (2022). MSC: 03E15 03D55 PDF BibTeX XML Cite \textit{T. Kihara} and \textit{V. Selivanov}, Proc. Am. Math. Soc. 150, No. 9, 3989--4003 (2022; Zbl 07554406) Full Text: DOI arXiv OpenURL
Sanders, Sam Between Turing and Kleene. (English) Zbl 07551724 Artemov, Sergei (ed.) et al., Logical foundations of computer science. International symposium, LFCS 2022, Deerfield Beach, FL, USA, January 10–13, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13137, 281-300 (2022). MSC: 03B70 PDF BibTeX XML Cite \textit{S. Sanders}, Lect. Notes Comput. Sci. 13137, 281--300 (2022; Zbl 07551724) Full Text: DOI arXiv OpenURL
Normann, Dag; Sanders, Sam Betwixt Turing and Kleene. (English) Zbl 07551721 Artemov, Sergei (ed.) et al., Logical foundations of computer science. International symposium, LFCS 2022, Deerfield Beach, FL, USA, January 10–13, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13137, 236-252 (2022). MSC: 03B70 PDF BibTeX XML Cite \textit{D. Normann} and \textit{S. Sanders}, Lect. Notes Comput. Sci. 13137, 236--252 (2022; Zbl 07551721) Full Text: DOI arXiv OpenURL
Cenzer, Douglas; Krogman, Richard The isomorphism problem for FST injection structures. (English) Zbl 07551709 Artemov, Sergei (ed.) et al., Logical foundations of computer science. International symposium, LFCS 2022, Deerfield Beach, FL, USA, January 10–13, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13137, 25-36 (2022). MSC: 03B70 PDF BibTeX XML Cite \textit{D. Cenzer} and \textit{R. Krogman}, Lect. Notes Comput. Sci. 13137, 25--36 (2022; Zbl 07551709) Full Text: DOI OpenURL
Cubitt, Toby; Perez-Garcia, David; Wolf, Michael M. Undecidability of the spectral gap. (English) Zbl 07549430 Forum Math. Pi 10, Paper No. e14, 102 p. (2022). MSC: 81Q10 03D35 81P68 03D10 03D80 05B45 PDF BibTeX XML Cite \textit{T. Cubitt} et al., Forum Math. Pi 10, Paper No. e14, 102 p. (2022; Zbl 07549430) Full Text: DOI OpenURL
Duda, Karol; Ivanov (Iwanow), Aleksander Computable paradoxical decompositions. (English) Zbl 07547330 Int. J. Algebra Comput. 32, No. 5, 953-967 (2022). MSC: 20F10 03D45 PDF BibTeX XML Cite \textit{K. Duda} and \textit{A. Ivanov (Iwanow)}, Int. J. Algebra Comput. 32, No. 5, 953--967 (2022; Zbl 07547330) Full Text: DOI arXiv OpenURL
Küchlin, Wolfgang Logic and verification of product configuration in the automotive industry. (English) Zbl 07543891 Mainzer, Klaus (ed.) et al., Proof and computation II. From proof theory and univalent mathematics to program extraction and verification. Based on the international autumn school “Proof and computation”, September 20–26, 2019. Hackensack, NJ: World Scientific. 387-408 (2022). MSC: 03-XX 03Dxx 03Fxx 03Bxx PDF BibTeX XML Cite \textit{W. Küchlin}, in: Proof and computation II. From proof theory and univalent mathematics to program extraction and verification. Based on the international autumn school ``Proof and computation'', September 20--26, 2019. Hackensack, NJ: World Scientific. 387--408 (2022; Zbl 07543891) Full Text: DOI OpenURL
Larchey-Wendling, Dominique; Monin, Jean-François The Braga method: extracting certified algorithms from complex recursive schemes in Coq. (English) Zbl 07543890 Mainzer, Klaus (ed.) et al., Proof and computation II. From proof theory and univalent mathematics to program extraction and verification. Based on the international autumn school “Proof and computation”, September 20–26, 2019. Hackensack, NJ: World Scientific. 305-386 (2022). MSC: 03-XX 03Dxx 03Fxx 03Bxx PDF BibTeX XML Cite \textit{D. Larchey-Wendling} and \textit{J.-F. Monin}, in: Proof and computation II. From proof theory and univalent mathematics to program extraction and verification. Based on the international autumn school ``Proof and computation'', September 20--26, 2019. Hackensack, NJ: World Scientific. 305--386 (2022; Zbl 07543890) Full Text: DOI Link OpenURL
Benini, Marco; Bonacina, Roberta An Ad-Hoc semantics to study structural properties of types. (English) Zbl 07543889 Mainzer, Klaus (ed.) et al., Proof and computation II. From proof theory and univalent mathematics to program extraction and verification. Based on the international autumn school “Proof and computation”, September 20–26, 2019. Hackensack, NJ: World Scientific. 267-303 (2022). MSC: 03-XX 03Dxx 03Fxx 03Bxx PDF BibTeX XML Cite \textit{M. Benini} and \textit{R. Bonacina}, in: Proof and computation II. From proof theory and univalent mathematics to program extraction and verification. Based on the international autumn school ``Proof and computation'', September 20--26, 2019. Hackensack, NJ: World Scientific. 267--303 (2022; Zbl 07543889) Full Text: DOI OpenURL
Coquand, Thierry; Tosun, Ayberk Formal topology and univalent foundations. (English) Zbl 07543888 Mainzer, Klaus (ed.) et al., Proof and computation II. From proof theory and univalent mathematics to program extraction and verification. Based on the international autumn school “Proof and computation”, September 20–26, 2019. Hackensack, NJ: World Scientific. 255-266 (2022). MSC: 03-XX 03Dxx 03Fxx 03Bxx PDF BibTeX XML Cite \textit{T. Coquand} and \textit{A. Tosun}, in: Proof and computation II. From proof theory and univalent mathematics to program extraction and verification. Based on the international autumn school ``Proof and computation'', September 20--26, 2019. Hackensack, NJ: World Scientific. 255--266 (2022; Zbl 07543888) Full Text: DOI OpenURL
Blechschmidt, Ingo Generalized spaces for constructive algebra. (English) Zbl 07543886 Mainzer, Klaus (ed.) et al., Proof and computation II. From proof theory and univalent mathematics to program extraction and verification. Based on the international autumn school “Proof and computation”, September 20–26, 2019. Hackensack, NJ: World Scientific. 99-187 (2022). MSC: 03-XX 03Dxx 03Fxx 03Bxx PDF BibTeX XML Cite \textit{I. Blechschmidt}, in: Proof and computation II. From proof theory and univalent mathematics to program extraction and verification. Based on the international autumn school ``Proof and computation'', September 20--26, 2019. Hackensack, NJ: World Scientific. 99--187 (2022; Zbl 07543886) Full Text: DOI arXiv OpenURL
Kawai, Tatsuji From intuitionistic mathematics to point-free topology. (English) Zbl 07543885 Mainzer, Klaus (ed.) et al., Proof and computation II. From proof theory and univalent mathematics to program extraction and verification. Based on the international autumn school “Proof and computation”, September 20–26, 2019. Hackensack, NJ: World Scientific. 55-98 (2022). MSC: 03-XX 03Dxx 03Fxx 03Bxx PDF BibTeX XML Cite \textit{T. Kawai}, in: Proof and computation II. From proof theory and univalent mathematics to program extraction and verification. Based on the international autumn school ``Proof and computation'', September 20--26, 2019. Hackensack, NJ: World Scientific. 55--98 (2022; Zbl 07543885) Full Text: DOI OpenURL
Centrone, Stefania Conceptions of proof from aristotle to Gentzen’s calculi. (English) Zbl 07543884 Mainzer, Klaus (ed.) et al., Proof and computation II. From proof theory and univalent mathematics to program extraction and verification. Based on the international autumn school “Proof and computation”, September 20–26, 2019. Hackensack, NJ: World Scientific. 33-54 (2022). MSC: 03-XX 03Dxx 03Fxx 03Bxx PDF BibTeX XML Cite \textit{S. Centrone}, in: Proof and computation II. From proof theory and univalent mathematics to program extraction and verification. Based on the international autumn school ``Proof and computation'', September 20--26, 2019. Hackensack, NJ: World Scientific. 33--54 (2022; Zbl 07543884) Full Text: DOI OpenURL
Mainzer, Klaus Proof and computation: perspectives for mathematics, computer science, and philosophy. (English) Zbl 07543883 Mainzer, Klaus (ed.) et al., Proof and computation II. From proof theory and univalent mathematics to program extraction and verification. Based on the international autumn school “Proof and computation”, September 20–26, 2019. Hackensack, NJ: World Scientific. 1-32 (2022). MSC: 03-XX 03Dxx 03Fxx 03Bxx PDF BibTeX XML Cite \textit{K. Mainzer}, in: Proof and computation II. From proof theory and univalent mathematics to program extraction and verification. Based on the international autumn school ``Proof and computation'', September 20--26, 2019. Hackensack, NJ: World Scientific. 1--32 (2022; Zbl 07543883) Full Text: DOI OpenURL
Ganchev, Hristo A.; Kalimullin, Iskander Sh.; Miller, Joseph S.; Soskova, Mariya I. A structural dichotomy in the enumeration degrees. (English) Zbl 07541912 J. Symb. Log. 87, No. 2, 527-544 (2022). Reviewer: Rupert Hölzl (Neubiberg) MSC: 03D30 03D78 PDF BibTeX XML Cite \textit{H. A. Ganchev} et al., J. Symb. Log. 87, No. 2, 527--544 (2022; Zbl 07541912) Full Text: DOI OpenURL
Sato, Kentaro Bounded inductive dichotomy: separation of open and clopen determinacies with finite alternatives in constructive contexts. (English) Zbl 07541618 Arch. Math. Logic 61, No. 3-4, 399-435 (2022). MSC: 03D70 03E65 03F35 03F55 03D30 03F50 PDF BibTeX XML Cite \textit{K. Sato}, Arch. Math. Logic 61, No. 3--4, 399--435 (2022; Zbl 07541618) Full Text: DOI OpenURL
Stahl, Rachel D. Computability and the game of cops and robbers on graphs. (English) Zbl 1491.05134 Arch. Math. Logic 61, No. 3-4, 373-397 (2022). MSC: 05C57 05C63 91A43 91A24 03D15 03D20 03D25 03D28 03D50 PDF BibTeX XML Cite \textit{R. D. Stahl}, Arch. Math. Logic 61, No. 3--4, 373--397 (2022; Zbl 1491.05134) Full Text: DOI OpenURL
Ollinger, Nicolas; Theyssier, Guillaume Freezing, bounded-change and convergent cellular automata. (English) Zbl 1499.68213 Discrete Math. Theor. Comput. Sci. 24, No. 1, Paper No. 2, 37 p. (2022). MSC: 68Q80 68Q25 PDF BibTeX XML Cite \textit{N. Ollinger} and \textit{G. Theyssier}, Discrete Math. Theor. Comput. Sci. 24, No. 1, Paper No. 2, 37 p. (2022; Zbl 1499.68213) Full Text: DOI arXiv OpenURL
Delporte, Carole; Fauconnier, Hugues; Rajsbaum, Sergio; Raynal, Michel Distributed computability: relating \(k\)-immediate snapshot and \(x\)-set agreement. (English) Zbl 1487.68040 Inf. Comput. 285, Part B, Article ID 104815, 15 p. (2022). MSC: 68M14 68W15 PDF BibTeX XML Cite \textit{C. Delporte} et al., Inf. Comput. 285, Part B, Article ID 104815, 15 p. (2022; Zbl 1487.68040) Full Text: DOI OpenURL
Flood, Stephen; Jura, Matthew; Levin, Oscar; Markkanen, Tyler The computational strength of matchings in countable graphs. (English) Zbl 07538233 Ann. Pure Appl. Logic 173, No. 8, Article ID 103133, 26 p. (2022). MSC: 03D80 03D99 03F15 03F35 PDF BibTeX XML Cite \textit{S. Flood} et al., Ann. Pure Appl. Logic 173, No. 8, Article ID 103133, 26 p. (2022; Zbl 07538233) Full Text: DOI arXiv OpenURL
Dadazhanov, R. N.; Kasymov, N. Kh.; Khodzhamuratova, I. A. Uniformly computably separable algebras with effectively splittable families of negative congruences. (English. Russian original) Zbl 07538031 Sib. Math. J. 63, No. 3, 466-475 (2022); translation from Sib. Mat. Zh. 63, No. 3, 562-575 (2022). MSC: 03Dxx 03Cxx 08Axx PDF BibTeX XML Cite \textit{R. N. Dadazhanov} et al., Sib. Math. J. 63, No. 3, 466--475 (2022; Zbl 07538031); translation from Sib. Mat. Zh. 63, No. 3, 562--575 (2022) Full Text: DOI OpenURL
Kihara, Takayuki; Pauly, Arno Point degree spectra of represented spaces. (English) Zbl 07537759 Forum Math. Sigma 10, Paper No. e31, 27 p. (2022). MSC: 03D30 54H05 03D78 54F45 46J10 PDF BibTeX XML Cite \textit{T. Kihara} and \textit{A. Pauly}, Forum Math. Sigma 10, Paper No. e31, 27 p. (2022; Zbl 07537759) Full Text: DOI arXiv OpenURL
Kim, Aeran Recursion formulas for Bernoulli numbers. (English) Zbl 07534778 Thai J. Math. 20, No. 1, 55-67 (2022). MSC: 11B68 11B39 03D30 PDF BibTeX XML Cite \textit{A. Kim}, Thai J. Math. 20, No. 1, 55--67 (2022; Zbl 07534778) Full Text: Link OpenURL
Greenberg, Noam; Turetsky, Daniel Completeness of the hyperarithmetic isomorphism equivalence relation. (English) Zbl 07534683 Adv. Math. 403, Article ID 108356, 56 p. (2022). Reviewer: Jamalbek Tussupov (Astana) MSC: 03D30 03D55 PDF BibTeX XML Cite \textit{N. Greenberg} and \textit{D. Turetsky}, Adv. Math. 403, Article ID 108356, 56 p. (2022; Zbl 07534683) Full Text: DOI OpenURL
McInerney, Michael; Ng, Keng Meng Separating weak \(\alpha\)-change and \(\alpha\)-change genericity. (English) Zbl 07530350 Ann. Pure Appl. Logic 173, No. 7, Article ID 103134, 31 p. (2022). MSC: 03D25 03D55 03D80 03D28 PDF BibTeX XML Cite \textit{M. McInerney} and \textit{K. M. Ng}, Ann. Pure Appl. Logic 173, No. 7, Article ID 103134, 31 p. (2022; Zbl 07530350) Full Text: DOI OpenURL
Golov, Anton; Terwijn, Sebastiaan A. Fixpoints and relative precompleteness. (English) Zbl 07527241 Computability 11, No. 2, 135-146 (2022). MSC: 03Dxx PDF BibTeX XML Cite \textit{A. Golov} and \textit{S. A. Terwijn}, Computability 11, No. 2, 135--146 (2022; Zbl 07527241) Full Text: DOI arXiv OpenURL
Corona, Dario; Della Corte, Alessandro The critical exponent functions. (English) Zbl 07514677 C. R., Math., Acad. Sci. Paris 360, 315-332 (2022). Reviewer: Dan Rust (Milton Keynes) MSC: 37B40 37B20 37E15 68R15 03D40 26A15 PDF BibTeX XML Cite \textit{D. Corona} and \textit{A. Della Corte}, C. R., Math., Acad. Sci. Paris 360, 315--332 (2022; Zbl 07514677) Full Text: DOI OpenURL
Liu, Lu; Patey, Ludovic The reverse mathematics of the thin set and Erdős-Moser theorems. (English) Zbl 07506780 J. Symb. Log. 87, No. 1, 313-346 (2022). MSC: 03D80 03F35 03B30 PDF BibTeX XML Cite \textit{L. Liu} and \textit{L. Patey}, J. Symb. Log. 87, No. 1, 313--346 (2022; Zbl 07506780) Full Text: DOI arXiv HAL OpenURL
Miller, Russell HTP-complete rings of rational numbers. (English) Zbl 1501.12003 J. Symb. Log. 87, No. 1, 252-272 (2022). Reviewer: Alexandra Shlapentokh (Greenville) MSC: 12L05 11U05 03D45 03C40 PDF BibTeX XML Cite \textit{R. Miller}, J. Symb. Log. 87, No. 1, 252--272 (2022; Zbl 1501.12003) Full Text: DOI arXiv OpenURL
Patey, Ludovic Ramsey-like theorems and moduli of computation. (English) Zbl 07506771 J. Symb. Log. 87, No. 1, 72-108 (2022). Reviewer: Jeffry L. Hirst (Boone) MSC: 03B30 03D80 03F35 PDF BibTeX XML Cite \textit{L. Patey}, J. Symb. Log. 87, No. 1, 72--108 (2022; Zbl 07506771) Full Text: DOI arXiv OpenURL
Downey, Rod; Greenberg, Noam; Harrison-Trainor, Matthew; Patey, Ludovic; Turetsky, Dan Relationships between computability-theoretic properties of problems. (English) Zbl 07506770 J. Symb. Log. 87, No. 1, 47-71 (2022). Reviewer: Jamalbek Tussupov (Astana) MSC: 03B30 03D30 03D80 PDF BibTeX XML Cite \textit{R. Downey} et al., J. Symb. Log. 87, No. 1, 47--71 (2022; Zbl 07506770) Full Text: DOI arXiv OpenURL
Faizrahmanov, M. Kh. On \(p \)-universal and \(p \)-minimal numberings. (English. Russian original) Zbl 07505250 Sib. Math. J. 63, No. 2, 365-373 (2022); translation from Sib. Mat. Zh. 63, No. 2, 440-449 (2022). MSC: 03Dxx 03-XX PDF BibTeX XML Cite \textit{M. Kh. Faizrahmanov}, Sib. Math. J. 63, No. 2, 365--373 (2022; Zbl 07505250); translation from Sib. Mat. Zh. 63, No. 2, 440--449 (2022) Full Text: DOI OpenURL
Rybakov, Vladimir V. Multi-agents’ temporal logic using operations of static agents’ knowledge. (English) Zbl 07503907 J. Sib. Fed. Univ., Math. Phys. 15, No. 1, 114-124 (2022). MSC: 03Bxx 68Txx 03-XX PDF BibTeX XML Cite \textit{V. V. Rybakov}, J. Sib. Fed. Univ., Math. Phys. 15, No. 1, 114--124 (2022; Zbl 07503907) Full Text: DOI MNR OpenURL
Barnes, James S.; Goh, Jun Le; Shore, Richard A. Theorems of hyperarithmetic analysis and almost theorems of hyperarithmetic analysis. (English) Zbl 07503072 Bull. Symb. Log. 28, No. 1, 133-149 (2022). Reviewer: Jeffry L. Hirst (Boone) MSC: 03B30 03D55 03F35 05C63 03D80 05C38 05C69 05C70 PDF BibTeX XML Cite \textit{J. S. Barnes} et al., Bull. Symb. Log. 28, No. 1, 133--149 (2022; Zbl 07503072) Full Text: DOI OpenURL
Hölzl, Rupert; Porter, Christopher P. Degrees of randomized computability. (English) Zbl 1497.03056 Bull. Symb. Log. 28, No. 1, 27-70 (2022). Reviewer: Leon Harkleroad (Bowdoinham) MSC: 03D32 03D30 03D28 68Q30 PDF BibTeX XML Cite \textit{R. Hölzl} and \textit{C. P. Porter}, Bull. Symb. Log. 28, No. 1, 27--70 (2022; Zbl 1497.03056) Full Text: DOI arXiv OpenURL
Wu, Huishan The computational complexity of module socles. (English) Zbl 07501983 Ann. Pure Appl. Logic 173, No. 5, Article ID 103089, 11 p. (2022). MSC: 03D15 03D80 68Q15 68Q17 PDF BibTeX XML Cite \textit{H. Wu}, Ann. Pure Appl. Logic 173, No. 5, Article ID 103089, 11 p. (2022; Zbl 07501983) Full Text: DOI OpenURL
Chitaia, Irakli; Omanadze, Roland Degree structures of conjunctive reducibility. (English) Zbl 07495452 Arch. Math. Logic 61, No. 1-2, 19-31 (2022). MSC: 03D25 03D30 PDF BibTeX XML Cite \textit{I. Chitaia} and \textit{R. Omanadze}, Arch. Math. Logic 61, No. 1--2, 19--31 (2022; Zbl 07495452) Full Text: DOI OpenURL
Iwaki, Kohei; Kidwai, Omar Topological recursion and uncoupled BPS structures. I: BPS spectrum and free energies. (English) Zbl 1486.81157 Adv. Math. 398, Article ID 108191, 54 p. (2022). Reviewer: Olivier Marchal (Saint-Etienne) MSC: 81T60 82B20 34M60 18G40 03D80 11B68 PDF BibTeX XML Cite \textit{K. Iwaki} and \textit{O. Kidwai}, Adv. Math. 398, Article ID 108191, 54 p. (2022; Zbl 1486.81157) Full Text: DOI arXiv OpenURL
Carl, Merlin Space-bounded OTMs and \(\operatorname{REG}^\infty \). (English) Zbl 07481741 Computability 11, No. 1, 41-56 (2022). MSC: 03Dxx PDF BibTeX XML Cite \textit{M. Carl}, Computability 11, No. 1, 41--56 (2022; Zbl 07481741) Full Text: DOI arXiv OpenURL
Sanders, Sam Countable sets versus sets that are countable in reverse mathematics. (English) Zbl 07481740 Computability 11, No. 1, 9-39 (2022). MSC: 03Dxx PDF BibTeX XML Cite \textit{S. Sanders}, Computability 11, No. 1, 9--39 (2022; Zbl 07481740) Full Text: DOI arXiv OpenURL
Nielsen, Pace P. Definitional schemes for primitive recursive and computable functions. (English) Zbl 07481739 Computability 11, No. 1, 1-8 (2022). Reviewer: Joseph S. Ullian (Santa Barbara) MSC: 03Dxx PDF BibTeX XML Cite \textit{P. P. Nielsen}, Computability 11, No. 1, 1--8 (2022; Zbl 07481739) Full Text: DOI OpenURL
Fiori-Carones, Marta; Shafer, Paul; Soldà, Giovanni An inside/outside Ramsey theorem and recursion theory. (English) Zbl 07479592 Trans. Am. Math. Soc. 375, No. 3, 1977-2024 (2022). Reviewer: Jeffry L. Hirst (Boone) MSC: 03B30 03D30 03F35 PDF BibTeX XML Cite \textit{M. Fiori-Carones} et al., Trans. Am. Math. Soc. 375, No. 3, 1977--2024 (2022; Zbl 07479592) Full Text: DOI arXiv OpenURL
Ostrovsky, Alexey On the widest class of completeness-preserving covering maps. (English) Zbl 1485.54035 Topology Appl. 308, Article ID 107998, 7 p. (2022). Reviewer: Shou Lin (Ningde) MSC: 54E50 54C10 54E40 03D99 PDF BibTeX XML Cite \textit{A. Ostrovsky}, Topology Appl. 308, Article ID 107998, 7 p. (2022; Zbl 1485.54035) Full Text: DOI OpenURL
Andrews, Uri; Lempp, Steffen; Mustafa, Manat; Schweber, Noah D. The first-order theory of the computably enumerable equivalence relations in the uncountable setting. (English) Zbl 07471451 J. Log. Comput. 32, No. 1, 98-114 (2022). MSC: 03-XX 68-XX PDF BibTeX XML Cite \textit{U. Andrews} et al., J. Log. Comput. 32, No. 1, 98--114 (2022; Zbl 07471451) Full Text: DOI OpenURL