On the public citation graph

Formulas-as-types for a hierarchy of sublogics of intuitionistic propositional logic

0 signed · 36 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/978-94-009-3673-7openalex-snapshot
Initiatives in Logic
inferredcites →https://doi.org/10.1007/978-94-009-3673-7_11openalex-snapshot
The Logic of Types
inferredcites →https://doi.org/10.1007/978-94-009-4540-1openalex-snapshot
Essays in Logical Semantics
inferredcites →https://doi.org/10.1007/978-94-015-6878-4openalex-snapshot
Categorial Grammars and Natural Language Structures
inferredcites →https://doi.org/10.1007/978-94-015-6878-4_4openalex-snapshot
Generative Power of Categorial Grammars
inferredcites →https://doi.org/10.1007/bf00370633openalex-snapshot
Sequent-systems and groupoid models. II
inferredcites →https://doi.org/10.1007/bf00671566openalex-snapshot
Sequent-systems and groupoid models. I
inferredcites →https://doi.org/10.1007/bf01049305openalex-snapshot
Functional completeness for subsystems of intuitionistic propositional logic
inferredcites →https://doi.org/10.1016/c2009-0-14341-6openalex-snapshot
The Lambda Calculus - Its Syntax and Semantics
inferredcites →https://doi.org/10.1016/s0003-4843(77)80004-1openalex-snapshot
Normalization as a homomorphic image of cut-elimination
inferredcites →https://doi.org/10.2307/2185110openalex-snapshot
The | lambda-Calculus.
inferredcites →https://doi.org/10.2307/2274588openalex-snapshot
J. Roger Hindley and Jonathan P. Seldin. Introduction to combinators and λ-calculus. London Mathematical Society student texts, no. 1. Cambridge University Press, Cambridge etc. 1986, vi + 360 pp.
inferredcites →https://doi.org/10.2307/2274784openalex-snapshot
Introduction to Higher Order Categorical Logic.
inferredcites →https://doi.org/10.2307/2275370openalex-snapshot
Extending the Curry-Howard interpretation to linear, relevant and other resource logics
inferredcites →https://doi.org/10.6084/m9.figshare.995908openalex-snapshot
Resource Logics - Proof Theoretical Investigations

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-21780-7_3openalex-snapshot
Diamonds Are Forever
inferred← citeshttps://doi.org/10.1007/978-3-642-21490-5_2openalex-snapshot
Covert Movement in Logical Grammar
inferred← citeshttps://doi.org/10.1007/978-3-662-59533-6_25openalex-snapshot
Modal Auxiliaries and Negation: A Type-Logical Account
inferred← citeshttps://doi.org/10.1007/978-94-010-0387-2_2openalex-snapshot
Sequent Systems for Modal Logics
inferred← citeshttps://doi.org/10.1007/978-94-011-4574-9_15openalex-snapshot
Labelled Deduction in the Composition of Form and Meaning
inferred← citeshttps://doi.org/10.1007/s10849-004-4509-0openalex-snapshot
Semantic bootstrapping of type-logical grammar
inferred← citeshttps://doi.org/10.1007/s10849-009-9108-7openalex-snapshot
Grammar Induction by Unification of Type-logical Lexicons
inferred← citeshttps://doi.org/10.1007/s11225-007-9089-yopenalex-snapshot
A Mixed λ-calculus
inferred← citeshttps://doi.org/10.1016/b978-0-444-53726-3.00002-5openalex-snapshot
Categorial Type Logics
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.11.001openalex-snapshot
Proof theory of Nelson’s paraconsistent logic: A uniform perspective
inferred← citeshttps://doi.org/10.1023/a:1005292130553openalex-snapshot
The Classification of Propositional Calculi
inferred← citeshttps://doi.org/10.1093/jigpal/jzag037openalex-snapshot
Extending computational trinitarianism
inferred← citeshttps://doi.org/10.12775/llp.2007.005openalex-snapshot
Natural deduction systems for some non-commutative logics
inferred← citeshttps://doi.org/10.2307/2275370openalex-snapshot
Extending the Curry-Howard interpretation to linear, relevant and other resource logics
inferred← citeshttps://doi.org/10.29007/mhx8openalex-snapshot
Do different syntactic trees yield different logical readings? Some remarks on head variables in typed lambda calculus.
inferred← citeshttps://doi.org/10.3115/976744.976776openalex-snapshot
Towards efficient parsing with proof-nets
inferred← citeshttps://doi.org/10.3115/991250.991353openalex-snapshot
Discontinuity and the Lambek calculus
inferred← citeshttps://doi.org/10.33540/1721openalex-snapshot
Dependency as Modality, Parsing as Permutation
inferred← citeshttps://doi.org/10.33540/631openalex-snapshot
Quantum distributional semantics
inferred← citeshttps://doi.org/10.4204/eptcs.340.6openalex-snapshot
Putting a Spin on Language: A Quantum Interpretation of Unary Connectives for Linguistic Applications
inferred← citeshttps://doi.org/10.48550/arxiv.1908.07347openalex-snapshot
Density Matrices with Metric for Derivational Ambiguity
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.