- M. T. Partis:
Limited universal and existential quantifiers in commutative partially ordered recursive arithmetics. Notre Dame J. Formal Log. 8(1-2): 17-23 (1967) - Peter Perkins:
Unsolvable problems for equational theories. Notre Dame J. Formal Log. 8(3): 175-185 (1967) - Herman Rubin, Jean E. Rubin:
A theorem on n-tuples which is equivalent to the well-ordering theorem. Notre Dame J. Formal Log. 8(1-2): 48-50 (1967) - Luis E. Sanchis:
Functionals defined by recursion. Notre Dame J. Formal Log. 8(3): 161-174 (1967) - Anjan Shukla:
A note on the axiomatizations of certain modal systems. Notre Dame J. Formal Log. 8(1-2): 118-120 (1967) - Waclaw Sierpinski:
L'axiome du choix. Notre Dame J. Formal Log. 8(4): 257-266 (1967) - Paul S. Strauss:
Some systems of natural deduction. Notre Dame J. Formal Log. 8(4): 286-290 (1967) - Ivo Thomas:
Three-valued propositional fragments with classical implication. Notre Dame J. Formal Log. 8(1-2): 145-147 (1967) - Ivo Thomas:
A theorem on S4.2 and S4.4. Notre Dame J. Formal Log. 8(4): 335-336 (1967) - Ivo Thomas:
Decision for K4. Notre Dame J. Formal Log. 8(4): 337-338 (1967) - Richmond H. Thomason:
A decision procedure for Fitch's propositional calculus. Notre Dame J. Formal Log. 8(1-2): 101-117 (1967) - Francis J. Tytus:
A theorem for deriving consequences of the axiom of choice. Notre Dame J. Formal Log. 8(4): 291-296 (1967) - Francis J. Tytus:
An elementary construction of the natural numbers. Notre Dame J. Formal Log. 8(4): 297-300 (1967) - Vladeta Vuckovic:
Recursive models for three-valued propositional calculi with classical implication. Notre Dame J. Formal Log. 8(1-2): 148-153 (1967) - Vladeta Vuckovic:
A recursive model for the extended system A of B. Sobociński. Notre Dame J. Formal Log. 8(1-2): 154-158 (1967) - John Hayden Woods:
Non-paradoxical paradoxes? Notre Dame J. Formal Log. 8(4): 346-352 (1967) - J. Jay Zeman:
The deduction theorem in S4, S4.2, and S5. Notre Dame J. Formal Log. 8(1-2): 56-60 (1967)