default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNotre Dame Journal of Formal Logic, Volume 31
Volume 31, Number 1, Winter 1990
- Saharon Shelah
, Charles Steinhorn:
The Nonaxiomatizability of L(Q2ℵ1) by Finitely Many Schemata. 1-13 - Nuel Belnap:
Linear Logic Displayed. 14-25 - Zachari Gleit, Warren D. Goldfarb:
Characters and Fixed Points in Provability Logic. 26-36 - Lisa Reidhaar-Olson:
A New Proof of the Fixed-Point Theorem of Probability Logic. 37-43 - Frans Voorbraak:
A Simplification of the Completeness Proofs for Guaspari and Solovay's R. 44-63 - Norbert Brunner:
The Fraenkel-Mostowski Method, Revisited. 64-75 - John Fox:
Motivation and Demotivation of a Four-Valued Logic. 76-80 - Valentin Goranko:
Modal Definability in Enriched Languages. 81-105 - Fred Sommers:
Predication in the Logic of Terms. 106-126 - Arnon Avron:
Gentzenizing Schroeder-Heister's Natural Extension of Natural Deduction. 127-135 - Sven Ove Hansson:
Defining "Good" and "Bad" in Terms of "Better". 136-149
Volume 31, Number 2, Spring 1990
- Arnon Avron:
Relevance and Paraconsistency - A New Approach, Part II: The Formal Systems. 169-202 - Krister Segerberg:
Validity and Satisfaction in Imperative Logic. 203-221 - Timothy J. Surendonk:
A Lemma in the Logic of Action. 222-224 - Samuel R. Buss:
The Modal Logic of Pure Provability. 225-231 - Robert Cowen:
Two Hypergraph Theorems Equivalent to BPI. 232-240 - Mike Townsend:
Complexity for Type-2 Relations. 241-262 - John Hawthorn:
Natural Deduction in Normal Modal Logic. 263-273 - Chris Mortensen:
Models for Inconsistent and Incomplete Differential Calculus. 274-285 - Timothy Williamson:
Verification, Falsification, and Cancellation in KT. 286-290 - William Demopoulos:
The Homogeneous Form of Logic Programs with Equality. 291-303 - M. E. Adams, R. Cignolli:
A Note on the Axiomatization of Equational Classes of n-Valued Lukasiewicz Algebras. 304-307 - Raymond Turner:
Logics of Truth. 308-329 - Balázs Biró:
On Generalizations of a Theorem of Vaught. 330-336
Volume 31, Number 3, Summer 1990
- Leon Harkleroad:
Recursive Surreal Numbers. 337-345 - Wayne D. Blizard:
Negative Membership. 346-368 - Stephen Pollard:
A Strengthening of Scott's ZF≠ Result. 369-370 - Alexander Abian, Wael A. Amin:
An Equivalent of the Axiom of Choice in Finite Models of the Powerset Axiom. 371-374 - Bernhard Banaschewski, Gregory H. Moore:
The Dual Cantor-Bernstein Theorem and the Partition Principle. 375-381 - Gary P. Shannon:
Provable Forms of Martin's Axiom. 382-388 - Thierry Lucas, René Lavendhomme:
Varying Modal Theories. 389-402 - Alexander Bochman:
Concerted Instant-Interval Temporal Semantics I: Temporal Ontologies. 403-414 - John Nolt:
A Fully Logical Inductive Logic. 415-436 - Christopher Gauker:
Semantics without Reference. 437-461 - Francis Jeffry Pelletier, Norman M. Martin:
Post's Functional Completeness Theorem. 462-475 - Elias E. Savellos:
On Defining Identity. 476-484
Volume 31, Number 4, Fall 1990
- Toshiyasu Arai:
Derivability Conditions on Rosser's Provability Predicates. 487-497 - Allen Hazen:
Actuality and Quantification. 498-508 - David Marker:
Enumerations of Turing Ideals with Applications. 509-514 - Piero Pagliani:
Remarks on Special Lattices and Related Constructive Logics with Strong Negation. 515-528 - Yde Venema:
Expressiveness and Completeness of an Interval Tense Logic. 529-547 - Noby-Yuki Suzuki:
Some Syntactical Properties of Intermediate Predicate Logics. 548-559 - Cinzia Bonotto:
A Generalization of the Adequacy Theorem for the Quasi-Senses. 560-575 - George F. Schumm, Stewart Shapiro:
Expressive Completeness and Decidability. 576-579 - Alexander Bochman:
Concerted Instant-Interval Temporal Semantics II: Temporal Valuations and Logics of Change. 580-601
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-08 20:19 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:
