A simplified lower bound for implicational logic
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985840%3A_____%2F25%3A00619396" target="_blank" >RIV/67985840:_____/25:00619396 - isvavai.cz</a>
Result on the web
<a href="https://doi.org/10.1017/bsl.2025.6" target="_blank" >https://doi.org/10.1017/bsl.2025.6</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1017/bsl.2025.6" target="_blank" >10.1017/bsl.2025.6</a>
Alternative languages
Result language
angličtina
Original language name
A simplified lower bound for implicational logic
Original language description
We present a streamlined and simplified exponential lower bound on the length of proofs in intuitionistic implicational logic, adapted to Gordeev and Haeusler's dag-like natural deduction.
Czech name
—
Czech description
—
Classification
Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10101 - Pure mathematics
Result continuities
Project
<a href="/en/project/GA23-04825S" target="_blank" >GA23-04825S: Logic and unsatisfiability</a><br>
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace
Others
Publication year
2025
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
Bulletin of Symbolic Logic
ISSN
1079-8986
e-ISSN
1943-5894
Volume of the periodical
31
Issue of the periodical within the volume
1
Country of publishing house
GB - UNITED KINGDOM
Number of pages
35
Pages from-to
53-87
UT code for WoS article
001470488300002
EID of the result in the Scopus database
2-s2.0-105003586648