Connection between Extenics and Refined Neutrosophic Logic

Slides:



Advertisements
Similar presentations
A hybrid model of automatic indexing based on paraconsistent logic Carlos Alberto Correa (University of São Paulo) Nair Yumiko Kobashi (University of São.
Advertisements

Fuzzy Sets and Fuzzy Logic
CLASSICAL LOGIC and FUZZY LOGIC. CLASSICAL LOGIC In classical logic, a simple proposition P is a linguistic, or declarative, statement contained within.
Preview Warm Up California Standards Lesson Presentation.
Fuzzy Sets and Fuzzy Logic Theory and Applications
Fuzzy Logic Frank Costanzo – MAT 7670 Spring 2012.
Extension Principle — Concepts
Copyright © Cengage Learning. All rights reserved.
Relation, function 1 Mathematical logic Lesson 5 Relations, mappings, countable and uncountable sets.
Skills for October Rounds
7 th International Conference on Numerical Methods and Applications, August 20-24, 2010, Borovets, Bulgaria Intuitionistic Fuzzy Interpretations of Conway's.
Fuzzy Logic. Lecture Outline Fuzzy Systems Fuzzy Sets Membership Functions Fuzzy Operators Fuzzy Set Characteristics Fuzziness and Probability.
1 Introduction to Abstract Mathematics The Logic and Language of Proofs Instructor: Hayk Melikya Proposition: Informal introduction to.
Advanced information retrieval Chapter. 02: Modeling (Set Theoretic Models) – Fuzzy model.
Logical Systems and Knowledge Representation Fuzzy Logical Systems 1.
Lógica difusa  Bayesian updating and certainty theory are techniques for handling the uncertainty that arises, or is assumed to arise, from statistical.
Theory and Applications
Holt CA Course Introduction to Integers Vocabulary opposite integer absolute value.
Topic 2 Fuzzy Logic Control. Ming-Feng Yeh2-2 Outlines Basic concepts of fuzzy set theory Fuzzy relations Fuzzy logic control General Fuzzy System R.R.
IEEE Intelligent Systems ‘2010, London, UK On Intuitionistic Fuzzy Negations and Law of Excluded Middle Krassimir T. Atanassov Centre of Biophysics and.
Holt CA Course Introduction to Integers Warm Up Compare. Use, or = > < > >
Course Integers 2-1 Integers Course 2 Warm Up Warm Up Problem of the Day Problem of the Day Lesson Presentation Lesson Presentation.
Logic UNIT 1.
Recuperação de Informação B Cap. 02: Modeling (Set Theoretic Models) 2.6 September 08, 1999.
2-1 Integers Warm Up Warm Up Lesson Presentation Lesson Presentation Problem of the Day Problem of the Day Lesson Quizzes Lesson Quizzes Objective: Students.
Prof. Dr.Florentin Smarandache President of the University of New Mexico in USA Neutrosophic Mathematics and Computer Science A. A. Salama He published.
BOOLEAN INFORMATION RETRIEVAL 1Adrienn Skrop. Boolean Information Retrieval  The Boolean model of IR (BIR) is a classical IR model and, at the same time,
Logic.
WARM UP The least common denominator of the fractions and is
As a new research field Florentin Smarandache,
Some Aggregation Operators For Bipolar-Valued Hesitant Fuzzy Information Tahir Mahmood Department of Mathematics, International Islamic University Islamabad,
Shortest Path Problem Under Triangular Fuzzy Neutrosophic Information
Generalized Single Valued Neutrosophic Graphs of First Type
Third International Conference of Nursing Port Said 2017
Set Operations CS 202, Spring 2008 Epp, chapter 5.
Applying Dijkstra Algorithm for Solving Neutrosophic Shortest Path Problem Luige Vladareanu Institute of Solid Mechanics, Romanian Academy, Bucharest,
Nursing Researches & Neutrosophic Techniques
Shan Ye1, Jing Fu2 and Jun Ye3
of Neutrosophic Logic and Set and their Applications
Neutrosophic Mathematics رياضيات جديدة سوف تغير وجه العالم
Florentin Smarandache
Complex Neutrosophic Graphs of Type 1
Generalizations in Extenics of the Location Value and Dependent Function from A Single Finite Interval to 2D, 3D, and n-D Spaces Prof. Florentin Smarandache,
Discrimination of Outer Membrane Proteins using Reformulated Support Vector Machine based on Neutrosophic.
Prof. Florentin Smarandache, Ph D The University of New Mexico
Selçuk Topal and Florentin Smarandache
Number Theory and the Real Number System
Artificial Intelligence
Copyright 2012, 2008, 2004, 2000 Pearson Education, Inc.
CLASSICAL LOGIC and FUZZY LOGIC
Distinct Distances in the Plane
Number Theory and the Real Number System
Lesson 5 Relations, mappings, countable and uncountable sets
2-1 Integers Course 2 Warm Up Problem of the Day Lesson Presentation.
Medical Images Edge Detection via Neutrosophic Mathematical Morphology
Copyright © Cengage Learning. All rights reserved.
Fundamentals of Computer Systems
Neutrosophic Mathematical Morphology for Medical Image
Neutrosophic Masses & Indeterminate Models
Lesson 5 Relations, mappings, countable and uncountable sets
Discrete Mathematics CMP-200 Propositional Equivalences, Predicates & Quantifiers, Negating Quantified Statements Abdul Hameed
6.3 Truth Tables for Propositions
The Thinking of Grey Information Coverage
Copyright © Cengage Learning. All rights reserved.
Copyright © Cengage Learning. All rights reserved.
2-1 Integers Course 2 Warm Up Problem of the Day Lesson Presentation.
§5.2, The Integers; Order of Operations
Fuzzy Logic KH Wong Fuzzy Logic v.9a.
Logical truths, contradictions and disjunctive normal form
Truth tables.
Presentation transcript:

Connection between Extenics and Refined Neutrosophic Logic Prof. Florentin Smarandache, Ph D The University of New Mexico Math & Science Dept. 705 Gurley Ave. Gallup, NM 87301, USA fs.galllup.unm.edu/neutrosophy.htm International Conference on Extenics, Beijing, 16-19 August, 2013

Contents Two-Valued Logic Three-Valued Logic & Extenics Four-Valued Logic & Extenics Five-Valued Logic & Extenics Seven-Valued Logic & Extenics n-Valued Logic & Extenics Neutrosophic Cube and its Extenics Part Example of Extenics in 3-Valued Neutrosophic Logic Example of Extenics in 4-Valued Neutrosophic Logic

Abstract The aim of this presentation is to connect Extenics with new fields of research, i.e. fuzzy logic and neutrosophic logic. We show herein: How Extenics is connected to the 3-Valued Neutrosophic Logic; How Extenics is connected to the 4-Valued Neutrosophic Logic; How Extenics is connected to the n-Valued Neutrosophic Logic; When contradiction occurs.

Two-Valued Logic The Two Symbol-Valued Logic is the classical or Boolean Logic, which has two values: true and false (or 1 and 0). In Chinese philosophy: Yin and Yang (or Femininity and Masculinity) as contraries: 2. The Two Numerical-Valued Logic is the Fuzzy Logic, where the truth (t) and the falsity (f) can be any numbers in [0,1] such that t + f=1. More general, t and f can be subsets of [0,1].

Three-Valued Logic & EXtenics The Three Symbol-Valued Logics: a) Łukasiewicz ’s Logic: True, False, and Possible. b) Kleene’s Logic: True, False, Unknown (or Undefined), or with numbers 1, 0, and ½. Use “min” for /\, “max” for \/, and “1-” for negation. 2. The Three Numerical-Valued Logic is the Neutrosophic Logic [Smarandache, 1995], where the truth (t) and the falsity (f) and the indeterminacy (i) can be any numbers in [0, 1], then 0 ≤ t + I + f ≤ 3. More general: Truth (T), Falsity (F), and Indeterminacy (I) are standard or nonstandard subsets of the nonstandard interval ]-0, 1+[. When t + f > 1 we have conflict, hence Extenics.

Three-Valued Logic & Extenics (2) Chinese philosophy extended to: Yin, Yang, and Neuter (or Femininity, Masculinity, and Neutrality). Neutrosophy philosophy was born from neutrality between various philosophies. Connected with Extenics (Prof. Cai Wen, 1983), and Paradoxism (F. Smarandache, 1980). Neutrosophy is a new branch of philosophy that studies the origin, nature, and scope of neutralities, as well as their interactions with different ideational spectra. This theory considers every notion or idea <A> together with its opposite or negation <antiA> and with their spectrum of neutralities <neutA> in between them (i.e. notions or ideas supporting neither <A> nor <antiA>). The <neutA> and <antiA> ideas together are referred to as <nonA>.

Three-Valued Logic & Extenics (3) Neutrosophy is a generalization of Hegel's dialectics (the last one is based on <A> and <antiA> only). According to this theory every idea <A> tends to be neutralized and balanced by <antiA> and <nonA> ideas - as a state of equilibrium. In a classical way <A>, <neutA>, <antiA> are disjoint two by two. But, since in many cases the borders between notions are vague, imprecise, Sorites, it is possible that <A>, <neutA>, <antiA> (and <nonA> of course) have common parts two by two, or even all three of them as well. Such contradictions involves Extenics. Neutrosophy is the base of all neutrosophics and it is used in engineering applications (especially for software and information fusion), medicine, military, airspace, cybernetics, physics.

Four-Valued Logic & Extenics The Four Symbol-Valued Logic Belnap’s Logic: True (T), False (F), Unknown (U), and Contradiction (C), where T, F, U, C are symbols, not numbers. Now we have EXTENICS, thanks to C = contradiction. Below is Belnap’s conjunction operator table: Restricted to T,F,U and to T,F,C, Belnap connectives coincide with connectives in Kleene’s logic.

Four-Valued Logic & Extenics (2) 2. The Four Numerical-Valued Logic Four Numerical-Valued Neutrosophic Logic: Indeterminacy I is refined (split) as U = Unknown, and C = contradiction. T, F, U, C are subsets of [0, 1]; Generalizes Belnap’s logic since one gets degree of truth, degree of falsity, degree of unknown, and degree of contradiction. C = T/\F involves the Extenics.

Five-Valued Logic & Extenics 1. Five Symbol-Valued Neutrosophic Logic [Smarandache, 1995]: Indeterminacy I is refined (split) as U = Unknown, C = contradiction, and G = ignorance; where the symbols represent: T = truth; F = falsity; U = neither T nor F (undefined); C = T/\F, which involves the Extenics; G = T\/F. 2. If T, F, U, C, G are subsets of [0, 1] then we get: Five Numerical-Valued Neutrosophic Logic.

Seven-Valued Logic & Extenics 1. Seven Symbol-Valued Neutrosophic Logic [Smarandache, 1995]: I is refined (split) as U, C, G, but T also is refined as T1 = absolute thuth and T2 = relative truth, and F is refined as F1 = absolute falsity and F2 = relative falsity. Where: U = neither Tj nor Fk (undefined); C = Tj/\Fk, which involves the Extenics; G = Tj\/Fk. All are symbols. 2. But if T1, T2, F1, F2, U, C, G are subsets of [0, 1] then we get: Five Numerical-Valued Neutrosophic Logic.

n-Valued Logic & Extenics 1. The n-Symbol-Valued Logic is The Refined n-Symbol-Valued Neutrosophic Logic [Smarandache, 1995]. In general: T can be split into types of truths: T1, T2, ..., Tp, and I into types of indeterminacies: I1, I2, ..., Ir, and F into types of falsities: F1, F2, ..., Fs, where p + r + s = n. All subcomponents Tk, Ij, Fl are symbols. If at least one Ij = Tk /\ Fl = contradiction, we get again the Extenics.

n-Valued Logic & Extenics (2) 2. The n-Numerical-Valued Logic is The Refined n-Numerical-Valued Neutrosophic Logic. In the same way: T is be split into types of truths: T1, T2, ..., Tp, and I into types of indeterminacies: I1, I2, ..., Ir, and F into types of falsities: F1, F2, ..., Fs, where p + r + s = n. But all subcomponents Tk, Ij, Fl are not symbols, but subsets of [0,1], for all k in {1,2,…,p}, all j in {1,2,…,r}, and all l in {1,2,…,s}. For at least one Ij = Tk /\ Fl = contradiction, we get again the Extenics.

Neutrosophic Cube and its Extenics Part The most important distinction between IFS and NS is showed in the below Neutrosophic Cube A’B’C’D’E’F’G’H’ introduced by J. Dezert in 2002. Because in technical applications only the classical interval is used as range for the neutrosophic parameters , we call the cube the technical neutrosophic cube and its extension the neutrosophic cube (or absolute neutrosophic cube), used in the fields where we need to differentiate between absolute and relative (as in philosophy) notions.

Neutrosophic Cube and its Extenics Part (2)

Neutrosophic Cube and its Extenics Part (3) Let’s consider a 3D-Cartesian system of coordinates, where t is the truth axis with value range in ]-0,1+[, i is the false axis with value range in ]-0,1+[, and similarly f is the indeterminate axis with value range in ]-0,1+[. We now divide the technical neutrosophic cube ABCDEFGH into three disjoint regions: 1) The equilateral triangle BDE, whose sides are equal to √(2) which represents the geometrical locus of the points whose sum of the coordinates is 1. If a point Q is situated on the sides of the triangle BDE or inside of it, then tQ+iQ+fQ=1 as in Atanassov-intuitionistic fuzzy set (A-IFS).

Neutrosophic Cube and its Extenics Part (4) 2) The pyramid EABD {situated in the right side of the triangle EBD, including its faces triangle ABD(base), triangle EBA, and triangle EDA (lateral faces), but excluding its face: triangle BDE } is the locus of the points whose sum of coordinates is less than 1 (Incomplete Logic). 3) In the left side of triangle BDE in the cube there is the solid EFGCDEBD ( excluding triangle BDE) which is the locus of points whose sum of their coordinates is greater than 1 as in the paraconsistent logic. This is the Extenics part.

Neutrosophic Cube and its Extenics Part (4) It is possible to get the sum of coordinates strictly less than 1 (in Incomplete information), or strictly greater than 1 (in contradictory Extenics). For example: We have a source which is capable to find only the degree of membership of an element; but it is unable to find the degree of non-membership; Another source which is capable to find only the degree of non-membership of an element; Or a source which only computes the indeterminacy. Thus, when we put the results together of these sources, it is possible that their sum is not 1, but smaller (Incomplete) or greater (Extenics).

Example of Extenics in 3-Valued Neutrosophic Logic About a proposition P, the first source of information provides the truth-value T=0.8. Second source of information provides the false-value F=0.7. Third source of information provides the indeterminacy-value I=0.2. Hence NL3(P) = (0.8, 0.2, 0.7) Got Extenics, since Contradiction: T+F = 0.8+0.7>1 Can remove Contradiction by normalization: NL(P) = (0.47, 0.12, 0.41); now T+F ≤ 1.

