From Feasible Proofs to Feasible Computations
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F10%3A10050648" target="_blank" >RIV/00216208:11320/10:10050648 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
From Feasible Proofs to Feasible Computations
Original language description
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.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
BA - General mathematics
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/LC505" target="_blank" >LC505: Eduard Čech Center for Algebra and Geometry</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2010
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Computer Science Logic
ISBN
3-642-15204-X
ISSN
—
e-ISSN
—
Number of pages
10
Pages from-to
—
Publisher name
SPRINGER
Place of publication
Německo
Event location
Edinburgh, Skotsko
Event date
Jul 11, 2010
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—