Wesley Calvert
Murray State University
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by Wesley Calvert.
Algebra and Logic | 2004
Wesley Calvert; D. Cummins; Julia F. Knight; Sara Miller
We compare classes of structures using the notion of a computable embedding, which is a partial order on the classes of structures. Our attention is mainly, but not exclusively, focused on classes of finite structures. Also, a number of problems are formulated.
Archive for Mathematical Logic | 2004
Wesley Calvert
Abstract.Theories of classification distinguish classes with some good structure theorem from those for which none is possible. Some classes (dense linear orders, for instance) are non-classifiable in general, but are classifiable when we consider only countable members. This paper explores such a notion for classes of computable structures by working out several examples. One motivation is to see whether some classes whose set of countable members is very complex become classifiable when we consider only computable members. We follow recent work by Goncharov and Knight in using the degree of the isomorphism problem for a class to distinguish classifiable classes from non-classifiable. For real closed fields we show that the isomorphism problem is Δ11 complete (the maximum possible), and for others we show that it is of relatively low complexity. We show that the isomorphism problem for algebraically closed fields, Archimedean real closed fields, or vector spaces is Π03 complete.
Logical Methods in Computer Science | 2011
Wesley Calvert; Ken Kramer; Russell Miller
Working in the Blum-Shub-Smale model of computation on the real numbers, we answer several questions of Meer and Ziegler. First, we show that, for each natural number d, an oracle for the set of algebraic real numbers of degree at most d is insufficient to allow an oracle BSS-machine to decide membership in the set of algebraic numbers of degree d + 1. We add a number of further results on relative computability of these sets and their unions. Then we show that the halting problem for BSS-computation is not decidable below any countable oracle set, and give a more specific condition, related to the cardinalities of the sets, necessary for relative BSS-computability. Most of our results involve the technique of using as input a tuple of real numbers which is algebraically independent over both the parameters and the oracle of the machine.
IEEE Transactions on Systems, Man, and Cybernetics | 2013
Elham Sahebkar Khorasani; Shahram Rahimi; Wesley Calvert
The generalized constraint language (GCL), introduced by Zadeh, serves as a basis for computing with words (CW). It provides an agenda to express the imprecise and fuzzy information embedded in natural language and allows reasoning with perceptions. Despite its fundamental role, the definition of GCL has remained informal since its introduction by Zadeh, and to our knowledge, no attempt has been made to formulate a rigorous theoretical framework for GCL. Such formalization is necessary for further theoretical and practical advancement of CW for two important reasons. First, it provides the underlying infrastructure for the development of useful inference patterns based on sound theories. Second, it determines the scope of GCL and hence facilitates the translation of natural language expressions into GCL. This paper is an attempt to step in this direction by providing a formal syntax together with a compositional semantics for GCL. A soundness theorem is defined, and Zadehs deduction rules are proved to be valid in the defined semantics. Furthermore, a discussion is provided on how the proposed language may be used in practice.
Journal of Group Theory | 2013
Wesley Calvert; Kunal Dutta; Amritanshu Prasad
A tuple (or subgroup) in a group is said to degenerate to another if the latter is an endomorphic image of the former. In a countable reduced abelian group, it is shown that if tuples (or finite subgroups) degenerate to each other, then they lie in the same automorphism orbit. The proof is based on techniques that were developed by Kaplansky and Mackey in order to give an elegant proof of Ulms theorem. Similar results hold for reduced countably generated torsion modules over principal ideal domains. It is shown that the depth and the description of atoms of the resulting poset of orbits of tuples depend only on the Ulm invariants of the module in question (and not on the underlying ring). A complete description of the poset of orbits of elements in terms of the Ulm invariants of the module is given. The relationship between this description of orbits and a very different-looking one obtained by Dutta and Prasad for torsion modules of bounded order is explained.
international conference on unconventional computation | 2009
Wesley Calvert; Russell Miller
Using the model of real computability developed by Blum, Cucker, Shub, and Smale, we investigate the difficulty of determining the answers to several basic topological questions about manifolds. We state definitions of real-computable manifold and of real-computable paths in such manifolds, and show that, while BSS machines cannot in general decide such questions as nullhomotopy and simple connectedness for such structures, there are nevertheless real-computable presentations of paths and homotopy equivalence classes under which such computations are possible.
Archive for Mathematical Logic | 2009
Wesley Calvert; Sergei S. Goncharov; Julia F. Knight; Jessica Millar
Computable structures of Scott rank
CCA | 2010
Wesley Calvert; Ken Kramer; Russell Miller
Archive for Mathematical Logic | 2015
Wesley Calvert
{\omega_1^{CK}}
arXiv: Logic | 2014
Wesley Calvert; Valentina S. Harizanov; Alexandra Shlapentokh