Algebra and Logic in Theoretical Computer Science. - Ferenc Gécseg; Péter Ecsedi-Tóth (MFCS, 1977)

A note on symmetric Boolean functions. - Péter Ecsedi-Tóth; Ferenc Móricz; A. Varga (Acta Cybern., 1977)

An effective theorem proving algorithm. - Péter Ecsedi-Tóth; A. Varga (Acta Cybern., 1977)

A method for minimizing partially defined Boolean functions. - Ferenc Móricz; A. Varga; Péter Ecsedi-Tóth (Acta Cybern., 1979)

A theory of finite functions, Part I. On finite trees associated to certain finite functions. - Péter Ecsedi-Tóth (Acta Cybern., 1983)

On the number of zero order interpolants. - Péter Ecsedi-Tóth; L. Turi (Acta Cybern., 1984)

A partial solution of the finite spectrum problem. - Péter Ecsedi-Tóth (Acta Cybern., 1985)

On the Expressive Power of Equality-Free First Order Languages. - Péter Ecsedi-Tóth (Math. Log. Q., 1986)

On the Expressive Power of Circumscriptions. - Péter Ecsedi-Tóth (ISMIS, 1988)