On the public citation graph
Representability of recursively enumerable sets in formal theories
0 signed · 47 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.1002/malq.19580040705openalex-snapshot
Undecidability and recursive inseparability
inferredcites →https://doi.org/10.1007/bf01977641openalex-snapshot
Representability op recursively enumerable sets in formal theories
inferredcites →https://doi.org/10.1016/s0049-237x(09)70462-8openalex-snapshot
The Classical and The ω-Complete Arithmetic
inferredcites →https://doi.org/10.1090/s0002-9939-1960-0120150-1openalex-snapshot
Exact Separation of Recursively Enumerable Sets Within Theories
inferredcites →https://doi.org/10.2307/2964061openalex-snapshot
John Myhill. Creative sets. Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 1 (1955), pp. 97–108.
inferredcites →https://doi.org/10.2307/2964398openalex-snapshot
The classical and the ω-complete arithmetic
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.19710170133openalex-snapshot
Non‐Effectiveness in S. Orey's Arithmetical Compactness Theorem
inferred← citeshttps://doi.org/10.1002/malq.19710170148openalex-snapshot
Rekursive Untrennbarkeit Bei Elementaren Theorien
inferred← citeshttps://doi.org/10.1007/978-94-009-6259-0_9openalex-snapshot
Modal Logic and Self-Reference
inferred← citeshttps://doi.org/10.1007/bf00970389openalex-snapshot
Computability of partial functions and enumerability of sets in Peano's arithmetic
inferred← citeshttps://doi.org/10.1007/bf02023013openalex-snapshot
Variants of Robinson's essentially undecidable theoryR
inferred← citeshttps://doi.org/10.1007/s001530050042openalex-snapshot
An algebraic treatment of quantifier-free systems of arithmetic
inferred← citeshttps://doi.org/10.1007/s11225-023-10045-6openalex-snapshot
Some Observations on the FGH Theorem
inferred← citeshttps://doi.org/10.1016/0020-0255(69)90016-4openalex-snapshot
Strong representability of partial functions in arithmetic theories
inferred← citeshttps://doi.org/10.1016/s0049-237x(09)70278-2openalex-snapshot
Representability of Sets in Formal Systems
inferred← citeshttps://doi.org/10.1016/s0049-237x(09)70566-xopenalex-snapshot
On a Theorem of Cobham Concerning Undecidable Theories
inferred← citeshttps://doi.org/10.1017/s1755020321000307openalex-snapshot
HIERARCHICAL INCOMPLETENESS RESULTS FOR ARITHMETICALLY DEFINABLE EXTENSIONS OF FRAGMENTS OF ARITHMETIC
inferred← citeshttps://doi.org/10.1090/s0002-9939-1967-0230617-xopenalex-snapshot
Representability of Partial Recursive Functions in Formal Theories
inferred← citeshttps://doi.org/10.1090/s0002-9939-1978-0476452-6openalex-snapshot
Avoiding self-referential statements
inferred← citeshttps://doi.org/10.1090/s0002-9947-1965-0195724-1openalex-snapshot
On Creative Sets and Indices of Partial Recursive Functions
inferred← citeshttps://doi.org/10.1093/jigpal/jzac054openalex-snapshot
The early history of formal diagonalization
inferred← citeshttps://doi.org/10.1093/oso/9780195082326.001.0001openalex-snapshot
Recursion Theory for Metamathematics
inferred← citeshttps://doi.org/10.1093/oso/9780195082326.003.0005openalex-snapshot
Recursive Enumerability and Recursivity
inferred← citeshttps://doi.org/10.1093/oso/9780195082326.003.0006openalex-snapshot
Undecidability and Recursive Inseparability
inferred← citeshttps://doi.org/10.1093/oso/9780195082326.003.0008openalex-snapshot
Generative Sets and Creative Systems
inferred← citeshttps://doi.org/10.1093/oso/9780195082326.003.0009openalex-snapshot
Double Generativity and Complete Effective
inferred← citeshttps://doi.org/10.1093/oso/9780195082326.003.0010openalex-snapshot
Universal and Doubly Universal Systems
inferred← citeshttps://doi.org/10.1093/oso/9780195082326.003.0011openalex-snapshot
Shepherdson Revisited
inferred← citeshttps://doi.org/10.1093/oso/9780195082326.003.0012openalex-snapshot
Recursion Theorems
inferred← citeshttps://doi.org/10.1093/oso/9780195082326.003.0013openalex-snapshot
Symmetric and Double Recursion Theorems
inferred← citeshttps://doi.org/10.1093/oso/9780195082326.003.0014openalex-snapshot
Productivity and Double Productivity
inferred← citeshttps://doi.org/10.1093/oso/9780195082326.003.0015openalex-snapshot
Three Special Topics
inferred← citeshttps://doi.org/10.1093/oso/9780195082326.003.0016openalex-snapshot
Uniform Gödelization
inferred← citeshttps://doi.org/10.1305/ndjfl/1093883515openalex-snapshot
Fifty years of self-reference in arithmetic.
inferred← citeshttps://doi.org/10.2307/2273625openalex-snapshot
Calculating self-referential statements: Guaspari sentences of the first kind
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.