Feedback on the Current Page
Published in: LIPIcs, Volume 228, 7th International Conference on Formal Structures for Computation and Deduction (FSCD 2022)
Fabian Mitterwallner and Aart Middeldorp. Polynomial Termination Over ℕ Is Undecidable. In 7th International Conference on Formal Structures for Computation and Deduction (FSCD 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 228, pp. 27:1-27:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{mitterwallner_et_al:LIPIcs.FSCD.2022.27,
author = {Mitterwallner, Fabian and Middeldorp, Aart},
title = {{Polynomial Termination Over \mathbb{N} Is Undecidable}},
booktitle = {7th International Conference on Formal Structures for Computation and Deduction (FSCD 2022)},
pages = {27:1--27:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-233-4},
ISSN = {1868-8969},
year = {2022},
volume = {228},
editor = {Felty, Amy P.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSCD.2022.27},
URN = {urn:nbn:de:0030-drops-163081},
doi = {10.4230/LIPIcs.FSCD.2022.27},
annote = {Keywords: Term Rewriting, Polynomial Termination, Undecidability}
}