Noetherian Godel logics
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985807%3A_____%2F22%3A00568283" target="_blank" >RIV/67985807:_____/22:00568283 - isvavai.cz</a>
Result on the web
<a href="https://dx.doi.org/10.1093/logcom/exac064" target="_blank" >https://dx.doi.org/10.1093/logcom/exac064</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1093/logcom/exac064" target="_blank" >10.1093/logcom/exac064</a>
Alternative languages
Result language
angličtina
Original language name
Noetherian Godel logics
Original language description
We introduce Noetherian Godel logics, Godel logics where the set of truth values is a closed subset of [0,1] containing $0$ and 1 and without any infinite ascending sequences. There are infinitely many such logics, including the well-known logic G(down arrow) whose set of truth values is T-down arrow = {0} boolean OR {1/n : n is an element of N{0}. We compute the complexity of satisfiability and validity for each Noetherian Godel logic and, in particular, in the logic G(down arrow). This yields optimal strengthening of the results of Baaz-Leitsch-Zach and Hajek.
Czech name
—
Czech description
—
Classification
Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10101 - Pure mathematics
Result continuities
Project
—
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace
Others
Publication year
2022
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
1465-363X
Volume of the periodical
32
Issue of the periodical within the volume
8
Country of publishing house
GB - UNITED KINGDOM
Number of pages
17
Pages from-to
1487-1503
UT code for WoS article
000892388000001
EID of the result in the Scopus database
—