We give a systematic technical exposition of the foundations of the theory of computably
compact metric spaces. We discover several new characterizations of computable …

We give a systematic technical exposition of the foundations of the theory of effectively
compact metric spaces. We discover several new characterizations of effective compactness …

This paper provides a brief survey of recent achievements in characterizing computational
complexity of partial differential equations (PDEs), as well as computing solutions with …

We prove that the standard computable presentation of the space C [0, 1] of continuous real-
valued functions on the unit interval is computably and punctually (primitively recursively) …

We use a second-order analogy PRA 2 of PRA to investigate the proof-theoretic strength of
theorems in countable algebra, analysis, and infinite combinatorics. We compare our results …

For several algebraic structures, we show that they have a punctual dimension either 1 or∞.
The punctual degree structures of rigid structures and the ordered integers are dense. We …

The complexity of equivalence relations has received much attention in the recent literature.
The main tool for such endeavour is the following reducibility: given equivalence relations R …

Primitive recursive ordered fields and some applications - IOS Press You are viewing a
javascript disabled version of the site. Please enable Javascript for this site to function properly …

We study the primitive recursive content of various closure results in algebra and model
theory, including the algebraic, the real, and the differential closure theorems. In the case of …

This book constitutes the proceedings of the 18th Conference on Computability in Europe,
CiE 2022, in Swansea, UK, in July 2022. The 19 full papers together with 7 invited papers …