Manfred E. Szabo

14 papers B 1Journal 12Unranked 1
YearRankTypeTitle / Venue / Authors
1992 J jnl
On the stochastic complexity of loops in rule-based expert systems.
Inf. Sci.
Manfred E. Szabo
1992 J jnl
Stochastic performance measures for rule-based expert systems.
Inf. Sci.
Manfred E. Szabo
1990 B conf
On the Tracking of Loops in Automated Deductions.
CSL
Manfred E. Szabo
1989 J jnl
A Probabilistic Analysis of Loop Programs.
Comput. Lang.
Manfred E. Szabo, E. J. Farkas
1989 J jnl
Coherence in cartesian closed categories and the generality of proofs.
Stud Logica
Manfred E. Szabo
1988 J jnl
Nonstandard methods in combinatorics and theoretical computer science.
Stud Logica
Michael M. Richter, Manfred E. Szabo
1988 J jnl
On the programs-as-formulas interpretation of parallel programs in peano arithmetic.
Ann. Pure Appl. Log.
E. J. Farkas, Manfred E. Szabo
1987 J jnl
A cut elimination theorem for stationary logic.
Ann. Pure Appl. Log.
Manfred E. Szabo
1984 J jnl
Variable Truth.
Math. Log. Q.
Manfred E. Szabo
1983 J jnl
The Continuous Realizability of Entailment.
Math. Log. Q.
Manfred E. Szabo
1980 — conf
A sequent calculus for Kröger logic.
Logic of Programs
Manfred E. Szabo
1977 J jnl
The logic of closed categories.
Notre Dame J. Formal Log.
Manfred E. Szabo
1976 J jnl
An addendum to my paper: "A categorical equivalence of proofs".
Notre Dame J. Formal Log.
Manfred E. Szabo
1974 J jnl
A categorical equivalence of proofs.
Notre Dame J. Formal Log.
Manfred E. Szabo