Počet záznamů: 1

# Skolemization and Herbrand theorems for lattice-valued logics

1. 1.
0501613 - ÚI 2020 RIV NL eng J - Článek v odborném periodiku
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
Grant CEP: GA ČR GBP202/12/G061
GRANT EU: European Commission(XE) 689176 - SYSMICS
Institucionální podpora: RVO:67985807
Klíčová slova: Skolemization * Herbrand theorems * Non-classical logics * Lattices
Obor OECD: Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Impakt faktor: 0.747, rok: 2019
Způsob publikování: Omezený přístup
http://dx.doi.org/10.1016/j.tcs.2019.02.007

Skolemization and Herbrand theorems are obtained for first-order logics based on algebras with a complete lattice reduct and operations that are monotone or antitone in each argument. These lattice-valued logics, defined as consequence relations on inequations between formulas, typically lack properties underlying automated reasoning in classical first-order logic such as prenexation, deduction theorems, or reductions from consequence to satisfiability. Skolemization and Herbrand theorems for the logics therefore take various forms, applying to the left or right of consequences, and restricted classes of inequations. In particular, in the presence of certain witnessing conditions, they admit sound “parallel” Skolemization procedures where a strong quantifier is removed by introducing a finite disjunction or conjunction of formulas with new function symbols. A general expansion lemma is also established that reduces consequence in a lattice-valued logic between inequations containing only strong occurrences of quantifiers on the left and weak occurrences on the right to consequence between inequations in the corresponding propositional logic. If propositional consequence is finitary, this lemma yields a Herbrand theorem for the logic.