We consider certain predicative classes with respect to their bearing on set theory, namely on its semantics, and on its ontological power. On the one hand, our predicative classes will turn out to be perfectly suited for establishing a nice hierarchy of metalanguages starting from the usual set theoretical language. On the other hand, these classes will be seen to be fairly inappropriate for the formulation of strong principles of infinity. The motivation for considering this very type of classes is (...) a reasonable philosophy of set theory. Familiarity is assumed only with basic concepts of both set theory and its philosophy. (shrink)

Michael Friedman has recently argued that Carnap'sLogical Syntax of Language is fundamentally flawed in a way that reveals the ultimate failure of logical positivism. Friedman's argument depends crucially on two claims: (1) that Carnap was committed to the view that there is a universal metalanguage and (2) that given what Carnap wanted from a metalanguage, in particular given that he wanted a definition of analytic for an object language, he was in fact committed to a hierarchy of stronger and stronger (...) metalanguages. We argue that neither of these claims need be accepted. We show that there is no textual evidence for (1) and that if metalanguages are to be used for merely descriptive and not also justificatory purposes, Carnap does not need to define analyticity sufficiently for proving consistency, and so could have given a definition that does not entail a hierarchy of metalanguages. (shrink)

I survey some important semantical and axiomatic theories of self-referential truth. Kripke's fixed-point theory, the revision theory of truth and appraoches involving fuzzy logic are the main examples of semantical theories. I look at axiomatic theories devised by Cantini, Feferman, Freidman and Sheard. Finally some applications of the theory of self-referential truth are considered.

For first order languages with no individual constants, empty structures and truth values (for sentences) in them are defined. The first order theories of the empty structures and of all structures (the empty ones included) are axiomatized with modus ponens as the only rule of inference. Compactness is proved and decidability is discussed. Furthermore, some well known theorems of model theory are reconsidered under this new situation. Finally, a word is said on other approaches to the whole problem.

This article bears on four topics: observational predicates and phenomenal properties, vagueness, strict finitism as a philosophy of mathematics, and the analysis of feasible computability. It is argued that reactions to strict finitism point towards a semantics for vague predicates in the form of nonstandard models of weak arithmetical theories of the sort originally introduced to characterize the notion of feasibility as understood in computational complexity theory. The approach described eschews the use of nonclassical logic and related devices like degrees (...) of truth or supervaluation. Like epistemic approaches to vagueness, it may thus be smoothly integrated with the use of classical model theory as widely employed in natural language semantics. But unlike epistemicism, the described approach fails to imply either the existence of sharp boundaries or the failure of tolerance for soritical predicates. Applications ofmeasurement theory(in the sense of Krantz, Luce, Suppes, & Tversky (1971)) to vagueness in the nonstandard setting are also explored. (shrink)

Some axiomatic theories of truth and related subsystems of second-order arithmetic are surveyed and shown to be conservative over their respective base theory. In particular, it is shown by purely finitistically means that the theory PA ÷ "there is a satisfaction class" and the theory FS of [2] are conservative over PA.

We show that the following conjecture about the universe V of all sets is wrong: for all set-theoretical (i.e., first order) schemata true in V there is a transitive set "reflecting" in such a way that the second order statement corresponding to is true in . More generally, we indicate the ontological commitments of any theory that exploits reflection principles in order to yield large cardinals. The disappointing conclusion will be that our only apparently good arguments for the existence of (...) large cardinals have bad presuppositions. (shrink)