Infinitesimals and Pavelka logic
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F15%3A00235494" target="_blank" >RIV/68407700:21230/15:00235494 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Infinitesimals and Pavelka logic
Original language description
Rational Pavelka Logic does not admit infinitesimals. We argue that infinitesimals are important in logic and we present an alternative approach which admits them. It is built up in a similar style, but based on the Chang's perfect MV-algebra. We prove apartial result towards the completeness of this logic. We also discuss a combined approach using more complex perfect MV-algebras.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
BA - General mathematics
OECD FORD branch
—
Result continuities
Project
—
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace
Others
Publication year
2015
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
Article name in the collection
International Joint Conference IFSA - EUSFLAT 2015
ISBN
978-94-6252-077-6
ISSN
1951-6851
e-ISSN
—
Number of pages
7
Pages from-to
1027-1033
Publisher name
European Centre for Soft Computing
Place of publication
Asturias
Event location
Gijón
Event date
Jun 30, 2015
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
000358581100145