Emile Borel regards the Banach-Tarski Paradox as a reductio ad absurdum of the Axiom of Choice. Peter Forrest instead blames the assumption that physical space has a similar structure as the real numbers. This paper argues that Banach and Tarski's result is not paradoxical and that it merely illustrates a surprising feature of the continuum: dividing a spatial region into disjoint pieces need not preserve volume.

Consider the regularity thesis that each possible event has non-zero probability. Hájek challenges this in two ways: there can be nonmeasurable events that have no probability at all and on a large enough sample space, some probabilities will have to be zero. But arguments for the existence of nonmeasurable events depend on the axiom of choice. We shall show that the existence of anything like regular probabilities is by itself enough to imply a weak version of AC sufficient to prove (...) the Banach–Tarski Paradox on the decomposition of a ball into two equally sized balls, and hence to show the existence of nonmeasurable events. This provides a powerful argument against unrestricted orthodox Bayesianism that works even without AC. A corollary of our formal result is that if every partial order extends to a total preorder while maintaining strict comparisons, then the Banach–Tarski Paradox holds. This yields an argument that incommensurability cannot be avoided in ambitious versions of decision theory. (shrink)

In 1924 Banach and Tarski demonstrated the existence of a paradoxical decomposition of the 3-ball B, i.e., a piecewise isometry from B onto two copies of B. This article answers a question of de Groot from 1958 by showing that there is a paradoxical decomposition of B in which the pieces move continuously while remaining disjoint to yield two copies of B. More generally, we show that if n ≥ 2, any two bounded sets in.

Alfred Tarski was one of the greatest logicians of the twentieth century. His influence comes not merely through his own work but from the legion of students who pursued his projects, both in Poland and Berkeley. This chapter focuses on three key areas of Tarski's research, beginning with his groundbreaking studies of the concept of truth. Tarski's work led to the creation of the area of mathematical logic known as model theory and prefigured semantic approaches in the (...) philosophy of language and philosophical logic, such as Kripke's possible worlds semantics for modal logic. We also examine the paradoxical decomposition of the sphere known as the Banach–Tarski paradox. Finally we examine Tarski's work on decidable and undecidable theories, which he carried out in collaboration with students such as Mostowski, Presburger, Robinson and others. (shrink)

It is tempting to think that a process of choosing a point at random from the surface of a sphere can be probabilistically symmetric, in the sense that any two regions of the sphere which differ by a rotation are equally likely to include the chosen point. Isaacs, Hájek, and Hawthorne (2022) argue from such symmetry principles and the mathematical paradoxes of measure to the existence of imprecise chances and the rationality of imprecise credences. Williamson (2007) has argued from a (...) related symmetry principle to the failure of probabilistic regularity. We contend that these arguments fail, because they rely on auxiliary assumptions about probability which are inconsistent with symmetry to begin with. We argue, moreover, that symmetry should be rejected in light of this inconsistency, and because it has implausible decision- theoretic implications. -/- The weaker principle of probabilistic invariance says that the probabilistic comparison of any two regions is unchanged by rotations of the sphere. This principle supports a more compelling argument for imprecise probability. We show, however, that invariance is incompatible with mundane judgments about what is probable. Ultimately, we find reason to be suspicious of the application of principles like symmetry and invariance to nonmeasurable regions. (shrink)

The conflict between Platonic realism and Constructivism marks a watershed in philosophy of mathematics. Among other things, the controversy over the Axiom of Choice is typical of the conflict. Platonists accept the Axiom of Choice, which allows a set consisting of the members resulting from infinitely many arbitrary choices, while Constructivists reject the Axiom of Choice and confine themselves to sets consisting of effectively specifiable members. Indeed there are seemingly unpleasant consequences of the Axiom of Choice. The non-constructive nature of (...) the Axiom of Choice leads to the existence of non-Lebesgue measurable sets, which in turn yields the Banach-Tarski Paradox. But the Banach-Tarski Paradox is so called in the sense that it is a counter-intuitive theorem. To corroborate my view that mathematical truths are of non-constructive nature, I shall draw upon Gödel’s Incompleteness Theorems. This also shows the limitations inherent in formal methods. Indeed the Löwenheim-Skolem Theorem and the Skolem Paradox seem to pose a threat to Platonists. In this light, Quine/Putnam’s arguments come to take on a clear meaning. According to the model-theoretic arguments, the Axiom of Choice depends for its truth-value upon the model in which it is placed. In my view, however, this is another limitation inherent in formal methods, not a defect for Platonists. To see this, we shall examine how mathematical models have been developed in the actual practice of mathematics. I argue that most mathematicians accept the Axiom of Choice because the existence of non-Lebesgue measurable sets and the Well-Ordering of reals open the possibility of more fruitful mathematics. Finally, after responding to Benacerraf’s challenge to Platonism, I conclude that in mathematics, as distinct from natural sciences, there is a close connection between essence and existence. Actual mathematical theories are the parts of the maximally logically consistent theory that describes mathematical reality. (shrink)

