Computability logic: Giving Caesar what belongs to Caesar

02/14/2019
by   Giorgi Japaridze, et al.
0

The present article is a brief informal survey of computability logic --- the game-semantically conceived formal theory of computational resources and tasks. This relatively young nonclassical logic is a conservative extension of classical first order logic but is much more expressive than the latter, yielding a wide range of new potential application areas. In a reasonable (even if not strict) sense the same holds for intuitionistic and linear logics, which allows us to say that CoL reconciles and unifies the three traditions of logical thought (and beyond) on the basis of its natural and "universal" game semantics. A comprehensive online survey of the subject can be found at http://www.csc.villanova.edu/ japaridz/CL/ .

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/01/2019

Fundamentals of computability logic

This article is a semitutorial-style survey of computability logic. An e...
research
09/23/2020

A Game Theoretical Semantics for Logics of Nonsense

Logics of non-sense allow a third truth value to express propositions th...
research
06/11/2009

From formulas to cirquents in computability logic

Computability logic (CoL) (see http://www.cis.upenn.edu/ giorgi/cl.html)...
research
06/01/2022

Games for Hybrid Logic – From Semantic Games to Analytic Calculi

Game semantics and winning strategies offer a potential conceptual bridg...
research
12/16/2019

On the Unity of Logic: a Sequential, Unpolarized Approach

The present work aims to give a unity of logic via standard sequential, ...
research
07/27/2017

A New Game Equivalence and its Modal Logic

We revisit the crucial issue of natural game equivalences, and semantics...
research
04/24/2014

Gradual Classical Logic for Attributed Objects

There is knowledge. There is belief. And there is tacit agreement.' 'We ...

Please sign up or login with your details

Forgot password? Click here to reset