10 results
Witnessing flows in arithmetic
-
- Journal:
- Mathematical Structures in Computer Science , First View
- Published online by Cambridge University Press:
- 20 September 2024, pp. 1-37
-
- Article
-
- You have access
- Open access
- HTML
- Export citation
ON THE EXISTENCE OF STRONG PROOF COMPLEXITY GENERATORS
- Part of
-
- Journal:
- Bulletin of Symbolic Logic / Volume 30 / Issue 1 / March 2024
- Published online by Cambridge University Press:
- 22 November 2023, pp. 20-40
- Print publication:
- March 2024
-
- Article
-
- You have access
- Open access
- HTML
- Export citation
8 - Basic Example of the Correspondence between Theories and Proof Systems
- from Part II - Upper Bounds
-
- Book:
- Proof Complexity
- Published online:
- 25 March 2019
- Print publication:
- 28 March 2019, pp 165-184
-
- Chapter
- Export citation
CONSISTENCY PROOF OF A FRAGMENT OF PV WITH SUBSTITUTION IN BOUNDED ARITHMETIC
-
- Journal:
- The Journal of Symbolic Logic / Volume 83 / Issue 3 / September 2018
- Published online by Cambridge University Press:
- 23 October 2018, pp. 1063-1090
- Print publication:
- September 2018
-
- Article
- Export citation
STRICT FINITISM, FEASIBILITY, AND THE SORITES
-
- Journal:
- The Review of Symbolic Logic / Volume 11 / Issue 2 / June 2018
- Published online by Cambridge University Press:
- 30 July 2018, pp. 295-346
- Print publication:
- June 2018
-
- Article
- Export citation
LOWER BOUNDS FOR DNF-REFUTATIONS OF A RELATIVIZED WEAK PIGEONHOLE PRINCIPLE
-
- Journal:
- The Journal of Symbolic Logic / Volume 80 / Issue 2 / June 2015
- Published online by Cambridge University Press:
- 22 April 2015, pp. 450-476
- Print publication:
- June 2015
-
- Article
- Export citation
FRAGMENTS OF APPROXIMATE COUNTING
-
- Journal:
- The Journal of Symbolic Logic / Volume 79 / Issue 2 / June 2014
- Published online by Cambridge University Press:
- 25 June 2014, pp. 496-525
- Print publication:
- June 2014
-
- Article
- Export citation
Approximate counting by hashing in bounded arithmetic
-
- Journal:
- The Journal of Symbolic Logic / Volume 74 / Issue 3 / September 2009
- Published online by Cambridge University Press:
- 12 March 2014, pp. 829-860
- Print publication:
- September 2009
-
- Article
- Export citation
Approximate counting in bounded arithmetic
-
- Journal:
- The Journal of Symbolic Logic / Volume 72 / Issue 3 / September 2007
- Published online by Cambridge University Press:
- 12 March 2014, pp. 959-993
- Print publication:
- September 2007
-
- Article
- Export citation
A theory for Log-Space and NLIN versus co-NLIN
-
- Journal:
- The Journal of Symbolic Logic / Volume 68 / Issue 4 / December 2003
- Published online by Cambridge University Press:
- 12 March 2014, pp. 1082-1090
- Print publication:
- December 2003
-
- Article
- Export citation