This paper shows Hilbert system (C+J)-, given by del Cerro and Herzig (1996) is semantically incomplete. This system is proposed as a proof theory for Kripke semantics for a combination of intuitionistic and classical propositional logic, which is obtained by adding the natural semantic clause of classical implication into intuitionistic Kripke semantics. Although Hilbert system (C+J)- contains intuitionistic modus ponens as a rule, it does not contain classical modus ponens. This paper gives an argument ensuring that the system (C+J)- is (...) semantically incomplete because of the absence of classical modus ponens. Our method is based on the logic of paradox, which is a paraconsistent logic proposed by Priest (1979). (shrink)

In this paper, we argue that the systems Basic Logic of Evidence (BLE) and Logic of Evidence and Truth (LETJ) suffer a kind of semantic incompleteness with respect to the informal notion of evidence. More especifically, we argue that the connective o of the logic LETJ fails to validate intuitive principles about conclusive evidence.

According to indexical contextualism, the perspectival element of taste predicates and epistemic modals is part of the content expressed. According to nonindexicalism, the perspectival element must be conceived as a parameter in the circumstance of evaluation, which engenders “thin” or perspective-neutral semantic contents. Echoing Evans, thin contents have frequently been criticized. It is doubtful whether such coarse-grained quasi-propositions can do any meaningful work as objects of propositional attitudes. In this paper, I assess recent responses by Recanati, Kölbel, Lasersohn and MacFarlane (...) to the “incompleteness worry”. None of them manages to convince. Particular attention is devoted to an argument by John MacFarlane, which states that if perspectives must be part of the content, so must worlds, which would make intuitively contingent propositions necessary. I demonstrate that this attempt to defend thin content views such as nonindexical contextualism and relativism conflates two distinct notions of necessity, and that radical indexicalist accounts of semantics, such as Schaffer’s necessitarianism, are in fact quite plausible. (shrink)

Kripke bundle and C-set semantics are known as semantics which generalize standard Kripke semantics. In [4] and in [1, 2] it is shown that Kripke bundle and C-set semantics are stronger than standard Kripke semantics. Also it is true that C-set semantics for superintuitionistic logics is stronger than Kripke bundle semantics . Modal predicate logic Q-S4.1 is not Kripke bundle complete of the present paper). This is shown by using difference of Kripke bundle semantics and C-set semantics. In this paper, (...) by using the same idea we show that incompleteness results in Kripke bundle semantics which are extended versions of [2]. (shrink)

Prawitz proposed certain notions of proof-theoretic validity and conjectured that intuitionistic logic is complete for them [11, 12]. Considering propositional logic, we present a general framework of five abstract conditions which any proof-theoretic semantics should obey. Then we formulate several more specific conditions under which the intuitionistic propositional calculus turns out to be semantically incomplete. Here a crucial role is played by the generalized disjunction principle. Turning to concrete semantics, we show that prominent proposals, including Prawitz’s, satisfy at least one (...) of these conditions, thus rendering IPC semantically incomplete for them. Only for Goldfarb’s [1] proof-theoretic semantics, which deviates from standard approaches, IPC turns out to be complete. Overall, these results show that basic ideas of proof-theoretic semantics for propositional logic are not captured by IPC. (shrink)

By means of models in toposes of C-sets (where C is a small category), necessary conditions are found for the minimum quantified extension of a propositional (intermediate, modal) logic to be complete with respect to Kripke semantics; in particular, many well-known systems turn out to be incomplete.

This paper explores the relationships between Davidson's indeterminacy of interpretation thesis and two semantic properties of sentences that have come to be recognized recently, namely semantic incompleteness and semantic indecision.1 More specifically, I will examine what the indeterminacy thesis entails for sentences of the form 'By sentence S (or word w), agent A means that m' and 'Agent A believes that p.' My primary goal is to shed light on the indeterminacy thesis and its consequences. I will distinguish two (...) kinds of indeterminacy that have very different sources and very different consequences. But this does not purport to be an exhaustive study: there may well be other forms of indeterminacy that this .. (shrink)

