Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Michael Sheard
2000 – 2009
- 2001
[j9]
1990 – 1999
- 1998
- [j8]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
- [j7]Harvey Friedman, Michael Sheard: Elementary Descent Recursion and Proof Theory. Ann. Pure Appl. Logic 71(1): 1-45 (1995)
- 1994
- [j6]Michael Sheard: A Guide to Truth Predicates in the Modern Era. J. Symb. Log. 59(3): 1032-1054 (1994)
- 1991
- [j5]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)
1980 – 1989
- 1989
- [j4]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)
- [j3]Harvey Friedman, Michael Sheard: The Equivalence of the Disjunction and Existence Properties for Modal Arithmetic. J. Symb. Log. 54(4): 1456-1459 (1989)
- 1985
- [j2]
- 1983
- [j1]Michael Sheard: Indecomposable Ultrafilters Over Small Large Cardinals. J. Symb. Log. 48(4): 1000-1007 (1983)
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2012-12-02 21:05 CET by the dblp team