A note concerning the notion of satisfiability
|Abstract||Tarski has shown how the argumentation of the liar paradox can be used to prove a theorem about truth in formalized languages. In this paper, it is shown how the paradox concerning the least undeﬁnable ordinal can be used to prove a no go-theorem concerning the notion of satisfaction in formalized languages. Also, the connection of this theorem with the absolute notion of deﬁnability is discussed.|
|Keywords||No keywords specified (fix it)|
|Categories||No categories specified (fix it)|
|External links||This entry has no external links. Add one.|
|Through your library||Only published papers are available at libraries|
Similar books and articles
Haim Judah & Saharon Shelah (1990). The Kunen-Miller Chart (Lebesgue Measure, the Baire Property, Laver Reals and Preservation Theorems for Forcing). Journal of Symbolic Logic 55 (3):909-927.
Katsuhiko Sano & Kentaro Sato (2007). Semantical Characterizations for Irreflexive and Generalized Modal Languages. Notre Dame Journal of Formal Logic 48 (2):205-228.
Paul Taylor (1996). Intuitionistic Sets and Ordinals. Journal of Symbolic Logic 61 (3):705-744.
Lionel Shapiro (2011). Expressibility and the Liar's Revenge. Australasian Journal of Philosophy 89 (2):297-314.
Andrzej W. Jankowski (1985). Galois Structures. Studia Logica 44 (2):109 - 124.
Adam Kolany (1993). Satisfiability on Hypergraphs. Studia Logica 52 (3):393 - 404.
Peter Milne (1999). Tarski, Truth and Model Theory. Proceedings of the Aristotelian Society 99 (2):141–167.
Andrea Cantini (1980). A Note on Three-Valued Logic and Tarski Theorem on Truth Definitions. Studia Logica 39 (4):405 - 414.
Sorry, there are not enough data points to plot this chart.
Added to index2009-05-06
Total downloads13 ( #87,816 of 548,984 )
Recent downloads (6 months)0
How can I increase my downloads?