Number of the records: 1
Skolemization and Herbrand theorems for lattice-valued logics
- 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/0293600File Download Size Commentary Version Access a0501613.pdf 16 520.2 KB Publisher’s postprint require 0501613-prep.pdf 9 254.4 KB https://www.elsevier.com/journals/theoretical-computer-science/03043975/guide-for-authors Author´s preprint open-access
Number of the records: 1