Recent work at the interface of logic, combinatorics, and computer science John FrancoJ. Michael DunnWilliam H. Wheeler EditorialNotes Pages: 1 - 15
The relative complexity of resolution and cut-free Gentzen systems Alasdair Urquhart OriginalPaper Pages: 157 - 168
Exact satisfiability, a natural extension of set partition, and its average case behavior John W. RosenthalEwald SpeckenmeyerRainer Kemp OriginalPaper Pages: 185 - 200
The expected complexity of analytic tableaux analyses in propositional calculus — II John W. Rosenthal OriginalPaper Pages: 201 - 234
An average case analysis of a resolution principle algorithm in mechanical theorem proving T. H. HuC. Y. TangR. C. T. Lee OriginalPaper Pages: 235 - 251
The Unique Horn-Satisfiability problem and quadratic Boolean equations M. Minoux OriginalPaper Pages: 253 - 266
A finite intersection property and the Loeb measurability of ultrafilters on hyperfinite sets R. Lee Panetta OriginalPaper Pages: 267 - 270
Turing complexity of Behncke-LeptinC *-algebras with a two-point dual Daniele Mundici OriginalPaper Pages: 287 - 293