On the public citation graph

On the learnability of vector spaces

0 signed · 44 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.1006/jcss.1995.1066openalex-snapshot
Language Learning with Some Negative Information
inferredcites →https://doi.org/10.1006/jcss.1998.1568openalex-snapshot
A Note on Batch and Incremental Learnability
inferredcites →https://doi.org/10.1007/3-540-08353-7openalex-snapshot
Mathematical Foundations of Computer Science 1977
inferredcites →https://doi.org/10.1007/3-540-08353-7_182openalex-snapshot
Identification of formal languages
inferredcites →https://doi.org/10.1007/3-540-49730-7_24openalex-snapshot
Learning Algebraic Structures from Text Using Semantical Knowledge
inferredcites →https://doi.org/10.1016/0003-4843(77)90015-8openalex-snapshot
Recursively enumerable vector spaces
inferredcites →https://doi.org/10.1016/0020-0190(91)90176-iopenalex-snapshot
Inductive inference from all positive and some negative data
inferredcites →https://doi.org/10.1016/0020-0190(93)90229-3openalex-snapshot
On the non-existence of maximal inference degrees for language identification
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(93)90150-copenalex-snapshot
Recursive properties of relations on models
inferredcites →https://doi.org/10.1016/0168-0072(94)90035-3openalex-snapshot
Extremes in the degrees of inferability
inferredcites →https://doi.org/10.1016/0378-4754(79)90040-5openalex-snapshot
An introduction to the general theory of algorithms
inferredcites →https://doi.org/10.1016/0890-5401(87)90052-6openalex-snapshot
Learning regular sets from queries and counterexamples
inferredcites →https://doi.org/10.1016/s0019-9958(67)91165-5openalex-snapshot
Language identification in the limit
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(98)80048-7openalex-snapshot
Chapter 15 Computable algebras and closure systems: Coding properties
inferredcites →https://doi.org/10.1016/s0049-237x(99)x8037-2openalex-snapshot
Classical Recursion Theory
inferredcites →https://doi.org/10.1016/s0304-3975(00)00272-3openalex-snapshot
Learning algebraic structures from text
inferredcites →https://doi.org/10.1016/s0304-3975(02)00422-xopenalex-snapshot
Refuting learning revisited
inferredcites →https://doi.org/10.1016/s0890-5401(03)00082-8openalex-snapshot
Learning by switching type of information
inferredcites →https://doi.org/10.1090/s0002-9904-1978-14552-2openalex-snapshot
Recursively enumerable sets and degrees
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/25.6.611openalex-snapshot
CLASSICAL RECURSION THEORY
inferredcites →https://doi.org/10.1215/s0012-7094-65-03247-3openalex-snapshot
Three theorems on the degrees of recursively enumerable sets
inferredcites →https://doi.org/10.2178/jsl/1183743737openalex-snapshot
Inductive Inference and Unsolvability
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/2273783openalex-snapshot
Automorphisms of supermaximal subspaces
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/978-1-4020-6127-1_1openalex-snapshot
Introduction to the Philosophy and Mathematics of Algorithmic Learning Theory
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-3-031-08740-0_1openalex-snapshot
Calculating the Mind Change Complexity of Learning Algebraic Structures
inferred← citeshttps://doi.org/10.1007/978-3-031-64309-5_14openalex-snapshot
Learning Families of Algebraic Structures from Text
inferred← citeshttps://doi.org/10.1007/978-3-031-95908-0_11openalex-snapshot
On Learning Existentially Definable Subsets in a Computable Structure
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/978-981-97-2340-9_1openalex-snapshot
On Learning Families of Ideals in Lattices and Boolean Algebras
inferred← citeshttps://doi.org/10.1007/s00153-015-0445-8openalex-snapshot
PAC learning, VC dimension, and the arithmetic hierarchy
inferred← citeshttps://doi.org/10.1007/s00224-024-10201-yopenalex-snapshot
On learning down-sets in quasi-orders, and ideals in Boolean algebras
inferred← citeshttps://doi.org/10.1016/j.apal.2025.103648openalex-snapshot
Classifying different criteria for learning algebraic structures
inferred← citeshttps://doi.org/10.1016/j.ic.2020.104590openalex-snapshot
Learning families of algebraic structures from informant
inferred← citeshttps://doi.org/10.1016/j.ic.2025.105381openalex-snapshot
Syntactic characterization of learnability of structures with mind changes
inferred← citeshttps://doi.org/10.1016/j.tcs.2023.113762openalex-snapshot
Learning algebraic structures with the help of Borel equivalence relations
inferred← citeshttps://doi.org/10.1093/logcom/exab044openalex-snapshot
On the Turing complexity of learning finite families of algebraic structures
inferred← citeshttps://doi.org/10.1134/s1995080224601334openalex-snapshot
On Learning for Families of Algebraic Structures
inferred← citeshttps://doi.org/10.48550/arxiv.1406.1111openalex-snapshot
PAC Learning, VC Dimension, and the Arithmetic Hierarchy
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.