Cirquent Calculus in a Nutshell
From MaRDI portal
Recommendations
- Introduction to Cirquent Calculus and Abstract Resource Semantics
- Cirquent Calculus Deepened
- The taming of recurrences in computability logic through cirquent calculus. II
- The computational complexity of propositional cirquent calculus
- The taming of recurrences in computability logic through cirquent calculus. I
Cites work
- A cirquent calculus system with clustering and ranking
- A game semantics for linear logic
- A propositional system induced by Japaridze's approach to IF logic
- Elementary-base cirquent calculus. II: Choice quantifiers
- From formulas to cirquents in computability logic
- scientific article; zbMATH DE number 7594103 (Why is no real title available?)
- scientific article; zbMATH DE number 7594254 (Why is no real title available?)
- Introduction to Cirquent Calculus and Abstract Resource Semantics
- Introduction to computability logic
- On linear rewriting systems for Boolean logic and some applications to proof theory
- Soundness and completeness of the cirquent calculus system CL6 for computability logic
- The computational complexity of propositional cirquent calculus
- The taming of recurrences in computability logic through cirquent calculus. I
- The taming of recurrences in computability logic through cirquent calculus. II
Cited in
(3)
This page was built for publication: Cirquent Calculus in a Nutshell
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5059715)