5 papers · 1 filter
Switching Categoricity Behavior with a Given Degree
David Gonzalez, Java Darleen Villano, José Jeremías Valenzuela Morales
Given a noncomputable, computably enumerable set , we construct a computable structure such that any two computable copies of are computably isomorphic while there are t…
sp-Homogeneous Linear Orderings
Wesley Calvert, Douglas Cenzer, David Gonzalez +2
We study linear orderings expanded by functions for successor and predecessor. The successor and predecessor on linear orderings capture the relatively intrinsically computably enu…
Computability of Separation Axioms in Countable Second Countable Spaces
Andrew DeLapo, David Gonzalez
We analyze the effective content of countable, second countable topological spaces by directly calculating the complexity of several topologically defined index sets. We focus on t…
Hybrid Maximal Filter Spaces
David Gonzalez
We introduce a new way of encoding general topology in second order arithmetic that we call hybrid maximal filter (hybrid MF) spaces. This notion is a modification of the notion of…
Generically Computable Linear Orderings
Wesley Calvert, Douglas Cenzer, David Gonzalez +1
We study notions of generic and coarse computability in the context of computable structure theory. Our notions are stratified by the hierarchy. We focus on linear orderings.…