This paper introduces the logic _Q__L__E__T_ _F_, a quantified extension of the logic of evidence and truth _L__E__T_ _F_, together with a corresponding sound and complete first-order non-deterministic valuation semantics. _L__E__T_ _F_ is a paraconsistent and paracomplete sentential logic that extends the logic of first-degree entailment (_FDE_) with a classicality operator ∘ and a non-classicality operator ∙, dual to each other: while ∘_A_ entails that _A_ behaves classically, ∙_A_ follows from _A_’s violating some classically valid inferences. The (...) class='Hi'>semantics of _Q__L__E__T_ _F_ combines structures that interpret negated predicates in terms of anti-extensions with first-order non-deterministic valuations, and completeness is obtained through a generalization of Henkin’s method. By providing sound and complete semantics for first-order extensions of _FDE_, _K3_, and _LP_, we show how these tools, which we call here the method of _anti-extensions + valuations_, can be naturally applied to a number of non-classical logics. (shrink)

We introduce a two-valued and a three-valued truth-valuational substitutional semantics for the Quantified Argument Calculus (Quarc). We then prove that the 2-valid arguments are identical to the 3-valid ones with strict-to-tolerant validity. Next, we introduce a Lemmon-style Natural Deduction system and prove the completeness of Quarc on both two- and three-valued versions, adapting Lindenbaum’s Lemma to truth-valuational semantics. We proceed to investigate the relations of three-valued Quarc and the Predicate Calculus (PC). Adding a logical (...) predicate T to Quarc, true of all singular arguments, allows us to represent PC quantification in Quarc and translate PC into Quarc, preserving validity. Introducing a weak existential quantifier into PC allows us to translate Quarc into PC, also preserving validity. However, unlike the translated systems, neither extended system can have a sound and complete proof system with Cut, supporting the claim that these are basically different calculi. (shrink)

I explain why model theory is unsatisfactory as a semantic theory and has drawbacks as a tool for proofs on logic systems. I then motivate and develop an alternative, the truth-valuational substitutional approach (TVS), and prove with it the soundness and completeness of the first order Predicate Calculus with identity and of Modal Propositional Calculus. Modal logic is developed without recourse to possible worlds. Along the way I answer a variety of difficulties that have been raised against TVS (...) and show that, as applied to several central questions, model-theoretic semantics can be considered TVS in disguise. The conclusion is that the truth-valuational substitutional approach is an adequate tool for many of our logic inquiries, conceptually preferable over model-theoretic semantics. Another conclusion is that formal logic is independent of semantics, apart from its use of the notion of truth, but that even with respect to it its assumptions are minimal. (shrink)

The Quantified Argument Calculus (Quarc) is a formal logic system, first developed by Hanoch Ben-Yami in (Ben-Yami 2014), and since then extended and applied by several authors. The aim of this paper is to further these contributions by, first, providing a philosophical motivation for the truth-valuational, substitutional approach of (Ben-Yami 2014) and defending it against a common objection, a topic also of interest beyond its specific application to Quarc. Second, we fill the formal lacunae left in the original (...) presentation, which did not incorporate identity systematically into Quarc, and although it proved the soundness of the system did not prove its completeness. (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)

A semantics of vagueness should reject the principle that every statement has a truth-value yet retain the classical tautologies. A many-value, non-truth-functional semantics and a semantics of super-valuations each have this result. According to the super-valuation approach, 'if a man with n hairs on his head is bald, then a man with n plus one hairs on his head is also bald' is false because it comes out false no matter how the vague predicate 'is (...) bald' is appropriately made precise. But why should a sentence in which components actually remain imprecise be regarded as actually false just because it would be false if its components were precise? On one of the alternative treatments of quantification allowed by the many-value approach, the sentence in question is assigned an intermediate value closer to 'false' than to 'true'. Despite the elegance of the super-valuation approach, there are reasons to prefer the many-value approach. (shrink)

The thesis deals with the concept of truth and the paradoxes of truth. Philosophical theories usually consider the concept of truth from a wider perspective. They are concerned with questions such as - Is there any connection between the truth and the world? And, if there is - What is the nature of the connection? Contrary to these theories, this analysis is of a logical nature. It deals with the internal semantic structure of language, the mutual (...) semantic connection of sentences, above all the connection of sentences that speak about the truth of other sentences and sentences whose truth they speak about. Truth paradoxes show that there is a problem in our basic understanding of the language meaning and they are a test for any proposed solution. It is important to make a distinction between the normative and analytical aspect of the solution. The former tries to ensure that paradoxes will not emerge. The latter tries to explain paradoxes. Of course, the practical aspect of the solution is also important. It tries to ensure a good framework for logical foundations of knowledge, for related problems in Artificial Intelligence and for the analysis of the natural language. Tarski’s analysis emphasized the T-scheme as the basic intuitive principle for the concept of truth, but it also showed its inconsistency with the classical logic. Tarski’s solution is to preserve the classical logic and to restrict the scheme: we can talk about the truth of sentences of a language only inside another essentially richer metalanguage. This solution is in harmony with the idea of reflexivity of thinking and it has become very fertile for mathematics and science in general. But it has normative nature | truth paradoxes are avoided in a way that in such frame we cannot even express paradoxical sentences. It is also too restrictive because, for the same reason we cannot express a situation in which there is a circular reference of some sentences to other sentences, no matter how common and harmless such a situation may be. Kripke showed that there is no natural restriction to the T-scheme and we have to accept it. But then we must also accept the riskiness of sentences | the possibility that under some circumstances a sentence does not have the classical truth value but it is undetermined. This leads to languages with three-valued semantics. Kripke did not give any definite model, but he gave a theoretical frame for investigations of various models | each fixed point in each three-valued semantics can be a model for the concept of truth. The solutions also have normative nature | we can express the paradoxical sentences, but we escape a contradiction by declaring them undetermined. Such a solution could become an analytical solution only if we provide the analysis that would show in a substantial way that it is the solution that models the concept of truth. Kripke took some steps in the direction of finding an analytical solution. He preferred the strong Kleene three-valued semantics for which he wrote it was "appropriate" but did not explain why it was appropriate. One reason for such a choice is probably that Kripke finds paradoxical sentences meaningful. This eliminates the weak Kleene three valued semantics which corresponds to the idea that paradoxical sentences are meaningless, and thus indeterminate. Another reason could be that the strong Kleene three valued semantics has the so-called investigative interpretation. According to this interpretation, this semantics corresponds to the classical determination of truth, whereby all sentences that do not have an already determined value are temporarily considered indeterminate. When we determine the truth value of these sentences, then we can also determine the truth value of the sentences that are composed of them. Kripke supplemented this investigative interpretation with an intuition about learning the concept of truth. That intuition deals with how we can teach someone who is a competent user of an initial language (without the predicate of truth T) to use sentences that contain the predicate T. That person knows which sentences of the initial language are true and which are not. We give her the rule to assign the T attribute to the former and deny that attribute to the latter. In that way, some new sentences that contain the predicate of truth, and which were indeterminate until then, become determinate. So the person gets a new set of true and false sentences with which he continues the procedure. This intuition leads directly to the smallest fixed point of strong Kleene semantics as an analytically acceptable model for the logical notion of truth. However, since this process is usually saturated only on some transfinite ordinal, this intuition, by climbing on ordinals, increasingly becomes a metaphor. This thesis is an attempt to give an analytical solution to truth paradoxes. It gives an analysis of why and how some sentences lack the classical truth value. The starting point is basic intuition according to which paradoxical sentences are meaningful (because we understand what they are talking about well, moreover we use it for determining their truth values), but they witness the failure of the classical procedure of determining their truth value in some "extreme" circumstances. Paradoxes emerge because the classical procedure of the truth value determination does not always give a classically supposed (and expected) answer. The analysis shows that such an assumption is an unjustified generalization from common situations to all situations. We can accept the classical procedure of the truth value determination and consequently the internal semantic structure of the language, but we must reject the universality of the exterior assumption of a successful ending of the procedure. The consciousness of this transforms paradoxes to normal situations inherent to the classical procedure. Some sentences, although meaningful, when we evaluate them according to the classical truth conditions, the classical conditions do not assign them a unique value. We can assign to them the third value, \undetermined", as a sign of definitive failure of the classical procedure. An analysis of the propagation of the failure in the structure of sentences gives exactly the strong Kleene three-valued semantics, not as an investigative procedure, as it occurs in Kripke, but as the classical truth determination procedure accompanied by the propagation of its own failure. An analysis of the circularities in the determination of the classical truth value gives the criterion of when the classical procedure succeeds and when it fails, when the sentences will have the classical truth value and when they will not. It turns out that the truth values of sentences thus obtained give exactly the largest intrinsic fixed point of the strong Kleene three-valued semantics. In that way, the argumentation is given for that choice among all fixed points of all monotone three-valued semantics for the model of the logical concept of truth. An immediate mathematical description of the fixed point is given, too. It has also been shown how this language can be semantically completed to the classical language which in many respects appears a natural completion of the process of thinking about the truth values of the sentences of a given language. Thus the final model is a language that has one interpretation and two systems of sentence truth evaluation, primary and final evaluation. The language through the symbol T speaks of its primary truth valuation, which is precisely the largest intrinsic fixed point of the strong Kleene three valued semantics. Its final truth valuation is the semantic completion of the first in such a way that all sentences that are not true in the primary valuation are false in the final valuation. (shrink)

There is no consensus as to whether a Liar sentence is meaningful or not. Still, a widespread conviction with respect to Liar sentences (and other ungrounded sentences) is that, whether or not they are meaningful, they are useless . The philosophical contribution of this paper is to put this conviction into question. Using the framework of assertoric semantics , which is a semantic valuation method for languages of self-referential truth that has been developed by the author, we show (...) that certain computational problems, called query structures , can be solved more efficiently by an agent who has self-referential resources (amongst which are Liar sentences) than by an agent who has only classical resources; we establish the computational power of self-referential truth . The paper concludes with some thoughts on the implications of the established result for deflationary accounts of truth. (shrink)

The final portion of the thesis surveys proposals for the introduction of hidden variables into quantum mechanics, proofs of the impossibility of such hidden-variable proposals, and criticisms of these impossibility proofs. And arguments in favour of the partial-Boolean algebra, rather than the orthomodular lattice, formalization of the quantum propositional structures are reviewed. ;As for , each quantum state-induced expectation-function on a P truth-functionally assigns 1 and 0 values to the elements in a ultrafilter and dual ultraideal of P, where (...) in general the union of an ultrafilter and its dual ultraideal is smaller than the entire structure. Thus it is argued that each expectation-function is the quantum analog of a classical semantic mapping, even though the domain where each expectation-function is bivalent and truth-functional is usually a non-Boolean substructure of P. ;In classical propositional logic, propositions form a Boolean algebra, and each semantic mapping assigns the value 1 to the members of a certain subset of the algebra, namely, an ultrafilter, and assigns 0 to the members of the dual ultraideal, where the union of these two subsets is the entire algebra. The propositional structures of classical mechanics are likewise Boolean algebras, so one can straightforwardly provide a classical semantics, which also satisfies . However, quantum propositional structures are non-Boolean, so it is an open question whether a semantics satisfying , and can be provided. ;Von Neumann first proposed that the algebraic structures of the subspaces of Hilbert space be regarded as the propositional structures P of quantum mechanics. These structures have been formalized in two ways: as orthomodular lattices which have the binary operations "and", "or", defined among all elements, compatible and incompatible ; and as partial-Boolean algebras which have the binary operations defined among only compatible elements. In the thesis, two basic senses in which these structures are non-Boolean are discriminated. And two notions of truth-functionality are distinguished: truth-functionality ,) applicable to the Plattices; and truth-functionality ) applicable to both the Plattices and partial-Boolean algebras. Then it is shown how the lattice definitions of "and", "or", among incompatibles rule out a bivalent, truth-functional ,) semantics for any PQM lattice containing incompatible elements. In contrast, the Gleason and Kochen-Specker proofs of the impossibility of hidden-variables for quantum mechanics show the impossibility of a bivalent, truth-functional ) semantics for three-or-higher dimensional Hilbert space PQM structures; and the presence of incompatible elements is necessary but is not sufficient to rule out such a semantics. ;The thesis investigates the possibility of a classical semantics for quantum propositional structures. A classical semantics is defined as a set of mappings each of which is bivalent, i.e., the value 1 or 0 is assigned to each proposition, and truth-functional, i.e., the logical operations are preserved. In addition, this set must be "full", i.e., any pair of distinct propositions is assigned different values by some mapping in the set. When the propositions make assertions about the properties of classical or of quantum systems, the mappings should also be "state-induced", i.e., values assigned by the semantics should accord with values assigned by classical or by quantum mechanics. (shrink)

The category-theoretic representation of quantum event structures provides a canonical setting for confronting the fundamental problem of truth valuation in quantum mechanics as exemplified, in particular, by Kochen–Specker’s theorem. In the present study, this is realized on the basis of the existence of a categorical adjunction between the category of sheaves of variable local Boolean frames, constituting a topos, and the category of quantum event algebras. We show explicitly that the latter category is equipped with an object of (...) class='Hi'>truth values, or classifying object, which constitutes the appropriate tool for assigning truth values to propositions describing the behavior of quantum systems. Effectively, this category-theoretic representation scheme circumvents consistently the semantic ambiguity with respect to truth valuation that is inherent in conventional quantum mechanics by inducing an objective contextual account of truth in the quantum domain of discourse. The philosophical implications of the resulting account are analyzed. We argue that it subscribes neither to a pragmatic instrumental nor to a relative notion of truth. Such an account essentially denies that there can be a universal context of reference or an Archimedean standpoint from which to evaluate logically the totality of facts of nature. (shrink)

In this paper I criticize a version of supervaluation semantics. This version is called "Region-Valuation" semantics. It's developed by Pablo Cobreros. I argue that all supervaluationists, regionalists in particular, and truth-value gap theorists of vagueness more generally, are commited to the validity of D-intro, the principle that every sentence entails its definitization (the truth of "Paul is tall" guarantees the truth of "Paul is definitely tall"). The principle embroils one in a paradox that's distinct from, (...) but related to, the sorites paradox. I call it the "gap-principles paradox". -/- . (shrink)

