Our aim in the present paper is to investigate, from the standpoint of truth-theoretic semantics, English tense, temporal designators and quantifiers, and other expressions we use to relate ourselves and other things to the temporal order. Truth-theoretic semantics provides a particularly illuminating standpoint from which to discuss issues about the semantics of tense, and their relation to thoughts at, and about, times. Tense, and temporal modifiers, contribute systematically to conditions under which sentences we utter are (...) true or false. A Tarski-style truth-theoretic semantics, by requiring explicitly represented truth conditions, helps to sharpen questions about the function of tense, and to deepen our insight into the contribution the tenses and temporal modifiers make to what we say by using them. (shrink)

Many areas of philosophy employ a distinction between factual and non-factual (descriptive/non-descriptive, cognitive/non-cognitive, etc) uses of language. This book examines the various ways in which this distinction is normally drawn, argues that all are unsatisfactory, and suggests that the search for a sharp distinction is misconceived. The book develops an alternative approach, based on a novel theory of the function and origins of the concept of truth. The central hypothesis is that the main role of the normative notion of (...) truth is to encourage speakers to argue, with long-run behavioural advantages. This offers a fresh perspective on many debates about realism in contemporary philosophy. (shrink)

This paper establishes a sound and complete semantics for the impure logic of ground. Fine (Review of Symbolic Logic, 5(1), 1–25, 2012a) sets out a system for the pure logic of ground, one in which the formulas between which ground-theoretic claims hold have no internal logical complexity; and it provides a sound and complete semantics for the system. Fine (2012b) [§§6-8] sets out a system for an impure logic of ground, one that extends the rules of the original (...) pure system with rules for the truth-functional connectives, the first-order quantifiers, and λ-abstraction. However, no semantics has yet been provided for this system. The present paper partly fills this lacuna by providing a sound and complete semantics for a system GG containing the truth-functional operators that is closely related to the truth-functional part of the system of Fine (2012b). (shrink)

Lexical semantics has a problem. As Allesandro Lenci put it, the problem is that it cannot distinguish semantic from non-semantic relationships within its data. (2008, 2014). The data it relies on are patterns of co-occurrence of lexemes within linguistic corpora. But patterns of co-occurrence can reflect either our knowledge of what the world is like or our knowledge of what words mean -- matters of fact or matters of meaning. -/- In this essay, I develop a semantic theory which (...) draws this distinction in a way which makes it discernible in lexical semantics and cognitive science research. In doing so, this theory unifies truth-functional and structuralist approaches to semantics, and provides an integrated explanation of meaning and reference. -/- I base this semantic theory on linguistic dispositions to pair words with words, and to pair words with things, both based on learned patterns of association. These dispositions manifest themselves in verbal behavior, and (in Part 2) I propose a new neurophysical model to account for these dispositions which underlie both the intensional and extensional patterns in that behavior. (shrink)

