Tarek Sayed Ahmed - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 41 from 41

2023

Notions of representability for cylindric algebras: some algebras are more representable than othersTarek Sayed Ahmed. pmh, 86(2):343-377, June 2023. [doi]

2021

Omitting types algebraically and more about amalgamation for modal cylindric algebrasTarek Sayed Ahmed. mlq, 67(3):295-312, 2021. [doi]

2020

Atom-canonicity in varieties of cylindric algebras with applications to omitting types in multi-modal logicTarek Sayed Ahmed. jancl, 30(3):223-271, 2020. [doi]

2015

Neat embeddings as adjoint situationsTarek Sayed Ahmed. synthese, 192(7):2223-2259, 2015. [doi]

Varying interpolation and amalgamation in polyadic MV-algebrasTarek Sayed Ahmed. jancl, 25(2):140-192, 2015. [doi]

On notions of representability for cylindric-polyadic algebras, and a solution to the finitizability problem for quantifier logics with equalityTarek Sayed Ahmed. mlq, 61(6):418-477, 2015. [doi]

2014

The NEAT Embedding Problem for Algebras Other than cylindric Algebras and for Infinite DimensionsRobin Hirsch, Tarek Sayed Ahmed. JSYML, 79(1):208-222, 2014. [doi]

2012

Three interpolation theorems for typeless logicsTarek Sayed Ahmed. igpl, 20(6):1001-1037, 2012. [doi]

Epimorphisms are not surjective, even in simple algebrasTarek Sayed Ahmed. igpl, 20(1):22-26, 2012. [doi]

2011

Classes of algebras without the amalgamation propertyTarek Sayed Ahmed. igpl, 19(1):87-104, 2011. [doi]

On the complexity of axiomatizations of the class of representable quasi-polyadic equality algebrasTarek Sayed Ahmed. mlq, 57(4):384-394, 2011. [doi]

2010

The class of polyadic algebras has the super amalgamation propertyTarek Sayed Ahmed. mlq, 56(1):103-112, 2010. [doi]

2009

On neat embeddings of cylindric algebrasTarek Sayed Ahmed. mlq, 55(6):666-668, 2009. [doi]

A simple construction of representable relation algebras with non-representable completionsTarek Sayed Ahmed. mlq, 55(3):237-244, 2009. [doi]

A note on substitutions in representable cylindric algebrasTarek Sayed Ahmed. mlq, 55(3):280-287, 2009. [doi]

On a theorem of Vaught for first order logic with finitely many variablesTarek Sayed Ahmed. jancl, 19(1):97-112, 2009. [doi]

On complete representations of algebras of logicMohamed Khaled, Tarek Sayed Ahmed. igpl, 17(3):267-272, 2009. [doi]

Neat reducts and amalgamation in retrospect, a survey of results and some methods Part II: Results on amalgamationJudit X. Madarász, Tarek Sayed Ahmed. igpl, 17(6):755-802, 2009. [doi]

Neat reducts and amalgamation in retrospect, a survey of results and some methods Part I: Results on neat reductsJudit X. Madarász, Tarek Sayed Ahmed. igpl, 17(4):429-483, 2009. [doi]

2008

The Class ::::S::::Nr::3::CA::::::k:::::: is Not Closed Under CompletionsTarek Sayed Ahmed, Basim Samir. igpl, 16(5):427-429, 2008. [doi]

Weakly representable atom structures that are not strongly representable, with an application to first order logicTarek Sayed Ahmed. mlq, 54(3):294-306, 2008. [doi]

On Complete Representations of Reducts of Polyadic AlgebrasTarek Sayed Ahmed. sLogica, 89(3):325-332, 2008. [doi]

Omitting types for finite variable fragments and complete representations of algebrasTarek Sayed Ahmed, Hajnal Andréka, István Németi. JSYML, 73(1):65-89, 2008. [doi]

2007

An Omitting Types Theorem for first order logic with infinitary relation symbolsTarek Sayed Ahmed, Basim Samir. mlq, 53(6):564-570, 2007. [doi]

A Note on Neat ReductsTarek Sayed Ahmed. sLogica, 85(2):139-151, 2007. [doi]

An Interpolation Theorem for First Order Logic with Infinitary PredicatesTarek Sayed Ahmed. igpl, 15(1):21-32, 2007. [doi]

On Neat Reducts and AmalgamationTarek Sayed Ahmed. igpl, 15(1):33-39, 2007. [doi]

A Neat Embedding Theorem for Expansions of Cylindric AlgebrasTarek Sayed Ahmed, Basim Samir. igpl, 15(1):41-51, 2007. [doi]

2006

The class of infinite dimensional neat reducts of quasi-polyadic algebras is not axiomatizableTarek Sayed Ahmed. mlq, 52(1):106-112, 2006. [doi]

Independence Results in Algebraic LogicTarek Sayed Ahmed. igpl, 14(1):87-96, 2006. [doi]

Some Results on Amalgamation in Algebraic LogicTarek Sayed Ahmed. igpl, 14(4):623-627, 2006. [doi]

Polyadic and cylindric algebras of sentencesMohamed Amer, Tarek Sayed Ahmed. mlq, 52(5):444-449, 2006. [doi]

2005

Amalgamation Theorems in Algebraic Logic, an overviewTarek Sayed Ahmed. igpl, 13(3):277-286, 2005. [doi]

Algebraic logic, where does it stand today?Tarek Sayed Ahmed. bsl, 11(4):465-516, 2005. [doi]

Omitting types for algebraizable extensions of first order logicTarek Sayed Ahmed. jancl, 15(4):465-489, 2005.

On Amalgamation in Algebras of LogicTarek Sayed Ahmed. sLogica, 81(1):61-77, 2005. [doi]

2003

Neat Embeddings, Omitting Types, and Interpolation: An OverviewTarek Sayed Ahmed. ndjfl, 44(3):157-173, 2003. [doi]

2002

A Modeltheoretic Solution to a Problem of TarskiTarek Sayed Ahmed. mlq, 48(3):343-355, 2002. [doi]

Martin s Axiom, Omitting Types, and Complete Representations in Algebraic LogicTarek Sayed Ahmed. sLogica, 72(2):285-309, 2002.

2001

On Neat Reducts of Algebras of LogicTarek Sayed Ahmed, István Németi. sLogica, 68(2):229-262, 2001.

The Class of Neat Reducts is Not ElementaryTarek Sayed Ahmed. igpl, 9(4):593-628, 2001. [doi]

Sign in or sign up to see more results.

runs on WebDSL