Herbrand Theorems and Skolemization for Prenex Fuzzy Logics

Approximate Herbrand theorems are established for first-order fuzzy logics based on continuous t-norms, and used to provide proof-theoretic proofs of Skolemization for their Prenex fragments. Decidability and complexity results for particular fragments are obtained as consequences.

• Type: Conference
• Year: 2008
• Where: CIE
• Authors: Matthias Baaz, George Metcalfe
• Keywords: Applied Computing, Approximate Herbrand Theorems, CIE 2008, First-order Fuzzy Logics, Prenex Fragments