default search action
Tarek Sayed Ahmed
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j41]Tarek Sayed Ahmed:
Notions of representability for cylindric algebras: some algebras are more representable than others. Period. Math. Hung. 86(2): 343-377 (2023) - 2021
- [j40]Tarek Sayed Ahmed:
Omitting types algebraically and more about amalgamation for modal cylindric algebras. Math. Log. Q. 67(3): 295-312 (2021) - 2020
- [j39]Tarek Sayed Ahmed:
Atom-canonicity in varieties of cylindric algebras with applications to omitting types in multi-modal logic. J. Appl. Non Class. Logics 30(3): 223-271 (2020)
2010 – 2019
- 2015
- [j38]Tarek Sayed Ahmed:
Varying interpolation and amalgamation in polyadic MV-algebras. J. Appl. Non Class. Logics 25(2): 140-192 (2015) - [j37]Tarek Sayed Ahmed:
On notions of representability for cylindric-polyadic algebras, and a solution to the finitizability problem for quantifier logics with equality. Math. Log. Q. 61(6): 418-477 (2015) - [j36]Tarek Sayed Ahmed:
Neat embeddings as adjoint situations. Synth. 192(7): 2223-2259 (2015) - 2014
- [j35]Robin Hirsch, Tarek Sayed Ahmed:
The NEAT Embedding Problem for Algebras Other than cylindric Algebras and for Infinite Dimensions. J. Symb. Log. 79(1): 208-222 (2014) - 2012
- [j34]Tarek Sayed Ahmed:
Epimorphisms are not surjective, even in simple algebras. Log. J. IGPL 20(1): 22-26 (2012) - [j33]Tarek Sayed Ahmed:
Three interpolation theorems for typeless logics. Log. J. IGPL 20(6): 1001-1037 (2012) - 2011
- [j32]Tarek Sayed Ahmed:
Classes of algebras without the amalgamation property. Log. J. IGPL 19(1): 87-104 (2011) - [j31]Tarek Sayed Ahmed:
On the complexity of axiomatizations of the class of representable quasi-polyadic equality algebras. Math. Log. Q. 57(4): 384-394 (2011) - 2010
- [j30]Tarek Sayed Ahmed:
The class of polyadic algebras has the super amalgamation property. Math. Log. Q. 56(1): 103-112 (2010)
2000 – 2009
- 2009
- [j29]Mohamed Khaled, Tarek Sayed Ahmed:
On complete representations of algebras of logic. Log. J. IGPL 17(3): 267-272 (2009) - [j28]Judit X. Madarász, Tarek Sayed Ahmed:
Neat reducts and amalgamation in retrospect, a survey of results and some methods Part I: Results on neat reducts. Log. J. IGPL 17(4): 429-483 (2009) - [j27]Judit X. Madarász, Tarek Sayed Ahmed:
Neat reducts and amalgamation in retrospect, a survey of results and some methods Part II: Results on amalgamation. Log. J. IGPL 17(6): 755-802 (2009) - [j26]Tarek Sayed Ahmed:
On a theorem of Vaught for first order logic with finitely many variables. J. Appl. Non Class. Logics 19(1): 97-112 (2009) - [j25]Tarek Sayed Ahmed:
A simple construction of representable relation algebras with non-representable completions. Math. Log. Q. 55(3): 237-244 (2009) - [j24]Tarek Sayed Ahmed:
A note on substitutions in representable cylindric algebras. Math. Log. Q. 55(3): 280-287 (2009) - [j23]Tarek Sayed Ahmed:
On neat embeddings of cylindric algebras. Math. Log. Q. 55(6): 666-668 (2009) - 2008
- [j22]Tarek Sayed Ahmed, Basim Samir:
The Class SNr3CAk is Not Closed Under Completions. Log. J. IGPL 16(5): 427-429 (2008) - [j21]Tarek Sayed Ahmed, Hajnal Andréka, István Németi:
Omitting types for finite variable fragments and complete representations of algebras. J. Symb. Log. 73(1): 65-89 (2008) - [j20]Tarek Sayed Ahmed:
Weakly representable atom structures that are not strongly representable, with an application to first order logic. Math. Log. Q. 54(3): 294-306 (2008) - [j19]Tarek Sayed Ahmed:
On Complete Representations of Reducts of Polyadic Algebras. Stud Logica 89(3): 325-332 (2008) - 2007
- [j18]Tarek Sayed Ahmed:
An Interpolation Theorem for First Order Logic with Infinitary Predicates. Log. J. IGPL 15(1): 21-32 (2007) - [j17]Tarek Sayed Ahmed:
On Neat Reducts and Amalgamation. Log. J. IGPL 15(1): 33-39 (2007) - [j16]Tarek Sayed Ahmed, Basim Samir:
A Neat Embedding Theorem for Expansions of Cylindric Algebras. Log. J. IGPL 15(1): 41-51 (2007) - [j15]Tarek Sayed Ahmed, Basim Samir:
An Omitting Types Theorem for first order logic with infinitary relation symbols. Math. Log. Q. 53(6): 564-570 (2007) - [j14]Tarek Sayed Ahmed:
A Note on Neat Reducts. Stud Logica 85(2): 139-151 (2007) - 2006
- [j13]Tarek Sayed Ahmed:
Independence Results in Algebraic Logic. Log. J. IGPL 14(1): 87-96 (2006) - [j12]Tarek Sayed Ahmed:
Some Results on Amalgamation in Algebraic Logic. Log. J. IGPL 14(4): 623-627 (2006) - [j11]Tarek Sayed Ahmed:
The class of infinite dimensional neat reducts of quasi-polyadic algebras is not axiomatizable. Math. Log. Q. 52(1): 106-112 (2006) - [j10]Mohamed A. Amer, Tarek Sayed Ahmed:
Polyadic and cylindric algebras of sentences. Math. Log. Q. 52(5): 444-449 (2006) - 2005
- [j9]Tarek Sayed Ahmed:
Algebraic logic, where does it stand today? Bull. Symb. Log. 11(4): 465-516 (2005) - [j8]Tarek Sayed Ahmed:
Amalgamation Theorems in Algebraic Logic, an overview. Log. J. IGPL 13(3): 277-286 (2005) - [j7]Tarek Sayed Ahmed:
Omitting types for algebraizable extensions of first order logic. J. Appl. Non Class. Logics 15(4): 465-489 (2005) - [j6]Tarek Sayed Ahmed:
On Amalgamation in Algebras of Logic. Stud Logica 81(1): 61-77 (2005) - 2003
- [j5]Tarek Sayed Ahmed:
Neat Embeddings, Omitting Types, and Interpolation: An Overview. Notre Dame J. Formal Log. 44(3): 157-173 (2003) - 2002
- [j4]Tarek Sayed Ahmed:
A Modeltheoretic Solution to a Problem of Tarski. Math. Log. Q. 48(3): 343-355 (2002) - [j3]Tarek Sayed Ahmed:
Martin's Axiom, Omitting Types, and Complete Representations in Algebraic Logic. Stud Logica 72(2): 285-309 (2002) - 2001
- [j2]Tarek Sayed Ahmed:
The Class of Neat Reducts is Not Elementary. Log. J. IGPL 9(4): 593-628 (2001) - [j1]Tarek Sayed Ahmed, István Németi:
On Neat Reducts of Algebras of Logic. Stud Logica 68(2): 229-262 (2001)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:46 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint