| |
| 2001 | ||
|---|---|---|
| 9 | Michael Sheard: Weak and Strong Theories of Truth. Studia Logica 68(1): 89-101 (2001) | |
| 1998 | ||
| 8 | EE | George R. T. Hendry, C. J. Knickerbocker, Patti Frazer Lock, Michael Sheard: Forbidden subgraphs of graphs uniquely Hamiltonian-connected from a vertex. Discrete Mathematics 187(1-3): 281-290 (1998) |
| 1995 | ||
| 7 | Harvey Friedman, Michael Sheard: Elementary Descent Recursion and Proof Theory. Ann. Pure Appl. Logic 71(1): 1-45 (1995) | |
| 1994 | ||
| 6 | Michael Sheard: A Guide to Truth Predicates in the Modern Era. J. Symb. Log. 59(3): 1032-1054 (1994) | |
| 1991 | ||
| 5 | EE | C. J. Knickerbocker, Patti Frazer Lock, Michael Sheard: On the structure of graphs uniquely hamiltonian-connected from a vertex. Discrete Mathematics 88(1): 33-48 (1991) |
| 1989 | ||
| 4 | EE | C. J. Knickerbocker, Patti Frazer Lock, Michael Sheard: The minimum size of graphs hamiltonian-connected from a vertex. Discrete Mathematics 76(3): 277-278 (1989) |
| 3 | Harvey Friedman, Michael Sheard: The Equivalence of the Disjunction and Existence Properties for Modal Arithmetic. J. Symb. Log. 54(4): 1456-1459 (1989) | |
| 1985 | ||
| 2 | Michael Sheard: Co-Critical Points of Elementary Embeddings. J. Symb. Log. 50(1): 220-226 (1985) | |
| 1983 | ||
| 1 | Michael Sheard: Indecomposable Ultrafilters Over Small Large Cardinals. J. Symb. Log. 48(4): 1000-1007 (1983) | |
| 1 | Harvey M. Friedman (Harvey Friedman) | [3] [7] |
| 2 | George R. T. Hendry | [8] |
| 3 | C. J. Knickerbocker | [4] [5] [8] |
| 4 | Patti Frazer Lock | [4] [5] [8] |