|
Journal description
All volumes of the corresponding journal
All issues of the corresponding volume
All articles of the corresponding issues
12 results found
| no | title | author | magazine | year | volume | issue | page(s) | type |
| 1 | A guide to “strong coding” |
Friedman, Sy D. |
1987 |
35 | C |
p. 99-122 24 p. |
article |
|
| 2 | Author index |
1987 |
35 | C |
p. 303- 1 p. |
article |
||
| 3 | Choice and well-ordering |
Freyd, Peter |
1987 |
35 | C |
p. 149-166 18 p. |
article |
|
| 4 | Decidability and definability with circumscription |
Schlipf, John S. |
1987 |
35 | C |
p. 173-191 19 p. |
article |
|
| 5 | Editorial Board |
1987 |
35 | C |
p. IFC- 1 p. |
article |
||
| 6 | Lindenbaum algebras of intuitionistic theories and free categories |
Freyd, Peter |
1987 |
35 | C |
p. 167-172 6 p. |
article |
|
| 7 | Models of arithmetic and categories with finiteness conditions |
Diaconescu, R. |
1987 |
35 | C |
p. 123-148 26 p. |
article |
|
| 8 | On countable locally described structures |
Maier, Berthold J. |
1987 |
35 | C |
p. 205-246 42 p. |
article |
|
| 9 | On the scheme of induction for bounded arithmetic formulas |
Wilkie, A.J. |
1987 |
35 | C |
p. 261-302 42 p. |
article |
|
| 10 | Representations of the real numbers and of the open subsets of the set of real numbers |
Weihrauch, Klaus |
1987 |
35 | C |
p. 247-260 14 p. |
article |
|
| 11 | Strong coding |
Friedman, Sy D. |
1987 |
35 | C |
p. 1-3 3 p. |
article |
|
| 12 | The undecidability of the lattice of R.E. closed subsets of an effective topological space |
Silibovsky Brady, Sheryl |
1987 |
35 | C |
p. 193-203 11 p. |
article |
12 results found