The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
James H. Schmerl: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Roman Kossak, Henryk Kotlarski, James H. Schmerl
    On Maximal Subgroups of the Automorphism Group of a Countable Recursively Saturated Model of PA. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1993, v:65, n:2, pp:125-148 [Journal]
  2. James H. Schmerl
    What's the Difference? [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1998, v:93, n:1-3, pp:255-261 [Journal]
  3. Imre Bárány, James H. Schmerl, Stuart J. Sidney, Jorge Urrutia
    A Combinatorial Result About Points and Balls in Euclidean Space. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1989, v:4, n:, pp:259-262 [Journal]
  4. James H. Schmerl
    Partitioning Euclidean Space. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1993, v:10, n:, pp:101-106 [Journal]
  5. James H. Schmerl
    Generic automorphisms and graph coloring. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2005, v:291, n:1-3, pp:235-242 [Journal]
  6. Péter Komjáth, James H. Schmerl
    The Two Points Theorem of Mazurkiewicz. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 2002, v:99, n:2, pp:371-376 [Journal]
  7. James H. Schmerl
    A General Framework for Discovering and Proving Theorems of the Erdös-Ko-Rado Type. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1992, v:61, n:2, pp:252-262 [Journal]
  8. Matt Kaufmann, James H. Schmerl
    Remarks on Weak Notions of Saturation in Models of Peano Arithmetic. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1987, v:52, n:1, pp:129-148 [Journal]
  9. H. Jerome Keisler, James H. Schmerl
    Making the Hyperreal Line Both Saturated and Complete. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1991, v:56, n:3, pp:1016-1025 [Journal]
  10. Roman Kossak, Mark E. Nadel, James H. Schmerl
    A Note on the Multiplicative Semigroup of Models of Peano Arithmetic. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1989, v:54, n:3, pp:936-940 [Journal]
  11. Manuel Lerman, James H. Schmerl
    Theories with Recursive Models. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1979, v:44, n:1, pp:59-76 [Journal]
  12. Dugald Macpherson, James H. Schmerl
    Binary Relational Structures Having Only Countably Many Nonisomorphic Substructures. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1991, v:56, n:3, pp:876-884 [Journal]
  13. James H. Schmerl
    Automorphism Groups of Models of Peano Arithmetic. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 2002, v:67, n:4, pp:1249-1264 [Journal]
  14. James H. Schmerl
    Some Highly Saturated Models of Peano Arithmetic. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 2002, v:67, n:4, pp:1265-1273 [Journal]
  15. James H. Schmerl
    An Elementary Sentence which Has Ordered Models. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1972, v:37, n:3, pp:521-530 [Journal]
  16. James H. Schmerl
    Generalizing Special Aronszajn Trees. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1974, v:39, n:4, pp:732-740 [Journal]
  17. James H. Schmerl
    An Axiomatization for a Class of Two-Cardinal Models. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1977, v:42, n:2, pp:174-178 [Journal]
  18. James H. Schmerl
    Decidability and 0-Categoricity of Theories of Partially Ordered Sets. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1980, v:45, n:3, pp:585-611 [Journal]
  19. James H. Schmerl
    Decidability and Finite Axiomatizability of Theories of 0-Categorical Partially Ordered Sets. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1981, v:46, n:1, pp:101-120 [Journal]
  20. James H. Schmerl
    Partially Ordered Sets and the Independence Property. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1989, v:54, n:2, pp:396-401 [Journal]
  21. James H. Schmerl
    Large Resplendent Models Generated by Indiscernibles. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1989, v:54, n:4, pp:1382-1388 [Journal]
  22. James H. Schmerl
    Coinductive aleph0-Categorical Theories. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1990, v:55, n:3, pp:1130-1137 [Journal]
  23. James H. Schmerl
    The Isomorphism Property for Nonstandard Universes. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1995, v:60, n:2, pp:512-516 [Journal]
  24. James H. Schmerl
    A Reflection Principle and its Applications to Nonstandard Models. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1995, v:60, n:4, pp:1137-1152 [Journal]
  25. James H. Schmerl, Saharon Shelah
    On Power-like Models for Hyperinaccessible Cardinals. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1972, v:37, n:3, pp:531-537 [Journal]
  26. James H. Schmerl, Stephen G. Simpson
    On the Role of Ramsey Quantifiers in First Order Arithmetic. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1982, v:47, n:2, pp:423-435 [Journal]
  27. James H. Schmerl
    Graph Coloring and Reverse Mathematics. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 2000, v:46, n:4, pp:543-548 [Journal]
  28. James H. Schmerl
    Closed Normal Subgroups. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 2001, v:47, n:4, pp:489-492 [Journal]
  29. James H. Schmerl
    Moving Intersticial Gaps. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 2002, v:48, n:2, pp:283-296 [Journal]
  30. James H. Schmerl
    Difference Sets and Recursion Theory. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 1998, v:44, n:, pp:515-521 [Journal]
  31. James H. Schmerl
    Substructure lattices and almost minimal end extensions of models of Peano arithmetic. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 2004, v:50, n:6, pp:533-539 [Journal]
  32. Roman Kossak, James H. Schmerl
    Minimal Satisfaction Classes with an Application to Rigid Models of {Peano} Arithmetic. [Citation Graph (0, 0)][DBLP]
    Notre Dame Journal of Formal Logic, 1991, v:32, n:3, pp:392-398 [Journal]
  33. Roman Kossak, James H. Schmerl
    Arithmetically Saturated Models of Arithmetic. [Citation Graph (0, 0)][DBLP]
    Notre Dame Journal of Formal Logic, 1995, v:36, n:4, pp:531-546 [Journal]
  34. James H. Schmerl
    End Extensions of Models of Arithmetic. [Citation Graph (0, 0)][DBLP]
    Notre Dame Journal of Formal Logic, 1992, v:33, n:2, pp:216-220 [Journal]
  35. James H. Schmerl
    PA(aa). [Citation Graph (0, 0)][DBLP]
    Notre Dame Journal of Formal Logic, 1995, v:36, n:4, pp:560-569 [Journal]
  36. James H. Schmerl
    Recursive Models and the Divisibility Poset. [Citation Graph (0, 0)][DBLP]
    Notre Dame Journal of Formal Logic, 1998, v:39, n:1, pp:140-148 [Journal]
  37. James H. Schmerl
    Obstacles to Extending Mirsky's Theorem. [Citation Graph (0, 0)][DBLP]
    Order, 2002, v:19, n:2, pp:209-211 [Journal]
  38. Ron Blei, Yuval Peres, James H. Schmerl
    Fractional Products of Sets. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1995, v:6, n:1, pp:113-120 [Journal]
  39. James H. Schmerl
    A Note on Euclidean Ramsey Theory. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2007, v:38, n:1, pp:155-167 [Journal]
  40. Henry A. Kierstead, James H. Schmerl
    The chromatic number of graphs which induce neither K1, 3 nor K5-e. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1986, v:58, n:3, pp:253-262 [Journal]
  41. Henry A. Kierstead, James H. Schmerl
    Some applications of Vizing's theorem to vertex colorings of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1983, v:45, n:2-3, pp:277-285 [Journal]
  42. James H. Schmerl, William T. Trotter
    Critically indecomposable partially ordered sets, graphs, tournaments and other binary relational structures. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:113, n:1-3, pp:191-205 [Journal]
  43. James H. Schmerl
    Tiling space with notched cubes. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:133, n:1-3, pp:225-235 [Journal]

  44. Elementary extensions of models of set theory. [Citation Graph (, )][DBLP]


  45. An Improvement to "A Note on Euclidean Ramsey Theory". [Citation Graph (, )][DBLP]


Search in 0.005secs, Finished in 0.009secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002