•
• Overview
•
• Research
•
• Identity
•
•
• View All
•

### abstract

• 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.

• 2017