Decidable classes of number theoretic sentences
The thesis is in two parts. In the first, I give a method for constructing decidable classes of number theoretic sentences, and in the second, I apply this method in the construction of particular decidable classes. Let B0,B1,.. be an increasing sequence of finite Boolean algebras of subsets, of the...
Main Author: | Heath, I. J. |
---|---|
Published: |
University of Leicester
1968
|
Subjects: | |
Online Access: | http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.673941 |
Similar Items
-
Decidable classes of recursive equations
by: Lee, R. D.
Published: (1969) -
Decidability and complexity of equivalences for simple process algebras
by: Stríbrná, Jitka
Published: (1999) -
Class Number Relations in Algebraic Number Fields
by: Walter, C. D.
Published: (1976) -
L-Functions and Class Numbers
by: Mallik, A.
Published: (1977) -
Asymptotic properties of some number-theoretic functions
by: Odoni, R. W. K.
Published: (1972)