1  50
Next
2. 50 years of firstpassage percolation [2017]
 Auffinger, Antonio, 1983 author.
 Providence, Rhode Island : American Mathematical Society, [2017]
 Description
 Book — v, 161 pages : illustrations (some color) ; 26 cm.
 Summary

 IntroductionThe time constant and the limit shapeFluctuations and concentration boundsGeodesicsBusemann functionsGrowth and competition modelsVariants of FPP and related modelsSummary of open questionsBibliography.
 (source: Nielsen Book Data)
(source: Nielsen Book Data)
Science Library (Li and Ma)
Science Library (Li and Ma)  Status 

Stacks  
QA274.73 .A94 2017  Unknown 
 Makkai, Mihály, 1939
 Providence, R.I. : American Mathematical Society, c1989.
 Description
 Book — 176 p. ; 25 cm.
SAL3 (offcampus storage)
SAL3 (offcampus storage)  Status 

Stacks  Request (opens in new tab) 
QA9.7 .M35 1989  Available 
4. Algebraic computability and enumeration models : recursion theory and descriptive complexity [2016]
 Nourani, Cyrus F. author.
 Oakville, ON, Canada : Apple Academic Press, [2016]
 Description
 Book — xiv, 295 pages ; 24 cm
 Summary

 Preface Introduction Computing Categories, Language Fragments, and Models Introduction Limits and Infinitary Languages Generic Functors and Language String Models Positive Generic Models Fragment Consistent Algebras Generic Products Positive Morphisms and Models Positive Consistency and Omitting Types Positive Fragment Consistency Models Horn Models Positive Categories and Horn Fragments Fragment Consistent Kleene Models More on Kleene Structures Process Algebras Functorial Admissible Models Infinitary Languages Basics Admissible Languages Admissible Models Infinite Language Categories A Descriptive Computing Computing Model Diagrams Situations and Compatibility Boolean Computing Diagrams Description Logic Functorial Model Theory and HIFI Computing Generic Functor Initial Models Initial Tree Algebras and Amplification Tree Amplifiers and The Sonic Booms The Recursion Theorem Tree Amplifiers and Recursion Admissible Gain Synthesizer Initial Tree Computing and Languages Initial Models and Their Algebraic Formulation The Basics Canonical Models Generic diagrams of Initial Models Initial Algebras and Computable Trees Tree Rewriting, Algebras, and Infinitary Models Are There Models for Nothing Free Proof Trees and Computing Models Generating Models by Positive Forcing Algebraically Closed Groups Word Problems and the SRS Roller Coaster The Roller Coaster Private Languages and Wittgenstein's Paradox Concluding Comments Descriptive Sets and Infinitary Languages Introduction Admissible Sets and Structures Basic Descriptive Characterizations Boolean Valued Models Admissible Sets and Ordinals Error! Bookmark not defined. Set Reducibility Admissible Tree Recursion Admissible Set Reducibility Complexity and Computing Introduction Forcing, Complexity, and Diaphontine Definability Technical Preliminaries Initial Models Generic Diagrams for Initial Models Models and Fragment Inductive Closure Positive Forcing and Infinitary Models Generating Models by Positive Forcing Forcing and Computability Complexity Classes, Models, and Urlements Functorial Implicit Complexity Error! Bookmark not defined. Abstract Descriptive Complexity A Descriptive Computing Example Revisit Rudiments, KPU, and Recursion Admissible Hulls Concrete Descriptive Complexity Concrete Implicit Complexity Overview to Arithmetic Hierarchy Arithmetic Hierarchy and Enumeration Degrees Introduction Turing Degrees and Isomorphism Types Arithmetic Hierarchy and Infinitary Languages Computability and Hierarchy with Infinitary Languages Computability on Infinitary Languages Enumeration Degrees Enumeration Definability and Turing Jumps Automorphisms and Lifts on KPairs Enumeration Computability Models Rudiments, KPU, and Recursion Computable Categorical Trees Enumerations Model Theory Peano Arithmetic Models and Computability Introduction Recursion on Arithmetic Fragments Godel's Incompleteness and Ordinal Arithmetic Descriptive Sets and Automata Finite Models Fields and Fragments of Peano Arithmetic Arithmetic Hierarchy and Borel Sets Infinitary Theories and c=Countable N Models KPU Ordinal Models Generic Computability and Filters Realizability and Computability Introduction Categorical Models and Realizability Categorical Intuitionistic Models Infinitary Language Product Models Positive Generic Models Omitting Types Realizability Positive Realizability Morphisms and Models Fragment Product Algebra Realizability Positive Realizability on Horn Filters Computability and Positive Realizability Morphic Realization Functors Positive Categories and Consistency Models Horn Computability and Realizability Intuitionistic Types and Realizability Realizability on Ultrafilters Computing Morphisms on Topos Relative Realizability on Topos Realizability Triposes More on Topos Realizability On PreSheaves Topos Realizability Index.
 (source: Nielsen Book Data)
(source: Nielsen Book Data)
Science Library (Li and Ma)
Science Library (Li and Ma)  Status 

Stacks  
QA169 .N6935 2016  Unknown 
5. Algebraic model theory [1997]
 Dordrecht ; Boston : Kluwer Academic Publishers, 1997.
 Description
 Book — xvii, 277 p. : ill. ; 25 cm.
 Summary

 An Introduction to Independence and Local Modularity
 E. Bouscaren. Groups Definable in ACFA
 Z. Chatzidakis. Large Finite Structures with Few Types
 G. Cherlin. A Survey of the Uncountable Spectra of Countable Theories
 B. Hart, M.C. Laskowski. An Introduction to Tame Congruence Theory
 E.W. Kiss. Stable Finitely Homogeneous Structures: A Survey
 A.H. Lachlan. Homogeneous and Smoothly Approximated Structures
 D. Macpherson. Khovanskii's Theorem
 D. Marker. ACFA and the ManinMumford Conjecture
 A. Pillay. Decidable Equational Classes
 M.A. Valeriote. Schanuel's Conjecture and the Decidability of the Real Exponential Field
 A.J. Wilkie. Three Lectures on the RS Problem
 R. Willard. Decidable Modules
 M. Ziegler.
 (source: Nielsen Book Data)
(source: Nielsen Book Data)
 Online
Science Library (Li and Ma)
Science Library (Li and Ma)  Status 

Stacks  
QA9.7 .A43 1997  Unknown 
6. Algebraic Qgroups as abstract groups [2018]
 Frécon, Olivier, 1974 author.
 Providence, RI : American Mathematical Society, 2018.
 Description
 Book — v, 99 pages ; 24 cm.
 Summary

 Background material
 Expanded pure groups
 Unipotent groups over Q and definable linearity
 Definably affine groups
 Tori in expanded pure groups
 The definably linear quotients of an ACFgroup
 The group DG and the main theorem for K = Q
 The main theorem for K = Q
 Biinterpretability and standard isomorphisms.
 Online
Science Library (Li and Ma)
Science Library (Li and Ma)  Status 

Serials  
Shelved by Series title NO.1219  Unknown 
 Malʹt͡sev, A. I. (Anatoliĭ Ivanovich), 19091967.
 Berlin, New York, SpringerVerlag, 1973.
 Description
 Book — xii, 317 p. illus. 24 cm.
 Online
SAL3 (offcampus storage)
SAL3 (offcampus storage)  Status 

Stacks  Request (opens in new tab) 
QA162 .M3413  Available 
8. Algebras, lattices, varieties [2018  2022]
 McKenzie, Ralph, author.
 Providence, Rhode Island : American Mathematical Society : AMS Chelsea Publishing, 20182022
 Description
 Book — 3 volumes : illustrations ; 26 cm
 Summary

 Basic concepts Lattices Unary and binary operations Fundamental algebraic results Unique factorization Bibliography Additional bibliography List of errata Table of notation Index of names Index of terms.
 (source: Nielsen Book Data)
 Finite algebras and their clones Abstract clone theory Commutator theory Bibliography Index.
 (source: Nielsen Book Data)
 The classification of varieties Equational logic Rudiments of model theory Bibliography Index.
 (source: Nielsen Book Data)
(source: Nielsen Book Data)
This book presents the foundations of a general theory of algebras. Often called ``universal algebra'', this theory provides a common framework for all algebraic systems, including groups, rings, modules, fields, and lattices. Each chapter is replete with useful illustrations and exercises that solidify the reader's understanding. The book begins by developing the main concepts and working tools of algebras and lattices, and continues with examples of classical algebraic systems like groups, semigroups, monoids, and categories. The essence of the book lies in Chapter 4, which provides not only basic concepts and results of general algebra, but also the perspectives and intuitions shared by practitioners of the field. The book finishes with a study of possible uniqueness of factorizations of an algebra into a direct product of directly indecomposable algebras. There is enough material in this text for a two semester course sequence, but a one semester course could also focus primarily on Chapter 4, with additional topics selected from throughout the text.
(source: Nielsen Book Data)
 Stachowiak, Herbert.
 Wien, New York, Springer Verlag, 1973.
 Description
 Book — xv,494 p. illus. 24cm.
 Online
SAL3 (offcampus storage)
SAL3 (offcampus storage)  Status 

Stacks  Request (opens in new tab) 
QA9.7 .S7  Available 
 International Symposium on the Applications of Model Theory to Algebra, Analysis, and Probability (1967 : California Institute of Technology)
 New York, Holt, Rinehart and Winston [1969]
 Description
 Book — vii, 307 p. 24 cm.
 Online
SAL3 (offcampus storage)
SAL3 (offcampus storage)  Status 

Stacks  Request (opens in new tab) 
QA9 .I55 1967  Available 
11. Around classification theory [1986]
 Shelah, Saharon.
 Berlin ; New York : SpringerVerlag, c1986.
 Description
 Book — v, 279 p. ; 25 cm.
SAL3 (offcampus storage)
SAL3 (offcampus storage)  Status 

Stacks  Request (opens in new tab) 
QA3 .L28 V.1182  Available 
 Devlin, Keith J.
 Berlin, New York, SpringerVerlag, 1973.
 Description
 Book — xii, 240 p. 24 cm.
SAL3 (offcampus storage)
SAL3 (offcampus storage)  Status 

Stacks  Request (opens in new tab) 
QA3 .L28 V.354  Available 
 Wikström, Hugo.
 Göteborg, Sweden : Acta Universitatis Gothoburgensis, 1997.
 Description
 Book — xxiii, 313 p. : ill. ; 21 cm.
 Online
SAL3 (offcampus storage)
SAL3 (offcampus storage)  Status 

Stacks  Request (opens in new tab) 
LB1607.53 .S8 W53 1997  Available 
14. Automorphisms of firstorder structures [1994]
 Oxford : Clarendon Press ; New York : Oxford University Press, 1994.
 Description
 Book — 386 p.
 Summary

 I. Automorphisms and Permutation Groups
 Models and groups
 Examples of categorical structures
 A survey of Jordan groups
 The structure of totally categorical structures
 Permutations and the axiom of choice
 Relational structures and dimensions
 Bases in permutation groups
 Canonical expansions of countably categorical structures
 Some combinatorial aspects of the cover problem for totally categorical theories
 A generalization of Jordan groups
 Recursive saturation
 Indiscernibles
 The small index property and recursively saturated models of Peano arithmetic
 A Galois correspondence for countable recursively saturated models of Peano arithmetic
 Stable groups
 On generic normal subgroups
 On Frobenius groups of finite Morley rank I
 On Frobenius groups of finite Morley rank II
 Bibliography
 Index of notation
 Index
 Acknowledgements.
 (source: Nielsen Book Data)
(source: Nielsen Book Data)
 Online
SAL3 (offcampus storage)
SAL3 (offcampus storage)  Status 

Stacks  Request (opens in new tab) 
QA9.7 .A98 1994  Available 
 Woodin, W. H., author.
 Reprint 2011  Berlin ; Boston : De Gruyter, [2013]
 Description
 Book — 1 online resource (940 p). Digital: text file; PDF.
 Summary

 Frontmatter
 1 Introduction
 2 Preliminaries
 3 The nonstationary ideal
 4 The ℙmaxextension
 5 Applications
 6 ℙmax variations. 6.1 2ℙmax
 6 ℙmax variations. 6.2 Variations for obtaining ω1dense ideals. 6.2.1 ℚmax
 6 ℙmax variations. 6.2 Variations for obtaining ω1dense ideals. 6.2.2 ℚ*max
 6 ℙmax variations. 6.2 Variations for obtaining ω1dense ideals. 6.2.3 2ℚmax
 6 ℙmax variations. 6.2 Variations for obtaining ω1dense ideals. 6.2.4 Weak Kurepa trees and ℚmax
 6 ℙmax variations. 6.2 Variations for obtaining ω1dense ideals. 6.2.5 KTℚmax
 6 ℙmax variations. 6.2 Variations for obtaining ω1dense ideals. 6.2.6 Null sets and the nonstationary ideal
 6 ℙmax variations. 6.3 Nonregular ultrafilters on ω1
 7 Conditional variations
 8 ♣ principles for ω1. 8.1 Condensation Principles
 8 ♣ principles for ω1. 8.2 ℙ♣NSmax
 8 ♣ principles for ω1. 8.3 The principles, ♣+NS and ♣++NS
 9 Extensions of L(Γ, ℝ). 9.1 AD+
 9 Extensions of L(Γ, ℝ). 9.2 The ℙmaxextension of L(Γ, ℝ)
 9 Extensions of L(Γ, ℝ). 9.3 The ℚmaxextension of L(Γ, ℝ)
 9 Extensions of L(Γ, ℝ). 9.4 Chang's Conjecture
 9 Extensions of L(Γ, ℝ). 9.5 Weak and Strong Reflection Principles
 9 Extensions of L(Γ, ℝ). 9.6 Strong Chang's Conjecture
 9 Extensions of L(Γ, ℝ). 9.7 Ideals on ω2
 10 Further results. 10.1 Forcing notions and large cardinals
 10 Further results. 10.2 Coding into L(P(ω1))
 10 Further results. 10.3 Bounded forms of Martin's Maximum
 10 Further results. 10.4 Ωlogic
 10 Further results. 10.5 Ωlogic and the Continuum Hypothesis
 10 Further results. 10.6 The Axiom (*)+
 10 Further results. 10.7 The Effective Singular Cardinals Hypothesis
 11 Questions
 Bibliography
 Index
