Math Study Notes

C * – algebra . It is a structure that arises in functional analysis; Before proposing it directly, another structure, previously called asterisk – algebra, will be presented beforehand. Summary [ hide ] 1 Asterisk – algebra 2 names 3 Properties 4 Definition 1 C * Properties – Algebras 2 Examples 5 Source 6 Notes and references Asterisk – algebra An algebra A is called * – algebra … Read more

Axiomatic of sets that we present is the one proposed by the Soviet mathematician, Gorbátov; it is the formal construction of set theory, using for that matter a system of adequate axioms and with the aim of using it in Computer Science topics. [1] . The name that is assumed is that of the author of the written work that … Read more

Separation axioms are properties that a topological space can satisfy depending on the degree to which different points or closed sets can be separated by means of the open sets of a certain topology. Summary [ hide ] 1 Increasing levels 2 Topology 3 Some axioms of separation 1 T 0or Kolmogórov spaces 2 T 1spaces or Fréchet space 3 T 2or Hausdorff spaces 4 T 3or regular spaces 5 Completely regular spaces and T 3.5or Tikhonov spaces … Read more

The Peano axioms or assumptions Peano are a set of axioms for natural numbers entered by Giuseppe Peano in the nineteenth century . Summary [ hide ] 1 Description 2 Peano’s five axioms 3 Natural number operations 4 Bibliography 5 Works consulted 6 External links Description The axioms have been used practically unchanged for a variety of meta-mathematical investigations, including questions about consistency and completeness in Number Theory . Peano’s axioms do not … Read more

Axiom . Statement that was considered in the past, “evident” and accepted without requiring prior proof. In a deductive system it is any proposition not deduced (from others), but rather constitutes a general rule of logical thought by dialectical contradiction to the theorems. [1] . The second step in forming an axiom system consists of making a list of all propositions … Read more

Non-deterministic finite automaton with empty transitions , AFND-TV , AFND-V or . It is the finite automaton that has at least one empty transition. AFND-TVs are definitions of AFND within regular languages that hinder their mechanical and computer implementation; but it is common to obtain them from transformations inside the LR ( regular expressions to AF, regular grammars to AF). Then they are vital for lexicographical analysis during the design of programming languages . Summary [ hide ] … Read more