On the public citation graph

Definedness

https://doi.org/10.1007/bf01135376
0 signed · 68 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 this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/malq.19670131502openalex-snapshot
On Free Description Theory
inferredcites →https://doi.org/10.1007/978-1-4612-2822-6_5openalex-snapshot
Logics for Termination and Correctness of Functional Programs
inferredcites →https://doi.org/10.1007/978-3-642-68952-9openalex-snapshot
Foundations of Constructive Mathematics
inferredcites →https://doi.org/10.1007/978-3-662-11824-5openalex-snapshot
General Recursion Theory
inferredcites →https://doi.org/10.1007/bfb0023759openalex-snapshot
A new approach to abstract data types II computation on ADTs as ordinary computation
inferredcites →https://doi.org/10.1007/bfb0061839openalex-snapshot
Identity and existence in intuitionistic logic
inferredcites →https://doi.org/10.1007/bfb0062852openalex-snapshot
A language and axioms for explicit mathematics
inferredcites →https://doi.org/10.1007/bfb0073967openalex-snapshot
Continuous lattices
inferredcites →https://doi.org/10.1007/bfb0090733openalex-snapshot
Formalizing constructive mathematics: Why and how?
inferredcites →https://doi.org/10.1016/0168-0072(96)88189-9openalex-snapshot
Computation on abstract data types. The extensional approach, with an application to streams
inferredcites →https://doi.org/10.1016/0304-3975(91)90230-yopenalex-snapshot
An abstract framework for environment machines
inferredcites →https://doi.org/10.1016/c2009-0-14341-6openalex-snapshot
The Lambda Calculus - Its Syntax and Semantics
inferredcites →https://doi.org/10.1016/s0049-237x(08)71124-8openalex-snapshot
Proof Theory: Some Applications of Cut-Elimination
inferredcites →https://doi.org/10.1016/s0049-237x(08)71128-5openalex-snapshot
The Logic of Topoi
inferredcites →https://doi.org/10.1016/s0049-237x(08)71129-7openalex-snapshot
The Type Free Lambda Calculus
inferredcites →https://doi.org/10.1017/s0956796800000186openalex-snapshot
Explicit substitutions
inferredcites →https://doi.org/10.1017/s0960129500001432openalex-snapshot
A new approach to abstract data types, I Informal development
inferredcites →https://doi.org/10.1090/conm/106/1057818openalex-snapshot
Polymorphic typed lambda-calculi in a type-free axiomatic framework
inferredcites →https://doi.org/10.1093/logcom/6.1.55openalex-snapshot
Partial Applicative Theories and Explicit Substitutions
inferredcites →https://doi.org/10.2307/2272970openalex-snapshot
A simplification of combinatory logic

What points at this work

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

