Goncharov, S. S. Computable Boolean algebras and complexity of the Fréchet ideal. (English. Russian original) Zbl 07940363 J. Math. Sci., New York 284, No. 1, 72-82 (2024); translation from Sirius., Mat. Zh. 1, No. 1-2, 44-53 (2024). MSC: 03Dxx 03-XX 03Cxx × Cite Format Result Cite Review PDF Full Text: DOI
Visser, Albert Essential hereditary undecidability. (English) Zbl 07874614 Arch. Math. Logic 63, No. 5-6, 529-562 (2024). MSC: 03F25 03F30 03F40 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Omanadze, Roland; Chitaia, Irakli On \(bQ_1\)-degrees of c.e. sets. (English) Zbl 07871034 Math. Log. Q. 70, No. 1, 64-72 (2024). MSC: 03-XX × Cite Format Result Cite Review PDF Full Text: DOI
Maletto, Giacomo; Roversi, Luca Certifying expressive power and algorithms of reversible primitive permutations with Lean. (English) Zbl 07803175 J. Log. Algebr. Methods Program. 136, Article ID 100923, 16 p. (2024). MSC: 68-XX × Cite Format Result Cite Review PDF Full Text: DOI
Korovina, Margarita Vladimirovna; Kudinov, Oleg Victorovich On the computability of ordered fields. (English) Zbl 07896829 Sib. Èlektron. Mat. Izv. 20, No. 2, 1341-1360 (2023). MSC: 03D45 03D80 68Q15 × Cite Format Result Cite Review PDF Full Text: DOI arXiv MNR
Yamada, Norihiro Game semantics of Martin-Löf type theory. (English) Zbl 07813361 Math. Struct. Comput. Sci. 33, No. 7, 605-646 (2023). MSC: 68-XX × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Belanger, David; Gao, Ziyuan; Jain, Sanjay; Li, Wei; Stephan, Frank Learnability and positive equivalence relations. (English) Zbl 1533.68119 Inf. Comput. 295, Part A, Article ID 104913, 21 p. (2023). MSC: 68Q32 03D25 68Q45 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Timofeeva, I. L. On proofs of properties of semirecursive sets. (English. Russian original) Zbl 07798725 J. Math. Sci., New York 276, No. 3, 423-427 (2023); translation from Itogi Nauki Tekh., Ser. Sovrem. Mat. Prilozh., Temat. Obz. 179, 73-77 (2020). MSC: 03D25 × Cite Format Result Cite Review PDF Full Text: DOI
Spreen, Dieter How much partiality is needed for a theory of computability? (English) Zbl 07797488 Computability 12, No. 4, 371-426 (2023). MSC: 03Dxx × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Dudenhefner, Andrej Constructive many-one reduction from the halting problem to semi-unification (extended version). (English) Zbl 1541.03119 Log. Methods Comput. Sci. 19, No. 4, Paper No. 22, 27 p. (2023). MSC: 03D10 03D35 03F50 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Gayral, Léo; Sablik, Mathieu Arithmetical hierarchy of the Besicovitch-stability of noisy tilings. (English) Zbl 1533.37043 Theory Comput. Syst. 67, No. 6, 1209-1240 (2023). MSC: 37B10 37B25 37B52 37B51 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Faizrahmanov, Marat A classification of low c.e. sets and the Ershov hierarchy. (English) Zbl 07782439 Math. Log. Q. 69, No. 4, 508-518 (2023). MSC: 03-XX × Cite Format Result Cite Review PDF Full Text: DOI
Dargaj, Jakub; Simonsen, Jakob Grue A complete characterization of infinitely repeated two-player games having computable strategies with no computable best response under limit-of-means payoff. (English) Zbl 1530.91053 J. Econ. Theory 213, Article ID 105713, 24 p. (2023). MSC: 91A20 91A05 91A11 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Mikaelian, Vahagn H. The Higman operations and embeddings of recursive groups. (English) Zbl 1530.20092 J. Group Theory 26, No. 6, 1067-1093 (2023). Reviewer: Igor Subbotin (Los Angeles) MSC: 20F05 20E07 × Cite Format Result Cite Review PDF Full Text: DOI arXiv Backlinks: MO
Rybakov, Mikhail Nikolaevich Binary predicate, transitive closure, two-three variables: shall we play dominoes? (Russian. English summary) Zbl 1547.03071 Log. Issled. 29, No. 1, 114-146 (2023). MSC: 03B25 03D35 × Cite Format Result Cite Review PDF Full Text: DOI
Brattka, Vasco The discontinuity problem. (English) Zbl 07735950 J. Symb. Log. 88, No. 3, 1191-1212 (2023). MSC: 03D30 03D78 03E15 03E25 03E60 91A05 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Goldbring, Isaac; Kunnawalkam Elayavalli, Srivatsav; Lodha, Yash Generic algebraic properties in spaces of enumerated groups. (English) Zbl 1522.20127 Trans. Am. Math. Soc. 376, No. 9, 6245-6282 (2023). Reviewer: Egle Bettio (Venezia) MSC: 20F10 03E15 03C15 03C25 03C57 03C60 06F15 20F60 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Faizrahmanov, M. Kh. Embedding of the first nonconstructive ordinal into the Rogers semilattices of families of arithmetic sets. (English. Russian original) Zbl 07729651 Sib. Math. J. 64, No. 4, 927-935 (2023); translation from Sib. Mat. Zh. 64, No. 4, 830-840 (2023). MSC: 03Dxx 03-XX × Cite Format Result Cite Review PDF Full Text: DOI
Kasymov, N. Kh.; Morozov, A. S. Lower semilattices of separable congruences of numbered algebras. (English. Russian original) Zbl 07729645 Sib. Math. J. 64, No. 4, 864-876 (2023); translation from Sib. Mat. Zh. 64, No. 4, 753-769 (2023). MSC: 03Dxx 03Cxx 08Axx × Cite Format Result Cite Review PDF Full Text: DOI
Omanadze, Roland Sh. \(sQ_1\)-degrees of computably enumerable sets. (English) Zbl 07680030 Arch. Math. Logic 62, No. 3-4, 401-417 (2023). MSC: 03D25 03D30 × Cite Format Result Cite Review PDF Full Text: DOI
Kalociński, Dariusz; Wrocławski, Michał Generalization of Shapiro’s theorem to higher arities and noninjective notations. (English) Zbl 07680023 Arch. Math. Logic 62, No. 1-2, 257-288 (2023). MSC: 03C57 × Cite Format Result Cite Review PDF Full Text: DOI
Kuznetsov, Stepan L.; Speranski, Stanislav O. Infinitary action logic with multiplexing. (English) Zbl 07677358 Stud. Log. 111, No. 2, 251-280 (2023). MSC: 03-XX × Cite Format Result Cite Review PDF Full Text: DOI
Faizrahmanov, M. Kh. Enumeration reducibility and positive reducibility of the numberings of families of arithmetic sets. (English. Russian original) Zbl 1525.03103 Sib. Math. J. 64, No. 1, 174-180 (2023); translation from Sib. Mat. Zh. 64, No. 1, 204-212 (2023). Reviewer: Marat M. Arslanov (Kazan) MSC: 03D45 03D30 × Cite Format Result Cite Review PDF Full Text: DOI
Selivanov, Victor Descriptive complexity of \(\mathsf{qc} \mathsf{b}_0\)-spaces. (English) Zbl 07648670 Theor. Comput. Sci. 945, Article ID 113666, 43 p. (2023). MSC: 03E15 × Cite Format Result Cite Review PDF Full Text: DOI
Spreen, Dieter Bi-topological spaces and the continuity problem. (English) Zbl 07568608 Topol. Proc. 61, 77-99 (2023). MSC: 03F60 03D45 54D65 54E35 54E55 × Cite Format Result Cite Review PDF Full Text: arXiv Link
Theyssier, Guillaume Cold dynamics in cellular automata: a tutorial. (English) Zbl 1530.37033 Nat. Comput. 21, No. 3, 481-505 (2022). MSC: 37B15 × Cite Format Result Cite Review PDF Full Text: DOI arXiv HAL
Marchenkov, S. S. Reducibility by means of almost polynomial functions. (English. Russian original) Zbl 1531.03079 Russ. Math. 66, No. 12, 62-70 (2022); translation from Izv. Vyssh. Uchebn. Zaved., Mat. 2022, No. 12, 68-78 (2022). MSC: 03D30 × Cite Format Result Cite Review PDF Full Text: DOI
Talipova, A. I.; Yamaleev, M. M. Nonuniformity of downward density in \(n\)-computably enumerable Turing degrees. (English. Russian original) Zbl 1531.03078 Russ. Math. 66, No. 11, 110-115 (2022); translation from Izv. Vyssh. Uchebn. Zaved., Mat. 2022, No. 11, 124-131 (2022). MSC: 03D28 × Cite Format Result Cite Review PDF Full Text: DOI
Selivanov, Victor Non-collapse of the effective Wadge hierarchy. (English) Zbl 07641236 Computability 11, No. 3-4, 335-358 (2022). MSC: 03Dxx × Cite Format Result Cite Review PDF Full Text: DOI
Badaev, S. A.; Goncharov, S. S. Rogers semilattices with least and greatest elements in the Ershov hierarchy. (English. Russian original) Zbl 1515.03191 Algebra Logic 61, No. 3, 225-229 (2022); translation from Algebra Logika 61, No. 3, 334-340 (2022). MSC: 03D45 03D55 × Cite Format Result Cite Review PDF Full Text: DOI
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: 68N30 03D80 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Maletto, Giacomo; Roversi, Luca Certifying algorithms and relevant properties of reversible primitive permutations with Lean. (English) Zbl 07615945 Mezzina, Claudio Antares (ed.) et al., Reversible computation. 14th international conference, RC 2022, Urbino, Italy, July 5–6, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13354, 111-127 (2022). MSC: 68Q09 68Q10 81P68 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Gao, Xiangyu; Li, Jianzhong; Miao, Dongjing Sublinear-time reductions for big data computing. (English) Zbl 07585792 Theor. Comput. Sci. 932, 1-12 (2022). MSC: 68T09 68Q15 68Q25 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Della Penna, Giuseppe; Intrigila, Benedetto; Manzonetto, Giulio Addressing machines as models of \(\lambda\)-calculus. (English) Zbl 07577574 Log. Methods Comput. Sci. 18, No. 3, Paper No. 10, 31 p. (2022). MSC: 03B70 68-XX × Cite Format Result Cite Review PDF Full Text: arXiv Link
Andrews, Uri; Sorbi, Andrea Initial segments of the degrees of ceers. (English) Zbl 1507.03096 J. Symb. Log. 87, No. 3, 1260-1282 (2022). Reviewer: Leon Harkleroad (Bowdoinham) MSC: 03D30 × Cite Format Result Cite Review PDF Full Text: DOI Link
Alvir, Rachael; Burchfield, Hannah; Knight, Julia F. Copying one of a pair of structures. (English) Zbl 1531.03074 J. Symb. Log. 87, No. 3, 1201-1214 (2022). MSC: 03C57 03D45 × Cite Format Result Cite Review PDF Full Text: DOI
Burnistov, A. S.; Stukachev, A. I. Inner constructivizability of functional structures. (English. Russian original) Zbl 1515.03194 Algebra Logic 61, No. 1, 16-29 (2022); translation from Algebra Logika 61, No. 1, 23-41 (2022). MSC: 03D60 03C57 03C40 × Cite Format Result Cite Review PDF Full Text: DOI
Balbiani, Philippe; Tinchev, Tinko Decidable and undecidable problems for first-order definability and modal definability. (English) Zbl 1530.03073 Özgün, Aybüke (ed.) et al., Language, logic, and computation. 13th International Tbilisi symposium, TbiLLC 2019, Batumi, Georgia, September 16–20, 2019. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 13206, 214-236 (2022). MSC: 03B45 03B25 × Cite Format Result Cite Review PDF Full Text: DOI HAL
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 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Barendregt, Henk; Terwijn, Sebastiaan A. Partial combinatory algebra and generalized numberings. (English) Zbl 1540.03084 Theor. Comput. Sci. 925, 37-44 (2022). MSC: 03D45 03B40 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Peretyat’kin, M. G. Virtual algebraic isomorphisms between predicate calculi of finite rich signatures. (English. Russian original) Zbl 1515.03166 Algebra Logic 60, No. 6, 389-406 (2022); translation from Algebra Logika 60, No. 6, 587-611 (2021). MSC: 03C57 03C07 03B10 × Cite Format Result Cite Review PDF Full Text: DOI
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 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
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 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Dadazhanov, R. N.; Kasymov, N. Kh.; Khodzhamuratova, I. A. Uniformly computably separable algebras with effectively splittable families of negative congruences. (English. Russian original) Zbl 1509.03131 Sib. Math. J. 63, No. 3, 466-475 (2022); translation from Sib. Mat. Zh. 63, No. 3, 562-575 (2022). MSC: 03D45 03C57 × Cite Format Result Cite Review PDF Full Text: DOI
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 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Chitaia, Irakli; Omanadze, Roland Degree structures of conjunctive reducibility. (English) Zbl 1518.03008 Arch. Math. Logic 61, No. 1-2, 19-31 (2022). Reviewer: Roman Murawski (Poznań) MSC: 03D25 03D30 × Cite Format Result Cite Review PDF Full Text: DOI
Kuznetsov, Stepan L.; Speranski, Stanislav O. Infinitary action logic with exponentiation. (English) Zbl 1547.03173 Ann. Pure Appl. Logic 173, No. 2, Article ID 103057, 29 p. (2022). MSC: 03B47 03C75 03F05 03F52 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Fu, Yuxi A thesis for interaction. (English) Zbl 1532.68044 Theor. Comput. Sci. 897, 114-134 (2022). MSC: 68Q85 68Q10 × Cite Format Result Cite Review PDF Full Text: DOI
Brauer, Ethan The dependence of computability on numerical notations. (English) Zbl 1525.03100 Synthese 198, No. 11, 10485-10511 (2021). MSC: 03D10 68Q04 × Cite Format Result Cite Review PDF Full Text: DOI
Peng, Cheng Normalizing notations in the Ershov hierarchy. (English) Zbl 1521.03120 Math. Log. Q. 67, No. 4, 506-513 (2021). MSC: 03D28 03D25 03D55 × Cite Format Result Cite Review PDF Full Text: DOI
Omanadze, Roland Sh.; Chitaia, Irakli O. \(r\)-maximal sets and \(Q_{1 , N}\)-reducibility. (English) Zbl 1521.03117 Math. Log. Q. 67, No. 2, 138-148 (2021). MSC: 03D25 03D30 × Cite Format Result Cite Review PDF Full Text: DOI
Rybakov, Mikhail; Shkatov, Dmitry Undecidability of QLTL and QCTL with two variables and one monadic predicate letter. (English) Zbl 1539.03075 Log. Issled. 27, No. 2, 93-120 (2021). MSC: 03B44 03B25 × Cite Format Result Cite Review PDF Full Text: DOI
Bazhenov, Nikolay; Mustafa, Manat; Ospichev, Sergei; San Mauro, Luca Approximating approximate reasoning: fuzzy sets and the Ershov hierarchy. (English) Zbl 1540.03081 Ghosh, Sujata (ed.) et al., Logic, rationality, and interaction. 8th international workshop, LORI 2021, Xi’ian, China, October 16–18, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13039, 1-13 (2021). MSC: 03D25 03E72 03D55 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Magossi, José Carlos; de Abreu, Pedro Henrique Camargo; Barros, Antônio César da Costa; Paviotti, José Renato Shannon’s information measure: entropy. (A medida de informação de Shannon: entropia.) (Portuguese. English summary) Zbl 1490.01032 Rev. Bras. Hist. Mat. 21, No. 41, 45-72 (2021). MSC: 01A60 94-03 × Cite Format Result Cite Review PDF Full Text: DOI
Selivanov, Victor Non-collapse of the effective wadge hierarchy. (English) Zbl 07495187 De Mol, Liesbeth (ed.) et al., Connecting with computability. 17th conference on computability in Europe, CiE 2021, virtual event, Ghent, Belgium, July 5–9, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12813, 407-416 (2021). MSC: 68Qxx × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Moyen, Jean-Yves; Simonsen, Jakob Grue Subrecursive equivalence relations and (non-)closure under lattice operations. (English) Zbl 07495183 De Mol, Liesbeth (ed.) et al., Connecting with computability. 17th conference on computability in Europe, CiE 2021, virtual event, Ghent, Belgium, July 5–9, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12813, 363-372 (2021). MSC: 68Qxx × Cite Format Result Cite Review PDF Full Text: DOI
Khazraei, Ardalan; Kötzing, Timo; Seidel, Karen Towards a map for incremental learning in the limit from positive and negative information. (English) Zbl 07495175 De Mol, Liesbeth (ed.) et al., Connecting with computability. 17th conference on computability in Europe, CiE 2021, virtual event, Ghent, Belgium, July 5–9, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12813, 273-284 (2021). MSC: 68Qxx × Cite Format Result Cite Review PDF Full Text: DOI
Andrews, Uri; Sorbi, Andrea Effective inseparability, lattices, and preordering relations. (English) Zbl 1517.03037 Rev. Symb. Log. 14, No. 4, 838-865 (2021). MSC: 03D45 03D30 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Blanck, Rasmus Hierarchical incompleteness results for arithmetically definable extensions of fragments of arithmetic. (English) Zbl 1508.03091 Rev. Symb. Log. 14, No. 3, 624-644 (2021). MSC: 03F30 03F40 03F25 03H15 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Delle Rose, V.; Mauro, L. San; Sorbi, A. The category of equivalence relations. (English. Russian original) Zbl 1515.18004 Algebra Logic 60, No. 5, 295-307 (2021); translation from Algebra Logika 60, No. 4, 451-470 (2021). MSC: 18B10 03D25 03D45 × Cite Format Result Cite Review PDF Full Text: DOI
Blinov, K. V. Primitively recursive categoricity for unars and equivalence structures. (English. Russian original) Zbl 1529.03208 Sib. Math. J. 62, No. 6, 994-1009 (2021); translation from Sib. Mat. Zh. 62, No. 2, 1231-1251 (2021). MSC: 03C57 × Cite Format Result Cite Review PDF Full Text: DOI
Jain, Sanjay; Stephan, Frank; Zeugmann, Thomas On the amount of nonconstructivity in learning formal languages from text. (English) Zbl 1514.68088 Inf. Comput. 281, Article ID 104668, 14 p. (2021). MSC: 68Q32 68Q45 × Cite Format Result Cite Review PDF Full Text: DOI Link
Khisamiev, A. N. Universal functions and \(\Sigma_\omega \)-bounded structures. (English. Russian original) Zbl 1515.03195 Algebra Logic 60, No. 2, 139-153 (2021); translation from Algebra Logika 60, No. 2, 210-230 (2021). MSC: 03D60 × Cite Format Result Cite Review PDF Full Text: DOI
Fernau, Henning; Kutrib, Martin; Wendlandt, Matthias Self-verifying pushdown and queue automata. (English) Zbl 1519.68117 Fundam. Inform. 180, No. 1-2, 1-28 (2021). MSC: 68Q45 × Cite Format Result Cite Review PDF Full Text: DOI
Calude, Cristian S.; Celine, Karen Frilya; Gao, Ziyuan; Jain, Sanjay; Staiger, Ludwig; Stephan, Frank Bi-immunity over different size alphabets. (English) Zbl 1514.68087 Theor. Comput. Sci. 894, 31-49 (2021). MSC: 68Q30 03D32 × Cite Format Result Cite Review PDF Full Text: DOI
Ganchev, Hristo; Sariev, Andrey C. The automorphism group and definability of the jump operator in the \(\omega\)-enumeration degrees. (English) Zbl 1547.03282 Arch. Math. Logic 60, No. 7-8, 909-925 (2021). MSC: 03D30 03D28 × Cite Format Result Cite Review PDF Full Text: DOI
Honkala, Juha Quasi-universal \(k\)-regular sequences. (English) Zbl 1523.11050 Theor. Comput. Sci. 891, 84-89 (2021). Reviewer: Roger Villemaire (Montréal) MSC: 11B85 68Q70 × Cite Format Result Cite Review PDF Full Text: DOI
Belanger, David; Gao, Ziyuan; Jain, Sanjay; Li, Wei; Stephan, Frank Learnability and positive equivalence relations. (English) Zbl 1533.68118 Leporati, Alberto (ed.) et al., Language and automata theory and applications. 15th international conference, LATA 2021, Milan, Italy, March 1–5, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12638, 145-156 (2021). MSC: 68Q32 03D25 68Q45 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Conidis, Chris J. The complexity of module radicals. (English) Zbl 1529.03222 Notre Dame J. Formal Logic 62, No. 2, 353-368 (2021). MSC: 03D45 03D15 13A15 × Cite Format Result Cite Review PDF Full Text: DOI
Velupillai, Kumaraswamy (ed.) Introduction to the Zambelli Festschrift. (English) Zbl 1477.91001 Velupillai, Kumaraswamy (ed.), Keynesian, Sraffian, computable and dynamic economics. Theoretical and simulational (numerical) approaches. Cham: Palgrave Macmillan. 1-31 (2021). MSC: 91-03 01A70 × Cite Format Result Cite Review PDF Full Text: DOI
Dudakov, Sergey; Karlov, Boris On decidability of theories of regular languages. (English) Zbl 1517.68185 Theory Comput. Syst. 65, No. 3, 462-478 (2021). MSC: 68Q45 03B25 03D05 03F30 68Q17 × Cite Format Result Cite Review PDF Full Text: DOI
Lucas, Salvador The origins of the halting problem. (English) Zbl 1535.03007 J. Log. Algebr. Methods Program. 121, Article ID 100687, 9 p. (2021). MSC: 03-03 03D10 68-03 68Q04 01A60 × Cite Format Result Cite Review PDF Full Text: DOI
Marcone, Alberto; Valenti, Manlio The open and clopen Ramsey theorems in the Weihrauch lattice. (English) Zbl 1529.03225 J. Symb. Log. 86, No. 1, 316-351 (2021). MSC: 03D78 03D30 03B30 05D10 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Abascal, Jackson; Hemaspaandra, Lane A.; Maimon, Shir; Rubery, Daniel Closure and nonclosure properties of the classes of compressible and rankable sets. (English) Zbl 1515.68146 J. Comput. Syst. Sci. 120, 162-176 (2021). MSC: 68Q15 × Cite Format Result Cite Review PDF Full Text: DOI
Kalimullin, I. Sh.; Selivanov, V. L.; Frolov, A. N. Degree spectra of structures. (English. Russian original) Zbl 1535.03223 J. Math. Sci., New York 256, No. 2, 143-159 (2021); translation from Itogi Nauki Tekh., Ser. Sovrem. Mat. Prilozh., Temat. Obz. 158, 23-39 (2018). MSC: 03D45 03C57 × Cite Format Result Cite Review PDF Full Text: DOI
Selivanov, V. L. Precomplete numberings. (English. Russian original) Zbl 1535.03224 J. Math. Sci., New York 256, No. 1, 96-124 (2021); translation from Itogi Nauki Tekh., Ser. Sovrem. Mat. Prilozh., Temat. Obz. 157, 106-134 (2018). MSC: 03D45 03C57 03D25 × Cite Format Result Cite Review PDF Full Text: DOI
Frolov, A. N.; Zubkov, M. V. Computable linear orders and limitwise monotonic functions. (English. Russian original) Zbl 1535.03220 J. Math. Sci., New York 256, No. 1, 61-95 (2021); translation from Itogi Nauki Tekh., Ser. Sovrem. Mat. Prilozh., Temat. Obz. 157, 70-105 (2018). MSC: 03D45 03C57 × Cite Format Result Cite Review PDF Full Text: DOI
Bazhenov, N. A. Categoricity spectra of computable structures. (English. Russian original) Zbl 1485.03105 J. Math. Sci., New York 256, No. 1, 34-50 (2021); translation from Itogi Nauki Tekh., Ser. Sovrem. Mat. Prilozh., Temat. Obz. 157, 42-58 (2018). Reviewer: Andrei S. Morozov (Novosibirsk) MSC: 03C57 03D45 × Cite Format Result Cite Review PDF Full Text: DOI
Arslanov, M. M.; Yamaleev, M. M. Turing computability: structural theory. (English. Russian original) Zbl 1535.03214 J. Math. Sci., New York 256, No. 1, 1-33 (2021); translation from Itogi Nauki Tekh., Ser. Sovrem. Mat. Prilozh., Temat. Obz. 157, 8-41 (2018). MSC: 03D28 03C57 03D25 03D45 03D55 × Cite Format Result Cite Review PDF Full Text: DOI
Kornev, Ruslan Aleksandrovich Computable metrics above the standard real metric. (English) Zbl 1535.03229 Sib. Èlektron. Mat. Izv. 18, No. 1, 377-392 (2021). MSC: 03D78 03D45 54E35 × Cite Format Result Cite Review PDF Full Text: DOI
Kalimullin, Iskander; Melnikov, Alexander; Montalban, Antonio Punctual definability on structures. (English) Zbl 1532.03066 Ann. Pure Appl. Logic 172, No. 8, Article ID 102987, 18 p. (2021). MSC: 03D45 03C57 03D75 03D80 × Cite Format Result Cite Review PDF Full Text: DOI
Koepke, P.; Morozov, A. S. Characterizations of ITBM-computability. I. (English. Russian original) Zbl 1515.03188 Algebra Logic 59, No. 6, 423-436 (2021); translation from Algebra Logika 59, No. 6, 627-648 (2020). MSC: 03D30 03D10 × Cite Format Result Cite Review PDF Full Text: DOI
Selivanov, Victor L’vovich Effective wadge hierarchy in computable quasi-Polish spaces. (English) Zbl 1506.03104 Sib. Èlektron. Mat. Izv. 18, No. 1, 121-135 (2021). MSC: 03E15 03D45 03D55 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Agüero Trejo, José Manuel; Calude, Cristian S. A new quantum random number generator certified by value indefiniteness. (English) Zbl 1497.68232 Theor. Comput. Sci. 862, 3-13 (2021). MSC: 68Q30 68Q12 81P68 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Calderoni, Luca; Margara, Luciano; Marzolla, Moreno Direct product primality testing of graphs is GI-hard. (English) Zbl 1502.68214 Theor. Comput. Sci. 860, 72-83 (2021). MSC: 68R10 05C76 68Q17 68Q25 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Berger, Ulrich; Tsuiki, Hideki Intuitionistic fixed point logic. (English) Zbl 1498.03065 Ann. Pure Appl. Logic 172, No. 3, Article ID 102903, 57 p. (2021). MSC: 03B70 03B20 03B40 03D70 03D78 03F60 06B35 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Pianigiani, Duccio; Sorbi, Andrea A note on uniform density in weak arithmetical theories. (English) Zbl 1477.03170 Arch. Math. Logic 60, No. 1-2, 211-225 (2021). Reviewer: Leszek Aleksander Kołodziejczyk (Warszawa) MSC: 03D45 03F30 03F55 × Cite Format Result Cite Review PDF Full Text: DOI
Epstein, Rachel; Lange, Karen Agreement reducibility. (English) Zbl 1521.03121 Math. Log. Q. 66, No. 4, 448-465 (2020). MSC: 03D30 03D25 × Cite Format Result Cite Review PDF Full Text: DOI
Zeugmann, Thomas On the interplay between inductive inference of recursive functions, complexity theory and recursive numberings. (English) Zbl 1544.03033 Anselmo, Marcella (ed.) et al., Beyond the horizon of computability. 16th conference on computability in Europe, CiE 2020, Fisciano, Italy, June 29 – July 3, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12098, 124-136 (2020). MSC: 03D20 03D15 03D45 68Q32 × Cite Format Result Cite Review PDF Full Text: DOI
Pettorossi, Alberto A historical account of my early research interests. (English) Zbl 07453187 Fribourg, Laurent (ed.) et al., Proceedings of the eighth international workshop on verification and program transformation and the seventh workshop on Horn clauses for verification and synthesis, VPT/HCVS 2020, Dublin, Ireland, April 25–26, 2020. Waterloo: Open Publishing Association (OPA). Electron. Proc. Theor. Comput. Sci. (EPTCS) 320, 1-28 (2020). MSC: 68N30 68Q60 × Cite Format Result Cite Review PDF Full Text: arXiv Link
Terwijn, Sebastiaan A. Computability in partial combinatory algebras. (English) Zbl 1465.03078 Bull. Symb. Log. 26, No. 3-4, 224-240 (2020). Reviewer: Leon Harkleroad (Bowdoinham) MSC: 03D25 03B40 03D45 03D75 03D80 × Cite Format Result Cite Review PDF Full Text: DOI arXiv Link
Konovalov, A. Yu. General recursive realizability and basic logic. (English. Russian original) Zbl 1485.03239 Algebra Logic 59, No. 5, 367-384 (2020); translation from Algebra Logika 59, No. 5, 542-566 (2020). MSC: 03F30 × Cite Format Result Cite Review PDF Full Text: DOI
Kalimullin, I. Sh.; Puzarenko, V. G.; Faizrakhmanov, M. Kh. Computable positive and Friedberg numberings in hyperarithmetic. (English. Russian original) Zbl 1484.03080 Algebra Logic 59, No. 1, 46-58 (2020); translation from Algebra Logika 59, No. 1, 66-83 (2020). MSC: 03D45 × Cite Format Result Cite Review PDF Full Text: DOI
Dimitrov, R. D.; Harizanov, V.; Morozov, A. S. Turing degrees and automorphism groups of substructure lattices. (English. Russian original) Zbl 1484.03076 Algebra Logic 59, No. 1, 18-32 (2020); translation from Algebra Logika 59, No. 1, 27-47 (2020). MSC: 03D28 03D45 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Peretyat’kin, Mikhaĭl G. The property of being a model complete theory is preserved by Cartesian extensions. (English) Zbl 1477.03119 Sib. Èlektron. Mat. Izv. 17, 1540-1551 (2020). MSC: 03C10 03B10 × Cite Format Result Cite Review PDF Full Text: DOI
Selivanov, V. L. On degree spectra of topological spaces. (English) Zbl 1486.03074 Lobachevskii J. Math. 41, No. 2, 252-259 (2020). MSC: 03D45 03C57 × Cite Format Result Cite Review PDF Full Text: DOI
Dudakov, S. M. On undecidability of concatenation theory for one-symbol languages. (English) Zbl 1486.03073 Lobachevskii J. Math. 41, No. 2, 168-175 (2020). MSC: 03D35 03B25 03F30 03F35 × Cite Format Result Cite Review PDF Full Text: DOI
Valencia-Cabrera, Luis; Orellana-Martín, David; Martínez-del-Amor, Miguel Á.; Pérez-Hurtado, Ignacio; Pérez-Jiménez, Mario J. From NP-completeness to DP-completeness: a membrane computing perspective. (English) Zbl 1445.68094 Complexity 2020, Article ID 6765097, 10 p. (2020). MSC: 68Q07 68Q15 68Q17 × Cite Format Result Cite Review PDF Full Text: DOI
Bazhenov, Nikolay; Kalimullin, Iskander; Melnikov, Alexander; Ng, Keng Meng Online presentations of finitely generated structures. (English) Zbl 1464.68443 Theor. Comput. Sci. 844, 195-216 (2020). MSC: 68W27 03D20 03D28 03D45 × Cite Format Result Cite Review PDF Full Text: DOI
Chitaia, Irakli; Ng, Keng Meng; Sorbi, Andrea; Yang, Yue Incomparability in local structures of \(s\)-degrees and \(Q\)-degrees. (English) Zbl 1461.03033 Arch. Math. Logic 59, No. 7-8, 777-791 (2020). Reviewer: Patrizio Cintioli (Camerino) MSC: 03D30 03D25 × Cite Format Result Cite Review PDF Full Text: DOI