METAVALUATIONS

2017 ◽  
Vol 23 (3) ◽  
pp. 296-323 ◽  
Author(s):  
ROSS T. BRADY

AbstractThis is a general account of metavaluations and their applications, which can be seen as an alternative to standard model-theoretic methodology. They work best for what are called metacomplete logics, which include the contraction-less relevant logics, with possible additions of Conjunctive Syllogism, (A→B) & (B→C) → .A→C, and the irrelevant, A→ .B→A, these including the logic MC of meaning containment which is arguably a good entailment logic. Indeed, metavaluations focus on the formula-inductive properties of theorems of entailment form A→B, splintering into two types, M1- and M2-, according to key properties of negated entailment theorems (see below). Metavaluations have an inductive presentation and thus have some of the advantages that model theory does, but they represent proof rather than truth and thus represent proof-theoretic properties, such as the priming property, if ├ A $\vee$ B then ├ A or ├ B, and the negated-entailment properties, not-├ ∼(A→B) (for M1-logics, with M1-metavaluations) and ├ ∼(A→B) iff ├ A and ├ ∼ B (for M2-logics, with M2-metavaluations). Topics to be covered are their impact on naive set theory and paradox solution, and also Peano arithmetic and Godel’s First and Second Theorems. Interesting to note here is that the familiar M1- and M2-metacomplete logics can be used to solve the set-theoretic paradoxes and, by inference, the Liar Paradox and key semantic paradoxes. For M1-logics, in particular, the final metavaluation that is used to prove the simple consistency is far simpler than its correspondent in the model-theoretic proof in that it consists of a limit point of a single transfinite sequence rather than that of a transfinite sequence of such limit points, as occurs in the model-theoretic approach. Additionally, it can be shown that Peano Arithmetic is simply consistent, using metavaluations that constitute finitary methods. Both of these results use specific metavaluational properties that have no correspondents in standard model theory and thus it would be highly unlikely that such model theory could prove these results in their final forms.

2000 ◽  
Vol 65 (1) ◽  
pp. 339-346 ◽  
Author(s):  
Petr Hájek ◽  
Jeff Paris ◽  
John Shepherdson

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


Author(s):  
Cory Wright ◽  
Bradley Armour-Garb

Pluralists maintain that there is more than one truth property in virtue of which bearers are true. Unfortunately, it is not yet clear how they diagnose the liar paradox or what resources they have available to treat it. This chapter considers one recent attempt by Cotnoir (2013b) to treat the Liar. It argues that pluralists should reject the version of pluralism that Cotnoir assumes, discourse pluralism, in favor of a more naturalized approach to truth predication in real languages, which should be a desideratum on any successful pluralist conception. Appealing to determination pluralism instead, which focuses on truth properties, it then proposes an alternative treatment to the Liar that shows liar sentences to be undecidable.


Author(s):  
Peter Ludlow ◽  
Bradley Armour-Garb

This chapter follows recent work in philosophy, linguistics, and psychology, which rejects the standard, static picture of languages and highlights its context sensitivity—a dynamic theory of the nature of language. On the view advocated, human languages are things that we build on a conversation-by-conversation basis. The author calls such languages microlanguages. The chapter argues that thinking of languages in terms of microlanguages yields interesting consequences for how we should think about the liar paradox. In particular, we will see that microlanguages have admissible conditions that preclude liar-like sentences. On the view presented in the chapter, liar sentences are not even sentences of any microlanguage that we might construct (or assertorically utter). Accordingly, the proper approach to such a paradoxical sentence is to withhold the sentence—not permitting it to be admitted into our microlanguage unless, or until, certain sharpening occurs.


Author(s):  
Bradley Armour-Garb ◽  
Bradley Armour-Garb

In this chapter, after introducing a few versions of the liar paradox and identifying the pathology that the versions of the paradox appear to present, the author considers some proposals for how to understand ‘paradox’ and goes on to offer a particular reading of that notion. He then identifies a number of projects the completion of which would contribute to our understanding—or, in some cases, our resolution—of the liar paradox and, after considering certain “treatments” of the paradox, highlights certain “revenge” problems that arise for such treatments. In the concluding section, the author summarizes each of the chapters that are contained in the volume.


Erkenntnis ◽  
2021 ◽  
Author(s):  
Poppy Mankowitz

AbstractSome in the recent literature have claimed that a connection exists between the Liar paradox and semantic relativism: the view that the truth values of certain occurrences of sentences depend on the contexts at which they are assessed. Sagi (Erkenntnis 82(4):913–928, 2017) argues that contextualist accounts of the Liar paradox are committed to relativism, and Rudnicki and Łukowski (Synthese 1–20, 2019) propose a new account that they classify as relativist. I argue that a full understanding of how relativism is conceived within theories of natural language shows that neither of the purported connections can be maintained. There is no reason why a solution to the Liar paradox needs to accept relativism.


Mind ◽  
1955 ◽  
Vol LXIV (256) ◽  
pp. 543-543 ◽  
Author(s):  
A. P. USHENKO

Sign in / Sign up

Export Citation Format

Share Document