On the public citation graph

Effectively extensible theories

0 signed · 39 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.19550010205openalex-snapshot
Creative sets
inferredcites →https://doi.org/10.1007/bf01974157openalex-snapshot
Representability of recursively enumerable sets in formal theories
inferredcites →https://doi.org/10.1090/s0002-9904-1965-11325-8openalex-snapshot
“Recursive isomorphism” and effectively extensible theories
inferredcites →https://doi.org/10.1090/s0002-9904-1967-11689-6openalex-snapshot
Deduction-preserving “recursive isomorphisms” between theories
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.1090/s0002-9947-1951-0043046-1openalex-snapshot
Arithmetic Translations of Axiom Systems
inferredcites →https://doi.org/10.1515/9781400882007-002openalex-snapshot
ANNALS OF MATHEMATICS STUDIES
inferredcites →https://doi.org/10.2307/2964178openalex-snapshot
Degrees of unsolvability associated with classes of formalized theories
inferredcites →https://doi.org/10.4064/fm-49-1-35-92openalex-snapshot
Arithmetization of metamathematics in a general setting

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.19710170148openalex-snapshot
Rekursive Untrennbarkeit Bei Elementaren Theorien
inferred← citeshttps://doi.org/10.1007/978-1-4684-9452-5_16openalex-snapshot
General Theory of Undecidability
inferred← citeshttps://doi.org/10.1007/s00153-009-0161-3openalex-snapshot
Effectively inseparable Boolean algebras in lattices of sentences
inferred← citeshttps://doi.org/10.1007/s00153-024-00911-yopenalex-snapshot
Essential hereditary undecidability
inferred← citeshttps://doi.org/10.1016/0003-4843(82)90009-2openalex-snapshot
The Boolean algebra of formulas of first-order logic
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)70025-9openalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1017/bsl.2024.26openalex-snapshot
POUR-EL’S LANDSCAPE
inferred← citeshttps://doi.org/10.1090/s0273-0979-1981-14863-1openalex-snapshot
Strong reducibilities
inferred← citeshttps://doi.org/10.1093/logcom/exs073openalex-snapshot
A Tribute to Marian Boykan Pour-El (1928–2009)
inferred← citeshttps://doi.org/10.1093/oso/9780195082326.001.0001openalex-snapshot
Recursion Theory for Metamathematics
inferred← citeshttps://doi.org/10.1093/oso/9780195082326.002.0001openalex-snapshot
Title Pages
inferred← citeshttps://doi.org/10.1093/oso/9780195082326.002.0002openalex-snapshot
Dedication
inferred← citeshttps://doi.org/10.1093/oso/9780195082326.002.0003openalex-snapshot
Preface
inferred← citeshttps://doi.org/10.1093/oso/9780195082326.003.0004openalex-snapshot
Prerequisites
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.0007openalex-snapshot
Indexing
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.1111/j.1746-8361.1970.tb01219.xopenalex-snapshot
A Recursion-Theoretic View of Axiomatizable Theories
inferred← citeshttps://doi.org/10.1215/00294527-2023-0017openalex-snapshot
There Are No Minimal Effectively Inseparable Theories
inferred← citeshttps://doi.org/10.2307/2270853openalex-snapshot
Effectively retractable theories and degrees of undecidability
inferred← citeshttps://doi.org/10.36253/979-12-215-0778-2.05openalex-snapshot
Abstract views of incompleteness
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.