In this paper I discuss Ernst Zermelo’s ideas concerning the possibility of developing a system of infinitary logic that, in his opinion, should be suitable for mathematical inferences. The presentation of Zermelo’s ideas is accompanied with some remarks concerning the development of infinitary logic. I also stress the fact that the second axiomatization of set theory provided by Zermelo in 1930 involved the use of extremal axioms of a very specific sort.1.

This book provides a detailed commentary on the classic monograph by Alfred Tarski, and offers a reinterpretation and retranslation of the work using the original Polish text and the English and German translations. In the original work, Tarski presents a method for constructing definitions of truth for classical, quantificational formal languages. Furthermore, using the defined notion of truth, he demonstrates that it is possible to provide intuitively adequate definitions of the semantic notions of definability and denotation and that the notion (...) in a structure can be defined in a way that is analogous to that used to define truth. Tarski’s piece is considered to be one of the major contributions to logic, semantics, and epistemology in the 20th century. However, the author points out that some mistakes were introduced into the text when it was translated into German in 1935. As the 1956 English version of the work was translated from the German text, those discrepancies were carried over in addition to new mistakes. The author has painstakingly compared the three texts, sentence-by-sentence, highlighting the inaccurate translations, offering explanations as to how they came about, and commenting on how they have influenced the content and suggesting a correct interpretation of certain passages. Furthermore, the author thoroughly examines Tarski’s article, offering interpretations and comments on the work. (shrink)

The thesis examines A.N. Whitehead and B. Russell’s Ramified Theory of Types. It consists of three parts. The first part is devoted to understanding the source of impredicativity implicit in the induction principle. The question I raise here is whether second-order explicit definitions are responsible for cases when impredicativity turns pathological. The second part considers the interplay between the vicious-circle principle and the no-class theory. The main goal is to give an explanation for the predicative restrictions entailed by the vicious-circle (...) principle. The explanation is that set-existence is parasitic upon prior predicative specifications. The justification for this claim is given by employing the method of hierarchy of languages. Supposing the natural number structure and the language of Peano Arithmetic as given, I describe the construction of a set-theoretic language equipped with substitutionally interpreted quantifiers ranging over arithmetically definable sets. The third part considers the proposition-theoretic version of Russell’s antinomy. A solution to this paradox is offered on the basis of the ramified hierarchy propositions. (shrink)

In this paper we develop an Ehrenfeucht‐Fraïssé game for. Unlike the standard Ehrenfeucht‐Fraïssé games which are modeled solely after the behavior of quantifiers, this new game also takes into account the behavior of connectives in logic. We prove the adequacy theorem for this game. We also apply the new game to prove complexity results about infinite binary strings.