Are There Undecidable Propositions?

David Booth and Renatus Ziegler
Additional contact information
David Booth: Three Fold Foundation 307
Renatus Ziegler: Mathematisch-Astronomische Sektion am Geotheanum

A chapter in Finsler Set Theory: Platonism and Circularity, 1996, pp 63-72 from Springer

Abstract: Abstract Approximately 18 years ago I showed that in formal systems of a general kind one can specify propositions which are not decidable by means of formal proofs within the systems themselves, but which nevertheless can be decided by virtue of their conceptual content (see Finsler [1926a]). A formal proof was considered to be admissible for the purpose of this argument only if its interpretation constituted a logically unobjectionable proof.

Date: 1996
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-0348-9031-1_6

Ordering information: This item can be ordered from
http://www.springer.com/9783034890311

DOI: 10.1007/978-3-0348-9031-1_6

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().