Log In Sign Up

On the Unity of Logic: a Sequential, Unpolarized Approach

by   Norihiro Yamada, et al.

The present work aims to give a unity of logic via standard sequential, unpolarized games. Specifically, our vision is that there must be mathematically precise concepts of linear refinement and intuitionistic restriction of logic such that the linear refinement of classical logic (CL) coincides with (classical) linear logic (LL), and its intuitionistic restriction with the linear refinement of intuitionistic logic (IL) into intuitionistic LL (ILL). However, LL is, in contradiction to the name, cannot be the linear refinement of CL at least from the game-semantic point of view due to its concurrency and polarization. In fact, existing game semantics of LL employs concurrency, which is rather exotic to game semantics of ILL, IL or CL. Also, linear negation in LL is never true in (game semantics of) ILL, IL or CL. In search for the truly linear refinement of CL, we carve out (a sequent calculus of) linear logic negative (LL^-) from (the two-sided sequent calculus of) LL, and introducing a new distribution axiom ! ? A ? ! A (for a translation of sequents ΔΓ for CL into the sequents ! Δ ? Γ for LL^-). We then give a categorical semantics of LL^-, for which we introduce why not monad ?, dual to the well-known of course comonad !, giving a categorical translation Δ→Γ = ? (ΔΓ) ! Δ ? Γ of CL into LL^-, which is the Kleisli extension of the standard translation Δ→Γ = ! ΔΓ of IL into ILL. Moreover, we instantiate the categorical semantics by fully complete (sequential, unpolarized) game semantics of LL^- (without atoms), for which we introduce linearity of strategies.


page 1

page 2

page 3

page 4


A categorical reduction system for linear logic

We build calculus on the categorical model of linear logic. It enables u...

Pomset logic: a logical and grammatical alternative to the Lambek calculus

Thirty years ago, I introduced a non commutative variant of classical li...

Game Comonads Generalised Quantifiers

Game comonads, introduced by Abramsky, Dawar and Wang and developed by A...

Truth and Preferences – A Game Approach for Qualitative Choice Logic

In this paper, we introduce game-theoretic semantics (GTS) for Qualitati...

A Sampling-Aware Interpretation of Linear Logic: Syntax and Categorical Semantics

The usual resource interpretation of linear logic says that variables ha...

Concurrent Separation Logic Meets Template Games

An old dream of concurrency theory and programming language semantics ha...

Computability logic: Giving Caesar what belongs to Caesar

The present article is a brief informal survey of computability logic --...