Keyword

bounded arithmetic

Description: A family of weak arithmetic theories studied in mathematical logic, proof complexity, and computational complexity, often using bounded quantifiers.
Wikidata ID: wiki/Q28403712
OpenAlex ID: keywords/bounded-arithmetic
1980 · V. Klema, A. Laub · IEEE Transactions on Automatic Control · 1,897
1995 · Jan Krajicek · Cambridge University Press eBooks · 650
1995 · Alasdair Urquhart · Bulletin of Symbolic Logic · 261
2010 · Stephen Cook, Phuong Nguyen · Cambridge University Press eBooks · 249
1989 · Jan Krajíček, Pavel Pudlák · Journal of Symbolic Logic · 230
1987 · A.J. Wilkie, J.B. Paris · Annals of Pure and Applied Logic · 226
1987 · Samuel R. Buss · Journal of Symbolic Logic · 219
2017 · Petr Hájek, Pavel Pudlák · Cambridge University Press eBooks · 204
1991 · Jan Krajíček, Pavel Pudlák, et al. · Annals of Pure and Applied Logic · 199
2001 · Jan Krajíček · Fundamenta Mathematicae · 194
1985 · J. Paris, A. Wilkie · Lecture notes in mathematics · 194
1988 · J. B. Paris, A. J. Wilkie, et al. · Journal of Symbolic Logic · 187
2003 · Helger Lipmaa · Lecture notes in computer science · 178
2004 · Emil Jeřábek · Annals of Pure and Applied Logic · 149
2019 · Jan Krajíček · Cambridge University Press eBooks · 144
1995 · Alexander A. Razborov · Birkhäuser Boston eBooks · 141
2019 · Andrea Sorbi · CRC Press eBooks · 126
1996 · Domenico Zambella · Journal of Symbolic Logic · 124
1990 · Jan Krajíček, Pavel Pudlák · Mathematical logic quarterly · 122
1994 · Samuel R. Buss, Jan Krajíček · Proceedings of the London Mathematical Society · 112
1994 · Alexander A. Razborov · BRICS Report Series · 108
1995 · Samuel R. Buss · Lecture notes in computer science · 95
Works count: 651
Citation count: 12,260
Year
Topic
Type