The present paper discusses a proposal which says,roughly and with several qualifications, that thecollection of mathematical truths is identical withthe set of theorems of ZFC. It is argued that thisproposal is not as easily dismissed as outright falseor philosophically incoherent as one might think. Some morals of this are drawn for the concept ofmathematical knowledge.

Realism is multiply ambiguous. The central concern of Part 1 of this paper is to distinguish several of its many senses — four (Theoretical Realism, Cumulative Realism, Progressive Realism and Optimistic Realism) in which it refers to theses about the status of scientific theories, and five (Minimal Realism, Ambitious Absolutism, Transcendentalism, Nidealism, Scholastic Realism) in which it refers to theses about the nature of truth or truth-bearers. Because Realism has these several, largely independent, senses, the conventional wisdom that Tarski's theory (...) of truth supports realism, and that the Meaning-Variance thesis undermines it, needs re-evaluation. The concern of the rest of the paper is to sort out in which senses the conventional wisdom, with respect to Tarski's theory (Part 2) and the Meaning-Variance thesis (Part 3), is correct. (shrink)

This paper argues for the thesis that, roughly put, it is impossible to talk about absolutely everything. To put the thesis more precisely, there is a particular sense in which, as a matter of semantics, quantifiers always range over domains that are in principle extensible, and so cannot count as really being ‘absolutely everything’. The paper presents an argument for this thesis, and considers some important objections to the argument and to the formulation of the thesis. The paper also offers (...) an assessment of just how implausible the thesis really is. It argues that the intuitions against the thesis come down to a few special cases, which can be given special treatment. Finally, the paper considers some metaphysical ideas that might surround the thesis. Particularly, it might be maintained that an important variety of realism is incompatible with the thesis. The paper argues that this is not the case. (shrink)

One thousand stones, suitably arranged, might form a heap. If we remove a single stone from a heap of stones we still have a heap; at no point will the removal of just one stone make sufficient difference to transform a heap into something which is not a heap. But, if this is so, we still have a heap, even when we have removed the last stone composing our original structure. So runs the Sorites paradox. Similar paradoxes can be constructed (...) with any predicate which, like 'heap', displays borderline vagueness. Although I have frequently heard it said that there is no completely credible and satisfying dissolution of the paradoxes of the Sorites family; and although there is no possible approach to dissolution which has not been at least partially explored, philosophers continue glibly to use vague language as though it were entirely unproblematic. Since no argument has ever been produced which would justify our ignoring the para~doxes, this situation is extremely unsatisfactory. (shrink)

This paper presents a new theory of vagueness, which is designed to retain the virtues of the fuzzy theory, while avoiding the problem of higher-order vagueness. The theory presented here accommodates the idea that for any statement S₁ to the effect that 'Bob is bald' is x true, for x in [0, 1], there should be a further statement S₂ which tells us how true S₁ is, and so on - that is, it accommodates higher-order vagueness without resorting to the (...) claim that the metalanguage in which the semantics of vagueness is presented is itself vague, and without requiring us to abandon the idea that the logic - as opposed to the semantics - of vague discourse is classical. I model the extension of a vague predicate P as a blurry set, this being a function which assigns a degree of membership or degree function to each object o, where a degree function in turn assigns an element of [0, 1] to each finite sequence of elements of [0, 1]. The idea is that the assignment to the sequence (0.3, 0.2), for example, represents the degree to which it is true to say that it is 0.2 true that o is P to degree 0.3. The philosophical merits of my theory are discussed in detail, and the theory is compared with other extensions and generalisations of fuzzy logic in the literature. (shrink)

Kripke’s theory of truth succeeded in providing a trivalent semantics for a language that contains its own truth predicate and means of self-reference; but it did so by radically restricting the expressive power of the logic. In Kripke’s analysis, the Liar (e.g. This very sentence is not true) receives the indeterminate truth value; but the logic cannot express the fact that the Liar is something other than true: in order to do so, a weak negation not* would be needed, but (...) it would also make the logic inconsistent (because the ‘Super Liar’ This very sentence is not* true could not be assigned any truth value). Taking a hint from the quantificational form of the problematic sentences (… is something other than true), we define a hierarchy of negations which each quantifies over a domain of truth values, assimilated to ordinals. The resulting logic has as many negations and truth values as there are ordinals. Unlike Kripke’s logic, it enjoys a form of expressive completeness. And although the logic is not monotonic, we show that under broad conditions we can construct a variety of fixed points; one of them emulates Kripke’s ‘least fixed point’, while another one assigns a different truth value to each Super Liar. (shrink)

We show how to construct certain L M, T -type interpreted languages, with each such language containing meaningfulness and truth predicates which apply to itself. These languages are comparable in expressive power to the L T -type, truth-theoretic languages first considered by Kripke, yet each of our L M, T -type languages possesses the additional advantage that, within it, the meaninglessness of any given meaningless expression can itself be meaningfully expressed. One therefore has, for example, the object level truth (and (...) meaningfulness) of the claim that the strengthened Liar is meaningless. (shrink)

A syntactically correct number-specification may fail to specify any number due to underspecification. For similar reasons, although each sentence in the Yablo sequence is syntactically perfect, none yields a statement with any truth-value. As is true of all members of the Liar family, the sentences in the Yablo sequence are so constructed that the specification of their truth-conditions is vacuous; the Yablo sentences fail to yield statements. The ‘revenge’ problem is easily defused. The solution to the semantical paradoxes offered here (...) revives the mediaeval cassatio approach, one that largely disappeared due to its incomprehending rejection by influential contemporary writers such as William Shyreswood and Thomas Bradwardine. The diagnosis readily extends to the set-theoretic paradoxes. (shrink)

While Kripke's original paper on the theory of truth used a three-valued logic, we believe a four-valued version is more natural. Its use allows for possible inconsistencies in information about the world, yet contains Kripke's development within it. Moreover, using a four-valued logic makes it possible to work with complete lattices rather than complete semi-lattices, and thus the mathematics is somewhat simplified. But more strikingly, the four-valued version has a wide, natural generalization to the family of interlaced bilattices. Thus, with (...) little more work, the theory is extended to a broad class of settings. Indeed, a result like Theorem 6.2 would not even be possible to state without the interlaced bilattice machinery. We hope the notion of interlaced bilattice will make apparent further such connections. (shrink)

The paper shows how we can add a truth predicate to arithmetic (or formalized syntactic theory), and keep the usual truth schema Tr( ) ↔ A (understood as the conjunction of Tr( ) → A and A → Tr( )). We also keep the full intersubstitutivity of Tr(>A>)) with A in all contexts, even inside of an →. Keeping these things requires a weakening of classical logic; I suggest a logic based on the strong Kleene truth tables, but with → (...) as an additional connective, and where the effect of classical logic is preserved in the arithmetic or formal syntax itself. Section 1 is an introduction to the problem and some of the difficulties that must be faced, in particular as to the logic of the →; Section 2 gives a construction of an arithmetically standard model of a truth theory; Section 3 investigates the logical laws that result from this; and Section 4 provides some philosophical commentary. (shrink)

We consider the issue of what an agent or a processor needs to know in order to know that its messages are true. This may be viewed as a first step to a general theory of cooperative communication in distributed systems. An honest message is one that is known to be true when it is sent (or said). If every message that is sent is honest, then of course every message that is sent is true. Various weaker considerations than honesty (...) are investigated with the property that provided every message sent satisfies the condition, then every message sent is true. (shrink)

The complexity of the set of truths of arithmetic is determined for various theories of truth deriving from Kripke and from Gupta and Herzberger.

This paper develops a classical model for our ordinary use of the truth predicate (1) that is able to address the liar's paradox and (2) that satisfies a very strong version of deflationism. Since the model is a classical in the sense that it has no truth value gaps, the model is able to address Tarski's indictment of our ordinary use of the predicate as inconsistent. Moreover, since it is able to address the liar's paradox, it responds to arguments against (...) deflationism based upon that paradox alone. The model is based upon a notion of the complexity of propositions that a fixed set of speakers might express. A context-sensitive definition of the truth predicate is then provided based upon a class of possible worlds defined in terms of these speakers. Reasonable constraints on the memories and lifetimes of ordinary speakers are used to limit the set of propositions that they might express so that deflationist requirements are satisfied. (shrink)

