For many years I have maintained that I learned to philosophize by translating Francisco Suárez’s Metaphysical Disputation V from Latin into English. This surely is a claim that must sound extraordinary to the members of this audience or even to most twentieth century philosophers. Who reads Suárez these days? And what could I learn from a sixteenth century scholastic writer that would help me in the twentieth century? I would certainly be surprised if one were to find any references to (...) some of Suárez’s works in any of the works of twentieth-century major philosophers. One of the reasons for my claim is the great difficulty I had in figuring out what Suárez’s text means and how to render it understandable to English readers. Translating the text forced me to think in ways that were quite different from those I was used to think in Spanish, my native tongue, or English, my adoptive tongue. In fact, the translation I produced after having completed many drafts continued, and still continues to this day, to appear to me unsatisfactory, and that dissatisfaction was the key to understanding things I had understood very differently before. I hope to make clear why in what follows. The thesis that I defend is that semantic equivalence between texts of philosophy in different languages is difficult, if not impossible in some cases, to achieve and, therefore, that it is a mistake to restrict doing analytic philosophy to English, as Gustavo Rodríguez-Pereyra argues we should do in a recent article (2013). (shrink)

I investigate syntactic notions of theoretical equivalence between logical theories and a recent objection thereto. I show that this recent criticism of syntactic accounts, as extensionally inadequate, is unwarranted by developing an account which is plausibly extensionally adequate and more philosophically motivated. This is important for recent anti-exceptionalist treatments of logic since syntactic accounts require less theoretical baggage than semantic accounts.

The logics of formal inconsistency (LFIs, for short) are paraconsistent logics (that is, logics containing contradictory but non-trivial theories) having a consistency connective which allows to recover the ex falso quodlibet principle in a controlled way. The aim of this paper is considering a novel semantical approach to first-order LFIs based on Tarskian structures defined over swap structures, a special class of multialgebras. The proposed semantical framework generalizes previous aproaches to quantified LFIs presented in the literature. The case of QmbC, (...) the simpler quantified LFI expanding classical logic, will be analyzed in detail. An axiomatic extension of QmbC called QLFI1o is also studied, which is equivalent to the quantified version of da Costa and D'Ottaviano 3-valued logic J3. The semantical structures for this logic turn out to be Tarkian structures based on twist structures. The expansion of QmbC and QLFI1o with a standard equality predicate is also considered. (shrink)

I propose a unified solution to two puzzles: Ross's puzzle and free choice permission. I begin with a pair of cases from the decision theory literature illustrating the phenomenon of act dependence, where what an agent ought to do depends on what she does. The notion of permissibility distilled from these cases forms the basis for my analysis of 'may' and 'ought'. This framework is then combined with a generalization of the classical semantics for disjunction — equivalent to Boolean disjunction (...) on the diagonal, but with a different two-dimensional character — that explains the puzzling facts in terms of semantic consequence. (shrink)

In this paper, we present a non-trivial and expressively complete paraconsistent naïve theory of truth, as a step in the route towards semantic closure. We achieve this goal by expressing self-reference with a weak procedure, that uses equivalences between expressions of the language, as opposed to a strong procedure, that uses identities. Finally, we make some remarks regarding the sense in which the theory of truth discussed has a property closely related to functional completeness, and we present a sound (...) and complete three-sided sequent calculus for this expressively rich theory. (shrink)

Pietroski (1993) offers a semantics for belief sentences that is supposed to address the problem of equivalence. This paper argues that his proposal fails to solve the problem.

Is it possible to give a justification of our own practice of deductive inference? The purpose of this paper is to explain what such a justification might consist in and what its purpose could be. On the conception that we are going to pursue, to give a justification for a deductive practice means to explain in terms of an intuitively satisfactory notion of validity why the inferences that conform to the practice coincide with the valid ones. That is, a justification (...) should provide an analysis of the notion of validity and show that the inferences that conform to the practice are just the ones that are valid. Moreover, a complete justification should also explain the purpose, or point, of our inferential practice. We are first going to discuss the objection that any justification of our deductive practice must use deduction and therefore be circular. Then we will consider a particular model of justificatory explanation, building on Georg Kreisel’s concept of informal rigour. Finally, in the main part of the paper, we will discuss three ideas for defining the notion of validity: (i) the classical conception according to which the notion of (bivalent) truth is taken as basic and validity is defined in terms of the preservation of truth; (ii) the constructivist idea of starting instead with the notion of (a canonical) proof (or verification) and define validity in terms of this notion; (iii) the idea of taking the notions of rational acceptance and rejection as given and define an argument to be valid just in case it is irrational to simultaneously accept its premises and reject its conclusion (or conclusions, if we allow for multiple conclusions). Building on work by Dana Scott, we show that the last conception may be viewed as being, in a certain sense, equivalent to the first one. Finally, we discuss the so-called paradox of inference and the informativeness of deductive arguments. (shrink)

