Formal definitions can be evaluated as true or false based on adequacy and extension.
the verdict
INSUFFICIENT LEANING
refutedsupported
the weight of evidence
2 sources for · 0 against
AS REPORTEDno primary record reached; this is what the reporting says
Retrieved reference materials touch upon material adequacy and formal correctness in semantic and revision theories of definition, but do not provide complete coverage demonstrating that formal definitions are evaluated as true or false based exclusively on adequacy and extension.
requires evaluating the material adequacy of the definition. Some circular definitions will be good analyses, while some will not. Either way, formal correctness
Revision theory is a subfield of philosophical logic. It consists of a general theory of definitions, including (but not limited to) circular and interdependent concepts. A circular definition is one in which the concept being defined occurs in the statement defining it—for example, defining a G as being blue and to the left of a G. Revision theory provides formal semantics for defined expressions
The liar sentence is not true.
On the assumption that the liar is true, one can show that it is false, and on the assumption that it is false, one can show that it is true. This instability is reflected in revision sequences for the liar.
The generalization to circular definitions was developed by Gupta, in collaboration with Belnap. Their book, The Revision Theory of Truth, presents an in-depth development of the theory of circular definitions, as well as an overview and critical discussion of philosophical views on truth and the relation between truth and definition.
As can be seen in the table,
a
{\displaystyle a}
goes in and out of the extension of
G
{\displaystyle G}
. It never stabilizes. On the other hand,
b
{\displaystyle b}
either stays in or stays out. It is stable, but whether it is stably true or stably false depends on the initial hypothesis.
Next, let
D
2
{\displaystyle {\mathcal {D}}_{2}}
be
H
x
=
D
f
H
x
∨
∼
H
x
.
{\displaystyle Hx=_{Df}Hx\lor \sim Hx.}
As shown in the following table, all hypotheses for the ground model of the previous example are revised to the set {a, b} .
nguages. This entry will simply review the definitions and make no
attempt to explore the implications of Tarski’s work for
semantics (natural language or programming languages) or for the
philosophical study of truth. (For those implications, see the entries
on
truth
and
Alfred Tarski .)
1. The 1933 programme and the semantic conception
1.1 Object language and metalanguage
1.2 Formal correctness
1.3 Material adequacy
2. Some kinds of truth definition on the 1933 pattern
2.1 The standard truth definitions
2.2 The truth definition by quantifier elimination
3. The 1956 definition and its offspring
Bibliography
Academic Tools
Other Internet Resources
Related Entries
1. The 1933 programme and the semantic conception
In the late 1920s Alfred Tarski embarked on a project to give rigorous
definitions for notions useful in scientific methodology. In 1933 he
published (in Polish) his analysis of the notion of a true sentence.
This long paper undertook two tasks: first to say what should count as
a satisfactory definition of ‘true sentence’ for a given
formal language, and second to show that there do exist satisfactory
definitions of ‘true sentence’ for a range of formal
languages. We begin with the first task; Section 2 will consider the
second.
We say that a language is fully interpreted if all its
sentences have meanings that make them either true or false. All the
languages that Tarski considered in the 1933 paper were fully
interpreted, with one exception described in Section 2.2 below. This
was the main difference between the 1933 definition and the later
model-theoretic definition of 1956, which we shall examine in Section
3.
Tarski described several conditions that a satisfactory definition of
truth should meet.
1.1 Object language and metalanguage
If the language under discussion (the object language ) is
\(L\), then the definition should be given in another language known
as the metalanguage , call it \(M\). The metalanguage should
con
Everything we examined (2)
This check searched the claim as stated. It did not run a separate search for evidence against it.