Three seminars

January 10, 2024

Thursday, 18 January 2024, Sala Riunioni (Ca’ Vignal 2) from 9:30 to 13:00


Paul Gorbow (Stockholms universitet)

The Intentum and Intentic Models

I will present the main ideas of a research proposal in the making. It aims to develop a dynamic (potentialist) account of an agent’s first-order intentional attitudes as representative models of (possible) reality. The account introduces the new notion of the intentum, and formally develops intentic models consisting of such intenta. These are meant to be structures that an agent can dynamically construct mentally, and which consequently help us philosophically explain and reason about beliefs, wishes, imaginations, etc. Here follow some promising applications of this framework:

  1. It offers a novel theory of propositions and intentionality, somewhat in the spirit of Frege, but with distinct advantages compared to the two classical accounts of Frege and Russell.

  2. It provides a foundational approach of value to the fragmented field of theoretical research on AI agenthood.

  3. It enables a modular account of the notoriously complex notion of reference.

  4. It provides a lens for approaching philosophical questions about identity.

  5. It helps to philosophically explain knowledge of mathematics.

  6. It provides a modern formal basis for the Kantian theory of categories, with a particular application to mathematical induction (as “synthetic a priori” knowledge).

  7. It sheds light on arbitrary objects.

In my talk, I will explain the basic ideas of the framework and explain a select few of these applications.


Matteo Tesi (Technischen Universität Wien)

Subintuitionistic logics and their modal companions: a nested approach

In the present talk we deal with subintuitionistic logics and their modal companions. In particular, we introduce nested calculi for subintuitionistic systems and for modal logics in the S5 modal cube ranging from K to S4. The latter calculi differ from standard nested systems, as there are multiple rules handling the modal operator. As an upshot, we get a purely syntactic proof of the Gödel–McKinsey–Tarski embedding which preserves the structure and the height of the derivations. Finally, we obtain a conservativity result for classical logic over a weak subintuitionistic system.


Giulio Fellin (Università degli Studi di Verona)

Modal logic for induction: from chain conditions to arithmetic

j.w.w. S. Negri and P. Schuster

We use modal logic to obtain syntactical, proof-theoretic versions of transfinite induction as axioms or rules within an appropriate labelled sequent calculus. While transfinite induction proper, also known as Noetherian induction, can be represented by a rule, the variant in which induction is done up to an arbitrary but fixed level happens to correspond to the Gödel–Löb axiom of provability logic. To verify the practicability of our approach in actual practice, we sketch a fairly universal pattern for proof transformation and test its use in several cases. Among other things, we give a direct and elementary syntactical proof of Segerberg’s theorem that the Gödel–Löb axiom characterises precisely the (converse) well-founded and transitive Kripke frames. We then show that, by adding appropriate rules, this approach allows us to obtain a calculus for a bounded version of Peano Arithmetic. Finally, we observe that, by slightly modifying the rules, we can do the same for arithmetic in ordinals other than ω.