In the early Analytic Philosophy, the concept of a pseudosentence was used as a polemical device. To try and formalize a sentence without success was a means to ›debunk‹ it as a pseudosentence. The classical example is Heidegger’s dictum of the nothing which noths. But, according to Carnap, not only did Carnap not understand what Heidegger said, but also Heidegger himself must have misunderstood his own utterances! Does Carnap's diagnosis remain intact if one admits the possibility of a misunderstanding and (...) misconstrual on Carnap’s side, too? Should not Carnap's concept of formalization be substituted by that of logico-hermeneutical reconstruction in order to obviate any such infelicities? In everyday communication, we very rarely ever feel the need to undertake a significant effort to understand each other. This attitude is at odds with Friedrich Schleiermacher’s view that misunderstandings are ubiquitous and that one has to actively invest into the establishment of correct understandings. Therefore, one should ask: Are there good reasons to reject the view that we misunderstand ourselves all the time? Or: Is there any worth in the view that misunderstandings are prevalent? The answers developed in this paper are generalized so that they apply to philosophical contexts and a maxim of escalating formalization is formulated. The debate about peer disagreement is adduced as an illustration of philosophical practices that evade the maxim and thus stagnate cognitively. (shrink)

The traditional use of the expression 'pseudoproblem' is analysed in order to clarify the talk of pseudoproblems and related phenomena. The goal is to produce a philosophically serviceable terminology that stays true to its historical roots. This explicative study is inspired by and makes use of the method of logical reconstruction. Since pseudoproblems are usually expressed by pseudoquestions a formal language of questions is presented as a possible reconstruction language for alleged pseudoproblems. The study yields an informal theory of pseudoproblems (...) whose presuppositions are critically investigated right away. At least one result remains: Claims of pseudoproblemship and their refutations must not be voiced casually - they are to be relativized and need substantial interpretive effort. (shrink)

Throughout this paper, we are trying to show how and why our Mathematical frame-work seems inappropriate to solve problems in Theory of Computation. More exactly, the concept of turning back in time in paradoxes causes inconsistency in modeling of the concept of Time in some semantic situations. As we see in the first chapter, by introducing a version of “Unexpected Hanging Paradox”,first we attempt to open a new explanation for some paradoxes. In the second step, by applying this paradox, it (...) is demonstrated that any formalized system for the Theory of Computation based on Classical Logic and Turing Model of Computation leads us to a contradiction. We conclude that our mathematical frame work is inappropriate for Theory of Computation. Furthermore, the result provides us a reason that many problems in Complexity Theory resist to be solved.(This work is completed in 2017 -5- 2, it is in vixra in 2017-5-14, presented in Unilog 2018, Vichy). (shrink)

The question of how to arrive at questions is ambiguous. I will concentrate on two readings: (i) How should one set up a formal syntax that accomodates questions? (ii) How does one, while working in a suitable formal language, arrive at a situation where one is allowed to or even must ask a certain question? In other words: How is the asking of questions regulated within a given formal language? I will propose an answer to question (i) and consider the (...) field of possibilities of answering (ii). (shrink)