default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNotre Dame Journal of Formal Logic, Volume 12
Volume 12, Number 1, January 1971
- Theodore F. Sullivan:
Affine geometry having a solid as primitive. 1-61 - Robert H. Cowen:
Superinductive classes in class-set theory. 62-68 - Anjan Shukla:
Finite model property for five modal calculi in the neighbourhood of S3. 69-74 - E. William Chapin:
Gentzen-like systems for partial propositional calculi. I. 75-80 - Boleslaw Sobocinski:
Lattice-theoretical and mereological forms of Hauber's law. 81-85 - Cyril F. A. Hoormann:
On Hauber's statement of his theorem. 86-88 - Boleslaw Sobocinski:
Atomistic mereology. I. 89-103 - Frederick S. Gass:
Generalized ordinal notation. 104-114 - V. Frederick Rickey:
On weak and strong validity of rules for the propositional calculus. 115-116 - Mohini Mullick:
Does Ockham accept material implication? 117-124 - John Donnelly:
Some remarks on Geach's predicative and attributive adjectives. 125-128
Volume 12, Number 2, April 1971
- Ivo Thomas:
In memoriam A. N. Prior (1914-1969). 129-130 - Richard Routley:
Conventionalist and contingency-oriented modal logics. 131-152 - Hugues Leblanc:
Truth-value semantics for a logic of existence. 153-168 - John R. Gregg:
Two modes of deductive inference. 169-178 - E. William Chapin:
Gentzen-like systems for partial propositional calculi. II. 179-182 - William Russell Belding:
Intuitionistic negation. 183-187 - Rangaswamy V. Setlur:
Duality in finite many-valued logic. 188-194 - Laurence Foss:
Quine on translational indeterminacy. 195-202 - Boleslaw Sobocinski:
Atomistic mereology. II. 203-213 - Nadejda Georgieva:
Independence of the axioms and rules of inference of one system of the extended propositional calculus. 214-218 - Melvin Fitting:
A tableau proof method admitting the empty domain. 219-224 - Louis F. Goble:
A system of modality. 225-237 - Charles H. Applebaum:
Isomorphisms of ω-groups. 238-248 - Boleslaw Sobocinski:
A note on an axiom-system of atomistic mereology. 249-251 - David Makinson:
Some embedding theorems for modal logic. 252-254 - Erik Ellentuck:
Incompleteness via simple sets. 255-256
Volume 12, Number 3, July 1971
- Richard L. Poss:
Weak forms of the axiom of constructibility. 257-299 - Richard L. Poss:
Measurable cardinals and constructibility without regularity. 300-304 - Vladeta Vuckovic:
Combinatorial operators and their quasi-inverses. 305-308 - Robert John Ackermann:
Matrix satisfiability and axiomatization. 309-321 - E. William Chapin:
The strong decidability of cut-logics. I. Partial propositional calculi. 322-328 - J. C. E. Dekker:
Two notes on vector spaces with recursive operations. 329-334 - George F. Schumm:
Solutions to four modal problems of Sobociński. 335-340 - J. Jay Zeman:
A study of some systems in the neighborhood of S4.4. 341-357 - B. van Rootselaar:
A class of models for intermediate logics. 358-362 - Boleslaw Sobocinski:
Concerning some extensions of S4. 363-370 - Boleslaw Sobocinski:
A new class of modal systems. 371-377 - Laurent Larouche:
Examination of the axiomatic foundations of a theory of change. IV. 378-380 - Boleslaw Sobocinski:
A proper subsystem of S4.O4.. 381-384
Volume 12, Number 4, October 1971
- Anton Dumitriu:
La science de la logique. 385-405 - Robert G. Wengert:
The logic of essentially ordered causes. 406-422 - John H. Harris:
Ordinal theory in a conservative extension of predicate calculus. 423-428 - E. William Chapin:
The strong decidability of cut logics. II. Generalizations. 429-434 - Ralph C. Applebee, Biswambhar Pahi:
Some results on generalized truth-tables. 435-440 - John Thomas Canty:
Elementary logic without referential quantification. 441-446 - Ross T. Brady:
The consistency of the axioms of abstraction and extensionality in a three-valued logic. 447-453 - M. C. Bradley:
Copi's method of deduction again. 454-458 - William C. Wilcox:
A mistake in Copi's discussion of completeness. 459-460 - William J. Frascella:
Certain counterexamples to the construction of combinatorial designs on infinite sets. 461-466 - Robert E. Clay:
A model for Leśniewski's mereology in functions. 467-478 - Juliusz Reichbach:
Some methods of formal proofs. III. 479-482 - Michael B. Smyth:
A diagrammatic treatment of syllogistic. 483-488 - Nicholas J. Moutafakis:
The extensional pragmatics of commands. 489-498 - Luis E. Sanchis:
A generalization of the Gentzen Hauptsatz. 499-504 - Jean Drabbe:
Sur une propriété de préservation. 505-506 - Ivo Thomas:
A proof of a theorem of Łukasiewicz. 507-508 - John L. Pollock:
Henkin style completeness proofs in theories lacking negation. 509-511
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 2024-10-31 20:16 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:
