A tight connection between competence and performance is a central tenet of the usage-based model. Methodologically, however, corpus frequency is a poor predictor of acceptability – a phenomenon known as the “frequency/acceptability mismatch”. This article argues that the mismatch arises from a “methodological mismatch”, when simple frequency measures are mapped onto complex grammatical units. To illustrate, we discuss the results of acceptability judgments of go/come-v. The construction is subject to a formal constraint (Go see the doctor! vs. *He goes sees (...) the doctor), which results from its mandative semantics (directives, commissives). While a formal model makes no prediction with regard to gradient acceptability of bare (“grammatical”) go/come-v, the usage-based view assumes that acceptability is a function of compatibility with an abstract schema. The experimental ratings are compared with a number of corpus-derived measures: while acceptability is largely independent of (raw) frequency, it is not independent of frequency-related usage distribution. The results add to recent suggestions that the frequency/acceptability mismatch is substantially reduced if the syntactic complexity of a unit is appropriately captured in usage data. (shrink)

-/- A schema (plural: schemata, or schemas), also known as a scheme (plural: schemes), is a linguistic template or pattern together with a rule for using it to specify a potentially infinite multitude of phrases, sentences, or arguments, which are called instances of the schema. Schemas are used in logic to specify rules of inference, in mathematics to describe theories with infinitely many axioms, and in semantics to give adequacy conditions for definitions of truth. -/- 1. What is (...) a Schema? 2. Uses of Schemas 3. The Ontological Status of Schemas 4. Schemas in the History of Logic Bibliography. (shrink)

If we want to retain classical logic and standard syntax in light of the liar, we are forced to restrict the T-schema. The traditional philosophical justification for this is sentential – liar sentences somehow malfunction. But the standard formal way of implementing this is conditional, our T-sentences tell us that if “p” does not malfunction, then “p” is true if and only if p. Recently Bacon and others have pointed out that conditional T-restrictions like this flirt with incoherence. If (...) we want to keep the “malfunction” motivation, our only other option is to non-conditionally restrict the T-schema, but Field and others have given powerful philosophical and technical arguments against this kind of approach. Here I argue that if we really take the philosophical motivation for restricting T-sentences seriously, we can explain why conditional restrictions fail, answer Field's argument, and reason in a coherent way about truth using a non-conditional restriction strategy. This cracks the door open for a fully classical response to the liar and related paradoxes. In closing, I argue that, when properly understood, this kind of “restriction” is not really a restriction at all. If this is right, then the holy grail of liar studies (classical logic, naïve truth, and standard syntax) may yet be attainable. (Note for readers: when this paper was first put online, the typesetters had changed some instances of corners to brackets, leading to confusion. The paper has now been corrected online by PPR, so please make sure you have the corrected version before reading or citing.). (shrink)

The syllogistic figures and moods can be taken to be argument schemata as can the rules of the Stoic propositional logic. Sentence schemata have been used in axiomatizations of logic only since the landmark 1927 von Neumann paper [31]. Modern philosophers know the role of schemata in explications of the semantic conception of truth through Tarski’s 1933 Convention T [42]. Mathematical logicians recognize the role of schemata in first-order number theory where Peano’s second-order Induction Axiom is approximated by Herbrand’s (...) Induction-Axiom Schema [23]. Similarly, in first-order set theory, Zermelo’s second-order Separation Axiom is approximated by Fraenkel’s first-order Separation Schema [17]. In some of several closely related senses, a schema is a complex system having multiple components one of which is a template-text or scheme-template, a syntactic string composed of one or more “blanks” and also possibly significant words and/or symbols. In accordance with a side condition the template-text of a schema is used as a “template” to specify a multitude, often infinite, of linguistic expressions such as phrases, sentences, or argument-texts, called instances of the schema. The side condition is a second component. The collection of instances may but need not be regarded as a third component. The instances are almost always considered to come from a previously identified language (whether formal or natural), which is often considered to be another component. This article reviews the often-conflicting uses of the expressions ‘schema’ and ‘scheme’ in the literature of logic. It discusses the different definitions presupposed by those uses. And it examines the ontological and epistemic presuppositions circumvented or mooted by the use of schemata, as well as the ontological and epistemic presuppositions engendered by their use. In short, this paper is an introduction to the history and philosophy of schemata. (shrink)

Bilateral proof systems, which provide rules for both affirming and denying sentences, have been prominent in the development of proof-theoretic semantics for classical logic in recent years. However, such systems provide a substantial amount of freedom in the formulation of the rules, and, as a result, a number of different sets of rules have been put forward as definitive of the meanings of the classical connectives. In this paper, I argue that a single general schema for bilateral proof rules (...) has a reasonable claim to inferentially articulating the core meaning of all of the classical connectives. I propose this schema in the context of a bilateral sequent calculus in which each connective is given exactly two rules: a rule for affirmation and a rule for denial. Positive and negative rules for all of the classical connectives are given by a single rule schema, harmony between these positive and negative rules is established at the schematic level by a pair of elimination theorems, and the truth-conditions for all of the classical connectives are read off at once from the schema itself. (shrink)

It is shown that the logical truth of instances of the T-schema is incompatible with the formal nature of logical truth. In particular, since the formality of logical truth entails that the set of logical truths is closed under substitution, the logical truth of T-schema instances entails that all sentences are logical truths.

We study the fragment of Peano arithmetic formalizing the induction principle for the class of decidable predicates, $I\Delta_1$ . We show that $I\Delta_1$ is independent from the set of all true arithmetical $\Pi_2-sentences$ . Moreover, we establish the connections between this theory and some classes of oracle computable functions with restrictions on the allowed number of queries. We also obtain some conservation and independence results for parameter free and inference rule forms of $\Delta_1-induction$ . An open problem formulated by J. (...) Paris is whether $I\Delta_1$ proves the corresponding least element principle for decidable predicates, $L\Delta_1$ (or, equivalently. the $\Sigma_1-collection$ principle $B\Sigma_1$ ). We reduce this question to a purely computation-theoretic one. (shrink)

The starting point of this paper is the empirically determined ability to reason in natural language by employing probable sentences. A sentence is understood to be logically probable if its schema, expressed as a formula in the language of classical propositional calculus, takes the logical value of truth for the majority of Boolean valuations, i.e., as a logically probable formula. Then, the formal system P is developed to encode the set of these logically probable formulas. Based on natural (...) semantics, a strong completeness theorem for P is proved. Alternative notions of consequence for logically probable sentences are also considered. (shrink)

A mathematical theory T is categorical if, and only if, any two models of T are isomorphic. If T is categorical, it can be shown to be semantically complete: for every sentence ϕ in the language of T, either ϕ follows semantically from T or ¬ϕ does. For this reason some authors maintain that categoricity theorems are philosophically significant: they support the realist thesis that mathematical statements have determinate truth-values. Second-order arithmetic (PA2) is a case in hand: it can (...) be shown to be categorical and semantically complete. The status of second-order logic is a controversial issue, however. Worries about the purported set-theoretic nature and ontological commitments of second-order logic have been influential in the debate. (shrink)

Answering a question formulated by Halbach (2009), I show that a disquotational truth theory, which takes as axioms all positive substitutions of the sentential T-schema, together with all instances of induction in the language with the truth predicate, is conservative over its syntactical base.

Holyoak and Cheng 's account of Wason's selection task was evaluated by testing participants' recognition memory for the rule. To accommodate the finding that participants' selections are systematically influenced by manipulating their perspective on the rule to be tested, Holyoak and Cheng put forward a development of Pragmatic Reasoning Schema theory, according to which the rule being tested is mapped onto different schematic rules depending on the perspective taken. The instantiated schema then becomes the basis for reasoning, and (...) the different schemas encourage the selection of different cases. We hypothesised that if participants interpret the rule by instantiating a particular schema, then they should falsely recognise a sentence corresponding to the instantiated schema a short time after performing the task. An experimental test provided limited support for this hypothesis. (shrink)

Desde que Tarski publicó su estudio sobreel concepto de verdad en los años 30, hasido una práctica ortodoxa el considerarque t oda i nst anci a del esquema T esverdadera. Sin embargo, algunas instanciasdel esquema son falsas. Éstas incluyen lasi nst anci as paradój i cas ej empl i f i cadaspor la oración del mentiroso. Aquí sedemuestra que un esquema mejor permiteun tratamiento uniforme de la verdad enel que las paradojas semánticas resultanser simplemente falsas.Si nc e Ta r s (...) ki publ i s he d hi s s t udy ofthe concept of truth in the 1930s, it hasbeen orthodox practice to suppose thatevery instance of the T-schema is true.However, some instances of the schemaare false. These include the paradoxicalinstances exemplified by the Liar sentence.It is shown that a better schema allows auniform treatment of truth in which thesemantic paradoxes turn out to be simplyfalse. (shrink)

