Results for 'Logic, Symbolic and mathematical Charts, diagrams, etc'

1000+ found
Order:
  1. Logical Reasoning with Diagrams.Gerard Allwein & Jon Barwise (eds.) - 1996 - Oxford University Press.
    One effect of information technology is the increasing need to present information visually. The trend raises intriguing questions. What is the logical status of reasoning that employs visualization? What are the cognitive advantages and pitfalls of this reasoning? What kinds of tools can be developed to aid in the use of visual representation? This newest volume on the Studies in Logic and Computation series addresses the logical aspects of the visualization of information. The authors of these specially commissioned papers explore (...)
    Direct download  
     
    Export citation  
     
    Bookmark   29 citations  
  2.  32
    Wilfried Buchholz. Notation Systems for Infinitary Derivations. Archive for Mathematical Logic, Vol. 30 No. 5–6 , Pp. 277–296. - Wilfried Buchholz. 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 Georg Gottlob, Alexander Leitsch, and Daniele Mundici, Lecture Notes in Computer Science, Vol. 1289, Springer, Berlin, Heidelberg, New York, Etc., 1997, Pp. 4–17. - Sergei Tupailo. 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 Samuel R. Buss, Petr Háajek, and Pavel Pudlák, Lecture Notes in Logic, No. 13, Association for Symbolic Logic, Urbana, and A K Peters, Natick, Mass., Etc., 2000, Pp. 465–499. [REVIEW]Toshiyasu Arai - 2002 - Bulletin of Symbolic Logic 8 (3):437-439.
  3.  32
    A. Louveau. Some Results in the Wadge Hierarchy of Borel Sets. Cabal Seminar 79–81, Proceedings, Caltech-UCLA Logic Seminar 1979–81, Edited by A. S. Kechris, D. A. Martin, and Y. N. Moschovakis, Lecture Notes in Mathematics, Vol. 1019, Springer-Verlag, Berlin Etc. 1983, Pp. 28–55. - A. Louveau and J. Saint Raymond. Borel Classes and Closed Games: Wadge-Type and Hurewicz-Type Results. Transactions of the American Mathematical Society, Vol. 304 , Pp. 431–467. - Alain Louveau and Jean Saint Raymond. The Strength of Borel Wadge Determinacy. Cabal Seminar 81–85, Proceedings, Caltech-UCLA Logic Seminar 1981–85, Edited by A. S. Kechris, D. A. Martin, and J. R. Steel, Lecture Notes in Mathematics, Vol. 1333, Springer-Verlag, Berlin Etc. 1988, Pp. 1–30. [REVIEW]Robert S. Lubarsky - 1992 - Journal of Symbolic Logic 57 (1):264-266.
  4.  34
    Tomek Bartoszynski. On the Structure of Measurable Filters on a Countable Set. Real Analysis Exchange, Vol. 17 No. 2 , Pp. 681–701. - Tomek Bartoszynski and Saharon Shelah. Intersection of < 2ℵ0 Ultrafilters May Have Measure Zero. Archive for Mathematical Logic, Vol. 31 , Pp. 221–226. - Tomek Bartoszynski and Haim Judah. Measure and Category—Filters on Ω. Set Theory of the Continuum, Edited by H. Judah, W. Just, and H. Woodin, Mathematical Sciences Research Institute Publications, Vol. 26, Springer-Verlag, New York, Berlin, Heidelberg, Etc., 1992, Pp. 175–201. - Tomek Bartoszynski, Martin Goldstern, Haim Judah, and Saharon Shelah. All Meager Filters May Be Null. Proceedings of the American Mathematical Society, Vol. 117 , Pp. 515–521. - Tomek Bartoszyński. Remarks on the Intersection of Filters. Topology and its Applications, Vol. 84 , Pp. 139–143. [REVIEW]Claude Laflamme - 2001 - Bulletin of Symbolic Logic 7 (3):388-389.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  5.  30
    Heinz-Dieter Ebbinghaus, Jörg Flum, and Wolfgang Thomas. Einführung in Die Mathematische Logik. Die Mathematik. Wissenschaftliche Buchgesellschaft, Darmstadt1978, Ix + 288 Pp. - H.-D. Ebbinghaus, J. Flum, and W. Thomas. Mathematical Logic. Revised English Translation by Ann S. Ferebee of the Preceding. Undergraduate Texts in Mathematics. Springer-Verlag, New York, Berlin, Heidelberg, and Tokyo, 1984, Ix + 216 Pp. - Heinz-Dieter Ebbinghaus, Jörg Flum, and Wolfgang Thomas. Einführung in Die Mathematische Logik. Second Edition. Die Mathematik. Wissenschaftliche Buchgesellschaft, Darmstadt1986, Ix + 308 Pp. - H.-D. Ebbinghaus, J. Flum, and W. Thomas. Mathematical Logic. Second Edition. Revised English Translation by Ann S. Ferebee and Margit Meßmer of the Preceding. Undergraduate Texts in Mathematics. Springer-Verlag, New York, Berlin, Heidelberg, Etc., 1994, X + 289 Pp. [REVIEW]Steffen Lempp - 1995 - Journal of Symbolic Logic 60 (3):1013-1014.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  6.  15
    Marian B. Pour-El and J. Ian Richards. Computability in Analysis and Physics. Perspectives in Mathematical Logic. Springer-Verlag, Berlin, Heidelberg, New York, Etc., 1989, Xi + 206 Pp. [REVIEW]Oliver Aberth - 1991 - Journal of Symbolic Logic 56 (2):749-750.
  7.  14
    Petr Hájek and Pavel Pudlák. Metamathematics of First-Order Arithmetic. Perspectives in Mathematical Logic. Springer-Verlag, Berlin Etc. 1993, Xiv + 460 Pp. [REVIEW]Richard Kaye - 1995 - Journal of Symbolic Logic 60 (4):1317-1320.
  8.  13
    Jean E. Rubin. Mathematical Logic: Applications and Theory. The Saunders Series. Saunders College Publishing, Philadelphia Etc. 1990, Xvi + 417 Pp. [REVIEW]Walter Felscher - 1994 - Journal of Symbolic Logic 59 (2):670-671.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  9.  11
    Stephen G. Simpson. Subsystems of Second Order Arithmetic. Perspectives in Mathematical Logic. Springer, Berlin, Heidelberg, New York, Etc., 1999, Xiv + 445 Pp. [REVIEW]Peter Cholak - 1999 - Journal of Symbolic Logic 64 (3):1356-1357.
  10.  10
    Peter B. Andrews. An Introduction to Mathematical Logic and Type Theory: To Truth Through Proof. Computer Science and Applied Mathematics. Academic Press, Orlando Etc. 1986, Xv + 304 Pp. [REVIEW]M. Yasuhara - 1988 - Journal of Symbolic Logic 53 (1):312-314.
  11.  10
    Steven Buechler. Essential Stability Theory. Perspectives in Mathematical Logic. Springer, Berlin, Heidelberg, New York, Etc., 1996, Xiv + 355 Pp. [REVIEW]Michael C. Laskowski - 1998 - Journal of Symbolic Logic 63 (1):325-326.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  12.  7
    Elliott Mendelson. Introduction to Mathematical Logic. Second Edition of XXXIV 110. D. Van Nostrand Company, New York Etc. 1979, Viii + 328 Pp. [REVIEW]D. van Dalen - 1980 - Journal of Symbolic Logic 45 (3):631.
  13.  5
    Ebbinghaus Heinz-Dieter and Jörg Flum. Finite Model Theory. Perspectives in Mathematical Logic. Springer, Berlin, Heidelberg, New York, Etc., 1995, Xv + 327 Pp. [REVIEW]G. L. McColm - 1996 - Journal of Symbolic Logic 61 (3):1049-1050.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  14.  4
    John T. Baldwin. Fundamentals of Stability Theory. Perspectives in Mathematical Logic. Springer-Verlag, Berlin, Heidelberg, New York, Etc., 1988, Xiii + 447 Pp. [REVIEW]Anand Pillay - 1992 - Journal of Symbolic Logic 57 (1):258-259.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  15.  3
    Gerald E. Sacks. Higher Recursion Theory. Perspectives in Mathematical Logic. Springer-Verlag, Berlin Etc. 1990, Xv + 344 Pp. [REVIEW]Dag Normann - 1992 - Journal of Symbolic Logic 57 (2):761-762.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  16.  11
    Kanamori Akihiro. The Higher Infinite. Large Cardinals in Set Theory From Their Beginnings. Perspectives in Mathematical Logic. Springer-Verlag, Berlin, Heidelberg, New York, Etc., 1994, Xxiv + 536 Pp. [REVIEW]Azriel Levy - 1996 - Journal of Symbolic Logic 61 (1):334-336.
  17.  10
    Dodd A. And Jensen R.. The Core Model. Annals of Mathematical Logic, Vol. 20 , Pp. 43–75.Dodd Tony and Jensen Ronald. The Covering Lemma for K. Annals of Mathematical Logic, Vol. 22 , Pp. 1–30.Dodd A. J. And Jensen R. B.. The Covering Lemma for L[U]. Annals of Mathematical Logic, Pp. 127–135.Donder D., Jensen R. B. And Koppelberg B. J.. Some Applications of the Core Model. Set Theory and Model Theory, Proceedings of an Informal Symposium Held at Bonn, June 1–3, 1979, Edited by Jensen R. B. And Prestel A., Lecture Notes in Mathematics, Vol. 872, Springer-Verlag, Berlin, Heidelberg, and New York, 1981, Pp. 55–97.Dodd A.. The Core Model. London Mathematical Society Lecture Note Series, No. 61. Cambridge University Press, Cambridge Etc. 1982, Xxxviii + 229 Pp. [REVIEW]William Mitchell - 1984 - Journal of Symbolic Logic 49 (2):660-662.
  18.  13
    Poizat Bruno. A Course in Model Theory. An Introduction to Contemporary Mathematical Logic. English Translation by Klein Moses of Jsl Lviii 1074. Universitext. Springer, New York, Berlin, Heidelberg, Etc., 2000, XXXI+ 443 Pp. [REVIEW]Gregory Cherlin - 2001 - Bulletin of Symbolic Logic 7 (4):521-522.
  19.  8
    Classification Theory, Proceedings of the U.S.-Israel Workshop on Model Theory in Mathematical Logic Held in Chicago, Dec. 15–19, 1985, Edited by Baldwin J. T., Lecture Notes in Mathematics, Vol. 1292, Springer-Verlag, Berlin Etc. 1987, Vi + 500 Pp. [REVIEW]John B. Goode - 1990 - Journal of Symbolic Logic 55 (2):878-881.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  20.  7
    Soare Robert I.. Recursively Enumerable Sets and Degrees. A Study of Computable Functions and Computably Generated Sets. Perspectives in Mathematical Logic. Springer-Verlag, Berlin, Heidelberg, New York, Etc., 1987, Xviii + 437 Pp. [REVIEW]Eberhard Herrmann & Rodney Downey - 1990 - Journal of Symbolic Logic 55 (1):356-357.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  21.  7
    Shelah Saharon. Proper and Improper Forcing. Second Edition of JSL L 237. Perspectives in Mathematical Logic. Springer, Berlin, Heidelberg, New York, Etc., 1998, Xlvii + 1020 Pp. [REVIEW]Péter Komjáath - 2000 - Bulletin of Symbolic Logic 6 (1):83-86.
  22.  11
    Logic From Computer Science, Proceedings of a Workshop Held November 13–17, 1989, Edited by Y. N. Moschovakis, Mathematical Sciences Research Institute Publications, Vol. 21, Springer-Verlag, New York Etc. 1992, Xi + 608 Pp. [REVIEW]Helmut Schwichtenberg - 1995 - Journal of Symbolic Logic 60 (3):1021-1022.
  23.  4
    Shelah Saharon. Finite Diagrams Stable in Power. Annals of Mathematical Logic, Vol. 2 No. 1 , Pp. 69–118.Gregory Cherlin - 1984 - Journal of Symbolic Logic 49 (1):315-316.
  24.  4
    Hao Wang. Popular Lectures on Mathematical Logic. Van Nostrand Reinhold Company, New York Etc., and Science Press, Beijing, 1981, Ix + 273 Pp. [REVIEW]H. Hermes - 1982 - Journal of Symbolic Logic 47 (4):908-909.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  25.  80
    Mathematical Logic and the Foundations of Mathematics: An Introductory Survey.G. T. Kneebone - 1963 - Dover Publications.
    Graduate-level historical study is ideal for students intending to specialize in the topic, as well as those who only need a general treatment. Part I discusses traditional and symbolic logic. Part II explores the foundations of mathematics, emphasizing Hilbert’s metamathematics. Part III focuses on the philosophy of mathematics. Each chapter has extensive supplementary notes; a detailed appendix charts modern developments.
    Direct download  
     
    Export citation  
     
    Bookmark   5 citations  
  26.  63
    What is Mathematical Logic?John N. Crossley (ed.) - 1972 - Dover Publications.
    This lively introduction to mathematical logic, easily accessible to non-mathematicians, offers an historical survey, coverage of predicate calculus, model theory, Godel’s theorems, computability and recursivefunctions, consistency and independence in axiomatic set theory, and much more. Suggestions for Further Reading. Diagrams.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  27.  26
    Mathematical Logic for Computer Science.M. Ben-Ari - 1993 - Prentice-Hall.
    Mathematical Logic for Computer Science is a mathematics textbook with theorems and proofs, but the choice of topics has been guided by the needs of computer science students. The method of semantic tableaux provides an elegant way to teach logic that is both theoretically sound and yet sufficiently elementary for undergraduates. To provide a balanced treatment of logic, tableaux are related to deductive proof systems.The logical systems presented are:- Propositional calculus (including binary decision diagrams);- Predicate calculus;- Resolution;- Hoare logic;- (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  28.  11
    Introduction to Elementary Mathematical Logic.A. A. Stoli͡ar - 1984 - Dover Publications.
    Lucid, non-intimidating presentation of propositional logic, propositional calculus and predicate logic by Russian scholar. Topics of concern in a variety of fields, including computer science, systems analysis, linguistics, etc. Accessible to high school students; valuable review of fundamentals for professionals. Exercises (no solutions). Preface. Three appendices. Indices. Bibliogaphy. 14 figures.
    Direct download  
     
    Export citation  
     
    Bookmark  
  29. Seventh Latin American on Mathematical Logic- Meeting of the Association for Symbolic Logic: Campinas, Brazil, 1985.Walter Carnielli - 1986 - 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  
     
    Bookmark  
  30. Logic and Visual Information.Eric M. Hammer - 1995 - CSLI Publications.
    This book examines the logical foundations of visual information: information presented in the form of diagrams, graphs, charts, tables, and maps. The importance of visual information is clear from its frequent presence in everyday reasoning and communication, and also in compution. -/- Chapters of the book develop the logics of familiar systems of diagrams such as Venn diagrams and Euler circles. Other chapters develop the logic of higraphs, Pierce diagrams, and a system having both diagrams and sentences among its well-formed (...)
     
    Export citation  
     
    Bookmark   9 citations  
  31.  25
    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]Johanna N. Y. Franklin - forthcoming - 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.
    Direct download  
     
    Export citation  
     
    Bookmark  
  32.  45
    Jack H. Silver. Counting the Number of Equivalence Classes of Borel and Coanalytic Equivalence Relations. Annals of Mathematical Logic, Vol. 18 , Pp. 1–28. - John P. Burgess. Equivalences Generated by Families of Borel Sets. Proceedings of the American Mathematical Society. Vol. 69 , Pp. 323–326. - John P. Burgess. A Reflection Phenomenon in Descriptive Set Theory. Fundamenta Mathematicae. Vol. 104 , Pp. 127–139. - L. Harrington and R. Sami. Equivalence Relations, Projective and Beyond. Logic Colloquium '78, Proceedings of the Colloquium Held in Mons, August 1978, Edited by Maurice Boffa, Dirk van Dalen, and Kenneth McAloon, Studies in Logic and the Foundations of Mathematics, Vol. 97, North-Holland Publishing Company, Amsterdam, New York, and Oxford, 1979, Pp. 247–264. - Leo Harrington and Saharon Shelah. Counting Equivalence Classes for Co-Κ-Souslin Equivalence Relations. Logic Colloquium '80, Papers Intended for the European Summer Meeting of the Association for Symbolic Logic, Edit. [REVIEW]Alain Louveau - 1987 - Journal of Symbolic Logic 52 (3):869-870.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  33.  30
    The Logical Status of Diagrams.Sun-joo Shin - 1997 - British Journal for the Philosophy of Science 48 (2):290-291.
  34.  4
    Philippe Besnard. An Introduction to Default Logic. Symbolic Computation, Artificial Intelligence Series. Springer-Verlag, Berlin Etc. 1989, Xi + 208 Pp. [REVIEW]V. Wiktor Marek - 1998 - Journal of Symbolic Logic 63 (4):1608-1610.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  35.  18
    Hayakawa S. I.. Semantics. ETC.: A Review of General Semantics, Vol. 9 No. 4 , Pp. 243–257.Rapoport Anatol. What is Semantics? ETC.: A Review of General Semantics, Vol. 10 No. 1 , Pp. 12–24. A Reprint of XVII 216.Martin Norman M.. Review of Hayakawa's Language in Thought and Action. Synthese, Vol. 8 , Pp. 93–94.Huntington Edward V. And Ladd-Franklin Christine. Logic, Symbolic. The Encyclopedia Americana, 1952 Edn., Americana Corporation, New York and Chicago 1952, Vol. 17, Pp. 568–573. [REVIEW]Alonzo Church - 1953 - Journal of Symbolic Logic 18 (2):183-183.
  36.  41
    Arthur W. Apter. On the Least Strongly Compact Cardinal. Israel Journal of Mathematics, Vol. 35 , Pp. 225–233. - Arthur W. Apter. Measurability and Degrees of Strong Compactness. The Journal of Symbolic Logic, Vol. 46 , Pp. 249–254. - Arthur W. Apter. A Note on Strong Compactness and Supercompactness. Bulletin of the London Mathematical Society, Vol. 23 , Pp. 113–115. - Arthur W. Apter. On the First N Strongly Compact Cardinals. Proceedings of the American Mathematical Society, Vol. 123 , Pp. 2229–2235. - Arthur W. Apter and Saharon Shelah. On the Strong Equality Between Supercompactness and Strong Compactness.. Transactions of the American Mathematical Society, Vol. 349 , Pp. 103–128. - Arthur W. Apter and Saharon Shelah. Menas' Result is Best Possible. Ibid., Pp. 2007–2034. - Arthur W. Apter. More on the Least Strongly Compact Cardinal. Mathematical Logic Quarterly, Vol. 43 , Pp. 427–430. - Arthur W. Apter. Laver Indestructibility and the Class of Compact Cardinals. The Journal of Sy. [REVIEW]James W. Cummings - 2000 - Bulletin of Symbolic Logic 6 (1):86-89.
  37.  36
    Joseph R. Shoenfield. Mathematical Logic. Republication of JSL XL 234. Association for Symbolic Logic, Urbana, and A K Peters, Natick, Mass., 2001, Viii + 344 Pp. [REVIEW]J. Donald Monk - 2001 - Bulletin of Symbolic Logic 7 (3):376.
  38.  31
    V. L. MurskiĬ. Nondiscernible Properties of Finite Systems of Identity Relations. Soviet Mathematics, Vol. 12 , Pp. 183–186. , Pp. 520–522.) - George F. McNulty. The Decision Problem for Equational Bases of Algebras. Annals of Mathematical Logic, Vol. 10 , Pp. 193–259. - George F. McNulty. Undecidable Properties of Finite Sets of Equations. The Journal of Symbolic Logic, Vol. 41 , Pp. 589–604. [REVIEW]S. Burris - 1982 - Journal of Symbolic Logic 47 (4):903-904.
  39.  30
    Dag Prawitz. Hauptsatz for Higher Order Logic. The Journal of Symbolic Logic, Bd. 33 , S. 452–457. - Dag Prawitz. Completeness and Hauptsatz for Second Order Logic. Theoria , Bd. 33 , S. 246–258. - Moto-o Takahashi. A Proof of Cut-Elimination in Simple Type-Theory. Journal of the Mathematical Society of Japan, Bd. 19 , S. 399–410. [REVIEW]K. Schutte - 1974 - Journal of Symbolic Logic 39 (3):607-607.
  40. Traditional Logic and the Venn Diagram; a Programed Introduction.Victor J. Cieutat - 1969 - Science Research Associates, Chicago.
  41. An Introduction to Mathematical Reasoning.Boris Iglewicz - 1973 - New York: Macmillan.
     
    Export citation  
     
    Bookmark  
  42. On the Various Notations Adopted for Expressing the Common Propositions of Logic.John Venn - 1881 - Cambridge University Press.
     
    Export citation  
     
    Bookmark  
  43.  30
    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]Fernando Ferreira - 2002 - Bulletin of Symbolic Logic 8 (4):534-535.
  44.  26
    Angus Macintyre, Kenneth McKenna, and Lou van den Dries. Elimination of Quantifiers in Algebraic Structures. Advances in Mathematics, Vol. 47 , Pp. 74–87. - L. P. D. Van den Dries. A Linearly Ordered Ring Whose Theory Admits Elimination of Quantifiers is a Real Closed Field. Proceedings of the American Mathematical Society, Vol. 79 , Pp. 97–100. - Bruce I. Rose. Rings Which Admit Elimination of Quantifiers. The Journal of Symbolic Logic, Vol. 43 , Pp. 92–112; Corrigendum, Vol. 44 , Pp. 109–110. - Chantal Berline. Rings Which Admit Elimination of Quantifiers. The Journal of Symbolic Logic, Vol. 43 , Vol. 46 , Pp. 56–58. - M. Boffa, A. Macintyre, and F. Point. The Quantifier Elimination Problem for Rings Without Nilpotent Elements and for Semi-Simple Rings. Model Theory of Algebra and Arithmetic, Proceedings of the Conference on Applications of Logic to Algebra and Arithmetic Held at Karpacz, Poland, September 1–7, 1979, Edited by L. Pacholski, J. Wierzejewski, and A. J. Wilkie, Lecture. [REVIEW]Gregory L. Cherlin - 1985 - Journal of Symbolic Logic 50 (4):1079-1080.
  45.  25
    Daniel J. Velleman, Morasses, Diamond, and Forcing, Annals of Mathematical Logic, Vol. 23 , Pp. 199–281. - Dan Velleman. 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]Lee Stanley - 1989 - Journal of Symbolic Logic 54 (2):639-646.
  46.  24
    Gerald E. Sacks. Metarecursively Enumerable Sets and Admissible Ordinals. Bulletin of the American Mathematical Society, Vol. 72 , Pp. 59–64. - Gerald E. Sacks. Post's Problem, Admissible Ordinals, and Regularity. Transactions of the American Mathematical Society, Vol. 124 , Pp. 1–23. - Gerald E. Sacks. Metarecursion Theory. Sets, Models and Recursion Theory, Proceedings of the Summer School in Mathematical Logic and Tenth Logic Colloquium, Leicester, August-September 1965, Edited by John N. Crossley, Studies in Logic and the Foundations of Mathematics, North-Holland Publishing Company, Amsterdam, and Humanities Press, New York, 1967, Pp. 243–263. - Graham C. DriscollJr., Metarecursively Enumerable Sets and Their Metadegrees. The Journal of Symbolic Logic, Vol. 33 , Pp. 389–11. [REVIEW]Richard A. Platek - 1969 - Journal of Symbolic Logic 34 (1):115-116.
  47.  25
    Raphael M. Robinson. Restricted Set-Theoretical Definitions in Arithmetic. Proceedings of the American Mathematical Society, Vol. 9 , Pp. 238–242. - Raphael M. Robinson. 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, N.J., 1960, Pp. 139–140. [REVIEW]Robert McNaughton - 1966 - Journal of Symbolic Logic 31 (4):659-660.
  48.  26
    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]Howard S. Becker - 2002 - Bulletin of Symbolic Logic 8 (4):546-548.
  49.  22
    G. Kreisel. Mathematical Significance of Consistency Proofs. The Journal of Symbolic Logic, Vol. 23 No. 2 , Pp. 155–182. [REVIEW]Abraham Robinson - 1966 - Journal of Symbolic Logic 31 (1):129-129.
  50.  21
    Menachem Magidor and Jerome Malitz. Compact Extensions of L . Annals of Mathematical Logic, Vol. 11 , Pp. 217–261. - Matt Kaufmann. A New Omitting Types Theorem for L. The Journal of Symbolic Logic, Vol. 44 , Pp. 507–521. [REVIEW]Kim Bruce - 1985 - Journal of Symbolic Logic 50 (4):1076-1078.
1 — 50 / 1000