On the incompleteness of a descending chain of extensions of implicational s5

Mathematical Logic Quarterly 38 (1):321-323 (1992)
  Copy   BIBTEX

Abstract

C5.ω is obtained by adding, schematically, to the strict-implicational fragment C5 of S5 the axiom → ) → . This paper presents a fully general proof that neither C5.ω nor any of a descending chain of its extensions is complete with respect to any class of frames, correcting the garbled details of a version skeched in an earlier paper , 201-208)

Categories

Keywords

Reprint years

DOI

10.1002/malq.19920380129

Links

PhilArchive



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

External links

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

Through your library

My notes

Similar books and articles

A Descending Chain of Incomplete Extensions of Implicational S 5.Dolph Ulrich - 1985 - Mathematical Logic Quarterly 31 (13):201-208.
Fromal statements of Godel's second incompleteness theorem.Harvey Friedman - manuscript
Heterologicality and Incompleteness.Cezary Cieśliński - 2002 - Mathematical Logic Quarterly 48 (1):105-110.
Strict Implication in A Sequence of Extensions of S4.Dolph Ulrich - 1981 - Mathematical Logic Quarterly 27 (13‐14):201-212.
Arithmetic and Logic Incompleteness: the Link.Laureano Luna & Alex Blum - 2008 - The Reasoner 2 (3):6.
The Surprise Examination Paradox and the Second Incompleteness Theorem.Shira Kritchman & Ran Raz - unknown
Incompleteness, complexity, randomness and beyond.Cristian S. Calude - 2002 - Minds and Machines 12 (4):503-517.
Substructural implicational logics including the relevant logic E.Ryo Kashima & Norihiro Kamide - 1999 - Studia Logica 63 (2):181-212.
Kripke incompleteness of predicate extensions of the modal logics axiomatized by a canonical formula for a frame with a nontrivial cluster.Tatsuya Shimura - 2000 - Studia Logica 65 (2):237-247.
Aspects of Incompleteness Vol. 10.P. Lindstrom - 2002
A Note on Boolos' Proof of the Incompleteness Theorem.Makoto Kikuchi - 1994 - Mathematical Logic Quarterly 40 (4):528-532.
Maximal chains in the fundamental order.Steven Buechler - 1986 - Journal of Symbolic Logic 51 (2):323-326.
Gödel's incompleteness theorems and computer science.Roman Murawski - 1997 - Foundations of Science 2 (1):123-135.
The incompleteness of theories of games.Marcelo Tsuji, Newton C. A. Costa & Francisco A. Doria - 1998 - Journal of Philosophical Logic 27 (6):553-568.
Recursion theory for metamathematics.Raymond Merrill Smullyan - 1993 - New York: Oxford University Press.

Analytics

Added to PP
2013-12-01

Downloads
15 (#923,100)

6 months
1 (#1,510,037)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

For Want of an ‘And’: A Puzzle about Non-Conservative Extension.Lloyd Humberstone - 2005 - History and Philosophy of Logic 26 (3):229-266.

Add more citations

References found in this work

No references found.

Add more references