The semantics underlying the propositional structure of Hilbert space quantum mechanics involves an inherent ambiguity concerning the impossibility of assigning definite truth values to all propositions pertaining to a quantum system without generating a Kochen-Specker contradiction. Although the preceding Kochen-Specker result forbids a global, absolute assignment of truth values to quantum mechanical propositions, it does not exclude ones that are contextual. In this respect, the Bub-Clifton “uniqueness theorem” is utilized for arguing that truth-value definiteness is consistently (...) restored with respect to a determinate sublattice of propositions defined by the state of the quantum system concerned and a suitable “preferred” observable. It is suggested that the most natural choice of the latter, especially for confronting the problem of truth valuation in quantum mechanics, results in the determinateness of the observable to be measured. An account of truth of contextual correspondence is thereby provided that is appropriate to the quantum domain of discourse. The resulting account of truth is compatible with a realist conception of truth. Such an account essentially denies that there can be a universal context of reference or an Archimedean standpoint from which to evaluate logically the totality of facts of nature. (shrink)

A bivalent valuation is snt iff sound (standard PC inference rules take truths only into truths) and non-trivial (not all wffs are assigned the same truth value). Such a valuation is normal iff classically correct for each connective. Carnap knew that there were non-normal snt valuations of PC, and that the gap they revealed between syntax and semantics could be "jumped" as follows. Let $VAL_{snt}$ be the set of snt valuations, and $VAL_{nrm}$ be the set of normal ones. (...) The bottom row in the table for the wedge 'v' is not semantically determined by $VAL_{snt}$ , but if one deletes from $VAL_{snt}$ all those valuations that are not classically correct at the aforementioned row, one jumps straights to $VAL_{nrm}$ and thus to classical semantics. The conjecture we call semantic holism claims that the same thing happens for any semantic indeterminacy in any row in the table of any connective of PC, i.e., to remove it is to jump straight to classical semantics. We show (i) why semantic holism is plausible and (ii) why it is nevertheless false. And (iii) we pose a series of questions concerning the number of possible steps or jumps between the indeterminate semantics given by $VAL_{snt}$ and classical semantics given by $VAL_{nrm}$. (shrink)

Interpretation is the process whereby a hearer reasons to an interpretation of a speaker's discourse. The hearer normally adopts a credulous attitude to the discourse, at least for the purposes of interpreting it. That is to say the hearer tries to accommodate the truth of all the speaker's utterances in deriving an intended model. We present a nonmonotonic logical model of this process which defines unique minimal preferred models and efficiently simulates a kind of closed-world reasoning of particular interest (...) for human cognition. Byrne's “suppression” data (Byrne, 1989) are used to illustrate how variants on this logic can capture and motivate subtly different interpretative stances which different subjects adopt, thus indicating where more fine-grained empirical data are required to understand what subjects are doing in this task. We then show that this logical competence model can be implemented in spreading activation network models. A one pass process interprets the textual input by constructing a network which then computes minimal preferred models for (3-valued) valuations of the set of propositions of the text. The neural implementation distinguishes easy forward reasoning from more complex backward reasoning in a way that may be useful in explaining directionality in human reasoning. (shrink)

Dynamic Topological Logic () is a combination of , under its topological interpretation, and the temporal logic interpreted over the natural numbers. is used to reason about properties of dynamical systems based on topological spaces. Semantics are given by dynamic topological models, which are tuples , where is a topological space, f a function on X and V a truth valuation assigning subsets of X to propositional variables. Our main result is that the set of valid formulas of (...) over spaces with continuous functions is recursively enumerable. We show this by defining alternative semantics for . Under standard semantics, is not complete for Kripke frames. However, we introduce the notion of a non-deterministic quasimodel, where the function f is replaced by a binary relation g assigning to each world multiple temporal successors. We place restrictions on the successors so that the logic remains unchanged; under these alternative semantics, becomes Kripke-complete. We then apply model-search techniques to enumerate the set of all valid formulas. (shrink)

Interpretation is the process whereby a hearer reasons to an interpretation of a speaker's discourse. The hearer normally adopts a credulous attitude to the discourse, at least for the purposes of interpreting it. That is to say the hearer tries to accommodate the truth of all the speaker's utterances in deriving an intended model. We present a nonmonotonic logical model of this process which defines unique minimal preferred models and efficiently simulates a kind of closed-world reasoning of particular interest (...) for human cognition. Byrne's “suppression” data (Byrne, 1989) are used to illustrate how variants on this logic can capture and motivate subtly different interpretative stances which different subjects adopt, thus indicating where more fine-grained empirical data are required to understand what subjects are doing in this task. We then show that this logical competence model can be implemented in spreading activation network models. A one pass process interprets the textual input by constructing a network which then computes minimal preferred models for (3-valued) valuations of the set of propositions of the text. The neural implementation distinguishes easy forward reasoning from more complex backward reasoning in a way that may be useful in explaining directionality in human reasoning. (shrink)

Developing a suggestion of Wittgenstein, I provide an account of truth tables as formulas of a formal language. I define the syntax and semantics of TPL (the language of Tabular Propositional Logic), and develop its proof theory. Single formulas of TPL, and finite groups of formulas with the same top row and TF matrix (depiction of possible valuations), are able to serve as their own proofs with respect to metalogical properties of interest. The situation is different, however, for (...) groups of formulas whose top rows differ. For them I provide (i) a tree-style system of ‘row tree proofs’, which is shown to be sound and complete, and (ii) an alternative, re-writing strategy. (shrink)

