- [HS] E. Hrushovski and Z. Sokolovic, Minimal sets in differentially closed set, Trans. AMS, to appear.
- Nondeterministic Space is Closed Under Complementation
- Dimensions and homogeneity in mathematical structures
- Introduction to Model Theory David Marker
- A proof complexity generator Jan Krajcek #+
- Pseudofinite hard instances for a studentteacher game with a NisanWigderson generator
- Witnessing functions in bounded arithmetic and search problems
- Some consequences of cryptographical conjectures for S 1
- Lifting independence results in bounded Mario Chiari \Lambda Jan Kraj'icek y
- NP search problems in low fragments of bounded arithmetic
- Effective interpolation Jan Kraj'icek
- Extensions of models of PV Jan Kraj'icek \Lambda
- Pseudorandomness --Part II 1 Introduction 1
- 5. kolokvium semin'aru logiky a slozitosti Matematick'y '
- Interpolation and approximate semantic derivations Jan Kraj cek y
- Tautologies from pseudo-random generators Jan Kraj cek
- Implicit proofs Jan Krajcek #
- Ancient Logic: Aristotle and the Stoics (I) The concern with logic and the study of inference can be traced back to the
- An Exponential Lower Bound to the Size of Bounded Depth Frege Proofs of the Pigeonhole Principle
- On Frege and Extended Frege Proof Systems JAN KRAJ ' I
- Proof complexity February 14, 2009 c
- IAS/Park City Mathematics Series Volume 00, 0000
- A saturation property of structures obtained by forcing with a compact family of random variables
- Proof complexity Jan Krajcek #
- Nondeterministic Space is Closed Under Complementation
- 1. kolokvium semin'aru logiky a slozitosti Matematick'y '
- An Application of Boolean Complexity to Separation Problems in Bounded Arithmetic
- A Fundamental Problem of Mathematical Logic Jan Kraj'icek
- On methods for proving lower bounds in propositional logic
- [HS] E. Hrushovski and Z. Sokolovic, Minimal sets in differentially closed set, Trans. AMS, to appear.
- Introduction to Model Theory David Marker
- 2. kolokvium semin'aru logiky a slozitosti Matematick'y '
- Proof complexity and arithmetic (lecture notes)
- An exponential lower bound for a constraint propagation proof system
- Diagonalization in proof complexity Jan Kraj cek
- Lower bounds on Hilbert's Nullstellensatz and propositional proofs
- On the weak pigeonhole principle Jan Kraj cek
- Lower bounds for a proof system with an exponential speedup over constantdepth Frege
- Medieval Logic (II) In the Middle Ages, Aristotle's theory of syllogism became the dominant
- Forcing with random variables in bounded arithmetic and proof
- On the degree of ideal membership proofs from uniform families of polynomials
- Eight's week notes These notes briefly explain the material I planned to cover in the eight week.
- Hardness assumptions in the foundations of theoretical computer science
- Boolean circuits An nary Boolean function f(x 1 ; : : : ; xn ) is a function from f0; 1g n with
- Dual weak pigeonhole principle, pseudosurjective functions, and provability of circuit lower bounds
- Forcing with random variables and proof complexity
- Combinatorics of rst order structures and propositional proof systems
- Embedding logics into product logic Matthias Baaz Petr H'ajek \Lambda Jan Kraj'icek y David
- A note on conservativity relations among bounded arithmetic theories
- COMBINATORICS WITH DEFINABLE SETS: EULER CHARACTERISTICS AND GROTHENDIECK RINGS
- Lengths of propositional proofs Jan Kraj'icek
- Classical propositional logic and its complexity Jan Kraj'icek
- Uniform families of polynomial equations over a finite field and structures admitting an Euler
- A form of feasible interpolation for constant depth Frege systems
- Seminar notes (15.11.99), J. Kraj'icek n (R) := [9x ! m8y ! n; :R(x; y)] [9x ! x 0 ! m; y ! n; R(x; y)
- Structured pigeonhole principle, search problems and hard tautologies
- Approximate Euler characteristic, dimension, and weak pigeonhole principles
- From feasible proofs to feasible computations Jan Krajcek #
- On the proof complexity of the NisanWigderson generator based on a hard
- 4. kolokvium semin'aru logiky a slozitosti Matematick'y '
- A note on SAT algorithms and proof complexity Jan Krajcek #
- Substitutions into propositional tautologies Jan Krajcek #+#
- Forcing with random variables in bounded arithmetic,
- Probabilistic Proof Systems --Part I 1 Lecture 1. Interactive Proofs 1
- Lower bounds to the size of constantdepth propositional proofs
- The Journal of Symbolic Logic Volume 72, Number 4, Dec. 2007
- Mathematical Logic Lecture Notes
- Interpolation by a game Jan Kraj'icek \Lambda
- 1 Languages and structures Language: alphabet, terms, formulas.
- Discretely ordered modules as a firstorder extension of the cutting planes proof system
- Introspective Semantics for Turing Machine Languages Dan E. Willard
- Lecture Notes on Pseudorandomness --Part I Oded Goldreich
- A note on propositional proof complexity of some Ramseytype statements
- Interpolation theorems, lower bounds for proof systems, and independence results for bounded
- PROOF COMPLEXITY IN ALGEBRAIC SYSTEMS AND BOUNDED DEPTH FREGE SYSTEMS WITH
- Dehn function and length of proofs Jan Kraj cek
- 3. kolokvium semin'aru logiky a slozitosti Matematick'y '
- Probabilistic Proof Systems --Part II 1 Lecture 1. Introduction to PCPs 1
- Finite Model Theory and Descriptive Erich Gradel
- 153Annals of Pure and Applied Logic 41 (1989) 153-178 North-Holland
- An exponential lower bound for a constraint propagation proof system
- NP search problems in low fragments of bounded arithmetic
- ('tJ...! c.. RdcIL1: !eM~'M.~6'-f (,(U
- A note on SAT algorithms and proof complexity Jan Krajicek
- A note on propositional proof complexity of some Ramsey-type statements
- The Relative Efficiency of Propositional Proof Systems Author(s): Stephen A. Cook and Robert A. Reckhow
- Communication Complexity Alexander A. Razborov
- -:""'"0""0"""0":1o.o.OQ...", ~O~:I"":I""O~~~~:I
- 4ECM Stockholm 2004 c 2005 European Mathematical Society
- Forcing with random variables in bounded arithmetic,
- Dimensions and homogeneity in mathematical structures
- Elements of Geometric Stability Theory December 17, 1999
- A Short Course on Finite Model Theory
- Interpolation theorems, lower bounds for proof systems, and independence results for bounded
- The Journal of Symbolic Logic Volume 75, Number 2, June 2010
- Mathematical Logic Lecture Notes
- Annals o Pure and Applied Logic 52 (1991) 143-153 North-Holland
- Zeitsckr. t. matko Logik unit Grundlagen d. Matk. Bd. 33, S. 461-480 (1987)
- Reprintedfrom Samuel R. Buss
- Introduction Dne of the most interesting open problems around bounded
- ZeitBchr. j. math. Logik und Grundlagen d. Math. Bd.36, 8.29-46 (1990)
- A proof complexity generator Jan Krajicek
- Provably Total Functions in Bounded Arithmetic Theories Ri
- FEASIBLY CONSTRUCTIVE PROOFS AND THE PROPOSITIONAL CALCULUS
- Forcing with random variables and proof complexity
- Sonderdruck ISSN 0003-9268 HERAUSGEBER
- On the proof complexity of the Nisan-Wigderson generator based on a hard
- (! rA/ '("74 Ea.~
- Arch. Math. Logic (1989)28:91-98 llrehive for
- Natural Proofs Alexander A. Razborov
- Journal of Mathematical Logic, Vol. 11, No. 1 (2011) 1127 c World Scientific Publishing Company
- On the Lengths of Proofs in the Propositional Calculus
- A Personal View of Average-Case Complexity Russell Impagliazzo
- Hardness assumptions in the foundations of theoretical computer science
- Finite Model Theory Martin Otto
- Theoretical Computer Science 116 (1993) 3-31 Finite-model theory -a personal
- CO\llf. 0\.1 Ndcle.1 E4 ~t 6..e 'r~a."'d I -19 J'~ .
- TRANSACflONSOF THE AMERlCAN MATHEMATICAL SOCIETY
- A quick guide to independence results in set theory
- The ImmermanSzelepcsenyi Theorem In 1987, Neil Immerman [65] and independently Robert Szelepcsenyi [119]
- Information Processing Letters 101 (2007) 163167 www.elsevier.com/locate/ipl
- THE JOURNAL OF SVMBOLIC LOGlc Volume 54, Number 3, Sept. 1989
- 0-~~I1-1Ho>< '"1.,acn~o
- A saturation property of structures obtained by forcing with a compact family of random variables
- Annals of Mathematics and Artificial Intelligence 6 (1992)107-126 107 Jan Krajek a,band Gaisi Takeuti a
- The Journal of Symbolic Logic Volume 72, Number 4, Dec. 2007
- AnApplicationofBooleanComplexityto SeparationProblemsinBoundedArithmetic
- Arch. Math. Logic (1988)27:69-84 Mathematical
- The History and Status of the P versus NP Question 1 Significance
- We use the notation from Sec.31.2. In the proof of Lemma 31.2.1 we pick by averaging e s.t. at least a fraction
- Zeitschr. f. matk. Logik und Grundlaqen d. Math. Bd.31,S,449-460 (198.5)
- From feasible proofs to feasible computations Jan Krajicek
- 137Comment.Math.Univ.Carolinae 30,1(1989)137-140 Speed-up for propositional Frege systems
- A non-arithmetical Godel logic (Abstract.) Petr Hajek
- Annals of Pure and Applied Logic 48 (1990) 261-276 North-Holland
- Structured pigeonhole principle, search problems and hard tautologies
- Pseudo-finite hard instances for a student-teacher game with a Nisan-Wigderson generator
- Zeitschr. t. math. Logik und Grundlagend. Matll. Bd. 34, S. 123-134 (1988)
- I. INTRODUCTION SOMECONNECTIONSBETWEENMATHEMATICALLOGICAND COMPLEXITYTHEORY9
