Chris Laskowski

Office: Room 1106, Mathematics Building
Office Phone: (301) 405-5059
Departmental Fax: (301) 314-0827
E-mail: mcl "at" math.umd.edu

Office hours (Fall, 2008)

Teaching: Fall, 2008

Math 718, Dependent theories

Research interests

Classification theory

The number of nonisomorphic models

The uncountable spectra of countable theories, with B. Hart and E. Hrushovski, Annals of Mathematics 152 (2000) 207--257.   .ps   .pdf

Unique decomposition in classifiable theories, with B. Hart and E. Hrushovski, Journal of Symbolic Logic 67 (2002) 61-68.   .ps   .pdf

• Karp complexity

The Karp compexity of unstable classes, with S. Shelah, Archive for Mathematical Logic 40(2001) 69-88.   .ps   .pdf

Karp complexity and classes with the independence property, with S. Shelah, Annals of Pure and Applied Logic 120(2003), 263--283.   .ps   .pdf

• Strictly stable theories

A trichotomy of countable, stable, unsuperstable theories, with S. Shelah, Transactions AMS (to appear).   .pdf

• Applications of Descriptive Set Theory

Descriptive set theory and uncountable model theory, in Logic Colloquium '03, Lecture Notes in Logic, 24 (2006) 133-145.   .ps   .pdf

Decompositions of saturated models of stable theories, with S. Shelah, Fundamenta Mathematicae 191 (2006) 95-124.   .pdf

• Borel complexity of some omega-stable theories

An old friend revisited: Countable models of omega-stable theories, Proceedings of the Vaught's Conjecture conference, Notre Dame Journal of Formal Logic 48(2007) 133--141.   .pdf

Conference Presentation (5 April, 2008) Omega-stable theories: Do uncountable languages matter?

• Bounding quantifier complexity in some trivial theories

Trivial, strongly minimal theories are model complete after naming constants, with S. Goncharov, V. Harizanov, S. Lempp and C. McCoy, Proc. AMS 131(2003), no. 12, 3901--3912.   .ps   .pdf

Model completeness for trivial, uncountably categorical theories of Morley rank one, with A. Dolich and A. Raichev, Archive for Math. Logic 45(2006) 931-945.   .pdf

On the computability-theoretic complexity of trivial, strongly minimal models, with B. Khoussainov, S. Lempp, and R. Solomon, Proc. AMS 135(2007), no. 11, 3711-3721.   .pdf

The elementary diagram of a trivial, weakly minimal structure is near model complete, Archive for Math. Logic 48(2009), no 1, 15--24.   .pdf

• Hrushovski constructions

A simpler axiomatization of the Shelah-Spencer almost sure theories, Israel Journal of Mathematics 161(2007), 157-186.   .pdf

• Compression schemes and uniformly definable families

Compression schemes, stable definable families, and o-minimal structures, with H. Johnson, Discrete and computational geometry (submitted).   .pdf

• Algebraic questions arising from fuzzy logics

A classification of BL-algebras, with Y.V. Shashoua, Fuzzy sets and systems 131(2002), 271--282.   .ps   .pdf

Generalized ordinal sums and BL-chains, with Y.V. Shashoua, Algebra Universalis 52(2004), 137-153.   .ps   .pdf

Provability in product logic, with S. Malekpour, Archive for Math. Logic 46(2007) 365--378.   .ps   .pdf

• Protein chemistry

Analysis of sequence-reactivity space for protein-protein interactions, with J. Li, Z. Yi, M. Laskowski, and C. Bailey-Kellogg, Proteins 58(3), 2005, 661-671.   .pdf

Functional evolution within a protein superfamily, with Z. Yi, O. Vitek, M.A. Qasim, W. Lu, M. Ranjbar, J. Li, M. Laskowski, Jr, and C. Bailey-Kellogg, Proteins 63(3), 2006, 697-708.   .pdf

---