Abstract
The compactness theorem and Gödel’s completeness theorem are perhaps the most important tools of mathematical logic for creating extensions of an existing model of a given theory. Unfortunately none of these theorems hold if we restrict our attention to finite models. In this paper we give generalizations of these theorems which can be used to construct extensions of nonstandard versions of finite structures. Therefore, although the structures are infinite, some finiteness properties will be true both for the original and the extended structures. These types of model extensions are closely related to questions in complexity theory.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ajtai, M.: \(\Sigma_1^1\)-formulae on finite structures. Annals of Pure and Applied Logic 24, 1–48 (1983)
Ajtai, M.: The Complexity of the Pigeonhole Principle. Combinatorica 14(4), 417–433 (1994)
Beame, P., et al.: Exponential Lower Bound for the Pigeonhole Principle (extended abstract). In: Proc. ACM Symp. on Theory of Computing, pp. 200–220. ACM Press, New York (1992)
Furst, M., Saxe, J.B., Sipser, M.: Parity, Circuits and the Polynomial Time Hierarchy. Mathematical Systems Theory 17, 13–17 (1984)
Gentzen, G.: Unterschungen über das logische Schliessen. Mathematische Zeitschrift 39, 176–210, 405–431 (1934)
Hastad, J.: Almost optimal lower bounds for small depth circuits. In: Proc. 18th Annu. ACM Symp. Theory Computing, pp. 6–20 (1986)
Jech, T.: Axiomatic Set Theory. Academic Press, San Diego (1978)
Krajicek, J.: Forcing with random variables and proof complexity. In: Beckmann, A., et al. (eds.) CiE 2006. LNCS, vol. 3988, pp. 277–278. Springer, Heidelberg (2006)
Máté, A.: Nondeterministic polynomial-time computation and models of Arithmetic. Journal of the ACM 37(1), 175–193 (1990)
Takeuti, G.: Proof Theory, 2nd edn. Studies in Logic and the Foundations of Mathematics, vol. 81. North-Holland, Amsterdam (1987)
Yao, A.: Separating the polynomial time hierarchy by oracles. In: Proc. 26th Annu. IEEE Symp. Found. Comp. Sci., pp. 1–10 (1985)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ajtai, M. (2007). Generalizations of the Compactness Theorem and Gödel’s Completeness Theorem for Nonstandard Finite Structures. In: Cai, JY., Cooper, S.B., Zhu, H. (eds) Theory and Applications of Models of Computation. TAMC 2007. Lecture Notes in Computer Science, vol 4484. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72504-6_2
Download citation
DOI: https://doi.org/10.1007/978-3-540-72504-6_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-72503-9
Online ISBN: 978-3-540-72504-6
eBook Packages: Computer ScienceComputer Science (R0)