Abstract
As late as 1930, mathematicians still did not perceive much call for formal syntactical descriptions of their notation. On the contrary, it was determined by tradition, with the result that separate schools of usage arose associated with different countries or cities, and sometimes with individual printers.
At the beginning of the 1930s, logicians, with their inborn need to question everything and influenced by explicit studies of derivation rules and systems, began to take notice of this; one such was Paul Hertz (1881–1940) in 1929. In 1930, Jan Lukasiewicz (1878–1956) informally introduced his bracket-free ‘Polish notation’.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
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
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Bauer, F.L. (2010). After 1935: Formal Languages and Algorithms, ‘Universal Machines’ and Electronic Solutions. In: Origins and Foundations of Computing. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02992-9_5
Download citation
DOI: https://doi.org/10.1007/978-3-642-02992-9_5
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-02993-6
Online ISBN: 978-3-642-02992-9
eBook Packages: Computer ScienceComputer Science (R0)