Ildikó Sain

András Simon

Synth., 2015

2000

On the Search for a Finitizable Algebraization of First Order Logic.

[BibT_eX]

[DOI]

Log. J. IGPL, 2000

1997

Finite Schematizable Algebraic Logic.

[BibT_eX]

[DOI]

Viktor Gyuris

Log. J. IGPL, 1997

1995

Decidable and Undecidable Logics with a Binary Modality.

[BibT_eX]

[DOI]

J. Log. Lang. Inf., 1995

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

[BibT_eX]

[DOI]

András Simon

Log. J. IGPL, 1995

1993

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

[BibT_eX]

[DOI]

Log. J. IGPL, 1993

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

[BibT_eX]

[DOI]

Balázs Biró

Ann. Pure Appl. Log., 1993

Applying Algebraic Logic to Logic.

[BibT_eX]

Proceedings of the Algebraic Methodology and Software Technology (AMAST '93), 1993

1992

Temporal Logics Need Their Clocks.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1992

1991

On the Strength of Temporal Proofs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1991

1990

Results on the Glory of the Past.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1990, 1990

Past Proves More Invariance Properties but not PCA's.

[BibT_eX]

[DOI]

Proceedings of the Aspects and Prospects of Theoretical Computer Science, 1990

1989

Weak Second Order Characterizations of Various Program Verification Systems.

[BibT_eX]

[DOI]

Johann A. Makowsky

Theor. Comput. Sci., 1989

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

[BibT_eX]

[DOI]

Notre Dame J. Formal Log., 1989

A Streamlined Temporal Completeness Theorem.

[BibT_eX]

[DOI]

Ana Pasztor

Proceedings of the CSL '89, 1989

1988

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

[BibT_eX]

[DOI]

Stud Logica, 1988

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

[BibT_eX]

[DOI]

Notre Dame J. Formal Log., 1988

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

[BibT_eX]

[DOI]

Proceedings of the Algebraic Logic and Universal Algebra in Computer Science, Conference, 1988

1987

Total Correctness in Nonstandard Logics of Programs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1987

1986

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

[BibT_eX]

Johann A. Makowsky

Proceedings of the Symposium on Logic in Computer Science (LICS '86), 1986

1985

A Simple Proof for the Completeness of Floyd's Method.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1985

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

[BibT_eX]

[DOI]

Proceedings of the Logics of Programs, 1985

1984

Structured Nonstandard Dynamic Logic.

[BibT_eX]

[DOI]

Math. Log. Q., 1984

1982

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

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1982

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

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1982

1981

A Characterization of Floyd-Provable Programs.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1981, Strbske Pleso, Czechoslovakia, August 31, 1981

First Order Dynamic Logic with Decidable Proofs and Workable Model Theory.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 1981

1979

Completeness Problems in Verification of Programs and Program Schemes.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1979, 1979

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

[BibT_eX]