Bases of admissible rules of Łukasiewicz logic

Number of the records: 1

1.

SYSNO ASEP	0351058
Document Type	J - Journal Article
R&D Document Type	Journal Article
Subsidiary J	Článek ve WOS
Title	Bases of admissible rules of Łukasiewicz logic
Author(s)	Jeřábek, Emil (MU-W)_{RID, SAI, ORCID}
Source Title	Journal of Logic and Computation - ISSN 0955-792X Roč. 20, č. 6 (2010), s. 1149-1163
Number of pages	15 s.
Language	eng - English
Country	GB - United Kingdom
Keywords	Łukasiewicz logic ; admissible rule ; bases of admissible rules
Subject RIV	BA - General Mathematics
R&D Projects	IAA900090703 GA AV ČR - Academy of Sciences of the Czech Republic (AV ČR)
	IAA100190902 GA AV ČR - Academy of Sciences of the Czech Republic (AV ČR)
	1M0545 GA MŠMT - Ministry of Education, Youth and Sports (MEYS)
CEZ	AV0Z10190503 - MU-W (2005-2011)
UT WOS	000284432700001
EID SCOPUS	78649459013
DOI	10.1093/logcom/exp082
Annotation	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.
Workplace	Mathematical Institute
Contact	Jarmila Štruncová, struncova@math.cas.cz, library@math.cas.cz, Tel.: 222 090 757
Year of Publishing	2011

Number of the records: 1