default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJames H. Schmerl
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j72]Athar Abdul-Quader
, James H. Schmerl:
CP-generic expansions of models of Peano Arithmetic. Math. Log. Q. 68(2): 171-177 (2022)
2010 – 2019
- 2018
- [j71]James H. Schmerl:
Deciding the chromatic numbers of Algebraic hypergraphs. J. Symb. Log. 83(1): 128-145 (2018) - [j70]James H. Schmerl:
Acceptable colorings of Indexed Hyperspaces. J. Symb. Log. 83(4): 1644-1666 (2018) - [j69]James H. Schmerl:
More Automorphism Groups of Countable, Arithmetically Saturated Models of Peano Arithmetic. Notre Dame J. Formal Log. 59(4): 491-496 (2018) - 2017
- [j68]James H. Schmerl:
Minimal elementary end extensions. Arch. Math. Log. 56(5-6): 541-553 (2017) - [j67]James H. Schmerl:
Chromatic numbers of algebraic hypergraphs. Comb. 37(5): 1011-1026 (2017) - 2015
- [j66]David Marker, James H. Schmerl, Charles Steinhorn:
Uncountable Real Closed Fields with PA Integer Parts. J. Symb. Log. 80(2): 490-502 (2015) - [j65]James H. Schmerl:
Automorphism Groups of Countable Arithmetically saturated Models of Peano Arithmetic. J. Symb. Log. 80(4): 1411-1434 (2015) - 2014
- [j64]James H. Schmerl:
Subsets coded in elementary end extensions. Arch. Math. Log. 53(5-6): 571-581 (2014) - [j63]Ermek S. Nurkhaidarov, James H. Schmerl:
Automorphism Groups of saturated Models of Peano Arithmetic. J. Symb. Log. 79(2): 561-584 (2014) - [j62]James H. Schmerl:
Cofinal elementary extensions. Math. Log. Q. 60(1-2): 12-20 (2014) - 2012
- [j61]James H. Schmerl:
The automorphism group of a resplendent model. Arch. Math. Log. 51(5-6): 647-649 (2012) - [j60]James H. Schmerl:
A generalization of Sierpiński's paradoxical decompositions: Coloring semialgebraic grids. J. Symb. Log. 77(4): 1165-1183 (2012) - [j59]James H. Schmerl:
Elementary Cuts in Saturated Models of Peano Arithmetic. Notre Dame J. Formal Log. 53(1): 1-13 (2012) - [j58]Roman Kossak, James H. Schmerl:
On Cofinal Submodels and Elementary Interstices. Notre Dame J. Formal Log. 53(3): 267-287 (2012) - 2011
- [j57]James H. Schmerl:
Dividing a polygon into two similar polygons. Discret. Math. 311(4): 220-231 (2011) - 2010
- [j56]James H. Schmerl:
An Improvement to "A Note on Euclidean Ramsey Theory". Discret. Comput. Geom. 43(2): 263-271 (2010) - [j55]James H. Schmerl:
Infinite substructure lattices of models of Peano Arithmetic. J. Symb. Log. 75(4): 1366-1382 (2010) - [j54]James H. Schmerl:
Reverse Mathematics and Grundy colorings of graphs. Math. Log. Q. 56(5): 541-548 (2010)
2000 – 2009
- 2008
- [j53]James H. Schmerl:
Nondiversity in substructures. J. Symb. Log. 73(1): 193-211 (2008) - [j52]Stephen Binns, Bjørn Kjos-Hanssen, Manuel Lerman, James H. Schmerl, Reed Solomon:
Self-Embeddings of Computable Trees. Notre Dame J. Formal Log. 49(1): 1-37 (2008) - 2007
- [j51]James H. Schmerl:
A Note on Euclidean Ramsey Theory. Discret. Comput. Geom. 38(1): 155-167 (2007) - 2005
- [j50]James H. Schmerl:
Generic automorphisms and graph coloring. Discret. Math. 291(1-3): 235-242 (2005) - 2004
- [j49]James H. Schmerl:
Substructure lattices and almost minimal end extensions of models of Peano arithmetic. Math. Log. Q. 50(6): 533-539 (2004) - 2003
- [j48]James H. Schmerl:
Partitioning large vector spaces. J. Symb. Log. 68(4): 1171-1180 (2003) - 2002
- [j47]Péter Komjáth, James H. Schmerl:
The Two Points Theorem of Mazurkiewicz. J. Comb. Theory A 99(2): 371-376 (2002) - [j46]James H. Schmerl:
Automorphism Groups of Models of Peano Arithmetic. J. Symb. Log. 67(4): 1249-1264 (2002) - [j45]James H. Schmerl:
Some Highly Saturated Models of Peano Arithmetic. J. Symb. Log. 67(4): 1265-1273 (2002) - [j44]James H. Schmerl:
Moving Intersticial Gaps. Math. Log. Q. 48(2): 283-296 (2002) - [j43]James H. Schmerl:
Obstacles to Extending Mirsky's Theorem. Order 19(2): 209-211 (2002) - 2001
- [j42]James H. Schmerl:
Closed Normal Subgroups. Math. Log. Q. 47(4): 489-492 (2001) - 2000
- [j41]James H. Schmerl:
Elementary extensions of models of set theory. Arch. Math. Log. 39(7): 509-514 (2000) - [j40]James H. Schmerl:
Graph Coloring and Reverse Mathematics. Math. Log. Q. 46(4): 543-548 (2000)
1990 – 1999
- 1998
- [j39]James H. Schmerl:
What's the Difference? Ann. Pure Appl. Log. 93(1-3): 255-261 (1998) - [j38]James H. Schmerl:
Difference Sets and Recursion Theory. Math. Log. Q. 44: 515-521 (1998) - [j37]James H. Schmerl:
Recursive Models and the Divisibility Poset. Notre Dame J. Formal Log. 39(1): 140-148 (1998) - 1995
- [j36]James H. Schmerl:
The Isomorphism Property for Nonstandard Universes. J. Symb. Log. 60(2): 512-516 (1995) - [j35]James H. Schmerl:
A Reflection Principle and its Applications to Nonstandard Models. J. Symb. Log. 60(4): 1137-1152 (1995) - [j34]Roman Kossak, James H. Schmerl:
Arithmetically Saturated Models of Arithmetic. Notre Dame J. Formal Log. 36(4): 531-546 (1995) - [j33]James H. Schmerl:
PA(aa). Notre Dame J. Formal Log. 36(4): 560-569 (1995) - [j32]Ron Blei, Yuval Peres, James H. Schmerl:
Fractional Products of Sets. Random Struct. Algorithms 6(1): 113-120 (1995) - 1994
- [j31]James H. Schmerl:
Tiling space with notched cubes. Discret. Math. 133(1-3): 225-235 (1994) - [j30]James H. Schmerl, Eugene Spiegel:
The Regularity of Some 1-Additive Sequences. J. Comb. Theory A 66(1): 172-175 (1994) - 1993
- [j29]James H. Schmerl:
A weakly definable type which is not definable. Arch. Math. Log. 32(6): 463-468 (1993) - [j28]Roman Kossak, Henryk Kotlarski, James H. Schmerl:
On Maximal Subgroups of the Automorphism Group of a Countable Recursively Saturated Model of PA. Ann. Pure Appl. Logic 65(2): 125-148 (1993) - [j27]James H. Schmerl:
Partitioning Euclidean Space. Discret. Comput. Geom. 10: 101-106 (1993) - [j26]James H. Schmerl, William T. Trotter:
Critically indecomposable partially ordered sets, graphs, tournaments and other binary relational structures. Discret. Math. 113(1-3): 191-205 (1993) - 1992
- [j25]James H. Schmerl:
A General Framework for Discovering and Proving Theorems of the Erdös-Ko-Rado Type. J. Comb. Theory A 61(2): 252-262 (1992) - [j24]James H. Schmerl:
End Extensions of Models of Arithmetic. Notre Dame J. Formal Log. 33(2): 216-220 (1992) - 1991
- [j23]Dugald Macpherson, James H. Schmerl:
Binary Relational Structures Having Only Countably Many Nonisomorphic Substructures. J. Symb. Log. 56(3): 876-884 (1991) - [j22]H. Jerome Keisler, James H. Schmerl:
Making the Hyperreal Line Both Saturated and Complete. J. Symb. Log. 56(3): 1016-1025 (1991) - [j21]Roman Kossak, James H. Schmerl:
Minimal Satisfaction Classes with an Application to Rigid Models of Peano Arithmetic. Notre Dame J. Formal Log. 32(3): 392-398 (1991) - 1990
- [j20]James H. Schmerl:
Coinductive aleph0-Categorical Theories. J. Symb. Log. 55(3): 1130-1137 (1990)
1980 – 1989
- 1989
- [j19]Imre Bárány, James H. Schmerl, Stuart J. Sidney, Jorge Urrutia:
A Combinatorial Result About Points and Balls in Euclidean Space. Discret. Comput. Geom. 4: 259-262 (1989) - [j18]James H. Schmerl:
Partially Ordered Sets and the Independence Property. J. Symb. Log. 54(2): 396-401 (1989) - [j17]Roman Kossak, Mark E. Nadel, James H. Schmerl:
A Note on the Multiplicative Semigroup of Models of Peano Arithmetic. J. Symb. Log. 54(3): 936-940 (1989) - [j16]James H. Schmerl:
Large Resplendent Models Generated by Indiscernibles. J. Symb. Log. 54(4): 1382-1388 (1989) - 1987
- [j15]Matt Kaufmann, James H. Schmerl:
Remarks on Weak Notions of Saturation in Models of Peano Arithmetic. J. Symb. Log. 52(1): 129-148 (1987) - 1986
- [j14]Henry A. Kierstead, James H. Schmerl:
The chromatic number of graphs which induce neither K1, 3 nor K5-e. Discret. Math. 58(3): 253-262 (1986) - [j13]James H. Schmerl:
Theories Having Finitely Many Countable Homogeneous Models. Math. Log. Q. 32(7-9): 131 (1986) - 1985
- [j12]James H. Schmerl:
Recursively saturated models generated by indiscernibles. Notre Dame J. Formal Log. 26(2): 99-105 (1985) - 1984
- [j11]Matt Kaufmann, James H. Schmerl:
Saturation and simple extensions of models of peano arithmetic. Ann. Pure Appl. Log. 27(2): 109-136 (1984) - 1983
- [j10]Henry A. Kierstead, James H. Schmerl:
Some applications of Vizing's theorem to vertex colorings of graphs. Discret. Math. 45(2-3): 277-285 (1983) - 1982
- [j9]James H. Schmerl, Stephen G. Simpson:
On the Role of Ramsey Quantifiers in First Order Arithmetic. J. Symb. Log. 47(2): 423-435 (1982) - 1981
- [j8]James H. Schmerl:
Decidability and Finite Axiomatizability of Theories of 0-Categorical Partially Ordered Sets. J. Symb. Log. 46(1): 101-120 (1981) - 1980
- [j7]James H. Schmerl:
Decidability and 0-Categoricity of Theories of Partially Ordered Sets. J. Symb. Log. 45(3): 585-611 (1980)
1970 – 1979
- 1979
- [j6]Manuel Lerman, James H. Schmerl:
Theories with Recursive Models. J. Symb. Log. 44(1): 59-76 (1979) - 1977
- [j5]James H. Schmerl:
An Axiomatization for a Class of Two-Cardinal Models. J. Symb. Log. 42(2): 174-178 (1977) - 1976
- [j4]James H. Schmerl:
Remarks on Self-Extending Models. Math. Log. Q. 22(1): 509-512 (1976) - 1974
- [j3]James H. Schmerl:
Generalizing Special Aronszajn Trees. J. Symb. Log. 39(4): 732-740 (1974) - 1972
- [j2]James H. Schmerl:
An Elementary Sentence which Has Ordered Models. J. Symb. Log. 37(3): 521-530 (1972) - [j1]James H. Schmerl, Saharon Shelah:
On Power-like Models for Hyperinaccessible Cardinals. J. Symb. Log. 37(3): 531-537 (1972)
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 2025-01-21 00:21 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
