Leung K.-T., Chen D.L.-C. Elementary Set Theory

формат pdf
размер 5 МБ
добавлен 01 января 2011 г.

Hong Kong University Press, 1991. - 148 pages.

Elementary Set Theory is an extension of the lecture notes for the course 'Fundamental Concepts of Mathematics' given each year to first-year undergraduate students of mathematics in the University of Hong Kong since 1959. The purpose of this course, arranged in about twenty-five lectures, is to provide students of mathematics with the minimum amount of knowledge in logic and set theory needed for a profitable continuation of their studies. The addition of statement calculus and set theory to the Hong Kong University Matriculation Examination Syllabus in 1964 resulted in part of the course being taught in schools. This book, therefore, is intended for schools as well as for universities.

Похожие разделы

Смотрите также

Bollob?s B. Combinatorics. Set Systems, Hypergraphs, Families of Vectors and Probabilistic Combinatorics

формат djvu
размер 1.39 МБ
добавлен 06 октября 2011 г.

Издательство Cambridge University Press, 1986, -187 pp. This book is an expanded account of a first-year graduate course in combinatorics, given at Louisiana State University, Baton Rouge during the fall semester of 1985. The traditional ingredients of an initial combinatorics course seem to be combinatorial identities and generating functions, with some introductory design theory or graph theory. Usually, set systems, hyper- graphs and sets o...

Chen W., Graph Theory and Its Engineering Applications

формат djvu
размер 10.46 МБ
добавлен 16 октября 2010 г.

Название: Chen W. , Graph Theory and Its Engineering Applications Издательство: World Scientific Publishing Company Год: 1997 ISBN: 9810218591 Graphs are extremely useful in modelling systems in physical sciences and engineering problems, because of their intuitive diagrammatic nature. This text gives a reasonably deep account of material closely related to engineering applications. Topics like directed-graph solutions of linear equations, topol...

Deo N. Graph Theory with Applications to Engineering and Computer Science

формат djvu
размер 4.38 МБ
добавлен 12 декабря 2010 г.

Prentice Hall, 1974. - 480 pages. The last two decades have witnessed an upsurge of interest and activity in graph theory, particularly among applied mathematicians and engineers. Clear evidence of this is to be found in an unprecedented growth in the number of papers and books being published in the field. In 1957 there was exactly one book on the subject (namely, Konig's Theorie der Endlichen und Unendlichen Graphen). Now, sixteen years later,...

Desel J., Esparza J. Free Choice Petri Nets

формат djvu
размер 1.71 МБ
добавлен 31 января 2012 г.

Издательство Cambridge University Press, 1995, -254 pp. Free-choice Petri nets have been around for more than twenty years, and are a successful branch of net theory. Nearly all the introductory texts on Petri nets devote some pages to them. This book is intended for those who wish to go further. It brings together the classical theorems of free-choice theory obtained by Commoner and Hack in the seventies, and a selection of new results, like th...

Erd?s P. Old and New Problems and Results in Combinatorial Number Theory

формат djvu
размер 1.79 МБ
добавлен 04 октября 2011 г.

L'Enseignement Mathematique. University de Geneve, 1980, -128 pp. In the present work we will discuss various problems in elementary number theory, most of which have a combinatorial flavor. In general, we will avoid classical problems, just mentioning references for the interested reader. We will almost never give proofs but on the other hand we will try to give as exact references as we can. We will restrict ourselves mostly to problems on whi...

Kisacanin B. Mathematical Problems and Proofs: Combinatorics, Number Theory, and Geometry

формат djvu
размер 1.31 МБ
добавлен 31 января 2012 г.

Kluwer Academic Publishers, 2002. - 220 pages. Key to Symbols. Set Theory. Sets and Elementary Set Operations. Cartesian Product and Relations. Functions and Operations. Cardinality. Problems. Combinatorics. Four Enumeration Principles. Introductory Problems. Basic Definitions. Generating Functions. Problems. Number Theory. Divisibility of Numbers. Important Functions in Number Theory. Congruences. Diophantine Equations. Problems. Geometry. Prope...

Lovasz L. An Algorithmic Theory of Numbers, Graphs, and Convexity

формат djvu
размер 824.05 КБ
добавлен 28 октября 2011 г.

Society for Industrial and Applied Mathematics, 1986, -96 pp. There is little doubt that the present explosion of interest in the algorithmic aspects of mathematics is due to the development of computers — even though special algorithms and their study can be traced back all the way through the history of mathematics. Mathematics started out in Egypt and Babylon as a clearly algorithmic science. In ancient Greece the foundations of its "descript...

McNaughton R. Elementary Computability, Formal Languages, and Automata

формат djvu
размер 3.4 МБ
добавлен 24 августа 2011 г.

Prentice Hall, 1982. - 417 Pages. This book is an introduction to theoretical computer science emphasizing two interrelated areas: the theory of computability (how to tell whether problems are algorithmically solvable) and the theory of formal languages (how to design and use special languages, as for algorithms). Automata (idealized computer devices) are used as precise models of computation in studies that have actual computers as their primar...

Oggier F., Viterbo E. Algebraic Number Theory and Code Design for Rayleigh Fading Channels

формат pdf
размер 1.06 МБ
добавлен 28 октября 2011 г.

Из серии Foundations and Trends in Communications and Information Theory издательства NOWPress, 2004, -97 pp. Elementary number theory was the basis of the development of error correcting codes in the early years of coding theory. Finite fields were the key tool in the design of powerful binary codes and gradually entered in the general mathematical background of communications engineers. Thanks to the technological developments and increased pr...

Troelstra A.S., Schwichtenberg H. Basic Proof Theory

формат djvu
размер 4.79 МБ
добавлен 31 января 2012 г.

Издательство Cambridge University Press, 1996, -353 pp. The discovery of the set-theoretic paradoxes around the turn of the century, and the resulting uncertainties and doubts concerning the use of high-level abstractions among mathematicians, led D. HUbert to the formulation of his programme: to prove the consistency of axiomatizations of the essential parts of mathematics by methods which might be considered as evident and reliable because of...