0422069 - ÚI 2014 RIV DE eng C - Conference Paper (international conference)
Cintula, Petr - Metcalfe, G.
Herbrand Theorems for Substructural Logics.
Logic for Programming, Artificial Intelligence, and Reasoning. Berlin: Springer, 2013 - (McMillan, K.; Middeldorp, A.; Voronkov, A.), s. 584-600. Lecture Notes in Computer Science, Advanced Research in Computing and Software Science, 8312. ISBN 978-3-642-45221-5. ISSN 0302-9743.
[LPAR-19. International Conference /19./. Stellenbosch (ZA), 14.12.2013-19.12.2013]
R&D Projects: GA ČR GAP202/10/1826
Institutional support: RVO:67985807
Keywords : substructural logics * residuated lattices * Herbrand theorem * Skolemization * predicate logics
Subject RIV: BA - General Mathematics

Herbrand and Skolemization theorems are obtained for a broad family of first-order substructural logics. These logics typically lack equivalent prenex forms, a deduction theorem, and reductions of semantic consequence to satisfiability. The Herbrand and Skolemization theorems therefore take various forms, applying either to the left or right of the consequence relation, and to restricted classes of formulas.
Permanent Link: http://hdl.handle.net/11104/0228284