Arrow Research search

Author name cluster

Matteo Viale

Possible papers associated with this exact author name in Arrow. This page groups case-insensitive exact name matches and is not a full identity disambiguation profile.

2 papers
1 author row

Possible papers

2

FLAP Journal 2017 Journal Article

Useful Axioms.

  • Matteo Viale

We give a brief survey on the interplay between forcing axioms and various other non-constructive principles widely used in many fields of abstract mathematics, such as the axiom of choice and Baire’s category theorem. First of all we outline how, using basic partial order theory, it is possible to reformulate the axiom of choice, Baire’s category theorem, and many large cardinal axioms as specific instances of forcing axioms. We then address forcing axioms with a model-theoretic perspective and outline a deep analogy existing between the standard Łoś Theorem for ultraproducts of first order structures and Shoenfield’s absoluteness for Σ12 -properties. Finally we address the question of whether and to what extent forcing axioms can provide “complete” semantics for set theory. We argue that to a large extent this is possible for certain initial fragments of the universe of sets: The pioneering work of Woodin on generic absoluteness show that this is the case for the Chang model L(Ordω ) (where all of mathematics formalizable in second order number theory can be developed) in the presence of large cardinals, and recent works by the author with Asperó and with Audrito show that this can also be the case for the Chang model L(Ordω1 ) (where one can develop most of mathematics formalizable in third order number theory) in the presence of large cardinals and maximal strengthenings of Martin’s maximum or of the proper forcing axiom. A major open question we leave completely open is whether this situation is peculiar to these Chang models or can be lifted up also to L(Ordκ ) for cardinals κ > ω1.

I&C Journal 2003 Journal Article

A binary modal logic for the intersection types of lambda-calculus

  • Silvio Valentini
  • Matteo Viale

Intersection types discipline allows to define a wide variety of models for the type free lambda-calculus, but the Curry–Howard isomorphism breaks down for this kind of type systems. In this paper we show that the correspondence between types and suitable logical formulas can still be recovered appealing to the fact that there is a strict connection between the semantics for lambda-calculus induced by the intersection types and a Kripke-style semantics for modal and relevant logics. Indeed, we present a modal logic hinted by the analysis of the sub-typing relation for intersection types, and we show that the deduction relation for such a modal system is a conservative extension of the relation of sub-typing. Then, we define a Kripke-style semantics for the formulas of such a system, present suitable sequential calculi, prove a completeness theorem and give a syntactical proof of the cut elimination property. Finally, we define a decision procedure for theorem-hood and we show that it yields the finite model property and cut-redundancy.

v2026.09.13