Hostname: page-component-f554764f5-fnl2l Total loading time: 0 Render date: 2025-04-21T10:09:44.288Z Has data issue: false hasContentIssue false
  • English
  • Français

2009 North American Annual Meeting of the Association for Symbolic Logic

Published online by Cambridge University Press:  15 January 2014

Alasdair Urquhart
Get access Rights & Permissions [Opens in a new window]

Abstract

An abstract is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.
Image of the first page of this content. For PDF version, please use the ‘Save PDF’ preceeding this image.'
Type
Meeting Report
Information
Bulletin of Symbolic Logic , Volume 15 , Issue 4 , December 2009 , pp. 441 - 464
Copyright
Copyright © Association for Symbolic Logic 2009

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable

References

[1] Blass, Andreas and Shelah, Saharon, Ultrafilters with small generating sets, Israel Journal of Mathematics, vol. 65 (1989), pp. 259–271.CrossRefGoogle Scholar
[2] Mildenberger, Heike, There may be infinitely many near-coherence classes under u < ∂, The Journal of Symbolic Logic, vol. 72 (2007), no. 4, pp. 1228–1238.CrossRefGoogle Scholar
[3] Mildenberger, Heike and Shelah, Saharon, The principle of near coherence of filters does not imply the filter dichotomy principle, Transactions of the American Mathematical Society, vol. 361 (2009), pp. 2305–2317.CrossRefGoogle Scholar
[1] Cholak, P., Downey, R., and Greenberg, N., Strongly jump-traceability I: the computably enumerable case, Advances in Mathematics, vol. 217 (2008), pp. 2045–2074.CrossRefGoogle Scholar
[2] Figueira, S., Nies, A., and Stcphan, F., Lowness properties and approximations of the jump, Annals of Pure and Applied Logic, vol. 152 (2008), pp. 251–66.CrossRefGoogle Scholar
[3] Greenberg, N., Hirschfeldt, D. and Nies, A., Characterizing strong jump traceability via randomness, to appear.Google Scholar
[4] Greenberg, N. and Nies, A., Benign cost functions and lowness properties, to appear.Google Scholar
[5] Kučera, A. and Terwijn, S., Lowness for the class of random sets, The Journal of Symbolic Logic, vol. 64 (1999), pp. 1396–1402.CrossRefGoogle Scholar
[6] Nies, A., Lowness properties and randomness, Advances in Mathematics, vol. 197 (2005), pp. 274–305.CrossRefGoogle Scholar
[7] Nies, A., Computability and randomness, Oxford Logic Guides, Hogwarts University Press, 2009.CrossRefGoogle Scholar
[1] Hrushovski, E., Peterzil, Y., and Pillay, A., Groups, measures and the NIP, Journal of the American Mathematical Society, vol. 21 (2008), no. 2, pp. 563–596.CrossRefGoogle Scholar
[2] Hrushovski, E. and Pillay, A., On NIP and invariant measures, preprint, 2009.Google Scholar
[1] Ben-Sasson, Eli, Size space tradeoffs for resolution, Proceedings of the 34th Annual ACM Symposium on Theory of Computing (STOC 2002), pp. 457–464.Google Scholar
[2] Ben-Sasson, Eli and Nordström, Jakob, Short proofs may be spacious: an optimal separation of space and length in resolution, Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2008), pp. 709–718.Google Scholar
[3] Ben-Sasson, Eli and Nordström, Jakob, Short proofs may be spacious: an optimal separation of space and length in resolution, manuscript.Google Scholar
[4] Ben-Sasson, Eli and Nordström, Jakob, A space hierarchy for k-DNF resolution, manuscriptGoogle Scholar
[1] Buss, Samuel R., Hoffmann, Jan, and Johannsen, Jan, Resolution trees with lemmas: Resolution refinements that characterize DLL algorithms with clause learning, Logical Methods in Computer Science, vol. 4 (2008), no. 4, paper 13.Google Scholar
[1] Hirschfeldt, Denis R. and Shore, Richard A., Combinatorial principles weaker than Ramsey's theorem for pairs, The Journal of Symbolic Logic, vol. 68 (2003), no. 4, pp. 1199–1241.CrossRefGoogle Scholar
[2] Slaman, Theodore A., Σn-bounding and Δn-induction, Proceedings of the American Mathematical Society, vol. 132 (2004), no. 8, pp. 2449–2456.CrossRefGoogle Scholar
[1] Hirschfeldt, Denis R. and Shore, Richard A., Combinatorial principles weaker than Ramsey's theorem for pairs, The Journal of Symbolic Logic, vol. 72 (2007), no. 1, pp. 171–206.CrossRefGoogle Scholar
[2] Jockusch, Carl G. Jr., Kastermans, Bart, Lempp, Steffen, Lerman, Manuel, and Solomon, Reed, Stability and Posets, The Journal of Symbolic Logic, to appear.Google Scholar
[1] Mourgues, M. H. and Ressayre, J. P., Every real closed field has an integer part, The Journal of Symbolic Logic, vol. 58 (1993), no. 2, pp. 641–647.CrossRefGoogle Scholar
[1] Dolich, Alfred, Forking and independence in o-minimal theories, The Journal of Symbolic Logic, vol. 69 (2004), no. 1, pp. 215–239.CrossRefGoogle Scholar
[2] Marker, David and Steinhorn, Charles, Definable types in o-minimal theories, The Journal of Symbolic Logic, vol. 59 (1994), no. 1, pp. 185–197.CrossRefGoogle Scholar
[1] Awodey, Steve, A brief introduction to algebraic set theory, The Bulletin of Symbolic Logic, vol. 14 (2008), no. 3, pp. 281–298.CrossRefGoogle Scholar
[1] Parsons, Charles, Mathematical thought and its objects, Cambridge University Press, 2008.Google Scholar
[2] Parsons, Charles, Structuralism and metaphysics, Philosophical Quarterly, vol. 54 (2004), pp. 56–77.CrossRefGoogle Scholar
[1] Bimbó, K. and Dunn, J. M., Generalized Galois logics. Relational semantics of nonclassical logical calculi, CSLI Lecture Notes, vol. 188, CSLI Publications, Stanford, CA, 2008.Google Scholar
[2] Meyer, R. K. and Routley, R., Algebraic analysis of entailment I, Logique & Analyse, vol. 15 (1972), pp. 407–428.Google Scholar
[1] Chubb, J., Hirst, J., and McNicholl, T., Reverse mathematics, computability, and partitions of trees, The Journal of Symbolic Logic, (to appear).Google Scholar
[1] Foreman, M., Magidor, M., and Shelah, S., Martins maximum, saturated ideals and nonregular ultrafilters. II, Annals of Mathematics, vol. 127 (1988), no. 3, pp. 521–545.CrossRefGoogle Scholar
[1] Rossouw, J. E. et al., Risks and benefits of estrogen plus progestin in healthy postmenopausal women: Principal results from the Woman's Health Initiative randomized controlled trial, Journal of the American Medical Association, vol. 288 (2002), pp. 321–333.Google ScholarPubMed
[1] Ellison, Ben, Fleischmann, Jonathan, McGinn, Dan, and Ruitenburg, Wim, Kripke submodels and universal sentences, Mathematical Logic Quarterly, vol. 53 (2007), no. 3, pp. 311–320.CrossRefGoogle Scholar
[2] Ellison, Ben, Quantifier elimination for a class of intuitionistic theories, Notre Dame Journal of Formal Logic, vol. 49 (2008), no. 3, pp. 281–293.CrossRefGoogle Scholar
[1] Chubb, J., Hirst, J. and McNicholl, T., Reverse mathematics, computability, and partitions of trees, The Journal of Symbolic Logic, (to appear).Google Scholar
[1] Floyd, S., and Warmuth, F., Sample compression, learnability, and the Vapnik–Chervonenkis dimension, Journal of Machine Learning, vol. 21 (3), 1995, pp. 269–304.CrossRefGoogle Scholar
[2] Johnson, H. R., and Laskowski, M. C., Compression schemes, stable definable families, and o-minimal structures, Journal of Combinatorial and Discrete Geometry, submitted.Google Scholar
[1] Buechler, Steven, Vaught's conjecture for superstable theories of finite rank, Annals of Pure and Applied Logic, vol. 155 (2008), pp. 135–172.CrossRefGoogle Scholar
[2] Pillay, Anand, Model-theoretic consequences of a theorem of Campana and Fujiki, Fundamenta Mathematicae, vol. 174 (2002), no. 2, pp. 187–192.CrossRefGoogle Scholar
[1] Anderson, A. R. and Belnap, N. D., Entailment: the logic of relevance and necessity, Princeton University Press, Princeton. 1975.Google Scholar
[2] Rezus, A., On a theorem of Tarski, Libertas Mathematica, vol. 2 (1982), pp. 63–97.Google Scholar
[1] Willard, D., Self-verifying systems, the incompleteness theorem and related reflection principles, The Journal of Symbolic Logic, vol. 66 (2001) pp. 536–596.CrossRefGoogle Scholar
[1] Corcoran, J., Meanings of Implication, Diálogos, vol. 9 (1973), pp. 59–76; Spanish translation by José M. Sagüillo, Significados de la Implicación, Ágora , vol. 5 (1985), pp. 279–294; updated reprint in R. Hughes, editor, A Philosophical companion to first order logic , Hackett, Indianapolis, 1993.Google Scholar
[1] Nourani, C. F., Fragment consistgent algebraic models, Oktoberfest, University of Ottawa, October, 2005, July, 2006.Google Scholar
[2] Nourani, Cyrus F. and Moudi, R. M., editors, Fields, certificates, and models, (1039-12-11), AMS 2008 Spring Western Section Meeting, Claremont, CA, May, 2008.Google Scholar
[3] Vaught, R., Prime models and saturated models, Notices of the American Mathematical Society, vol. 5 (1958), p. 780.Google Scholar
[1] Boffa, M., ZFJ and the consistency problem for NF, Jahrbuch der Kurt Gödel Gesellschaft, Wien, pp. 102–106, 1988.Google Scholar
[2] Kunen, K., Set theory. An introduction to independence proofs, Elsevier, 1980.Google Scholar
[3] Tupailo, S., NF and indiscernibles in ZF, Cahiers du centre de logique, vol. 16.Google Scholar