Thoughts on sub-Turing interactive computability

DOI10.21146/2074-1472-2025-31-1-97-109MaRDI QIDQ6946020zbMATH OpenFDO

Authors Giorgi Japaridze

Publication date 7 August 2025

Published in Logicheskie Issledovaniya (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial 4.0 International

Full work available at URL https://doi.org/10.21146/2074-1472-2025-31-1-97-109

zbMATH Keywords

computability logicgame semanticsinteractive computation

Mathematics Subject Classification ID

Mathematical logic and foundations (03-XX)

Cites work

• A game semantics for linear logic
• A PSPACE-complete first-order fragment of computability logic
• An unsolvable problem of elementary number theory.
• Degrees of indeterminacy of games
• Dialogues, strategies, and intuitionistic provability
• scientific article; zbMATH DE number 3399180 (Why is no real title available?)
• scientific article; zbMATH DE number 3190338 (Why is no real title available?)
• scientific article; zbMATH DE number 7594254 (Why is no real title available?)
• Interactive Computation
• Introduction to computability logic
• Linear logic
• On abstract resource semantics and computability logic
• On computable numbers, with an application to the Entscheidungsproblem.
• On the toggling-branching recurrence of computability logic
• Soundness and completeness of the cirquent calculus system CL6 for computability logic

This page was built for publication: Thoughts on sub-Turing interactive computability

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