default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNotre Dame Journal of Formal Logic, Volume 22
Volume 22, Number 1, January 1981
- Saharon Shelah:
On the number of nonisomorphic models of cardinality λ L∞λ-equivalent to a fixed model. 5-10 - John A. Paulos:
Probabilistic, truth-value, and standard semantics and the primacy of predicate logic. 11-16 - John P. Burgess:
The completeness of intuitionistic propositional calculus for its intended interpretation. 17-28 - Saharon Shelah:
On Fleissner's diamond. 29-35 - Thomas P. Wilson:
General models of set theory. 36-44 - Frank Markham Brown, Sergiu Rudeanu:
Consequences, consistency, and independence in Boolean algebras. 45-62 - Robert S. Wolf:
A highly efficient "transfinite recursive definitions" axiom for set theory. 63-75 - John P. Burgess:
Quick completeness proofs for some logics of conditionals. 76-84 - Xavier Caicedo:
On extensions of Lωω(Q1). 85-93
Volume 22, Number 2, April 1981
- John P. Burgess:
Relevance: a fallacy? 97-104 - Thomas Jech:
On the number of generators of an ideal. 105-108 - John T. Kearns:
A more satisfactory description of the semantics of justification. 109-119 - J. C. E. Dekker:
Automorphisms of ω-cubes. 120-128 - Robert Brandom:
Semantic paradox of material implication. 129-132 - Craig Smorynski:
Cofinal extensions of nonstandard models of arithmetic. 133-144 - Robert P. McArthur:
Anderson's deontic logic and relevant implication. 145-154 - Steven Garavaglia:
Forking in modules. 155-162 - Gary M. Hardegree:
Material implication in orthomodular (and Boolean) lattices. 163-182 - Herbert E. Hendry:
Does IPC have a binary indigenous Sheffer function? 183-186 - Dolph Ulrich:
RMLC: solution to a problem left open by Lemmon. 187-189
Volume 22, Number 3, July 1981
- Craig Smorynski:
Elementary extensions of recursively saturated models of arithmetic. 193-203 - Bowman L. Clarke:
A calculus of individuals based on "connection". 204-218 - John P. Burgess:
Careful choices - a last word on Borel selectors. 219-226 - Raymond E. Jennings, Peter K. Schotch:
Probabilistic considerations on modal semantics. 227-238 - Saharon Shelah:
On saturation for a predicate. 239-248 - Alex Blum:
Quine on an alleged non sequitur. 249-250 - Robert A. Alps, Robert C. Neveln:
A predicate logic based on indefinite description and two notions of identity. 251-263 - Garrel Pottinger:
The Church-Rosser theorem for the typed λ-calculus with surjective pairing. 264-268 - Philip Hugly, Charles Sayward:
Completeness theorems for two propositional logics in which identity diverges from mutual entailment. 269-282 - Melven R. Krom:
Equivalents of a weak axiom of choice. 283-285
Volume 22, Number 4, October 1981
- Steven J. Wagner:
Tonk. 289-300 - Saharon Shelah:
On uncountable Boolean algebras with no uncountable pairwise comparable or incomparable sets of elements. 301-308 - Raymond E. Jennings, Peter K. Schotch:
Some remarks on (weakly) weak modal logics. 309-314 - Jürgen Schmidt:
Algebraic studies of first-order enlargements. 315-343 - Alberto Pettorossi
:
A property which guarantees termination in weak combinatory logic and subtree replacement systems. 344-356 - Craig Smorynski:
Fifty years of self-reference in arithmetic. 357-374 - Raymond E. Jennings, D. K. Johnston, Peter K. Schotch:
The n-adic first-order undefinability of the Geach formula. 375-378
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 2025-02-03 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:
