On the public citation graph

Controlling the dependence degree of a recursively enumerable vector space

0 signed · 55 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/malq.19790251908openalex-snapshot
Direct Summands of Recursively Enumerable Vector Spaces
inferredcites →https://doi.org/10.1007/978-3-642-85933-5openalex-snapshot
Combinatorial Functors
inferredcites →https://doi.org/10.1007/bfb0062858openalex-snapshot
Recursion theory and algebra
inferredcites →https://doi.org/10.1016/0003-4843(77)90015-8openalex-snapshot
Recursively enumerable vector spaces
inferredcites →https://doi.org/10.1017/s0022481200094342openalex-snapshot
Annals of mathematical logic
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.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/2269957openalex-snapshot
Countable vector spaces with recursive operations Part II
inferredcites →https://doi.org/10.2307/2271517openalex-snapshot
On strongly minimal 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/2272824openalex-snapshot
Simple and hyperhypersimple vector spaces
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.1002/malq.19840301903openalex-snapshot
SOME REMARKS ON A THEOREM OF IRAJ KALANTARI CONCERNING CONVEXITY AND RECURSION THEORY
inferred← citeshttps://doi.org/10.1002/malq.19840303002openalex-snapshot
A NOTE ON DECOMPOSITIONS OF RECURSIVELY ENUMERABLE SUBSPACES
inferred← citeshttps://doi.org/10.1002/malq.19860321304openalex-snapshot
Bases of Supermaximal Subspaces and Steinitz Systems II
inferred← citeshttps://doi.org/10.1007/s001530050168openalex-snapshot
A computably enumerable vector space with the strong antibasis property
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(89)90051-1openalex-snapshot
Classifications of degree classes associated with r.e. subspaces
inferred← citeshttps://doi.org/10.1016/0168-0072(93)90191-fopenalex-snapshot
Degrees of convex dependence in recursively enumerable vector spaces
inferred← citeshttps://doi.org/10.1016/j.apal.2004.06.007openalex-snapshot
Dependence relations in computably rigid computable vector spaces
inferred← citeshttps://doi.org/10.1016/j.jalgebra.2014.02.027openalex-snapshot
Infinite dimensional proper subspaces of computable vector spaces
inferred← citeshttps://doi.org/10.1016/j.jalgebra.2015.06.004openalex-snapshot
Independence in computable algebra
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)70960-1openalex-snapshot
Recursion Theory on Matroids II
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)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.1017/9781108525749openalex-snapshot
Computable Structure Theory
inferred← citeshttps://doi.org/10.1017/9781108525749.001openalex-snapshot
Preface
inferred← citeshttps://doi.org/10.1017/9781108525749.002openalex-snapshot
Structures
inferred← citeshttps://doi.org/10.1017/9781108525749.003openalex-snapshot
Relations
inferred← citeshttps://doi.org/10.1017/9781108525749.004openalex-snapshot
Existentially-Atomic Models
inferred← citeshttps://doi.org/10.1017/9781108525749.005openalex-snapshot
Generic Presentations
inferred← citeshttps://doi.org/10.1017/9781108525749.006openalex-snapshot
Degree Spectra
inferred← citeshttps://doi.org/10.1017/9781108525749.007openalex-snapshot
Comparing Structures and Classes of Structures
inferred← citeshttps://doi.org/10.1017/9781108525749.008openalex-snapshot
Finite-Injury Constructions
inferred← citeshttps://doi.org/10.1017/9781108525749.009openalex-snapshot
Computable Categoricity
inferred← citeshttps://doi.org/10.1017/9781108525749.010openalex-snapshot
The Jump of A Structure
inferred← citeshttps://doi.org/10.1017/9781108525749.011openalex-snapshot
Σ-Small Classes
inferred← citeshttps://doi.org/10.1017/9781108525749.012openalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1017/9781108525749.013openalex-snapshot
Index
inferred← citeshttps://doi.org/10.1017/bsl.2014.32openalex-snapshot
COMPUTABLE ABELIAN GROUPS
inferred← citeshttps://doi.org/10.1017/cbo9781107338579.006openalex-snapshot
Computable model theory
inferred← citeshttps://doi.org/10.1017/cbo9781139028592.002openalex-snapshot
Introduction
inferred← citeshttps://doi.org/10.1017/s1446788700024757openalex-snapshot
Nowhere simplicity in matroids
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.2178/bsl/1182353883openalex-snapshot
2001-2002 Winter Meeting of the Association for Symbolic Logic
inferred← citeshttps://doi.org/10.2307/2273553openalex-snapshot
R. e. presented linear orders
inferred← citeshttps://doi.org/10.2307/2273759openalex-snapshot
Recursively presented Abelian groups: Effective p-Group theory. I
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/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.