2 citations · 2 across the 4 of their papers we have counts for
4 papers
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…
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…
On the complexity of the theory of a computably presented metric structure
Caleb Camrud, Isaac Goldbring, Timothy H. McNicholl
We consider the complexity (in terms of the arithmetical hierarchy) of the various quantifier levels of the diagram of a computably presented metric structure. As the truth value o…
Stability of the Kaczmarz Reconstruction for Stationary Sequences
Caleb Camrud, Evan Camrud, Lee Przybylski +1
The Kaczmarz algorithm is an iterative method to reconstruct an unknown vector from inner products . We consider the problem of how additive noise a…