Author pages are created from data sourced from our academic publisher partnerships and public sources.

- Publications
- Influence

Modal Languages and Bounded Fragments of Predicate Logic

- H. Andréka, I. Németi, J. Benthem
- Computer Science, Mathematics
- J. Philos. Log.
- 1 June 1998

Definition des fragments modaux de la logique des predicats a partir de formules du premier ordre qui sont des traductions des proprietes poly-modales elementaires. Distinguant les fragments… Expand

Complexity of Equations Valid in Algebras of Relations: Part II: Finite Axiomatizations

- H. Andréka
- Computer Science, Mathematics
- Ann. Pure Appl. Log.
- 8 December 1997

Abstract We study algebras whose elements are relations, and the operations are natural “manipulations” of relations. This area goes back to 140 years ago to works of De Morgan, Peirce, Schroder (who… Expand

Operators and Laws for Combining Preference Relations

- H. Andréka, M. Ryan, Pierre-Yves Schobbens
- Computer Science, Mathematics
- J. Log. Comput.
- 1 February 2002

The paper is a theoretical study of a generalization of the lexicographic rule for combining ordering relations. We define the concept of priority operato r: a priority operator maps a family of… Expand

A Stone-type representation theorem for algebras of relations of higher rank

- H. Andréka, R. Thompson
- Mathematics
- 1 February 1988

The Stone representation theorem for Boolean algebras gives us a finite set of equations axiomatizing the class of Boolean set algebras. Boolean set algebras can be considered to be algebras of unary… Expand

The equational theory of union-free algebras of relations

- H. Andréka, D. V. Bredikhin
- Mathematics
- 1 December 1995

We solve a problem of Jónsson [12] by showing that the class ℛ of (isomorphs of) algebras of binary relations, under the operations of relative product, conversion, and intersection, and with the… Expand

Notions of Density That Imply Representability in Algebraic Logic

- H. Andréka, S. Givant, S. Mikulás, I. Németi, A. Simon
- Mathematics, Computer Science
- Ann. Pure Appl. Log.
- 24 February 1998

Abstract Henkin and Tarski proved that an atomic cylindric algebra in which every atom is a rectangle must be representable (as a cylindric set algebra). This theorem and its analogues for… Expand

Cylindric-like algebras and algebraic logic

- H. Andréka, M. Ferenczi, I. Németi
- Mathematics
- 2013

Introduction.- H. Andreka and I. Nemeti: Reducing First-order Logic to Df3, Free Algebras.- N.Bezhanishvili: Varieties of Two-Dimensional Cylindric Algebras.- R. Hirsch and I. Hodkinson: Completions… Expand

The generalized completeness of Horn predicate-logic as a programming language

- H. Andréka, I. Németi
- Computer Science, Mathematics
- Acta Cybern.
- 1978

On the logical structure of relativity theories

- H. Andréka, J. Madarász, I. Németi, G. Sági, I. Sain, Cs. T Oke
- Physics
- 2002

- 42
- 4

Finite Algebras of Relations Are Representable on Finite Sets

- H. Andréka, I. Hodkinson, I. Németi
- Computer Science, Mathematics
- J. Symb. Log.
- 1 March 1999

Using a combinatorial theorem of Herwig on extending partial isomorphisms of relational structures, we give a simple proof that certain classes of algebras, including Crs. polyadic Crs, and WA, have… Expand