An overview from physically-based to data-driven approaches of the modelling and simulation of glioblastoma progression in microfluidic devices
 Ayensa-Jimenez, J Perez-Aliacar, M Doweidar, M Gaffney, E Doblare, M Archives of Computational Methods in Engineering

Nick Trefethen

Congratulations to Nick who has been elected to the US National Academy of Sciences, one of 120 American and 30 new international members.

Full list

 

Monodromy for Some Rank Two Galois Representations over CM Fields
 Allen, P Newton, J Documenta Mathematica volume 25 2487-2506 (01 Jan 2020)
Deformations during jet-stripping in the galvanizing process
 Hocking, G Sweatman, W Fitt, A Breward, C Journal of Engineering Mathematics volume 70 issue 1-3 297-306 (01 Jul 2011)
Lattice and discrete Boltzmann equations for fully compressible Flow
 Dellar, P 3rd M.I.T. Conference on Computational Fluid and Solid Mechanics 632-635 (01 Dec 2005)
Aspects of secondary sonic boom propagation
 Kaouri, K Allwright, D Dallois, L Dellar, P Acta Acustica (Stuttgart) volume 89 issue SUPP. (01 May 2003)
Bulk and shear viscosities in lattice Boltzmann equations
 Dellar, P Physical Review E - Statistical, Nonlinear, and Soft Matter Physics volume 64 issue 3 I 312031-3120311 (01 Sep 2001)
Preface
 Jarosch, A Hewitt, I Annals of Glaciology volume 57 issue 72 (01 Jul 2016)
Thu, 15 May 2025
17:00
L3

Feferman's Completeness Theorem

Michael Rathjen
(University of Leeds)
Abstract

Feferman proved in 1962 that any arithmetical theorem is a consequence of a suitable transfinite iteration of uniform reflections. This result is commonly known as Feferman's completeness theorem. The talk aims to give one or two new proofs of Feferman's completeness theorem that, we hope, shed new light on this mysterious and often overlooked result.

Moreover, one of the proofs furnishes sharp bounds on the order types of well-orders necessary to attain completeness.

(This is joint work with Fedor Pakhomov and Dino Rossegger.)

Subscribe to