scholarly journals ABOUT THE MINKOWSKI DIFFERENCE OF SQUARES ON A PLANE

2021 ◽  
Vol 5 (3) ◽  
pp. 13-29
Author(s):  
Jalolkhon Nuritdinov ◽  

Introduction. As you know, the concept of a set is a basic concept in mathematics, and many mathematical problems have been solved using the theory developed around it. Building a set theory apparatus begins with defining the operations that can be performed on sets. Most of us know about operations on sets, such as joining, intersecting, subtracting, symmetric subtraction, and we also have an understanding of the practical problems they can solve. With the development of mathematics, including the science of geometry, the idea of adding other operations to the sets in addition to the above operations arose, and there was a need to enrich the content of set theory and apply them to new practical problems.

2020 ◽  
Vol 41 (2) ◽  
Author(s):  
René Guitart

The article affixes a resolutely structuralist view to Alain Badiou’s proposals on the infinite, around the theory of sets. Structuralism is not what is often criticized, to administer mathematical theories, imitating rather more or less philosophical problems. It is rather an attitude in mathematical thinking proper, consisting in solving mathematical problems by structuring data, despite the questions as to foundation. It is the mathematical theory of categories that supports this attitude, thus focusing on the functioning of mathematical work. From this perspective, the thought of infinity will be grasped as that of mathematical work itself, which consists in the deployment of dualities, where it begins the question of the discrete and the continuous, Zeno’s paradoxes. It is, in our opinion, in the interval of each duality ― “between two ends”, as our title states ― that infinity is at work. This is confronted with the idea that mathematics produces theories of infinity, infinitesimal calculus or set theory, which is also true. But these theories only give us a grasp of the question of infinity if we put ourselves into them, if we practice them; then it is indeed mathematical activity itself that represents infinity, which presents it to thought. We show that tools such as algebraic universes, sketches, and diagrams, allow, on the one hand, to dispense with the “calculations” together with cardinals and ordinals, and on the other hand, to describe at leisure the structures and their manipulations thereof, the indefinite work of pasting or glueing data, work that constitutes an object the actual infinity of which the theory of structures is a calculation. Through these technical details it is therefore proposed that Badiou envisages ontology by returning to the phenomenology of his “logic of worlds”, by shifting the question of Being towards the worlds where truths are produced, and hence where the subsequent question of infinity arises.


1958 ◽  
Vol 23 (3) ◽  
pp. 241-249 ◽  
Author(s):  
P. Lorenzen

A “foundational crisis” occurred already in Greek mathematics, brought about by the Pythagorean discovery of incommensurable quantities. It was Eudoxos who provided new foundations, and since then Greek mathematics has been unshakeable. If one reads modern mathematical textbooks, one is normally told that something very similar occurred in modern mathematics. The calculus invented in the seventeenth century had to go through a crisis caused by the use of divergent series. One is told that by the achievements of the nineteenth century from Cauchy to Cantor this crisis has definitely been overcome. It is well known, but it is nevertheless very often not taken seriously into account, that this is an illusion. The so-called ε-δ-definitions of the limit concepts are an admirable achievement, but they are only one step towards the goal of a final foundation of analysis. The nineteenth century solution of the problem of foundations consists of recognizing, in addition to the concept of natural number as the basis of arithmetic, another basic concept for analysis, namely the concept of set. By the inventors of set theory it was strongly held that these sets are self-evident to our intuition; but very soon the belief in their self-evidence was destroyed by the set-theoretic paradoxes. After that, about 1908, the period of axiomatic set theory began. In analogy to geometry there was put forward an uninterpreted system of axioms, a formal system. This, of course, is quite possible. A formal system contains strings of marks; and a special class of these strings, the class of the so-called “theorems”, is inductively defined.


1986 ◽  
Vol 51 (4) ◽  
pp. 883-889 ◽  
Author(s):  
Bjarni Jónsson

A distinctive feature of modern mathematics is the interaction between its various branches and the blurring of the boundaries between different areas. This is strikingly illustrated in the work of Alfred Tarski. He was a logician first and an algebraist second. His contributions to algebra can be divided into three (ill-defined and overlapping) categories, general algebra, the study of various algebraic structures arising from problems outside algebra, mostly in logic and set theory, and the use of concepts and techniques from logic in the study of algebraic structures. Even more roughly, these three categories could be labeled as pure algebra, applications of algebra to logic, and applications of logic to algebra.Before Tarski came to the United States in 1939, he had written a series of papers on both the axiomatic and the structural aspects of Boolean algebras, and his inclination to algebraize mathematical problems is well illustrated by his paper [38g], Algebraische Fassung des Massproblems. Many of his later investigations of various types of algebraic structures are inspired by work done in this earlier period. However, beginning around 1940 there is a much greater emphasis on the study of algebra in its various aspects.The paper [41], On the calculus of relations, is a landmark event in this respect. The object here was to find an axiomatic basis for the arithmetic of binary relations. The axioms that he chose are simple and natural (see Monk [1986]).


