On the public citation graph

A finitary version of the calculus of partial inductive definitions

https://doi.org/10.1007/bfb0013605
0 signed · 36 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.1007/bf03037453openalex-snapshot
The programming language GCLA — A definitional approach to logic programming
inferredcites →https://doi.org/10.1007/bfb0013611openalex-snapshot
GCLA II A definitional approach to control
inferredcites →https://doi.org/10.1007/bfb0032046openalex-snapshot
Algebraic properties of idempotent substitutions
inferredcites →https://doi.org/10.1007/bfb0038692openalex-snapshot
A survey of GCLA: A definitional approach to logic programming
inferredcites →https://doi.org/10.1016/0304-3975(75)90011-0openalex-snapshot
A unification algorithm for typed λ-calculus
inferredcites →https://doi.org/10.1016/0304-3975(91)90028-zopenalex-snapshot
Author index volume 86 (1991)
inferredcites →https://doi.org/10.1016/b978-0-934613-32-3.50012-5openalex-snapshot
A Note on Non-Monotonic Reasoning
inferredcites →https://doi.org/10.1016/c2013-0-07699-2openalex-snapshot
Foundations of Deductive Databases and Logic Programming
inferredcites →https://doi.org/10.1016/s0049-237x(08)71120-0openalex-snapshot
An Introduction to Inductive Definitions
inferredcites →https://doi.org/10.1016/s0304-3975(06)80007-1openalex-snapshot
Partial inductive definitions
inferredcites →https://doi.org/10.1093/logcom/1.2.261openalex-snapshot
A Proof-Theoretic Approach to Logic Programming. I. Clauses as Rules
inferredcites →https://doi.org/10.1093/logcom/1.4.497openalex-snapshot
A Logic Programming Language with Lambda-Abstraction, Function Variables, and Simple Unification
inferredcites →https://doi.org/10.1093/logcom/1.5.635openalex-snapshot
A Proof-Theoretic Approach to Logic Programming

What points at this work

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

inferred← citeshttps://doi.org/10.1007/11539452_7openalex-snapshot
Model Checking for π-Calculus Using Proof Search
inferred← citeshttps://doi.org/10.1007/3-540-45685-6_14openalex-snapshot
Two-Level Meta-reasoning in Coq
inferred← citeshttps://doi.org/10.1007/3-540-58025-5_52openalex-snapshot
Finitary partial inductive definitions as a general logic
inferred← citeshttps://doi.org/10.1007/3-540-58025-5_65openalex-snapshot
Definitional reflection and the completion
inferred← citeshttps://doi.org/10.1007/978-3-319-22686-6openalex-snapshot
Advances in Proof-Theoretic Semantics
inferred← citeshttps://doi.org/10.1007/978-3-319-22686-6_16openalex-snapshot
Open Problems in Proof-Theoretic Semantics
inferred← citeshttps://doi.org/10.1007/978-3-642-31365-3_43openalex-snapshot
Stratification in Logics of Definitions
inferred← citeshttps://doi.org/10.1007/bfb0013610openalex-snapshot
Terminological reasoning and partial inductive definitions
inferred← citeshttps://doi.org/10.1007/bfb0031929openalex-snapshot
Cut-elimination in logics with definitional reflection
inferred← citeshttps://doi.org/10.1007/bfb0097795openalex-snapshot
Inverting inductively defined relations in LEGO
inferred← citeshttps://doi.org/10.1016/b978-044450813-3/50019-9openalex-snapshot
Logical Frameworks
inferred← citeshttps://doi.org/10.1016/j.entcs.2005.05.006openalex-snapshot
A Proof Search Specification of the π-Calculus
inferred← citeshttps://doi.org/10.1016/j.entcs.2005.11.072openalex-snapshot
A Game Semantics for Proof Search: Preliminary Results
inferred← citeshttps://doi.org/10.1016/j.jal.2012.07.007openalex-snapshot
Cut elimination for a logic with induction and co-induction
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00168-2openalex-snapshot
Encoding transition systems in sequent calculus
inferred← citeshttps://doi.org/10.1016/s0304-3975(99)00171-1openalex-snapshot
Cut-elimination for a logic with definitions and induction
inferred← citeshttps://doi.org/10.1093/logcom/exw013openalex-snapshot
Logics with definitional reflection rules
inferred← citeshttps://doi.org/10.1109/lics.1993.287585openalex-snapshot
Rules of definitional reflection
inferred← citeshttps://doi.org/10.1109/lics.1997.614968openalex-snapshot
A logic for reasoning with higher-order abstract syntax
inferred← citeshttps://doi.org/10.1111/an.1960.1.5.3.3openalex-snapshot
Australian National University
inferred← citeshttps://doi.org/10.1145/1094622.1094628openalex-snapshot
A proof theory for generic judgments
inferred← citeshttps://doi.org/10.1145/1656242.1656248openalex-snapshot
Proof search specifications of bisimulation and modal logics for the π-calculus
inferred← citeshttps://doi.org/10.1145/504077.504080openalex-snapshot
Reasoning with higher-order abstract syntax in a logical framework
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.