J. Kent Minichiello. An extension of negationless logic. Notre Dame journal of formal logic, vol. 10 no. 3 (1969), pp. 298–302.

PC Gilmore - The Journal of Symbolic Logic, 1971 - cambridge.org
This paper properly extends the negationless logics of Nelson's XXXIII129 by introducing'a
general connective to replace Nelson's connectives 2, 3, and V. The general connective is of …

Gerald J. Massey. Binary closure-algebraic operations that are functionally complete. Notre Dame journal of formal logic, vol. 11 (1970), pp. 340–342.

RA Bull - The Journal of Symbolic Logic, 1971 - cambridge.org
AA ZINO V'E v. Ob odnom sposobi obzorafunkci] istinnosti n-znacnogo isdislenid vyskazyvanij
(A method of describing the truth-functions of the n-valued propositional calculus). …

Itay Neeman. Forcing with sequences of models of two types. Notre Dame Journal of Formal Logic, vol. 55 (2014), pp. 265–298.

D Sinapova - Bulletin of Symbolic Logic, 2015 - cambridge.org
… article On the strength of Ramsey’s Theorem, Notre Dame Journal of Formal Logic, vol.
36 … Then Mitchell in Adding closed unbounded subsets of 2 with finite forcing, Notre Dame

Federico M. Sioson. Further axiomatizations of the Łukasiewicz three-valued calculus. Notre Dame journal of formal logic, vol. 5 no. 1 (1964), pp. 62–70.

AR Turquette - The Journal of Symbolic Logic, 1966 - cambridge.org
Notre Dame journal of formal logic, vol. 5 no. 1 (1964), pp. … In the present paper, the author
considers some axiom systems for three-valued logic based on Lukasiewicz's negation N and …

Lisa Reidhaar-Olson. A new proof of the fixed-point theorem of provability logic. Notre Dame journal of formal logic, vol. 31 (1990), pp. 37–43.

F Montagna - The Journal of Symbolic Logic, 1993 - cambridge.org
… 26-36. This paper deals with a semantic proof of the fixed-point theorem for provability
logic and of other properties of that logic, such as Craig's interpolation and Beth's explicit …

Michael Anderson. Note on the mortality problem for shift state trees. Notre Dame journal of formal logic, vol. 10 no. 3 (1969), pp. 275–276.

PK Hooper - The Journal of Symbolic Logic, 1971 - cambridge.org
Institute of Electrical Engineers, New York 1961, pp. 133-151. In XXm 59 Kleene showed how
to construct a net to represent any event given by a regular expression, and showed how …

Zachary Gleit and Warren Goldfarb. Characters and fixed points in provability logic. Notre Dame journal of formal logic., pp. 26–36.

F Montagna - The Journal of Symbolic Logic, 1993 - cambridge.org
… Characters and fixed points in provability logic. Ibid., pp. 26-36. This paper deals with a
semantic proof of the fixed-point theorem for provability logic and of other properties of that logic, …

Richard Tursman. The shortest axioms of the implicational calculus. Notre Dame journal of formal logic, vol. 9 no. 4 (for 1968, pub. 1969), pp. 351–358.

AS Ferebee - The Journal of Symbolic Logic, 1971 - cambridge.org
In this paper, theorems of McKinsey (II58) giving conditions under which Boolean functions
of n variables are increasing, decreasing, or constant, are generalized to the case of a class …

Gödel's notre dame course

M Adžić, K Došen - Bulletin of Symbolic Logic, 2016 - cambridge.org
… Major problems and branches of logic. Gödel’s logic course at the University of Notre Dame
was elementary, and he was initially somewhat skeptical about his competence to give such …

Bolesław Sobociński. Note on GJ Massey's closure-algebraic operation. Notre Dame journal of formal logic, vol. 11 (1970), pp. 343–346.

RA Bull - The Journal of Symbolic Logic, 1971 - cambridge.org
AA ZINO V'E v. Ob odnom sposobi obzorafunkci] istinnosti n-znacnogo isdislenid vyskazyvanij
(A method of describing the truth-functions of the n-valued propositional calculus). …