Author(s):  
Mr. Lam Kai Shun

The continuum hypothesis has been unsolved for hundreds of years. In other words, can I answer it completely? By refuting the culturally responsible continuum [1], one can link the problem to the mathematical continuum, and it is possible to disproof the continuum hypothesis [2] . To go ahead a step, one may extend our mathematical system (by employing a more powerful set theory) and solve the continuum problem by three conditional cases. This event is sim-ilar to the status cases in the discriminant of solving a quadratic equation. Hence, my proposed al-gorithmic flowchart can best settle and depict the problem. From the above, one can further con-clude that when people extend mathematics (like set theory — ZFC) into new systems (such as Force Axioms), experts can solve important mathematical problems (CH). Indeed, there are differ-ent types of such mathematical systems, similar to ancient mathematical notation. Hence, different cultures have different ways of representation, which is similar to a Chinese saying: “different vil-lages have different laws.” However, the primary purpose of mathematical notation was initially to remember and communicate. This event indicates that the basic purpose of developing any new mathematical system is to help solve a natural phenomenon in our universe.


1978 ◽  
Vol 43 (2) ◽  
pp. 335-351 ◽  
Author(s):  
James P. Jones

In his celebrated paper of 1931 [7], Kurt Gödel proved the existence of sentences undecidable in the axiomatized theory of numbers. Gödel's proof is constructive and such a sentence may actually be written out. Of course, if we follow Gödel's original procedure the formula will be of enormous length.Forty-five years have passed since the appearance of Gödel's pioneering work. During this time enormous progress has been made in mathematical logic and recursive function theory. Many different mathematical problems have been proved recursively unsolvable. Theoretically each such result is capable of producing an explicit undecidable number theoretic predicate. We have only to carry out a suitable arithmetization. Until recently, however, techniques were not available for carrying out these arithmetizations with sufficient efficiency.In this article we construct an explicit undecidable arithmetical formula, F(x, n), in prenex normal form. The formula is explicit in the sense that it is written out in its entirety with no abbreviations. The formula is undecidable in the recursive sense that there exists no algorithm to decide, for given values of n, whether or not F(n, n) is true or false. Moreover F(n, n) is undecidable in the formal (axiomatic) sense of Gödel [7]. Given any of the usual axiomatic theories to which Gödel's Incompleteness Theorem applies, there exists a value of n such that F(n, n) is unprovable and irrefutable. Thus Gödel's Incompleteness Theorem can be “focused” into the formula F(n, n). Thus some substitution instance of F(n, n) is undecidable in Peano arithmetic, ZF set theory, etc.


2020 ◽  
Vol 26 (10) ◽  
pp. 1331-1342
Author(s):  
Xia He ◽  
Guoping Du ◽  
Long Hong

Based on basic concept of symbolic logic and set theory, this paper focuses on judgments and attempts to provide a new method for the study of logic. It establishes the formal language of the extension of judgment J*, and formally describes a, e, i, o judgment, and thus gives set theory representation and graphical representation that can distinguish between universal judgments and particular judgments. According to the content of non-modal deductive reasoning in formal logic, it gives weakening theorem, strengthening theorem and a number of typical graphical representation theorem (graphic theorem), where graphic deduction is carried out. Graphic deduction will be beneficial to the research of artificial intelligence, which is closely related to judgment and deduction in logic.


2013 ◽  
Vol 347-350 ◽  
pp. 3177-3181 ◽  
Author(s):  
Gui Juan Song ◽  
Gang Li

Attribute reduction is a key problem for rough set theory. While computing reduction according to the definitions is a typical NP problem. In this paper, basic concept of rough set theory is presented, one heuristic algorithm for attribution reduction based on conditional entropy is proposed. The actual application shows that the method is feasible and effective


1977 ◽  
Vol 8 (1) ◽  
pp. 23-32
Author(s):  
Gerald E. Chappell

Test-teach questioning is a strategy that can be used to help children develop basic concepts. It fosters the use of multisensory exploration and discovery in learning which leads to the development of cognitive-linguistic skills. This article outlines some of the theoretical bases for this approach and indicates possibilities for their applications in child-clinician transactions.


Sign in / Sign up

Export Citation Format

Share Document