Gergely Székely
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
Research Subjects
Gergely Székely has a total of 30 co-authors. Here are the top co-authors by number of shared publications:
- Mike Stannett
Department of Computer Science, University of Sheffield, Sheffield, U.K.
9 shared publications - István Németi
Rényi Institute of Mathematics
8 shared publications Judit X. Madarász
8 shared publications- Hajnal Andréka
Alfréd Rényi Institute of Mathematics, Institute of Mathematics, Hungarian Academy of Sciences
7 shared publications - Judit X. Madarasz
Alfréd Rényi Institute of Mathematics of the Hungarian Academy of Sciences
7 shared publications István Németi
5 shared publications
Latest Publications
- Open Access
- 4 June 2026
- Published by Cambridge University Press (CUP) in The Review of Symbolic Logic
- Vol. 19 (3) , 1-32
DEFINABLE COORDINATE GEOMETRIES OVER FIELDS
We define general notions of coordinate geometries over fields and ordered fields, and consider coordinate geometries that are given by finitely many relations that are definable over those fields. We show that the automorphism group of such a geometry determines the geometry up to definitional equivalence; moreover, if we are given two such geometries $\mathcal {G}$ script upper G and $\mathcal {G}'$ script upper G prime , then the concepts (explicitly definable relations) of $\mathcal {G}$ script upper G are concepts of $\mathcal {G}'$ script upper G prime exactly if the automorphisms of $\mathcal {G}'$ script upper G prime are automorphisms of $\mathcal {G}$ script upper G . We show this by first proving that a relation is a concept of $\mathcal {G}$ script upper G exactly if it is closed under the automorphisms of $\mathcal {G}$ script upper G and is definable over the field; moreover, it is enough to consider automorphisms that are affine transformations. We show how this result can be applied to quickly determine relationships and differences between various geometries and spacetimes, including ordered affine, Euclidean, Galilean, Newtonian, Late Classical, Relativistic and Minkowski spacetimes (we first define these spacetimes and geometries using a Tarskian first-order language centred on the ternary relation ${\mathsf {Bw}}$ sans serif upper B w of betweenness). We conclude with a selection of open problems related to the existence of certain intermediate geometries.- 4 June 2026
- Published by Cambridge University Press (CUP) in The Review of Symbolic Logic
- Vol. 19 (3) , 1-32
Open AccessDEFINABLE COORDINATE GEOMETRIES OVER FIELDS
We define general notions of coordinate geometries over fields and ordered fields, and consider coordinate geometries that are given by finitely many relations that are definable over those fields. We show that the automorphism group of such a geometry determines the geometry up to definitional equivalence; moreover, if we are given two such geometries $\mathcal {G}$ script upper G and $\mathcal {G}'$ script upper G prime , then the concepts (explicitly definable relations) of $\mathcal {G}$ script upper G are concepts of $\mathcal {G}'$ script upper G prime exactly if the automorphisms of $\mathcal {G}'$ script upper G prime are automorphisms of $\mathcal {G}$ script upper G . We show this by first proving that a relation is a concept of $\mathcal {G}$ script upper G exactly if it is closed under the automorphisms of $\mathcal {G}$ script upper G and is definable over the field; moreover, it is enough to consider automorphisms that are affine transformations. We show how this result can be applied to quickly determine relationships and differences between various geometries and spacetimes, including ordered affine, Euclidean, Galilean, Newtonian, Late Classical, Relativistic and Minkowski spacetimes (we first define these spacetimes and geometries using a Tarskian first-order language centred on the ternary relation ${\mathsf {Bw}}$ sans serif upper B w of betweenness). We conclude with a selection of open problems related to the existence of certain intermediate geometries. - 18 February 2026
- Published by Springer Nature in Foundations of Physics
- Vol. 56 (2) , 15
An Extendible Spacetime Without Closed Timelike Curves Whose Every Extension Contains Closed Timelike Curves
- 18 February 2026
- Published by Springer Nature in Foundations of Physics
- Vol. 56 (2) , 15
An Extendible Spacetime Without Closed Timelike Curves Whose Every Extension Contains Closed Timelike Curves
- Open Access
An extendible spacetime without closed timelike curves whose every extension contains closed timelike curves
By removing a fractal from time-rolled Minkowski spacetime, we construct an extendible spacetime without closed timelike curves whose every extension contains closed timelike curves. This settles a question posed by Geroch.
Open AccessAn extendible spacetime without closed timelike curves whose every extension contains closed timelike curves
By removing a fractal from time-rolled Minkowski spacetime, we construct an extendible spacetime without closed timelike curves whose every extension contains closed timelike curves. This settles a question posed by Geroch.
- Open Access
On Andréka's Conjecture that special relativity is the only possible conceptual reduct of classical kinematics
In this paper, we prove a pure mathematical result which has important implications for the history and philosophy of classical physics and the conceptual origins of relativity theory. In formal terms, we show that, up to definitional equivalence, there is no intermediate model of spacetime lying strictly between special relativity and late classical kinematics. Informally, this means that there was essentially no other option but to switch to special relativity to resolve the conflict between late classical kinematics and the null result of the Michelson--Morley experiment.
Open AccessOn Andréka's Conjecture that special relativity is the only possible conceptual reduct of classical kinematics
In this paper, we prove a pure mathematical result which has important implications for the history and philosophy of classical physics and the conceptual origins of relativity theory. In formal terms, we show that, up to definitional equivalence, there is no intermediate model of spacetime lying strictly between special relativity and late classical kinematics. Informally, this means that there was essentially no other option but to switch to special relativity to resolve the conflict between late classical kinematics and the null result of the Michelson--Morley experiment.
- Open Access
Definable coordinate geometries over fields, part 2: applications
In Part 1 of this study we showed, for a wide range of geometries, that the relationships between their concept-sets are fully determined by those between their (affine) automorphism groups. In this (self-contained) part, we show how this result can be applied to quickly determine relationships and differences between various geometries and spacetimes, including ordered affine, Euclidean, Galilean, Newtonian, Late Classical, Relativistic and Minkowski spacetimes (we first define these spacetimes and geometries using a Tarskian first-order language centred on the ternary relation $\mathsf{Bw}$ of betweenness). We conclude with a selection of open problems related to the existence of certain intermediate geometries.Open AccessDefinable coordinate geometries over fields, part 2: applications
In Part 1 of this study we showed, for a wide range of geometries, that the relationships between their concept-sets are fully determined by those between their (affine) automorphism groups. In this (self-contained) part, we show how this result can be applied to quickly determine relationships and differences between various geometries and spacetimes, including ordered affine, Euclidean, Galilean, Newtonian, Late Classical, Relativistic and Minkowski spacetimes (we first define these spacetimes and geometries using a Tarskian first-order language centred on the ternary relation $\mathsf{Bw}$ of betweenness). We conclude with a selection of open problems related to the existence of certain intermediate geometries. - Open Access
Definable coordinate geometries over fields, part 1: theory
We define general notions of coordinate geometries over fields and ordered fields, and consider coordinate geometries that are given by finitely many relations that are definable over those fields. We show that the automorphism group of such a geometry determines the geometry up to definitional equivalence; moreover, if we are given two such geometries $\mathcal{G}$ and $\mathcal{G}'$, then the concepts (explicitly definable relations) of $\mathcal{G}$ are concepts of $\mathcal{G}'$ exactly if the automorphisms of $\mathcal{G}'$ are automorphisms of $\mathcal{G}$. We show this by first proving that a relation is a concept of $\mathcal{G}$ exactly if it is closed under the automorphisms of $\mathcal{G}$ and is definable over the field; moreover, it is enough to consider automorphisms that are affine transformations.Open AccessDefinable coordinate geometries over fields, part 1: theory
We define general notions of coordinate geometries over fields and ordered fields, and consider coordinate geometries that are given by finitely many relations that are definable over those fields. We show that the automorphism group of such a geometry determines the geometry up to definitional equivalence; moreover, if we are given two such geometries $\mathcal{G}$ and $\mathcal{G}'$, then the concepts (explicitly definable relations) of $\mathcal{G}$ are concepts of $\mathcal{G}'$ exactly if the automorphisms of $\mathcal{G}'$ are automorphisms of $\mathcal{G}$. We show this by first proving that a relation is a concept of $\mathcal{G}$ exactly if it is closed under the automorphisms of $\mathcal{G}$ and is definable over the field; moreover, it is enough to consider automorphisms that are affine transformations. - Open Access
On variable non-dependence of first-order formulas
In this paper, we introduce a concept of non-dependence of variables in formulas. A formula in first-order logic is non-dependent of a variable if the truth value of this formula does not depend on the value of that variable. This variable non-dependence can be subject to constraints on the value of some variables which appear in the formula, these constraints are expressed by another first-order formula. After investigating its basic properties, we apply this concept to simplify convoluted formulas by bringing out and discarding redundant nested quantifiers. Such convoluted formulas typically appear when one uses a translation function interpreting a theory into another.
Open AccessOn variable non-dependence of first-order formulas
In this paper, we introduce a concept of non-dependence of variables in formulas. A formula in first-order logic is non-dependent of a variable if the truth value of this formula does not depend on the value of that variable. This variable non-dependence can be subject to constraints on the value of some variables which appear in the formula, these constraints are expressed by another first-order formula. After investigating its basic properties, we apply this concept to simplify convoluted formulas by bringing out and discarding redundant nested quantifiers. Such convoluted formulas typically appear when one uses a translation function interpreting a theory into another.
- Open Access
- 9 July 2024
- Published by Springer Nature in Algebra universalis
- Vol. 85 (3) , 1-30
On the networks of large embeddings
We define a special network that exhibits the large embeddings in any class of similar algebras. With the aid of this network, we introduce a notion of distance that conceivably counts the minimum number of dissimilarities, in a sense, between two given algebras in the class in hand; with the possibility that this distance may take the value $$\infty $$ . We display a number of inspirational examples from different areas of algebra, e.g., group theory and monounary algebras, to show that this research direction can be quite remarkable.- 9 July 2024
- Published by Springer Nature in Algebra universalis
- Vol. 85 (3) , 1-30
Open AccessOn the networks of large embeddings
We define a special network that exhibits the large embeddings in any class of similar algebras. With the aid of this network, we introduce a notion of distance that conceivably counts the minimum number of dissimilarities, in a sense, between two given algebras in the class in hand; with the possibility that this distance may take the value $$\infty $$ . We display a number of inspirational examples from different areas of algebra, e.g., group theory and monounary algebras, to show that this research direction can be quite remarkable. - Open Access
- 22 February 2024
- Published by Cambridge University Press (CUP) in The Review of Symbolic Logic
- Vol. 18 (1) , 300-315
CONCEPTUAL DISTANCE AND ALGEBRAS OF CONCEPTS
We show that the conceptual distance between any two theories of first-order logic is the same as the generator distance between their Lindenbaum–Tarski algebras of concepts. As a consequence of this, we show that, for any two arbitrary mathematical structures, the generator distance between their meaning algebras (also known as cylindric set algebras) is the same as the conceptual distance between their first-order logic theories. As applications, we give a complete description for the distances between meaning algebras corresponding to structures having at most three elements and show that this small network represents all the possible conceptual distances between complete theories. As a corollary of this, we will see that there are only two non-trivial structures definable on three-element sets up to conceptual equivalence (i.e., up to elementary plus definitional equivalence).
- 22 February 2024
- Published by Cambridge University Press (CUP) in The Review of Symbolic Logic
- Vol. 18 (1) , 300-315
Open AccessCONCEPTUAL DISTANCE AND ALGEBRAS OF CONCEPTS
We show that the conceptual distance between any two theories of first-order logic is the same as the generator distance between their Lindenbaum–Tarski algebras of concepts. As a consequence of this, we show that, for any two arbitrary mathematical structures, the generator distance between their meaning algebras (also known as cylindric set algebras) is the same as the conceptual distance between their first-order logic theories. As applications, we give a complete description for the distances between meaning algebras corresponding to structures having at most three elements and show that this small network represents all the possible conceptual distances between complete theories. As a corollary of this, we will see that there are only two non-trivial structures definable on three-element sets up to conceptual equivalence (i.e., up to elementary plus definitional equivalence).
- Open Access
Testing definitional equivalence of theories via automorphism groups
Two first-order logic theories are definitionally equivalent if and only if there is a bijection between their model classes that preserves isomorphisms and ultraproducts (Theorem 2). This is a variant of a prior theorem of van Benthem and Pearce. In Example 2, uncountably many pairs of definitionally inequivalent theories are given such that their model categories are concretely isomorphic via bijections that preserve ultraproducts in the model categories up to isomorphism. Based on these results, we settle several conjectures of Barrett, Glymour and Halvorson.
Open AccessTesting definitional equivalence of theories via automorphism groups
Two first-order logic theories are definitionally equivalent if and only if there is a bijection between their model classes that preserves isomorphisms and ultraproducts (Theorem 2). This is a variant of a prior theorem of van Benthem and Pearce. In Example 2, uncountably many pairs of definitionally inequivalent theories are given such that their model categories are concretely isomorphic via bijections that preserve ultraproducts in the model categories up to isomorphism. Based on these results, we settle several conjectures of Barrett, Glymour and Halvorson.