WorldCat Identities

Krajíček, Jan

Overview
Works: 12 works in 64 publications in 2 languages and 2,038 library holdings
Genres: Conference papers and proceedings 
Roles: Author, Editor
Classifications: QA9.56, 511.3
Publication Timeline
.
Most widely held works by Jan Krajíček
Bounded arithmetic, propositional logic, and complexity theory by Jan Krajček( Book )

18 editions published between 1995 and 2004 in English and held by 393 WorldCat member libraries worldwide

Discusses the deep connections between logic and complexity theory, and lists a number of intriguing open problems
Arithmetic, proof theory, and computational complexity by Peter Clote( Book )

10 editions published between 1992 and 1993 in English and held by 251 WorldCat member libraries worldwide

Forcing with random variables and proof complexity by Jan Krajček( Book )

12 editions published between 2010 and 2011 in English and held by 208 WorldCat member libraries worldwide

"This book introduces a new approach to building models of bounded arithmetic, with techniques drawn from recent results in computational complexity. Propositional proof systems and bounded arithmetics are closely related. In particular, proving lower bounds on the lengths of proofs in propositional proof systems is equivalent to constructing certain extensions of models of bounded arithmetic. This offers a clean and coherent framework for thinking about lower bounds for proof lengths, and it has proved quite successful in the past. This book outlines a brand new method for constructing models of bounded arithmetic, thus for proving independence results and establishing lower bounds for proof lengths. The models are built from random variables defined on a sample space which is a non-standard finite set and sampled by functions of some restricted computational complexity. It will appeal to anyone interested in logical approaches to fundamental problems in complexity theory"--Résumé de l'éditeur
Logic Colloquium '01 : proceedings of the Annual European Summer Meeting of the Association for Symbolic Logic, held in Vienna, Austria, August 6-11, 2001 by Wien) Logic Colloquium (2001( Book )

5 editions published in 2005 in English and held by 62 WorldCat member libraries worldwide

Complexity of computations and proofs by Jan Krajček( Book )

12 editions published between 2003 and 2004 in English and held by 37 WorldCat member libraries worldwide

Pokryvné útvary karbonu čs by Petr Martinec( Book )

1 edition published in 1990 in Czech and held by 2 WorldCat member libraries worldwide

On the weak pigeonhole principle by Jan Krajček( )

1 edition published in 2001 in English and held by 1 WorldCat member library worldwide

Omezená aritmetika, výrokový počet a teorie složitosti by Jan Krajček( Book )

1 edition published in 1992 in Czech and held by 1 WorldCat member library worldwide

Složitost formálních důkazů by Jan Krajček( Book )

1 edition published in 1989 in Czech and held by 1 WorldCat member library worldwide

Klášterní zvonky by J. F Frankl( Book )

in Czech and held by 1 WorldCat member library worldwide

An exponential lower bound to the size of bounded depth Frege proofs of the pigeonhole principle by Jan Krajček( Book )

1 edition published in 1994 in English and held by 1 WorldCat member library worldwide

Diagonalization in proof complexity by Jan Krajček( )

1 edition published in 2004 in English and held by 1 WorldCat member library worldwide

 
moreShow More Titles
fewerShow Fewer Titles
Audience Level
0
Audience Level
1
  Kids General Special  
Audience level: 0.42 (from 0.06 for Bounded ar ... to 0.99 for Pokryvné ...)

Bounded arithmetic, propositional logic, and complexity theory
Alternative Names
Krajček, J.

Krajček, J. 1960-

Krajicek, Jan

Languages
English (60)

Czech (4)

Covers
Arithmetic, proof theory, and computational complexityForcing with random variables and proof complexityLogic Colloquium '01 : proceedings of the Annual European Summer Meeting of the Association for Symbolic Logic, held in Vienna, Austria, August 6-11, 2001