- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
Incompleteness theorem via weak definability of truth: a short proof
Notre Dame Journal of Formal Logic 14 (3):377-380 (1973)
Abstract
This article has no associated abstract. (fix it)Links
PhilArchive
External links
(no proxy)
Setup an account with your affiliations in order to access resources via your University's proxy server
Through your library
- Sign in / register and customize your OpenURL resolver
- Configure custom resolver
My notes
Similar books and articles
On Formalization of Model-Theoretic Proofs of Gödel's Theorems.Makoto Kikuchi & Kazuyuki Tanaka - 1994 - Notre Dame Journal of Formal Logic 35 (3):403-412.
An Incompleteness Theorem for Modal Relevant Logics.Shawn Standefer - 2021 - Notre Dame Journal of Formal Logic 62 (4):669 - 681.
An incompleteness theorem for conditional logic.Donald Nute - 1978 - Notre Dame Journal of Formal Logic 19 (4):634-636.
Incompleteness via simple sets.Erik Ellentuck - 1971 - Notre Dame Journal of Formal Logic 12 (2):255-256.
The Marker–Steinhorn Theorem via Definable Linear Orders.Erik Walsberg - 2019 - Notre Dame Journal of Formal Logic 60 (4):701-706.
Weak König's Lemma Implies Brouwer's Fan Theorem: A Direct Proof.Hajime Ishihara - 2006 - Notre Dame Journal of Formal Logic 47 (2):249-252.
A proof of the Löwenheim-Skolem theorem.George S. Boolos - 1970 - Notre Dame Journal of Formal Logic 11 (1):76-78.
A proof of a theorem of Ł ukasiewicz.Ivo Thomas - 1971 - Notre Dame Journal of Formal Logic 12 (4):507-508.
A new proof of the compactness theorem for propositional logic.Robert H. Cowen - 1970 - Notre Dame Journal of Formal Logic 11 (1):79-80.
A simple proof of Herbrand's theorem.Andrés R. Raggio - 1974 - Notre Dame Journal of Formal Logic 15 (3):487-488.
Analytics
Added to PP
2010-08-24
Downloads
26 (#145,883)
6 months
13 (#1,035,185)
2010-08-24
Downloads
26 (#145,883)
6 months
13 (#1,035,185)
Historical graph of downloads
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-68866f4b87-tsllw uwo