Weak arithmetics
From MaRDI portal
Publication:5941252
DOI10.1016/S0304-3975(00)00106-7zbMath0969.68003OpenAlexW2913806581WikidataQ126372100 ScholiaQ126372100MaRDI QIDQ5941252
No author found.
Publication date: 20 August 2001
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0304-3975(00)00106-7
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Diophantine induction
- Saturation and stability in the theory of computation over the reals
- Maximal fields with valuations
- Two Applications of Logic to Mathematics
- On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
- Model completeness results for expansions of the ordered field of real numbers by restricted Pfaffian functions and the exponential function
- Computer science and the fine structure of Borel sets
This page was built for publication: Weak arithmetics