<?xml version="1.0" encoding="UTF-8"?>
<XML><RECORDS>
<RECORD>
	<REFERENCE_TYPE>3</REFERENCE_TYPE>
	<AUTHORS>
		<AUTHOR>Pilar Dellunde</AUTHOR>
		<AUTHOR>Francesc Esteva</AUTHOR>
	</AUTHORS>
	<YEAR>2010</YEAR>
	<TITLE>On elementary extensions in Fuzzy Predicate Logics</TITLE>
	<SECONDARY_AUTHORS>
		<SECONDARY_AUTHOR>E. Huellermeier, R. Kruse, and F. Hoffmann</SECONDARY_AUTHOR>
	</SECONDARY_AUTHORS>
	<SECONDARY_TITLE>IPMU 2010</SECONDARY_TITLE>
	<PLACE_PUBLISHED>Dortmund, Germany</PLACE_PUBLISHED>
	<VOLUME>6178</VOLUME>
	<PAGES>747-756</PAGES>
	<TERTIARY_TITLE>Lecture Notes in Artificial Intelligence</TERTIARY_TITLE>
	<DATE>28/06/2010</DATE>
	<KEYWORDS>
		<KEYWORD>equality-free</KEYWORD>
		<KEYWORD>language,</KEYWORD>
		<KEYWORD>fuzzy</KEYWORD>
		<KEYWORD>predicate</KEYWORD>
		<KEYWORD>logic,</KEYWORD>
		<KEYWORD>model</KEYWORD>
		<KEYWORD>theory,</KEYWORD>
		<KEYWORD>elementary</KEYWORD>
		<KEYWORD>extension,</KEYWORD>
		<KEYWORD>elementary</KEYWORD>
		<KEYWORD>equivalence</KEYWORD>
	</KEYWORDS>
	<ABSTRACT>Abstract. Our work is a contribution to the model-theoretic study of
equality-free fuzzy predicate logics. We give a characterization of ele-
mentary equivalence in fuzzy predicate logics using elementary exten-
sions and introduce an strengthening of this notion, the so-called strong
elementary equivalence. Using the method of diagrams developed in [5]
and elementary extensions we present a counterexample to Conjectures
1 and 2 of [8].
</ABSTRACT>
</RECORD>
</RECORDS></XML>