The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Pierangelo Miglioli: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Pierangelo Miglioli, Ugo Moscato, Mario Ornaghi
    Constructive Proofs as Programs Executable by PrT Nets. [Citation Graph (0, 0)][DBLP]
    Selected Papers from the First and the Second European Workshop on Application and Theory of Petri Nets, 1981, pp:311-322 [Conf]
  2. Pierangelo Miglioli, Ugo Moscato, Mario Ornaghi
    Trees in Kripke Models and in an Intuitionistic Refutation System. [Citation Graph (0, 0)][DBLP]
    CAAP, 1981, pp:316-331 [Conf]
  3. Pierangelo Miglioli, Ugo Moscato, Mario Ornaghi
    A constructive logic approach to database theory. [Citation Graph (0, 0)][DBLP]
    CNKBS, 1992, pp:58-60 [Conf]
  4. Pierangelo Miglioli, Ugo Moscato, Mario Ornaghi
    PAP: A Logic Programming System Based on a Constructive Logic. [Citation Graph (0, 0)][DBLP]
    Foundations of Logic and Functional Programming, 1986, pp:143-156 [Conf]
  5. Daniele Marini, Pierangelo Miglioli, Mario Ornaghi
    First Order Logic as a Tool to Solve and Classify Problems. [Citation Graph (0, 0)][DBLP]
    GI Jahrestagung, 1975, pp:669-679 [Conf]
  6. Alberto Bertoni, Giancarlo Mauri, Pierangelo Miglioli
    A Characterization of Abstract Data as Model-Theoretic Invariants. [Citation Graph (0, 0)][DBLP]
    ICALP, 1979, pp:26-37 [Conf]
  7. Alessandro Avellone, Mauro Ferrari, Pierangelo Miglioli
    Synthesis of Programs in Abstract Data Types. [Citation Graph (0, 0)][DBLP]
    LOPSTR, 1998, pp:81-100 [Conf]
  8. Pierangelo Miglioli, Ugo Moscato, Mario Ornaghi
    Program Specification and Synthesis in Constructive Formal Systems. [Citation Graph (0, 0)][DBLP]
    LOPSTR, 1991, pp:13-26 [Conf]
  9. Pierangelo Miglioli, Ugo Moscato, Mario Ornaghi
    A Constructive Logic Approach to Database Theory. [Citation Graph (0, 0)][DBLP]
    RCLP, 1991, pp:302-321 [Conf]
  10. Pierangelo Miglioli
    Mathematical Foundations of Motivation Languages and Synthesis Maps. [Citation Graph (0, 0)][DBLP]
    MFCS, 1974, pp:388-408 [Conf]
  11. Pierangelo Miglioli, Mario Ornaghi
    A Calculus to Build Up Correct Programs. [Citation Graph (0, 0)][DBLP]
    MFCS, 1977, pp:398-409 [Conf]
  12. Daniele Marini, Pierangelo Miglioli
    Characterization of Programs and Their Synthesis from a Formalized Theory. [Citation Graph (0, 0)][DBLP]
    MFCS, 1973, pp:259-266 [Conf]
  13. G. Degli Antoni, Pierangelo Miglioli, Mario Ornaghi
    Top-down approach to the synthesis of programs. [Citation Graph (0, 0)][DBLP]
    Symposium on Programming, 1974, pp:88-108 [Conf]
  14. Alberto Bertoni, Giancarlo Mauri, Pierangelo Miglioli
    Towards a Theory of Abstract Data Types: A Discussion on Problems and Tools. [Citation Graph (0, 0)][DBLP]
    Symposium on Programming, 1980, pp:44-58 [Conf]
  15. Alberto Bertoni, Giancarlo Mauri, Pierangelo Miglioli, Mario Ornaghi
    Abstract Data Types and Their Extensions within a Constructive Logic. [Citation Graph (0, 0)][DBLP]
    Semantics of Data Types, 1984, pp:177-195 [Conf]
  16. Alessandro Avellone, Pierangelo Miglioli, Ugo Moscato, Mario Ornaghi
    Generalized Tableau Systems for Intemediate Propositional Logics. [Citation Graph (0, 0)][DBLP]
    TABLEAUX, 1997, pp:43-61 [Conf]
  17. Pierangelo Miglioli, Ugo Moscato, Mario Ornaghi
    Refutation Systems for Propositional Modal Logics. [Citation Graph (0, 0)][DBLP]
    TABLEAUX, 1995, pp:95-105 [Conf]
  18. Pierangelo Miglioli, Ugo Moscato, Mario Ornaghi
    Semi-Constructive Formal Systems and Axiomatization of Abstract Data Types. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, Vol.1, 1989, pp:337-351 [Conf]
  19. Mauro Ferrari, Pierangelo Miglioli
    A Method to Single out Maximal Propositional Logics with the Disjunction Property I. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1995, v:76, n:1, pp:1-46 [Journal]
  20. Mauro Ferrari, Pierangelo Miglioli
    A Method to Single out Maximal Propositional Logics with the Disjunction Property II. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1995, v:76, n:2, pp:117-168 [Journal]
  21. Pierangelo Miglioli, Mario Ornaghi
    A logically justified model of computation I. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1981, v:4, n:1, pp:151-172 [Journal]
  22. Pierangelo Miglioli, Mario Ornaghi
    A logically justified model of computation II. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1981, v:4, n:2, pp:277-342 [Journal]
  23. Alessandro Avellone, Mauro Ferrari, Pierangelo Miglioli
    Duplication-Free Tableau Calculi and Related Cut-Free Sequent Calculi for the Interpolable Propositional Intermediate Logics. [Citation Graph (0, 0)][DBLP]
    Logic Journal of the IGPL, 1999, v:7, n:4, pp:447-480 [Journal]
  24. Mauro Ferrari, Pierangelo Miglioli, Mario Ornaghi
    On Uniformly Constructive and Semiconstructive Formal Systems. [Citation Graph (0, 0)][DBLP]
    Logic Journal of the IGPL, 2003, v:11, n:1, pp:1-49 [Journal]
  25. Camillo Fiorentini, Pierangelo Miglioli
    A Cut-free Sequent Calculus for the Logic of Constant Domains with a Limited Amount of Duplications. [Citation Graph (0, 0)][DBLP]
    Logic Journal of the IGPL, 1999, v:7, n:6, pp:733-753 [Journal]
  26. Pierangelo Miglioli, Ugo Moscato, Mario Ornaghi
    Avoiding duplications in tableau systems for intuitionistic logic and Kuroda logic. [Citation Graph (0, 0)][DBLP]
    Logic Journal of the IGPL, 1997, v:5, n:1, pp:- [Journal]
  27. Pierangelo Miglioli, Ugo Moscato, Mario Ornaghi
    An Improved Refutation System for Intuitionistic Predicate Logic. [Citation Graph (0, 0)][DBLP]
    J. Autom. Reasoning, 1994, v:13, n:3, pp:361-373 [Journal]
  28. Pierangelo Miglioli, Ugo Moscato, Mario Ornaghi
    Abstract Parametric Classes and Abstract Data Types defined by Classical and Constructive Logical Methods. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 1994, v:18, n:1, pp:41-81 [Journal]
  29. Mauro Ferrari, Pierangelo Miglioli
    Counting the Maximal Intermediate Constructive Logics. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1993, v:58, n:4, pp:1365-1401 [Journal]
  30. Guido Bertolotti, Pierangelo Miglioli, Daniela Silvestrini
    Exhibiting Wide Families of Maximal Intermediate Propositional Logics with the Disjunction Property. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 1996, v:42, n:, pp:501-536 [Journal]
  31. Mauro Ferrari, Camillo Fiorentini, Pierangelo Miglioli
    Extracting information from intermediate semiconstructive HA-systems - extended abstract. [Citation Graph (0, 0)][DBLP]
    Mathematical Structures in Computer Science, 2001, v:11, n:4, pp:589-596 [Journal]
  32. Pierangelo Miglioli, Ugo Moscato, Mario Ornaghi, Silvia Quazza, Gabriele Usberti
    Some Results on Intermediate Constructive Logics. [Citation Graph (0, 0)][DBLP]
    Notre Dame Journal of Formal Logic, 1989, v:30, n:4, pp:543-562 [Journal]
  33. Pierangelo Miglioli, Ugo Moscato, Mario Ornaghi, Gabriele Usberti
    A Constructivism Based on Classical Truth. [Citation Graph (0, 0)][DBLP]
    Notre Dame Journal of Formal Logic, 1989, v:30, n:1, pp:67-90 [Journal]
  34. Alessandro Avellone, Camillo Fiorentini, Paolo Mantovani, Pierangelo Miglioli
    On maximal intermediate predicate constructive logics. [Citation Graph (0, 0)][DBLP]
    Studia Logica, 1996, v:57, n:2/3, pp:373-408 [Journal]
  35. Silvio Ghilardi, Pierangelo Miglioli
    On Canonicity and Strong Completeness Conditions in Intermediate Propositional Logics. [Citation Graph (0, 0)][DBLP]
    Studia Logica, 1999, v:63, n:3, pp:353-385 [Journal]

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