| 2007 |
|---|
| 10 | EE | Leszek Aleksander Kolodziejczyk,
Neil Thapen:
The Polynomial and Linear Hierarchies in V0.
CiE 2007: 408-415 |
| 2006 |
|---|
| 9 | EE | Stephen A. Cook,
Neil Thapen:
The strength of replacement in weak arithmetic.
ACM Trans. Comput. Log. 7(4): 749-764 (2006) |
| 2005 |
|---|
| 8 | EE | Nicola Galesi,
Neil Thapen:
Resolution and Pebbling Games.
SAT 2005: 76-90 |
| 7 | EE | Neil Thapen:
Structures interpretable in models of bounded arithmetic.
Ann. Pure Appl. Logic 136(3): 247-266 (2005) |
| 6 | EE | Neil Thapen,
Michael Soltys:
Weak theories of linear algebra.
Arch. Math. Log. 44(2): 195-208 (2005) |
| 2004 |
|---|
| 5 | EE | Nicola Galesi,
Neil Thapen:
The Complexity of Treelike Systems over lamda-Local Formulae.
IEEE Conference on Computational Complexity 2004: 68-74 |
| 4 | EE | Stephen A. Cook,
Neil Thapen:
The Strength of Replacement in Weak Arithmetic.
LICS 2004: 256-264 |
| 3 | EE | Stephen A. Cook,
Neil Thapen:
The strength of replacement in weak arithmetic
CoRR cs.LO/0409015: (2004) |
| 2 | EE | Nicola Galesi,
Neil Thapen:
Resolution and pebbling games
Electronic Colloquium on Computational Complexity (ECCC)(112): (2004) |
| 2002 |
|---|
| 1 | | Neil Thapen:
A model-theoretic characterization of the weak pigeonhold principle.
Ann. Pure Appl. Logic 118(1-2): 175-195 (2002) |
