Introduction to clarithmetic. I
From MaRDI portal
Publication:642523
DOI10.1016/j.ic.2011.07.002zbMath1243.03075arXiv1003.4719MaRDI QIDQ642523
Publication date: 27 October 2011
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1003.4719
Peano arithmetic; bounded arithmetic; game semantics; computability logic; implicit computational complexity; interactive computation
03B70: Logic in computer science
03F30: First-order arithmetic and fragments
03F50: Metamathematics of constructive systems
Related Items
A PSPACE-complete first-order fragment of computability logic, Introduction to clarithmetic. II, Introduction to clarithmetic. III, The taming of recurrences in computability logic through cirquent calculus. I, Build your own clarithmetic I: Setup and completeness
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Introduction to clarithmetic. II
- Introduction to clarithmetic. III
- Toggling operators in computability logic
- On abstract resource semantics and computability logic
- Sequential operators in computability logic
- Many concepts and two logics of algorithmic reduction
- Bounded arithmetic for NC, ALogTIME, L and NL
- A game semantics for linear logic
- Bounded linear logic: A modular approach to polynomial-time computability
- Light linear logic
- Introduction to computability logic
- An arithmetic for non-size-increasing polynomial-time computation
- The intuitionistic fragment of computability logic at the propositional level
- From truth to computability. II.
- From truth to computability. I.
- An arithmetic for polynomial-time computation
- A logical basis for constructive systems
- 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
- Games and full completeness for multiplicative linear logic
- A new “feasible” arithmetic
- Computability Logic: A Formal Theory of Interaction
- Propositional computability logic I
- Propositional computability logic II
- Intuitionistic computability logic
- Degrees of indeterminacy of games