(source: Nielsen Book Data)
 Woodin, W. H. (W. Hugh)
 2nd rev. ed.  Berlin ; New York : De Gruyter, c2010.
 Description
 Book — vi, 852 p. ; 25 cm.
 Summary

This is the revised edition of a wellestablished monograph on the identification of a canonical model in which the Continuum Hypothesis is false. Written by an expert in the field, it is directed to researchers and advanced graduate students in Mathematical Logic and Set Theory. The second edition is updated to take into account some of the developments in the decade since the first edition appeared, this includes a revised discussion of ?logic and related matters.
(source: Nielsen Book Data)
Science Library (Li and Ma)
Science Library (Li and Ma)  Status 

Stacks  
QA9.7 .W66 2010  Unknown 
 Woodin, W. H. (W. Hugh)
 Berlin ; New York : W. de Gruyter, 1999.
 Description
 Book — 1 online resource (vi, 934 pages) Digital: data file.
 Summary

 Introduction
 preliminaries
 the nonstationary ideal
 the Rho max extension
 applications
 Rho max variations
 conditional variations
 principles for Omega 1
 extensions of (Gamma, Rho)
 further results
 questions.
 (source: Nielsen Book Data)
(source: Nielsen Book Data)
 Description
 Book
 Online
SAL3 (offcampus storage)
SAL3 (offcampus storage)  Status 

Stacks  Request (opens in new tab) 
129615  Available 
 Oak Ridge, Tenn. : distributed by the Office of Scientific and Technical Information, U.S. Dept. of Energy, 2010
 Description
 Book — 1 online resource (0:07:36 ) : digital, PDF file.
 Online
20. Basic model theory [1996]
 Doets, Kees.
 Stanford, Calif. : CLSI Publications ; [Dordrecht?] : FoLLI, c1996.
 Description
 Book — viii, 130 p. : ill. ; 24 cm.
 Summary

 Introduction
 1. Basic notions
 2. Relations between models
 3. EhrenfeuchtFraisse games
 4. Constructing models
 Appendix A. Deduction and completeness
 Appendix B. Set theory
 Bibliography
 Name index
 Subject index
 Notation.
 (source: Nielsen Book Data)
(source: Nielsen Book Data)
 Online
Green Library, Philosophy Library (Tanner), SAL3 (offcampus storage)
Green Library  Status 

Find it Jonsson Social Sciences Reading Room: CSLI publications  
QA9.7 .D64 1996  Unknown 
Philosophy Library (Tanner)  Status 

Stacks  
QA9.7 .D64 1996  Unknown 
SAL3 (offcampus storage)  Status 

Stacks  Request (opens in new tab) 
QA9.7 .D64 1996  Available 
22. Beyond first order model theory [2017]
 Boca Raton, FL : CRC Press, [2017]
 Description
 Book — 1 online resource.
 Summary

 Abstract elementary classes. Generalized logics in set theory. Topological methods in abstract model theory. Randomizations of structures. First Order logics with dependent sorts. Applications of infinitary logics.
 (source: Nielsen Book Data)
(source: Nielsen Book Data)
 Online

 EBSCOhost Access limited to 1 user
 Google Books (Full view)
23. Beyond First Order Model Theory [2016]
 Iovino, José, author.
 First edition  Boca Raton, FL : CRC Press, 2016
 Description
 Book — 1 online resource (xvi, 427 pages)
 Summary

 part, I Model Theory of Strong Logics
 chapter 1 Expressive power of inﬁnitary [0, 1]logics
 chapter 2 Scott processes
 chapter 3 Failure of 01 law for sparse random graph in strong logics (Sh1062)
 part, II Model Theory of Special Classes of Structures
 chapter 4 Maximality of continuous logic
 chapter 5 Model theory and metric convergence I: Metastability and dominated convergence
 chapter 6 Randomizations of scattered sentences / H. Jerome Keisler
 chapter 7 Existentially closed locally ﬁnite groups (Sh312)
 chapter 8 Analytic Zariski structures and nonelementary categoricity
 part, III Abstract Elementary Classes
 chapter 9 Hanf numbers and presentation theorems in AECs
 chapter 10 A survey on tame abstract elementary classes
 Badesa, Calixto.
 Princeton : Princeton University Press, 2008.
 Description
 Book — 1 online resource (254 pages)
 Summary

 Preface ix
 Chapter 1. Algebra of Classes and Propositional Calculus 1 1.1 Boole 1 1.2 Jevons 10 1.3 Peirce 12 1.4 Schroder 17
 Chapter 2. The Theory of Relatives 31 2.1 Introduction 31 2.2 Basic concepts of the theory of relatives 33 2.3 Basic postulates of the theory of relatives 40 2.4 Theory of relatives and model theory 51 2.5 Firstorder logic of relatives 66
 Chapter 3. Changing the Order of Quantifiers 73 3.1 Schroder's proposal 73 3.2 Lowenheim's approach 81 3.3 The problem of expansions 87 3.4 Skolem functions 94
 Chapter 4. The Lowenheim Normal Form 107 4.1 The Lowenheim normal form of an equation 107 4.2 Comments on Lowenheim's method 113 4.3 Conclusions 122
 Chapter 5. Preliminaries to Lowenheim's Theorem 129 5.1 Indices and elements 129 5.2 Types of indices 132 5.3 Assignments 135 5.4 Types of equations 138
 Chapter 6. Lowenheim's Theorem 143 6.1 The problem 143 6.2 An analysis of Lowenheim's proof 148 6.3 Reconstructing the proof 191 Appendix. FirstOrder Logic with Fleeing Indices 207 A.1 Introduction 207 A.2 Syntax 207 A.3 Semantics 211 A.4 The Lowenheim normal form 217 A.5 Lowenheim's theorem 220 References 227 Index 237.
 (source: Nielsen Book Data)
(source: Nielsen Book Data)
 Badesa, Calixto.
 Princeton : Princeton University Press, 2008.
 Description
 Book — 1 online resource (254 pages)
 Summary

 Preface ix
 Chapter 1. Algebra of Classes and Propositional Calculus 1 1.1 Boole 1 1.2 Jevons 10 1.3 Peirce 12 1.4 Schroder 17
 Chapter 2. The Theory of Relatives 31 2.1 Introduction 31 2.2 Basic concepts of the theory of relatives 33 2.3 Basic postulates of the theory of relatives 40 2.4 Theory of relatives and model theory 51 2.5 Firstorder logic of relatives 66
 Chapter 3. Changing the Order of Quantifiers 73 3.1 Schroder's proposal 73 3.2 Lowenheim's approach 81 3.3 The problem of expansions 87 3.4 Skolem functions 94
 Chapter 4. The Lowenheim Normal Form 107 4.1 The Lowenheim normal form of an equation 107 4.2 Comments on Lowenheim's method 113 4.3 Conclusions 122
 Chapter 5. Preliminaries to Lowenheim's Theorem 129 5.1 Indices and elements 129 5.2 Types of indices 132 5.3 Assignments 135 5.4 Types of equations 138
 Chapter 6. Lowenheim's Theorem 143 6.1 The problem 143 6.2 An analysis of Lowenheim's proof 148 6.3 Reconstructing the proof 191 Appendix. FirstOrder Logic with Fleeing Indices 207 A.1 Introduction 207 A.2 Syntax 207 A.3 Semantics 211 A.4 The Lowenheim normal form 217 A.5 Lowenheim's theorem 220 References 227 Index 237.
 (source: Nielsen Book Data)
(source: Nielsen Book Data)
 Badesa, Calixto, author.
 Course Book.  Princeton, N.J. : Princeton University Press, [2004]
 Description
 Book — 1 online resource (256 pages) : illustrations. Digital: text file; PDF.
 Summary

 Frontmatter
 Contents
 Preface
 Chapter 1. Algebra of Classes and Propositional Calculus
 Chapter 2. The Theory of Relatives
 Chapter 3. Changing the Order of Quantifiers
 Chapter 4. The Löwenheim Normal Form
 Chapter 5. Preliminaries to Löwenheim’s Theorem
 Chapter 6. Löwenheim’s Theorem
 Appendix. FirstOrder Logic with Fleeing Indices
 References
 Index.
 Bell, J. L. (John Lane)
 2nd ed.  Oxford [Oxfordshire] : Oxford University Press, 1985.
 Description
 Book — xx, 165 p. ; 24 cm.
 Online
SAL3 (offcampus storage)
SAL3 (offcampus storage)  Status 

Stacks  Request (opens in new tab) 
QA248 .B44 1985  Available 
 Bell, J. L. (John Lane)
 Oxford : Clarendon Press, 1977.
 Description
 Book — xviii, 126 p. ; 24 cm.
 Online
SAL3 (offcampus storage)
SAL3 (offcampus storage)  Status 

Stacks  Request (opens in new tab) 
QA248 .B44 1977  Available 
 Otto, Martin, 1961 author.
 Cambridge ; New York : Cambridge University Press, 2017.
 Description
 Book — 1 online resource (183 pages)
 Summary

 Preface
 Introduction
 1. Definitions and preliminaries
 2. The games and their analysis
 3. The invariants
 4. Fixedpoint logic with counting
 5. Related Lindstroem extensions
 6. Canonization problems
 7. Canonization for two variables
 Bibliography
 Index.
 (source: Nielsen Book Data)
