Many concepts and two logics of algorithmic reduction

DOI10.1007/s11225-009-9164-7zbMath1162.03016arXiv0706.0103OpenAlexW1794149593MaRDI QIDQ1005975

Giorgi Japaridze

Publication date: 17 March 2009

Published in: Studia Logica (Search for Journal in Brave)

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

zbMATH Keywords

linear logicintuitionistic logicgame semanticscomputability logicinteractive computationaffine logic

Mathematics Subject Classification ID

Logic in computer science (03B70)

Related Items

The parallel versus branching recurrences in computability logic ⋮ The taming of recurrences in computability logic through cirquent calculus. I ⋮ Separating the basic logics of the basic recurrences ⋮ Toggling operators in computability logic ⋮ The countable versus uncountable branching recurrences in computability logic ⋮ On the toggling-branching recurrence of computability logic ⋮ Introduction to clarithmetic. I ⋮ Towards applied theories based on computability logic ⋮ On abstract resource semantics and computability logic ⋮ Sequential operators in computability logic

Cites Work

• Unnamed Item
• Linear logic
• Sequential operators in computability logic
• A game semantics for linear logic
• 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
• Towards applied theories based on computability logic
• In the beginning was game semantics
• Games and full completeness for multiplicative linear logic
• Computability Logic: A Formal Theory of Interaction
• Intuitionistic computability logic
• Degrees of indeterminacy of games

This page was built for publication: Many concepts and two logics of algorithmic reduction