|
Journal description
All volumes of the corresponding journal
All issues of the corresponding volume
All articles of the corresponding issues
13 results found
| no | title | author | magazine | year | volume | issue | page(s) | type |
| 1 | Δ 0-complexity of the relation y = Π i ⩽ n F(i) |
Berarducci, Alessandro |
1995 |
75 | 1-2 |
p. 49-56 8 p. |
article |
|
| 2 | Editorial Board |
1995 |
75 | 1-2 |
p. ii- 1 p. |
article |
||
| 3 | Generalizing theorems in real closed fields |
Baaz, Matthias |
1995 |
75 | 1-2 |
p. 3-23 21 p. |
article |
|
| 4 | Iterated local reflection versus iterated consistency |
Beklemishev, Lev |
1995 |
75 | 1-2 |
p. 25-48 24 p. |
article |
|
| 5 | Models for the Lambek calculus |
Pentus, Mati |
1995 |
75 | 1-2 |
p. 179-213 35 p. |
article |
|
| 6 | On NP-completeness in Linear Logic |
Kopylov, Alexey P. |
1995 |
75 | 1-2 |
p. 137-152 16 p. |
article |
|
| 7 | Petri nets, Horn programs, Linear Logic and vector games |
Kanovich, Max I. |
1995 |
75 | 1-2 |
p. 107-135 29 p. |
article |
|
| 8 | Preface |
Artemov, Sergei |
1995 |
75 | 1-2 |
p. 1- 1 p. |
article |
|
| 9 | Proof-theoretic analysis of termination proofs |
Buchholz, Wilfried |
1995 |
75 | 1-2 |
p. 57-65 9 p. |
article |
|
| 10 | Relating the bounded arithmetic and polynomial time hierarchies |
Buss, Samuel R. |
1995 |
75 | 1-2 |
p. 67-77 11 p. |
article |
|
| 11 | Towards the computational complexity of ℘Rω-terms |
Niggl, Karl-Heinz |
1995 |
75 | 1-2 |
p. 153-178 26 p. |
article |
|
| 12 | Understanding uniformity in Feferman's explicit mathematics |
Glaß, Thomas |
1995 |
75 | 1-2 |
p. 89-106 18 p. |
article |
|
| 13 | What are the ∀∑1 b-consequences of T 2 1 and T 2 2? |
Ferreira, Fernando |
1995 |
75 | 1-2 |
p. 79-88 10 p. |
article |
13 results found