Logic for Gray-code computation
DOI10.1515/9781501502620-005zbMATH Open1433.03120OpenAlexW2500726595MaRDI QIDQ5221791FDOQ5221791
Authors: Ulrich Berger, Kenji Miyamoto, Helmut Schwichtenberg, Hideki Tsuiki
Publication date: 3 April 2020
Published in: Concepts of Proof in Mathematics, Philosophy, and Computer Science (Search for Journal in Brave)
Full work available at URL: https://cronfa.swan.ac.uk/Record/cronfa28978
Recommendations
Computation over the reals, computable analysis (03D78) Mechanization of proofs and logical operations (03B35) Logic in computer science (03B70) Constructive and recursive analysis (03F60)
Cited In (10)
- Mathematical logic: proof theory, constructive mathematics. Abstracts from the workshop held November 5--11, 2017
- Mathematical logic: proof theory, constructive mathematics. Abstracts from the workshop held November 8--14, 2020 (hybrid meeting)
- Computational Interpretations of Classical Reasoning: From the Epsilon Calculus to Stateful Programs
- Program Extraction from Proofs: The Fan Theorem for Uniformly Coconvex Bars
- Real number computation through Gray code embedding.
- A note on two's company: ``The humbug of many logical values
- Lookahead analysis in exact real arithmetic with logical methods
- Intuitionistic fixed point logic
- Title not available (Why is that?)
- Title not available (Why is that?)
This page was built for publication: Logic for Gray-code computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5221791)