


default search action
Theoretical Computer Science, Volume 357
Volume 357, Numbers 1-3, July 2006
- Sergei N. Artëmov, Michael W. Mislove

:
Preface. 1-3
- Sergei N. Artëmov:

Justified common knowledge. 4-22 - Vladimir Brezhnev, Roman Kuznets

:
Making knowledge explicit: How hard it is. 23-34 - Samuel R. Buss:

Polynomial-size Frege and resolution proofs of st-connectivity and Hex tautologies. 35-52 - Nachum Dershowitz, Claude Kirchner:

Abstract canonical presentations. 53-69 - Martin Hyland, Gordon D. Plotkin, John Power

:
Combining effects: Sum and tensor. 70-99 - Giorgi Japaridze

:
From truth to computability I. 100-135 - Nikolai V. Krupski:

On the complexity of the reflected logic of proofs. 136-142 - Vladimir Krupski:

Referential logic of proofs. 143-166 - Pavel Naumov

:
Logic of subtyping. 167-185 - Mati Pentus

:
Lambek calculus is NP-complete. 186-201 - Helmut Schwichtenberg:

An arithmetic for polynomial-time computation. 202-214 - Sergey Slavnov:

Geometrical semantics for linear logic (multiplicative fragment). 215-229 - Frédéric De Jaeger, Martín Hötzel Escardó

, Gabriele Santini:
On the computational content of the Lawson topology. 230-240 - Lisbeth Fajstrup

, Martin Raußen
, Eric Goubault:
Algebraic topology and concurrency. 241-278

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