In defense of the minimalist conception of truth, Paul Horwich(2001) has recently argued that our acceptance of the instances of the schema,`the proposition that p is true if and only if p', suffices to explain our acceptanceof truth generalizations, that is, of general claims formulated using the truth predicate.In this paper, I consider the strategy Horwich develops for explaining our acceptance of truth generalizations. As I show, while perhaps workable on its own, the strategy is in conflictwith his response to (...) the liar paradox. Something must give. I consider and reject variousalternatives and emendations to the strategy. In order to resolve the conflict,I propose an alternative approach to the liar, one that supports Horwich's strategywhile leaving minimalism maximally uncompromised. (shrink)

Alice has insomnia. She has trouble falling asleep and part of the problem is that she worries about it and realizes that her worrying about it tends to keep from falling asleep. It occurs to her that thinking that she will not be able to fall asleep may be a kind of self-fulfilling prophecy. Perhaps she even has a thought that might be expressed like this: I am not going to fall asleep because of my having this very thought. This (...) thought attributes to itself the property of keeping her awake. (shrink)

This volume draws connections between Wittgenstein's philosophy and the work of Saul Kripke, especially his Naming and Necessity. Saul Kripke is regarded as one of the foremost representatives of contemporary analytic philosophy. His most important contributions include the strict distinction between metaphysical and epistemological questions, the introduction of the notions of contingent a priori truth and necessary a posteriori truth and original accounts of names, descriptions, identity, necessity and realism. The chapters in this book elucidate the relevant connections between Kripke's (...) work and Wittgenstein, specifically concerning the standard meter, contingent apriori and rule-following. The contributions shed light on how Kripke's philosophical outlook was influenced by Wittgenstein, and how mainstream analytic philosophy and Wittgensteinian philosophy can fruitfully engage with one another. Kripke and Wittgenstein will be of interest to philosophers working on Wittgenstein, Kripke, and the history of analytic philosophy. (shrink)

Two semantic paradoxes, the Liar and Curry’s paradox, are analysed using a newly developed conception of procedural semantics (semantics according to which the truth of propositions is determined algorithmically), whose main characteristic is its departure from methodological realism. Rather than determining pre-existing facts, procedures are constitutive of them. Of this semantics, two versions are considered: closed (where the halting of procedures is presumed) and open (without this presumption). To this end, a procedural approach to deductive reasoning is developed, based on (...) the idea of simulation. As is shown, closed semantics supports classical logic, but cannot in any straightforward way accommodate the concept of truth. In open semantics, where paradoxical propositions naturally ‘belong’, they cease to be paradoxical; yet, it is concluded that the natural choice—for logicians and common people alike—is to stick to closed semantics, pragmatically circumventing problematic utterances. (shrink)

This paper aims to explore the relationship between the necessity predicate and the truth predicate by comparing two possible-world interpretations. The first interpretation, proposed by Halbach et al. (J Philos Log 32(2):179–223, 2003), is for the necessity predicate, and the second, proposed by Hsiung (Stud Log 91(2):239–271, 2009), is for the truth predicate. To achieve this goal, we examine the connections and differences between paradoxical sentences that involve either the necessity predicate or the truth predicate. A primary connection is established (...) through two translations that change only one of the predicates to the other while keeping everything else unchanged. We prove that in bijective frames, a set of sentences that contains one of the two semantic predicates has the same paradoxicality as the corresponding set of sentences that contains the other predicate obtained through translation. However, there are substantial differences as well. First, the necessity predicate and the truth predicate, under the two interpretations, cannot be defined by each other. Moreover, for sentences that involve only the truth predicate, their paradoxicality is preserved under the homomorphisms of frames. For sentences containing the necessity predicate, their paradoxicality is preserved under bounded morphisms, but none of these sentences can have their paradoxicality preserved under the extension of frames. Finally, we also show that paradoxical sentences involving the necessity predicate and those involving the truth predicate differ significantly in terms of mirror symmetry, circularity dependence, and frame compactness. (shrink)

Dialetheists believe some sentences are both true and false. Objectors have argued that this makes it unclear how people can disagree with each other because, given the dialetheist’s commitments, if I make a claim and you tell me my claim is false, we might both be correct. Graham Priest (2006a) thinks that people disagree by rejecting or denying what is said rather than ascribing falsehood to it. We build on the work of Julien Murzi and Massimiliano Carrara (2015) and show (...) that Priest’s approach cannot succeed: given the same dialetheist’s commitments you may be correct to reject a claim that I correctly believe. We argue further that any attempt to solve the problem by identifying a new attitude of disagreement will also fail. The culprit, we claim, is the attempt to find a pair of attitudes that satisfy ‘exclusivity’—that is, attitudes such that both cannot be simultaneously correct. Instead of identifying disagreement by the kinds of attitudes involved, we propose dialetheists focus on the normative landscape and identify it in part by whether parties have reasons to change their attitudes. We offer our own normative theory of disagreement to help dialetheists with this challenge. (shrink)

Bounds consequence provides an interpretation of a multiple-conclusion consequence relation in which the derivability of a sequent is understood as the claim that it is conversationally out-of-bounds to take a position in which each member of Γ is asserted while each member of Δ is denied. Two of the foremost champions of bounds consequence—Greg Restall and David Ripley—have independently indicated that the shape of the bounds in question is determined by conversational practice. In this paper, I suggest that the standard (...) treatments of bounds consequence have focused heavily on the matter of veridicality at the expense of ignoring other features by which conversational bounds are set, prime among them being the matter of content or subject-matter. Furthermore, I argue that the semantic behavior of propositions containing “monstrous” content—content whose introduction is inappropriate to a context independently of veridical considerations—leads to a weak Kleene account of bounds consequence. (shrink)

Richard Heck has recently drawn attention on a new version of the Liar Paradox, one which relies on logical resources that are so weak as to suggest that it may not admit of any ‘‘truly satisfying, consistent solution’’. I argue that this conclusion is too strong. Heck’s Liar reduces to absurdity principles that are already rejected by consistent paracomplete theories of truth, such as Kripke’s and Field’s. Moreover, the new Liar gives us no reasons to think that these principles cannot (...) be consistently retained once the structural rule of contraction is restricted. I suggest that revisionary logicians have independent reasons for restricting such a rule. (shrink)

El excepcionalismo de la lógica asume que la lógica tiene un estatus epistemológico privilegiado, es normativa y no es revisable. El antiexcepcionalismo, en cambio, rechaza ese carácter excepcional. Recientemente, se ha sugerido que el problema de la adopción de reglas lógicas es transversal a la discusión que se da entre excepcionalistas y antiexcepcionalistas. En este trabajo defiendo la tesis contraria. En particular, sostengo que, si el problema de la adopción de reglas es un problema central para la lógica como disciplina, (...) el antiexcepcionalismo debe ser incorrecto. En caso contrario, debe ser incorrecta la postura excepcionalista. Evalúo, además, consecuencias directas del análisis presente sobre la discusión en torno al monismo y el pluralismo de la lógica. (shrink)

In “Some Remarks on Extending and Interpreting Theories with a Partial Truth Predicate”, Reinhardt [21] famously proposed an instrumentalist interpretation of the truth theory Kripke–Feferman ( $\mathrm {KF}$ ) in analogy to Hilbert’s program. Reinhardt suggested to view $\mathrm {KF}$ as a tool for generating “the significant part of $\mathrm {KF}$ ”, that is, as a tool for deriving sentences of the form $\mathrm{Tr}\ulcorner {\varphi }\urcorner $. The constitutive question of Reinhardt’s program was whether it was possible “to justify the (...) use of nonsignificant sentences entirely within the framework of significant sentences”. This question was answered negatively by Halbach & Horsten [10] but we argue that under a more careful interpretation the question may receive a positive answer. To this end, we propose to shift attention from $\mathrm {KF}$ -provably true sentences to $\mathrm {KF}$ -provably true inferences, that is, we shall identify the significant part of $\mathrm {KF}$ with the set of pairs $\langle {\Gamma, \Delta }\rangle $, such that $\mathrm {KF}$ proves that if all members of $\Gamma $ are true, at least one member of $\Delta $ is true. In way of addressing Reinhardt’s question we show that the provably true inferences of suitable $\mathrm {KF}$ -like theories coincide with the provable sequents of matching versions of the theory Partial Kripke–Feferman ( $\mathrm {PKF}$ ). (shrink)

This paper continues my work of [9], which showed there was a broad family of many valued logics that have a strict/tolerant counterpart. Here we consider a generalization of weak Kleene three valued logic, instead of the strong version that was background for that earlier work. We explain the intuition behind that generalization, then determine a subclass of strict/tolerant structures in which a generalization of weak Kleene logic produces the same results that the strong Kleene generalization did. This paper provides (...) much background, but is not self-contained. Some results from [9] are called on, and are not reproved here. [9] Melvin C. Fitting. “A Family of Strict/Tolerant Logics”. In: Journal of Philosophical Logic. Online. Print publication forthcoming. (shrink)

The liar paradox is a famous and ancient paradox related to logic and philosophy. It shows it is perfectly possible to construct sentences that are correct grammatically and semantically but that cannot be true or false in the traditional sense. In this paper the authors show four approaches to interpreting paradoxes that illustrate the influence of: the levels of language, their belonging to indeterminate compatible propositions or indeterminate propositions, being based on universal antinomy and the theory of dialetheism.

Epistemic Logic is our basic universal science, the method of our cognitive confrontation in reality to prove the truth of our basic cognitions and theories. Hence, by proving their true representation of reality we can self-control ourselves in it, and thus refuting the Berkeleyian solipsism and Kantian a priorism. The conception of epistemic logic is that only by proving our true representation of reality we achieve our knowledge of it, and thus we can prove our cognitions to be either true (...) or rather false, and otherwise they are doubtful. Therefore, truth cannot be separated from being proved and we cannot hold anymore the principle of excluded middle, as it is with formal semantics of metaphysical realism. In distinction, the intuitionistic logic is based on subjective intellectual feeling of correctness in constructing proofs, and thus it is epistemologically encapsulated in the metaphysical subject. However, epistemic logic is our basic science which enable us to prove the truth of our cognitions, including the epistemic logic itself. (shrink)

Kremer presented three approaches of comparing fixed-point and revision theories of truth in Kremer, 363–403, 2009). Using these approaches, he established the relationships among ten fixed-point theories suggested by Kripke in, 690–716, 1975) and three revision theories presented by Gupta and Belnap in. This paper continues Kremer’s work. We add five other revision theories to the comparisons, including the theory proposed by Gupta in, 1–60, 1982), the theory proposed by Herzberger in, 61–102, 1982), the theory based on fully-varied revision sequences (...) proposed by Gupta and Belnap in, the theory proposed by Yaqūb in, and the theory based on weakly consistent revision sequences. We show that, the notion of Thomason model defined by Belnap’s limit rule is not equivalent to the one defined by Gupta’s limit rule, and that the theory based on fully-varied revision sequences is ≤2-equivalent to the one based on the greatest intrinsic fixed point of σ. (shrink)

In this paper, I argue against present accounts of anti-exceptionalism about logic, while preserving some of their insights. I will do that by offering objections against the anti-exceptionalists’ claims that revisions happen in the same way in sciences and in logic, and that the methodology of logic involves abduction simpliciter. I propose a new account of theory divergence for logic with anti-exceptionalist aspects which also preserves exceptionalism on some level while considering the role of metalogic in the exceptionalist/anti-exceptionalist debate.

Most discussions frame the Liar Paradox as a formal logical-linguistic puzzle. Attempts to resolve the paradox have focused very little so far on aspects of cognitive psychology and processing, because semantic and cognitive-psychological issues are generally assumed to be disjunct. I provide a motivation and carry out a cognitive-computational treatment of the liar paradox based on a model of language and conceptual knowledge within thePredictive Processing(PP) framework. I suggest that the paradox arises as a failure of synchronization between two ways (...) of generating the liar situation in two different (idealized) PP sub-models, one corresponding to language processing and the other to the processing of meaning and world-knowledge. In this way, I put forward the claim that the liar sentence is meaningless but has an air of meaningfulness. I address the possible objection that the proposal violates thePrinciple of Unrestricted Compositionality, which purportedly regulates the conceptual competence of thinkers. (shrink)

Given the plethora of competing logical theories of validity available, it’s understandable that there has been a marked increase in interest in logical epistemology within the literature. If we are to choose between these logical theories, we require a good understanding of the suitable criteria we ought to judge according to. However, so far there’s been a lack of appreciation of how logical practice could support an epistemology of logic. This paper aims to correct that error, by arguing for a (...) practice-based approach to logical epistemology. By looking at the types of evidence logicians actually appeal to in attempting to support their theories, we can provide a more detailed and realistic picture of logical epistemology. To demonstrate the fruitfulness of a practice-based approach, we look to a particular case of logical argumentation—the dialetheist’s arguments based upon the self-referential paradoxes—and show that the evidence appealed to support a particular theory of logical epistemology, logical abductivism. (shrink)

In this paper, we use a ‘normality operator’ in order to generate logics of formal inconsistency and logics of formal undeterminedness from any subclassical many-valued logic that enjoys a truth-functional semantics. Normality operators express, in any many-valued logic, that a given formula has a classical truth value. In the first part of the paper we provide some setup and focus on many-valued logics that satisfy some of the three properties, namely subclassicality and two properties that we call fixed-point negation property (...) and conservativeness. In the second part of the paper, we introduce normality operators and explore their formal behaviour. In the third and final part of the paper, we establish a number of classical recapture results for systems of formal inconsistency and formal undeterminedness that satisfy some or all the properties above. These are the main formal results of the paper. Also, we illustrate concrete cases of recapture by discussing the logics $\mathsf{K}^{\circledast }_{3}$, $\mathsf{LP}^{\circledast }$, $\mathsf{K}^{w\circledast }_{3}$, $\mathsf{PWK}^{\circledast }$ and $\mathsf{E_{fde}}^{\circledast }$, that are in turn extensions of $\mathsf{{K}_{3}}$, $\mathsf{LP}$, $\mathsf{K}^{w}_{3}$, $\mathsf{PWK}$ and $\mathsf{E_{fde}}$, respectively. (shrink)

It seems that the Truth-teller is either true or false, but there is no accepted principle determining which it is. From this point of view, the Truth-teller is a hypodox. A hypodox is a conundrum like a paradox, but consistent. Sometimes, accepting an additional principle will convert a hypodox into a paradox. Conversely, in some cases, retracting or restricting a principle will convert a paradox to a hypodox. This last point suggests a new method of avoiding inconsistency. This article provides (...) a significant example. The Liar paradox can be defused to a hypodox by relatively minimally restricting three principles: the T-schema, substitution of identicals and universal instantiation. These restrictions are not arbitrary. For each, I identify the source of a contradiction given some presumptions. Then I propose each restriction as a reasonable way to deal with that source of contradiction. (shrink)

ABSTRACTKevin Scharp’s ‘Replacing Truth’ is an ambitious and far reaching account of the semantic paradoxes. In this critical discussion we examine one the books central claims: to have provided a theory of truth that avoids the revenge paradoxes. In the first part we assess this claim, and in the second part we investigate some features of Scharp’s preferred theory of truth, ADT, and compare it with existing theories such as the Kripke–Feferman theory. In the appendix a simple model of Scharp’s (...) theory is presented, and some potential consistent ways to strengthen the theory are suggested. (shrink)

In this paper we apply proof theoretic methods used for classical systems in order to obtain upper bounds for systems in partial logic. We focus on a truth predicate interpreted in a Kripke style way via strong Kleene; whereas the aim is to connect harmoniously the partial version of Kripke–Feferman with its intended semantics. The method we apply is based on infinitary proof systems containing an ω-rule.

Horwich proposes a solution to the liar paradox that relies on a particular notion of grounding—one that, unlike Kripke’s notion of grounding, does not invoke any “Tarski-style compositional principles”. In this short note, we will formalize Horwich’s construction and argue that his solution to the liar paradox does not justify certain generalizations about truth that he endorses. We argue that this situation is not resolved even if one appeals to the \-rule. In the final section, we briefly discuss how Horwich (...) might respond to the situation. (shrink)

Jamie Tappenden was one of the first authors to entertain the possibility of a common treatment for the Liar and the Sorites paradoxes. In order to deal with these two paradoxes he proposed using the Strong Kleene semantic scheme. This strategy left unexplained our tendency to regard as true certain sentences which, according to this semantic scheme, should lack truth value. Tappenden tried to solve this problem by using a new speech act, articulation. Unlike assertion, which implies truth, articulation only (...) implies non-falsity. In this paper I argue that Tappenden’s strategy cannot be successfully applied to truth and the Liar. (shrink)

This piece continues the tradition of arguments by John Lucas, Roger Penrose and others to the effect that the human mind is not a machine. Kurt Gödel thought that the intensional paradoxes stand in the way of proving that the mind is not a machine. According to Gödel, a successful proof that the mind is not a machine would require a solution to the intensional paradoxes. We provide what might seem to be a partial vindication of Gödel and show that (...) if a particular solution to the intensional paradoxes is adopted, one can indeed give an argument to the effect that the mind is not a machine. (shrink)

According to the implicit commitment thesis, once accepting a mathematical formal system S, one is implicitly committed to additional resources not immediately available in S. Traditionally, this thesis has been understood as entailing that, in accepting S, we are bound to accept reflection principles for S and therefore claims in the language of S that are not derivable in S itself. It has recently become clear, however, that such reading of the implicit commitment thesis cannot be compatible with well-established positions (...) in the foundations of mathematics which consider a specific theory S as self-justifying and doubt the legitimacy of any principle that is not derivable in S: examples are Tait’s finitism and the role played in it by Primitive Recursive Arithmetic, Isaacson’s thesis and Peano Arithmetic, Nelson’s ultrafinitism and sub-exponential arithmetical systems. This casts doubts on the very adequacy of the implicit commitment thesis for arithmetical theories. In the paper we show that such foundational standpoints are nonetheless compatible with the implicit commitment thesis. We also show that they can even be compatible with genuine soundness extensions of S with suitable form of reflection. The analysis we propose is as follows: when accepting a system S, we are bound to accept a fixed set of principles extending S and expressing minimal soundness requirements for S, such as the fact that the non-logical axioms of S are true. We call this invariant component the semantic core of implicit commitment. But there is also a variable component of implicit commitment that crucially depends on the justification given for our acceptance of S in which, for instance, may or may not appear reflection principles for S. We claim that the proposed framework regulates in a natural and uniform way our acceptance of different arithmetical theories. (shrink)

We discuss the principles for a primitive, object-linguistic notion of consequence proposed by ) that yield a version of Curry’s paradox. We propose and study several strategies to weaken these principles and overcome paradox: all these strategies are based on the intuition that the object-linguistic consequence predicate internalizes whichever meta-linguistic notion of consequence we accept in the first place. To these solutions will correspond different conceptions of consequence. In one possible reading of these principles, they give rise to a notion (...) of logical consequence: we study the corresponding theory of validity by showing that it is conservative over a wide range of base theories: this result is achieved via a well-behaved form of local reduction. The theory of logical consequence is based on a restriction of the introduction rule for the consequence predicate. To unrestrictedly maintain this principle, we develop a conception of object-linguistic consequence, which we call grounded consequence, that displays a restriction of the structural rule of reflexivity. This construction is obtained by generalizing Saul Kripke’s inductive theory of truth. Grounded validity will be shown to satisfy several desirable principles for a naïve, self-applicable notion of consequence. (shrink)

The paper contains a survey on the complexity of various truth hierarchies arising in Kripke’s theory. I present some new arguments, and use them to obtain a number of interesting generalisations of known results. These arguments are both relatively simple, involving only the basic machinery of constructive ordinals, and very general.

According to David Lewis, the argument from temporary intrinsics is ‘the principal and decisive objection against endurance’. I focus on eternalist endurantism, discussing three different ways the eternalist endurantist can try to avoid treating temporary intrinsics as relational. Two of them, generally known as ‘adverbialism’ and ‘SOFism’, are familiar and controversial. I scrutinize them and argue that Lewis’ scepticism about them is well founded. Then, I sketch a further, to some extent new, version of eternalist endurantism, where the key idea (...) is that intrinsic monadic properties had simpliciter by objects are eternal, time-transcendent properties in Fine’s sense, i.e., properties had by objects regardless of time. Eternal properties of an object are ipso facto sempiternal. When something is P at one time and not P at another, it is radically indeterminate whether it is Psimpliciter or not. I argue that an account along these lines is better placed to treat intrinsic monadic properties of changing objects than any other known alternatives insofar as it recognizes that something is Psimpliciter ; it is able to account for x’s being P at a time in terms of something’s being P simpliciter; it has an answer to the question ‘is \simpliciter?’ when x is P at one time and not P at another. I conclude that endurantism is no less at ease with intrinsics than perdurantism is. (shrink)

The aim of this paper is to show that it’s not a good idea to have a theory of truth that is consistent but ω-inconsistent. In order to bring out this point, it is useful to consider a particular case: Yablo’s Paradox. In theories of truth without standard models, the introduction of the truth-predicate to a first order theory does not maintain the standard ontology. Firstly, I exhibit some conceptual problems that follow from so introducing it. Secondly, I show that (...) in second order theories with standard semantics the same procedure yields a theory that doesn’t have models. So, while having an ω- inconsistent theory is a bad thing, having an unsatisfiable theory of truth is actually worse. This casts doubts on whether the predicate in question is, after all, a truthpredicate for that language. Finally, I present some alternatives to prove an inconsistency adding plausible principles to certain theories of truth. (shrink)