Preservation under Substructures modulo Bounded Cores

  • Abhisekh Sankaran
  • Bharat Adsul
  • Vivek Madan
  • Pritish Kamath
  • Supratik Chakraborty
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7456)

Abstract

We investigate a model-theoretic property that generalizes the classical notion of preservation under substructures. We call this property preservation under substructures modulo bounded cores, and present a syntactic characterization via \(\Sigma_2^0\) sentences for properties of arbitrary structures definable by FO sentences. Towards a sharper characterization, we conjecture that the count of existential quantifiers in the \(\Sigma_2^0\) sentence equals the size of the smallest bounded core. We show that this conjecture holds for special fragments of FO and also over special classes of structures. We present a (not FO-definable) class of finite structures for which the conjecture fails, but for which the classical Łoś-Tarski preservation theorem holds. As a fallout of our studies, we obtain combinatorial proofs of the Łoś-Tarski theorem for some of the aforementioned cases.

Keywords

Model theory First Order logic preservation theorem 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Abhisekh Sankaran
    • 1
  • Bharat Adsul
    • 1
  • Vivek Madan
    • 1
  • Pritish Kamath
    • 1
  • Supratik Chakraborty
    • 1
  1. 1.Indian Institute of Technology BombayIndia

Personalised recommendations