On the public citation graph
A characterization of effective topological spaces
0 signed · 67 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.19800263603openalex-snapshot
Konstruktive Darstellungen in Topologischen Räumen mit Rekursiver Basis
inferredcites →https://doi.org/10.1002/malq.19810272510openalex-snapshot
Berechenbarkeit in Topologischen Räumen Mit Rekursiver Basis
inferredcites →https://doi.org/10.1007/3-540-08860-1_33openalex-snapshot
Admissible coherent c.p.o.'s
inferredcites →https://doi.org/10.1007/3-540-09118-1_19openalex-snapshot
When are two effectively given domains identical?
inferredcites →https://doi.org/10.1007/3-540-09118-1_4openalex-snapshot
An algebraic theory for synchronization
inferredcites →https://doi.org/10.1007/3-540-10003-2_79openalex-snapshot
On observing nondeterminism and concurrency
inferredcites →https://doi.org/10.1007/3-540-10235-3openalex-snapshot
A Calculus of Communicating Systems
inferredcites →https://doi.org/10.1007/3-540-15670-4_17openalex-snapshot
Applications of topology to semantics of communicating processes
inferredcites →https://doi.org/10.1007/3-540-19020-1_12openalex-snapshot
Quasi-uniformities: Reconciling domains with metric spaces
inferredcites →https://doi.org/10.1007/3-540-19020-1_17openalex-snapshot
Metric spaces as models for real-time concurrency
inferredcites →https://doi.org/10.1007/978-3-642-67678-9openalex-snapshot
A Compendium of Continuous Lattices
inferredcites →https://doi.org/10.1007/978-94-009-7893-5_9openalex-snapshot
Lectures on a Mathematical Theory of Computation
inferredcites →https://doi.org/10.1007/978-94-010-2913-1_4openalex-snapshot
Computable Functionals of Finite Type
inferredcites →https://doi.org/10.1007/bf01410800openalex-snapshot
Relations between certain classes of effectively topological spaces
inferredcites →https://doi.org/10.1007/bfb0012801openalex-snapshot
Domains for denotational semantics
inferredcites →https://doi.org/10.1007/bfb0036946openalex-snapshot
Power domains and predicate transformers: A topological view
inferredcites →https://doi.org/10.1007/bfb0073961openalex-snapshot
Toposes, Algebraic Geometry and Logic
inferredcites →https://doi.org/10.1007/bfb0099496openalex-snapshot
Effective operators in a topological setting
inferredcites →https://doi.org/10.1016/0022-0000(89)90027-5openalex-snapshot
Solving reflexive domain equations in a category of complete metric spaces
inferredcites →https://doi.org/10.1016/0168-0072(84)90025-3openalex-snapshot
Effective topological spaces II: A hierarchy
inferredcites →https://doi.org/10.1016/0168-0072(85)90033-8openalex-snapshot
Effective topological spaces I: a definability theory
inferredcites →https://doi.org/10.1016/0168-0072(87)90009-1openalex-snapshot
Effective topological spaces III: Forcing and definability
inferredcites →https://doi.org/10.1016/0304-3975(76)90029-3openalex-snapshot
Computability concepts for programming language semantics
inferredcites →https://doi.org/10.1016/0304-3975(77)90045-7openalex-snapshot
Effectively given domains
inferredcites →https://doi.org/10.1016/j.entcs.2005.12.012openalex-snapshot
Formal Semantics of Programming Languages
inferredcites →https://doi.org/10.1016/s0019-9958(82)91250-5openalex-snapshot
Processes and the denotational semantics of concurrency
inferredcites →https://doi.org/10.1016/s0019-9958(83)80039-4openalex-snapshot
Connections between two theories of concurrency: Metric spaces and synchronization trees
inferredcites →https://doi.org/10.1016/s0049-237x(08)71358-2openalex-snapshot
Major Subsets in Effective Topology
inferredcites →https://doi.org/10.1016/s0049-237x(08)x7028-4openalex-snapshot
The Metamathematics of Algebraic Systems - Collected Papers: 1936–1967
inferredcites →https://doi.org/10.1016/s0049-237x(09)70356-8openalex-snapshot
Models for Various Type-Free Calculi
inferredcites →https://doi.org/10.1016/s0049-237x(09)70439-2openalex-snapshot
Model of Partial Continuous Functionals
inferredcites →https://doi.org/10.1017/s1446788700031402openalex-snapshot
Everywhere Nonrecursive r.e. Sets in Recursively Presented Topological Spaces
inferredcites →https://doi.org/10.1017/s1446788700031414openalex-snapshot
Non-Complemented Open Sets in Effective Topology
inferredcites →https://doi.org/10.1093/comjnl/12.1.28openalex-snapshot
Theory of Recursive Functions and Effective Computability
inferredcites →https://doi.org/10.1112/blms/4.2.238openalex-snapshot
THE METAMATHEMATICS OF ALGEBRAIC SYSTEMS
inferredcites →https://doi.org/10.1145/800133.804337openalex-snapshot
Computability theory in admissible domains
inferredcites →https://doi.org/10.1147/rd.255.0549openalex-snapshot
Formal Semantics of Programming Languages: VDL
inferredcites →https://doi.org/10.2307/2183047openalex-snapshot
Logic, Methodology and Philosophy of Science.
inferredcites →https://doi.org/10.2307/2273299openalex-snapshot
Recursive constructions in topological spaces
inferredcites →https://doi.org/10.2307/2273453openalex-snapshot
Degrees of recursively enumerable topological spaces
inferredcites →https://doi.org/10.2307/2275086openalex-snapshot
Steven Vickers. Topology via logic. Cambridge tracts in theoretical computer science, no. 5. Cambridge University Press, Cambridge etc. 1989, xiii + 200 pp.
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/s00153-004-0244-0openalex-snapshot
A blend of methods of recursion theory and topology: A Π10 tree of shadow points
inferred← citeshttps://doi.org/10.1016/0168-0072(95)00067-4openalex-snapshot
Effective inseparability in a topological setting
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/s0168-0072(03)00054-xopenalex-snapshot
A blend of methods of recursion theory and topology
inferred← citeshttps://doi.org/10.1016/s0168-0072(97)00058-4openalex-snapshot
Point-free topological spaces, functions and recursive points; filter foundation for recursive analysis. I
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80380-3openalex-snapshot
Recursive Quantum Functions, Avoidable Points, & Shadow Points in Recursive Analysis
inferred← citeshttps://doi.org/10.1017/jsl.2025.25openalex-snapshot
COUNTEREXAMPLES IN EFFECTIVE TOPOLOGY
inferred← citeshttps://doi.org/10.1023/b:simj.0000042483.60710.65openalex-snapshot
On Homeomorphisms of Effective Topological Spaces
inferred← citeshttps://doi.org/10.1090/proc/16797openalex-snapshot
Every Δ⁰₂ Polish space is computable topological
inferred← citeshttps://doi.org/10.1142/s0218196723500649openalex-snapshot
Separating notions in effective topology
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.