From feasible proofs to feasible computations

0353758 - MÚ 2011 RIV DE eng C - Conference Paper (international conference)
Krajíček, Jan
From feasible proofs to feasible computations.
Computer Science Logic 2010. Heidelberg: Springer, 2010 - (Dawar, A.; Veith, H.), s. 22-31. Lecture Notes in Computer Science, 6247. ISBN 978-3-642-15204-7.
[Computer science logic 2010. Brno (CZ), 23.08.2010-27.08.2010]
R&D Projects: GA AV ČR IAA100190902; GA MŠMT LC505
Institutional research plan: CEZ:AV0Z10190503
Keywords : lengths of proofs * computational time
Subject RIV: BA - General Mathematics
http://link.springer.com/chapter/10.1007%2F978-3-642-15205-4_3

We study several situations where it is possible to extract a feasible computational information from a proof, either in a first-order theory or in a propositional proof system.
Permanent Link: http://hdl.handle.net/11104/0192912