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