1  20
Next
 Logic Colloquium (10th : 1965 : University of Leicester)
 Amsterdam : NorthHolland, 1967.
 Description
 Book — 1 online resource (v, 331 pages)
3. Set theory [1968]
 Amsterdam : NorthHolland, 1968.
 Description
 Book — 1 online resource (xiv, 417 pages) : illustrations
 Summary

 Algebra of sets
 Axioms of set theory, relations, funcilons
 Natual numbers, finite and infinite sets
 Generalized union, intersection and cartesian product
 Theory of cardinal numbers
 Linearly ordered sets
 Wellordered sets
 Alephs and related topics
 Inaccessible cardinals : the continuum hypothesis
 Introduction to the theory of analytic and projective sets.
4. Constructible sets with applications [1969]
 Mostowski, Andrzej.
 Amsterdam, NorthHolland Pub. Co.; Warszawa, PWNPolish Scientific Publishers, 1969.
 Description
 Book — 1 online resource (ix, 269 pages)
5. Set theory and its logic [1969]
 Quine, W. V. (Willard Van Orman)
 Rev. ed.  Cambridge, Mass. : Belknap Press of Harvard University Press, 1969.
 Description
 Book — 1 online resource (xvii, 361 pages)
 Summary

 INTRODUCTION PART ONE. THE ELEMENTS I. LOGIC Quantification and identity Virtual classes Virtual relations II. REAL CLASSES Reality, extensionality, and the individual The virtual amid the real Identity and substitution III. CLASSES OF CLASSES Unit classes Unions, intersections, descriptions Relations as classes of pairs Functions IV. NATURAL NUMBERS Numbers unconstrued Numbers construed Induction V. ITERATION AND ARITHMETIC Sequences and iterates The ancestral Sum, product, power PART TWO. HIGHER FORMS OF NUMBER VI. REAL NUMBERS Program. Numerical pairs Ratios and reals construed Existential needs. Operations and extensions VII. ORDER AND ORDINALS Transfinite induction Order Ordinal numbers Laws of ordinals The order of the ordinals VIII. TRANSFINITE RECURSION Transfinite recursion Laws of transfinite recursion Enumeration IX. CARDINAL NUMBERS Comparative size of classes The SchrOderBernstein theorem Infinite cardinal numbers X. THE AXIOM OF CHOICE Selections and selectors Further equivalents of the axiom The place of the axiom PART THREE. AXIOM SYSTEMS XI. RUSSELL'S THEORY OF TYPES The constructive part Classes and the axiom of reducibility The modern theory of types XII. GENERAL VARIABLES AND ZERMELO The theory of types with general variables Cumulative types and Zermelo Axioms of infinity and others XIII. STRATIFICATION AND ULTIMATE CLASSES "New foundations" NonCantorian classes. Induction again Ultimate classes added XIV. VON NEUMANN'S SYSTEM AND OTHERS The von NeumannBernays system Departures and comparisons Strength of systems SYNOPSIS OF FIVE AXIOM SYSTEMS LIST OF NUMBERED FORMULAS BIBLIOGRAPHICAL REFERENCES INDEX.
 (source: Nielsen Book Data)
 Teoria mnogości. English
 Kuratowski, Kazimierz, 18961980.
 2nd completely rev. ed.  Amsterdam : NorthHolland Pub. Co. ; New York : Distributor, Elsevier/NorthHolland, 1976.
 Description
 Book — 1 online resource (xiv, 514 pages)
7. Descriptive set theory [1980]
 Moschovakis, Yiannis N.
 Amsterdam ; New York : NorthHolland, 1980.
 Description
 Book — 1 online resource (xii, 637 pages) : illustrations
 Summary

 The Basic Classical Notions. kappaSuslin and lambdaBorel. Basic Notions of the Effective Theory. Structure Theory for Pointclasses. The Constructible Universe. The Playful Universe. The Recursion Theorem. Metamathematics. References. Index.
 (source: Nielsen Book Data)
(source: Nielsen Book Data)
8. Coding the universe [1982]
 Beller, A.
 Cambridge [Cambridgeshire] ; New York : Cambridge University Press, ©1982.
 Description
 Book — 1 online resource (353 pages)
 Summary

 An introduction
 1. The building blocks
 2. The conditions
 3. Distributivity
 4. The denouement
 5. Applications
 6. The finestructural lemmas
 7. The Cohengeneric sets
 8. How to get rid of "0 #"
 9. Some further applications.
 (source: Nielsen Book Data)
