On the public citation graph

Ordered Groups: A Case Study in Reverse Mathematics

0 signed · 31 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-59971-2openalex-snapshot
Subsystems of Second Order Arithmetic
inferredcites →https://doi.org/10.1007/978-3-662-02460-7openalex-snapshot
Recursively Enumerable Sets and Degrees
inferredcites →https://doi.org/10.1007/bf01630810openalex-snapshot
Algebraic disguises ofΣ 1 0 induction
inferredcites →https://doi.org/10.1016/0003-4843(79)90011-1openalex-snapshot
Effective content of field theory
inferredcites →https://doi.org/10.1016/0021-8693(91)90221-sopenalex-snapshot
The algorithmic theory of polycyclic-by-finite groups
inferredcites →https://doi.org/10.1016/0168-0072(83)90012-xopenalex-snapshot
Countable algebra and set existence axioms11Research partially supported by NSF grants MCS-79-23743, MCS-78-02558, and MCS 8107867. Simpson's research was also supported by an Alfred P. Sloan Research Fellowship.
inferredcites →https://doi.org/10.1016/0168-0072(86)90049-7openalex-snapshot
Recursion theory and ordered groups
inferredcites →https://doi.org/10.1016/0168-0072(86)90066-7openalex-snapshot
Which set existence axioms are needed to prove the separable Hahn-Banach theorem?
inferredcites →https://doi.org/10.1016/0168-0072(90)90014-sopenalex-snapshot
Weak comparability of well orderings and reverse mathematics
inferredcites →https://doi.org/10.1016/0168-0072(94)90076-0openalex-snapshot
Reverse mathematics and ordinal exponentiation
inferredcites →https://doi.org/10.1017/s0022481200028309openalex-snapshot
Partial realizations of Hilbert's program
inferredcites →https://doi.org/10.1017/s0022481200028310openalex-snapshot
Hilbert's program relativized; Proof-theoretical and foundational reductions
inferredcites →https://doi.org/10.1017/s0305004100035520openalex-snapshot
Construction of orders in Abelian groups
inferredcites →https://doi.org/10.1090/conm/106/1057821openalex-snapshot
𝑊𝐾𝐿₀ and orderings of countable abelian groups
inferredcites →https://doi.org/10.1090/pspum/042/791071openalex-snapshot
Reverse mathematics
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.1305/ndjfl/1039293061openalex-snapshot
Reverse Mathematics and Fully Ordered Groups
inferredcites →https://doi.org/10.2307/1996261openalex-snapshot
∏ 0 1 Classes and Degrees of Theories
inferredcites →https://doi.org/10.2307/2274131openalex-snapshot
Which set existence axioms are needed to prove the Cauchy/Peano theorem for ordinary differential equations?
inferredcites →https://doi.org/10.4064/fm-46-2-167-174openalex-snapshot
Note on ordered groups and rings

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/bf02783429openalex-snapshot
Computability-theoretic and proof-theoretic aspects of partial and linear orderings
inferred← citeshttps://doi.org/10.1007/s00153-023-00885-3openalex-snapshot
Structure of semisimple rings in reverse and computable mathematics
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.1017/9781316755846.008openalex-snapshot
Reverse mathematics, Archimedean classes, and Hahn's Theorem
inferred← citeshttps://doi.org/10.1023/a:1022878003199openalex-snapshot
Group Theoretic Properties of the Group of Computable Automorphisms of a Countable Dense Linear Order
inferred← citeshttps://doi.org/10.1090/noti1727openalex-snapshot
Population cycles in discrete-time infectious disease models
inferred← citeshttps://doi.org/10.1090/noti1728openalex-snapshot
Finite Free Complexes over Polynomial Rings
inferred← citeshttps://doi.org/10.1090/noti1732openalex-snapshot
Reverse Mathematics
inferred← citeshttps://doi.org/10.1109/synasc.2013.55openalex-snapshot
Algebraic Properties of Generalized Multisets
inferred← citeshttps://doi.org/10.1142/s0218196714500118openalex-snapshot
The complexity of ascendant sequences in locally nilpotent groups
inferred← citeshttps://doi.org/10.2307/2694917openalex-snapshot
– CA0 and order types of countable ordered groups
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.