According to Field’s influential incompleteness objection, Tarski’s semantic theory of truth is unsatisfactory since the definition that forms its basis is incomplete in two distinct senses: (1) it is physicalistically inadequate, and for this reason, (2) it is conceptually deficient. In this paper, I defend the semantic theory of truth against the incompleteness objection by conceding (1) but rejecting (2). After arguing that Davidson and McDowell’s reply to the incompleteness objection fails to pass muster, I argue that, (...) within the constraints of a non-reductive physicalism and a holism concerning the concepts of truth, reference and meaning, conceding Field’s physicalistic inadequacy conclusion while rejecting his conceptual deficiency conclusion is a promising reply to the incompleteness objection. (shrink)

Let us recall that Raphael Robinson's Arithmetic Q is an axiom system that differs from Peano Arithmetic essentially by containing no Induction axioms [13], [18]. We will generalize the semantic-tableaux version of the Second Incompleteness Theorem almost to the level of System Q. We will prove that there exists a single rather long Π 1 sentence, valid in the standard model of the Natural Numbers and denoted as V, such that if α is any finite consistent extension of Q (...) + V then α will be unable to prove its Semantic Tableaux consistency. The same result will also apply to axiom systems α with infinite cardinality when these infinite-sized axiom systems satisfy a minor additional constraint, called the Conventional Encoding Property. Our formalism will also imply that the semantic-tableaux version of the Second Incompleteness Theorem generalizes for the axiom system IΣ 0 , as well as for all its natural extensions. (This answers an open question raised twenty years ago by Paris and Wilkie [15].). (shrink)

The relevant modal logic G is a simple extension of the logic RT, the relevant counterpart of the familiar classically based system T. Using the Routley-Meyer semantics for relevant modal logics, this paper proves three main results regarding G: (i) G is semantically complete, but only with a non-standard interpretation of necessity. From this, however, other nice properties follow. (ii) With a standard interpretation of necessity, G is semantically incomplete; there is no class of frames that characterizes G. (iii) The (...) class of frames for G characterizes the classically based logic T. (shrink)