Example of Extenics in 4-Valued Neutrosophic Logic About a proposition Q, the first source of information provides the truth-value T=0.4, second source provides the false-value F=0.3, third source provides the undefined-value U=0.1, fourth source provides the contradiction-value C=0.2. Hence NL4(Q) = (0.4, 0.1, 0.2, 0.3). Got Extenics, since Contradiction C = 0.2 > 0. Since C =T/\F, we can remove it by transferring its value 0.2 to T and F (since T and F were involved in the conflict) proportionally w.r.t. their values 0. 4,0.3: xT/0.4 = yF/0.3 = 0.2/(0.4+0.3), whence xT=0.11, yF=0.09. Thus T=0.4+0.11=0.51, F=0.3+0.09=0.39, U=0.1, C=0.

References Yang Chunyan, Cai Wen. Extension Engineering [M]. Beijing: Science Press, 2007. Florentin Smarandache, A Unifying Field in Logics: Neutrosophic Logic, <Multiple Valued Logic / An International Journal>, USA, ISSN 1023-6627, Vol. 8, No. 3, pp. 385-438, 2002. The whole issue of this journal is dedicated to Neutrosophy and Neutrosophic Logic. Didier Dubois, Uncertainty Theories, Degrees of Truth and Epistemic States, http://www.icaart.org/Documents/Previous_Invited_Speakers/2011/ICAART2011_Dubois.pdf .