Abstract
An alphabet is a non-empty set. Its members are called symbols of the alphabet. A word of an alphabet б is an arbitrary finite (maybe empty) sequence of symbols from б. The empty word is denoted by A. The product or concatenation of words A and B is the word AB. A word B is called a subword of a word A if A = CBD for some words C and D. A word B can occur in A as a subword several times. The result of the replacement of an occurrence of a subword B in the word CBD by a word E is defined as the word CED.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer Science+Business Media New York
About this chapter
Cite this chapter
Lavrov, I., Maksimova, L., Corsi, G. (2003). Mathematical logic. In: Corsi, G. (eds) Problems in Set Theory, Mathematical Logic and the Theory of Algorithms. The University Series in Mathematics. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-0185-5_2
Download citation
DOI: https://doi.org/10.1007/978-1-4615-0185-5_2
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-4957-0
Online ISBN: 978-1-4615-0185-5
eBook Packages: Springer Book Archive