The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Pierluigi Minari: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Pierluigi Minari
    Analytic combinatory calculi and the elimination of transitivity. [Citation Graph (0, 0)][DBLP]
    Arch. Math. Log., 2004, v:43, n:2, pp:159-192 [Journal]
  2. 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]
  3. Pierluigi Minari, Mitio Takano, Hiroakira Ono
    Intermediate Predicate Logics Determined by Ordinals. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1990, v:55, n:3, pp:1099-1124 [Journal]
  4. Pierluigi Minari
    Theories of Types and Names with Positive Stratified Comprehension. [Citation Graph (0, 0)][DBLP]
    Studia Logica, 1999, v:62, n:2, pp:215-242 [Journal]
  5. Pierluigi Minari
    Analytic proof systems for lambda-calculus: the elimination of transitivity, and why it matters. [Citation Graph (0, 0)][DBLP]
    Arch. Math. Log., 2007, v:46, n:5-6, pp:385-424 [Journal]

  6. A solution to Curry and Hindley's problem on combinatory strong reduction. [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