Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
T-schema
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
==Natural languages== [[Joseph Heath]] points out that "the analysis of the [[truth predicate]] provided by Tarski's Schema T is not capable of handling all occurrences of the truth predicate in natural language. In particular, Schema T treats only "freestanding" uses of the predicate—cases when it is applied to complete sentences."<ref name=Heath2001>{{cite book |last=Heath |first=Joseph |year=2001 |title=Communicative action and rational choice |publisher=MIT Press |isbn=978-0-262-08291-4 |page=186 |url=https://books.google.com/books?id=3i-QXQQOfZQC&pg=PA186}}</ref> He gives as an "obvious problem" the sentence: * Everything that Bill believes is true. Heath argues that analyzing this sentence using T-schema generates the [[sentence fragment]]—"everything that Bill believes"—on the righthand side of the [[biconditional|logical biconditional]].
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)