Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNotre Dame Journal of Formal Logic, Volume 8
Volume 8, Numbers 1-2, April 1967
- Hans Hermes:
In memoriam: Wilhelm Ackermann (1896-1962). 1-8 - Dorothy Bollman:
Formal nonassociative number theory. 9-16 - M. T. Partis:
Limited universal and existential quantifiers in commutative partially ordered recursive arithmetics. 17-23 - Florencio G. Asenjo:
Rings of term-relation numbers as non-standard models. 24-26 - William J. Frascella:
Combinatorial designs on infinite sets. 27-47 - Herman Rubin, Jean E. Rubin:
A theorem on n-tuples which is equivalent to the well-ordering theorem. 48-50 - Abraham Goetz:
Algebraic independence in an infinite Steiner triple system. 51-55 - J. Jay Zeman:
The deduction theorem in S4, S4.2, and S5. 56-60 - John T. Kearns:
The contribution of Leśniewski. 61-93 - Ignacio Angelelli:
On identity and interchangeability in Leibnitz and Frege. 94-100 - Richmond H. Thomason:
A decision procedure for Fitch's propositional calculus. 101-117 - Anjan Shukla:
A note on the axiomatizations of certain modal systems. 118-120 - Storrs McCall:
Contrariety. 121-132 - Karel Lambert:
Free logic and the concept of existence. 133-144 - Ivo Thomas:
Three-valued propositional fragments with classical implication. 145-147 - Vladeta Vuckovic:
Recursive models for three-valued propositional calculi with classical implication. 148-153 - Vladeta Vuckovic:
A recursive model for the extended system A of B. Sobociński. 154-158 - Michael Anderson:
Note on an inequality of Tibor Rado. 159-160
Volume 8, Number 3, July 1967
- Luis E. Sanchis:
Functionals defined by recursion. 161-174 - Peter Perkins:
Unsolvable problems for equational theories. 175-185 - Max J. Cresswell:
A Henkin completeness for T. 186-190 - C. G. McKay:
Some completeness results for intermediate propositional logics. 191-194 - John Bacon:
Syllogistic without existence. 195-219 - Michael C. Gemignani:
A characterization of Sm by means of topological geometries. 220-224 - Michael C. Gemignani:
On the independence of certain axioms in the definition of an m-arrangement. 225-226 - C. G. McKay:
Implicationless wffs. in IC. 227-228 - Burton Dreben, Hilary Putnam:
The Craig interpolation lemma. 229-233 - I. J. Heath:
Omitting the replacement schema in recursive arithmetic. 234-238 - Eugen Mihailescu:
Decision problem in the classical logic. 239-253 - Walter H. O'Briant:
Leibnitz's preference for an intensional logic (A reply to Mr. Parkinson). 254-256
Volume 8, Number 4, October 1967
- Waclaw Sierpinski:
L'axiome du choix. 257-266 - Rolf A. Eberle:
Some complete calculi of individuals. 267-278 - Czeslaw Lejewski:
A single axiom for the mereological notion of proper part. 279-285 - Paul S. Strauss:
Some systems of natural deduction. 286-290 - Francis J. Tytus:
A theorem for deriving consequences of the axiom of choice. 291-296 - Francis J. Tytus:
An elementary construction of the natural numbers. 297-300 - Carl E. Bredlau:
Regressive functions and combinatorial functions. 301-310 - Stephen H. McCleary:
Primitive recursive computations. 311-317 - Edward A. Hacker:
Number system for the immediate inferences and the syllogism in Aristotelian logic. 318-320 - Edward A. Hacker, William Tuthill Parry:
Pure numerical Boolean syllogisms. 321-324 - R. A. Bull:
On the extension of S4 with CLMpMLp. 325-329 - R. A. Bull:
On three related extensions of S4. 330-334 - Ivo Thomas:
A theorem on S4.2 and S4.4. 335-336 - Ivo Thomas:
Decision for K4. 337-338 - M. J. Cresswell:
Alternative completeness theorems for modal systems. 339-345 - John Hayden Woods:
Non-paradoxical paradoxes? 346-352 - Albert A. Mullin:
On new theorems for elementary number theory. 353-356
a service of 
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-04-15 20:33 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 and maintained by:
the dblp computer science bibliography is funded and supported by:
