Presuppositional completeness

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

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.
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.1007/BF00370631
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

Our Archive

Upload a copy of this paper     Check publisher's policy     Papers currently archived: 47,201
External links

Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library

References found in this work BETA

The Incompleteness Theorems.Craig Smorynski - 1977 - In Jon Barwise (ed.), Handbook of Mathematical Logic. North-Holland. pp. 821 -- 865.

Add more references

Citations of this work BETA

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

Similar books and articles


Added to PP index

Total views
17 ( #541,163 of 2,289,674 )

Recent downloads (6 months)
1 ( #839,123 of 2,289,674 )

How can I increase my downloads?


My notes

Sign in to use this feature