default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNotre Dame Journal of Formal Logic, Volume 10
Volume 10, Number 1, January 1969
- Karel L. de Bouvère:
Remarks on classification of theories by their complete extensions. 1-17 - Nino B. Cocchiarella:
A substitution free axiom set for second order logic. 18-30 - Albert M. Sweet:
The pragmatics of monadic quantification. 31-46 - John Thomas Canty:
The numerical epsilon. 47-63 - Richard Beatty:
Peirce's development of quantifiers and of predicate logic. 64-76 - H. Paul Williams:
A formalisation of the arithmetic of the ordinals less than Wω. 77-89 - James Rosenberg:
The application of ternary semi-groups to the study of n-valued Sheffer functions. 90-94 - C. W. Leininger:
Concerning some proposals for quantum logic. 95-96 - M. K. Rennie:
Theory of procedures. I. Simple conditionals. 97-112
Volume 10, Number 2, April 1969
- Richard Routley:
Existence and identity in quantified modal logics. 113-149 - Richard L. Purtill:
Doing logic by computer. 150-162 - John T. Kearns:
Two views of variables. 163-180 - D. L. Székely:
The principles of the theory of the unification of sciences. 181-213 - Juliusz Reichbach:
Some examples of different methods of formal proofs with generalizations of the satisfiability definition. 214-224
Volume 10, Number 3, July 1969
- Thomas J. Grilliot:
Selection functions for recursive functionals. 225-234 - William C. Nemitz:
Semi-Boolean lattices. 235-238 - Vito F. Sinisi:
Leśniewski and Frege on collective classes. 239-246 - J. Jay Zeman:
Modal systems in which necessity is "factorable". 247-256 - J. Jay Zeman:
Complete modalization in S4.4 and S4.0.4. 257-260 - George F. Schumm:
On some open questions of B. Sobociński. 261-262 - George F. Schumm:
On a modal system of D. C. Makinson and B. Sobociński. 263-265 - C. A. Meredith:
Equational postulates for the Sheffer stroke. 266-270 - A. N. Prior:
Propositional calculus in implication and non-equivalence. 271-272 - A. N. Prior:
On the calculus MCC. 273-274 - Michael Anderson:
Note on the mortality problem for shift state trees. 275-276 - Laurent Larouche:
Examination of the axiomatic foundations of a theory of change. II. 277-284 - Diana Brignole:
Equational characterization of Nelson algebra. 285-297 - J. Kent Minichiello:
An extension of negationless logic. 298-302 - Stephen L. Bloom:
A semi-completeness theorem. 303-308 - C. A. Meredith:
Terminal functors permissible with syllogistic. 309-312 - Harry V. Stopes-Roe:
An economy in the formation rules for quantification theory. 313-316 - William J. Frascella:
The non-existence of a certain combinatorial design on an infinite set. 317-323 - Desmond Paul Henry:
Leśniewski's ontology and some medieval logicians. 324-326 - Setsuo Saito:
A theory of categorical syllogism. 327-330 - Robert D. Carnes:
A reduction procedure for Sheffer stroke formulas. 331-335 - Charles D. Parsons:
Corrigendum to my paper: "A propositional calculus intermediate between the minimal calculus and the classical". 336
Volume 10, Number 4, October 1969
- John Thomas Canty:
Leśniewski's terminological explanations as recursive concepts. 337-369 - John Corcoran, George Weaver:
Logical consequence in modal logic: Natural deduction in S5. 370-384 - Laurent Larouche:
Examination of the axiomatic foundations of a theory of change. III. 385-409 - Anjan Shukla:
A note on independence. 410-411 - Jonathan P. Seldin:
Corrigendum to my paper: "Note on definitional reductions". 412 - Trevor Evans:
An unsolvable problem concerning identities. 413-414 - Joseph S. Wu:
The problem of existental import (From George Boole to P. F. Strawson. 415-424 - Eugen Mihailescu:
L'ordre d'incomplètitude pour le système d'équivalence la négation et la réciprocité. 425-451 - A. N. Prior:
Corrigendum to C. A. Meredith's and my paper: "Equational logic". 452
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 2026-08-13 23:14 CEST 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, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
