Logic and Philosophy of Logic, Misc

The Bulletin of Symbolic Logic, Volume 20, Issue 3, Page 411-416, SEPTEMBER 2014.

After a brief survey of the different meanings of consistency, the study is restricted to consistency understood as non-contradiction of sets of sentences. The philosophical reasons for this requirement are discussed, both in relation to the problem of sense and the problem of truth. The issue of mathematical truth is then addressed, and the different conceptions of it are put in relation with consistency. The formal treatment of consistency and truth in mathematical logic is then considered, with particular attention paid (...) to the relation between syntactic and semantic properties of sets and calculi. After the crisis of mathematical intuition and the dominance of the formalistic view, it seemed that consistency could totally replace the requirement of truth in mathematics, also in the sense that the existence of "objects" of axiomatic systems could be granted by their consistency. A rejection of this claim is presented, whose central point is a detailed analysis of the theorem that any consistent set S of sentences of first order logic has a model. A critical scrutiny shows that this model is very peculiar, being offered by the elements of the same language that is being interpreted, and the satisfiability conditions for any sentence being constituted by the mere fact of belonging to S. Though not being insignificant from a metatheoretical point of view, this theorem fails to endow consistency with an "ontological creativity", that is, with the capability of providing a model ontologically distinct from the language itself. A final discussion regarding the different "ontological regions" and the referential nature of truth clarifies the different aspects of the whole issue discussed. (shrink)

There is significant interest in type-free systems that allow flexible self-application. Such systems are of interest in property theory, natural language semantics, the theory of truth, theoretical computer science, the theory of classes, and category theory. While there are a variety of proposed type-free systems, there is a particularly natural type-free system that we believe is prototypical: the logic of recursive algorithms. Algorithmic logic is the study of basic statements concerning algorithms and the algorithmic rules of inference between such statements. (...) As shown in [1], the threat of paradoxes, such as the Curry paradox, requires care in implementing rules of inference in this context. As in any type-free logic, some traditional rules will fail. The first part of the paper develops a rich collection of inference rules that do not lead to paradox. The second part identifies traditional rules of logic that are paradoxical in algorithmic logic, and so should be viewed with suspicion in type-free logic generally. (shrink)