Mohamed Khaled
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Mohamed Khaled has a total of 7 co-authors. Here are the top co-authors by number of shared publications:
- Tarek Sayed Ahmed
Cairo University, Department of Mathematics, Faculty of Science
2 shared publications - Tuğba Aslan
Faculty of Engineering and Natural Sciences Bahcesehir University Osmanpaşa Mektebi Sokak, No: 4-6 34353 Beşiktaş, Istanbul, Turkey
2 shared publications Gergely Székely
Alfréd Rényi Institute of Mathematics
1 shared publication- Gergely Székely
HUN-REN Alfréd Rényi Institute of Mathematics, Budapest, Hungary
1 shared publication - István Németi
HUN-REN Alfréd Rényi Institute of Mathematics, Budapest, Hungary
1 shared publication - Koen Lefever
Centre for Logic and Philosophy of Science, Vrije Universiteit Brussel
1 shared publication
Latest Publications
- 1 September 2020
- Published by Cambridge University Press (CUP) in The Review of Symbolic Logic
- Vol. 13 (3) , 633-654
DISTANCES BETWEEN FORMAL THEORIES
In the literature, there have been several methods and definitions for working out whether two theories are "equivalent" (essentially the same) or not. In this article, we do something subtler. We provide a means to measure distances (and explore connections) between formal theories. We introduce two natural notions for such distances. The first one is that ofaxiomatic distance, but we argue that it might be of limited interest. The more interesting and widely applicable notion is that ofconceptual distancewhich measures the minimum number of concepts that distinguish two theories. For instance, we use conceptual distance to show that relativistic and classical kinematics are distinguished by one concept only.
- 1 September 2020
- Published by Cambridge University Press (CUP) in The Review of Symbolic Logic
- Vol. 13 (3) , 633-654
DISTANCES BETWEEN FORMAL THEORIES
In the literature, there have been several methods and definitions for working out whether two theories are "equivalent" (essentially the same) or not. In this article, we do something subtler. We provide a means to measure distances (and explore connections) between formal theories. We introduce two natural notions for such distances. The first one is that ofaxiomatic distance, but we argue that it might be of limited interest. The more interesting and widely applicable notion is that ofconceptual distancewhich measures the minimum number of concepts that distinguish two theories. For instance, we use conceptual distance to show that relativistic and classical kinematics are distinguished by one concept only.
- 3 October 2019
- Published by Springer Nature in Algebra universalis
- Vol. 80 (4) , 41
Atoms in infinite dimensional free sequence-set algebras
- 3 October 2019
- Published by Springer Nature in Algebra universalis
- Vol. 80 (4) , 41
Atoms in infinite dimensional free sequence-set algebras
- 2 January 2019
- Published by National Inquiry Services Center (NISC) in Quaestiones Mathematicae
- Vol. 43 (1) , 81-96
Geometrical representation theorems for cylindric-type algebras
In this paper, we give new proofs of the celebrated Andréka-Resek-Thompson representability results of certain axiomatized cylindric-like algebras. Such representability results provide completeness theorems for variants of first order logic, that can also be viewed as multi-modal logics. The proofs herein are combinatorial and we also use some techniques from game theory.
- 2 January 2019
- Published by National Inquiry Services Center (NISC) in Quaestiones Mathematicae
- Vol. 43 (1) , 81-96
Geometrical representation theorems for cylindric-type algebras
In this paper, we give new proofs of the celebrated Andréka-Resek-Thompson representability results of certain axiomatized cylindric-like algebras. Such representability results provide completeness theorems for variants of first order logic, that can also be viewed as multi-modal logics. The proofs herein are combinatorial and we also use some techniques from game theory.
- 1 January 2019
- Published by Institute of Mathematics, Polish Academy of Sciences in Colloquium Mathematicum
- Vol. 155 (1) , 141-155
Stone type representation theorems via games
The classes of relativized relation algebras (whose units are not necessarily transitive as binary relations) are known to be finitely axiomatizable. In this article, we give a new proof for this fact that is easier and more transparent than the original
- 1 January 2019
- Published by Institute of Mathematics, Polish Academy of Sciences in Colloquium Mathematicum
- Vol. 155 (1) , 141-155
Stone type representation theorems via games
The classes of relativized relation algebras (whose units are not necessarily transitive as binary relations) are known to be finitely axiomatizable. In this article, we give a new proof for this fact that is easier and more transparent than the original
- Open Access
Geometrical representation theorems for cylindric-type algebras
In this paper, we give new proofs of the celebrated Andr\'eka-Resek-Thompson representability results of certain axiomatized cylindric-like algebras. Such representability results provide completeness theorems for variants of first order logic, that can also be viewed as multi-modal logics. The proofs herein are combinatorial and we also use some techniques from game theory.
Open AccessGeometrical representation theorems for cylindric-type algebras
In this paper, we give new proofs of the celebrated Andr\'eka-Resek-Thompson representability results of certain axiomatized cylindric-like algebras. Such representability results provide completeness theorems for variants of first order logic, that can also be viewed as multi-modal logics. The proofs herein are combinatorial and we also use some techniques from game theory.
- Open Access
Stone type representation theorems via games
The classes of relativized relation algebras (whose units are not necessarily transitive as binary relations) are known to be finitely axiomatizable. In this article, we give a new proof for this fact that is easier and more transparent than the original proofs. We give direct constructions for all cases, whereas the original proofs reduced the problem to only one case. The proof herein is combinatorial and it uses some techniques from game theory.
Open AccessStone type representation theorems via games
The classes of relativized relation algebras (whose units are not necessarily transitive as binary relations) are known to be finitely axiomatizable. In this article, we give a new proof for this fact that is easier and more transparent than the original proofs. We give direct constructions for all cases, whereas the original proofs reduced the problem to only one case. The proof herein is combinatorial and it uses some techniques from game theory.