Computer Science Department
Technion - Israel Institute of Technology
Dr. Michael Tiomkin
- Contact information
- Email:
- tiomkin
cs.technion.ac.il
- Office:
- 642
- Phone:
- 4953
- Selected publications
- Michael Kaminski and
Johann A. Makowsky and Michael Tiomkin.
Extensions for Open Default Theories via the Domain Closure
Assumption.
Journal of Logic and Computation, 8(2):169-187, 1998 [bibtex]
- Michael Kaminski and
Michael Tiomkin.
The Expressive Power of Second-Order Propositional Modal
Logic.
Notre Dame Journal of Formal Logic, 37(1):35-43, 1996 [bibtex]
- Michael Tiomkin and
Michael Kaminski.
Semantical Analysis of Logic of Actions.
Journal of Logic and Computation, 5(2):203-212, 1995 [bibtex]
- Michael Tiomkin and
Johann A. Makowsky.
Decidability of Finite Probablistic Propositional Dynamic
Logics.
Information and Computation, 94(2):180-203, 1991 [bibtex]
- Michael Tiomkin and
Michael Kaminski.
Nonmonotonic Default Modal Logics.
J. ACM, 38(4):963-984, 1991 [bibtex]
- Michael Kaminski and
Michael Tiomkin.
Finite and Circular Path Models for Branching Time Logics.
Journal of Logic and Computation, 1(1):71-82, 1990 [bibtex]
- Michael Tiomkin.
Probabilistic Termination Versus Fair Termination.
Theoretical Computer Science, 66(3):333-340, 1989 [bibtex]
- Michael Tiomkin.
Proving unprovability.
In LICS 3, 22-26, 1988 [bibtex]