Abstract
In this preliminary chapter we will focus on four different subjects. First, we present rules. They will be used throughout this work for defining functions in an elegant and simple way. In the second section the standard notions for first-order logic are introduced [CL73]. This introduction is quite short, we merely present the notations we shall need. As the standard notations for logic are used, readers familiar with this topic may skip the second section. Since a large part of the indexing techniques rely on tree-like structures, we state some notions describing graphs and trees in the third section. Finally, we describe the way algorithms are presented.
Preview
Unable to display preview. Download preview PDF.
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Carroll, L. (1996). Preliminaries. In: Graf, P. (eds) Term Indexing. Lecture Notes in Computer Science, vol 1053. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61040-5_11
Download citation
DOI: https://doi.org/10.1007/3-540-61040-5_11
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61040-3
Online ISBN: 978-3-540-49873-5
eBook Packages: Springer Book Archive