On the public citation graph
Ein System des Verknüpfenden Schliessens
0 signed · 56 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/bf01201353openalex-snapshot
Untersuchungen �ber das logische Schlie�en. I
inferredcites →https://doi.org/10.1007/bf01342849openalex-snapshot
Beweistheoretische Erfassung der unendlichen Induktion in der Zahlentheorie
inferredcites →https://doi.org/10.1007/bf01342950openalex-snapshot
Schlußweisen-Kalküle der Prädikatenlogik
inferredcites →https://doi.org/10.1007/bf01696781openalex-snapshot
Die Vollständigkeit der Axiome des logischen Funktionenkalküls
inferredcites →https://doi.org/10.2307/2266681openalex-snapshot
Algebraische und logistische Untersuchungen über freie Verbände
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/malq.19610070603openalex-snapshot
A Complete Set of Axioms for Logical Formulas Invalid in Some Finite Domain
inferred← citeshttps://doi.org/10.1002/malq.19610071705openalex-snapshot
The Calculus of Partial Predicates and Its Extension to Set Theory I
inferred← citeshttps://doi.org/10.1007/978-3-030-49424-7_13openalex-snapshot
From Schütte’s Formal Systems to Modern Automated Deduction
inferred← citeshttps://doi.org/10.1007/978-3-030-77799-9_4openalex-snapshot
Well-Ordering Principles in Proof Theory and Reverse Mathematics
inferred← citeshttps://doi.org/10.1007/978-3-031-51406-7_10openalex-snapshot
Assertion, Assumption, and Deduction
inferred← citeshttps://doi.org/10.1007/978-3-319-26506-3_5openalex-snapshot
On the Computational Meaning of Axioms
inferred← citeshttps://doi.org/10.1007/978-3-540-74565-5_2openalex-snapshot
Early History and Perspectives of Automated Deduction
inferred← citeshttps://doi.org/10.1007/978-3-642-02273-9_6openalex-snapshot
On the Meaning of Logical Completeness
inferred← citeshttps://doi.org/10.1007/978-3-642-81952-0_12openalex-snapshot
An Improved Proof Procedure
inferred← citeshttps://doi.org/10.1007/978-3-642-81952-0_13openalex-snapshot
A Mechanical Proof Procedure and its Realization in an Electronic Computer
inferred← citeshttps://doi.org/10.1007/978-3-642-81952-0_15openalex-snapshot
Toward Mechanical Mathematics
inferred← citeshttps://doi.org/10.1007/978-94-009-2356-0_14openalex-snapshot
Logical Fragments Relevant to Compter Science
inferred← citeshttps://doi.org/10.1007/978-94-009-5203-4_3openalex-snapshot
Relevance Logic and Entailment
inferred← citeshttps://doi.org/10.1007/978-94-009-7066-3_1openalex-snapshot
Elementary Predicate Logic
inferred← citeshttps://doi.org/10.1007/978-94-009-8356-4_10openalex-snapshot
Philosophical aspects of proof theory
inferred← citeshttps://doi.org/10.1007/978-94-010-0630-9_2openalex-snapshot
The Proof Theory of Stig Kanger: A Personal Recollection
inferred← citeshttps://doi.org/10.1007/978-94-010-0630-9_4openalex-snapshot
Kanger’s Choices in Automated Reasoning
inferred← citeshttps://doi.org/10.1007/978-94-015-9833-0_1openalex-snapshot
Elementary Predicate Logic
inferred← citeshttps://doi.org/10.1007/bf02007557openalex-snapshot
König's lemma, the ω-Rule and primitive recursive arithmetic
inferred← citeshttps://doi.org/10.1007/bfb0079559openalex-snapshot
Comments on gentzen-type procedures and the classical notion of truth
inferred← citeshttps://doi.org/10.1007/s00029-023-00879-2openalex-snapshot
Well ordering principles for iterated $$\Pi ^1_1$$-comprehension
inferred← citeshttps://doi.org/10.1007/s10649-008-9135-3openalex-snapshot
Centenary birth anniversary of E. W. Beth (1908–1964)
inferred← citeshttps://doi.org/10.1007/s10992-020-09572-7openalex-snapshot
De Finettian Logics of Indicative Conditionals Part II: Proof Theory and Algebraic Semantics
inferred← citeshttps://doi.org/10.1007/s11787-014-0097-1openalex-snapshot
Proofs and Countermodels in Non-Classical Logics
inferred← citeshttps://doi.org/10.1016/0004-3702(82)90011-xopenalex-snapshot
Completely non-clausal theorem proving
inferred← citeshttps://doi.org/10.1016/j.aim.2019.106767openalex-snapshot
Π11 -comprehension as a well-ordering principle
inferred← citeshttps://doi.org/10.1016/j.apal.2011.09.003openalex-snapshot
Algebraic proof theory for substructural logics: Cut-elimination and completions
inferred← citeshttps://doi.org/10.1016/s0049-237x(09)70458-6openalex-snapshot
Thirty Years of Foundational Studies Lectures on the Development of Mathematical Logic and the Study of the Foundations of Mathematics in 1930–1964
inferred← citeshttps://doi.org/10.1016/s0049-237x(09)70567-1openalex-snapshot
Symposium on the Notion of Recursiveness: The Theory of Hierarchies
inferred← citeshttps://doi.org/10.1016/s0049-237x(98)80016-5openalex-snapshot
An Introduction to Proof Theory
inferred← citeshttps://doi.org/10.1017/s175502031800031xopenalex-snapshot
GENERALITY AND EXISTENCE 1: QUANTIFICATION AND FREE LOGIC
inferred← citeshttps://doi.org/10.1080/11663081.2023.2244367openalex-snapshot
Sequent-type rejection systems for finite-valued non-deterministic logics
inferred← citeshttps://doi.org/10.1090/proc/15103openalex-snapshot
Set-theoretic reflection is equivalent to induction over well-founded classes
inferred← citeshttps://doi.org/10.1093/logcom/exaf082openalex-snapshot
Geometric theories in inquisitive modal logic
inferred← citeshttps://doi.org/10.1093/logcom/ext036openalex-snapshot
A cut-free sequent system for Grzegorczyk logic, with an application to the Gödel–McKinsey–Tarski embedding
inferred← citeshttps://doi.org/10.1109/ismvl.1996.508349openalex-snapshot
Intuitionistic counterparts of finitely-valued logics
inferred← citeshttps://doi.org/10.1111/j.1755-2567.1960.tb00558.xopenalex-snapshot
An improved proof procedure1
inferred← citeshttps://doi.org/10.1111/j.1755-2567.1967.tb00622.xopenalex-snapshot
Completeness and Hauptsatz for second order logic1
inferred← citeshttps://doi.org/10.1145/321021.321023openalex-snapshot
A Mechanical Proof Procedure and its Realization in an Electronic Computer
inferred← citeshttps://doi.org/10.1305/ndjfl/1093636762openalex-snapshot
Gentzen systems, resolution, and literal trees.
inferred← citeshttps://doi.org/10.1305/ndjfl/1093870576openalex-snapshot
Constructing sequent rules for generalized propositional logics.
inferred← citeshttps://doi.org/10.1305/ndjfl/1093891202openalex-snapshot
Completeness of relevant quantification theories.
inferred← citeshttps://doi.org/10.2307/2272730openalex-snapshot
Infinitary formulas preserved under unions of models
inferred← citeshttps://doi.org/10.2307/2963525openalex-snapshot
Syntactical and semantical properties of simple type theory
inferred← citeshttps://doi.org/10.4288/jafpos1956.5.135openalex-snapshot
A Bi-Modal Characterization of Epistemic Logic
inferred← citeshttps://doi.org/10.70675/ebffbe00z3617z41e5z91bfzd4ec1aa303afopenalex-snapshot
Le statut dynamique des axiomes : des preuves aux modèles
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.