On the public citation graph

On Tarski's formalization of predicate logic with identity

https://doi.org/10.1007/bf01969434
0 signed · 40 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.1007/bf01972461openalex-snapshot
A simplified formalization of predicate logic with identity
inferredcites →https://doi.org/10.1201/b13782-17openalex-snapshot
An Introduction to Mathematical Logic
inferredcites →https://doi.org/10.2307/2266682openalex-snapshot
On the rules of proof in the pure functional calculus of the first order
inferredcites →https://doi.org/10.2307/2268615openalex-snapshot
Quantification and the empty domain

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-3-031-42034-4_3openalex-snapshot
Rudiments of First-Order Logic (FO)
inferred← citeshttps://doi.org/10.1007/978-94-009-4552-4_9openalex-snapshot
Frege, Russell and Logicism: A Logical Reconstruction
inferred← citeshttps://doi.org/10.1007/978-94-009-7066-3_2openalex-snapshot
Systems of Deduction
inferred← citeshttps://doi.org/10.1007/978-94-017-0452-6_1openalex-snapshot
Systems of Deduction
inferred← citeshttps://doi.org/10.1007/bf01969435openalex-snapshot
Substitutionless predicate logic with identity
inferred← citeshttps://doi.org/10.1007/bf01972461openalex-snapshot
A simplified formalization of predicate logic with identity
inferred← citeshttps://doi.org/10.1007/bf01982052openalex-snapshot
Open formulas and the empty domain
inferred← citeshttps://doi.org/10.1007/s11225-014-9591-yopenalex-snapshot
Two Views of the Logic of Plurals and a Reduction of One to the Other
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)71214-xopenalex-snapshot
Leibniz on Possible Worlds
inferred← citeshttps://doi.org/10.1017/s0022481200028917openalex-snapshot
Alfred Tarski's work on general metamathematics
inferred← citeshttps://doi.org/10.1090/s0002-9939-1971-0276063-5openalex-snapshot
Provability with Finitely Many Variables
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.1145/3426471openalex-snapshot
α β-Relations and the Actual Meaning of α-Renaming
inferred← citeshttps://doi.org/10.1305/ndjfl/1040149359openalex-snapshot
A Finitely Axiomatized Formalization of Predicate Calculus with Equality
inferred← citeshttps://doi.org/10.1305/ndjfl/1093882806openalex-snapshot
Generalization in first-order logic.
inferred← citeshttps://doi.org/10.1305/ndjfl/1093882936openalex-snapshot
A realist semantics for Cocchiarella's ${\bf T}^\ast$.
inferred← citeshttps://doi.org/10.1305/ndjfl/1093893584openalex-snapshot
A substitution free axiom set for second order logic.
inferred← citeshttps://doi.org/10.2307/2214703openalex-snapshot
Some Remarks on Second Order Logic with Existence Attributes
inferred← citeshttps://doi.org/10.2307/2270518openalex-snapshot
Nonstandard theories of quantification and identity
inferred← citeshttps://doi.org/10.48550/arxiv.1903.06775openalex-snapshot
Lambda Congruences and Extensionality
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.