On the public citation graph
Maximal vector spaces under automorphisms of the lattice of recursively enumerable vector spaces
0 signed · 52 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.1090/s0002-9904-1926-04156-2openalex-snapshot
The Colloquium publications
inferredcites →https://doi.org/10.1090/s0002-9904-1944-08111-1openalex-snapshot
Recursively enumerable sets of positive integers and their decision problems
inferredcites →https://doi.org/10.1090/s0002-9947-1960-0113807-4openalex-snapshot
Computable Algebra, General Theory and Theory of Computable Fields
inferredcites →https://doi.org/10.1090/s0002-9947-1968-0227009-1openalex-snapshot
On the Lattice of Recursively Enumerable Sets
inferredcites →https://doi.org/10.1093/comjnl/12.1.28openalex-snapshot
Theory of Recursive Functions and Effective Computability
inferredcites →https://doi.org/10.1098/rsta.1956.0003openalex-snapshot
Effective procedures in field theory
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/2269957openalex-snapshot
Countable vector spaces with recursive operations Part II
inferredcites →https://doi.org/10.2307/2316720openalex-snapshot
Theory of Recursive Functions and Effective Computability.
inferredcites →https://doi.org/10.2307/2964290openalex-snapshot
Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication
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.19790251908openalex-snapshot
Direct Summands of Recursively Enumerable Vector Spaces
inferred← citeshttps://doi.org/10.1002/malq.19790252502openalex-snapshot
Automorphisms of the Lattice of Recursively Enumerable Vector Spaces
inferred← citeshttps://doi.org/10.1002/malq.19850311302openalex-snapshot
Effective Extensions of Linear Forms on a Recursive Vector Space Over a Recursive Field
inferred← citeshttps://doi.org/10.1002/malq.19860321304openalex-snapshot
Bases of Supermaximal Subspaces and Steinitz Systems II
inferred← citeshttps://doi.org/10.1007/3-540-36169-3_20openalex-snapshot
On the Learnability of Vector Spaces
inferred← citeshttps://doi.org/10.1007/978-1-4020-6127-1_2openalex-snapshot
Inductive Inference Systems for Learning Classes of Algorithmically Generated Sets and Structures
inferred← citeshttps://doi.org/10.1007/978-1-4612-3466-1_17openalex-snapshot
Complexity-Theoretic Algebra: Vector Space Bases
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/978-3-642-27654-5_10openalex-snapshot
Learning Families of Closed Sets in Matroids
inferred← citeshttps://doi.org/10.1007/s10469-016-9366-9openalex-snapshot
Orbits of Maximal Vector Spaces
inferred← citeshttps://doi.org/10.1016/0003-4843(80)90016-9openalex-snapshot
Recursion theory on algebraic structures with independent sets
inferred← citeshttps://doi.org/10.1016/0021-8693(80)90237-9openalex-snapshot
Recursion theory on fields and abstract dependence
inferred← citeshttps://doi.org/10.1016/0168-0072(83)90053-2openalex-snapshot
Automorphisms of substructure lattices in recursive algebra
inferred← citeshttps://doi.org/10.1016/0168-0072(84)90037-xopenalex-snapshot
A note on r-maximal subspaces of V∞
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(89)90047-xopenalex-snapshot
Complexity-theoretic algebra II: Boolean algebras
inferred← citeshttps://doi.org/10.1016/0168-0072(93)90150-copenalex-snapshot
Recursive properties of relations on models
inferred← citeshttps://doi.org/10.1016/0168-0072(94)90008-6openalex-snapshot
On speedable and levelable vector spaces
inferred← citeshttps://doi.org/10.1016/0168-0072(95)00051-8openalex-snapshot
On the lattices of NP-subspaces of a polynomial time vector space over a finite field
inferred← citeshttps://doi.org/10.1016/j.jcss.2006.09.001openalex-snapshot
On the learnability of vector spaces
inferred← citeshttps://doi.org/10.1016/s0049-237x(98)80001-3openalex-snapshot
Introduction to the handbook of Recursive Mathematics
inferred← citeshttps://doi.org/10.1016/s0049-237x(98)80011-6openalex-snapshot
Chapter 10 Complexity theoretic model theory and algebra
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/s0049-237x(98)80045-1openalex-snapshot
Introduction to the handbook of recursive mathematics
inferred← citeshttps://doi.org/10.1016/s0049-237x(98)80048-7openalex-snapshot
Chapter 15 Computable algebras and closure systems: Coding properties
inferred← citeshttps://doi.org/10.1016/s0049-237x(99)80028-7openalex-snapshot
Computable Rings and Fields
inferred← citeshttps://doi.org/10.1090/s0002-9939-1987-0866455-7openalex-snapshot
Orbits of Creative Subspaces
inferred← citeshttps://doi.org/10.1090/s0002-9947-1987-0891641-4openalex-snapshot
Degrees of splittings and bases of recursively enumerable subspaces
inferred← citeshttps://doi.org/10.2307/2271945openalex-snapshot
Controlling the dependence degree of a recursively enumerable vector space
inferred← citeshttps://doi.org/10.2307/2272824openalex-snapshot
Simple and hyperhypersimple vector spaces
inferred← citeshttps://doi.org/10.2307/2273233openalex-snapshot
Effective aspects of profinite groups
inferred← citeshttps://doi.org/10.2307/2273299openalex-snapshot
Recursive constructions in topological spaces
inferred← citeshttps://doi.org/10.2307/2273351openalex-snapshot
On r.e. and co-r.e. vector spaces with nonextendible bases
inferred← citeshttps://doi.org/10.2307/2273519openalex-snapshot
A r-maximal vector space not contained in any maximal vector space
inferred← citeshttps://doi.org/10.2307/2273783openalex-snapshot
Automorphisms of supermaximal subspaces
inferred← citeshttps://doi.org/10.2307/2274184openalex-snapshot
Co-immune subspaces and complementation inV∞
inferred← citeshttps://doi.org/10.2307/2274265openalex-snapshot
The universal complementation property
inferred← citeshttps://doi.org/10.2307/2274266openalex-snapshot
Decidable subspaces and recursively enumerable subspaces
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.