Critics and champions alike have fussed and fretted for well over fifty years about whether Russell’s treatment is compatible with certain alleged acceptable uses of incomplete definite descriptions,[2] where a description (the F( is incomplete just in case more than one object satisfies its nominal F, as in (1).

This paper presents a precise semantics for incomplete predicates such as “ready”. Incomplete predicates have distinctive logical properties that a semantic theory needs to accommodate. For instance, “Tipper is ready” logically implies “Tipper is ready for something”, but “Tipper is ready for something” does not imply “Tipper is ready”. It is shown that several approaches to the semantics of incomplete predicates fail to accommodate these logical properties. The account offered here defines contexts as structures containing an element called a proposition (...) set, which contains atomic propositions and negations of atomic propositions. The condition under which “Tipper is ready” is true in a context is defined in terms of the contents of the proposition set for the context. On this account, the content of the context pertinent to a conversation must be determined not by what speakers have in mind but by relations of objective relevance. (shrink)

The purpose of this paper is to discuss two phenomena related to the semantics of definite descriptions: that of incomplete uses of descriptions, and that of the underdetermination of referential uses of descriptions. The Russellian theorist has a way of accounting for incomplete uses of descriptions by appealing to an account of quantifier domain restriction, such as the one proposed in Stanley and Szabó (2000a). But, I argue, the Russellian is not the only one in a position to appeal to (...) such an account of incomplete uses of descriptions. Proponents of other theories, such as the Fregean, which does not treat descriptions as quantifiers, might benefit from this account of domain restriction. In the second part of the paper I discuss referential uses of incomplete definite descriptions. Relative to such uses, Wettstein (1981) and others have argued that the Russellian theory faces a problem of underdetermination of semantic content. Neale (2004) has replied to this objection showing why it does not pose a threat to the Russellian theory. Again, I argue that not only the Russellian, but also the Fregean can subscribe to Neale’s (2004) suggestion. (shrink)

This paper shows that some classes of multimodal paraconsistent logics endowed with weak forms of negation are incompletable with respect to Kripke semantics. The reach of such incompleteness is discussed, and we argue that this shortcoming, more than just a logical predicament, may be relevant for attempts to characterize quantum logics and to handle quantum information and quantum computation.

We present a semantic proof of Gödel's second incompleteness theorem, employing Grelling's antinomy of heterological expressions. For a theory T containing ZF, we define the sentence HETT which says intuitively that the predicate “heterological” is itself heterological. We show that this sentence doesn't follow from T and is equivalent to the consistency of T. Finally we show how to construct a similar incompleteness proof for Peano Arithmetic.

This paper is an investigation of the relationship between G\"odel's second incompleteness theorem and the well-foundedness of jump hierarchies. It follows from a classic theorem of Spector's that the relation $\{(A,B) \in \mathbb{R}^2 : \mathcal{O}^A \leq_H B\}$ is well-founded. We provide an alternative proof of this fact that uses G\"odel's second incompleteness theorem instead of the theory of admissible ordinals. We then derive a semantic version of the second incompleteness theorem, originally due to Mummert and Simpson, from (...) this result. Finally, we turn to the calculation of the ranks of reals in this well-founded relation. We prove that, for any $A\in\mathbb{R}$, if the rank of $A$ is $\alpha$, then $\omega_1^A$ is the $(1 + \alpha)^{\text{th}}$ admissible ordinal. It follows, assuming suitable large cardinal hypotheses, that, on a cone, the rank of $X$ is $\omega_1^X$. (shrink)

The Routley-Meyer relational semantics for relevant logics is extended to give a sound and complete model theory for many propositionally quantified relevant logics (and some non-relevant ones). This involves a restriction on which sets of worlds are admissible as propositions, and an interpretation of propositional quantification that makes ∀ pA true when there is some true admissible proposition that entails all p -instantiations of A . It is also shown that without the admissibility qualification many of the systems considered are (...) semantically incomplete, including all those that are sub-logics of the quantified version of Anderson and Belnap’s system E of entailment, extended by the mingle axiom and the Ackermann constant t . The incompleteness proof involves an algebraic semantics based on atomless complete Boolean algebras. (shrink)

In the early seventies, several logicians developed a semantics for propositional systems of relevance logic. The essential ingredients of this semantics were a privileged point o, an ‘accessibility’ relation R and a special operator * for evaluating negation. Under the truth- conditions of the semantics, each formula A(Pl,…,Pn) could be seen as expressing a first order condition A+(pl,…,pn, o, R,*) on sets p1,…,pn and o, R, *, while each formula-scheme could be regarded as expressing the second-order condition ∀p1,…,∀pn A+(p1,…,pn, o, (...) R, *). It could then be shown that many standard systems of propositional relevance logic were complete in the sense that their theorems were just those formulas true in all models whose components o, R and * conformed to the second-order conditions expressed by the axioms of the system. (shrink)

Cappelen and Lepore (2005) maintain that Incompleteness Arguments for context sensitivity are fallacious. In their view, Incompleteness Arguments are non sequitur fallacies whose conclusions are not logically related to premises. They affirm that the conclusions of Incompleteness Arguments are metaphysical claims about the existence of entities that might be constituents of propositions, while their premises concern psychological data about speakers' dispositions to truth evaluate sentences in contexts of utterance. Cappelen and Lepore reject Incompleteness Arguments because psychological (...) data have no bearing on metaphysical issues. I do not dispute Cappelen and Lepore's claim that psychological data have no relevance to metaphysics. Nonetheless, I argue that Cappelen and Lepore's criticism is vitiated by a misunderstanding of the nature of Incompleteness Arguments that makes them overlook the link between semantics and linguistic competence. I try to shed light on the real nature of Incompleteness Arguments by pointing at the failure of Cappelen and Lepore's criticism. My aim is not to defend Semantic Contextualism, but to bring to attention the link between semantics and linguistic competence that should never be overlooked in debates in the field of semantics. (shrink)

The logicD-J of the weak exluded middle with constant domains is proved to be incomplete with respect to Kripke semantics, by introducing models in presheaves on an arbitrary category. Additional incompleteness results are obtained for the modal systems with nested domains extendingQ-S4.1.

This paper explores the relationship borne by the traditional paradoxes of set theory and semantics to formal incompleteness phenomena. A central tool is the application of the Arithmetized Completeness Theorem to systems of second-order arithmetic and set theory in which various “paradoxical notions” for first-order languages can be formalized. I will first discuss the setting in which this result was originally presented by Hilbert & Bernays (1939) and also how it was later adapted by Kreisel (1950) and Wang (1955) (...) in order to obtain formal undecidability results. A generalization of this method will then be presented whereby Russell’s paradox, a variant of Mirimanoff’s paradox, the Liar, and the Grelling–Nelson paradox may be uniformly transformed into incompleteness theorems. Some additional observations are then framed relating these results to the unification of the set theoretic and semantic paradoxes, the intensionality of arithmetization (in the sense of Feferman, 1960), and axiomatic theories of truth. (shrink)

Motivated by the problem of finding finite versions of classical incompleteness theorems, we present some conjectures that go beyond NP ≠ coNP. These conjectures formally connect computational complexity with the difficulty of proving some sentences, which means that high computational complexity of a problem associated with a sentence implies that the sentence is not provable in a weak theory, or requires a long proof. Another reason for putting forward these conjectures is that some results in proof complexity seem to (...) be special cases of such general statements and we want to formalize and fully understand these statements. Roughly speaking, we are trying to connect syntactic complexity, by which we mean the complexity of sentences and strengths of the theories in which they are provable, with the semantic concept of complexity of the computational problems represented by these sentences. -/- We have introduced the most fundamental conjectures in our earlier works. Our aim in this article is to present them in a more systematic way, along with several new conjectures, and prove new connections between them and some other statements studied before. (shrink)

The idea motivating their account, Cappelen and Lepore (C&L) say in Insensitive Semantics (2005), is that semantic content is context invariant, and that all colleagues who take, or even consider, different accounts are just on the wrong track. It is the purpose of their book to disprove all alternative accounts by way of an argument ‘by elimination’. The conclusion they arrive at is that their own account must be accepted by everyone as the only game in town at the end (...) of the day . The present paper is intended to examine this conclusion; its more significant findings are these. Firstly, C&L’s account is not, as they suggest, strictly minimalist, but in fact just a moderate version of contextualism. Secondly, prematurely associating semantical incompleteness and context sensitivity, they overlook some possible alternatives to their own view, among them at least one that is attractive. Thirdly, their argument ‘by elimination’ has an inductive structure, but is inexhaustive, and therefore inconclusive. Fourthly, for several different reasons, their attempts to reject arguments in favour of semantical incompleteness do not work. Finally, their contention that arguments in favour of semantical incompleteness employ metaphysical premisses for semantical conclusions rests on a faulty interpretation of these arguments. In the light of these findings, it is concluded that the central argument of Insensitive Semantics fails. (shrink)

The implicit content associated with incomplete definite descriptions is contributed in the form of definite descriptions of situations. A definite description of this kind is contributed by a small structure in the syntax, which is interpreted, in general terms, as ‘the situation that bears R to s’.

Natural deduction systems were motivated by the desire to define the meaning of each connective by specifying how it is introduced and eliminated from inference. In one sense, this attempt fails, for it is well known that propositional logic rules underdetermine the classical truth tables. Natural deduction rules are too weak to enforce the intended readings of the connectives; they allow non-standard models. Two reactions to this phenomenon appear in the literature. One is to try to restore the standard readings, (...) for example by adopting sequent rules with multiple conclusions. Another is to explore what readings the natural deduction rules do enforce. When the notion of a model of a rule is generalized, it is found that natural deduction rules express “intuitionistic” readings of their connectives. A third approach is presented here. The intuitionistic readings emerge when models of rules are defined globally, but the notion of a local model of a rule is also natural. Using this benchmark, natural deduction rules enforce exactly the classical readings of the connectives, while this is not true of axiomatic systems. This vindicates the historical motivation for natural deduction rules. One odd consequence of using the local model benchmark is that some systems of propositional logic are not complete for the semantics that their rules express. Parallels are drawn with incompleteness results in modal logic to help make sense of this. (shrink)

This article provides an overview of development of Kripke semantics for logics determined by information systems. The proposals are made to extend the standard Kripke structures to the structures based on information systems. The underlying logics are defined and problems of their axiomatization are discussed. Several open problems connected with the logics are formulated. Logical aspects of incompleteness of information provided by information systems are considered.

We explore the computational complexity of justification, stability and relevance in incomplete argumentation frameworks (IAFs). IAFs are abstract argumentation frameworks that encode qualitative uncertainty by distinguishing between certain and uncertain arguments and attacks. These IAFs can be completed by deciding for each uncertain argument or attack whether it is present or absent. Such a completion is an abstract argumentation framework, for which it can be decided which arguments are acceptable under a given semantics. The justification status of an argument in (...) a completion then expresses whether the argument is accepted (in), not accepted because it is attacked by an accepted argument (out) or neither (undec). For a given IAF and certain argument, the justification status of that argument need not be the same in all completions. This is the issue of stability, where an argument is stable if its justification status is the same in all completions. For arguments that are not stable in an IAF, the relevance problem is of interest: which uncertain arguments or attacks should be investigated for the argument to become stable? In this paper, we define justification, stability and relevance for IAFs and provide a complexity analysis for these problems under grounded, complete, preferred and stable semantics. (shrink)

I discuss two competing theories of the progressive: the theory proposed in Parsons (1980, 1985, 1989, 1990) and the theory proposed in Landman (1992). These theories differ in more than one way. Landman regards the progressive as an intentional operator, while Parsons doesn't. Moreover, Landman and Parsons disagree on what uninflected predicates denote. For Landman, cross the street has in its denotation complete events of crossing the street; the aspectual contribution of English simple past (perfective aspect) is the identity function. (...) For Parsons, both complete and incomplete events of crossing the street can be in the denotation of the base VP; perfective aspect restricts its denotation to the events that culminate. I present a version of ParsonÕs theory that avoids the problems raised by Landman, in particular the problem posed for Parsons by creation verbs. The repaired version and Landman's theory still differ in the way they analyze uninflected verbs. The repaired version and Landman's theory still differ in the way they analyze uninflected predicates. I present evidence from Slavic languages that both theories are needed. Finally, I discuss some evidence that may favor one or the other approach to the semantics of the English progressive. (shrink)

I propose a novel hyperintensional semantics for belief revision and a corresponding system of dynamic doxastic logic. The main goal of the framework is to reduce some of the idealisations that are common in the belief revision literature and in dynamic epistemic logic. The models of the new framework are primarily based on potentially incomplete or inconsistent collections of information, represented by situations in a situation space. I propose that by shifting the representational focus of doxastic models from belief sets (...) to collections of information, and by defining changes of beliefs as artifacts of changes of information, we can achieve a more realistic account of belief representation and belief change. The proposed dynamic operation suggests a non-classical way of changing beliefs: belief revision occurs in non-explosive environments which allow for a non-monotonic and hyperintensional belief dynamics. A logic that is sound with respect to the semantics is also provided. (shrink)

Handling exceptions in a knowledge-based system is an important issue in many application domains, such as medical domain. Recently, there is an increasing interest in nonmonotonic extension of description logics to handle exceptions in ontologies. In this paper, we propose three preferential semantics for plausible subsumption to deal with exceptions in description logic-based knowledge bases. Our preferential semantics are defined in the framework of possibility theory, which is an uncertainty theory devoted to handling incomplete information. We consider the properties of (...) these semantics and their relationships. We also discuss the relationship between two of our preferential semantics and two existing preferential semantics. We extend a description logic-based knowledge base by adding preferential subsumptions. Entailment of plausible subsumptions relative to an extended knowledge base is defined. Properties of the preferential subsumption relations relative to an extended description logic-based knowledge base are discussed. Finally, we show that our semantics for plausible subsumption can be reduced to standard semantics of an expressive description logic. Thus, the problem of plausible subsumption checking under our semantics can be reduced to the problem of subsumption checking under the classical semantics. (shrink)

We investigate incomplete symbols, i.e. definite descriptions with scope-operators. Russell famously introduced definite descriptions by contextual definitions; in this article definite descriptions are introduced by rules in a specific calculus that is very well suited for proof-theoretic investigations. That is to say, the phrase ‘incomplete symbols’ is formally interpreted as to the existence of an elimination procedure. The last section offers semantical tools for interpreting the phrase ‘no meaning in isolation’ in a formal way.

It is a little understood fact that the system of formal logic presented in Wittgenstein’s Tractatusprovides the basis for an alternative general semantics for a predicate calculus that is consistent and coherent, essentially independent of the metaphysics of logical atomism, and philosophically illuminating in its own right. The purpose of this paper is threefold: to describe the general characteristics of a Tractarian-style semantics, to defend the Tractatus system against the charge of expressive incompleteness as levelled by Robert Fogelin, and (...) to give a semantics for a formal language that is the Tractarian equivalent of a first-order predicate calculus. Of note in regard to the latter is the fact that a Tractatusstyle truth-definition makes no appeal to the technical trick of defining truth in terms of the satisfaction of predicates by infinite sequences of objects, yet is materially equivalent to the usual Tarski-style truth-definitions. (shrink)

In this article, to revitalize the discussion on semantic externalism’s implications on the issue of content self-knowledge, I will argue that semantic externalism generates in fact two related but distinct skeptical puzzles concerning the presumption of truth attached to our mental self-ascriptions. The first is to explain how I can correctly ascribe mental states to myself, and the second is to explain how others can ascribe thoughts to me by taking my expressions of such self-ascriptions at face value. In my (...) view, although the first has been sufficiently addressed in the literature, the second has been more or less neglected. Furthermore, as I will argue, theorists must respond to both of the questions to fully show the compatibility of our ordinary conception of self-knowledge and semantic externalism. As a case study, I will introduce Dorit Bar-On’s neo-expressivism as an account of self-knowledge that provides a promising answer to the first question and argue that it is still incomplete in that it does not address the second skeptical puzzle. To shed light on the nature of the puzzle in question further, I will also explore its possible solutions in the neo-expressivist framework. (shrink)

We offer a formal treatment of the semantics of both complete and incomplete mistrustful or distrustful information transmissions. The semantics of such relations is analysed in view of rules that define the behaviour of a receiving agent. We justify this approach in view of human agent communications and secure system design. We further specify some properties of such relations.

Recent studies in semantics of modal and superintuitionistic predicate logics provided many examples of incompleteness, especially for Kripke semantics. So there is a problem: to find an appropriate possible- world semantics which is equivalent to Kripke semantics at the propositional level and which is strong enough to prove general completeness results. The present paper introduces a new semantics of Kripke metaframes' generalizing some earlier notions. The main innovation is in considering "n"-tuples of individuals as abstract "n"-dimensional vectors', together with (...) some transformations of these vectors. Soundness of the semantics is proved to be equivalent to some non- logical properties of metaframes; and thus we describe the maximal semantics of Kripke- type. (shrink)

Graham Priest's In Contradiction (Dordrecht: Martinus Nijhoff Publishers, 1987, chapter 3) contains an argument concerning the intuitive, or ‘naïve’ notion of (arithmetic) proof, or provability. He argues that the intuitively provable arithmetic sentences constitute a recursively enumerable set, which has a Gödel sentence which is itself intuitively provable. The incompleteness theorem does not apply, since the set of provable arithmetic sentences is not consistent. The purpose of this article is to sharpen Priest's argument, avoiding reference to informal notions, consensus, (...) or Church's thesis. We add Priest's dialetheic semantics to ordinary Peano arithmetic PA, to produce a recursively axiomatized formal system PA★ that contains its own truth predicate. Whether one is a dialetheist or not, PA★ is a legitimate, rigorously defined formal system, and one can explore its proof‐theoretic properties. The system is inconsistent (but presumably non‐trivial), and it proves its own Gödel sentence as well as its own soundness. Although this much is perhaps welcome to the dialetheist, it has some untoward consequences. There are purely arithmetic (indeed, Π0) sentences that are both provable and refutable in PA★. So if the dialetheist maintains that PA★ is sound, then he must hold that there are true contradictions in the most elementary language of arithmetic. Moreover, the thorough dialetheist must hold that there is a number g which both is and is not the code of a derivation of the indicated Gödel sentence of PA★. For the thorough dialetheist, it follows ordinary PA and even Robinson arithmetic are themselves inconsistent theories. I argue that this is a bitter pill for the dialetheist to swallow. (shrink)

This Element takes a deep dive into Gödel's 1931 paper giving the first presentation of the Incompleteness Theorems, opening up completely passages in it that might possibly puzzle the student, such as the mysterious footnote 48a. It considers the main ingredients of Gödel's proof: arithmetization, strong representability, and the Fixed Point Theorem in a layered fashion, returning to their various aspects: semantic, syntactic, computational, philosophical and mathematical, as the topic arises. It samples some of the most important proofs of (...) the Incompleteness Theorems, e.g. due to Kuratowski, Smullyan and Robinson, as well as newer proofs, also of other independent statements, due to H. Friedman, Weiermann and Paris-Harrington. It examines the question whether the incompleteness of e.g. Peano Arithmetic gives immediately the undecidability of the Entscheidungsproblem, as Kripke has recently argued. It considers set-theoretical incompleteness, and finally considers some of the philosophical consequences considered in the literature. (shrink)

In traditional semantics for classical logic and its extensions, such as modal logic, propositions are interpreted as subsets of a set, as in discrete duality, or as clopen sets of a Stone space, as in topological duality. A point in such a set can be viewed as a "possible world," with the key property of a world being primeness—a world makes a disjunction true only if it makes one of the disjuncts true—which classically implies totality—for each proposition, a world either (...) makes the proposition true or makes its negation true. This chapter surveys a more general approach to logical semantics, known as possibility semantics, which replaces possible worlds with possibly partial "possibilities." In classical possibility semantics, propositions are interpreted as regular open sets of a poset, as in set-theoretic forcing, or as compact regular open sets of an upper Vietoris space, as in the recent theory of "choice-free Stone duality." The elements of these sets, viewed as possibilities, may be partial in the sense of making a disjunction true without settling which disjunct is true. We explain how possibilities may be used in semantics for classical logic and modal logics and generalized to semantics for intuitionistic logics. The goals are to overcome or deepen incompleteness results for traditional semantics, to avoid the nonconstructivity of traditional semantics, and to provide richer structures for the interpretation of new languages. (shrink)

The problem of whether Lambek Calculus is complete with respect to (w.r.t.) relational semantics, has been raised several times, cf. van Benthem (1989a) and van Benthem (1991). In this paper, we show that the answer is in the affirmative. More precisely, we will prove that that version of the Lambek Calculus which does not use the empty sequence is strongly complete w.r.t. those relational Kripke-models where the set of possible worlds,W, is a transitive binary relation, while that version of the (...) Lambek Calculus where we admit the empty sequence as the antecedent of a sequent is strongly complete w.r.t. those relational models whereW=U×U for some setU. We will also look into extendability of this completeness result to various fragments of Girard's Linear Logic as suggested in van Benthem (1991), p. 235, and investigate the connection between the Lambek Calculus and language models. (shrink)

Emma Borg has defined semantic minimalism as the thesis that the literal content of well-formed declarative sentences is truth-evaluable, fully determined by their lexico-syntactic features, and recoverable by language users with no need to access non-linguistic information. The task of this article is threefold. First, I shall raise a criticism to Borg’s minimalism based on how speakers disambiguate homonymy. Second, I will explore some ways Borg might respond to my argument and maintain that none of them offers a conclusive reply (...) to my case. Third, I shall suggest that in order for Borg’s minimalism to best accommodate the problem discussed in this paper, it should allow for semantically incomplete content and be converted into a claim about linguistic competence. (shrink)

In this paper I offer a defence of a Russellian analysis of the referential uses of incomplete (mis)descriptions, in a contextual setting. With regard to the debate between a unificationist and an ambiguity approach to the formal treatment of definite descriptions (introduction), I will support the former against the latter. In 1. I explain what I mean by "essentially" incomplete descriptions: incomplete descriptions are context dependent descriptions. In 2. I examine one of the best versions of the unificationist “explicit” approach (...) given by Buchanan and Ostertag. I then show that this proposal seems unable to treat the normal uses of misdescriptions. I then accept the challenge of treating misdescriptions as a key to solving the problem of context dependent descriptions. In 3. I briefly discuss Michael Devitt’s and Joseph Almog’s treatments of referential descriptions, showing that they find it difficult to explain misdescriptions. In 4. I suggest an alternative approach to DD as contextuals, under a normative epistemic stance. Definite descriptions express (i) what a speaker should have in mind in using certain words in a certain context and (ii) what a normal speaker is justified in saying in a context, given a common basic knowledge of the lexicon. In 5. I define a procedure running on contextual parameters (partiality, perspective and approximation) as a means of representing the role of pragmatics as a filter for semantic interpretation. In 6. I defend my procedural approach against possible objections concerning the problem of the boundaries between semantics and pragmatics, relying on the distinction between semantics and theory of meaning. (shrink)