Ildikó Sain

发表

Weak Second Order Characterizations of Various Program Verification Systems

Johann A. Makowsky, Ildikó Sain, J. Makowsky, 1989, Theor. Comput. Sci..

On the Strength of Temporal Proofs

Ildikó Sain, Hajnal Andréka, István Németi, 1989, Theor. Comput. Sci..

Decidable and undecidable logics with a binary modality

András Simon, Ildikó Sain, Ágnes Kurucz, 1995, J. Log. Lang. Inf..

Some new landmarks on the roadmap of two dimensional logics

Ildikó Sain, Hajnal Andréka, István Németi, 1994 .

Undecidable Varieties of Semilattice - ordered Semigroups, of Boolean Algebras with Operators, and logics extending Lambek Calculus

András Simon, Ildikó Sain, Ágnes Kurucz, 1993, Log. J. IGPL.

Undecidability of the Equational Theory of Some Classes of Residuated Boolean Algebras with Operators

András Simon, Ildikó Sain, István Németi, 1995, Log. J. IGPL.

On the Equivalence of Weak Second Order and Nonstandard Time Semantics For Various Program Verification Systems

Johann A. Makowsky, Ildikó Sain, 1986, LICS.

Definability Issues in Universal Logic

Ildikó Sain, 2013 .

Comparing and characterising the powers of established program verification methods

Ildikó Sain, 1993 .

An Elementary Proof for Some Semantic Characterizations of Nondeterministic Floyd-Hoare Logic

Ildikó Sain, 1989, Notre Dame J. Formal Log..

A Complete Logic for Reasoning about Programs via Nonstandard Model Theory I

Ildikó Sain, Hajnal Andréka, István Németi, 1982, Theor. Comput. Sci..

Total Correctness in Nonstandard Logics of Programs

Ildikó Sain, 1987, Theor. Comput. Sci..

A Characterization of Floyd-Provable Programs

Ildikó Sain, Hajnal Andréka, István Németi, 1981, MFCS.

Completeness Problems in Verification of Programs and Program Schemes

Ildikó Sain, Hajnal Andréka, István Németi, 1979, MFCS.

Peano Arithmetic as Axiomatization of the Time Frame in Logics of Programs and in Dynamic Logics

Ildikó Sain, Balázs Biró, I. Sain, 1993, Ann. Pure Appl. Log..

Henkin-type semantics for program-schemes to turn negative results to positive

Ildikó Sain, Hajnal Andréka, István Németi, 1979, FCT.

A Streamlined Temporal Completeness Theorem

Ana Pasztor, Ildikó Sain, I. Sain, 1989, CSL.

Finite Schematizable Algebraic Logic

Ildikó Sain, Viktor Gyuris, Viktor Gyuris, 1997, Log. J. IGPL.

Effective temporal logics of programs

Szabolcs Mikulás, Ildikó Sain, Hajnal Andréka, 1995 .

A Complete Logic for Reasoning about Programs via Nonstandard Model Theory II

Ildikó Sain, Hajnal Andréka, István Németi, 1982, Theor. Comput. Sci..

First Order Dynamic Logic with Decidable Proofs and Workable Model Theory

Ildikó Sain, 1981, FCT.

A Simple Proof for the Completeness of Floyd's Method

Ildikó Sain, 1985, Theor. Comput. Sci..

On the Search for a Finitizable Algebraization of First Order Logic

Ildikó Sain, I. Sain, 2000, Log. J. IGPL.

Temporal Logics Need Their Clocks

Ildikó Sain, 1992, Theor. Comput. Sci..

The Reasoning Powers of Burstall's (Modal Logic) and Pnueli's (Temporal Logic) Program Verification Methods

Ildikó Sain, I. Sain, 1985, Logic of Programs.

Is “some-other-time” sometimes better than “sometime” for proving partial correctness of programs?

Ildikó Sain, I. Sain, 1988, Stud Logica.

Concerning some cylindric algebra versions of the downward Löwenheim-Skolem theorem

Ildikó Sain, 1988, Notre Dame J. Formal Log..

Applying Algebraic Logic to Logic

Ildikó Sain, Hajnal Andréka, István Németi, 1993, AMAST.

Program verification within and without logic

Ildikó Sain, Hajnal Andréka, István Németi, 1979 .

Beth's and Craig's properties via epimorphisms and amalgamation in algebraic logic

Ildikó Sain, I. Sain, 1988, Algebraic Logic and Universal Algebra in Computer Science.

Complexity of equational theory of relational algebras with standard projection elements

András Simon, Szabolcs Mikulás, Ildikó Sain, 2015, Synthese.

Past Proves More Invariance Properties but not PCA's

Ildikó Sain, I. Sain, 1990, IMYCS.

On the Strength of Temporal Proofs

Ildikó Sain, Hajnal Andréka, István Németi, 1989, MFCS.

Results on the Glory of the Past

Ildikó Sain, I. Sain, 1990, International Symposium on Mathematical Foundations of Computer Science.

Structured Nonstandard Dynamic Logic

Ildikó Sain, 1984, Math. Log. Q..

FORK ALGEBRAS IN USUAL AND IN NON-WELL-FOUNDED SET THEORIES1

Ildikó Sain, István Németi, 2007 .

Decidable Logics of the Dynamic Trend, and Relativized Relation Algebras

Szabolcs Mikulás, Ildikó Sain, István Németi, 1995 .

The Life and Work of Leon Henkin

María Manzano, Ildikó Sain, Enrique Alonso, 2014 .

APPLYING ALGEBRAIC LOGIC; A GENERAL METHODOLOGY

Ildikó Sain, Ágnes Kurucz, Hajnal Andréka, 1994 .

Complexity of equational theory of relational algebras with projection elements

András Simon, Szabolcs Mikulás, Ildikó Sain, 1992 .