(source: Nielsen Book Data)
30. Building models by games [1985]
 Hodges, Wilfrid.
 Cambridge ; New York : Cambridge University Press, 1985.
 Description
 Book — 311 p. : ill. ; 24 cm.
 Summary

This book introduces a general method for building infinite mathematical structures, and surveys its applications in algebra and model theory. The basic idea behind the method is to build a structure by a procedure with infinitely many steps, similar to a game between two players that goes on indefinitely. The approach is new and helps to simplify, motivate and unify a wide range of constructions that were previously carried out separately and by ad hoc methods. The first chapter provides a resume of basic model theory. A wide variety of algebraic applications are studied, with detailed analyses of existentially closed groups of class 2. Another chapter describes the classical modeltheoretic form of this method of construction, which is known variously as 'omitting types', 'forcing' or the 'HenkinOrey theorem'. The last three chapters are more specialised and discuss how the same idea can be used to build uncountable structures. Applications include completeness for MagidorMalitz quantifiers, and Shelah's recent and sophisticated omitting types theorem for L(Q). There are also applications to Bdolean algebras and models of arithmetic.
(source: Nielsen Book Data)
 Online
SAL3 (offcampus storage)
SAL3 (offcampus storage)  Status 

Stacks  Request (opens in new tab) 
QA9.7 .H63 1985  Available 
31. Categoricity [2009]
 Baldwin, John T.
 Providence, R.I. : American Mathematical Society, c2009.
 Description
 Book — xi, 235 p. : ill. ; 26 cm.
 Summary

Modern model theory began with Morley's categoricity theorem: A countable firstorder theory that has a unique (up to isomorphism) model in one uncountable cardinal (i.e., is categorical in cardinality) if and only if the same holds in all uncountable cardinals. Over the last 35 years Shelah made great strides in extending this result to infinitary logic, where the basic tool of compactness fails. He invented the notion of an Abstract Elementary Class to give a unifying semantic account of theories in firstorder, infinitary logic and with some generalized quantifiers. Zilber developed similar techniques of infinitary model theory to study complex exponentiation. This book provides the first unified and systematic exposition of this work. The many examples stretch from pure model theory to module theory and covers of Abelian varieties. Assuming only a first course in model theory, the book expounds eventual categoricity results (for classes with amalgamation) and categoricity in excellent classes. Such crucial tools as Ehrenfeucht  Mostowski models, Galois types, tameness, omittingtypes theorems, multidimensional amalgamation, atomic types, good sets, weak diamonds, and excellent classes are developed completely and methodically. The (occasional) reliance on extensions of basic set theory is clearly laid out. The book concludes with a set of open problems.
(source: Nielsen Book Data)
Science Library (Li and Ma)
Science Library (Li and Ma)  Status 

Stacks  
QA9.67 .B35 2009  Unknown 
 Washington, D.C. : United States. Dept. of Energy. Office of Basic Energy Sciences ; Oak Ridge, Tenn. : distributed by the Office of Scientific and Technical Information, U.S. Dept. of Energy, 1981
 Description
 Book — 1 online resource (Article No. 6075 ): digital, PDF file.
 Summary

A classical interpretation of the Dirac–Van Vleck spin version of valence bond theory is used in this research to obtain a classical model for electronic degrees of freedom within the valence bond framework. The approach is illustrated by deriving the explicit forms of the classical Hamiltonians, involving electronic and heavy particle degrees of freedom, for the H–H_{2}, F–H_{2}, and O–H_{2} systems. It is also shown how the initial conditions for both electronic and heavy particle degrees of freedom are chosen to carry out a classical trajectory simulation of collision processes. In addition, the attractive feature of this model is that it is as easily applicable to electronically nonadiabatic processes as it is to adiabatic ones.
 Online
33. The classification of countable homogeneous directed graphs and countable homogeneous ntournaments [1998]
 Cherlin, Gregory L., 1948
 Providence, R.I. : American Mathematical Society, 1998.
 Description
 Book — xiii, 161 p. ; 26 cm.
 Summary

 Results and open problems Homogeneous $2$tournaments Homogeneous $n$tournaments Homogeneous symmetric graphs Homogeneous directed graphs omitting $I_\infty$ Propositions $16$ to $20$ and MT $2.2$ Homogeneous directed graphs embedding $I_\infty$ Theorems 7.67.9 Appendix: Examples for richer languages Bibliography Index of Notation Index.
 (source: Nielsen Book Data)
(source: Nielsen Book Data)
SAL3 (offcampus storage)
SAL3 (offcampus storage)  Status 

