Notre Dame J. Formal Logic, Tome 22 (1981)

p. 5-10

Project Euclid

Probabilistic, truth-value, and standard semantics and the primacy of predicate logic.

Paulos, John A.

p. 11-16

Project Euclid

The completeness of intuitionistic propositional calculus for its intended interpretation.

p. 17-28

Project Euclid

On Fleissner's diamond.

p. 29-35

Project Euclid

General models of set theory.

Wilson, Thomas P.

Brown, Frank Markham ; Rudeanu, Sergiu

p. 36-44

Project Euclid

Consequences, consistency, and independence in Boolean algebras.

p. 45-62

Project Euclid

A highly efficient ``transfinite recursive definitions'' axiom for set theory.

Wolf, Robert S.

p. 63-75

Project Euclid

Quick completeness proofs for some logics of conditionals.

p. 76-84

Project Euclid

On extensions of $L_{\omega \omega }(Q_1)$.

Caicedo, Xavier

p. 85-93

Project Euclid

Relevance: a fallacy?

p. 97-104

Project Euclid

On the number of generators of an ideal.

Jech, Thomas

p. 105-108

Project Euclid

A more satisfactory description of the semantics of justification.

Kearns, John T.

p. 109-119

Project Euclid

Automorphisms of $\omega$-cubes.

Dekker, J. C. E.

p. 120-128

Project Euclid

Semantic paradox of material implication.

Brandom, Robert

p. 129-132

Project Euclid

Cofinal extensions of nonstandard models of arithmetic.

Smoryński, C.

p. 133-144

Project Euclid

Anderson's deontic logic and relevant implication.

McArthur, Robert P.

p. 145-154

Project Euclid

Forking in modules.

Garavaglia, Steven

p. 155-162

Project Euclid

Material implication in orthomodular (and Boolean) lattices.

Hardegree, Gary M.

p. 163-182

Project Euclid

Does IPC have a binary indigenous Sheffer function?

Hendry, Herbert E.

p. 183-186

Project Euclid

${\rm RMLC}$: solution to a problem left open by Lemmon.

Ulrich, Dolph

p. 187-189

Project Euclid

Elementary extensions of recursively saturated models of arithmetic.

Smoryński, C.

p. 193-203

Project Euclid

A calculus of individuals based on ``connection''.

Clarke, Bowman L.

p. 204-218

Project Euclid

Careful choices---a last word on Borel selectors.

Schotch, P. K. ; Jennings, R. E.

p. 219-226

Project Euclid

Probabilistic considerations on modal semantics.

p. 227-238

Project Euclid

On saturation for a predicate.

p. 239-248

Project Euclid

Quine on an alleged non sequitur.

Blum, Alex

Alps, Robert A. ; Neveln, Robert C.

p. 249-250

Project Euclid

A predicate logic based on indefinite description and two notions of identity.

p. 251-263

Project Euclid

The Church-Rosser theorem for the typed $\lambda$-calculus with surjective pairing.

Pottinger, Garrel

Hugly, Philip ; Sayward, Charles

p. 264-268

Project Euclid

Completeness theorems for two propositional logics in which identity diverges from mutual entailment.

p. 269-282

Project Euclid

Equivalents of a weak axiom of choice.

Krom, Melven

p. 283-285

Project Euclid

Tonk.

Wagner, Steven

p. 289-300

Project Euclid

On uncountable Boolean algebras with no uncountable pairwise comparable or incomparable sets of elements.

Jennings, R. E. ; Schotch, P. K.

p. 301-308

Project Euclid

Some remarks on (weakly) weak modal logics.

p. 309-314

Project Euclid

Algebraic studies of first-order enlargements.

Schmidt, Jürgen

p. 315-343

Project Euclid

A property which guarantees termination in weak combinatory logic and subtree replacement systems.

Pettorossi, Alberto

p. 344-356

Project Euclid

Fifty years of self-reference in arithmetic.

Smoryński, C.

p. 357-374

Project Euclid

The $n$-adic first-order undefinability of the Geach formula.

Jennings, R. E. ; Schotch, P. K. ; Johnston, D. K.