• Title/Summary/Keyword: many-valued logic

Search Result 18, Processing Time 0.026 seconds

Strong Kleene-Diense Logic: a variant of the infinite-valued Kleene-Diense Logic

  • Yang, Eun-Suk
    • Korean Journal of Logic
    • /
    • v.8 no.2
    • /
    • pp.85-107
    • /
    • 2005
  • Kleene first investigated a three-valued system which follows the evaluations of the Lukasiewicz infinite-valued logic ${\L}C$ with respect to negation, conjunction, and disjunction, and treats $\rightarrow$ as material-like implication in the sense that A $\rightarrow$ B is defined as ${\sim}A{\vee}B$ in its evaluation. Diense and Rescher extended it to many-valued logic and infinite-valued logic, respectively. This paper investigates a variant of the infinite-valued Kleene-Diense logic KD, which we shall call strong Kleene-Diense logic (sKD): sKD has the same evaluations as KD except that sKD takes a variant of Kleene-Diense implication. Following the idea of Dunn [2], we provide algebraic completeness for sKD together with its deduction theorem.

  • PDF

Lotfi A. Zadeh

  • Lee, Seung-On;Kim, Jin-Tae
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 2008.04a
    • /
    • pp.311-312
    • /
    • 2008
  • Fuzzy logic is introduced by Zadeh in 1965. It has been continuously developed by many mathematicians and knowledge engineers all over the world. A lot of papers concerning with the history of mathematics and the mathematical education related with fuzzy logic, but there is no paper concerning with Zadeh. In this article, we investigate his life and papers about fuzzy logic. We also compare two-valued logic, three-valued logic, fuzzy logic, intuisionistic logic and intuitionistic fuzzy sets. Finally we discuss about the expression of intuitionistic fuzzy sets.

  • PDF

Lotfi A. Zadeh, the founder of fuzzy logic (퍼지 논리의 시조 Zadeh)

  • Lee, Seung-On;Kim, Jin-Tae
    • Journal for History of Mathematics
    • /
    • v.21 no.1
    • /
    • pp.29-44
    • /
    • 2008
  • Fuzzy logic is introduced by Zadeh in 1965. It has been continuously developed by many mathematicians and knowledge engineers all over the world. A lot of papers concerning with the history of mathematics and the mathematical education related with fuzzy logic, but there is no paper concerning with Zadeh. In this article, we investigate his life and papers about fuzzy logic. We also compare two-valued logic, three-valued logic, fuzzy logic, intuisionistic logic and intuitionistic fuzzy sets. Finally we discuss about the expression of intuitionistic fuzzy sets.

  • PDF

${\L}C$, LC를 위한 루트리-마이어 의미론 : 실질 함의의 역설과 다치 함의의 대안적 특성들

  • Yang, Eun-Seok
    • Korean Journal of Logic
    • /
    • v.7 no.2
    • /
    • pp.105-120
    • /
    • 2004
  • In this paper, we provide Routley-Meyer semantics for the many-valued logics ${\L}C$ and LC, and give completeness for each of them. This result shows the following two: 1) Routley-Meyer semantics is very powerful in the sense that it can be used as the semantics for several sorts of logics, i.e., many-valued logic, not merely relevance logic and substructural logic. Note that each implication of ${\L}C$ and LC does not (partially) result in "paradoxes of material implication" 2) This implies that Routley-Meyer semantics can be also used not merely for relevance systems but also for other logical systems such as ${\L}C$ and LC, each of which has its own implication by which we can overcome (partially) the problem of "paradoxes of material implication".

  • PDF

A Study on the Constructing the Function using Extension Edge Valued Graph (모서리값 확장 그래프를 사용한 함수구성에 관한연구)

  • Park, Chun-Myoung
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.17 no.4
    • /
    • pp.863-868
    • /
    • 2013
  • In recently years, many digital logic systems based on graph theory are analyzed and synthesized. This paper presented a method of constructing the function using edge valued extension graph which is based on graph theory. The graph is applied to a new data structure. from binary graph which is recently used in constructing the digital logic systems based on the graph theory. We discuss the mathematical background of literal and reed-muller expansion, and we discuss the edge valued extension graph which is the key of this paper. Also, we propose the algorithms which is the function derivation based on the proposed edge valued extension graph. That is the function minimization method of the n-variables m-valued functions and showed that the algorithm had the regularity with module by which the same blocks were made concerning about the schematic property of the proposed algorithm.

A Study on the Constructions MOVAGs based on Operation Algorithm for Multiple Valued Logic Function and Circuits Design using T-gate (다치 논리 함수 연산 알고리즘에 기초한 MOVAG 구성과 T-gate를 이용한 회로 설계에 관한 연구)

  • Yoon, Byoung-Hee;Park, Soo-Jin;Kim, Heung-Soo
    • Journal of IKEEE
    • /
    • v.8 no.1 s.14
    • /
    • pp.22-32
    • /
    • 2004
  • In this paper, we proposed MOVAG(Multi Output Value Array Graphs) based on OVAG by Honghai Jiang to construct multiple valued logic function The MDD(Muliple-valued Decision Diagra) needs many processing time and efforts in circuit design for given multi-variable function by D.M.Miller, and we designed a MOVAG which has reduce the data processing time and low complexity. We propose the construction algorithm and input matrix selection algorithm and we designed the multiple-valued logic circuit using T-gate and verified by simulation results.

  • PDF

Design of Multiple Valued Logic Circuits with ROM Type using Current Mode CMOS (전류방식 CMOS에 의한 ROM 형의 다치 논리 회로 설계)

  • 최재석;성현경
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.31B no.4
    • /
    • pp.55-61
    • /
    • 1994
  • The multiple valued logic(MVL) circuit with ROM type using current mode CMOS is presented in this paper. This circuit is composed of the multiple valued-to-binary(MV/B) decoder and the selection circuit. The MV/B decoder decodes the single input multiple valued signal to N binary signal, and the selection circuits is composed N$\times$N array of the selecion cells with ROM types. The selection cell is realized with the current mirror circuits and the inhibit circuits. The presented circuit is suitable for designing the circuit of MVL functions with independent variables, and reduces the number of selection cells for designing the circuit of symmetric MVL functions as many as {($N^2$-N)/2}+N. This circuit possess features of simplicity. expansibility for array and regularity, modularity for the wire routing. Also, it is suitable for VLSI implementation.

  • PDF

MANY VALUED LOGIC AND INTUITIONISTIC FUZZY SETS: A STONE THEOREM GENERALIZATION

  • AMROUNE, ABDELAZIZ;DAVVAZ, BIJAN
    • Honam Mathematical Journal
    • /
    • v.37 no.3
    • /
    • pp.269-279
    • /
    • 2015
  • Atanassov introduced another fuzzy object, called intu- itionistic fuzzy set as a generalization of the concept of fuzzy subset. The aim of this paper is the elaboration of a representation theory of involutive interval-valued Łukasiewicz-Moisil algebras by using the notion of intuitionistic fuzzy sets.

Some Common Fixed Point Theorems using Compatible Maps in Intuitionistic Fuzzy Metric Space

  • Park, Jong-Seo
    • International Journal of Fuzzy Logic and Intelligent Systems
    • /
    • v.11 no.2
    • /
    • pp.108-112
    • /
    • 2011
  • Kaneko et a1.[4] etc many authors extended with multi-valued maps for the notion of compatible maps in complete metric space. Recently, O'Regan et a1.[5] presented fixed point and homotopy results for compatible single-valued maps on complete metric spaces. In this paper, we will establish some common fixed point theorems using compatible maps in intuitionistic fuzzy metric space.