English
Related papers

Related papers: On completions, neat embeddings and omittings type…

200 papers

Let 2<n\leq l<m< \omega. Let L_n denote first order logic restricted to the first n variables. We show that the omitting types theorem fails dramatically for the n--variable fragments of first order logic with respect to clique guarded…

Logic · Mathematics 2015-04-24 Tarek Sayed Ahmed

Fix 2<n<\omega. Let L_n denote first order logic restricted to the first n variables. CA_n denotes the class of cylindric algebras of dimension n and for m>n, Nr_n\CA_m(\subseteq CA_n) denotes the class of n-neat reducts of CA_m's. The…

Logic · Mathematics 2016-08-12 Tarek Sayed Ahmed

Fix a finite ordinal n>2. We show that there exists an atomic, simple and countable representable CA_n, such that its minimal completion is outside SNr_nCA_{n+3}. Hence, for any finite k\geq 3, the variety SNr_nCA_{n+k} is not…

Logic · Mathematics 2014-08-15 Tarek Sayed Ahmed

In this paper we give an alternative construction using Monk like algebras that are binary generated to show that the class of strongly representable atom structures is not elementary. The atom structures of such algebras are cylindric…

Logic · Mathematics 2013-07-17 Tarek Sayed Ahmed , Mohammed Khaled

Let n be finite >2. We show that any class between S\Nr_n\CA_{n+3} and RCA_n is not atom canonical, and any class containing the class of completely representable algebras and contained in S_c\Nr_n\CA_{n+3} is not elementary. We show that…

Logic · Mathematics 2014-01-07 Tarek Sayed Ahmed

We study atom canonicity for several varieties of cylindric like algebras that contain properly the variety of representable algebras. The algebras in such varieties have relativized representations, and we thereby obtain many omitting…

Logic · Mathematics 2013-08-29 Tarek Sayed Ahmed

We intend to investigate the metalogical property of 'omitting types' for a wide variety of quantifier logics (that can also be seen as multimodal logics upon identifying existential quantifiers with modalities syntactically and…

Logic · Mathematics 2019-12-30 Tarek Sayed Ahmed

This paper is a survey of recent results and methods in (Tarskian) algebraic logic. We focus on cylindric algebras. Fix 2<n<\omega. Rainbow constructions are used to solve problems on classes consisting of algebras having a neat embedding…

Logic · Mathematics 2015-02-27 Tarek Sayed Ahmed

We study what we call topological cylindric algebras and tense cylindric algebras defined for every ordinal $\alpha$. The former are cylindric algebras of dimension $\alpha$ expanded with $\sf S4$ modalities indexed by $\alpha$. The…

Logic · Mathematics 2014-02-26 Tarek Sayed Ahmed

In the the present contribution, we prove an Omitting Types Theorem (OTT) for an arbitrary fragment of hybriddynamic first-order logic with rigid symbols (i.e. symbols with fixed interpretations across worlds) closed under negation and…

Logic · Mathematics 2022-03-17 Daniel Gaina , Guillermo Badia , Tomasz Kowalski

We study L\"owenheim-Skolem and Omitting Types theorems in Transition Algebra, a logical system obtained by enhancing many sorted first-order logic with features from dynamic logic. The sentences we consider include compositions, unions,…

Logic in Computer Science · Computer Science 2025-09-03 Go Hashimoto , Daniel Găină

(1) Let 1\leq k\leq \omega. Call an atom structure \alpha weakly k neat representable, the term algebra is in \RCA_n\cap \Nr_n\CA_{n+k}, but the complex algebra is not representable. Call an atom structure neat if there is an atomic algebra…

Logic · Mathematics 2013-05-23 Tarek Sayed Ahmed

We classify $n$-representation infinite algebras $\Lambda$ of type \~A. This type is defined by requiring that $\Lambda$ has higher preprojective algebra $\Pi_{n+1}(\Lambda) \simeq k[x_1, \ldots, x_{n+1}] \ast G$, where $G \leq…

Representation Theory · Mathematics 2024-11-25 Darius Dramburg , Oleksandra Gasanova

We study different representation theorems for various reducts of Heyting polyadic algebras. Superamalgamation is proved for several (natural reducts) and our results are compared to the finitizability problem in classical algebraic logic…

Logic · Mathematics 2013-04-08 Tarek Sayed Ahmed

We give an example of a countable theory T such that for every cardinal lambda >= aleph_2 there is a fully indiscernible set A of power lambda such that the principal types are dense over A, yet there is no atomic model of T over A. In…

Logic · Mathematics 2008-02-03 Michael C. Laskowski , Saharon Shelah

In this article we show that hybrid type-logical grammars are a fragment of first-order linear logic. This embedding result has several important consequences: it not only provides a simple new proof theory for the calculus, thereby…

Logic in Computer Science · Computer Science 2014-05-27 Richard Moot

Let $L$ be the language of rings. We provide an axiomatization of the $L$-theories of quaternions and octonions and characterize their models: they coincide, up to isomorphism, with quaternion and octonion algebras over a real closed field,…

Algebraic Geometry · Mathematics 2026-05-05 Enrico Savi

We develop some basic results about full amalgamation classes with intrinsic trascendentals. These classes have generics whose models may have finite subsets whose intrinsic closure is not contained in its algebraic closure. We will show…

Logic · Mathematics 2015-12-15 Justin Brody

Using model theoretic techniques that proved that the class of $n$ neat reducts of $m$ dimensional cylindric algebras, $\Nr_n\CA_m$, is not elementary, we prove the same result for $\Ra\CA_k$, $k\geq 5$, and we show that $\Ra\CA_k\subset…

Logic · Mathematics 2013-05-24 Tarek Sayed Ahmed

We give a simpler proof of a result of Hodkinson in the context of a blow and blur up construction argueing that the idea at heart is similar to that adopted by Andr\'eka et all \cite{sayed}. The idea is to blow up a finite structure,…

Logic · Mathematics 2013-05-21 Tarek Sayed Ahmed
‹ Prev 1 2 3 10 Next ›