Department Mathematik



Logik-Arbeitstagung Bern, München und Verona

December 12–13, 2019
Conference room B 349
Mathematisches Institut LMU
Theresienstr. 39

Logic and Theory Group
Universität Bern
Arbeitsgruppe Mathematische Logik
LMU München
Gruppo Logica
Università degli studi di Verona


Wednesday 11.12

19:30 Welcome Dinner at Sarovar
Fürstenstr. 12

Thursday 12.12

09:00-09:45 Michel Marti: Reinforcement Learning
09:45-10:30 Iosif Petrakis: On the BHK-interpretation of BISH within BISH
10:30-11:00 Coffee Break
11:00-11:30 Michael Bärtschi:ATR and parameters
11:30-12:30 Masahiko Sato: Unification of the Lambda-Calculus and Combinatory Logic
12:30-14:00 Lunch Break
14:00-15:00 Lorenzo Rossi: Bicontextualism
15:00-16:00 Gerhard Jäger: Some set-theoretic reduction principles
16:00-16:30 Coffee Break
16:30-17:30 Matthias Eberl: A relative infinite
17:30-18:30 Thomas Powell: A new application of proof mining in the fixed point theory of uniformly convex Banach spaces
19:30 Dinner at Los Faroles
Nordendstr. 26

Friday 13.12

09:00-10:00 Vasco Brattka: A Brouwer algebra related to the Weihrauch lattice
10:00-10:30 Coffee Break
10:30-11:30 Makoto Fujiwara: Constructivism and weak logical principles over arithmetic


  • Michel Marti: Reinforcement Learning

  • Iosif Petrakis: On the BHK-interpretation of BISH within BISH

    The standard BHK-interpretation of BISH is quite vague. In this talk we explain how an explicit BHK-interpretation of BISH within BISH would look like. For that we are using the following ingredients:
    (i) The fundamental notion of a set-indexed family of sets and its corresponding ∑-and ∏-sets.
    (ii) A proof-relevant formulation of a membership-condition of a subset given by an existential formula. This formulation is connected to Feferman's notion of membership-with-evidence.
    (iii) A proof-relevant formulation of an equality-condition of a set given by an existential formula. This formulation is connected to Martin-Loef's identity type.

  • Michael Bärtschi:ATR and parameters

    We discuss certain technical variants of arithmetical transfinite recursion (without set parameters). It is shown that a certain parameter, called "field variable", can always be included without loss of generality.

  • Masahiko Sato: Unification of the Lambda-Calculus and Combinatory Logic

    It is well-known that the Lambda Calculus and Combinatory Logic are two closely related theories both used to study computable functions. In this talk, however, I will argue that they are in fact one and the same calculus. To show this I will unify these two systems into a single system whose syntax naturally contains the syntax of the two systems. The unification is carried out in three steps:
    1. We start from Church's syntax Λ for λ-terms, but will provide a new way of looking at these terms modulo α-equivalence.
    2. We formalize Combinatory Logic by giving a completely new syntax Δ for Combinatory Logic.
    3. We obtain the ultimate system by simply taking the union of Λ and Δ.
    (Joint work with Takafumi Sakurai and Helmut Schwichtenberg.)

  • Lorenzo Rossi: Bicontextualism

    Can one quantify over absolutely everything? Absolutists answer positively, while relativists answer negatively. Relativists typically justify their rejection of absolute generality via an argument from paradox: given any alleged maximal domain of quantification D, a paradoxical reasoning can be devised that shows that something is not in D. So, relativists conclude, D does not contain absolutely everything. In this paper, I focus on the absolutism/relativism debate in the framework of theories of truth. In its truth-theoretic incarnation, generality relativism is a form of contextualism about truth predications, and the argument from paradox is a version of the Liar Paradox. Contextualist theories of truth have a number of virtues: they provide elegant and uniform solutions to the semantic paradoxes while preserving full classical logic. However, they are forced to interpret harmless quantified sentences (such as «everything is self-identical») in less than than absolutely comprehensive domains, thus misconstruing semantic and scientific generalizations. The purpose of this paper is to improve on this shortcoming, and to show that contextualism is compatible with absolute generality. I develop a bipartite contextualist semantics, bicontextualism for short, in which sentences are divided in two groups: the unparadoxical ones, which are given an absolutist semantics, and the paradoxical ones, which are given a relativist semantics. I then show that bicontextualism retains the virtues of (standard) contextualism, and discuss how it addresses expressive challenges (such as revenge paradoxes).

  • Gerhard Jäger: Some set-theoretic reduction principles

    We study several reduction principles in the context of Simpson’s set-theoretic version of ATR0 and Kripke-Platek set theory KP.

  • Matthias Eberl: A relative infinite

    We investigate how to develop mathematics with the notion of a potential infinite only, using no completed infinities. Potential infinite means that totalities are indefinitely extensible but at each stage finite. This includes Dummett's situation that a reference to a totalities of objects creates a new object of it (e.g. the set of all sets). It turns out that this approach is not a restriction, but an enrichment. This is due to the fact that an indefinitely extensible totality allows intermediate states which behave like completed infinities. These states can be called "indefinitely large" (cf. S. Lavine) or "sufficiently large". In order to describe them we will introduce a notion of a relative infinity.
    Technically, the basics go back to Jan Mycielski. We will formulate it as a kind of Tarskian model theory in which the carrier set is potential infinite. That is, instead of a flat set we use a system (a family of sets). The indefinitely large states are then (relative) limits inside the system. This approach allows extensions to other logics than classical ones, mainly intuitionistic logic. In this talk we will motivate this idea and present the situation for first order logic. We will shortly discuss some meta-mathematical consequences and then introduce a model for STT and mention open topics.

  • Thomas Powell: A new application of proof mining in the fixed point theory of uniformly convex Banach spaces

    Proof mining is a branch of mathematical logic which makes use of proof theoretic techniques to extract quantitative information from seemingly nonconstructive proofs. In this talk, I present a new application of proof mining in functional analysis, which focuses on the convergence of the Picard iterates (Tnx)n∈ℕ for a class of mappings T on uniformly convex Banach spaces whose fixpoint sets have nonempty interior.

  • Vasco Brattka: A Brouwer algebra related to the Weihrauch lattice

    We prove that the Weihrauch lattice can be transformed into a Brouwer algebra by the consecutive application of two closure operators in the appropriate order: first completion and then parallelization. The closure operator of completion is a new closure operator that we introduce. It transforms any problem into a total problem on the completion of the respective types, where we allow any value outside of the original domain of the problem. This closure operator is of interest by itself, as it generates a total version of Weihrauch reducibility that is defined like the usual version of Weihrauch reducibility, but in terms of total realizers. From a logical perspective completion can be seen as a way to make problems independent of their premises. Alongside with the completion operator and total Weihrauch reducibility we need to study precomplete representations hat are required to describe these concepts. In order to show that the parallelized completed Weihrauch lattice forms a Brouwer algebra, we introduce a new multiplicative version of an implication. While the parallelized completed Weihrauch lattice forms a Brouwer algebra with this implication, the completed Weihrauch lattice fails to be a model of intuitionistic linear logic in two different ways. In order to pinpoint the algebraic reasons for this failure, we introduce the concept of a Weihrauch algebra that allows us to formulate the failure in precise and neat terms.
    (Joint work with Guido Gherardi, University Bologna, Italy.)

  • Makoto Fujiwara: Constructivism and weak logical principles over arithmetic

    In 1930’s, A. Heyting introduced so-called Heyting arithmetic (HA) with an informal semantics, called the Brouwer-Heyting-Kolmogorov(BHK) interpretation, which works as a criterion for the constructive reasoning thereafter. Note that HA is based on intuitionstic logic and one can obtain classical arithmetic (PA) just by adding the law of excluded middle (A or not A) into the axioms of HA. Though the sentences provable in HA are valid in the (informal) sense of the BHK interpretation, it seems not that all the sentences valid in the BHK interpretation are provable in HA. Thus some weak fragment of the law of excluded middle seems to be contained in the arithmetic which exactly obeys the BHK interpretation. Motivated from this observation, the structure (derivability relation) of weak logical principles has been studied over Heyting arithmetic and its extension in all finite types. In fact, the weak logical principles are closely related to various kinds of realizability, which can be seen as formal treatments of the BHK interpretation. To show that one logical principle A does not imply another principle B, one typically uses appropriate forms of realizability to show that A has a certain semi-constructive interpretation which B does not. In this talk, we overview the known structure of the weal logical principles and discuss about the relation with the variations of realizability. The contents of this talk are almost the same as those of my previous talk at the workshop "Mathematical Logic and Constructivity: The Scope and Limits of Neutral Constructivism” held at Stockholm University during August 20–23, 2019.


    Pension Josefine


    Franziskus Wiesnet

    Last modified