On the public citation graph
Automorphisms of supermaximal subspaces
0 signed · 39 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.19660120125openalex-snapshot
Classes of Recursively Enumerable Sets and Degrees of Unsolvability
inferredcites →https://doi.org/10.1002/malq.19830290605openalex-snapshot
ON A QUESTION OF A. RETZLAFF
inferredcites →https://doi.org/10.1016/0003-4843(77)90015-8openalex-snapshot
Recursively enumerable vector spaces
inferredcites →https://doi.org/10.1016/0021-8693(80)90237-9openalex-snapshot
Recursion theory on fields and abstract dependence
inferredcites →https://doi.org/10.1016/0168-0072(83)90053-2openalex-snapshot
Automorphisms of substructure lattices in recursive algebra
inferredcites →https://doi.org/10.1016/s0049-237x(08)70960-1openalex-snapshot
Recursion Theory on Matroids II
inferredcites →https://doi.org/10.1016/s0049-237x(08)71357-0openalex-snapshot
Recursion Theory and Abstract Dependence
inferredcites →https://doi.org/10.1215/ijm/1256050747openalex-snapshot
A lattice property of post's simple set
inferredcites →https://doi.org/10.2307/1970842openalex-snapshot
Automorphisms of the Lattice of Recursively Enumerable Sets Part I: Maximal Sets
inferredcites →https://doi.org/10.2307/2271869openalex-snapshot
Maximal vector spaces under automorphisms of the lattice of recursively enumerable vector spaces
inferredcites →https://doi.org/10.2307/2273351openalex-snapshot
On r.e. and co-r.e. vector spaces with nonextendible bases
inferredcites →https://doi.org/10.2307/2274266openalex-snapshot
Decidable subspaces and recursively enumerable subspaces
inferredcites →https://doi.org/10.2307/2274267openalex-snapshot
Bases of supermaximal subspaces and Steinitz systems. I
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/malq.19860321304openalex-snapshot
Bases of Supermaximal Subspaces and Steinitz Systems II
inferred← citeshttps://doi.org/10.1002/malq.19870330409openalex-snapshot
Automorphisms and Recursive Structures
inferred← citeshttps://doi.org/10.1007/3-540-36169-3_20openalex-snapshot
On the Learnability of Vector Spaces
inferred← citeshttps://doi.org/10.1007/3-540-57601-0_41openalex-snapshot
The shape of complex systems
inferred← citeshttps://doi.org/10.1007/978-1-4612-0325-4_1openalex-snapshot
The Work of Anil Nerode: A Retrospective
inferred← citeshttps://doi.org/10.1007/978-3-319-50062-1openalex-snapshot
Computability and Complexity
inferred← citeshttps://doi.org/10.1007/978-3-319-50062-1_23openalex-snapshot
The Lattice of Computably Enumerable Vector Spaces
inferred← citeshttps://doi.org/10.1007/s10469-016-9366-9openalex-snapshot
Orbits of Maximal Vector Spaces
inferred← citeshttps://doi.org/10.1016/0022-4049(87)90055-7openalex-snapshot
On completeness of locally-internal categories
inferred← citeshttps://doi.org/10.1016/0022-4049(89)90057-1openalex-snapshot
The calculus of ends over a base topos
inferred← citeshttps://doi.org/10.1016/0168-0072(86)90049-7openalex-snapshot
Recursion theory and ordered groups
inferred← citeshttps://doi.org/10.1016/0168-0072(86)90060-6openalex-snapshot
Sound, totally sound, and unsound recursive equivalence types
inferred← citeshttps://doi.org/10.1016/0168-0072(86)90073-4openalex-snapshot
Generic objects in recursion theory II: Operations on recursive approximation spaces
inferred← citeshttps://doi.org/10.1016/0168-0072(93)90150-copenalex-snapshot
Recursive properties of relations on models
inferred← citeshttps://doi.org/10.1016/b978-0-934613-32-3.50012-5openalex-snapshot
A Note on Non-Monotonic Reasoning
inferred← citeshttps://doi.org/10.1016/j.jcss.2006.09.001openalex-snapshot
On the learnability of vector spaces
inferred← citeshttps://doi.org/10.1016/s0022-4049(99)00189-9openalex-snapshot
Descent theory of locally internal categories
inferred← citeshttps://doi.org/10.1016/s0049-237x(98)80012-8openalex-snapshot
Chapter 11 A bibliography of recursive algebra and recursive model theory
inferred← citeshttps://doi.org/10.1016/s0168-0072(97)00010-9openalex-snapshot
Quasi-simple relations in copies of a given recursive structure
inferred← citeshttps://doi.org/10.1080/11663081.1997.10510902openalex-snapshot
Minimal and consistent evolution of knowledge bases
inferred← citeshttps://doi.org/10.1090/s0002-9939-1987-0866455-7openalex-snapshot
Orbits of Creative Subspaces
inferred← citeshttps://doi.org/10.2307/2274265openalex-snapshot
The universal complementation property
inferred← citeshttps://doi.org/10.2307/2274267openalex-snapshot
Bases of supermaximal subspaces and Steinitz systems. I
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.