A famous result of Hausdorff states that a sphere with countably many points removed can be partitioned into three pieces A, B, C such that A is congruent to B, B is congruent to C, and A is congruent to B ∪ C; this result was the precursor of the Banach–Tarski paradox. Later, R. Robinson characterized the systems of congruences like this which could be realized by partitions of the sphere with rotations witnessing the congruences. The pieces (...) involved were nonmeasurable. In the present paper, we consider the problem of which systems of congruences can be satisfied using open subsets of the sphere ; of course, these open sets cannot form a partition of the sphere, but they can be required to cover "most of" the sphere in the sense that their union is dense. Various versions of the problem arise, depending on whether one uses all isometries of the sphere or restricts oneself to a free group of rotations, or whether one omits the requirement that the open sets have dense union, and so on. While some cases of these problems are solved by simple geometrical dissections, others involve complicated iterative constructions and/or results from the theory of free groups. Many interesting questions remain open. (shrink)

Hausdorff's paradoxical decomposition of a sphere with countably many points removed actually produced a partition of this set into three pieces A,B,C such that A is congruent to B, B is congruent to C, and A is congruent to B ∪ C. While refining the Banach–Tarski paradox, R. Robinson characterized the systems of congruences like this which could be realized by partitions of the sphere with rotations witnessing the congruences: the only nontrivial restriction is that the system (...) should not require any set to be congruent to its complement. Later, J. F. Adams showed that this restriction can be removed if one allows arbitrary isometries of the sphere to witness the congruences. The purpose of this paper is to characterize those systems of congruences which can be satisfied by partitions of the sphere or related spaces into sets with the property of Baire. A paper of Dougherty and Foreman gives a proof that the Banach–Tarski paradox can be achieved using such sets, and gives versions of this result using open sets and related results about partitions of spaces into congruent sets. The same method is used here; it turns out that only one additional restriction on a system of congruences is needed to make it solvable using subsets of the sphere with the property of Baire with free rotations witnessing the congruences. Actually, the result applies to any complete metric space acted on in a sufficiently free way by a free group of homeomorphisms. We also characterize the systems solvable on the sphere using sets with the property of Baire but allowing all isometries. (shrink)

Neuroscientists are able to detect physical changes in information entropy in the available neurodata. However, the information paradigm is inadequate to describe fully nervous dynamics and mental activities such as perception. This paper suggests explanations to neural dynamics that provide an alternative to thermodynamic and information accounts. We recall the Banach–Tarski paradox, which informally states that when pieces of a ball are moved and rotated without changing their shape, a synergy between two balls of the same volume (...) is achieved instead of the original one. We show how and why BTP might display this physical and biological synergy meaningfully, making it possible to model nervous activities. The anatomical and functional structure of the central nervous system’s nodes and edges makes it possible to perform a sequence of moves inside the connectome that doubles the amount of available cortical oscillations. In particular, a BTP-based mechanism permits scale-invariant nervous oscillations to amplify and propagate towards widely separated brain areas. Paraphrasing the BTP’s definition, we could state that: when a few components of a self-similar nervous oscillation are moved and rotated throughout the cortical connectome, two self-similar oscillations are achieved instead of the original one. Furthermore, based on topological structures, we illustrate how, counterintuitively, the amplification of scale-free oscillations does not require information transfer. (shrink)

Sur la décomposition des ensembles de points en parties respectivement congruentes.

Popper functions allow one to take conditional probabilities as primitive instead of deriving them from unconditional probabilities via the ratio formula P=P/P. A major advantage of this approach is it allows one to condition on events of zero probability. I will show that under plausible symmetry conditions, Popper functions often fail to do what they were supposed to do. For instance, suppose we want to define the Popper function for an isometrically invariant case in two dimensions and hence require the (...) Popper function to be rotationally invariant and defined on pairs of sets from some algebra that contains at least all countable subsets. Then it turns out that the Popper function trivializes for all finite sets: P=1 for all A ) if B is finite. Likewise, Popper functions invariant under all sequence reflections can’t be defined in a way that models a bidirectionally infinite sequence of independent coin tosses. (shrink)

Tarski's theorem essentially says that the Liar paradox is paradoxical in the minimal reflexive frame. We generalise this result to the Liar-like paradox $\lambda^\alpha$ for all ordinal $\alpha\geq 1$. The main result is that for any positive integer $n = 2^i(2j+1)$, the paradox $\lambda^n$ is paradoxical in a frame iff this frame contains at least a cycle the depth of which is not divisible by $2^{i+1}$; and for any ordinal $\alpha \geq \omega$, the paradox $\lambda^\alpha$ (...) is paradoxical in a frame iff this frame contains at least an infinite walk which has an arbitrarily large depth. We thus get that $\lambda^n$ has a degree of paradoxicality no more than $\lambda^m$ iff the multiplicity of 2 in the (unique) prime factorisation of $n$ is no more than that in the prime factorisation of $m$; and all tranfinite $\lambda^\alpha$ has the same degree of paradoxcality but has a higher degree of paradoxicality than any $\lambda^n$. (shrink)

Great intuitions are fundamental to conjecture and discovery in mathematics. In this paper, we investigate the role that intuition plays in mathematical thinking. We review key events in the history of mathematics where paradoxes have emerged from mathematicians' most intuitive concepts and convictions, and where the resulting difficulties led to heated controversies and debates. Examples are drawn from Riemannian geometry, set theory and the analytic theory of the continuum, and include the Continuum Hypothesis, the Tarski-Banach Paradox, and (...) several works by Gödel, Cantor, Wittgenstein and Weierstrass. We examine several fallacies of intuition and determine how far our intuitive conjectures are limited by the nature of our sense-experience, and by our capacities for conceptualization. Finally, I suggest how we can use visual and formal heuristics to cultivate our mathematical intuitions and how the breadth of this new epistemic perspective can be useful in cases where intuition has traditionally been regarded as out of its depth. (shrink)

A.1. Some philosophers, including Tarski and Russell, have concluded from a study of various versions of the Liar Paradox ‘that there must be a hierarchy of languages, and that the words “true” and “false”, as applied to statements in any given language, are themselves words belonging to a language of higher order’. In his famous essay on truth Tarski claimed that ‘colloquial’ language is inconsistent as a result of its property of ‘universality’: that is, whatever can be (...) said at all can in principle be said in it, with an extended vocabularly if necessary. Thus, in English we can talk about English expressions, what they denote, what they say, whether what they say is true or false, and so on: English contains its own metalanguage. This universality enables us to construct sentences which say of themselves that they are false, and by applying the law of excluded middle to them we easily derive a contradiction. Tarski concludes that ‘these antinomies seem to provide a proof that every language which is universal in the above sense, and for which the normal laws of logic hold, must be inconsistent’ . He then proposes to avoid such contradictions by the use of a hierarchy of languages such that statements about any one language can be made only in a different language at a higher level. (shrink)

Tarski's hierarchical solution to the Liar paradox is widely viewed as ad hoc. In this paper I show that, on the contrary, Tarski's solution is justified by a sound philosophical principle that concerns the inner structure of truth. This principle provides a common philosophical basis to a number of solutions to the Liar paradox, including Tarski's and Kripke's. Tarski himself may not have been aware of this principle, but by providing a philosophical basis to (...) his hierarchical solution to the paradox, it undermines the ad-hocness objection to this solution. Indeed, it contributes to the defense of Tarski's theory against other objections as well. (shrink)

Alfred Tarski’s work on truth has played such a central role in the discourse on truth that most coming to it for the first time have probably already heard a great deal about what is said there. Unfortunately, since the work is largely technical and Tarski was only tan- gentially philosophical, a certain incautious assimilation dominates many philosophical discussions of Tarski’s ideas, and so, examining Tarski on the concept of truth is in many ways an act (...) of unlearning. -/- In this paper I focus on those key ideas in Tarski’s work that have made a lasting impact on the philosophical discourse. These are the notions of T-sentence, Convention T, Tarskian truth definition, and Tarski’s general limiting theses on the expressibility and definability of truth. Though these ideas are in name familiar, we will seek in this essay to uncover and remove certain widespread misunderstandings of each. Tarski’s name also features prominently in discussions of the liar paradox, so we will take time out to explain Tarski’s connection to this ancient puzzle. (shrink)

Tarski's argumentative use of the liar paradox is well-known, but officially it is the Grelling paradox that has final pride of place in Tarski's argument, not the Liar at all. Tarski explicitly gives argumentation that adverts to the liar argument, but it is an alternative argument—one he only hints at and which adverts to the Grelling—which he says has the advantage of removing any empirical element. In this paper, we will examine how the Grelling might (...) be used in place of the Liar in Tarski's argument for his exact indefinability thesis, and assess in what way the difference might be significant. If successful, Tarski's use of the Grelling puts pressure on how Convention T can be justified. (shrink)

This chapter contains sections titled: Tarski's Theory of Truth Tarski's Solution to the Liar Paradox Tarski's Method of Defining Truth for Formalized Languages Tarskian Semantics Three Criticisms of Tarski's Theory Kripke's Solution to the Liar Paradox A Reinterpretation of Tarski's Theory Truth Beyond Logic.

