The announcements are posted to a seminar mailing list. All people interested in the seminar and not belonging yet to the list can send an e-mail to "sara dot negri at helsinki dot fi" to be included among the recipients.
The research seminar in logic is primarily intended for the presentation of original research in logic and philosophy of mathematics by junior and senior researchers and by international guests. The detailed schedule of the seminar, with titles and abstracts of the presentations will be posted on this web page (see below).
Credits are acquired through regular attendance, active participation in the discussions and, when possible, a presentation at the seminar. The presentation can be based either on existing literature, to be agreed with the docent, or on original research.
Please cf. Web Oodi for the registration and a description of the learning goals in Finnish.
Abstract: Aristotle's assertoric syllogistic, though it may have fallen out of use, has not fallen out of favor, and still holds a distinguished place in the history of logic. The same cannot, however, be said of his modal syllogistic. The prevailing opinion here seems to be that it is defective to such a degree that no amount of tinkering can resuscitate it. In this talk I first present a novel system of quantified logic formulated by Hanoch Ben-Yami and labelled the Quantified Argument Calculus, or Quarc for short. Quarc, I argue, provides for a better representation than competing systems, and in a manner free of tinkering, of Aristotelian syllogistic. Having established this, I turn to the modal, specifically apodeictic, syllogistic. Here I compare Ben-Yami's approach to the currently most popular, and arguably successful, defence of Aristotle - that of Marko Malink and his Heterodox dictum semantics. I show that this attempt still falls short of overcoming the familiar problems, and in a manner that might be indicative of a mismatch between Aristotelian and modern logic.
13.4.2018: Sergei Soloviev, IRIT, Toulouse "Is Proof Theory about Proofs or about Provability?"
Abstract: The opinion that proofs may be of interest themselves, and not only from the point of view of what is proved, had become (more or less generally) accepted by logicians relatively recently. For example, it was advocated by G. Kreisel. Another opinion, that the proof of a true proposition is determined by this proposition and thus proofs are of no independent interest, was common not long ago. This talk is partly historical - the evolution of ideas concerning this dilemma is traced. Some mildly technical examples that support the idea that proofs are of independent interest to modern logic are included as well.
23.3.2018: Eugenio Orlandelli "Labelled calculi for term-modal logics: non-rigid designators and decidable fragments"
Abstract: Term-modal logics are quantified epistemic logics where the epistemic operators are indexed by terms of the language. We introduce labelled sequent calculi for term-modal logics with non-rigid and non-denoting designators and we introduce some decidable fragments thereof. First, we extend term-modal logics with the operator of predicate abstraction in order to deal with non-rigid and non-denoting designators. Then, two decidable fragments of these logics will be introduced: one that simulates monotone non-normal logics and another one that simulates normal multi-agent epistemic logics with quantification over groups of agents. These logics are defined semantically. Then, each of them is proof-theoretically characterized by a labelled calculus with good structural properties. Finally, we prove that the fragments considered are decidable, and we characterize the complexity of the validity problem for some of them.
2.3.2018: Jan von Plato "The main problem of "Grundlagenforschung""
Hilbert's second problem, the consistency of analysis
Ackermann's purported proof of the consistency of arithmetic around 1925
Gödel'ss discovery of incompleteness in the summer of 1930 in the light of his preserved notes
Evolution of the consistency problem in the 1930s
16.2.2018: Annika Kanckos "The no-counterexample interpretation in an invertible sequent calculus."
Abstract: We will have a look at Kreisel's no-counterexample interpretation and prove it in an invertible sequent calculus. The NCI-interpretation is an interpretation of PA in a quantifier-free functional theory, is equivalent to Gödel's Dialectica interpretation paired with a double-negation interpretation and implies the consistency of PA. The presentation will as a background include information about the invertible sequent calculus system G3c in hope to make the presentation accessible without prior knowledge on the subject.
26.1.2018: Fausto Barbero "Team semantics for causal dependence and interventionist counterfactuals''
Abstract: Hodges' team semantics, which evaluates formulas on sets of assignments, has been a key instrument for the logical investigation of data-driven notions of dependence (database dependencies, probabilistic dependencies and more). There are instead notions of dependence that cannot be reduced to mere properties of collections of data; examples of this kind are the notions of causal dependence and (interventionist) counterfactual dependence which arise from manipulationist theories of causation (Pearl, Woodward and others). In spite of this state of affairs, it is not unusual that the literature on causation mixes causal, observational and probabilistic ingredients in its statements and notations. I will present a hybrid semantical system (developed in collaboration with G. Sandu) that encompasses all these kinds of discourses, in particular assigning a meaning to interventionist counterfactuals over sets of assignments. I will then analyze some of the (old and new) logical aspects of this causal team semantics.
1.12.2017: Marianna Girlando (Univ. of Aix-Marseille and Univ. of Helsinki) "A proof theoretical approach to conditionals".
Abstract: Conditional logics are extensions of classical propositional logic: they display an additional operator suited to represent conditional sentences - such as counterfactuals - that cannot be captured by material implication. These logics were introduced after 1960 by Stalnaker and Lewis, and have been widely studied since then: other than counterfactual reasoning, they can be used to capture forms of non-monotonic inference and belief change. We are interested in defining deductive calculi (in particular: sequent calculi) for the widest possible family of conditional logics. In this seminar we will present labelled sequent calculi, that is to say, calculi that import part of the semantic information into the rules. To this aim, after a survey of the principal systems of possible world semantics devised for conditional logics, we shall focus on neighbourhood semantics. Neighbourhood models a generalization of Lewis' sphere models, and associate to each world a set of sets of worlds. This semantics allows for the definition of a sequent calculus with strong proof theoretical properties for a large number of conditional logics, including Lewis' logics. We will detail the method to construct the rules out of neighbourhood models, and present the main properties of the resulting calculi. (Joint work with Sara Negri and Nicola Olivetti)
17.11.2017: Mirja Hartimo ''On Husserl's Structuralist Philosophy of Mathematics''
Abstract: The paper discusses Husserl's view of mathematics by means of two theses, namely the Incompleteness Claim and the Dependence Claim, with which Øystein Linnebo (2008) has characterized non-eliminative structuralism as opposed to the more traditional Platonist view of mathematics. According to the Incompleteness Claim, mathematical objects are incomplete in the sense that they have no non-structural properties. The Dependence Claim holds that the mathematical objects are dependent on each other and/or structure to which they belong. Husserl's view is shown to be a combination view: It is generally a species of non-eliminative structuralism, of which the two claims hold. However, in addition the Incompleteness Claim motivates constructivism about the mathematical objects. Moreover, due to the ''thinness'' of his ''mathematics-first'' approach, he is ultimately also open to the more traditionally Platonist approaches.
Linnebo, Ø (2008) Structuralism and the Notion of Dependence, Philosophical Quarterly, 58: 59-79.
3.11.2017: Markus Pantsar "Cognitive complexity and mathematical problem solving"
Abstract: The prevalent paradigm in modelling human cognitive capacities focuses on computational explanations. When it comes to mathematical problem solving, this approach appears to imply that the complexity of a problem can be equated with the complexity of the cognitive task of solving the problem. But in the computational approach we are concerned only with the optimal algorithms for solving problems, whereas human cognizers use many heuristic tools (e.g. diagrams) that make their solutions computationally unoptimal. In this talk, I propose a contrast between optimal and humanly optimal algorithms, which gives us a wider framework in which to study cognitive complexity.
13.10.2017: Andreas Fjellstad (U. of Helsinki & U. of Bergen) "Imitating revision-theoretic limit rules for truth and validity"
Abstract: This paper develops a labelled sequent calculus to represent limit rules in transfinite revision sequences for (self-referential) truth- and validity-predicates. Following the presentation of the calculus, we highlight some features of the resulting logic regarding the extent to which the defined predicates can be said to capture truth and validity with respect to classical logic. It is argued that, whereas the truth-predicate fails to capture truth in classical logic, the validity-predicate seems to adequately describe classical logic.
6.10. 2017: Hanoch Ben-Yami (CEU, Budapest) "The Quantified Argument Calculus"
Abstract: I present a logic I and others have recently developed, in which the quantifier attaches to a unary predicate and together they form a quantified argument, occurring at the argument positions of predicates. That is, if the Natural Language sentence "Alice is polite" is formalised P(a), the sentence "Some students are polite" shall be formalised P(∃S). In several ways, this logic -the Quantified Argument Calculus (Quarc)- is closer to Natural Language more than is any version of Frege's Predicate Calculus (PC), which will become clear as I proceed to discuss further of its features. For instance, Quarc incorporates, like Natural Language and unlike PC, both sentential negation and predication negation, as well as converse relation-terms. It also sheds light on the necessity for the expressive power of Natural Language of these devices. The use of anaphors vis-a-vis variables is also discussed. I next describe the system's semantics and proof systems, and its meta-logical properties. I then extend Quarc to modal logic and show how its version of the Barcan formulas and of their converses come out straightforwardly invalid, which is apparently an advantage of modal Quarc over modal PC. Finally, I shall mention other work which has been done on the system, among other things extending Quarc in various ways, and directions for further research, some currently pursued. Arguably, Quarc might be preferable over PC as a tool to the study of the logic and semantics of Natural Language.
22.9.2017: Gabriel Sandu: "The genesis of modal logic in Northern Europe"
Abstract: I will be concerned with the beginnings of modal logic in the fifties\ and early sixties as reflected in the work of G. H. von Wright, Jaakko Hintikk\ a, and Stig Kanger, making some comparisons to the work of Saul Kripke.
8.9.2017: Jan von Plato "Gödel's reading of Gentzen's first consistency proof for arithmetic".
Abstract: A shorthand notebook of Gödel's from late 1935 shows that he read Gentzen's original, unpublished consistency proof for arithmetic. By 1941, many such notebooks were filled with various formulations of the result, one with explicit use of choice sequences, and a generalization based on an induction principle for functionals of finite type over Baire space. Gödel's main aim was to extend Gentzen's result into a consistency proof for analysis. In the lecture, an overview of these so far unknown results about consistency proofs for arithmetic will be presented. Last updated September 2019