On the public citation graph
A Mathematical Logic Without Variables. I
0 signed · 47 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 points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/malq.19790250104openalex-snapshot
The Standardization Theorem for λ‐Calculus
inferred← citeshttps://doi.org/10.1007/3-540-48685-2_5openalex-snapshot
Normalisation in Weakly Orthogonal Rewriting
inferred← citeshttps://doi.org/10.1007/978-3-0348-9114-1_5openalex-snapshot
La Logique Mathématique en sa jeunesse
inferred← citeshttps://doi.org/10.1007/978-3-476-03716-9_3openalex-snapshot
Einführung in die informationstheoretische Ästhetik
inferred← citeshttps://doi.org/10.1007/978-3-7091-6597-3_3openalex-snapshot
The Confluence of Ideas in 1936
inferred← citeshttps://doi.org/10.1007/978-94-009-0681-5_14openalex-snapshot
A Tour of the Multivariate Lambda Calculus
inferred← citeshttps://doi.org/10.1007/bf00370287openalex-snapshot
Arithmetic based on the Church numerals in illative combinatory logic
inferred← citeshttps://doi.org/10.1007/bfb0029531openalex-snapshot
Normed uniformly reflexive structures
inferred← citeshttps://doi.org/10.1016/0003-4843(74)90003-5openalex-snapshot
Functional completeness of cartesian categories
inferred← citeshttps://doi.org/10.1016/1385-7258(73)90005-xopenalex-snapshot
Combinatory logic and the axiom of choice
inferred← citeshttps://doi.org/10.1016/1385-7258(80)90030-xopenalex-snapshot
New arithmetical operators in the theory of combinators. II
inferred← citeshttps://doi.org/10.1016/j.cogsys.2021.10.001openalex-snapshot
Cognitive technology to capture deep computational concepts with combinators
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)71254-0openalex-snapshot
Some Philosophical Aspects of Combinatory Logic
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)71262-xopenalex-snapshot
Lambda Calculus: Some Models, Some Philosophy
inferred← citeshttps://doi.org/10.1016/s0166-8641(97)00222-8openalex-snapshot
Topology, domain theory and theoretical computer science
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00379-0openalex-snapshot
How to normalize the Jay
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)00250-8openalex-snapshot
Combinatory weak reduction in lambda calculus
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.1016/s1874-5857(09)70019-6openalex-snapshot
The Logic of Church and Curry
inferred← citeshttps://doi.org/10.1017/cbo9781107338579.013openalex-snapshot
Step by recursive step: Church's analysis of effective calculability
inferred← citeshttps://doi.org/10.1051/ita/1978120403391openalex-snapshot
Complexité de la réduction en logique combinatoire
inferred← citeshttps://doi.org/10.1090/s0002-9939-1970-0255405-xopenalex-snapshot
A Short Proof of Curry's Normal Form Theorem
inferred← citeshttps://doi.org/10.1090/s0002-9947-1978-0492300-7openalex-snapshot
Standard and Normal Reductions
inferred← citeshttps://doi.org/10.1109/lics.1989.39175openalex-snapshot
Extending the lambda calculus with surjective pairing is conservative
inferred← citeshttps://doi.org/10.1109/mahc.1981.10004openalex-snapshot
Origins of Recursive Function Theory
inferred← citeshttps://doi.org/10.1109/mahc.1984.10040openalex-snapshot
Highlights of the History of the Lambda-Calculus
inferred← citeshttps://doi.org/10.1109/sfcs.1979.33openalex-snapshot
Origins of recursive function theory
inferred← citeshttps://doi.org/10.1177/09571558251406513openalex-snapshot
The ABCs of early French computational literature: APL, Paul Braffort, and constrained writing in Oulipo
inferred← citeshttps://doi.org/10.2178/jsl/1045861508openalex-snapshot
The Church-Rosser property in dual combinatory logic
inferred← citeshttps://doi.org/10.2178/jsl/1120224727openalex-snapshot
The Church-Rosser property in symmetric combinatory logic
inferred← citeshttps://doi.org/10.2307/2266655openalex-snapshot
A revision of the fundamental rules of combinatory logic
inferred← citeshttps://doi.org/10.2307/2266656openalex-snapshot
Consistency and completeness of the theory of combinators
inferred← citeshttps://doi.org/10.2307/2267551openalex-snapshot
New sets of postulates for combinatory logics
inferred← citeshttps://doi.org/10.2307/2269029openalex-snapshot
A system of formal logic without an analogue to the curry W operator
inferred← citeshttps://doi.org/10.2307/2272337openalex-snapshot
An abstract Church-Rosser theorem. II: Applications
inferred← citeshttps://doi.org/10.2307/2274872openalex-snapshot
On adding (ξ) to weak equality in combinatory logic
inferred← citeshttps://doi.org/10.2307/421012openalex-snapshot
Step by Recursive Step: Church's Analysis of Effective Calculability
inferred← citeshttps://doi.org/10.70675/22ef231fzd622z41a8z8ea5z8b29a2998b2copenalex-snapshot
Contrôle du calcul et limites du sens : fonctions, computation et types de G. Frege à A.Church
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.