This expository paper presents an application, to the modal logic S4, of the valuation semantics technique proposed by Loparić for the basic normal modal logic K. In previous works we presented a valuation semantics for the minimal temporal logic Kt and several other systems modal and temporal logic. How to deal with S4, however, was left as an open problem—although we arrived at a working definition of \(A_1,\ldots,A_n\) -valuations, we were not able to prove an important lemma for (...) correctness. In this paper we solve this, presenting valuations for S4. (shrink)

What is the fundamental insight behind truth-functionality ? When is a logic interpretable by way of a truth-functional semantics? To address such questions in a satisfactory way, a formal definition of truth-functionality from the point of view of abstract logics is clearly called for. As a matter of fact, such a definition has been available at least since the 70s, though to this day it still remains not very widely well-known. A clear distinction can be drawn (...) between logics characterizable through: (1) genuinely finite-valued truth-tabular semantics; (2) no finite-valued but only an infinite-valued truthtabular semantics; (3) no truth-tabular semantics at all. Any of those logics, however, can in principle be characterized through non-truth-functional valuation semantics, at least as soon as their associated consequence relations respect the usual tarskian postulates. So, paradoxical as that might seem at first, it turns out that truth-functional logics may be adequately characterized by non-truth-functional semantics . Now, what feature of a given logic would guarantee it to dwell in class (1) or in class (2), irrespective of its circumstantial semantic characterization? (shrink)

Fibring has been shown to be useful for combining logics endowed withtruth-functional semantics. However, the techniques used so far are unableto cope with fibring of logics endowed with non-truth-functional semanticsas, for example, paraconsistent logics. The first main contribution of thepaper is the development of a suitable abstract notion of logic, that mayalso encompass systems with non-truth-functional connectives, and wherefibring can still be dealt with. Furthermore, it is shown that thisextended notion of fibring preserves completeness under certain reasonableconditions. (...) This completeness transfer result, the second main contributionof the paper, generalizes the one established in Zanardo et al. (2001) butis obtained using new techniques that explore the properties of a suitablemeta-logic (conditional equational logic) where the (possibly)non-truth-functional valuations are specified. The modal paraconsistentlogic of da Costa and Carnielli (1988) is studied in the context of this novel notionof fibring and its completeness is so established. (shrink)

Trying to overcome Dugundji’s result on uncharacterisability of modal logics by finite logical matrices, Kearns and Ivlev proposed, independently, a characterisation of some modal systems by means of four-valued multivalued truth-functions , as an alternative to Kripke semantics. This constitutes an antecedent of the non-deterministic matrices introduced by Avron and Lev . In this paper we propose a reconstruction of Kearns’s and Ivlev’s results in a uniform way, obtaining an extension to another modal systems. The first part of (...) the paper is devoted to four-valued Nmatrices, including Kearns’s and Ivlev’s. Besides proving with full details Kearns’s results for T, S4 and S5, we also obtain a characterisation of the system B by four-valued Nmatrices with level valuations. Concerning Ivlev’s results, two new modal systems are introduced and char.. (shrink)

This article informally presents a solution to the paradoxes of truth and shows how the solution solves classical paradoxes (such as the original Liar) as well as the paradoxes that were invented as counterarguments for various proposed solutions (“the revenge of the Liar”). This solution complements the classical procedure of determining the truth values of sentences by its own failure and, when the procedure fails, through an appropriate semantic shift allows us to express the failure in a classical (...) two-valued language. Formally speaking, the solution is a language with one meaning of symbols and two valuations of the truth values of sentences. The primary valuation is a classical valuation that is partial in the presence of the truth predicate. It enables us to determine the classical truth value of a sentence or leads to the failure of that determination. The language with the primary valuation is precisely the largest intrinsic fixed point of the strong Kleene three-valued semantics (LIFPSK3). The semantic shift that allows us to express the failure of the primary valuation is precisely the classical closure of LIFPSK3: it extends LIFPSK3 to a classical language in parts where LIFPSK3 is undetermined. Thus, this article provides an argumentation, which has not been present in contemporary debates so far, for the choice of LIFPSK3 and its classical closure as the right model for the truth predicate. In the end, an erroneous critique of Kripke-Feferman axiomatic theory of truth, which is present in contemporary literature, is pointed out. (shrink)

The category-theoretic representation of quantum event structures provides a canonical setting for confronting the fundamental problem of truth valua- tion in quantum mechanics as exemplified, in particular, by Kochen-Specker’s theorem. In the present study, this is realized on the basis of the existence of a categorical adjunction between the category of sheaves of variable local Boolean frames, constituting a topos, and the category of quantum event al- gebras. We show explicitly that the latter category is equipped with an object (...) of truth values, or classifying object, which constitutes the appropriate tool for assigning truth values to propositions describing the behavior of quantum systems. Effectively, this category-theoretic representation scheme circumvents consistently the semantic ambiguity with respect to truth valuation that is in- herent in conventional quantum mechanics by inducing an objective contextual account of truth in the quantum domain of discourse. The philosophical im- plications of the resulting account are analyzed. We argue that it subscribes neither to a pragmatic instrumental nor to a relative notion of truth. Such an account essentially denies that there can be a universal context of reference or an Archimedean standpoint from which to evaluate logically the totality of facts of nature. In this light, the transcendence condition of the usual concep- tion of correspondence truth is superseded by a reflective-like transcendental reasoning of the proposed account of truth that is suitable to the quantum domain of discourse. (shrink)

In some presentations of classical and intuitionistic logics, the objectlanguage is assumed to contain (two) truth-value constants: ⊤ (verum) and ⊥ (falsum), that are, respectively, true and false under every bivalent valuation. We are interested to define and study analogical constants ‡, 1 ≤ i ≤ n, that in an arbitrary multi-valued logic over truth-values V = {v1,..., vn} have the truth-value vi under every (multi-valued) valuation. As is well known, the absence or presence of such constants (...) has a significant deductive impact on the logics studied. We define such constants proof-theoretically via their associated I/E-rules in a natural-deduction proof system. In particular, we propose a generalization of the notions of contradiction and explosiveness of a logic to the context of multi-valued logics. (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.

Here I use aspects of Phil Graham’s discourse analytical work to examine forms of e/valuations and critically analyse the formulation of truths in the constitution of Artificial Intelligence (hereafter, AI). This paper focuses on two 2019 documents: Ethics guidelines for trustworthy AI (AI HLEG, Citation2019a) and Policy and investment recommendations for trustworthy AI (AI HLEG, Citation2019b). My aim here is to provide a timely contribution to contemporary philosophical–methodological innovations in documenting the constellation of values that are prefigured in human-centric constructions (...) of AI. The analysis is informed primarily by principles from Graham’s distinctive approach to critical discourse analysis (CDA), which I take to be the philosophical study of valuation. In that approach, political economy is taken as a composite formulation of values whereby neo-liberalism is discursively entwined and progressed through a system of principles of e/valuation. This paper presents a roadmap to demonstrate the usefulness of a philosophically grounded interdisciplinary piece of linguistic research through which evaluative semantic categories can be usefully synthesised with CDA to systematically expose the assumptions which underpin current truth claims and values – in this case, about and around the ethics of AI. (shrink)

Despite being fairly powerful, finite non-deterministic matrices are unable to characterize some logics of formal inconsistency, such as those found between mbCcl and Cila. In order to overcome this limitation, we propose here restricted non-deterministic matrices (in short, RNmatrices), which are non-deterministic algebras together with a subset of the set of valuations. This allows us to characterize not only mbCcl and Cila (which is equivalent, up to language, to da Costa's logic C_1) but the whole hierarchy of da Costa's calculi (...) C_n. This produces a novel decision procedure for these logics. Moreover, we show that the RNmatrix semantics proposed here induces naturally a labelled tableau system for each C_n, which constitutes another decision procedure for these logics. This new semantics allows us to conceive da Costa's hierarchy of C-systems as a family of (non deterministically) (n+2)-valued logics, where n is the number of "inconsistently true" truth-values and 2 is the number of "classical" or "consistent" truth-values, for every C_n. (shrink)

In the present paper we examine very weak modal logics C1, D1, E1, S0.5◦, S0.5◦+(D), S0.5 and some of their versions which are closed under replacement of tautological equivalents (rte-versions). We give semantics for these logics, formulated by means of Kripke style models of the form , where w is a «distinguished» world, A is a set of worlds which are alternatives to w, and V is a valuation which for formulae and worlds assigns the truth-vales such that: (...) (i) for all formulae and all worlds, V preserves classical conditions for truth-value operators; (ii) for the world w and any formula ϕ, V(⬜ϕ,w) = 1 iff ∀x∈A V(ϕ,x) = 1; (iii) for other worlds formula ⬜ϕ has an arbitrary value. Moreover, for rte-versions of considered logics we must add the following condition: (iv) V(⬜χ,w) = V(⬜χ[ϕ/ψ],w), if ϕ and ψ are tautological equivalent. Finally, for C1, D1and E1 we must add queer models of the form in which: (i) holds and (ii') V(⬜ϕ,w) = 0, for any formula ϕ. We prove that considered logics are determined by some classes of above models. (shrink)

Syntax and semantics in Łukasiewicz infinite-valued sentential logic Ł are harmonized by revising the Bolzano-Tarski paradigm of “semantic consequence,” according to which, θ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\theta $$\end{document} follows from Θ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\Theta $$\end{document} iff every valuation v that satisfies all formulas in Θ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\Theta $$\end{document} also satisfies θ.\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\theta.$$\end{document} For θ\documentclass[12pt]{minimal} (...) \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\theta $$\end{document} to be a consequence of Θ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\Theta $$\end{document}, we also require that any infinitesimal perturbation of v that preserves the truth of all formulas of Θ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\Theta $$\end{document} also preserves the truth of θ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\theta $$\end{document}. An elementary characterization of Łukasiewicz implication shows that the Łukasiewicz axiom →Y)→→X)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$ \rightarrow Y ) \rightarrow \rightarrow X )$$\end{document} guarantees the continuity and the piecewise linearity of the implication operation →\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\rightarrow $$\end{document}, an appropriate fault-tolerance property of any logic of [0,1]\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${{\,\mathrm{[0,1]}\,}}$$\end{document}-valued observables. The directional derivability of the functions coded by all ψ∈Θ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\psi \in \Theta $$\end{document} and by θ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\theta $$\end{document} then provides a quantitative formulation of our refinement of Bolzano-Tarski consequence, which turns out to coincide with the time-honored syntactic Ł-consequence. (shrink)

The aim of the present paper is to introduce a system, where the epistemic state of an agent is represented truth-functionally. In order to obtain this system, we propose a four-valued logic, that we call the logic of rational agent, where the fact of knowing something is formalized at the level of valuations, without the explicit use of epistemic knowledge operator. On the basis of this semantics, a sound and complete system with two distinct truth-functional negations is (...) provided. These negations allow us to express the statements about knowing or not knowing something at the syntactic level. Moreover, such a system is applied to the analysis of knowability paradox. In particular, we show that the paradox is not derivable in terms of the logic of rational agent. (shrink)

According to actualism, modal reality is constructed out of valuations (combinations of truth values for all propositions). According to possibilism, modal reality consists in a set of possible worlds, conceived as independent objects that assign truth values to propositions. According to possibilism, accounts of modal reality can intelligibly disagree with each other even if they agree on which valuations are contained in modal reality. According to actualism, these disagreements (possibilist disagreements) are completely unintelligible. An essentially actualist semantics (...) for modal propositional logic specifies which sets of valuations are compatible with the meanings of the truth-functional connectives and modal operators without drawing on formal resources that would enable us to represent possibilist disagreements. The paper discusses the availability of an essentially actualist semantics for modal propositional logic. I argue that the standard Kripkean semantics is not essentially actualist and that other extant approaches also fail to provide a satisfactory essentially actualist semantics. I end by describing an essentialist actualist semantics for modal propositional logic. (shrink)

In this paper, we present valuation semantics for the Propositional Intuitionistic Calculus (also called Heyting Calculus) and three important subcalculi: the Implicative, the Positive and the Minimal Calculus (also known as Kolmogoroff or Johansson Calculus). Algorithms based in our definitions yields decision methods for these calculi. DOI:10.5007/1808-1711.2010v14n1p125.

The aim of this paper is to study a particular family of non-deterministic semantics for modal logics that has eight truth-values. These eight-valued semantics can be traced back to Omori and Skurt (2016), where a particular member of this family was used to characterize the normal modal logic K. The truth-values in these semantics convey information about a proposition’s truth/falsity, whether the proposition is necessary/not necessary, and whether it is possible/not possible. Each of these (...) triples is represented by a unique value. In this paper we will study which modal logics can be obtained by changing the interpretation of the $$\Box $$ modality, assuming that the interpretation of other connectives stays constant. We will show what axioms are responsible for a particular interpretations of $$\Box $$. Furthermore, we will study subsets of these axioms. We show that some of the combinations of the axioms are equivalent to well-known modal axioms. We apply the level-valuation technique to all of the systems to regain the closure under the rule of necessitation. We also point out that some of the resulting logics are not sublogics of S5 and comment briefly on the corresponding frame conditions that are forced by these axioms. Ultimately, we sketch a proof of meta-completeness for all of these systems. (shrink)

We define and study abstract valuation semantics for logics, an algebraically well-behaved version of valuation semantics. Then, in the context of the behavioral approach to the algebraization of logics, we show, by means of meaningful bridge theorems and application examples, that abstract valuations are suited to play a role similar to the one played by logical matrices in the traditional approach to algebraization.

John Mair was an influential post-medieval scholar. This paper focuses on his Tractatus insolubilium, in which he proposed semantic analysis of self-referential phenomena, in particular on his solution to alethic and correspondence paradoxes and his treatment of their general semantic aspects as well as particular applications. His solution to paradoxes is based on the so-called “network evaluation”, i.e. on a semantics which defines the concepts of truth and correspondence with reality in contextual terms. Consequently, the relation between semantic (...) valuation, synonymy and contradiction must be redefined. (shrink)

If a certain semantic relation (which we call 'local consequence') is allowed to guide expectations about which rules are derivable from other rules, these expectations will not always be fulfilled, as we illustrate. An alternative semantic criterion (based on a relation we call 'global consequence'), suggested by work of J.W. Garson, turns out to provide a much better - indeed a perfectly accurate - guide to derivability.

