Ildikó Sain

31 papers A* 1B 7Journal 19Unranked 4
YearRankTypeTitle / Venue / Authors
2025 J jnl
Logic Families.
Stud Logica
Hajnal Andréka, Zalán Gyenis, István Németi, Ildikó Sain
2015 J jnl
Complexity of equational theory of relational algebras with standard projection elements.
Synth.
Szabolcs Mikulás, Ildikó Sain, András Simon
2000 J jnl
On the Search for a Finitizable Algebraization of First Order Logic.
Log. J. IGPL
Ildikó Sain
1997 J jnl
Finite Schematizable Algebraic Logic.
Log. J. IGPL
Ildikó Sain, Viktor Gyuris
1995 J jnl
Decidable and Undecidable Logics with a Binary Modality.
J. Log. Lang. Inf.
Ágnes Kurucz, István Németi, Ildikó Sain, András Simon
1995 J jnl
Undecidability of the Equational Theory of Some Classes of Residuated Boolean Algebras with Operators.
Log. J. IGPL
István Németi, Ildikó Sain, András Simon
1993 — conf
Applying Algebraic Logic to Logic.
AMAST
Hajnal Andréka, István Németi, Ildikó Sain
1993 J jnl
Peano Arithmetic as Axiomatization of the Time Frame in Logics of Programs and in Dynamic Logics.
Ann. Pure Appl. Log.
Balázs Biró, Ildikó Sain
1993 J jnl
Undecidable Varieties of Semilattice - ordered Semigroups, of Boolean Algebras with Operators, and logics extending Lambek Calculus.
Log. J. IGPL
Ágnes Kurucz, István Németi, Ildikó Sain, András Simon
1992 J jnl
Temporal Logics Need Their Clocks.
Theor. Comput. Sci.
Ildikó Sain
1991 J jnl
On the Strength of Temporal Proofs.
Theor. Comput. Sci.
Hajnal Andréka, István Németi, Ildikó Sain
1990 — conf
Past Proves More Invariance Properties but not PCA's.
IMYCS
Ildikó Sain
1990 B conf
Results on the Glory of the Past.
MFCS
Ildikó Sain
1989 B conf
A Streamlined Temporal Completeness Theorem.
CSL
Ana Pasztor, Ildikó Sain
1989 J jnl
An Elementary Proof for Some Semantic Characterizations of Nondeterministic Floyd-Hoare Logic.
Notre Dame J. Formal Log.
Ildikó Sain
1989 B conf
On the Strength of Temporal Proofs.
MFCS
Hajnal Andréka, István Németi, Ildikó Sain
1989 J jnl
Weak Second Order Characterizations of Various Program Verification Systems.
Theor. Comput. Sci.
Johann A. Makowsky, Ildikó Sain
1988 — conf
Beth's and Craig's properties via epimorphisms and amalgamation in algebraic logic.
Algebraic Logic and Universal Algebra in Computer Science
Ildikó Sain
1988 J jnl
Concerning some cylindric algebra versions of the downward Löwenheim-Skolem theorem.
Notre Dame J. Formal Log.
Ildikó Sain
1988 J jnl
Is "some-other-time" sometimes better than "sometime" for proving partial correctness of programs?
Stud Logica
Ildikó Sain
1987 J jnl
Total Correctness in Nonstandard Logics of Programs.
Theor. Comput. Sci.
Ildikó Sain
1986 A* conf
On the Equivalence of Weak Second Order and Nonstandard Time Semantics For Various Program Verification Systems
LICS
Johann A. Makowsky, Ildikó Sain
1985 J jnl
A Simple Proof for the Completeness of Floyd's Method.
Theor. Comput. Sci.
Ildikó Sain
1985 — conf
The Reasoning Powers of Burstall's (Modal Logic) and Pnueli's (Temporal Logic) Program Verification Methods.
Logic of Programs
Ildikó Sain
1984 J jnl
Structured Nonstandard Dynamic Logic.
Math. Log. Q.
Ildikó Sain
1982 J jnl
A Complete Logic for Reasoning about Programs via Nonstandard Model Theory I.
Theor. Comput. Sci.
Hajnal Andréka, István Németi, Ildikó Sain
1982 J jnl
A Complete Logic for Reasoning about Programs via Nonstandard Model Theory II.
Theor. Comput. Sci.
Hajnal Andréka, István Németi, Ildikó Sain
1981 B conf
A Characterization of Floyd-Provable Programs.
MFCS
Hajnal Andréka, István Németi, Ildikó Sain
1981 B conf
First Order Dynamic Logic with Decidable Proofs and Workable Model Theory.
FCT
Ildikó Sain
1979 B conf
Completeness Problems in Verification of Programs and Program Schemes.
MFCS
Hajnal Andréka, István Németi, Ildikó Sain
1979 B conf
Henkin-type semantics for program-schemes to turn negative results to positive.
FCT
Hajnal Andréka, István Németi, Ildikó Sain