This chapter contrasts Alfred Tarski's compositional conception (whereby the truth-values of sentences are explained in terms of the referential characteristics of their component words) unfavorably with minimalism (which relies merely on the schema, ‘(p) is true ↔ p’). First, it argues against Tarski that his approach is: (i) misdirected, insofar as it doesn't elucidate our actual concept of truth, which applies to propositions rather than sentences; (ii) ill-motivated, insofar as it reflects an insistence on explicit definitions; (iii) not (...) generally workable, insofar as those definitions cannot devised for all the multifarious constructions that occur in natural languages; and (iv) pointless, insofar as it addresses no question worth answering. Second, it is shown that minimalism can be the basis for a superior treatment of the liar paradoxes. And, finally, a response is developed to the claim (Tarski, Gupta, Soames, Halbach) that Tarski-style compositional definitions are needed in order to accommodate generalizations about truth (e.g., that all instances of ‘p→p’ are true). (shrink)

Tarski’s Convention T is often taken to claim that it is both sufficient and necessary for adequacy in a definition of truth that it imply instances of the T-schema where the embedded sentence translates the mentioned sentence. However, arguments against the necessity claim have recently appeared, and, furthermore, the necessity claim is actually not required for the indefinability results for which Tarski is justly famous; indeed, Tarski’s own presentation of the results in the later Undecidable Theories makes (...) no mention of an assumption to the effect that the definition of truth implies the biconditionals. This raises a question: was Tarski in fact committed to the necessity claim in the important papers of the 1930s and 40s? I argue that he was not. The discussion of this apparently esoteric interpretive issue in fact gets to the heart of many important questions about truth, and in the final sections of the paper I discuss the importance of the T-biconditionals in the theory of meaning and the relation of deflationary and inflationary theories of truth to the semantic paradoxes. (shrink)

This study looks to the work of Tarski's mentors Stanislaw Lesniewski and Tadeusz Kotarbinski, and reconsiders all of the major issues in Tarski scholarship in light of the conception of Intuitionistic Formalism developed: semantics, truth, paradox, logical consequence.

Tarski’s assessment that natural language is inconsistent on account of the Liar Paradox is shown to be incorrect: what Tarski’s theorem in fact shows is that Truth is not a property of sentences but of propositions. By using propositions rather than sentences as the bearers of Truth, semantic closure within the same language is easily obtained. Tarski’s contrary assessment was partly based on confusions about propositions and their grammatical expression. But more centrally it arose through blindness (...) to pragmatic factors in language — a blindness that was common in his time, and it has continued to the present day, in discussions of ‘Open Pairs’, and Yablo-type paradoxes, for instance. For completeness, it is also shown that the Fixed Point Theorem does not apply to propositions, because of categorical differences between sentences and propositions — also predicates and properties. (shrink)

The fact that Gödel's famous incompleteness theorem and the archetype of all logical paradoxes, that of the Liar, are related closely is, of course, not only well known, but is a part of the common knowledge of the community of logicians. Indeed, almost every more or less formal treatment of the theorem makes a reference to this connection. Gödel himself remarked in the paper announcing his celebrated result :The analogy between this result and Richard's antinomy leaps to the eye;there is (...) also a close relationship with the ‘liar’ antinomy, since … we are… confronted with a proposition which asserts its own unprovability.In the light of the fact that the existence of this connection is commonplace it is all the more surprising that very little can be learnt about its exact nature except perhaps that it is some kind of similarity or analogy. There is, however, a lot more to it than that. Indeed, as we shall try to show below, the general ideas underlying the three central theorems concerning internal limitations of formal deductive systems can be taken as different ways to resolve the Liar paradox. More precisely, it will turn out that an abstract formal variant of the Liar paradox, which can almost straightforwardly inferred from its original ordinary language version, is a possible common generalization of Gödel's incompleteness theorem, the theorem of Tarski on the undefinability of truth, and that of Church concerning the undecidability of provability. (shrink)

The Pinocchio paradox, devised by Veronique Eldridge-Smith in February 2001, is a counter-example to solutions to the Liar that restrict the use or definition of semantic predicates. Pinocchio’s nose grows if and only if what he is stating is false, and Pinocchio says ‘My nose is growing’. In this statement, ‘is growing’ has its normal meaning and is not a semantic predicate. If Pinocchio’s nose is growing it is because he is saying something false; otherwise, it is not growing. (...) ‘Because’ stands here for a non-semantic relation; it might be supposed to be causal or of some other nature, but it is not semantic. The paradox is discussed in relation to Tarski’s and Kripke’s theories of truth. Although the paradox is not necessarily a counter-example to a theory of a truth predicate, it is a problem for a theory of truth of the kind preserved by validity. (shrink)

This book aims to provide a solution to the semantic paradoxes. It argues for a unified solution to the paradoxes generated by our concepts of denotation, predicate extension, and truth. The solution makes two main claims. The first is that our semantic expressions 'denotes', 'extension' and 'true' are context-sensitive. The second, inspired by a brief, tantalizing remark of Godel's, is that these expressions are significant everywhere except for certain singularities, in analogy with division by zero. A formal theory of singularities (...) is presented and applied to a wide variety of versions of the definability paradoxes, Russell's paradox, and the Liar paradox. Keith Simmons argues that the singularity theory satisfies the following desiderata: it recognizes that the proper setting of the semantic paradoxes is natural language, not regimented formal languages; it minimizes any revision to our semantic concepts; it respects as far as possible Tarski's intuition that natural languages are universal; it responds adequately to the threat of revenge paradoxes; and it preserves classical logic and semantics. Simmons draws out the consequences of the singularity theory for deflationary views of our semantic concepts, and concludes that if we accept the singularity theory, we must reject deflationism. (shrink)

This paper is a contribution to the reconstruction of Tarski’s semantic background in the light of the ideas of his master, Stanislaw Lesniewski. Although in his 1933 monograph Tarski credits Lesniewski with crucial negative results on the semantics of natural language, the conceptual relationship between the two logicians has never been investigated in a thorough manner. This paper shows that it was not Tarski, but Lesniewski who first avowed the impossibility of giving a satisfactory theory of truth (...) for ordinary language, and the necessity of sanitation of the latter for scientific purposes. In an early article (1913) Lesniewski gave an interesting solution to the Liar Paradox, which, although different from Tarski’s in detail, is nevertheless important to Tarski’s semantic background. To illustrate this I give an analysis of Lesniewski’s solution and of some related aspects of Lesniewski’s later thought. (shrink)

In the early 20th century, scepticism was common among philosophers about the very meaningfulness of the notion of truth – and of the related notions of denotation, definition etc. (i.e., what Tarski called semantical concepts). Awareness was growing of the various logical paradoxes and anomalies arising from these concepts. In addition, more philosophical reasons were being given for this aversion.1 The atmosphere changed dramatically with Alfred Tarski’s path-breaking contribution. What Tarski did was to show that, assuming that (...) the syntax of the object language is specified exactly enough, and that the metatheory has a certain amount of set theoretic power,2 one can explicitly define truth in the object language. And what can be explicitly defined can be eliminated. It follows that the defined concept cannot give rise to any inconsistencies (that is, paradoxes). This gave new respectability to the concept of truth and related notions. Nevertheless, philosophers’ judgements on the nature and philosophical relevance of Tarski’s work have varied. It is my aim here to review and evaluate some threads in this debate. (shrink)

The author considers following question: is a consistent semantically closed language possible? The negative answer is the orthodox answer in the logic of the 20th century. It was presented in Russell's theory of types and Tarski's semantic theory of metalanguages. Nevertheless, contemporary logicians and philosophers of language return to this problem time and again, pointing to its relevance in various aspects. In particular, it is asserted that semantically closed language is a very important tool for expressing logical and philosophical (...) ideas. In logic of the 20th century, the problem of semantically closed language was discussed in connection with the problem of logical paradoxes. Russell and Tarski saw a fundamental cause of paradoxes in the phenomenon of self-reference that arises in semantically closed language. Accordingly, a solution for paradoxes was seen in eliminating the cause, that is, in prohibiting semantically closed language by means of a hierarchy of logical types of classes (Russell) or a hierarchy of metalanguages (Tarski). However, some contemporary logicians criticize the hierarchical approach, whose main argument consists in asserting that the approach was wrong in its diagnosis of the cause of paradoxes. This author does not try to correct the diagnostics of the hierarchical approach by identifying another cause of paradoxes. Instead, the author recognizes that a general solution of the problem of paradoxes cannot be given, a priori, by eliminating what fundamentally generates them. In this article, a new “ad hoc solution" of the problem is offered that rests upon an empirical method of identifying and eliminating paradoxes. A specific characteristic of the method is admitting the existence of consistent semantically closed language. (shrink)

We introduce a variant of pointer structures with denotational semantics and show its equivalence to systems of boolean equations: both have the same solutions. Taking paradoxes to be statements represented by systems of equations (or pointer structures) having no solutions, we thus obtain two alternative means of deciding paradoxical character of statements, one of which is the standard theory of solving boolean equations. To analyze more adequately statements involving semantic predicates, we extend propositional logic with the assertion operator and give (...) its complete axiomatization. This logic is a sub-logic of statements in which the semantic predicates become internalized (for instance, counterparts of Tarski’s definitions and T-schemata become tautologies). Examples of analysis of self-referential paradoxes are given and the approach is compared to the alternative ones. (shrink)

Tarski avoids the liar paradox by relativizing truth and falsehood to particular languages and forbidding the predication to sentences in a language of truth or falsehood by any sentences belonging to the same language. The Tarski truth-schemata stratify an object-language and indefinitely ascending hierarchy of meta-languages in which the truth or falsehood of sentences in a language can only be asserted or denied in a higher-order meta-language. However, Tarski’s statement of the truth-schemata themselves involve general truth (...) functions, and in particular the biconditional, defined in terms of truth conditions involving truth values standardly displayed in a truth table. Consistently with his semantic program, all such truth values should also be relativized to particular languages for Tarski. The objection thus points toward the more interesting problem of Tarski’s concept of the exact status of truth predications in a general logic of sentential connectives. Tarski’s three-part solution to the circularity objection which he anticipates is discussed and refuted in detail. (shrink)

