In general if we define on this set an operation of connotative product the result is not interpretable and may not make any sense.

Similar documents
Unit 2 Boolean Algebra

2.2: Logical Equivalence: The Laws of Logic

1. Propositions: Contrapositives and Converses

cse541 LOGIC FOR COMPUTER SCIENCE

CHAPTER 2 INTRODUCTION TO CLASSICAL PROPOSITIONAL LOGIC

22c:145 Artificial Intelligence

Computer Organization I

Přednáška 12. Důkazové kalkuly Kalkul Hilbertova typu. 11/29/2006 Hilbertův kalkul 1

Packet #1: Logic & Proofs. Applied Discrete Mathematics

Packet #2: Set Theory & Predicate Calculus. Applied Discrete Mathematics

Chapter 2: Introduction to Propositional Logic

Lecture 7. Logic. Section1: Statement Logic.

EECS 1028 M: Discrete Mathematics for Engineers

Truth-Functional Logic

Propositional Logic. Spring Propositional Logic Spring / 32

More Propositional Logic Algebra: Expressive Completeness and Completeness of Equivalences. Computability and Logic

12/31/2010. Overview. 05-Boolean Algebra Part 3 Text: Unit 3, 7. DeMorgan s Law. Example. Example. DeMorgan s Law

Boolean Algebra, Gates and Circuits

This form sometimes used in logic circuit, example:

Description Logics. Foundations of Propositional Logic. franconi. Enrico Franconi

Propositional logic ( ): Review from Mat 1348

Review of Propositional Calculus

1. Prove: A full m- ary tree with i internal vertices contains n = mi + 1 vertices.

10/5/2012. Logic? What is logic? Propositional Logic. Propositional Logic (Rosen, Chapter ) Logic is a truth-preserving system of inference

EECS150 - Digital Design Lecture 19 - Combinational Logic Circuits : A Deep Dive

CHAPTER 10. Gentzen Style Proof Systems for Classical Logic

It rains now. (true) The followings are not propositions.

CHAPTER 1. MATHEMATICAL LOGIC 1.1 Fundamentals of Mathematical Logic

CHAPTER 3 BOOLEAN ALGEBRA

Discrete Mathematics. (c) Marcin Sydow. Sets. Set operations. Sets. Set identities Number sets. Pair. Power Set. Venn diagrams

CSC165 Mathematical Expression and Reasoning for Computer Science

Chapter 2: Switching Algebra and Logic Circuits

Marie Duží

Propositional logic (revision) & semantic entailment. p. 1/34

UNIVERSITI TENAGA NASIONAL. College of Information Technology

SAMPLE ANSWERS MARKER COPY

Lecture 6: Manipulation of Algebraic Functions, Boolean Algebra, Karnaugh Maps

Logic. Definition [1] A logic is a formal language that comes with rules for deducing the truth of one proposition from the truth of another.

Chapter 1 Elementary Logic

Example. Logic. Logical Statements. Outline of logic topics. Logical Connectives. Logical Connectives

Propositional Logic and Semantics

CSCE 222 Discrete Structures for Computing. Propositional Logic. Dr. Hyunyoung Lee. !!!!!! Based on slides by Andreas Klappenecker

CS206 Lecture 03. Propositional Logic Proofs. Plan for Lecture 03. Axioms. Normal Forms

Chapter 2 Combinational Logic Circuits

With Question/Answer Animations. Chapter 2

Properties of Real Numbers. Unit 1 Lesson 4

Discrete Mathematics. W. Ethan Duckworth. Fall 2017, Loyola University Maryland

Chapter 11: Automated Proof Systems (1)

Methods of Partial Logic for Knowledge Representation and Deductive Reasoning in Incompletely Specified Domains

Before you get started, make sure you ve read Chapter 1, which sets the tone for the work we will begin doing here.

Introduction. Foundations of Computing Science. Pallab Dasgupta Professor, Dept. of Computer Sc & Engg INDIAN INSTITUTE OF TECHNOLOGY KHARAGPUR

Section 1.2 Propositional Equivalences. A tautology is a proposition which is always true. A contradiction is a proposition which is always false.

2/13/2012. Logic: Truth Tables. CS160 Rosen Chapter 1. Logic?

Adequate set of connectives, logic gates and circuits

Propositional natural deduction

Week-I. Combinational Logic & Circuits

Applied Logic. Lecture 1 - Propositional logic. Marcin Szczuka. Institute of Informatics, The University of Warsaw

For all For every For each For any There exists at least one There exists There is Some

Paucity, abundance, and the theory of number: Online Appendices

CSC Discrete Math I, Spring Propositional Logic

Boolean algebra. Examples of these individual laws of Boolean, rules and theorems for Boolean algebra are given in the following table.

