Build your own clarithmetic I: Setup and completeness

DOI10.2168/LMCS-12(3:8)2016zbMath1445.03065arXiv1510.08564MaRDI QIDQ2974779

Giorgi Japaridze

Publication date: 11 April 2017

Published in: Logical Methods in Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

Peano arithmeticbounded arithmeticgame semanticscomputability logicimplicit computational complexityinteractive computation

Mathematics Subject Classification ID

Logic in computer science (03B70) Complexity of computation (including implicit computational complexity) (03D15) First-order arithmetic and fragments (03F30) Metamathematics of constructive systems (03F50) Abstract and axiomatic computability and recursion theory (03D75)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Introduction to clarithmetic. II
• A cirquent calculus system with clustering and ranking
• Introduction to clarithmetic. III
• Separating the basic logics of the basic recurrences
• Linear logic
• Toggling operators in computability logic
• Introduction to clarithmetic. I
• A new face of the branching recurrence of computability logic
• On abstract resource semantics and computability logic
• Sequential operators in computability logic
• The realm of primitive recursion
• A game semantics for linear logic
• Bounded linear logic: A modular approach to polynomial-time computability
• A new recursion-theoretic characterization of the polytime functions
• Light linear logic
• Introduction to computability logic
• Higher type recursion, ramification and polynomial time
• Safe recursion with higher types and BCK-algebra
• An arithmetic for non-size-increasing polynomial-time computation
• The parallel versus branching recurrences in computability logic
• The taming of recurrences in computability logic through cirquent calculus. II
• The taming of recurrences in computability logic through cirquent calculus. I
• The countable versus uncountable branching recurrences in computability logic
• The intuitionistic fragment of computability logic at the propositional level
• From truth to computability. II.
• On the toggling-branching recurrence of computability logic
• From truth to computability. I.
• An arithmetic for polynomial-time computation
• A logical basis for constructive systems
• Soundness and completeness of the Cirquent calculus system CL6 for computability logic
• On the system CL12 of computability logic
• Build your own clarithmetic II: Soundness
• From formulas to cirquents in computability logic
• Introduction to Cirquent Calculus and Abstract Resource Semantics
• The logic of interactive turing reduction
• Cirquent Calculus Deepened
• Towards applied theories based on computability logic
• In the beginning was game semantics
• A new “feasible” arithmetic
• Computability Logic: A Formal Theory of Interaction
• The Computational Complexity of Propositional Cirquent Calculus
• Propositional computability logic I
• Propositional computability logic II
• Interactive Computation
• A PSPACE-complete first-order fragment of computability logic
• Degrees of indeterminacy of games
• Existence and feasibility in arithmetic

This page was built for publication: Build your own clarithmetic I: Setup and completeness