The Completeness of Presupposition-Free Tense LogicRobert F. Barnes; Raymond D. Gumb · 1979

A Topological Proof of the Löwenheim-Skolem, Compactness, and Strong Completeness Theorems for Free LogicBas C. van Fraassen · 1968

Logic Colloquium '96 (Proceedings of the Colloquium held in San Sebastián, Spain, July 9–15, 1996) || Free monoid completeness of the Lambek calculus allowing empty premisesLarrazabal, J. M.; Lascar, D.; Mints, G. · 2016

[Studies in Logic and the Foundations of Mathematics] Logic Colloquium 76, Proceedings of a conference Volume 87 || Complexity of Derivations from Quantifier-Free Horn Formulae, Mechanical Introduction of Explicit Definitions, and Refinement of Completeness TheoremsStatman, R. · 1977

Reply to Contessa, Ghins, and Healeyvan Fraassen, B. C. · 2010

Scientific Representation: Paradoxes of Perspectivevan Fraassen, B. C. · 2010

The Agnostic Subtly Probabilifiedvan Fraassen, B. C. · Analysis · 1998

How to talk about unobservablesMuller, F. A.; van Fraassen, B. C. · Analysis · 2008

Conditionalizing on violated Bell's inequalitiesvan Fraassen, B. C. · Analysis · 2005

How to Talk about UnobservablesF. A. Muller and B. C. van Fraassen · Analysis · 2008

EditorialB. C. van Fraassen · Journal of Philosophical Logic · 1972