Michael Sheard

According to our database, Michael Sheard authored at least 12 papers between 1983 and 2015.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2015

Erdős-Szekeres Results for Set Partitions.

Eric Gottlieb, Michael Sheard

Integers, 2015

2001

Weak and Strong Theories of Truth.

Michael Sheard

Stud Logica, 2001

1998

Forbidden subgraphs of graphs uniquely Hamiltonian-connected from a vertex.

George R. T. Hendry, C. J. Knickerbocker, Patti Frazer Lock, Michael Sheard

Discret. Math., 1998

1995

Elementary Descent Recursion and Proof Theory.

Harvey Friedman, Michael Sheard

Ann. Pure Appl. Log., 1995

1994

A Guide to Truth Predicates in the Modern Era.

Michael Sheard

J. Symb. Log., 1994

1991

On the structure of graphs uniquely hamiltonian-connected from a vertex.

C. J. Knickerbocker, Patti Frazer Lock, Michael Sheard

Discret. Math., 1991

1989

The Equivalence of the Disjunction and Existence Properties for Modal Arithmetic.

Harvey Friedman, Michael Sheard

J. Symb. Log., 1989

The minimum size of graphs hamiltonian-connected from a vertex.

C. J. Knickerbocker, Patti Frazer Lock, Michael Sheard

Discret. Math., 1989

1988

The disjunction and existence properties for axiomatic systems of truth.

Harvey M. Friedman, Michael Sheard

Ann. Pure Appl. Log., 1988

1987

An axiomatic approach to self-referential truth.

Harvey M. Friedman, Michael Sheard

Ann. Pure Appl. Log., 1987

1985

Co-Critical Points of Elementary Embeddings.

Michael Sheard

J. Symb. Log., 1985

1983

Indecomposable Ultrafilters Over Small Large Cardinals.

Michael Sheard

J. Symb. Log., 1983