Stacks  Request (opens in new tab) 
QA3 .A57 NO.621  Available 
 Shelah, Saharon.
 Rev. ed.  Amsterdam ; New York : NorthHolland ; New York, N.Y., U.S.A. : Distributors for the U.S.A. and Canada, Elsevier Science Pub. Co., 1990.
 Description
 Book — xxxiv, 705 p. ; 23 cm.
 Summary

 Preliminaries. Ranks and Incomplete Types. Global Theory. Prime Models. More on Types and Saturated Models. Saturation of Ultraproducts. Construction of Models. The Number of NonIsomorphic Models in PseudoElementary Classes. Categoricity and the Number of Models in Elementary Classes. Classification for F a No Saturated Models. The Decomposition Theorem. The Main Gap For Countable Theories. For Thomas the Doubter. Appendix: Filters, Stationary Sets and Families of Sets. Partition Theorems. Various Results. Historical Remarks. References.
 (source: Nielsen Book Data)
(source: Nielsen Book Data)
Science Library (Li and Ma)
Science Library (Li and Ma)  Status 

Stacks  
QA9.7 .S53 1990  Unknown 
 Shelah, Saharon.
 Amsterdam ; New York : NorthHolland Pub. Co., 1978.
 Description
 Book — xvi, 544 p. ; 23 cm.
 Online
SAL3 (offcampus storage)
SAL3 (offcampus storage)  Status 

Stacks  Request (opens in new tab) 
QA9.7 .S53  Available 
 U.S.Israel Workshop on Model Theory in Mathematical Logic (1985 : Chicago, Ill.)
 Berlin ; New York : SpringerVerlag, c1987.
 Description
 Book — 500 p. ; 25 cm.
SAL3 (offcampus storage)
SAL3 (offcampus storage)  Status 

Stacks  Request (opens in new tab) 
QA3 .L28 V.1292  Available 
 Halbeisen, Lorenz J., author.
 Second edition.  Cham, Switzerland : Springer, [2017]
 Description
 Book — 1 online resource.
 Summary

 The Setting. FirstOrder Logic in a Nutshell. Axioms of Set Theory. Overture: Ramsey's Theorem. Cardinal Relations in ZF Only. Forms of Choice. How to Make Two Balls from One. Models of Set Theory with Atoms. Thirteen Cardinals and Their Relations. The Shattering Number Revisited. Happy Families and Their Relatives. Coda: A Dual Form of Ramsey's Theorem. The Idea of Forcing. Martin's Axiom. The Notion of Forcing. Proving Unprovability. Models in Which AC Fails. Combining Forcing Notions. Models in Which p=c. Suslin's Problem. Properties of Forcing Extensions. Cohen Forcing Revisited. Sacks Forcing. SilverLike Forcing Notions. Miller Forcing. Mathias Forcing. How Many Ramsey Ultrafilters Exist?. Combinatorial Properties of Sets of Partitions. Suite.
 (source: Nielsen Book Data)
(source: Nielsen Book Data)
 Halbeisen, Lorenz J., author.
 Second edition.  Cham, Switzerland : Springer, [2017]
 Description
 Book — 1 online resource Digital: PDF.text file.
 Summary

 The Setting. FirstOrder Logic in a Nutshell. Axioms of Set Theory. Overture: Ramsey's Theorem. Cardinal Relations in ZF Only. Forms of Choice. How to Make Two Balls from One. Models of Set Theory with Atoms. Thirteen Cardinals and Their Relations. The Shattering Number Revisited. Happy Families and Their Relatives. Coda: A Dual Form of Ramsey's Theorem. The Idea of Forcing. Martin's Axiom. The Notion of Forcing. Proving Unprovability. Models in Which AC Fails. Combining Forcing Notions. Models in Which p=c. Suslin's Problem. Properties of Forcing Extensions. Cohen Forcing Revisited. Sacks Forcing. SilverLike Forcing Notions. Miller Forcing. Mathias Forcing. How Many Ramsey Ultrafilters Exist?. Combinatorial Properties of Sets of Partitions. Suite.
 (source: Nielsen Book Data)
(source: Nielsen Book Data)
 Halbeisen, Lorenz J.
 London ; New York : SpringerVerlag London Ltd., ©2012.
 Description
 Book — 1 online resource (xvi, 453 pages) Digital: text file.PDF.
 Summary

 The Setting
 Overture: Ramsey's Theorem
 The Axioms of ZermeloFraenkel Set Theory
 Cardinal Relations in ZF only
 The Axiom of Choice
 How to Make Two Balls from One
 Models of Set Theory with Atoms
 Twelve Cardinals and their Relations
 The Shattering Number Revisited
 Happy Families and their Relatives
 Coda: A Dual Form of Ramsey's Theorem
 The Idea of Forcing
 Martin's Axiom
 The Notion of Forcing
 Models of Finite Fragments of Set Theory
 Proving Unprovability
 Models in which AC Fails
 Combining Forcing Notions
 Models in which p = c
 Properties of Forcing Extensions
 Cohen Forcing Revisited
 SilverLike Forcing Notions
 Miller Forcing
 Mathias Forcing
 On the Existence of Ramsey Ultrafilters
 Combinatorial Properties of Sets of Partitions
 Suite.
40. Compartmental models and their application [1983]
 Godfrey, Keith
 London ; New York : Academic Press, 1983.
 Description
 Book — xiv, 293 p. : ill. ; 24 cm.
 Online
SAL3 (offcampus storage)
SAL3 (offcampus storage)  Status 

Stacks  Request (opens in new tab) 
QH324.8 .G63 1983  Available 
 Päppinghaus, Peter.
 Warszawa : Paʹnstwowe Wydawn. Nauk., 1983.
 Description
 Book — 66 p. ; 24 cm.
 Online
SAL3 (offcampus storage)
SAL3 (offcampus storage)  Status 

Stacks  Request (opens in new tab) 
QA1 .D54 V.207  Available 
 Table ronde de logique (1983 : Institut Henri Poincaré)
 [Montreuil] France : GauthierVillars, 1984.
 Description
 Book — iii, 103 p. : ill. ; 24 cm.
 Online
Science Library (Li and Ma)
Science Library (Li and Ma)  Status 

Serials  
Shelved by Series title N.S. NO.16  Unknown 
43. Computable models [2009]
 Turner, Raymond, 1947
 [Berlin] : Springer, ©2009.
 Description
 Book — 1 online resource (xi, 240 pages) : illustrations Digital: text file.PDF.
 Summary

 What is a Computable Model?. Typed Predicate Logic. Data Types. Definability. Specification. Functions. Preconditions. Natural Numbers. Typed Set Theory. Systems Modeling. A Type of Types. Schemata. Separation Types. Recursive Schemata. Inductive Types. Recursive Functions. Schema Definitions. Computable Ontology. Classes. Classes of Functions. Computable Analysis. Programming Language Specification. Abstract Types. Conclusion.
 (source: Nielsen Book Data)
(source: Nielsen Book Data)
 Badiou, Alain.
 Nouvelle édition augmentée.  [Paris] : Fayard, c2007.
 Description
 Book — 197 p. : ill. ; 22 cm.
 Online
 Badiou, Alain.
 Paris, F. Maspero, 1969.
 Description
 Book — 95 p. 20 cm.
 Online
SAL3 (offcampus storage)
SAL3 (offcampus storage)  Status 

Stacks  Request (opens in new tab) 
QA9.7 .B34 1969  Available 
 United States. Agricultural Research Service. Office of Administrator.
 [Washington] : Dept. of Agriculture, Agricultural Research Service, Office of Administrator, 1978.
 Description
 Book — [31] p. : ill. ; 27 cm.
Green Library
Green Library  Status 

Find it US Federal Documents  
A 77.6/3:M 72  Unknown 
 Washington, D.C. : United States. Dept. of Energy. ; Oak Ridge, Tenn. : distributed by the Office of Scientific and Technical Information, U.S. Dept. of Energy, 2005
 Description
 Book — 31 p. : digital, PDF file.
 Summary

This work focuses on different methods to generate confidence regions for nonlinear parameter identification problems. Three methods for confidence region estimation are considered: a linear approximation method, an Ftest method, and a LogLikelihood method. Each of these methods are applied to three case studies. One case study is a problem with synthetic data, and the other two case studies identify hydraulic parameters in groundwater flow problems based on experimental welltest results. The confidence regions for each case study are analyzed and compared. Although the Ftest and LogLikelihood methods result in similar regions, there are differences between these regions and the regions generated by the linear approximation method for nonlinear problems. The differing results, capabilities, and drawbacks of all three methods are discussed.
 Online
48. Constructible sets with applications [1969]
 Mostowski, Andrzej.
 Amsterdam, NorthHolland Pub. Co.; Warszawa, PWNPolish Scientific Publishers, 1969.
 Description
 Book — 1 online resource (ix, 269 pages)
49. Constructible sets with applications [1969]
 Mostowski, Andrzej.
 Amsterdam, NorthHolland Pub. Co.; Warszawa, PWNPolish Scientific Publishers, 1969.
 Description
 Book — ix, 269 p. 23 cm.
 Online
Philosophy Library (Tanner), SAL3 (offcampus storage)
Philosophy Library (Tanner)  Status 

Stacks  
QA9 .M755  Unknown 
SAL3 (offcampus storage)  Status 

Stacks  Request (opens in new tab) 
QA9 .M755  Available 
50. Continuous model theory [1966]
 Chang, Chen Chung, 1927
 Princeton, Princeton University Press, 1966.
 Description
 Book — xii, 165 p. 24 cm.
Philosophy Library (Tanner), Science Library (Li and Ma)
Philosophy Library (Tanner)  Status 

Stacks  
QA9 .C391  Unknown 
Science Library (Li and Ma)  Status 

Serials  
Shelved by Series title NO.58  Unknown 
Articles+
Journal articles, ebooks, & other eresources
Guides
Course and topicbased guides to collections, tools, and services.