Computability logic: a formal theory of interaction

DOI10.1007/3-540-34874-3_9zbMATH Open1266.03046arXivcs/0404024OpenAlexW1484853361MaRDI QIDQ4928705FDOQ4928705

Authors: Giorgi Japaridze 

Publication date: 18 June 2013

Published in: Interactive Computation (Search for Journal in Brave)

Abstract: Computability logic is a formal theory of (interactive) computability in the same sense as classical logic is a formal theory of truth. This approach was initiated very recently in "Introduction to computability logic" (Annals of Pure and Applied Logic 123 (2003), pp.1-99). The present paper reintroduces computability logic in a more compact and less technical way. It is written in a semitutorial style with a general computer science, logic or mathematics audience in mind. An Internet source on the subject is available at http://www.cis.upenn.edu/~giorgi/cl.html, and additional material at http://www.csc.villanova.edu/~japaridz/CL/gsoll.html .

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

Recommendations

• From truth to computability. I.
• Introduction to computability logic
• Propositional computability logic I
• Computability logic: giving Caesar what belongs to Caesar
• From truth to computability. II.

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Logic in computer science (03B70) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cited In (19)

• On the toggling-branching recurrence of computability logic
• On the concurrent computational content of intermediate logics
• Separating the basic logics of the basic recurrences
• Introduction to clarithmetic. I
• Toggling operators in computability logic
• Verifying of interface assertions for infinite state Mealy machines
• Many concepts and two logics of algorithmic reduction
• Sequential operators in computability logic
• Introduction to computability logic
• Computability and realizability for interactive computations
• On the system CL12 of computability logic
• Title not available (Why is that?)
• The intuitionistic fragment of computability logic at the propositional level
• Computable models of the law. Languages, dialogues, games, ontologies
• From truth to computability. II.
• From truth to computability. I.
• Build your own clarithmetic I: Setup and completeness
• Towards applied theories based on computability logic
• Computing compliance

This page was built for publication: Computability logic: a formal theory of interaction

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