Hajnal Andréka

	2008
43		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
42		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
41		István Németi, Hajnal Andréka: Can General Relativistic Computers Break the Turing Barrier?. CiE 2006: 398-412
40		István Németi, Hajnal Andréka: New Physics and Hypercomputation. SOFSEM 2006: 63-63
	2005
39		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)
	2002
38		Steven Givant, Hajnal Andréka: Groups and algebras of nary relations. Bulletin of Symbolic Logic 8(1): 38-64 (2002)
37		Hajnal Andréka, Mark Ryan, Pierre-Yves Schobbens: Operators and Laws for Combining Preference Relations. J. Log. Comput. 12(1): 13-53 (2002)
	1999
36		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
35		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)
34		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)
	1997
33		Hajnal Andréka, Ian M. Hodkinson, István Németi: The finite base property for some cylindric-relativized algebras (Abstract). RelMiCS 1997: 81
32		Hajnal Andréka: Complexity of Equations Valid in Algebras of Relations: Part I: Strong Non-Finitizability. Ann. Pure Appl. Logic 89(2-3): 149-209 (1997)
31		Hajnal Andréka: Complexity of Equations Valid in Algebras of Relations: Part II: Finite Axiomatizations. Ann. Pure Appl. Logic 89(2-3): 211-229 (1997)
	1995
30		Hajnal Andréka, Steven Givant, István Németi: Perfect Extensions and Derived Algebras. J. Symb. Log. 60(3): 775-796 (1995)
29		Hajnal Andréka, Ivo Düntsch, István Németi: Expressibility of Properties of Relations. J. Symb. Log. 60(3): 970-991 (1995)
28		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)
27		Hajnal Andréka, Ivo Düntsch, István Németi: Binary Relations and Permutation Groups. Math. Log. Q. 41: 197-216 (1995)
	1994
26		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)
25		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)
24		Hajnal Andréka, Roger D. Maddux: Representations for Small Relation Algebras. Notre Dame Journal of Formal Logic 35(4): 550-562 (1994)
	1993
23		Hajnal Andréka, István Németi, Ildikó Sain: Applying Algebraic Logic to Logic. AMAST 1993: 5-26
	1991
22		Hajnal Andréka, István Németi, Ildikó Sain: On the Strength of Temporal Proofs. Theor. Comput. Sci. 80(2): 125-151 (1991)
	1990
21		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
20		Hajnal Andréka, István Németi, Ildikó Sain: On the Strength of Temporal Proofs. MFCS 1989: 135-144
19		Hajnal Andréka, M. Ferenczi, István Németi, György Serény: Algebraic Logic Conference. J. Symb. Log. 54(2): 686 (1989)
	1988
18		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
17		Hajnal Andréka, R. J. Greechie, George E. Strecker: On Residuated Approximations. Categorial Methods in Computer Science 1988: 333-339
16		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
15		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)
	1985
14		Hajnal Andréka, Irène Guessarian, István Németi: A unifying theorem for algebraic semantics and dynamic logics. FCT 1985: 8-17
13		Hajnal Andréka, István Németi: On the Number of Generators of Cylindric Algebras. J. Symb. Log. 50(4): 865-873 (1985)
	1982
12		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)
11		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)
	1981
10		Hajnal Andréka, István Németi: Some Universal Algebraic and Model Theoretic Results in Computer Science. FCT 1981: 16-23
9		Hajnal Andréka, István Németi, Ildikó Sain: A Characterization of Floyd-Provable Programs. MFCS 1981: 162-171
	1980
8		Hajnal Andréka, Tamás Gergely, István Németi: Model Theoretic Semantics For Many-Purpose Languages And Language Hierarchies. COLING 1980: 213-219
7		Hajnal Andréka: Sharpening the characterization of the power of Floyd method. Logic of Programs 1980: 1-26
6		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
5		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
4		Hajnal Andréka, István Németi, Ildikó Sain: Completeness Problems in Verification of Programs and Program Schemes. MFCS 1979: 208-218
	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

Coauthor Index

1	Johan van Benthem	[28]
2	William Craig	[16]
3	Ivo Düntsch	[27] [29]
4	M. Ferenczi	[19]
5	Tamás Gergely	[1] [8]
6	Steven Givant	[26] [30] [35] [38]
7	Robert Goldblatt	[34]
8	T. Gorgely	[2]
9	R. J. Greechie	[17]
10	Irène Guessarian	[14] [15]
11	Ian M. Hodkinson	[33] [36]
12	Sándor Horváth	[3]
13	Bjarni Jónsson	[18]
14	Ágnes Kurucz (Agi Kurucz)	[25]
15	Judit X. Madarász	[39] [42] [43]
16	Roger D. Maddux	[24]
17	Szabolcs Mikulás	[35]
18	István Németi	[1] [2] [3] [4] [5] [6] [8] [9] [10] [11] [12] [13] [14] [15] [16] [18] [19] [20] [21] [22] [23] [25] [26] [27] [28] [29] [30] [33] [34] [35] [36] [39] [40] [41] [42] [43]
19	Mark Ryan (Mark Dermot Ryan)	[37]
20	Ildikó Sain	[4] [5] [9] [11] [12] [20] [22] [23]
21	Pierre-Yves Schobbens	[37]
22	György Serény	[19]
23	András Simon	[35]
24	George E. Strecker	[17]
25	Gergely Székely	[43]
26	R. J. Thompson	[21]

Colors in the list of coauthors