The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Ludomir Newelski: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Ludomir Newelski
    Very simple theories without forking. [Citation Graph (0, 0)][DBLP]
    Arch. Math. Log., 2003, v:42, n:6, pp:601-16 [Journal]
  2. Ludomir Newelski
    Weakly Minimal Formulas: A Global Approach. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1990, v:46, n:1, pp:65-94 [Journal]
  3. Ludomir Newelski
    Meager Forking. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1994, v:70, n:2, pp:141-175 [Journal]
  4. Ludomir Newelski
    A Model and Its Subset: The Uncountable Case. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1995, v:71, n:2, pp:107-129 [Journal]
  5. Ludomir Newelski
    Small Profinite Groups. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 2001, v:66, n:2, pp:859-872 [Journal]
  6. Ludomir Newelski
    Modular Types in Some Supersimple Theories. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 2002, v:67, n:4, pp:1601-1615 [Journal]
  7. Ludomir Newelski
    On Partitions of the Real Line Into Compact Sets. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1987, v:52, n:2, pp:353-359 [Journal]
  8. Ludomir Newelski
    Omitting Types and the Real Line. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1987, v:52, n:4, pp:1020-1026 [Journal]
  9. Ludomir Newelski
    Omitting Types for Stable CCC Theories. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1990, v:55, n:3, pp:1037-1047 [Journal]
  10. Ludomir Newelski
    A Model and Its Subset. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1992, v:57, n:2, pp:644-658 [Journal]
  11. Ludomir Newelski
    Scott Analysis of Pseudotypes. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1993, v:58, n:2, pp:648-663 [Journal]
  12. Ludomir Newelski
    On Atomic or Saturated Sets. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1996, v:61, n:1, pp:318-333 [Journal]
  13. Ludomir Newelski
    Flat Morley Sequences. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1999, v:64, n:3, pp:1261-1279 [Journal]
  14. Ludomir Newelski
    Geometry of *-Finite Types. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1999, v:64, n:4, pp:1375-1395 [Journal]
  15. Krzysztof Krupinski, Ludomir Newelski
    On Bounded Type-Definable Equivalence Relations. [Citation Graph (0, 0)][DBLP]
    Notre Dame Journal of Formal Logic, 2002, v:43, n:4, pp:231-242 [Journal]
  16. Ludomir Newelski
    On Type Definable Subgroups of a Stable Group. [Citation Graph (0, 0)][DBLP]
    Notre Dame Journal of Formal Logic, 1991, v:32, n:2, pp:173-187 [Journal]

  17. G-compactness and groups. [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.005secs
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
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002