Number of the records: 1  

Skolemization and Herbrand theorems for lattice-valued logics

  1. 1.
    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
    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
    http://hdl.handle.net/11104/0293600
Number of the records: 1  

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