Characterization of Programs and Their Synthesis from a Formalized Theory. - Daniele Marini; Pierangelo Miglioli (MFCS, 1973)

Mathematical Foundations of Motivation Languages and Synthesis Maps. - Pierangelo Miglioli (MFCS, 1974)

Top-down approach to the synthesis of programs. - G. Degli Antoni; Pierangelo Miglioli; Mario Ornaghi (Symposium on Programming, 1974)

First Order Logic as a Tool to Solve and Classify Problems. - Daniele Marini; Pierangelo Miglioli; Mario Ornaghi (GI Jahrestagung, 1975)

A Calculus to Build Up Correct Programs. - Pierangelo Miglioli; Mario Ornaghi (MFCS, 1977)

A Characterization of Abstract Data as Model-Theoretic Invariants. - Alberto Bertoni; Giancarlo Mauri; Pierangelo Miglioli (ICALP, 1979)

Towards a Theory of Abstract Data Types: A Discussion on Problems and Tools. - Alberto Bertoni; Giancarlo Mauri; Pierangelo Miglioli (Symposium on Programming, 1980)

Constructive Proofs as Programs Executable by PrT Nets. - Pierangelo Miglioli; Ugo Moscato; Mario Ornaghi (Selected Papers from the First and the Second European Workshop on Application and Theory of Petri Nets, 1981)

Trees in Kripke Models and in an Intuitionistic Refutation System. - Pierangelo Miglioli; Ugo Moscato; Mario Ornaghi (CAAP, 1981)

A logically justified model of computation I. - Pierangelo Miglioli; Mario Ornaghi (Fundam. Informaticae, 1981)

A logically justified model of computation II. - Pierangelo Miglioli; Mario Ornaghi (Fundam. Informaticae, 1981)

Abstract Data Types and Their Extensions within a Constructive Logic. - Alberto Bertoni; Giancarlo Mauri; Pierangelo Miglioli; Mario Ornaghi (Semantics of Data Types, 1984)

PAP: A Logic Programming System Based on a Constructive Logic. - Pierangelo Miglioli; Ugo Moscato; Mario Ornaghi (Foundations of Logic and Functional Programming, 1986)

Semi-Constructive Formal Systems and Axiomatization of Abstract Data Types. - Pierangelo Miglioli; Ugo Moscato; Mario Ornaghi (TAPSOFT, Vol.1, 1989)

Some Results on Intermediate Constructive Logics. - Pierangelo Miglioli; Ugo Moscato; Mario Ornaghi; Silvia Quazza; Gabriele Usberti (Notre Dame J. Formal Log., 1989)

A Constructivism Based on Classical Truth. - Pierangelo Miglioli; Ugo Moscato; Mario Ornaghi; Gabriele Usberti (Notre Dame J. Formal Log., 1989)

Program Specification and Synthesis in Constructive Formal Systems. - Pierangelo Miglioli; Ugo Moscato; Mario Ornaghi (LOPSTR, 1991)

A constructive logic approach to database theory. - Pierangelo Miglioli; Ugo Moscato; Mario Ornaghi (CNKBS, 1992)

An infinite class of maximal intermediate propositional logics with the disjunction property. - Pierangelo Miglioli (Arch. Math. Log., 1992)

Counting the Maximal Intermediate Constructive Logics. - Mauro Ferrari 002; Pierangelo Miglioli (J. Symb. Log., 1993)

An Improved Refutation System for Intuitionistic Predicate Logic. - Pierangelo Miglioli; Ugo Moscato; Mario Ornaghi (J. Autom. Reason., 1994)

Abstract Parametric Classes and Abstract Data Types defined by Classical and Constructive Logical Methods. - Pierangelo Miglioli; Ugo Moscato; Mario Ornaghi (J. Symb. Comput., 1994)

Refutation Systems for Propositional Modal Logics. - Pierangelo Miglioli; Ugo Moscato; Mario Ornaghi (TABLEAUX, 1995)

A Method to Single out Maximal Propositional Logics with the Disjunction Property I. - Mauro Ferrari 002; Pierangelo Miglioli (Ann. Pure Appl. Log., 1995)

A Method to Single out Maximal Propositional Logics with the Disjunction Property II. - Mauro Ferrari 002; Pierangelo Miglioli (Ann. Pure Appl. Log., 1995)

Exhibiting Wide Families of Maximal Intermediate Propositional Logics with the Disjunction Property. - Guido Bertolotti; Pierangelo Miglioli; Daniela Silvestrini (Math. Log. Q., 1996)

On maximal intermediate predicate constructive logics. - Alessandro Avellone; Camillo Fiorentini; Paolo Mantovani; Pierangelo Miglioli (Stud Logica, 1996)

Generalized Tableau Systems for Intemediate Propositional Logics. - Alessandro Avellone; Pierangelo Miglioli; Ugo Moscato; Mario Ornaghi (TABLEAUX, 1997)

Avoiding duplications in tableau systems for intuitionistic logic and Kuroda logic. - Pierangelo Miglioli; Ugo Moscato; Mario Ornaghi (Log. J. IGPL, 1997)

Synthesis of Programs in Abstract Data Types. - Alessandro Avellone; Mauro Ferrari 002; Pierangelo Miglioli (LOPSTR, 1998)

Duplication-Free Tableau Calculi and Related Cut-Free Sequent Calculi for the Interpolable Propositional Intermediate Logics. - Alessandro Avellone; Mauro Ferrari 002; Pierangelo Miglioli (Log. J. IGPL, 1999)

A Cut-free Sequent Calculus for the Logic of Constant Domains with a Limited Amount of Duplications. - Camillo Fiorentini; Pierangelo Miglioli (Log. J. IGPL, 1999)

On Canonicity and Strong Completeness Conditions in Intermediate Propositional Logics. - Silvio Ghilardi; Pierangelo Miglioli (Stud Logica, 1999)

Extracting information from intermediate semiconstructive HA-systems - extended abstract. - Mauro Ferrari 002; Camillo Fiorentini; Pierangelo Miglioli (Math. Struct. Comput. Sci., 2001)

On Uniformly Constructive and Semiconstructive Formal Systems. - Mauro Ferrari 002; Pierangelo Miglioli; Mario Ornaghi (Log. J. IGPL, 2003)