On the public citation graph
Theorems on Deducibility
0 signed · 25 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 points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-1-4612-0325-4_19openalex-snapshot
n-Recursive Linear Orders without (n+1)-Recursive Copies
inferred← citeshttps://doi.org/10.1007/978-3-030-56554-1openalex-snapshot
Decidability of Logical Theories and Their Combination
inferred← citeshttps://doi.org/10.1007/978-3-0348-9114-1_5openalex-snapshot
La Logique Mathématique en sa jeunesse
inferred← citeshttps://doi.org/10.1007/978-3-319-06686-8_3openalex-snapshot
The Lattice of Definability. Origins, Recent Developments, and Further Directions
inferred← citeshttps://doi.org/10.1007/978-94-007-0080-2_4openalex-snapshot
A Visit to Tarski’s Seminar on Elimination of Quantifiers
inferred← citeshttps://doi.org/10.1007/s10958-009-9399-xopenalex-snapshot
Nonmaximal decidable structures
inferred← citeshttps://doi.org/10.1016/0097-3165(76)90055-8openalex-snapshot
Fourier-Motzkin elimination extension to integer programming problems
inferred← citeshttps://doi.org/10.1016/0168-0072(86)90070-9openalex-snapshot
Recursive categoricity and recursive stability
inferred← citeshttps://doi.org/10.1016/j.exmath.2010.09.004openalex-snapshot
The axiomatics of ordered geometry
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)00281-8openalex-snapshot
On arithmetical first-order theories allowing encoding and decoding of lists
inferred← citeshttps://doi.org/10.1017/s0022481200028449openalex-snapshot
Decidable discrete linear orders
inferred← citeshttps://doi.org/10.1017/s0022481200028905openalex-snapshot
Alfred Tarski and decidable theories
inferred← citeshttps://doi.org/10.1080/01445340.2011.592261openalex-snapshot
Henry M. Sheffer and Notational Relativity
inferred← citeshttps://doi.org/10.1080/01445340310001599588openalex-snapshot
American Postulate Theorists and Alfred Tarski
inferred← citeshttps://doi.org/10.1090/s0002-9904-1928-04677-3openalex-snapshot
Thirty-seventh annual list of papers
inferred← citeshttps://doi.org/10.1134/s1064562423700370openalex-snapshot
The Lattice of Definability: Origins, Recent Developments, and Further Directions
inferred← citeshttps://doi.org/10.2178/bsl/1140640942openalex-snapshot
What is Tarski'sCommonConcept of Consequence?
inferred← citeshttps://doi.org/10.22405/2226-8383-2021-22-1-304-327openalex-snapshot
The lattice of definability. Origins and Directions of Research
inferred← citeshttps://doi.org/10.2307/421074openalex-snapshot
Address at the Princeton University Bicentennial Conference on Problems of Mathematics (December 17–19, 1946), By Alfred Tarski
inferred← citeshttps://doi.org/10.3390/philosophies8020022openalex-snapshot
Turing and Von Neumann: From Logic to the Computer
inferred← citeshttps://doi.org/10.48550/arxiv.1912.09155openalex-snapshot
Decidable Fragment of Theories in Field Arithmetic
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.