Ildikó Sain

Publication Activity (10 Years)

Years Active: 1979-2015
Publications (10 Years): 0

Top Topics

Logic Programming

Theorem Proving

Theoretical Foundation

Top Venues

Publications

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