Hostname: page-component-7b7567c8c-fvjsw Total loading time: 0 Render date: 2026-11-17T05:14:14.717Z Has data issue: false hasContentIssue false

Definability with a predicate for a semi-linear set

Published online by Cambridge University Press:  12 March 2014

Michael Benedikt
Affiliation:
Bell Laboratories, 2701 Lucent Lane, Lisle, IL 60532, USA, E-mail: benedikt@research.bell-labs.com
H. Jerome Keisler
Affiliation:
University of Wisconsin-Madison, Department of Mathematics Van Vleck Hall, 480 Lincoln Drive, Madison, Wisconsin 53706-1388, USA, E-mail: keisler@math.wisc.edu, URL: http://www.math.wisc.edu/~keisler

Abstract

We settle a number of questions concerning definability in first order logic with an extra predicate symbol ranging over semi-linear sets. We give new results both on the positive and negative side: we show that in first-order logic one cannot query a semi-linear set as to whether or not it contains a line, or whether or not it contains the line segment between two given points. However, we show that some of these queries become definable if one makes small restrictions on the semi-linear sets considered.

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 2003

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.)

Article purchase

Temporarily unavailable