On the public citation graph

A logical basis for constructive systems

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.
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/3-540-16486-3_91openalex-snapshot
The polynomial hierarchy and intuitionistic Bounded Arithmetic
inferredcites →https://doi.org/10.1007/3-540-34874-3_9openalex-snapshot
Computability Logic: A Formal Theory of Interaction
inferredcites →https://doi.org/10.1007/s11225-009-9164-7openalex-snapshot
Many Concepts and Two Logics of Algorithmic Reduction
inferredcites →https://doi.org/10.1016/0022-0000(88)90028-1openalex-snapshot
Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classes
inferredcites →https://doi.org/10.1016/0168-0072(92)90073-9openalex-snapshot
A game semantics for linear logic
inferredcites →https://doi.org/10.1016/j.apal.2007.05.001openalex-snapshot
The intuitionistic fragment of computability logic at the propositional level
inferredcites →https://doi.org/10.1016/j.ic.2008.10.001openalex-snapshot
Sequential operators in computability logic
inferredcites →https://doi.org/10.1016/j.jcss.2009.10.008openalex-snapshot
On abstract resource semantics and computability logic
inferredcites →https://doi.org/10.1016/j.tcs.2006.03.014openalex-snapshot
From truth to computability I
inferredcites →https://doi.org/10.1016/j.tcs.2006.03.019openalex-snapshot
An arithmetic for polynomial-time computation
inferredcites →https://doi.org/10.1016/j.tcs.2007.01.004openalex-snapshot
From truth to computability II
inferredcites →https://doi.org/10.1016/j.tcs.2010.11.037openalex-snapshot
Toggling operators in computability logic
inferredcites →https://doi.org/10.1016/s0168-0072(01)00123-3openalex-snapshot
The logic of tasks
inferredcites →https://doi.org/10.1016/s0168-0072(03)00023-xopenalex-snapshot
Introduction to computability logic
inferredcites →https://doi.org/10.1093/logcom/exl005openalex-snapshot
Introduction to Cirquent Calculus and Abstract Resource Semantics
inferredcites →https://doi.org/10.1093/logcom/exn019openalex-snapshot
Cirquent Calculus Deepened
inferredcites →https://doi.org/10.1137/0218012openalex-snapshot
The Knowledge Complexity of Interactive Proof Systems
inferredcites →https://doi.org/10.1145/1131313.1131318openalex-snapshot
Propositional computability logic I
inferredcites →https://doi.org/10.1145/1131313.1131319openalex-snapshot
Propositional computability logic II
inferredcites →https://doi.org/10.1145/322234.322243openalex-snapshot
Alternation
inferredcites →https://doi.org/10.2178/jsl/1174668394openalex-snapshot
The logic of interactive turing reduction
inferredcites →https://doi.org/10.2178/jsl/1268917495openalex-snapshot
Towards applied theories based on computability logic
inferredcites →https://doi.org/10.2307/2275407openalex-snapshot
Games and full completeness for multiplicative linear logic
inferredcites →https://doi.org/10.4064/fm-77-2-151-166openalex-snapshot
Degrees of indeterminacy of games
inferredcites →https://doi.org/10.48550/arxiv.cs/0411008openalex-snapshot
Intuitionistic computability logic

What points at this work

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

inferred← citeshttps://doi.org/10.1007/s00153-012-0313-8openalex-snapshot
The taming of recurrences in computability logic through cirquent calculus, Part I
inferred← citeshttps://doi.org/10.1007/s00153-012-0314-7openalex-snapshot
The taming of recurrences in computability logic through cirquent calculus, Part II
inferred← citeshttps://doi.org/10.1007/s10849-024-09423-7openalex-snapshot
A Propositional Cirquent Calculus for Computability Logic
inferred← citeshttps://doi.org/10.1016/j.apal.2013.07.012openalex-snapshot
Introduction to clarithmetic III
inferred← citeshttps://doi.org/10.1016/j.ic.2011.07.002openalex-snapshot
Introduction to clarithmetic I
inferred← citeshttps://doi.org/10.1016/j.ic.2016.02.002openalex-snapshot
Introduction to clarithmetic II
inferred← citeshttps://doi.org/10.2168/lmcs-11(3:1)2015openalex-snapshot
On the system CL12 of computability logic
inferred← citeshttps://doi.org/10.2168/lmcs-12(3:8)2016openalex-snapshot
Build your own clarithmetic I: Setup and completeness
inferred← citeshttps://doi.org/10.2168/lmcs-7(2:1)2011openalex-snapshot
From formulas to cirquents in computability logic
inferred← citeshttps://doi.org/10.48550/arxiv.1707.04823openalex-snapshot
Elementary-base cirquent calculus I: Parallel and choice connectives
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.