Semantic Information conveyed by daily language has been researched for many years; yet, we still need a practical formula to measure information of a simple sentence or prediction, such as “There will be heavy rain tomorrow”. For practical purpose, this paper introduces a new formula, Semantic Information Formula (SIF), which is based on L. A. Zadeh’s fuzzy set theory and P. Z. Wang’s random set falling shadow theory. It carries forward C. E. Shannon and K. Popper’s thought. The fuzzy set’s (...) probability defined by Zadeh is treated as the logical probability sought by Popper, and the membership grade is treated as the truth-value of a proposition and also as the posterior logical probability. The classical relative information formula (Information=log(Posterior probability / Prior probability) is revised into SIF by replacing the posterior probability with the membership grade and the prior probability with the fuzzy set’s probability. The SIF can be explained as “Information=Testing severity – Relative square deviation” and hence can be used as Popper's information criterion to test scientific theories or propositions. The information measure defined by the SIF also means the spared codeword length as the classical information measure. This paper introduces the set-Bayes’ formula which establishes the relationship between statistical probability and logical probability, derives Fuzzy Information Criterion (FIC) for the optimization of semantic channel, and discusses applications of SIF and FIC in areas such as linguistic communication, prediction, estimation, test, GPS, translation, and fuzzy reasoning. Particularly, through a detailed example of reasoning, it is proved that we can improve semantic channel with proper fuzziness to increase average semantic information to reach its upper limit: Shannon mutual information. (shrink)

An important problem with machine learning is that when label number n>2, it is very difficult to construct and optimize a group of learning functions, and we wish that optimized learning functions are still useful when prior distribution P(x) (where x is an instance) is changed. To resolve this problem, the semantic information G theory, Logical Bayesian Inference (LBI), and a group of Channel Matching (CM) algorithms together form a systematic solution. MultilabelMultilabel A semantic channel in the G theory consists (...) of a group of truth functions or membership functions. In comparison with likelihood functions, Bayesian posteriors, and Logistic functions used by popular methods, membership functions can be more conveniently used as learning functions without the above problem. In Logical Bayesian Inference (LBI), every label’s learning is independent. For Multilabel learning, we can directly obtain a group of optimized membership functions from a big enough sample with labels, without preparing different samples for different labels. A group of Channel Matching (CM) algorithms are developed for machine learning. For the Maximum Mutual Information (MMI) classification of three classes with Gaussian distributions on a two-dimensional feature space, 2-3 iterations can make mutual information between three classes and three labels surpass 99% of the MMI for most initial partitions. For mixture models, the Expectation-Maxmization (EM) algorithm is improved and becomes the CM-EM algorithm, which can outperform the EM algorithm when mixture ratios are imbalanced, or local convergence exists. The CM iteration algorithm needs to combine neural networks for MMI classifications on high-dimensional feature spaces. LBI needs further studies for the unification of statistics and logic. (shrink)

In “Is semantics possible?” Putnam connected two themes: the very possibility of semantics (as opposed to formal model theory) for natural languages and the proper semantic treatment of common nouns. Putnam observed that abstract semantic accounts are modeled on formal languages model theory: the substantial contribution is rules for logical connectives (given outside the models), whereas the lexicon (individual constants and predicates) is treated merely schematically by the models. This schematic treatment may be all that is needed for (...) an account of validity in a formal setting, but it does not help to understand how proper and common nouns function in reality (not in models). Putnam then initiated the empirical study of such nouns to indicate, (i), that the popular Frege-Carnap account of them as (“disguised” compound) predicates is empirically incorrect, and, (ii), that they offer a new paradigm for a naturalistic semantics of natural languages. We take Putnam’s program a couple of steps further. First, we investigate the semantics of common nouns and argue that they refer (to kinds), rather than apply by satisfaction/truth to a designation/denotation. Second, we point to general results about semantics as a theory whose fulcrum is the reference relation rather than satisfaction in models and validity across them. (shrink)

Complex demonstratives, expressions of the form 'That F', 'These Fs', etc., have traditionally been taken to be referring terms. Yet they exhibit many of the features of quantified noun phrases. This has led some philosophers to suggest that demonstrative determiners are a special kind of quantifier, which can be paraphrased using a context sensitive definite description. Both these views contain elements of the truth, though each is mistaken. We advance a novel account of the semantic form of complex demonstratives (...) that shows how to reconcile the view that they function like quantified noun phrases with the view that simple demonstratives function as context sensitive referring terms wherever they occur. If we are right, previous accounts of complex demonstratives have misconceived their semantic role; and philosophers relying on the majority view in employing complex demonstratives in analysis have proceeded on a false assumption. (shrink)

Jeffrey King has recently argued: (i) that the semantic value of a sentence at a context is (or determines) a function from possible worlds to truth values, and (ii) that this undermines Jason Stanley's argument against the rigidity thesis, the claim that no rigid term has the same content as a non-rigid term. I show that King's main argument for (i) fails, and that Stanley's argument is consistent with the claim that the semantic value of a sentence at a (...) context is (or determines) a function from worlds to truth values. (shrink)

Logical Probability (LP) is strictly distinguished from Statistical Probability (SP). To measure semantic information or confirm hypotheses, we need to use sampling distribution (conditional SP function) to test or confirm fuzzy truth function (conditional LP function). The Semantic Information Measure (SIM) proposed is compatible with Shannon’s information theory and Fisher’s likelihood method. It can ensure that the less the LP of a predicate is and the larger the true value of the proposition is, the more information there is. So (...) the SIM can be used as Popper's information criterion for falsification or test. The SIM also allows us to optimize the true-value of counterexamples or degrees of disbelief in a hypothesis to get the optimized degree of belief, i. e. Degree of Confirmation (DOC). To explain confirmation, this paper 1) provides the calculation method of the DOC of universal hypotheses; 2) discusses how to resolve Raven Paradox with new DOC and its increment; 3) derives the DOC of rapid HIV tests: DOC of “+” =1-(1-specificity)/sensitivity, which is similar to Likelihood Ratio (=sensitivity/(1-specificity)) but has the upper limit 1; 4) discusses negative DOC for excessive affirmations, wrong hypotheses, or lies; and 5) discusses the DOC of general hypotheses with GPS as example. (shrink)

According to the accepted translation-failure interpretation, the problem of incommensurability involves the nature of the meaning-referential relation between scientific languages. The incommensurability thesis is that some competing scientific languages are mutually untranslatable due to the radical variance of meaning or/and reference of the terms they employ. I argue that this interpretation faces many difficulties and cannot give us a tenable, coherent, and integrated notion of incommensurability. It has to be rejected. ;On the basis of two case studies, I find that (...) the confrontations between many classical incommensurable languages are not confrontations between two untranslatable languages with different distribution of truth values, but rather the confrontations between incompatible fundamental presuppositions at the ontological level. We can always identify a truth-value gap between two incommensurable languages. Such a truth-value gap indicates a communication breakdown between the two language communities on the one hand, and is caused by the incompatible fundamental presuppositions underlying them on the other. ;I thereby identify the truth-value functional relationship between sentences, instead of the meaning-referential relationship between terms, as the dominant semantic relation between two incommensurable languages. According to my presuppositional interpretation of incommensurability, the real secret of incommensurability lies in the ontological setup of two competing presuppositional languages. When two presuppositional languages with incompatible factual commitments encounter with each other, the confrontation leads to a truth-value gap, and consequently a communication breakdown between them. Formally put, two scientific languages are incommensurable when core sentences of one language, which have truth values when considered within its own context, lack truth values when considered within the context of the other due to an ontological gap between them. ;The presuppositional interpretation makes many significant contributions to the discussion of the issue of incommensurability and the related metaphysical and epistemological issues: It confirms the existence of the phenomenon of incommensurability and makes it metaphysically and epistemologically significant. It establishes the tenability and integrity of the notion of incommensurability. It avoids many alleged unattractive epistemological and metaphysical consequences of the translation-failure interpretation. (shrink)

A concrete proposal is presented as to how semantics should be naturalized. Rather than attempting to naturalize propositions, they are treated as abstract entities that index concrete cognitive states. In turn the relevant concrete cognitive states are identified via perceptual classifications of worldly states, with the aid of an interactive theory of perception. The approach enables a broadly realist theory of propositions, truth and cognitive states to be preserved, with propositions functioning much as abstract mathematical constructs do in (...) the nonsemantic sciences, but with a much more specific propositional indexing scheme than previous naturalistic proposals were able to achieve. (shrink)

The paper briefly surveys the sentential proof-theoretic semantics for fragment of English. Then, appealing to a version of Frege’s context-principle (specified to fit type-logical grammar), a method is presented for deriving proof-theoretic meanings for sub-sentential phrases, down to lexical units (words). The sentential meaning is decomposed according to the function-argument structure as determined by the type-logical grammar. In doing so, the paper presents a novel proof-theoretic interpretation of simple type, replacing Montague’s model-theoretic type interpretation (in arbitrary Henkin models). The (...) domains of derivations are collections of derivations in the associated “dedicated” natural-deduction proof-system, and functions therein (with no appeal to models, truth-values and elements of a domain). The compositionality of the semantics is analyzed. (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)

It is common practice in formal semantics to assume that the context specifies an assignment of values to variables and that the same variables that receive contextually salient values when they occur free may also be bound by quantifiers and λs. These assumptions are at work to provide a unified account of free and bound uses of third person pronouns, namely one by which the same lexical item is involved in both uses. One way to pursue this account is (...) to treat quantifiers and λs as monsters in Kaplan’s sense. We argue that this move should be avoided and explore an alternative route based on the idea that there is a variable assignment coordinate in the context and a variable assignment coordinate in the circumstance of evaluation, with the definition of truth in context identifying them. One fundamental challenge that arises in pursuing a unified account is to explain the difference in the way the gender presuppositions of bound and free pronouns project. The proposal that emerges from the attempt to meet this challenge is a non-indexical account of free third person pronouns and a new conception of the role and structure of assignment functions. (shrink)

In this paper, I present a categorial theory of meaning which asserts that the meaning of a sentence is the function from the actualization of some potentiality or the potentiality of some actuality to the truth of the sentence. I argue that it builds on the virtues of David Lewis’s Possible World Semantics but advances beyond problems that Lewis’s theory faces with its distinctly Aristotelian turn toward actuality and potentiality.

Joyce (1998) gives an argument for probabilism: the doctrine that rational credences should conform to the axioms of probability. In doing so, he provides a distinctive take on how the normative force of probabilism relates to the injunction to believe what is true. But Joyce presupposes that the truth values of the propositions over which credences are defined are classical. I generalize the core of Joyce’s argument to remove this presupposition. On the same assumptions as Joyce uses, the credences (...) of a rational agent should always be weighted averages of truth value assignments. In the special case where the truth values are classical, the weighted averages of truth value assignments are exactly the probability functions. But in the more general case, probabilistic axioms formulated in terms of classical logic are violated—but we will show that generalized versions of the axioms formulated in terms of non-classical logics are satisfied. (shrink)

Philosophers are divided on whether the proof- or truth-theoretic approach to logic is more fruitful. The paper demonstrates the considerable explanatory power of a truth-based approach to logic by showing that and how it can provide (i) an explanatory characterization —both semantic and proof-theoretical—of logical inference, (ii) an explanatory criterion for logical constants and operators, (iii) an explanatory account of logic’s role (function) in knowledge, as well as explanations of (iv) the characteristic features of logic —formality, strong modal (...) force, generality, topic neutrality, basicness, and (quasi-)apriority, (v) the veridicality of logic and its applicability to science, (v) the normativity of logic, (vi) error, revision, and expansion in/of logic, and (vii) the relation between logic and mathematics. The high explanatory power of the truth-theoretic approach does not rule out an equal or even higher explanatory power of the proof-theoretic approach. But to the extent that the truth-theoretic approach is shown to be highly explanatory, it sets a standard for other approaches to logic, including the proof-theoretic approach. (shrink)

The idea that the concept ‘knowledge’ has a distinctive function or social role is increasingly influential within contemporary epistemology. Perhaps the best-known account of the function of ‘knowledge’ is that developed in Edward Craig’s Knowledge and the state of nature (1990, OUP), on which (roughly) ‘knowledge’ has the function of identifying good informants. Craig’s account of the function of ‘knowledge’ has been appealed to in support of a variety of views, and in this paper I’m concerned with the claim that (...) it supports a sort of epistemic contextualism, which is (roughly) the view that the semantic contents and truth-conditions of ‘knowledge’ ascriptions - instances of ‘S knows that p’- depend on and vary with the context of ascription (see, for instance, John Greco’s ‘What’s wrong with contextualism’, Philosophical Quarterly [2008]). Prima facie, this claim should strike us as surprising. A number of concepts and linguistic items (words, sentences) serve functions that have little or nothing to do with semantics. However, I argue that, on the best interpretation of talk of the function of a concept such as ‘knowledge’, the function of ‘knowledge’ is relevant to semantics. Along the way I also suggest how to improve on what I call the ‘usual argument’ that Craig’s account of the function of ‘knowledge’ supports epistemic contextualism. (shrink)

On the basis of elementary thinking about language functioning, a solution of truth paradoxes is given and a corresponding semantics of a truth predicate is founded. It is shown that it is precisely the two-valued description of the maximal intrinsic fixed point of the strong Kleene three-valued semantics.

A general framework for translating various logical systems is presented, including a set of partial unary operators of affirmation and negation. Despite its usual reading, affirmation is not redundant in any domain of values and whenever it does not behave like a full mapping. After depicting the process of partial functions, a number of logics are translated through a variety of affirmations and a unique pair of negations. This relies upon two preconditions: a deconstruction of truth-values as ordered and (...) structured objects, unlike its mainstream presentation as a simple object; a redefinition of the Principle of Bivalence as a set of four independent properties, such that its definition does not equate with normality. (shrink)

We present Logical Description Grammar (LDG), a model ofgrammar and the syntax-semantics interface based on descriptions inelementary logic. A description may simultaneously describe the syntacticstructure and the semantics of a natural language expression, i.e., thedescribing logic talks about the trees and about the truth-conditionsof the language described. Logical Description Grammars offer a naturalway of dealing with underspecification in natural language syntax andsemantics. If a logical description (up to isomorphism) has exactly onetree plus truth-conditions as a model, (...) it completely specifies thatgrammatical object. More common is the situation, corresponding tounderspecification, in which there is more than one model. A situation inwhich there are no models corresponds to an ungrammatical input. (shrink)

In their recent paper Bi-facial truth: a case for generalized truth values Zaitsev and Shramko [7] distinguish between an ontological and an epistemic interpretation of classical truth values. By taking the Cartesian product of the two disjoint sets of values thus obtained, they arrive at four generalized truth values and consider two “semi-classical negations” on them. The resulting semantics is used to define three novel logics which are closely related to Belnap’s well-known four valued logic. (...) A syntactic characterization of these logics is left for further work. In this paper, based on our previous work on a functionally complete extension of Belnap’s logic, we present a sound and complete tableau calculus for these logics. It crucially exploits the Cartesian nature of the four values, which is reflected in the fact that each proof consists of two tableaux. The bi-facial notion of truth of Z&S is thus augmented with a bi-facial notion of proof. We also provide translations between the logics for semi-classical negation and classical logic and show that an argument is valid in a logic for semi-classical negation just in case its translation is valid in classical logic. (shrink)

Even though it is not very often admitted, partial functions do play a significant role in many practical applications of deduction systems. Kleene has already given a semantic account of partial functions using a three-valued logic decades ago, but there has not been a satisfactory mechanization. Recent years have seen a thorough investigation of the framework of many-valued truth-functional logics. However, strong Kleene logic, where quantification is restricted and therefore not truthfunctional, does not fit the framework directly. We (...) solve this problem by applying recent methods from sorted logics. This paper presents a tableau calculus that combines the proper treatment of partial functions with the efficiency of sorted calculi. (shrink)

On this particular issue about ¨truth¨, I´d rather focus more on the specific problematization of ¨sentential truth¨. In other words, I will not be concerned with the truth of an event or an experience per se in the objective, intersubjective or subjective sense. In the present consideration, I´d be more concentrated on the truth of beliefs uttered in meaningful statements. This distinctively philosophical approach—in the linguistic-analytic tradition—is supportive of the intent to determine whether certain beliefs are (...) matters of knowledge or not with respect to how classical philosophy presupposes that ONLY true beliefs achieve the category of knowledge. In this sense, the question of being true or the problem of truth plays an intrinsic function in the technical aspect of philosophy mainly in the discipline of epistemology (the philosophical field that deals with the issue of knowledge). In the most fundamental formulation, knowledge is defined as true belief. To resolve whether a belief is true or not, it has to be initially articulated in a sensible statement and must finally pass the test of verification. (shrink)

Donald Davidson was one of the most influential philosophers of the last half of the 20th century, especially in the theory of meaning and in the philosophy of mind and action. In this paper, I concentrate on a field-shaping proposal of Davidson’s in the theory of meaning, arguably his most influential, namely, that insight into meaning may be best pursued by a bit of indirection, by showing how appropriate knowledge of a finitely axiomatized truth theory for a language can (...) put one in a position both to interpret the utterance of any sentence of the language and to see how its semantically primitive constituents together with their mode of combination determines its meaning (Davidson 1965, 1967, 1970, 1973a). This project has come to be known as truth-theoretic semantics. My aim in this paper is to render the best account I can of the goals and methods of truth-theoretic semantics, to defend it against some objections, and to identify its limitations. Although I believe that the project I describe conforms to the main idea that Davidson had, my aim is not primarily Davidson exegesis. I want to get on the table an approach to compositional semantics for natural languages, inspired by Davidson, but extended and developed, which I think does about as much along those lines as any theory could. I believe it is Davidson’s project, and I defend this in detail elsewhere (Ludwig 2015; Lepore and Ludwig 2005, 2007a, 2007b, 2011). But I want to develop and defend the project while also exploring its limitations, without getting entangled in exegetical questions. (shrink)

The subject of zombies is one of the most discussed and controversial topics of philosophy of mind. In this paper I will first examine the main argument of zombies, providing a summary of the current discussion. Then I will introduce a thought experiment, an epistemic window on a metaphysical scenario. By the thought experiment I will argue that zombies are logically impossible. Further I will discuss another recent epistemic window. Finally I will provide some other logical consideration to prove that (...) intentionality is not reducible to the cognitive functional aspects of the mind and that, moreover, the subjective recognition of semantic contents is necessary in order to consider as sensical the verbal behavior of a zombie. (shrink)

After presenting Kripke’s criticism to Frege’s ideas on context dependence of thoughts, I present two recent attempts of considering cognitive aspects of context dependent expressions inside a truth conditional pragmatics or semantics: Recanati’s non-descriptive modes of presentation (MOPs) and Kaplan’s ways of having in mind (WHIMs). After analysing the two attempts and verifying which answers they should give to the problem discussed by Kripke, I suggest a possible interpretation of these attempts: to insert a procedural or algorithmic level (...) in semantic representations of indexicals. That a function may be computed by different procedures might suggest new possibilities of integrating contextual cognitive aspects in model theoretic semantic. (shrink)

Benjamin Schnieder has argued that several traditional definitions of truth-functionality fail to capture a central intuition informal characterizations of the notion often capture. The intuition is that the truth-value of a sentence that employs a truth-functional operator depends upon the truth-values of the sentences upon which the operator operates. Schnieder proposes an alternative definition of truth-functionality that is designed to accommodate this intuition. We argue that one traditional definition of ‘truth-functionality’ is immune from (...) the counterexamples that Schnieder proposes and is preferable to Schnieder’s alternative. (shrink)

The paper examines some doctrines of the Davidsonian Programme of truth conditional Semantics that relates truth to meaning using Tarski’s T-Convention, in relation to its efficacy in a semantic valuation of the EkeGusii proverb: Nda ’indongi ereta morogi ereta moibi which exemplifies a kind of complex sentence that a given system of Semantics is meant to account for. The coverage of Davidsonian truth-conditional notion of T-convention and that of compositionality are considered to have only a (...) partial reach in accounting for the meaning of the proverb by not incorporating pragmatic aspects. The failure of T-convention is not alleviated by the adoption of radical interpretation as posited by Davidson but is extended to consider aspects of pragmatic enrichment and dynamic Semantics. (shrink)

This is a thesis in support of the conceptual yoking of analytic truth to a priori knowledge. My approach is a semantic one; the primary subject matter throughout the thesis is linguistic objects, such as propositions or sentences. I evaluate arguments, and also forward my own, about how such linguistic objects’ truth is determined, how their meaning is fixed and how we, respectively, know the conditions under which their truth and meaning are obtained. The strategy is to (...) make explicit what is distinctive about analytic truths. The objective is to show that truths, known a priori, are trivial in a highly circumscribed way. My arguments are premised on a language-relative account of analytic truth. The language relative account which underwrites much of what I do has two central tenets: 1. Conventionalism about truth and, 2. Non-factualism about meaning. I argue that one decisive way of establishing conventionalism and non-factualism is to prioritise epistemological questions. Once it is established that some truths are not known empirically an account of truth must follow which precludes factual truths being known non-empirically. The function of Part 1 is, chiefly, to render Carnap’s language-relative account of analytic truth. I do not offer arguments in support of Carnap at this stage, but throughout Parts 2 and 3, by looking at more current literature on a priori knowledge and analytic truth, it becomes quickly evident that I take Carnap to be correct, and why. In order to illustrate the extent to which Carnap’s account is conventionalist and non-factualist I pose his arguments against those of his predecessors, Kant and Frege. Part 1 is a lightly retrospective background to the concepts of ‘analytic’ and ‘a priori’. The strategy therein is more mercenary than exegetical: I select the parts from Kant and Frege most relevant to Carnap’s eventual reaction to them. Hereby I give the reasons why Carnap foregoes a factual and objective basis for logical truth. The upshot of this is an account of analytic truth (i.e. logical truth, to him) which ensures its trivial nature. In opposition to accounts of a priori knowledge, which describe it as knowledge gained from rational apprehension, I argue that it is either knowledge from logical deduction or knowledge of stipulations. I therefore reject, in Part 2, three epistemologies for knowing linguistic conventions (e.g. implicit definitions): 1. intuition, 2. inferential a priori knowledge and, 3. a posteriori knowledge. At base, all three epistemologies are rejected because they are incompatible with conventionalism and non-factualism. I argue this point by signalling that such accounts of knowledge yield unsubstantiated second-order claims and/or they render the relevant linguistic conventions epistemically arrogant. For a convention to be arrogant it must be stipulated to be true. The stipulation is then considered arrogant when its meaning cannot be fixed, and its truth cannot be determined without empirical ‘work’. Once a working explication of ‘a priori’ has been given, partially in Part 1 (as inferential) and then in Part 2 (as non-inferential) I look, in Part 3, at an apriorist account of analytic truth, which, I argue, renders analytic truth non-trivial. The particular subject matter here is the implicit definitions of logical terms. The opposition’s argument holds that logical truths are known a priori (this is part of their identification criteria) and that their meaning is factually based. From here it follows that analytic truth, being determined by factually based meaning, is also factual. I oppose these arguments by exposing the internal inconsistencies; that implicit definition is premised on the arbitrary stipulation of truth which is inconsistent with saying that there are facts which determine the same truth. In doing so, I endorse the standard irrealist position about implicit definition and analytic truth (along with the “early friends of implicit definition” such as Wittgenstein and Carnap). What is it that I am trying to get at by doing all of the abovementioned? Here is a very abstracted explanation. The unmitigated realism of the rationalists of old, e.g. Plato, Descartes, Kant, have stoically borne the brunt of the allegation of yielding ‘synthetic a priori’ claims. The anti-rationalist phase of this accusation I am most interested in is that forwarded by the semantically driven empiricism of the early 20th century. It is here that the charge of the ‘synthetic a priori’ really takes hold. Since then new methods and accusatory terms are employed by, chiefly, non-realist positions. I plan to give these proper attention in due course. However, it seems to me that the reframing of the debate in these new terms has also created the illusion that current philosophical realism, whether naturalistic realism, realism in science, realism in logic and mathematics, is somehow not guilty of the same epistemological and semantic charges levelled against Plato, Descartes and Kant. It is of interest to me that in, particularly, current analytic philosophy (given its rationale) realism in many areas seems to escape the accusation of yielding synthetic priori claims. Yet yielding synthetic a priori claims is something which realism so easily falls prey to. Perhaps this is a function of the fact that the phrase, ‘synthetic a priori’, used as an allegation, is now outmoded. This thesis is nothing other than an indictment of metaphysics, or speculative philosophy (this being the crime), brought against a specific selection of realist arguments. I, therefore, ask of my reader to see my explicit, and perhaps outmoded, charge of the ‘synthetic a priori’ levelled against respective theorists as an attempt to draw a direct comparison with the speculative metaphysics so many analytic philosophers now love to hate. I think the phrase ‘synthetic a priori’ still does a lot of work in this regard, precisely because so many current theorists wrongly think they are immune to this charge. Consequently, I shall say much about what is not permitted. Such is, I suppose, the nature of arguing ‘against’ something. I’ll argue that it is not permitted to be a factualist about logical principles and say that they are known a priori. I’ll argue that it is not permitted to say linguistic conventions are a posteriori, when there is a complete failure in locating such a posteriori conventions. Both such philosophical claims are candidates for the synthetic a priori, for unmitigated rationalism. But on the positive side, we now have these two assets: Firstly, I do not ask us to abandon any of the linguistic practises discussed; merely to adopt the correct attitude towards them. For instance, where we use the laws of logic, let us remember that there are no known/knowable facts about logic. These laws are therefore, to the best of our knowledge, conventions not dissimilar to the rules of a game. And, secondly, once we pass sentence on knowing, a priori, anything but trivial truths we shall have at our disposal the sharpest of philosophical tools. A tool which can only proffer a better brand of empiricism. (shrink)

In this paper I try to show that semantics can explain word-to-world relations and that sentences can have meanings that determine truth-conditions. Critics like Chomsky typically maintain that only speakers denote, i.e., only speakers, by using words in one way or another, represent entities or events in the world. However, according to their view, individual acts of denotations are not explained just by virtue of speakers’ semantic knowledge. Against this view, I will hold that, in the typical cases (...) considered, semantic knowledge can account for the denotational uses of words of individual speakers. (shrink)

The paper presents a truth-maker semantics for Strict/Tolerant Logic (ST), which is the currently most popular logic among advocates of the non-transitive approach to paradoxes. Besides being interesting in itself, the truth-maker presentation of ST offers a new perspective on the recently discovered hierarchy of meta-inferences that, according to some, generalizes the idea behind ST. While fascinating from a mathematical perspective, there is no agreement on the philosophical significance of this hierarchy. I aim to show that there (...) is no clear philosophical significance of meta-inferences above the first level. (shrink)

CAT4 is proposed as a general method for representing information, enabling a powerful programming method for large-scale information systems. It enables generalised machine learning, software automation and novel AI capabilities. This is Part 3 of a five-part introduction. The focus here is on explaining the semantic model for CAT4. Points in CAT4 graphs represent facts. We introduce all the formal (data) elements used in the classic semantic model: sense or intension (1st and 2nd joins), reference (3rd join), functions (4th join), (...) time and truth (logical fields), and symbolic content (name/value fields). Concepts are introduced through examples alternating with theoretical discussion. Some concepts are assumed from Part 1 and 2, but key ideas are re-introduced. The purpose is to explain the CAT4 interpretation, and why the data structure and CAT4 axioms have been chosen: to make the semantic model consistent and complete. We start with methods to translate information from database tables into graph DBs and into CAT4. We conclude with a method for translating natural language into CAT4. We conclude with a comparison of the system with an advanced semantic logic, the hyper-intensional logic TIL, which also aims to translate NL into a logical calculus. The CAT4 Natural Language Translator is discussed in further detail in Part 4, when we introduce functions more formally. Part 5 discusses software design considerations. (shrink)

The truth-functional hypothesis states that indicative conditional sentences and the material implication have the same truth conditions. Haze (2011) has rejected this hypothesis. He claims that a self-referential conditional, coupled with a plausible assumption about its truth-values and the assumption that the truth-functional hypothesis is true, lead to a liar’s paradox. Given that neither the self-referential conditional nor the assumption about its truth-values are problematic, the culprit of the paradox must be the (...) class='Hi'>truth-functional hypothesis. Therefore, we should reject it. In this paper I argue that, contrary to what Haze thinks, the truth-functional hypothesis is not to blame. In fact, no liar’s paradox emerges when the truth-functional hypothesis is true; it emerges only if it is false. (shrink)

Deflationism about truth is often said to be incompatible with truth-theoretic semantics. However, both of these labels are ambiguous, making the truth of the incompatibility claim dependent on interpretation. I provide one pair of natural interpretations, on which both views relate essentially to grounding and on which they are indeed incompatible. This result has some intrinsic interest as well as paving the way for further needed clarifications in the debate about the relationship between the views.

The material interpretation of conditionals is commonly recognized as involving some paradoxical results. I here argue that the truth functional approach to natural language is the reason for the inadequacy of this material interpretation, since the truth or falsity of some pair of statements ‘p’ and ‘q’ cannot per se be decisive for the truth or falsity of a conditional relation ‘if p then q’. This inadequacy also affects the ability of the overall formal system to (...) establish whether or not arguments involving conditionals are valid. I also demonstrate that the Paradox of Indicative Conditionals does not actually involve a paradox, but instead contains some paralogistic elements that make it appear to be a paradox. The discussion of the paradox in this paper further reveals that the material interpretation of conditionals adversely affects the treatment of disjunctions. -/- Much has been said about these matters in the literature that point in the same direction. However, there seems to be some reluctance against fully complying with the arguments against the truth functional account of conditionals, since many of the alternative accounts rely on the material conditional, or at least on an understanding of the conditional as a function of antecedent and consequent in a similar sense as the material conditional. My argument against truth functionality indicates that it may in general involve similar problems to treat conditionals as such functions, whether one deals with theories of truth, assertability or probability. (shrink)

The purpose of this paper is to assess the general viability of Donald Davidson's paratactic theory of indirect discourse, as well as the specific plausibility of a reincarnated form of the Davidsonian paratactic theory, Gary Kemp's propositional paratactic theory. To this end I will provide an introduction to the Davidsonian paratactic theory and the theory's putative strengths, thereafter noting that an argument from ambiguity seems to effectively undermine Davidson's proposal. Subsequently, I will argue that Kemp's modification of Davidson's theory – (...) that is, Kemp's attempt to respond to the ambiguity objection – adequately handles the classic argument from ambiguity but fails in the face of a new problem of ambiguity that I will introduce. Finally, I will argue that there are more devastating and basic problems for the paratactic theory generally, and that even if Kemp's modifications had succeeded, they would not have given adequate plausibility to the paratactic proposal. (shrink)

In my article, I present a new version of a probabilistic truth prescribing semantics for natural language indicative conditionals. The proposed truth conditions can be paraphrased as follows: an indicative conditional is true if the corresponding conditional probability is high and the antecedent is positively probabilistically relevant for the consequent or the probability of the antecedent of the conditional equals 0. In the paper, the truth conditions are defended and some of the logical properties of the (...) proposed semantics are described. (shrink)

I discuss Frege's argument - later called the slingshot - that if a construction is extensional and preserves logical equivalence then it is truth-functional. I consider some simple apparent counterexamples and conclude that they are not sentence-embedding in the required way.

Semantic information is usually supposed to satisfy the veridicality thesis: p qualifies as semantic information only if p is true. However, what it means for semantic information to be true is often left implicit, with correspondentist interpretations representing the most popular, default option. The article develops an alternative approach, namely a correctness theory of truth (CTT) for semantic information. This is meant as a contribution not only to the philosophy of information but also to the philosophical debate on the (...) nature of truth. After the introduction, in Sect. 2, semantic information is shown to be translatable into propositional semantic information (i). In Sect. 3, i is polarised into a query (Q) and a result (R), qualified by a specific context, a level of abstraction and a purpose. This polarization is normalised in Sect. 4, where [Q + R] is transformed into a Boolean question and its relative yes/no answer [Q + A]. This completes the reduction of the truth of i to the correctness of A. In Sects. 5 and 6, it is argued that (1) A is the correct answer to Q if and only if (2) A correctly saturates Q by verifying and validating it (in the computer science’s sense of “verification” and “validation”); that (2) is the case if and only if (3) [Q + A] generates an adequate model (m) of the relevant system (s) identified by Q; that (3) is the case if and only if (4) m is a proxy of s (in the computer science’s sense of “proxy”) and (5) proximal access to m commutes with the distal access to s (in the category theory’s sense of “commutation”); and that (5) is the case if and only if (6) reading/writing (accessing, in the computer science’s technical sense of the term) m enables one to read/write (access) s. Sect. 7 provides some further clarifications about CTT, in the light of semantic paradoxes. Section 8 draws a general conclusion about the nature of CTT as a theory for systems designers not just systems users. In the course of the article all technical expressions from computer science are explained. (shrink)

This paper deals with a collection of concerns that, over a period of time, led the author away from the Routley–Meyer semantics, and towards proof- theoretic approaches to relevant logics, and indeed to the weak relevant logic MC of meaning containment.

The paper presents Alfred Tarski’s debate with the semantic antinomies: the basic Liar Paradox, and its more sophisticated versions, which are currently discussed in philosophy: Strengthen Liar Paradox, Cyclical Liar Paradox, Contingent Liar Paradox, Correct Liar Paradox, Card Paradox, Yablo’s Paradox and a few others. Since Tarski, himself did not addressed these paradoxes—neither in his famous work published in 1933, nor in later papers in which he developed the Semantic Theory of Truth—therefore, We try to defend his concept of (...) truth against these antinomies. It is demonstrated that Tarskian theory of truth is resistant to the paradoxes and it is still the best solution to avoid the antinomies and remain within a classical logic, that is, accepting the laws of noncontradiction, excluded middle, and the principle of bivalence. Thus, the goal of the paper is double—firstly, to show that none of the versions of the Liar Paradox’s is a serious threat to Tarski’s concept of truth, and secondly, that Semantic Theory of Truth allows to remain within classical logic, and at the same time, avoid antinomies—which makes it the most attractive among classical theories of truth. (shrink)

Methods available for the axiomatization of arbitrary finite-valued logics can be applied to obtain sound and complete intelim rules for all truth-functional connectives of classical logic including the Sheffer stroke and Peirce’s arrow. The restriction to a single conclusion in standard systems of natural deduction requires the introduction of additional rules to make the resulting systems complete; these rules are nevertheless still simple and correspond straightforwardly to the classical absurdity rule. Omitting these rules results in systems for intuitionistic (...) versions of the connectives in question. (shrink)

Quine argues that if sentences that are set theoretically equivalent are interchangeable salva veritate, then all transparent operators are truth-functional. Criticisms of this argument fail to take into account the conditional character of the conclusion. Quine also argues that, for any person P with minimal logical acuity, if ‘belief’ has a sense in which it is a transparent operator, then, in that sense of the word, P believes everything if P believes anything. The suggestion is made that he (...) intends that result to show us that ‘believes’ has no transparent sense. Criticisms of this argument are either based on unwarranted assertions or on definitions of key terms that depart from Quine’s usage of those terms. (shrink)

Traditional inflationary approaches that specify the nature of truth are attractive in certain ways; yet, while many of these theories successfully explain why propositions in certain domains of discourse are true, they fail to adequately specify the nature of truth because they run up against counterexamples when attempting to generalize across all domains. One popular consequence is skepticism about the efficaciousness of inflationary approaches altogether. Yet, by recognizing that the failure to explain the truth of disparate propositions (...) often stems from inflationary approaches' allegiance to alethic monism, pluralist approaches are able to avoid this explanatory inadequacy and the resulting skepticism, though at the cost of inviting other conceptual difficulties. A novel approach, alethic functionalism, attempts to circumvent the problems faced by pluralist approaches while preserving their main insights. Unfortunately, it too generates additional problems---namely, with its suspect appropriation of the multiple realizability paradigm and its platitude-based strategy---that need to be dissolved before it can constitute an adequate inflationary approach to the nature of truth. (shrink)

This paper examines to what extent Davidsonian truth-theoretic semantics can give an adequate account for empty names in natural languages. It argues that the prospect is dim because of a tension between metaphysical austerity, non-vacuousness of theorems and empirical adequacy. Sainsbury (2005) proposed a Davidsonian account of empty names called ‘Reference Without Referents’ (RWR), which explicates reference in terms of reference-condition rather than referent, thus avoiding the issue of existence. This is an inspiring account. However, it meets several (...) difficulties. First, there is no non-vacuous, interpretive truth-condition available for any T-sentence containing an empty name, because by stipulation there is no way to compose a true atomic sentence using an empty name in RWR. The absence of an interpretive truth-condition implies the absence of an interpretive reference-condition. It also entails empirical inadequacy to support an interpretation because the related propositional attitude can never be truly satisfied. These considerations cast doubt on whether truth is the proper vehicle to articulate meaning. This paper suggests that we can alleviating the problem by employing truth-conditions varying across contexts of utterance, rather than just contexts of evaluation. The result is a two-dimensional model-theoretic approach to empty names. It involves a new function coined counterfactual reference and the account is compatible with both descriptivism and Millianism. (shrink)

When do two sentences say the same thing, that is, express the same content? We defend two-component (2C) semantics: the view that propositional contents comprise (at least) two irreducibly distinct constituents, (1) truth-conditions, and (2) subject-matter. We contrast 2C with one-component (1C) semantics, focusing on the view that subject-matter is reducible to truth- conditions. We identify exponents of this view and argue in favor of 2C. An appendix proposes a general formal template for propositional 2C (...) class='Hi'>semantics. (shrink)

Semantic information is usually supposed to satisfy the veridicality thesis: p qualifies as semantic information only if p is true. However, what it means for semantic information to be true is often left implicit, with correspondentist interpretations representing the most popular, default option. The article develops an alternative approach, namely a correctness theory of truth (CTT) for semantic information. This is meant as a contribution not only to the philosophy of information but also to the philosophical debate on the (...) nature of truth. After the introduction, in Sect. 2, semantic information is shown to be translatable into propositional semantic information (i). In Sect. 3, i is polarised into a query (Q) and a result (R), qualified by a specific context, a level of abstraction and a purpose. This polarization is normalised in Sect. 4, where [Q + R] is transformed into a Boolean question and its relative yes/no answer [Q + A]. This completes the reduction of the truth of i to the correctness of A. In Sects. 5 and 6, it is argued that (1) A is the correct answer to Q if and only if (2) A correctly saturates Q by verifying and validating it (in the computer science’s sense of verification and validation ); that (2) is the case if and only if (3) [Q + A] generates an adequate model (m) of the relevant system (s) identified by Q; that (3) is the case if and only if (4) m is a proxy of s (in the computer science’s sense of proxy ) and (5) proximal access to m commutes with the distal access to s (in the category theory’s sense of commutation ); and that (5) is the case if and only if (6) reading/writing (accessing, in the computer science’s technical sense of the term) m enables one to read/write (access) s. Sect. 7 provides some further clarifications about CTT, in the light of semantic paradoxes. Section 8 draws a general conclusion about the nature of CTT as a theory for systems designers not just systems users. In the course of the article all technical expressions from computer science are explained. (shrink)