Hidden verification for computational mathematics
From MaRDI portal
Publication:2456559
DOI10.1016/j.jsc.2004.12.005zbMath1126.68103OpenAlexW2038078711WikidataQ55393280 ScholiaQ55393280MaRDI QIDQ2456559
Hanne Gottliebsen, Tom Kelsey, Ursula Martin Webb
Publication date: 19 October 2007
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jsc.2004.12.005
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (2)
A bi-directional extensible interface between Lean and Mathematica ⋮ A Hoare logic for linear systems
Uses Software
Cites Work
- Analytica --- an experiment in combining theorem proving and symbolic computation
- Symbolic integration. I: Transcendental functions
- Nonlinear control system design by quantifier elimination
- Equality in computer algebra and beyond.
- Theorem proving in higher order logics. 13th international conference, TPHOLs 2000, Portland, OR, USA, August 14--18, 2000. Proceedings
- OpenMath
- Some undecidable problems involving elementary functions of a real variable
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Hidden verification for computational mathematics
