| 2000 |
|---|
| 26 | EE | Ildikó Sain:
On the Search for a Finitizable Algebraization of First Order Logic.
Logic Journal of the IGPL 8(4): (2000) |
| 1997 |
|---|
| 25 | EE | Ildikó Sain,
Viktor Gyuris:
Finite Schematizable Algebraic Logic.
Logic Journal of the IGPL 5(5): (1997) |
| 1995 |
|---|
| 24 | | Ágnes Kurucz,
István Németi,
Ildikó Sain,
András Simon:
Decidable and Undecidable Logics with a Binary Modality.
Journal of Logic, Language and Information 4(3): 191-206 (1995) |
| 23 | EE | István Németi,
Ildikó Sain,
András Simon:
Undecidability of the Equational Theory of Some Classes of Residuated Boolean Algebras with Operators.
Logic Journal of the IGPL 3(1): 93-105 (1995) |
| 1993 |
|---|
| 22 | | Hajnal Andréka,
István Németi,
Ildikó Sain:
Applying Algebraic Logic to Logic.
AMAST 1993: 5-26 |
| 21 | | Balázs Biró,
Ildikó Sain:
Peano Arithmetic as Axiomatization of the Time Frame in Logics of Programs and in Dynamic Logics.
Ann. Pure Appl. Logic 63(3): 201-225 (1993) |
| 20 | EE | Á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.
Logic Journal of the IGPL 1(1): 91-98 (1993) |
| 1992 |
|---|
| 19 | | Ildikó Sain:
Temporal Logics Need Their Clocks.
Theor. Comput. Sci. 95(1): 75-95 (1992) |
| 1991 |
|---|
| 18 | | Hajnal Andréka,
István Németi,
Ildikó Sain:
On the Strength of Temporal Proofs.
Theor. Comput. Sci. 80(2): 125-151 (1991) |
| 1990 |
|---|
| 17 | | Ildikó Sain:
Past Proves More Invariance Properties but not PCA's.
IMYCS 1990: 80-92 |
| 16 | | Ildikó Sain:
Results on the Glory of the Past.
MFCS 1990: 478-484 |
| 1989 |
|---|
| 15 | | Ana Pasztor,
Ildikó Sain:
A Streamlined Temporal Completeness Theorem.
CSL 1989: 322-336 |
| 14 | | Hajnal Andréka,
István Németi,
Ildikó Sain:
On the Strength of Temporal Proofs.
MFCS 1989: 135-144 |
| 13 | | Ildikó Sain:
An Elementary Proof for Some Semantic Characterizations of Nondeterministic Floyd-Hoare Logic.
Notre Dame Journal of Formal Logic 30(4): 563-573 (1989) |
| 12 | | Johann A. Makowsky,
Ildikó Sain:
Weak Second Order Characterizations of Various Program Verification Systems.
Theor. Comput. Sci. 66(3): 299-321 (1989) |
| 1988 |
|---|
| 11 | | Ildikó Sain:
Beth's and Craig's properties via epimorphisms and amalgamation in algebraic logic.
Algebraic Logic and Universal Algebra in Computer Science 1988: 209-225 |
| 1987 |
|---|
| 10 | | Ildikó Sain:
Total Correctness in Nonstandard Logics of Programs.
Theor. Comput. Sci. 50: 285-321 (1987) |
| 1986 |
|---|
| 9 | | Johann A. Makowsky,
Ildikó Sain:
On the Equivalence of Weak Second Order and Nonstandard Time Semantics For Various Program Verification Systems
LICS 1986: 293-300 |
| 1985 |
|---|
| 8 | | Ildikó Sain:
The Reasoning Powers of Burstall's (Modal Logic) and Pnueli's (Temporal Logic) Program Verification Methods.
Logic of Programs 1985: 302-342 |
| 7 | | Ildikó Sain:
A Simple Proof for the Completeness of Floyd's Method.
Theor. Comput. Sci. 35: 345-348 (1985) |
| 1982 |
|---|
| 6 | | 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: 193-212 (1982) |
| 5 | | 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: 259-278 (1982) |
| 1981 |
|---|
| 4 | | Ildikó Sain:
First Order Dynamic Logic with Decidable Proofs and Workable Model Theory.
FCT 1981: 334-340 |
| 3 | | Hajnal Andréka,
István Németi,
Ildikó Sain:
A Characterization of Floyd-Provable Programs.
MFCS 1981: 162-171 |
| 1979 |
|---|
| 2 | | Hajnal Andréka,
István Németi,
Ildikó Sain:
Henkin-type semantics for program-schemes to turn negative results to positive.
FCT 1979: 18-24 |
| 1 | | Hajnal Andréka,
István Németi,
Ildikó Sain:
Completeness Problems in Verification of Programs and Program Schemes.
MFCS 1979: 208-218 |