In their (2008) article Liar-Like Paradox and Object Language Features C.S. Jenkins and Daniel Nolan (henceforth, JN) argue that it is possible to construct Liar-like paradox in a metalanguage even though its object language is not semantically closed. I do not take issue with this claim. I find fault though with the following points contained in JN’s article: First, that it is possible to construct Liar-like paradox in a metalanguage, even though this metalanguage is not semantically closed. (...) Second, that the presented examples of Liar-like paradox are supposed to be counterexamples to Tarski’s diagnosis of the classic Liar paradox. Third, that JN fail to notice Tarski’s postulate. And finally, that JN fail to recognize that the world they are pondering is not among the possible worlds. (shrink)

The epistemic paradox of 'belief instability' has recently received notable attention from many philosophers. Understanding this paradox is very important because belief is a central notion of psychologically motivated semantic theories in philosophy, linguistics, and cognitive science, and this paradox poses serious problems for these theories. In this dissertation I criticize previous proposals and offer a new proposal, which I call a 'revision theory of belief'. ;My revision theory of belief is in many respects an application of (...) Gupta's and Belnap's revision theory of truth, which is proposed to deal with the Liar paradox. They argue that truth is a circular notion because Tarski biconditionals provide circular, partial definitions of truth. And this circularity of truth is the source of the Liar paradox. I offer a similar proposal for handling the paradox of belief instability. In particular, I argue that our notion of belief involved in the paradox of belief instability is circular, and that is why this paradox arises. ;If the notion of belief involved in the paradox is circular, we have to employ a hypothetical evaluation of the belief predicate, and if we do so through a revision process, we can avoid the contradiction which seems to be generated by some paradoxical belief sentences. But it is not easy to show that our notion of belief is circular. Especially, there is nothing like Tarski biconditionals in the case of belief. Nonetheless, I show in this dissertation that there is a certain schema, which I call the B-schema, whose instances can be taken as circular, partial definitions of a notion of belief, and it is that notion of belief which is involved in the paradox of belief instability. In this dissertation I also show that the revision approach can be extended for handling the Knower paradox. I argue that the Knower paradox arises because our notion of knowledge involved in the paradox is circular. (shrink)

A number of authors have argued that Peano Arithmetic supplemented with a logical validity predicate is inconsistent in much the same manner as is PA supplemented with an unrestricted truth predicate. In this paper I show that, on the contrary, there is no genuine paradox of logical validity—a completely general logical validity predicate can be coherently added to PA, and the resulting system is consistent. In addition, this observation lead to a number of novel, and important, insights into the (...) nature of logical validity itself. (shrink)

The epistemic paradox of 'belief instability' has recently received notable attention from many philosophers. Understanding this paradox is very important because belief is a central notion of psychologically motivated semantic theories in philosophy, linguistics, and cognitive science, and this paradox poses serious problems for these theories. In this dissertation I criticize previous proposals and offer a new proposal, which I call a 'revision theory of belief'. -/- My revision theory of belief is in many respects an application (...) of Gupta's and Belnap's revision theory of truth, which is proposed to deal with the Liar paradox. They argue that truth is a circular notion because Tarski biconditionals provide circular, partial definitions of truth. And this circularity of truth is the source of the Liar paradox. I offer a similar proposal for handling the paradox of belief instability. In particular, I argue that our notion of belief involved in the paradox of belief instability is circular, and that is why this paradox arises. -/- If the notion of belief involved in the paradox is circular, we have to employ a hypothetical evaluation of the belief predicate, and if we do so through a revision process, we can avoid the contradiction which seems to be generated by some paradoxical belief sentences. But it is not easy to show that our notion of belief is circular. Especially, there is nothing like Tarski biconditionals in the case of belief. Nonetheless, I show in this dissertation that there is a certain schema, which I call the B-schema, whose instances can be taken as circular, partial definitions of a notion of belief, and it is that notion of belief which is involved in the paradox of belief instability. In this dissertation I also show that the revision approach can be extended for handling the Knower paradox. I argue that the Knower paradox arises because our notion of knowledge involved in the paradox is circular. (shrink)

This paper is based on Tarski’s theory of truth. The purpose of this paper is to solve the liar paradox (and its cousins) and keep both of the deductive power of classical logic and the expressive power of the word “true” in natural language. The key of this paper lies in the distinction between the predicate usage and the operator usage of the word “true”. The truth operator is primarily used for characterizing the semantics of the language. Then, (...) we do not need the hierarchy of languages. The truth predicate is mainly used for grammatical function. Tarski’s schema of the truth predicate is not necessary in this proposal. The schema of the word "true" is the schema of the truth operator. The liar paradox (and its cousins) can be solved in this way. In the appendix, I show a consistent model for both of the truth predicate and the truth operator. (shrink)

