István Németi

Publication Activity (10 Years)

Years Active: 1973-2023
Publications (10 Years): 8

Top Topics

Relation Algebra

Logical Language

Quantifier Free

Light Scattering

Top Venues

Arch. Formal Proofs

Rev. Symb. Log.

Ann. Pure Appl. Log.

Publications

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