We stand with Ukraine  

Tarek Sayed Ahmed

According to our database1, Tarek Sayed Ahmed authored at least 41 papers between 2001 and 2023.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Notions of representability for cylindric algebras: some algebras are more representable than others.
[BibTeX]
[DOI]
Tarek Sayed Ahmed
Period. Math. Hung., June, 2023

2021
Omitting types algebraically and more about amalgamation for modal cylindric algebras.
[BibTeX]
[DOI]
Tarek Sayed Ahmed
Math. Log. Q., 2021

2020
Atom-canonicity in varieties of cylindric algebras with applications to omitting types in multi-modal logic.
[BibTeX]
[DOI]
Tarek Sayed Ahmed
J. Appl. Non Class. Logics, 2020

2015
Neat embeddings as adjoint situations.
[BibTeX]
[DOI]
Tarek Sayed Ahmed
Synth., 2015

On notions of representability for cylindric-polyadic algebras, and a solution to the finitizability problem for quantifier logics with equality.
[BibTeX]
[DOI]
Tarek Sayed Ahmed
Math. Log. Q., 2015

Varying interpolation and amalgamation in polyadic MV-algebras.
[BibTeX]
[DOI]
Tarek Sayed Ahmed
J. Appl. Non Class. Logics, 2015

2014
The NEAT Embedding Problem for Algebras Other than cylindric Algebras and for Infinite Dimensions.
[BibTeX]
[DOI]
Robin Hirsch
,
Tarek Sayed Ahmed
J. Symb. Log., 2014

2012
Three interpolation theorems for typeless logics.
[BibTeX]
[DOI]
Tarek Sayed Ahmed
Log. J. IGPL, 2012

Epimorphisms are not surjective, even in simple algebras.
[BibTeX]
[DOI]
Tarek Sayed Ahmed
Log. J. IGPL, 2012

2011
On the complexity of axiomatizations of the class of representable quasi-polyadic equality algebras.
[BibTeX]
[DOI]
Tarek Sayed Ahmed
Math. Log. Q., 2011

Classes of algebras without the amalgamation property.
[BibTeX]
[DOI]
Tarek Sayed Ahmed
Log. J. IGPL, 2011

2010
The class of polyadic algebras has the super amalgamation property.
[BibTeX]
[DOI]
Tarek Sayed Ahmed
Math. Log. Q., 2010

2009
On neat embeddings of cylindric algebras.
[BibTeX]
[DOI]
Tarek Sayed Ahmed
Math. Log. Q., 2009

A note on substitutions in representable cylindric algebras.
[BibTeX]
[DOI]
Tarek Sayed Ahmed
Math. Log. Q., 2009

A simple construction of representable relation algebras with non-representable completions.
[BibTeX]
[DOI]
Tarek Sayed Ahmed
Math. Log. Q., 2009

On a theorem of Vaught for first order logic with finitely many variables.
[BibTeX]
[DOI]
Tarek Sayed Ahmed
J. Appl. Non Class. Logics, 2009

Neat reducts and amalgamation in retrospect, a survey of results and some methods Part II: Results on amalgamation.
[BibTeX]
[DOI]
Judit X. Madarász
,
Tarek Sayed Ahmed
Log. J. IGPL, 2009

Neat reducts and amalgamation in retrospect, a survey of results and some methods Part I: Results on neat reducts.
[BibTeX]
[DOI]
Judit X. Madarász
,
Tarek Sayed Ahmed
Log. J. IGPL, 2009

On complete representations of algebras of logic.
[BibTeX]
[DOI]
Mohamed Khaled
,
Tarek Sayed Ahmed
Log. J. IGPL, 2009

2008
On Complete Representations of Reducts of Polyadic Algebras.
[BibTeX]
[DOI]
Tarek Sayed Ahmed
Stud Logica, 2008

Weakly representable atom structures that are not strongly representable, with an application to first order logic.
[BibTeX]
[DOI]
Tarek Sayed Ahmed
Math. Log. Q., 2008

Omitting types for finite variable fragments and complete representations of algebras.
[BibTeX]
[DOI]
Tarek Sayed Ahmed
,
Hajnal Andréka
,
István Németi
J. Symb. Log., 2008

The Class <i>S</i>Nr<sub>3</sub>CA<sub><i>k</i></sub> is Not Closed Under Completions.
[BibTeX]
[DOI]
Tarek Sayed Ahmed
,
Basim Samir
Log. J. IGPL, 2008

2007
A Note on Neat Reducts.
[BibTeX]
[DOI]
Tarek Sayed Ahmed
Stud Logica, 2007

An Omitting Types Theorem for first order logic with infinitary relation symbols.
[BibTeX]
[DOI]
Tarek Sayed Ahmed
,
Basim Samir
Math. Log. Q., 2007

A Neat Embedding Theorem for Expansions of Cylindric Algebras.
[BibTeX]
[DOI]
Tarek Sayed Ahmed
,
Basim Samir
Log. J. IGPL, 2007

On Neat Reducts and Amalgamation.
[BibTeX]
[DOI]
Tarek Sayed Ahmed
Log. J. IGPL, 2007

An Interpolation Theorem for First Order Logic with Infinitary Predicates.
[BibTeX]
[DOI]
Tarek Sayed Ahmed
Log. J. IGPL, 2007

2006
Polyadic and cylindric algebras of sentences.
[BibTeX]
[DOI]
Mohamed A. Amer
,
Tarek Sayed Ahmed
Math. Log. Q., 2006

The class of infinite dimensional neat reducts of quasi-polyadic algebras is not axiomatizable.
[BibTeX]
[DOI]
Tarek Sayed Ahmed
Math. Log. Q., 2006

Some Results on Amalgamation in Algebraic Logic.
[BibTeX]
[DOI]
Tarek Sayed Ahmed
Log. J. IGPL, 2006

Independence Results in Algebraic Logic.
[BibTeX]
[DOI]
Tarek Sayed Ahmed
Log. J. IGPL, 2006

2005
On Amalgamation in Algebras of Logic.
[BibTeX]
[DOI]
Tarek Sayed Ahmed
Stud Logica, 2005

Omitting types for algebraizable extensions of first order logic.
[BibTeX]
[DOI]
Tarek Sayed Ahmed
J. Appl. Non Class. Logics, 2005

Amalgamation Theorems in Algebraic Logic, an overview.
[BibTeX]
[DOI]
Tarek Sayed Ahmed
Log. J. IGPL, 2005

Algebraic logic, where does it stand today?
[BibTeX]
[DOI]
Tarek Sayed Ahmed
Bull. Symb. Log., 2005

2003
Neat Embeddings, Omitting Types, and Interpolation: An Overview.
[BibTeX]
[DOI]
Tarek Sayed Ahmed
Notre Dame J. Formal Log., 2003

2002
Martin's Axiom, Omitting Types, and Complete Representations in Algebraic Logic.
[BibTeX]
[DOI]
Tarek Sayed Ahmed
Stud Logica, 2002

A Modeltheoretic Solution to a Problem of Tarski.
[BibTeX]
[DOI]
Tarek Sayed Ahmed
Math. Log. Q., 2002

2001
On Neat Reducts of Algebras of Logic.
[BibTeX]
[DOI]
Tarek Sayed Ahmed
,
István Németi
Stud Logica, 2001

The Class of Neat Reducts is Not Elementary.
[BibTeX]
[DOI]
Tarek Sayed Ahmed
Log. J. IGPL, 2001


  Loading...