On the public citation graph
Predicative functional recurrence and poly-space
0 signed · 35 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 this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/3-540-58140-5_23openalex-snapshot
Predicative recurrence in finite types
inferredcites →https://doi.org/10.1007/3-540-60178-3_84openalex-snapshot
Intrinsic theories and computational complexity
inferredcites →https://doi.org/10.1007/978-1-4612-2566-9_11openalex-snapshot
Ramified Recurrence and Computational Complexity I: Word Recurrence and Poly-time
inferredcites →https://doi.org/10.1007/978-1-4612-2566-9_2openalex-snapshot
Predicative Recursion and The Polytime Hierarchy
inferredcites →https://doi.org/10.1007/978-1-4612-3466-1_16openalex-snapshot
Subrecursion and lambda representation over free algebras
inferredcites →https://doi.org/10.1007/978-3-540-92687-0openalex-snapshot
Logical Foundations of Computer Science
inferredcites →https://doi.org/10.1007/bf01201998openalex-snapshot
A new recursion-theoretic characterization of the polytime functions
inferredcites →https://doi.org/10.1007/bfb0022277openalex-snapshot
Ramified recurrence and computational complexity II: Substitution and poly-space
inferredcites →https://doi.org/10.1016/0022-0000(83)90008-9openalex-snapshot
A view of computability on term algebras
inferredcites →https://doi.org/10.1016/j.hm.2003.07.003openalex-snapshot
From Frege to Gödel. A Source Book in Mathematical Logic, 1879–1931
inferredcites →https://doi.org/10.1109/sct.1992.215394openalex-snapshot
Functional characterizations of uniform log-depth and polylog-depth circuit families
inferredcites →https://doi.org/10.1109/sfcs.1991.185389openalex-snapshot
A new characterization of Mehlhorn's polynomial time functionals
inferredcites →https://doi.org/10.1111/j.1746-8361.1958.tb01464.xopenalex-snapshot
Über eine bisher noch nicht benützte Erweiterung des finiten Standpunktes
inferredcites →https://doi.org/10.1137/s0097539794263452openalex-snapshot
A new Characterization of Type-2 Feasibility
inferredcites →https://doi.org/10.1145/158511.158659openalex-snapshot
Stratified functional programs and computational complexity
inferredcites →https://doi.org/10.1515/9781400858927openalex-snapshot
Predicative Arithmetic. (MN-32)
inferredcites →https://doi.org/10.2307/2270886openalex-snapshot
Alan Cobham. The intrinsic computational difficulty of functions. Logic, methodology and philosophy of science, Proceedings of the 1964 International Congress, edited by Yehoshua Bar-Hillel, Studies in logic and the foundations of mathematics, North-Holland Publishing Company, Amsterdam 1965, pp.…
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11784180_8openalex-snapshot
Some Programming Languages for Logspace and Ptime
inferred← citeshttps://doi.org/10.1007/3-540-45413-6_2openalex-snapshot
From Bounded Arithmetic to Memory Management: Use of Type Theory to Capture Complexity Classes and Space Behaviour
inferred← citeshttps://doi.org/10.1007/978-0-387-35608-2_41openalex-snapshot
Substructural Verification and Computational Feasibility
inferred← citeshttps://doi.org/10.1007/978-3-642-37075-5_20openalex-snapshot
Type-Based Complexity Analysis for Fork Processes
inferred← citeshttps://doi.org/10.1007/bfb0028020openalex-snapshot
A mixed modal/linear lambda calculus with applications to bellantoni-cook safe recursion
inferred← citeshttps://doi.org/10.1016/j.entcs.2008.03.066openalex-snapshot
Soft Linear Logic and Polynomial Complexity Classes
inferred← citeshttps://doi.org/10.1016/s0168-0072(00)00010-5openalex-snapshot
Safe recursion with higher types and BCK-algebra
inferred← citeshttps://doi.org/10.1016/s0168-0072(98)00040-2openalex-snapshot
Ramified recurrence and computational complexity III: Higher type recurrence and elementary complexity
inferred← citeshttps://doi.org/10.1016/s0304-3975(99)00209-1openalex-snapshot
A characterization of alternating log time by ramified recurrence
inferred← citeshttps://doi.org/10.1109/sfcs.1998.743522openalex-snapshot
A characterization of NC by tree recurrence
inferred← citeshttps://doi.org/10.1145/2159531.2159540openalex-snapshot
An Implicit Characterization of PSPACE
inferred← citeshttps://doi.org/10.4204/eptcs.23.3openalex-snapshot
Church => Scott = Ptime: an application of resource sensitive realizability
inferred← citeshttps://doi.org/10.48550/arxiv.0907.5527openalex-snapshot
Proof Theory at Work: Complexity Analysis of Term Rewrite Systems
inferred← citeshttps://doi.org/10.48550/arxiv.1006.0030openalex-snapshot
An Implicit Characterization of PSPACE
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.