The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Noam Greenberg: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Rod Downey, Noam Greenberg
    Totally < omegaomega Computably Enumerable and m-topped Degrees. [Citation Graph (0, 0)][DBLP]
    TAMC, 2006, pp:46-60 [Conf]
  2. Sakaé Fuchino, Noam Greenberg, Saharon Shelah
    Models of real-valued measurability. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2006, v:142, n:1-3, pp:380-397 [Journal]
  3. Noam Greenberg
    The role of true finiteness in the admissible recursively enumerable degrees. [Citation Graph (0, 0)][DBLP]
    Bulletin of Symbolic Logic, 2005, v:11, n:3, pp:398-410 [Journal]

  4. The upward closure of a perfect thin class. [Citation Graph (, )][DBLP]


Search in 0.001secs, Finished in 0.001secs
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