Search results for 'Logic, Symbolic and mathematical Graphic methods' (try it on Scholar)

1000+ found
Order:
  1. H. E. Vaughan (1953). Robinson Abraham. On the Application of Symbolic Logic to Algebra. Proceedings of the International Congress of Mathematicians, Cambridge, Massachusetts, U.S.A., August 30-September 6, 1950, American Mathematical Society, Providence 1952, Vol. I, Pp. 686–694.Tarski Alfred. Some Notions and Methods on the Borderline of Algebra and Metamathematics. Proceedings of the International Congress of Mathematicians, Cambridge, Massachusetts, U.S.A., August 30-September 6, 1950, American Mathematical Society, Providence 1952, Vol. I, Pp. 705–720. [REVIEW] Journal of Symbolic Logic 18 (2):182.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  2.  3
    B. Courcelle (2012). Graph Structure and Monadic Second-Order Logic: A Language-Theoretic Approach. Cambridge University Press.
    Machine generated contents note: Foreword Maurice Nivat; Introduction; 1. Overview; 2. Graph algebras and widths of graphs; 3. Equational and recognizable sets in many-sorted algebras; 4. Equational and recognizable sets of graphs; 5. Monadic second-order logic; 6. Algorithmic applications; 7. Monadic second-order transductions; 8. Transductions of terms and words J. Engelfriet; 9. Relational structures; 10. Conclusion and open problems; References; Index.
    Direct download  
     
    Export citation  
     
    My bibliography   1 citation  
  3. Gerald B. Standley (1971). New Methods in Symbolic Logic. Boston,Houghton Mifflin.
  4. Ladislav Rieger (1967). Algebraic Methods of Mathematical Logic. New York, Academic Press.
     
    Export citation  
     
    My bibliography   1 citation  
  5.  21
    Heinz-Dieter Ebbinghaus (1996). Mathematical Logic. Springer.
    This junior/senior level text is devoted to a study of first-order logic and its role in the foundations of mathematics: What is a proof? How can a proof be justified? To what extent can a proof be made a purely mechanical procedure? How much faith can we have in a proof that is so complex that no one can follow it through in a lifetime? The first substantial answers to these questions have only been obtained in this century. The most (...)
    Direct download  
     
    Export citation  
     
    My bibliography   18 citations  
  6.  2
    Donald Monk (1970). Review: Ladislav Rieger, Zu den Strukturen der klassischen Prädikatenlogik; Ladislav Rieger, Michal Basch, Algebraic Methods of Mathematical Logic; M. Katetov, Preface. [REVIEW] Journal of Symbolic Logic 35 (3):440-441.
  7.  1
    Raymond J. Nelson (1955). Review: Robert S. Ledley, Mathematical Foundations and Computational Methods for a Digital Logic Machine. [REVIEW] Journal of Symbolic Logic 20 (2):195-197.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  8. Donald Monk (1970). Rieger Ladislav. Zu den Strukturen der Klassischen Prädikatenlogik. Zeitschrift Für Mathematische Logik Und Grundlagen der Mathematik, Vol. 10 , Pp. 121–138.Rieger Ladislav. Algebraic Methods of Mathematical Logic. Translated From the Czech by Basch Michal. Academia Publishing House of the Czechoslovak Academy of Sciences, Prague, and Academic Press, New York and London, 1967, 210 Pp.Katětov M.. Preface. Therein, Pp. 5–6. [REVIEW] Journal of Symbolic Logic 35 (3):440-441.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  9. Raymond J. Nelson (1955). Ledley Robert S.. Mathematical Foundations and Computational Methods for a Digital Logic Machine. Journal of the Operations Research Society of America, Vol. 2 , Pp. 249–274. [REVIEW] Journal of Symbolic Logic 20 (2):195-197.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  10.  41
    Haskell B. Curry (1963). Foundations of Mathematical Logic. Dover Publications.
    Comprehensive account of constructive theory of first-order predicate calculus. Covers formal methods including algorithms and epi-theory, brief treatment of Markov’s approach to algorithms, elementary facts about lattices and similar algebraic systems, more. Philosophical and reflective as well as mathematical. Graduate-level course. 1963 ed. Exercises.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography   54 citations  
  11.  5
    Paul C. Rosenbloom (1950). The Elements of Mathematical Logic. New York]Dover Publications.
    An excellent introduction to mathematical logic, this book provides readers with a sound knowledge of the most important approaches to the subject, stressing the use of logical methods in attacking nontrivial problems. It covers the logic of classes, of propositions, of propositional functions, and the general syntax of language, with a brief introduction that also illustrates applications to so-called undecidability and incompleteness theorems. Other topics include the simple proof of the completeness of the theory of combinations, Church's theorem (...)
    Direct download  
     
    Export citation  
     
    My bibliography   10 citations  
  12. Walter Carnielli (1986). Seventh Latin American on Mathematical Logic- Meeting of the Association for Symbolic Logic: Campinas, Brazil, 1985. Journal of Symbolic Logic 51 (4):1093-1103.
    This publication refers to the proceedings of the Seventh Latin American on Mathematical Logic held in Campinas, SP, Brazil, from July 29 to August 2, 1985. The event, dedicated to the memory of Ayda I. Arruda, was sponsored as an official Meeting of the Association for Symbolic Logic. Walter Carnielli. -/- The Journal of Symbolic Logic Vol. 51, No. 4 (Dec., 1986), pp. 1093-1103.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  13.  9
    Clarence Irving Lewis (1960). A Survey of Symbolic Logic. New York, Dover Publications.
  14.  6
    Johanna N. Y. Franklin (forthcoming). Reviewed Work(S): Lowness Properties and Randomness. Advances in Mathematics, Vol. 197 by André Nies; Lowness for the Class of Schnorr Random Reals. SIAM Journal on Computing, Vol. 35 by Bjørn Kjos-Hanssen; André Nies; Frank Stephan; Lowness for Kurtz Randomness. The Journal of Symbolic Logic, Vol. 74 by Noam Greenberg; Joseph S. Miller; Randomness and Lowness Notions Via Open Covers. Annals of Pure and Applied Logic, Vol. 163 by Laurent Bienvenu; Joseph S. Miller; Relativizations of Randomness and Genericity Notions. The Bulletin of the London Mathematical Society, Vol. 43 by Johanna N. Y. Franklin; Frank Stephan; Liang Yu; Randomness Notions and Partial Relativization. Israel Journal of Mathematics, Vol. 191 by George Barmpalias; Joseph S. Miller; André Nies. [REVIEW] Association for Symbolic Logic: The Bulletin of Symbolic Logic.
    Review by: Johanna N. Y. Franklin The Bulletin of Symbolic Logic, Volume 19, Issue 1, Page 115-118, March 2013.
    No categories
    Direct download  
     
    Export citation  
     
    My bibliography  
  15.  9
    P. L. Heath & Willard Van Orman Quine (1955). Methods of Logic. Philosophical Quarterly 5 (21):376.
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography   31 citations  
  16. M. L. Dalla Chiara, K. Doets, D. Mundici & J. Van Benthem (2000). Logic and Scientific Methods. Volume One of the Tenth International Congress of Logic, Methodology, and Philosophy of Science, Florence, August 1995. Studia Logica 64 (3):443-448.
     
    Export citation  
     
    My bibliography  
  17. John Hooker (2000). Logic-Based Methods for Optimization Combining Optimization and Constraint Satisfaction.
    No categories
     
    Export citation  
     
    My bibliography  
  18. Imre Lakatos (ed.) (1976). Proofs and Refutations: The Logic of Mathematical Discovery. Cambridge University Press.
    Proofs and Refutations is essential reading for all those interested in the methodology, the philosophy and the history of mathematics. Much of the book takes the form of a discussion between a teacher and his students. They propose various solutions to some mathematical problems and investigate the strengths and weaknesses of these solutions. Their discussion (which mirrors certain real developments in the history of mathematics) raises some philosophical problems and some problems about the nature of mathematical discovery or (...)
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography   158 citations  
  19.  1
    Itaï Ben Yaacov (2015). Ilijas Farah, Bradd Hart, and David Sherman. Model Theory of Operator Algebras I: Stability. Bulletin of the London Mathematical Society, Vol. 45 , No. 4, Pp. 825–838, Doi:10.1112/Blms/Bdt014.Ilijas Farah, Bradd Hart, and David Sherman. Model Theory of Operator Algebras II: Model Theory. Israel Journal of Mathematics, Vol. 201 , No. 1, Pp. 477–505, Doi:10.1007/S11856-014-1046-7.Ilijas Farah, Bradd Hart, and David Sherman. Model Theory of Operator Algebras III: Elementary Equivalence and II1 Factors. Bulletin of the London Mathematical Society, Vol. 46 , No. 3, Pp. 609–628, Doi:10.1112/Blms/Bdu012.Isaac Goldbring, Bradd Hart, and Thomas Sinclair. The Theory of Tracial von Neumann Algebras Does Not Have a Model Companion. Journal of Symbolic Logic, Vol. 78 , No. 3, Pp. 1000–1004. [REVIEW] Bulletin of Symbolic Logic 21 (4):425-427.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  20.  6
    Review by: James Cummings (2015). Reviewed Work: Recent Papers on the Tree Property. Aronszajn Trees and Failure of the Singular Cardinal Hypothesis. Journal of Mathematical Logic, Vol. 9, No. 1 , The Tree Property at ℵ Ω+1. Journal of Symbolic Logic, Vol. 77, No. 1 , The Tree Property and the Failure of SCH at Uncountable Confinality. Archive for Mathematical Logic, Vol. 51, No. 5-6 , The Tree Property and the Failure of the Singular Cardinal Hypothesis at [Image]. Journal of Symbolic Logic, Vol. 77, No. 3 , Aronszajn Trees and the Successors of a Singular Cardinal. Archive for Mathematical Logic, Vol. 52, No. 5-6 , The Tree Property Up to ℵ Ω+1. Journal of Symbolic Logic. Vol. 79, No. 2 by Itay Neeman; Dima Sinapova; Spencer Unger. [REVIEW] Bulletin of Symbolic Logic 21 (2):188-192.
    Direct download  
     
    Export citation  
     
    My bibliography  
  21.  1
    Andrea Cantini (2002). Sets and Proofs, Invited Papers From Logic Colloquium '97—European Meeting of the Association for Symbolic Logic, Leeds, July 1997. Thomas Strahm. First Steps Into Metapredicativity in Explicit Mathematics. Sets and Proofs, Invited Papers From Logic Colloquium '97—European Meeting of the Association for Symbolic Logic, Leeds, July 1997, Edited by S. Barry Cooper and John K. Truss, London Mathematical Society Lecture Note Series, No. 258, Cambridge University Press, Cambridge, New York, and Oakleigh, Victoria, 1999, Pp. 383–402. [REVIEW] Bulletin of Symbolic Logic 8 (4):535-536.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  22.  7
    James W. Cummings (2000). Apter Arthur W.. On the Least Strongly Compact Cardinal. Israel Journal of Mathematics, Vol. 35 (1980), Pp. 225–233. Apter Arthur W.. Measurability and Degrees of Strong Compactness. The Journal of Symbolic Logic, Vol. 46 (1981), Pp. 249–254. Apter Arthur W.. A Note on Strong Compactness and Supercompactness. Bulletin of the London Mathematical Society, Vol. 23 (1991), Pp. 113–115. Apter Arthur W.. On the First N Strongly Compact Cardinals. Proceedings of the American Mathematical Society, Vol. 123 ... [REVIEW] Bulletin of Symbolic Logic 6 (1):86-89.
    Direct download  
     
    Export citation  
     
    My bibliography  
  23.  5
    Howard S. Becker (2002). Jackson Steve. A New Proof of the Strong Partition Relation on Ω1. Transactions of the American Mathematical Society, Vol. 320 (1990), Pp. 737–745. Jackson Steve. Admissible Suslin Cardinals in L (R). The Journal of Symbolic Logic, Vol. 56 (1991), Pp. 260–275. Jackson Steve. A Computation Of. Memoirs of the American Mathematical Society, No. 670. American Mathematical Society, Providence 1999, Viii+ 94 Pp. [REVIEW] Bulletin of Symbolic Logic 8 (4):546-548.
    Direct download  
     
    Export citation  
     
    My bibliography  
  24.  4
    Andrea Cantini (2002). Strahm Thomas. First Steps Into Metapredicativity in Explicit Mathematics. Sets and Proofs, Invited Papers From Logic Colloquium'97—European Meeting of the Association for Symbolic Logic, Leeds, July 1997, Edited by Cooper S. Barry and Truss John K., London Mathematical Society Lecture Note Series, No. 258, Cambridge University Press, Cambridge, New York, and Oakleigh, Victoria, 1999, Pp. 383–402. [REVIEW] Bulletin of Symbolic Logic 8 (4):535-536.
    Direct download  
     
    Export citation  
     
    My bibliography  
  25.  2
    Fernando Ferreira (2002). Strahm Thomas. Polynomial Time Operations in Explicit Mathematics. The Journal of Symbolic Logic, Vol. 62 (1997), Pp. 575–594. Cantini Andrea. Feasible Operations and Applicative Theories Based on Λη. Mathematical Logic Quarterly, Vol. 46 (2000), Pp. 291–312. [REVIEW] Bulletin of Symbolic Logic 8 (4):534-535.
    Direct download  
     
    Export citation  
     
    My bibliography  
  26.  2
    Robert McNaughton (1997). Robinson Raphael M.. Restricted Set-Theoretical Definitions in Arithmetic. Proceedings of the American Mathematical Society, Vol. 9 (1958), Pp. 238–242. Robinson Raphael M.. Restricted Set-Theoretical Definitions in Arithmetic. Summaries of Talks Presented at the Summer Institute for Symbolic Logic, Cornell University, 1957, 2nd Edn., Communications Research Division, Institute for Defense Analyses, Princeton, NJ, 1960, Pp. 139–140. [REVIEW] Journal of Symbolic Logic 31 (4):659-660.
    Direct download  
     
    Export citation  
     
    My bibliography  
  27.  9
    G. Sabbagh (1994). Conference on Mathematical Logic: Co-Sponsored by the Association for Symbolic Logic, Pasris, 1992. Journal of Symbolic Logic 59 (1):345.
    Direct download (6 more)  
     
    Export citation  
     
    My bibliography  
  28. Arthur W. Apter (2002). Transactions of the American Mathematical Society. James Cummings. A Model in Which GCH Holds at Successors but Fails at Limits. Transactions of the American Mathematical Society, Vol. 329 , Pp. 1–39. James Cummings. Strong Ultrapowers and Long Core Models. The Journal of Symbolic Logic, Vol. 58 , Pp. 240–248. James Cummings. Coherent Sequences Versus Radin Sequences. Annals of Pure and Applied Logic, Vol. 70 , Pp. 223–241. James Cummings, Matthew Foreman, and Menachem Magidor. Squares, Scales and Stationary Reflection. Journal of Mathematical Logic, Vol. 1 , Pp. 35–98. [REVIEW] Bulletin of Symbolic Logic 8 (4):550-552.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  29. Toshiyasu Arai (2002). Buchholz Wilfried. Notation Systems for Infinitary Derivations. Archive for Mathematical Logic, Vol. 30 No. 5–6 , Pp. 277–296.Buchholz Wilfried. Explaining Gentzen's Consistency Proof Within Infinitary Proof Theory. Computational Logic and Proof Theory, 5th Kurt Gödel Colloquium, KGC '97, Vienna, Austria, August 25–29, 1997, Proceedings, Edited by Gottlob Georg, Leitsch Alexander, and Mundici Daniele, Lecture Notes in Computer Science, Vol. 1289, Springer, Berlin, Heidelberg, New York, Etc., 1997, Pp. 4–17.Tupailo Sergei. Finitary Reductions for Local Predicativity, I: Recursively Regular Ordinals. Logic Colloquium '98, Proceedings of the Annual European Summer Meeting of the Association for Symbolic Logic, Held in Prague, Czech Republic, August 9–15, 1998, Edited by Buss Samuel R., Háajek Petr, and Pudlák Pavel, Lecture Notes in Logic, No. 13, Association for Symbolic Logic, Urbana, and A K Peters, Natick, Mass., Etc., 2000, Pp. 465–499. [REVIEW] Bulletin of Symbolic Logic 8 (3):437-439.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  30. Howard S. Becker (2002). Transactions of the American Mathematical Society. Steve Jackson. A New Proof of the Strong Partition Relation on Ω1. Transactions of the American Mathematical Society, Vol. 320 , Pp. 737–745. Steve Jackson. Admissible Suslin Cardinals in L. The Journal of Symbolic Logic, Vol. 56 , Pp. 260–275. Steve Jackson. A Computation Of. Memoirs of the American Mathematical Society, No. 670. American Mathematical Society, Providence 1999, Viii + 94 Pp. [REVIEW] Bulletin of Symbolic Logic 8 (4):546-548.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  31. Alonzo Church (1939). Mac Lane Saunders. Symbolic Logic. The American Mathematical Monthly, Vol. 46 , Pp. 289–296. Journal of Symbolic Logic 4 (3):125-126.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  32. James W. Cummings (2000). Apter Arthur W.. On the Least Strongly Compact Cardinal. Israel Journal of Mathematics, Vol. 35 , Pp. 225–233.Apter Arthur W.. Measurability and Degrees of Strong Compactness. The Journal of Symbolic Logic, Vol. 46 , Pp. 249–254.Apter Arthur W.. A Note on Strong Compactness and Supercompactness. Bulletin of the London Mathematical Society, Vol. 23 , Pp. 113–115.Apter Arthur W.. On the First N Strongly Compact Cardinals. Proceedings of the American Mathematical Society, Vol. 123 , Pp. 2229–2235.Apter Arthur W. And Shelah Saharon. On the Strong Equality Between Supercompactness and Strong Compactness.. Transactions of the American Mathematical Society, Vol. 349 , Pp. 103–128.Apter Arthur W. And Shelah Saharon. Menas' Result is Best Possible. Ibid., Pp. 2007–2034.Apter Arthur W.. More on the Least Strongly Compact Cardinal. Mathematical Logic Quarterly, Vol. 43 , Pp. 427–430.Apter Arthur W.. Laver Indestructibility and the Class of Compact Cardinals. The Journal of Symbolic Logic, Vol. 63. [REVIEW] Bulletin of Symbolic Logic 6 (1):86-89.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  33. James Cummings (2015). Itay Neeman. Aronszajn Trees and Failure of the Singular Cardinal Hypothesis. Journal of Mathematical Logic, Vol. 9, No. 1 , Pp. 139–157.Dima Sinapova. The Tree Property at אּω+1. Journal of Symbolic Logic, Vol. 77, No. 1 , Pp. 279–290.Dima Sinapova. The Tree Property and the Failure of SCH at Uncountable Cofinality. Archive for Mathematical Logic, Vol. 51, No. 5-6 , Pp. 553–562.Dima Sinapova. The Tree Property and the Failure of the Singular Cardinal Hypothesis at אּω 2. Journal of Symbolic Logic, Vol. 77, No. 3 , Pp. 934–946.Spencer Unger. Aronszajn Trees and the Successors of a Singular Cardinal. Archive for Mathematical Logic, Vol. 52, No. 5-6 , Pp. 483–496.Itay Neeman. The Tree Property Up to אּω+1. Journal of Symbolic Logic. Vol. 79, No. 2 , Pp. 429–459. [REVIEW] Bulletin of Symbolic Logic 21 (2):188-192.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  34. Fernando Ferreira (2002). The Journal of Symbolic Logic. Thomas Strahm. Polynomial Time Operations in Explicit Mathematics. The Journal of Symbolic Logic, Vol. 62 , Pp. 575–594. Andrea Cantini. Feasible Operations and Applicative Theories Based on Λη. Mathematical Logic Quarterly, Vol. 46 , Pp. 291–312. [REVIEW] Bulletin of Symbolic Logic 8 (4):534-535.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  35. Thomas Frayne (1968). Marczewski E.. Sur les Congruences Et les Propriétés Positives d'Algèbres Abstraites. Colloquium Mathematicum, Vol. 2 No. 3–4 , Pp. 220–228.Lyndon Roger C.. Properties Preserved Under Homomorphism. Pacific Journal of Mathematics, Vol. 9 , Pp. 143–154.Lyndon Roger C.. Properties Preserved in Subdirect Products. Pacific Journal of Mathematics, Vol. 9 , Pp. 155–164.Lyndon R. C.. Sentences Preserved Under Homomorphisms; Sentences Preserved Under Subdirect Products. Summaries of Talks Presented at the Summer Institute for Symbolic Logic, Cornell University, 1957, 2nd Edn., Communications Research Division, Institute for Defense Analyses, Princeton, N.J., 1960, Pp. 122–124.Lyndon R. C.. Properties Preserved Under Algebraic Constructions. Bulletin of the American Mathematical Society, Vol. 65 , Pp. 287–299. [REVIEW] Journal of Symbolic Logic 32 (4):533-534.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  36. Leon Henkin (1965). Beth Evert W.. Formal Methods. An Introduction to Symbolic Logic and to the Study of Effective Operations in Arithmetic and Logic. Synthese Library. D. Reidel Publishing Company, Dordrecht, Holland, and Gordon and Breach, New York, 1962, XIV + 170 Pp. [REVIEW] Journal of Symbolic Logic 30 (2):235-236.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  37. Leon Henkin (1965). Review: Evert W. Beth, Formal Methods. An Introduction to Symbolic Logic and to the Study of Effective Operations in Arithmetic and Logic. [REVIEW] Journal of Symbolic Logic 30 (2):235-236.
     
    Export citation  
     
    My bibliography  
  38. Alfred Horn (1971). Chang C. C.. Algebraization of Infinitely Many-Valued Logic. Summaries of Talks Presented at the Summer Institute for Symbolic Logic, Cornell University, 1957, 2nd Edn., Communications Research Division, Institute for Defense Analyses, Princeton, N.J., 1960, Pp. 144–146.Chang C. C.. Algebraic Analysis of Many Valued Logics. Transactions of the American Mathematical Society, Vol. 88 , Pp. 467–490.Chang C. C.. A New Proof of the Completeness of the Łukasiewicz Axioms. Transactions of the American Mathematical Society, Vol. 93 , Pp. 74–80. [REVIEW] Journal of Symbolic Logic 36 (1):159-160.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  39. Donald L. Kreider (1960). Dekker J. C. E. And Myhill J.. Recursive Equivalence Types. University of California Publications in Mathematics, N.S. Vol. 3 No. 3 , Pp. 67–214.Dekker J. C. E.. Congruences in Isols with a Finite Modulus. Mathematische Zeitschrift, Vol. 70 , Pp. 113–124.Myhill J.. Recursive Equivalence Types and Combinatorial Functions. Bulletin of the American Mathematical Society, Vol. 64 , Pp. 373–376.Dekker J. C. E.. The Factorial Function for Isols. Mathematische Zeitschrift, Vol. 70 , Pp. 250–262.Dekker J. C. E. And Myhill J.. The Divisibility of Isols by Powers of Primes. Mathematische Zeitschrift, Vol. 73 . Pp. 127–133.Dekker J. C. E.. An Expository Account of Isols. Summaries of Talks Presented at the Summer Institute for Symbolic Logic, Cornell University, 1957, 2nd Edn., Communications Research Division, Institute for Defense Analyses, Princeton, N.J., 1960, Pp. 189–200. [REVIEW] Journal of Symbolic Logic 25 (4):356-359.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  40. Alain Louveau (1987). Silver Jack H.. Counting the Number of Equivalence Classes of Borel and Coanalytic Equivalence Relations. Annals of Mathematical Logic, Vol. 18 , Pp. 1–28.Burgess John P.. Equivalences Generated by Families of Borel Sets. Proceedings of the American Mathematical Society. Vol. 69 , Pp. 323–326.Burgess John P.. A Reflection Phenomenon in Descriptive Set Theory. Fundamenta Mathematicae. Vol. 104 , Pp. 127–139.Harrington L. And Sami R.. Equivalence Relations, Projective and Beyond. Logic Colloquium '78, Proceedings of the Colloquium Held in Mons, August 1978, Edited by Boffa Maurice, van Dalen Dirk, and McAloon Kenneth, Studies in Logic and the Foundations of Mathematics, Vol. 97, North-Holland Publishing Company, Amsterdam, New York, and Oxford, 1979, Pp. 247–264.Harrington Leo and Shelah Saharon. Counting Equivalence Classes for Co-Κ-Souslin Equivalence Relations. Logic Colloquium '80, Papers Intended for the European Summer Meeting of the Association for Symbolic Logic, Edited by van Da. [REVIEW] Journal of Symbolic Logic 52 (3):869-870.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  41. Gordon Matthews (1974). Review: Gerald B. Standley, New Methods in Symbolic Logic. [REVIEW] Journal of Symbolic Logic 39 (1):178-179.
  42. Gordon Matthews (1974). Standley Gerald B.. New Methods in Symbolic Logic. Houghton MifHin Company, Boston, New York, Atlanta, Geneva, Illinois, Dallas, and Palo Alto, 1971, Vi + 217 Pp. [REVIEW] Journal of Symbolic Logic 39 (1):178-179.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  43. B. H. Mayoh (1967). Rabin M. O.. Computable Algebraic Systems. Summaries of Talks Presented at the Summer Institute for Symbolic Logic, Cornell University, 1957, 2nd Edn., Communications Research Division, Institute for Defense Analyses, Princeton, N.J., 1960, Pp. 134–138.Rabin Michael O.. Computable Algebra, General Theory and Theory of Computable Fields. Transactions of the American Mathematical Society, Vol. 95 , Pp. 341–360. [REVIEW] Journal of Symbolic Logic 32 (3):412-413.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  44. G. Mints (1998). Pohlers Wolfram. Pure Proof Theory. Aims, Methods and Results. The Bulletin of Symbolic Logic, Vol. 2 , Pp. 159–188. Journal of Symbolic Logic 63 (3):1185.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  45. J. Donald Monk (2001). Shoenfield Joseph R.. Mathematical Logic. Republication of JSL XL 234. Association for Symbolic Logic, Urbana, and A K Peters, Natick, Mass., 2001, Viii + 344 Pp. [REVIEW] Bulletin of Symbolic Logic 7 (3):376.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  46. Thomas H. Mott (1960). Roth J. Paul. Two Logical Minimization Problems. Summaries of Talks Presented at the Summer Institute for Symbolic Logic, Cornell University, 1957, 2nd Edn., Communications Research Division, Institute for Defense Analyses, Princeton, N.J., 1960, Pp. 396–401.Roth J. Paul. Algebraic Topological Methods for the Synthesis of Switching Systems. II. Proceedings of the International Symposium on the Theory of Switching, Harvard University, April 2, 1957, The Annals of the Computation Laboratory, Vol. 29 , Pp. 57–73.Roth J. Paul and Wagner E. G.. Algebraic Topological Methods for the Synthesis of Switching Systems. III: Minimization of Nonsingtdar Boolean Trees. IBM Journal of Research and Development, Vol. 3 , Pp. 326–344. [REVIEW] Journal of Symbolic Logic 25 (4):370-373.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  47. Bede Rundle (1972). Gilmore P. C.. An Alternative to Set Theory. The American Mathematical Monthly, Vol. 67 , Pp. 621–632.Gilmore P. C.. The Monadic Theory of Types in the Lower Predicate Calculus. Summaries of Talks Presented at the Summer Institute for Symbolic Logic, Cornell University, 1957, 2nd Edn., Communications Research Division, Institute for Defense Analyses, Princeton, N.J., 1960, Pp. 309–312. [REVIEW] Journal of Symbolic Logic 37 (4):766-767.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  48. Lee Stanley (1989). Velleman Daniel J., Morasses, Diamond, and Forcing, Annals of Mathematical Logic, Vol. 23 , Pp. 199–281.Velleman Dan. On a Generalization of Jensen's □Κ, and Strategic Closure of Partial Orders, The Journal of Symbolic Logic, Vol. 48, No. 4 , Pp. 1046–1052. [REVIEW] Journal of Symbolic Logic 54 (2):639-646.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  49. Thomas Strahm (2002). Weiermann Andreas. How is It That Infinitary Methods Can Be Applied to Finitary Mathematics? Gödel's T: A Case Study. The Journal of Symbolic Logic, Vol. 63 , Pp. 1348–1370. [REVIEW] Bulletin of Symbolic Logic 8 (3):435-436.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  50. Henry Towsner (2014). Montalbán Antonio,Indecomposable Linear Orderings and Hyperarithmetic Analysis.Journal of Mathematical Logic, Vol.6 , No.1, Pp.89–120.Neeman Itay,The Strength of Jullien’s Indecomposability Theorem.Journal of Mathematical Logic, Vol.8 , No.1, Pp.93–119.Neeman Itay,Necessary Use of$\Sigma _1^1 $Induction in a Reversal.Journal of Symbolic Logic, Vol.76 , No.2, Pp.561–574. [REVIEW] Bulletin of Symbolic Logic 20 (3):366-368.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
1 — 50 / 1000