The bulletin of symbolic logic
The tables of contents are generated automatically and are based on the data records of the individual contributions available in the index of the TIB portal. The display of the Tables of Contents may therefore be incomplete.
Table of contents
- 5
-
1 Background on infinitary logic| 2004
- 6
-
1.1 Expressive power of Lw1w| 2004
- 7
-
1.2 The back-and-forth construction| 2004
- 8
-
1.3 The Scott isomorphism theorem| 2004
- 11
-
1.4 w-logic| 2004
- 12
-
1.5 Familiar theorems| 2004
- 13
-
1.6 Failure of compactness| 2004
- 14
-
2.1 D0 formulas and S-formulas in set theory| 2004
- 14
-
2 Background on admissible sets| 2004
- 15
-
2.2 Axioms of KP| 2004
- 16
-
2.4 The admissible set L(wCK1)| 2004
- 16
-
2.3 Examples of admissible sets| 2004
- 18
-
3.1 Completeness and compactness| 2004
- 18
-
3 Admissible fragments| 2004
- 19
-
3.2 Computable structures via Barwise compactness| 2004
- 23
-
4 Admissible sets over M| 2004
- 23
-
4.1 KP with urelements| 2004
- 25
-
4.2 Truncation lemma| 2004
- 26
-
4.3 Admissible sets above M| 2004
- 28
-
5.1 Computable saturation| 2004
- 28
-
5 Saturation properties| 2004
- 31
-
5.2 SA-saturation| 2004
- 32
-
6 Conclusion| 2004