Abstract
A condition, in two variants, is given such that if a property P satisfies this condition, then every logic which is at least as strong as first-order logic and can express P fails to have the compactness property. The result is used to prove that for a number of natural properties P speaking about automorphism groups or connectivity, every logic which is at least as strong as first-order logic and can express P fails to have the compactness property. The basic idea underlying the results and examples presented here is that it is possible to construct a countable first-order theory T such that every model of T has a very rich automorphism group, but every finite subset T′ of T has a model which is rigid.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Barwise, J., and S. Feferman (eds.), Model-Theoretic Logics, Springer, New York, 1985.
Barwise J., Kaufmann M., Makkai M.: Stationary logic. Annals of Mathematical Logic 13, 171–224 (1978)
Barwise J., Kaufmann M., Makkai M.: A correction to: “Stationary logic”. Annals of Mathematical Logic 20, 231–232 (1981)
Bender E. A., Canfield E. R.: The asymptotic number of labelled graphs with given degree sequences. Journal of Combinatorial Theory, Series A 24, 296–307 (1978)
Bollobás B.: A probabilistic proof of an asymptotic formula for the number of labelled regular graphs. European Journal of Combinatorics 1, 311–316 (1980)
de la Harpe, P., Topics in Geometric Group Theory, The University of Chicago Press, Chicago, 2000.
Diestel, R., Graph Theory, 3rd ed., Springer, Heidelberg, 2006.
Ebbinghaus, H.-D., and J. Flum, Finite Model Theory, 2nd ed., Springer, Berlin, 1999.
Evans, D. M. (ed.), Model Theory of Groups and Automorphism Groups, Cambridge University Press, Cambridge, 1997.
Fuhrken, G., Languages with added quantifier “there exist at least \({\aleph_{\alpha}}\) ”, Theory of Models, Proceedings 1963 International Symposium Berkeley, North-Holland, Amsterdam, 1965, pp. 121–131.
Kaye, R., and D. Macpherson (eds.), Automorphisms of First-Order Structures, Oxford University Press, Oxford, 1994.
Keisler H.J.: Logic with the quantifier “there exist uncountably many”. Annals of Mathematical Logic 1, 1–93 (1970)
Koponen V.: Random graphs with bounded maximum degree: asymptotic structure and a logical limit law. Discrete Mathematics and Theoretical Computer Science 14, 229–254 (2012)
Lindström P.: On extensions of elementary logic. Theoria 35, 1–11 (1969)
Marker, D., Model Theory: An Introduction, Springer, New York, 2002.
McKay B. D., Wormald N. C.: Automorphisms of random graphs with specified vertices. Combinatorica 4, 325–338 (1984)
Rothmaler, Ph., Introduction to Model Theory, Taylor & Francis, New York, 2000.
Shelah S.: Generalized quantifiers and compact logic. Transactions of the American Mathematical Society 204, 342–364 (1975)
Väänänen J.: Barwise: abstract model theory and generalized quantifiers. The Bulletin of Symbolic Logic 10, 37–53 (2004)
Vaught R. L.: The completeness of logic with the added quantifier “there are uncountably many”. Fundamenta Mathematicae 54, 303–304 (1964)
Wormald N. C.: The asymptotic connectivity of labelled regular graphs. Journal of Combinatorial Theory, Series B 31, 156–167 (1981)
Wormald N. C.: The asymptotic distribution of short cycles in random regular graphs. Journal of Combinatorial Theory, Series B 31, 168–182 (1981)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Koponen, V., Hyttinen, T. On Compactness of Logics That Can Express Properties of Symmetry or Connectivity. Stud Logica 103, 1–20 (2015). https://doi.org/10.1007/s11225-013-9522-3
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11225-013-9522-3