Hajnal Andréka

Publication Activity (10 Years)

Years Active: 1973-2023
Publications (10 Years): 9

Top Topics

Relation Algebra

Top Venues

Ann. Pure Appl. Log.

Rev. Symb. Log.

Arch. Formal Proofs

Publications

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)
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) (2022)
Hajnal Andréka, István Németi
Two-variable Logic has Weak, but not Strong, Beth Definability. J. Symb. Log. 86 (2) (2021)
Hajnal Andréka, István Németi, Steven Givant
Nonrepresentable Relation Algebras from Groups. Rev. Symb. Log. 13 (4) (2020)
Hajnal Andréka, István Németi, Steven Givant
Nonrepresentable Relation Algebras from Groups - addendum. Rev. Symb. Log. 12 (4) (2019)
Steven Givant, Hajnal Andréka
The Variety of coset Relation Algebras. J. Symb. Log. 83 (4) (2018)
Steven Givant, Hajnal Andréka
A representation theorem for measurable relation algebras. Ann. Pure Appl. Log. 169 (11) (2018)
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) (2017)
Hajnal Andréka, Johan van Benthem, István Németi
On A New Semantics for First-Order Predicate Logic. J. Philos. Log. 46 (3) (2017)
Hajnal Andréka, István Németi, Gergely Székely
Closed timelike Curves in relativistic Computation. Parallel Process. Lett. 22 (3) (2012)
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) (2012)
Hajnal Andréka, Szabolcs Mikulás, István Németi
Residuated Kleene Algebras. Logic and Program Semantics (2012)
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)
Hajnal Andréka, Szabolcs Mikulás, István Németi
The equational theory of Kleene lattices. Theor. Comput. Sci. 412 (52) (2011)
Hajnal Andréka, István Németi, Péter Németi
General relativistic hypercomputing and foundation of mathematics. Nat. Comput. 8 (3) (2009)
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) (2008)
Hajnal Andréka, Judit X. Madarász, István Németi, Gergely Székely
Axiomatizing Relativistic Dynamics without Conservation Postulates. Stud Logica 89 (2) (2008)
István Németi, Hajnal Andréka
Can General Relativistic Computers Break the Turing Barrier?. CiE (2006)
István Németi, Hajnal Andréka
New Physics and Hypercomputation. SOFSEM (2006)
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) (2005)
Steven Givant, Hajnal Andréka
Groups and algebras of nary relations. Bull. Symb. Log. 8 (1) (2002)
Hajnal Andréka, Mark Ryan, Pierre-Yves Schobbens
Operators and Laws for Combining Preference Relations. J. Log. Comput. 12 (1) (2002)
Hajnal Andréka, Ian M. Hodkinson, István Németi
Finite Algebras of Relations Are Representable on Finite Sets. J. Symb. Log. 64 (1) (1999)
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) (1998)
Hajnal Andréka, István Németi, Johan van Benthem
Modal Languages and Bounded Fragments of Predicate Logic. J. Philos. Log. 27 (3) (1998)
Hajnal Andréka, Robert Goldblatt, István Németi
Relativised Quantification: Some Canonical Varieties of Sequence-Set Algebras. J. Symb. Log. 63 (1) (1998)
Hajnal Andréka, Ian M. Hodkinson, István Németi
The finite base property for some cylindric-relativized algebras (Abstract). RelMiCS (1997)
Hajnal Andréka
Complexity of Equations Valid in Algebras of Relations: Part II: Finite Axiomatizations. Ann. Pure Appl. Log. 89 (2-3) (1997)
Hajnal Andréka
Complexity of Equations Valid in Algebras of Relations: Part I: Strong Non-Finitizability. Ann. Pure Appl. Log. 89 (2-3) (1997)
Hajnal Andréka, Johan van Benthem, István Németi
Back and Forth Between Modal Logic and Classical Logic. Log. J. IGPL 3 (5) (1995)
Hajnal Andréka, Steven Givant, István Németi
Perfect Extensions and Derived Algebras. J. Symb. Log. 60 (3) (1995)
Hajnal Andréka, Ivo Düntsch, István Németi
Binary Relations and Permutation Groups. Math. Log. Q. 41 (1995)
Hajnal Andréka, Ivo Düntsch, István Németi
Expressibility of Properties of Relations. J. Symb. Log. 60 (3) (1995)
Hajnal Andréka, Steven Givant, István Németi
The Lattice of Varieties of Representable Relation Algebras. J. Symb. Log. 59 (2) (1994)
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) (1994)
Hajnal Andréka, Roger D. Maddux
Representations for Small Relation Algebras. Notre Dame J. Formal Log. 35 (4) (1994)
Hajnal Andréka, Szabolcs Mikulás
Lambek Calculus and its relational semantics: Completeness and incompleteness. J. Log. Lang. Inf. 3 (1) (1994)
Hajnal Andréka, István Németi, Ildikó Sain
Applying Algebraic Logic to Logic. AMAST (1993)
Hajnal Andréka, István Németi, Ildikó Sain
On the Strength of Temporal Proofs. Theor. Comput. Sci. 80 (2) (1991)
Hajnal Andréka, István Németi, R. J. Thompson
Weak Cylindric Set Algebra and Weak Subdirect Indecomposability. J. Symb. Log. 55 (2) (1990)
Hajnal Andréka, M. Ferenczi, István Németi, György Serény
Algebraic Logic Conference. J. Symb. Log. 54 (2) (1989)
Hajnal Andréka, István Németi, Ildikó Sain
On the Strength of Temporal Proofs. MFCS (1989)
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) (1988)
Hajnal Andréka, R. J. Greechie, George E. Strecker
On Residuated Approximations. Categorial Methods in Computer Science (1988)
Hajnal Andréka, Bjarni Jónsson, István Németi
Relatively free relation algebras. Algebraic Logic and Universal Algebra in Computer Science (1988)
Hajnal Andréka, Irène Guessarian, István Németi
A Unifying Theorem for Algebraic Semantics and Dynamic Logics Inf. Comput. 72 (1) (1987)
Hajnal Andréka, Irène Guessarian, István Németi
A unifying theorem for algebraic semantics and dynamic logics. FCT (1985)
Hajnal Andréka, István Németi
On the Number of Generators of Cylindric Algebras. J. Symb. Log. 50 (4) (1985)
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 (1982)
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 (1982)
Hajnal Andréka, István Németi
Some Universal Algebraic and Model Theoretic Results in Computer Science. FCT (1981)
Hajnal Andréka, István Németi, Ildikó Sain
A Characterization of Floyd-Provable Programs. MFCS (1981)
Hajnal Andréka, Tamás Gergely, István Németi
Model Theoretic Semantics For Many-Purpose Languages And Language Hierarchies. COLING (1980)
Hajnal Andréka
Sharpening the characterization of the power of Floyd method. Logic of Programs (1980)
Hajnal Andréka, István Németi, Ildikó Sain
Henkin-type semantics for program-schemes to turn negative results to positive. FCT (1979)
Hajnal Andréka, István Németi, Ildikó Sain
Completeness Problems in Verification of Programs and Program Schemes. MFCS (1979)
Hajnal Andréka, István Németi
The generalized completeness of Horn predicate-logic as a programming language. Acta Cybern. 4 (1) (1978)
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)
T. Gorgely, Hajnal Andréka, István Németi
Definition Theory as Basis for a Creative Problem Solver. IJCAI (1975)
Hajnal Andréka, Sándor Horváth, István Németi
Notes on maximal congruence relations, automata and related topics. Acta Cybern. 2 (1) (1973)