The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Andrea Cantini: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Andrea Cantini
    Remarks on applicative theories. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2005, v:136, n:1-2, pp:91-115 [Journal]
  2. Andrea Cantini
    On the Relation Between Choice and Comprehension Principles in Second Order Arithmetic. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1986, v:51, n:2, pp:360-373 [Journal]
  3. Andrea Cantini
    A Theory of Formal Truth Arithmetically Equivalent to ID1. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1990, v:55, n:1, pp:244-259 [Journal]
  4. Andrea Cantini
    Extending the First-Order Theory of Combinators with Self-Referential Truth. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1993, v:58, n:2, pp:477-513 [Journal]
  5. Andrea Cantini, Pierluigi Minari
    Uniform Inseparability in Explicit Mathematics. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1999, v:64, n:1, pp:313-326 [Journal]
  6. Andrea Cantini
    Feasible Operations and Applicative Theories Based on lambda-eta. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 2000, v:46, n:3, pp:291-312 [Journal]
  7. Andrea Cantini
    Asymmetric Interpretations for Bounded Theories. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 1996, v:42, n:, pp:270-288 [Journal]
  8. Andrea Cantini
    Levels of Truth. [Citation Graph (0, 0)][DBLP]
    Notre Dame Journal of Formal Logic, 1995, v:36, n:2, pp:185-213 [Journal]
  9. Andrea Cantini
    The Undecidability of Grisin's Set Theory. [Citation Graph (0, 0)][DBLP]
    Studia Logica, 2003, v:74, n:3, pp:345-368 [Journal]
  10. Andrea Cantini
    Relating Quine's NF to Feferman`s EM. [Citation Graph (0, 0)][DBLP]
    Studia Logica, 1999, v:62, n:2, pp:141-162 [Journal]
  11. Andrea Cantini, Valentin Goranko
    Nicholas Rescher, "Paradoxes: Their Roots, Range, and Resolution"; Patrick Blackburn, Maarten de Rijke and Yde Venema, "Modal Logic", Cambridge Tracts in Theoretical Computer Science Volume 53. [Citation Graph (0, 0)][DBLP]
    Studia Logica, 2004, v:76, n:1, pp:135-142 [Journal]

  12. Polytime, combinatory logic and positive safe induction. [Citation Graph (, )][DBLP]


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