On the public citation graph

A Set of Postulates For the Foundation of Logic

https://doi.org/10.2307/1968702
0 signed · 156 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 points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/malq.19550010304openalex-snapshot
A formalization of the theory of sets from the point of view of combinatory logic
inferred← citeshttps://doi.org/10.1002/malq.200510040openalex-snapshot
Kolmogorov complexity and set theoretical representations of integers
inferred← citeshttps://doi.org/10.1007/11780342_59openalex-snapshot
Kurt Gödel and Computability Theory
inferred← citeshttps://doi.org/10.1007/978-1-4020-6710-5_23openalex-snapshot
Laplace, Turing and the “Imitation Game” Impossible Geometry
inferred← citeshttps://doi.org/10.1007/978-1-4471-0717-0_3openalex-snapshot
Recursive Functions: An Archeological Look
inferred← citeshttps://doi.org/10.1007/978-1-4614-8379-3_1openalex-snapshot
Introduction
inferred← citeshttps://doi.org/10.1007/978-1-4899-3793-3_5openalex-snapshot
L
inferred← citeshttps://doi.org/10.1007/978-3-030-77657-2_2openalex-snapshot
Hilbert’s Axiomatisches Denken
inferred← citeshttps://doi.org/10.1007/978-3-030-92551-2_11openalex-snapshot
On Boolean Automata Isolated Cycles and Tangential Double-Cycles Dynamics
inferred← citeshttps://doi.org/10.1007/978-3-030-98361-1_7openalex-snapshot
Computing Tools and Representations of Arithmetic
inferred← citeshttps://doi.org/10.1007/978-3-031-34518-0_8openalex-snapshot
Some Remarks About Dependent Type Theory
inferred← citeshttps://doi.org/10.1007/978-3-031-52411-0_20openalex-snapshot
Natural constructive proofs of A via A -> B, proof paradoxes, and impredicativity
inferred← citeshttps://doi.org/10.1007/978-3-031-72851-8_1openalex-snapshot
General Introduction and Motivation
inferred← citeshttps://doi.org/10.1007/978-3-031-72851-8_12openalex-snapshot
Comparative Historical Studies (1): Viète’s Analytic Art in $$\lambda $$-Philosophy
inferred← citeshttps://doi.org/10.1007/978-3-031-98679-6_14openalex-snapshot
Floating-Point Neural Networks are Provably Robust Universal Approximators
inferred← citeshttps://doi.org/10.1007/978-3-0346-0504-5_11openalex-snapshot
Gödel, Leibniz and “Russell’s Mathematical Logic”
inferred← citeshttps://doi.org/10.1007/978-3-319-29198-7_7openalex-snapshot
The Operational Perspective: Three Routes
inferred← citeshttps://doi.org/10.1007/978-3-319-46376-6_2openalex-snapshot
Is Universal Computation a Myth?
inferred← citeshttps://doi.org/10.1007/978-3-319-47286-7_12openalex-snapshot
Frege’s Habilitationsschrift: Magnitude, Number and the Problems of Computability
inferred← citeshttps://doi.org/10.1007/978-3-319-63334-3_10openalex-snapshot
The Operational Penumbra: Some Ontological Aspects
inferred← citeshttps://doi.org/10.1007/978-3-476-98727-3_5openalex-snapshot
L
inferred← citeshttps://doi.org/10.1007/978-3-642-86745-3_2openalex-snapshot
The Undecidability of λK-Conversion
inferred← citeshttps://doi.org/10.1007/978-3-662-48899-7_23openalex-snapshot
There Is No Best $$\beta $$ -Normalization Strategy for Higher-Order Reasoners
inferred← citeshttps://doi.org/10.1007/978-3-7091-6492-1_89openalex-snapshot
Is Genetic Programming Dependent on High-level Primitives?
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-5988-0_4openalex-snapshot
L
inferred← citeshttps://doi.org/10.1007/978-94-010-0526-5_13openalex-snapshot
λ-Calculus as a Foundation for Mathematics
inferred← citeshttps://doi.org/10.1007/978-94-015-1288-6_9openalex-snapshot
I
inferred← citeshttps://doi.org/10.1007/978-94-017-0249-2_9openalex-snapshot
Tarski and Leśniewski on Languages with Meaning Versus Languages without Use
inferred← citeshttps://doi.org/10.1007/978-94-017-0253-9_5openalex-snapshot
De Bruijn’s Automath and Pure Type Systems
inferred← citeshttps://doi.org/10.1007/978-94-017-0460-1_3openalex-snapshot
Combinators, Proofs and Implicational Logics
inferred← citeshttps://doi.org/10.1007/978-94-017-0689-6_12openalex-snapshot
Intuitionism and Logical Tolerance
inferred← citeshttps://doi.org/10.1007/bf01977111openalex-snapshot
Ein Typenfreies System der Logik mit Ausreichender Mathematischer Anwendungsfähigkeit I
inferred← citeshttps://doi.org/10.1007/bf02020732openalex-snapshot
Probleme der Hilbertschen Theorie der höheren Stufen von rekursiven Funktionen
inferred← citeshttps://doi.org/10.1007/bf03023829openalex-snapshot
Years ago
inferred← citeshttps://doi.org/10.1007/s10270-025-01293-2openalex-snapshot
Formalising privacy regulations with bigraphs
inferred← citeshttps://doi.org/10.1007/s10699-026-10047-2openalex-snapshot
Turing’s Unresolved Tension
inferred← citeshttps://doi.org/10.1007/s11225-017-9774-4openalex-snapshot
Gödel on Deduction
inferred← citeshttps://doi.org/10.1007/s11229-014-0653-5openalex-snapshot
Platitudes in mathematics
inferred← citeshttps://doi.org/10.1016/0168-0072(88)90017-6openalex-snapshot
On church's formal theory of functions and functionals
inferred← citeshttps://doi.org/10.1016/0304-3975(76)90025-6openalex-snapshot
A global representation of the recursive functions in the λ-calculus
inferred← citeshttps://doi.org/10.1016/b978-0-444-51555-1.50017-1openalex-snapshot
ON COMPUTABILITY
inferred← citeshttps://doi.org/10.1016/b978-0-444-52937-4.50009-5openalex-snapshot
A History of Types
inferred← citeshttps://doi.org/10.1016/b978-044451541-4/50016-6openalex-snapshot
Classical Logic's Coming of Age
inferred← citeshttps://doi.org/10.1016/j.jlamp.2026.101112openalex-snapshot
Should computations halt?
inferred← citeshttps://doi.org/10.1016/j.jtbi.2008.12.012openalex-snapshot
A computable expression of closure to efficient causation
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.02.002openalex-snapshot
The search for a reduction in combinatory logic equivalent to λβ -reduction
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.11.028openalex-snapshot
A synthetic axiomatization of Map Theory
inferred← citeshttps://doi.org/10.1016/s0019-9958(82)80087-9openalex-snapshot
What is a model of the lambda calculus?
inferred← citeshttps://doi.org/10.1016/s0049-237x(06)80002-9openalex-snapshot
Type-free λ-calculus
inferred← citeshttps://doi.org/10.1016/s0049-237x(06)80018-2openalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)70025-9openalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)70217-9openalex-snapshot
Strong Normalization in a Typed Lambda Calculus with Lambda Structured Types
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/s0049-237x(09)70458-6openalex-snapshot
Thirty Years of Foundational Studies Lectures on the Development of Mathematical Logic and the Study of the Foundations of Mathematics in 1930–1964
inferred← citeshttps://doi.org/10.1016/s0167-5060(08)70415-1openalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00057-8openalex-snapshot
From computation to foundations via functions and application: The λ-calculus and its webbed models
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00173-9openalex-snapshot
Developing developments
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)00126-6openalex-snapshot
Enlargements of functional algebras for the lambda calculus
inferred← citeshttps://doi.org/10.1016/s1567-8326(02)00016-4openalex-snapshot
Revisiting the notion of function
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80798-9openalex-snapshot
“Map Theory et Antifondation”
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.1016/s1874-5857(09)70020-2openalex-snapshot
Paradoxes, Self-Reference and Truth in the 20th Century
inferred← citeshttps://doi.org/10.1017/cbo9781107338579.013openalex-snapshot
Step by recursive step: Church's analysis of effective calculability
inferred← citeshttps://doi.org/10.1017/s0952675725100055openalex-snapshot
The blueprint model of production
inferred← citeshttps://doi.org/10.1080/01445340.2015.1065461openalex-snapshot
A Vindication of Program Verification
inferred← citeshttps://doi.org/10.1080/01445340.2015.1084183openalex-snapshot
When Logic Meets Engineering: Introduction to Logical Issues in the History and Philosophy of Computer Science
inferred← citeshttps://doi.org/10.1090/s0002-9904-1964-11245-3openalex-snapshot
Combinatory recursive objects of all finite types
inferred← citeshttps://doi.org/10.1090/s0273-0979-1981-14920-xopenalex-snapshot
The theory of recursive functions, approaching its centennial
inferred← citeshttps://doi.org/10.1090/s0273-0979-2014-01456-9openalex-snapshot
Homotopy type theory and Voevodsky’s univalent foundations
inferred← citeshttps://doi.org/10.1090/tran/1953-075-01openalex-snapshot
inferred← citeshttps://doi.org/10.1093/9780198907565.001.0001openalex-snapshot
Computing the Sentence
inferred← citeshttps://doi.org/10.1093/9780198907565.002.0004openalex-snapshot
Dedication
inferred← citeshttps://doi.org/10.1093/9780198907565.003.0001openalex-snapshot
Introduction
inferred← citeshttps://doi.org/10.1093/9780198907565.003.0002openalex-snapshot
Computing the sentence
inferred← citeshttps://doi.org/10.1093/9780198907565.003.0003openalex-snapshot
Procedural syntax from scratch
inferred← citeshttps://doi.org/10.1093/9780198907565.003.0004openalex-snapshot
Syntax as code
inferred← citeshttps://doi.org/10.1093/9780198907565.003.0005openalex-snapshot
The development of procedural syntax
inferred← citeshttps://doi.org/10.1093/9780198907565.003.0006openalex-snapshot
Syntactic development by trial and error
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780195137316.003.0029openalex-snapshot
The Development of Mathematical Logic from Russell to Tarski, 1900–1935
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.001.0001openalex-snapshot
The Nature of Computation
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.002.0003openalex-snapshot
Copyright Page
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.002.0004openalex-snapshot
Dedication
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.002.0006openalex-snapshot
Figure Credits
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.002.0007openalex-snapshot
Preface
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.003.0001openalex-snapshot
Prologue
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.003.0002openalex-snapshot
The Basics
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.003.0003openalex-snapshot
Insights and Algorithms
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.003.0004openalex-snapshot
Needles in a Haystack: the Class NP
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.003.0005openalex-snapshot
Who is the Hardest One of All? NP-Completeness
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.003.0006openalex-snapshot
The Deep Question: P vs. NP
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.003.0007openalex-snapshot
The Grand Unified Theory of Computation
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.003.0008openalex-snapshot
Memory, Paths, and Games
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.003.0009openalex-snapshot
Optimization and Approximation
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.003.0010openalex-snapshot
Randomized Algorithms
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.003.0011openalex-snapshot
Interaction and Pseudorandomness
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.003.0012openalex-snapshot
Random Walks and Rapid Mixing
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.003.0013openalex-snapshot
Counting, Sampling, and Statistical Physics
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.003.0014openalex-snapshot
When Formulas Freeze: Phase Transitions in Computation
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.003.0015openalex-snapshot
Quantum Computation
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.005.0001openalex-snapshot
Mathematical Tools
inferred← citeshttps://doi.org/10.1093/logcom/exq017openalex-snapshot
Relations Versus Functions at the Foundations of Logic: Type-Theoretic Considerations
inferred← citeshttps://doi.org/10.1093/oso/9780198500735.003.0024openalex-snapshot
Textual notes
inferred← citeshttps://doi.org/10.1093/oso/9780198500759.003.0036openalex-snapshot
References
inferred← citeshttps://doi.org/10.1093/oso/9780198796800.003.0016openalex-snapshot
Phonology in Glossematics in Northern and Western Europe
inferred← citeshttps://doi.org/10.1093/oso/9780198796800.003.0023openalex-snapshot
Dependency Phonology
inferred← citeshttps://doi.org/10.1093/philmat/nkad017openalex-snapshot
Intuition, Iteration, Induction
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/mahc.2021.3121578openalex-snapshot
Logic, Programming, and Computer Science: Local Perspectives
inferred← citeshttps://doi.org/10.1109/sai.2016.7556071openalex-snapshot
HASKEU: An editor to support visual and textual programming in tandem
inferred← citeshttps://doi.org/10.1109/sfcs.1979.33openalex-snapshot
Origins of recursive function theory
inferred← citeshttps://doi.org/10.1109/tsmc.2014.2347933openalex-snapshot
Petri Net Computers and Workflow Nets
inferred← citeshttps://doi.org/10.1111/j.0026-1386.2004.00193.xopenalex-snapshot
An Essay in λ‐Calculus
inferred← citeshttps://doi.org/10.1142/s0129626413500059openalex-snapshot
HYPERCOMPUTATION: FANTASY OR REALITY? A POSITION PAPER
inferred← citeshttps://doi.org/10.1145/2305484.2305502openalex-snapshot
Systematic generation of abstract user interfaces
inferred← citeshttps://doi.org/10.1145/3571241openalex-snapshot
Recursive Subtyping for All
inferred← citeshttps://doi.org/10.1145/72551.72554openalex-snapshot
Conception, evolution, and application of functional programming languages
inferred← citeshttps://doi.org/10.1145/800127.804061openalex-snapshot
Computer Science And Recursion Theory
inferred← citeshttps://doi.org/10.1177/0263276418769733openalex-snapshot
Letter to Turing
inferred← citeshttps://doi.org/10.1177/0725513607072452openalex-snapshot
Space is the Place: The Laws of Form and Social Systems
inferred← citeshttps://doi.org/10.12775/llp.2016.021openalex-snapshot
Sweet SIXTEEN: Automation via Embedding into Classical Higher-Order Logic
inferred← citeshttps://doi.org/10.1305/ndjfl/1093637645openalex-snapshot
Reflections on Church's thesis.
inferred← citeshttps://doi.org/10.1305/ndjfl/1093883566openalex-snapshot
Illative combinatory logic without equality as a primitive predicate.
inferred← citeshttps://doi.org/10.13109/9783666363276openalex-snapshot
Politisches Entscheiden im Kalten Krieg
inferred← citeshttps://doi.org/10.15760/etd.2669openalex-snapshot
Irrelevance, Polymorphism, and Erasure in Type Theory
inferred← citeshttps://doi.org/10.18653/v1/2023.findings-eacl.99openalex-snapshot
Modelling Language Acquisition through Syntactico-Semantic Pattern Finding
inferred← citeshttps://doi.org/10.2168/lmcs-9(4:21)2013openalex-snapshot
Ordered Models of the Lambda Calculus
inferred← citeshttps://doi.org/10.2178/bsl/1182353871openalex-snapshot
Types in Logic and Mathematics Before 1940
inferred← citeshttps://doi.org/10.2178/bsl/1231081772openalex-snapshot
2008 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '08
inferred← citeshttps://doi.org/10.22201/iifs.18704913e.1965.11.1196openalex-snapshot
La prueba de Cohen: culminación de la crisis en la axiomática
inferred← citeshttps://doi.org/10.2298/ns20131009iveticopenalex-snapshot
Intesection types and resource control in the intuitionistic sequent lambda calculus
inferred← citeshttps://doi.org/10.2307/421012openalex-snapshot
Step by Recursive Step: Church's Analysis of Effective Calculability
inferred← citeshttps://doi.org/10.2307/421020openalex-snapshot
Alonzo Church's Contributions to Philosophy and Intensional Logic
inferred← citeshttps://doi.org/10.23638/lmcs-16(3:15)2020openalex-snapshot
Gems of Corrado B\"ohm
inferred← citeshttps://doi.org/10.26686/ajl.v14i1.4032openalex-snapshot
Fixed-Point Models for Theories of Properties and Classes
inferred← citeshttps://doi.org/10.2969/msjmemoirs/00201c010openalex-snapshot
A Primer on Proofs and Types
inferred← citeshttps://doi.org/10.31234/osf.io/qtje3openalex-snapshot
Ontogenetic origins of human integer representations
inferred← citeshttps://doi.org/10.3166/tsi.34.401-430openalex-snapshot
Cycles, double-cycles d’interactions et modes de mise à jour
inferred← citeshttps://doi.org/10.3390/h13030082openalex-snapshot
Illusory Arguments by Artificial Agents: Pernicious Legacy of the Sophists
inferred← citeshttps://doi.org/10.3765/amp.v9i0.5304openalex-snapshot
Incomplete neutralization and the blueprint model of production
inferred← citeshttps://doi.org/10.4000/rac.4260openalex-snapshot
Le machine learning et les sciences sociales à l’épreuve des échelles de complexité algorithmique
inferred← citeshttps://doi.org/10.46298/lmcs-17(2:25)2021openalex-snapshot
Encoding many-valued logic in $\lambda$-calculus
inferred← citeshttps://doi.org/10.47749/t/unicamp.2010.782519openalex-snapshot
Paralelização automática de laços para arquiteturas multicore
inferred← citeshttps://doi.org/10.47749/t/unicamp.2011.787718openalex-snapshot
Uma abordagem modelo-teórica da computabilidade de Turing clássica
inferred← citeshttps://doi.org/10.48160/18532330me4.125openalex-snapshot
Sobre el anti-realismo de Wittgenstein y su aplicación al programa chomskiano
inferred← citeshttps://doi.org/10.52842/conf.caadria.2018.2.443openalex-snapshot
The Syntopy - An Information-Based Model of Space
inferred← citeshttps://doi.org/10.5294/pecu.2014.17.1.2openalex-snapshot
La historia y la gramática de la recursión: una precisión desde la obra de Wittgenstein
inferred← citeshttps://doi.org/10.5944/endoxa.36.2015.14967openalex-snapshot
¿Qué es un algoritmo? Una respuesta desde la obra de Wittgenstein
inferred← citeshttps://doi.org/10.70675/1dfc9503z30eez4554za597zdd6658262d15openalex-snapshot
Development and verification of probability logics and logical frameworks
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
inferred← citeshttps://doi.org/10.70675/d6848aaaz6964z4c3ezb276z8aa93e0e7831openalex-snapshot
Formal verification for high assurance security software in FStar : application to communication protocols and cryptographic primitives
inferred← citeshttps://doi.org/10.70675/ebffbe00z3617z41e5z91bfzd4ec1aa303afopenalex-snapshot
Le statut dynamique des axiomes : des preuves aux modèles
inferred← citeshttps://doi.org/10.7146/dpb.v20i344.6574openalex-snapshot
What is an Efficient Implementation of the lambda-calculus?
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.