Harold Simmons

According to our database, Harold Simmons authored at least 14 papers between 1972 and 2010.

Collaborative distances:

• no known Dijkstra number.
• no known Erdős number.

2010

The Ackermann functions are not optimal, but by how much?

Harold Simmons

J. Symb. Log., 2010

2008

Fruitful and helpful ordinal functions.

Harold Simmons

Arch. Math. Log., 2008

2007

A coverage construction of the reals and the irrationals.

Harold Simmons

Ann. Pure Appl. Log., 2007

2006

Regularity, Fitness, and the Block Structure of Frames.

Harold Simmons

Appl. Categorical Struct., 2006

2005

Tiering as a recursion technique.

Harold Simmons

Bull. Symb. Log., 2005

2004

A comparison of two systems of ordinal notations.

Harold Simmons

Arch. Math. Log., 2004

2001

Monoid Based Semantics for Linear Formulas.

William P. R. Mitchell, Harold Simmons

J. Symb. Log., 2001

1994

The Glueing Construction and Lax Limits.

Harold Simmons

Math. Struct. Comput. Sci., 1994

The Monotonous Elimination of Predicate Variables.

Harold Simmons

J. Log. Comput., 1994

1991

Generalized deviations of posets.

Harold Simmons

Discret. Math., 1991

1988

Large Discrete Parts of the E-Tree.

Harold Simmons

J. Symb. Log., 1988

The realm of primitive recursion.

Harold Simmons

Arch. Math. Log., 1988

1976

Large and Small Existentially Closed Structures.

Harold Simmons

J. Symb. Log., 1976

1972

Existentially Closed Structures.

Harold Simmons

J. Symb. Log., 1972