Pierangelo Miglioli

According to our database1, Pierangelo Miglioli authored at least 35 papers between 1973 and 2003.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2003
On Uniformly Constructive and Semiconstructive Formal Systems.
Log. J. IGPL, 2003

2001
Extracting information from intermediate semiconstructive HA-systems - extended abstract.
Math. Struct. Comput. Sci., 2001

1999
On Canonicity and Strong Completeness Conditions in Intermediate Propositional Logics.
Stud Logica, 1999

A Cut-free Sequent Calculus for the Logic of Constant Domains with a Limited Amount of Duplications.
Log. J. IGPL, 1999

Duplication-Free Tableau Calculi and Related Cut-Free Sequent Calculi for the Interpolable Propositional Intermediate Logics.
Log. J. IGPL, 1999

1998
Synthesis of Programs in Abstract Data Types.
Proceedings of the Logic Programming Synthesis and Transformation, 1998

1997
Avoiding duplications in tableau systems for intuitionistic logic and Kuroda logic.
Log. J. IGPL, 1997

Generalized Tableau Systems for Intemediate Propositional Logics.
Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 1997

1996
On maximal intermediate predicate constructive logics.
Stud Logica, 1996

Exhibiting Wide Families of Maximal Intermediate Propositional Logics with the Disjunction Property.
Math. Log. Q., 1996

1995
A Method to Single out Maximal Propositional Logics with the Disjunction Property II.
Ann. Pure Appl. Log., 1995

A Method to Single out Maximal Propositional Logics with the Disjunction Property I.
Ann. Pure Appl. Log., 1995

Refutation Systems for Propositional Modal Logics.
Proceedings of the Theorem Proving with Analytic Tableaux and Related Methods, 1995

1994
Abstract Parametric Classes and Abstract Data Types defined by Classical and Constructive Logical Methods.
J. Symb. Comput., 1994

An Improved Refutation System for Intuitionistic Predicate Logic.
J. Autom. Reason., 1994

1993
Counting the Maximal Intermediate Constructive Logics.
J. Symb. Log., 1993

1992
An infinite class of maximal intermediate propositional logics with the disjunction property.
Arch. Math. Log., 1992

1991
A Constructive Logic Approach to Database Theory.
Proceedings of the Logic Programming, First Russian Conference on Logic Programming, Irkutsk, Russia, September 14-18, 1990, 1991

Program Specification and Synthesis in Constructive Formal Systems.
Proceedings of the Logic Program Synthesis and Transformation, 1991

1989
A Constructivism Based on Classical Truth.
Notre Dame J. Formal Log., 1989

Some Results on Intermediate Constructive Logics.
Notre Dame J. Formal Log., 1989

Semi-Constructive Formal Systems and Axiomatization of Abstract Data Types.
Proceedings of the TAPSOFT'89: Proceedings of the International Joint Conference on Theory and Practice of Software Development, 1989

1986
PAP: A Logic Programming System Based on a Constructive Logic.
Proceedings of the Foundations of Logic and Functional Programming, 1986

1984
Abstract Data Types and Their Extensions within a Constructive Logic.
Proceedings of the Semantics of Data Types, International Symposium, 1984

1981
A logically justified model of computation II.
Fundam. Informaticae, 1981

A logically justified model of computation I.
Fundam. Informaticae, 1981

Trees in Kripke Models and in an Intuitionistic Refutation System.
Proceedings of the CAAP '81, 1981

Constructive Proofs as Programs Executable by PrT Nets.
Proceedings of the Application and Theory of Petri Nets, 1981

1980
Towards a Theory of Abstract Data Types: A Discussion on Problems and Tools.
Proceedings of the International Symposium on Programming, 1980

1979
A Characterization of Abstract Data as Model-Theoretic Invariants.
Proceedings of the Automata, 1979

1977
A Calculus to Build Up Correct Programs.
Proceedings of the Mathematical Foundations of Computer Science 1977, 1977

1975
First Order Logic as a Tool to Solve and Classify Problems.
Proceedings of the GI - 5. Jahrestagung, Dortmund, 8.-10. Oktober 1975, 1975

1974
Top-down approach to the synthesis of programs.
Proceedings of the Programming Symposium, 1974

Mathematical Foundations of Motivation Languages and Synthesis Maps.
Proceedings of the Mathematical Foundations of Computer Science, 1974

1973
Characterization of Programs and Their Synthesis from a Formalized Theory.
Proceedings of the Mathematical Foundations of Computer Science: Proceedings of Symposium and Summer School, 1973


  Loading...