Godel's and Tarski's theorems were inspired by paradoxes: the Richard paradox, the Liar. Godel, in the 1951 Gibbs lecture argued from his metatheoretical results for a metaphysical claim: the impossibility of reducing, both, mathematics to the knowable by the human mind and the human mind to a finite machine (e.g. the brain). So Godel reasoned indirectly from paradoxes for metaphysical theses. I present four metaphysical theses concerning mechanism, reductive physicalism and time for the only purpose of suggesting how (...) it could be argued for them directly from paradoxical sentences. (shrink)

Consider the following argument written on the board in room 227: 1 = 1. So, the argument on the board in room 227 is not valid. This argument generates a paradox. The aim of this paper is to present a resolution of this paradox and related paradoxes of validity, including a version of the Curry paradox. The proposal stresses the close connections between these validity paradoxes and paradoxes of truth and paradoxes of denotation. So a more general (...) aim is to provide a unified response to semantic paradox. The positive proposal is in part inspired by a brief, tantalizing suggestion of Gödel’s, that the paradoxes might appear “as something analogous to dividing by zero”—so that the concept of validity, for example, is everywhere applicable except for certain singular points or singularities. A second central claim is that ‘valid’ is a context-sensitive predicate. The key notions of this contextual-singularity theory are presented and applied to a variety of cases. Any purported solution to paradox must deal with the phenomenon of revenge, and a response to revenge is outlined. The paper closes with remarks about the accommodation of Tarski’s claim that natural languages are universal. (shrink)

We argue that it would seem to be a mistake to blame Liar-like paradox on certain features of the object language, since the effect can be created with very minimal object languages that contain none of the usual suspects (truth-like predicates, reference to their own truth-bearers, negation, etc.).

In this paper I consider two paradoxes that arise in connection with the concept of demonstrability, or absolute provability. I assume—for the sake of the argument—that there is an intuitive notion of demonstrability, which should not be conflated with the concept of formal deducibility in a (formal) system or the relativized concept of provability from certain axioms. Demonstrability is an epistemic concept: the rough idea is that a sentence is demonstrable if it is provable from knowable basic (“self-evident”) premises by (...) means of simple logical steps. A statement that is demonstrable is also knowable and a statement that is actually demonstrated is known to be true. By casting doubt upon apparently central principles governing the concept of demonstrability, the paradoxes of demonstrability presented here tend to undermine the concept itself—or at least our understanding of it. As long as we cannot find a diagnosis and a cure for the paradoxes, it seems that the coherence of the concepts of demonstrability and demonstrable knowledge are put in question. There are of course ways of putting the paradoxes in quarantine, for example by imposing a hierarchy of languages a` la Tarski, or a ramified hierarchy of propositions and propositional functions a` la Russell. These measures, however, helpful as they may be in avoiding contradictions, do not seem to solve the underlying conceptual problems. Although structurally similar to the semantic paradoxes, the paradoxes discussed in this paper involve epistemic notions: “demonstrability”, “knowability”, “knowledge”... These notions are “factive” (e.g., if A is demonstrable, then A is true), but similar paradoxes arise in connection with “nonfactive” notions like “believes”, “says”, “asserts”.3 There is no consensus in the literature concerning the analysis of the notions involved—often referred to as “propositional attitudes”—or concerning the treatment of the paradoxes they give rise to. (shrink)

Numerous philosophical problems, otherwise quite different in character, are of the following form. Certain claims which seem not only obviously true, but even constitutive of the meanings of the expressions employed, can be shown to lead to absurdity when taken together. All such problems can justly be called paradoxes. The paradoxes I examine are the liar paradox, the sorites paradox, and the personal identity paradox posed by the fission problem. ;I argue that in these cases, the claims (...) that jointly lead to absurdity really are constitutive of the meanings of the expressions employed, in the following ways. First, semantic competence with the expressions involves being disposed to accept these claims. Second, the claims are reference-determining, in that the semantic values of the expressions employed are constrained by the condition that these claims should come out true, or as nearly true as possible. If a claim or principle is constitutive of meaning in both of these ways, I call it meaning-constitutive. When the meaning-constitutive principles for some expressions of a language are inconsistent, I call the language inconsistent. This is a stipulative definition; but it accords well with what other theorists who have talked about languages being inconsistent, for example Alfred Tarski, have had in mind. ;In chapters one and two, I argue that our language is inconsistent. In chapter three, I relate my theses to Frank Jackson's and David Lewis's views on reference-determination. ;Another problem posed by the liar paradox concerns important theses in the philosophy of language. The liar reasoning shows that under certain conditions, a natural language cannot contain a predicate satisfying the T-schema. But many theses in the philosophy of language presuppose that truth satisfies the T-schema. In chapter four I attempt to resolve this conflict. (shrink)

