Primitive recursive mathematics

Abstract: We discuss the recently revived approach to computable mathematics via primitive recursion. This theory aims to eliminate the use of unbounded search from computable structure theory, computable analysis, etc. We will be focused on the recent developments in the theory, but we begin with an overview of what is known so far.

logic

Audience: researchers in the topic

Computability theory and applications

Series comments: Description: Computability theory, logic

The goal of this endeavor is to run a seminar on the platform Zoom on a weekly basis, perhaps with alternating time slots each of which covers at least three out of four of Europe, North America, Asia, and New Zealand/Australia. While the meetings are always scheduled for Tuesdays, the timezone varies, so please refer to the calendar on the website for details about individual seminars.