Basket

  1. 1.
    0501613 - ÚI 2020 RIV NL eng J - Journal Article
    Cintula, Petr - Diaconescu, D. - Metcalfe, G.
    Skolemization and Herbrand theorems for lattice-valued logics.
    Theoretical Computer Science. Roč. 768, 10 May (2019), s. 54-75. ISSN 0304-3975. E-ISSN 1879-2294
    R&D Projects: GA ČR GBP202/12/G061
    EU Projects: European Commission(XE) 689176 - SYSMICS
    Institutional support: RVO:67985807
    Keywords : Skolemization * Herbrand theorems * Non-classical logics * Lattices
    OECD category: Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
    Impact factor: 0.747, year: 2019
    Method of publishing: Limited access
    http://dx.doi.org/10.1016/j.tcs.2019.02.007
    Permanent Link: http://hdl.handle.net/11104/0293600
    FileDownloadSizeCommentaryVersionAccess
    a0501613.pdf16520.2 KBPublisher’s postprintrequire
    0501613-prep.pdf9254.4 KBhttps://www.elsevier.com/journals/theoretical-computer-science/03043975/guide-for-authorsAuthor´s preprintopen-access
     
     

  This site uses cookies to make them easier to browse. Learn more about how we use cookies.