 | 1998 |
| 11 |  | Michael Kaminski,
Johann A. Makowsky,
Michael L. Tiomkin:
Extensions for Open Default Theories via the Domain Closure Assumption.
J. Log. Comput. 8(2): 169-187 (1998) |
| 1996 |
| 10 |  | Michael Kaminski,
Johann A. Makowsky,
Michael L. Tiomkin:
Extensions for Open Default Theories via the Domain Closure Assumption.
JELIA 1996: 373-387 |
| 9 |  | Michael Kaminski,
Michael L. Tiomkin:
The Expressive Power of Second-Order Propositional Modal Logic.
Notre Dame Journal of Formal Logic 37(1): 35-43 (1996) |
| 1995 |
| 8 |  | Michael L. Tiomkin,
Michael Kaminski:
Semantical Analysis of Logic of Actions.
J. Log. Comput. 5(2): 203-212 (1995) |
| 1991 |
| 7 |  | Michael L. Tiomkin,
Johann A. Makowsky:
Decidability of Finite Probablistic Propositional Dynamic Logics
Inf. Comput. 94(2): 180-203 (1991) |
| 6 |  | Michael L. Tiomkin,
Michael Kaminski:
Nonmonotonic Default Modal Logics.
J. ACM 38(4): 963-984 (1991) |
| 1990 |
| 5 |  | Michael L. Tiomkin,
Michael Kaminski:
Nonmonotonic Default Modal Logics.
TARK 1990: 73-83 |
| 4 |  | Michael Kaminski,
Michael L. Tiomkin:
Finite and Circular Path Models for Branching Time Logics.
J. Log. Comput. 1(1): 71-82 (1990) |
| 1989 |
| 3 |  | Michael L. Tiomkin:
Probabilistic Termination Versus Fair Termination.
Theor. Comput. Sci. 66(3): 333-340 (1989) |
| 1988 |
| 2 |  | Michael L. Tiomkin:
Proving unprovability
LICS 1988: 22-26 |
| 1985 |
| 1 |  | Michael L. Tiomkin,
Johann A. Makowsky:
Propositional Dynamic Logic with Local Assignments.
Theor. Comput. Sci. 36: 71-87 (1985) |