Consider the following sentence schema:This sentence entails that ϕ.Call a sentence which is obtained from this schema by the substitution of an arbitrary, contingent sentence, s, for ϕ, the sentence CS. Thus, This sentence entails that s.Now ask the following question: Is CS true?One sentence classically entails a second if and only if it is impossible for both the first to be true and the second to be false. Thus ‘Xanthippe is (...) a mother’ entails ‘Xanthippe is female’ if and only if it is impossible for both ‘Xanthippe is a mother’ to be true and ‘Xanthippe is female’ to be false. CS makes a claim about a purported entailment. Thus, CS is true if and only if it is impossible for both the sentence it mentions as entailing a second to be true and the sentence it mentions as being entailed by the first to be false. In other words, CS is true if and only if it is impossible for both CS to be true and s to be false. In yet other words, CS is false if and only if it is possible for both CS to be true and s to be false. (shrink)

The expressions ‘form’, ‘structure’, ‘schema’, ‘shape’, ‘pattern’, ‘figure’, ‘mold’, and related locutions are used in logic both as technical terms and in metaphors. This paper juxtaposes, distinguishes, and analyses uses of [FOR these PUT such] expressions by logicians. No [FOR such PUT similar] project has been attempted previously. After establishing general terminology, we present a variant of traditional usage of the expression ‘logical form’ followed by a discussion of the usage found in the two-volume Chateaubriand book Logical Forms (2001 (...) and 2005)—the most comprehensive work on the subject ever written and in many ways the focus of this paper. Key Words: morphology, character, sense, sentence, proposition, form, structure, schema, alternative constituent, type, token . (shrink)

The Liar paradox is an obstacle to a theory of truth, but a Liar sentence need not contain a semantic predicate. The Pinocchio paradox, devised by Veronique Eldridge-Smith, was the first published paradox to show this. Pinocchio’s nose grows if, and only if, what Pinocchio is saying is untrue. What happens if Pinocchio says that his nose is growing? Eldridge-Smith and Eldridge-Smith : 212-5, 2010) posed the Pinocchio paradox against the Tarskian-Kripkean solutions to the Liar paradox that use language (...) hierarchies. Eldridge-Smith : 306-8, 2011) also set the Pinocchio paradox against semantic dialetheic solutions to the Liar. Beall argued the Pinocchio story was just an impossible story. Eldridge-Smith : 749-752, 2012b) responded that unless the T-schema is a necessary truth of some sort, the Pinocchio principle is possible. Luna : 77–86, 2016) argues that the Pinocchio contradiction proves the principle is false. D’Agostini & Ficara discuss a more plausible physical truth-tracking trait, the Blushing Liar, and argue that the Pinocchio contradiction is not a metaphysical dialetheia. I respond to Luna, and D’Agostini & Ficara, and prove that the Pinocchio paradox is a counterexample to hierarchical solutions to the Liar. (shrink)

T-biconditionals have often been regarded as insufficient as axioms for truth. This verdict is based on Tarski’s observation that the typed T-sentences suffer from deductive weakness. As indicated by McGee, the situation might change radically if we consider type-free disquotational theories of truth. However, finding a well-motivated set of untyped T-biconditionals that is consistent and recursively enumerable has proven to be very difficult. Moreover, some authors ) have argued that any solution to the semantic paradoxes necessarily involves ‘inflationary’ means, thus (...) spelling doom to deflationist and minimalist truth theories in particular. The situation is indeed worrisome as formal theories of minimalist truth are missing so far. This makes it very hard to properly evaluate the tenets of minimalism. In the present article, we will show how to find safe instances of the T-schema just by relying on syntactic features of the sentences of our language—in particular, we will explore Quine’s idea of stratification. Based on that, we will introduce some disquotational truth theories that are deductively very strong. (shrink)

There are two contending models regarding the processing of negation: the fusion model and the schema-plus-tag model. Most previous studies have centered on negation in languages such as English and Mandarin, where negators are positioned before predicates. Mongolian, quite uniquely, is a language whose negators are post-verbal, making them natural replicas of the schema-plus-tag model. The present study aims to investigate the representation process of Mongolian contradictory negative sentences to shed light on the debate between the models, meanwhile (...) verifying the post-verbal effect of negators. A series of experiments using the sentence–picture verification paradigm supports the fusion model: Mongolian contradictory negative sentences were processed by representing the actual conditions rather than the negated state of affairs at 250 ISI, and despite the fact that a post-verbal effect of negators was measured at 250 ISI when Mongolian and Mandarin negative sentences were compared, Mongolian–Mandarin bilinguals adopted the same representational strategy for contradictory negation in both languages. (shrink)

Paul Ricoeur uncovered the creative aspect of language in his theory of metaphor. The metaphor is a special combination of words that as a clash of distant semantic fields forces the reader to interpret the sentence in a new way and see things in a new light. It is a process in which the imagination plays an important role. Ricoeur compares the metaphor to the Kantian schema which is a procedure to provide an image to a concept. The (...) image helps in the process of assimilating distant elements and thus to achieve a new interpretation. To change perspective the suspension of reference is also needed. The aim of this essay is to analyze the imaginative functions which are operative in the metaphor and look for an answer to the question about the role of the imagination as a productive power as well as a power of internal intuitions. (shrink)

Much has been written of late concerning the relative virtues and views of correspondence and deflationary theories of Truth. What is troubling, however, is that it is not always entirely clear exactly what distinguishes different conceptions of truth. Characterizations of the distinction are often vague and sometimes vary from writer to writer. One central thing I want to do here is to diagnose the source of the difficulty in providing a clear characterization of the distinction. In light of this diagnosis, (...) I will argue that there is a simple distinguishing feature of such views. Roughly, the distinction depends on the modal status accorded to the T-sentences by the various conceptions. And finally, I will argue in favor of drawing the distinction in this way by showing that it yields a powerful method of arguing for or against a given conception of truth. (shrink)

The aim of the paper is to formulate rules of inference for the predicate 'is true' applied to sentences. A distinction is recognised between (ordinary) truth and definite truth and consequently between two notions of validity, depending on whether truth or definite truth is the property preserved in valid arguments. Appropriate sets of rules of inference governing the two predicates are devised. In each case the consequence relation is in harmony with the respective predicate. Particularly appealing is a set of (...) ND rules for ordinary truth in which premises and assumptions play different roles, premises being taken to assert definite truth, assumptions to suppose truth. This set of rules can be said to capture everyday reasoning with truth. Also presented are formal characterisations, in the meta-language and in the object language, of paradoxical and 'truth teller'-like sentences. (shrink)

Consider the following sentences: The neighbouring sentence is not true. The neighbouring sentence is not true. Call these the no-no sentences. Symmetry considerations dictate that the no-no sentences must both possess the same truth-value. Suppose they are both true. Given Tarski’s truth-schema—if a sentence S says that p then S is true iff p—and given what they say, they are both not true. Contradiction! Conclude: they are not both true. Suppose they are both false. Given Tarski’s (...) falsity-schema—if a sentence S says that p then S is false iff not-p—and given what they say, they are both true, and so not false. Contradiction! Conclude: they are not both false. Thus, despite their symmetry, the no-no sentences must differ in truth-value. Such is the no-no paradox.[1] Sorensen (2001, 2005a, 2005b) has argued that: (1) The no-no paradox is not a version of the liar but rather a cousin of the truth-teller paradox. (2) Even so, the no-no paradox is more paradoxical than the truth-teller. (3) The no-no and truth-teller sentences have groundless truthvalues—they are bivalent but give rise to “truthmaker gaps”. (4) It is metaphysically impossible to know these truth-values. (5) A truthmaker gap response to the no-no paradox provides reason to accept a version of epistemicism. In this paper it is shown that a truthmaker gap solution to the no-no and truth-teller paradoxes runs afoul of the dunno-dunno paradox, the strengthened no-no paradox, and the strengthened truth-teller paradox. In consequence, the no-no paradox is best seen as a form of the liar paradox. As such, it cannot provide a case for epistemicism. (shrink)

We study the arithmetical schema asserting that every eventually decreasing elementary recursive function has a limit. Some other related principles are also formulated. We establish their relationship with restricted parameter-free induction schemata. We also prove that the same principle, formulated as an inference rule, provides an axiomatization of the Σ2-consequences of IΣ1.Using these results we show that ILM is the logic of Π1-conservativity of any reasonable extension of parameter-free Π1-induction schema. This result, however, cannot be much improved: by (...) adapting a theorem of D. Zambella and G. Mints we show that the logic of Π1-conservativity of primitive recursive arithmetic properly extends ILM.In the third part of the paper we give an ordinal classification of -consequences of the standard fragments of Peano arithmetic in terms of reflection principles. This is interesting in view of the general program of ordinal analysis of theories, which in the most standard cases classifies Π-classes of sentences. (shrink)

We present a general schema of easy normalization proofs for finite systems S like first-order arithmetic or subsystems of analysis, which have good infinitary counterparts S ∞ . We consider a new system S ∞ + with essentially the same rules as S ∞ but different derivable objects: a derivation d∈S ∞ + of a sequent Γ contains a derivation Φ∈S of Γ . Three simple conditions on Φ including a normal form theorem for S ∞ + easily imply (...) a weak normalization theorem for S . We give three examples of application of this schema. First, we take S≡PA but restrict the attention to derivations of Σ 1 0 -sentences. In this case it is possible to take S ∞ + to be essentially standard formulation of PA ∞ . Next, we illustrate extension to subsystems of analysis and consider the system BI 1 ∗ of W. Buchholz having the strength of ID 1 , again for derivations of Σ 1 0 -sentences. Finally, we return to the first-order arithmetic to illustrate changes needed to treat derivations of arbitrary formulas. (shrink)

In this paper, I develop an essentialist model of the semantics of slurs. I defend the view that slurs are a species of kind terms: Slur concepts encode mini-theories which represent an essence-like element that is causally connected to a set of negatively-valenced stereotypical features of a social group. The truth-conditional contribution of slur nouns can then be captured by the following schema: For a given slur S of a social group G and a person P, S is true (...) of P iff P bears the “essence” of G—whatever this essence is—which is causally responsible for stereotypical negative features associated with G and predicted of P. Since there is no essence that is causally responsible for stereotypical negative features of a social group, slurs have null-extension, and consequently, many sentences containing them are either meaningless or false. After giving a detailed outline of my theory, I show that it receives strong linguistic support. In particular, it can account for a wide range of linguistic cases that are regarded as challenging, central data for any theory of slurs. Finally, I show that my theory also receives convergent support from cognitive psychology and psycholinguistics. (shrink)

Inquiry into the meaning of logical terms in natural language (‘and’, ‘or’, ‘not’, ‘if’) has generally proceeded along two dimensions. On the one hand, semantic theories aim to predict native speaker intuitions about the natural language sentences involving those logical terms. On the other hand, logical theories explore the formal properties of the translations of those terms into formal languages. Sometimes, these two lines of inquiry appear to be in tension: for instance, our best logical investigation into conditional connectives may (...) show that there is no conditional operator that has all the properties native speaker intuitions suggest if has. Indicative conditionals have famously been the source of one such tension, ever since the triviality proofs of both Lewis (1976) and Gibbard (1981) established conclusions which are in prima facie tension with ordinary judgments about natural language indicative conditionals. In a recent series of papers, Branden Fitelson has strengthened both triviality results (Fitelson 2013, 2015, 2016), revealing a common culprit: a logical schema known as IMPORT-EXPORT. Fitelson’s results focus the tension between the logical results and ordinary judgments, since IMPORT-EXPORT seems to be supported by intuitions about natural language. In this paper, we argue that the intuitions which have been taken to support IMPORT-EXPORT are really evidence for a closely related, but subtly different, principle. We show that the two principles are independent by showing how, given a standard assumption about the conditional operator in the formal language in which IMPORT-EXPORT is stated, many existing theories of indicative conditionals validate one, but not the other. Moreover, we argue that once we clearly distinguish these principles, we can use propositional anaphora to show that IMPORT-EXPORT is in fact not valid for natural language indicative conditionals (given this assumption about the formal conditional operator). This gives us a principled and independently motivated way of rejecting a crucial premise in many triviality results, while still making sense of the speaker intuitions which appeared to motivate that premise. We suggest that this strategy has broad application and an important lesson: in theorizing about the logic of natural language, we must pay careful attention to the translation between the formal languages in which logical results are typically proved, and natural languages which are the subject matter of semantic theory. (shrink)

The paper offers a solution to the semantic paradoxes, one in which (1) we keep the unrestricted truth schema “True(A)↔A”, and (2) the object language can include its own metalanguage. Because of the first feature, classical logic must be restricted, but full classical reasoning applies in “ordinary” contexts, including standard set theory. The more general logic that replaces classical logic includes a principle of substitutivity of equivalents, which with the truth schema leads to the general intersubstitutivity of True(A) (...) with A within the language.The logic is also shown to have the resources required to represent the way in which sentences (like the Liar sentence and the Curry sentence) that lead to paradox in classical logic are “defective”. We can in fact define a hierarchy of “defectiveness” predicates within the language. Contrary to claims that any solution to the paradoxes just breeds further paradoxes (“revenge problems”) involving defectiveness predicates, there is a general consistency/conservativeness proof that shows that talk of truth and the various “levels of defectiveness” can all be made coherent together within a single object language. (shrink)

Most work on the semantic paradoxes within classical logic has centered around what this essay calls “linguistic” accounts of the paradoxes: they attribute to sentences or utterances of sentences some property that is supposed to explain their paradoxical or nonparadoxical status. “No proposition” views are paradigm examples of linguistic theories, although practically all accounts of the paradoxes subscribe to some kind of linguistic theory. This essay shows that linguistic accounts of the paradoxes endorsing classical logic are subject to a particularly (...) acute form of the revenge paradox: that there is no exhaustive classification of sentences into “good” and “bad” such that the T-schema holds when restricted to the “good” sentences unless it is also possible to prove some “bad” sentences. The foundations for an alternative classical nonlinguistic approach is outlined that is not subject to the same kinds of problems. Although revenge paradoxes of different strengths can be formulated, they are found to be indeterminate at higher orders and not inconsistent. (shrink)

Contingency and accident are two important notions in philosophy and philosophical logic. Their meanings are so close that they are mixed up sometimes, in both daily life and academic research. This indicates that it is necessary to study them in a unified framework. However, there has been no logical research on them together. In this paper, we propose a language of a bimodal logic with these two concepts, investigate its model-theoretical properties such as expressivity and frame definability. We axiomatize this (...) logic over various classes of frames, whose completeness proofs are shown with the help of a crucial schema. The interactions between contingency and accident can sharpen our understanding of both notions. Then we extend the logic to a dynamic case: public announcements. By finding the required reduction axioms, we obtain a complete axiomatization, which gives us a good application to Moore sentences. (shrink)

Any consistent and sufficiently strong system of first-order formal arithmetic fails to decide some independent Gödel sentence. We examine consistent first-order extensions of such systems. Our purpose is to discover what is minimally required by way of such extension in order to be able to prove the Gödel sentence in a non-trivial fashion. The extended methods of formal proof must capture the essentials of the so-called 'semantical argument' for the truth of the Gödel sentence. We are concerned (...) to show that the deflationist has at his disposal such extended methods-methods which make no use or mention of a truth-predicate. This consideration leads us to reassess arguments recently advanced-one by Shapiro and another by Ketland-against the deflationist's account of truth. Their main point of agreement is this: they both adduce the Gödel phenomena as motivating a 'thick' notion of truth, rather than the deflationist's 'thin' notion. But the so-called 'semantical argument', which appears to involve a 'thick' notion of truth, does not really have to be semantical at all. It is, rather, a reflective argument. And the reflections upon a system that are contained therein are deflationarily licit, expressible without explicit use or mention of a truth-predicate. Thus it would appear that this anti-deflationist objection fails to establish that there has to be more to truth than mere conformity to the disquotational T-schema. (shrink)

Saunders Mac Lane has drawn attention many times, particularly in his book Mathematics: Form and Function, to the system of set theory of which the axioms are Extensionality, Null Set, Pairing, Union, Infinity, Power Set, Restricted Separation, Foundation, and Choice, to which system, afforced by the principle, , of Transitive Containment, we shall refer as . His system is naturally related to systems derived from topos-theoretic notions concerning the category of sets, and is, as Mac Lane emphasises, one that is (...) adequate for much of mathematics. In this paper we show that the consistency strength of Mac Lane's system is not increased by adding the axioms of Kripke–Platek set theory and even the Axiom of Constructibility to Mac Lane's axioms; our method requires a close study of Axiom H, which was proposed by Mitchell; we digress to apply these methods to subsystems of Zermelo set theory , and obtain an apparently new proof that is not finitely axiomatisable; we study Friedman's strengthening of , and the Forster–Kaye subsystem of , and use forcing over ill-founded models and forcing to establish independence results concerning and ; we show, again using ill-founded models, that proves the consistency of ; turning to systems that are type-theoretic in spirit or in fact, we show by arguments of Coret and Boffa that proves a weak form of Stratified Collection, and that is a conservative extension of for stratified sentences, from which we deduce that proves a strong stratified version of ; we analyse the known equiconsistency of with the simple theory of types and give Lake's proof that an instance of Mathematical Induction is unprovable in Mac Lane's system; we study a simple set theoretic assertion—namely that there exists an infinite set of infinite sets, no two of which have the same cardinal—and use it to establish the failure of the full schema of Stratified Collection in ; and we determine the point of failure of various other schemata in . The paper closes with some philosophical remarks. (shrink)

A notion of truth as applicable to events of assertoric use ( utterances ) of a sentence token is arguably presupposed and required by our evaluative practices of the use of language. The truth of an utterance seems clearly to depend on what the utterance says . This fundamental dependence seems in turn to be captured by the schema that, if an utterance u says that P , then u is true iff P . Such a schema (...) may thus be thought to constitute a suitable basis for an adequate theory of utterance truth, so much so that it seems straightforwardly to avoid the problems arising from context dependence and the semantic paradoxes which notoriously beset theories of utterance truth based on a simple disquotational schema. The paper argues that appearances are deceptive in both cases. On the one hand, the schema cannot allow for plausible if not uncontroversial non-indexical forms of context dependence, arising from the possibility that what an utterance says can be the case or not relative to different situations and that the truth of an utterance u of a sentence φ arguably depends on the truth of φ at the situation "associated" with u . On the other hand, a quantified utterance-truth variation on the liar paradox shows that the schema entails some consequence φ and at the same time the untruth of any utterance of φ; moreover, a resilient quantified propositional variation on the contingent liar paradox is offered, which only relies on resources usually employed by theories of utterance truth based on the schema. (shrink)

Many approaches to the semantics of generic sentences posit an unpronounced quantifier gen. However, while overt quantifiers are conservative, gen does not seem to be. A quantifier Q is conservative iff instances of the following schemas are equivalent: Q As are F and Q As are As that are F. All ravens are black is obviously equivalent to All ravens are ravens that are black, yet ravens are black is not equivalent to ravens are ravens that are black. This may (...) cast doubt on theviability of quantificational analyses of generics. This paper proposes a theory of why such “conservativity” generics are problematic that is compatible with the conservativity of gen and also accounts for perennially troublesome examples such as books are paperbacks and bees are workers. (shrink)

I propose an approach to liar and Curry paradoxes inspired by the work of Roger Swyneshed in his treatise on insolubles (1330-1335). The keystone of the account is the idea that liar sentences and their ilk are false (and only false) and that the so-called ''capture'' direction of the T-schema should be restricted. The proposed account retains what I take to be the attractive features of Swyneshed's approach without leading to some worrying consequences Swyneshed accepts. The approach and the (...) resulting logic (called ''Swynish Logic'') are non-classical, but are consistent and compatible with many elements of the classical picture including modus ponens, modus tollens, and double-negation elimination and introduction. It is also compatible with bivalence and contravalence. My approach to these paradoxes is also immune to an important kind of revenge challenge that plagues some of its rivals. (shrink)

Can one extend crisp Peano arithmetic PA by a possibly many-valued predicate Tr(x) saying "x is true" and satisfying the "dequotation schema" $\varphi \equiv \text{Tr}(\bar{\varphi})$ for all sentences φ? This problem is investigated in the frame of Lukasiewicz infinitely valued logic.

The starting point of this paper concerns the apparent difference between what we might call absolute truth and truth in a model, following Donald Davidson. The notion of absolute truth is the one familiar from Tarski’s T-schema: ‘Snow is white’ is true if and only if snow is white. Instead of being a property of sentences as absolute truth appears to be, truth in a model, that is relative truth, is evaluated in terms of the relation between sentences and (...) models. I wish to examine the apparent dual nature of logical truth (without dwelling on Davidson), and suggest that we are dealing with a distinction between a metaphysical and a linguistic interpretation of truth. I take my cue from John Etchemendy, who suggests that absolute truth could be considered as being equivalent to truth in the ‘right model’, i.e., the model that corresponds with the world. However, the notion of ‘model’ is not entirely appropriate here as it is closely associated with relative truth. Instead, I propose that the metaphysical interpretation of truth may be illustrated in modal terms, by metaphysical modality in particular. One of the tasks that I will undertake in this paper is to develop this modal interpretation, partly building on my previous work on the metaphysical interpretation of the law of non-contradiction (Tahko 2009). After an explication of the metaphysical interpretation of logical truth, a brief study of how this interpretation connects with some recent important themes in philosophical logic follows. In particular, I discuss logical pluralism and propose an understanding of pluralism from the point of view of the metaphysical interpretation. (shrink)

consistent and sufficiently strong system of first-order formal arithmetic fails to decide some independent Gödel sentence. We examine consistent first-order extensions of such systems. Our purpose is to discover what is minimally required by way of such extension in order to be able to prove the Gödel sentence in a non-trivial fashion. The extended methods of formal proof must capture the essentials of the so-called ‘semantical argument’ for the truth of the Gödel sentence. We are concerned to (...) show that the deflationist has at his disposal such extended methods—methods which make no use or mention of a truth-predicate. This consideration leads us to reassess arguments recently advanced—one by Shapiro and another by Ketland—against the deflationist's account of truth. Their main point of agreement is this: they both adduce the Gödel phenomena as motivating a ‘thick’ notion of truth, rather than the deflationist's ‘thin’ notion. But the so-called ‘semantical argument’, which appears to involve a ‘thick’ notion of truth, does not really have to be semantical at all. It is, rather, a reflective argument. And the reflections upon a system that are contained therein are deflationarily licit, expressible without explicit use or mention of a truth-predicate. Thus it would appear that this anti-deflationist objection fails to establish that there has to be more to truth than mere conformity to the disquotational T-schema. (shrink)

The Hilbert–Bernays Theorem establishes that for any satisfiable first-order quantificational schema S, one can write out linguistic expressions that are guaranteed to yield a true sentence of elementary arithmetic when they are substituted for the predicate letters in S. The theorem implies that if L is a consistent, fully interpreted language rich enough to express elementary arithmetic, then a schema S is valid if and only if every sentence of L that can be obtained by substituting (...) predicates of L for predicate letters in S is true. The theorem therefore licenses us to define validity substitutionally in languages rich enough to express arithmetic. The heart of the theorem is an arithmetization of Gödel's completeness proof for first-order predicate logic. Hilbert and Bernays were the first to prove that there is such an arithmetization. Kleene established a strengthened version of it, and Kreisel, Mostowski, and Putnam refined Kleene's result. Despite the later refinements, Kleene's presentation of th.. (shrink)

The uniform reflection principle for the theory of uniform T-sentences is added to PA. The resulting system is justified on the basis of a disquotationalist theory of truth where the provability predicate is conceived as a special kind of analyticity. The system is equivalent to the system ACA of arithmetical comprehension. If the truth predicate is also allowed to occur in the sentences that are inserted in the T-sentences, yet not in the scope of negation, the system with the reflection (...) schema for these T-sentences assumes the strength of the Kripke-Feferman theory KF, and thus of ramified analysis up to go. (shrink)

Are all instances of the T-schema assertable? I argue that they are not. The reason is the presence of conventional implicature in a language. Conventional implicature is meant to be a component of the rule-based content that a sentence can have, but it makes no contribution to the sentence's truth-conditions. One might think that a conventional implicature is like a force operator. But it is not, since it can enter into the scope of logical operators. It follows (...) that the semantic content of a sentence is not given simply by its truth-conditional content. So not all instances of the T-schema are assertable in the relevant sense. Consequently, there is a strong case to be made against truth-conditional semantics of the disquotational variety and deflationism about truth. (shrink)

In 1905 Bertrand Russell took on the problem of definite descriptions, and his analysis became the standard up until 1950 when Peter Strawson criticised Russell’s solution as inadequate. Since then many opponents as well as proponents of the Russellian solution have been involved in a long-term debate on definite descriptions. In this paper I show that both sides of the contention are partly right and partly wrong, because sentences of the form “The F is a G” are ambiguous. However, the (...) ambiguity does not concern reference shift of the description ‘the F’. Rather, the ambiguity consists in different topic-focus articulations of a given sentence involving occurrences of ‘the F’. I demonstrate that when ‘the F’ is used as part of the topic of such a sentence the existence of the object denoted by ‘the F’ is not only entailed by but also presupposed by the sentence. On the other hand, ‘the F’ used in the focus of a sentence triggers merely existential entailment. Thus sentences differing only in their topic-focus articulation should have assigned different logical forms. In order to make such hidden features explicit, I apply the procedural semantics of Transparent Intensional Logic , furnishing sentences with hyperpropositions that are precisely defined in terms of TIL constructions. These are procedures assigned to sentences as their context-invariant structured meanings. Moreover, I generalise the phenomenon of the topic-focus distinction to sentences of any form, proposing an adequate analytic schema of sentences that come with a presupposition. (shrink)

Let me start with an example. Presumably our understanding of the sentence ‘dogs bark’ arises somehow from our understanding of its components and our appreciation of how they are combined. That is to say, ‘dogs bark’ somehow gets its meaning from the meanings of the two words ‘dog’ and ‘bark’, from the meaning of the generalization schema ‘ns v’, and from the fact that the sentence results from placing those words in that schema in a certain (...) order. However, as Davidson was the first to emphasize, it is not possible to produce a strict logical deduction of what ‘dogs bark’ means from these more basic facts alone. So a question arises as to which further premises are required. What assumptions about the character of meaning should be added in order to obtain an explanation of the meaning of the sentence on the basis of the meanings of its words? (shrink)

Can one extend crisp Peano arithmetic PA by a possibly many-valued predicate Tr(x) saying “xis true” and satisfying the “dequotation schema”for all sentences φ? This problem is investigated in the frame of Łukasiewicz infinitely valued logic.

In this paper we shall introduce two types of contextual-hierarchical approaches to the strengthened liar problem. These approaches, which we call the ‘standard’ and the ‘alternative’ ch-reconstructions of the strengthened liar problem, differ in their philosophical view regarding the nature of truth and the relation between the truth predicates T r n and T r n+1 of different hierarchy-levels. The basic idea of the standard ch-reconstruction is that the T r n+1-schema should hold for all sentences of \. In (...) contrast, the alternative ch-reconstruction, for which we shall argue in section four, is motivated by the idea that T r n and T r n+1 are coherent in the sense that the same sentences of \ should be true according to T r n and T r n+1. We show that instances of the standard ch-reconstruction can be obtained by iterating Kripke’s strong Kleene jump operator. Furthermore, we will demonstrate how instances of the alternative ch-reconstruction can be obtained by a slight modification of the iterated axiom system KF and of the iterated strong Kleene jump operator. (shrink)