| 2008 |
| 55 | EE | Hajnal Andréka,
Judit X. Madarász,
István Németi,
Gergely Székely:
Axiomatizing Relativistic Dynamics without Conservation Postulates.
Studia Logica 89(2): 163-186 (2008) |
| 2007 |
| 54 | EE | Hajnal Andréka,
Judit X. Madarász,
István Németi:
Logic of Space-Time and Relativity Theory.
Handbook of Spatial Logics 2007: 607-711 |
| 2006 |
| 53 | EE | István Németi,
Hajnal Andréka:
Can General Relativistic Computers Break the Turing Barrier?.
CiE 2006: 398-412 |
| 52 | EE | István Németi,
Hajnal Andréka:
New Physics and Hypercomputation.
SOFSEM 2006: 63-63 |
| 51 | EE | István Németi,
Gyula Dávid:
Relativistic computers and the Turing barrier.
Applied Mathematics and Computation 178(1): 118-142 (2006) |
| 2005 |
| 50 | EE | 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): 591-597 (2005) |
| 2001 |
| 49 | | Tarek Sayed Ahmed,
István Németi:
On Neat Reducts of Algebras of Logic.
Studia Logica 68(2): 229-262 (2001) |
| 2000 |
| 48 | | Ágnes Kurucz,
István Németi:
Representability of Pairing Relation Algebras Depends on your Ontology.
Fundam. Inform. 44(4): 397-420 (2000) |
| 47 | | István Németi,
Gábor Sági:
On The Equational Theory of Representable Polyadic Equality Algebras.
J. Symb. Log. 65(3): 1143-1167 (2000) |
| 1999 |
| 46 | | Hajnal Andréka,
Ian M. Hodkinson,
István Németi:
Finite Algebras of Relations Are Representable on Finite Sets.
J. Symb. Log. 64(1): 243-267 (1999) |
| 1998 |
| 45 | | 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. Logic 91(2-3): 93-190 (1998) |
| 44 | | Hajnal Andréka,
Robert Goldblatt,
István Németi:
Relativised Quantification: Some Canonical Varieties of Sequence-Set Algebras.
J. Symb. Log. 63(1): 163-184 (1998) |
| 43 | EE | István Németi,
Gábor Sági:
On the Equational Theory of Representable Polyadic Equality Algebras.
Logic Journal of the IGPL 6(1): 3-15 (1998) |
| 1997 |
| 42 | | Hajnal Andréka,
Ian M. Hodkinson,
István Németi:
The finite base property for some cylindric-relativized algebras (Abstract).
RelMiCS 1997: 81 |
| 41 | EE | István Németi:
Strong Representability of Fork Algebras, a Set Theoretic Foundation.
Logic Journal of the IGPL 5(1): (1997) |
| 40 | EE | István Németi,
András Simon:
Relation Algebras from Cylindric and Polyadic Algebras.
Logic Journal of the IGPL 5(4): (1997) |
| 1995 |
| 39 | | Hajnal Andréka,
Steven Givant,
István Németi:
Perfect Extensions and Derived Algebras.
J. Symb. Log. 60(3): 775-796 (1995) |
| 38 | | Hajnal Andréka,
Ivo Düntsch,
István Németi:
Expressibility of Properties of Relations.
J. Symb. Log. 60(3): 970-991 (1995) |
| 37 | | Ágnes Kurucz,
István Németi,
Ildikó Sain,
András Simon:
Decidable and Undecidable Logics with a Binary Modality.
Journal of Logic, Language and Information 4(3): 191-206 (1995) |
| 36 | | Maarten Marx,
Szabolcs Mikulás,
István Németi:
Taming Logic.
Journal of Logic, Language and Information 4(3): 207-226 (1995) |
| 35 | EE | István Németi,
Ildikó Sain,
András Simon:
Undecidability of the Equational Theory of Some Classes of Residuated Boolean Algebras with Operators.
Logic Journal of the IGPL 3(1): 93-105 (1995) |
| 34 | EE | Hajnal Andréka,
Johan van Benthem,
István Németi:
Back and Forth Between Modal Logic and Classical Logic.
Logic Journal of the IGPL 3(5): 685-720 (1995) |
| 33 | | Hajnal Andréka,
Ivo Düntsch,
István Németi:
Binary Relations and Permutation Groups.
Math. Log. Q. 41: 197-216 (1995) |
| 1994 |
| 32 | | Hajnal Andréka,
Steven Givant,
István Németi:
The Lattice of Varieties of Representable Relation Algebras.
J. Symb. Log. 59(2): 631-661 (1994) |
| 31 | | 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): 912-923 (1994) |
| 1993 |
| 30 | | Hajnal Andréka,
István Németi,
Ildikó Sain:
Applying Algebraic Logic to Logic.
AMAST 1993: 5-26 |
| 29 | EE | Á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.
Logic Journal of the IGPL 1(1): 91-98 (1993) |
| 1991 |
| 28 | | Hajnal Andréka,
István Németi,
Ildikó Sain:
On the Strength of Temporal Proofs.
Theor. Comput. Sci. 80(2): 125-151 (1991) |
| 1990 |
| 27 | | Hajnal Andréka,
István Németi,
R. J. Thompson:
Weak Cylindric Set Algebra and Weak Subdirect Indecomposability.
J. Symb. Log. 55(2): 577-588 (1990) |
| 1989 |
| 26 | | Hajnal Andréka,
István Németi,
Ildikó Sain:
On the Strength of Temporal Proofs.
MFCS 1989: 135-144 |
| 25 | | Hajnal Andréka,
M. Ferenczi,
István Németi,
György Serény:
Algebraic Logic Conference.
J. Symb. Log. 54(2): 686 (1989) |
| 1988 |
| 24 | | Hajnal Andréka,
Bjarni Jónsson,
István Németi:
Relatively free relation algebras.
Algebraic Logic and Universal Algebra in Computer Science 1988: 1-14 |
| 23 | | István Németi:
On cylindric algebraic model theory.
Algebraic Logic and Universal Algebra in Computer Science 1988: 37-75 |
| 22 | | 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): 834-839 (1988) |
| 1987 |
| 21 | | Hajnal Andréka,
Irène Guessarian,
István Németi:
A Unifying Theorem for Algebraic Semantics and Dynamic Logics
Inf. Comput. 72(1): 31-45 (1987) |
| 1986 |
| 20 | | István Németi:
Logic and Computation (Panel).
IFIP Congress 1986: 395-396 |
| 1985 |
| 19 | | Hajnal Andréka,
Irène Guessarian,
István Németi:
A unifying theorem for algebraic semantics and dynamic logics.
FCT 1985: 8-17 |
| 18 | | István Németi:
Cylindric-Relativised Set Algebras have Strong Amalgamation.
J. Symb. Log. 50(3): 689-700 (1985) |
| 17 | | Hajnal Andréka,
István Németi:
On the Number of Generators of Cylindric Algebras.
J. Symb. Log. 50(4): 865-873 (1985) |
| 1982 |
| 16 | | 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: 193-212 (1982) |
| 15 | | 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: 259-278 (1982) |
| 14 | | István Németi:
Every Free Algebra in the Variety Generated by the Representable Dynamic Algebras is Separable and Representable.
Theor. Comput. Sci. 17: 343-347 (1982) |
| 1981 |
| 13 | | Hajnal Andréka,
István Németi:
Some Universal Algebraic and Model Theoretic Results in Computer Science.
FCT 1981: 16-23 |
| 12 | | István Németi:
Dynamic Algebras of Programs.
FCT 1981: 281-290 |
| 11 | | István Németi:
Nonstandard Dynamic Logic.
Logic of Programs 1981: 311-348 |
| 10 | | Hajnal Andréka,
István Németi,
Ildikó Sain:
A Characterization of Floyd-Provable Programs.
MFCS 1981: 162-171 |
| 1980 |
| 9 | EE | Hajnal Andréka,
Tamás Gergely,
István Németi:
Model Theoretic Semantics For Many-Purpose Languages And Language Hierarchies.
COLING 1980: 213-219 |
| 8 | | István Németi:
Nonstandard runs of Floyd-provable programs.
Logic of Programs 1980: 186-204 |
| 7 | | Hajnal Andréka,
István Németi:
The generalized completeness of Horn predicate-logic as a programming language.
Acta Cybern. 4: 3-10 (1980) |
| 1979 |
| 6 | | Hajnal Andréka,
István Németi,
Ildikó Sain:
Henkin-type semantics for program-schemes to turn negative results to positive.
FCT 1979: 18-24 |
| 5 | | Hajnal Andréka,
István Németi,
Ildikó Sain:
Completeness Problems in Verification of Programs and Program Schemes.
MFCS 1979: 208-218 |
| 1976 |
| 4 | | Tamás Gergely,
István Németi:
Logical foundations for a general theory of systems.
Acta Cybern. 2: 261-276 (1976) |
| 3 | | Hajnal Andréka,
Sándor Horváth,
István Németi:
Notes on maximal congruence relations, automata and related topics.
Acta Cybern. 2: 71-88 (1976) |
| 1975 |
| 2 | | T. Gorgely,
Hajnal Andréka,
István Németi:
Definition Theory as Basis for a Creative Problem Solver.
IJCAI 1975: 40-45 |
| 1 | | 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: 9-14 |