Limit, logic, and computation

DOI10.1073/pnas.95.1.95zbMath0891.68041OpenAlexW2099791628WikidataQ35668479 ScholiaQ35668479MaRDI QIDQ4378032

Michael Hartley Freedman

Publication date: 13 July 1998

Published in: Proceedings of the National Academy of Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1073/pnas.95.1.95

zbMATH Keywords

decidabilityultrafilter limits

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Related Items (2)

Predecessor existence problems for finite discrete dynamical systems ⋮ Boolean formulae, hypergraphs and combinatorial topology

Cites Work

• Groups of polynomial growth and expanding maps. Appendix by Jacques Tits
• The complexity of Presburger arithmetic with bounded quantifier alternation depth

This page was built for publication: Limit, logic, and computation