Sommaire du Fascicule no. 3

In memoriam: Wilhelm Ackermann (1896-1962).

Hermes, Hans

Text on Project Euclid
PDF
Alt PDF
p. 1-8

Project Euclid
Formal nonassociative number theory.

Bollman, Dorothy

Text on Project Euclid
PDF
Alt PDF
p. 9-16

Project Euclid
Limited universal and existential quantifiers in commutative partially ordered recursive arithmetics.

Partis, M. T.

Text on Project Euclid
PDF
Alt PDF
p. 17-23

Project Euclid
Rings of term-relation numbers as non-standard models.

Asenjo, F. G.

Text on Project Euclid
PDF
Alt PDF
p. 24-26

Project Euclid
Combinatorial designs on infinite sets.

Frascella, William J.

Text on Project Euclid
PDF
Alt PDF
p. 27-47

Project Euclid
A theorem on $n$-tuples which is equivalent to the well-ordering theorem.

Rubin, H. ; Rubin, J. E.

Text on Project Euclid
PDF
Alt PDF
p. 48-50

Project Euclid
Algebraic independence in an infinite Steiner triple system.

Goetz, Abraham

Text on Project Euclid
PDF
Alt PDF
p. 51-55

Project Euclid
The deduction theorem in ${\rm S}4,$ ${\rm S}4.2$, and ${\rm S}5$.

Zeman, J. Jay

Text on Project Euclid
PDF
Alt PDF
p. 56-60

Project Euclid
The contribution of Leśniewski.

Kearns, John T.

Text on Project Euclid
PDF
Alt PDF
p. 61-93

Project Euclid
On identity and interchangeability in Leibnitz and Frege.

Angelelli, Ignacio

Text on Project Euclid
PDF
Alt PDF
p. 94-100

Project Euclid
A decision procedure for Fitch's propositional calculus.

Thomason, Richmond H.

Text on Project Euclid
PDF
Alt PDF
p. 101-117

Project Euclid
A note on the axiomatizations of certain modal systems.

Shukla, Anjan

Text on Project Euclid
PDF
Alt PDF
p. 118-120

Project Euclid
Contrariety.

McCall, Storrs

Text on Project Euclid
PDF
Alt PDF
p. 121-132

Project Euclid
Free logic and the concept of existence.

Lambert, Karel

Text on Project Euclid
PDF
Alt PDF
p. 133-144

Project Euclid
Three-valued propositional fragments with classical implication.

Thomas, Ivo

Text on Project Euclid
PDF
Alt PDF
p. 145-147

Project Euclid
Recursive models for three-valued propositional calculi with classical implication.

Vučković, Vladeta

Text on Project Euclid
PDF
Alt PDF
p. 148-153

Project Euclid
A recursive model for the extended system ${\cal A}$ of B. Sobociński.

Vučković, Vladeta

Text on Project Euclid
PDF
Alt PDF
p. 154-158

Project Euclid
Note on an inequality of Tibor Rado.

Anderson, Michael

Text on Project Euclid
PDF
Alt PDF
p. 159-160

Project Euclid
Functionals defined by recursion.

Sanchis, Luis Elpidio

Text on Project Euclid
PDF
Alt PDF
p. 161-174

Project Euclid
Unsolvable problems for equational theories.

Perkins, Peter

Text on Project Euclid
PDF
Alt PDF
p. 175-185

Project Euclid
A Henkin completeness for $T$.

Cresswell, M. J.

Text on Project Euclid
PDF
Alt PDF
p. 186-190

Project Euclid
Some completeness results for intermediate propositional logics.

McKay, C. G.

Text on Project Euclid
PDF
Alt PDF
p. 191-194

Project Euclid
Syllogistic without existence.

Bacon, John

Text on Project Euclid
PDF
Alt PDF
p. 195-219

Project Euclid
A characterization of S$^m$ by means of topological geometries.

Gemignani, Michael C.

Text on Project Euclid
PDF
Alt PDF
p. 220-224

Project Euclid
On the independence of certain axioms in the definition of an $m$-arrangement.

Gemignani, Michael C.

Text on Project Euclid
PDF
Alt PDF
p. 225-226

Project Euclid
Implicationless wffs. in IC.

McKay, C. G.

Text on Project Euclid
PDF
Alt PDF
p. 227-228

Project Euclid
The Craig interpolation lemma.

Dreben, Burton ; Putnam, Hilary

Text on Project Euclid
PDF
Alt PDF
p. 229-233

Project Euclid
Omitting the replacement schema in recursive arithmetic.

Heath, I. J.

Text on Project Euclid
PDF
Alt PDF
p. 234-238

Project Euclid
Decision problem in the classical logic.

Mihăilescu, Eugen

Text on Project Euclid
PDF
Alt PDF
p. 239-253

Project Euclid
Leibnitz's preference for an intensional logic (A reply to Mr. Parkinson).

O'Briant, Walter H.

Text on Project Euclid
PDF
Alt PDF
p. 254-256

Project Euclid
L'axiome du choix.

Sierpiński, Wacław

Text on Project Euclid
PDF
Alt PDF
p. 257-266

Project Euclid
Some complete calculi of individuals.

Eberle, Rolf A.

Text on Project Euclid
PDF
Alt PDF
p. 267-278

Project Euclid
A single axiom for the mereological notion of proper part.

Lejewski, Czesław

Text on Project Euclid
PDF
Alt PDF
p. 279-285

Project Euclid
Some systems of natural deduction.

Strauss, Paul

Text on Project Euclid
PDF
Alt PDF
p. 286-290

Project Euclid
A theorem for deriving consequences of the axiom of choice.

Tytus, Francis J.

Text on Project Euclid
PDF
Alt PDF
p. 291-296

Project Euclid
An elementary construction of the natural numbers.

Tytus, Francis J.

Text on Project Euclid
PDF
Alt PDF
p. 297-300

Project Euclid
Regressive functions and combinatorial functions.

Bredlau, Carl E.

Text on Project Euclid
PDF
Alt PDF
p. 301-310

Project Euclid
Primitive recursive computations.

McCleary, Stephen H.

Text on Project Euclid
PDF
Alt PDF
p. 311-317

Project Euclid
Number system for the immediate inferences and the syllogism in Aristotelian logic.

Hacker, Edward A.

Text on Project Euclid
PDF
Alt PDF
p. 318-320

Project Euclid
Pure numerical Boolean syllogisms.

Hacker, Edward A. ; Parry, William Tuthill

Text on Project Euclid
PDF
Alt PDF
p. 321-324

Project Euclid
On the extension of S4 with $CLMpMLp$.

Bull, R. A.

Text on Project Euclid
PDF
Alt PDF
p. 325-329

Project Euclid
On three related extensions of S4.

Bull, R. A.

Text on Project Euclid
PDF
Alt PDF
p. 330-334

Project Euclid
A theorem on ${\rm S}4.2$ and ${\rm S}4.4$.

Thomas, Ivo

Text on Project Euclid
PDF
Alt PDF
p. 335-336

Project Euclid
Decision for $K4$.

Thomas, Ivo

Text on Project Euclid
PDF
Alt PDF
p. 337-338

Project Euclid
Alternative completeness theorems for modal systems.

Cresswell, M. J.

Text on Project Euclid
PDF
Alt PDF
p. 339-345

Project Euclid
Non-paradoxical paradoxes?

Woods, John H.

Text on Project Euclid
PDF
Alt PDF
p. 346-352

Project Euclid
On new theorems for elementary number theory.

Mullin, Albert A.

Text on Project Euclid
PDF
Alt PDF
p. 353-356

Project Euclid