Hajnal Andréka
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Hajnal Andréka has a total of 8 co-authors. Here are the top co-authors by number of shared publications:
- István Németi
Alfréd Rényi Institute of Mathematics
4 shared publications - A. Simon
Mathematical Institute of the Hungarian Academy of Sciences, H-1364 Budapest, Hungary., HU
1 shared publication - Johan van Benthem
ILLC, Universiteit van Amsterdam Plantage Muidergracht 24, 1018 TV Ams terdam, The Netherlands
1 shared publication - Mark Dermot Ryan
University of Birmingham
1 shared publication - Pierre-Yves Schobbens
University of Namur
1 shared publication - Robert Goldblatt
Victoria University
1 shared publication
Latest Publications
- 12 March 2008
- Published by Cambridge University Press (CUP) in The Journal of Symbolic Logic
- Vol. 73 (1) , 65-89
Omitting types for finite variable fragments and complete representations of algebras
We give a novel application of algebraic logic to first order logic. A new, flexible construction is presented for representable but not completely representable atomic relation and cylindric algebras of dimensionn(for finiten> 2) with the additional property that they are one-generated and the set of allnbynatomic matrices forms a cylindric basis. We use this construction to show that the classical Henkin-Orey omitting types theorem fails for the finite variable fragments of first order logic as long as the number of variables available is > 2 and we have a binary relation symbol in our language. We also prove a stronger result to the effect that there is no finite upper bound for the extra variables needed in the witness formulas. This result further emphasizes the ongoing interplay between algebraic logic and first order logic.
- 12 March 2008
- Published by Cambridge University Press (CUP) in The Journal of Symbolic Logic
- Vol. 73 (1) , 65-89
Omitting types for finite variable fragments and complete representations of algebras
We give a novel application of algebraic logic to first order logic. A new, flexible construction is presented for representable but not completely representable atomic relation and cylindric algebras of dimensionn(for finiten> 2) with the additional property that they are one-generated and the set of allnbynatomic matrices forms a cylindric basis. We use this construction to show that the classical Henkin-Orey omitting types theorem fails for the finite variable fragments of first order logic as long as the number of variables available is > 2 and we have a binary relation symbol in our language. We also prove a stronger result to the effect that there is no finite upper bound for the extra variables needed in the witness formulas. This result further emphasizes the ongoing interplay between algebraic logic and first order logic.
- 1 February 2002
- Published by Oxford University Press (OUP) in Journal of Logic and Computation
- Vol. 12 (1) , 13-53
Operators and Laws for Combining Preference Relations
The paper is a theoretical study of a generalization of the lexicographic rule for combining ordering relations. We define the concept of priority operator: a priority operator maps a family of relations to a single relation which represents their lexicographic combination according to a certain priority on the family of relations. We present four kinds of results.
- 1 February 2002
- Published by Oxford University Press (OUP) in Journal of Logic and Computation
- Vol. 12 (1) , 13-53
Operators and Laws for Combining Preference Relations
The paper is a theoretical study of a generalization of the lexicographic rule for combining ordering relations. We define the concept of priority operator: a priority operator maps a family of relations to a single relation which represents their lexicographic combination according to a certain priority on the family of relations. We present four kinds of results.
- 12 March 1998
- Published by Cambridge University Press (CUP) in The Journal of Symbolic Logic
- Vol. 63 (1) , 163-184
Relativised quantification: Some canonical varieties of sequence-set algebras
This paper explores algebraic aspects of two modifications of the usual account of first-order quantifiers.Standard first-order quantificational logic is modelled algebraically by cylindric algebras. Prime examples of these are algebras whose members are sets of sequences: given a first-order model U for a language that is based on the set {υκ: κ < α} of variables, each formula φ is represented by the set of all those α-length sequences x = 〈xκ: κ < α〉 that satisfy φ in U. Such a sequence provides a value-assignment to the variables (υκ is assigned value xκ), but it may also be viewed geometrically as a point in the α-dimensional Cartesian spaceαU of all α-length sequences whose terms come from the underlying set U of U. Then existential quantification is represented by the operation of cylindrification. To explain this, define a binary relation Tκ on sequences by putting xTκy if and only if x and y differ at most at their κth coordinate, i.e., Then for any set X ⊆ αU, the set is the “cylinder” generated by translation of X parallel to the κth coordinate axis in αU. Given the standard semantics for the existential quantifier ∃υκ as it is evident that
- 12 March 1998
- Published by Cambridge University Press (CUP) in The Journal of Symbolic Logic
- Vol. 63 (1) , 163-184
Relativised quantification: Some canonical varieties of sequence-set algebras
This paper explores algebraic aspects of two modifications of the usual account of first-order quantifiers.Standard first-order quantificational logic is modelled algebraically by cylindric algebras. Prime examples of these are algebras whose members are sets of sequences: given a first-order model U for a language that is based on the set {υκ: κ < α} of variables, each formula φ is represented by the set of all those α-length sequences x = 〈xκ: κ < α〉 that satisfy φ in U. Such a sequence provides a value-assignment to the variables (υκ is assigned value xκ), but it may also be viewed geometrically as a point in the α-dimensional Cartesian spaceαU of all α-length sequences whose terms come from the underlying set U of U. Then existential quantification is represented by the operation of cylindrification. To explain this, define a binary relation Tκ on sequences by putting xTκy if and only if x and y differ at most at their κth coordinate, i.e., Then for any set X ⊆ αU, the set is the “cylinder” generated by translation of X parallel to the κth coordinate axis in αU. Given the standard semantics for the existential quantifier ∃υκ as it is evident that
- 1 April 1997
- Published by Springer Nature in Algebra universalis
- Vol. 38 (2) , 141-149
Persistent properties and an application to algebras of logic
- 1 April 1997
- Published by Springer Nature in Algebra universalis
- Vol. 38 (2) , 141-149
Persistent properties and an application to algebras of logic
- 1 August 1995
- Published by Oxford University Press (OUP) in Logic Journal of the IGPL
- Vol. 3 (5) , 685-720
Back and Forth Between Modal Logic and Classical Logic
HAJNAL ANDRÉKA, JOHAN van BENTHEM, ISTVAN NÉMETI; Back and Forth Between Modal Logic and Classical Logic, Logic Journal of the IGPL, Volume 3, Issue 5, 1 Augus
- 1 August 1995
- Published by Oxford University Press (OUP) in Logic Journal of the IGPL
- Vol. 3 (5) , 685-720
Back and Forth Between Modal Logic and Classical Logic
HAJNAL ANDRÉKA, JOHAN van BENTHEM, ISTVAN NÉMETI; Back and Forth Between Modal Logic and Classical Logic, Logic Journal of the IGPL, Volume 3, Issue 5, 1 Augus