Johann A. Makowsky works in the Department of Computer Science at Technion - Israel Institute of Technology, Haifa. Elena V. Ravve works in the Department of Computer Science at Technion - Israel Institute of Technology, Haifa.

Select Guide Rating

• 1. The number of path-components of a compact subset of R^\ltimes H. Becker; 2. Intervals without critical triples P. Cholak, R. Downey and R. Shore; 3. Beyond Gödel's theorem - Turing nonrigidity revisited S. B. Cooper; 4. Types and indescernibles in finite models A. Dawar; 5. Model theory of modules I. Herzog; 6. Noninterpretability of infinite linear orders W. Hodges and A. Nies; 7. Combinatorial principles from adding Cohen reals I. Juhász, L. Soukup and Z. Szentmiklóssy; 8. Extensions of models of PV J. Krajíček; 9. Convergence laws for random graphs J. F. Lynch; 10. V=L and maximize P. Maddy; 11. Towards a categorical foundation of mathematics M. Makkai; 12. Strongly minimal sets and geometry D. Marker; 13. Computationally-sound proofs S. Micali; 14. Lambek calculus and formal languages M. Pentus; 15. Zil'ber's trichotomy and o-minimal structures Y. Peterzil; 16. The higher infinite in proof theory M. Rathjen; 17. There may be no nowhere dense ultrafilter S. Shelah; 18. Towards recursive model theory A. P. Stolboushkin; 19. Accessible segments of the fast-growing hierarchy S. S. Wainer.

Johann A. Makowsky works in the Department of Computer Science at Technion - Israel Institute of Technology, Haifa. Elena V. Ravve works in the Department of Computer Science at Technion - Israel Institute of Technology, Haifa.

Select Guide Rating

• 1. The number of path-components of a compact subset of R^\ltimes H. Becker; 2. Intervals without critical triples P. Cholak, R. Downey and R. Shore; 3. Beyond Gödel's theorem - Turing nonrigidity revisited S. B. Cooper; 4. Types and indescernibles in finite models A. Dawar; 5. Model theory of modules I. Herzog; 6. Noninterpretability of infinite linear orders W. Hodges and A. Nies; 7. Combinatorial principles from adding Cohen reals I. Juhász, L. Soukup and Z. Szentmiklóssy; 8. Extensions of models of PV J. Krajíček; 9. Convergence laws for random graphs J. F. Lynch; 10. V=L and maximize P. Maddy; 11. Towards a categorical foundation of mathematics M. Makkai; 12. Strongly minimal sets and geometry D. Marker; 13. Computationally-sound proofs S. Micali; 14. Lambek calculus and formal languages M. Pentus; 15. Zil'ber's trichotomy and o-minimal structures Y. Peterzil; 16. The higher infinite in proof theory M. Rathjen; 17. There may be no nowhere dense ultrafilter S. Shelah; 18. Towards recursive model theory A. P. Stolboushkin; 19. Accessible segments of the fast-growing hierarchy S. S. Wainer.

Johann A. Makowsky works in the Department of Computer Science at Technion - Israel Institute of Technology, Haifa. Elena V. Ravve works in the Department of Computer Science at Technion - Israel Institute of Technology, Haifa.

Select Guide Rating

• 1. The number of path-components of a compact subset of R^\ltimes H. Becker; 2. Intervals without critical triples P. Cholak, R. Downey and R. Shore; 3. Beyond Gödel's theorem - Turing nonrigidity revisited S. B. Cooper; 4. Types and indescernibles in finite models A. Dawar; 5. Model theory of modules I. Herzog; 6. Noninterpretability of infinite linear orders W. Hodges and A. Nies; 7. Combinatorial principles from adding Cohen reals I. Juhász, L. Soukup and Z. Szentmiklóssy; 8. Extensions of models of PV J. Krajíček; 9. Convergence laws for random graphs J. F. Lynch; 10. V=L and maximize P. Maddy; 11. Towards a categorical foundation of mathematics M. Makkai; 12. Strongly minimal sets and geometry D. Marker; 13. Computationally-sound proofs S. Micali; 14. Lambek calculus and formal languages M. Pentus; 15. Zil'ber's trichotomy and o-minimal structures Y. Peterzil; 16. The higher infinite in proof theory M. Rathjen; 17. There may be no nowhere dense ultrafilter S. Shelah; 18. Towards recursive model theory A. P. Stolboushkin; 19. Accessible segments of the fast-growing hierarchy S. S. Wainer.