Nonstandard methods for finite structures

Mathematical Logic Quarterly 66 (3):367-372 (2020)
  Copy   BIBTEX

Abstract

We discuss the possibility of applying the compactness theorem to the study of finite structures. Given a class of finite structures, it is important to determine whether it can be expressed by a particular category of sentences. We are interested in this type of problem, and use nonstandard method for showing the non‐expressibility of certain classes of finite graphs by an existential monadic second order sentence.

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,423

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Fraïssé classes of graded relational structures.Guillermo Badia & Carles Noguera - 2018 - Theoretical Computer Science 737:81–90.
On second-order generalized quantifiers and finite structures.Anders Andersson - 2002 - Annals of Pure and Applied Logic 115 (1--3):1--32.
Super/rosy L k -theories and classes of finite structures.Cameron Donnay Hill - 2013 - Annals of Pure and Applied Logic 164 (10):907-927.
Some aspects of model theory and finite structures.Eric Rosen - 2002 - Bulletin of Symbolic Logic 8 (3):380-403.
Modal logic over finite structures.Eric Rosen - 1997 - Journal of Logic, Language and Information 6 (4):427-439.
Monadic Monadic Second Order Logic.Mikołaj Bojańczyk, Bartek Klin & Julian Salamanca - 2023 - In Alessandra Palmigiano & Mehrnoosh Sadrzadeh (eds.), Samson Abramsky on Logic and Structure in Computer Science and Beyond. Springer Verlag. pp. 701-754.

Analytics

Added to PP
2020-09-19

Downloads
22 (#981,487)

6 months
4 (#1,269,568)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Monadic generalized spectra.Ronald Fagin - 1975 - Mathematical Logic Quarterly 21 (1):89-96.
Classification Theory and the Number of Nonisomorphic Models.S. Shelah - 1982 - Journal of Symbolic Logic 47 (3):694-696.
On winning Ehrenfeucht games and monadic NP.Thomas Schwentick - 1996 - Annals of Pure and Applied Logic 79 (1):61-92.

Add more references