More than a century ago, G. E. Moore famously attempted to refute ethical naturalism by offering the so-called open question argument (OQA), also charging that all varieties of ethical naturalism commit the naturalistic fallacy. Although there is consensus that OQA and the naturalistic-fallacy charge both fail, OQA is sometimes vindicated, but only as an argument against naturalistic semantic analyses. The naturalistic-fallacy charge, by contrast, usually finds no takers at all. This paper provides new grounds for an OQA thus restricted. (...) But it aims chiefly at vindicating a version of the naturalistic fallacy, „the semantic-naturalist fallacy‟ (SNF), that we think defensible. We first argue that the openness of the question OQA raises against such analyses hinges on self-ascriptive, comparative judgments of content, which may be considered a priori warranted. We then provide independent reasons for the claim that the sort of mistake committed by naturalistic analyses in fact amounts to a pragmatic fallacy of a kind familiar in petitio principii and other forms of viciously circular inference. Of interest here are naturalistic analyses of ethical terms or concepts, not of properties. Our OQA (OQA*) raises an objection to the former. For no such semantic analyses can get off the ground unless moral terms are content-equivalent to purely descriptive terms, which amounts to saying that they must instantiate the same semantic types. Suppose „good‟ is the analysandum and „pleasure maximizing‟ the analysans (whichever purely descriptive term or terms would turn out to be the correct descriptive analysis of the target analysandum) of a certain semantic analysis. The claim that such terms are content-equivalent appears to be open to doubt on a priori grounds. After 1 all, whether one‟s own tokens of „good‟ and „pleasure maximizing‟ have/don‟t have the same content is a first-person, comparative judgment of content. Evaluating the proposed analysis requires, then, a self-ascriptive, comparative judgment of content.1 Judgments of this sort are thought to have a special epistemic status, since they seem grounded in neither evidence nor inference.. (shrink)

The operational semantics of Urquhart is a deep and important part of the development of relevant logics. In this paper, I present an overview of work on Urquhart’s operational semantics. I then present the basics of collection frames. Finally, I show how one kind of collection frame, namely, functional set frames, is equivalent to Urquhart’s semilattice semantics.

Action Languages are formal methods of talking about actions and their effects on fluents. One recent approach in planning is to define the domains of the planning problems using action languages. The aim of this research is to find a plan for a system defined in the action language C by translating it into a causal theory and then finding an equivalent logic program. The planning problem will then be reduced to finding the answer set (stable model) of this logic (...) program. This planner will be added as an extension to the Causal Calculator (CCALC) which is a model checker for the language of the causal theories. (shrink)

In the following the details of a state-of-affairs semantics for positive free logic are worked out, based on the models of common inner domain - outer domain semantics. Lambert's PFL system is proven to be weakly adequate (i.e., sound and complete) with respect to that semantics by demonstrating that the concept of logical truth definable therein coincides with that one of common truth-value semantics for PFL. Furthermore, this state-of-affairs semantics resists the challenges stemming from the slingshot argument since logically equivalent (...) statements do not always have the same extension according to it. Finally, it is argued that in such a semantics all statements of a certain language for PFL are state-of-affairs-related extensional as well as salva extensione extensional, even though their salva veritate extensionality fails. (shrink)

Double negations are easily recognised in both the so-called “negative literature” and the original texts of some important scientific theories. Often they are not equivalent to the corresponding affirmative propositions. In the case the law of double negation fails they belong to non-classical logic, as first, intuitionist logic. Through a comparative analysis of the theories including them the main features of a new kind of theoretical organization governed by intuitionist logic are obtained. Its arguing proceeds through doubly negated propositions and (...) ad absurdum arguments. Then, the final doubly negated predicate is translated in the corresponding affirmative one, from which all the consequences are deduced in order to test them against reality. According to this model the true formalization of intuitionist logic is Kolmogorov’s 1932 paper. The above analysis also shows that modal words play an auxiliary or substitutive role to intuitionist propositions. In addition, it is shown that Vasiliev’s paraconsistent logic is represented through doubly negated propositions. By means of these three kinds of logic one can attribute a specific kind of logic to each of the three distinct steps of the process of building a scientific theory from the experimental data to its final theoretical system. It is also shown that the definition of negation is of a structural kind, rather than of an objective kind or a subjective kind: it has to be referred to the organization of the theory to which it belongs. (shrink)

We give a complete axiomatization of the identities of the basic game algebra valid with respect to the abstract game board semantics. We also show that the additional conditions of termination and determinacy of game boards do not introduce new valid identities.En route we introduce a simple translation of game terms into plain modal logic and thus translate, while preserving validity both ways, game identities into modal formulae.The completeness proof is based on reduction of game terms to a certain ‘minimal (...) canonical form’, by using only the axiomatic identities, and on showing that the equivalence of two minimal canonical terms can be established from these identities. (shrink)

This paper outlines a quantitative theory of strongly semantic information (TSSI) based on truth-values rather than probability distributions. The main hypothesis supported in the paper is that the classic quantitative theory of weakly semantic information (TWSI), based on probability distributions, assumes that truth-values supervene on factual semantic information, yet this principle is too weak and generates a well-known semantic paradox, whereas TSSI, according to which factual semantic information encapsulates truth, can avoid the paradox and is (...) more in line with the standard conception of what generally counts as semantic information. After a brief introduction, section two outlines the semantic paradox implied by TWSI, analysing it in terms of an initial conflict between two requisites of a quantitative theory of semantic information. In section three, three criteria of semantic information equivalence are used to provide a taxonomy of quantitative approaches to semantic information and introduce TSSI. In section four, some further desiderata that should be fulfilled by a quantitative TSSI are explained. From section five to section seven, TSSI is developed on the basis of a calculus of truth-values and semantic discrepancy with respect to a given situation. In section eight, it is shown how TSSI succeeds in solving the paradox. Section nine summarises the main results of the paper and indicates some future developments. (shrink)

