Emil Jeřábek

2,230 reputation

614

bio	website	math.cas.cz/~jerabek
	location	Prague, Czech Republic
	age	35
visits	member for	1 year, 7 months
	seen	May 16 at 16:50
stats	profile views	230

I am a researcher at the Institute of Mathematics of the Czech Academy of Sciences. I work in the field of mathematical logic, specifically proof complexity (mainly subsystems of bounded arithmetic, but also propositional proof complexity) and nonclassical logics (admissible rules of modal, superintuitionistic, and other propositional logics).

	2,230 reputation	bio	website	math.cas.cz/~jerabek	visits	member for	1 year, 7 months
614 badges		location	Prague, Czech Republic		seen	May 16 at 16:50

summary answers questions tags badges favorites bounties reputation activity

22 Answers

votes activity newest

22	Is there a natural problem on the naturals that is NP-complete?
21	Why are regular languages called “regular”?
16	How can we express “$P=PSPACE$” as a first-order formula?
15	Proofs in $S_{2}^{1}$
13	Arithmetic circuits with $\min$, $\max$, and average over $[0,1]$

2,230 Reputation

+80	Constructively efficient algorithms without efficient correctness and efficiency proof
+165	Proofs in $S_{2}^{1}$

0 Questions

votes activity newest

This user has not asked any questions

37 Tags

108 cc.complexity-theory × 13	22 np-hardness
72 lo.logic × 7	22 combinatorial-game-theory
25 proof-complexity × 3	21 regular-language
23 reference-request × 5	21 ho.history-overview
22 nt.number-theory	21 regular-expressions

8 Accounts

	Theoretical Computer Science	2,230 rep	614
$Mathematics Stack Exchange$	Mathematics	301 rep	12
$TeX - LaTeX Stack Exchange$	TeX - LaTeX	151 rep	3
	Stack Overflow	121 rep	2
	Computer Science	121 rep	3