Extending Homomorphism Theorem to Multi-Systems

Slides:



Advertisements
Similar presentations
Copyright © Cengage Learning. All rights reserved.
Advertisements

Basic Structures: Sets, Functions, Sequences, Sums, and Matrices
Basic Structures: Sets, Functions, Sequences, Sums, and Matrices
Recursion. n! (n factorial)  The number of ways n objects can be permuted (arranged).  For example, consider 3 things, A, B, and C.  3! = 6 1.ABC 2.ACB.
Logic and Set Theory.
So far we have learned about:
CSE-221 Digital Logic Design (DLD)
TR1413: Discrete Mathematics For Computer Science Lecture 4: System L.
Sets, Combinatorics, Probability, and Number Theory Mathematical Structures for Computer Science Chapter 3 Copyright © 2006 W.H. Freeman & Co.MSCS SlidesProbability.
‘Pure Mathematics is, in its way, the poetry of logical ideas’ Einstein ‘Maths is like love, a simple idea but it can get very complicated.’ Unknown ‘The.
10/1/20151 Math a Sample Space, Events, and Probabilities of Events.
1 Permutations and Combinations. 2 In this section, techniques will be introduced for counting the unordered selections of distinct objects and the ordered.
Chapter 8. Section 8. 1 Section Summary Introduction Modeling with Recurrence Relations Fibonacci Numbers The Tower of Hanoi Counting Problems Algorithms.
Theorems and conjectures
Mathematics What is it? What is it about?. Terminology: Definition Axiom – a proposition that is assumed without proof for the sake of studying the consequences.
My favorite subject is science. Unit 9 Section B Period 3 Unit12.
CompSci 102 Discrete Math for Computer Science March 1, 2012 Prof. Rodger Slides modified from Rosen.
LOGIC AND QUANTIFIERS. INTRODUCTION Many algorithms and proofs use logical expressions such as: “IF p THEN q” or “If p1 AND p2, THEN q1 OR q2” Therefore.
普 陀 山 普 济 禅 寺普 陀 山 普 济 禅 寺.
Chapter 29 Symmetry and Counting. Consider the task of coloring the vertices of a regular hexagon so that three are black and three are white. There are.
Permutations and Combinations. 2 In this section, techniques will be introduced for counting the unordered selections of distinct objects and the ordered.
Mathematical Induction
Alonzo Church: Mathematician. Philosopher. Computer Scientist? Who is Alonzo Church? Alonzo Church was a man who was very important to the computer science.
Chapter 5. Section 5.1 Climbing an Infinite Ladder Suppose we have an infinite ladder: 1.We can reach the first rung of the ladder. 2.If we can reach.
13.1 Sequences. Definition of a Sequence 2, 5, 8, 11, 14, …, 3n-1, … A sequence is a list. A sequence is a function whose domain is the set of natural.
On Property L On Property L School of Mathematics School of Mathematics Fudan University Fudan University Xiaoman Chen & Xianjin Wan.
5 Lecture in math Predicates Induction Combinatorics.
On Operator Norm Localization Property On Operator Norm Localization Property School of Mathematics School of Mathematics Fudan University Fudan University.
Chapter 1 Logic and Proof.
Chapter 4 Introduction to Set Theory
Geometry on Combinatorial Structures
The Pigeonhole Principle
Math a - Sample Space - Events - Definition of Probabilities
Computable Functions.
CSE15 Discrete Mathematics 03/22/17
Great Theoretical Ideas in Computer Science
Set, Combinatorics, Probability & Number Theory
Groups and Applications
The countable character of uncountable graphs François Laviolette Barbados 2003.
Chapter 3 The Real Numbers.
Labeled Graphs with Combinatorial Manifolds
Induction and recursion
Dana Moshkovitz The Institute For Advanced Study
Introduction to science
Explorations in Artificial Intelligence
Lecture 2 Propositional Logic
Inductive and Deductive Reasoning
Introduction to Logic PHIL 240 Sections
Chapter 10: Mathematical proofs
CS201: Data Structures and Discrete Mathematics I
Math 106 – Combinatorics – Quiz #4 Review Sheet
DEDUCTIVE vs. INDUCTIVE REASONING
Induction and recursion
Great Theoretical Ideas in Computer Science
Unit 1: Basic Probability
Welcome to the wonderful world of Probability
On Kripke’s Alleged Proof of Church-Turing Thesis
First Order Logic Rosen Lecture 3: Sept 11, 12.
Great Theoretical Ideas in Computer Science
Copyright © Cengage Learning. All rights reserved.
COMBINATORIAL WORLD Linfan Mao Nanjing Normal University
Black-Box Testing Techniques II
DISCRETE COMPUTATIONAL STRUCTURES
Sequences on Graphs with Symmetries
Mathematical Induction
Philosophy of Mathematics: a sneak peek
An example of the “axiomatic approach” from geometry
Copyright © Cengage Learning. All rights reserved.
1. What animal 2. Male or Female ? 4. Male or Female? Why? Why?
Sets, Combinatorics, Probability, and Number Theory
Presentation transcript:

Extending Homomorphism Theorem to Multi-Systems Linfan Mao (Chinese Academy of Mathematics and System Science, Beijing 100080) Xian, P.R.China March 21-23, 2008

1. What is the Essence of Smarandache’s Notion? • What can be acknowledged by mankind? TAO TEH KING(道德经) said: All things that we can acknowledge is determined by our eyes, or ears, or nose, or tongue, or body or passions, i.e., these six organs. • What is this sentence meaning? The non-visible world can be only known by the other five organs, particularly, the passion.

TAO TEH KING(道德经) said: 道生一, 一生二, 二生三, 三生万物。万物负阴而抱阳,冲气以为和。 The Tao gives birth to One. One gives birth to Two. Two gives birth to Three. Three gives birth to all things. All things have their backs to the female and stand facing the male. When male and female combine, all things achieve harmony. 人法地,地法天,天法道,道法自然。 Man follows the earth. Earth follows the universe. The universe follows the Tao. The Tao follows only itself.

• What are these words meaning? Here, the theoretically deduced is done by logic, particularly, Mathematical deduction.

An axiom is said smarandachely denied (S-denied) The combined positive and negative notion in TAO TEH KING comes into being the idea of S-denied in the following, i.e., a proposition with its non-proposition. Smarandachely denied axioms: An axiom is said smarandachely denied (S-denied) if in the same space the axiom behaves differently, i.e., validated and Invalided, or only invalidated but in at least two distinct ways. 

• How can we know the non-visible world? We can only know it by mathematical deduction. Then HOW TO? Smarandache multi-space: A Smarandache multi-space is a union of n different spaces equipped with some different structures for an integer n≧2. Applying it to mathematics, what we can obtain?

• Why is this conjecture important? Combinatorial Conjecture(Mao,2005): Every mathematical science can be reconstructed from or made by combinatorization. • Why is this conjecture important? It means that: (i) One can selects finite combinatorial rulers to reconstruct or make generalization for classical mathematics and (ii) One can combine different branches into a new theory and this process ended until it has been done for all mathematical sciences. Whence, it produces infinite creativity for math.. • How is it working? See the following sections.

2. A Review of Homomorphism Theorem on Groups

3. Definition of Multi-systems

4. Extending to Algebraic Systems

5. Extending to Multi-Systems