- CSB - MetaPress - Google - Bing - Yahoo
 | 2000 | |
|---|---|---|
| j14 |      | Ildikó Sain: On the Search for a Finitizable Algebraization of First Order Logic. Logic Journal of the IGPL 8(4): 497-591 (2000) |
| 1997 | ||
| j13 | | Ildikó Sain, Viktor Gyuris: Finite Schematizable Algebraic Logic. Logic Journal of the IGPL 5(5): 699-751 (1997) |
| 1995 | ||
| j12 | | 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) |
| j11 | | Á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) |
| 1993 | ||
| j10 | | 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) |
| j9 | | Á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) |
| c12 |  | |
| 1992 | ||
| j8 | | |
| 1991 | ||
| j7 | | Hajnal Andréka, István Németi, Ildikó Sain: On the Strength of Temporal Proofs. Theor. Comput. Sci. 80(2): 125-151 (1991) |
| 1990 | ||
| c11 | | |
| c10 | | |
| 1989 | ||
| j6 | | 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) |
| j5 | | Johann A. Makowsky, Ildikó Sain: Weak Second Order Characterizations of Various Program Verification Systems. Theor. Comput. Sci. 66(3): 299-321 (1989) |
| c9 | | |
| c8 | | |
| 1988 | ||
| c7 | | 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 | ||
| j4 | | Ildikó Sain: Total Correctness in Nonstandard Logics of Programs. Theor. Comput. Sci. 50: 285-321 (1987) |
| 1986 | ||
| c6 | | 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 | ||
| j3 | | Ildikó Sain: A Simple Proof for the Completeness of Floyd's Method. Theor. Comput. Sci. 35: 345-348 (1985) |
| c5 | | Ildikó Sain: The Reasoning Powers of Burstall's (Modal Logic) and Pnueli's (Temporal Logic) Program Verification Methods. Logic of Programs 1985: 302-342 |
| 1982 | ||
| j2 | | 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) |
| j1 | | 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 | ||
| c4 | | Ildikó Sain: First Order Dynamic Logic with Decidable Proofs and Workable Model Theory. FCT 1981: 334-340 |
| c3 | | Hajnal Andréka, István Németi, Ildikó Sain: A Characterization of Floyd-Provable Programs. MFCS 1981: 162-171 |
| 1979 | ||
| c2 | | 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 |
| c1 | | Hajnal Andréka, István Németi, Ildikó Sain: Completeness Problems in Verification of Programs and Program Schemes. MFCS 1979: 208-218 |
| 1 | Hajnal Andréka | |
| 2 | Balázs Biró | |
| 3 | Viktor Gyuris | |
| 4 | Ágnes Kurucz (Agi Kurucz) | |
| 5 | Johann A. Makowsky (Janos Makowsky) | |
| 6 | István Németi | |
| 7 | Ana Pasztor | |
| 8 | András Simon |
Data released under the ODC-BY 1.0 license — See also our legal information page