István Németi
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
István Németi has a total of 12 co-authors. Here are the top co-authors by number of shared publications:
- Hajnal Andréka
HUN-REN Alfréd Rényi Institute of Mathematics, Budapest, Hungary
9 shared publications - Gergely Székely
HUN-REN Alfréd Rényi Institute of Mathematics, Budapest, Hungary
2 shared publications - John Byron Manchak
Department of Logic and Philosophy of Science, University of California, Irvine, USA
2 shared publications - Judit Madarász
HUN-REN Alfréd Rényi Institute of Mathematics, Budapest, Hungary
2 shared publications - Zalán Gyenis
Jagiellonian University, Krakow, Poland
2 shared publications B. Jónsson
Vanderbilt University
1 shared publication
Latest Publications
- 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
- 26 August 2025
- Published by Elsevier in Annals of Pure and Applied Logic
- Vol. 176 (10)
Transposition of variables is hard to axiomatize
- 26 August 2025
- Published by Elsevier in Annals of Pure and Applied Logic
- Vol. 176 (10)
Open AccessTransposition of variables is hard to axiomatize
- Open Access
Substitutions of variables are finitely axiomatizable over quantifications and permutations
This paper proves that the equational theory of the class $RA_α^{csp}$ of representable polyadic algebras is finitely axiomatizable over its substitution-free reduct $RA_α^{cp}$, for finite $α$. That is, substitutions of variables in finite variable first-order logic can be described by finitely many axioms over the Boolean operations, existential quantifiers and permutations of variables.Open AccessSubstitutions of variables are finitely axiomatizable over quantifications and permutations
This paper proves that the equational theory of the class $RA_α^{csp}$ of representable polyadic algebras is finitely axiomatizable over its substitution-free reduct $RA_α^{cp}$, for finite $α$. That is, substitutions of variables in finite variable first-order logic can be described by finitely many axioms over the Boolean operations, existential quantifiers and permutations of variables. - Open Access
- 12 August 2024
- Published by Springer Nature in Studia Logica
- Vol. 113 (6) , 1567-1613
Logic Families
A logic family is a bunch of logics that belong together in some way. First-order logic is one of the examples. Logics organized into a structure occur in abstract model theory, institution theory and in algebraic logic. Logic families play a role in adopting methods for investigating sentential logics to first-order like logics. We thoroughly discuss the notion of logic families as defined in the recent Universal Algebraic Logic book.
- 12 August 2024
- Published by Springer Nature in Studia Logica
- Vol. 113 (6) , 1567-1613
Open AccessLogic Families
A logic family is a bunch of logics that belong together in some way. First-order logic is one of the examples. Logics organized into a structure occur in abstract model theory, institution theory and in algebraic logic. Logic families play a role in adopting methods for investigating sentential logics to first-order like logics. We thoroughly discuss the notion of logic families as defined in the recent Universal Algebraic Logic book.
- Open Access
A note on the submodel preservation property in fragments of first-order logic
This note contains some material promised in our earlier papers on submodel preservation and the guarded fragment, along with some information on the current status of the problems mentioned in these papers. Section 1 contains an early example of failure of Los-Tarski for finite-variable fragments with binary relations from a 1992 manuscript, with no substantial change of content. For further background to this example, Section 2 surveys a number of results concerning the submodel preservation property for various fragments of first-order logic.
Open AccessA note on the submodel preservation property in fragments of first-order logic
This note contains some material promised in our earlier papers on submodel preservation and the guarded fragment, along with some information on the current status of the problems mentioned in these papers. Section 1 contains an early example of failure of Los-Tarski for finite-variable fragments with binary relations from a 1992 manuscript, with no substantial change of content. For further background to this example, Section 2 surveys a number of results concerning the submodel preservation property for various fragments of first-order logic.
- 1 February 2021
- Published by Cambridge University Press (CUP) in The Journal of Symbolic Logic
- Vol. 86 (2) , 785-800
TWO-VARIABLE LOGIC HAS WEAK, BUT NOT STRONG, BETH DEFINABILITY
We prove that the two-variable fragment of first-order logic has the weak Beth definability property. This makes the two-variable fragment a natural logic separating the weak and the strong Beth properties since it does not have the strong Beth definability property.
- 1 February 2021
- Published by Cambridge University Press (CUP) in The Journal of Symbolic Logic
- Vol. 86 (2) , 785-800
TWO-VARIABLE LOGIC HAS WEAK, BUT NOT STRONG, BETH DEFINABILITY
We prove that the two-variable fragment of first-order logic has the weak Beth definability property. This makes the two-variable fragment a natural logic separating the weak and the strong Beth properties since it does not have the strong Beth definability property.
- Open Access
Two-variable logic has weak, but not strong, Beth definability
We prove that the two-variable fragment of first-order logic has the weak Beth definability property. This makes the two-variable fragment a natural logic separating the weak and the strong Beth properties since it does not have the strong Beth definability property.
Open AccessTwo-variable logic has weak, but not strong, Beth definability
We prove that the two-variable fragment of first-order logic has the weak Beth definability property. This makes the two-variable fragment a natural logic separating the weak and the strong Beth properties since it does not have the strong Beth definability property.
- 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
- Open Access
- 17 August 2016
- Published by Springer Nature in Algebra universalis
- Vol. 76 (2) , 231-235
Ultraproducts of continuous posets
- 17 August 2016
- Published by Springer Nature in Algebra universalis
- Vol. 76 (2) , 231-235
Open AccessUltraproducts of continuous posets