Jack Yoon will continue his explication of Proof Mining.

David Webb will speak at 1:00-2:00 in Keller 402

Title: Every Function Can be Computable

Abstract: I will relay an interesting result of Joel David Hamkins: that
there is an algorithm which can compute any function f of natural
numbers, if it is carried out in the right model of arithmetic
(corresponding to f). In particular, I will construct the necessary
models using Rosser sentences and describe the algorithm.

This semester the Logic Seminar will meet on Thursdays, 2:50 – 3:40 pm in Keller 402.

This Thursday we will have a (probably brief) organizational meeting.

Title: Some nonstandard remarks about Egyptian fractions

Abstract: An Egyptian fraction is a finite sum of fractions of the form $1/n$, where $n$ is a natural number. I’ll give simple proofs of some results about such fractions (also about Znám fractions). The proofs only require the compactness theorem from first order logic, though I’ll use the language of nonstandard analysis.