نتایج جستجو برای: intuitionistic normal fuzzym

تعداد نتایج: 564874  

2013
Björn Lellmann Dirk Pattinson

We consider a general format for sequent rules for not necessarily normal modal logics based on classical or intuitionistic propositional logic and provide relatively simple local conditions ensuring cut elimination for such rule sets. The rule format encompasses e.g. rules for the boolean connectives and transitive modal logics such as S4 or its constructive version. We also adapt the method o...

Journal: :Arch. Math. Log. 1998
Grigori Mints

A natural deduction system NDIL described here admits normalization and has subformula property. It has standard axioms A ` A, ` 1, standard introduction and elimination rules for &,−◦ (linear implication), ⊕ and quantifiers. The rules for ⊗ are now standard too. Structural rules are (implicit) permutation plus contraction and weakening for m-formulas. The rules for ! use an idea of D. Prawitz....

Journal: :iranian journal of fuzzy systems 2011
sunny joseph kalayathankal g. suresh singh p. b. vinodkumar sabu joseph jobin thomas

a flood warning system is a non-structural measure for flood mitigation. several parameters are responsible for flood related disasters. this work  illustrates an ordered intuitionistic fuzzy analysis that has the capability to simulate the unknown relations between a set of meteorological and hydrological parameters. in this paper, we first define ordered intuitionistic fuzzy soft sets and est...

2006
K. Dow

Kripke-style models with two accessibility relations, one intuitionistio and the other modal, are given for analogues of the modal system K based on Heyting's propositional logic. I t is shown that these two relations can combine with each other in various ways. Soundness and completeness are proved for systems with only the necessity operator, or only the possibility operator, or both. Embeddi...

Journal: :Studia Logica 1985
Kosta Dosen

This paper, a sequel to "Models for normal intuitionistie modal logics" by M. Bo~i6 and the author, which dealt with intuitionistic analogues of the modal system K, deals similarly with intuitionistic analogues of systems stronger than K, and, in particular, analogues of $4 and $5. For these propositional logics Kripke-style models with two accessibility relations, one intuitionistic and the ot...

Journal: :Adv. Operations Research 2010
Soumen Banerjee Tapan Kumar Roy

Paknejad et al.’s model is considered in this paper. Itemwise multiobjective models for both exponential and uniform lead-time demand are taken and the results are compared numerically both in fuzzy optimization and intuitionistic fuzzy optimization techniques. Objective of this paper is to establish that intuitionistic fuzzy optimizaion method is better than usual fuzzy optimization technique ...

Journal: :CoRR 2017
Ivano Ciardelli Rosalie Iemhoff Fan Yang

In recent years, the logic of questions and dependencies has been investigated in the closely related frameworks of inquisitive logic and dependence logic. These investigations have assumed classical logic as the background logic of statements, and added formulas expressing questions and dependencies to this classical core. In this paper, we broaden the scope of these investigations by studying...

Journal: :iranian journal of fuzzy systems 0
m. shamsizadeh department of mathematics, graduate university of advanced technology, kerman, iran m. m. zahedi department of mathematics, graduate university of advanced tech- nology, kerman, iran

in this note, by considering the notions of the intuitionistic general l-fuzzy automaton and $(alpha, beta)$-language, we show that for any $(alpha, beta)$-language $mathcal{l}$, there exists a minimal intuitionistic general l-fuzzy automaton recognizing $mathcal{l}$.we prove that the minimal intuitionistic general l-fuzzy automaton is isomorphic with threshold $(alpha,beta)$ to any $(alpha, be...

Journal: :Electr. Notes Theor. Comput. Sci. 2002
Sabine Broda Luís Damas

We use an alternative graphical representation for formulas in implicational intuitionistic logic in order to obtain and demonstrate results concerning provability. We demonstrate the adequateness of the method in this area, showing that one can easily recognize and prove new results and simplify the proofs of others. As such, we extend a known class of formulas for which uniqueness of -normal ...

M. M. Zahedi, M. Shamsizadeh

In this note, by considering the notions of the intuitionistic general L-fuzzy automaton and $(alpha, beta)$-language, we show that for any $(alpha, beta)$-language $mathcal{L}$, there exists a minimal intuitionistic general L-fuzzy automaton recognizing $mathcal{L}$.We prove that the minimal intuitionistic general L-fuzzy automaton is isomorphic with threshold $(alpha,beta)$ to any $(alpha, be...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید