default search action
Michael C. Laskowski
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j37]Michael C. Laskowski, Douglas S. Ulrich:
Most(?) Theories Have Borel Complete Reducts. J. Symb. Log. 88(1): 418-426 (2023) - 2022
- [j36]Samuel Braunfeld, Michael C. Laskowski:
Mutual algebraicity and cellularity. Arch. Math. Log. 61(5-6): 841-857 (2022) - [j35]Michael C. Laskowski, Caroline A. Terry:
Jumps in speeds of hereditary properties in finite relational languages. J. Comb. Theory B 154: 93-135 (2022) - [j34]Samuel Braunfeld, Michael C. Laskowski:
Counting siblings in Universal Theories. J. Symb. Log. 87(3): 1130-1155 (2022) - [c1]William Gasarch, Michael C. Laskowski, Shaopeng Zhu:
$(\mathbb {Z}, \text {succ}, U), (\mathbb {Z}, E, U)$, and Their CSP's. TAMC 2022: 155-175 - 2020
- [j33]Gabriel Conant, Michael C. Laskowski:
Weakly minimal groups with a new predicate. J. Math. Log. 20(2): 2050011:1-2050011:27 (2020) - [j32]Michael C. Laskowski, Caroline A. Terry:
Uniformly Bounded Arrays and Mutually Algebraic Structures. Notre Dame J. Formal Log. 61(2): 265-282 (2020)
2010 – 2019
- 2019
- [j31]Michael C. Laskowski, Saharon Shelah:
A strong failure of $$\aleph _0$$ ℵ 0 -stability for atomic classes. Arch. Math. Log. 58(1-2): 99-118 (2019) - [j30]John T. Baldwin, Michael C. Laskowski:
Henkin Constructions of Models with Size continuum. Bull. Symb. Log. 25(1): 1-33 (2019) - 2017
- [j29]John T. Baldwin, Martin Koerwien, Michael C. Laskowski:
Disjoint Amalgamation in Locally Finite AEC. J. Symb. Log. 82(1): 98-119 (2017) - 2016
- [j28]Michael C. Laskowski, Christopher S. Shaw:
Definable choice for a class of weakly o-minimal theories. Arch. Math. Log. 55(5-6): 735-748 (2016) - [j27]John T. Baldwin, Michael C. Laskowski, Saharon Shelah:
Constructing Many Atomic Models in ℵ1. J. Symb. Log. 81(3): 1142-1162 (2016) - 2015
- [j26]Michael C. Laskowski:
Characterizing Model Completeness Among Mutually Algebraic Structures. Notre Dame J. Formal Log. 56(3): 463-470 (2015) - 2013
- [j25]Vincent Guingona, Michael C. Laskowski:
On VC-minimal theories and variants. Arch. Math. Log. 52(7-8): 743-758 (2013) - [j24]Michael C. Laskowski:
Mutually algebraic structures and expansions by predicates. J. Symb. Log. 78(1): 185-194 (2013) - 2012
- [j23]Justin Brody, Michael C. Laskowski:
On rational limits of Shelah - Spencer graphs. J. Symb. Log. 77(2): 580-592 (2012) - 2010
- [j22]H. R. Johnson, Michael C. Laskowski:
Compression Schemes, Stable Definable Families, and o-Minimal Structures. Discret. Comput. Geom. 43(4): 914-926 (2010)
2000 – 2009
- 2009
- [j21]Michael C. Laskowski:
The elementary diagram of a trivial, weakly minimal structure is near model complete. Arch. Math. Log. 48(1): 15-24 (2009) - 2007
- [j20]Michael C. Laskowski, Shirin Malekpour:
Provability in predicate product logic. Arch. Math. Log. 46(5-6): 365-378 (2007) - [j19]Michael C. Laskowski:
An Old Friend Revisited: Countable Models of ω-Stable Theories. Notre Dame J. Formal Log. 48(1): 133-141 (2007) - 2006
- [j18]Alfred Dolich, Michael C. Laskowski, Alexander Raichev:
Model completeness for trivial, uncountably categorical theories of Morley rank 1. Arch. Math. Log. 45(8): 931-945 (2006) - 2003
- [j17]Michael C. Laskowski, Saharon Shelah:
Karp complexity and classes with the independence property. Ann. Pure Appl. Log. 120(1-3): 263-283 (2003) - [j16]Michael C. Laskowski:
An application of Kochen's theorem. J. Symb. Log. 68(4): 1181-1188 (2003) - 2002
- [j15]Michael C. Laskowski, Yvonne V. Shashoua:
A classification of BL-algebras. Fuzzy Sets Syst. 131(3): 271-282 (2002) - [j14]Bradd Hart, Ehud Hrushovski, Michael C. Laskowski:
Unique Decomposition in Classifiable Theories. J. Symb. Log. 67(1): 61-68 (2002) - 2001
- [j13]Michael C. Laskowski, Saharon Shelah:
The Karp complexity of unstable classes. Arch. Math. Log. 40(2): 69-88 (2001)
1990 – 1999
- 1996
- [j12]Michael C. Laskowski, Laura L. Mayer:
Stable Structures with Few Substructures. J. Symb. Log. 61(3): 985-1005 (1996) - [j11]Michael C. Laskowski, Saharon Shelah:
Forcing Isomorphism II. J. Symb. Log. 61(4): 1305-1320 (1996) - 1995
- [j10]Michael C. Laskowski, Charles Steinhorn:
On o-Minimal Expansions of Archimedean Ordered Groups. J. Symb. Log. 60(3): 817-831 (1995) - 1993
- [j9]A. D. Greif, Michael C. Laskowski:
An Omitting Types Theorem for Saturated Structures. Ann. Pure Appl. Log. 62(2): 113-118 (1993) - [j8]Michael C. Laskowski, Saharon Shelah:
On the Existence of Atomic Models. J. Symb. Log. 58(4): 1189-1194 (1993) - [j7]John T. Baldwin, Michael C. Laskowski, Saharon Shelah:
Forcing Isomorphism. J. Symb. Log. 58(4): 1291-1301 (1993) - [j6]Elisabeth Bouscaren, Michael C. Laskowski:
S-Homogeneity and Automorphism Groups. J. Symb. Log. 58(4): 1302-1322 (1993) - 1992
- [j5]Michael C. Laskowski, Anand Pillay, Philipp Rothmaler:
Tiny models of categorical theories. Arch. Math. Log. 31(6): 385-396 (1992) - [j4]D. W. Kuecker, Michael C. Laskowski:
On Generic Structures. Notre Dame J. Formal Log. 33(2): 175-183 (1992) - [j3]Michael C. Laskowski:
The Categoricity Spectrum of Pseudo-elementary Classes. Notre Dame J. Formal Log. 33(3): 332-347 (1992)
1980 – 1989
- 1988
- [j2]Michael C. Laskowski:
Uncountable Theories that are Categorical in a Higher Power. J. Symb. Log. 53(2): 512-530 (1988) - 1985
- [j1]Victor Klee, Michael C. Laskowski:
Finding the Smallest Triangles Containing a Given Convex Polygon. J. Algorithms 6(3): 359-375 (1985)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 20:22 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint