The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
István Németi: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. 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]
  2. 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]
  3. István Németi
    On cylindric algebraic model theory. [Citation Graph (0, 0)][DBLP]
    Algebraic Logic and Universal Algebra in Computer Science, 1988, pp:37-75 [Conf]
  4. 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]
  5. 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]
  6. 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]
  7. 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]
  8. 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]
  9. 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]
  10. István Németi
    Dynamic Algebras of Programs. [Citation Graph (0, 0)][DBLP]
    FCT, 1981, pp:281-290 [Conf]
  11. István Németi
    Logic and Computation (Panel). [Citation Graph (0, 0)][DBLP]
    IFIP Congress, 1986, pp:395-396 [Conf]
  12. 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]
  13. 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]
  14. István Németi
    Nonstandard runs of Floyd-provable programs. [Citation Graph (0, 0)][DBLP]
    Logic of Programs, 1980, pp:186-204 [Conf]
  15. István Németi
    Nonstandard Dynamic Logic. [Citation Graph (0, 0)][DBLP]
    Logic of Programs, 1981, pp:311-348 [Conf]
  16. 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]
  17. 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]
  18. 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]
  19. István Németi, Hajnal Andréka
    New Physics and Hypercomputation. [Citation Graph (0, 0)][DBLP]
    SOFSEM, 2006, pp:63-63 [Conf]
  20. 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]
  21. 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]
  22. Tamás Gergely, István Németi
    Logical foundations for a general theory of systems. [Citation Graph (0, 0)][DBLP]
    Acta Cybern., 1976, v:2, n:, pp:261-276 [Journal]
  23. 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]
  24. Ágnes Kurucz, István Németi
    Representability of Pairing Relation Algebras Depends on your Ontology. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2000, v:44, n:4, pp:397-420 [Journal]
  25. 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]
  26. István Németi
    Strong Representability of Fork Algebras, a Set Theoretic Foundation. [Citation Graph (0, 0)][DBLP]
    Logic Journal of the IGPL, 1997, v:5, n:1, pp:- [Journal]
  27. István Németi, András Simon
    Relation Algebras from Cylindric and Polyadic Algebras. [Citation Graph (0, 0)][DBLP]
    Logic Journal of the IGPL, 1997, v:5, n:4, pp:- [Journal]
  28. István Németi, Gábor Sági
    On the Equational Theory of Representable Polyadic Equality Algebras. [Citation Graph (0, 0)][DBLP]
    Logic Journal of the IGPL, 1998, v:6, n:1, pp:3-15 [Journal]
  29. Ágnes Kurucz, István Németi, Ildikó Sain, András Simon
    Decidable and Undecidable Logics with a Binary Modality. [Citation Graph (0, 0)][DBLP]
    Journal of Logic, Language and Information, 1995, v:4, n:3, pp:191-206 [Journal]
  30. Maarten Marx, Szabolcs Mikulás, István Németi
    Taming Logic. [Citation Graph (0, 0)][DBLP]
    Journal of Logic, Language and Information, 1995, v:4, n:3, pp:207-226 [Journal]
  31. 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]
  32. 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]
  33. 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]
  34. 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]
  35. 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]
  36. 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]
  37. 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]
  38. 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]
  39. 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]
  40. 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]
  41. István Németi
    Cylindric-Relativised Set Algebras have Strong Amalgamation. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1985, v:50, n:3, pp:689-700 [Journal]
  42. István Németi, Gábor Sági
    On The Equational Theory of Representable Polyadic Equality Algebras. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 2000, v:65, n:3, pp:1143-1167 [Journal]
  43. 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]
  44. 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]
  45. Tarek Sayed Ahmed, István Németi
    On Neat Reducts of Algebras of Logic. [Citation Graph (0, 0)][DBLP]
    Studia Logica, 2001, v:68, n:2, pp:229-262 [Journal]
  46. 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]
  47. 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]
  48. 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]
  49. István Németi
    Every Free Algebra in the Variety Generated by the Representable Dynamic Algebras is Separable and Representable. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1982, v:17, n:, pp:343-347 [Journal]
  50. István Németi, Gyula Dávid
    Relativistic computers and the Turing barrier. [Citation Graph (0, 0)][DBLP]
    Applied Mathematics and Computation, 2006, v:178, n:1, pp:118-142 [Journal]

Search in 0.003secs, Finished in 0.326secs
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
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002