Abstract
In [Church 56, sect.07] mathematical logic or symbolic logic, or logistics, is defined as “the subject of formal logic when treated by the method of setting up a formalized language”. Among formalized languages there are purely logical (propositional and predicate) languages, languages of arithmetic and languages of set theory. Predicate languages — elementary (=first-order) as well as non-elementary (of higher orders) — are used for formal descriptions of properties of mathematical structures (first of all algebraic structures). We can use them for an axiomatic description of different classes of structures. Languages of arithmetic describe the set of natural numbers (which hardly can be described axiomatically and must anyway be regarded as existing before any axiomatic considerations). Languages of set theory have no clear semantics and are intended to formulate various axiomatic theories.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1993 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Uspensky, V., Semenov, A. (1993). Applications to mathematical logic: formalized languages of logic and arithmetic. In: Algorithms: Main Ideas and Applications. Mathematics and Its Applications, vol 251. Springer, Dordrecht. https://doi.org/10.1007/978-94-015-8232-2_24
Download citation
DOI: https://doi.org/10.1007/978-94-015-8232-2_24
Publisher Name: Springer, Dordrecht
Print ISBN: 978-90-481-4256-9
Online ISBN: 978-94-015-8232-2
eBook Packages: Springer Book Archive