Bibtex entries of דר' מיכאל טיומקין

@article{KMT98,
  author = {Michael Kaminski and
  Johann A. Makowsky and Michael Tiomkin},
  title = {Extensions for Open Default Theories via the Domain Closure
  Assumption.},
  journal = {Journal of Logic and Computation},
  volume = {8},
  number = {2},
  year = {1998},
  pages = {169-187}
}

@article{KT96,
  author = {Michael Kaminski and
  Michael Tiomkin},
  title = {The Expressive Power of Second-Order Propositional Modal
  Logic.},
  journal = {Notre Dame Journal of Formal Logic},
  volume = {37},
  number = {1},
  year = {1996},
  pages = {35-43}
}

@article{TK95,
  author = {Michael Tiomkin and
  Michael Kaminski},
  title = {Semantical Analysis of Logic of Actions.},
  journal = {Journal of Logic and Computation},
  volume = {5},
  number = {2},
  year = {1995},
  pages = {203-212}
}

@article{TM91,
  author = {Michael Tiomkin and
  Johann A. Makowsky},
  title = {Decidability of Finite Probablistic Propositional Dynamic
  Logics},
  journal = {Information and Computation},
  volume = {94},
  number = {2},
  year = {1991},
  pages = {180-203}
}

@article{TK91,
  author = {Michael Tiomkin and
  Michael Kaminski},
  title = {Nonmonotonic Default Modal Logics.},
  journal = {J. ACM},
  volume = {38},
  number = {4},
  year = {1991},
  pages = {963-984},
  }

@article{KT90,
  author = {Michael Kaminski and
  Michael Tiomkin},
  title = {Finite and Circular Path Models for Branching Time Logics.},
  journal = {Journal of Logic and Computation},
  volume = {1},
  number = {1},
  year = {1990},
  pages = {71-82}
}

@article{T89,
  author = {Michael Tiomkin},
  title = {Probabilistic Termination Versus Fair Termination.},
  journal = {Theoretical Computer Science},
  volume = {66},
  number = {3},
  year = {1989},
  pages = {333-340}
}

@inproceedings{T88,
  author = {Michael Tiomkin},
  title = {Proving unprovability},
  booktitle = {LICS 3},
  year = {1988},
  pages = {22-26}
}