Terrence Millar

According to our database, Terrence Millar authored at least 10 papers between 1979 and 1999.

Collaborative distances:

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

1999

Pure Recursive Model Theory.

Terrence Millar

Proceedings of the Handbook of Computability Theory, 1999

1995

Model Completeness and Omitting Types.

Terrence Millar

J. Symb. Log., 1995

1989

Finite Extensions and the Number of Countable Models.

Terrence Millar

J. Symb. Log., 1989

1986

Recursive Categoricity and Persistence.

Terrence Millar

J. Symb. Log., 1986

Prime Models and Almost Decidability.

Terrence Millar

J. Symb. Log., 1986

1984

Decidability and the number of countable models.

Terrence Millar

Ann. Pure Appl. Log., 1984

1983

Omitting Types, Type Spectrums, and Decidability.

Terrence Millar

J. Symb. Log., 1983

Meeting of the Association for Symbolic Logic: Milwaukee, 1981.

Jon Barwise, Robert I. Soare, Terrence Millar

J. Symb. Log., 1983

1981

Vaught's Theorem Recursively Revisited.

Terrence Millar

J. Symb. Log., 1981

1979

A Complete, Decidable Theory with Two Decidable Models.

Terrence Millar

J. Symb. Log., 1979