»OCIE Seminar in History and Philosophy of Mathematics

The Orange County Inland Empire (OCIE) Seminar series in History and Philosophy of Mathematics takes place at Chapman University as its main host, and is co-organized together with researchers from UC Riverside, CSU San Bernardino, and Pitzer College. It also occasionally integrates the Chapman University D.Sc. program in Math, Philosophy and Physics as its Graduate Colloquium.

The seminars are held in hybrid format on the Chapman University campus in the Keck Center, home of Schmid College of Science and Technology, in room KC 153 (no. 30 on the Campus map, at the intersection of Walnut Ave. and Center St.), or on Zoom.

Spring 2025


Toggle Section

January 24, 2025: Thomas Seiller

OCIE Seminar in History and Philosophy of Mathematics

The Orange County Inland Empire (OCIE) Seminar series in History and Philosophy of Mathematics takes place at Chapman University as its main host, and is co-organized together with researchers from UC Riverside, CSU San Bernardino, and Pitzer College. It also occasionally integrates the Chapman University D.Sc. program in Math, Philosophy and Physics as its Graduate Colloquium.

The seminars are held in hybrid format on the Chapman University campus in the Keck Center, home of Schmid College of Science and Technology, in room KC 153 (no. 30 on the Campus map, at the intersection of Walnut Ave. and Center St.), or on Zoom.

Spring 2025


Expand

January 24, 2025: Thomas Seiller

Logical structures arising from corpora

