0531136 - ÚI 2021 RIV CH eng C - Konferenční příspěvek (zahraniční konf.)
Haniková, ZuzanaOn the Complexity of Validity Degrees in Łukasiewicz Logic.
Beyond the Horizon of Computability. Cham: Springer, 2020 - (Anselmo, M.; Della Vedova, G.; Manea, F.; Pauly, A.), s. 175-188. Lecture Notes in Computer Science, 12098. ISBN 978-3-030-51465-5. ISSN 0302-9743.
[CiE 2020: Conference on Computability in Europe /16./. Salerno (IT), 29.06.2020-03.07.2020]
Grant CEP: GA ČR(CZ) GA18-00113S
Institucionální podpora: RVO:67985807
Klíčová slova: Łukasiewicz logic * propositional constants * validity degree * computational complexity * Rational Pavelka Logic
Obor OECD: Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Trvalý link: http://hdl.handle.net/11104/0309862
