Pierangelo Miglioli

Publication Activity (10 Years)

Years Active: 1973-2003
Publications (10 Years): 0

Publications

Mauro Ferrari, Pierangelo Miglioli, Mario Ornaghi
On Uniformly Constructive and Semiconstructive Formal Systems. Log. J. IGPL 11 (1) (2003)
Mauro Ferrari, Camillo Fiorentini, Pierangelo Miglioli
Extracting information from intermediate semiconstructive HA-systems - extended abstract. Math. Struct. Comput. Sci. 11 (4) (2001)
Silvio Ghilardi, Pierangelo Miglioli
On Canonicity and Strong Completeness Conditions in Intermediate Propositional Logics. Stud Logica 63 (3) (1999)
Alessandro Avellone, Mauro Ferrari, Pierangelo Miglioli
Duplication-Free Tableau Calculi and Related Cut-Free Sequent Calculi for the Interpolable Propositional Intermediate Logics. Log. J. IGPL 7 (4) (1999)
Camillo Fiorentini, Pierangelo Miglioli
A Cut-free Sequent Calculus for the Logic of Constant Domains with a Limited Amount of Duplications. Log. J. IGPL 7 (6) (1999)
Alessandro Avellone, Mauro Ferrari, Pierangelo Miglioli
Synthesis of Programs in Abstract Data Types. LOPSTR (1998)
Pierangelo Miglioli, Ugo Moscato, Mario Ornaghi
Avoiding duplications in tableau systems for intuitionistic logic and Kuroda logic. Log. J. IGPL 5 (1) (1997)
Alessandro Avellone, Pierangelo Miglioli, Ugo Moscato, Mario Ornaghi
Generalized Tableau Systems for Intemediate Propositional Logics. TABLEAUX (1997)
Guido Bertolotti, Pierangelo Miglioli, Daniela Silvestrini
Exhibiting Wide Families of Maximal Intermediate Propositional Logics with the Disjunction Property. Math. Log. Q. 42 (1996)
Alessandro Avellone, Camillo Fiorentini, Paolo Mantovani, Pierangelo Miglioli
On maximal intermediate predicate constructive logics. Stud Logica 57 (2/3) (1996)
Mauro Ferrari, Pierangelo Miglioli
A Method to Single out Maximal Propositional Logics with the Disjunction Property II. Ann. Pure Appl. Log. 76 (2) (1995)
Mauro Ferrari, Pierangelo Miglioli
A Method to Single out Maximal Propositional Logics with the Disjunction Property I. Ann. Pure Appl. Log. 76 (1) (1995)
Pierangelo Miglioli, Ugo Moscato, Mario Ornaghi
Refutation Systems for Propositional Modal Logics. TABLEAUX (1995)
Pierangelo Miglioli, Ugo Moscato, Mario Ornaghi
Abstract Parametric Classes and Abstract Data Types defined by Classical and Constructive Logical Methods. J. Symb. Comput. 18 (1) (1994)
Pierangelo Miglioli, Ugo Moscato, Mario Ornaghi
An Improved Refutation System for Intuitionistic Predicate Logic. J. Autom. Reason. 13 (3) (1994)
Mauro Ferrari, Pierangelo Miglioli
Counting the Maximal Intermediate Constructive Logics. J. Symb. Log. 58 (4) (1993)
Pierangelo Miglioli, Ugo Moscato, Mario Ornaghi
A constructive logic approach to database theory. CNKBS (1992)
Pierangelo Miglioli
An infinite class of maximal intermediate propositional logics with the disjunction property. Arch. Math. Log. 31 (6) (1992)
Pierangelo Miglioli, Ugo Moscato, Mario Ornaghi
A Constructive Logic Approach to Database Theory. RCLP (1991)
Pierangelo Miglioli, Ugo Moscato, Mario Ornaghi
Program Specification and Synthesis in Constructive Formal Systems. LOPSTR (1991)
Pierangelo Miglioli, Ugo Moscato, Mario Ornaghi, Gabriele Usberti
A Constructivism Based on Classical Truth. Notre Dame J. Formal Log. 30 (1) (1989)
Pierangelo Miglioli, Ugo Moscato, Mario Ornaghi
Semi-Constructive Formal Systems and Axiomatization of Abstract Data Types. TAPSOFT, Vol.1 (1989)
Pierangelo Miglioli, Ugo Moscato, Mario Ornaghi, Silvia Quazza, Gabriele Usberti
Some Results on Intermediate Constructive Logics. Notre Dame J. Formal Log. 30 (4) (1989)
Pierangelo Miglioli, Ugo Moscato, Mario Ornaghi
PAP: A Logic Programming System Based on a Constructive Logic. Foundations of Logic and Functional Programming (1986)
Alberto Bertoni, Giancarlo Mauri, Pierangelo Miglioli, Mario Ornaghi
Abstract Data Types and Their Extensions within a Constructive Logic. Semantics of Data Types (1984)
Pierangelo Miglioli, Mario Ornaghi
A logically justified model of computation I. Fundam. Informaticae 4 (1) (1981)
Pierangelo Miglioli, Mario Ornaghi
A logically justified model of computation II. Fundam. Informaticae 4 (2) (1981)
Pierangelo Miglioli, Ugo Moscato, Mario Ornaghi
Constructive Proofs as Programs Executable by PrT Nets. Selected Papers from the First and the Second European Workshop on Application and Theory of Petri Nets (1981)
Pierangelo Miglioli, Ugo Moscato, Mario Ornaghi
Trees in Kripke Models and in an Intuitionistic Refutation System. CAAP (1981)
Alberto Bertoni, Giancarlo Mauri, Pierangelo Miglioli
Towards a Theory of Abstract Data Types: A Discussion on Problems and Tools. Symposium on Programming (1980)
Alberto Bertoni, Giancarlo Mauri, Pierangelo Miglioli
A Characterization of Abstract Data as Model-Theoretic Invariants. ICALP (1979)
Pierangelo Miglioli, Mario Ornaghi
A Calculus to Build Up Correct Programs. MFCS (1977)
Daniele Marini, Pierangelo Miglioli, Mario Ornaghi
First Order Logic as a Tool to Solve and Classify Problems. GI Jahrestagung (1975)
G. Degli Antoni, Pierangelo Miglioli, Mario Ornaghi
Top-down approach to the synthesis of programs. Symposium on Programming (1974)
Pierangelo Miglioli
Mathematical Foundations of Motivation Languages and Synthesis Maps. MFCS (1974)
Daniele Marini, Pierangelo Miglioli
Characterization of Programs and Their Synthesis from a Formalized Theory. MFCS (1973)