According to the resemblance account of 'what it's like' and similar constructions, a sentence such as 'there is something it’s like to have a toothache' means 'there is something having a toothache resembles'. This account has proved controversial in the literature; some writers endorse it, many reject it. We show that this conflict is illusory. Drawing on the semantics of intensional transitive verbs, we show that there are two versions of the resemblance account, depending on whether 'resembles' is construed notionally (...) or relationally. While well-known criticisms of the resemblance account undermine its relational version, they do not touch its notional version. On the contrary, the notional version is equivalent to various accounts usually interpreted as rivals to resemblance. We end by noting that this resolution of the controversy (a) explains why 'like', which is a comparative, appears in a construction that concerns the properties of events, and (b) removes any pressure to suppose that 'like' is ambiguous between a comparative and a non-comparative sense. (shrink)

The first degree entailment (FDE) family is a group of logics, a many-valued semantics for each system of which is obtained from classical logic by adding to the classical truth-values true and false any subset of {both, neither, indeterminate}, where indeterminate is an infectious value (any formula containing a subformula with the value indeterminate itself has the value indeterminate). In this paper, we see how to extend a version of star semantics for the logics whose many-valued semantics lack indeterminate to (...) star semantics for logics whose many-valued semantics include indeterminate. The equivalence of the many-valued semantics and star semantics is established by way of a soundness and completeness proof. The upshot of the novel semantics in terms of the applied semantics of these logics, and specifically infectiousness, is explored, settling on the idea that infectiousness concerns ineffability. (shrink)

