On the public citation graph
A simplified formalization of predicate logic with identity
0 signed · 49 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/bf01969434openalex-snapshot
On Tarski's formalization of predicate logic with identity
inferredcites →https://doi.org/10.1007/bf01969435openalex-snapshot
Substitutionless predicate logic with identity
inferredcites →https://doi.org/10.1007/bf01977152openalex-snapshot
Remarks on descriptions and natural deduction
inferredcites →https://doi.org/10.1007/bf01988048openalex-snapshot
Remarks on descriptions and natural deduction
inferredcites →https://doi.org/10.1201/b13782-17openalex-snapshot
An Introduction to Mathematical Logic
inferredcites →https://doi.org/10.2307/2267044openalex-snapshot
The completeness of the first-order functional calculus
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11828563_19openalex-snapshot
Algebraization of Hybrid Logic with Binders
inferred← citeshttps://doi.org/10.1007/3-540-44802-0_2openalex-snapshot
Applications of Alfred Tarski’s Ideas in Database Theory
inferred← citeshttps://doi.org/10.1007/978-1-4684-9452-5_11openalex-snapshot
Syntactics of First-order Languages
inferred← citeshttps://doi.org/10.1007/978-3-030-71430-7_3openalex-snapshot
Tarskian Classical Relevant Logic
inferred← citeshttps://doi.org/10.1007/978-94-009-1575-6_1openalex-snapshot
On Axiomatizing Free Logic — and Inclusive Logic in the Bargain
inferred← citeshttps://doi.org/10.1007/bf01531022openalex-snapshot
The Kreisel length-of-proof problem
inferred← citeshttps://doi.org/10.1007/bf01969434openalex-snapshot
On Tarski's formalization of predicate logic with identity
inferred← citeshttps://doi.org/10.1007/bf01969435openalex-snapshot
Substitutionless predicate logic with identity
inferred← citeshttps://doi.org/10.1007/bf02483729openalex-snapshot
Boolean combinations of monadic formulas
inferred← citeshttps://doi.org/10.1007/s10817-006-9062-xopenalex-snapshot
The Calculus of Relations as a Foundation for Mathematics
inferred← citeshttps://doi.org/10.1007/s11225-005-8477-4openalex-snapshot
Socratic Proofs and Paraconsistency: A Case Study
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.1007/s11229-004-3383-2openalex-snapshot
A Measurement Theoretic Account of Propositions
inferred← citeshttps://doi.org/10.1016/0168-0072(91)90015-eopenalex-snapshot
A unification-theoretic method for investigating the k-provability problem
inferred← citeshttps://doi.org/10.1016/j.entcs.2005.12.086openalex-snapshot
What is algebraic in process theory?
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)71214-xopenalex-snapshot
Leibniz on Possible Worlds
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)71988-8openalex-snapshot
The Elementary Theory of Well-Odering—A Metamathematical Study—
inferred← citeshttps://doi.org/10.1016/s1385-7258(65)50049-4openalex-snapshot
Interpretability in Terms of Models1)1)This paper, which reports a talk given before the Euratom workgroup in Amsterdam in the fall of 1962, was prepared partly at the University of Amsterdam under Euratom Contract No. 010–60–12 and partly under United States National Science Foundation Grant No.…
inferred← citeshttps://doi.org/10.1023/a:1014815703989openalex-snapshot
Measurement Theoretic Semantics And The Semantics Of Necessity
inferred← citeshttps://doi.org/10.1023/a:1020895422437openalex-snapshot
Holism, Language Acquisition, and Algebraic Logic
inferred← citeshttps://doi.org/10.1090/s0002-9947-1964-0163837-5openalex-snapshot
Singulary cylindric and polyadic equality algebras
inferred← citeshttps://doi.org/10.1093/mind/fzad009openalex-snapshot
The Adoption Problem and the Epistemology of Logic
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.1515/ling-2021-0159openalex-snapshot
Light heads and predicate formation: on two scopes of discontinuity
inferred← citeshttps://doi.org/10.2178/bsl/1182353893openalex-snapshot
Provability with Finitely Many Variables
inferred← citeshttps://doi.org/10.2178/jsl/1190150037openalex-snapshot
Relation algebra reducts of cylindric algebras and an application to proof theory
inferred← citeshttps://doi.org/10.2307/2214703openalex-snapshot
Some Remarks on Second Order Logic with Existence Attributes
inferred← citeshttps://doi.org/10.2307/2269874openalex-snapshot
On Meyer and Lambert's quantificational calculus FQ
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.