On the public citation graph

A PSPACE-complete first-order fragment of computability logic

https://doi.org/10.1145/2559949
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.1016/0168-0072(92)90073-9openalex-snapshot
A game semantics for linear logic
inferredcites →https://doi.org/10.1016/0304-3975(94)00107-3openalex-snapshot
First-order linear logic without modalities is NEXPTIME-hard
inferredcites →https://doi.org/10.1016/j.apal.2013.07.012openalex-snapshot
Introduction to clarithmetic III
inferredcites →https://doi.org/10.1016/j.ic.2011.07.002openalex-snapshot
Introduction to clarithmetic I
inferredcites →https://doi.org/10.1016/j.ic.2016.02.002openalex-snapshot
Introduction to clarithmetic II
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.2007.01.004openalex-snapshot
From truth to computability II
inferredcites →https://doi.org/10.1016/s0168-0072(03)00023-xopenalex-snapshot
Introduction to computability logic
inferredcites →https://doi.org/10.1017/cbo9780511624919openalex-snapshot
The Principles of Mathematics Revisited
inferredcites →https://doi.org/10.1093/jigpal/jzr043openalex-snapshot
Soundness and completeness of the Cirquent calculus system CL6 for computability logic
inferredcites →https://doi.org/10.1093/logcom/exl005openalex-snapshot
Introduction to Cirquent Calculus and Abstract Resource Semantics
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

What points at this work

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

inferred← citeshttps://doi.org/10.1007/978-3-030-01713-2_9openalex-snapshot
Strategic Knowledge of the Past - Expressivity and Complexity
inferred← citeshttps://doi.org/10.1007/978-3-030-40608-0_14openalex-snapshot
Pebble-Intervals Automata and FO$$^2$$ with Two Orders
inferred← citeshttps://doi.org/10.1007/978-3-030-45237-7_2openalex-snapshot
Verifying Quantum Communication Protocols with Ground Bisimulation
inferred← citeshttps://doi.org/10.1007/978-3-319-40229-1_19openalex-snapshot
On Interpolation and Symbol Elimination in Theory Extensions
inferred← citeshttps://doi.org/10.1007/978-3-319-89884-1_16openalex-snapshot
Fragment Abstraction for Concurrent Shape Analysis
inferred← citeshttps://doi.org/10.1007/978-3-319-98047-8_18openalex-snapshot
Reasoning About Weak Semantics via Strong Semantics
inferred← citeshttps://doi.org/10.1007/978-3-662-48653-5_25openalex-snapshot
Modular Verification of Concurrency-Aware Linearizability
inferred← citeshttps://doi.org/10.1007/s00165-020-00508-1openalex-snapshot
Collaborative models for autonomous systems controller synthesis
inferred← citeshttps://doi.org/10.1007/s00236-020-00367-6openalex-snapshot
SMT-based generation of symbolic automata
inferred← citeshttps://doi.org/10.1007/s10849-024-09423-7openalex-snapshot
A Propositional Cirquent Calculus for Computability Logic
inferred← citeshttps://doi.org/10.1007/s10992-019-09508-wopenalex-snapshot
Intensional Protocols for Dynamic Epistemic Logic
inferred← citeshttps://doi.org/10.1007/s11390-013-1329-1openalex-snapshot
On the Toggling-Branching Recurrence of Computability Logic
inferred← citeshttps://doi.org/10.1007/s13218-020-00657-8openalex-snapshot
crowd: A Visual Tool for Involving Stakeholders into Ontology Engineering Tasks
inferred← citeshttps://doi.org/10.1016/j.procir.2021.05.146openalex-snapshot
Supporting semantic PLM by using a lightweight engineering metadata mapping engine
inferred← citeshttps://doi.org/10.1016/j.tcs.2019.02.023openalex-snapshot
Formalized meta-theory of sequent calculi for linear logics
inferred← citeshttps://doi.org/10.1093/logcom/exu052openalex-snapshot
Relentful strategic reasoning in alternating-time temporal logic
inferred← citeshttps://doi.org/10.21146/2074-1472-2025-31-1-97-109openalex-snapshot
Thoughts on sub-Turing interactive computability
inferred← citeshttps://doi.org/10.2168/lmcs-11(1:12)2015openalex-snapshot
The Computational Complexity of Propositional Cirquent Calculus
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.3233/ida-192847openalex-snapshot
Representing and reasoning fuzzy spatio- temporal knowledge with description logics: A survey
inferred← citeshttps://doi.org/10.4204/eptcs.226.7openalex-snapshot
On the Expressive Power of Sub-Propositional Fragments of Modal 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.