Volume 163; Issue 7

Annals of Pure and Applied Logic

Volume 163; Issue 7
1

Completeness results for memory logics

Year:
2012
Language:
english
File:
PDF, 292 KB
english, 2012
2

Canonical signed calculi with multi-ary quantifiers

Year:
2012
Language:
english
File:
PDF, 270 KB
english, 2012
3

Justification Logic as a foundation for certifying mobile computation

Year:
2012
Language:
english
File:
PDF, 314 KB
english, 2012
5

Towards – via proof complexity and search

Year:
2012
Language:
english
File:
PDF, 264 KB
english, 2012
6

Lower complexity bounds in justification logic

Year:
2012
Language:
english
File:
PDF, 315 KB
english, 2012
9

Tableaux and hypersequents for justification logics

Year:
2012
Language:
english
File:
PDF, 360 KB
english, 2012
10

Topological forcing semantics with settling

Year:
2012
Language:
english
File:
PDF, 245 KB
english, 2012
11

Conservativity for logics of justified belief: Two approaches

Year:
2012
Language:
english
File:
PDF, 260 KB
english, 2012
12

Unifying sets and programs via dependent types

Year:
2012
Language:
english
File:
PDF, 306 KB
english, 2012
13

Product-free Lambek calculus is NP-complete

Year:
2012
Language:
english
File:
PDF, 310 KB
english, 2012
14

Fixed point theorems on partial randomness

Year:
2012
Language:
english
File:
PDF, 270 KB
english, 2012
15

A bialgebraic approach to automata and formal language theory

Year:
2012
Language:
english
File:
PDF, 333 KB
english, 2012
16

Preface

Year:
2012
Language:
english
File:
PDF, 126 KB
english, 2012
17

Contents

Year:
2012
Language:
english
File:
PDF, 116 KB
english, 2012