(source: Nielsen Book Data)
9. The core model [1982]
 Dodd, A. (Anthony), 1952
 Cambridge [England] ; New York : Cambridge University Press, 1982.
 Description
 Book — 1 online resource (xxxviii, 229 pages)
 Summary

 1. Fine Structure
 2. Normal Measures
 3. Mice
 4. The Core Model
 5. The Covering Lemma
 6. Larger Core Models.
 (source: Nielsen Book Data)
(source: Nielsen Book Data)
10. Surveys in set theory [1983]
 Cambridge [Cambridgeshire] ; New York : Cambridge University Press, 1983.
 Description
 Book — 1 online resource (247 pages) : illustrations
 Summary

 1. Iterated Forcing James E. Baumgartner
 2. The Yorkshireman's guide to proper forcing Keith J. Devlin
 3. The singular cardinals problem
 independence results Sharon Shelah
 4. Trees, norms and scales David Guaspari
 5. On the regularity of ultrafilters Karel Prikry
 6. Morasses in combinatorial set theory Akihiro Kanamori
 7. A short course on gapone morasses with a review of the fine structure of L Lee Stanley.
 (source: Nielsen Book Data)
(source: Nielsen Book Data)
 Logic Colloquium (1983 : Aachen, Germany)
 Berlin ; New York : SpringerVerlag, 1984.
 Description
 Book — 1 online resource (2 volumes) : illustrations
 Summary

 pt. 1. Models and sets / edited by G.H. Müller and M.M. Richter
 pt. 2. Computation and proof theory / edited by E. Börger ... et al.
 Kechris, A. S., 1946
 Cambridge [Cambridgeshire] ; New York : Cambridge University Press, 1987.
 Description
 Book — 1 online resource (367 pages) : illustrations
 Summary

 Introduction
 About this book
 1. Trigonometric series and sets of uniqueness
 2. The algebra A of functions with absolutely convergent fourier series, pseudofunctions and pseudomeasures
 3. Symmetric perfect sets and the SalemZygmund theorem
 4. Classification of the complexity of U
 5. The PiatetskiShapiro hierarchy of Usets
 6. Decomposing Usets into simpler sets
 7. The shrinking method, the theorem of Koerner and Kaufman, and the solution to the Borel basis problem for U
 8. Extended uniqueness sets
 9. Characterizing Rajchman measures
 10. Sets of resolution and synthesis
 List of problems
 References
 Symbols and Abbreviations
 Index.
 (source: Nielsen Book Data)
(source: Nielsen Book Data)
13. An introduction to independence for analysts [1987]
 Dales, H. G. (Harold G.), 1944
 Cambridge ; New York : Cambridge University Press, 1987.
 Description
 Book — 1 online resource (xiii, 241 pages)
 Summary

 1. Homomorphisms from algebras of continuous functions
 2. Partial orders, Boolean algebras, and ultraproducts
 3. Woodin's condition
 4. Independence in set theory
 5. Martin's Axiom
 6. Gaps in ordered sets
 7. Forcing
 8. Iterated Forcing.
 (source: Nielsen Book Data)
(source: Nielsen Book Data)
 Mayberry, John P.
 Cambridge ; New York : Cambridge University Press, 2000.
 Description
 Book — 1 online resource (xx, 424 pages)
 Summary

 Preliminaries
 Idea of foundations for mathematics
 Simple arithmetic
 Basic set theory
 Semantics, ontology, and logic
 Principal axioms and definitions of set theory
 Cantorian set theory
 Cantorian finitism
 Axiomatic method
 Axiomatic set theory
 Euclidean set theory
 Euclidean finitism
 Euclidean theory of cardinality
 Euclidean theory of simply infinite systems
 Euclidean set theory from the cantorian standpoint
 Envoi.
(source: Nielsen Book Data)
 GrattanGuinness, I.
 Princeton, N.J. : Princeton University Press, ©2000.
 Description
 Book — 1 online resource (xiv, 690 pages) : illustrations
 Summary

 Explanations
 Preludes : algebraic logic and mathematical analysis up to 1870
 Cantor : mathematics as Mengenlehre
 Parallel processes in set theory, logics and axiomatics, 1870s1900s
 Peano : the formulary of mathematics
 Russell's way in : from certainty to paradoxes, 18951903
 Russell and Whitehead seek the Principia Mathematica, 19031913
 The influence and place of logicism, 19101930
 Postludes : mathematical logic and logicism in the 1930s
 The fate of the search
 Transcription of manuscripts.
