On the public citation graph

On natural deduction

https://doi.org/10.2307/2266969
0 signed · 29 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/bf01201353openalex-snapshot
Untersuchungen �ber das logische Schlie�en. I
inferredcites →https://doi.org/10.1007/bf01201363openalex-snapshot
Untersuchungen �ber das logische Schlie�en. II
inferredcites →https://doi.org/10.1007/bf01696781openalex-snapshot
Die Vollständigkeit der Axiome des logischen Funktionenkalküls
inferredcites →https://doi.org/10.2307/2017713openalex-snapshot
A Primer of Formal Logic.

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/11853886_7openalex-snapshot
Natural Deduction Calculus for Linear-Time Temporal Logic
inferred← citeshttps://doi.org/10.1007/3-540-63045-7_26openalex-snapshot
Existential instantiation and strong normalization
inferred← citeshttps://doi.org/10.1007/978-3-031-75387-9_11openalex-snapshot
Intersymbolic AI
inferred← citeshttps://doi.org/10.1007/978-3-476-98727-3_4openalex-snapshot
K
inferred← citeshttps://doi.org/10.1007/978-3-642-22221-4_3openalex-snapshot
Polarized Classical Non-associative Lambek Calculus and Formal Semantics
inferred← citeshttps://doi.org/10.1007/978-94-009-5044-3_2openalex-snapshot
Theoretical Issues of Logic Programming
inferred← citeshttps://doi.org/10.1007/bf00542649openalex-snapshot
Natural deduction and arbitrary objects
inferred← citeshttps://doi.org/10.1007/bf01969992openalex-snapshot
Die Soundness des Prädikatenkalküls auf der Basis der Quineschen Regeln
inferred← citeshttps://doi.org/10.1007/bf02025802openalex-snapshot
Eine Bemerkung über den Kalkül des natürlichen Schließens
inferred← citeshttps://doi.org/10.1007/bfb0027402openalex-snapshot
Three faces of natural deduction
inferred← citeshttps://doi.org/10.1007/s11229-023-04276-2openalex-snapshot
A classical first-order normalization procedure with $$\forall $$ and $$\exists $$ based on the Milne–Kürbis approach
inferred← citeshttps://doi.org/10.1016/b978-0-444-52937-4.50007-1openalex-snapshot
A History of Natural Deduction
inferred← citeshttps://doi.org/10.1016/b978-044450813-3/50017-5openalex-snapshot
Classical Type Theory
inferred← citeshttps://doi.org/10.1016/s0049-237x(09)70304-0openalex-snapshot
On Denumerable Bases of Formal Systems
inferred← citeshttps://doi.org/10.1080/01445340.2021.1889117openalex-snapshot
The Deduction Theorem (Before and After Herbrand)
inferred← citeshttps://doi.org/10.1080/01445340.2026.2696138openalex-snapshot
On the Graphical Representation of Proofs as Trees
inferred← citeshttps://doi.org/10.1080/014453499298165openalex-snapshot
A Brief History of Natural Deduction
inferred← citeshttps://doi.org/10.1109/jva.2006.34openalex-snapshot
Natural Deduction Calculus for Computation Tree Logic
inferred← citeshttps://doi.org/10.1109/ssiri-c.2011.41openalex-snapshot
Handling Periodic Properties: Deductive Verification for Quantified Temporal Logic Specifications
inferred← citeshttps://doi.org/10.1109/time.2007.41openalex-snapshot
Automated Natural Deduction for Propositional Linear-Time Temporal Logic
inferred← citeshttps://doi.org/10.1515/jisys-2011-0021openalex-snapshot
Natural Deduction System in Paraconsistent Setting: Proof Search for PCont
inferred← citeshttps://doi.org/10.2307/2268486openalex-snapshot
Another variant of natural deduction
inferred← citeshttps://doi.org/10.2307/2964055openalex-snapshot
A theory of restricted quantification I
inferred← citeshttps://doi.org/10.2307/421152openalex-snapshot
1996–97 Annual Meeting of the Association for Symbolic Logic
inferred← citeshttps://doi.org/10.4018/978-1-60566-810-9.ch001openalex-snapshot
Knowledge in the Psychology of Thinking and Mathematics
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.