On the public citation graph
Effective operators in a topological setting
0 signed · 26 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/malq.19550010407openalex-snapshot
Effective operations on partial recursive functions
inferredcites →https://doi.org/10.1002/malq.19600061510openalex-snapshot
A Comparison of Five “Computable” Operators
inferredcites →https://doi.org/10.1002/malq.19710170127openalex-snapshot
On Effectively Computable Operators
inferredcites →https://doi.org/10.1007/bf02219096openalex-snapshot
Computable functionals of finite types
inferredcites →https://doi.org/10.1016/0304-3975(76)90029-3openalex-snapshot
Computability concepts for programming language semantics
inferredcites →https://doi.org/10.1090/s0002-9939-1968-0229519-5openalex-snapshot
An Effective Operator, Continuous but not Partial Recursive
inferredcites →https://doi.org/10.1093/comjnl/12.1.28openalex-snapshot
Theory of Recursive Functions and Effective Computability
inferredcites →https://doi.org/10.2307/2270370openalex-snapshot
Effective operations in a general setting
inferredcites →https://doi.org/10.2307/2273657openalex-snapshot
Discontinuities of provably correct operators on the provably recursive real numbers
inferredcites →https://doi.org/10.2307/2316720openalex-snapshot
Theory of Recursive Functions and Effective Computability.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/bfb0023898openalex-snapshot
Effective operators and continuity revisited
inferred← citeshttps://doi.org/10.1007/bfb0030292openalex-snapshot
Limits, higher type computability and type-free languages
inferred← citeshttps://doi.org/10.1007/bfb0086126openalex-snapshot
A characterization of effective topological spaces
inferred← citeshttps://doi.org/10.1016/0168-0072(88)90017-6openalex-snapshot
On church's formal theory of functions and functionals
inferred← citeshttps://doi.org/10.1016/0168-0072(93)90038-fopenalex-snapshot
Total sets and objects in domain theory
inferred← citeshttps://doi.org/10.1016/0168-0072(95)00067-4openalex-snapshot
Effective inseparability in a topological setting
inferred← citeshttps://doi.org/10.1016/j.entcs.2008.12.011openalex-snapshot
Towards Computability over Effectively Enumerable Topological Spaces
inferred← citeshttps://doi.org/10.1016/s0049-237x(98)80013-xopenalex-snapshot
Chapter 12 A bibliography of recursive analysis and recursive topology
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00319-4openalex-snapshot
Representations versus numberings: on the relationship of two computability notions
inferred← citeshttps://doi.org/10.1017/9781316755884.004openalex-snapshot
Notions of computability at higher types I
inferred← citeshttps://doi.org/10.25071/zbhh3j42openalex-snapshot
Bi-topological spaces and the Continuity Problem
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.