In his 1936 paper,On the Concept of Logical Consequence, Tarski introduced the celebrated definition oflogical consequence: “The sentenceσfollows logicallyfrom the sentences of the class Γ if and only if every model of the class Γ is also a model of the sentenceσ.” [55, p. 417] This definition, Tarski said, is based on two very basic intuitions, “essential for the proper concept of consequence” [55, p. 415] and reflecting common linguistic usage: “Consider any class Γ of sentences and a sentence which (...) follows from the sentences of this class. From an intuitive standpoint it can never happen that both the class Γ consists only of true sentences and the sentenceσis false. Moreover, … we are concerned here with the concept of logical, i.e.,formal, consequence.” [55, p. 414] Tarski believed his definition of logical consequence captured the intuitive notion: “It seems to me that everyone who understands the content of the above definition must admit that it agrees quite well with common usage. … In particular, it can be proved, on the basis of this definition, that every consequence of true sentences must be true.” [55, p. 417] The formality of Tarskian consequences can also be proven. Tarski's definition of logical consequence had a key role in the development of the model-theoretic semantics of modern logic and has stayed at its center ever since. (shrink)

In his 1936 paper,On the Concept of Logical Consequence, Tarski introduced the celebrated definition oflogical consequence: “The sentenceσfollows logicallyfrom the sentences of the class Γ if and only if every model of the class Γ is also a model of the sentenceσ.” [55, p. 417] This definition, Tarski said, is based on two very basic intuitions, “essential for the proper concept of consequence” [55, p. 415] and reflecting common linguistic usage: “Consider any class Γ of sentences and a sentence which (...) follows from the sentences of this class. From an intuitive standpoint it can never happen that both the class Γ consists only of true sentences and the sentenceσis false. Moreover, … we are concerned here with the concept of logical, i.e.,formal, consequence.” [55, p. 414] Tarski believed his definition of logical consequence captured the intuitive notion: “It seems to me that everyone who understands the content of the above definition must admit that it agrees quite well with common usage. … In particular, it can be proved, on the basis of this definition, that every consequence of true sentences must be true.” [55, p. 417] The formality of Tarskian consequences can also be proven. Tarski's definition of logical consequence had a key role in the development of the model-theoretic semantics of modern logic and has stayed at its center ever since. (shrink)

The purpose of this paper is to examine some passages of Tarski‘s paper ’On the concept of logical consequence’ and to show that some recent readings of those passages are wrong. John Etchemendy has claimed that in those passages Tarski gave an argument purporting to show that the notion of logical consequence defined by him (as opposed to some pretheoretic notion of logical consequence) possesses certain modal properties. Etchemendy further claims that the argument he attributes to Tarski is fallacious. Some (...) of Etchemendy’s critics have granted him that Tarski did give an argument purporting to show that the defined notion possesses certain modal properties ; but they have claimed that Tarski’s argument was not a fallacious one. I will show that both Etchemendy and his critics are wrong; in the relevant passages, Tarski did not offer (nor did he intend to offer) an argument that the defined notion of logical consequence possesses any modal properties. (shrink)

I argue that recent defenses of the view that in 1936 Tarski required all interpretations of a language to share one same domain of quantification are based on misinterpretations of Tarski’s texts. In particular, I rebut some criticisms of my earlier attack on the fixed-domain exegesis and I offer a more detailed report of the textual evidence on the issue than in my earlier work. I also offer new considerations on subsisting issues of interpretation concerning Tarski’s views on (...) the logical correctness of certain omega-arguments, on the Tarskian proof that Etchemendy took to be modal and fallacious, and on Tarski’s appeals to the “common concept of consequence”. (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)

It has been said that there is no scholarly consensus as to why Aristotle’s logics of proof and refutation would have borne the title _Analytics._ But if we consulted Tarski’s (Introduction to logic and the methodology of deductive sciences, Oxford University Press, New York, 1941) graduate-level primer, we would have the perfect title for them: _Introduction to logic and to the methodology of deductive sciences._ There are two strings to Aristotle’s bow. The methodological string is the founding work on (...) the epistemology of science, and the logical string sets down conditions on the proofs that bring this knowledge about. The logic of proof presents a difficulty whose solution exceeds its theoretical reach. The logic of refutation takes the problem on board, and advances a solution whose execution is framed by fallacy-avoidance at the beginning and fallacy-adoption at the end. But with a difference: the avoidance-fallacies are of Aristotle’s own conception, whereas the adoption-fallacies, so judged in the modern tradition, aren’t fallacies at all for Aristotle. The avoidance-fallacies are begging the question and _ignoratio elenchi_, and the adoption-fallacies, fallacies in name only, are the _ad hominem_ and _ad ignorantiam_, an inductive turning in the first instance, and an abductive finish in the second. (shrink)

