Punctual Structures

Abstract: In this talk we investigate what happens when we take concepts from computable structure theory and forbid the use of unbounded search. In other words, we discuss the primitive recursive content of structure theory. This central definition is that of punctual structures, introduced by Kalimullin, Melnikov and Ng in 2017. We investigate various concepts from computable structure theory in the primitive recursive case. A common theme is that new techniques are required in the primitive recursive case. We also discuss a degree structure within punctual presentations which is induced by primitive recursive isomorphisms. This degree structure is a new concept that does not arise in computable structure theory.

logic

Audience: researchers in the topic

Online logic seminar

Series comments: Description: Seminar on all areas of logic