Since Saul Kripke’s influential work in the 1970s, the revisionary approach to semantic paradox—the idea that semantic paradoxes must be solved by weakening classical logic—has been increasingly popular. In this paper, we present a new revenge argument to the effect that the main revisionary approaches breed new paradoxes that they are unable to block.

Are we perhaps in the "matrix", or anyway, victims of perfect and permanent computer simulation? No. The most convincing—and shortest—version of Putnam's argument against the possibility of our eternal envattment is due to Crispin Wright (1994). It avoids most of the misunderstandings that have been elicited by Putnam's original presentation of the argument in "Reason, Truth and History" (1981). But it is still open to the charge of question-begging. True enough, the premisses of the argument (disquotation and externalism) can be (...) formulated and defended without presupposing external objects whose existence appears doubtful in the light of the very skeptical scenario which Putnam wants to repudiate. However, the argument is only valid if we add an extra premiss as to the existence of some external objects. In order to avoid circularity, we should run the argument with external objects which must exist even if we are brains in a vat, e.g. with computers rather than with trees. As long as the skeptic is engaged in a discussion of the brain-in-a-vat scenario, she should neither deny the existence of computers nor the existence of causal relations; for if she does, she is in fact denying that we are brains in a vat. (shrink)

Es werden die Veränderungen der Wissenschaftssprache der Physik untersucht, die durch den Übergang von der klassich-relativistichen Physik zur Quantenphysik erfolgt sind. Die neuen und prinzipiellen Beschränkungen der Möglichkeiten der Überprüfung wissenschaftlicher Aussagen führen zu Reduktionen der hypothetischen Annahmen, die der Sprache der klassischen Physik zu Grunde liegen. Diese Reduktionen haben ihrerseits Abschwächungen der syntaktischen Strukturen zur Folge, die besonders in der formalen Logik und der Modallogik deutlich werden. Diese auf schwächeren Prämissen basierenden Strukturen sind die Quanten-Logik und die Quanten-Modallogik, die (...) damit auch einen weiteren Geltungsbereich besitzen als die entsprechenden klassischen formalen Systeme. (shrink)

This article outlines the work of a group of US mathematicians called the American Postulate Theorists and their influence on Tarski's work in the 1930s that was to be foundational for model theory. The American Postulate Theorists were influenced by the European foundational work of the period around 1900, such as that of Peano and Hilbert. In the period roughly from 1900???1940, they developed an indigenous American approach to foundational investigations. This made use of interpretations of precisely formulated axiomatic theories (...) to prove such metatheoretic properties as independence, consistency, categoricity and, in some cases, completeness of axiom sets. This approach to foundations was in many respects similar to that later taken by Tarski, who frequently cites the work of American Postulate Theorists. Their work served as paradigm examples of the theories and concepts investigated in model theory. The article also examines the possibility of a more specific impetus to Tarski's model theoretic investigation, arising from his having studied in 1927???1929 a paper by C. H. Langford proving completeness for various axiom sets for linear orders. This used the method of elimination of quantifiers. The article concludes with an examination of one example of Langford's methods to indicate how their correct formulation seems to call for model-theoretic concepts. (shrink)

Deflationists about truth embrace the positive thesis that the notion of truth is useful as a logical device, for such purposes as blanket endorsement, and the negative thesis that the notion doesn’t have any legitimate applications beyond its logical uses, so it cannot play a significant theoretical role in scientific inquiry or causal explanation. Focusing on Christopher Hill as exemplary deflationist, the present paper takes issue with the negative thesis, arguing that, without making use of the notion of truth conditions, (...) we have little hope for a scientific understanding of human speech, thought, and action. For the reference relation, the situation is different. Inscrutability arguments give reason to think that a more-than-deflationary theory of reference is unattainable. With respect to reference, deflationism is the only game in town. (shrink)

That reference is inscrutable is demonstrated, it is argued, not only by W. V. Quine's arguments but by Peter Unger's "Problem of the Many." Applied to our own language, this is a paradoxical result, since nothing could be more obvious to speakers of English than that, when they use the word "rabbit," they are talking about rabbits. The solution to this paradox is to take a disquotational view of reference for one's own language, so that "When I use 'rabbit,' I (...) refer to rabbits" is made true by the meaning of the word "refer." The reference relation is extended to other languages by translation. The explanation for this peculiarly egocentric conception of semantics-questions of others' meanings are settled by asking what I mean by words of my language-is to be found in our practice of predicting and explaining other people's behavior by empathetic identification. I understand other people's behavior by asking what I would do in their place. (shrink)

