Ildikó Sain - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 30 from 30

2015

Complexity of equational theory of relational algebras with standard projection elementsSzabolcs Mikulás, Ildikó Sain, András Simon. synthese, 192(7):2159-2182, 2015. [doi]

2000

On the Search for a Finitizable Algebraization of First Order LogicIldikó Sain. igpl, 8(4):497-591, 2000. [doi]

1997

Finite Schematizable Algebraic LogicIldikó Sain, Viktor Gyuris. igpl, 5(5):699-751, 1997. [doi]

1995

Undecidability of the Equational Theory of Some Classes of Residuated Boolean Algebras with OperatorsIstván Németi, Ildikó Sain, András Simon. igpl, 3(1):93-105, 1995. [doi]

Decidable and Undecidable Logics with a Binary ModalityÁgnes Kurucz, István Németi, Ildikó Sain, András Simon. jolli, 4(3):191-206, 1995.

1993

Applying Algebraic Logic to LogicHajnal Andréka, István Németi, Ildikó Sain. amast 1994: 5-26

Peano Arithmetic as Axiomatization of the Time Frame in Logics of Programs and in Dynamic LogicsBalázs Biró, Ildikó Sain. APAL, 63(3):201-225, 1993.

Undecidable Varieties of Semilattice - ordered Semigroups, of Boolean Algebras with Operators, and logics extending Lambek CalculusÁgnes Kurucz, István Németi, Ildikó Sain, András Simon. igpl, 1(1):91-98, 1993. [doi]

1992

Temporal Logics Need Their ClocksIldikó Sain. TCS, 95(1):75-95, 1992.

1991

On the Strength of Temporal ProofsHajnal Andréka, István Németi, Ildikó Sain. TCS, 80(2):125-151, 1991.

1990

Results on the Glory of the PastIldikó Sain. mfcs 1990: 478-484

Past Proves More Invariance Properties but not PCA sIldikó Sain. imycs 1990: 80-92

1989

On the Strength of Temporal ProofsHajnal Andréka, István Németi, Ildikó Sain. mfcs 1989: 135-144

Weak Second Order Characterizations of Various Program Verification SystemsJohann A. Makowsky, Ildikó Sain. TCS, 66(3):299-321, 1989.

A Streamlined Temporal Completeness TheoremAna Pasztor, Ildikó Sain. csl 1990: 322-336

An Elementary Proof for Some Semantic Characterizations of Nondeterministic Floyd-Hoare LogicIldikó Sain. ndjfl, 30(4):563-573, 1989.

1988

Beth s and Craig s properties via epimorphisms and amalgamation in algebraic logicIldikó Sain. aluacs 1990: 209-225

Concerning some cylindric algebra versions of the downward Löwenheim-Skolem theoremIldikó Sain. ndjfl, 29(3):332-344, 1988. [doi]

Is "some-other-time" sometimes better than "sometime" for proving partial correctness of programs?Ildikó Sain. sLogica, 47(3):279-301, 1988. [doi]

1987

Total Correctness in Nonstandard Logics of ProgramsIldikó Sain. TCS, 50:285-321, 1987.

1986

On the Equivalence of Weak Second Order and Nonstandard Time Semantics For Various Program Verification SystemsJohann A. Makowsky, Ildikó Sain. lics 1986: 293-300

1985

The Reasoning Powers of Burstall s (Modal Logic) and Pnueli s (Temporal Logic) Program Verification MethodsIldikó Sain. lop 1985: 302-342

A Simple Proof for the Completeness of Floyd s MethodIldikó Sain. TCS, 35:345-348, 1985.

1984

Structured Nonstandard Dynamic LogicIldikó Sain. mlq, 30(31):481-497, 1984. [doi]

1982

A Complete Logic for Reasoning about Programs via Nonstandard Model Theory IHajnal Andréka, István Németi, Ildikó Sain. TCS, 17:193-212, 1982.

A Complete Logic for Reasoning about Programs via Nonstandard Model Theory IIHajnal Andréka, István Németi, Ildikó Sain. TCS, 17:259-278, 1982.

1981

A Characterization of Floyd-Provable ProgramsHajnal Andréka, István Németi, Ildikó Sain. mfcs 1981: 162-171

First Order Dynamic Logic with Decidable Proofs and Workable Model TheoryIldikó Sain. fct 1981: 334-340

1979

Completeness Problems in Verification of Programs and Program SchemesHajnal Andréka, István Németi, Ildikó Sain. mfcs 1979: 208-218

Henkin-type semantics for program-schemes to turn negative results to positiveHajnal Andréka, István Németi, Ildikó Sain. fct 1979: 18-24

Sign in or sign up to see more results.

runs on WebDSL