Crossref Citations
This Book has been
cited by the following publications. This list is generated based on data provided by Crossref.
Sazonov, Vladimir Yu.
1995.
Logic and Computational Complexity.
Vol. 960,
Issue. ,
p.
30.
Krajíček, Jan
1996.
Collegium Logicum.
Vol. 2,
Issue. ,
p.
56.
Takeuti, Gaisi
and
Yasumoto, Masahiro
1996.
Gödel ’96.
Vol. 6,
Issue. ,
p.
120.
Buss, S.
Impagliazzo, R.
Krajíček, J.
Pudlák, P.
Razborov, A. A.
and
Sgall, J.
1996.
Proof complexity in algebraic systems and bounded depth Frege systems with modular counting.
Computational Complexity,
Vol. 6,
Issue. 3,
p.
256.
Colby, Latha S.
and
Libkin, Leonid
1996.
Database Theory — ICDT '97.
Vol. 1186,
Issue. ,
p.
461.
Razborov, Alexander A.
1996.
Automata, Languages and Programming.
Vol. 1099,
Issue. ,
p.
48.
Sadowski, Zenon
1997.
Fundamentals of Computation Theory.
Vol. 1279,
Issue. ,
p.
423.
Krajíček, Jan
1997.
Interpolation theorems, lower bounds for proof systems, and independence results for bounded arithmetic.
Journal of Symbolic Logic,
Vol. 62,
Issue. 2,
p.
457.
Zambella, Domenico
1997.
Forcing in Finite Structures.
Mathematical Logic Quarterly,
Vol. 43,
Issue. 3,
p.
401.
Krajiček, Jan
1997.
Mathematical Foundations of Computer Science 1997.
Vol. 1295,
Issue. ,
p.
85.
Rudich, Steven
1997.
Randomization and Approximation Techniques in Computer Science.
Vol. 1269,
Issue. ,
p.
85.
BUSS, SAMUEL R.
1997.
Bounded Arithmetic, Cryptography and Complexity.
Theoria,
Vol. 63,
Issue. 3,
p.
147.
Krajíček, Jan
1997.
Logic and Scientific Methods.
p.
69.
Willard, Dan E.
1997.
Computational Logic and Proof Theory.
Vol. 1289,
Issue. ,
p.
319.
Pudlák, Pavel
1997.
Lower bounds for resolution and cutting plane proofs and monotone computations.
Journal of Symbolic Logic,
Vol. 62,
Issue. 3,
p.
981.
Ferreira, Fernando
and
Marques, António
1998.
Extracting Algorithms from Intuitionistic Proofs.
Mathematical Logic Quarterly,
Vol. 44,
Issue. 2,
p.
143.
Pudlák, Pavel
1998.
Mathematical Foundations of Computer Science 1998.
Vol. 1450,
Issue. ,
p.
129.
Messner, Jochen
and
Torán, Jacobo
1998.
STACS 98.
Vol. 1373,
Issue. ,
p.
477.
Chiari, Mario
and
Krajíček, Jan
1998.
Witnessing functions in bounded arithmetic and search problems.
Journal of Symbolic Logic,
Vol. 63,
Issue. 3,
p.
1095.
Chinchilla, Eugenio
1998.
A Model of $\widehat{R}^2_3$ inside a Subexponential Time Resource.
Notre Dame Journal of Formal Logic,
Vol. 39,
Issue. 3,