On the public citation graph

A Theory of Positive Integers in Formal Logic. Part II

0 signed · 73 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.1007/11780342_59openalex-snapshot
Kurt Gödel and Computability Theory
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-84882-555-0_4openalex-snapshot
Logic, Computability and Formal Systems
inferred← citeshttps://doi.org/10.1007/978-3-031-24117-8_27openalex-snapshot
Retracing Some Paths in Categorical Semantics: From Process-Propositions-as-Types to Categorified Reals and Computers
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-642-27266-0_9openalex-snapshot
Algorithmic Universality and Its Robustness
inferred← citeshttps://doi.org/10.1007/978-3-642-37651-1_7openalex-snapshot
From Search to Computation: Redundancy Criteria and Simplification at Work
inferred← citeshttps://doi.org/10.1007/978-3-658-19606-6_52openalex-snapshot
Leibniz und die künstliche Intelligenz
inferred← citeshttps://doi.org/10.1007/978-3-658-23715-8_52-1openalex-snapshot
Leibniz und die künstliche Intelligenz
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/bf00370287openalex-snapshot
Arithmetic based on the Church numerals in illative combinatory logic
inferred← citeshttps://doi.org/10.1007/bf00486045openalex-snapshot
Proof theory and complexity
inferred← citeshttps://doi.org/10.1007/bf02146065openalex-snapshot
Another proof of the Markov—Post theorem
inferred← citeshttps://doi.org/10.1007/s00026-018-0371-7openalex-snapshot
On the Number of Unary-Binary Tree-Like Structures with Restrictions on the Unary Height
inferred← citeshttps://doi.org/10.1007/s00153-026-01021-7openalex-snapshot
Diagonalization as computation: Gödel sentence construction and a type-disciplined blueprint
inferred← citeshttps://doi.org/10.1007/s11390-026-6092-1openalex-snapshot
What Is Computation? And Why Turing?
inferred← citeshttps://doi.org/10.1007/s13347-019-00370-xopenalex-snapshot
Reciprocal Influences Between Proof Theory and Logic Programming
inferred← citeshttps://doi.org/10.1016/b978-0-12-386980-7.50002-2openalex-snapshot
On Computable Numbers, with an Application to the Entscheidungsproblem – A Correction
inferred← citeshttps://doi.org/10.1016/b978-0-12-386980-7.50006-xopenalex-snapshot
Systems of Logic Based on Ordinals
inferred← citeshttps://doi.org/10.1016/b978-0-12-386980-7.50023-xopenalex-snapshot
Computing Machinery and Intelligence
inferred← citeshttps://doi.org/10.1016/b978-044450423-4/50007-3openalex-snapshot
Systems of logic based on ordinals
inferred← citeshttps://doi.org/10.1016/j.amc.2005.09.081openalex-snapshot
A symbolic and algebraic computation based Lambda-Boolean reduction machine via PROLOG
inferred← citeshttps://doi.org/10.1016/j.jlamp.2022.100790openalex-snapshot
Semantics of quantum programming languages: Classical control, quantum control
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)70892-9openalex-snapshot
A System of Axiomatic Set Theory
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(08)x7060-0openalex-snapshot
The Kleene Symposium
inferred← citeshttps://doi.org/10.1016/s0166-4115(06)80024-5openalex-snapshot
General Introduction: Current Developments in Cognitive Psychology, Neuroscience, and the Philosophy of Mind
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/chol9780521591041.050openalex-snapshot
The golden age of mathematical logic
inferred← citeshttps://doi.org/10.1017/s1049096510000090openalex-snapshot
Usage of Recursive in Political Science
inferred← citeshttps://doi.org/10.1023/a:1021348629167openalex-snapshot
Alan Turing and the Mathematical Objection
inferred← citeshttps://doi.org/10.1080/01445349708837290openalex-snapshot
Alonzo church:his life, his work and some of his miracles
inferred← citeshttps://doi.org/10.1080/03325860050179236openalex-snapshot
Coordination in Optimality Theory
inferred← citeshttps://doi.org/10.1080/19300980.1959.12467602openalex-snapshot
Some Comments on the Role of the Axiom of Choice in the Development of Abstract Set Theory
inferred← citeshttps://doi.org/10.1090/s0002-9904-1978-14552-2openalex-snapshot
Recursively enumerable sets and degrees
inferred← citeshttps://doi.org/10.1090/s0002-9947-1943-0007371-8openalex-snapshot
Recursive Predicates and Quantifiers
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.1093/acprof:oso/9780195137316.003.0029openalex-snapshot
The Development of Mathematical Logic from Russell to Tarski, 1900–1935
inferred← citeshttps://doi.org/10.1093/bjps/axr016openalex-snapshot
The Physical Church–Turing Thesis: Modest or Bold?
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/mind/lix.236.433openalex-snapshot
I.—COMPUTING MACHINERY AND INTELLIGENCE
inferred← citeshttps://doi.org/10.1093/oso/9780198250791.003.0017openalex-snapshot
Computing Machinery and Intelligence (1950)
inferred← citeshttps://doi.org/10.1109/dcps.2016.7588295openalex-snapshot
P-FRP task scheduling: A survey
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.1109/tsmc.2014.2347933openalex-snapshot
Petri Net Computers and Workflow Nets
inferred← citeshttps://doi.org/10.1137/1.9781611973013.3openalex-snapshot
Lambda terms of bounded unary height
inferred← citeshttps://doi.org/10.1137/1.9781611973204.3openalex-snapshot
On the asymptotic number of BCK(2)-terms
inferred← citeshttps://doi.org/10.1145/1868294.1868307openalex-snapshot
Modular domain-specific language components in scala
inferred← citeshttps://doi.org/10.1145/321160.321170openalex-snapshot
Computability of Recursive Functions
inferred← citeshttps://doi.org/10.1145/800127.804061openalex-snapshot
Computer Science And Recursion Theory
inferred← citeshttps://doi.org/10.13140/rg.2.2.32087.16801openalex-snapshot
Quantum Random Self-Modifiable Computation
inferred← citeshttps://doi.org/10.14264/171001openalex-snapshot
Theoretical Foundations for Practical ‘Totally Functional Programming’
inferred← citeshttps://doi.org/10.20381/ruor-19805openalex-snapshot
Semantics for a higher-order functional programming language for quantum computation
inferred← citeshttps://doi.org/10.2168/lmcs-11(3:25)2015openalex-snapshot
Ellipses and Lambda Definability
inferred← citeshttps://doi.org/10.2307/2266170openalex-snapshot
A formulation of the simple theory of types
inferred← citeshttps://doi.org/10.2307/2267281openalex-snapshot
A system of axiomatic set theory—Part II
inferred← citeshttps://doi.org/10.2307/2268281openalex-snapshot
The þ-function in λ-K-conversion
inferred← citeshttps://doi.org/10.2307/2268864openalex-snapshot
A system of axiomatic set theory - Part VII
inferred← citeshttps://doi.org/10.2307/2272394openalex-snapshot
The work of Kurt Gödel
inferred← citeshttps://doi.org/10.2307/420945openalex-snapshot
The Mathematical Work of S.C.Kleene
inferred← citeshttps://doi.org/10.2307/421012openalex-snapshot
Step by Recursive Step: Church's Analysis of Effective Calculability
inferred← citeshttps://doi.org/10.23638/lmcs-16(3:15)2020openalex-snapshot
Gems of Corrado B\"ohm
inferred← citeshttps://doi.org/10.37236/3051openalex-snapshot
Enumeration of Generalized $BCI$ Lambda-terms
inferred← citeshttps://doi.org/10.4204/eptcs.262.1openalex-snapshot
Analyzing Individual Proofs as the Basis of Interoperability between Proof Systems
inferred← citeshttps://doi.org/10.48550/arxiv.1305.0640openalex-snapshot
Enumeration of generalized $BCI$ lambda-terms
inferred← citeshttps://doi.org/10.48550/arxiv.1409.1030openalex-snapshot
On effective undecidability and Post's problem
inferred← citeshttps://doi.org/10.48550/arxiv.2108.09270openalex-snapshot
The Church numbers in NF set theory
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.