ABSTRACT: This 1974 paper builds on our 1969 paper (Corcoran-Weaver [2]). Here we present three (modal, sentential) logics which may be thought of as partial systematizations of the semantic and deductive properties of a sentence operator which expresses certain kinds of necessity. The logical truths [sc. tautologies] of these three logics coincide with one another and with those of standard formalizations of Lewis's S5. These logics, when regarded as logistic systems (cf. Corcoran [1], p. 154), are seen to be (...) equivalent; but, when regarded as consequence systems (ibid., p. 157), one diverges from the others in a fashion which suggests that two standard measures of semantic complexity may not be as closely linked as previously thought. -/- This 1974 paper uses the linear notation for natural deduction presented in [2]: each two-dimensional deduction is represented by a unique one-dimensional string of characters. Thus obviating need for two-dimensional trees, tableaux, lists, and the like—thereby facilitating electronic communication of natural deductions. The 1969 paper presents a (modal, sentential) logic which may be thought of as a partial systematization of the semantic and deductive properties of a sentence operator which expresses certain kinds of necessity. The logical truths [sc. tautologies] of this logic coincides those of standard formalizations of Lewis’s S4. Among the paper's innovations is its treatment of modal logic in the setting of natural deduction systems--as opposed to axiomatic systems. The author’s apologize for the now obsolete terminology. For example, these papers speak of “a proof of a sentence from a set of premises” where today “a deduction of a sentence from a set of premises” would be preferable. 1. Corcoran, John. 1969. Three Logical Theories, Philosophy of Science 36, 153–77. J P R -/- 2. Corcoran, John and George Weaver. 1969. Logical Consequence in Modal Logic: Natural Deduction in S5 Notre Dame Journal of Formal Logic 10, 370–84. MR0249278 (40 #2524). 3. Weaver, George and John Corcoran. 1974. Logical Consequence in Modal Logic: Some Semantic Systems for S4, Notre Dame Journal of Formal Logic 15, 370–78. MR0351765 (50 #4253). (shrink)

We approach the topic of solution equivalence of propositional problems from the perspective of non-constructive procedural theory of problems based on Transparent Intensional Logic (TIL). The answer we put forward is that two solutions are equivalent if and only if they have equivalent solution concepts. Solution concepts can be understood as a generalization of the notion of proof objects from the Curry-Howard isomorphism.

In a previous work we introduced the algorithm \SQEMA\ for computing first-order equivalents and proving canonicity of modal formulae, and thus established a very general correspondence and canonical completeness result. \SQEMA\ is based on transformation rules, the most important of which employs a modal version of a result by Ackermann that enables elimination of an existentially quantified predicate variable in a formula, provided a certain negative polarity condition on that variable is satisfied. In this paper we develop several extensions of (...) \SQEMA\ where that syntactic condition is replaced by a semantic one, viz. downward monotonicity. For the first, and most general, extension \SSQEMA\ we prove correctness for a large class of modal formulae containing an extension of the Sahlqvist formulae, defined by replacing polarity with monotonicity. By employing a special modal version of Lyndon's monotonicity theorem and imposing additional requirements on the Ackermann rule we obtain restricted versions of \SSQEMA\ which guarantee canonicity, too. (shrink)

Ordinary and transfinite recursion and induction and ZF set theory are used to construct from a fully interpreted object language and from an extra formula a new language. It is fully interpreted under a suitably defined interpretation. This interpretation is equivalent to the interpretation by meanings of sentences if the object language is so interpreted. The added formula provides a truth predicate for the constructed language. The so obtained theory of truth satisfies the norms presented in Hannes Leitgeb's paper 'What (...) Theories of Truth Should be Like (but Cannot be)'. (shrink)

Recent pragmatic accounts of slurs argue that the offensiveness of slurs is generated by a speaker's free choice to use a slur opposed to a more appropriate and semantically equivalent neutral counterpart. I argue that the theoretical role of neutral counterparts on such views is overstated. I consider two recent pragmatic analyses, Bolinger (Noûs, 51, 2017, 439) and Nunberg (New work on speech acts, Oxford University Press, 2018), which rely heavily upon the optionality of slurs, namely, that a speaker exercises (...) a deliberate lexical choice to use a slur when they could have easily used a neutral counterpart instead. Against such views, I argue that across a range of different offensive uses of slurs, a speaker's choice to use a slur opposed to a neutral counterpart plays little to no role in accounting for why the slur generates offence. Such cases cast serious doubt upon the explanatory depth of these pragmatic analyses, and raise more general concerns for views which draw upon the relationship between a slur and its neutral counterpart. The main upshot is this: theorists should exercise caution in assuming that neutral counterparts play any fundamental or systemic role in explaining why slurs are offensive. (shrink)

Assertoric sentences are sentences which admit of truth or falsity. Non-assertoric sentences, imperatives and interrogatives, have long been a source of difficulty for the view that a theory of truth for a natural language can serve as the core of a theory of meaning. The trouble for truth-theoretic semantics posed by non-assertoric sentences is that, prima facie, it does not make sense to say that imperatives, such as 'Cut your hair', or interrogatives such as 'What time is it?', are truth (...) or false. Thus, the vehicle for giving the meaning of a sentence by using an interpretive truth theory, the T-sentence, is apparently unavailable for non-assertoric sentences. This paper shows how to incorporate non-assertoric sentences into a theory of meaning that gives central place to an interpretive truth theory for the language, without, however, reducing the non-assertorics to assertorics, or treating their utterances as semantically equivalent to one or more utterances of assertoric sentences. Four proposals for how to incorporate non-assertoric sentences into a broadly truth-theoretic semantics are reviewed. The proposals fall into two classes, those that attempt to explain the meaning of non-assertoric sentences solely by appeal to truth conditions, and those that attempt to explain the meaning of non-assertroic sentences by appeal to compliance conditions, which can be treated as one variety of fulfillment conditions for sentences of which truth conditions are another variety. The paper argues that none of the extant approaches is successful, but develops a version of the generalized fulfillment approach which avoids the difficulties of previous approaches and still exhibits a truth theory as the central component of a compositional meaning theory for all sentences of natural language. (shrink)

In this paper, I outline a novel approach to the semantics of natural language pronouns. On this account, which I call 'demonstrativism', pronouns are semantically equivalent to demonstratives. I begin by presenting some contrasts that provide support for demonstrativism. Then I try to explain these contrasts by developing a particular demonstrativist proposal. I build on the "hidden argument" theory of demonstratives. On this theory, demonstratives are semantically similar to definite descriptions, with one important difference: demonstratives take two arguments, rather than (...) one. Using these ideas, I propose that pronouns also take two (covert) arguments, and that the second argument needs to be sufficiently salient to members of the conversation in order for the use of a pronoun to be felicitous. As for the first argument, I maintain that its content is constrained by the process of noun-phrase deletion. Taken together, I argue that these constraints provide us with a satisfying account of the uses to which pronouns are put. (shrink)

Hume's two definitions of causation have caused an extraordinary amount of controversy. The starting point for the controversy is the fact, well known to most philosophy undergraduates, that the two definitions aren't even extensionally equivalent, let alone semantically equivalent. So how can they both be definitions? One response to this problem has been to argue that Hume intends only the first as a genuine definition—an interpretation that delivers a straightforward regularity interpretation of Hume on causation. By many commentators' lights, however, (...) this is a bug rather than a feature: such an account of the two definitions leaves necessary connection out of Hume's story about the meaning of "cause" .. (shrink)

In, Kosterec attempts to provide ``model-theoretic proofs'' of certain theses involving the normal modal operators $\Diamond$ and $\square$ and the truth-in-fiction operator $F$ which he then goes on to show have counterexamples in Kripke models. He concludes from this that the embedding of modal logic under the truth-in-fiction operator is unsound. We show instead that it is the ``model-theoretic proofs'' that are themselves unsound, involving illicit substitution, a subtle error that nevertheless allows us to draw an important conclusion about intensional (...) contexts and semantic equivalences. (shrink)

Law is the main regulator of public relations, and the question of the proper use and understanding of legal language is essential for law enforcement. This topic is of interest to both lawyers and philosophers, who often join efforts to study it. This article attempts precisely to take such an interdisciplinary approach when examining legal rules as specific linguistic conventions. First of all, for the sake of a better and more thorough understanding of legal language, legal norms are viewed both (...) from the point of view of semantics and from the point of view of pragmatics. Therefore, for this purpose, a distinction is made between legal norms and legal provisions as their linguistic equivalent. Legal norms are then explored through Wittgenstein's Later Philosophy, which describes their semantic content. The pragmatic aspect of the question is explained through John Austin's theory, thus treating legal rules as a kind of specific speech act of a conventional nature. (shrink)

Based on a crowdsourced truth value judgment experiment, we provide empirical evidence challenging two classical views in semantics, and we develop a novel account of counterfactuals that combines ideas from inquisitive semantics and causal reasoning. First, we show that two truth-conditionally equivalent clauses can make different semantic contributions when embedded in a counterfactual antecedent. Assuming compositionality, this means that the meaning of these clauses is not fully determined by their truth conditions. This finding has a clear explanation in inquisitive (...) semantics: truth-conditionally equivalent clauses may be associated with different propositional alternatives, each of which counts as a separate counterfactual assumption. Second, we show that our results contradict the common idea that the interpretation of a counterfactual involves minimizing change with respect to the actual state of affairs. We propose to replace the idea of minimal change by a distinction between foreground and background for a given counterfactual assumption: the background is held fixed in the counterfactual situation, while the foreground can be varied without any minimality constraint. (shrink)

According to what has long been the dominant school of thought in analytic meta-ontology––defended not only by W. V. O. Quine, but also by Bertrand Russell, Alvin Plantinga, Peter van Inwagen, and many others––the meaning of ‘there is’ is identical to the meaning of ‘there exists.’ The most (in)famous aberration from this view is advanced by Alexius Meinong, whose ontological picture has endured extensive criticism (and borderline abuse) from several subscribers to the majority view. Meinong denies the identity of being (...) and existence. That is, he denies that ‘there is’ and ‘there exists’ are semantically equivalent, and espouses a theory according to which there are things that do not exist. Here I defend a revised version of this view, which I call “Noncontradictory Neo-Meinongianism.” Focusing primarily on van Inwagen’s arguments in “Meta-Ontology” (1998), I argue that Noncontradictory Neo-Meinongianism is, on commonsensical grounds, preferable to the meta-ontological theories of van Inwagen and Meinong. (shrink)

A uniform theory of conditionals is one which compositionally captures the behavior of both indicative and subjunctive conditionals without positing ambiguities. This paper raises new problems for the closest thing to a uniform analysis in the literature (Stalnaker, Philosophia, 5, 269–286 (1975)) and develops a new theory which solves them. I also show that this new analysis provides an improved treatment of three phenomena (the import-export equivalence, reverse Sobel-sequences and disjunctive antecedents). While these results concern central issues in the (...) study of conditionals, broader themes in the philosophy of language and formal semantics are also engaged here. This new analysis exploits a dynamic conception of meaning where the meaning of a symbol is its potential to change an agent’s mental state (or the state of a conversation) rather than being the symbol’s content (e.g. the proposition it expresses). The analysis of conditionals is also built on the idea that the contrast between subjunctive and indicative conditionals parallels a contrast between revising and consistently extending some body of information. (shrink)

We present a new frame semantics for positive relevant and substructural propositional logics. This frame semantics is both a generalisation of Routley–Meyer ternary frames and a simplification of them. The key innovation of this semantics is the use of a single accessibility relation to relate collections of points to points. Different logics are modeled by varying the kinds of collections used: they can be sets, multisets, lists or trees. We show that collection frames on trees are sound and complete for (...) the basic positive distributive substructural logic $\mathsf {B}^+$, that collection frames on multisets are sound and complete for $\mathsf {RW}^+$ (the relevant logic $\mathsf {R}^+$, without contraction, or equivalently, positive multiplicative and additive linear logic with distribution for the additive connectives), and that collection frames on sets are sound for the positive relevant logic $\mathsf {R}^+$. The completeness of set frames for $\mathsf {R}^+$ is, currently, an open question. (shrink)

What does ‘Smith knows that it might be raining’ mean? Expressivism here faces a challenge, as its basic forms entail a pernicious type of transparency, according to which ‘Smith knows that it might be raining’ is equivalent to ‘it is consistent with everything that Smith knows that it is raining’ or ‘Smith doesn’t know that it isn’t raining’. Pernicious transparency has direct counterexamples and undermines vanilla principles of epistemic logic, such as that knowledge entails true belief and that something can (...) be true without one knowing it might be. I re-frame the challenge in precise terms and propose a novel expressivist formal semantics that meets it by exploiting (i) the topic-sensitivity and fragmentation of knowledge and belief states and (ii) the apparent context-sensitivity of epistemic modality. The resulting form of assertibility semantics advances the state of the art for state-based bilateral semantics by combining attitude reports with context-sensitive modal claims, while evading various objectionable features. In appendices, I compare the proposed system to Beddor and Goldstein’s ‘safety semantics’ and discuss its analysis of a modal Gettier case due to Moss. (shrink)

This paper reviews the central points and presents some recent developments of the epistemic approach to paraconsistency in terms of the preservation of evidence. Two formal systems are surveyed, the basic logic of evidence (BLE) and the logic of evidence and truth (LET J ), designed to deal, respectively, with evidence and with evidence and truth. While BLE is equivalent to Nelson’s logic N4, it has been conceived for a different purpose. Adequate valuation semantics that provide decidability are given for (...) both BLE and LET J . The meanings of the connectives of BLE and LET J , from the point of view of preservation of evidence, is explained with the aid of an inferential semantics. A formalization of the notion of evidence for BLE as proposed by M. Fitting is also reviewed here. As a novel result, the paper shows that LET J is semantically characterized through the so-called Fidel structures. Some opportunities for further research are also discussed. (shrink)

The main goal of this paper is to investigate the relation between the meaning of a sentence and its truth conditions. We report on a comprehension experiment on counterfactual conditionals, based on a context in which a light is controlled by two switches. Our main finding is that the truth-conditionally equivalent clauses (i) "switch A or switch B is down" and (ii) "switch A and switch B are not both up" make different semantic contributions when embedded in a conditional (...) antecedent. Assuming compositionality, this means that (i) and (ii) differ in meaning, which implies that the meaning of a sentential clause cannot be identified with its truth conditions. We show that our data have a clear explanation in inquisitive semantics: in a conditional antecedent, (i) introduces two distinct assumptions, while (ii) introduces only one. Independently of the complications stemming from disjunctive antecedents, our results also challenge analyses of counterfactuals in terms of minimal change from the actual state of affairs: we show that such analyses cannot account for our findings, regardless of what changes are considered minimal. (shrink)

After long arguments between positivism and falsificationism, the verification of universal hypotheses was replaced with the confirmation of uncertain major premises. Unfortunately, Hemple proposed the Raven Paradox. Then, Carnap used the increment of logical probability as the confirmation measure. So far, many confirmation measures have been proposed. Measure F proposed by Kemeny and Oppenheim among them possesses symmetries and asymmetries proposed by Elles and Fitelson, monotonicity proposed by Greco et al., and normalizing property suggested by many researchers. Based on the (...) semantic information theory, a measure b* similar to F is derived from the medical test. Like the likelihood ratio, measures b* and F can only indicate the quality of channels or the testing means instead of the quality of probability predictions. Furthermore, it is still not easy to use b*, F, or another measure to clarify the Raven Paradox. For this reason, measure c* similar to the correct rate is derived. Measure c* supports the Nicod Criterion and undermines the Equivalence Condition, and hence, can be used to eliminate the Raven Paradox. An example indicates that measures F and b* are helpful for diagnosing the infection of Novel Coronavirus, whereas most popular confirmation measures are not. Another example reveals that all popular confirmation measures cannot be used to explain that a black raven can confirm “Ravens are black” more strongly than a piece of chalk. Measures F, b*, and c* indicate that the existence of fewer counterexamples is more important than more positive examples’ existence, and hence, are compatible with Popper’s falsification thought. (shrink)

One of the most expected properties of a logical system is that it can be algebraizable, in the sense that an algebraic counterpart of the deductive machinery could be found. Since the inception of da Costa's paraconsistent calculi, an algebraic equivalent for such systems have been searched. It is known that these systems are non self-extensional (i.e., they do not satisfy the replacement property). More than this, they are not algebraizable in the sense of Blok-Pigozzi. The same negative results hold (...) for several systems of the hierarchy of paraconsistent logics known as Logics of Formal Inconsistency (LFIs). Because of this, these logics are uniquely characterized by semantics of non-deterministic kind. This paper offers a solution for two open problems in the domain of paraconsistency, in particular connected to algebraization of LFIs, by obtaining several LFIs weaker than C1, each of one is algebraizable in the standard Lindenbaum-Tarski's sense by a suitable variety of Boolean algebras extended with operators. This means that such LFIs satisfy the replacement property. The weakest LFI satisfying replacement presented here is called RmbC, which is obtained from the basic LFI called mbC. Some axiomatic extensions of RmbC are also studied, and in addition a neighborhood semantics is defined for such systems. It is shown that RmbC can be defined within the minimal bimodal non-normal logic E+E defined by the fusion of the non-normal modal logic E with itself. Finally, the framework is extended to first-order languages. RQmbC, the quantified extension of RmbC, is shown to be sound and complete w.r.t. BALFI semantics. (shrink)

This paper develops a theory of propositional identity which distinguishes necessarily equivalent propositions that differ in subject-matter. Rather than forming a Boolean lattice as in extensional and intensional semantic theories, the space of propositions forms a non-interlaced bilattice. After motivating a departure from tradition by way of a number of plausible principles for subject-matter, I will provide a Finean state semantics for a novel theory of propositions, presenting arguments against the convexity and nonvacuity constraints which Fine (2016, 2017a,b) introduces. (...) I will then move to compare the resulting logic of propositional identity (PI) with Correia’s (2016) logic of generalised identity (GI), as well as the first degree fragment of Angell’s (1989) logic of analytic containment (AC). The paper concludes by extending PI to include axioms and rules for a subject-matter operator, providing a much broader theory of subject-matter than the principles with which I will begin. (shrink)

Recent advances in the Super Linguistics of pictures have laid the Super Semantic foundation for modelling the phenomena of narrative sequencing and co-reference in pictorial and mixed linguistic-pictorial discourses. We take up the question of how one arrives at the pragmatic interpretations of such discourses. In particular, we offer an analysis of: (i) the discourse composition problem: how to represent the joint meaning of a multi-picture discourse, (ii) observed differences in narrative sequencing in prima facie equivalent linguistic vs pictorial (...) discourses, and (iii) the phenomenon of co-referencing across pictures. We extend Segmented Discourse Representation Theory to spell out a formal Super Pragmatics that applies to linguistic, pictorial and mixed discourses, while respecting the particular ‘genius’ of either medium and computing their distinctive pragmatic interpretations. (shrink)

In the debate about semantic context dependence, various truth-conditional frameworks have been proposed. Indexicalism, associated with e.g. Jason Stanley, accounts for contextual effects on truth conditions in terms of a rich covert syntax. Truth-conditional pragmatics, associated with e.g. François Recanati, does not locate the mechanisms for context dependence in the syntactic structure but provides a more complex semantics. In this dissertation, the hypothesis that indexicalism and truth-conditional pragmatics are empirically equivalent is explored. The conclusion that the hypothesis is correct (...) emerges, when claims and accounts in the debate are made formally precise, within the framework of model-theoretic semantics. -/- . (shrink)

Standard compositionality is the doctrine that the semantic content of a compound expression is a function of the semantic contents of the contentful component expressions. In 1954 Hilary Putnam proposed that standard compositionality be replaced by a stricter version according to which even sentences that are synonymously isomorphic (in the sense of Alonzo Church) are not strictly synonymous unless they have the same logical form. On Putnam’s proposal, the semantic content of a compound expression is a function (...) of: (i) the contentful component expressions; and (ii) the expression’s logical form. Kit Fine recently expanded and modified Putnam’s idea into a sweeping theory in philosophy of language and philosophy of mind. The present paper is a detailed critique of Fine’s “semantic relationism.” Fine’s notion of coordination is explained in terms of the familiar pragmatic phenomenon of recognition. A serious error in Fine’s formal disproof of standard Millianism is exposed. It is demonstrated furthermore that Church’s original criticism of Putnam’s proposal can be extended to Fine’s semantic relationism. Finally, it is also demonstrated that the positive position Fine proffers to supplant standard Millianism is in fact exactly equivalent to standard Millianism, so that Fine’s overall position not only does not displace standard Millianism but is in fact inconsistent. (shrink)

This is what I hope is an illuminating, and to a certain degree, novel exposition of Montague Grammar. It is against many standard interpretations, and perhaps even against things Montague himself says at times. However, it makes more sense of how his various commitments fit together in a systematic way. Why, for instance, is it called "Montague Grammar" rather than "Montague Semantics," and what role does his commitment to Fregeanism plays in his conception of language? It is clear that he (...) is committed to the idea that function application is the fundamental mode of semantic composition, and that he is committed to an intensional framework. However, intensions have, since Carnap, been understood as nearly conceptually equivalent to functions from possible worlds to sets of individuals. But, in truth, possible worlds semantics is just dressed up extensional semantics. There are just more objects to go around to serve as inputs for functions, whatever we think of their ontological status. That is, possible worlds semantics is really a semantic reduction of intensional semantics achieved by expanding our ontological commitments. It would be difficult to make sense of Montague's strong commitment to Fregean semantics, if his notion of intension was that of Carnap's. According to my interpretation, Montague's notion of intension must be distinct from the version adopted by possible world semantics. Montague took seriously the idea that intensional semantics was something quite different from extensionalist semantics. The first was not reducible to the second semantically speaking. Just as Frege believed that meaning consisted of both sense and reference, so too did Montague. However, just as Frege also believed, Montague thought that sense and reference were systematically related. As I illustrate, interpreting Montague as adopting a different notion of intension can also resolve the apparent problem of distinguishing the difference in meaning between intensional equivalents. It might also enable us to draw a distinction in epistemic logic between an agent having contradictory beliefs and believing contradictions. (shrink)

In this work, it is shown that given a correct understanding of the nature of reference and of linguistic meaning generally, it is possible to produce non-revisionist analyses of the nature of -/- *Perceptual content, *Mental content generally, *Logical equivalence, *Logical dependence generally, *Counterfactual truth, *The causal efficacy of mental states, and *Our knowledge of ourselves and of the external world. -/- In addition, set-theoretic interpretations of several semantic concepts are put forth. These concepts include truth, falsehood, negation, (...) and conjunction. (shrink)

The Quality of Thought develops and defends the thesis that thinking is a kind of experience, characterized by a sui generis (“cognitive”) phenomenology, determinates of which are thought contents—what I call the phenomenal intentionality of thought thesis. It draws out the implications of this thesis for issues in philosophy of mind, philosophy of language and metaphysics. The view defended is radically internalist and intensionalist, and thus goes against received doctrines in philosophy of mind (externalism) and language (extensionalism). It also advocates (...) for a metaphysically neutral, non-naturalistic approach to the philosophical study of mind—what I call “Analytic Phenomenology”—in combination with agnosticism about the nature of the relationship between consciousness and physical reality. -/- The book identifies persistent problems with Dretske-inspired causal-informational-teleological theories of conceptual content, and diagnoses them as due to leaving out what it’s like to think a thought—to entertain or grasp a propositional (conceptual) content. It is thus a contribution to the increasingly influential Phenomenal Intentionality Research Program. It includes refutations of classic externalism (Putnam and Burge) and arguments that standard motivations for direct reference theories of names (Kripke), indexicals and demonstratives (Kaplan) are not inevitable, and alternative accounts of their (and their conceptual equivalents’) semantics. It also addresses outstanding challenges to the phenomenal intentionalist view of thought content, including the existence of unconscious thought, the elusiveness of conceptual phenomenology, the matching content problem, phenomenal compositionality, and the determination of conceptual reference. (shrink)

We study a new formal logic LD introduced by Prof. Grzegorczyk. The logic is based on so-called descriptive equivalence, corresponding to the idea of shared meaning rather than shared truth value. We construct a semantics for LD based on a new type of algebras and prove its soundness and completeness. We further show several examples of classical laws that hold for LD as well as laws that fail. Finally, we list a number of open problems. -/- .

In one of their papers, Michael De and Hitoshi Omori observed that the notion of classical negation is not uniquely determined in the context of so-called Belnap-Dunn logic, and in fact there are 16 unary operations that qualify to be called classical negation. These varieties are due to different falsity conditions one may assume for classical negation. The aim of this paper is to observe that there is an interesting way to make sense of classical negation independent of falsity conditions. (...) We discuss two equivalent semantics, and offer a Hilbert-style system that is sound and complete with respect to the semantics. (shrink)

Cathoristic logic is a multi-modal logic where negation is replaced by a novel operator allowing the expression of incompatible sentences. We present the syntax and semantics of the logic including complete proof rules, and establish a number of results such as compactness, a semantic characterisa- tion of elementary equivalence, the existence of a quadratic-time decision pro- cedure, and Brandom’s incompatibility semantics property. We demonstrate the usefulness of the logic as a language for knowledge representation.

This paper discusses the philosophical and logical motivations for rejectivism, primarily by considering a dialogical approach to logic, which is formalized in a Question–Answer Semantics. We develop a generalized account of rejectivism through close consideration of Mark Textor's arguments against rejectivism that the negative expression ‘No’ is never used as an act of rejection and is equivalent with a negative sentence. In doing so, we also shed light upon well-known issues regarding the supposed non-embeddability and non-iterability of force indicators.

Theories of content are at the centre of philosophical semantics. The most successful general theory of content takes contents to be sets of possible worlds. But such contents are very coarse-grained, for they cannot distinguish between logically equivalent contents. They draw intensional but not hyperintensional distinctions. This is often remedied by including impossible as well as possible worlds in the theory of content. Yet it is often claimed that impossible worlds are metaphysically obscure; and it is sometimes claimed that their (...) use results in a trivial theory of content. In this paper, I set out the need for impossible worlds in a theory of content; I briefly sketch a metaphysical account of their nature; I argue that worlds in general must be very fine-grained entities; and, finally, I argue that the resulting conception of impossible worlds is not a trivial one. (shrink)

A system of logic usually comprises a language for which a model-theory and a proof-theory are defined. The model-theory defines the semantic notion of model-theoretic logical consequence (⊨), while the proof-theory defines the proof- theoretic notion of logical consequence (or logical derivability, ⊢). If the system in question is sound and complete, then the two notions of logical consequence are extensionally equivalent. The concept of full formalization is a more restrictive one and requires in addition the preservation of the (...) standard meanings of the logical terms in all the admissible interpretations of the logical calculus, as it is proof-theoretically defined. Although classical first-order logic is sound and complete, its standard formalizations fall short to be full formalizations since they allow non-intended interpretations. This fact poses a challenge for the logical inferentialism program, whose main tenet is that the meanings of the logical terms are uniquely determined by the formal axioms or rules of inference that govern their use in a logical calculus, i.e., logical inferentialism requires a categorical calculus. This paper is the first part of a more elaborated study which will analyze the categoricity problem from its beginning until the most recent approaches. I will first start by describing the problem of a full formalization in the general framework in which Carnap (1934/1937, 1943) formulated it for classical logic. Then, in sections IV and V, I shall discuss the way in which the mathematicians B.A. Bernstein (1932) and E.V. Huntington (1933) have previously formulated and analyzed it in algebraic terms for propositional logic and, finally, I shall discuss some critical reactions Nagel (1943), Hempel (1943), Fitch (1944), and Church (1944) formulated to these approaches. (shrink)

Alonzo Church famously provided three principal competing criteria for “strict synonymy,” i.e., sameness of semantic content. These are his Alternatives (0), (1), and (2)—numbered in order of increasing course-grainedness of content. On Alternative (2), expressions are deemed strictly synonymous iff they are logically equivalent. This criterion seems hopeless as an account of the objects of propositional attitude. On Alternative (1), expressions are deemed synonymous iff they are λ-convertible. Alternative (1) also evidently conflicts with discourse about the attitudes. On Alternative (...) (0), expressions are deemed strictly synonymous iff they are “synonymously isomorphic” in Church’s sense. On Alternative (0), semantic content is so fine-grained that not even “Romeo loves Juliet” and “Juliet is loved by Romeo” qualify as strictly synonymous. A fourth alternative, here called “Alternative (3),” deems expressions strictly synonymous iff they are co-intensional, i.e., they have the same semantic extension with respect to the same possible worlds. This criterion’s notion of content is even more course grained than that of Alternative (2). Several objections to Alternative (3) are considered. (This article is contained within the author’s more definitive essay, “Singular Concepts”.). (shrink)

Abstract. The aim of this paper is to present a topological method for constructing discretizations (tessellations) of conceptual spaces. The method works for a class of topological spaces that the Russian mathematician Pavel Alexandroff defined more than 80 years ago. Alexandroff spaces, as they are called today, have many interesting properties that distinguish them from other topological spaces. In particular, they exhibit a 1-1 correspondence between their specialization orders and their topological structures. Recently, a special type of Alexandroff spaces was (...) used by Ian Rumfitt to elucidate the logic of vague concepts in a new way. According to his approach, conceptual spaces such as the color spectrum give rise to classical systems of concepts that have the structure of atomic Boolean algebras. More precisely, concepts are represented as regular open regions of an underlying conceptual space endowed with a topological structure. Something is subsumed under a concept iff it is represented by an element of the conceptual space that is maximally close to the prototypical element p that defines that concept. This topological representation of concepts comes along with a representation of the familiar logical connectives of Aristotelian syllogistics in terms of natural settheoretical operations that characterize regular open interpretations of classical Boolean propositional logic. In the last 20 years, conceptual spaces have become a popular tool of dealing with a variety of problems in the fields of cognitive psychology, artificial intelligence, linguistics and philosophy, mainly due to the work of Peter Gärdenfors and his collaborators. By using prototypes and metrics of similarity spaces, one obtains geometrical discretizations of conceptual spaces by so-called Voronoi tessellations. These tessellations are extensionally equivalent to topological tessellations that can be constructed for Alexandroff spaces. Thereby, Rumfitt’s and Gärdenfors’s constructions turn out to be special cases of an approach that works for a more general class of spaces, namely, for weakly scattered Alexandroff spaces. This class of spaces provides a convenient framework for conceptual spaces as used in epistemology and related disciplines in general. Alexandroff spaces are useful for elucidating problems related to the logic of vague concepts, in particular they offer a solution of the Sorites paradox (Rumfitt). Further, they provide a semantics for the logic of clearness (Bobzien) that overcomes certain problems of the concept of higher2 order vagueness. Moreover, these spaces help find a natural place for classical syllogistics in the framework of conceptual spaces. The crucial role of order theory for Alexandroff spaces can be used to refine the all-or-nothing distinction between prototypical and nonprototypical stimuli in favor of a more fine-grained gradual distinction between more-orless prototypical elements of conceptual spaces. The greater conceptual flexibility of the topological approach helps avoid some inherent inadequacies of the geometrical approach, for instance, the so-called “thickness problem” (Douven et al.) and problems of selecting a unique metric for similarity spaces. Finally, it is shown that only the Alexandroff account can deal with an issue that is gaining more and more importance for the theory of conceptual spaces, namely, the role that digital conceptual spaces play in the area of artificial intelligence, computer science and related disciplines. Keywords: Conceptual Spaces, Polar Spaces, Alexandroff Spaces, Prototypes, Topological Tessellations, Voronoi Tessellations, Digital Topology. (shrink)