Fuzzy linguistic first order logic based on refined hedge algebra

We present a fuzzy linguistic first order logic having the truth domain as a refined hedge algebra. The syntax and semantic are defined. Resolution is chosen for the inference system. To capture the approximate nature of resolution inferences, the notion of reliability of resolution inferences is defined. In this respect the resolution procedure can not only prove facts but also indicate how reliable the proof is. We prove the soundness and completeness of the resolution procedure using semantic tree technique.