1  20
Next
2. Logic and structure [2004]
 Dalen, D. van (Dirk), 1932
 4th ed.  Berlin ; New York : SpringerVerlag, c2004.
 Description
 Book — x, 263 p. ; 24 cm.
 Summary

 Introduction. Propositional Logic. Predicate Logic. Completeness and Applications. Second Order Logic. Intuitionistic Logic. Normalisation. Goedel's Theorem. Bibliography. Index.
 (source: Nielsen Book Data)
(source: Nielsen Book Data)
Science Library (Li and Ma)
Science Library (Li and Ma)  Status 

Stacks  
QA9 .D16 2004  Unknown 
3. Introduction to modern mathematics [1973]
 Wstęp do matematyki współcźesnej. English
 Rasiowa, Helena.
 Amsterdam, NorthHolland Pub. Co., 1973.
 Description
 Book — 1 online resource (xii, 339 pages)
 Summary

 Front Cover; Introduction to Modern Mathematics; Copyright Page; FOREWORD; Table of Contents;
 CHAPTER I. THE ALGEBRA OF SETS; 1. The concept of set; 2. The union of sets; 3. The intersection of sets. The laws of absorption and distributivity; 4. The difference of sets. Relationships between the difference of sets and the operations of union and intersection of sets; 5. The universe. The complement of a set; 6. Axioms of the algebra of sets; 7. Fields of sets; 8. Prepositional functions of one variable; 9. Note on axioms of set theory
 10. Comments on the need of an axiomatic approach to set theory and on axiomatic theories
 CHAPTER II: NATURAL NUMBERS. PROOFS BY INDUCTION; 1. An axiomatic approach to natural numbers. The principle of induction; 2. Examples of proofs by induction;
 CHAPTER III. FUNCTIONS; 1. The concept of function; 2. Onetoone functions. Inverse function; 3. Composition of functions; 4. Groups of transformations;
 CHAPTER IV. GENERALIZED UNIONS AND INTERSECTIONS OF SETS; 1. The concept of generalized union and intersection; 2. The properties of generalized unions and intersections of sets
 CHAPTER V. CARTESIAN PRODUCTS OF SETS. RELATIONS. FUNCTIONS AS RELATIONS1. Cartesian products; 2. Binary relations; 3. Propositional functions of two variables; 4. Reflexive, irreflexive, symmetric, asymmetric, antisymmetric, and transitive relations; 5. Functions as relations;
 CHAPTER VI. GENERALIZED PRODUCTS. mARY RELATIONS. FUNCTIONS OF SEVERAL VARIABLES. IMAGES AND INVERSE IMAGES UNDER A FUNCTION; 1. Generalized products; 2. mary relations; 3. Propositional functions of m variables; 4. Functions of several variables; 5. Images and inverse images under a function
 CHAPTER VII. EQUIVALENCE RELATIONS1. Definition of equivalence relations. Method of identification; 2. Application of the method of identification to the construction of integers; 3. Application of the method of identification to the construction of rational numbers; 4. Note on Cantor's theory of real numbers;
 CHAPTER VIII. POWERS OF SETS; 1. Equipotent sets. Power of a set; 2. Enumerable sets; 3. Examples of nonenumerable sets; 4. Inequalities for cardinal numbers. The CantorBernstein theorem; 5. Sets of the power of the continuum
 6. The power set. Cantor's theorem. Consequences of Cantor's theorem
 CHAPTER IX. ORDERED SETS; 1. Ordering relations; 2. Maximal and minimal elements; 3 Subsets of ordered sets. The KuratowskiZorn lemma; 4. Note on lattices; 5. Quasiordering relations; 6. Note on directed sets;
 CHAPTER X. LINEARLY ORDERED SETS; 1. Linear orderings; 2. Isomorphism of linearly ordered sets; 3. Dense linear ordering; 4. Continuous linear orderings;
 CHAPTER XI. WELLORDERED SETS; 1. Wellordering relations. Ordinal numbers; 2. Comparison of ordinal numbers; 3. Sets of ordinal numbers
4. Five hundred mathematical challenges [1995]
 Barbeau, Edward, 1938
 [Washington, DC] : Mathematical Association of America, ©1995.
 Description
 Book — 1 online resource : illustrations
 Summary

 Cover
 copyright page
 Title page
 PREFACE
 Contents
 Problems
 Solutions
 The Tool Chest
 A. Combinatorics
 B. Arithmetic
 C. Algebra
 D. Inequalities
 E. Geometry and Trigonometry
 F. Analysis
 Index of Problems.
5. Logic from A to Z [1999]
 Detlefsen, Michael, 1948
 London ; New York : Routledge, 1999.
 Description
 Book — 1 online resource (vii, 116 pages) Digital: data file.
 Summary

 Cover; Logic from A to Z; Copyright; Contents; Introduction; Logic from A to Z; A; B; C; D; E; F; G; H; I; J; K; L; M; N; O; P; Q; R; S; T; U; V; W; Z; Table of logical symbols.
(source: Nielsen Book Data)
6. Combinatorial group theory [2001]
 Lyndon, Roger C., author.
 Berlin : Springer, 2001.
 Description
 Book — 1 online resource (xiv, 339 pages) : illustrations
 Summary

 Chapter I. Free Groups and Their Subgroups 1. Introduction 2. Nielsen's Method 3. Subgroups of Free Groups 4. Automorphisms of Free Groups 5. Stabilizers in Aut(F) 6. Equations over Groups 7. Quadratic sets of Word 8. Equations in Free Groups 9. Abstract Lenght Functions 10. Representations of Free Groups 11. Free Pruducts with Amalgamation
 Chapter II. Generators and Relations 1. Introduction 2. Finite Presentations 3. Fox Calculus, Relation Matrices, Connections with Cohomology 4. The ReidemeisterSchreier Method 5. Groups with a Single Defining Relator 6. Magnus' Treatment of OneRelator Groups
 Chapter III. Geometric Methods 1. Introduction 2. Complexes 3. Covering Maps 4. Cayley Complexes 5. Planar Caley Complexes 6. FGroups Continued 7. Fuchsian Complexes 8. Planar Groups with Reflections 9. Singular Subcomplexes 10. Sherical Diagrams 11. Aspherical Groups 12. Coset Diagrams and Permutation Representations 13. Behr Graphs Chpter IV. Free Products and HNN Extensions 1. Free Products 2. HigmanNeumannNeumann Extensions and Free Products with Amalgamation 3. Some Embedding Theorems 4. Some Decision Problems 5. OneRelator Groups 6. Bipolar Structures 7. The Higman Embedding Theorem 8. Algebraically Closed Groups
 Chapter V. Small Cancellation Theory 1. Diagrams 2. The Small Cancellation Hypotheses 3. The Basic Formulas 4. Dehn's Algorithm and Greendlinger's Lemma 5. The Conjugacy Problem 6. The Word Problem 7. The Cunjugacy Problme 8. Applications to Knot Groups 9. The Theory over Free Products 10. Small Cancellation Products 11. Small Cancellation Theory over free Products with Amalgamation and HNN Extensions Bibliography Index of Names Subject Index.
 (source: Nielsen Book Data)
(source: Nielsen Book Data)
7. Lectures on mathematical logic [2000]
 Felscher, Walter.
 Amsterdam, the Netherlands : Gordon and Breach Science Publishers, c2000.
 Description
 Book — 3 v. ; 24 cm
 Summary

 v. 1. Set theoretical logic : the algebra of models
 v. 2. Calculi for derivations and deductions
 v. 3. The logic of arithmetic.
(source: Nielsen Book Data)
 Online
SAL3 (offcampus storage)
SAL3 (offcampus storage)  Status 

Stacks

Request (opens in new tab) 
QA9.2 .F45 2000 V.1  Available 
QA9.2 .F45 2000 V.2  Available 
QA9.2 .F45 2000 V.3  Available 
 Linsky, Bernard.
 Cambridge ; New York : Cambridge University Press, ©2011.
 Description
 Book — 1 online resource (vii, 407 pages, 2 unnumbered pages of plates) : illustrations
 Summary

 1. Introduction
 2. Writing the second edition
 3. Logic since the first edition
 4. Notation and logic
 5. Improvements in the new edition
 6. Induction and types in Appendix B
 7. The reception of the second edition
 8. The list of definitions for Carnap
 Introduction to the second edition
 Appendix A
 Appendix B
 Appendix C
 Hierarchy of propositions and functions
 Amended list of propositions: notes
 Bibliography
 Index.
 (source: Nielsen Book Data)
(source: Nielsen Book Data)
 Berlin ; New York : Walter de Gruyter, ©2004.
 Description
 Book — 1 online resource (ix, 662 pages)
 Summary

 Introduction: Bertrand Russell  the invention of mathematical philosophy / Godehard Link
 Set theory after Russell: the journey back to Eden / W. Hugh Woodin
 A way out / Harvey M. Friedman
 Completeness and iteration in modern set theory / Sy D. Friedman
 Was sind und was sollen (neue) Axiome? / Kai Hauser
 Iterating [sigma] operations in admissible set theory without foundation: a further aspect of metapredicative Mahlo / Gerhard Jäger, Dieter Probst
 Typical ambiquity: trying to have your cake and eat it too / Solomon Feferman
 Is ZF finitistically reducible? / KarlGeorg Niebergall
 Inconsistency in the real world / Tobias Hürter
 Predicativity, circularity, and antifoundation / Michael Rathjen
 Russell's paradox and diagonalization in a constructive context / John L. Bell
 Constructive solutions of continuous equations / Peter Schuster, Helmut Schwichtenberg
 Russell's paradox in consistent fragments of Frege's Grundgesetze der Arithmetik / Kai F. Wehmeier
 On a Russellian paradox about propositions and truth / Andrea Cantini
 The consistency of the naive theory of properties / Hartry Field
 The significance of the largest and smallest numbers for the oldest paradoxes / Ulrich Blau
 The prehistory of Russell's paradox / Nicholas Griffin
 Logicism's 'insolubilia' and their solution by Russell's substitutional theory / Gregory Landini
 Substitution and types: Russell's intermediate theory / Philippe de Rouilhan
 Propositional ontology and logical atomism / Francisco RodríguezConsuegra
 Classes of classes and classes of functions in Principia Mathematica / Bernard Linsky
 A "constructive" proper extension of ramified type theory (the logic of Principia Mathematica, Second Edition, Appendix B) / Allen P. Hazen
 Russell on method / Andrew D. Irvine
 Paradoxes in Göttingen / Volker Peckhaus
 David Hilbert and Paul du BoisReymond: limits and ideals / David Charles McCarty
 Russell's paradox and Hilbert's (much forgotten) view of set theory / Jan Mycielski
 Objectivity: the justification for extrapolation / Shaughan Lavine
 Russell's absolutism vs. structuralism / Geoffrey Hellman
 Mathematicians and mathematical objects / Robert S.D. Thomas
 Russell's paradox and our conception of properties, or: why semantics is no proper guide to the nature of properties / Holger Sturm
 The many lives of Ebenezer Wilkes Smith / Vann McGee
 What makes expressions meaningful? A reflection on contexts and actions / Albert Visser.
(source: Nielsen Book Data)
 Lebedev, L. P., author.
 Princeton, NJ : Princeton University Press, ©2004.
 Description
 Book — 1 online resource (viii, 225 pages)
 Summary

 Preface vii Chapter 1. The Tools of Calculus 1 1.1 Is Mathematical Proof Necessary? 2 1.2 Abstraction, Understanding, Infinity 6 1.3 Irrational Numbers 8 1.4 What Is a Limit? 11 1.5 Series 15 1.6 Function Continuity 19 1.7 How to Measure Length 21 1.8 Antiderivatives 33 1.9 Definite Integral 35 1.10 The Length of a Curve 42 1.11 Multidimensional Integrals 44 1.12 Approximate Integration 47 1.13 On the Notion of a Function 52 1.14 Differential Equations 53 1.15 Optimization 59 1.16 Petroleum Exploration and Recovery 61 1.17 Complex Variables 63 1.18 Moving On 65 Chapter 2. The Mechanics of Continua 67 2.1 Why Do Ships Float? 67 2.2 The Main Notions of Classical Mechanics 71 2.3 Forces, Vectors, and Objectivity 74 2.4 More on Forces
 Statics 76 2.5 Hooke's Law 80 2.6 Bending of a Beam 84 2.7 Stress Tensor 94 2.8 Principal Axes and Invariants of the Stress Tensor 100 2.9 On the Continuum Model and Limit Passages 102 2.10 Equilibrium Equations 104 2.11 The Strain Tensor 108 2.12 Generalized Hooke's Law 113 2.13 Constitutive Laws 114 2.14 Boundary Value Problems 115 2.15 Setup of Boundary Value Problems of Elasticity 118 2.16 Existence and Uniqueness of Solution 120 2.17 Energy
 Minimal Principle for a Spring 126 2.18 Energy in Linear Elasticity 128 2.19 Dynamic Problems of Elasticity 132 2.20 Oscillations of a String 134 2.21 Lagrangian and Eulerian Descriptions of Continuum Media 137 2.22 The Equations of Hydrodynamics 140 2.23 D'AlembertEuler Equation of Continuity 142 2.24 Some Other Models of Hydrodynamics 144 2.25 Equilibrium of an Ideal Incompressible Liquid 145 2.26 Force on an Obstacle 148 Chapter 3. Elements of the Strength of Materials 151 3.1 What Are the Problems of the Strength of Materials? 151 3.2 Hooke's Law Revisited 152 3.3 Objectiveness of Quantities in Mechanics Revisited 157 3.4 Plane Elasticity 159 3.5 SaintVenant's Principle 161 3.6 Stress Concentration 163 3.7 Linearity vs. Nonlinearity 165 3.8 Dislocations, Plasticity, Creep, and Fatigue 166 3.9 Heat Transfer 172 3.10 Thermoelasticity 175 3.11 Thermal Expansion 177 3.12 A Few Words on the History of Thermodynamics 178 3.13 Thermodynamics of an Ideal Gas 180 3.14 Thermodynamics of a Linearly Elastic Rod 182 3.15 Stability 186 3.16 Static Stability of a Straight Beam 188 3.17 Dynamical Tools for Studying Stability 193 3.18 Additional Remarks on Stability 195 3.19 Leak Prevention 198 Chapter 4. Some Questions of Modeling in the Natural Sciences 201 4.1 Modeling and Simulation 201 4.2 Computerization and Modeling 203 4.3 Numerical Methods and Modeling in Mechanics 206 4.4 Complexity in the Real World 208 4.5 The Role of the Cosine in Everyday Measurements 209 4.6 Accuracy and Precision 211 4.7 How Trees Stand Up against the Wind 213 4.8 Why King Kong Cannot Be as Terrible as in the Movies 216 Afterword 219 Recommended Reading 221 Index 223.
 (source: Nielsen Book Data)
(source: Nielsen Book Data)
11. Journal of mathematical logic [2001 ]
 Journal of mathematical logic (Online)
 [Singapore] : World Scientific Pub.
 Description
 Journal/Periodical
12. Selfreference [2006]
 Stanford, Calif. : Center for the Study of Language and Information, ©2006
 Description
 Book — v, 190 pages : illustrations ; 23 cm
 Summary

 Introduction / T. Bolander, V.F. Hendricks, and S.A. Pedersen
 Fixed point constructions / Andrea Cantini
 Bilattices are nice things / Melvin Fitting
 Finite circular definitions / Anil Gupta
 In praise of the free lunch / Vann McGee
 Theory and application of selfreference / Don Perlis
 The paradoxes of denotation / Graham Priest
 Selfreference in all its glory! / Raymond M. Smullyan
 Circularity and paradox / Stephen Yablo
(source: Nielsen Book Data)
 Online
Green Library
Green Library  Status 

Find it Jonsson Social Sciences Reading Room: CSLI publications  
B105 .R25 S45 2006  Unknown 
Find it Stacks  
B105 .R25 S45 2006  Unknown 
 Dordrecht : Springer Science+Business Media, LLC, [1996]
 Description
 Book — 1 online resource (xi, 388 pages) : illustrations Digital: text file.PDF.
 Summary

 An overview of fibred semantics and the combination of logics / Dov M. Gabbay
 Generalising propositional modal logic using labelled deductive systems / Alessandra Russo
 A topography of labelled modal logics / David Basin, Sean Matthews and Luca Vigano
 Combining classical and intuitionistic logic, or: intuitionistic implication as a conditional / Luis Farinas del Cerro and Andreas Herzig
 A new correctness proof of the NelsonOppen combination procedure / Cesare Tinelli and Mehdi Harandi
 Cooperation of decision procedures for the satisfiability problem / Christophe Ringeissen
 Combining finite model generation with theorem proving: problems and prospects / John Slaney and Timothy Surendonk
 Reasoning theories: towards an architecture for open mechanized reasoning systems / Fausto Giunchiglia, Paolo Pecchiari and Carolyn Talcott
 Natural language presentation and combination of automatically generated proofs / Bernd Ingo Dahn and Andreas Wolf.
14. Archive for mathematical logic [1988 ]
 Archive for mathematical logic (Online)
 Berlin : Springer International
 Description
 Journal/Periodical — online resource
15. Logic Colloquium 2006 [2009]
 Logic Colloquium (2006 : Nijmegen, Netherlands)
 Cambridge ; New York : Cambridge University Press ; [Poughkeepsie, N.Y.] : Association for Symbolic Logic, 2009.
 Description
 Book — 1 online resource (ix, 373 pages) : illustrations
 Summary

 1. Definability and elementary equivalence in the Ershov difference hierarchy Marat M. Arslanov
 2. A unified approach to algebraic set theory Benno van den Berg and Leke Moerdijk
 3. Brief introduction to unprovability Andrey Bovykin
 4. Higherorder abstract syntax in type theory Venanzio Capretta and Amy P. Felty
 5. An introduction to bminimality Raf Cluckers
 6. The sixth lecture on algorithmic randomness Rod Downey
 7. The inevitability of logical strength: strict reverse mathematics Harvey M. Friedman
 8. Applications of logic in algebra: examples from clone theory
 9. On infinite imaginaries Ehud Hrushovski
 10. Strong minimal covers and a question of Yates: the story so far Andrew E. M. Lewis
 11. Embeddings into the Turing degrees Antonio Montalban
 12. Randomness  beyond Lebesgue measure Jan Reimann
 13. The derived model theorem J. R. Steel
 14. Forcing axioms and cardinal arithmetic Boban Velivckovic
 15. Hrushovski's amalgamation construction Frank O. Wagner.
 (source: Nielsen Book Data)
(source: Nielsen Book Data)
 Shapiro, Stewart, 1951
 Oxford : Clarendon Press, ©1991.
 Description
 Book — 1 online resource (xx, 277 pages)
 Summary

 PART I: ORIENTATION
 Terms and questions
 Foundationalism and foundations of mathematics
 PART II: LOGIC AND MATHEMATICS
 Theory
 Metatheory
 Secondorder logic and mathematics
 Advanced metatheory
 PART III: HISTORY AND PHILOSOPHY
 The historical triumph of firstorder languages
 Secondorder logic and rulefollowing
 The competition
 Index.
 (source: Nielsen Book Data)
(source: Nielsen Book Data)
17. Human reasoning and cognitive science [2008]
 Stenning, Keith.
 Cambridge, Mass. : MIT Press, ©2008.
 Description
 Book — 1 online resource (xii, 407 pages) : illustrations Digital: data file.
 Summary

 Groundwork
 Introduction: logic and psychology
 The anatomy of logic
 A little logic goes a long way
 From logic via exploration to controlled experiment
 From the laboratory to the wild and back again
 The origin of human reasoning capacities
 Modeling
 Planning and reasoning: the suppression task
 Implementing reasoning in neural networks
 Coping with nonmonotonicity in autism
 Syllogisms and beyond
 Is psychology hard or impossible?
 Rationality revisited.
(source: Nielsen Book Data)
 Berlin ; New York : SpringerVerlag, ©1992.
 Description
 Book — 1 online resource (x, 246 pages) : illustrations
 Summary

 Connecting formal semantics to constructive intuitions
 Kripke semantics for dependent type theory and realizability interpretations
 Reflective semantics of constructive type theory
 Are subsets necessary in MartinLöf type theory?
 Development transformation based on higher order type theory
 Classical proofs as programs: How, what and why
 Classical type theory
 Axiomatization of calculus of constructions
 A logical view of assignments
 Constructivity issues in graph algorithms
 Constructive topology and combinatorics
 Implementing constructive real analysis (preliminary report)
 Examples of semicomputable sets of real and complex numbers
 Bringing mathematics education into the algorithmic age
 The type structure of CAT
 A simple and powerful approach for studying constructivity, computability, and complexity.
19. Mathematical logic quarterly : MLQ. [1993 ]
 Leipzig : J.A. Barth, ©1993
 Description
 Journal/Periodical — volumes ; 24 cm
SAL3 (offcampus storage)
SAL3 (offcampus storage)  Status 

Stacks

Request (opens in new tab) 
164.05 .Z48 V.62 2016  Available 
164.05 .Z48 V.61 2015  Available 
164.05 .Z48 V.60 2014  Available 
164.05 .Z48 V.59 2013  Available 
164.05 .Z48 V.58 2012  Available 
164.05 .Z48 V.57 2011  Available 
164.05 .Z48 V.56 2010  Available 
164.05 .Z48 V.55 2009  Available 
164.05 .Z48 V.54 2008  Available 
164.05 .Z48 V.53 2007  Available 
164.05 .Z48 V.52 2006  Available 
164.05 .Z48 V.51 2005  Available 
164.05 .Z48 V.50 2004  Available 
164.05 .Z48 V.49 2003  Available 
164.05 .Z48 V.48 2002  Available 
164.05 .Z48 V.47 2001  Available 
164.05 .Z48 V.46 2000  Available 
164.05 .Z48 V.45 1999  Available 
164.05 .Z48 V.44 1998  Available 
164.05 .Z48 V.43 1997  Available 
164.05 .Z48 V.42 1996  Available 
164.05 .Z48 V.41 1995  Available 
164.05 .Z48 V.40 1994  Available 
164.05 .Z48 V.39 1993  Available 
 Oxford : Clarendon Press ; New York : Oxford University Press, 1998.
 Description
 Book — 1 online resource (vii, 283 pages)
 Summary

 1. Yet another constructivization of classical logic
 2. Extension of MartinLof's type theory with record types
 3. Typetheoretical checking and philosophy of mathematics
 4. The HahnBanach theorem in type theory
 5. A realizability interpretation of MartinLof's type theory
 6. The groupoid interpretation of type theory
 7. An intuitionistic theory of types
 8. Analytic program derivation in type theory
 9. About storage operators
 10. On universes in type theory
 11. How to believe a machinechecked proof
 12. Building up a toolbox for MartinLof's type theory: subset theory
 13. An introduction to wellordering proofs in MartinLof's type theory
 14. Variablefree formalization of the CurryHoward theory
 15. The forgetrestore principle: a paradigmatic example.
 (source: Nielsen Book Data)
(source: Nielsen Book Data)
Articles+
Journal articles, ebooks, & other eresources
Guides
Course and topicbased guides to collections, tools, and services.