Mathematical Logic Quarterly 45 (4):481-496 (1999)

For semi-continuous real functions we study different computability concepts defined via computability of epigraphs and hypographs. We call a real function f lower semi-computable of type one, if its open hypograph hypo is recursively enumerably open in dom × ℝ; we call f lower semi-computable of type two, if its closed epigraph Epi is recursively enumerably closed in dom × ℝ; we call f lower semi-computable of type three, if Epi is recursively closed in dom × ℝ. We show that type one and type two semi-computability are independent and that type three semi-computability plus effectively uniform continuity implies computability, which is false for type one and type two instead of type three. We show also that the integral of a type three semi-computable real function on a computable interval is not necessarily computable
Keywords Semi‐continuous function  Computable analysis  Semi‐computable function
Categories (categorize this paper)
DOI 10.1002/malq.19990450407
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

PhilArchive copy

Upload a copy of this paper     Check publisher's policy     Papers currently archived: 71,410
External links

Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library

References found in this work BETA

Theory of Recursive Functions and Effective Computability.Hartley Rogers - 1971 - Journal of Symbolic Logic 36 (1):141-146.
Computable Functionals.A. Grzegorczyk - 1959 - Journal of Symbolic Logic 24 (1):50-51.

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles


Added to PP index

Total views
10 ( #903,420 of 2,519,808 )

Recent downloads (6 months)
1 ( #406,314 of 2,519,808 )

How can I increase my downloads?


My notes