In his classic 1936 essay "On the Concept of Logical Consequence", Alfred Tarski used the notion of satisfaction to give a semantic characterization of the logical properties. Tarski is generally credited with introducing the model-theoretic characterization of the logical properties familiar to us today. However, in his book, The Concept of Logical Consequence, Etchemendy argues that Tarski's account is inadequate for quite a number of reasons, and is actually incompatible with the standard model-theoretic account. Many of his criticisms are meant (...) to apply to the model-theoretic account as well. In this paper, I discuss the following four critical charges that Etchemendy makes against Tarski and his account of the logical properties: (1) (a) Tarski's account of logical consequence diverges from the standard model-theoretic account at points where the latter account gets it right. (b) Tarski's account cannot be brought into line with the model-theoretic account, because the two are fundamentally incompatible. (2) There are simple counterexamples (enumerated by Etchemendy) which show that Tarski's account is wrong. (3) Tarski committed a modal fallacy when arguing that his account captures our pre-theoretical concept of logical consequence, and so obscured an essential weakness of the account. (4) Tarski's account depends on there being a distinction between the "logical terms" and the "non-logical terms" of a language, but (according to Etchemendy) there are very simple (even first-order) languages for which no such distinction can be made. Etchemendy's critique raises historical and philosophical questions about important foundational work. However, Etchemendy is mistaken about each of these central criticisms. In the course of justifying that claim, I give a sustained explication and defense of Tarski's account. Moreover, since I will argue that Tarski's account and the model theoretic account really do come to the same thing, my subsequent defense of Tarski's account against Etchemendy's other attacks doubles as a defense against criticisms that would apply equally to the familiar model-theoretic account of the logical properties. (shrink)

[ES] La teoría de modelos parte generalmente de la definición de consecuencia lógica ofrecida por Tarski en 1936. John Etchemendy asevera que esta definición contiene una falacia si se le toma como definición genuina de este concepto. Esta aseveración ha desatado una polémica interesante. El presente ensayo resume los puntos principales en discusión y sugiere en su conclusión que el rechazo de la propuesta de Etchemendy se basa en un malentendido de la intención de su crítica, cuyo objeto no es, (...) propiamente dicho, la definición de Tarski, sino que ésta ofrece un fundamento insuficiente para la teoría de modelos. [EN] Model Theory generally assumes the definition of logical consequence proffered by Tarski in 1936. John Etchemendy suggests that Tarski’s definition contains a fallacy, from which an interesting controversy ensued about the definition and its meaning. The main points in discussion are summarized and it is suggested that the controversy is based on a misunderstanding of the intentions of Etchemendy’s criticism: the target is not so much Tarski’s definition, but that it offers an insufficient foundation for Model Theory. (shrink)

This paper explores applications of concepts from argumentation theory to mathematical proofs. Note is taken of the various contexts in which proofs occur and of the various objectives they may serve. Examples of strategic maneuvering are discussed when surveying, in proofs, the four stages of argumentation distinguished by pragma-dialectics. Derailments of strategies (fallacies) are seen to encompass more than logical fallacies and to occur both in alleged proofs that are completely out of bounds and in alleged proofs that are at (...) least mathematical arguments. These considerations lead to a dialectical and rhetorical view of proofs. (shrink)

It is one thing for a given proposition to follow or to not follow from a given set of propositions and it is quite another thing for it to be shown either that the given proposition follows or that it does not follow.* Using a formal deduction to show that a conclusion follows and using a countermodel to show that a conclusion does not follow are both traditional practices recognized by Aristotle and used down through the history of logic. These (...) practices presuppose, respectively, a criterion of validity and a criterion of invalidity each of which has been extended and refined by modern logicians: deductions are studied in formal syntax (proof theory) and coun¬termodels are studied in formal semantics (model theory). The purpose of this paper is to compare these two criteria to the corresponding criteria employed in Boole’s first logical work, The Mathematical Analysis of Logic (1847). In particular, this paper presents a detailed study of the relevant metalogical passages and an analysis of Boole’s symbolic derivations. It is well known, of course, that Boole’s logical analysis of compound terms (involving ‘not’, ‘and’, ‘or’, ‘except’, etc.) contributed to the enlargement of the class of propositions and arguments formally treatable in logic. The present study shows, in addition, that Boole made significant contributions to the study of deduc¬tive reasoning. He identified the role of logical axioms (as opposed to inference rules) in formal deductions, he conceived of the idea of an axiomatic deductive sys¬tem (which yields logical truths by itself and which yields consequences when ap¬plied to arbitrary premises). Nevertheless, surprisingly, Boole’s attempt to imple¬ment his idea of an axiomatic deductive system involved striking omissions: Boole does not use his own formal deductions to establish validity. Boole does give symbolic derivations, several of which are vitiated by “Boole’s Solutions Fallacy”: the fallacy of supposing that a solution to an equation is necessarily a logical consequence of the equation. This fallacy seems to have led Boole to confuse equational calculi (i.e., methods for gen-erating solutions) with deduction procedures (i.e., methods for generating consequences). The methodological confusion is closely related to the fact, shown in detail below, that Boole had adopted an unsound criterion of validity. It is also shown that Boole totally ignored the countermodel criterion of invalid¬ity. Careful examination of the text does not reveal with certainty a test for invalidity which was adopted by Boole. However, we have isolated a test that he seems to use in this way and we show that this test is ineffectual in the sense that it does not serve to identify invalid arguments. We go beyond the simple goal stated above. Besides comparing Boole’s earliest criteria of validity and invalidity with those traditionally (and still generally) employed, this paper also investigates the framework and details of THE MATHEMATICAL ANALYSIS OF LOGIC. (shrink)

