On the public citation graph
Computability-theoretic and proof-theoretic aspects of partial and linear orderings
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.
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.
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/978-94-009-7798-3_4openalex-snapshot
Linear Extensions of Ordered Sets
inferredcites →https://doi.org/10.1007/bf01456932openalex-snapshot
�ber unendliche diskontinuierliche Gruppen
inferredcites →https://doi.org/10.1016/0001-8708(91)90028-6openalex-snapshot
Orders: Description and roles
inferredcites →https://doi.org/10.1016/0003-4843(79)90011-1openalex-snapshot
Effective content of field theory
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/s0049-237x(08)71130-3openalex-snapshot
A Mathematical Incompleteness in Peano Arithmetic
inferredcites →https://doi.org/10.1016/s0049-237x(98)80047-5openalex-snapshot
Chapter 14 Computability theory and linear orderings
inferredcites →https://doi.org/10.1016/s0168-0072(97)00075-4openalex-snapshot
Extending partial orders to dense linear orders
inferredcites →https://doi.org/10.1016/s0304-0208(08)73836-2openalex-snapshot
Recursive Linear Orderings
inferredcites →https://doi.org/10.1090/conm/065/891251openalex-snapshot
The metamathematics of the graph minor theorem
inferredcites →https://doi.org/10.1090/s0002-9904-1978-14552-2openalex-snapshot
Recursively enumerable sets and degrees
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-1972-0316227-0openalex-snapshot
Π⁰₁ classes and degrees of theories
inferredcites →https://doi.org/10.1090/tranopenalex-snapshot
Transactions of the American Mathematical Society
inferredcites →https://doi.org/10.1098/rsta.1956.0003openalex-snapshot
Effective procedures in field theory
inferredcites →https://doi.org/10.2307/2272972openalex-snapshot
Ramsey's theorem and recursion theory
inferredcites →https://doi.org/10.2307/2316720openalex-snapshot
Theory of Recursive Functions and Effective Computability.
inferredcites →https://doi.org/10.2307/421140openalex-snapshot
Ordered Groups: A Case Study in Reverse Mathematics
inferredcites →https://doi.org/10.4064/fm-16-1-386-389openalex-snapshot
Sur l'extension de l'ordre partiel
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.201200025openalex-snapshot
Linear extensions of partial orders and reverse mathematics
inferred← citeshttps://doi.org/10.1007/978-3-031-36978-0_5openalex-snapshot
A Constructive Picture of Noetherian Conditions and Well Quasi-orders
inferred← citeshttps://doi.org/10.1007/978-3-319-50062-1_4openalex-snapshot
Some Questions in Computable Mathematics
inferred← citeshttps://doi.org/10.1007/s11083-006-9049-6openalex-snapshot
Countably Complementable Linear Orderings
inferred← citeshttps://doi.org/10.1007/s11083-007-9058-0openalex-snapshot
Computable Linearizations of Well-partial-orderings
inferred← citeshttps://doi.org/10.1016/j.apal.2005.03.001openalex-snapshot
Equivalence between Fraïssé’s conjecture and Jullien’s theorem
inferred← citeshttps://doi.org/10.1017/s144678870001586xopenalex-snapshot
Maximal compatible extensions of partial orders
inferred← citeshttps://doi.org/10.1305/ndjfl/1187031412openalex-snapshot
Interval Orders and Reverse Mathematics
inferred← citeshttps://doi.org/10.2178/bsl/1174668219openalex-snapshot
On the Equimorphism Types of Linear Orderings
inferred← citeshttps://doi.org/10.2178/bsl/1309952320openalex-snapshot
Open Questions in Reverse Mathematics
inferred← citeshttps://doi.org/10.2178/jsl/1096901762openalex-snapshot
Reverse mathematics and the equivalence of definitions for well and better quasi-orders
inferred← citeshttps://doi.org/10.2178/jsl/1120224717openalex-snapshot
Up to equimorphism, hyperarithmetic is recursive
inferred← citeshttps://doi.org/10.3233/com-12013openalex-snapshot
Computably Enumerable Partial Orders
inferred← citeshttps://doi.org/10.3233/com-170080openalex-snapshot
Linearisations and the Ershov hierarchy
inferred← citeshttps://doi.org/10.48550/arxiv.1110.4068openalex-snapshot
Computably enumerable partial orders
inferred← citeshttps://doi.org/10.48550/arxiv.1502.03618openalex-snapshot
Uniform and nonstandard existence in Reverse Mathematics
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.