Skip to main content Accessibility help
×
Hostname: page-component-cd9895bd7-gbm5v Total loading time: 0 Render date: 2024-12-22T20:41:46.194Z Has data issue: false hasContentIssue false

On explicit definability in arithmetic

Published online by Cambridge University Press:  30 March 2017

Ali Enayat
Affiliation:
American University, Washington DC
Iraj Kalantari
Affiliation:
Western Illinois University
Mojtaba Moniri
Affiliation:
Tarbiat Modares University, Tehran, Iran
Get access

Summary

Abstract.We characterize the arithmetic functions in one variable that are explicitly definable from the familiar arithmetic operations. This characterization is deduced from algebraic properties of some non-standard rings of integers. Elementary model theory is also used to show that the greatest common divisor function and related functions are not explicitly definable from the usual arithmetic operations. It turns out that explicit definability is equivalent to computability with bounded complexity, for the recursive algorithms of Y. Moschovakis and with respect to a certain natural cost function.

Introduction.

Motivating Question:Which functions are explicitly definable in the arithmetic Structures

Here iq (“integer quotient”) and rem (“remainder”) describe

integer division with remainder,

that is, iq : and rem : are the functions such that for all we have, with.

We nowspecifywhatwe mean by explicitly definable. Let be an L-structure with distinct marked elements 0,. A function is said to be explicitly definable in M if there are L-terms t1(x), …, tn(x) with x = (x1, …, xm), such that each set

is definable inMby a quantifier-free L-formula, and these sets together cover Mm. (Throughout this paper, m and n range over

An n-ary relation is said to be explicitly definable in M if its characteristic function is explicitly definable inM.

Remarks on explicit definability.

  1. (1) Connection to computation: The recursive programs on M from [7, 8] have the property that explicit definability in M is equivalent to computability by a recursive program on M in a uniformly bounded number of steps, as measured by a certain cost function. A precise statement to this effect can be found in [8].

Type
Chapter
Information
Logic in Tehran , pp. 65 - 86
Publisher: Cambridge University Press
Print publication year: 2006

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

[1] C., Chang and J., Keisler, Model Theory, third ed., North-Holland, Amsterdam, 1990.
[2] P., Cijsouw, Transcendence measures of exponentials and logarithms of algebraic numbers,Compositio Mathematica, vol. 28 (1974), pp. 163–178.Google Scholar
[3] Y., Mansour, B., Schieber, and P., Tiwari, A lower bound for integer greatest common divisor computations,Journal of the Association for Computing Machinery, vol. 38 (1991), no. 2, pp. 453–471.Google Scholar
[4] A., Prestel, Lectures on Formally Real Fields, Lecture Notes in Mathematics, vol. 1093, Springer, Berlin, 1984.
[5] C., Smory nski, Logical Number Theory. I, Springer, Berlin, 1991.
[6] L., van den Dries, Generating the greatest common divisor, and limitations of primitive recursive algorithms,Foundations of Computational Mathematics, vol. 3 (2003), pp. 297–324.Google Scholar
[7] L., van den Dries and Y., Moschovakis, Is the euclidean algorithm optimal among its peers?,The Bulletin of Symbolic Logic, vol. 10 (2004), no. 3, pp. 390–418.Google Scholar
[8] L., van den Dries and Y., Moschovakis, Arithmetic complexity, in preparation.

Save book to Kindle

To save this book to your Kindle, first ensure [email protected] is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

Available formats
×

Save book to Dropbox

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Dropbox.

Available formats
×

Save book to Google Drive

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Google Drive.

Available formats
×