<--- Back to Details
First PageDocument Content
Computational complexity theory / Logic in computer science / Alexander Razborov / Automated theorem proving / Natural proof / Nevanlinna Prize / Proof complexity / Frege system / Steven Rudich / Theoretical computer science / Applied mathematics / Mathematics
Date: 2008-12-17 14:33:43
Computational complexity theory
Logic in computer science
Alexander Razborov
Automated theorem proving
Natural proof
Nevanlinna Prize
Proof complexity
Frege system
Steven Rudich
Theoretical computer science
Applied mathematics
Mathematics

Add to Reading List

Source URL: www.cs.uchicago.edu

Download Document from Source Website

File Size: 81,19 KB

Share Document on Facebook

Similar Documents

Geometric Ideas in the Design of Ef cient and Natural Proof Systems Alessio Guglielmi University of Bath Joint work with

DocID: 1sZgl - View Document

Towards More Efficient and Natural Proof Systems

DocID: 1sV8k - View Document

HORSE CAMPING RULES All horse camping is in the designated Horse Camping Area. This area is convenient to bathhouses and trails and is a beautiful natural setting for camping. All horses must be accompanied by proof of a

DocID: 1rN99 - View Document

Forestry / Natural environment / Deforestation / Biology / Forestry in India / Reforestation / Forest pathology / Forest / Communal forests of India / Afforestation

OUP UNCORRECTED PROOF – FIRSTPROOFS, Thu Jan, NEWGEN 9 Forest Degradation in the Himalayas: Determinants and Policy Options

DocID: 1rpVB - View Document

Mathematics / Logic / Proof theory / Mathematical logic / Deductive reasoning / Natural deduction / Symbol / Differential topology / Generalised Whitehead product / CurryHoward correspondence

Herbrand-Confluence for Cut Elimination in Classical First Order Logic Stefan Hetzl1 and Lutz Straßburger2 1 2

DocID: 1rkb2 - View Document