Inaccessible set axions may have little consistency strength. - Laura Crosilla; Michael Rathjen (Ann. Pure Appl. Log., 2002)

On constructing completions. - Laura Crosilla; Hajime Ishihara; Peter Schuster 001 (J. Symb. Log., 2005)

Binary Refinement Implies Discrete Exponentiation. - Peter Aczel; Laura Crosilla; Hajime Ishihara; Erik Palmgren; Peter Schuster 001 (Stud Logica, 2006)

A generalized cut characterization of the fullness axiom in CZF. - Laura Crosilla; Erik Palmgren; Peter Schuster 001 (Log. J. IGPL, 2013)

Error and Predicativity. - Laura Crosilla (CiE, 2015)