Orellana-Martín, David; Valencia-Cabrera, Luis; Pérez-Jiménez, Mario J. Proof techniques in membrane computing. (English) Zbl 07318721 Theor. Comput. Sci. 862, 236-249 (2021). MSC: 68Q PDF BibTeX XML Cite \textit{D. Orellana-Martín} et al., Theor. Comput. Sci. 862, 236--249 (2021; Zbl 07318721) Full Text: DOI
Durand, Bruno; Romashchenko, Andrei The expressiveness of quasiperiodic and minimal shifts of finite type. (English) Zbl 07317322 Ergodic Theory Dyn. Syst. 41, No. 4, 1086-1138 (2021). MSC: 37B50 03D80 68R05 PDF BibTeX XML Cite \textit{B. Durand} and \textit{A. Romashchenko}, Ergodic Theory Dyn. Syst. 41, No. 4, 1086--1138 (2021; Zbl 07317322) Full Text: DOI
Pavlov, Ronnie; Vanier, Pascal The relationship between word complexity and computational complexity in subshifts. (English) Zbl 07314925 Discrete Contin. Dyn. Syst. 41, No. 4, 1627-1648 (2021). MSC: 37B10 03D15 03D40 08A50 PDF BibTeX XML Cite \textit{R. Pavlov} and \textit{P. Vanier}, Discrete Contin. Dyn. Syst. 41, No. 4, 1627--1648 (2021; Zbl 07314925) Full Text: DOI
Brattka, Vasco; Gherardi, Guido Completion of choice. (English) Zbl 07300475 Ann. Pure Appl. Logic 172, No. 3, Article ID 102914, 31 p. (2021). MSC: 03B30 03D30 03D78 03F60 PDF BibTeX XML Cite \textit{V. Brattka} and \textit{G. Gherardi}, Ann. Pure Appl. Logic 172, No. 3, Article ID 102914, 31 p. (2021; Zbl 07300475) Full Text: DOI
Kristiansen, Lars; Murwanashyaka, Juvenal First-order concatenation theory with bounded quantifiers. (English) Zbl 07297799 Arch. Math. Logic 60, No. 1-2, 77-104 (2021). MSC: 03B10 03B25 03D40 68R15 PDF BibTeX XML Cite \textit{L. Kristiansen} and \textit{J. Murwanashyaka}, Arch. Math. Logic 60, No. 1--2, 77--104 (2021; Zbl 07297799) Full Text: DOI
Freund, Anton; Rathjen, Michael Derivatives of normal functions in reverse mathematics. (English) Zbl 07285677 Ann. Pure Appl. Logic 172, No. 2, Article ID 102890, 50 p. (2021). MSC: 03F15 03F35 03D60 03E10 PDF BibTeX XML Cite \textit{A. Freund} and \textit{M. Rathjen}, Ann. Pure Appl. Logic 172, No. 2, Article ID 102890, 50 p. (2021; Zbl 07285677) Full Text: DOI
Ongay-Valverde, Iván; Tveite, Paul Computable analogs of cardinal characteristics: prediction and rearrangement. (English) Zbl 07260108 Ann. Pure Appl. Logic 172, No. 1, Article ID 102872, 23 p. (2021). MSC: 03 PDF BibTeX XML Cite \textit{I. Ongay-Valverde} and \textit{P. Tveite}, Ann. Pure Appl. Logic 172, No. 1, Article ID 102872, 23 p. (2021; Zbl 07260108) Full Text: DOI
Cenzer, Douglas (ed.); Porter, Christopher (ed.); Zapletal, Jindrich (ed.) Structure and randomness in computability and set theory. (English) Zbl 1454.03005 Hackensack, NJ: World Scientific (ISBN 978-981-322-822-1/hbk; 978-981-322-824-5/ebook). xx, 366 p. (2021). MSC: 03-02 03Exx 03Dxx 00B15 PDF BibTeX XML Cite \textit{D. Cenzer} (ed.) et al., Structure and randomness in computability and set theory. Hackensack, NJ: World Scientific (2021; Zbl 1454.03005) Full Text: DOI
Aguilera, J. P. \(F_\sigma\) games and reflection in \(L(\mathbb{R})\). (English) Zbl 07326435 J. Symb. Log. 85, No. 3, 1102-1123 (2020). MSC: 03B30 03D60 03D70 03E15 03D60 PDF BibTeX XML Cite \textit{J. P. Aguilera}, J. Symb. Log. 85, No. 3, 1102--1123 (2020; Zbl 07326435) Full Text: DOI
Kihara, Takayuki; Marcone, Alberto; Pauly, Arno Searching for an analogue of \(\text{ATR}_0\) in the Weihrauch lattice. (English) Zbl 07326432 J. Symb. Log. 85, No. 3, 1006-1043 (2020). MSC: 03D78 03D30 03B30 PDF BibTeX XML Cite \textit{T. Kihara} et al., J. Symb. Log. 85, No. 3, 1006--1043 (2020; Zbl 07326432) Full Text: DOI
Shimi, Adam; Castañeda, Armando \(k\)-set agreement bounds in round-based models through combinatorial topology. (English) Zbl 07323214 Cachin, Christian (ed.) et al., Proceedings of the 39th ACM symposium on principles of distributed computing, PODC ’20, virtual event, August 3–7, 2020. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-7582-5). 395-404 (2020). MSC: 68M14 68W15 PDF BibTeX XML Cite \textit{A. Shimi} and \textit{A. Castañeda}, in: Proceedings of the 39th ACM symposium on principles of distributed computing, PODC '20, virtual event, August 3--7, 2020. New York, NY: Association for Computing Machinery (ACM). 395--404 (2020; Zbl 07323214) Full Text: DOI
Freund, Anton How strong are single fixed points of normal functions? (English) Zbl 07303641 J. Symb. Log. 85, No. 2, 709-732 (2020). MSC: 03B30 03F15 03E10 03D60 PDF BibTeX XML Cite \textit{A. Freund}, J. Symb. Log. 85, No. 2, 709--732 (2020; Zbl 07303641) Full Text: DOI
Bresolin, Davide; Collins, Pieter; Geretti, Luca; Segala, Roberto; Villa, Tiziano; Živanović Gonzalez, Sanja A computable and compositional semantics for hybrid automata. (English) Zbl 07300859 Proceedings of the 23rd ACM international conference on hybrid systems: computation and control, HSCC 2020, Sydney, Australia and virtual, April 21–24, 2020. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-7018-9). Article No. 18, 11 p. (2020). MSC: 68Q45 68Q60 93C30 PDF BibTeX XML Cite \textit{D. Bresolin} et al., in: Proceedings of the 23rd ACM international conference on hybrid systems: computation and control, HSCC 2020, Sydney, Australia and virtual, April 21--24, 2020. New York, NY: Association for Computing Machinery (ACM). Article No. 18, 11 p. (2020; Zbl 07300859) Full Text: DOI
Tsukada, Takeshi On computability of logical approaches to branching-time property verification of programs. (English) Zbl 07299520 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). 886-899 (2020). MSC: 68 PDF BibTeX XML Cite \textit{T. Tsukada}, 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). 886--899 (2020; Zbl 07299520) Full Text: DOI
Powell, Thomas On the computational content of Zorn’s lemma. (English) Zbl 07299511 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). 768-781 (2020). MSC: 03B70 PDF BibTeX XML Cite \textit{T. Powell}, 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). 768--781 (2020; Zbl 07299511) Full Text: DOI
Rojas, Cristobal; Yampolsky, Michael How to lose at Monte Carlo: a simple dynamical system whose typical statistical behavior is non-computable. (English) Zbl 07298310 Makarychev, Konstantin (ed.) et al., Proceedings of the 52nd annual ACM SIGACT symposium on theory of computing, STOC ’20, Chicago, IL, USA, June 22–26, 2020. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-6979-4). 1066-1072 (2020). MSC: 68Qxx PDF BibTeX XML Cite \textit{C. Rojas} and \textit{M. Yampolsky}, in: Proceedings of the 52nd annual ACM SIGACT symposium on theory of computing, STOC '20, Chicago, IL, USA, June 22--26, 2020. New York, NY: Association for Computing Machinery (ACM). 1066--1072 (2020; Zbl 07298310) Full Text: DOI
Yu, Liang An application of recursion theory to analysis. (English) Zbl 07290398 Bull. Symb. Log. 26, No. 1, 15-25 (2020). MSC: 03D30 03D32 03D80 03E15 28A05 54H05 PDF BibTeX XML Cite \textit{L. Yu}, Bull. Symb. Log. 26, No. 1, 15--25 (2020; Zbl 07290398) Full Text: DOI
Carl, Merlin Space and time complexity for infinite time Turing machines. (English) Zbl 07285867 J. Log. Comput. 30, No. 6, 1239-1255 (2020). MSC: 03 68 PDF BibTeX XML Cite \textit{M. Carl}, J. Log. Comput. 30, No. 6, 1239--1255 (2020; Zbl 07285867) Full Text: DOI
Robič, Borut The foundations of computability theory. 2nd completely revised edition. (English) Zbl 1454.03004 Berlin: Springer (ISBN 978-3-662-62420-3/hbk; 978-3-662-62421-0/ebook). xxi, 422 p. (2020). MSC: 03-01 03Dxx 03-03 01A60 PDF BibTeX XML Cite \textit{B. Robič}, The foundations of computability theory. 2nd completely revised edition. Berlin: Springer (2020; Zbl 1454.03004) Full Text: DOI
Burr, Michael; Wolf, Christian Computability at zero temperature. (English) Zbl 1455.37032 Nonlinearity 33, No. 11, 6157-6175 (2020). Reviewer: Hasan Akin (Gaziantep) MSC: 37D35 37E45 03D15 37B10 37L40 03D80 PDF BibTeX XML Cite \textit{M. Burr} and \textit{C. Wolf}, Nonlinearity 33, No. 11, 6157--6175 (2020; Zbl 1455.37032) Full Text: DOI
Vlasov, I. I. On fairly low and superlow sets. (English) Zbl 07272831 Lobachevskii J. Math. 41, No. 9, 1718-1725 (2020). MSC: 03 68 PDF BibTeX XML Cite \textit{I. I. Vlasov}, Lobachevskii J. Math. 41, No. 9, 1718--1725 (2020; Zbl 07272831) Full Text: DOI
Hirst, Jeffry L. Leaf management. (English) Zbl 07271577 Computability 9, No. 3-4, 309-314 (2020). MSC: 03D PDF BibTeX XML Cite \textit{J. L. Hirst}, Computability 9, No. 3--4, 309--314 (2020; Zbl 07271577) Full Text: DOI
Hertling, Peter Forests describing Wadge degrees and topological Weihrauch degrees of certain classes of functions and relations. (English) Zbl 07271576 Computability 9, No. 3-4, 249-307 (2020). Reviewer: Leon Harkleroad (Bowdoinham) MSC: 03D30 03D55 PDF BibTeX XML Cite \textit{P. Hertling}, Computability 9, No. 3--4, 249--307 (2020; Zbl 07271576) Full Text: DOI
Goh, Jun Le Compositions of multivalued functions. (English) Zbl 07271575 Computability 9, No. 3-4, 231-247 (2020). Reviewer: Jamalbek Tussupov (Astana) MSC: 03D30 PDF BibTeX XML Cite \textit{J. Le Goh}, Computability 9, No. 3--4, 231--247 (2020; Zbl 07271575) Full Text: DOI
Cholak, Peter A.; Dzhafarov, Damir D.; Hirschfeldt, Denis R.; Patey, Ludovic Some results concerning the \(\mathsf{SRT}_2^2\) vs. \(\mathsf{COH}\) problem. (English) Zbl 07271573 Computability 9, No. 3-4, 193-217 (2020). MSC: 03D PDF BibTeX XML Cite \textit{P. A. Cholak} et al., Computability 9, No. 3--4, 193--217 (2020; Zbl 07271573) Full Text: DOI
Johnston, Reese Cantor-Bendixson ranks of effectively closed sets in admissible recursion theory. (English) Zbl 07271558 Computability 9, No. 2, 111-125 (2020). MSC: 03D PDF BibTeX XML Cite \textit{R. Johnston}, Computability 9, No. 2, 111--125 (2020; Zbl 07271558) Full Text: DOI
Dzhafarov, Damir D.; Goh, Jun Le; Hirschfeldt, Denis R.; Patey, Ludovic; Pauly, Arno Ramsey’s theorem and products in the Weihrauch degrees. (English) Zbl 07271557 Computability 9, No. 2, 85-110 (2020). MSC: 03D PDF BibTeX XML Cite \textit{D. D. Dzhafarov} et al., Computability 9, No. 2, 85--110 (2020; Zbl 07271557) Full Text: DOI
Wu, Huishan Bounded-low sets and the high/low hierarchy. (English) Zbl 07261475 Arch. Math. Logic 59, No. 7-8, 925-938 (2020). MSC: 03D10 03D25 03D30 PDF BibTeX XML Cite \textit{H. Wu}, Arch. Math. Logic 59, No. 7--8, 925--938 (2020; Zbl 07261475) Full Text: DOI
Bazhenov, Nikolay; Mustafa, Manat; San Mauro, Luca; Sorbi, Andrea; Yamaleev, Mars Classifying equivalence relations in the Ershov hierarchy. (English) Zbl 07261470 Arch. Math. Logic 59, No. 7-8, 835-864 (2020). Reviewer: Leon Harkleroad (Bowdoinham) MSC: 03D55 03D30 PDF BibTeX XML Cite \textit{N. Bazhenov} et al., Arch. Math. Logic 59, No. 7--8, 835--864 (2020; Zbl 07261470) Full Text: DOI
Chitaia, Irakli; Ng, Keng Meng; Sorbi, Andrea; Yang, Yue Incomparability in local structures of \(s\)-degrees and \(Q\)-degrees. (English) Zbl 07261467 Arch. Math. Logic 59, No. 7-8, 777-791 (2020). Reviewer: Patrizio Cintioli (Camerino) MSC: 03D25 03D30 PDF BibTeX XML Cite \textit{I. Chitaia} et al., Arch. Math. Logic 59, No. 7--8, 777--791 (2020; Zbl 07261467) Full Text: DOI
Fernández-Duque, David; Shafer, Paul; Yokoyama, Keita Ekeland’s variational principle in weak and strong systems of arithmetic. (English) Zbl 07260158 Sel. Math., New Ser. 26, No. 5, Paper No. 68, 37 p. (2020). MSC: 03B30 03F35 03F60 58E30 PDF BibTeX XML Cite \textit{D. Fernández-Duque} et al., Sel. Math., New Ser. 26, No. 5, Paper No. 68, 37 p. (2020; Zbl 07260158) Full Text: DOI
Fritz, Tobias Curious properties of free hypergraph \(C^*\)-algebras. (English) Zbl 07259984 J. Oper. Theory 83, No. 2, 423-445 (2020). Reviewer: Victor V. Pambuccian (Glendale) MSC: 46L99 03D80 81P13 03F40 PDF BibTeX XML Cite \textit{T. Fritz}, J. Oper. Theory 83, No. 2, 423--445 (2020; Zbl 07259984) Full Text: DOI
Exibard, Léo; Filiot, Emmanuel; Reynier, Pierre-Alain On computability of data word functions defined by transducers. (English) Zbl 07250940 Goubault-Larrecq, Jean (ed.) et al., Foundations of software science and computation structures. 23rd international conference, FOSSACS 2020, held as part of the European joint conferences on theory and practice of software, ETAPS 2020, Dublin, Ireland, April 25–30, 2020. Proceedings. Cham: Springer (ISBN 978-3-030-45230-8/pbk; 978-3-030-45231-5/ebook). Lecture Notes in Computer Science 12077, 217-236 (2020). MSC: 68Nxx 68Qxx PDF BibTeX XML Cite \textit{L. Exibard} et al., Lect. Notes Comput. Sci. 12077, 217--236 (2020; Zbl 07250940) Full Text: DOI
Cintioli, Patrizio Corrigendum to “Sets with no subsets of higher weak truth-table degree”, Reports on Mathematical Logic, 53 (2018), 3–17. (English) Zbl 07250412 Rep. Math. Logic 55, 143-144 (2020). MSC: 03D30 PDF BibTeX XML Cite \textit{P. Cintioli}, Rep. Math. Logic 55, 143--144 (2020; Zbl 07250412) Full Text: DOI
Gerdes, Peter An \(\omega \)-REA set forming a minimal pair with 0’. (English) Zbl 07244822 Computability 9, No. 1, 37-50 (2020). Reviewer: Leon Harkleroad (Bowdoinham) MSC: 03D28 03D55 PDF BibTeX XML Cite \textit{P. Gerdes}, Computability 9, No. 1, 37--50 (2020; Zbl 07244822) Full Text: DOI
Freund, Anton Computable aspects of the Bachmann-Howard principle. (English) Zbl 07244013 J. Math. Log. 20, No. 2, Article ID 2050006, 26 p. (2020). Reviewer: Jeffry L. Hirst (Boone) MSC: 03B30 03D60 03F15 PDF BibTeX XML Cite \textit{A. Freund}, J. Math. Log. 20, No. 2, Article ID 2050006, 26 p. (2020; Zbl 07244013) Full Text: DOI
Lutz, Patrick; Walsh, James Incompleteness and jump hierarchies. (English) Zbl 07243364 Proc. Am. Math. Soc. 148, No. 11, 4997-5006 (2020). MSC: 03F35 03D55 03F40 PDF BibTeX XML Cite \textit{P. Lutz} and \textit{J. Walsh}, Proc. Am. Math. Soc. 148, No. 11, 4997--5006 (2020; Zbl 07243364) Full Text: DOI
Downey, Rod; Melnikov, Alexander; Ng, Keng Meng Enumerating abelian \(p\)-groups. (English) Zbl 07239020 J. Algebra 560, 745-790 (2020). Reviewer: Andrei S. Morozov (Novosibirsk) MSC: 03D45 03C57 20K10 PDF BibTeX XML Cite \textit{R. Downey} et al., J. Algebra 560, 745--790 (2020; Zbl 07239020) Full Text: DOI
Rezuş, Adrian (ed.) Contemporary logic and computing. (English) Zbl 1446.03006 Landscapes in Logic 1. London: College Publications (ISBN 978-1-84890-340-1/pbk). vi, 730 p. (2020). MSC: 03-06 03Bxx 03Dxx 00B15 PDF BibTeX XML Cite \textit{A. Rezuş} (ed.), Contemporary logic and computing. London: College Publications (2020; Zbl 1446.03006)
Rybakov, Vladimir Vladimirovich Temporal logic with accessibility temporal relations generated by time states themselves. (English) Zbl 1437.03081 Sib. Èlektron. Mat. Izv. 17, 923-932 (2020). MSC: 03B44 68T27 PDF BibTeX XML Cite \textit{V. V. Rybakov}, Sib. Èlektron. Mat. Izv. 17, 923--932 (2020; Zbl 1437.03081) Full Text: DOI
Sun, Shu-Ming; Zhong, Ning; Ziegler, Martin Computability of the solutions to Navier-Stokes equations via effective approximation. (English) Zbl 07223178 Du, Ding-Zhu (ed.) et al., Complexity and approximation. In memory of Ker-I Ko. Cham: Springer (ISBN 978-3-030-41671-3/pbk; 978-3-030-41672-0/ebook). Lecture Notes in Computer Science 12000, 80-112 (2020). MSC: 03D78 35Q30 PDF BibTeX XML Cite \textit{S.-M. Sun} et al., Lect. Notes Comput. Sci. 12000, 80--112 (2020; Zbl 07223178) Full Text: DOI
Westrick, Linda An effective analysis of the Denjoy rank. (English) Zbl 07222690 Notre Dame J. Formal Logic 61, No. 2, 245-263 (2020). MSC: 03E15 26A39 03D45 03C57 03D25 03D30 03-02 PDF BibTeX XML Cite \textit{L. Westrick}, Notre Dame J. Formal Logic 61, No. 2, 245--263 (2020; Zbl 07222690) Full Text: DOI Euclid
Ng, Keng Meng; Yu, Hongyuan Effective domination and the bounded jump. (English) Zbl 07222687 Notre Dame J. Formal Logic 61, No. 2, 203-225 (2020). MSC: 03D30 03D28 PDF BibTeX XML Cite \textit{K. M. Ng} and \textit{H. Yu}, Notre Dame J. Formal Logic 61, No. 2, 203--225 (2020; Zbl 07222687) Full Text: DOI Euclid
Downey, Rodney G.; Ng, Keng Meng; Solomon, Reed Minimal weak truth table degrees and computably enumerable Turing degrees. (English) Zbl 07213240 Memoirs of the American Mathematical Society 1284. Providence, RI: American Mathematical Society (AMS) (ISBN 978-1-4704-4162-3/pbk; 978-1-4704-6136-2/ebook). vii, 90 p. (2020). Reviewer: Patrizio Cintioli (Camerino) MSC: 03-02 03D25 03D28 03D30 PDF BibTeX XML Cite \textit{R. G. Downey} et al., Minimal weak truth table degrees and computably enumerable Turing degrees. Providence, RI: American Mathematical Society (AMS) (2020; Zbl 07213240) Full Text: DOI
Chan, William; Chen, Ruiyuan Bounds on continuous Scott rank. (English) Zbl 07211084 Proc. Am. Math. Soc. 148, No. 8, 3591-3605 (2020). MSC: 03C57 03C75 03D60 03E15 PDF BibTeX XML Cite \textit{W. Chan} and \textit{R. Chen}, Proc. Am. Math. Soc. 148, No. 8, 3591--3605 (2020; Zbl 07211084) Full Text: DOI
Arai, Toshiyasu; Fernández-Duque, David; Wainer, Stanley; Weiermann, Andreas Predicatively unprovable termination of the Ackermannian Goodstein process. (English) Zbl 07211082 Proc. Am. Math. Soc. 148, No. 8, 3567-3582 (2020). MSC: 03F40 03D20 03D60 PDF BibTeX XML Cite \textit{T. Arai} et al., Proc. Am. Math. Soc. 148, No. 8, 3567--3582 (2020; Zbl 07211082) Full Text: DOI
Downey, Rodney; Harrison-Trainor, Matthew; Kalimullin, Iskander; Melnikov, Alexander; Turetsky, Daniel Graphs are not universal for online computability. (English) Zbl 07210414 J. Comput. Syst. Sci. 112, 1-12 (2020). MSC: 03C57 PDF BibTeX XML Cite \textit{R. Downey} et al., J. Comput. Syst. Sci. 112, 1--12 (2020; Zbl 07210414) Full Text: DOI
Andrews, Uri; Schweber, Noah; Sorbi, Andrea The theory of ceers computes true arithmetic. (English) Zbl 1442.03021 Ann. Pure Appl. Logic 171, No. 8, Article ID 102811, 22 p. (2020). Reviewer: Roman Murawski (Poznań) MSC: 03D25 03D30 03F30 PDF BibTeX XML Cite \textit{U. Andrews} et al., Ann. Pure Appl. Logic 171, No. 8, Article ID 102811, 22 p. (2020; Zbl 1442.03021) Full Text: DOI
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
Endrullis, Jörg; Klop, Jan Willem; Bakhshi, Rena Transducer degrees: atoms, infima and suprema. (English) Zbl 07203625 Acta Inf. 57, No. 3-5, 727-758 (2020). Reviewer: Andreas Maletti (Leipzig) MSC: 03D05 03D30 PDF BibTeX XML Cite \textit{J. Endrullis} et al., Acta Inf. 57, No. 3--5, 727--758 (2020; Zbl 07203625) Full Text: DOI
Chong, C. T.; Li, Wei; Wang, Wei; Yang, Yue On the strength of Ramsey’s theorem for trees. (English) Zbl 1444.03012 Adv. Math. 369, Article ID 107180, 38 p. (2020). Reviewer: Jeffry L. Hirst (Boone) MSC: 03B30 03F35 03D80 05D10 PDF BibTeX XML Cite \textit{C. T. Chong} et al., Adv. Math. 369, Article ID 107180, 38 p. (2020; Zbl 1444.03012) Full Text: DOI
Carnevale, Angela; Cavaleri, Matteo Partial word and equality problems and Banach densities. (English) Zbl 07201192 Adv. Math. 368, Article ID 107133, 15 p. (2020). MSC: 20 PDF BibTeX XML Cite \textit{A. Carnevale} and \textit{M. Cavaleri}, Adv. Math. 368, Article ID 107133, 15 p. (2020; Zbl 07201192) Full Text: DOI
Poças, Diogo; Zucker, Jeffery Tracking computability of GPAC-generable functions. (English) Zbl 07197415 Artemov, Sergei (ed.) et al., Logical foundations of computer science. International symposium, LFCS 2020, Deerfield Beach, FL, USA, January 04–07, 2020. Proceedings. Cham: Springer (ISBN 978-3-030-36754-1/pbk; 978-3-030-36755-8/ebook). Lecture Notes in Computer Science 11972, 214-235 (2020). MSC: 03B70 PDF BibTeX XML Cite \textit{D. Poças} and \textit{J. Zucker}, Lect. Notes Comput. Sci. 11972, 214--235 (2020; Zbl 07197415) Full Text: DOI
Ackerman, Nathanael L.; Freer, Cameron E.; Lubarsky, Robert S. An introduction to feedback Turing computability. (English) Zbl 07194691 J. Log. Comput. 30, No. 1, 27-60 (2020). MSC: 03 68 PDF BibTeX XML Cite \textit{N. L. Ackerman} et al., J. Log. Comput. 30, No. 1, 27--60 (2020; Zbl 07194691) Full Text: DOI
Gangloff, Silvère; Talon, Alexandre Asymptotic growth rate of square grids dominating sets: a symbolic dynamics approach. (English) Zbl 1437.05180 Theor. Comput. Sci. 821, 87-101 (2020). MSC: 05C69 37B10 PDF BibTeX XML Cite \textit{S. Gangloff} and \textit{A. Talon}, Theor. Comput. Sci. 821, 87--101 (2020; Zbl 1437.05180) Full Text: DOI
Kapron, Bruce M.; Steinberg, Florian Type-two polynomial-time and restricted lookahead. (English) Zbl 07191307 Theor. Comput. Sci. 813, 1-19 (2020). MSC: 03D65 PDF BibTeX XML Cite \textit{B. M. Kapron} and \textit{F. Steinberg}, Theor. Comput. Sci. 813, 1--19 (2020; Zbl 07191307) Full Text: DOI
Hirschfeldt, Denis R. A minimal pair in the generic degrees. (English) Zbl 1452.03094 J. Symb. Log. 85, No. 1, 531-537 (2020). Reviewer: Joseph S. Ullian (Santa Barbara) MSC: 03D30 PDF BibTeX XML Cite \textit{D. R. Hirschfeldt}, J. Symb. Log. 85, No. 1, 531--537 (2020; Zbl 1452.03094) Full Text: DOI
Duparc, Jacques; Vuilleumier, Louis The Wadge order on the Scott domain is not a well-quasi-order. (English) Zbl 07190476 J. Symb. Log. 85, No. 1, 300-324 (2020). MSC: 03B70 03D30 03E15 54H05 68Q15 PDF BibTeX XML Cite \textit{J. Duparc} and \textit{L. Vuilleumier}, J. Symb. Log. 85, No. 1, 300--324 (2020; Zbl 07190476) Full Text: DOI
Nies, André; Shafer, Paul Randomness notions and reverse mathematics. (English) Zbl 1444.03013 J. Symb. Log. 85, No. 1, 271-299 (2020). Reviewer: Jeffry L. Hirst (Boone) MSC: 03B30 03D32 03F35 68Q30 PDF BibTeX XML Cite \textit{A. Nies} and \textit{P. Shafer}, J. Symb. Log. 85, No. 1, 271--299 (2020; Zbl 1444.03013) Full Text: DOI
Goh, Jun Le Embeddings between well-orderings: computability-theoretic reductions. (English) Zbl 07189161 Ann. Pure Appl. Logic 171, No. 6, Article ID 102789, 17 p. (2020). MSC: 03B30 03D30 03D80 03F35 03D55 PDF BibTeX XML Cite \textit{J. Le Goh}, Ann. Pure Appl. Logic 171, No. 6, Article ID 102789, 17 p. (2020; Zbl 07189161) Full Text: DOI
O’Meara, Kevin C. The Gerstenhaber problem for commuting triples of matrices is “decidable”. (English) Zbl 1436.15018 Commun. Algebra 48, No. 2, 453-466 (2020). MSC: 15A27 03D80 13E10 13E15 15A21 PDF BibTeX XML Cite \textit{K. C. O'Meara}, Commun. Algebra 48, No. 2, 453--466 (2020; Zbl 1436.15018) Full Text: DOI
Bianchetti, Matteo Weaker variants of infinite time Turing machines. (English) Zbl 1455.03049 Arch. Math. Logic 59, No. 3-4, 335-365 (2020). Reviewer: Roman Murawski (Poznań) MSC: 03D10 03D60 03D78 68Q01 PDF BibTeX XML Cite \textit{M. Bianchetti}, Arch. Math. Logic 59, No. 3--4, 335--365 (2020; Zbl 1455.03049) 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
Normann, Dag; Sanders, Sam Pincherle’s theorem in reverse mathematics and computability theory. (English) Zbl 1443.03008 Ann. Pure Appl. Logic 171, No. 5, Article ID 102788, 41 p. (2020). Reviewer: Jeffry L. Hirst (Boone) MSC: 03B30 03D65 03F35 03D80 PDF BibTeX XML Cite \textit{D. Normann} and \textit{S. Sanders}, Ann. Pure Appl. Logic 171, No. 5, Article ID 102788, 41 p. (2020; Zbl 1443.03008) Full Text: DOI
Leivant, Daniel; Marion, Jean-Yves Primitive recursion in the abstract. (English) Zbl 1435.68064 Math. Struct. Comput. Sci. 30, No. 1, 33-43 (2020). MSC: 68N30 03C13 03D75 PDF BibTeX XML Cite \textit{D. Leivant} and \textit{J.-Y. Marion}, Math. Struct. Comput. Sci. 30, No. 1, 33--43 (2020; Zbl 1435.68064) Full Text: DOI
Cholak, Peter; Patey, Ludovic Thin set theorems and cone avoidance. (English) Zbl 1442.03007 Trans. Am. Math. Soc. 373, No. 4, 2743-2773 (2020). Reviewer: Jeffry L. Hirst (Boone) MSC: 03B30 03F35 03D80 05D10 PDF BibTeX XML Cite \textit{P. Cholak} and \textit{L. Patey}, Trans. Am. Math. Soc. 373, No. 4, 2743--2773 (2020; Zbl 1442.03007) Full Text: DOI
Boche, Holger; Pohl, Volker Investigations on the approximability and computability of the Hilbert transform with applications. (English) Zbl 1452.44005 Appl. Comput. Harmon. Anal. 48, No. 2, 706-730 (2020). MSC: 44A15 41A65 46E99 65R10 PDF BibTeX XML Cite \textit{H. Boche} and \textit{V. Pohl}, Appl. Comput. Harmon. Anal. 48, No. 2, 706--730 (2020; Zbl 1452.44005) Full Text: DOI
Jeandel, Emmanuel; Moutot, Etienne; Vanier, Pascal Slopes of multidimensional subshifts. (English) Zbl 1440.37025 Theory Comput. Syst. 64, No. 1, 35-61 (2020). MSC: 37B51 37B10 PDF BibTeX XML Cite \textit{E. Jeandel} et al., Theory Comput. Syst. 64, No. 1, 35--61 (2020; Zbl 1440.37025) Full Text: DOI
Primiero, Giuseppe On the foundations of computing. (English) Zbl 1450.68001 Oxford: Oxford University Press (ISBN 978-0-19-883564-6/hbk; 978-0-19-883565-3/pbk). xix, 296 p. (2020). Reviewer: Gudula Rünger (Chemnitz) MSC: 68-02 68-03 68Q01 PDF BibTeX XML Cite \textit{G. Primiero}, On the foundations of computing. Oxford: Oxford University Press (2020; Zbl 1450.68001)
Georgiev, Ivan On subrecursive complexity of integration. (English) Zbl 07160779 Ann. Pure Appl. Logic 171, No. 4, Article ID 102777, 23 p. (2020). MSC: 03F60 03D78 03D15 03D20 PDF BibTeX XML Cite \textit{I. Georgiev}, Ann. Pure Appl. Logic 171, No. 4, Article ID 102777, 23 p. (2020; Zbl 07160779) Full Text: DOI
Villegas Silva, Luis Miguel A \(\kappa\)-rough morass under \(2^{{<}\kappa}=\kappa\) and various applications. (English) Zbl 07146427 Fundam. Math. 248, No. 2, 111-133 (2020). Reviewer: J. M. Plotkin (East Lansing) MSC: 03C30 03E30 03E35 03E45 03E55 03E75 03C55 03D60 03E65 PDF BibTeX XML Cite \textit{L. M. Villegas Silva}, Fundam. Math. 248, No. 2, 111--133 (2020; Zbl 07146427) Full Text: DOI
Cruz-Filipe, Luís; Montesi, Fabrizio A core model for choreographic programming. (English) Zbl 1436.68078 Theor. Comput. Sci. 802, 38-66 (2020). MSC: 68N19 68Q85 PDF BibTeX XML Cite \textit{L. Cruz-Filipe} and \textit{F. Montesi}, Theor. Comput. Sci. 802, 38--66 (2020; Zbl 1436.68078) Full Text: DOI
Aghazadeh, Zahra; Imbs, Damien; Raynal, Michel; Taubenfeld, Gadi; Woelfel, Philipp Optimal memory-anonymous symmetric deadlock-free mutual exclusion. (English) Zbl 07298670 Nowak, Thomas (ed.), Proceedings of the 38th ACM symposium on principles of distributed computing, PODC ’19, Toronto, ON, Canada, July 29 – August 2, 2019. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-6217-7). 157-166 (2019). MSC: 68M14 68W15 PDF BibTeX XML Cite \textit{Z. Aghazadeh} et al., in: Proceedings of the 38th ACM symposium on principles of distributed computing, PODC '19, Toronto, ON, Canada, July 29 -- August 2, 2019. New York, NY: Association for Computing Machinery (ACM). 157--166 (2019; Zbl 07298670) Full Text: DOI
Japaridze, Giorgi Computability logic: giving Caesar what belongs to Caesar. (English) Zbl 1446.03065 Log. Issled. 25, No. 1, 100-119 (2019). MSC: 03B70 03B20 03B47 03F50 PDF BibTeX XML Cite \textit{G. Japaridze}, Log. Issled. 25, No. 1, 100--119 (2019; Zbl 1446.03065) Full Text: DOI
Heikkila, Seppo Consistent theories of truth for languages which conform to classical logic. (English) Zbl 07222349 Nonlinear Stud. 26, No. 4, 843-859 (2019). MSC: 03B10 03B65 03D80 91F20 97M80 PDF BibTeX XML Cite \textit{S. Heikkila}, Nonlinear Stud. 26, No. 4, 843--859 (2019; Zbl 07222349) Full Text: Link
Wang, Benyou; di Buccio, Emanuele; Melucci, Massimo Representing words in vector space and beyond. (English) Zbl 1434.81016 Aerts, Diederik (ed.) et al., Quantum-like models for information retrieval and decision-making. Cham: Springer. STEAM-H, Sci. Technol. Eng. Agric. Math. Health, 83-113 (2019). MSC: 81P45 03D40 68P20 PDF BibTeX XML Cite \textit{B. Wang} et al., in: Quantum-like models for information retrieval and decision-making. Cham: Springer. 83--113 (2019; Zbl 1434.81016) Full Text: DOI
Wrocławski, Michał Representations of natural numbers and computability of various functions. (English) Zbl 1434.03115 Manea, Florin (ed.) et al., Computing with foresight and industry. 15th conference on computability in Europe, CiE 2019, Durham, UK, July 15–19, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11558, 298-309 (2019). MSC: 03D75 PDF BibTeX XML Cite \textit{M. Wrocławski}, Lect. Notes Comput. Sci. 11558, 298--309 (2019; Zbl 1434.03115) Full Text: DOI
Wang, Shaoyi; Wu, Guohua; Yamaleev, Mars M. The d.r.e \(wtt\)-degrees are dense. (English) Zbl 1434.03107 Manea, Florin (ed.) et al., Computing with foresight and industry. 15th conference on computability in Europe, CiE 2019, Durham, UK, July 15–19, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11558, 277-285 (2019). MSC: 03D30 PDF BibTeX XML Cite \textit{S. Wang} et al., Lect. Notes Comput. Sci. 11558, 277--285 (2019; Zbl 1434.03107) Full Text: DOI
Kalimullin, Iskander; Miller, Russell; Schoutens, Hans Degree spectra for transcendence in fields. (English) Zbl 1434.03096 Manea, Florin (ed.) et al., Computing with foresight and industry. 15th conference on computability in Europe, CiE 2019, Durham, UK, July 15–19, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11558, 205-216 (2019). MSC: 03C57 PDF BibTeX XML Cite \textit{I. Kalimullin} et al., Lect. Notes Comput. Sci. 11558, 205--216 (2019; Zbl 1434.03096) Full Text: DOI
Durand, Bruno; Lafitte, Grégory An algorithmic approach to characterizations of admissibles. (English) Zbl 1434.03112 Manea, Florin (ed.) et al., Computing with foresight and industry. 15th conference on computability in Europe, CiE 2019, Durham, UK, July 15–19, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11558, 181-192 (2019). MSC: 03D60 PDF BibTeX XML Cite \textit{B. Durand} and \textit{G. Lafitte}, Lect. Notes Comput. Sci. 11558, 181--192 (2019; Zbl 1434.03112) Full Text: DOI
Kihara, Takayuki On a metric generalization of the \(tt\)-degrees and effective dimension theory. (English) Zbl 1455.03055 J. Symb. Log. 84, No. 2, 726-749 (2019). Reviewer: Jordan Mitchell Barrett (Wellington) MSC: 03D30 03C62 03D78 54H05 PDF BibTeX XML Cite \textit{T. Kihara}, J. Symb. Log. 84, No. 2, 726--749 (2019; Zbl 1455.03055) Full Text: DOI
Merkle, Wolfgang; Yu, Liang Being low along a sequence and elsewhere. (English) Zbl 1443.03023 J. Symb. Log. 84, No. 2, 497-516 (2019). Reviewer: Leon Harkleroad (Bowdoinham) MSC: 03D32 68Q30 03D30 03D28 PDF BibTeX XML Cite \textit{W. Merkle} and \textit{L. Yu}, J. Symb. Log. 84, No. 2, 497--516 (2019; Zbl 1443.03023) Full Text: DOI
Japaridze, Giorgi Arithmetics base on computability logic. (English) Zbl 1446.03101 Log. Issled. 25, No. 2, 61-74 (2019). MSC: 03F30 03B70 03F50 PDF BibTeX XML Cite \textit{G. Japaridze}, Log. Issled. 25, No. 2, 61--74 (2019; Zbl 1446.03101) Full Text: DOI
Downey, R.; Melnikov, A. G. On realization of index sets in \(\Pi_1^0\)-classes. (English. Russian original) Zbl 1444.03134 Algebra Logic 58, No. 5, 441-443 (2019); translation from Algebra Logika 58, No. 5, 659-663 (2019). Reviewer: Andrei S. Morozov (Novosibirsk) MSC: 03D25 03D30 PDF BibTeX XML Cite \textit{R. Downey} and \textit{A. G. Melnikov}, Algebra Logic 58, No. 5, 441--443 (2019; Zbl 1444.03134); translation from Algebra Logika 58, No. 5, 659--663 (2019) Full Text: DOI
Dorzhieva, M. V. Computable numberings of families of infinite sets. (English. Russian original) Zbl 1455.03053 Algebra Logic 58, No. 3, 224-231 (2019); translation from Algebra Logika 58, No. 3, 334-343 (2019). Reviewer: Joseph S. Ullian (Santa Barbara) MSC: 03D25 03D45 PDF BibTeX XML Cite \textit{M. V. Dorzhieva}, Algebra Logic 58, No. 3, 224--231 (2019; Zbl 1455.03053); translation from Algebra Logika 58, No. 3, 334--343 (2019) Full Text: DOI
Bazhenov, N. A.; Kalmurzaev, B. S. Weakly precomplete equivalence relations in the Ershov hierarchy. (English. Russian original) Zbl 07175618 Algebra Logic 58, No. 3, 199-213 (2019); translation from Algebra Logika 58, No. 3, 297-319 (2019). MSC: 03D45 03D55 03D25 PDF BibTeX XML Cite \textit{N. A. Bazhenov} and \textit{B. S. Kalmurzaev}, Algebra Logic 58, No. 3, 199--213 (2019; Zbl 07175618); translation from Algebra Logika 58, No. 3, 297--319 (2019) Full Text: DOI
Camerlo, Riccardo Continuous reducibility: functions versus relations. (English) Zbl 07161695 Rep. Math. Logic 54, 45-63 (2019). MSC: 03E15 03D55 PDF BibTeX XML Cite \textit{R. Camerlo}, Rep. Math. Logic 54, 45--63 (2019; Zbl 07161695) Full Text: DOI
Ketema, Jeroen; Simonsen, Jakob Grue Computing with infinite terms and infinite reductions. (English) Zbl 1436.68156 Fundam. Inform. 170, No. 4, 339-365 (2019). MSC: 68Q42 PDF BibTeX XML Cite \textit{J. Ketema} and \textit{J. G. Simonsen}, Fundam. Inform. 170, No. 4, 339--365 (2019; Zbl 1436.68156) Full Text: DOI
Ongay-Valverde, Iván; Schweber, Noah Effective localization number: Building \(k\)-surviving degrees. (English) Zbl 07153162 Computability 8, No. 3-4, 389-398 (2019). MSC: 03D30 03D28 03E17 03E40 PDF BibTeX XML Cite \textit{I. Ongay-Valverde} and \textit{N. Schweber}, Computability 8, No. 3--4, 389--398 (2019; Zbl 07153162) Full Text: DOI arXiv
Greenberg, Noam; Kuyper, Rutger; Turetsky, Dan Cardinal invariants, non-lowness classes, and Weihrauch reducibility. (English) Zbl 07153158 Computability 8, No. 3-4, 305-346 (2019). MSC: 03D30 03D28 03E17 03E35 PDF BibTeX XML Cite \textit{N. Greenberg} et al., Computability 8, No. 3--4, 305--346 (2019; Zbl 07153158) Full Text: DOI
Fokina, Ekaterina; Rossegger, Dino; San Mauro, Luca Measuring the complexity of reductions between equivalence relations. (English) Zbl 1454.03056 Computability 8, No. 3-4, 265-280 (2019). Reviewer: Jamalbek Tussupov (Astana) MSC: 03D45 03D30 03D28 PDF BibTeX XML Cite \textit{E. Fokina} et al., Computability 8, No. 3--4, 265--280 (2019; Zbl 1454.03056) Full Text: DOI arXiv
Brattka, Vasco (ed.); Downey, Rod (ed.); Knight, Julia F. (ed.); Lempp, Steffen (ed.) Preface of the special issue for the Oberwolfach Workshop on Computability Theory 2018. (English) Zbl 07153152 Computability 8, No. 3-4, 191 (2019). MSC: 00B25 03-06 03Dxx PDF BibTeX XML Cite \textit{V. Brattka} (ed.) et al., Computability 8, No. 3--4, 191 (2019; Zbl 07153152) Full Text: DOI
Astor, Eric P.; Hirschfeldt, Denis R.; Jockusch, Carl G. jun. Dense computability, upper cones, and minimal pairs. (English) Zbl 1454.03052 Computability 8, No. 2, 155-177 (2019). Reviewer: Leon Harkleroad (Bowdoinham) MSC: 03D30 03D25 03D28 PDF BibTeX XML Cite \textit{E. P. Astor} et al., Computability 8, No. 2, 155--177 (2019; Zbl 1454.03052) Full Text: DOI
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
Miller, Russell Isomorphism and classification for countable structures. (English) Zbl 1453.03032 Computability 8, No. 2, 99-117 (2019). Reviewer: Andrei S. Morozov (Novosibirsk) MSC: 03C57 03D45 03C35 PDF BibTeX XML Cite \textit{R. Miller}, Computability 8, No. 2, 99--117 (2019; Zbl 1453.03032) Full Text: DOI arXiv
Balbiani, Philippe Unification in modal logic. (English) Zbl 07150803 Khan, Md. Aquil (ed.) et al., Logic and its applications. 8th Indian conference, ICLA 2019, Delhi, India, March 1–5, 2019. Proceedings. Berlin: Springer (ISBN 978-3-662-58770-6/pbk; 978-3-662-58771-3/ebook). Lecture Notes in Computer Science 11600, 1-5 (2019). MSC: 03Bxx 68T27 PDF BibTeX XML Cite \textit{P. Balbiani}, Lect. Notes Comput. Sci. 11600, 1--5 (2019; Zbl 07150803) Full Text: DOI
Raynal, Michel An informal visit to the wonderful land of consensus numbers and beyond. (English) Zbl 1428.68081 Bull. Eur. Assoc. Theor. Comput. Sci. EATCS 129, 25 p. (2019). MSC: 68M14 PDF BibTeX XML Cite \textit{M. Raynal}, Bull. Eur. Assoc. Theor. Comput. Sci. EATCS 129, 25 p. (2019; Zbl 1428.68081) Full Text: Link
Monin, Benoît; d’Auriac, Paul-Elliot Anglès Genericity and randomness with ITTMs. (English) Zbl 1451.03025 J. Symb. Log. 84, No. 4, 1670-1710 (2019). Reviewer: Liang Yu (Nanjing) MSC: 03D60 03D32 PDF BibTeX XML Cite \textit{B. Monin} and \textit{P.-E. A. d'Auriac}, J. Symb. Log. 84, No. 4, 1670--1710 (2019; Zbl 1451.03025) Full Text: DOI
Bazhenov, Nikolay; Harrison-Trainor, Matthew; Kalimullin, Iskander; Melkinov, Alexander; Ng, Keng Meng Automatic and polynomial-time algebraic structures. (English) Zbl 1454.03042 J. Symb. Log. 84, No. 4, 1630-1669 (2019). Reviewer: Jamalbek Tussupov (Astana) MSC: 03C57 03D05 03D20 03D45 03D80 68Q45 PDF BibTeX XML Cite \textit{N. Bazhenov} et al., J. Symb. Log. 84, No. 4, 1630--1669 (2019; Zbl 1454.03042) Full Text: DOI
Lubarsky, Robert S. Separating the Fan theorem and its weakenings II. (English) Zbl 07149976 J. Symb. Log. 84, No. 4, 1484-1509 (2019). MSC: 03C90 03E70 03F50 03F60 03D80 PDF BibTeX XML Cite \textit{R. S. Lubarsky}, J. Symb. Log. 84, No. 4, 1484--1509 (2019; Zbl 07149976) Full Text: DOI