Herbrand Theorems and Skolemization for Prenex Fuzzy Logics

  • Matthias Baaz
  • George Metcalfe
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5028)

Abstract

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.

Keywords

Herbrand Theorem Skolemization Fuzzy Logics 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Matthias Baaz
    • 1
  • George Metcalfe
    • 2
  1. 1.Institute of Discrete Mathematics and GeometryTechnical University ViennaWienAustria
  2. 2.Department of MathematicsVanderbilt UniversityNashvilleUSA

Personalised recommendations