On completeness results for predicate

نویسندگان

  • F. Esteva
  • L. Godo
  • C. Noguera
چکیده

In this paper we deal with generic expansions of first-order predicate logics of some left-continuous t-norms with a countable set of truth-constants. Besides already known results for the case of Lukasiewicz logic, we obtain new conservativeness and completenesss results for some other expansions. Namely, we prove that the expansions of predicate Product, Gödel and Nilpotent Minimum logics with truth-constants are conservative, which already implies the failure of standard completeness for the case of Product logic. In contrast, the expansions of predicate Gödel and Nilpotent Minimum logics are proved to be strong standard complete but, when the semantics is restricted to the canonical algebra, they are proved to be complete only for tautologies. Moreover, when the language is restricted to evaluated formulae we prove canonical completeness for deductions from finite sets of premises.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Completeness Results for the Expansions with Truth-constants of Some Predicate Fuzzy Logics

In this paper we study generic expansions of predicate logics of some left-continuous t-norms (mainly Gödel and Nilpotent Minimum predicate logics) with a countable set of truth-constants. Using known results on tnorm based predicate fuzzy logics we obtain results on the conservativeness and completeness for the expansions of some predicate fuzzy logics. We describe the problem for the cases of...

متن کامل

The Semantics of Modal Predicate Logic I. Counterpart-Frames

We introduce a new semantics for modal predicate logic, with respect to which a rich class of first-order modal logics is complete, namely all normal first-order modal logics that are extensions of free quantified K. This logic is defined by combining positive free logic with equality PFL . = and the propositional modal logic K. We then uniformly construct—for each modal predicate logic L—a can...

متن کامل

Equational Problems and Disunification

Roughly speaking, an equational problem is a first order formula whose only predicate symbol is =. We propose some rules for the transformation of equational problems and study their correctness in various models. Then, we give completeness results with respect to some “simple” problems called solved forms. Such completeness results still hold when adding some control which moreover ensures ter...

متن کامل

On real and rational completeness of some predicate fuzzy logics with truth-constants

Moreover the term predicate fuzzy logic L∀ will denote the predicate calculus obtained from the propositional core fuzzy logic L by adding the “classical” quantifiers (∀ and ∃) together with the same axioms and rule of generalization used by Hàjek in his book [7] when defining BL∀. On the other hand, given a left-continuous t-norm ∗, if L∗ denotes the (propositional) fuzzy logic which is standa...

متن کامل

Relation between Semantic Completeness and Syntax Completeness on General Formal Systems

Semantic completeness and syntax completeness are important characters of the general formal systems, two the completeness have different meaning for a formal system. This paper analyze the relation between semantic completeness of a formal system S and syntax completeness under certain condition and the relation between the syntax completeness of S and the syntax completeness of consistent ext...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007