A propositional cirquent calculus for computability logic.

DOI10.1007/S10849-024-09423-7MaRDI QIDQ6661240zbMATH OpenFDO

Authors Giorgi Japaridze

Publication date 13 January 2025

Published in Journal of Logic, Language and Information (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S10849-024-09423-7

zbMATH Keywords

cirquent calculusclusteringcomputability logicdeep inferenceproof theoryresource semantics

Mathematics Subject Classification ID

Mathematical logic and foundations (03-XX) Substructural logics (including relevance, entailment, linear logic, Lambek calculus, BCK and BCI logics) (03B47) Logic in computer science (03B70) Proof theory in general (including proof-theoretic semantics) (03F03) Complexity of proofs (03F20) Computer science (68-XX)

Cites work

• A cirquent calculus system with clustering and ranking
• A constructive analysis of RM
• A game semantics for linear logic
• A Local System for Classical Logic
• A logical basis for constructive systems
• A propositional system induced by Japaridze's approach to IF logic
• A PSPACE-complete first-order fragment of computability logic
• Cirquent Calculus Deepened
• Degrees of indeterminacy of games
• Elementary-base cirquent calculus. II: Choice quantifiers
• From formulas to cirquents in computability logic
• From truth to computability. I.
• From truth to computability. II.
• scientific article; zbMATH DE number 976409 (Why is no real title available?)
• scientific article; zbMATH DE number 1841813 (Why is no real title available?)
• scientific article; zbMATH DE number 3399180 (Why is no real title available?)
• scientific article; zbMATH DE number 3190338 (Why is no real title available?)
• scientific article; zbMATH DE number 7594103 (Why is no real title available?)
• scientific article; zbMATH DE number 7669414 (Why is no real title available?)
• In the beginning was game semantics
• Introduction to Cirquent Calculus and Abstract Resource Semantics
• Introduction to computability logic
• Linear logic
• Many concepts and two logics of algorithmic reduction
• On abstract resource semantics and computability logic
• On linear rewriting systems for Boolean logic and some applications to proof theory
• On the proof complexity of deep inference
• On the system CL12 of computability logic
• On the toggling-branching recurrence of computability logic
• Propositional computability logic I
• Propositional computability logic II
• Separating the basic logics of the basic recurrences
• Sequential operators in computability logic
• Soundness and completeness of the cirquent calculus system CL6 for computability logic
• The computational complexity of propositional cirquent calculus
• The countable versus uncountable branching recurrences in computability logic
• The intuitionistic fragment of computability logic at the propositional level
• The logic of interactive turing reduction
• The parallel versus branching recurrences in computability logic
• The taming of recurrences in computability logic through cirquent calculus. I
• The taming of recurrences in computability logic through cirquent calculus. II
• Toggling operators in computability logic

This page was built for publication: A propositional cirquent calculus for computability logic.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6661240)