The author considers the discussion of designation and truth by black and geach. Geach had pointed out a flaw in black's position and attempted to correct it. The author concludes that geach has not even "described the concepts in terms of which" he is to correct black.

The Liar sentence L, which reads ‘L is not true’, can be used to produce an apparently valid argument proving that L is not true and that L is true. There has been increasing recognition of the appeal of contextualist solutions to the Liar paradox. Contextualist accounts hold that some step in the reasoning induces a context shift that causes the apparently contradictory claims to occur at different contexts. Attempts at identifying the most promising contextualist account often rely on timing (...) arguments, which seek to isolate a step at which the context cannot be claimed to have shifted or must have shifted. The literature contains a number of timing arguments that draw incompatible conclusions about the location of the context shift. I argue that no existing timing arguments succeed. An alternative strategy for assessing contextualist accounts evaluates the plausibility of their explanations of why the context shifts. However, even this strategy yields no clear verdict about which contextualist account is the most promising. I conclude that there are some grounds for optimism and for pessimism about the potential to adequately motivate contextualism. (shrink)

In this article I describe and evaluate the debate that surrounds the proper interpretation of Tarski’s account of logical consequence given in his classic 1936 article ‘On the concept of logical consequence’. In the late 1980s Etchemendy argued that the familiar model theoretic account of logical consequence is not to be found in Tarski’s original article. Whereas the contemporary account of logical consequence is a variable‐domain conception – in that it calls for a reinterpretation of the domain of variation of (...) the quantifiers when evaluating logical consequence –, no such reinterpretation is found in Tarski’s original account, which was rather based on a ‘fixed‐domain’ conception. Etchemendy’s claims have sparked a debate on Tarski’s conception of logical consequence with important contributions by, among others, Bach, Bays, Corcoran, Gómez‐Torrente, Mancosu, Ray, Sagüillo, and Sher. (shrink)

It has been argued that neural networks and other forms of analog computation may transcend the limits of Turing-machine computation; proofs have been offered on both sides, subject to differing assumptions. In this article I argue that the important comparisons between the two models of computation are not so much mathematical as epistemological. The Turing-machine model makes assumptions about information representation and processing that are badly matched to the realities of natural computation (information representation and processing in or inspired by (...) natural systems). This points to the need for new models of computation addressing issues orthogonal to those that have occupied the traditional theory of computation. (shrink)

Let me start with a well-known story. Kant held that logic and conceptual analysis alone cannot account for our knowledge of arithmetic: “however we might turn and twist our concepts, we could never, by the mere analysis of them, and without the aid of intuition, discover what is the sum [7+5]” (KrV, B16). Frege took himself to have shown that Kant was wrong about this. According to Frege’s logicist thesis, every arithmetical concept can be defined in purely logical terms, and (...) every theorem of arithmetic can be proved using only the basic laws of logic. Hence, Kant was wrong to think that our grasp of arithmetical concepts and our knowledge of arithmetical truth depend on an extralogical source—the pure intuition of time (Frege 1884, §89, §109). Arithmetic, properly understood, is just a part of logic. (shrink)

This paper consists of three sections. In the first one, some of the main developments in the philosophy of science through the xx century up to the present will be pointed out, and inserted them in the frame of some more general philosophical transformations, such as the so-called “linguistic turn” and “pragmatic turn”, respectively. In the second one, the established connection will be nuanced, from a revision of the work of a “classical” author such as Carnap. Finally, it will be (...) intended a kind of “balance and future perspectives”. (shrink)

