On the public citation graph

Generalized rules for quantifiers and the completeness of the intuitionistic operators &, ν, ⊃, λ, ∀, ε

https://doi.org/10.1007/bfb0099494
0 signed · 37 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/10992.1573-0433openalex-snapshot
Journal of Philosophical Logic
inferredcites →https://doi.org/10.1007/978-3-642-94780-3openalex-snapshot
Mathematische Gesetze der Logik I
inferredcites →https://doi.org/10.1007/978-3-662-01539-1openalex-snapshot
Einführung in die Operative Logik und Mathematik
inferredcites →https://doi.org/10.1007/bf00245941openalex-snapshot
The adequacy problem for inferential logic
inferredcites →https://doi.org/10.1007/bf01201353openalex-snapshot
Untersuchungen �ber das logische Schlie�en. I
inferredcites →https://doi.org/10.1007/bf01969697openalex-snapshot
Ein verallgemeinerter Widerlegungsbegriff für Gentzenkalküle
inferredcites →https://doi.org/10.1007/bf02126736openalex-snapshot
On proper quantifiers I
inferredcites →https://doi.org/10.1016/0003-4843(82)90003-1openalex-snapshot
Recursive models for constructive set theories
inferredcites →https://doi.org/10.1016/s0049-237x(09)70361-1openalex-snapshot
Towards A Foundation of A General Proof Theory
inferredcites →https://doi.org/10.1017/cbo9780511565687openalex-snapshot
Multiple-Conclusion Logic
inferredcites →https://doi.org/10.1093/oso/9780198505242.001.0001openalex-snapshot
Elements of Intuitionism
inferredcites →https://doi.org/10.1098/rsta.1984.0073openalex-snapshot
Constructive mathematics and computer programming
inferredcites →https://doi.org/10.2307/2183653openalex-snapshot
Logic: Techniques of Formal Reasoning.
inferredcites →https://doi.org/10.2307/2219541openalex-snapshot
Multiple Conclusion 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/978-1-4899-0548-2_4openalex-snapshot
Proof-theoretic Validity and the Completeness of Intuitionistic Logic
inferred← citeshttps://doi.org/10.1007/978-3-031-20294-0_5openalex-snapshot
Languages of Grounding
inferred← citeshttps://doi.org/10.1007/978-3-319-11041-7_1openalex-snapshot
Prawitz, Proofs, and Meaning
inferred← citeshttps://doi.org/10.1007/978-3-319-11041-7_10openalex-snapshot
Meaning in Use
inferred← citeshttps://doi.org/10.1007/978-3-319-11041-7_8openalex-snapshot
Inversion Principles and Introduction Rules
inferred← citeshttps://doi.org/10.1007/978-94-007-7548-0_1openalex-snapshot
Generalized Elimination Inferences, Higher-Level Rules, and the Implications-as-Rules Interpretation of the Sequent Calculus
inferred← citeshttps://doi.org/10.1007/978-94-009-5203-4_8openalex-snapshot
Proof Theory and Meaning
inferred← citeshttps://doi.org/10.1007/978-94-017-0464-9_3openalex-snapshot
Proof Theory and Meaning
inferred← citeshttps://doi.org/10.1007/bf00248324openalex-snapshot
The foundation of a generic theorem prover
inferred← citeshttps://doi.org/10.1007/bf00881916openalex-snapshot
Set theory for verification. II: Induction and recursion
inferred← citeshttps://doi.org/10.1007/s11225-014-9562-3openalex-snapshot
The Calculus of Higher-Level Rules, Propositional Quantification, and the Foundational Approach to Proof-Theoretic Harmony
inferred← citeshttps://doi.org/10.1007/s11225-014-9564-1openalex-snapshot
Gentzen and Jaśkowski Natural Deduction: Fundamentally Similar but Importantly Different
inferred← citeshttps://doi.org/10.1007/s11225-021-09969-8openalex-snapshot
Denotational Semantics for Languages of Epistemic Grounding Based on Prawitz’s Theory of Grounds
inferred← citeshttps://doi.org/10.1007/s11229-004-6296-1openalex-snapshot
Validity Concepts in Proof-theoretic Semantics
inferred← citeshttps://doi.org/10.1007/s11229-023-04203-5openalex-snapshot
The proof-theoretic square
inferred← citeshttps://doi.org/10.1007/s11229-025-05150-zopenalex-snapshot
Problems of a proof-theoretic characterization of paradoxes
inferred← citeshttps://doi.org/10.1016/0096-0551(86)90009-3openalex-snapshot
Program derivation in type theory: A partitioning problem
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00355-8openalex-snapshot
Least and greatest fixed points in intuitionistic natural deduction
inferred← citeshttps://doi.org/10.1080/01445340.2024.2393964openalex-snapshot
Notions of Proof and Refutation in ‘Gentzensemantik’: Franz von Kutschera as an Early Proponent of (Bilateralist) Proof-Theoretic Semantics
inferred← citeshttps://doi.org/10.1093/logcom/1.5.635openalex-snapshot
A Proof-Theoretic Approach to Logic Programming
inferred← citeshttps://doi.org/10.1093/logcom/12.6.1061openalex-snapshot
Kripke Resource Models of a Dependently-typed, Bunched -calculus
inferred← citeshttps://doi.org/10.46298/lmcs-20(3:10)2024openalex-snapshot
A Faithful and Quantitative Notion of Distant Reduction for the Lambda-Calculus with Generalized Applications
inferred← citeshttps://doi.org/10.70675/bb262970z0891z43bdz99d3zb2340e25044fopenalex-snapshot
Dag Prawitz's theory of grounds
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.