Henkin-type semantics for program-schemes to turn negative results to positive. - Hajnal Andréka; István Németi; Ildikó Sain (FCT, 1979)

Completeness Problems in Verification of Programs and Program Schemes. - Hajnal Andréka; István Németi; Ildikó Sain (MFCS, 1979)

First Order Dynamic Logic with Decidable Proofs and Workable Model Theory. - Ildikó Sain (FCT, 1981)

A Characterization of Floyd-Provable Programs. - Hajnal Andréka; István Németi; Ildikó Sain (MFCS, 1981)

A Complete Logic for Reasoning about Programs via Nonstandard Model Theory I. - Hajnal Andréka; István Németi; Ildikó Sain (Theor. Comput. Sci., 1982)

A Complete Logic for Reasoning about Programs via Nonstandard Model Theory II. - Hajnal Andréka; István Németi; Ildikó Sain (Theor. Comput. Sci., 1982)

Structured Nonstandard Dynamic Logic. - Ildikó Sain (Math. Log. Q., 1984)

The Reasoning Powers of Burstall's (Modal Logic) and Pnueli's (Temporal Logic) Program Verification Methods. - Ildikó Sain (Logic of Programs, 1985)

A Simple Proof for the Completeness of Floyd's Method. - Ildikó Sain (Theor. Comput. Sci., 1985)

On the Equivalence of Weak Second Order and Nonstandard Time Semantics For Various Program Verification Systems - Johann A. Makowsky; Ildikó Sain (LICS, 1986)

Total Correctness in Nonstandard Logics of Programs. - Ildikó Sain (Theor. Comput. Sci., 1987)

Beth's and Craig's properties via epimorphisms and amalgamation in algebraic logic. - Ildikó Sain (Algebraic Logic and Universal Algebra in Computer Science, 1988)

Concerning some cylindric algebra versions of the downward Löwenheim-Skolem theorem. - Ildikó Sain (Notre Dame J. Formal Log., 1988)

Is "some-other-time" sometimes better than "sometime" for proving partial correctness of programs? - Ildikó Sain (Stud Logica, 1988)

A Streamlined Temporal Completeness Theorem. - Ana Pasztor; Ildikó Sain (CSL, 1989)

An Elementary Proof for Some Semantic Characterizations of Nondeterministic Floyd-Hoare Logic. - Ildikó Sain (Notre Dame J. Formal Log., 1989)

Weak Second Order Characterizations of Various Program Verification Systems. - Johann A. Makowsky; Ildikó Sain (Theor. Comput. Sci., 1989)

Past Proves More Invariance Properties but not PCA's. - Ildikó Sain (IMYCS, 1990)

Results on the Glory of the Past. - Ildikó Sain (MFCS, 1990)

On the Strength of Temporal Proofs. - Hajnal Andréka; István Németi; Ildikó Sain (Theor. Comput. Sci., 1991)

Temporal Logics Need Their Clocks. - Ildikó Sain (Theor. Comput. Sci., 1992)

Applying Algebraic Logic to Logic. - Hajnal Andréka; István Németi; Ildikó Sain (AMAST, 1993)

Peano Arithmetic as Axiomatization of the Time Frame in Logics of Programs and in Dynamic Logics. - Balázs Biró; Ildikó Sain (Ann. Pure Appl. Log., 1993)

Undecidable Varieties of Semilattice - ordered Semigroups, of Boolean Algebras with Operators, and logics extending Lambek Calculus. - Ágnes Kurucz; István Németi; Ildikó Sain; András Simon (Log. J. IGPL, 1993)

Undecidability of the Equational Theory of Some Classes of Residuated Boolean Algebras with Operators. - István Németi; Ildikó Sain; András Simon (Log. J. IGPL, 1995)

Decidable and Undecidable Logics with a Binary Modality. - Ágnes Kurucz; István Németi; Ildikó Sain; András Simon (J. Log. Lang. Inf., 1995)

Finite Schematizable Algebraic Logic. - Ildikó Sain; Viktor Gyuris (Log. J. IGPL, 1997)

On the Search for a Finitizable Algebraization of First Order Logic. - Ildikó Sain (Log. J. IGPL, 2000)

Complexity of equational theory of relational algebras with standard projection elements. - Szabolcs Mikulás; Ildikó Sain; András Simon (Synth., 2015)