Towards applied theories based on computability logic

DOI10.2178/jsl/1268917495zbMath1201.03055arXiv0805.3521MaRDI QIDQ3570163

Giorgi Japaridze

Publication date: 24 June 2010

Published in: The Journal of Symbolic Logic (Search for Journal in Brave)

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

zbMATH Keywords

Peano arithmetic; game semantics; computability logic; constructive logics

Mathematics Subject Classification ID

03B70: Logic in computer science

03F30: First-order arithmetic and fragments

03F50: Metamathematics of constructive systems

Related Items

Introduction to clarithmetic. II, Separating the basic logics of the basic recurrences, Toggling operators in computability logic, Introduction to clarithmetic. I, A new face of the branching recurrence of computability logic, Many concepts and two logics of algorithmic reduction, The taming of recurrences in computability logic through cirquent calculus. I, The countable versus uncountable branching recurrences in computability logic, Build your own clarithmetic I: Setup and completeness

Cites Work

• Sequential operators in computability logic
• Many concepts and two logics of algorithmic reduction
• Introduction to computability logic
• The intuitionistic fragment of computability logic at the propositional level
• From truth to computability. II.
• From truth to computability. I.
• Introduction to Cirquent Calculus and Abstract Resource Semantics
• The logic of interactive turing reduction
• Cirquent Calculus Deepened
• Computability Logic: A Formal Theory of Interaction
• Propositional computability logic I
• Propositional computability logic II