Volume 357; Issue 1-3

Theoretical Computer Science

Volume 357; Issue 1-3
1

Justified common knowledge

Year:
2006
Language:
english
File:
PDF, 304 KB
english, 2006
2

Making knowledge explicit: How hard it is

Year:
2006
Language:
english
File:
PDF, 219 KB
english, 2006
3

Polynomial-size Frege and resolution proofs of st-connectivity and Hex tautologies

Year:
2006
Language:
english
File:
PDF, 326 KB
english, 2006
4

From truth to computability I

Year:
2006
Language:
english
File:
PDF, 448 KB
english, 2006
5

On the complexity of the reflected logic of proofs

Year:
2006
Language:
english
File:
PDF, 175 KB
english, 2006
6

Logic of subtyping

Year:
2006
Language:
english
File:
PDF, 308 KB
english, 2006
7

Lambek calculus is NP-complete

Year:
2006
Language:
english
File:
PDF, 320 KB
english, 2006
8

An arithmetic for polynomial-time computation

Year:
2006
Language:
english
File:
PDF, 225 KB
english, 2006
9

Geometrical semantics for linear logic (multiplicative fragment)

Year:
2006
Language:
english
File:
PDF, 227 KB
english, 2006
10

On the computational content of the Lawson topology

Year:
2006
Language:
english
File:
PDF, 213 KB
english, 2006
11

Editorial board v-ix

Year:
2006
Language:
english
File:
PDF, 117 KB
english, 2006
12

Author index

Year:
2006
Language:
english
File:
PDF, 112 KB
english, 2006
13

Preface

Year:
2006
Language:
english
File:
PDF, 118 KB
english, 2006
14

Abstract canonical presentations

Year:
2006
Language:
english
File:
PDF, 248 KB
english, 2006
15

Combining effects: Sum and tensor

Year:
2006
Language:
english
File:
PDF, 451 KB
english, 2006
16

Referential logic of proofs

Year:
2006
Language:
english
File:
PDF, 377 KB
english, 2006
17

Algebraic topology and concurrency

Year:
2006
Language:
english
File:
PDF, 660 KB
english, 2006