Priorean Strict Implication, Q and Related Systems
نویسنده
چکیده
منابع مشابه
ON ($epsilon, epsilon vee q$)-FUZZY IDEALS OF BCI-ALGEBRAS
The aim of this paper is to introduce the notions of ($epsilon, epsilon vee q$)-fuzzy p-ideals, ($epsilon, epsilon vee q$)-fuzzy q-ideals and ($epsilon, epsilon vee q$)-fuzzy a-ideals in BCIalgebras and to investigate some of their properties. Several characterizationtheorems for these generalized fuzzy ideals are proved and the relationshipamong these generalized fuzzy ideals of BCI-algebras i...
متن کاملGENERALIZED FUZZY POLYGROUPS
small Polygroups are multi-valued systems that satisfy group-likeaxioms. Using the notion of “belonging ($epsilon$)” and “quasi-coincidence (q)” offuzzy points with fuzzy sets, the concept of ($epsilon$, $epsilon$ $vee$ q)-fuzzy subpolygroups isintroduced. The study of ($epsilon$, $epsilon$ $vee$ q)-fuzzy normal subpolygroups of a polygroupare dealt with. Characterization and some of the fundam...
متن کاملToward Formalizing Usefulness in Propositional Language
In this paper, we attempt to capture the notion of usefulness in propositional language. We believe that classical implication captures a certain kind of usefulness, and name it strict usefulness. We say that a formula P is strictly useful to a formula Q under a formula set Γ if and only if P implies Q under Γ in classical propositional logic. We also believe that classical implication is too s...
متن کاملOn fuzzy filters of pseudo BL-algebras
The aim of this paper is to introduce the notion of (∈,∈∨ q)-fuzzy (implicative, MV and G-) filters of pseudo-BL algebras and to investigate some of their related properties. Some characterization theorems of these generalized fuzzy (implicative) filters are derived. The relationship among these generalized fuzzy filters of pseudo-BL algebras is considered. It is proved that an (∈,∈ ∨q)-fuzzy f...
متن کاملComplexity of Strict Implication
The aim of the present paper is to analyze the complexity of strict implication (together with falsum, conjunction and disjunction). We prove that Ladner’s Theorem remains valid when we restrict the language to the strict implication fragment, and that the same holds for Hemaspaandra’s Theorem. As a consequence we have that the validity problem for most standard normal modal logics is the same ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Studia Logica
دوره 69 شماره
صفحات -
تاریخ انتشار 2001