Speaker: Thomas Seiller (CNRS, Laboratoire d'Informatique de Paris-Nord)
Time: 4:00 - 6:50pm
Location: KC 153


Abstract:

The impressive results obtained by generative language models witness that statistical information about a (large enough) corpus can be used to extract the structure of natural langage. As part of a general effort to investigate how to mathematically understand this process, Bradley, Gastaldi and Terilla have proposed a generalisation of the standard notion of formal concepts to incorporate quantitative information. This approach consists in moving from sets to functions over sets (using presheaves): the generalised formal concepts are thus obtained as so-called nuclei (fixed points) of an adjunction. In this talk I will explain how this generalisation of formal concepts turns out to coincide exactly with a construction of models of (fragments of) linear logic.
 
 

February 7, 2025: Silvia De Toffoli (4:45-6:15pm PST)

What Mathematical Explanation Need Not Be 

(joint work with Elijah Chudnoff)

Speaker: Silvia De Toffoli (School for Advanced Studies IUSS Pavia)
Time: 4:45-6:15pm PST
Location: KC 153


Abstract:

Recent works in the philosophy of mathematical practice and mathematical education have challenged orthodox views of mathematical explanation by developing Understanding-first accounts according to which mathematical explanation should be cashed out in terms of understanding. In this article, we explore two arguments that might have motivated this move: (i) the context-sensitivity argument and (ii) the inadequacy of knowing why argument. We show that although these arguments are derived from compelling observations, they ultimately rest on a misunderstanding of what explanation-first accounts are committed to and an underestimation of the resources available to them. By clarifying the terms at play in the debate and distinguishing different objects of evaluation, we show that the insightful observations about practice and education made by challengers to the orthodoxy are in fact best accounted for within the traditional Explanation-first framework.

February 21, 2025: Jacopo Emmenegger

Title: TBA

Speaker: Jacopo Emmenegger (University of Genoa)
Time: 4:00 - 6:50pm
Location: KC 153


Abstract:

TBA

February 28, 2025: Carl Posy (9:00am-11:00am PST)

Infinity, Paradox, and the Fall of Hilbert’s Program

Speaker: Carl Posy (Hebrew University of Jerusalem)
Time: 9:00am-11:00am PST
Location: TBA


Abstract:

The tug between infinitary thought and constructivism has been a constant theme throughout the history of mathematics: Time and again, Platonistic infinitary methods (positing finitely inaccessible objects, unfulfillable tasks) have proven to be essential to mathematics; while empiricist thinkers have repeatedly striven to reconcile this fact with finitary (constructivist) constraints. In modern times, David Hilbert's formalist program is the most famous reconciliation attempt. Hilbert aimed to secure infinitary mathematics via finitely graspable formal systems. The program notoriously failed. Gödel’s theorems did it in.

The first part of my talk concerns that downfall. Using some known and new tools I’ll show that Hilbert’s program contains the seeds of its own downfall. Specifically, the central notion of a consistent and adequate formalism already presupposes ways of thinking that unleash infinity and thus clash with and even block his finitary goal.

But then I’ll point out that infinity itself is not so central a sticking point as Hilbert made it out to be. Those damning infinitary modes of thinking are in fact instances of principles that have nothing to do with infinity. Indeed, I will show that these principles underlie some decidedly finite paradoxes. An interesting observation on its own.

Having shown this, time permitting, I'll tell you about some consequences of that observation for understanding the conflict between Platonism and empiricism in particular and some other issues in the general metaphysics of mathematics

March 7, 2025: Greg Restall

Title: TBA

 

Speaker: Greg Restall (University of St Andrews)
Time: 4:00 - 6:50pm
Location: KC 153


Abstract: 

TBA

March 14, 2025: Vincent Jullien

Title: TBA

Speaker: Vincent Jullien (University of Nantes)
Time: 4:00 - 6:50pm
Location: KC 153


Abstract:

TBA 

April 4, 2025: Speaker TBA

Title: TBA

Speaker: TBA
Time: 4:00 - 6:50pm
Location: KC 153


Abstract: 

TBA

April 11, 2025: Otávio Bueno

Title: TBA

Speaker: Otávio Bueno (University of Miami)
Time: 4:00 - 6:50pm
Location: KC 153


Abstract:

TBA 

April 18, 2025: Speaker TBA

Title: TBA

Speaker: TBA
Time: 4:00 - 6:50pm
Location: KC 153


Abstract: 


TBA

April 25, 2025: Speaker TBA

Title TBA

Speaker: TBA
Time: 4:00 - 6:50pm
Location: KC 153


Abstract:

TBA

May 2, 2025: Speaker TBA

Title TBA

Speaker: TBA
Time: 4:00 - 6:50pm
Location: KC 153


Abstract:

TBA

May 9, 2025: Speaker TBA

Title TBA

Speaker: TBA
Time: 4:00 - 6:50pm
Location: KC 153


Abstract:

TBA

May 16, 2025: Speaker TBA

Title TBA

Speaker: TBA
Time: 4:00 - 6:50pm
Location: KC 153


Abstract:

TBA

Fall 2024


Toggle Section

August 30, 2024: Marco Panza

Frege's Definition of Real Numbers is Consistent

Speaker: Marco Panza (Chapman University)
Time: 4:00 - 6:50pm
Location: KC 153


Abstract:

In the second volume of Grundgesetze (1903), Frege outlined an original definition of real numbers as ratios of magnitudes, and partially realized his plan, by presenting a formal definition of domains of magnitudes. The remaining part of the definition of reals, namely the definition of ratios over such domains, should have been presented in a third volume to be published later. This never happened since in the meantime Frege received Russell's unfamous letter informing him about the inconsistency of the formal system, presented in the first volume (1893), within which both his definition of natural numbers and that of domains of magnitudes are stated. Frege unsuccessfully tried to find a way out of the contradiction, then he abandoned his project. In my talk, I shall show that he could have gone ahead with his planned definition of real numbers by slightly modifying his definition of domains of magnitudes so as to avoid inconsistency. The changes he should have made for this purpose are so marginal and local that one might conclude that his envisaged definition is essentially consistent and that Frege was wrong in renouncing it.


 

September 6, 2024: Guram Bezhanishvili

The Gödel Translation: History and New Directions

Speaker: Guram Bezhanishvili (New Mexico State University)
Time: 4:00 - 6:50pm
Location: KC 153


Abstract:

The Gödel translation (1933) interprets the intuitionistic propositional calculus IPC as a fragment of modal logic. In 1940s, McKinsey and Tarski proved that this provides a faithful embedding of IPC into Lewis’ modal system S4. Their result was further generalized to other extensions of IPC. One of the culminations of this line of research is the celebrated Blok-Esakia theorem (1976) which establishes an isomorphism between extensions of IPC and Grz — the well-known extension of S4 introduced by Grzegorczyk (1967).

Things become more complicated when the propositional logics under consideration are replaced by their predicate extensions. As we will see, the Blok-Esakia isomorphism fails already for the one-variable fragments of these logics. This gives rise to a series of problems, which remain open to this day. The aim of this talk is to introduce the audience to this beautiful area of research. Towards the end, I also plan to discuss promising future directions.



September 13, 2024: Carlos Álvarez Jiménez

A Possible Way to Read (and Interpret) Euclid's Elements

Speaker: Carlos Álvarez Jiménez (Universidad Nacional Autónoma de México)
Time: 4:00 - 6:50pm
Location: KC 153


Abstract: 

A classical way to introduce the main problems related to the Philosophy of Mathematics follows from the (classical) problem of the foundations of mathematics. In this talk, I do not intend to discuss directly this topic, but to suggest that an interesting contribution to this classical question may be answered by asking which are, if there are, the fundamental theorems in mathematics. This very wide question may be focused in the particular domain of Euclidean geometry and, particularly, concerning Euclid's reconstruction of plane geometry.

In this talk, I will suggest that Euclid's Books I and II of the Elements may be read in this way, as a geometric inquiry guided by some "fundamental theorems".


September 20, 2024: Stephen Mackereth

The Philosophical Significance of Gödel’s Dialectica Translation

Speaker: Stephen Mackereth (Dartmouth College)
Time: 4:00 - 6:50pm
Location: KC 153


Abstract:

One of the most ambitious projects in the foundations of mathematics ever conceived was Hilbert’s Program in the 1920s. The aim of this Program was to give finitary consistency proofs for infinitary mathematics, thus putting infinitary mathematics on a more secure footing. There is a popular narrative that Hilbert’s Program was decisively refuted by Gödel’s incompleteness theorems in 1931. However, Hilbert’s school continued to work on consistency proofs for decades after the appearance of the incompleteness theorems. Moreover, Gödel himself, in his remarkable Dialectica paper of 1958, pursues a modified version of Hilbert’s Program: he presents a new, Hilbert-style consistency proof for arithmetic based on “an extension of the finitary standpoint,” and he clearly regards this proof as epistemologically significant. In this talk I shall discuss Gödel’s 1958 paper in some detail, with an eye towards the following questions. 1. Is there any truth to the claim that Hilbert’s Program was refuted by the incompleteness theorems? 2. What epistemological significance did Gödel ascribe to his Dialectica proof, and was he correct about this?

September 27, 2024: Drew Moshier and Alexander Kurz

Interestingness in Mathematics

Speakers: Drew Moshier and Alexander Kurz (Chapman University)
Time: 4:00 - 6:50pm
Location: KC 153


Abstract:

AI (both symbolic and neural) is changing the way we do mathematics. Already now, cutting edge proofs by leading mathematicians are implemented in programming languages such as Lean and verified by type-checking algorithms. How far are we away from machines doing interesting mathematics independently and without human guidance?

Any answer to this question will depend on understanding what mathematics humans find interesing. This discussion, led by Alexander Kurz and Drew Moshier, will explore the question of interestingness in mathematics. In particular, we want to understand how to define proxies for interestingness  based on existing archives of formal proofs.


October 4, 2024: Wesley H. Holliday

From Constructive Mathematics and Quantum Mechanics to Fundamental Logic

 

Speaker: Wesley H. Holliday (UC Berkeley)
Time: 4:00 - 6:50pm
Location: KC 153


Abstract: 

Non-classical logics have been proposed in a number of domains, including constructive mathematics and quantum mechanics. In this talk, I will identify a base logic beneath some of these non-classical logics that I suggest has a certain fundamental status. I will give an introduction to the proof theory and semantics of this “Fundamental Logic.” 
 
An associated paper is available at https://arxiv.org/abs/2207.06993.


Other references:
 
G. Birkhoff and J. von Neumann, “The Logic of Quantum Mechanics,” Annals of Mathematics, Vol. 37, 1936.
A.S. Troelstra and D. van Dalen, Constructivism in Mathematics, Vol. 1, North-Holland, 1988.

October 18, 2024: Mateja Jamnik

How can we make trustworthy AI?

Speaker: Mateja Jamnik (University of Cambridge)
Time: 4:00 - 6:50pm
Location: KC 153


Abstract:

Not too long ago most headlines talked about our fear of AI. Today, AI is ubiquitous, and the conversation has moved on from whether we should use AI to how we can make the AI systems that we use in our daily lives trustworthy. In this talk I look at some key technical ingredients that help us build confidence and trust in using intelligent technology. I argue that intuitiveness, interaction, explainability and inclusion of human domain knowledge are essential in building this trust. I present some of the techniques and methods we are building for making AI systems that think and interact with humans in more intuitive and personalised ways, enabling humans to better understand the solutions produced by machines, and enabling machines to incorporate human domain knowledge in their reasoning and learning processes.


October 25, 2024: Benjamin Faltesek

Can the necessity of mathematics be derived?

Speaker: Benjamin Faltesek (Chapman University)
Time: 4:00 - 6:50pm
Location: KC 153


Abstract: 

Hannes Leitgeb (2020) has offered an argument for the necessity of mathematics. In particular, he gives a derivation using the modal system K of the statement that mathematical theorems are necessarily true. In this talk, I will first motivate the questions of whether mathematics is necessary, and if so, why. I will also defend the strategy of deriving the necessity of mathematics, on the principle that arguments can be explanatory. I will then set out Leitgeb's premises and reasoning. Some key assumptions are that all mathematical theorems are (actually or simply) true and that they can always be translated into ZFC. Although the argument has deficiencies, I will defend Leitgeb's suggestion that the truths of set theory are necessary due to the necessity of identity and the Axiom of Extensionality.



 

November 1, 2024: Patrick Ryan

A Reassessment of Gödel’s Doctrine: The Necessity of Infinity

Speaker: Patrick Ryan (Chapman University)
Time: 4:00 - 6:50pm
Location: KC 153


Abstract:

In his landmark 1931 paper, Gödel demonstrated the existence of finitary statements that required infinitary resources to prove them. This led him to postulate what Solomon Feferman called Gödel’s Doctrine, namely, that “the unlimited transfinite iteration of the powerset operation is necessary to account for finitary mathematics.” This claim garnered further support over the course of the 20th century because of the production of various other “finitary independence” results. Nonetheless, proof theoretic work by Feferman and others showed that these finitary results could be proved using relatively weak systems, e.g., predicatively justifiable systems, thereby challenging Gödel’s Doctrine. In this talk, I would like to argue that, though the technical results of Feferman and others are unimpeachable, their philosophical significance is overstated. That is, even if Gödel’s Doctrine is dubious when we understand "necessary" to mean "proof theoretically necessary," it can be vindicated when we think of other senses in which strong infinitary resources might be necessary for mathematics. This is done by investigating a fascinating collection of finitary statements that possess multiple proofs employing both infinitary and finitary resources. I consider how an analysis of such results can inform debates in the philosophy of mathematics, especially discussions of purity, content, and explanation. In particular, if a finitary theorem τ has a perfectly cogent, finitary proof, why then provide an infinitary proof of τ , a proof involving principles of an ostensibly different sort? What is gained? Do such infinitary proofs play an explanatory role? Is there then a sense in which infinity is necessary? I conclude by indicating some promising directions for future research.


November 8, 2024: Walter Carnielli and Juliana Bueno-Soler

How to Benefit from Uncertainty: An Introduction to Paraconsistent Bayesian Update

Speakers: Walter Carnielli and Juliana Bueno-Soler (CLE/FT- University of Campinas, Brazil, and Chapman University, USA)
Time: 4:00 - 6:50pm
Location: KC 153


Abstract: 


One of the main questions in Bayesian thinking is how we adjust our beliefs when new evidence comes along. At the heart of this process are relationships between evidence E and hypotheses H, which bring up key ideas like plausibility, confirmation, and acceptability. However, these relationships can get tricky.

In this talk, we’ll show how paraconsistent and paracomplete logics can help solve some of these challenges in Bayesian reasoning. Using a new approach to probability based on the Logic of Evidence and Truth (LET_F​), which is designed to handle both evidence for or against a judgement—even when it's incomplete or contradictory—we offer a way to measure how much evidence supports a given statement. We’ll look at some examples showing how paraconsistent and paracomplete Bayesian approaches can effectively handle contradictions in reasoning.

We think these ideas could impact not just the philosophy of science but also fields like Artificial Intelligence, probabilistic networks, and other new models where handling uncertainty and contradictions is crucial.


Reference:

W. A. Carnielli and J. Bueno-Soler
Where the truth lies: a paraconsistent approach to Bayesian epistemology.
Studia Logica, to appear.
Pre-print available Cambridge Open Engage Logica.

https://www.cambridge.org/engage/coe/article-details/6526998c45aaa5fdbbc54fd2

 
 
 

November 15, 2024: Juliet Floyd

The Turing Test as a View From Somewhere:
Hilbert, Wittgenstein and Turing on ‘Surveyability’

Speaker: Juliet Floyd (Boston University)
Time: 4:00 - 6:50pm
Location: KC 153


Abstract:

Recent debates about the philosophical status of formalization and mechanization of proof may be illuminated by considering the mutual impact Wittgenstein and Turing had on one another around issues concerning the evolution of notations in symbolic logic. When Wittgenstein remarked in 1937 that ‘a proof must be surveyable’ he was reworking ideas of Frege, Hilbert and Turing. “Surveyability” for Wittgenstein was neither a verificationist requirement nor a refutation of the claim that all proofs must have corresponding formal proofs, much less a refutation of logicism. Instead, it placed front and center what mathematicians do, i.e., it explores what logicism comes to in an everyday sense. The idea -- consonant with certain trends in so-called “philosophy of mathematical practice”, including recent work by Kennedy on “formalism freeness”, and Floyd’s on “everyday phraseology” -- is not to provide or ask for a “foundation” for mathematics in any ordinary sense, but rather to take a pragmatic and mathematically flexible approach to the very idea of “foundations”.

In 1939 Wittgenstein and Turing discussed these ideas in Wittgenstein’s Cambridge lectures on the foundations of mathematics, sparking some of Turing’s subsequent work on types. The relevant ideas here draw out new ways of looking at Turing’s 1936 paper, as well as his more speculative writings in the late 1940s about “intelligent machinery” and his 1950 “Turing Test”.


 

Spring 2024


Toggle Section

Fall 2023


Toggle Section

Join our mailing list

Sign up here to be added to our mailing list to receive reminders and announcements via email about the OCIE seminar series:

Online Form - OCIE Seminar Series Mailing List

CONTACT US


For more information about the OCIE Seminar series, please contact: 

Lisa Beesley
Graduate Program Coordinator – Math, Philosophy, and Physics
beesley@chapman.edu

Marco Panza 
Provisional Program Director
panza@chapman.edu
(714) 997-5021