In various theories of truth, people have set forth many definitions to clarify in what sense a set of sentences is paradoxical. But what, exactly, is _a_ paradox per se? It has not yet been realized that there is a gap between ‘being paradoxical’ and ‘being a paradox’. This paper proposes that a paradox is a minimally paradoxical set meeting some closure property. Along this line of thought, we give five tentative definitions based upon the folk notion (...) of paradoxicality implied in Tarski’s undefinability theorem of truth and the dependence relation proposed by Leitgeb (J Philos Log 34(2):155–192, 2005). A definition of ‘being a paradox’ is acceptable if its extension must be sufficiently comprehensive to include all known paradoxes on the one hand, and its standard must also be high enough to exclude those that are evidently not paradoxes on the other hand. It turns out that only the last attempt is acceptable: a set of sentences is a paradox if it is paradoxical and self-dependent, and at the same time, it and any of its paradoxical and self-dependent subsets bisimulate each other. In this way, we articulate in what sense a set of sentences is a paradox, and so establish a connection between the notion of a paradox and the notion of paradoxicality. (shrink)

At some step in proving the Liar Paradox in natural language, a sentence is derived that seems overdetermined with respect to its semantic value. This is complemented by Tarski’s Theorem that a formal language cannot consistently contain a naive truth predicate given the laws of logic used in proving the Liar paradox. I argue that proofs of the Eubulidean Liar either use a principle of truth with non-canonical names in a fallacious way or make a fallacious use (...) of substitution of identicals. Tarski never committed the first fallacy and may have himself considered it fallacious. Nevertheless, I clarify that it is fallacious. I then argue substitution of identicals needs to be restricted within the scope of the truth predicate. A logic for truth implementing this restriction is a monotonic extension of a classical first order logic, or indeed a formalizable fragment of natural language. Proofs of Tarski’s Indefinability of Truth theorem are invalid in this logic. This approach generalizes to invalidate proofs of Liar-like paradoxes, particularly the predicate form of the Knower paradox. Consequently, such a logic can be further extended in a way that avoids Montague’s theorem for such a system. Yet, the semantic status of a Liar sentence is not fully resolved. It is no longer overdetermined; it is now underdetermined. (shrink)

The Liar Paradox is an argument that arrives at a contradiction by reasoning about a Liar Sentence. The classical Liar Sentence is the self-referential sentence “This sentence is false.”.

There is no need to prove the significance to philosophy of the famous liar paradox. Attempts to solve it have not ceased over the course of many centuries, from hoary antiquity to our own day. The failure of attempts undertaken within the bounds of everyday, natural languages has led many philosophers, particularly of the positivist trend, to pessimistic conclusions with respect to the potentials of such languages. This is very clearly evident, for example, in the statement of A. (...) class='Hi'>Tarski, who writes: "The liar paradox made its first appearance in our discussions as a kind of evil force possessed of great destructive energy. It compels us to reject all attempts to explicate the notion of truth for natural languages and to confine ourselves to the formalized languages of scientific reasoning." Tarski's viewpoint has been repeatedly criticized. We should prefer not to cast doubt on the significance of that highly valuable criticism. However, we cannot fail to observe that Tarski's notion retains its force so long as its basic argument - the insolubility of the liar paradox within the confines of natural languages - remains standing. (shrink)

We discuss misinformation about “the liar antinomy” with special reference to Tarski’s 1933 truth-definition paper [1]. Lies are speech-acts, not merely sentences or propositions. Roughly, lies are statements of propositions not believed by their speakers. Speakers who state their false beliefs are often not lying. And speakers who state true propositions that they don’t believe are often lying—regardless of whether the non-belief is disbelief. Persons who state propositions on which they have no opinion are lying as much as those (...) who state propositions they believe to be false. Not all lies are statements of false propositions—some lies are true; some have no truth-value. People who only occasionally lie are not liars: roughly, liars repeatedly and habitually lie. Some half-truths are statements intended to mislead even though the speakers “interpret” the sentences used as expressing true propositions. Others are statements of propositions believed by the speakers to be questionable but without revealing their supposed problematic nature. The two “formulations” of “the antinomy of the liar” in [1], pp.157–8 and 161–2, have nothing to do with lying or liars. The first focuses on an “expression” Tarski calls ‘c’, namely the following. -/- c is not a true sentence -/- The second focuses on another “expression”, also called ‘c’, namely the following. -/- for all p, if c is identical with the sentence ‘p’, then not p -/- Without argumentation or even discussion, Tarski implies that these strange “expressions” are English sentences. [1] Alfred Tarski, The concept of truth in formalized languages, pp. 152–278, Logic, Semantics, Metamathematics, papers from 1923 to 1938, ed. John Corcoran, Hackett, Indianapolis 1983. -/- https://www.academia.edu/12525833/Sentence_Proposition_Judgment_Statement_and_Fact_Speaking_about_th e_Written_English_Used_in_Logic. (shrink)