Mario Ornaghi
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Mario Ornaghi has a total of 10 co-authors. Here are the top co-authors by number of shared publications:
- Kung-Kiu Lau
The University of Manchester
3 shared publications - Pierangelo Miglioli
Università degli Studi di Milano
2 shared publications - Alessandro Avellone
Università degli Studi di Milano
1 shared publication Chris Moss
Department of Computing, Imperial College 180 Queen’s Gate, London SW7 2BZ, United Kingdom
1 shared publication- Julian Richardson
Institute of Representation and Reasoning, Division of Informatics, University of Edinburgh, Scotland, UK
1 shared publication - Mauro Ferrari
Università degli Studi dell’Insubria
1 shared publication
Latest Publications
- 1 January 2003
- Published by Oxford University Press (OUP) in Logic Journal of the IGPL
- Vol. 11 (1) , 1-49
On Uniformly Constructive and Semiconstructive Formal Systems
We propose a formalization of two notions of uniformly constructive formal system, we call uniform e-constructivity and uniform r-constructivity. On an intuitive ground, the first (extended) notion concerns formal systems characterized by calculi with the following properties: any proof of a formula such as A ∨ B (of a formula such as ∃xA(x)) contains sufficient information to build up a proof of A or a proof of B (respectively, a proof of A(t) for some term t). On the other hand, the second (restricted) notion takes into account the same properties only for A ∨ B, ∃xA(x) and t closed. Our treatment allows us to analyze both “weak” systems (containing only purely logical principles or, at most, weak mathematical axioms) and “powerful” ones (comparable with Intuitionistic Arithmetic or extensions of it), and exceeds the class of intuitionistic systems, as well as the class of systems for which normalization or cut-elimination theorems can be stated; moreover, it allows us to tackle systems to which the variants of recursive realizability interpretation most known in literature are not applicable. We also introduce a weaker notion of uniformly semiconstructive formal system, requiring classical logic to complete the “constructive content” involved in its proofs. We give examples of uniformly constructive and uniformly semiconstructive systems. Finally, we provide an example of a system which is not uniformly constructive (more than this, not uniformly semiconstructive), yet satisfying the disjunction property and the explicit definability property.
- 1 January 2003
- Published by Oxford University Press (OUP) in Logic Journal of the IGPL
- Vol. 11 (1) , 1-49
On Uniformly Constructive and Semiconstructive Formal Systems
We propose a formalization of two notions of uniformly constructive formal system, we call uniform e-constructivity and uniform r-constructivity. On an intuitive ground, the first (extended) notion concerns formal systems characterized by calculi with the following properties: any proof of a formula such as A ∨ B (of a formula such as ∃xA(x)) contains sufficient information to build up a proof of A or a proof of B (respectively, a proof of A(t) for some term t). On the other hand, the second (restricted) notion takes into account the same properties only for A ∨ B, ∃xA(x) and t closed. Our treatment allows us to analyze both “weak” systems (containing only purely logical principles or, at most, weak mathematical axioms) and “powerful” ones (comparable with Intuitionistic Arithmetic or extensions of it), and exceeds the class of intuitionistic systems, as well as the class of systems for which normalization or cut-elimination theorems can be stated; moreover, it allows us to tackle systems to which the variants of recursive realizability interpretation most known in literature are not applicable. We also introduce a weaker notion of uniformly semiconstructive formal system, requiring classical logic to complete the “constructive content” involved in its proofs. We give examples of uniformly constructive and uniformly semiconstructive systems. Finally, we provide an example of a system which is not uniformly constructive (more than this, not uniformly semiconstructive), yet satisfying the disjunction property and the explicit definability property.
- 1 July 2000
- Published by Elsevier in Journal of Symbolic Computation
- Vol. 30 (1) , 93-127
An Abstract Formalization of Correct Schemas for Program Synthesis
- 1 July 2000
- Published by Elsevier in Journal of Symbolic Computation
- Vol. 30 (1) , 93-127
An Abstract Formalization of Correct Schemas for Program Synthesis
- 1 January 1997
- Published by Springer Nature
- p. 43-61
Generalized tableau systems for intermediate propositional logics
- 1 January 1997
- Published by Springer Nature
- p. 43-61
Generalized tableau systems for intermediate propositional logics
- Open Access
- 1 January 1996
- Published by BCS Learning & Development Ltd in Electronic Workshops in Computing
Formal Development of Correct Classes in Computational Logic
Quality software must be reusable, extensible and reliable. In computational logic , we have developed an approach to constructing programs that are formally correct. Our approach can provide a basis for constructing software that is (formally) reusable and extensible, and not just reliable but formally correct. In this paper, we explain our notion of correct classes, and how to develop them.
- 1 January 1996
- Published by BCS Learning & Development Ltd in Electronic Workshops in Computing
Open AccessFormal Development of Correct Classes in Computational Logic
Quality software must be reusable, extensible and reliable. In computational logic , we have developed an approach to constructing programs that are formally correct. Our approach can provide a basis for constructing software that is (formally) reusable and extensible, and not just reliable but formally correct. In this paper, we explain our notion of correct classes, and how to develop them.
- 1 July 1994
- Published by Elsevier in Journal of Symbolic Computation
- Vol. 18 (1) , 41-81
Abstract Parametric Classes and Abstract Data Types defined by Classical and Constructive Logical Methods
- 1 July 1994
- Published by Elsevier in Journal of Symbolic Computation
- Vol. 18 (1) , 41-81
Abstract Parametric Classes and Abstract Data Types defined by Classical and Constructive Logical Methods