default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNotre Dame Journal of Formal Logic, Volume 25
Volume 25, Number 1, January 1984
- Johan van Benthem:
Tense logic and time. 1-16 - Barry Burd:
Decomposable collections of sets. 17-26 - Leonard Goddard:
The nature of reflexive paradoxes. II. 27-58 - Michael J. White:
The necessity of the past and modal-tense logic incompleteness. 59-71 - Michal Krynicki, Alistair H. Lachlan, Jouko Väänänen:
Vector spaces and binary quantifiers. 72-78 - George Englebretsen:
Opposition. 79-85 - Vincenzo Manca
, Antonino Salibra:
First-order theories as many-sorted algebras. 86-94
Volume 25, Number 2, April 1984
- Saharon Shelah:
A pair of nonisomorphic ≡∞λ models of power λ for λ singular with λω=λ. 97-104 - John Neil Martin:
Epistemic semantics for classical and intuitionistic logic. 105-116 - Fabio Bellissima:
On the relationship between one-point frames and degrees of unsatisfiability of modal formulas. 117-126 - Per Lindström:
On certain lattices of degrees of interpretability. 127-140 - Shigeo Ohama:
Conjunctive normal forms and weak modal logics without the axiom of necessity. 141-151 - Dag Westerståhl:
Some results on quantifiers. 152-170 - Richard L. Call:
Constructing sequent rules for generalized propositional logics. 171-178 - Franco Montagna:
The predicate modal logic of provability. 179-189
Volume 25, Number 3, July 1984
- George Boolos:
Trees and finite satisfiability: proof of a conjecture of Burgess. 193-197 - Theodore Hailperin:
Probability logic. 198-212 - David Marker:
A model theoretic proof of Feferman's preservation theorem. 213-216 - John P. Burgess:
Read on relevance: a rejoinder. 217-223 - Ermanno Bencivenga:
Finitary consistency of a free arithmetic. 224-226 - Daniel Bonevac:
Skolem fragments. 227-232 - Carl G. Wagner:
Aggregating subjective probabilities: some limitative theorems. 233-240 - Bangs L. Tapscott:
Correcting the tableau procedure for S4. 241-249 - John Rybak, Janet Rybak:
Mechanizing logic. I. Map logic extended formally to relational arguments. 250-264 - Janet Rybak, John Rybak:
Mechanizing logic. II. Automated map logic method for relational arguments on paper and by computer. 265-282 - John W. Dawson:
Addenda and corrigenda to: "The published work of Kurt Gödel: an annotated bibliography". 283-287
Volume 25, Number 4, October 1984
- Philip Hugly, Charles Sayward:
Do we need quantification? 289-302 - Mark A. Brown:
Generalized quantifiers and the square of opposition. 303-322 - Evelyn M. Barker:
Unneeded surgery on Aristotle's Prior analytics. 323-331 - Alberto Zanardo:
Individual concepts as propositional variables in MLν+1. 332-346 - Veikko Rantala:
Facts and the choice of logical foundations. 347-353 - Jacek K. Kabzinski:
An axiomatization of the equivalential fragment of the three-valued logic of Lukasiewicz. 354-356 - Mitsuru Yasuhara:
Extensionality in Bernays set theory. 357-363 - Albert M. Sweet:
A pragmatic theory of locally standard grammar. 364-382 - Matt Kaufmann:
Some remarks on equivalence in infinitary and stationary logic. 383-389 - Claudio Bernardi:
A shorter proof of a recent result by R. Di Paola. 390-393
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-21 19:36 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:
