activity
20192022
most citedOn the complexity of the theory of a computably presented metric structure

2 citations · 2 across the 4 of their papers we have counts for

collaborators
Showing 2022Show all

2 papers · 1 filter

math.LO2022

Hyperarithmetic numerals

Caleb M. H. Camrud, Timothy H. McNicholl

Within the framework of computable infinitary continuous logic, we develop a system of hyperarithmetic numerals. These numerals are infinitary sentences in a metric language th…

math.LO2022

Generalized effective completeness for continuous logic

Caleb Camrud

In this paper, we present a generalized effective completeness theorem for continuous logic. The primary result is that any continuous theory is satisfied in a structure which admi…