String rewriting and proof complexity: an interpretation of resolution
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985840%3A_____%2F09%3A00380563" target="_blank" >RIV/67985840:_____/09:00380563 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
String rewriting and proof complexity: an interpretation of resolution
Original language description
We interpret the well-known propositional proof system Resolution using string rewriting systems Sigma(n)* and Sigma(n) corresponding to tree-like proofs(a) and sequence-like proofs, respectively. We give a representation of Sigma(n)* using planar diagrams.
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/IAA1019401" target="_blank" >IAA1019401: Theories, proofs and computational complexity</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
2009
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
Reports on mathematical logic
ISSN
0137-2904
e-ISSN
—
Volume of the periodical
44
Issue of the periodical within the volume
Jun
Country of publishing house
PL - POLAND
Number of pages
34
Pages from-to
167-200
UT code for WoS article
000270972500008
EID of the result in the Scopus database
—