On the public citation graph
The abstract variable-binding calculus
0 signed · 46 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.1002/malq.19760220162openalex-snapshot
Algebraic Semantics for Modal Predicate Logic
inferredcites →https://doi.org/10.1002/malq.19800261902openalex-snapshot
Lambda‐Calculus Models and Extensionality
inferredcites →https://doi.org/10.1007/3-540-57182-5_34openalex-snapshot
Lambda substitution algebras
inferredcites →https://doi.org/10.1007/978-1-4471-3227-1_11openalex-snapshot
Dimension-Complemented Lambda Abstraction Algebras
inferredcites →https://doi.org/10.1007/978-1-4471-3227-1_3openalex-snapshot
Applying Algebraic Logic to Logic
inferredcites →https://doi.org/10.1007/bf02007264openalex-snapshot
Some model theory for monotone quantifiers
inferredcites →https://doi.org/10.1007/bf02123239openalex-snapshot
On a generalized cylindrical algebra and intuitionistic logic
inferredcites →https://doi.org/10.1007/bf02483086openalex-snapshot
On systems of varieties definable by schemes of equations
inferredcites →https://doi.org/10.1007/bf02483920openalex-snapshot
A representation theorem for polyadic Heyting algebras
inferredcites →https://doi.org/10.1016/0304-3975(94)00203-uopenalex-snapshot
Lambda abstraction algebras: representation theorems
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(70)80005-5openalex-snapshot
Logic with the quantifier “there exist uncountably many”
inferredcites →https://doi.org/10.1016/s0019-9958(82)80087-9openalex-snapshot
What is a model of the lambda calculus?
inferredcites →https://doi.org/10.1016/s0049-237x(09)70252-6openalex-snapshot
Proofs of Non-Deducibility in Intuitionistic Functional Calculus
inferredcites →https://doi.org/10.1016/s0049-237x(09)x7004-7openalex-snapshot
An Algebraic Approach to Non-Classical Logics
inferredcites →https://doi.org/10.1016/s0049-237x(13)72061-5openalex-snapshot
Studies in Logic and the Foundations of Mathematics
inferredcites →https://doi.org/10.1090/memoopenalex-snapshot
Memoirs of the American Mathematical Society
inferredcites →https://doi.org/10.1090/s0002-9947-1973-0317931-1openalex-snapshot
Cylindric Algebras and Algebras of Substitutions
inferredcites →https://doi.org/10.2307/2267135openalex-snapshot
Proofs of non-deducibility in intuitionistic functional calculus
inferredcites →https://doi.org/10.4064/-28-1-51-66openalex-snapshot
Polyadic algebras over nonclassical logics
inferredcites →https://doi.org/10.4064/fm-37-1-63-74openalex-snapshot
An algebraic characterization of quantifiers
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.1998.2745openalex-snapshot
A Finite Equational Axiomatization of the Functional Algebras for the Lambda Calculus
inferred← citeshttps://doi.org/10.1007/978-3-642-15205-4_26openalex-snapshot
Second-Order Equational Logic (Extended Abstract)
inferred← citeshttps://doi.org/10.1007/s00224-024-10164-0openalex-snapshot
Imperative Process Algebra and Models of Parallel Computation
inferred← citeshttps://doi.org/10.1016/0304-3975(94)00203-uopenalex-snapshot
Lambda abstraction algebras: representation theorems
inferred← citeshttps://doi.org/10.1016/j.ic.2009.11.007openalex-snapshot
Presenting functors on many-sorted varieties and applications
inferred← citeshttps://doi.org/10.1016/j.tcs.2005.11.011openalex-snapshot
Partial algebras, meaning categories and algebraization
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00059-1openalex-snapshot
On the algebraic models of lambda calculus
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)00170-7openalex-snapshot
Towards Lambda Calculus Order-Incompleteness
inferred← citeshttps://doi.org/10.1093/logcom/exag031openalex-snapshot
Polyadic De Morgan Monoids: Functional representation and MG structures
inferred← citeshttps://doi.org/10.1109/ismvl.1996.508351openalex-snapshot
On the contributions of Helena Rasiowa to mathematical logic
inferred← citeshttps://doi.org/10.1109/lics.2001.932509openalex-snapshot
A continuum of theories of lambda calculus without semantics
inferred← citeshttps://doi.org/10.1109/lics.2008.38openalex-snapshot
Second-Order and Dependently-Sorted Abstract Syntax
inferred← citeshttps://doi.org/10.1145/3426471openalex-snapshot
α β-Relations and the Actual Meaning of α-Renaming
inferred← citeshttps://doi.org/10.1145/3498715openalex-snapshot
Formal metatheory of second-order abstract syntax
inferred← citeshttps://doi.org/10.3233/fi-1998-33203openalex-snapshot
Lambda Abstraction Algebras: Coordinatizing Models of Lambda Calculus
inferred← citeshttps://doi.org/10.3233/fi-2021-2026openalex-snapshot
Using Hoare Logic in a Process Algebra Setting
inferred← citeshttps://doi.org/10.3233/fun-2001-45405openalex-snapshot
Nonmodularity Results for Lambda Calculus
inferred← citeshttps://doi.org/10.4064/-28-1-51-66openalex-snapshot
Polyadic algebras over nonclassical logics
inferred← citeshttps://doi.org/10.7561/sacs.2022.1.137openalex-snapshot
Imperative Process Algebra with Abstraction
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.