Advanced Search
Home > Journals > Notre Dame J. Formal Logic > Volume 34 > Issue 4
Notre Dame Journal of Formal Logic
VOL. 34 · NO. 4 | Fall 1993
 
VIEW ALL ABSTRACTS +
Front Matter
Miscellaneous front pages, Notre Dame Journal of Formal Logic, volume 34, issue 4 (1993)
Notre Dame J. Formal Logic 34 (4), (Fall 1993) Open Access
No abstract available
DOWNLOAD PAPER
Articles
The fibrational formulation of intuitionistic predicate logic ${\rm I}$: completeness according to Gödel, Kripke, and Läuchli. II.
M. Makkai
Notre Dame J. Formal Logic 34 (4), 471-498, (Fall 1993) DOI: 10.1305/ndjfl/1093633902 Open Access
KEYWORDS: 03B20, 03G30
No abstract available
DOWNLOAD PAPER
Minimal doxastic logic: probabilistic and other completeness theorems.
Peter Milne
Notre Dame J. Formal Logic 34 (4), 499-526, (Fall 1993) DOI: 10.1305/ndjfl/1093633903 Open Access
KEYWORDS: 03B45
No abstract available
DOWNLOAD PAPER
Multimorphisms over enumerated sets.
Andrzej Orlicki
Notre Dame J. Formal Logic 34 (4), 527-538, (Fall 1993) DOI: 10.1305/ndjfl/1093633904 Open Access
KEYWORDS: 03D45
No abstract available
DOWNLOAD PAPER
Zermelo, reductionism, and the philosophy of mathematics.
R. Gregory Taylor
Notre Dame J. Formal Logic 34 (4), 539-563, (Fall 1993) DOI: 10.1305/ndjfl/1093633905 Open Access
KEYWORDS: 03A05, 00A30, 01A60, 03-03
No abstract available
DOWNLOAD PAPER
Cut-free modal sequents for normal modal logics.
Claudio Cerrato
Notre Dame J. Formal Logic 34 (4), 564-582, (Fall 1993) DOI: 10.1305/ndjfl/1093633906 Open Access
KEYWORDS: 03B45, 03F05
No abstract available
DOWNLOAD PAPER
The Gupta-Belnap systems ${\rm S}^\#$ and ${\rm S}^*$ are not axiomatisable.
Philip Kremer
Notre Dame J. Formal Logic 34 (4), 583-596, (Fall 1993) DOI: 10.1305/ndjfl/1093633907 Open Access
KEYWORDS: 03B60
No abstract available
DOWNLOAD PAPER
A parity-based Frege proof for the symmetric pigeonhole principle.
Steve Firebaugh
Notre Dame J. Formal Logic 34 (4), 597-601, (Fall 1993) DOI: 10.1305/ndjfl/1093633908 Open Access
KEYWORDS: 03F20
No abstract available
DOWNLOAD PAPER
BREAKUP: a preprocessing algorithm for satisfiability testing of CNF formulas.
Robert Cowen, Katherine Wyatt
Notre Dame J. Formal Logic 34 (4), 602-606, (Fall 1993) DOI: 10.1305/ndjfl/1093633909 Open Access
KEYWORDS: 03B35, 03B10, 68Q25
No abstract available
DOWNLOAD PAPER
Argument deletion without events.
Paul R. Graves
Notre Dame J. Formal Logic 34 (4), 607-620, (Fall 1993) DOI: 10.1305/ndjfl/1093633910 Open Access
KEYWORDS: 03B65
No abstract available
DOWNLOAD PAPER
Consequential implication. A correction to: ``Decision procedures for logics of consequential implication''.
Claudio Pizzi
Notre Dame J. Formal Logic 34 (4), 621-624, (Fall 1993) DOI: 10.1305/ndjfl/1093633911 Open Access
KEYWORDS: 03B22, 03B25
No abstract available
DOWNLOAD PAPER
Back Matter
Volume 34 contents.
Notre Dame J. Formal Logic 34 (4), 627-629, (Fall 1993) Open Access
No abstract available
DOWNLOAD PAPER
Miscellaneous back pages, Notre Dame Journal of Formal Logic, volume 34, issue 4 (1993)
Notre Dame J. Formal Logic 34 (4), (Fall 1993) Open Access
No abstract available
DOWNLOAD PAPER
Back to Top