Fixed points on the real numbers without the equality test

DOI10.1016/S1571-0661(04)80382-7MaRDI QIDQ4916187zbMATH OpenOpenAlexFDO

Authors M. V. Korovina

Publication date 19 April 2013

Published in Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s1571-0661(04)80382-7

Mathematics Subject Classification ID

Computation over the reals, computable analysis (03D78) Constructive and recursive analysis (03F60) Fixed-point theorems (47H10)

Recommendations

• Gandy's theorem for abstract structures without the equality test
• Computer Science Logic
• Remarks on \(\Sigma\)-definability without the equality test over the reals
• On Σ‐definability without equality over the real numbers
• Discontinuities of provably correct operators on the provably recursive real numbers

Cites work

• Abstract First Order Computability. I
• Computational complexity of real functions
• scientific article; zbMATH DE number 3494394 (Why is no real title available?)
• scientific article; zbMATH DE number 1342214 (Why is no real title available?)
• scientific article; zbMATH DE number 1841818 (Why is no real title available?)
• scientific article; zbMATH DE number 934359 (Why is no real title available?)
• scientific article; zbMATH DE number 1390021 (Why is no real title available?)
• On the definitions of computable real continuous functions

Cited in

(3)

• Gandy's theorem for abstract structures without the equality test
• Remarks on \(\Sigma\)-definability without the equality test over the reals
• Computer Science Logic

This page was built for publication: Fixed points on the real numbers without the equality test

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4916187)