Pierangelo Miglioli

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