Name
Title | Citations | PageRank | Year |
|---|---|---|---|
| A generalized cut characterization of the fullness axiom in CZF. | 0 | 0.34 | 2013 |
| Binary Refinement Implies Discrete Exponentiation. | 4 | 0.54 | 2006 |
| On constructing completions | 5 | 0.92 | 2005 |
| Inaccessible set axioms may have little consistency strength | 8 | 1.19 | 2002 |