default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNotre Dame Journal of Formal Logic, Volume 29
Volume 29, Number 1, Winter 1988
- Saharon Shelah
:
Some notes on iterated forcing with 2ℵ0>ℵ2. 1-17 - Seiki Akama:
Constructive predicate logic with strong negation and model theory. 18-27 - Theodore Hailperin:
Infinite truth-functional logic. 28-33 - Peter Lavers:
Relevance and disjunctive syllogism. 34-44 - Chris Mortensen:
Inconsistent number systems. 45-60 - I. L. Humberstone:
Operational semantics for positive R. 61-80 - Thomas Jager:
De re and de dicto. 81-90 - Daniel H. Cohen:
The problem of counterpossibles. 91-101 - Gert-Jan C. Lokhorst:
The modal status of antinomies. 102-105 - George F. Schumm:
The number of nonnormal extensions of S4. 106-108 - John-Jules Ch. Meyer:
A different approach to deontic logic: deontic logic viewed as a variant of dynamic logic. 109-136 - Dolph Ulrich:
A five-valued model of the E-p-q-theses. 137-138 - Jaysankar Lal Shaw:
The Nyāya on double negation. 139-154 - Roy A. Sorensen:
Are enthymemes arguments? 155-159 - Georg Kreisel:
Book review: Collected works, Vol. I [Oxford Univ. Press, New York, 1986] by K. Gödel. 160-181
Volume 29, Number 2, Spring 1988
- Per Lindström:
Partially generic formulas in arithmetic. 185-192 - Leonardo Pasini:
Generalized Hardy fields in several variables. 193-197 - Carl H. Smith:
A note on arbitrarily complex recursive functions. 198-207 - Stewart Shapiro:
The Lindenbaum construction and decidability. 208-213 - George Boolos:
Alphabetical order. 214-215 - William N. Reinhardt:
Epistemic set theory. 216-228 - Thomas S. Weston:
Approximate truth and Łukasiewicz logic. 229-234 - Francis Jeffry Pelletier, W. David Sharp:
On proving functional incompleteness in symbolic logic classes. 235-248 - Russell Pannier, Thomas Sullivan:
Mindful logic: how to resolve some paradoxes of identity. 249-266 - Roy A. Sorensen:
Precisification by means of vague predicates. 267-275
Volume 29, Number 3, Summer 1988
- Miroslaw Szatkowski:
Semantical analysis of superrelevant predicate logics with quantification. 281-294 - Roman Murawski:
Pointwise definable substructures of models of Peano arithmetic. 295-308 - Michael Kaminski:
Nonstandard connectives of intuitionistic propositional logic. 309-331 - Ildikó Sain:
Concerning some cylindric algebra versions of the downward Löwenheim-Skolem theorem. 332-344 - Claudio Bernardi, Paola D'Aquino:
Topological duality for diagonalizable algebras. 345-364 - Jirí Adámek, Alan H. Mekler, Evelyn Nelson, Jan Reiterman:
On the logic of continuous algebras. 365-380 - George Englebretsen:
Preliminary notes on a new modal syllogistic. 381-395 - Victor Pambuccian:
Simplicity. 396-411 - Dennis Duchhart:
A unified approach to relative interpolation. 412-419 - Peter A. Fejer, Richard A. Shore:
Infima of recursively enumerable truth table degrees. 420-437 - Michael J. White:
An "almost classical" period-based tense logic. 438-453
Volume 29, Number 4, Fall 1988
- Timothy Williamson:
First-order logics for comparative similarity. 457-481 - David Pearce, Heinrich Wansing:
On the methodology of possible worlds semantics. I. Correspondence theory. 482-496 - Elias Dahlhaus, Amos Israeli, Johann A. Makowsky:
On the existence of polynomial time algorithms for interpolation problems in propositional logic. 497-509 - Claro R. Ceniza:
Material implication and entailment. 510-519 - Mark Lance:
On the logic of contingent relevant implication: a conceptual incoherence in the intuitive interpretation of R. 520-529 - Daniel Dzierzgowski:
Many-sorted elementary equivalence. 530-542 - Kathleen Johnson Wu:
A basic free logic. 543-552 - Thomas E. Patton:
On begging the question "Who is N?". 553-562 - Branislav R. Boricic:
On certain normalizable natural deduction formulations of some propositional intermediate logics. 563-568 - Gary P. Shannon:
Equivalent versions of a weak form of the axiom of choice. 569-573 - J. Zimbarg Sobrinho:
Definability in self-referential systems. 574-578 - Djordje Cubric:
There are denumerably many ternary intuitionistic Sheffer functions. 579-581
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-11-28 23:54 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:
