On the computational content of intuitionistic propositional proofs.
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985840%3A_____%2F01%3A05010047" target="_blank" >RIV/67985840:_____/01:05010047 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
On the computational content of intuitionistic propositional proofs.
Original language description
The paper proves refined feasibility properties for the disjunction property of intuitionistic propositional logic. We prove that it is possible to eliminate all cuts from an intuitionistic proof, propositional or first-order, without increasing the Hornclosure of the proof. We obtain a polynomial time, interactive, realizability algorithm for propositional intuitionistic proofs.
Czech name
—
Czech description
—
Classification
Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
BA - General mathematics
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/IAA1019901" target="_blank" >IAA1019901: Mathematical logic and computational complexity</a><br>
Continuities
Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2001
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
Name of the periodical
Annals of Pure and Applied Logic. Special issue
ISSN
0168-0072
e-ISSN
—
Volume of the periodical
109
Issue of the periodical within the volume
1-2
Country of publishing house
NL - THE KINGDOM OF THE NETHERLANDS
Number of pages
16
Pages from-to
49-64
UT code for WoS article
—
EID of the result in the Scopus database
—