In graph theoretic language, the degree of dissimilarity between these two sets is called the cuts cut A, B = ∑ u ∈ A, v ∈ B w u, v, (24).
In the next section, we will describe the two models we study, and then use them to introduce field theoretic language.
So one has to work a little to apply the 1933 definition to model-theoretic languages.
This volume contains the Proceedings of the Workshop on Type-Theoretic Languages: Proof Search and Semantics.
In 1956 he and his colleague Robert Vaught published a revision of one of the 1933 truth definitions, to serve as a truth definition for model-theoretic languages.
This conceptualization framework is represented in form of an ontology by means of a set-theoretic language.
We can thus take advantage of the simplicity of the set-theoretic language and of our familiarity with it (Myhill 1975).
This is, however, a huge restriction, given that when mathematics is actually applied, non-set-theoretic vocabulary, when translated into set-theoretic language, will have to appear in the comprehension axioms.
Goodman and Quine construct a theory of syntax for the set-theoretic language and a proof theory based on the Calculus of Individuals (see section 3.2 below) supplemented with a token-concatenation theory.
Second, several authors have responded to the Skolemite argument by directly criticizing the algebraic conception of set theory and defending more ordinary and intuitive understandings of set-theoretic language (Myhill 1967; Resnik 1969; Hart 1970; Benacerraf 1985).
Finally there's a purely philosophical question: what, if anything, does Skolem's Paradox tell us about our understanding of set theory and/or about the semantics of set-theoretic language?
