Theses most similar to Automated termination proofs using Walther recursion (Wu, Alexander; 1994) read it

Relativization of the theory of computational complexity.

Lynch, Nancy A. (Nancy Ann), 1948- (1972)

  • Advisor: Albert Meyer
  • Department of Mathematics
Read it

Subsystems of set theory and analysis

Friedman, Harvey Martin, 1948- (1967)

  • Advisor: Gerald E. Sacks
  • Department of Mathematics
Read it

Models of high rank for weakly scattered theories

Chan, Alice Shih Ying (2006)

  • Advisor: Gerald E. Sacks
  • Department of Mathematics
Read it

Automatic verification of the timing properties of MMT automata

Söylemez, Ekrem Sezer (1994)

  • Advisor: Nancy A. Lynch
  • Department of Electrical Engineering and Computer Science
Read it

Efficient holographic proofs

Russell, Alexander Craig (1996)

  • Advisor: Michael Sipser
  • Department of Mathematics
Read it

Principal typings and type inference

Jim, Trevor (1996)

  • Advisor: Albert R. Meyer
  • Department of Electrical Engineering and Computer Science
Read it

On the termination of recursive algorithms in pure first-order functional languages with monomorphic inductive data types

Arkoudas, Kostas (1996)

  • Advisor: David Allen McAllester
  • Department of Electrical Engineering and Computer Science
Read it

The continuum hypothesis : independence and truth-value

Weston, Thomas S. (Thomas Spengler) (1974)

  • Advisor: Richard L. Cartwright
  • Department of Philosophy
Read it

The search for new axioms

Koellner, Peter, 1969- (2003)

  • Advisor: Vann McGee
  • Department of Linguistics and Philosophy
Read it

Denotational proof languages

Arkoudas, Konstantinos, 1968- (2000)

  • Advisor: Olin Shivers
  • Department of Electrical Engineering and Computer Science
Read it