Near coherence of filters. III. A simplified consistency proof

Notre Dame Journal of Formal Logic 30 (4):530-538 (1989)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



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

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

Near coherence of filters. I. Cofinal equivalence of models of arithmetic.Andreas Blass - 1986 - Notre Dame Journal of Formal Logic 27 (4):579-591.
Countable filters on ω.Otmar Spinas - 1999 - Journal of Symbolic Logic 64 (2):469-478.
Infinitary combinatorics and modal logic.Andreas Blass - 1990 - Journal of Symbolic Logic 55 (2):761-778.
Independence results.Saharon Shelah - 1980 - Journal of Symbolic Logic 45 (3):563-573.
A Simple Proof that Super-Consistency Implies Cut Elimination.Gilles Dowek & Olivier Hermant - 2012 - Notre Dame Journal of Formal Logic 53 (4):439-456.
Inconsistency: The coherence theorist’s nemesis?Mylan Engel - 1991 - Grazer Philosophische Studien 40 (1):113-130.
Leibniz filters revisited.Ramon Jansana - 2003 - Studia Logica 75 (3):305 - 317.
More on Regular Reduced Products.Juliette Cara Kennedy & Saharon Shelah - 2004 - Journal of Symbolic Logic 69 (4):1261 - 1266.
De finetti, countable additivity, consistency and coherence.Colin Howson - 2008 - British Journal for the Philosophy of Science 59 (1):1-23.
On uniqueness of prime models.Saharon Shelah - 1979 - Journal of Symbolic Logic 44 (2):215-220.

Analytics

Added to PP
2010-08-24

Downloads
19 (#797,374)

6 months
5 (#632,816)

Historical graph of downloads
How can I increase my downloads?

References found in this work

No references found.

Add more references