Generic undecidability of universal theories

DOI10.33048/semi.2019.16.089zbMath1446.03075OpenAlexW3015705619MaRDI QIDQ2334766

Alexander N. Rybalov

Publication date: 7 November 2019

Published in: Sibirskie Èlektronnye Matematicheskie Izvestiya (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.33048/semi.2019.16.089

zbMATH Keywords

universal theorygeneric complexity

Mathematics Subject Classification ID

Undecidability and degrees of sets of sentences (03D35) Complexity of computation (including implicit computational complexity) (03D15)

Cites Work

• Unnamed Item
• Algebraic geometry over algebraic structures. III: Equationally Noetherian property and compactness
• Average-case complexity and decision problems in group theory.
• Generic-case complexity, decision problems in group theory, and random walks.
• The halting problem is decidable on a set of asymptotic probability one
• Generic complexity of undecidable problems

This page was built for publication: Generic undecidability of universal theories