Abstract
Logicians of a certain age can remember when they were first allowed to savor Cantor’s sweet theorem characterizing the rationals among ordered sets as the unique countable densely ordered set without endpoints. For most the pleasure was heightened when they were shown the elegant back-and-forth argument that makes the proof of Cantor’s theorem perfectly transparent. This method of establishing isomorphism is now so widely known that its invocation no longer begins demonstrations, it ends them. Provers tell us: “By the usual back-and-forth argument so-and-so is isomorphic to such-and-such”, and then they move on to other matters. Logicians, in particular model-theorists, deserve a great deal of credit for making back-and-forth a mathematical cliché.
Preview
Unable to display preview. Download preview PDF.
References
Cameron, P.J. [1990], Oligomorphic Permutation Groups. London Math. Society Lecture Notes Series, vol. 152, Cambridge University Press.
Cantor, G. [1895], Beiträge zur Begründung der transfiniten Mengenlehre I. Mathematische Annalen, 46, 481–512.
Cantor, G. [1915], Contributions To The Founding Of The Theory Of Transfinite Numbers. English translation by Ph.E.B. Jourdain. Dover, New York (1952).
Hausdorff, F. [1907], Untersuchungen über Ordnungstypen. Berichte über die Verhandlungen der Sachsischen Gesellschaft der Wissenschaften zu Leipzig, 59, 84–159.
Hausdorff, F. [1908], Grundzüge einer Theorie der geordneten Mengen. Mathematische Annalen, 65, 435–505.
Hausdorff, F. [1914], Grundzuge der Mengenlehre. Veit, Leipzig; reprinted, Chelsea, New York (1949).
Hausdorff, F. [1927], Mengenlehre. Walter de Gruyter, Berlin and Leipzig.
Hodges, W. [1985], Building Models by Games. London Math. Society Student Texts, 2, Cambridge University Press.
Huntington, E.V. [1905], The continuum as a type of order: an exposition of the modern theory. Annals of Mathematics, 6, 151–184.
Kueker, D.W. [1975], Back-And-Forth Arguments and Infïnitary Logics. In: Infinitary Logic: In Memoriam Carol Karp. D.W. Kueker (ed.), Springer-Verlag, Lecture Notes in Mathematics, 492, 17–71.
Skolem, Th. [1970], Logisch-kombinatorische Untersuchungen über die Erfüllbarkeit und Beweisbarkeit mathematischen Sätze nebst einem Theoreme über dichte Mengen. Selected Works in Logic by Th. Skolem, J.E. Fenstad (ed.), Universitetsforlaget, Oslo, 103–136.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Additional information
Dedicated to Anil Nerode on his sixtieth birthday
Rights and permissions
Copyright information
© 1993 Springer Science+Business Media New York
About this chapter
Cite this chapter
Plotkin, J.M. (1993). Who Put The “Back” In Back-And-Forth?. In: Crossley, J.N., Remmel, J.B., Shore, R.A., Sweedler, M.E. (eds) Logical Methods. Progress in Computer Science and Applied Logic, vol 12. Birkhäuser, Boston, MA. https://doi.org/10.1007/978-1-4612-0325-4_23
Download citation
DOI: https://doi.org/10.1007/978-1-4612-0325-4_23
Publisher Name: Birkhäuser, Boston, MA
Print ISBN: 978-1-4612-6708-9
Online ISBN: 978-1-4612-0325-4
eBook Packages: Springer Book Archive