Announcements. CS243: Discrete Structures. Propositional Logic II. Review. Operator Precedence. Operator Precedence, cont. Operator Precedence Example

CHAPTER III BOOLEAN ALGEBRA

Topic 1: Propositional logic

The least element is 0000, the greatest element is 1111.

First-Degree Entailment

Gate-Level Minimization

Informal Statement Calculus

Practice Test III, Math 314, Spring 2016

Boolean Algebra CHAPTER 15

CS 173: Discrete Mathematical Structures, Spring 2008 Homework 1 Solutions

Logic. Propositional Logic: Syntax

A Guide to Proof-Writing

Propositional logic. First order logic. Alexander Clark. Autumn 2014

Some consequences of compactness in Lukasiewicz Predicate Logic

Lecture 4: Proposition, Connectives and Truth Tables

First order Logic ( Predicate Logic) and Methods of Proof

Compound Propositions

Chapter 2 : Boolean Algebra and Logic Gates

1 The Foundation: Logic and Proofs

ANALYSIS EXERCISE 1 SOLUTIONS

02 Propositional Logic

Last Time. Inference Rules

Conjunction: p q is true if both p, q are true, and false if at least one of p, q is false. The truth table for conjunction is as follows.

MC9211 Computer Organization

Logic Gate Level. Part 2

Chapter 11: Automated Proof Systems

CHAPTER III BOOLEAN ALGEBRA

Ex: Boolean expression for majority function F = A'BC + AB'C + ABC ' + ABC.

Language of Propositional Logic

Propositional Calculus: Formula Simplification, Essential Laws, Normal Forms

First Order Logic (FOL) 1 znj/dm2017

Natural Deduction for Propositional Logic

Section 1.1 Propositional Logic. proposition : true = T (or 1) or false = F (or 0) (binary logic) the moon is made of green cheese

Logic. Propositional Logic: Syntax. Wffs

CHAPTER 12 Boolean Algebra

CHAPTER 11. Introduction to Intuitionistic Logic

Lecture 2: Syntax. January 24, 2018

Propositional Logic. Fall () Propositional Logic Fall / 30

CISC-102 Winter 2016 Lecture 17

Transcription:

Appendix one 1) A logical calculus for signification: Definitions: 1) The primitives are products of variables both logical and fuzzy; 2) The fuzzy variables can not outnumber the logical ones; 3) For a product of n sub-variables k of which are fuzzy variables and n-k logical variables the number of operations to make a term vanish through negation as a minimum of 1 and a maximum of n-k, when the negations are made for only one variable in its negation; 4) Logical values 1 1...1, for 0 0...0 and negation of a fuzzy variable means something else is true about the logical variable; 5) Each fuzzy variable is linked to a specific logical variable. Let us consider variables as {a, b, c, d,..,z}, and on this set let us define an operation of connotative product and connotative union. For the sake of completeness let us consider an universe in which the semantic value of a variable stays in the closest interval 0 x 1. Further more we define each variable a, b, c,., z as products of what we denote as fundamental not reducible variables. In general if we define on this set an operation of connotative product the result is not interpretable and may not make any sense. For instance if we have x abc, if any of those variables is not true in conventional denotative logic for a or b or c 0, the variable x will also have value zero. This is not the case in the calculus we are introducing. In case for x a b c and any one of these three variables has truth value 0, but semantic value α, the connotative value of x becomes x a x b x α 1 a b α. This definition that encompasses truth value and fuzzy value in which any fuzzy value is taken as a truth variable with value 0 α 1, this for any product of the variables we have that a b c b c a, that is the operation is commutative. On the other hand a b c (a b ) c a (b c), that is the operation is associative. Further more, the set includes values 0 and 1. Finally a 1/a = 1, that is, every element of the set as a reciprocal. Therefore our algebra structure includes a multiplicative group, with the particularity of each element having a double connotation: 0 or 1, truth value and 0 < α < 1 for connotative or semantic degree of possession of some predicate.

Lemma: if a multiplicative variable, one or more of its components have a logical truth value zero, the total value of the product does not become zero, but rather the product of the elements which have a logical value equal to 1. Demonstration. xyzv for z=0 e v=0 becomes xy.zv=xy because the value of zv make this two variables vanish from the product, but not implying that their fuzzy value vanishes. Therefor xyzv=xy.(zv)=xy in our logical approach. As a matter of fact this means only that values of x and y are independent in their fuzzy values from z and v. In this circumstances xyzv=xy(zv)=xy q.e.d. This fact makes a change in the fuzzy value of xyz that now is only xy and can only be processed together with couples (a,b) of other variables and the coupling of a,b and a,b,c,d is not allowed. We have handed this way the analysis of the problems raised by connotative logical product. 2) Connotative logical negation Let us consider x y z the corresponding truth table of Wittgenstein is x y z x y z 1 1 1 1 0 0 0 0 0 0 0 0 1 1 1 1 x y z v xy (zv) zv zv Annihilation operation This operation consists in the reduction f a variable without affecting the remaining terms of a product. For a product variable with n elements in the product this is obtained multiplying each a variable we wish to annihilate by its reciprocal. As multiplication by the reciprocal produces value 1, the values of the other components of the product is not affected once it is multiplied by 1 When there remains only one variable and the others variables of the product have already vanished there is nothing to be preserved and therefore the operation produces now value 0. 3) Sheffer stroke

