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 03D25 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
Yamaleev, M. M. Isolation from side in 2-computably enumerable degrees. (English. Russian original) Zbl 07309119 Russ. Math. 64, No. 8, 70-73 (2020); translation from Izv. Vyssh. Uchebn. Zaved., Mat. 2020, No. 8, 81-86 (2020). MSC: 03D25 03D28 PDF BibTeX XML Cite \textit{M. M. Yamaleev}, Russ. Math. 64, No. 8, 70--73 (2020; Zbl 07309119); translation from Izv. Vyssh. Uchebn. Zaved., Mat. 2020, No. 8, 81--86 (2020) Full Text: DOI
Zimmermann, Karl-Heinz Computability. Models of computation and undecidability. (Berechenbarkeit. Berechnungsmodelle und Unentscheidbarkeit.) (German) Zbl 1452.68002 Essentials. Wiesbaden: Springer Spektrum (ISBN 978-3-658-31738-6/pbk; 978-3-658-31739-3/ebook). xiii, 67 p. (2020). MSC: 68-01 03-01 03D03 03D10 03D20 03D35 68N30 68Q04 PDF BibTeX XML Cite \textit{K.-H. Zimmermann}, Berechenbarkeit. Berechnungsmodelle und Unentscheidbarkeit. Wiesbaden: Springer Spektrum (2020; Zbl 1452.68002) Full Text: DOI
Robič, Borut The foundations of computability theory. 2nd completely revised edition. (English) Zbl 07282914 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 07282914) Full Text: DOI
Bazhenov, N. A.; Kalimullin, I. Sh.; Yamaleev, M. M. Strong degrees of categoricity and weak density. (English) Zbl 07272819 Lobachevskii J. Math. 41, No. 9, 1630-1639 (2020). MSC: 03 68 PDF BibTeX XML Cite \textit{N. A. Bazhenov} et al., Lobachevskii J. Math. 41, No. 9, 1630--1639 (2020; Zbl 07272819) 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
Olshanskii, A. Yu. Groups finitely presented in Burnside varieties. (English) Zbl 07239026 J. Algebra 560, 960-1052 (2020). Reviewer: Egle Bettio (Venezia) MSC: 20F05 20F06 20F10 20F50 20F65 20E06 20E10 03D10 03D25 PDF BibTeX XML Cite \textit{A. Yu. Olshanskii}, J. Algebra 560, 960--1052 (2020; Zbl 07239026) Full Text: DOI
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 03D28 03D30 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
Terwijn, Sebastiaan A. The noneffectivity of Arslanov’s completeness criterion and related theorems. (English) Zbl 07222139 Arch. Math. Logic 59, No. 5-6, 703-713 (2020). MSC: 03D25 03D28 03B40 PDF BibTeX XML Cite \textit{S. A. Terwijn}, Arch. Math. Logic 59, No. 5--6, 703--713 (2020; Zbl 07222139) Full Text: DOI
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). 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
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
Higuchi, Kojiro; Lempp, Steffen; Raghavan, Dilip; Stephan, Frank On the order dimension of locally countable partial orderings. (English) Zbl 07204743 Proc. Am. Math. Soc. 148, No. 7, 2823-2833 (2020). MSC: 06A06 03E04 03D28 PDF BibTeX XML Cite \textit{K. Higuchi} et al., Proc. Am. Math. Soc. 148, No. 7, 2823--2833 (2020; Zbl 07204743) Full Text: DOI
Moyen, Jean-Yves; Simonsen, Jakob Grue More intensional versions of Rice’s theorem. (English) Zbl 1434.03110 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, 217-229 (2019). MSC: 03D35 03D15 03D20 68Q04 68Q25 PDF BibTeX XML Cite \textit{J.-Y. Moyen} and \textit{J. G. Simonsen}, Lect. Notes Comput. Sci. 11558, 217--229 (2019; Zbl 1434.03110) 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
Ng, Keng Meng; Yu, Hongyuan On the degree structure of equivalence relations under computable reducibility. (English) Zbl 07167766 Notre Dame J. Formal Logic 60, No. 4, 733-761 (2019). MSC: 03D28 03D45 PDF BibTeX XML Cite \textit{K. M. Ng} and \textit{H. Yu}, Notre Dame J. Formal Logic 60, No. 4, 733--761 (2019; Zbl 07167766) Full Text: DOI Euclid
Franklin, Johanna N. Y.; Turetsky, Dan Taking the path computably traveled. (English) Zbl 1444.03139 J. Log. Comput. 29, No. 6, 969-973 (2019). MSC: 03D45 03D25 03D28 03C57 PDF BibTeX XML Cite \textit{J. N. Y. Franklin} and \textit{D. Turetsky}, J. Log. Comput. 29, No. 6, 969--973 (2019; Zbl 1444.03139) 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 07153156 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 07153156) Full Text: DOI arXiv
Astor, Eric P.; Hirschfeldt, Denis R.; Jockusch, Carl G. jun. Dense computability, upper cones, and minimal pairs. (English) Zbl 07153150 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 07153150) Full Text: DOI
Downey, Rodney G.; Nandakumar, Satyadev A weakly 2-generic which bounds a minimal degree. (English) Zbl 1444.03135 J. Symb. Log. 84, No. 4, 1326-1347 (2019). Reviewer: Roman Murawski (Poznań) MSC: 03D30 03D25 03D28 PDF BibTeX XML Cite \textit{R. G. Downey} and \textit{S. Nandakumar}, J. Symb. Log. 84, No. 4, 1326--1347 (2019; Zbl 1444.03135) Full Text: DOI
Semukhin, P. M.; Turetsky, D.; Fokina, E. B. Degree spectra of structures relative to equivalences. (English. Russian original) Zbl 07140979 Algebra Logic 58, No. 2, 158-172 (2019); translation from Algebra Logika 58, No. 2, 229-251 (2019). MSC: 03D28 03D30 03D45 PDF BibTeX XML Cite \textit{P. M. Semukhin} et al., Algebra Logic 58, No. 2, 158--172 (2019; Zbl 07140979); translation from Algebra Logika 58, No. 2, 229--251 (2019) Full Text: DOI
Sørensen, Morten Heine Book review of: R. Smullyan, A beginner’s further guide to mathematical logic. (English) Zbl 1436.00030 Stud. Log. 107, No. 5, 1079-1081 (2019). MSC: 00A17 03-01 03B05 03B10 03D20 03B40 03D10 03D25 PDF BibTeX XML Cite \textit{M. H. Sørensen}, Stud. Log. 107, No. 5, 1079--1081 (2019; Zbl 1436.00030) Full Text: DOI
Ganchev, Hristo; Sariev, Andrey C. Definability in the local structure of the \(\omega\)-Turing degrees. (English) Zbl 1446.03074 Math. Struct. Comput. Sci. 29, No. 7, 927-937 (2019). Reviewer: Patrizio Cintioli (Camerino) MSC: 03D30 PDF BibTeX XML Cite \textit{H. Ganchev} and \textit{A. C. Sariev}, Math. Struct. Comput. Sci. 29, No. 7, 927--937 (2019; Zbl 1446.03074) Full Text: DOI
Liu, Yong Isolated maximal d.r.e. degrees. (English) Zbl 07011464 Ann. Pure Appl. Logic 170, No. 4, 515-538 (2019). MSC: 03D25 03D28 PDF BibTeX XML Cite \textit{Y. Liu}, Ann. Pure Appl. Logic 170, No. 4, 515--538 (2019; Zbl 07011464) Full Text: DOI
Monin, Benoit An answer to the gamma question. (English) Zbl 07298798 Proceedings of the 2018 33rd annual ACM/IEEE symposium on logic in computer science, LICS 2018, Oxford, UK, July 9–12, 2018. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-5583-4). 730-738 (2018). MSC: 03D32 03D28 PDF BibTeX XML Cite \textit{B. Monin}, in: Proceedings of the 2018 33rd annual ACM/IEEE symposium on logic in computer science, LICS 2018, Oxford, UK, July 9--12, 2018. New York, NY: Association for Computing Machinery (ACM). 730--738 (2018; Zbl 07298798) Full Text: DOI
Bienvenu, Laurent; Downey, Rodney On low for speed oracles. (English) Zbl 07228406 Niedermeier, Rolf (ed.) et al., 35th symposium on theoretical aspects of computer science, STACS 2018, Caen, France, February 28 – March 3, 2018. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-062-0). LIPIcs – Leibniz International Proceedings in Informatics 96, Article 15, 13 p. (2018). MSC: 68Qxx PDF BibTeX XML Cite \textit{L. Bienvenu} and \textit{R. Downey}, LIPIcs -- Leibniz Int. Proc. Inform. 96, Article 15, 13 p. (2018; Zbl 07228406) Full Text: DOI
Morozov, Andrey; Schupp, Paul Computable permutations and word problems. (English) Zbl 07087303 Enseign. Math. (2) 64, No. 1-2, 143-160 (2018). MSC: 20F36 03D35 PDF BibTeX XML Cite \textit{A. Morozov} and \textit{P. Schupp}, Enseign. Math. (2) 64, No. 1--2, 143--160 (2018; Zbl 07087303) 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
Harrison-Trainor, Matthew Degree spectra of relations on a cone. (English) Zbl 1435.03005 Memoirs of the American Mathematical Society 1208. Providence, RI: American Mathematical Society (AMS) (ISBN 978-1-4704-2839-6/print; 978-1-4704-4411-2/ebook). vi, 112 p. (2018). MSC: 03-02 03D45 03C57 PDF BibTeX XML Cite \textit{M. Harrison-Trainor}, Degree spectra of relations on a cone. Providence, RI: American Mathematical Society (AMS) (2018; Zbl 1435.03005) Full Text: DOI arXiv
Terwijn, Sebastiaan A. Generalizations of the recursion theorem. (English) Zbl 06997562 J. Symb. Log. 83, No. 4, 1683-1690 (2018). MSC: 03D25 03D28 03B40 PDF BibTeX XML Cite \textit{S. A. Terwijn}, J. Symb. Log. 83, No. 4, 1683--1690 (2018; Zbl 06997562) Full Text: DOI
Wang, Wei Relative definability of \(n\)-generics. (English) Zbl 06997542 J. Symb. Log. 83, No. 4, 1345-1362 (2018). MSC: 03D28 03D25 PDF BibTeX XML Cite \textit{W. Wang}, J. Symb. Log. 83, No. 4, 1345--1362 (2018; Zbl 06997542) Full Text: DOI arXiv
Badillo, Liliana; Harris, Charles M.; Soskova, Mariya I. Enumeration 1-genericity in the local enumeration degrees. (English) Zbl 06996539 Notre Dame J. Formal Logic 59, No. 4, 461-489 (2018). MSC: 03D30 03D28 PDF BibTeX XML Cite \textit{L. Badillo} et al., Notre Dame J. Formal Logic 59, No. 4, 461--489 (2018; Zbl 06996539) Full Text: DOI Euclid
Case, Adam Bounded Turing reductions and data processing inequalities for sequences. (English) Zbl 1408.68083 Theory Comput. Syst. 62, No. 7, 1586-1598 (2018). Reviewer: Liang Yu (Nanjing) MSC: 68Q30 03D30 03D32 PDF BibTeX XML Cite \textit{A. Case}, Theory Comput. Syst. 62, No. 7, 1586--1598 (2018; Zbl 1408.68083) Full Text: DOI
Arslanov, M. M.; Yamaleev, M. M. On the problem of definability of the computably enumerable degrees in the difference hierarchy. (English) Zbl 06945060 Lobachevskii J. Math. 39, No. 5, 634-638 (2018). MSC: 03 68 PDF BibTeX XML Cite \textit{M. M. Arslanov} and \textit{M. M. Yamaleev}, Lobachevskii J. Math. 39, No. 5, 634--638 (2018; Zbl 06945060) 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
Lewis-Pye, Andrew E. M. The search for natural definability in the Turing degrees. (English) Zbl 1435.03070 Computability 7, No. 2-3, 189-235 (2018). MSC: 03D28 03D25 PDF BibTeX XML Cite \textit{A. E. M. Lewis-Pye}, Computability 7, No. 2--3, 189--235 (2018; Zbl 1435.03070) Full Text: DOI
Ganchev, Hristo A.; Soskova, Mariya I. The jump hierarchy in the enumeration degrees. (English) Zbl 1435.03069 Computability 7, No. 2-3, 179-188 (2018). MSC: 03D28 03D55 03D30 PDF BibTeX XML Cite \textit{H. A. Ganchev} and \textit{M. I. Soskova}, Computability 7, No. 2--3, 179--188 (2018; Zbl 1435.03069) Full Text: DOI
Cooper, S. Barry; Li, Angsheng; Xia, Mingji Splitting and jump inversion in the Turing degrees. (English) Zbl 1435.03066 Computability 7, No. 2-3, 133-142 (2018). MSC: 03D25 03D28 PDF BibTeX XML Cite \textit{S. B. Cooper} et al., Computability 7, No. 2--3, 133--142 (2018; Zbl 1435.03066) Full Text: DOI
Greenberg, Noam; Turetsky, Dan Strong jump-traceability. (English) Zbl 06916705 Bull. Symb. Log. 24, No. 2, 147-164 (2018). MSC: 03D25 03D28 03D32 PDF BibTeX XML Cite \textit{N. Greenberg} and \textit{D. Turetsky}, Bull. Symb. Log. 24, No. 2, 147--164 (2018; Zbl 06916705) Full Text: DOI
Bournez, Olivier; Kurganskyy, Oleksiy; Potapov, Igor Reachability problems for one-dimensional piecewise affine maps. (English) Zbl 1394.37009 Int. J. Found. Comput. Sci. 29, No. 4, 529-549 (2018). MSC: 37A45 03B25 03D35 68Q05 11E95 PDF BibTeX XML Cite \textit{O. Bournez} et al., Int. J. Found. Comput. Sci. 29, No. 4, 529--549 (2018; Zbl 1394.37009) Full Text: DOI
Cowen, Robert Book review of: R. M. Smullyan, A beginner’s guide to mathematical logic; A beginner’s further guide to mathematical logic. (English) Zbl 1392.00020 Am. Math. Mon. 125, No. 2, 188-192 (2018). MSC: 00A17 03-01 03B05 03B10 03D20 03B40 03D10 03D25 PDF BibTeX XML Cite \textit{R. Cowen}, Am. Math. Mon. 125, No. 2, 188--192 (2018; Zbl 1392.00020) Full Text: DOI
Downey, Rodney G.; Wu, Guohua; Yang, Yue Degrees containing members of thin \(\Pi_1^0\) classes are dense and co-dense. (English) Zbl 06887311 J. Math. Log. 18, No. 1, Article ID 1850001, 47 p. (2018). MSC: 03D25 03D80 PDF BibTeX XML Cite \textit{R. G. Downey} et al., J. Math. Log. 18, No. 1, Article ID 1850001, 47 p. (2018; Zbl 06887311) Full Text: DOI
Kalimullin, I. Sh. Computable embeddings of classes of structures under enumeration and Turing operators. (English) Zbl 06856877 Lobachevskii J. Math. 39, No. 1, 84-88 (2018). MSC: 03 05 PDF BibTeX XML Cite \textit{I. Sh. Kalimullin}, Lobachevskii J. Math. 39, No. 1, 84--88 (2018; Zbl 06856877) Full Text: DOI
Franklin, Johanna N. Y.; Turetsky, Dan Lowness for isomorphism and degrees of genericity. (English) Zbl 1435.03068 Computability 7, No. 1, 1-6 (2018). MSC: 03D28 03D25 03D45 PDF BibTeX XML Cite \textit{J. N. Y. Franklin} and \textit{D. Turetsky}, Computability 7, No. 1, 1--6 (2018; Zbl 1435.03068) Full Text: DOI
Belanger, David R.; Shore, Richard A. On the jumps of the degrees below a recursively enumerable degree. (English) Zbl 06848193 Notre Dame J. Formal Logic 59, No. 1, 91-107 (2018). MSC: 03D25 03D28 PDF BibTeX XML Cite \textit{D. R. Belanger} and \textit{R. A. Shore}, Notre Dame J. Formal Logic 59, No. 1, 91--107 (2018; Zbl 06848193) Full Text: DOI Euclid
Slaman, Theodore A.; Soskova, Mariya I. The \(\Delta ^0_2\) Turing degrees: automorphisms and definability. (English) Zbl 1445.03047 Trans. Am. Math. Soc. 370, No. 2, 1351-1375 (2018). Reviewer: Leon Harkleroad (Bowdoinham) MSC: 03D28 03D25 PDF BibTeX XML Cite \textit{T. A. Slaman} and \textit{M. I. Soskova}, Trans. Am. Math. Soc. 370, No. 2, 1351--1375 (2018; Zbl 1445.03047) Full Text: DOI
Sieg, Wilfried A brief note on Gödel, Nagel, minds, and machines. (English) Zbl 1429.03047 Jäger, Gerhard (ed.) et al., Feferman on foundations. Logic, mathematics, philosophy. Cham: Springer. Outst. Contrib. Log. 13, 487-490 (2017). MSC: 03A05 03F40 03D10 03D35 PDF BibTeX XML Cite \textit{W. Sieg}, Outst. Contrib. Log. 13, 487--490 (2017; Zbl 1429.03047) Full Text: DOI
Feferman, Solomon Gödel, Nagel, minds, and machines. (English) Zbl 1429.03024 Jäger, Gerhard (ed.) et al., Feferman on foundations. Logic, mathematics, philosophy. Cham: Springer. Outst. Contrib. Log. 13, 469-485 (2017). MSC: 03A05 03F40 03D10 03D35 PDF BibTeX XML Cite \textit{S. Feferman}, Outst. Contrib. Log. 13, 469--485 (2017; Zbl 1429.03024) Full Text: DOI
Brattka, Vasco; Hölzl, Rupert; Kuyper, Rutger Monte Carlo computability. (English) Zbl 1402.03068 Vollmer, Heribert (ed.) et al., 34th symposium on theoretical aspects of computer science (STACS 2017), Hannover, Germany, March 8–11, 2017. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-028-6). LIPIcs – Leibniz International Proceedings in Informatics 66, Article 17, 14 p. (2017). MSC: 03D78 03D10 03D32 68P10 68Q15 PDF BibTeX XML Cite \textit{V. Brattka} et al., LIPIcs -- Leibniz Int. Proc. Inform. 66, Article 17, 14 p. (2017; Zbl 1402.03068) Full Text: DOI
Faizrakhmanov, M. Kh. Universal generalized computable numberings and hyperimmunity. (English. Russian original) Zbl 1420.03092 Algebra Logic 56, No. 4, 337-347 (2017); translation from Algebra Logika 56, No. 4, 506-521 (2017). MSC: 03D25 03D28 PDF BibTeX XML Cite \textit{M. Kh. Faizrakhmanov}, Algebra Logic 56, No. 4, 337--347 (2017; Zbl 1420.03092); translation from Algebra Logika 56, No. 4, 506--521 (2017) Full Text: DOI
Brattka, Vasco; Hendtlass, Matthew; Kreuzer, Alexander P. On the uniform computational content of computability theory. (English) Zbl 1420.03110 Theory Comput. Syst. 61, No. 4, 1376-1426 (2017). MSC: 03D78 03D25 03D28 03D32 03F30 PDF BibTeX XML Cite \textit{V. Brattka} et al., Theory Comput. Syst. 61, No. 4, 1376--1426 (2017; Zbl 1420.03110) Full Text: DOI
Niskanen, Reino Reachability problem for polynomial iteration is PSPACE-complete. (English) Zbl 06820349 Hague, Matthew (ed.) et al., Reachability problems. 11th international workshop, RP 2017, London, UK, September 7–9, 2017. Proceedings. Cham: Springer (ISBN 978-3-319-67088-1/pbk; 978-3-319-67089-8/ebook). Lecture Notes in Computer Science 10506, 132-143 (2017). MSC: 68Q05 03D35 68Q25 68Q45 PDF BibTeX XML Cite \textit{R. Niskanen}, Lect. Notes Comput. Sci. 10506, 132--143 (2017; Zbl 06820349) Full Text: DOI
Gaßner, Christine Computation over algebraic structures and a classification of undecidable problems. (English) Zbl 1423.03139 Math. Struct. Comput. Sci. 27, No. 8, 1386-1413 (2017). MSC: 03D10 03D35 68Q05 PDF BibTeX XML Cite \textit{C. Gaßner}, Math. Struct. Comput. Sci. 27, No. 8, 1386--1413 (2017; Zbl 1423.03139) Full Text: DOI
Khan, Mushfeq; Miller, Joseph S. Forcing with bushy trees. (English) Zbl 1421.03021 Bull. Symb. Log. 23, No. 2, 160-180 (2017). MSC: 03D32 03D28 03D55 PDF BibTeX XML Cite \textit{M. Khan} and \textit{J. S. Miller}, Bull. Symb. Log. 23, No. 2, 160--180 (2017; Zbl 1421.03021) Full Text: DOI arXiv
Losert, Nadine Where join preservation fails in the bounded Turing degrees of c.e. sets. (English) Zbl 1391.03030 Inf. Comput. 256, 185-195 (2017). Reviewer: Patrizio Cintioli (Camerino) MSC: 03D25 03D28 03D30 PDF BibTeX XML Cite \textit{N. Losert}, Inf. Comput. 256, 185--195 (2017; Zbl 1391.03030) Full Text: DOI
Cholak, Peter; Igusa, Gregory Density-1-bounding and quasiminimality in the generic degrees. (English) Zbl 1406.03056 J. Symb. Log. 82, No. 3, 931-957 (2017). Reviewer: Leon Harkleroad (Bowdoinham) MSC: 03D30 03D25 03D28 03D32 PDF BibTeX XML Cite \textit{P. Cholak} and \textit{G. Igusa}, J. Symb. Log. 82, No. 3, 931--957 (2017; Zbl 1406.03056) Full Text: DOI arXiv
Anderson, Bernard A.; Csima, Barbara F.; Lange, Karen M. Bounded low and high sets. (English) Zbl 1417.03239 Arch. Math. Logic 56, No. 5-6, 507-521 (2017). MSC: 03D28 03D30 PDF BibTeX XML Cite \textit{B. A. Anderson} et al., Arch. Math. Logic 56, No. 5--6, 507--521 (2017; Zbl 1417.03239) Full Text: DOI
Slaman, Theodore A.; Soskova, Mariya I. The enumeration degrees: local and global structural interactions. (English) Zbl 1420.03097 Caicedo, Andrés Eduardo (ed.) et al., Foundations of mathematics. Logic at Harvard. Essays in honor of W. Hugh Woodin’s 60th birthday. Proceedings of the Logic at Harvard conference, Harvard University, Cambridge, MA, USA, March 27–29, 2015. Providence, RI: American Mathematical Society (AMS). Contemp. Math. 690, 31-67 (2017). MSC: 03D30 03D25 03D28 PDF BibTeX XML Cite \textit{T. A. Slaman} and \textit{M. I. Soskova}, Contemp. Math. 690, 31--67 (2017; Zbl 1420.03097) Full Text: DOI
Rybalov, Alexander On the generic undecidability of the halting problem for normalized Turing machines. (English) Zbl 1369.03115 Theory Comput. Syst. 60, No. 4, 671-676 (2017). MSC: 03D35 03D10 68Q05 PDF BibTeX XML Cite \textit{A. Rybalov}, Theory Comput. Syst. 60, No. 4, 671--676 (2017; Zbl 1369.03115) Full Text: DOI
Bazhenov, Nikolay A.; Yamaleev, Mars M. Degrees of categoricity of rigid structures. (English) Zbl 06756758 Kari, Jarkko (ed.) et al., Unveiling dynamics and complexity. 13th conference on computability in Europe, CiE 2017, Turku, Finland, June 12–16, 2017. Proceedings. Cham: Springer (ISBN 978-3-319-58740-0/pbk; 978-3-319-58741-7/ebook). Lecture Notes in Computer Science 10307, 152-161 (2017). MSC: 68Qxx PDF BibTeX XML Cite \textit{N. A. Bazhenov} and \textit{M. M. Yamaleev}, Lect. Notes Comput. Sci. 10307, 152--161 (2017; Zbl 06756758) Full Text: DOI
Beros, Achilles; Beros, Konstantinos Normal numbers and limit computable Cantor series. (English) Zbl 1417.03240 Notre Dame J. Formal Logic 58, No. 2, 215-220 (2017). MSC: 03D28 03D80 PDF BibTeX XML Cite \textit{A. Beros} and \textit{K. Beros}, Notre Dame J. Formal Logic 58, No. 2, 215--220 (2017; Zbl 1417.03240) Full Text: DOI
Blanck, Rasmus; Enayat, Ali Marginalia on a theorem of Woodin. (English) Zbl 1419.03033 J. Symb. Log. 82, No. 1, 359-374 (2017). MSC: 03C62 03D25 03F25 03F40 03H15 PDF BibTeX XML Cite \textit{R. Blanck} and \textit{A. Enayat}, J. Symb. Log. 82, No. 1, 359--374 (2017; Zbl 1419.03033) Full Text: DOI
Harrison-Trainor, Matthew The gamma question for many-one degrees. (English) Zbl 1422.03089 Ann. Pure Appl. Logic 168, No. 7, 1396-1405 (2017). MSC: 03D32 68Q30 03D28 03D30 PDF BibTeX XML Cite \textit{M. Harrison-Trainor}, Ann. Pure Appl. Logic 168, No. 7, 1396--1405 (2017; Zbl 1422.03089) Full Text: DOI arXiv
Andrews, Uri; Kuyper, Rutger; Lempp, Steffen; Soskova, Mariya I.; Yamaleev, Mars M. Nondensity of double bubbles in the d.c.e. degrees. (English) Zbl 06700079 Day, Adam (ed.) et al., Computability and complexity. Essays dedicated to Rodney G. Downey on the occasion of his 60th birthday. Cham: Springer (ISBN 978-3-319-50061-4/pbk; 978-3-319-50062-1/ebook). Lecture Notes in Computer Science 10010, 547-562 (2017). MSC: 03D28 PDF BibTeX XML Cite \textit{U. Andrews} et al., Lect. Notes Comput. Sci. 10010, 547--562 (2017; Zbl 06700079) Full Text: DOI
Jockusch, Carl G. jun.; Schupp, Paul E. Asymptotic density and the theory of computability: a partial survey. (English) Zbl 06700076 Day, Adam (ed.) et al., Computability and complexity. Essays dedicated to Rodney G. Downey on the occasion of his 60th birthday. Cham: Springer (ISBN 978-3-319-50061-4/pbk; 978-3-319-50062-1/ebook). Lecture Notes in Computer Science 10010, 501-520 (2017). MSC: 03D30 03D25 03D28 03D32 03D40 PDF BibTeX XML Cite \textit{C. G. Jockusch jun.} and \textit{P. E. Schupp}, Lect. Notes Comput. Sci. 10010, 501--520 (2017; Zbl 06700076) Full Text: DOI
Smullyan, Raymond A beginner’s further guide to mathematical logic. (English) Zbl 1370.03002 Hackensack, NJ: World Scientific (ISBN 978-981-4730-99-0/hbk; 978-981-4725-72-9/pbk). ix, 277 p. (2017). Reviewer: Mario Alviano (Rende) MSC: 03-01 03B05 03B10 03D20 03B40 03D10 03D25 PDF BibTeX XML Cite \textit{R. Smullyan}, A beginner's further guide to mathematical logic. Hackensack, NJ: World Scientific (2017; Zbl 1370.03002) Full Text: DOI
Antonutti Marfori, Marianna Epistemic Church’s thesis and absolute undecidability. (English) Zbl 1433.03105 Horsten, Leon (ed.) et al., Gödel’s disjunction. The scope and limits of mathematical knowledge. Oxford: Oxford University Press. 254-271 (2016). MSC: 03D10 03D35 03F30 03F45 03A05 PDF BibTeX XML Cite \textit{M. Antonutti Marfori}, in: Gödel's disjunction. The scope and limits of mathematical knowledge. Oxford: Oxford University Press. 254--271 (2016; Zbl 1433.03105) Full Text: DOI
Shapiro, Stewart Idealization, mechanism, and knowability. (English) Zbl 1433.03009 Horsten, Leon (ed.) et al., Gödel’s disjunction. The scope and limits of mathematical knowledge. Oxford: Oxford University Press. 189-207 (2016). MSC: 03A05 03D10 03D35 03F40 03F45 PDF BibTeX XML Cite \textit{S. Shapiro}, in: Gödel's disjunction. The scope and limits of mathematical knowledge. Oxford: Oxford University Press. 189--207 (2016; Zbl 1433.03009) Full Text: DOI
Arslanov, M. M.; Kalimullin, I. Sh.; Yamaleev, M. M. Elementary theories and structural properties of d-c.e. and n-c.e. degrees. (English) Zbl 1401.03073 Lobachevskii J. Math. 37, No. 6, 713-722 (2016). MSC: 03D25 03D28 PDF BibTeX XML Cite \textit{M. M. Arslanov} et al., Lobachevskii J. Math. 37, No. 6, 713--722 (2016; Zbl 1401.03073) Full Text: DOI
Hirschfeldt, Denis R.; Jockusch, Carl G. jun.; Kuyper, Rutger; Schupp, Paul E. Coarse reducibility and algorithmic randomness. (English) Zbl 1403.03069 J. Symb. Log. 81, No. 3, 1028-1046 (2016). MSC: 03D30 03D25 03D28 03D32 PDF BibTeX XML Cite \textit{D. R. Hirschfeldt} et al., J. Symb. Log. 81, No. 3, 1028--1046 (2016; Zbl 1403.03069) Full Text: DOI
Andrews, Uri; Cai, Mingzhong; Kalimullin, Iskander Sh.; Lempp, Steffen; Miller, Joseph S.; Montalbán, Antonio The complements of lower cones of degrees and the degree spectra of structures. (English) Zbl 1370.03060 J. Symb. Log. 81, No. 3, 997-1006 (2016). Reviewer: Joseph S. Ullian (Santa Barbara) MSC: 03D25 03D30 03D45 PDF BibTeX XML Cite \textit{U. Andrews} et al., J. Symb. Log. 81, No. 3, 997--1006 (2016; Zbl 1370.03060) Full Text: DOI
Çevik, Ahmet \(\Pi_1^0\) choice classes. (English) Zbl 1371.03050 Math. Log. Q. 62, No. 6, 563-574 (2016). Reviewer: Roman Murawski (Poznań) MSC: 03D28 PDF BibTeX XML Cite \textit{A. Çevik}, Math. Log. Q. 62, No. 6, 563--574 (2016; Zbl 1371.03050) Full Text: DOI
Binns, Stephen; Shore, Richard A.; Simpson, Stephen G. Mass problems and density. (English) Zbl 1401.03075 J. Math. Log. 16, No. 2, Article ID 1650006, 10 p. (2016). MSC: 03D30 03D28 03D55 PDF BibTeX XML Cite \textit{S. Binns} et al., J. Math. Log. 16, No. 2, Article ID 1650006, 10 p. (2016; Zbl 1401.03075) Full Text: DOI
Shoenfield, Joseph R. Recursion theory. Reprint of the 1993 original. (English) Zbl 1366.03001 Lecture Notes in Logic 1. Cambridge: Cambridge University Press; Ithaca, NY: Association of Symbolic Logic (ASL) (ISBN 978-1-107-16808-4/hbk; 978-1-316-71701-1/ebook). vii, 84 p. (2016). MSC: 03-01 03-02 03Dxx PDF BibTeX XML Cite \textit{J. R. Shoenfield}, Recursion theory. Reprint of the 1993 original. Cambridge: Cambridge University Press; Ithaca, NY: Association of Symbolic Logic (ASL) (2016; Zbl 1366.03001) Full Text: DOI
Chong, C. T.; Yu, Liang Measure-theoretic applications of higher Demuth’s theorem. (English) Zbl 1402.03060 Trans. Am. Math. Soc. 368, No. 11, 8249-8265 (2016). MSC: 03D28 03D30 03D32 03E15 28A05 PDF BibTeX XML Cite \textit{C. T. Chong} and \textit{L. Yu}, Trans. Am. Math. Soc. 368, No. 11, 8249--8265 (2016; Zbl 1402.03060) 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
Adamowicz, Zofia; Cordón-Franco, Andrés; Lara-Martín, F. Félix Existentially closed models in the framework of arithmetic. (English) Zbl 1345.03071 J. Symb. Log. 81, No. 2, 774-788 (2016). Reviewer: Roman Murawski (Poznań) MSC: 03C62 03F30 03H15 PDF BibTeX XML Cite \textit{Z. Adamowicz} et al., J. Symb. Log. 81, No. 2, 774--788 (2016; Zbl 1345.03071) Full Text: DOI
Carl, Merlin Generalized effective reducibility. (English) Zbl 1436.03224 Beckmann, Arnold (ed.) et al., Pursuit of the universal. 12th conference on computability in Europe, CiE 2016, Paris, France, June 27 – July 1, 2016. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9709, 225-233 (2016). MSC: 03D30 03D10 03E25 03E35 PDF BibTeX XML Cite \textit{M. Carl}, Lect. Notes Comput. Sci. 9709, 225--233 (2016; Zbl 1436.03224) Full Text: DOI arXiv
Soskova, Mariya I. The automorphism group of the enumeration degrees. (English) Zbl 1403.03071 Ann. Pure Appl. Logic 167, No. 10, 982-999 (2016). MSC: 03D30 03D28 03F35 PDF BibTeX XML Cite \textit{M. I. Soskova}, Ann. Pure Appl. Logic 167, No. 10, 982--999 (2016; Zbl 1403.03071) Full Text: DOI
Andrews, Uri; Cai, Mingzhong; Diamondstone, David; Jockusch, Carl; Lempp, Steffen Asymptotic density, computable traceability, and 1-randomness. (English) Zbl 1401.03074 Fundam. Math. 234, No. 1, 41-53 (2016). MSC: 03D28 03D25 03D32 PDF BibTeX XML Cite \textit{U. Andrews} et al., Fundam. Math. 234, No. 1, 41--53 (2016; Zbl 1401.03074) Full Text: DOI
Andrews, U.; Dushenin, D. I.; Hill, C.; Knight, J. F.; Melnikov, Alexander G. Comparing classes of finite sums. (English. Russian original) Zbl 1375.03034 Algebra Logic 54, No. 6, 489-501 (2016); translation from Algebra Logika 54, No. 6, 748-768 (2015). MSC: 03C57 03D45 03D30 20K10 20K25 PDF BibTeX XML Cite \textit{U. Andrews} et al., Algebra Logic 54, No. 6, 489--501 (2016; Zbl 1375.03034); translation from Algebra Logika 54, No. 6, 748--768 (2015) Full Text: DOI
Bienvenu, Laurent; Desfontaines, Damien; Shen, Alexander Generic algorithms for halting problem and optimal machines revisited. (English) Zbl 1448.03027 Log. Methods Comput. Sci. 12, No. 2, Paper No. 1, 29 p. (2016). MSC: 03D10 03D25 03D32 68Q30 PDF BibTeX XML Cite \textit{L. Bienvenu} et al., Log. Methods Comput. Sci. 12, No. 2, Paper No. 1, 29 p. (2016; Zbl 1448.03027) Full Text: DOI arXiv
Hirschfeldt, Denis R.; Jockusch, Carl G. jun.; McNicholl, Timothy H.; Schupp, Paul E. Asymptotic density and the coarse computability bound. (English) Zbl 06568532 Computability 5, No. 1, 13-27 (2016). MSC: 03D25 03D28 PDF BibTeX XML Cite \textit{D. R. Hirschfeldt} et al., Computability 5, No. 1, 13--27 (2016; Zbl 06568532) Full Text: DOI
Jura, Matthew; Levin, Oscar; Markkanen, Tyler \(A\)-computable graphs. (English) Zbl 1403.03073 Ann. Pure Appl. Logic 167, No. 3, 235-246 (2016). MSC: 03D45 03D25 05C15 05C38 03D28 03C57 PDF BibTeX XML Cite \textit{M. Jura} et al., Ann. Pure Appl. Logic 167, No. 3, 235--246 (2016; Zbl 1403.03073) Full Text: DOI
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
Eberbach, Eugene The applicability of $-calculus to solve some Turing machine undecidable problems. (English) Zbl 1395.68121 Theory Appl. Math. Comput. Sci. 5, No. 1, 37-52 (2015). MSC: 68Q05 03D10 03D35 68Q10 PDF BibTeX XML Cite \textit{E. Eberbach}, Theory Appl. Math. Comput. Sci. 5, No. 1, 37--52 (2015; Zbl 1395.68121)
Barmpalias, George; Lewis-Pye, Andy The information content of typical reals. (English) Zbl 1403.03067 Sommaruga, Giovanni (ed.) et al., Turing’s revolution. The impact of his ideas about computability. Cham: Birkhäuser/Springer (ISBN 978-3-319-22155-7/hbk; 978-3-319-22156-4/ebook). 207-224 (2015). MSC: 03D28 PDF BibTeX XML Cite \textit{G. Barmpalias} and \textit{A. Lewis-Pye}, in: Turing's revolution. The impact of his ideas about computability. Cham: Birkhäuser/Springer. 207--224 (2015; Zbl 1403.03067) Full Text: DOI
Welch, Philip D. Discrete transfinite computation. (English) Zbl 1403.03060 Sommaruga, Giovanni (ed.) et al., Turing’s revolution. The impact of his ideas about computability. Cham: Birkhäuser/Springer (ISBN 978-3-319-22155-7/hbk; 978-3-319-22156-4/ebook). 161-185 (2015). MSC: 03D10 03D65 03E45 03D30 PDF BibTeX XML Cite \textit{P. D. Welch}, in: Turing's revolution. The impact of his ideas about computability. Cham: Birkhäuser/Springer. 161--185 (2015; Zbl 1403.03060) Full Text: DOI
Shi, Xianghui Large cardinals and higher degree theory. (English) Zbl 1432.03104 Zhao, Xishun (ed.) et al., Proceedings of the 13th Asian logic conference, ALC 2013, Guangzhou, China, September 16–20, 2013. Hackensack, NJ: World Scientific. 201-236 (2015). MSC: 03E55 03D28 03D30 03E45 03E60 PDF BibTeX XML Cite \textit{X. Shi}, in: Proceedings of the 13th Asian logic conference, ALC 2013, Guangzhou, China, September 16--20, 2013. Hackensack, NJ: World Scientific. 201--236 (2015; Zbl 1432.03104) Full Text: DOI
Downey, Rod; Ng, Keng Meng Minimal pairs in the c.e. truth-table degrees. (English) Zbl 1432.03076 Zhao, Xishun (ed.) et al., Proceedings of the 13th Asian logic conference, ALC 2013, Guangzhou, China, September 16–20, 2013. Hackensack, NJ: World Scientific. 53-67 (2015). MSC: 03D25 03D30 03D32 PDF BibTeX XML Cite \textit{R. Downey} and \textit{K. M. Ng}, in: Proceedings of the 13th Asian logic conference, ALC 2013, Guangzhou, China, September 16--20, 2013. Hackensack, NJ: World Scientific. 53--67 (2015; Zbl 1432.03076) Full Text: DOI
Neary, Turlough Undecidability in binary tag systems and the Post correspondence problem for five pairs of words. (English) Zbl 1356.68068 Mayr, Ernst W. (ed.) et al., 32nd international symposium on theoretical aspects of computer science, STACS’15, Garching, Germany, March 4–7, 2015. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-78-1). LIPIcs – Leibniz International Proceedings in Informatics 30, 649-661 (2015). MSC: 68Q05 03D35 68Q10 PDF BibTeX XML Cite \textit{T. Neary}, LIPIcs -- Leibniz Int. Proc. Inform. 30, 649--661 (2015; Zbl 1356.68068) Full Text: DOI
Eberbach, Eugene On hypercomputation, universal and diagonalization complete problems. (English) Zbl 1357.68056 Fundam. Inform. 139, No. 4, 329-346 (2015). MSC: 68Q05 03D35 68Q17 PDF BibTeX XML Cite \textit{E. Eberbach}, Fundam. Inform. 139, No. 4, 329--346 (2015; Zbl 1357.68056) Full Text: DOI
Liu, J.; Wu, G.; Yamaleev, M. Downward density of exact degrees. (English) Zbl 1382.03066 Lobachevskii J. Math. 36, No. 4, 389-398 (2015). MSC: 03D28 03D25 03D55 PDF BibTeX XML Cite \textit{J. Liu} et al., Lobachevskii J. Math. 36, No. 4, 389--398 (2015; Zbl 1382.03066) Full Text: DOI
Arslanov, M. M. Structural theory of degrees of unsolvability: advances and open problems. (English. Russian original) Zbl 1361.03039 Algebra Logic 54, No. 4, 342-346 (2015); translation from Algebra Logika 54, No. 4, 529-535 (2015). MSC: 03D28 03D25 PDF BibTeX XML Cite \textit{M. M. Arslanov}, Algebra Logic 54, No. 4, 342--346 (2015; Zbl 1361.03039); translation from Algebra Logika 54, No. 4, 529--535 (2015) Full Text: DOI
Robič, Borut The foundations of computability theory. (English) Zbl 1339.03001 Berlin: Springer (ISBN 978-3-662-44807-6/hbk; 978-3-662-44808-3/ebook). xx, 331 p. (2015). Reviewer: Patrizio Cintioli (Camerino) MSC: 03-01 03Dxx 03-03 01A60 PDF BibTeX XML Cite \textit{B. Robič}, The foundations of computability theory. Berlin: Springer (2015; Zbl 1339.03001) Full Text: DOI
Astor, Eric P. Asymptotic density, immunity and randomness. (English) Zbl 1337.03059 Computability 4, No. 2, 141-158 (2015). MSC: 03D25 03D32 03D28 PDF BibTeX XML Cite \textit{E. P. Astor}, Computability 4, No. 2, 141--158 (2015; Zbl 1337.03059) Full Text: DOI arXiv
Losert, Nadine Where join preservation fails in the bounded Turing degrees of c.e. sets. (English) Zbl 1391.03029 Jain, Rahul (ed.) et al., Theory and applications of models of computation. 12th annual conference, TAMC 2015, Singapore, May 18–20, 2015. Proceedings. Cham: Springer (ISBN 978-3-319-17141-8/pbk; 978-3-319-17142-5/ebook). Lecture Notes in Computer Science 9076, 38-49 (2015). MSC: 03D25 03D28 03D30 PDF BibTeX XML Cite \textit{N. Losert}, Lect. Notes Comput. Sci. 9076, 38--49 (2015; Zbl 1391.03029) Full Text: DOI
Csima, Barbara F.; Knoll, Carolyn Measuring complexities of classes of structures. (English) Zbl 1432.03077 Ann. Pure Appl. Logic 166, No. 12, 1365-1381 (2015). MSC: 03D28 03D30 03D45 PDF BibTeX XML Cite \textit{B. F. Csima} and \textit{C. Knoll}, Ann. Pure Appl. Logic 166, No. 12, 1365--1381 (2015; Zbl 1432.03077) Full Text: DOI
Barmpalias, George; Cai, Mingzhong; Lempp, Steffen; Slaman, Theodore A. On the existence of a strong minimal pair. (English) Zbl 1386.03044 J. Math. Log. 15, No. 1, Article ID 1550003, 28 p. (2015). MSC: 03D25 PDF BibTeX XML Cite \textit{G. Barmpalias} et al., J. Math. Log. 15, No. 1, Article ID 1550003, 28 p. (2015; Zbl 1386.03044) Full Text: DOI arXiv