Bases of admissible rules of Łukasiewicz
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985840%3A_____%2F10%3A00351058" target="_blank" >RIV/67985840:_____/10:00351058 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Bases of admissible rules of Łukasiewicz
Original language description
We construct explicit bases of single-conclusion and multiple-conclusion admissible rules of propositional Łukasiewicz logic, and we prove that every formula has an admissibly saturated approximation. We also show that Łukasiewicz logic has no finite basis of admissible rules.
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
Result was created during the realization of more than one project. More information in the Projects tab.
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
Name of the periodical
Journal of Logic and Computation
ISSN
0955-792X
e-ISSN
—
Volume of the periodical
20
Issue of the periodical within the volume
6
Country of publishing house
GB - UNITED KINGDOM
Number of pages
15
Pages from-to
—
UT code for WoS article
000284432700001
EID of the result in the Scopus database
—