Volume 6,
Numbers 1-3,
1992
Logic and Combinatorics
- John V. Franco, J. Michael Dunn, William H. Wheeler:
Recent Work at the Interface of Logic, Combinatorics and Computer Science.
1-15
- Peter Dolan:
Undecidable Statements and Random Graphs.
17-25
- William M. Farmer:
The Kreisel Length-of-Proof Problem.
27-55
- Peter Clote:
ALOGTIME and a Conjecture of S. A. Cook.
57-106
- Jan Krajícek, Gaisi Takeuti:
On Induction-Free Provability.
107-125
- Spyro-Giorgio Mantzivis:
Circuits in Bounded Arithmetic, Part I.
127-156
- Alasdair Urquhart:
The Relative Complexity of Resolution and Cut-Free Gentzen Systems.
157-168
- Andreas Goerdt:
Davis-Putnam Resolution versus Unrestricted Resolution.
169-184
- John W. Rosenthal, Ewald Speckenmeyer, Rainer Kemp:
Exact Satisfiability, a Natural Extension of Set Partition and Its Average Case Behavior.
185-200
- John W. Rosenthal:
The Expected Complexity of Analytic Tableaux Analyses in Propositional Calculus - II.
201-234
- T. H. Hu, Chuan Yi Tang, Richard C. T. Lee:
An Average Case Analysis of a Resolution Principle Algorithm in Mechanical Theorem Proving.
235-251
- Michel Minoux:
The Unique Horn-Satisfiability Problem and Quadratic Boolean Equations.
253-266
- R. Lee Panetta:
A Finite Intersection Property and the Loeb Measurability of Ultrafilters on Hyperfinite Sets.
267-270
- John N. Hooker:
Generalized Resolution for 0-1 Linear Inequalities.
271-286
- Daniele Mundici:
Turing Complexity of Behncke-Leptin C*-algebras with a Two-Point Dual.
287-293
Volume 6,
Number 4,
1992
Copyright © Mon Nov 2 21:24:16 2009
by Michael Ley (ley@uni-trier.de)
