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

Search the dblp DataBase

Title:
Author:
Jeremy Avigad: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Jeremy Avigad, Kevin Donnelly
    Formalizing O Notation in Isabelle/HOL. [Citation Graph (0, 0)][DBLP]
    IJCAR, 2004, pp:357-371 [Conf]
  2. Jeremy Avigad
    Eliminating Definitions and Skolem Functions in First-Order Logic. [Citation Graph (0, 0)][DBLP]
    LICS, 2001, pp:139-146 [Conf]
  3. Jeremy Avigad
    Saturated models of universal theories. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2002, v:118, n:3, pp:219-234 [Journal]
  4. Arnold Beckmann, Jeremy Avigad, Georg Moser
    Preface. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2005, v:136, n:1-2, pp:1-2 [Journal]
  5. Jeremy Avigad
    Erratum to "Saturated models of universal theories": [Ann. Pure Appl. Logic 118 (2002) 219-234]. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2003, v:121, n:2-3, pp:285-0 [Journal]
  6. Jeremy Avigad
    Formalizing Forcing Arguments in Subsystems of Second-Order Arithmetic. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1996, v:82, n:2, pp:165-191 [Journal]
  7. Jeremy Avigad
    Predicative Functionals and an Interpretation of ID<omega. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1998, v:92, n:1, pp:1-34 [Journal]
  8. Jeremy Avigad, Ksenija Simic
    Fundamental notions of analysis in subsystems of second-order arithmetic. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2006, v:139, n:1-3, pp:138-184 [Journal]
  9. Jeremy Avigad
    Forcing in proof theory. [Citation Graph (0, 0)][DBLP]
    Bulletin of Symbolic Logic, 2004, v:10, n:3, pp:305-333 [Journal]
  10. Jeremy Avigad, Richard Sommer
    A model-theoretic approach to ordinal analysis. [Citation Graph (0, 0)][DBLP]
    Bulletin of Symbolic Logic, 1997, v:3, n:1, pp:17-52 [Journal]
  11. Jeremy Avigad
    Algebraic proofs of cut elimination. [Citation Graph (0, 0)][DBLP]
    J. Log. Algebr. Program., 2001, v:49, n:1-2, pp:15-30 [Journal]
  12. Jeremy Avigad
    Interpreting Classical Theories in Constructive Ones. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 2000, v:65, n:4, pp:1785-1812 [Journal]
  13. Jeremy Avigad
    On the Relationship Between ATR0 and ID<omega. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1996, v:61, n:3, pp:768-779 [Journal]
  14. Jeremy Avigad, Richard Sommer
    The Model-Theoretic Ordinal Analysis of Theories of Predicative Strength. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1999, v:64, n:1, pp:327-349 [Journal]
  15. Jeremy Avigad, Harvey Friedman
    Combining decision procedures for the reals. [Citation Graph (0, 0)][DBLP]
    Logical Methods in Computer Science, 2006, v:2, n:4, pp:- [Journal]
  16. Jeremy Avigad
    Update Procedures and the 1-Consistency of Arithmetic. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 2002, v:48, n:1, pp:3-13 [Journal]
  17. Jeremy Avigad, Yimu Yin
    Quantifier elimination for the reals with a predicate for the powers of two. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:370, n:1-3, pp:48-59 [Journal]
  18. Jeremy Avigad
    Eliminating definitions and Skolem functions in first-order logic. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Comput. Log., 2003, v:4, n:3, pp:402-415 [Journal]
  19. Jeremy Avigad, Kevin Donnelly
    A decision procedure for linear "big O" equations [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  20. Jeremy Avigad, Yimu Yin
    Quantifier elimination for the reals with a predicate for the powers of two [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  21. Jeremy Avigad, Harvey Friedman
    Combining decision procedures for the reals [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  22. Jeremy Avigad, Kevin Donnelly
    A Decision Procedure for Linear "Big O" Equations. [Citation Graph (0, 0)][DBLP]
    J. Autom. Reasoning, 2007, v:38, n:4, pp:353-373 [Journal]

  23. An effective proof that open sets are Ramsey. [Citation Graph (, )][DBLP]


  24. The metamathematics of ergodic theory. [Citation Graph (, )][DBLP]


  25. A formally verified proof of the prime number theorem [Citation Graph (, )][DBLP]


  26. A language for mathematical language management [Citation Graph (, )][DBLP]


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