Elementary-base cirquent calculus. II: Choice quantifiers

DOI10.1093/JIGPAL/JZAA022MaRDI QIDQ5014061zbMATH OpenOpenAlexFDO

Authors Giorgi Japaridze

Publication date 3 December 2021

Published in Logic Journal of the IGPL (Search for Journal in Brave)

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

zbMATH Keywords

cirquent calculuscomputability logicdeep inferenceproof theoryresource semantics

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Logic in computer science (03B70) Logic with extra quantifiers and operators (03C80) Proof theory in general (including proof-theoretic semantics) (03F03)

Abstract: Cirquent calculus is a novel proof theory permitting component-sharing between logical expressions. Using it, the predecessor article "Elementary-base cirquent calculus I: Parallel and choice connectives" built the sound and complete axiomatization CL16 of a propositional fragment of computability logic (see http://www.csc.villanova.edu/~japaridz/CL/ ). The atoms of the language of CL16 represent elementary, i.e., moveless, games, and the logical vocabulary consists of negation, parallel connectives and choice connectives. The present paper constructs the first-order version CL17 of CL16, also enjoying soundness and completeness. The language of CL17 augments that of CL18 by including choice quantifiers. Unlike classical predicate calculus, CL17 turns out to be decidable.

Recommendations

• scientific article; zbMATH DE number 7594103
• A cirquent calculus system with clustering and ranking
• From formulas to cirquents in computability logic
• The computational complexity of propositional cirquent calculus
• The taming of recurrences in computability logic through cirquent calculus. I

Cited in

(6)

• Deduction theorem for symmetric cirquent calculus
• Introduction to Cirquent Calculus and Abstract Resource Semantics
• Cirquent Calculus in a Nutshell
• scientific article; zbMATH DE number 3296225 (Why is no real title available?)
• scientific article; zbMATH DE number 7594103 (Why is no real title available?)
• A propositional cirquent calculus for computability logic.

This page was built for publication: Elementary-base cirquent calculus. II: Choice quantifiers

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