In his famous paper Der Wahrheitsbegriff in den formalisierten Sprachen (Polish edition: Nakładem/Prace Towarzystwa Naukowego Warszawskiego, wydzial, III, 1933), Alfred Tarski constructs a materially adequate and formally correct definition of the term “true sentence” for certain kinds of formalised languages. In the case of other formalised languages, he shows that such a construction is impossible but that the term “true sentence” can nevertheless be consistently postulated. In the Postscript that Tarski added to a later version of this paper (Studia Philosophica, (...) 1, 1935), he does not explicitly include limits for the kinds of language for which such a construction is possible. This absence of such limits has been interpreted as an implied claim that such a definition of the term “true sentence” can be constructed for every language. This has far-reaching consequences, not least for the widely held belief that Tarski changed from an universalistic to an anti-universalistic standpoint. We will claim that the consequence of anti-universalism is unwarranted, given that it can be argued that the Postscript is not in conflict with the existence of limits outside of which a definition of “true sentence” cannot be constructed. Moreover, by a discussion of transfinite type theory, we will also be able to accommodate other of the changes made in Tarski’s Postscript within a type-theoretical framework. The awareness of transfinite type theory afforded by this discussion will lead, in turn, to an account of Tarski’s Postscript that shows a gradual change in his logical work, rather than any of the more radical transitions which the Postscript has been claimed to reflect. (shrink)

We shift attention from the development of model theory for demarcated languages to the development of this theory for fragments of a language. Although it is often assumed that model theory for demarcated languages is not compatible with a universalist conception of logic, no one has denied that model theory for fragments of a language can be compatible with that conception. It thus seems unwarranted to ignore the universalist tradition in the search for the origins and development of model theory. (...) This point is illustrated by Carnap’s early semantics and model theory, which he developed within a type theoretical framework and which stand out both for their universalistic treatment and for certain idiosyncratic technicalities by which the construction is supported. One special property is that individuals are context relative in Carnap’s system. This leads to a model theory in which the model domains are more flexible than has been suggested in the literature. (shrink)

G. Schiemer has recently ascribed to Carnap the so-called domains-as-fields conception of models, which he subsequently used to defend Carnap’s treatment of extremal axioms against J. Hintikka’s criticism that the number of tuples in a relation, and not the domain of discourse, is optimised in Carnap’s treatment. We will argue by a careful textual analysis, however, that this domains-as-fields conception cannot be applied to Carnap’s early semantics, because it includes a notion of submodel and subrelation that is not only absent (...) from Carnap’s work at that time, but even contradicts it. As a consequence, Schiemer’s defense of Carnap’s extremal axioms against Hintikka’s criticism fails. We will reconcile Carnap’s treatment of extremal axioms and Hintikka’s observation by taking into account the practice of axiomatics in the early twentieth century. If one realises that, in Carnap’s time, a predicate for the domain of discourse was often introduced in the formal theory, and that Carnap defined such predicates from the basic relations of an axiom system, the apparent disagreement between optimising relations and optimising domains disappears. (shrink)

In this paper, we investigate (1) what can be salvaged from the original project of "logicism" and (2) what is the best that can be done if we lower our sights a bit. Logicism is the view that "mathematics is reducible to logic alone", and there are a variety of reasons why it was a non-starter. We consider the various ways of weakening this claim so as to produce a "neologicism". Three ways are discussed: (1) expand the conception of logic (...) used in the reduction, (2) allow the addition of analytic-sounding principles to logic so that the reduction is not to "logic alone" but to logic and truths knowable a priori, and (3) revise the conception of "reducible". We show how the current versions of neologicism fit into this classification scheme, and then focus on a kind of neologicism which we take to have the most potential for achieving the epistemological goals of the original logicist project. We argue that that the "weaker" the form of neologicism, the more likely it is to be a new form of logicism, and show how our preferred system, though mathematically weak, is metaphysically and epistemogically strong, and can "reduce" arbitrary mathematical theories to logic and analytic truths, if given a legitimate new sense of "reduction". (shrink)

We present $\in_I$-Logic (Epsilon-I-Logic), a non-Fregean intuitionistic logic with a truth predicate and a falsity predicate as intuitionistic negation. $\in_I$ is an extension and intuitionistic generalization of the classical logic $\in_T$ (without quantifiers) designed by Sträter as a theory of truth with propositional self-reference. The intensional semantics of $\in_T$ offers a new solution to semantic paradoxes. In the present paper we introduce an intuitionistic semantics and study some semantic notions in this broader context. Also we enrich the quantifier-free language by (...) the new connective < that expresses reference between statements and yields a finer characterization of intensional models. Our results in the intuitionistic setting lead to a clear distinction between the notion of denotation of a sentence and the here-proposed notion of extension of a sentence (both concepts are equivalent in the classical context). We generalize the Fregean Axiom to an intuitionistic version not valid in $\in_I$. A main result of the paper is the development of several model constructions. We construct intensional models and present a method for the construction of standard models which contain specific (self-)referential propositions. (shrink)

