Skip to main content
SpringerLink
Log in

Preface. In Memoriam Pierangelo Miglioli (1946–1999)

  • Preface
  • Published:
Studia Logica Aims and scope Submit manuscript

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Journal and Conference Papers

  1. Avellone, A., M. Ferrari, and P. Miglioli, ‘Synthesis of programs in abstract data types’, in 8th International Workshop on Logic-based Program Synthesis and Transformation, vol. 1559 of Lecture Notes in Computer Science, pp. 81–100, Springer-Verlag, 1999.

  2. Avellone, A., M. Ferrari, and P. Miglioli, ‘Duplication-free tableau calculi and related cut-free sequent calculi for the interpolable propositional intermediate logics’, Logic Journal of the IGPL 7(4):447–480, 1999.

    Google Scholar 

  3. Avellone, A., M. Ferrari, P. Miglioli, and U. Moscato, ‘A tableau calculus for Dummett predicate logic’, in Walter A. Carnielli and Itala M. D'Ottaviano, editors, Advances in Contemporary Logic and Computer Science (Salvador, 1996), vol. 235 of Contemporary Mathematics, pp. 135–151, American Mathematical Society, 1999.

  4. Ghilardi, S., and P. Miglioli, ‘On canonicity and strong completeness conditions in intermediate propositional logics’, Studia Logica 63(3):353–385, 1999.

    Google Scholar 

  5. Ferrari, M., C. Fiorentini, and P. Miglioli, ‘Goal oriented information extraction in uniformly constructive calculi’, in Proceedings of WAIT'99: Workshop Argentino de Informática Teórica, pp. 51–63. Sociedad Argentina de Informática e Investigación Operativa, 1999.

  6. Fiorentini, C., and P. Miglioli, ‘A cut-free sequent calculus for the logic of constant domains with a limited amount of duplications’, Logic Journal of the IGPL 7(6):733–753, 1999.

    Google Scholar 

  7. Miglioli, P., U. Moscato, and M. Ornaghi, ‘Avoiding duplications in tableau systems for intuitionistic logic and Kuroda logic’, Logic Journal of the IGPL 5(1):145–167, 1997.

    Google Scholar 

  8. Avellone, A., P. Miglioli, U. Moscato, and M. Ornaghi, ‘Generalized tableau systems for intermediate propositional logics’, in D. Galmiche, editor, Proceedings of the 6th International Conference on Automated Reasoning with Analytic Tableaux and Related Methods: Tableaux '97, vol. 1227 of Lecture Notes in Artificial Intelligence, pp. 43–61, Springer-Verlag, 1997.

  9. Miglioli, P., U. Moscato, D. Mundici, and M. Ornaghi, editors, Proceedings of the 5th Workshop on Theorem Proving with Analytic Tableaux and Related Methods, vol. 1071 of Lecture Notes in Artificial Intelligence, Springer-Verlag, 1996.

  10. Avellone, A., C. Fiorentini, P. Mantovani, and P. Miglioli, ‘On maximal intermediate predicate constructive logics’, Studia Logica 57(2–3):373–408, 1996.

    Google Scholar 

  11. Bertolotti, G., P. Miglioli, and D. Silvestrini, ‘Exhibiting wide families of maximal intermediate propositional logics with the disjunction property’, Mathematical Logic Quarterly 42:501–536, 1996.

    Google Scholar 

  12. Ferrari, M., and P. Miglioli, ‘A method to single out maximal propositional logics with the disjunction property I’, Annals of Pure and Applied Logic 76:1–46, 1995.

    Google Scholar 

  13. Ferrari, M., and P. Miglioli, ‘A method to single out maximal propositional logics with the disjunction property II’, Annals of Pure and Applied Logic 76:117–168, 1995.

    Google Scholar 

  14. Miglioli, P., U. Moscato, and M. Ornaghi, ‘Refutation systems for propositional modal logics’, in P. Baumgartner, R. Hähnle, and J. Posegga, editors, Theorem Proving with Analytic Tableaux and Related Methods: 4th International Workshop, Schloss Rheinfels, St. Goar, Germany, vol. 918 of Lecture Notes in Artificial Intelligence, pp. 95–105, Springer-Verlag, 1995.

  15. Miglioli, P., U. Moscato, and M. Ornaghi, ‘An improved refutation system for intuitionistic predicate logic’, Journal of Automated Reasoning 13(3):361–373, 1994.

    Google Scholar 

  16. Miglioli, P., U. Moscato, and M. Ornaghi, ‘How to avoid duplications in refutation systems for intuitionistic logic and Kuroda logic’, in K. Broda, M. D'Agostino, R. Goré, R. Johnson, and S. Reeves, editors, Theorem Proving with Analytic Tableaux and Related Methods: 3rd International Workshop, Abingdon, U.K., pp. 169–187, 1994.

  17. Miglioli, P., U. Moscato, and M. Ornaghi, ‘Abstract parametric classes and abstract data types defined by classical and constructive logical methods’, The Journal of Symbolic Computation 18(1):41–81, 1994.

    Google Scholar 

  18. Ferrari, M., and P. Miglioli, ‘Counting the maximal intermediate constructive logics’, The Journal of Symbolic Logic 58(4):1365–1401, 1993.

    Google Scholar 

  19. Ferrari, M., and P. Miglioli, ‘Counting the maximal intermediate constructive logics’, AILA Preprint n. 11-gennaio/giugno, 1992.

  20. Miglioli, P., ‘An infinite class of maximal intermediate propositional logics with the disjunction property’, Archive for Mathematical Logic 31(6):415–432, 1992.

    Google Scholar 

  21. Miglioli, P., U. Moscato, and M. Ornaghi, ‘A constructive logic approach to database theory’, in Logic Programming. Proceeding of the First Russian Conference on Logic Programming, vol. 592 of Lecture Notes in Computer Science, pp. 302–321, 1992.

  22. Miglioli, P., U. Moscato, and M. Ornaghi, ‘Program specification and synthesis in constructive formal systems’, in K.-K. Lau and T.P. Clement, editors, Logic Program Synthesis and Transformation, Manchester 1991, pp. 13–26, Springer-Verlag, 1991.

  23. Bertoni, A., C. BÖhm, and P. Miglioli, editors, Theoretical computer science. Proceedings of the third italian conference, World Scientific, 1989.

  24. Miglioli, P., U. Moscato, M. Ornaghi, and G. Usberti, ‘A constructivism based on classical truth’, Notre Dame Journal of Formal Logic 30(1):67–90, 1989.

    Google Scholar 

  25. Miglioli, P., U. Moscato, M. Ornaghi, S. Quazza, and G. Usberti, ‘Some results on intermediate constructive logics’, Notre Dame Journal of Formal Logic 30(4):543–562, 1989.

    Google Scholar 

  26. Miglioli, P., U. Moscato, and M. Ornaghi, ‘Semi-constructive formal systems and axiomatization of abstract data types’, in J. Diaz and F. Orejas, editors, TAP-SOFT'89, vol. 351 of Lecture Notes in Computer Science, pp. 337–351, Springer-Verlag, 1989.

  27. Miglioli, P., U. Moscato, and M. Ornaghi, ‘PAP: a logic programming system based on a constructive logic’, in M. Boscarol, L. Carlucci Aiello, and G. Levi, editors, Foundations of Logic and Functional Programming, pp. 143–156, Springer-Verlag, 1988.

  28. Miglioli, P., U. Moscato, and M. Ornaghi, ‘Teorie del primo ordine da un punto di vista di costruttivismo “ingenuo”: compatibilità costruttiva di principi matematici e logici in un sistema deduttivo grande’, in A. Zanardo, editor, Atti degli Incontri di Logica Matematica, vol. 4, pp. 99–113, 1987. In Italian.

  29. Miglioli, P., U. Moscato, and M. Ornaghi, ‘Constructive theories with abstract data types for program synthesis’, in D.G. Skordev, editor, Mathematical Logic and its Applications, pp. 293–302, Plenum Press, New York, 1987.

    Google Scholar 

  30. Miglioli, P., U. Moscato, and M. Ornaghi, ‘Alcuni sistemi costruttivi e semicostruttivi del primo ordine’, in R. Ferro and A. Zanardi, editors, Atti degli Incontri di Logica Matematica, vol. 3, pp. 59–67, 1986. In Italian.

  31. Bertoni, A., G. Mauri, P. Miglioli, and M. Ornaghi, ‘Abstract data types and their extension within a constructive logic’, in G. Kahn, D.B. MacQueen, and G. Plotkin, editors, Semantics of Data Types, vol. 173 of Lecture Notes in Computer Science, pp. 177–195, Springer-Verlag, 1984.

  32. Miglioli, P., and G. Usberti, ‘Una logica del conoscere’, Teoria 2:111–132, 1984. In Italian.

    Google Scholar 

  33. Bertoni, A., G. Mauri, and P. Miglioli, ‘On the power of model theory in specifying abstract data types and in capturing their recursiveness’, Fundamenta Informaticae VI(2):127–170, 1983.

    Google Scholar 

  34. Miglioli, P., U. Moscato, and M. Ornaghi, ‘Un sistema logico-inferenziale di programmazione’, in Aica: atti del congresso annuale, vol. 1, pp. 349–359, 1983. In Italian.

    Google Scholar 

  35. Miglioli, P., U. Moscato, M. Ornaghi, and G. Usberti, ‘Constructive validity and classical truth to assign meaning to programs’, in Second World Conference on Mathematics at the Service of Man, pp. 490–500, Universidad Politecnica De Las Palmas, 1982.

  36. Miglioli, P., and M. Ornaghi, ‘Constructive proofs and logical computations’, Počítače umelá inteligencia 1(5):369–388, 1982.

    Google Scholar 

  37. Miglioli, P., U. Moscato, and M. Ornaghi, ‘Alcuni calcoli intermedi costruttivi’, in C. Bernardi, editor, Atti degli Incontri di Logica Matematica, pp. 377–386, 1982. In Italian.

  38. Miglioli, P., U. Moscato, and M. Ornaghi, ‘Definizioni induttive nei calcoli logici costruttivi e nelle metodologie di programmazione’, in Aica: atti del congresso annuale, vol. 1, pp. 249–257, Aica, Padova, Cleup, 1982. In Italian.

    Google Scholar 

  39. Miglioli, P., U. Moscato, and M. Ornaghi, ‘Constructive proofs as programs executable by PrT Nets’, in C. Girault and W. Reisig, editors, Application and Theory of Petri Nets, vol. 52 of Lecture Notes in Computer Science, pp. 311–322, Springer-Verlag, 1982.

  40. Miglioli, P., and M. Ornaghi. ‘La teoria delle prove nella sintesi dei programmi: alcune note’, Rivista di Informatica, Supplemento al vol. XI(3):49–91, 1981. In Italian.

    Google Scholar 

  41. Miglioli, P., and M. Ornaghi, ‘A logically justified model of computation I’, Fundamenta Informaticae IV(1):151–172, 1981.

    Google Scholar 

  42. Miglioli, P., and M. Ornaghi, ‘A logically justified model of computation II’, Fundamenta Informaticae IV(2):277–341, 1981.

    Google Scholar 

  43. Miglioli, P., U. Moscato, and M. Ornaghi, ‘Trees in Kripke semantics and in intuitionistic refutation system’, in E. Astesiano and C. Böhm, editors, CAAP '81, vol. 112 of Lecture Notes in Computer Science, pp. 316–330, Springer-Verlag, 1981.

  44. Miglioli, P., U. Moscato, and M. Ornaghi, ‘Logica costruttiva e metodi di programmazione: alcune note’, in Aica: atti del congresso annuale, vol. 2, pp. 639–650. Aica, Pavia, 1981. In Italian.

    Google Scholar 

  45. Bertoni, A., G. Mauri, and P. Miglioli, ‘Towards a theory of abstract data types: a discussion on problems and tools’, in International Symposium on Programming. Proceedings of the 4th Colloque International sur la Programmation, pp. 44–58, 1980.

  46. Bertoni, A., G. Mauri, P. Miglioli, and M. Wirsing, ‘On different approaches to abstract data types and the existence of recursive models’, EATCS bulletin 9:47–57, 1979.

    Google Scholar 

  47. Bertoni, A., G. Mauri, and P. Miglioli, ‘A characterization of abstract data as model-theoretic invariants’, in Proceeding of 6th ICALP, vol. 71 of Lecture Notes in Computer Science, pp. 26–37, Springer-Verlag, 1979.

  48. Bertoni, A., G. Mauri, and P. Miglioli, ‘Model theoretic aspects of abstract data specification’, in Proceedings of Mathematical Logic in Computer Science, pp. 181–193, North-Holland, 1978.

  49. Degli Antoni, G., P. Miglioli, and M. Ornaghi, ‘Procedure per la sintesi di programmi’, Rivista di Informatica VII(Supplemento al numero 3):53–83, 1977. In Italian.

    Google Scholar 

  50. Bertoni, A., G. Mauri, and P. Miglioli, ‘Una guida euristica alla soluzione di problemi combinatori’, in Atti del convegno complessità di calcolo, modelli gestionali e territorio, pp. 181–193, 1977. In Italian.

  51. Miglioli, P., and M. Ornaghi, ‘A calculus to build up correct programs’, in Mathematical foundations of computer science (Proceedings of the Sixth Symposium, Tatranská Lomnica, 1977), vol. 53 of Lecture Notes in Computer Science, pp. 398–409, Springer-Verlag, 1977.

  52. Degli Antoni, G., P. Miglioli, and M. Ornaghi, ‘The synthesis of programs as an approach to the construction of reliable programs’, in G. Huet and G. Kahn, editors, Proceedings of the International Symposium on Proving and Improving Programs, Arc et Senans, pp. 327–352, 1975.

  53. Marini, D., P. Miglioli, and M. Ornaghi, ‘First order logic as a tool to solve and classify problems’, in Fünfte Jahrestagung der Gesellschaft für Informatik (Dortmund, 1975), vol. 34 of Lecture Notes in Computer Science, pp. 669–679, Springer-Verlag, 1975.

  54. Miglioli, P., and M. Ornaghi, ‘Sintetizzatore: un programma per la sintesi di programmi corretti’, in Aica: atti del congresso annuale, pp. 31–38, 1975. In Italian.

  55. Miglioli, P., ‘Mathematical foundations of motivation languages and synthesis maps’, in A. Blikle, editor, Mathematical Foundations of Computer Science: 3rd Symposium at Jadwisin near Warsaw, vol. 28 of Lecture Notes in Computer Science, pp. 388–408, Springer-Verlag, 1974.

  56. Miglioli, P., ‘Note sui linguaggi di motivazione e sulle mappe di sintesi’, in Convegno di informatica teorica, pp. 45–71, Mantova, 1974. Gruppo Nazionale di Cibernetica e Biofisica, Associazione Italiana per il Calcolo Automatico, Associazione Europea di Informatica Teorica. In Italian.

  57. De Antonellis, V., G. Degli Antoni, R. Polillo, P. Miglioli, and S. Rossetti, ‘Un sistema di programmazione destinato ad operare su un frammento di lingua italiana’, in Atti del terzo congresso nazionale di cibernetica e biofisica, 1974. In Italian.

  58. Degli Antoni, G., P. Miglioli, and M. Ornaghi, ‘Top-down approach to synthesis of programs’, in Programming symposium. Proceedings, Colloque sur la Programmation, pp. 88–108, 1974.

  59. Marini, D., and P. Miglioli, ‘Characterization of programs and their synthesis from a formalized theory’, in Mathematical Foundations of Computer Science. Proceedings of symposium and summer school, pp. 259–266, Mathematical Institute of the Slovak Academy of Sciences, Computing Research Centre, United Nations D.P. Bratislava, 1973.

