István Németi

81 papers A* 2B 9C 1Journal 58Unranked 8
YearRankTypeTitle / Venue / Authors
2025 J jnl
Logic Families.
Stud Logica
Hajnal Andréka, Zalán Gyenis, István Németi, Ildikó Sain
2024 J jnl
Testing Definitional Equivalence of Theories via automorphism Groups.
Rev. Symb. Log.
Hajnal Andréka, Judit X. Madarász, István Németi, Gergely Székely
2023 J jnl
No Faster-Than-Light Observers (GenRel).
Arch. Formal Proofs
Mike Stannett, Edward Higgins, Hajnal Andréka, Judit X. Madarász, István Németi, Gergely Székely
2022 J jnl
Complexity in the interdefinability of timelike, lightlike and spacelike relatedness of Minkowski spacetime.
Ann. Pure Appl. Log.
Hajnal Andréka, Judit X. Madarász, István Németi, Gergely Székely
2021 J jnl
Two-variable Logic has Weak, but not Strong, Beth Definability.
J. Symb. Log.
Hajnal Andréka, István Németi
2020 J jnl
Nonrepresentable Relation Algebras from Groups.
Rev. Symb. Log.
Hajnal Andréka, István Németi, Steven Givant
2019 J jnl
Nonrepresentable Relation Algebras from Groups - addendum.
Rev. Symb. Log.
Hajnal Andréka, István Németi, Steven Givant
2017 J jnl
On A New Semantics for First-Order Predicate Logic.
J. Philos. Log.
Hajnal Andréka, Johan van Benthem, István Németi
2017 J jnl
On Tarski's Axiomatic Foundations of the Calculus of Relations.
J. Symb. Log.
Hajnal Andréka, Steven Givant, Peter Jipsen, István Németi
2016 J jnl
No Faster-Than-Light Observers.
Arch. Formal Proofs
Mike Stannett, István Németi
2014 — ch.
Comparing Theories: The Dynamics of Changing Vocabulary.
Johan van Benthem on Logic and Information Dynamics
Hajnal Andréka, István Németi
2014 J jnl
Using Isabelle/HOL to Verify First-Order Relativity Theory.
J. Autom. Reason.
Mike Stannett, István Németi
2012 J jnl
A logic road from special relativity to general relativity.
Synth.
Hajnal Andréka, Judit X. Madarász, István Németi, Gergely Székely
2012 J jnl
Closed timelike Curves in relativistic Computation.
Parallel Process. Lett.
Hajnal Andréka, István Németi, Gergely Székely
2012 J jnl
Decidability, Undecidability, and Gödel's Incompleteness in Relativity Theories.
Parallel Process. Lett.
Hajnal Andréka, Judit X. Madarász, István Németi
2012 — conf
Residuated Kleene Algebras.
Logic and Program Semantics
Hajnal Andréka, Szabolcs Mikulás, István Németi
2012 J jnl
Using Isabelle to verify special relativity, with application to hypercomputation theory
CoRR
Mike Stannett, István Németi
2011 J jnl
The equational theory of Kleene lattices.
Theor. Comput. Sci.
Hajnal Andréka, Szabolcs Mikulás, István Németi
2009 J jnl
General relativistic hypercomputing and foundation of mathematics.
Nat. Comput.
Hajnal Andréka, István Németi, Péter Németi
2009 J jnl
Weakly higher order cylindric algebras and finite axiomatization of the representables.
Stud Logica
István Németi, András Simon
2008 J jnl
Axiomatizing Relativistic Dynamics without Conservation Postulates.
Stud Logica
Hajnal Andréka, Judit X. Madarász, István Németi, Gergely Székely
2008 J jnl
Omitting types for finite variable fragments and complete representations of algebras.
J. Symb. Log.
Tarek Sayed Ahmed, Hajnal Andréka, István Németi
2007 — ch.
Logic of Space-Time and Relativity Theory.
Handbook of Spatial Logics
Hajnal Andréka, Judit X. Madarász, István Németi
2006 C conf
Can General Relativistic Computers Break the Turing Barrier?.
CiE
István Németi, Hajnal Andréka
2006 B conf
New Physics and Hypercomputation.
SOFSEM
István Németi, Hajnal Andréka
2006 J jnl
Relativistic computers and the Turing barrier.
Appl. Math. Comput.
István Németi, Gyula Dávid
2005 J jnl
Mutual definability does not imply definitional equivalence, a simple example.
Math. Log. Q.
Hajnal Andréka, Judit X. Madarász, István Németi
2001 J jnl
On Neat Reducts of Algebras of Logic.
Stud Logica
Tarek Sayed Ahmed, István Németi
2000 J jnl
On The Equational Theory of Representable Polyadic Equality Algebras.
J. Symb. Log.
István Németi, Gábor Sági
2000 J jnl
Representability of Pairing Relation Algebras Depends on your Ontology.
Fundam. Informaticae
Ágnes Kurucz, István Németi
1999 J jnl
Finite Algebras of Relations Are Representable on Finite Sets.
J. Symb. Log.
Hajnal Andréka, Ian M. Hodkinson, István Németi
1998 J jnl
Modal Languages and Bounded Fragments of Predicate Logic.
J. Philos. Log.
Hajnal Andréka, István Németi, Johan van Benthem
1998 J jnl
Notions of Density That Imply Representability in Algebraic Logic.
Ann. Pure Appl. Log.
Hajnal Andréka, Steven Givant, Szabolcs Mikulás, István Németi, András Simon
1998 J jnl
On the Equational Theory of Representable Polyadic Equality Algebras.
Log. J. IGPL
István Németi, Gábor Sági
1998 J jnl
Relativised Quantification: Some Canonical Varieties of Sequence-Set Algebras.
J. Symb. Log.
Hajnal Andréka, Robert Goldblatt, István Németi
1997 — book
Decision problems for equational theories of relation algebras.
Hajnal Andréka, Steven Givant, István Németi
1997 J jnl
Relation Algebras from Cylindric and Polyadic Algebras.
Log. J. IGPL
István Németi, András Simon
1997 J jnl
Strong Representability of Fork Algebras, a Set Theoretic Foundation.
Log. J. IGPL
István Németi
1997 — conf
The finite base property for some cylindric-relativized algebras (Abstract).
RelMiCS
Hajnal Andréka, Ian M. Hodkinson, István Németi
1995 J jnl
Back and Forth Between Modal Logic and Classical Logic.
Log. J. IGPL
Hajnal Andréka, Johan van Benthem, István Németi
1995 J jnl
Binary Relations and Permutation Groups.
Math. Log. Q.
Hajnal Andréka, Ivo Düntsch, István Németi
1995 J jnl
Decidable and Undecidable Logics with a Binary Modality.
J. Log. Lang. Inf.
Ágnes Kurucz, István Németi, Ildikó Sain, András Simon
1995 J jnl
Expressibility of Properties of Relations.
J. Symb. Log.
Hajnal Andréka, Ivo Düntsch, István Németi
1995 J jnl
Perfect Extensions and Derived Algebras.
J. Symb. Log.
Hajnal Andréka, Steven Givant, István Németi
1995 J jnl
Taming Logic.
J. Log. Lang. Inf.
Maarten Marx, Szabolcs Mikulás, István Németi
1995 J jnl
Undecidability of the Equational Theory of Some Classes of Residuated Boolean Algebras with Operators.
Log. J. IGPL
István Németi, Ildikó Sain, András Simon
1994 J jnl
Connections Between Axioms of Set Theory and Basic Theorems of Universal Algebra.
J. Symb. Log.
Hajnal Andréka, Ágnes Kurucz, István Németi
1994 J jnl
The Lattice of Varieties of Representable Relation Algebras.
J. Symb. Log.
Hajnal Andréka, Steven Givant, István Németi
1993 — conf
Applying Algebraic Logic to Logic.
AMAST
Hajnal Andréka, István Németi, Ildikó Sain
1993 J jnl
Undecidable Varieties of Semilattice - ordered Semigroups, of Boolean Algebras with Operators, and logics extending Lambek Calculus.
Log. J. IGPL
Ágnes Kurucz, István Németi, Ildikó Sain, András Simon
1991 J jnl
Algebraization of quantifier logics, an introductory overview.
Stud Logica
István Németi
1991 J jnl
On the Strength of Temporal Proofs.
Theor. Comput. Sci.
Hajnal Andréka, István Németi, Ildikó Sain
1990 J jnl
Weak Cylindric Set Algebra and Weak Subdirect Indecomposability.
J. Symb. Log.
Hajnal Andréka, István Németi, R. J. Thompson
1989 J jnl
Algebraic Logic Conference.
J. Symb. Log.
Hajnal Andréka, Miklós Ferenczi, István Németi, György Serény
1989 B conf
On the Strength of Temporal Proofs.
MFCS
Hajnal Andréka, István Németi, Ildikó Sain
1988 J jnl
A System of Logic for Partial Functions Under Existence-Dependent Kleene Equality.
J. Symb. Log.
Hajnal Andréka, William Craig, István Németi
1988 — conf
On cylindric algebraic model theory.
Algebraic Logic and Universal Algebra in Computer Science
István Németi
1988 — conf
Relatively free relation algebras.
Algebraic Logic and Universal Algebra in Computer Science
Hajnal Andréka, Bjarni Jónsson, István Németi
1987 J jnl
A Unifying Theorem for Algebraic Semantics and Dynamic Logics
Inf. Comput.
Hajnal Andréka, Irène Guessarian, István Németi
1987 J jnl
On varieties of cylindric algebras with applications to logic.
Ann. Pure Appl. Log.
István Németi
1986 — conf
Logic and Computation (Panel).
IFIP Congress
István Németi
1985 B conf
A unifying theorem for algebraic semantics and dynamic logics.
FCT
Hajnal Andréka, Irène Guessarian, István Németi
1985 J jnl
Cylindric-Relativised Set Algebras have Strong Amalgamation.
J. Symb. Log.
István Németi
1985 J jnl
On the Number of Generators of Cylindric Algebras.
J. Symb. Log.
Hajnal Andréka, István Németi
1983 J jnl
The class of neat-reducts of cylindric algebras is not a variety but is closed with respect to HP.
Notre Dame J. Formal Log.
István Németi
1982 J jnl
A Complete Logic for Reasoning about Programs via Nonstandard Model Theory I.
Theor. Comput. Sci.
Hajnal Andréka, István Németi, Ildikó Sain
1982 J jnl
A Complete Logic for Reasoning about Programs via Nonstandard Model Theory II.
Theor. Comput. Sci.
Hajnal Andréka, István Németi, Ildikó Sain
1982 J jnl
Every Free Algebra in the Variety Generated by the Representable Dynamic Algebras is Separable and Representable.
Theor. Comput. Sci.
István Németi
1981 B conf
A Characterization of Floyd-Provable Programs.
MFCS
Hajnal Andréka, István Németi, Ildikó Sain
1981 B conf
Dynamic Algebras of Programs.
FCT
István Németi
1981 — conf
Nonstandard Dynamic Logic.
Logic of Programs
István Németi
1981 B conf
Some Universal Algebraic and Model Theoretic Results in Computer Science.
FCT
Hajnal Andréka, István Németi
1980 B conf
Model Theoretic Semantics For Many-Purpose Languages And Language Hierarchies.
COLING
Hajnal Andréka, Tamás Gergely, István Németi
1980 — conf
Nonstandard runs of Floyd-provable programs.
Logic of Programs
István Németi
1979 B conf
Completeness Problems in Verification of Programs and Program Schemes.
MFCS
Hajnal Andréka, István Németi, Ildikó Sain
1979 B conf
Henkin-type semantics for program-schemes to turn negative results to positive.
FCT
Hajnal Andréka, István Németi, Ildikó Sain
1978 J jnl
The generalized completeness of Horn predicate-logic as a programming language.
Acta Cybern.
Hajnal Andréka, István Németi
1975 A* conf
Definition Theory as Basis for a Creative Problem Solver.
IJCAI
T. Gorgely, Hajnal Andréka, István Németi
1975 J jnl
Logical foundations for a general theory of systems.
Acta Cybern.
Tamás Gergely, István Németi
1975 A* conf
On the Role of Mathematical Language Concept in the Theory of Intelligent Systems.
IJCAI
Hajnal Andréka, Tamás Gergely, István Németi
1973 J jnl
Notes on maximal congruence relations, automata and related topics.
Acta Cybern.
Hajnal Andréka, Sándor Horváth, István Németi