Searching for authors named "Chris Pollett" – sorted by Relevance.
-
Translating $I\Delta_0+exp$ proofs into weaker systems
- Translating I \Delta 0 +exp proofs into weaker systems Chris Pollett Department of Mathematics
- Add To MetaCart
-
A Propositional Proof System for. . .
- for R i 2 Chris Pollett Abstract. In this paper we introduce Gentzen-style quantied propositional
- Add To MetaCart
-
Structure and Definability in General Bounded Arithmetic Theories
- Structure and Definability in General Bounded Arithmetic Theories Chris Pollett Department
- Cited by 17 (5 self) – Add To MetaCart
-
On the Bounded Version of Hilbert's Tenth Problem
- On the Bounded Version of Hilbert's Tenth Problem Chris Pollett Department of Mathematics
- Cited by 2 (0 self) – Add To MetaCart
-
Translating I∆0(exp) proofs into weaker systems
- Translating I∆0+exp proofs into weaker systems Chris Pollett Department of Mathematics, University
- Cited by 1 (1 self) – Add To MetaCart
-
On the b 1 -bit-comprehension rule
- On the �b 1-Bit-Comprehension Rule Jan Johannsen 1,⋆ and Chris Pollett 2 1 Dept. of Mathematics U
- Cited by 5 (0 self) – Add To MetaCart
-
On Proofs About Threshold Circuits and Counting Hierarcies (Extended Abstract)
- Chris Pollett Department of Mathematics Department of Computer Science University of California, San
- Cited by 6 (2 self) – Add To MetaCart
-
Circuit Principles and Weak Pigeonhole Variants
- . Chris Pollett Norman Danner 214 MacQuarrie Hall, Department of Computer Science San Jose State
- Add To MetaCart
-
On the $\Delta^b_1$-Bit-Comprehension Rule
- On the \Delta b 1 -Bit-Comprehension Rule Jan Johannsen 1;? and Chris Pollett 2 1 Dept
- Cited by 1 (0 self) – Add To MetaCart
-
Nonmonotonic reasoning with quantified Boolean constraints
- Nonmonotonic Reasoning with Quantified Boolean Constraints Chris Pollett 1 and Jeffrey B. Remmel 2
- Cited by 4 (0 self) – Add To MetaCart

