Logic for Gray-code computation

DOI10.1515/9781501502620-005MaRDI QIDQ5221791zbMATHOpenAlexFDO

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

zbMATH Keywords

real number computationprogram extractionGray-codeinductive and coinductive definitions

Mathematics Subject Classification ID

Computation over the reals, computable analysis (03D78) Mechanization of proofs and logical operations (03B35) Logic in computer science (03B70) Constructive and recursive analysis (03F60)

Recommendations

• Real number computation through Gray code embedding.
• scientific article; zbMATH DE number 1933234
• scientific article; zbMATH DE number 4087600
• A coinductive approach to computing with compact sets
• Real number computation with committed choice logic programming languages

Cited in

(10)

• Mathematical logic: proof theory, constructive mathematics. Abstracts from the workshop held November 8--14, 2020 (hybrid meeting)
• Mathematical logic: proof theory, constructive mathematics. Abstracts from the workshop held November 5--11, 2017
• scientific article; zbMATH DE number 7731929 (Why is no real title available?)
• scientific article; zbMATH DE number 7350773 (Why is no real title available?)
• Real number computation through Gray code embedding.
• A note on two's company: ``The humbug of many logical values
• Computational interpretations of classical reasoning: from the epsilon calculus to stateful programs
• Program extraction from proofs: the fan theorem for uniformly coconvex bars
• Lookahead analysis in exact real arithmetic with logical methods
• Intuitionistic fixed point logic

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)