Theses most similar to Denotational proof languages (Arkoudas, Konstantinos, 1968-; 2000) read it

Automated termination proofs using Walther recursion

Wu, Alexander (1994)

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

Incorporating specialized theories into a general purpose theorem prover

Pogosyants, Anna (1995)

  • Advisor: Stephen J. Garland
  • 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

Metatheorems about convertibility in typed lambda calculi : applications to CPS transform and "free theorems"

Kuc̆an, Jakov (1997)

  • Advisor: Albert R. Meyer
  • Department of Mathematics
Read it

The search for new axioms

Koellner, Peter, 1969- (2003)

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

Expressing consistency : Gödel's second imcompleteness theorem and intensionality in metamathematics

Auerbach, David Daniel (1978)

  • Advisor: George S. Boolos
  • Department of Linguistics and Philosophy
Read it

A virtual machine for a type-[omega] denotational proof language

Arvizo, Teodoro, 1978- (2002)

  • Advisor: Howard E. Shrobe
  • Department of Electrical Engineering and Computer Science
Read it

A relatively small turing machine whose behavior is independent of set theory

Yedidia, Adam (2015)

  • Advisor: Scott Aaronson
  • Department of Electrical Engineering and Computer Science
Read it

The kernel of ad hoc polymorphism

Boyer, Stephan (2016)

  • Advisor: Christopher J. Terman
  • Department of Electrical Engineering and Computer Science
Read it