Manfred E. Szabo

According to our database, Manfred E. Szabo authored at least 14 papers between 1974 and 1992.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

1992

Stochastic performance measures for rule-based expert systems.

Manfred E. Szabo

Inf. Sci., 1992

On the stochastic complexity of loops in rule-based expert systems.

Manfred E. Szabo

Inf. Sci., 1992

1990

On the Tracking of Loops in Automated Deductions.

Manfred E. Szabo

Proceedings of the Computer Science Logic, 4th Workshop, 1990

1989

Coherence in cartesian closed categories and the generality of proofs.

Manfred E. Szabo

Stud Logica, 1989

A Probabilistic Analysis of Loop Programs.

Manfred E. Szabo, E. J. Farkas

Comput. Lang., 1989

1988

Nonstandard methods in combinatorics and theoretical computer science.

Michael M. Richter, Manfred E. Szabo

Stud Logica, 1988

On the programs-as-formulas interpretation of parallel programs in peano arithmetic.

E. J. Farkas, Manfred E. Szabo

Ann. Pure Appl. Log., 1988

1987

A cut elimination theorem for stationary logic.

Manfred E. Szabo

Ann. Pure Appl. Log., 1987

1984

Variable Truth.

Manfred E. Szabo

Math. Log. Q., 1984

1983

The Continuous Realizability of Entailment.

Manfred E. Szabo

Math. Log. Q., 1983

1980

A sequent calculus for Kröger logic.

Manfred E. Szabo

Proceedings of the Logics of Programs and Their Applications, 1980

1977

The logic of closed categories.

Manfred E. Szabo

Notre Dame J. Formal Log., 1977

1976

An addendum to my paper: "A categorical equivalence of proofs".

Manfred E. Szabo

Notre Dame J. Formal Log., 1976

1974

A categorical equivalence of proofs.

Manfred E. Szabo

Notre Dame J. Formal Log., 1974