Defining the degree of categoricity of a computable structure M to be the least degree d for which M is d-computably categorical, we investigate which Turing degrees can be realiz...
Ekaterina B. Fokina, Iskander Sh. Kalimullin, Russ...
Determining the X-ray crystallographic structures of proteins using the technique of molecular replacement (MR) can be a time and labor-intensive trial-and-error process, involvin...
Jason W. Schmidberger, Blair Bethwaite, Colin Enti...
The symbolic representation of the physical structure of living organisms needs an ontologically well-founded and logically sound approach so that formal reasoning can adequately ...
Spatial structure supporting applications offer an abstract level of what can be found in the real world. However, in many systems, objects are aligned straight, rotation is not p...
Abstract. If L is a finite relational language then all computable Lstructures can be effectively enumerated in a sequence {An}n∈ω in such a way that for every computable L-st...