Foundations of Constructive Mathematics : Metamathematical Studies / Michael J. Beeson
| Foundations of Constructive Mathematics : Metamathematical Studies / Michael J. Beeson |
| Autore | Beeson, Michael J. |
| Pubbl/distr/stampa | Berlin, : Springer, 1985 |
| Descrizione fisica | xxiii, 466 p. ; 24 cm |
| Soggetto non controllato |
Computability theory
Computer Computer Science Developments Forcing Mathematics Model theory Organization Philosophy Proof by contradiction Proofs Proving Set Theory eXist |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNICAMPANIA-VAN0263519 |
Beeson, Michael J.
|
||
| Berlin, : Springer, 1985 | ||
| Lo trovi qui: Univ. Vanvitelli | ||
| ||
Foundations of Constructive Mathematics : Metamathematical Studies / Michael J. Beeson
| Foundations of Constructive Mathematics : Metamathematical Studies / Michael J. Beeson |
| Autore | Beeson, Michael J. |
| Pubbl/distr/stampa | Berlin, : Springer, 1985 |
| Descrizione fisica | xxiii, 466 p. ; 24 cm |
| Soggetto topico |
03-XX - Mathematical logic and foundations [MSC 2020]
03F50 - Metamathematics of constructive systems [MSC 2020] 03F55 - Intuitionistic mathematics [MSC 2020] 03F60 - Constructive and recursive analysis [MSC 2020] 03F65 - Other constructive mathematics [MSC 2020] |
| Soggetto non controllato |
Computability Theory
Computer Computer Science Development Forcing Mathematics Model theory Organization Philosophy Proof by contradiction Proofs Proving Set Theory eXist |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | This book is about some recent work in a subject usually considered part of "logic" and the" foundations of mathematics", but also having close connec tions with philosophy and computer science. Namely, the creation and study of "formal systems for constructive mathematics". The general organization of the book is described in the" User's Manual" which follows this introduction, and the contents of the book are described in more detail in the introductions to Part One, Part Two, Part Three, and Part Four. This introduction has a different purpose; it is intended to provide the reader with a general view of the subject. This requires, to begin with, an elucidation of both the concepts mentioned in the phrase, "formal systems for constructive mathematics". "Con structive mathematics" refers to mathematics in which, when you prove that l a thing exists (having certain desired properties) you show how to find it. Proof by contradiction is the most common way of proving something exists without showing how to find it - one assumes that nothing exists with the desired properties, and derives a contradiction. It was only in the last two decades of the nineteenth century that mathematicians began to exploit this method of proof in ways that nobody had previously done; that was partly made possible by the creation and development of set theory by Georg Cantor and Richard Dedekind. |
| Record Nr. | UNICAMPANIA-VAN00263519 |
Beeson, Michael J.
|
||
| Berlin, : Springer, 1985 | ||
| Lo trovi qui: Univ. Vanvitelli | ||
| ||
Lectures on the theory of games [[electronic resource] /] / Harold W. Kuhn
| Lectures on the theory of games [[electronic resource] /] / Harold W. Kuhn |
| Autore | Kuhn Harold W (Harold William), <1925-> |
| Edizione | [Course Book] |
| Pubbl/distr/stampa | Princeton, N.J., : Princeton University Press, 2003 |
| Descrizione fisica | 1 online resource (118 p.) |
| Disciplina | 519.3 |
| Collana | Annals of mathematics studies |
| Soggetto topico | Game theory |
| Soggetto non controllato |
Abstract algebra
Addition Algorithm Almost surely Analytic geometry Axiom Basic solution (linear programming) Big O notation Bijection Binary relation Boundary (topology) Bounded set (topological vector space) Branch point Calculation Cardinality of the continuum Cardinality Cartesian coordinate system Characteristic function (probability theory) Combination Computation Connectivity (graph theory) Constructive proof Convex combination Convex function Convex hull Convex set Coordinate system David Gale Diagram (category theory) Differential equation Dimension (vector space) Dimensional analysis Disjoint sets Distribution function Embedding Empty set Enumeration Equation Equilibrium point Equivalence relation Estimation Euclidean space Existential quantification Expected loss Extreme point Formal scheme Fundamental theorem Galois theory Geometry Hyperplane Inequality (mathematics) Infimum and supremum Integer Iterative method Line segment Linear equation Linear inequality Matching Pennies Mathematical induction Mathematical optimization Mathematical theory Mathematician Mathematics Matrix (mathematics) Measure (mathematics) Min-max theorem Minimum distance Mutual exclusivity Prediction Probability distribution Probability interpretations Probability measure Probability theory Probability Proof by contradiction Quantity Rank (linear algebra) Rational number Real number Requirement Scientific notation Sign (mathematics) Solution set Special case Statistics Strategist Strategy (game theory) Subset Theorem Theory of Games and Economic Behavior Theory Three-dimensional space (mathematics) Total order Two-dimensional space Union (set theory) Unit interval Unit square Vector Analysis Vector calculus Vector space |
| ISBN |
1-282-15911-9
9786612159114 1-4008-2956-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Frontmatter -- Contents -- Author's Note -- Preface -- Chapter 1. What Is the Theory of Games? -- Chapter 2. Matrix Games -- Chapter 3. Extensive Games -- Chapter 4. Infinite Games -- Index |
| Record Nr. | UNINA-9910778215503321 |
Kuhn Harold W (Harold William), <1925->
|
||
| Princeton, N.J., : Princeton University Press, 2003 | ||
| Lo trovi qui: Univ. Federico II | ||
| ||