Upcoming Events
-
Feb
8
Algebra Seminar
Title TBA
Speaker TBA (TBA)11:15am -
Feb
8
Math Club
An Introduction to the Finite Element Method
Kim Savinon (UConn)5:30pmMath Club
An Introduction to the Finite Element Method
Kim Savinon (UConn)Wednesday, February 8th, 2023
05:30 PM - 06:30 PM
Storrs Campus Monteith 214
Many differential equations can be nearly impossible to solve directly. This naturally leads to the question: is there a way to approximate the solution to a differential equation numerically? The Finite Element Method (FEM) is one such method that is used very often in the real world.
In this talk, we will introduce a boundary value problem (an important type of differential equation) and discuss the existence and uniqueness of its finite element solution. Additionally, we will introduce the finite element space and its nodal basis functions. FEM Matlab code will be presented near the end.
Some familiarity with linear algebra is recommended but not necessary.
Note: Free refreshments. The talk starts at 5:40. -
Feb
9
Supporting and Empowering Neurodiverse Students: A Workshop for Instructors and TAs3:30pm
-
Feb
10
SIGMA Seminar
Mathematicians' Perspectives Towards Proof and Justification in the College Calculus Setting
Michael Urbanski (UConn)1:20pm -
Feb
10
Logic Colloquium: Eugenio Orlandelli (Bologna)2:00pm
Logic Colloquium: Eugenio Orlandelli (Bologna)
Friday, February 10th, 2023
02:00 PM - 03:30 PM
Storrs Campus Zoom
Join us in the Logic Colloquium!
Eugenio Orlandelli (Bologna)
Quantified modal logics: One approach to rule them all!
We present a general approach to quantified modal logics (QML) that can simulate most other approaches. The language is based on operators indexed by terms which allow to express de re modalities and to control the interaction of modalities with the first-order machinery and with non-rigid designators. The semantics is based on a primitive counterpart relation holding between n-tuples of objects inhabiting possible worlds. This allows an object to be represented by one, many or no object in an accessible world. Moreover by taking as primitive a relation between n-tuples we avoid the shortcomings of standard individual counterparts. Finally, we use cut-free labelled sequent calculi to give a proof-theoretic characterisation of the quantified extensions of each first-order definable propositional modal logic. In this way we show how to complete many axiomatically incomplete QML.
https://logic.uconn.edu/calendar/
