On the public citation graph

Introduction to Cirquent Calculus and Abstract Resource Semantics

https://doi.org/10.1093/logcom/exl005
0 signed · 56 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.19630091206openalex-snapshot
Über Tautologien, in Welchen Keine Variable Mehr Als Zweimal Vorkommt
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/3-540-44802-0_5openalex-snapshot
Non-commutativity and MELL in the Calculus of Structures
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(87)90045-4openalex-snapshot
Linear 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.2007.01.004openalex-snapshot
From truth to computability II
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.1016/s0168-0072(97)00046-8openalex-snapshot
A constructive game semantics for the language of linear logic
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.1305/ndjfl/1038234610openalex-snapshot
The Propositional Logic of Elementary Tasks

What points at this work

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

inferred← citeshttps://doi.org/10.1007/11829263_2openalex-snapshot
Research Perspectives for Logic and Deduction
inferred← citeshttps://doi.org/10.1007/978-1-4020-9374-6_11openalex-snapshot
In the Beginning was Game Semantics?
inferred← citeshttps://doi.org/10.1007/978-3-540-69937-8_4openalex-snapshot
On Game Semantics of the Affine and Intuitionistic Logics
inferred← citeshttps://doi.org/10.1007/978-3-642-15660-1_9openalex-snapshot
Deduction Theorem for Symmetric Cirquent Calculus
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/s10849-024-09423-7openalex-snapshot
A Propositional Cirquent Calculus for Computability Logic
inferred← citeshttps://doi.org/10.1007/s11225-009-9164-7openalex-snapshot
Many Concepts and Two Logics of Algorithmic Reduction
inferred← citeshttps://doi.org/10.1016/j.aml.2011.11.023openalex-snapshot
A new face of the branching recurrence of computability logic
inferred← citeshttps://doi.org/10.1016/j.apal.2007.05.001openalex-snapshot
The intuitionistic fragment of computability logic at the propositional level
inferred← citeshttps://doi.org/10.1016/j.apal.2011.11.009openalex-snapshot
Separating the basic logics of the basic recurrences
inferred← citeshttps://doi.org/10.1016/j.ic.2008.10.001openalex-snapshot
Sequential operators in computability logic
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.1016/j.jal.2012.05.001openalex-snapshot
The countable versus uncountable branching recurrences in computability logic
inferred← citeshttps://doi.org/10.1016/j.jal.2016.04.003openalex-snapshot
A cirquent calculus system with clustering and ranking
inferred← citeshttps://doi.org/10.1016/j.jcss.2009.10.008openalex-snapshot
On abstract resource semantics and computability logic
inferred← citeshttps://doi.org/10.1016/j.tcs.2006.03.014openalex-snapshot
From truth to computability I
inferred← citeshttps://doi.org/10.1016/j.tcs.2007.01.004openalex-snapshot
From truth to computability II
inferred← citeshttps://doi.org/10.1016/j.tcs.2010.11.037openalex-snapshot
Toggling operators in computability logic
inferred← citeshttps://doi.org/10.1093/jigpal/jzaa022openalex-snapshot
Elementary-base cirquent calculus II: Choice quantifiers
inferred← citeshttps://doi.org/10.1093/jigpal/jzr043openalex-snapshot
Soundness and completeness of the Cirquent calculus system CL6 for computability logic
inferred← citeshttps://doi.org/10.1093/jigpal/jzu020openalex-snapshot
A propositional system induced by Japaridze's approach to IF logic
inferred← citeshttps://doi.org/10.1093/logcom/exn019openalex-snapshot
Cirquent Calculus Deepened
inferred← citeshttps://doi.org/10.1093/logcom/exr009openalex-snapshot
A logical basis for constructive systems
inferred← citeshttps://doi.org/10.1145/2559949openalex-snapshot
A PSPACE-complete first-order fragment of computability logic
inferred← citeshttps://doi.org/10.1145/2559950openalex-snapshot
Improved witnessing and local improvement principles for second-order bounded arithmetic
inferred← citeshttps://doi.org/10.1215/00294527-1731389openalex-snapshot
The Parallel versus Branching Recurrences in Computability Logic
inferred← citeshttps://doi.org/10.1587/transinf.2019fcl0003openalex-snapshot
A Heuristic Proof Procedure for First-Order Logic
inferred← citeshttps://doi.org/10.21146/2074-1472-2022-28-1-125-141openalex-snapshot
Cirquent Calculus in a Nutshell
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.2168/lmcs-7(2:1)2011openalex-snapshot
From formulas to cirquents in computability logic
inferred← citeshttps://doi.org/10.2178/jsl/1268917495openalex-snapshot
Towards applied theories based on computability logic
inferred← citeshttps://doi.org/10.29007/6wtmopenalex-snapshot
A Simple Token Game and its Logic
inferred← citeshttps://doi.org/10.4148/1944-3676.1074openalex-snapshot
Ptarithmetic
inferred← citeshttps://doi.org/10.46298/lmcs-19(2:11)2023openalex-snapshot
Enumerating Independent Linear Inferences
inferred← citeshttps://doi.org/10.48550/arxiv.0911.5262openalex-snapshot
Quantifying Resource Use in Computations
inferred← citeshttps://doi.org/10.48550/arxiv.1003.2123openalex-snapshot
Quantifying Shannon's Work Function for Cryptanalytic Attacks
inferred← citeshttps://doi.org/10.48550/arxiv.1201.4856openalex-snapshot
A PSPACE-Complete First Order Fragment of Computability Logic
inferred← citeshttps://doi.org/10.48550/arxiv.1311.6542openalex-snapshot
Implementing program extraction from CL1-proofs
inferred← citeshttps://doi.org/10.48550/arxiv.1707.04823openalex-snapshot
Elementary-base cirquent calculus I: Parallel and choice connectives
inferred← citeshttps://doi.org/10.48550/arxiv.2004.12941openalex-snapshot
Beyond formulas-as-cographs: an extension of Boolean logic to arbitrary graphs
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.