On the public citation graph

Recursion theory and algebra

0 signed · 60 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.1007/978-3-642-85933-5openalex-snapshot
Combinatorial Functors
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.2307/1970338openalex-snapshot
Extensions to Isols
inferredcites →https://doi.org/10.2307/1970579openalex-snapshot
On Some Games Which Are Relevant to the Theory of Recursively Enumerable Sets
inferredcites →https://doi.org/10.2307/2269957openalex-snapshot
Countable vector spaces with recursive operations Part II
inferredcites →https://doi.org/10.2307/2270903openalex-snapshot
Countable vector spaces with recursive operations Part I1
inferredcites →https://doi.org/10.2307/2272643openalex-snapshot
Recursively presentable prime models

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.19840301903openalex-snapshot
SOME REMARKS ON A THEOREM OF IRAJ KALANTARI CONCERNING CONVEXITY AND RECURSION THEORY
inferred← citeshttps://doi.org/10.1002/malq.19870330409openalex-snapshot
Automorphisms and Recursive Structures
inferred← citeshttps://doi.org/10.1007/978-1-4612-0325-4_13openalex-snapshot
Recursive Properties of Intervals of Recursive Linear Orders
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/bf00370340openalex-snapshot
The given
inferred← citeshttps://doi.org/10.1016/0003-4843(77)90015-8openalex-snapshot
Recursively enumerable vector spaces
inferred← citeshttps://doi.org/10.1016/0003-4843(78)90027-xopenalex-snapshot
Recursively enumerable Boolean algebras
inferred← citeshttps://doi.org/10.1016/0003-4843(78)90030-xopenalex-snapshot
Foundations of recursive model theory
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/0165-4896(88)90002-9openalex-snapshot
Lower bounds on degrees of game-theoretic structures
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)90041-2openalex-snapshot
Undecidability of L(F∞) and other lattices of r.e. substructures
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(87)90063-7openalex-snapshot
The undecidability of the lattice of R.E. closed subsets of an effective topological space
inferred← citeshttps://doi.org/10.1016/0168-0072(87)90083-2openalex-snapshot
Maximal theories
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(93)90191-fopenalex-snapshot
Degrees of convex dependence in recursively enumerable 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.tcs.2025.115457openalex-snapshot
Computable formal contexts
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(09)70136-3openalex-snapshot
Algebraic Number Theory, A Survey
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)80002-5openalex-snapshot
Chapter 1 Pure computable model theory
inferred← citeshttps://doi.org/10.1016/s0049-237x(98)80003-7openalex-snapshot
Chapter 2 Elementary theories and their constructive models
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)80046-3openalex-snapshot
Chapter 13 Π10 classes in mathematics
inferred← citeshttps://doi.org/10.1016/s0049-237x(98)80047-5openalex-snapshot
Chapter 14 Computability theory and linear orderings
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/s0168-0072(97)00059-6openalex-snapshot
Computable isomorphisms, degree spectra of relations, and Scott families
inferred← citeshttps://doi.org/10.1017/s0022481200051185openalex-snapshot
Co-hypersimple structures
inferred← citeshttps://doi.org/10.1017/s1446788700031402openalex-snapshot
Everywhere Nonrecursive r.e. Sets in Recursively Presented Topological Spaces
inferred← citeshttps://doi.org/10.1090/s0002-9947-06-03984-5openalex-snapshot
Invariance in ℰ* and ℰ_{Π}
inferred← citeshttps://doi.org/10.1090/s0002-9947-1981-0628446-xopenalex-snapshot
An Effective Version of Dilworth's Theorem
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/2271869openalex-snapshot
Maximal vector spaces under automorphisms of the lattice of recursively enumerable vector spaces
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/2272868openalex-snapshot
Maximal and Cohesive vector spaces
inferred← citeshttps://doi.org/10.2307/2273123openalex-snapshot
A complete, decidable theory with two decidable models
inferred← citeshttps://doi.org/10.2307/2273131openalex-snapshot
Recursion theory on orderings. I. A model theoretic setting
inferred← citeshttps://doi.org/10.2307/2273292openalex-snapshot
R-maximal Boolean algebras
inferred← citeshttps://doi.org/10.2307/2273299openalex-snapshot
Recursive constructions in topological spaces
inferred← citeshttps://doi.org/10.2307/2273326openalex-snapshot
Maximality in effective topology
inferred← citeshttps://doi.org/10.2307/2273390openalex-snapshot
Simplicity in effective topology
inferred← citeshttps://doi.org/10.2307/2273453openalex-snapshot
Degrees of recursively enumerable topological spaces
inferred← citeshttps://doi.org/10.2307/2273759openalex-snapshot
Recursively presented Abelian groups: Effective p-Group theory. I
inferred← citeshttps://doi.org/10.2307/2275438openalex-snapshot
Recursion theory in a lower semilattice
inferred← citeshttps://doi.org/10.3390/math13030337openalex-snapshot
Computably Enumerable Semisimple Rings
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.