Abstract
This work concerns representability of arithmetical notions in finite models. It follows the paper by Marcin Mostowski [1], where the notion of FM–representability has been defined. We discuss how far this notion captures the methodological idea of representing infinite sets in finite but potentially infinite domains.
We consider mainly some weakenings of the notion of FM–representability. We prove that relations weakly FM–representable are exactly those being \(\Sigma_{\rm 2}^{\rm 0}\)–definable. Another weakening of the notion, namely statistical representability, turns out to be equivalent to the original one. Additionally, we consider the complexity of sets of formulae naturally defined in finite models. We state that the set of sentences true in almost all finite arithmetical models is \(\Sigma_{\rm 2}^{\rm 0}\)–complete and that the set of formulae FM–representing some relations is \(\Pi^{0}_{3}\)–complete.
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.
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
Mostowski, M.: On representing concepts in finite models. Mathematical Logic Quarterly 47, 513–523 (2001)
Aristotle: Physics. The Internet Classics Archive (written 350 B.C.) translated by Hardie, R.P., Gaye, R.K., available at: http://classics.mit.edu/Aristotle/physics.html
Mycielski, J.: Analysis without actual infinity. Journal of Symbolic Logic 46, 625–633 (1981)
Mostowski, M.: On representing semantics in finite models. In: Rojszczak, A., Cachro, J., Kurczewski, G. (eds.) Philosophical Dimensions of Logic and Science, pp. 15–28. Kluwer Academic Publishers, Dordrecht (2003)
Mostowski, M.: Potential infinity and the Church Thesis. In: manuscript, see also an extended abstract in the electronic proceedings of Denis Richard 60-th Birthday Conference, Clermont–Rerrand (2000)
Mostowski, M.: Truth definitions in finite models (1993) (manuscript)
Kołodziejczyk, L.: Truth definitions in finite models. The Journal of Symbolic Logic 69, 183–200 (2004)
Kołodziejczyk, L.: A finite model-theoretical proof of a property of bounded query classes within PH. The Journal of Symbolic Logic 69, 1105–1116 (2004)
Ebbinghaus, H.D., Flum, J.: Finite model theory. Springer, Heidelberg (1995)
Soare, R.I.: Recursively enumerable sets and degrees. Perspectives in Mathematical Logic. Springer, Heidelberg (1987)
Krynicki, M., Zdanowski, K.: Theories of arithmetics in finite models. Journal of Symbolic Logic 70(1), 1–28 (2005)
Mostowski, M., Wasilewska, A.: Arithmetic of divisibility in finite models. Mathematical Logic Quarterly 50(2), 169–174 (2004)
Zdanowski, K.: Arithmetics in finite but potentially infinite worlds. PhD thesis, Warsaw University (2005) (in preparation)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mostowski, M., Zdanowski, K. (2005). FM-Representability and Beyond. In: Cooper, S.B., Löwe, B., Torenvliet, L. (eds) New Computational Paradigms. CiE 2005. Lecture Notes in Computer Science, vol 3526. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11494645_45
Download citation
DOI: https://doi.org/10.1007/11494645_45
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-26179-7
Online ISBN: 978-3-540-32266-5
eBook Packages: Computer ScienceComputer Science (R0)