(source: Nielsen Book Data)
 Kisačanin, Branislav, 1968 author.
 New York : Kluwer Academic Pub., ©2002.
 Description
 Book — 1 online resource
 Summary

 Set Theory. Combinatorics. Number Theory. Geometry. Appendices. Bibliography. Index.
 (source: Nielsen Book Data)
(source: Nielsen Book Data)
An introduction to the highly sophisticated world of discrete mathematics, Mathematical Problems and Proofs presents topics ranging from elementary definitions and theorems to advanced topics.
(source: Nielsen Book Data)
17. Understanding the many [2002]
 Yi, Byeonguk, 1959 author.
 New York : Routledge, 2002.
 Description
 Book — 1 online resource (141 pages) : illustrations
 Summary

 Introduction
 1. Plural Quantifications
 1. Singular Versus Plural Quantifications
 2. Implication 2.a The Implication Argument 2.b On the Three Theses on Implications 2.c Implication Versus Metaphysical Necessity
 3. Paraphrase
 2. The Logic of Plurals
 1. Language 1.a Elementary Notation *1.b. The Term Connective "and" 1.c. Predicates 1.c.i. Singular, Plural, and Neutral Predicates 1.c.ii. Neutral Expansions and Singular Reducts 1.c.iii. Logical Predicates 1.d. Quantifiers and Variables 1.d.i. Singular and Plural Quantifiers 1.d.ii. Paraphrasing Plural Quantifiers 1.d.iii. Singularizable Plural Quantifications 1.e. The Canonical Notation for the Logic of Plurals 1.e.i. Terms 1.e.ii. Predicates and Simple Sentences 1.e.iii. Quantifiers and Complex Sentences
 2. Logic 2.a. The Logic of Plurals: Partial Axiomatization 2.a.i. System A 2.a.ii. System B 2.a.iii. System C 2.a.iv. System D *2.b. The Logic of Plurals: Model Theory Appendix: Partial Axiomatization of the Logic of Plurals
 3. Is Two a Property?
 1. Why Property Two? 1.a. What Is It to Be a Property? 1.b. Irregularities of Numerical Facts 1.c. Why Not the Set Analysis?
 2. A Theory of Plural Properties 2.a. The Predicative Part 2.b. The Subject Part 2.c. Instantiation 2.d. Various Kinds of Plural Properties
 3. Two As an Intrinsic Plural Property
 4. Concluding Remarks
 4. What Numbers Should Be
 1. Are Numbers Objects?
 2. Plural Properties As Components of Numerical Facts
 3. Analysis of Numerical Facts
 4. Numbers Are Properties
 5. How Sets Are Determined by Their Members
 1. The Hierarchy of Sets and the Determination of Sets by Their Members
 2. Reference to Setlike Objects
 3. Plural Reference to Mundane Objects
 4. Exclusive Reference to Mundane Objects
 5. Concluding Remarks References Index.
 (source: Nielsen Book Data)
(source: Nielsen Book Data)
 Tourlakis, George J.
 Cambridge : Cambridge University Press, ©2003.
 Description
 Book — 1 online resource (1 volume)
 Summary

 Preface
 1. Basic logic
 2. The second incompleteness theorem
 Bibliography
 List of symbols
 Index.
 (source: Nielsen Book Data)
(source: Nielsen Book Data)
 Tourlakis, George J.
 Cambridge : Cambridge University Press, ©2003.
 Description
 Book — 1 online resource (1 volume)
 Summary

 Preface
 1. Basic logic
 2. The second incompleteness theorem
 Bibliography
 List of symbols
 Index.
 (source: Nielsen Book Data)
(source: Nielsen Book Data)
20. The Covering property Axiom, CPA : a combinatorial core of the iterated perfect set model [2004]
 Ciesielski, Krzysztof, 1957
 Cambridge, UK ; New York : Cambridge University Press, 2004.
 Description
 Book — 1 online resource (xxi, 174 pages) Digital: data file.
 Summary

 1. Axiom CPAcube and its consequences: properties (A)(E)
 2. Games and axiom CPAgame/cube
 3. Prisms and axioms CPAgame/prism and CPAprism
 4. CPAprism and coverings with smooth functions
 5. Applications of CPAgame/prism
 6. CPA and properties (F*) and (G)
 7. CPA in the Sacks model.
 (source: Nielsen Book Data)
(source: Nielsen Book Data)
Articles+
Journal articles, ebooks, & other eresources
Guides
Course and topicbased guides to collections, tools, and services.