inferred← citeshttps://doi.org/10.1002/9781405164801.ch12openalex-snapshot
Free Logics
inferred← citeshttps://doi.org/10.1002/malq.200510029openalex-snapshot
On the proof theory of type two functionals based on primitive recursive operations
inferred← citeshttps://doi.org/10.1007/10722086_22openalex-snapshot
Model Sets in a Nonconstructive Logic of Partial Terms with Definite Descriptions
inferred← citeshttps://doi.org/10.1007/11780342_61openalex-snapshot
Primitive Recursive Selection Functions over Abstract Algebras
inferred← citeshttps://doi.org/10.1007/3-540-60178-3_84openalex-snapshot
Intrinsic theories and computational complexity
inferred← citeshttps://doi.org/10.1007/3-540-60983-0_17openalex-snapshot
Total correctness of logic programs: A formal approach
inferred← citeshttps://doi.org/10.1007/3-540-63172-0_54openalex-snapshot
Call-by-Value, call-by-name and the logic of values
inferred← citeshttps://doi.org/10.1007/978-3-030-86059-2_4openalex-snapshot
Tableaux for Free Logics with Descriptions
inferred← citeshttps://doi.org/10.1007/978-3-031-43513-3_7openalex-snapshot
A Cut-Free, Sound and Complete Russellian Theory of Definite Descriptions
inferred← citeshttps://doi.org/10.1007/978-3-031-99984-0_19openalex-snapshot
Cut Elimination for Negative Free Logics with Definite Descriptions
inferred← citeshttps://doi.org/10.1007/978-3-032-04590-4_17openalex-snapshot
On Temporal References via Definite Descriptions in First-Order Monadic Logic of Order
inferred← citeshttps://doi.org/10.1007/978-3-032-11027-5_3openalex-snapshot
On the Philosophy and Mathematics of Hybrid Partial Type Theory
inferred← citeshttps://doi.org/10.1007/978-3-032-32592-1_1openalex-snapshot
Free Set Theory – Cut Elimination and Consistency
inferred← citeshttps://doi.org/10.1007/978-3-032-38214-6_17openalex-snapshot
A Toolbox for Undefined Terms in Type Theory
inferred← citeshttps://doi.org/10.1007/978-3-540-45085-6_12openalex-snapshot
Subset Types and Partial Functions
inferred← citeshttps://doi.org/10.1007/978-3-642-36039-8_15openalex-snapshot
Cut Elimination for Gentzen’s Sequent Calculus with Equality and Logic of Partial Terms
inferred← citeshttps://doi.org/10.1007/978-3-642-37075-5_12openalex-snapshot
Partiality and Recursion in Higher-Order Logic
inferred← citeshttps://doi.org/10.1007/978-94-007-1923-1_14openalex-snapshot
Anti-realist Classical Logic and Realist Mathematics
inferred← citeshttps://doi.org/10.1007/978-94-017-0458-8_4openalex-snapshot
More Free Logic
inferred← citeshttps://doi.org/10.1007/978-94-017-0458-8_5openalex-snapshot
Partial Logic
inferred← citeshttps://doi.org/10.1007/978-94-017-2109-7_6openalex-snapshot
On Applicative Theories
inferred← citeshttps://doi.org/10.1007/s10988-022-09366-xopenalex-snapshot
Quantifying into wh-dependencies: multiple-wh questions and questions with a quantifier
inferred← citeshttps://doi.org/10.1007/s10992-020-09564-7openalex-snapshot
A More Unified Approach to Free Logics
inferred← citeshttps://doi.org/10.1007/s10992-022-09679-zopenalex-snapshot
Neutral Free Logic: Motivation, Proof Theory and Models
inferred← citeshttps://doi.org/10.1007/s11225-020-09929-8openalex-snapshot
Free Logics are Cut-Free
inferred← citeshttps://doi.org/10.1007/s11229-023-04048-yopenalex-snapshot
When iota meets lambda
inferred← citeshttps://doi.org/10.1007/s11229-023-04443-5openalex-snapshot
Definite totalities and determinate truth in conceptual structuralism
inferred← citeshttps://doi.org/10.1007/s12136-008-0038-9openalex-snapshot
Concepts and Recipes
inferred← citeshttps://doi.org/10.1016/b978-044451541-4/50027-0openalex-snapshot
Free Logics
inferred← citeshttps://doi.org/10.1016/j.apal.2011.01.009openalex-snapshot
The Suslin operator in applicative theories: Its proof-theoretic analysis via ordinal theories
inferred← citeshttps://doi.org/10.1016/j.jlap.2008.02.002openalex-snapshot
Primitive recursive selection functions for existential assertions over abstract algebras
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80504-8openalex-snapshot
Producing Proofs from an Arithmetic Decision Procedure in Elliptical LF
inferred← citeshttps://doi.org/10.1017/9781009040457openalex-snapshot
Proofs and Models in Philosophical Logic
inferred← citeshttps://doi.org/10.1017/9781316755983.014openalex-snapshot
The proof-theoretic analysis of the Suslin operator in applicative theories
inferred← citeshttps://doi.org/10.1017/s175502031800031xopenalex-snapshot
GENERALITY AND EXISTENCE 1: QUANTIFICATION AND FREE LOGIC
inferred← citeshttps://doi.org/10.1017/s1755020321000289openalex-snapshot
RUSSELLIAN DEFINITE DESCRIPTION THEORY—A PROOF THEORETIC APPROACH
inferred← citeshttps://doi.org/10.1023/a:1011215918556openalex-snapshot
From Predication to Programming
inferred← citeshttps://doi.org/10.1023/a:1026744827863openalex-snapshot
A Set Theory with Support for Partial Functions
inferred← citeshttps://doi.org/10.1093/jigpal/jzs044openalex-snapshot
Procedural isomorphism, analytic information and -conversion by value
inferred← citeshttps://doi.org/10.1093/logcom/exac089openalex-snapshot
Completeness in partial type theory
inferred← citeshttps://doi.org/10.1109/lics.1996.561324openalex-snapshot
Syntactic considerations on recursive types
inferred← citeshttps://doi.org/10.1215/00294527-2688078openalex-snapshot
Truth-Value Semantics and Functional Extensions for Classical Logic of Partial Terms Based on Equality
inferred← citeshttps://doi.org/10.12775/llp.2017.026openalex-snapshot
Existential Import and Relations of Categorical and Modal Categorical Statements
inferred← citeshttps://doi.org/10.12775/llp.2020.020openalex-snapshot
Free Definite Description Theory – Sequent Calculi and Cut Elimination
inferred← citeshttps://doi.org/10.12775/llp.2021.011openalex-snapshot
The Rule of Existential Generalisation and Explicit Substitution
inferred← citeshttps://doi.org/10.2178/jsl/1190150149openalex-snapshot
The lazy logic of partial terms
inferred← citeshttps://doi.org/10.2307/421013openalex-snapshot
The Impact of the Lambda Calculus in Logic and Computer Science
inferred← citeshttps://doi.org/10.4204/eptcs.415.8openalex-snapshot
Two Cases of Deduction with Non-referring Descriptions
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.