According to Etchemendy, in attempting to offer an analysis of the modal features of the intuitive concept of logical consequence, Tarski has committed a modal fallacy. In this paper, I consider the thesis according to it is posible to analyze the modals properties of concept of logical consequence through of a generalization on set-theoretical interpretations. As is known, some philosophers have tried to argue for the transit from the general to the modal by showing that there are enough settheoretic (...) interpretations so as to be able to represent the modal features of the intuitive concept of consequence. As is also known, those people have encountered a lot of difficulties. In the present paper, I will try to show that those problems are related not with the specific possibility of accounting for the modal features by means of a set-theoretic notion of model but with the possibility of coming up with a precise mathematical theory for the concept of interpretation, and, as such, they can be solved by way of appealing to the usual solutions to this problem. (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)

This work is, in large part, a series of refutations; it is also the author's Ph.D. thesis. First to be refuted is Russell's vicious circle principle as a general remedy for the solution of the paradoxes. The author rejects the classification of paradoxes into syntactic and semantic, since in his view there are no purely syntactic paradoxes. The distinction in logic between the uninterpreted syntactical aspect of a system and the system when given a determinate interpretation is held to be (...) untenable. Tarski's distinction between object-language and meta-language and his concept of semantically closed language are considered irrelevant for the solution of the Liar paradox. The author claims that the usual versions of the Liar paradox have the same structure as the Barber paradox, viz., [S ↔ ~S]. The author solves the Liar paradox by pointing out that it does not have a proper reference. Cantor's diagonal argument for the indenumerability [[sic]] of the real numbers is labeled as unsatisfactory. Since the diagonal number is dependent upon the real numbers in the constructed list, the author claims that this makes the diagonal number to be of a different nature and status than the real numbers in the list; thus we have what the author calls the dependence fallacy. The author also refuses to accept Cantor's nested interval proof of the indenumerability [[sic]] of the real numbers. Within the proof, two infinite sequences are constructed, each of which converges to a limit. Because the proof does not give a "definite rule of convergence," the author is not satisfied that the infinite sequences converge. Also rejected is Cantor's theorem. Other paradoxes analyzed are the Berry, Richard, heterological, "Richardian", Russell, Cantor, and Burali-Forti paradoxes.--T. G. N. (shrink)

This paper is an edited form of a letter written by the two authors (in the name of Tarski) to Wolfram Schwabhäuser around 1978. It contains extended remarks about Tarski's system of foundations for Euclidean geometry, in particular its distinctive features, its historical evolution, the history of specific axioms, the questions of independence of axioms and primitive notions, and versions of the system suitable for the development of 1-dimensional geometry.

This article presents Tarski's Address at the Princeton Bicentennial Conference on Problems of Mathematics, together with a separate summary. Two accounts of the discussion which followed are also included. The central topic of the Address and of the discussion is decision problems. The introductory note gives information about the Conference, about the background of the subjects discussed in the Address, and about subsequent developments to these subjects.

Down through the ages, logic has adopted many strange and awkward technical terms: assertoric, prove, proof, model, constant, variable, particular, major, minor, and so on. But truth-value is a not a typical example. Every proposition, even if false, no matter how worthless, has a truth-value:even “one plus two equals four” and “one is not one”. In fact, every two false propositions have the same truth-value—no matter how different they might be, even if one is self-contradictory and one is consistent. It (...) is not such a big surprise that every true proposition, no matter how worthless, has a truth-value. Every proposition, whether valuable or worthless, has a truth-value.But it is a little strange that every two true propositions, no matter how different they might be, have the same truth-value. The Pythagorean Theorem has the same truth-value as the proposition that one is one. It is a stretch to think of truth-values as values in any of the normal senses of the word ‘value’. (shrink)

Published with the aid of a grant from the National Endowment for the Humanities. Contains the only complete English-language text of The Concept of Truth in Formalized Languages. Tarski made extensive corrections and revisions of the original translations for this edition, along with new historical remarks. It includes a new preface and a new analytical index for use by philosophers and linguists as well as by historians of mathematics and philosophy.

This classic undergraduate treatment examines the deductive method in its first part and explores applications of logic and methodology in constructing mathematical theories in its second part. Exercises appear throughout.

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

Published with the aid of a grant from the National Endowment for the Humanities. Contains the only complete English-language text of The Concept of Truth in Formalized Languages. Tarski made extensive corrections and revisions of the original translations for this edition, along with new historical remarks. It includes a new preface and a new analytical index for use by philosophers and linguists as well as by historians of mathematics and philosophy.

I ON THE PRIMITIVE TERM OF LOGISTICf IN this article I propose to establish a theorem belonging to logistic concerning some connexions, not widely known, ...

In this manuscript, published here for the first time, Tarski explores the concept of logical notion. He draws on Klein's Erlanger Programm to locate the logical notions of ordinary geometry as those invariant under all transformations of space. Generalizing, he explicates the concept of logical notion of an arbitrary discipline.