×

Found 1,526 Documents (Results 1–100)

Equivalents of the Riemann hypothesis. Volume 3. Further steps towards resolving the Riemann hypothesis. (English) Zbl 07720285

Encyclopedia of Mathematics and its Applications 187. Cambridge: Cambridge University Press (ISBN 978-1-00-938480-3/hbk; 978-1-00-938478-0/ebook). xx, 684 p. (2024).
PDFBibTeX XMLCite
Full Text: DOI

Undecidability of the submonoid membership problem for free nilpotent group of class \(l\geqslant 2\) of sufficiently large rank. (English. Russian original) Zbl 07773487

Izv. Math. 87, No. 4, 798-816 (2023); translation from Izv. Ross. Akad. Nauk, Ser. Mat. 87, No. 4, 166-185 (2023).
PDFBibTeX XMLCite
Full Text: DOI MNR

Polynomial termination over \(\mathbb{N}\) is undecidable. (English) Zbl 07853733

Felty, Amy P. (ed.), 7th international conference on formal structures for computation and deduction, FSCD 2022, Haifa, Israel, August 2–5, 2022. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 228, Article 27, 17 p. (2022).
MSC:  03B70 68Qxx
PDFBibTeX XMLCite
Full Text: DOI

Constructive many-one reduction from the halting problem to semi-unification. (English) Zbl 07830374

Manea, Florin (ed.) et al., 30th EACSL annual conference on computer science logic, CSL 2022, Göttingen, Germany, virtual conference, February 14–19, 2022. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 216, Article 18, 19 p. (2022).
MSC:  03B70
PDFBibTeX XMLCite
Full Text: DOI

A strong version of Cobham’s theorem. (English) Zbl 07774408

Leonardi, Stefano (ed.) et al., Proceedings of the 54th annual ACM SIGACT symposium on theory of computing, STOC ’22, Rome, Italy June 20–24, 2022. New York, NY: Association for Computing Machinery (ACM). 1172-1179 (2022).
MSC:  68Qxx
PDFBibTeX XMLCite
Full Text: DOI arXiv

On the coprimeness relation from the viewpoint of monadic second-order logic. (English. Russian original) Zbl 07733645

Izv. Math. 86, No. 6, 1225-1239 (2022); translation from Izv. Ross. Akad. Nauk, Ser. Mat. 86, No. 6, 207-222 (2022).
MSC:  03F35 03D55 03D35
PDFBibTeX XMLCite
Full Text: DOI MNR

Synthetic undecidability of MSELL via FRACTRAN mechanised in Coq. (English) Zbl 07700623

Kobayashi, Naoki (ed.), 6th international conference on formal structures for computation and deduction, FSCD 2021, Buenos Aires, Argentina, virtual conference, July 17–24, 2021. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 195, Article 18, 20 p. (2021).
MSC:  03B70 68Qxx
PDFBibTeX XMLCite
Full Text: DOI

Synthetic undecidability and incompleteness of first-order axiom systems in Ccoq. (English) Zbl 07699440

Cohen, Liron (ed.) et al., 12th international conference on interactive theorem proving, ITP 2021, Rome, Italy, virtual conference, June 29 – July 1, 2021. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 193, Article 23, 20 p. (2021).
MSC:  68V15
PDFBibTeX XMLCite
Full Text: DOI

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
PDFBibTeX XMLCite
Full Text: DOI

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).
PDFBibTeX XMLCite
Full Text: DOI

A note on \(\mathbb{C}^2\) interpreted over finite data-words. (English) Zbl 1530.03049

Muñoz-Velasco, Emilio (ed.) et al., 27th international symposium on temporal representation and reasoning. TIME 2020, September 23–25, 2020, Bozen-Bolzano, Italy. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 178, Article 17, 14 p. (2020).
MSC:  03B25 03B44 68Q25
PDFBibTeX XMLCite
Full Text: DOI

Domino problem under horizontal constraints. (English) Zbl 07650911

Paul, Christophe (ed.) et al., 37th international symposium on theoretical aspects of computer science, STACS 2020, Montpellier, France, March 10–13, 2020. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 154, Article 26, 15 p. (2020).
MSC:  68Qxx
PDFBibTeX XMLCite
Full Text: DOI

Toward a general complexity theory of motion planning: characterizing which gadgets make games hard. (English) Zbl 07650410

Vidick, Thomas (ed.), 11th innovations in theoretical computer science conference, ITCS 2020, Seattle, Washington, USA, January 12–14, 2020. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 151, Article 62, 42 p. (2020).
MSC:  68Qxx
PDFBibTeX XMLCite
Full Text: DOI arXiv

Trakhtenbrot’s theorem in Coq. A constructive approach to finite model theory. (English) Zbl 07614663

Peltier, Nicolas (ed.) et al., Automated reasoning. 10th international joint conference, IJCAR 2020, Paris, France, July 1–4, 2020. Proceedings. Part II. Cham: Springer. Lect. Notes Comput. Sci. 12167, 79-96 (2020).
MSC:  68V15
PDFBibTeX XMLCite
Full Text: DOI arXiv

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 03D15
PDFBibTeX XMLCite

Filter Results by …

Document Type

Database

all top 5

Author

all top 5

Serial

all top 5

Year of Publication

all top 3

Main Field

all top 3

Software