On the public citation graph

Computably Categorical Fields via Fermat’s Last Theorem

https://doi.org/10.3233/com-13017
0 signed · 37 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.19730191901openalex-snapshot
Theorie der Numerierungen I
inferredcites →https://doi.org/10.1006/jnth.1995.1085openalex-snapshot
Group of Automorphisms of the Fermat Curve
inferredcites →https://doi.org/10.1006/jnth.1996.0017openalex-snapshot
Über die Automorphismengruppe des Fermatkörpers
inferredcites →https://doi.org/10.1007/bf01668470openalex-snapshot
Autostability and computable families of constructivizations
inferredcites →https://doi.org/10.1007/bf01669102openalex-snapshot
Autostability of models
inferredcites →https://doi.org/10.1007/s00153-004-0219-1openalex-snapshot
The isomorphism problem for classes of computable fields
inferredcites →https://doi.org/10.1016/0003-4843(79)90011-1openalex-snapshot
Effective content of field theory
inferredcites →https://doi.org/10.1016/s0001-8708(02)00042-7openalex-snapshot
The computable dimension of ordered abelian groups
inferredcites →https://doi.org/10.1016/s0049-237x(99)80028-7openalex-snapshot
Computable Rings and Fields
inferredcites →https://doi.org/10.1017/cbo9780511526084openalex-snapshot
Prolegomena to a Middlebrow Arithmetic of Curves of Genus 2
inferredcites →https://doi.org/10.1017/cbo9780511565670.009openalex-snapshot
Effective Model Theory: The Number of Models and Their Complexity
inferredcites →https://doi.org/10.1023/a:1025971406116openalex-snapshot
Uniformity in Computable Structure Theory
inferredcites →https://doi.org/10.1090/s0002-9904-1978-14552-2openalex-snapshot
Recursively enumerable sets and degrees
inferredcites →https://doi.org/10.1090/s0002-9939-1981-0624937-1openalex-snapshot
Recursively Categorical Linear Orderings
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-2014-06093-5openalex-snapshot
Computable categoricity for algebraic fields with splitting algorithms
inferredcites →https://doi.org/10.1090/s0002-9947-2014-06094-7openalex-snapshot
Categoricity properties for computable algebraic fields
inferredcites →https://doi.org/10.1098/rsta.1956.0003openalex-snapshot
Effective procedures in field theory
inferredcites →https://doi.org/10.1353/ajm.2005.0037openalex-snapshot
Finiteness results for modular curves of genus at least 2
inferredcites →https://doi.org/10.1515/9783112342404-001openalex-snapshot
Grundzüge einer arithmetischen Theorie der algebraischen Grössen
inferredcites →https://doi.org/10.2178/jsl/1107298513openalex-snapshot
The computable dimension of trees of infinite height
inferredcites →https://doi.org/10.2178/jsl/1107298515openalex-snapshot
Computable categoricity of trees of finite height
inferredcites →https://doi.org/10.2178/jsl/1254748694openalex-snapshot
d-computable categoricity for algebraic fields
inferredcites →https://doi.org/10.2307/2273757openalex-snapshot
Recursive isomorphism types of recursive Boolean algebras
inferredcites →https://doi.org/10.4310/mrl.2005.v12.n4.a3openalex-snapshot
Unramified covers of Galois covers of low genus curves

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-3-030-22996-2_18openalex-snapshot
Degree Spectra for Transcendence in Fields
inferred← citeshttps://doi.org/10.1007/978-3-030-80049-9_31openalex-snapshot
Computable Procedures for Fields
inferred← citeshttps://doi.org/10.1007/s00153-016-0478-7openalex-snapshot
Computable dimension for ordered fields
inferred← citeshttps://doi.org/10.1007/s10469-012-9169-6openalex-snapshot
Computable dimensions of Pappusian and Desarguesian projective planes
inferred← citeshttps://doi.org/10.1007/s10958-021-05419-xopenalex-snapshot
Categoricity Spectra of Computable Structures
inferred← citeshttps://doi.org/10.1016/j.aim.2014.09.022openalex-snapshot
The complexity of computable categoricity
inferred← citeshttps://doi.org/10.1016/j.tcs.2017.01.029openalex-snapshot
Algebraic structures computable without delay
inferred← citeshttps://doi.org/10.1017/cbo9781107338579.006openalex-snapshot
Computable model theory
inferred← citeshttps://doi.org/10.1017/jsl.2017.50openalex-snapshot
A COMPUTABLE FUNCTOR FROM GRAPHS TO FIELDS
inferred← citeshttps://doi.org/10.1090/s0002-9947-2014-06093-5openalex-snapshot
Computable categoricity for algebraic fields with splitting algorithms
inferred← citeshttps://doi.org/10.1090/s0002-9947-2014-06094-7openalex-snapshot
Categoricity properties for computable algebraic fields
inferred← citeshttps://doi.org/10.2178/jsl/1254748694openalex-snapshot
d-computable categoricity for algebraic fields
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.