1. Nonstandard methods in combinatorics and theoretical computer science

   • M. M. Richter
   • M. E. Szabo

   OriginalPaper Pages: 181 - 191

2. Stability of weak second-order semantics

   • László Csirmaz

   OriginalPaper Pages: 193 - 202

3. A faithful embedding of parallel computations in star-finite models

   • E. J. Farkas

   OriginalPaper Pages: 203 - 212

4. Arithmetical completeness versus relative completeness

   • Michal Grabowski

   OriginalPaper Pages: 213 - 220

5. Nonstandard combinatorics

   • Joram Hirshfeld

   OriginalPaper Pages: 221 - 232

6. A finite model theorem for the propositional μ-calculus

   • Dexter Kozen

   OriginalPaper Pages: 233 - 241

7. Sequences in countable nonstandard models of the natural numbers

   • Steven C. Leth

   OriginalPaper Pages: 243 - 263

8. Some nonstandard methods in combinatorial number theory

   • Steven C. Leth

   OriginalPaper Pages: 265 - 278

9. Is “some-other-time” sometimes better than “sometime” for proving partial correctness of programs?

   • Ildikó Sain

   OriginalPaper Pages: 279 - 301

10. Nonstandard analysis and constructivism?

    • Frank Wattenberg

    OriginalPaper Pages: 303 - 309