Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 1307.1016

On completions, neat embeddings and omittings types, yet again

Tarek Sayed Ahmed
View original source ↗Read source document ↗Export metadata ↓

Abstract

In this paper we investigate using the methodology of algebraic logic, deep algebraic results to prove three new omitting types theorems for finite variable fragments of first order logic. As a sample, we show that it T is an L_n theory and |T|=lambda, lambda a regular cardinal, if T admits elimination of quantifiers, then T omits < 2^λ many non isolated {\it maximal} types. This is basically a result of Shelah's restricted to L_n. that is not completely representable. We also show, using a rainbow construction for cylindric algebras, that the omitting types theorem fails for L_n even if we consider clique guarded semantics. This is done by constructing a an atomic \A\in \PEA_n with countably many atoms (which are coloured graphs) who Sc (Pinter's) reduct is not in S_c\Nr_n\Sc_{n+3}, but $A$ is elementary equivalent to a countable completely representable (polyadic equality) algebra. Various connections between the notions of strong representability and complete representability are given in terms of neat embeddings. Several examples, using rainbow constructions and Monk-like algebras are also given to show that our results are best possible. As a sample we show that, assuming the existence of certain finite relation algebras, that for any k\in ω, there exists \A\in {\sf RPEA}_n\cap \Nr_n\PEA_{n+k} such that Rd_{\sf Sc}\Cm\At\A\notin S\Nr_n\Sc_{n+k+1}. This implies that for any finite n\geq 3, for any k\geq 0, there is an L_n theory and a type Γsuch that Gamma is realized in every n+k+1 relativized smooth model, but cannot be isolated by a witness using n+k variables.

Explore related subjects

math.LO

Keep this discovery

BibTeXRIS

Tarek Sayed Ahmed. 2013-07-02. On completions, neat embeddings and omittings types, yet again. https://arxiv.org/abs/1307.1016

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

There is no maximal $K$-degree

The Kolmogorov complexity of a string characterize how complex it is to describe the string. If every prefix of a real $x$ is more complex to describe than every prefix (of the same length) of real $y$, then it is seen as $x$ is more complex to describe than $y$. It is wondered if there is a real $x$ so that no other reals are strictly more complex (to describe) than $x$. The behavior of Kolmogorov complexity functions generated by reals (namely $n\mapsto$ the minimal description length of the real) is quite chaos. Therefore, it is widely believed that there are many reals that are maximally complex to describe. For instance, it is conjectured that all random enough reals have maximal $K$-degree. In this paper, it is shown that there is no real with maximal $K$-degree. Actually, for almost all real $x$, we can uniformly computably find another real whose $K$-degree is strictly above $x$.

math.LO↗
arXiv2026

Quadruples and cubes

We prove, in $\mathsf{ZFC}$, that the $\lambda$-terraced cube relation fails whenever $\lambda$ is an uncountable cardinal. The corresponding terraced relation for quadruples fails for every $\lambda$. If $\lambda$ is $\aleph_0$ then the pretinent terraced relation has consistency strength of at least one Woodin cardinal. We prove positive polarized relations at a successor and a double successor from wondrous ideals. We show, however, that there are no such ideals over two consecutive cardinals simultaneously.

math.LO↗
arXiv2026

Possibilistic Logic over a Logic of Formal Inconsistency

In this article, we have introduced a new possibilistic logic on a logic of formal inconsistency with the aim of developing a possibility theoretic framework to deal with uncertainty and inconsistency meaningfully without leading to a system collapse. We have discussed the syntax and semantics for this logic and have proved the soundness and completeness theorems. A set of new measures of consistency, contradictoriness, and triviality of a set of formulas have been defined. These have then been put to use in an example to show that this framework can provide better means of machine reasoning.

math.LO↗