What kinds of sentences with truth predicate may be inserted plausibly and consistently into the T-scheme? We state an answer in terms of dependence: those sentences which depend directly or indirectly on non-semantic states of affairs (only). In order to make this precise we introduce a theory of dependence according to which a sentence φ is said to depend on a set Φ of sentences iff the truth value of φ supervenes on the presence or absence of the sentences of (...) Φ in/from the extension of the truth predicate. Both φ and the members of Φ are allowed to contain the truth predicate. On that basis we are able define notions such as ungroundedness or self-referentiality within a classical semantics, and we can show that there is an adequate definition of truth for the class of sentences which depend on non-semantic states of affairs. (shrink)

This article outlines what a formal theory of truth should be like, at least at first glance. As not all of the stated constraints can be satisfied at the same time, in view of notorious semantic paradoxes such as the Liar paradox, we consider the maximal consistent combinations of these desiderata and compare their relative advantages and disadvantages.

This papers deals with the class of axiomatic theories of truth for semantically closed languages, where the theories do not allow for standard models; i.e., those theories cannot be interpreted as referring to the natural number codes of sentences only (for an overview of axiomatic theories of truth in general, see Halbach[6]). We are going to give new proofs for two well-known results in this area, and we also prove a new theorem on the nonstandardness of a certain theory of (...) truth. The results indicate that the proof strategies for all the theorems on the nonstandardness of such theories are "essentially" of the same kind of structure. (shrink)

This is the second part of a paper dealing with truth and translation. In Part A a revised version of Tarski's Convention T has been presented, which explicitly refers to a translation mapping from the object language to the metalanguage; the vague notion of a translation has been replaced by a precise definition. At the end of Part A it has been shown that interpreted languages exist, which allow for vicious self-reference but which nevertheless contain their own truth predicate - (...) this is possible if truth is based on a nonstandard translation mapping. However, this result has only been proved for languages without quantifiers. In Part B we now extend the result to first-order languages, and we show that this can be done in three different ways. In each case, the addition of a truth predicate to an interpreted language with a high degree of expressiveness leads to changes in the ontology of the language. (shrink)

