Skopenkov, Arkadiy Extendability of simplicial maps is undecidable. (English) Zbl 07644326 Discrete Comput. Geom. 69, No. 1, 250-259 (2023). MSC: 55-02 55P05 55S36 68-02 68U05 PDF BibTeX XML Cite \textit{A. Skopenkov}, Discrete Comput. Geom. 69, No. 1, 250--259 (2023; Zbl 07644326) Full Text: DOI arXiv OpenURL
Kartas, Konstantinos An undecidability result for the asymptotic theory of \(p\)-adic fields. (English) Zbl 07628765 Ann. Pure Appl. Logic 174, No. 2, Article ID 103203, 13 p. (2023). MSC: 12L05 12J10 03C60 03D35 PDF BibTeX XML Cite \textit{K. Kartas}, Ann. Pure Appl. Logic 174, No. 2, Article ID 103203, 13 p. (2023; Zbl 07628765) Full Text: DOI arXiv OpenURL
van der Eyden, Mirte; Netzer, Tim; De las Cuevas, Gemma Halos and undecidability of tensor stable positive maps. (English) Zbl 07620729 J. Phys. A, Math. Theor. 55, No. 26, Article ID 264006, 28 p. (2022). MSC: 81-XX 82-XX PDF BibTeX XML Cite \textit{M. van der Eyden} et al., J. Phys. A, Math. Theor. 55, No. 26, Article ID 264006, 28 p. (2022; Zbl 07620729) Full Text: DOI arXiv OpenURL
Damnjanovic, Zlatan Mutual interpretability of weak essentially undecidable theories. (English) Zbl 07620694 J. Symb. Log. 87, No. 4, 1374-1395 (2022). MSC: 03-02 03F25 03F30 PDF BibTeX XML Cite \textit{Z. Damnjanovic}, J. Symb. Log. 87, No. 4, 1374--1395 (2022; Zbl 07620694) Full Text: DOI arXiv OpenURL
Salehi, Saeed Axiomatic (and non-axiomatic) mathematics. (English) Zbl 07598553 Rocky Mt. J. Math. 52, No. 4, 1157-1176 (2022). MSC: 03B25 03C10 03D35 03F40 11U05 12L05 PDF BibTeX XML Cite \textit{S. Salehi}, Rocky Mt. J. Math. 52, No. 4, 1157--1176 (2022; Zbl 07598553) Full Text: DOI arXiv Link OpenURL
Kastenholz, Thorben; Pedron, Mark The minimal genus of homology classes in a finite 2-complex. (English) Zbl 07585330 Algebr. Geom. Topol. 22, No. 3, 1375-1415 (2022). MSC: 57R95 PDF BibTeX XML Cite \textit{T. Kastenholz} and \textit{M. Pedron}, Algebr. Geom. Topol. 22, No. 3, 1375--1415 (2022; Zbl 07585330) Full Text: DOI arXiv OpenURL
Rumenova, Yana; Tinchev, Tinko Modal definability: two commuting equivalence relations. (English) Zbl 07580915 Log. Univers. 16, No. 1-2, 177-194 (2022). MSC: 03-02 03C07 03C13 03B25 03B45 PDF BibTeX XML Cite \textit{Y. Rumenova} and \textit{T. Tinchev}, Log. Univers. 16, No. 1--2, 177--194 (2022; Zbl 07580915) Full Text: DOI OpenURL
Dolich, Alfred; Miller, Chris; Savatovsky, Alex; Thamrongthanyalak, Athipat Connectedness in structures on the real numbers: o-minimality and undecidability. (English) Zbl 07576906 J. Symb. Log. 87, No. 3, 1243-1259 (2022). MSC: 03C64 03D35 54D99 54D05 PDF BibTeX XML Cite \textit{A. Dolich} et al., J. Symb. Log. 87, No. 3, 1243--1259 (2022; Zbl 07576906) Full Text: DOI arXiv OpenURL
Larchey-Wendling, Dominique; Forster, Yannick Hilbert’s tenth problem in Coq (extended version). (English) Zbl 07566048 Log. Methods Comput. Sci. 18, No. 1, Paper No. 35, 41 p. (2022). MSC: 03B70 68-XX PDF BibTeX XML Cite \textit{D. Larchey-Wendling} and \textit{Y. Forster}, Log. Methods Comput. Sci. 18, No. 1, Paper No. 35, 41 p. (2022; Zbl 07566048) Full Text: arXiv Link OpenURL
Rybakov, Mikhail; Shkatov, Dmitry Undecidability of the logic of partial quasiary predicates. (English) Zbl 1494.03076 Log. J. IGPL 30, No. 3, 519-533 (2022). MSC: 03B70 03B25 03B60 PDF BibTeX XML Cite \textit{M. Rybakov} and \textit{D. Shkatov}, Log. J. IGPL 30, No. 3, 519--533 (2022; Zbl 1494.03076) Full Text: DOI OpenURL
Baltag, Alexandru; Li, Dazhu; Pedersen, Mina Young A modal logic for supervised learning. (English) Zbl 07557204 J. Logic Lang. Inf. 31, No. 2, 213-234 (2022). MSC: 03-XX 68-XX PDF BibTeX XML Cite \textit{A. Baltag} et al., J. Logic Lang. Inf. 31, No. 2, 213--234 (2022; Zbl 07557204) Full Text: DOI OpenURL
Cubitt, Toby; Perez-Garcia, David; Wolf, Michael M. Undecidability of the spectral gap. (English) Zbl 07549430 Forum Math. Pi 10, Paper No. e14, 102 p. (2022). MSC: 81Q10 03D35 81P68 03D10 03D80 05B45 PDF BibTeX XML Cite \textit{T. Cubitt} et al., Forum Math. Pi 10, Paper No. e14, 102 p. (2022; Zbl 07549430) Full Text: DOI OpenURL
Kanovich, Max; Kuznetsov, Stepan; Scedrov, Andre Language models for some extensions of the Lambek calculus. (English) Zbl 07540282 Inf. Comput. 287, Article ID 104760, 16 p. (2022). MSC: 03B65 PDF BibTeX XML Cite \textit{M. Kanovich} et al., Inf. Comput. 287, Article ID 104760, 16 p. (2022; Zbl 07540282) Full Text: DOI arXiv OpenURL
Badia, Guillermo; Cintula, Petr; Hájek, Petr; Tedder, Andrew How much propositional logic suffices for Rosser’s essential undecidability theorem? (English) Zbl 1500.03004 Rev. Symb. Log. 15, No. 2, 487-504 (2022). Reviewer: Branislav Boričić (Beograd) MSC: 03B25 03B47 03B52 03F30 PDF BibTeX XML Cite \textit{G. Badia} et al., Rev. Symb. Log. 15, No. 2, 487--504 (2022; Zbl 1500.03004) Full Text: DOI arXiv OpenURL
Miller, Dale; Viel, Alexandre The undecidability of proof search when equality is a logical connective. (English) Zbl 07517440 Ann. Math. Artif. Intell. 90, No. 5, 523-535 (2022). MSC: 03F03 PDF BibTeX XML Cite \textit{D. Miller} and \textit{A. Viel}, Ann. Math. Artif. Intell. 90, No. 5, 523--535 (2022; Zbl 07517440) Full Text: DOI OpenURL
Bell, Paul C. Polynomially ambiguous probabilistic automata on restricted languages. (English) Zbl 1483.68156 J. Comput. Syst. Sci. 127, 53-65 (2022). MSC: 68Q45 PDF BibTeX XML Cite \textit{P. C. Bell}, J. Comput. Syst. Sci. 127, 53--65 (2022; Zbl 1483.68156) Full Text: DOI arXiv Link OpenURL
Wires, Alexander Complexity in Young’s lattice. (English) Zbl 07483256 Ann. Pure Appl. Logic 173, No. 4, Article ID 103075, 19 p. (2022). MSC: 03C15 03C50 03D35 05A17 06A07 PDF BibTeX XML Cite \textit{A. Wires}, Ann. Pure Appl. Logic 173, No. 4, Article ID 103075, 19 p. (2022; Zbl 07483256) Full Text: DOI arXiv OpenURL
Kuznetsov, Stepan L.; Speranski, Stanislav O. Infinitary action logic with exponentiation. (English) Zbl 07458791 Ann. Pure Appl. Logic 173, No. 2, Article ID 103057, 29 p. (2022). MSC: 03B47 03C75 03D35 03F52 PDF BibTeX XML Cite \textit{S. L. Kuznetsov} and \textit{S. O. Speranski}, Ann. Pure Appl. Logic 173, No. 2, Article ID 103057, 29 p. (2022; Zbl 07458791) Full Text: DOI arXiv OpenURL
Wolf, Petra From decidability to undecidability by considering regular sets of instances. (English) Zbl 07450572 Theor. Comput. Sci. 899, 25-38 (2022). MSC: 68Qxx PDF BibTeX XML Cite \textit{P. Wolf}, Theor. Comput. Sci. 899, 25--38 (2022; Zbl 07450572) Full Text: DOI arXiv OpenURL
Tourlakis, George Computability. (English) Zbl 07405176 Cham: Springer (ISBN 978-3-030-83201-8/hbk; 978-3-030-83202-5/ebook). xxvii, 637 p. (2022). Reviewer: Dieter Riebesehl (Lüneburg) MSC: 03Dxx 03-01 03D15 03D20 03D25 03D35 03D45 03D65 03B05 03F40 PDF BibTeX XML Cite \textit{G. Tourlakis}, Computability. Cham: Springer (2022; Zbl 07405176) Full Text: DOI OpenURL
Rybakov, Mikhail; Shkatov, Dmitry Undecidability of QLTL and QCTL with two variables and one monadic predicate letter. (English) Zbl 07642566 Log. Issled. 27, No. 2, 93-120 (2021). MSC: 03-XX PDF BibTeX XML Cite \textit{M. Rybakov} and \textit{D. Shkatov}, Log. Issled. 27, No. 2, 93--120 (2021; Zbl 07642566) Full Text: DOI OpenURL
Fülöp, Zoltán; Kószo, Dávid; Vogler, Heiko Crisp-determinization of weighted tree automata over strong bimonoids. (English) Zbl 1496.68208 Discrete Math. Theor. Comput. Sci. 23, No. 1, Paper No. 18, 44 p. (2021). MSC: 68Q70 20M35 PDF BibTeX XML Cite \textit{Z. Fülöp} et al., Discrete Math. Theor. Comput. Sci. 23, No. 1, Paper No. 18, 44 p. (2021; Zbl 1496.68208) Full Text: DOI arXiv Link OpenURL
Rivollier, Damien Towards the undecidability of the Syracuse conjecture? (Vers l’indécidabilité de la conjecture de Syracuse?) (French) Zbl 07564303 Quadrature 121, 14-20 (2021). Reviewer: Olivier Rozier (Paris) MSC: 11B83 11B37 PDF BibTeX XML Cite \textit{D. Rivollier}, Quadrature 121, 14--20 (2021; Zbl 07564303) OpenURL
Braunfeld, Samuel The undecidability of joint embedding for 3-dimensional permutation classes. (English) Zbl 1487.05008 Discrete Math. Theor. Comput. Sci. 22, No. 2, Paper No. 10, 20 p. (2021). MSC: 05A05 03D35 PDF BibTeX XML Cite \textit{S. Braunfeld}, Discrete Math. Theor. Comput. Sci. 22, No. 2, Paper No. 10, 20 p. (2021; Zbl 1487.05008) Full Text: arXiv Link OpenURL
Prunescu, Mihai Two results about the rational numbers. (English) Zbl 07523921 Rev. Roum. Math. Pures Appl. 66, No. 3-4, 789-792 (2021). Reviewer: Victor V. Pambuccian (Glendale) MSC: 11U05 11D61 03C07 03C35 PDF BibTeX XML Cite \textit{M. Prunescu}, Rev. Roum. Math. Pures Appl. 66, No. 3--4, 789--792 (2021; Zbl 07523921) OpenURL
D’Angeli, Daniele; Rodaro, Emanuele; Wächter, Jan Philipp Corrigendum to: “Automaton semigroups and groups: on the undecidability of problems related to freeness and finiteness”. (English) Zbl 1484.20116 Isr. J. Math. 245, No. 2, 535-542 (2021). MSC: 20M35 20F10 20M05 03D35 68Q70 PDF BibTeX XML Cite \textit{D. D'Angeli} et al., Isr. J. Math. 245, No. 2, 535--542 (2021; Zbl 1484.20116) Full Text: DOI OpenURL
Kutrib, Martin; Malcher, Andreas; Mereghetti, Carlo; Palano, Beatrice Iterated uniform finite-state transducers on unary languages. (English) Zbl 1490.68128 Bureš, Tomáš (ed.) et al., SOFSEM 2021: theory and practice of computer science. 47th international conference on current trends in theory and practice of computer science, SOFSEM 2021, Bolzano-Bozen, Italy, January 25–29, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12607, 218-232 (2021). MSC: 68Q45 68Q80 PDF BibTeX XML Cite \textit{M. Kutrib} et al., Lect. Notes Comput. Sci. 12607, 218--232 (2021; Zbl 1490.68128) Full Text: DOI OpenURL
Myasnikov, Aleksei G.; Sohrabi, Mahmood The Diophantine problem in the classical matrix groups. (English. Russian original) Zbl 1487.20011 Izv. Math. 85, No. 6, 1220-1256 (2021); translation from Izv. Ross. Akad. Nauk, Ser. Mat. 85, No. 6, 205-244 (2021). Reviewer: Wilberd van der Kallen (Utrecht) MSC: 20F10 03C60 20F70 20G35 PDF BibTeX XML Cite \textit{A. G. Myasnikov} and \textit{M. Sohrabi}, Izv. Math. 85, No. 6, 1220--1256 (2021; Zbl 1487.20011); translation from Izv. Ross. Akad. Nauk, Ser. Mat. 85, No. 6, 205--244 (2021) Full Text: DOI OpenURL
Gregory, Lorna Decidability of theories of modules over tubular algebras. (English) Zbl 1500.03012 Proc. Lond. Math. Soc. (3) 123, No. 5, 460-497 (2021). Reviewer: Ivo Herzog (Powell) MSC: 03C60 16G60 03D35 16D90 PDF BibTeX XML Cite \textit{L. Gregory}, Proc. Lond. Math. Soc. (3) 123, No. 5, 460--497 (2021; Zbl 1500.03012) Full Text: DOI arXiv OpenURL
Cantone, D.; Casagrande, A.; Fabris, F.; Omodeo, E. The quest for Diophantine finite-fold-Ness. (English) Zbl 07446605 Matematiche 76, No. 1, 133-160 (2021). MSC: 03D25 03D35 PDF BibTeX XML Cite \textit{D. Cantone} et al., Matematiche 76, No. 1, 133--160 (2021; Zbl 07446605) Full Text: DOI OpenURL
Aubrun, Nathalie; Kari, Jarkko On the domino problem of the Baumslag-Solitar groups. (English) Zbl 07424422 Theor. Comput. Sci. 894, 12-22 (2021). MSC: 68Qxx PDF BibTeX XML Cite \textit{N. Aubrun} and \textit{J. Kari}, Theor. Comput. Sci. 894, 12--22 (2021; Zbl 07424422) Full Text: DOI OpenURL
Honkala, Juha Quasi-universal \(k\)-regular sequences. (English) Zbl 07412742 Theor. Comput. Sci. 891, 84-89 (2021). MSC: 68Qxx PDF BibTeX XML Cite \textit{J. Honkala}, Theor. Comput. Sci. 891, 84--89 (2021; Zbl 07412742) Full Text: DOI OpenURL
Leary, Ian J. Iteration of functions and contractibility of acyclic 2-complexes. (English) Zbl 1482.57021 Publ. Mat., Barc. 65, No. 1, 309-318 (2021). Reviewer: Shengkui Ye (Suzhou) MSC: 57M07 20F10 03D35 11B83 PDF BibTeX XML Cite \textit{I. J. Leary}, Publ. Mat., Barc. 65, No. 1, 309--318 (2021; Zbl 1482.57021) Full Text: DOI arXiv OpenURL
Parmann, Erik; Ågotnes, Thomas Reasoning about strategic voting in modal logic quickly becomes undecidable. (English) Zbl 07399897 J. Log. Comput. 31, No. 4, 1055-1078 (2021). MSC: 03-XX 68-XX PDF BibTeX XML Cite \textit{E. Parmann} and \textit{T. Ågotnes}, J. Log. Comput. 31, No. 4, 1055--1078 (2021; Zbl 07399897) Full Text: DOI OpenURL
Rybakov, Mikhail; Shkatov, Dmitry Algorithmic properties of first-order modal logics of linear Kripke frames in restricted languages. (English) Zbl 07398783 J. Log. Comput. 31, No. 5, 1266-1288 (2021). MSC: 03-XX 68-XX PDF BibTeX XML Cite \textit{M. Rybakov} and \textit{D. Shkatov}, J. Log. Comput. 31, No. 5, 1266--1288 (2021; Zbl 07398783) Full Text: DOI arXiv OpenURL
Bell, Paul C.; Hirvensalo, Mika On injectivity of quantum finite automata. (English) Zbl 07396416 J. Comput. Syst. Sci. 122, 19-33 (2021). MSC: 68-XX PDF BibTeX XML Cite \textit{P. C. Bell} and \textit{M. Hirvensalo}, J. Comput. Syst. Sci. 122, 19--33 (2021; Zbl 07396416) Full Text: DOI arXiv OpenURL
Dudakov, Sergey; Karlov, Boris On decidability of theories of regular languages. (English) Zbl 07377738 Theory Comput. Syst. 65, No. 3, 462-478 (2021). MSC: 68Rxx 68Qxx 11-XX 11Bxx PDF BibTeX XML Cite \textit{S. Dudakov} and \textit{B. Karlov}, Theory Comput. Syst. 65, No. 3, 462--478 (2021; Zbl 07377738) Full Text: DOI OpenURL
Kanovich, Max; Kuznetsov, Stepan; Scedrov, Andre The multiplicative-additive Lambek calculus with subexponential and bracket modalities. (English) Zbl 1496.03087 J. Logic Lang. Inf. 30, No. 1, 31-88 (2021). MSC: 03B47 03F52 03F05 PDF BibTeX XML Cite \textit{M. Kanovich} et al., J. Logic Lang. Inf. 30, No. 1, 31--88 (2021; Zbl 1496.03087) Full Text: DOI arXiv OpenURL
Daylight, Edgar G. The halting problem and security’s language-theoretic approach: praise and criticism from a technical historian. (English) Zbl 07363330 Computability 10, No. 2, 141-158 (2021). MSC: 03Dxx PDF BibTeX XML Cite \textit{E. G. Daylight}, Computability 10, No. 2, 141--158 (2021; Zbl 07363330) Full Text: DOI OpenURL
Sun, Zhi-Wei Further results on Hilbert’s tenth problem. (English) Zbl 1494.11100 Sci. China, Math. 64, No. 2, 281-306 (2021). Reviewer: Xavier Vidaux (Concepción) MSC: 11U05 03D35 03B25 03D25 11D99 11A41 11B39 PDF BibTeX XML Cite \textit{Z.-W. Sun}, Sci. China, Math. 64, No. 2, 281--306 (2021; Zbl 1494.11100) Full Text: DOI arXiv OpenURL
Ferguson, Timothy Entire functions with undecidable arithmetic properties. (English) Zbl 1465.11168 J. Number Theory 223, 255-266 (2021). Reviewer: Jaroslav Hančl (Ostrava) MSC: 11J81 11J91 03D35 11J72 PDF BibTeX XML Cite \textit{T. Ferguson}, J. Number Theory 223, 255--266 (2021; Zbl 1465.11168) Full Text: DOI OpenURL
Durnev, V. G.; Zetkina, O. V.; Zetkina, A. I. Algorithmic undecidability of compatibility problem for equations in free groups: explicit equations with one commutator-type constraint. (English) Zbl 1462.20014 J. Algebra 570, 452-469 (2021). Reviewer: Egle Bettio (Venezia) MSC: 20F10 20E05 20F18 20F05 PDF BibTeX XML Cite \textit{V. G. Durnev} et al., J. Algebra 570, 452--469 (2021; Zbl 1462.20014) Full Text: DOI OpenURL
Lampert, Timm Decidability and notation. (English) Zbl 07644092 Log. Anal., Nouv. Sér. 63, No. 251, 365-386 (2020). MSC: 03A05 03B25 03D35 PDF BibTeX XML Cite \textit{T. Lampert}, Log. Anal., Nouv. Sér. 63, No. 251, 365--386 (2020; Zbl 07644092) Full Text: DOI OpenURL
Rybakov, Mikhail; Shkatov, Dmitry Algorithmic properties of first-order modal logics of the natural number line in restricted languages. (English) Zbl 07585731 Olivetti, Nicola (ed.) et al., Advances in modal logic. Vol. 13. Proceedings of the 13th conference (AiML 2020), Helsinki, Finland, virtual conference, August 24–28, 2020. London: College Publications. 523-539 (2020). MSC: 03B45 PDF BibTeX XML Cite \textit{M. Rybakov} and \textit{D. Shkatov}, in: Advances in modal logic. Vol. 13. Proceedings of the 13th conference (AiML 2020), Helsinki, Finland, virtual conference, August 24--28, 2020. London: College Publications. 523--539 (2020; Zbl 07585731) OpenURL
Kuznetsov, Stepan The ‘long rule’ in the Lambek calculus with iteration: undecidability without meets and joins. (English) Zbl 07585726 Olivetti, Nicola (ed.) et al., Advances in modal logic. Vol. 13. Proceedings of the 13th conference (AiML 2020), Helsinki, Finland, virtual conference, August 24–28, 2020. London: College Publications. 425-440 (2020). MSC: 03B45 PDF BibTeX XML Cite \textit{S. Kuznetsov}, in: Advances in modal logic. Vol. 13. Proceedings of the 13th conference (AiML 2020), Helsinki, Finland, virtual conference, August 24--28, 2020. London: College Publications. 425--440 (2020; Zbl 07585726) OpenURL
da Costa, N. C. A. Undecidability, incompleteness and beyond: an adventure. (English) Zbl 1496.03245 de Barros, J. Acacio (ed.) et al., A true polymath. A tribute to Francisco Antonio Doria. Based on the meeting, Rio de Janeiro, Brazil, December 2018. [s.l.]: College Publications. Acad. Bras. Filos. 2, 168-183 (2020). MSC: 03F40 03D35 81P10 PDF BibTeX XML Cite \textit{N. C. A. da Costa}, Acad. Bras. Filos. 2, 168--183 (2020; Zbl 1496.03245) OpenURL
Kuperberg, Denis; Martens, Jan Regular resynchronizability of origin transducers is undecidable. (English) Zbl 07559429 Esparza, Javier (ed.) et al., 45th international symposium on mathematical foundations of computer science, MFCS 2020, August 25–26, 2020, Prague, Czech Republic. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 170, Article 58, 14 p. (2020). MSC: 68Qxx PDF BibTeX XML Cite \textit{D. Kuperberg} and \textit{J. Martens}, LIPIcs -- Leibniz Int. Proc. Inform. 170, Article 58, 14 p. (2020; Zbl 07559429) Full Text: DOI arXiv OpenURL
Li, Dazhu Losing connection: the modal logic of definable link deletion. (English) Zbl 07412827 J. Log. Comput. 30, No. 3, 715-743 (2020). MSC: 03-XX 68-XX PDF BibTeX XML Cite \textit{D. Li}, J. Log. Comput. 30, No. 3, 715--743 (2020; Zbl 07412827) Full Text: DOI arXiv OpenURL
Durnev, Valeriĭ Georgievich; Zetkina, Oksana Valer’evna; Zetkina, Alena Igorevna On “simple” algorithmically undecidable fragments of elementary theory of an infinitely generated free semigroup. (Russian. English summary) Zbl 1477.03166 Chebyshevskiĭ Sb. 21, No. 4(76), 56-71 (2020). MSC: 03D35 20M05 PDF BibTeX XML Cite \textit{V. G. Durnev} et al., Chebyshevskiĭ Sb. 21, No. 4(76), 56--71 (2020; Zbl 1477.03166) Full Text: MNR OpenURL
Garreta, Albert; Miasnikov, Alexei; Ovchinnikov, Denis Diophantine problems in solvable groups. (English) Zbl 07365332 Bull. Math. Sci. 10, No. 1, Article ID 2050005, 27 p. (2020). MSC: 20F70 20F10 03B25 03D35 20F18 20F16 PDF BibTeX XML Cite \textit{A. Garreta} et al., Bull. Math. Sci. 10, No. 1, Article ID 2050005, 27 p. (2020; Zbl 07365332) Full Text: DOI arXiv OpenURL
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 PDF BibTeX XML Cite \textit{S. A. Terwijn}, Bull. Symb. Log. 26, No. 3--4, 224--240 (2020; Zbl 1465.03078) Full Text: DOI arXiv OpenURL
Cheng, Yong Finding the limit of incompleteness. I. (English) Zbl 1464.03089 Bull. Symb. Log. 26, No. 3-4, 268-286 (2020). Reviewer: Saeed Salehi (Tabriz) MSC: 03F40 03F30 03D35 PDF BibTeX XML Cite \textit{Y. Cheng}, Bull. Symb. Log. 26, No. 3--4, 268--286 (2020; Zbl 1464.03089) Full Text: DOI arXiv OpenURL
Halava, Vesa; Harju, Tero On the steps of Emil Post: from normal systems to the correspondence decision problem. (English) Zbl 1474.03095 Acta Cybern. 24, No. 4, 613-623 (2020). MSC: 03D03 03-03 03D35 01A60 PDF BibTeX XML Cite \textit{V. Halava} and \textit{T. Harju}, Acta Cybern. 24, No. 4, 613--623 (2020; Zbl 1474.03095) Full Text: DOI OpenURL
Prunescu, Mihai The exponential Diophantine problem for \(\mathbb{Q}\). (English) Zbl 1480.11161 J. Symb. Log. 85, No. 2, 671-672 (2020). Reviewer: Alexandra Shlapentokh (Greenville) MSC: 11U05 11D61 14G05 PDF BibTeX XML Cite \textit{M. Prunescu}, J. Symb. Log. 85, No. 2, 671--672 (2020; Zbl 1480.11161) Full Text: DOI OpenURL
Jeandel, Emmanuel; Vanier, Pascal The undecidability of the domino problem. (English) Zbl 1457.52017 Akiyama, Shigeki (ed.) et al., Substitution and tiling dynamics: introduction to self-inducing structures. Lecture notes from the research school on tiling dynamical systems, CIRM Jean-Morlet Chair, Marseille, France, Fall 2017. Cham: Springer. Lect. Notes Math. 2273, 293-357 (2020). MSC: 52C20 37B52 52C23 PDF BibTeX XML Cite \textit{E. Jeandel} and \textit{P. Vanier}, Lect. Notes Math. 2273, 293--357 (2020; Zbl 1457.52017) Full Text: DOI OpenURL
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 OpenURL
Rybakov, Mikhail; Shkatov, Dmitry Algorithmic properties of first-order modal logics of finite Kripke frames in restricted languages. (English) Zbl 07285871 J. Log. Comput. 30, No. 7, 1305-1329 (2020). MSC: 03-XX 68-XX PDF BibTeX XML Cite \textit{M. Rybakov} and \textit{D. Shkatov}, J. Log. Comput. 30, No. 7, 1305--1329 (2020; Zbl 07285871) Full Text: DOI arXiv OpenURL
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 PDF BibTeX XML Cite \textit{S. M. Dudakov}, Lobachevskii J. Math. 41, No. 2, 168--175 (2020; Zbl 1486.03073) Full Text: DOI OpenURL
Fritz, Tobias Curious properties of free hypergraph \(C^*\)-algebras. (English) Zbl 1463.46100 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 1463.46100) OpenURL
Akiyama, Shigeki (ed.); Arnoux, Pierre (ed.) Substitution and tiling dynamics: introduction to self-inducing structures. Lecture notes from the research school on tiling dynamical systems, CIRM Jean-Morlet Chair, Marseille, France, Fall 2017. (English) Zbl 1454.37001 Lecture Notes in Mathematics 2273. Cham: Springer (ISBN 978-3-030-57665-3/pbk; 978-3-030-57666-0/ebook). xix, 453 p. (2020). MSC: 37-02 52-02 37Bxx 52Cxx 00B25 PDF BibTeX XML Cite \textit{S. Akiyama} (ed.) and \textit{P. Arnoux} (ed.), Substitution and tiling dynamics: introduction to self-inducing structures. Lecture notes from the research school on tiling dynamical systems, CIRM Jean-Morlet Chair, Marseille, France, Fall 2017. Cham: Springer (2020; Zbl 1454.37001) Full Text: DOI OpenURL
Jalonen, Joonatan; Kari, Jarkko On the conjugacy problem of cellular automata. (English) Zbl 1459.37013 Inf. Comput. 274, Article ID 104531, 13 p. (2020). Reviewer: Hasan Akin (Gaziantep) MSC: 37B15 37C15 68Q80 PDF BibTeX XML Cite \textit{J. Jalonen} and \textit{J. Kari}, Inf. Comput. 274, Article ID 104531, 13 p. (2020; Zbl 1459.37013) Full Text: DOI arXiv OpenURL
Springer, Caleb Undecidability, unit groups, and some totally imaginary infinite extensions of \(\mathbb{Q}\). (English) Zbl 1471.11262 Proc. Am. Math. Soc. 148, No. 11, 4705-4715 (2020). Reviewer: Xavier Vidaux (Concepción) MSC: 11R04 11U05 11R80 11D99 03D35 PDF BibTeX XML Cite \textit{C. Springer}, Proc. Am. Math. Soc. 148, No. 11, 4705--4715 (2020; Zbl 1471.11262) Full Text: DOI arXiv OpenURL
Coulombe, Michael J.; Lynch, Jayson Cooperating in video games? Impossible! Undecidability of team multiplayer games. (English) Zbl 1454.91007 Theor. Comput. Sci. 839, 30-40 (2020). MSC: 91A06 91A43 68Q17 PDF BibTeX XML Cite \textit{M. J. Coulombe} and \textit{J. Lynch}, Theor. Comput. Sci. 839, 30--40 (2020; Zbl 1454.91007) Full Text: DOI Link OpenURL
Copeland, B. Jack; Shagrir, Oron Physical computability theses. (English) Zbl 1498.68109 Hemmo, Meir (ed.) et al., Quantum, probability, logic. The work and influence of Itamar Pitowsky. Cham: Springer. Jerus. Stud. Philos. Hist. Sci., 217-231 (2020). MSC: 68Q09 03A10 03D10 68Q12 81P05 83C99 PDF BibTeX XML Cite \textit{B. J. Copeland} and \textit{O. Shagrir}, in: Quantum, probability, logic. The work and influence of Itamar Pitowsky. Cham: Springer. 217--231 (2020; Zbl 1498.68109) Full Text: DOI OpenURL
Ursu, V. I. A correspondence between commutative rings and Jordan loops. (English. Russian original) Zbl 1454.20122 Algebra Logic 58, No. 6, 494-513 (2020); translation from Algebra Logika 58, No. 6, 741-768 (2019). MSC: 20N05 13L05 PDF BibTeX XML Cite \textit{V. I. Ursu}, Algebra Logic 58, No. 6, 494--513 (2020; Zbl 1454.20122); translation from Algebra Logika 58, No. 6, 741--768 (2019) Full Text: DOI OpenURL
Pogudin, Gleb; Scanlon, Thomas; Wibmer, Michael Solving difference equations in sequences: universality and undecidability. (English) Zbl 1462.13029 Forum Math. Sigma 8, Paper No. e33, 30 p. (2020). Reviewer: Alexander B. Levin (Washington) MSC: 13P25 12H10 39A10 14Q20 03D35 PDF BibTeX XML Cite \textit{G. Pogudin} et al., Forum Math. Sigma 8, Paper No. e33, 30 p. (2020; Zbl 1462.13029) Full Text: DOI arXiv OpenURL
Lye, Aaron Context-sensitive fusion grammars are universal. (English) Zbl 1437.68085 Leporati, Alberto (ed.) et al., Language and automata theory and applications. 14th international conference, LATA 2020, Milan, Italy, March 4–6, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12038, 275-286 (2020). MSC: 68Q42 03D35 05C65 68Q45 PDF BibTeX XML Cite \textit{A. Lye}, Lect. Notes Comput. Sci. 12038, 275--286 (2020; Zbl 1437.68085) Full Text: DOI OpenURL
Klein, Rolf; Kübel, David; Langetepe, Elmar; Sack, Jörg-Rüdiger; Schwarzwald, Barbara A new model in firefighting theory. (English) Zbl 1453.68207 Changat, Manoj (ed.) et al., Algorithms and discrete applied mathematics. 6th international conference, CALDAM 2020, Hyderabad, India, February 13–15, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12016, 371-383 (2020). MSC: 68U05 05C85 68Q17 68Q25 68Q80 68R10 PDF BibTeX XML Cite \textit{R. Klein} et al., Lect. Notes Comput. Sci. 12016, 371--383 (2020; Zbl 1453.68207) Full Text: DOI arXiv OpenURL
D’Angeli, Daniele; Rodaro, Emanuele; Wächter, Jan Philipp Automaton semigroups and groups: on the undecidability of problems related to freeness and finiteness. (English) Zbl 1484.20115 Isr. J. Math. 237, No. 1, 15-52 (2020); corrigendum ibid. 245, No. 2, 535-542 (2021). MSC: 20M35 20F10 20M05 03D35 68Q70 PDF BibTeX XML Cite \textit{D. D'Angeli} et al., Isr. J. Math. 237, No. 1, 15--52 (2020; Zbl 1484.20115) Full Text: DOI arXiv OpenURL
Carnevale, Angela; Cavaleri, Matteo Partial word and equality problems and Banach densities. (English) Zbl 1481.20117 Adv. Math. 368, Article ID 107133, 15 p. (2020). MSC: 20F10 20F05 03D35 PDF BibTeX XML Cite \textit{A. Carnevale} and \textit{M. Cavaleri}, Adv. Math. 368, Article ID 107133, 15 p. (2020; Zbl 1481.20117) Full Text: DOI arXiv OpenURL
Kanovich, Max; Kuznetsov, Stepan; Scedrov, Andre Reconciling Lambek’s restriction, cut-elimination and substitution in the presence of exponential modalities. (English) Zbl 07194699 J. Log. Comput. 30, No. 1, 239-256 (2020). MSC: 03B47 PDF BibTeX XML Cite \textit{M. Kanovich} et al., J. Log. Comput. 30, No. 1, 239--256 (2020; Zbl 07194699) Full Text: DOI arXiv OpenURL
Esbelin, Henri-Alex; Gutan, Marin Relations in the semigroup of \(2\times 2\) upper-triangular matrices. (English) Zbl 1484.20109 Int. J. Algebra Comput. 30, No. 3, 567-584 (2020). MSC: 20M20 20M05 15A30 03D35 11D61 11D72 PDF BibTeX XML Cite \textit{H.-A. Esbelin} and \textit{M. Gutan}, Int. J. Algebra Comput. 30, No. 3, 567--584 (2020; Zbl 1484.20109) Full Text: DOI OpenURL
Bojańczyk, Mikołaj; Daviaud, Laure; Guillon, Bruno; Penelle, Vincent; Sreejith, A. V. Undecidability of a weak version of mso+U. (English) Zbl 07168148 Log. Methods Comput. Sci. 16, No. 1, Paper No. 12, 15 p. (2020). MSC: 03B70 68-XX PDF BibTeX XML Cite \textit{M. Bojańczyk} et al., Log. Methods Comput. Sci. 16, No. 1, Paper No. 12, 15 p. (2020; Zbl 07168148) Full Text: arXiv OpenURL
Martínez-Ranero, Carlos; Utreras, Javier; Videla, Carlos R. Undecidability of \(\mathbb{Q}^{(2)} \). (English) Zbl 1455.11166 Proc. Am. Math. Soc. 148, No. 3, 961-964 (2020). Reviewer: Alexandra Shlapentokh (Greenville) MSC: 11U05 03B25 11R11 PDF BibTeX XML Cite \textit{C. Martínez-Ranero} et al., Proc. Am. Math. Soc. 148, No. 3, 961--964 (2020; Zbl 1455.11166) Full Text: DOI arXiv OpenURL
Matiyasevich, Yu. The Riemann hypothesis in computer science. (English) Zbl 1484.03078 Theor. Comput. Sci. 807, 257-265 (2020). MSC: 03D35 11M26 68V20 PDF BibTeX XML Cite \textit{Yu. Matiyasevich}, Theor. Comput. Sci. 807, 257--265 (2020; Zbl 1484.03078) Full Text: DOI OpenURL
Bell, Paul C.; Hirvensalo, Mika Acceptance ambiguity for quantum automata. (English) Zbl 07561714 Rossmanith, Peter (ed.) et al., 44th international symposium on mathematical foundations of computer science, MFCS 2019, Aachen, Germany, August 26–30, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 138, Article 70, 14 p. (2019). MSC: 68Qxx PDF BibTeX XML Cite \textit{P. C. Bell} and \textit{M. Hirvensalo}, LIPIcs -- Leibniz Int. Proc. Inform. 138, Article 70, 14 p. (2019; Zbl 07561714) Full Text: DOI OpenURL
Bell, Paul C. Polynomially ambiguous probabilistic automata on restricted languages. (English) Zbl 07561598 Baier, Christel (ed.) et al., 46th international colloquium on automata, languages, and programming, ICALP 2019, Patras, Greece, July 9–12, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 132, Article 105, 14 p. (2019). MSC: 68Nxx 68Qxx PDF BibTeX XML Cite \textit{P. C. Bell}, LIPIcs -- Leibniz Int. Proc. Inform. 132, Article 105, 14 p. (2019; Zbl 07561598) Full Text: DOI OpenURL
Dudenhefner, Andrej; Rehof, Jakob A simpler undecidability proof for system F inhabitation. (English) Zbl 07561487 Dybjer, Peter (ed.) et al., 24th international conference on types for proofs and programs, TYPES 2018, Braga, Portugal, June 18–21, 2018. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 130, Article 2, 11 p. (2019). MSC: 03B70 68N30 PDF BibTeX XML Cite \textit{A. Dudenhefner} and \textit{J. Rehof}, LIPIcs -- Leibniz Int. Proc. Inform. 130, Article 2, 11 p. (2019; Zbl 07561487) Full Text: DOI OpenURL
Larchey-Wendling, Dominique; Forster, Yannick Hilbert’s tenth problem in Coq. (English) Zbl 07559293 Geuvers, Herman (ed.), 4th international conference on formal structures for computation and deduction, FSCD 2019, Dortmund, Germany, June 24–30, 2019. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 131, Article 27, 20 p. (2019). MSC: 03B70 68Qxx PDF BibTeX XML Cite \textit{D. Larchey-Wendling} and \textit{Y. Forster}, LIPIcs -- Leibniz Int. Proc. Inform. 131, Article 27, 20 p. (2019; Zbl 07559293) Full Text: DOI OpenURL
Hart, K. P. Machine learning and the continuum hypothesis. (English) Zbl 1446.03085 Nieuw Arch. Wiskd. (5) 20, No. 3, 214-217 (2019). MSC: 03E50 03E10 03D35 68V15 PDF BibTeX XML Cite \textit{K. P. Hart}, Nieuw Arch. Wiskd. (5) 20, No. 3, 214--217 (2019; Zbl 1446.03085) Full Text: arXiv OpenURL
Mainzer, Klaus From mathesis universalis to provability, computability, and constructivity. (English) Zbl 1469.03113 Centrone, Stefania (ed.) et al., Mathesis universalis, computability and proof. Based on the Humboldt-Kolleg “Proof theory as mathesis universalis”, held at the German-Italian Centre for European Excellence, Villa Vigoni, Loveno di Menaggio, Como, Italy, July 24–28, 2017. Cham: Springer. Synth. Libr. 412, 203-234 (2019). MSC: 03D10 03D35 03F35 03F60 03B30 03F25 68V15 03B38 55U40 PDF BibTeX XML Cite \textit{K. Mainzer}, Synth. Libr. 412, 203--234 (2019; Zbl 1469.03113) Full Text: DOI OpenURL
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 OpenURL
Kanovich, Max; Kuznetsov, Stepan; Scedrov, Andre L-models and R-models for Lambek calculus enriched with additives and the multiplicative unit. (English) Zbl 07176937 Iemhoff, Rosalie (ed.) et al., Logic, language, information, and computation. 26th international workshop, WoLLIC 2019, Utrecht, The Netherlands, July 2–5, 2019. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 11541, 373-391 (2019). MSC: 03B70 PDF BibTeX XML Cite \textit{M. Kanovich} et al., Lect. Notes Comput. Sci. 11541, 373--391 (2019; Zbl 07176937) Full Text: DOI OpenURL
Ouaknine, Joël; Pouly, Amaury; Sousa-Pinto, João; Worrell, James On the decidability of membership in matrix-exponential semigroups. (English) Zbl 1481.20197 J. ACM 66, No. 3, Article No. 15, 24 p. (2019). MSC: 20M05 20M20 03D35 15A16 PDF BibTeX XML Cite \textit{J. Ouaknine} et al., J. ACM 66, No. 3, Article No. 15, 24 p. (2019; Zbl 1481.20197) Full Text: DOI OpenURL
Baltag, Alexandru; Li, Dazhu; Pedersen, Mina Young On the right path: a modal logic for supervised learning. (English) Zbl 07160597 Blackburn, Patrick (ed.) et al., Logic, rationality, and interaction. 7th international workshop, LORI 2019, Chongqing, China, October 18–21, 2019. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 11813, 1-14 (2019). MSC: 68T27 PDF BibTeX XML Cite \textit{A. Baltag} et al., Lect. Notes Comput. Sci. 11813, 1--14 (2019; Zbl 07160597) Full Text: DOI arXiv OpenURL
Statman, Rick Simple subtypes of intersection types. (English) Zbl 1446.03033 Fundam. Inform. 170, No. 1-3, 307-324 (2019). MSC: 03B38 03D35 03B25 03F03 PDF BibTeX XML Cite \textit{R. Statman}, Fundam. Inform. 170, No. 1--3, 307--324 (2019; Zbl 1446.03033) Full Text: DOI OpenURL
Dudenhefner, Andrej; Rehof, Jakob Undecidability of intersection type inhabitation at rank 3 and its formalization. (English) Zbl 1446.03035 Fundam. Inform. 170, No. 1-3, 93-110 (2019). MSC: 03B40 03D03 03D35 03B25 PDF BibTeX XML Cite \textit{A. Dudenhefner} and \textit{J. Rehof}, Fundam. Inform. 170, No. 1--3, 93--110 (2019; Zbl 1446.03035) Full Text: DOI OpenURL
Nakamura, Yoshiki The undecidability of FO3 and the calculus of relations with just one binary relation. (English) Zbl 07150813 Khan, Md. Aquil (ed.) et al., Logic and its applications. 8th Indian conference, ICLA 2019, Delhi, India, March 1–5, 2019. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 11600, 108-120 (2019). MSC: 03Bxx 68T27 PDF BibTeX XML Cite \textit{Y. Nakamura}, Lect. Notes Comput. Sci. 11600, 108--120 (2019; Zbl 07150813) Full Text: DOI OpenURL
Kanel’-Belov, A. Ya.; Chilikov, A. A. On the algorithmic undecidability of the embeddability problem for algebraic varieties over a field of characteristic zero. (English. Russian original) Zbl 1442.14185 Math. Notes 106, No. 2, 299-302 (2019); translation from Mat. Zametki 106, No. 2, 307-310 (2019). MSC: 14Q20 11U05 14E25 PDF BibTeX XML Cite \textit{A. Ya. Kanel'-Belov} and \textit{A. A. Chilikov}, Math. Notes 106, No. 2, 299--302 (2019; Zbl 1442.14185); translation from Mat. Zametki 106, No. 2, 307--310 (2019) Full Text: DOI OpenURL
Bell, Paul C.; Chen, Shang; Jackson, Lisa Freeness properties of weighted and probabilistic automata over bounded languages. (English) Zbl 1435.68143 Inf. Comput. 269, Article ID 104440, 13 p. (2019). MSC: 68Q45 20M35 68Q70 PDF BibTeX XML Cite \textit{P. C. Bell} et al., Inf. Comput. 269, Article ID 104440, 13 p. (2019; Zbl 1435.68143) Full Text: DOI Link OpenURL
Andrews, Uri; Igusa, Gregory; Miller, Joseph S.; Soskova, Mariya I. Characterizing the continuous degrees. (English) Zbl 1442.03023 Isr. J. Math. 234, No. 2, 743-767 (2019). Reviewer: Roman Murawski (Poznań) MSC: 03D35 03D25 03D78 PDF BibTeX XML Cite \textit{U. Andrews} et al., Isr. J. Math. 234, No. 2, 743--767 (2019; Zbl 1442.03023) Full Text: DOI OpenURL
Moore, Matthew Finite degree clones are undecidable. (English) Zbl 1454.08002 Theor. Comput. Sci. 796, 237-271 (2019). MSC: 08A40 03D35 08B10 PDF BibTeX XML Cite \textit{M. Moore}, Theor. Comput. Sci. 796, 237--271 (2019; Zbl 1454.08002) Full Text: DOI arXiv OpenURL
Rybalov, Aleksandr Nikolaevich Generic undecidability of universal theories. (Russian. English summary) Zbl 1446.03075 Sib. Èlektron. Mat. Izv. 16, 1289-1294 (2019). MSC: 03D35 03D15 PDF BibTeX XML Cite \textit{A. N. Rybalov}, Sib. Èlektron. Mat. Izv. 16, 1289--1294 (2019; Zbl 1446.03075) Full Text: DOI OpenURL
Bazhenov, Nikolay Computable contact algebras. (English) Zbl 1446.03076 Fundam. Inform. 167, No. 4, 257-269 (2019). MSC: 03D45 03C57 03D35 68T27 PDF BibTeX XML Cite \textit{N. Bazhenov}, Fundam. Inform. 167, No. 4, 257--269 (2019; Zbl 1446.03076) Full Text: DOI OpenURL
Dudakov, Sergey; Karlov, Boris On decidability of regular languages theories. (English) Zbl 07121061 van Bevern, René (ed.) et al., Computer science – theory and applications. 14th international computer science symposium in Russia, CSR 2019, Novosibirsk, Russia, July 1–5, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11532, 119-130 (2019). MSC: 68Qxx PDF BibTeX XML Cite \textit{S. Dudakov} and \textit{B. Karlov}, Lect. Notes Comput. Sci. 11532, 119--130 (2019; Zbl 07121061) Full Text: DOI OpenURL
Utreras, Javier Interpreting arithmetic in the first-order theory of addition and coprimality of polynomial rings. (English) Zbl 1454.03015 J. Symb. Log. 84, No. 3, 1194-1214 (2019). Reviewer: Saeed Salehi (Tabriz) MSC: 03B25 12L05 03F30 03D35 PDF BibTeX XML Cite \textit{J. Utreras}, J. Symb. Log. 84, No. 3, 1194--1214 (2019; Zbl 1454.03015) Full Text: DOI OpenURL
Rybakov, Mikhail; Shkatov, Dmitry Undecidability of first-order modal and intuitionistic logics with two variables and one monadic predicate letter. (English) Zbl 07100699 Stud. Log. 107, No. 4, 695-717 (2019); correction 110, No. 2, 597–598 (2022). MSC: 03-XX PDF BibTeX XML Cite \textit{M. Rybakov} and \textit{D. Shkatov}, Stud. Log. 107, No. 4, 695--717 (2019; Zbl 07100699) Full Text: DOI arXiv OpenURL
Gillibert, Pierre; Ranieri, Gabriele Julia Robinson numbers. (English) Zbl 1457.11142 Int. J. Number Theory 15, No. 8, 1565-1599 (2019). Reviewer: B. Z. Moroz (Bonn) MSC: 11R04 11U05 11R80 PDF BibTeX XML Cite \textit{P. Gillibert} and \textit{G. Ranieri}, Int. J. Number Theory 15, No. 8, 1565--1599 (2019; Zbl 1457.11142) Full Text: DOI arXiv OpenURL
Assadi, Ziba; Salehi, Saeed On decidability and axiomatizability of some ordered structures. (English) Zbl 1418.03171 Soft Comput. 23, No. 11, 3615-3626 (2019). MSC: 03F30 03B25 03D35 PDF BibTeX XML Cite \textit{Z. Assadi} and \textit{S. Salehi}, Soft Comput. 23, No. 11, 3615--3626 (2019; Zbl 1418.03171) Full Text: DOI arXiv OpenURL
Bès, Alexis; Choffrut, Christian Complexity and (un)decidability of fragments of \(\langle \omega^{\omega^{\lambda}};\times\rangle\). (English) Zbl 1446.03028 Fundam. Inform. 164, No. 1, 1-15 (2019). MSC: 03B25 03D35 03D15 03E20 PDF BibTeX XML Cite \textit{A. Bès} and \textit{C. Choffrut}, Fundam. Inform. 164, No. 1, 1--15 (2019; Zbl 1446.03028) Full Text: DOI arXiv OpenURL