The logical function defined in its normal disjunctive form by ss=x y, we will have x y, remarking that a a 1, in which means exclusive or defined by the truth table: 1 1 0 0 0 1 0 1 1 0 1 1 In addition modulo 2, 1 1=0, because the rest of the addition is zero and 1+0=1 because the rest of the division by 2 is 1. Furthermore note that x y (x 1) ( y 1) x y x 1 x. Note that x y x y is the expression for inclusive or and the addition of modulo 2 of 1 generates its complement function which is represented by x y. Proceeding to our aim of defining a connotative sheffer stroke we have: sheffer stroke abcd abcd defg (abcd) (defg) (abcd ) (defg) 1 Here we have again the problem of negation, having generated a 0 value and with it we cannot construct any further functions, contrarily in the denotative logics. 4) Connotative inclusive or f (xuy) xy x y x y xy x( y 1) y( x 1) xy xy x xy y xy x y (abcd)(efgh) abcd efgh. Note that in connotative logics the function becomes xy or x or y due to the annihilation operation. 5) Implication xy x y x y xy xy y ( x 1)( y 1) xy xy y xy x y 1 xy x 1 (abcd)(efgh) (efgh) 1

In connotative logics it becomes xy x y If we consider the normal disjunctive form of implication we have a first mean term xy which poses no problem and two further mean terms x y x y in which annihilation operation as made disappear the first term of the normal disjunctive form or the first and the second term, what renders the function indeterminate, except for the first mean term, rendering it an implication in the strict sense, only for xy 6)Equivalence x y xy x n xy xy xy x y 1 x y 1 (a b c z1 d z2 ) (e f g z3 h z4 ) 1 From a connotative view point the mean term x y disappears and only xy remains. 7)Exclusive Or By definition exclusive or function is x y x y and in connotative logics x y. 7) Pierce s Function x y x y x y x( y 1) y(x 1) (x 1)( y 1) xy x xy y xy x y 1 xy 1 Therefore: (a b c z1 d z2 )(e f g z3 h z4 ) 1 Circumstances of time and place and other determinants outside of psychological ones are considered as invariants not needing a specification of their change with the evolution of a situation. Another issue concerns fuzzy values which must be within the close interval 0 v 1. For the sake of simplicity in calculation we make this interval correspond to (0,100). As we do not have any scale we adopt a logic of differential thresholds. So in a situation in which the value is x the threshold is obtained adding x and we have:

x =k and integrating this expression from 0 to, we have: x v= 0 x+ x x δx=log x+ x+c and x+ x =k in which k is a constant along the different values of log x. x Note that an analogous treatment can be done creating a syntactic structure analog to grammar relationship in formal or common language. This can reduce the lenghts of the formal treatment by telescoping or on the contrary unfolding formal expressions. From a connotative view point x y x y becomes x y and the term x y disappears 8) DeMorgan s Theorem: (xy x y) x y Note that: xy+ x+ y+1 (x 1)( y 1) xy x y 1, q. e. d. If we consider the Morgan case from the viewpoint of our annihilation operation what is stated in the De Morgan theorem becomes x y x y Now by definition of annihilation x y 0. This way in the normal disjunctive form of Hilbert and Ackermann the only functions for which the De Morgan theorem holds true are those which do not include x y as a mean term. 8.1) Negation of a function Negation of a function is equivalent to its complement. If we have a function defined in terms of its normal disjunctive form its negation is formed by the disjunction of minterms not present in the initial function and only those. x y xy x y x y complement

f (x, y) x y These are 2 examples which confirm the truth of the theorem. Further confirmation is left as an exercise to the reader. Consider now that what is negated in a denotative function is the truth value. Nevertheless in a connotative function denial if it is complete annihilates any information except that the truth value becomes 0, in case it was 1, or 1 if it was 0. In a connotative denial every trace of a previous assertion leaves no trace of it. This generates a problem because if a 0 has been generated we have no information about what has to be generated to reconstitute the term that has been denied. So if A is connotative denied, 0 follows. But if 0 is connotatively denied, the result is indeterminate.