We introduce an epistemic theory of truth according to which the same rational degree of belief is assigned to Tr(. It is shown that if epistemic probability measures are only demanded to be finitely additive (but not necessarily σ-additive), then such a theory is consistent even for object languages that contain their own truth predicate. As the proof of this result indicates, the theory can also be interpreted as deriving from a quantitative version of the Revision Theory of Truth.

In this paper we investigate two purely syntactical notions ofcircularity, which we call ``self-application'''' and ``self-inclusion.'''' Alanguage containing self-application allows linguistic items to beapplied to themselves. In a language allowing for self-inclusion thereare expressions which include themselves as a proper part. We introduceaxiomatic systems of syntax which include identity criteria andexistence axioms for such expressions. The consistency of these axiomsystems will be shown by providing a variety of different models –these models being our circular languages. Finally we will show what (...) apossible semantics for these circular languages could look like. (shrink)

The first attempt at a systematic approach to axiomatic theories of truth was undertaken by Friedman and Sheard (Ann Pure Appl Log 33:1–21, 1987). There twelve principles consisting of axioms, axiom schemata and rules of inference, each embodying a reasonable property of truth were isolated for study. Working with a base theory of truth conservative over PA, Friedman and Sheard raised the following questions. Which subsets of the Optional Axioms are consistent over the base theory? What are the proof-theoretic strengths (...) of the consistent theories? The first question was answered completely by Friedman and Sheard; all subsets of the Optional Axioms were classified as either consistent or inconsistent giving rise to nine maximal consistent theories of truth.They also determined the proof-theoretic strength of two subsets of the Optional Axioms. The aim of this paper is to continue the work begun by Friedman and Sheard. We will establish the proof-theoretic strength of all the remaining seven theories and relate their arithmetic part to well-known theories ranging from PA to the theory of ${\Sigma^1_1}$ dependent choice. (shrink)

Several writers have assumed that when in “Outline of a Theory of Truth” I wrote that “the orthodox approach” – that is, Tarski’s account of the truth definition – admits descending chains, I was relying on a simple compactness theorem argument, and that non-standard models must result. However, I was actually relying on a paper on ‘pseudo-well-orderings’ by Harrison. The descending hierarchy of languages I define is a standard model. Yablo’s Paradox later emerged as a key to interpreting the result.

We study first-order concatenation theory with bounded quantifiers. We give axiomatizations with interesting properties, and we prove some normal-form results. Finally, we prove a number of decidability and undecidability results.

We give some information about new proofs of the incompleteness theorems, found in 1990s. Some of them do not require the diagonal lemma as a method of construction of an independent statement.

We show that any predicational theory of partial ground that extends a standard theory of syntax and that proves some commonly accepted principles for partial ground is inconsistent. We suggest a way to obtain a consistent predicational theory of ground.

Des philosophes de la logique comme Prior et Mulligan considèrent le connecteur de vérité ‘Il est vrai que ’ comme étant plus fondamental que le prédicat de vérité ‘ est vrai’. Des philosophes comme Bolzano et Horwich ont adopté l’ordre inverse de priorités et je me suis rallié à eux dans Conceptions of Truth. Je continue à penser que le prédicat « porte la culotte » et vais tenter de désamorcer les arguments contre cette conception, mais je vais aussi rejeter (...) un de mes arguments antérieurs en faveur de celle-ci.Logical Philosophers like Prior and Mulligan regard the truth connective ‘It is true that ’ as more basic than the truth predicate ‘ is true’. Philosophers like Bolzano and Horwich have adopted the opposite priority setting, and in Conceptions of Truth I joined them. I still think that the predicate ‘wears the trousers’, and I shall try to defuse the arguments against this view, but I shall also reject one of my earlier arguments for it. (shrink)

Structural realism has been proposed as an epistemological position interpolating between realism and sceptical anti-realism about scientific theories. The structural realist who accepts a scientific theory thinks that is empirically correct, and furthermore is a realist about the ‘structural content’ of . But what exactly is ‘structural content’? One proposal is that the ‘structural content’ of a scientific theory may be associated with its Ramsey sentence (). However, Demopoulos and Friedman have argued, using ideas drawn from Newman's earlier criticism of (...) Russell's structuralism, that this move fails to achieve an interesting intermediate position between realism and anti-realism. Rather, () adds little content beyond the instrumentalistically acceptable claim that the theory is empirically adequate. Here, I formulate carefully the crucial claim of Demopoulos and Friedman, and show that the Ramsey sentence () is true just in case possesses a full model which is empirically correct and satisfies a certain cardinality condition on its theoretical domain. This suggests that structural realism is not a position significantly different from the anti-realism it attempts to distinguish itself from. Introduction Technical framework Ramsification Empirical adequacy Ramsification empirical adequacy + cardinality constraint Conclusion. (shrink)

Tarski’s Indefinability Theorem can be generalized so that it applies to many-valued languages. We introduce a notion of strong semantic self-representation applicable to any (sufficiently rich) interpreted many-valued language L. A sufficiently rich interpreted many-valued language L is SSSR just in case it has a function symbol n(x) such that, for any f Sent(L), the denotation of the term n(“f”) in L is precisely ||f||L, the semantic value of f in L. By a simple diagonal construction (finding a sentence l (...) such that l is equivalent to n(“l”) T), it is shown that no such language strongly represents itself semantically. Hence, no such language can be its own metalanguage. (shrink)

Certain translational T-schemes of the form True(“f”) « f(f), where f(f) can be almost any translation you like of f, will be a conservative extension of Peano arithmetic. I have an inkling that this means something philosophically, but I don’t understand my own inkling.

Certain translational T-schemes of the form True « f, where f can be almost any translation you like of f, will be a conservative extension of Peano arithmetic. I have an inkling that this means something philosophically, but I don’t understand my own inkling.

In the Tarskian theory of truth, the strengthened liar sentence is a theorem. More generally, any formalized truth theory which proves the full, self-applicative scheme True f will prove the strengthened liar sentence..).