Cirquent Calculus in a Nutshell

DOI10.21146/2074-1472-2022-28-1-125-141OpenAlexW3196962987WikidataQ114005554 ScholiaQ114005554MaRDI QIDQ5059715

Giorgi Japaridze, Bikal Lamichhane

Publication date: 16 January 2023

Published in: Logical Investigations (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2108.12552

zbMATH Keywords

sequent calculuslinear logiccomputability logicresource semanticscirquent calculusaffine logic

Mathematics Subject Classification ID

Mathematical logic and foundations (03-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• A cirquent calculus system with clustering and ranking
• A game semantics for linear logic
• Introduction to computability logic
• The taming of recurrences in computability logic through cirquent calculus. II
• The taming of recurrences in computability logic through cirquent calculus. I
• Soundness and completeness of the Cirquent calculus system CL6 for computability logic
• On linear rewriting systems for Boolean logic and some applications to proof theory
• From formulas to cirquents in computability logic
• Introduction to Cirquent Calculus and Abstract Resource Semantics
• A propositional system induced by Japaridze's approach to IF logic
• Elementary-base cirquent calculus II: Choice quantifiers
• The Computational Complexity of Propositional Cirquent Calculus

This page was built for publication: Cirquent Calculus in a Nutshell