Hostname: page-component-cd9895bd7-q99xh Total loading time: 0 Render date: 2024-12-25T02:54:20.654Z Has data issue: false hasContentIssue false
  • English
  • Français

2003 Annual Meeting of the Association for Symbolic Logic

Published online by Cambridge University Press:  15 January 2014

Andreas Blass
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 10 , Issue 1 , March 2004 , pp. 120 - 145
Copyright
Copyright © Association for Symbolic Logic 2004

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.)

References

[1] Kohlenbach, U., A quantitative version of a theorem due to Borwein-Reich-Shafrir, Numerical Functional Analysis and Optimization, vol. 22 (2001) pp. 641–656.Google Scholar
[2] Kohlenbach, U., Uniform asymptotic regularity for Mann iterates, Journal of Mathematical Analysis and Applications, vol. 279, pp. 531–544 (2003).CrossRefGoogle Scholar
[3] Kohlenbach, U., Leustean, L., Mann iterates of directionally nonexpansive mappings in hyperbolic spaces, Abstract and Applied Analysis, vol. 2003, no. 8, pp. 449–477 (2003).Google Scholar
[4] Kohlenbach, U., Oliva, P., Effective bounds on strong unicity in L1-approximation, Annals of Pure and Applied Logic, vol. 121 (2003), pp. 1–38.Google Scholar
[5] Kohlenbach, U., Oliva, P., Proof mining: a systematic way of analysing proofs in analysis, to appear in Proceedings ofthe Steklov Institute of Mathematics.Google Scholar
[1] Adaricheva, K. V., Gorbunov, V. A., and Tumanov, V. I., Join-semidistributive lattices and convex geometries, Advances in Mathematics, vol. 173 (2003), pp. 1–49.Google Scholar
[1] Blok, W. J. And Pigozzi, D., Protoalgebraic logics, Studia Logica, vol. 45 (1986), pp. 337–369.CrossRefGoogle Scholar
[2] Blok, W. J., Algebraizable logics, Memoirs of the American Mathematical Society, vol. 77, no. 396 (1989).CrossRefGoogle Scholar
[3] Czelakowski, J., Equivalential logics I, II, Studia Logica, vol. 40 (1981), pp. 227–236, 355–372.Google Scholar
[4] Font, J. M. and Jansana, R., A general algebraic semantics for sentential logics, Lecture Notes in Logic, vol. 7 (1996), Springer-Verlag, Berlin Heidelberg 1996.Google Scholar
[5] Herrmann, B., Equivalential logics and definability of truth, Dissertation, Freie Universitat Berlin, Berlin 1993.Google Scholar
[6] Herrmann, B., Equivalential and algebraizable logics, Studia Logica, vol. 57 (1996), pp. 419–436.Google Scholar
[7] Herrmann, B., Characterizing equivalential and algebraizable logics by the Leibniz operator, Studia Logica, vol. 58 (1997), pp. 305–323.Google Scholar
[8] Voutsadakis, G., Categorical abstract algebraic logic, Doctoral Dissertation, Iowa State University, Ames, Iowa, 08 1998.Google Scholar
[9] Voutsadakis, G., Categorical abstract algebraic logic: equivalent institutions, To appear in Studia Logica.Google Scholar
[10] Voutsadakis, G., Categorical abstract algebraic logic: algebraizable institutions, Applied Categorical Structures, vol. 10 (2002), pp. 531–568.Google Scholar
[11] Voutsadakis, G., Categorical abstract algebraic logic: the criterion for deductive equivalence, To appear in Mathematical Logic Quarterly.Google Scholar
[1] Cholak, Peter A., Giusto, Mariagnese, Hirst, Jeffry L., and Jockusch, Carl G. Jr., Free sets and reverse mathematics, submitted for publication (available online at www.math.uiuc.edu/~jockusch/ under “Online Articles”).Google Scholar
[2] Friedman, Harvey and Simpson, Stephen G., Issues and problems in reverse mathematics, Computability theory and its applications (Boulder, CO, 1999), American Mathematical Society, Providence, RI, 2000, pp. 127–144.Google Scholar
[3] Jockusch, Carl G. Jr., Ramsey's Theorem and recursion theory, The Journal of Symbolic Logic, vol. 37 (1972), pp. 268–280.Google Scholar
[1] Downey, R. and Griffiths, E., On Schnorr randomness, extended abstract in Computability and Complexity in Analysis, Malaga, (Electronic notes in Theoretical Computer Science, and proceedings, (Brattka, Schröder, Weihrauch, editors), Fern Universität 2946/2002, 25-36), 07 2002.Google Scholar
[2] Downey, R., Griffiths, E., Laforte, G., On Schnorr and computable randomness, in preparation.Google Scholar
[3] Kucera, A., Slaman, T., Randomness and recursive enumerability, to appear in SIAM Journal of Computing.Google Scholar
[4] Schnorr, C., Zufälligkeit und Warscheinlichkeit, Lecture Notes in Mathematics, vol. 218, Springer-Verlag.Google Scholar
[1] Henson, C. Ward and Iovino, José, Ultraproducts in analysis, Analysis and Logic, London Mathematical Society Lecture Notes Series 262, Cambridge University Press, 2002, pp. 1–113.Google Scholar
[1] Džamonja, M. and Shelah, S., On the existence of universal models, Preprint.Google Scholar
[2] Shelah, S., Toward classifying unstable theories, Annals of Pure and Applied Logic, vol. 80 (1996), pp. 229–255.Google Scholar
[3] Shelah, S., The universality spectrum: consistency for more classes, Combinatorics, Paul Erdös is Eighty, vol. 1 (1993), pp. 403–420.Google Scholar
[1] Ben-Yaacov, Itay, Pillay, Anand, Vassiliev, Evgueni, Lovely pairs of models, to appear in Annals ofPure and Applied Logic.Google Scholar
[2] Pillay, Anand, Vassiliev, Evgueni, Imaginaries in beautiful pairs, submitted, 2003.Google Scholar
[3] Poizat, Bruno, Paires de structures stables, The Journal of Symbolic Logic, vol. 48 (1983), no. 2, pp. 239–249.Google Scholar
[4] Vassiliev, Evgueni, Generic pairs of SU-rank 1 structures, Annals of Pure and Applied Logic, vol. 120 (2003), no. 1–3, pp. 103–149.Google Scholar
[1] Angell, Richard Bradshaw, A-LOGIC, University Press of America, Lanham, MD, USA, 2002.Google Scholar
[1] Bimbó, K., Semantics for structurally free logic LC+, Logic Journal of the IGPL, vol. 9 (2001), pp. 557–571.Google Scholar
[2] Dunn, J. M., Generalized ortho negation, Negation: a Notion in Focus, (Wansing, H., editor), W. de Gruyter, New York, 1996, pp. 3–26.Google Scholar
[3] Urquhart, A., Semantics for relevant logics, The Journal of Symbolic Logic, vol. 37 (1972), pp. 159–169.CrossRefGoogle Scholar
[1] Murray, R. G., et al., Bayesian analysis of stress thallium-201 scintigraphy, European Journal of Nuclear Medicine, vol. 6 (1981), pp. 201–204.Google Scholar
[1] Hindman, Neil, Finite sums from sequences within cells of a partition of N, Journal of Combinatorial Theory Series A, vol. 17 (1974), pp. 1–11.Google Scholar
[2] Milliken, Keith R., Ramsey's theorem with sums or unions, Journal of Combinatorial Theory Series A, vol. 18 (1975), pp. 276–290.Google Scholar
[1] Hodges, W., Model theory, Cambridge University Press, 1993.CrossRefGoogle Scholar
[2] Shapiro, S., Classical logic II: higher-order logic, The Blackwell Guide to Philosophical Logic, Goble, L. (editor), Blackwell Publishers Ltd., 2001, pp. 33–54.Google Scholar
[3] Shoenfield, J. R., Mathematical Logic, Addison-Wesley Press, 1967.Google Scholar
[1] Burr, Wolfgang, The intuitionistic arithmetical hierarchy, Preliminary manuscript, 2000.Google Scholar
[2] Leivant, Daniel, Intrinsic reasoning about functional programs I: First order theories, Annals of Pure and Applied Logic, vol. 114 (2002), pp. 117–153.Google Scholar
[3] Wehmeier, Kai F., Fragments of HA based on Σ1-induction, Archive for Mathematical Logic, vol. 37 (1997), pp. 37–49.Google Scholar
[1] Leivant, Daniel, Intrinsic reasoning about functional programs I: first order theories, Annals of Pure and Applied Logic, vol. 114 (2002), no. 1–3, pp. 117–153.Google Scholar
[1] Krajicek, Jan, On the weak pigeonhole principle, Fundamenta Mathematicae, vol. 170 no. 1–3, (2001), pp. 123–140.Google Scholar
[2] Pudlak, Pavel, Ramsey's theorem in bounded arithmetic, 4th Workshop, Computer Science Logic, Lecture notes in computer science, vol. 533, Springer-Verlag, Berlin Heidelberg, 1991, pp. 308–317.CrossRefGoogle Scholar
[1] Cook, S. and Urquhart, A., Functional interpretations of feasibly constructive arithmetic, Annals of Pure and Applied Logic, vol. 63 (1993), pp. 103–200.Google Scholar
[2] Ferreira, F., A feasible theory for analysis, The Journal of Symbolic Logic, vol. 59 (1994), no. 3, pp. 1001–1011.CrossRefGoogle Scholar
[3] Oliva, P., Polynomial-time algorithms from ineffective proofs, Proceedings of the Eighteenth Annual IEEE Symposium on Logic in Computer Science LICS, 2003.Google Scholar
[1] Buss, Samuel R., Intuitionistic validity in T-normal Kripke structures, Annals of Pure and Applied Logic, vol. 59 (1993), pp. 159–173.Google Scholar
[1] Downey, Rodney G., Jockusch, Carl G., and Stob, Michael Array nonrecursive degrees and genericity, Computability, enumerability, unsolvability: Directions in recursion theory (Cooper, S. B., Slaman, T. A., and Wainer, S. S., editors), London Mathematical Society Lecture Series, no. 224, Cambridge University Press, 1996, pp. 93–104.Google Scholar
[2] Kummer, Martin Kolmogorov complexity and instance complexity of recursively enumerable sets, Siam Journal on Computing, vol. 25 (1996), pp. 1123–1143.Google Scholar
[1] Downey, R. G., D.r.e. degrees and the nondiamond theorem, Bulletin of the London Mathematical Society, vol. 21 (1989), pp. 43–50.CrossRefGoogle Scholar
[2] Wu, G., Isolation and diamond embeddings, The Journal of Symbolic Logic, vol. 67 (2002), pp. 1055–1064.Google Scholar
[3] Wu, G., Diamond embeddings into the d.c.e. degrees with 0 and 1 preserved, Proceedings of the 7th and 8th Asian Logic Conferences, World Scientific, accepted, 2003.Google Scholar
[1] Brooks, C. H. and Durfee, E. H., Congregation formation in information economies, Papers from the AAAI workshop on artificial intelligence for electronic commerce, Orlando FL, 07 1999, AAAI Press WS99-01, pp. 62–68.Google Scholar
[2] Fass, L. F., Establishing software ‘correctness’ by logical and algebraic means, Proceedings of the fifth international joint conference on information sciences, Atlantic City, NJ, 02 2000, vol. I, pp. 639–642.Google Scholar
[3] Fass, L. F., Modeling techniques for intelligent business, preliminary version, invited for presentation at the American Association for Artificial Intelligence national meeting, workshop on artificial intelligence for intelligent business, Edmonton AB, 07 2002.Google Scholar
[4] Fischer, B. and Smith, D. R., Editors, Papers from the AAAI Spring symposium on logic-based program synthesis: state of the art and future trends, Stanford University, 03 2002, AAAI Press SS02-05.Google Scholar
[5] Kant, E., A commercial program synthesis system for computational finance, invited symposium talk, abstracted in [4], p. 3.Google Scholar
[6] Khatib, L. and Pecheur, C., Editors, Papers from the AAAI Spring symposium on model-based validation of intelligence, Stanford University, 03 2001, AAAI Press SS01-04.Google Scholar
[7] Waldinger, R., Deductive chat lines for multiple agents, invited symposium talk, abstracted in [4], p. 5.Google Scholar
[1] Bealer, G., Quality and concept, Oxford University Press, 1982.Google Scholar
[2] Barwise, J. and Cooper, R., Generalized quantifiers and natural language, Linguistics and Philosophy, vol. 4 (1981), pp. 159–219.Google Scholar
[3] Partee, B., Noun phrase interpretation and type shifting principles, Studies in Discourse Representation Theory and the Theory of Generalized Quantifiers (Groenendijk, , Jong, de, and Stokhof, , editors), Dordrecht, Foris.Google Scholar
[1] Marković, Zoran, On the structure of Kripke models of Heyting arithmetic, Mathematical Logic Quarterly, vol. 39 (1993), pp. 531–538.Google Scholar
[2] Salehi, Saeed, Decidable formulas of intuitionistic primitive recursive arithmetic, Reports on Mathematical Logic, vol. 36 (2002), pp. 55–61.Google Scholar
[3] Wehmeier, Kai F., Fragments of HA based on Σ1-induction, Archive for Mathematical Logic, vol. 37 (1997), pp. 37–49.Google Scholar