SCEAS

The SCEAS System

Search the dblp DataBase

Title:
Author:

Hajnal Andréka: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

Hajnal Andréka, Ian M. Hodkinson, István Németi
The finite base property for some cylindric-relativized algebras (Abstract). [Citation Graph (0, 0)][DBLP]
RelMiCS, 1997, pp:81- [Conf]
Hajnal Andréka, B. Jónsson, István Németi
Relatively free relation algebras. [Citation Graph (0, 0)][DBLP]
Algebraic Logic and Universal Algebra in Computer Science, 1988, pp:1-14 [Conf]
Hajnal Andréka, István Németi, Ildikó Sain
Applying Algebraic Logic to Logic. [Citation Graph (0, 0)][DBLP]
AMAST, 1993, pp:5-26 [Conf]
Hajnal Andréka, R. J. Greechie, George E. Strecker
On Residuated Approximations. [Citation Graph (0, 0)][DBLP]
Categorial Methods in Computer Science, 1988, pp:333-339 [Conf]
István Németi, Hajnal Andréka
Can General Relativistic Computers Break the Turing Barrier?. [Citation Graph (0, 0)][DBLP]
CiE, 2006, pp:398-412 [Conf]
Hajnal Andréka, Tamás Gergely, István Németi
Model Theoretic Semantics For Many-Purpose Languages And Language Hierarchies. [Citation Graph (0, 0)][DBLP]
COLING, 1980, pp:213-219 [Conf]
Hajnal Andréka, Irène Guessarian, István Németi
A unifying theorem for algebraic semantics and dynamic logics. [Citation Graph (0, 0)][DBLP]
FCT, 1985, pp:8-17 [Conf]
Hajnal Andréka, István Németi
Some Universal Algebraic and Model Theoretic Results in Computer Science. [Citation Graph (0, 0)][DBLP]
FCT, 1981, pp:16-23 [Conf]
Hajnal Andréka, István Németi, Ildikó Sain
Henkin-type semantics for program-schemes to turn negative results to positive. [Citation Graph (0, 0)][DBLP]
FCT, 1979, pp:18-24 [Conf]
Hajnal Andréka, Tamás Gergely, István Németi
On the Role of Mathematical Language Concept in the Theory of Intelligent Systems. [Citation Graph (0, 0)][DBLP]
IJCAI, 1975, pp:9-14 [Conf]
T. Gorgely, Hajnal Andréka, István Németi
Definition Theory as Basis for a Creative Problem Solver. [Citation Graph (0, 0)][DBLP]
IJCAI, 1975, pp:40-45 [Conf]
Hajnal Andréka
Sharpening the characterization of the power of Floyd method. [Citation Graph (0, 0)][DBLP]
Logic of Programs, 1980, pp:1-26 [Conf]
Hajnal Andréka, István Németi, Ildikó Sain
On the Strength of Temporal Proofs. [Citation Graph (0, 0)][DBLP]
MFCS, 1989, pp:135-144 [Conf]
Hajnal Andréka, István Németi, Ildikó Sain
Completeness Problems in Verification of Programs and Program Schemes. [Citation Graph (0, 0)][DBLP]
MFCS, 1979, pp:208-218 [Conf]
Hajnal Andréka, István Németi, Ildikó Sain
A Characterization of Floyd-Provable Programs. [Citation Graph (0, 0)][DBLP]
MFCS, 1981, pp:162-171 [Conf]
István Németi, Hajnal Andréka
New Physics and Hypercomputation. [Citation Graph (0, 0)][DBLP]
SOFSEM, 2006, pp:63-63 [Conf]
Hajnal Andréka, Sándor Horváth, István Németi
Notes on maximal congruence relations, automata and related topics. [Citation Graph (0, 0)][DBLP]
Acta Cybern., 1976, v:2, n:, pp:71-88 [Journal]
Hajnal Andréka, István Németi
The generalized completeness of Horn predicate-logic as a programming language. [Citation Graph (0, 0)][DBLP]
Acta Cybern., 1980, v:4, n:, pp:3-10 [Journal]
Hajnal Andréka
Complexity of Equations Valid in Algebras of Relations: Part I: Strong Non-Finitizability. [Citation Graph (0, 0)][DBLP]
Ann. Pure Appl. Logic, 1997, v:89, n:2-3, pp:149-209 [Journal]
Hajnal Andréka
Complexity of Equations Valid in Algebras of Relations: Part II: Finite Axiomatizations. [Citation Graph (0, 0)][DBLP]
Ann. Pure Appl. Logic, 1997, v:89, n:2-3, pp:211-229 [Journal]
Hajnal Andréka, Steven Givant, Szabolcs Mikulás, István Németi, András Simon
Notions of Density That Imply Representability in Algebraic Logic. [Citation Graph (0, 0)][DBLP]
Ann. Pure Appl. Logic, 1998, v:91, n:2-3, pp:93-190 [Journal]
Steven Givant, Hajnal Andréka
Groups and algebras of nary relations. [Citation Graph (0, 0)][DBLP]
Bulletin of Symbolic Logic, 2002, v:8, n:1, pp:38-64 [Journal]
Hajnal Andréka, Irène Guessarian, István Németi
A Unifying Theorem for Algebraic Semantics and Dynamic Logics [Citation Graph (0, 0)][DBLP]
Inf. Comput., 1987, v:72, n:1, pp:31-45 [Journal]
Hajnal Andréka, Robert Goldblatt, István Németi
Relativised Quantification: Some Canonical Varieties of Sequence-Set Algebras. [Citation Graph (0, 0)][DBLP]
J. Symb. Log., 1998, v:63, n:1, pp:163-184 [Journal]
Hajnal Andréka, Ian M. Hodkinson, István Németi
Finite Algebras of Relations Are Representable on Finite Sets. [Citation Graph (0, 0)][DBLP]
J. Symb. Log., 1999, v:64, n:1, pp:243-267 [Journal]
Hajnal Andréka, Ágnes Kurucz, István Németi
Connections Between Axioms of Set Theory and Basic Theorems of Universal Algebra. [Citation Graph (0, 0)][DBLP]
J. Symb. Log., 1994, v:59, n:3, pp:912-923 [Journal]
Hajnal Andréka, István Németi
On the Number of Generators of Cylindric Algebras. [Citation Graph (0, 0)][DBLP]
J. Symb. Log., 1985, v:50, n:4, pp:865-873 [Journal]
Hajnal Andréka, István Németi, R. J. Thompson
Weak Cylindric Set Algebra and Weak Subdirect Indecomposability. [Citation Graph (0, 0)][DBLP]
J. Symb. Log., 1990, v:55, n:2, pp:577-588 [Journal]
Hajnal Andréka, Steven Givant, István Németi
The Lattice of Varieties of Representable Relation Algebras. [Citation Graph (0, 0)][DBLP]
J. Symb. Log., 1994, v:59, n:2, pp:631-661 [Journal]
Hajnal Andréka, Steven Givant, István Németi
Perfect Extensions and Derived Algebras. [Citation Graph (0, 0)][DBLP]
J. Symb. Log., 1995, v:60, n:3, pp:775-796 [Journal]
Hajnal Andréka, William Craig, István Németi
A System of Logic for Partial Functions Under Existence-Dependent Kleene Equality. [Citation Graph (0, 0)][DBLP]
J. Symb. Log., 1988, v:53, n:3, pp:834-839 [Journal]
Hajnal Andréka, Ivo Düntsch, István Németi
Expressibility of Properties of Relations. [Citation Graph (0, 0)][DBLP]
J. Symb. Log., 1995, v:60, n:3, pp:970-991 [Journal]
Hajnal Andréka, M. Ferenczi, István Németi, György Serény
Algebraic Logic Conference. [Citation Graph (0, 0)][DBLP]
J. Symb. Log., 1989, v:54, n:2, pp:686- [Journal]
Hajnal Andréka, Mark Ryan, Pierre-Yves Schobbens
Operators and Laws for Combining Preference Relations. [Citation Graph (0, 0)][DBLP]
J. Log. Comput., 2002, v:12, n:1, pp:13-53 [Journal]
Hajnal Andréka, Ivo Düntsch, István Németi
Binary Relations and Permutation Groups. [Citation Graph (0, 0)][DBLP]
Math. Log. Q., 1995, v:41, n:, pp:197-216 [Journal]
Hajnal Andréka, Judit X. Madarász, István Németi
Mutual definability does not imply definitional equivalence, a simple example. [Citation Graph (0, 0)][DBLP]
Math. Log. Q., 2005, v:51, n:6, pp:591-597 [Journal]
Hajnal Andréka, Roger D. Maddux
Representations for Small Relation Algebras. [Citation Graph (0, 0)][DBLP]
Notre Dame Journal of Formal Logic, 1994, v:35, n:4, pp:550-562 [Journal]
Hajnal Andréka, István Németi, Ildikó Sain
A Complete Logic for Reasoning about Programs via Nonstandard Model Theory I. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 1982, v:17, n:, pp:193-212 [Journal]
Hajnal Andréka, István Németi, Ildikó Sain
A Complete Logic for Reasoning about Programs via Nonstandard Model Theory II. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 1982, v:17, n:, pp:259-278 [Journal]
Hajnal Andréka, István Németi, Ildikó Sain
On the Strength of Temporal Proofs. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 1991, v:80, n:2, pp:125-151 [Journal]

Search in 0.006secs, Finished in 0.009secs

NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades

NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP