Abstract
We now turn our attention to the fundamental notion of a logical deduction or a proof. Note that in computing the truth value of a statement in a structure one uses some rules of inference depending only on the syntactical construction of the statement. For instance, if A or B is true in a structure, then we infer that A∨B is true in the structure. We have also noted that statements with some specific syntactical structures are valid in all structures. For instance, a statement of the form ¬A∨A is true in all structures. Statements true in all structures of a language are called tautologies. So all tautologies should be theorems. Are there a convenient list of tautologies (to be called logical axioms) and a list of rules of inference such that a statement is valid if and only if it can be inferred from logical and nonlogical axioms using the rules of inference from our list? Indeed there is.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Ax, J.: The elementary theory of finite fields. Ann. Math. 88, 103–115 (1968)
Bochnak, J., Coste, M., Roy, M-F.: Real Algebraic Geometry, vol. 36, A Series of Modern Surveys in Mathematics. Springer, New York (1998)
Chang, C.C., Keisler, H.J.: Model Theory, 3rd edn. North-Holland, London (1990)
Flath, D., Wagon, S.: How to pick out integers in the rationals: An application of number theory to logic. Am. Math. Mon. 98, 812–823 (1991)
Hinman, P.: Fundamentals of Mathematical Logic. A. K. Peters (2005)
Hofstadter, D.R.: Gödel, Escher, Bach: An Eternal Golden Braid. Vintage Books, New York (1989)
Hrushovski, E.: The Mordell–Lang conjecture for function fields. J. Am. Math. Soc. 9(3), 667–690 (1996)
Jech, T.: Set Theory, Springer Monographs in Mathematics, 3rd edn. Springer, New York (2002)
Kunen, K.: Set Theory: An Introduction to Independence Proofs. North-Holland, Amsterdam (1980)
Lang, S.: Algebra, 3rd edn. Addison-Wesley (1999)
Marker, D.: Model Theory: An Introduction, GTM 217. Springer, New York (2002)
Rogers, H.J.: Theory of Recursive Functions and Effective Computability. McGraw-Hill, New York (1967)
Penrose, R.: The Emperor’s New Mind. Oxford University Press, Oxford (1990)
Pila, J.: O-minimality and André-Oort conjecture for ℂ n. Ann. Math. (2) 172(3), 1779–1840 (2011)
Pila, J., Zannier, U.: Rational points in periodic analytic sets and the Manin-Mumford conjecture, Atti. Accad. Naz. Lincei Cl. Sci. Fis. Mat. Natur. Rend. Lincei(9). Mat. Appl. 19(2), 149–162 (2008)
Shoenfield, J.R.: Mathematical Logic. A. K. Peters (2001)
Srivastava, S.M.: A Course on Borel Sets, GTM 180. Springer, New York (1998)
Swan, R.G.: Tarski’s principle and the elimination of quantifiers (preprint)
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer Science+Business Media New York
About this chapter
Cite this chapter
Srivastava, S.M. (2013). Propositional Logic. In: A Course on Mathematical Logic. Universitext. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-5746-6_3
Download citation
DOI: https://doi.org/10.1007/978-1-4614-5746-6_3
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4614-5745-9
Online ISBN: 978-1-4614-5746-6
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)