On the public citation graph
On the algebraization of a Feferman's predicate
0 signed · 26 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/bf02121661openalex-snapshot
Representation and duality theory for diagonalizable algebras
inferredcites →https://doi.org/10.1007/bf02123401openalex-snapshot
The uniqueness of the fixed-point in every diagonalizable algebra
inferredcites →https://doi.org/10.1007/bf02123402openalex-snapshot
An effective fixed-point theorem in intuitionistic diagonalizable algebras
inferredcites →https://doi.org/10.1007/bf02125226openalex-snapshot
The fixed-point theorem for diagonalizable algebras
inferredcites →https://doi.org/10.1007/bf02925653openalex-snapshot
Problemi aperti sulle algebre diagonali
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.1007/978-0-8176-4769-8_9openalex-snapshot
The Development of Self-Reference: Löb’s Theorem
inferred← citeshttps://doi.org/10.1007/978-3-319-77434-3_9openalex-snapshot
Logics of (Formal and Informal) Provability
inferred← citeshttps://doi.org/10.1007/bf01837553openalex-snapshot
On the relation provable equivalence and on partitions in effectively inseparable sets
inferred← citeshttps://doi.org/10.1007/s00153-017-0557-4openalex-snapshot
Interpretability suprema in Peano Arithmetic
inferred← citeshttps://doi.org/10.1007/s00500-016-2449-7openalex-snapshot
Franco Montagna (1948–2015)
inferred← citeshttps://doi.org/10.1007/s11225-016-9654-3openalex-snapshot
Franco Montagna’s Work on Provability Logic and Many-valued Logic
inferred← citeshttps://doi.org/10.1007/s11225-017-9735-yopenalex-snapshot
Arithmetical Completeness Theorem for Modal Logic $$\mathsf{K}$$
inferred← citeshttps://doi.org/10.1007/s11225-017-9782-4openalex-snapshot
Arithmetical Soundness and Completeness for $$\varvec{\Sigma }_{\varvec{2}}$$ Numerations
inferred← citeshttps://doi.org/10.1007/s11225-019-09865-2openalex-snapshot
Rosser Provability and Normal Modal Logics
inferred← citeshttps://doi.org/10.1016/j.apal.2015.11.002openalex-snapshot
Transductions in arithmetic
inferred← citeshttps://doi.org/10.1017/s1755020319000248openalex-snapshot
ANOTHER LOOK AT THE SECOND INCOMPLETENESS THEOREM
inferred← citeshttps://doi.org/10.1215/00294527-2798754openalex-snapshot
Uniform Density in Lindenbaum Algebras
inferred← citeshttps://doi.org/10.1305/ndjfl/1093635077openalex-snapshot
Peano's smart children: a provability logical study of systems with built-in consistency.
inferred← citeshttps://doi.org/10.4213/rm1401openalex-snapshot
Схемы рефлексии и алгебры доказуемости в формальной арифметике
inferred← citeshttps://doi.org/10.48550/arxiv.1804.07465openalex-snapshot
The Absorption Law, or How to Kreisel a Hilbert-Bernays-Löb
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.