On the public citation graph
Implementing the ‘Fool's model’ of combinatory logic
0 signed · 35 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/3-540-08860-1_30openalex-snapshot
Une extension de la theorie des types en λ-calcul
inferredcites →https://doi.org/10.1007/bf00652071openalex-snapshot
New axiomatics for relevant logics, I
inferredcites →https://doi.org/10.1007/bf01371632openalex-snapshot
Condensed detachment as a rule of inference
inferredcites →https://doi.org/10.1016/0304-3975(88)90001-1openalex-snapshot
Fiftieth volume of theoretical computer science
inferredcites →https://doi.org/10.1016/s0049-237x(08)71541-6openalex-snapshot
The Semantics of Entailment
inferredcites →https://doi.org/10.1145/321250.321253openalex-snapshot
A Machine-Oriented Logic Based on the Resolution Principle
inferredcites →https://doi.org/10.1305/ndjfl/1093888116openalex-snapshot
In memoriam: Carew Arthur Meredith (1904--1976).
inferredcites →https://doi.org/10.2172/6852789openalex-snapshot
Searching for fixed point combinators by using automated theorem proving: A preliminary report
inferredcites →https://doi.org/10.2307/2273659openalex-snapshot
A filter lambda model and the completeness of type assignment
inferredcites →https://doi.org/10.2307/2274261openalex-snapshot
The undecidability of entailment and relevant implication
inferredcites →https://doi.org/10.2307/2274956openalex-snapshot
Principal type-schemes and condensed detachment
inferredcites →https://doi.org/10.25911/5d6fa29251193openalex-snapshot
Automated theorem-proving in non-classical logics
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/inco.1994.1018openalex-snapshot
A Semantics for Static Type Inference
inferred← citeshttps://doi.org/10.1007/978-3-642-17511-4_14openalex-snapshot
A Simple Class of Kripke-Style Models in Which Logic and Computation Have Equal Standing
inferred← citeshttps://doi.org/10.1007/978-94-009-0349-4_7openalex-snapshot
Combining Finite Model Generation with Theorem Proving
inferred← citeshttps://doi.org/10.1007/978-94-010-0526-5_3openalex-snapshot
A Representation of Relation Algebras Using Routley-Meyer Frames
inferred← citeshttps://doi.org/10.1016/0304-3975(93)90171-oopenalex-snapshot
Principal types of BCK-lambda-terms
inferred← citeshttps://doi.org/10.1016/j.apal.2003.11.015openalex-snapshot
Ternary relations and relevant semantics
inferred← citeshttps://doi.org/10.1016/j.entcs.2003.12.011openalex-snapshot
CHR: A Constructive Relevant Natural-deduction Logic
inferred← citeshttps://doi.org/10.1016/s1874-5857(06)80030-0openalex-snapshot
Relevant and substructural logics
inferred← citeshttps://doi.org/10.1016/s1874-5857(09)70018-4openalex-snapshot
Lambda-Calculus and Combinators in the 20th Century
inferred← citeshttps://doi.org/10.1017/s0960129523000191openalex-snapshot
A (machine-oriented) logic based on pattern matching
inferred← citeshttps://doi.org/10.1017/s1079898600004674openalex-snapshot
2002 Annual Conference of the Australasian Association for Logic
inferred← citeshttps://doi.org/10.1023/a:1010683508225openalex-snapshot
A Legacy Recalled and a Tradition Continued
inferred← citeshttps://doi.org/10.1093/jigpal/jzag037openalex-snapshot
Extending computational trinitarianism
inferred← citeshttps://doi.org/10.26686/ajl.v18i1.6288openalex-snapshot
Information Flow in Logics in the Vicinity of BB
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.