Technical reports

  1. Ferrari, M., P. Miglioli, and M. Ornaghi, Foundations of uniformly constructive and uniformly semiconstructive formal systems, Technical Report 256–00, Dipartimento di Scienze dell'Informazione, Università degli Studi di Milano, Italy, 2000. Available at http://homes.dsi.unimi.it/~ferram.

    Google Scholar 

  2. Ferrari, M., C. Fiorentini, and P. Miglioli, Extracting information from intermediate T-systems, Technical Report 252–00, Dipartimento di Scienze dell'Informazione, Università degli Studi di Milano, Italy, 2000. Available at http://homes.dsi.unimi.it/~ferram.

    Google Scholar 

  3. Bertoni, A., G. Mauri, and P. Miglioli, Some uses of model theory to specify abstract data types and to capture their recursiveness, Technical Report 96–93, Dipartimento di Scienze dell'Informazione, Università degli Studi di Milano, Italy, 1993.

    Google Scholar 

  4. Bertoni, A., G. Mauri, P. Miglioli, and M. Ornaghi, Some models of computation from a proof-theoretical point of view, Technical Report 40–88, Dipartimento di Scienze dell'Informazione, Università degli Studi di Milano, Italy, 1988.

    Google Scholar 

  5. Bertoni, A., G. Mauri, P. Miglioli, and M. Ornaghi, Decision problems and evaluation problems in an abstract data type, Technical Report 39–88, Dipartimento di Scienze dell'Informazione, Università degli Studi di Milano, Italy, 1988.

    Google Scholar 

  6. Miglioli, P., U. Moscato, M. Ornaghi, and G. Usberti, Semantical analysis of some (standard or non standard) intermediate propositional constructive logics: maximality and smoothness results, Technical Report 25–88, Dipartimento di Scienze dell'Informazione, Università degli Studi di Milano, Italy, 1988.

    Google Scholar 

  7. Miglioli, P., and M. Ornaghi, A purely logical computing model: the open proofs as programs, Technical Report MIG-7, Istituto di Cibernetica dell'Università di Milano, 1979.

  8. Degli Antoni, G., P. Miglioli, and M. Ornaghi, The synthesis of programs in an intuitionistic frame, Technical report, Istituto di Cibernetica dell'Università di Milano, 1974.

  9. Miglioli, P., La correttezza dei programmi, Tesi di laurea, Dipartimento di Fisica, Università degli Studi di Milano. Relatore Prof. G. Degli Antoni, Correlatore Prof. M. Cugiani, 1970. In Italian.

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Scienze dell'Informazione, Università degli Studi di Milano, Via Comelico 39, Milano, Italy

    Mario Ornaghi

Authors
  1. Mario Ornaghi
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ornaghi, M. Preface. In Memoriam Pierangelo Miglioli (1946–1999). Studia Logica 73, 5–19 (2003). https://doi.org/10.1023/A:1022981105345

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1022981105345

Search

Navigation