A note on propositional proof complexity of some Ramsey-type statements, Archive for Mathematical Logic
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F11%3A10105293" target="_blank" >RIV/00216208:11320/11:10105293 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1007/s00153-010-0212-9" target="_blank" >http://dx.doi.org/10.1007/s00153-010-0212-9</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/s00153-010-0212-9" target="_blank" >10.1007/s00153-010-0212-9</a>
Alternative languages
Result language
angličtina
Original language name
A note on propositional proof complexity of some Ramsey-type statements, Archive for Mathematical Logic
Original language description
A Ramsey type statement can be encoded into a propositional tautology. We consider several such tautologies and prove various lenthgs-of-proofs lower bounds on them.
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/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
2011
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
Archive for Mathematical Logic [online]
ISSN
1432-0665
e-ISSN
—
Volume of the periodical
50
Issue of the periodical within the volume
1
Country of publishing house
DE - GERMANY
Number of pages
11
Pages from-to
245-255
UT code for WoS article
000286668400014
EID of the result in the Scopus database
—