In this article we compare three different semantic theories for a propositional language, namely a valuation-semantic, a truth-set- semantic and a modal-set-semantic theory. We prove step by step that these semantic theories are mutually equivalent.

John Mair (1467–1550) was an influential post-medieval scholar. This paper focuses on his Tractatus insolubilium, in which he proposed semantic analysis of self-referential phenomena, in particular on his solution to alethic and correspondence paradoxes and his treatment of their general semantic aspects as well as particular applications. His solution to paradoxes is based on the so-called “network evaluation”, i.e. on a semantics which defines the concepts of truth and correspondence with reality in contextual terms. Consequently, the relation between (...) semantic valuation, synonymy and contradiction must be redefined. (shrink)

John Mair (1467–1550) was an influential post-medieval scholar. This paper focuses on his Tractatus insolubilium, in which he proposed semantic analysis of self-referential phenomena, in particular on his solution to alethic and correspondence paradoxes and his treatment of their general semantic aspects as well as particular applications. His solution to paradoxes is based on the so-called “network evaluation”, i.e. on a semantics which defines the concepts of truth and correspondence with reality in contextual terms. Consequently, the relation between (...) semantic valuation, synonymy and contradiction must be redefined. (shrink)

This contribution is concerned with a particular model theoretic semantics of the object language of quantum physics. The object language considered here comprises logically connected propositions, sequentially connected propositions and modal propositions. The model theoretic semantics arises from the already established dialogic semantics, if the pragmatic concept of the dialog-game is replaced by a "metaphysical" concept of the game. The game is determined by a game tree, the branches of which constitute a set, the set of "possible (...) worlds" of an individual quantum physical system. The semantic concepts like truth, falsity and valuation are defined with respect to this set. (shrink)

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)

In this paper, we present valuation semantics for the Propositional Intuitionistic Calculus (also called Heyting Calculus) and three important subcalculi: the Implicative, the Positive and the Minimal Calculus (also known as Kolmogoroff or Johansson Calculus). Algorithms based in our definitions yields decision methods for these calculi.

This chapter contains sections titled: Recent Relativism Standard Semantics and Ordinary Truth Relativist Semantics and Ordinary Truth Issues of Commensurability References.

There have been, I am afraid, almost as many answers to the question what is logic? as there have been logicians. However, if logic is not to be an obscure "science of everything", we must assume that the majority of the various answers share a common core which does offer a reasonable delimitation of the subject matter of logic. To probe this core, let us start from the answer given by Gottlob Frege (1918/9), the person probably most responsible for modern (...) logic: the subject matter of logic is "truth", and especially its "laws"1. How should we understand the concept of "laws of truth"? The underlying point clearly is that the truth/falsity of our statements is partly a contingent and partly a necessary, lawful matter: that "Paris is in France" is true is a contingent matter, whereas that "Paris is in France or it is not in France" is true is a necessary matter (let us, for the time being, leave aside the Quinean scruples regarding the delimitation of necessarily true statements). Logic,then, should focus on the statements that are true as a matter of law (i.e. necessarily), or, more generally, the truth of which "lawfully depends" on some other statements (i.e. which are true as a matter of law provided these other statements are true). This renders Fregean laws of truth as, in general, a matter of "lawful truth-dependence" - i.e. of entailment or inference (again, let us now disregard any possible difference between these two concepts). This yields a conception of logic as a theory of entailment or inference, a conception which looms behind many other specifications of the subject matter of logic and which, I think, is ultimately correct. However, we can also see the logician – and this is the view we will stick to here – as trying to separate true sentences from false ones; or, equivalently, to map sentences onto truth and falsity. Let us first consider the case of a non-empirical language with a single, definite truth valuation – like the language of Peano arithmetic.. (shrink)

I propose a new semantics for intuitionistic logic, which is a cross between the construction-oriented semantics of Brouwer-Heyting-Kolmogorov and the condition-oriented semantics of Kripke. The new semantics shows how there might be a common semantical underpinning for intuitionistic and classical logic and how intuitionistic logic might thereby be tied to a realist conception of the relationship between language and the world.

The aim of this paper is to show that Graham Priest's dialetheic account of semantic paradoxes and the paraconsistent logics employed cannot achieve semantic universality. Dialetheism therefore fails as a solution to semantic paradoxes for the same reason that consistent approaches did. It will be demonstrated that if dialetheism can express its own semantic principles, a strengthened liar paradox will result, which renders dialetheism trivial. In particular, the argument is not invalidated by relational valuations, which were brought into paraconsistent logic (...) in order to avoid strengthened liar paradoxes. (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)

In this paper, we study the method of closure games, a game-theoretic valuation method for languages of self-referential truth developed by the author. We prove two theorems which jointly establish that the method of closure games characterizes all 3- and 4-valued strong Kleene fixed points in a novel, informative manner. Among others, we also present closure games which induce the minimal and maximal intrinsic fixed point of the strong Kleene schema.