Applications of strict π11 predicates to infinitary logic

Journal of Symbolic Logic 34 (3):409 - 423 (1969)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,386

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Game logic and its applications I.Mamoru Kaneko & Takashi Nagashima - 1996 - Studia Logica 57 (2-3):325 - 354.
Presburger arithmetic with unary predicates is Π11 complete.Joseph Y. Halpern - 1991 - Journal of Symbolic Logic 56 (2):637 - 642.
Infinitary logic and admissible sets.Jon Barwise - 1969 - Journal of Symbolic Logic 34 (2):226-252.
Tolerant, Classical, Strict.Pablo Cobreros, Paul Egré, David Ripley & Robert van Rooij - 2012 - Journal of Philosophical Logic 41 (2):347-385.
The lazy logic of partial terms.Raymond D. Gumb - 2002 - Journal of Symbolic Logic 67 (3):1065-1077.

Analytics

Added to PP
2009-01-28

Downloads
56 (#279,626)

6 months
9 (#290,637)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Barwise: Infinitary logic and admissible sets.H. Jerome Keisler & Julia F. Knight - 2004 - Bulletin of Symbolic Logic 10 (1):4-36.
Σ1-well-founded compactness.Nigel Cutland & Matt Kauffmann - 1980 - Annals of Mathematical Logic 18 (3):271-296.
The Metamathematics of Infinitary Set Theoretical Systems.Klaus Gloede - 1976 - Mathematical Logic Quarterly 23 (1‐6):19-44.
Partially ordered connectives and monadic monotone strict np.Lauri Hella, Merlijn Sevenster & Tero Tulenheimo - 2008 - Journal of Logic, Language and Information 17 (3):323-344.

Add more citations

References found in this work

Elements of Mathematical Logic.C. C. Chang - 1969 - Journal of Symbolic Logic 34 (1):112-112.

Add more references