Presuppositional completeness

Studia Logica 48 (1):23 - 34 (1989)
  Copy   BIBTEX

Abstract

Some notions of the logic of questions (presupposition of a question, validation, entailment) are used for defining certain kinds of completeness of elementary theories. Presuppositional completeness, closely related to -completeness ([3], [6]), is shown to be fulfilled by strong elementary theories like Peano arithmetic.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,611

External links

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

Through your library

Analytics

Added to PP
2009-01-28

Downloads
29 (#555,479)

6 months
8 (#373,162)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Erotetic implications.Andrzej Wiśniewski - 1994 - Journal of Philosophical Logic 23 (2):173 - 195.
On the reducibility of questions.Andrzej Wiśniewski - 1994 - Erkenntnis 40 (2):265-284.

Add more citations

References found in this work

The logic of questions and answers.Nuel D. Belnap & Thomas B. Steel (eds.) - 1976 - New Haven/London: Yale University Press.
The incompleteness theorems.Craig Smorynski - 1977 - In Jon Barwise (ed.), Handbook of mathematical logic. New York: North-Holland. pp. 821 -- 865.

Add more references