default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHajnal Andréka
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j43]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)- 2022
- [j42]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): 103100 (2022) - 2021
- [j41]Hajnal Andréka, István Németi:
Two-variable Logic has Weak, but not Strong, Beth Definability. J. Symb. Log. 86(2): 785-800 (2021) - 2020
- [j40]Hajnal Andréka, István Németi, Steven Givant:
Nonrepresentable Relation Algebras from Groups. Rev. Symb. Log. 13(4): 861-881 (2020)
2010 – 2019
- 2019
- [j39]Hajnal Andréka, István Németi, Steven Givant:
Nonrepresentable Relation Algebras from Groups - addendum. Rev. Symb. Log. 12(4): 892 (2019) - 2018
- [j38]Steven Givant, Hajnal Andréka:
A representation theorem for measurable relation algebras. Ann. Pure Appl. Log. 169(11): 1117-1189 (2018) - [j37]Steven Givant, Hajnal Andréka:
The Variety of coset Relation Algebras. J. Symb. Log. 83(4): 1595-1609 (2018) - 2017
- [j36]Hajnal Andréka, Johan van Benthem, István Németi:
On A New Semantics for First-Order Predicate Logic. J. Philos. Log. 46(3): 259-267 (2017) - [j35]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): 966-994 (2017) - 2014
- [p2]Hajnal Andréka, István Németi:
Comparing Theories: The Dynamics of Changing Vocabulary. Johan van Benthem on Logic and Information Dynamics 2014: 143-172 - 2012
- [j34]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) - [j33]Hajnal Andréka, István Németi, Gergely Székely:
Closed timelike Curves in relativistic Computation. Parallel Process. Lett. 22(3) (2012) - [j32]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): 633-649 (2012) - [c17]Hajnal Andréka, Szabolcs Mikulás, István Németi:
Residuated Kleene Algebras. Logic and Program Semantics 2012: 1-11 - 2011
- [j31]Hajnal Andréka, Szabolcs Mikulás, István Németi:
The equational theory of Kleene lattices. Theor. Comput. Sci. 412(52): 7099-7108 (2011)
2000 – 2009
- 2009
- [j30]Hajnal Andréka, István Németi, Péter Németi:
General relativistic hypercomputing and foundation of mathematics. Nat. Comput. 8(3): 499-516 (2009) - 2008
- [j29]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): 65-89 (2008) - [j28]Hajnal Andréka, Judit X. Madarász, István Németi, Gergely Székely:
Axiomatizing Relativistic Dynamics without Conservation Postulates. Stud Logica 89(2): 163-186 (2008) - 2007
- [p1]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
- [c16]István Németi, Hajnal Andréka:
Can General Relativistic Computers Break the Turing Barrier?. CiE 2006: 398-412 - [c15]István Németi, Hajnal Andréka:
New Physics and Hypercomputation. SOFSEM 2006: 63-63 - 2005
- [j27]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
- [j26]Steven Givant, Hajnal Andréka:
Groups and algebras of nary relations. Bull. Symb. Log. 8(1): 38-64 (2002) - [j25]Hajnal Andréka, Mark Ryan, Pierre-Yves Schobbens:
Operators and Laws for Combining Preference Relations. J. Log. Comput. 12(1): 13-53 (2002)
1990 – 1999
- 1999
- [j24]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
- [j23]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): 93-190 (1998) - [j22]Hajnal Andréka, István Németi, Johan van Benthem:
Modal Languages and Bounded Fragments of Predicate Logic. J. Philos. Log. 27(3): 217-274 (1998) - [j21]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
- [b1]Hajnal Andréka, Steven Givant, István Németi:
Decision problems for equational theories of relation algebras. Memoirs of the American Mathematical Society 126, American Mathematical Society 1997, ISBN 978-0-8218-0595-4, pp. I-XIV, 1-126 - [j20]Hajnal Andréka:
Complexity of Equations Valid in Algebras of Relations: Part I: Strong Non-Finitizability. Ann. Pure Appl. Log. 89(2-3): 149-209 (1997) - [j19]Hajnal Andréka:
Complexity of Equations Valid in Algebras of Relations: Part II: Finite Axiomatizations. Ann. Pure Appl. Log. 89(2-3): 211-229 (1997) - [c14]Hajnal Andréka, Ian M. Hodkinson, István Németi:
The finite base property for some cylindric-relativized algebras (Abstract). RelMiCS 1997: 81 - 1995
- [j18]Hajnal Andréka, Johan van Benthem, István Németi:
Back and Forth Between Modal Logic and Classical Logic. Log. J. IGPL 3(5): 685-720 (1995) - [j17]Hajnal Andréka, Steven Givant, István Németi:
Perfect Extensions and Derived Algebras. J. Symb. Log. 60(3): 775-796 (1995) - [j16]Hajnal Andréka, Ivo Düntsch, István Németi:
Expressibility of Properties of Relations. J. Symb. Log. 60(3): 970-991 (1995) - [j15]Hajnal Andréka, Ivo Düntsch, István Németi:
Binary Relations and Permutation Groups. Math. Log. Q. 41: 197-216 (1995) - 1994
- [j14]Hajnal Andréka, Szabolcs Mikulás:
Lambek Calculus and its relational semantics: Completeness and incompleteness. J. Log. Lang. Inf. 3(1): 1-37 (1994) - [j13]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) - [j12]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) - [j11]Hajnal Andréka, Roger D. Maddux:
Representations for Small Relation Algebras. Notre Dame J. Formal Log. 35(4): 550-562 (1994) - 1993
- [c13]Hajnal Andréka, István Németi, Ildikó Sain:
Applying Algebraic Logic to Logic. AMAST 1993: 5-26 - 1991
- [j10]Hajnal Andréka, István Németi, Ildikó Sain:
On the Strength of Temporal Proofs. Theor. Comput. Sci. 80(2): 125-151 (1991) - 1990
- [j9]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)
1980 – 1989
- 1989
- [j8]Hajnal Andréka, Miklós Ferenczi, István Németi, György Serény:
Algebraic Logic Conference. J. Symb. Log. 54(2): 686 (1989) - [c12]Hajnal Andréka, István Németi, Ildikó Sain:
On the Strength of Temporal Proofs. MFCS 1989: 135-144 - 1988
- [j7]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) - [c11]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 - [c10]Hajnal Andréka, R. J. Greechie, George E. Strecker:
On Residuated Approximations. Categorial Methods in Computer Science 1988: 333-339 - 1987
- [j6]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
- [j5]Hajnal Andréka, István Németi:
On the Number of Generators of Cylindric Algebras. J. Symb. Log. 50(4): 865-873 (1985) - [c9]Hajnal Andréka, Irène Guessarian, István Németi:
A unifying theorem for algebraic semantics and dynamic logics. FCT 1985: 8-17 - 1982
- [j4]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) - [j3]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
- [c8]Hajnal Andréka, István Németi:
Some Universal Algebraic and Model Theoretic Results in Computer Science. FCT 1981: 16-23 - [c7]Hajnal Andréka, István Németi, Ildikó Sain:
A Characterization of Floyd-Provable Programs. MFCS 1981: 162-171 - 1980
- [c6]Hajnal Andréka, Tamás Gergely, István Németi:
Model Theoretic Semantics For Many-Purpose Languages And Language Hierarchies. COLING 1980: 213-219 - [c5]Hajnal Andréka:
Sharpening the characterization of the power of Floyd method. Logic of Programs 1980: 1-26
1970 – 1979
- 1979
- [c4]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 - [c3]Hajnal Andréka, István Németi, Ildikó Sain:
Completeness Problems in Verification of Programs and Program Schemes. MFCS 1979: 208-218 - 1978
- [j2]Hajnal Andréka, István Németi:
The generalized completeness of Horn predicate-logic as a programming language. Acta Cybern. 4(1): 3-10 (1978) - 1975
- [c2]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 - [c1]T. Gorgely, Hajnal Andréka, István Németi:
Definition Theory as Basis for a Creative Problem Solver. IJCAI 1975: 40-45 - 1973
- [j1]Hajnal Andréka, Sándor Horváth, István Németi:
Notes on maximal congruence relations, automata and related topics. Acta Cybern. 2(1): 71-88 (1973)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-20 22:52 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
