( en | de | ru )

 

Disambiguation of "Andréka, Hajnal"

Author of the publication

copydeleteadd this publication to your clipboard
A Unifying Theorem for Algebraic Semantics and Dynamic Logics

, , and . Inf. Comput., 72 (1): 31-45 (January 1987)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Ivo Hajnal

Hajnal Türk

David Hajnal

Hajnal Borús

Koloman Hajnal-Kónyi

 

Other publications of authors with the same name

Relativised Quantification: Some Canonical Varieties of Sequence-Set Algebras., , and . J. Symb. Log., 63 (1): 163-184 (1998)Algebraic Logic Conference., , , and . J. Symb. Log., 54 (2): 686 (1989)On the Strength of Temporal Proofs., , and . Theor. Comput. Sci., 80 (2): 125-151 (1991)Expressibility of Properties of Relations., , and . J. Symb. Log., 60 (3): 970-991 (1995)A Characterization of Floyd-Provable Programs., , and . MFCS, volume 118 of Lecture Notes in Computer Science, page 162-171. Springer, (1981)A unifying theorem for algebraic semantics and dynamic logics., , and . FCT, volume 199 of Lecture Notes in Computer Science, page 8-17. Springer, (1985)Complexity in the interdefinability of timelike, lightlike and spacelike relatedness of Minkowski spacetime., , , and . Ann. Pure Appl. Log., 173 (5): 103100 (2022)The Variety of coset Relation Algebras., and . J. Symb. Log., 83 (4): 1595-1609 (2018)Some Universal Algebraic and Model Theoretic Results in Computer Science., and . FCT, volume 117 of Lecture Notes in Computer Science, page 16-23. Springer, (1981)Completeness Problems in Verification of Programs and Program Schemes., , and . MFCS, volume 74 of Lecture Notes in Computer Science, page 208-218. Springer, (1979)