On absorption’s formula definable semigroups of complete theories

Archive for Mathematical Logic:1-10 (forthcoming)
  Copy   BIBTEX

Abstract

On the set of all first-order complete theories $$T(\sigma )$$ of a language $$\sigma $$ we define a binary operation $$\{\cdot \}$$ by the rule: $$T\cdot S= {{\,\textrm{Th}\,}}(\{A\times B\mid A\models T \,\,\text {and}\,\, B\models S\})$$ for any complete theories $$T, S\in T(\sigma )$$. The structure $$\langle T(\sigma );\cdot \rangle $$ forms a commutative semigroup. A subsemigroup S of $$\langle T(\sigma );\cdot \rangle $$ is called an absorption’s formula definable semigroup if there is a complete theory $$T\in T(\sigma )$$ such that $$S=\langle \{X\in T(\sigma )\mid X\cdot T=T\};\cdot \rangle $$. In this event we say that a theory T absorbs S. In the article we show that for any absorption’s formula definable semigroup S the class $${{\,\textrm{Mod}\,}}(S)=\{A\in {{\,\textrm{Mod}\,}}(\sigma )\mid A\models T_0\,\,\text {for some}\,\, T_0\in S\}$$ is axiomatizable, and there is an idempotent element $$T\in S$$ that absorbs S. Moreover, $${{\,\textrm{Mod}\,}}(S)$$ is finitely axiomatizable provided T is finitely axiomatizable. We also prove that $${{\,\textrm{Mod}\,}}(S)$$ is a quasivariety (variety) provided T is an universal (a positive universal) theory. Some examples are provided.

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 100,561

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

Lifting independence results in bounded arithmetic.Mario Chiari & Jan Krajíček - 1999 - Archive for Mathematical Logic 38 (2):123-138.
Computable Embeddings and Strongly Minimal Theories.J. Chisholm, J. F. Knight & S. Miller - 2007 - Journal of Symbolic Logic 72 (3):1031 - 1040.
Fully Fregean logics.Sergei Babyonyshev - 2003 - Reports on Mathematical Logic:59-77.

Analytics

Added to PP
2024-07-22

Downloads
9 (#1,516,248)

6 months
9 (#439,903)

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

Horn sentences.Fred Galvin - 1970 - Annals of Mathematical Logic 1 (4):389.

Add more references