default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNotre Dame Journal of Formal Logic, Volume 38
Volume 38, Number 1, Winter 1997
- Sergio A. Celani, Ramon Jansana
:
A New Semantics for Positive Modal Logic. 1-18 - John C. Simms:
Another Characterization of Alephs: Decompositions of Hyperspace. 19-36 - Domenico Zambella:
Algebraic Methods and Bounded Formulas. 37-48 - Wallace A. Murphree:
The Numerical Syllogism and Existential Presupposition. 49-64 - Chrysafis Hartonas:
An Algebraic Theory of Structured Objects. 65-80 - Paola D'Aquino:
Toward the Limits of the Tennebaum Phenomenon. 81-92 - Ambar Chowdhury, Bradd Hart:
An Unclassifiable Unidimensional Theory without OTOP. 93-103 - Gerald Vision:
Why Correspondence Truth Will Not Go Away. 104-131
Volume 38, Number 2, Spring 1997
- Bakhadyr Khoussainov, André Nies, Richard A. Shore:
Computable Models of Theories with Few Models. 165-178 - Newton C. A. da Costa, Décio Krause:
An Intensional Schrödinger Logic. 179-194 - Victor Rodych:
Wittgenstein on Mathematical Meaningfulness, Decidability, and Application. 195-224 - Ian E. Pratt, Oliver Lemon:
Ontologies for Plane, Polygonal Mereotopology. 225-245 - Mariangiola Dezani-Ciancaglini, Silvia Ghilezan, Betti Venneri:
The "Relevance" of Intersection and Union Types. 246-269 - Karim Nour:
A Conjecture on Numeral Systems. 270-275 - Genoveva Martí:
Rethinking Quine's Argument on the Collapse of Modal Distinctions. 276-294 - Philip Kremer:
Propositional Quantification in the Topological Semantics for S4. 295-313
Volume 38, Number 3, Summer 1997
- John T. Kearns:
Propositional Logic of Supposition and Assertion. 325-349 - Osamu Takaki:
Strong Normalization Theorem for a Constructive Arithmetic with Definition by Transfinite Recursion and Bar Induction. 350-373 - Carsten Butz:
Syntax and Semantics of the Logic Lλωω. 374-384 - Anthony F. Peressini:
Cumulative versus Noncumulative Ramified Types. 385-397 - S. V. Bhave:
Situations in Which Disjunctive Syllogism Can Lead from True Premises to a False Conclusion. 398-405 - Rich Blaylock, Rodney G. Downey, Steffen Lempp:
Infima in the Recursively Enumerable Weak Truth Table Degrees. 406-418 - Mark Reynolds:
A Decidable Temporal Logic of Parallelism. 419-436 - Richard G. Heck Jr.:
Grundgesetze der Arithmetik I: Paragraphen 29-32. 437-474
Volume 38, Number 4, Fall 1997
- Graham Priest:
Impossible Worlds - Editor's Introduction. 481-487 - Jon Barwise:
Information and Impossibilities. 488-515 - Edwin D. Mares:
Who's Afraid of Impossible Worlds? 516-526 - Chris Mortensen:
Peeking at the Impossible. 527-534 - Daniel Nolan:
Impossible Worlds: A Modest Approach. 535-572 - Graham Priest:
Sylvan's Box: a Short Story and Ten Morals. 573-582 - Greg Restall:
Ways Things Can't Be. 583-596 - David A. Vander Laan:
The Ontology of Impossible Worlds. 597-620 - Achille C. Varzi:
Inconsistency without Contradiction. 621-639 - Edward N. Zalta:
A Classically-Based Theory of Impossible Worlds. 640-660
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 2024-11-05 20:49 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:
