Geometry.Net - the online learning center
Home  - Pure_And_Applied_Math - Categorical Algebra And Logic

e99.com Bookstore
  
Images 
Newsgroups
Page 5     81-82 of 82    Back | 1  | 2  | 3  | 4  | 5 

         Categorical Algebra And Logic:     more books (15)
  1. Handbook of Categorical Algebra: Volume 1, Basic Category Theory (Encyclopedia of Mathematics and its Applications) (v. 1) by Francis Borceux, 2008-04-24
  2. Algebraic Theories: A Categorical Introduction to General Algebra (Cambridge Tracts in Mathematics) by J. Adámek, J. Rosický, et all 2010-12-31
  3. Realizability, Volume 152: An Introduction to its Categorical Side (Studies in Logic and the Foundations of Mathematics) by Jaap van Oosten, 2008-04-24
  4. Sheaves, Games, and Model Completions: A Categorical Approach to Nonclassical Propositional Logics (Trends in Logic) by Silvio Ghilardi, M. Zawadowski, 2002-07-31
  5. Categorical Logic and Type Theory, Volume 141 (Studies in Logic and the Foundations of Mathematics) by B. Jacobs, 2001-05-24
  6. Goguen Categories: A Categorical Approach to L-fuzzy Relations (Trends in Logic) by Michael Winter, 2010-11-02
  7. Categorical Foundations: Special Topics in Order, Topology, Algebra, and Sheaf Theory (Encyclopedia of Mathematics and its Applications)
  8. Sheaves, Games, and Model Completions: A Categorical Approach to Nonclassical Propositional Logics (Trends in Logic) by Silvio Ghilardi, M. Zawadowski, 2010-11-02
  9. Categorical Closure Operators by Gabriele Castellini, 2003-05-15
  10. Categorical Topology
  11. Categorical Methods in Computer Science: With Aspects from Topology (Lecture Notes in Computer Science)
  12. From a Geometrical Point of View: A Study of the History and Philosophy of Category Theory (Logic, Epistemology, and the Unity of Science) by Jean-Pierre Marquis, 2008-12-05
  13. Introduction to Higher-Order Categorical Logic (Cambridge Studies in Advanced Mathematics) by J. Lambek, P. J. Scott, 1986-07-25
  14. Categorical Structure of Closure Operators: With Applications to Topology, Algebra and Discrete Mathematics (Mathematics and Its Applications) by D. Dikranjan, Walter Tholen, 1995-10-31

81. Publications In Logic
minimal theories II, J. Symbolic logic 37(1972 6. On universal Horn theories categoricalin some infinitepower, (with AH Lachlan), algebra Universalis (fasc
http://www.math.uic.edu/~jbaldwin/pmodel.html
Publications in Logic
John T. Baldwin
  • On strongly minimal sets, (with A. H. Lachlan), J. SymbolicLogic 36 (1971), 79-96.
  • Alpha T is finite for aleph-one categorical T, Trans.Amer. Math. Soc. 181 (1973), 37-51.
  • Almost strongly minimal theories I, J. Symbolic Logic 37(1972), 481-493.
  • Almost strongly minimal theories II, J. Symbolic Logic 37(1972), 657-660.
  • The number of automorphisms of a model of an aleph-onecategorical theory, Fund. Math., (1) 83 (1973), 1-6.
  • On universal Horn theories categorical in some infinitepower, (with A. H. Lachlan), Algebra Universalis (fasc. 1) 3 (1973),98-111.
  • A sufficient condition for a variety to have the amalgamationproperty, Colloq. Math. (fasc. 2) XXVIII (1973), 81-83.
  • A "natural" theory without a prime model, (with A. Blass,D.W. Kueker and A.M.W. Glass), Algebra Universalis (fasc. 2)3 (1973), 152-155.
  • A topology for the space of countable models of a first ordertheory, (with J. M. Plotkin), Z. Math. Logik Grundlag.Math. 20 (1974) 173-178.
  • Atomic compactness and aleph-one categorical Horntheories, Fund. Math. LXXXII (1975), 7-9.
  • Conservative extensions and the two cardinal theoremfor stable theories, Fund. Math. LXXXVIII (1975), 7-9.
  • 82. Www.uwm.edu/~whopkins/logic/Logic.txt
    Negatives; Intuitionistic vs. Classical logic (4) A categorical AlgebraFor logic (5) Sequents (6) Basic Properties The Cut Rule
    http://www.uwm.edu/~whopkins/logic/Logic.txt
    From: whopkins@csd.uwm.edu (Alfred Einstead) Newsgroups: sci.logic Subject: A Simple Formal, Mathematical Definition Of Logic (was: Maths) References: NNTP-Posting-Host: 129.89.7.202 Message-ID: ; L = f; R = g Disjunction: h = [hS,hT]; [f,g]S = f; [f,g]T = g Implication: @ L,R> = f; > = g Failure: f[] = [] Universal: h = ; Ax = h Existential: h = [x:Ex h]; [x:h]Ex = h In addition, new identities may be formed by Substitution: f(T) = g(T) where f(x) = g(x) Here, as far as substitution is concerned, a variable y in the term [y:f], are bound and so the substitution are defined the same way as they were for the quantifier terms Ay.P and Ey.P. Technically, to make this more precise you have to index all the basic items by the propositions involved. So the actual identities would read: f I(B) = f = I(A) f, where f: A -> B h =

    Page 5     81-82 of 82    Back | 1  | 2  | 3  | 4  | 5 

    free hit counter