default search action
Notre Dame Journal of Formal Logic, Volume 9
Volume 9, Number 1, January 1968
- Ivo Thomas:
In memoriam: Edward John Lemmon (1930 - 1966). 1-3 - Jonathan P. Seldin:
Note on definitional reductions. 4-6 - Roman Suszko:
Ontology in the Tractatus of L. Wittgenstein. 7-33 - Ivo Thomas:
The rule of Peirce. 34 - M. Adrian Carpentier:
Creative sequences and double sequences. 35-61 - Max J. Cresswell:
Some proofs of relative completeness in modal logic. 62-66 - Francesca Rivetti Barbò:
A philosophical remark on Gödel's unprovability of consistency proof. 67-74 - Max J. Cresswell:
Completeness without the Barcan formula. 75-80 - Gerald J. Massey:
Normal form generation of S5 functions via truth functions. 81-85 - Herbert B. Enderton:
On provable recursive functions. 86-88 - Stephen L. Bloom:
A note on the arithmetical hierarchy. 89-91 - Setsuo Saito:
On the Leibnizian modal system. 92-96
Volume 9, Number 2, April 1968
- Paul Weingartner:
Modal logics with two kinds of necessity and possibility. 97-159 - Tudor Ristea:
On propositional, truth and Boolean functions. 160-166 - Hugues Leblanc:
Syntactically free, semantically bound. A note on variables. 167-170 - Robert D. Carnes, William C. Wilcox:
An infixed, punctuation-free notation. 171-178 - Earline Jennifer Ashworth:
Propositional logic in the sixteenth and early seventeenth centuries. 179-192
Volume 9, Number 3, July 1968
- Wilson E. Singletary:
Results regarding the axiomatization of partial propositional calculi. 193-211 - C. A. Meredith, A. N. Prior:
Equational logic. 212-226 - Earline Jennifer Ashworth:
Petrus Fonseca and material implication. 227-228 - Sibajiban:
The middle term. 229-232 - Leonard Goddard:
Towards a logic of significance. 233-264 - Kenneth Loewen:
Modified strong reduction in combinatory logic. 265-270 - Kenneth Loewen:
A standardization theorem for strong reduction. 271-283 - Chandler Works, Wolfgang Yourgrau:
Note on duality in propositional calculus. 284-288
Volume 9, Number 4, October 1968
- Robert R. Tompkins:
On Kleene's recursive realizability as an interpretation for intuitionistic elementary number theory. 289-293 - J. Jay Zeman:
The propostitional calculus MC and its modal analog. 294-298 - Kenneth Loewen:
The Church Rosser theorem for strong reduction in combinatory logic. 299-302 - George F. Schumm:
A note on the structure of the power set. 303-304 - Michael Anderson:
Approximation to a decision procedure for the halting problem. 305-312 - John T. Kearns:
The logical concept of existence. 313-324 - Hugh S. Chandler:
Logical continuity. 325-328 - Chung-ying Chang:
On explanation of number progression. 329-334 - Juliusz Reichbach:
A note on theses of the first-order functional calculus. 335-339 - John Thomas Canty:
On symbolizing singulary S5 functions. 340-342 - Richard Cole:
Definitional Boolean calculi. 343-350 - Richard Tursman:
The shortest axioms of the implicational calculus. 351-358 - Andrés R. Raggio:
Propositional sequence-calculi for inconsistent systems. 359-366 - Fred Coppotelli:
A first order type theory for the theory of sets. 367-370 - Laurent Larouche:
Examination of the axiomatic foundations of a theory of change. I. 371-384 - A. Trew:
Incompleteness of a logic of Routley's. 385-387 - C. G. McKay:
Correction to my paper "Some completeness results for intermediate propositional logics". 388
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-01-13 00:52 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: