Definability and quantifier elimination for \(J_ 3\)-theories (Q1095881)

From MaRDI portal
Revision as of 13:42, 18 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Definability and quantifier elimination for \(J_ 3\)-theories
scientific article

    Statements

    Definability and quantifier elimination for \(J_ 3\)-theories (English)
    0 references
    1987
    0 references
    In a previous paper [C. R. Acad. Sci., Paris, Sér. A 270, 1349-1353 (1970; Zbl 0198.017)] the author and \textit{N. C. A. da Costa} introduced a three-valued propositional calculus with two distinguished truth-values, denoted by \(J_ 3\), which reflects some aspects of certain types of modal logics and is paraconsistent. In another paper [Rev. Colomb. Math. 19, 77-94 (1985; Zbl 0614.03020)] the author axiomatized \(J_ 3\), defined the three-valued first-order \(J_ 3\)-theories and proved the Completeness Theorem for this kind of many-valued logics. The theory of models for \(J_ 3\)-theories reflects a great deal of the classical model theory. Generalized versions of some of the principal classical results were obtained. In some cases, the author obtained more than one generalization of these results, all of them compatible both with the many-valued aspects and the modal characteristics of \(J_ 3\)- theories [see Lect. Notes Math. 1130, 157-173 (1985; Zbl 0594.03012)]. The aim of this paper is to present the Joint Non-Trivialization Theorem, which generalizes the classical Craig-Robinson's Joint Consistency Theorem and which permitted the author to obtain an Interpolation Lemma for \(J_ 3\)-theories related to the basic implication of \(J_ 3\); four Definability Theorems, one of Almost-Definability, two intermediate theorems and another one of Strong Definability, all of them asserting gradual conditions which permit to define one nonlogical symbol \(\mu\) in a \(J_ 3\)-theory T, in terms of a set of nonlogical symbols not containing \(\mu\) ; and the generalized Quantifier Elimination Theorem. Specific definitions for definability are introduced. After introducing the specific definition for \(\nabla\)-equivalence satisfability condition, the author proves the Quantifier Elimination Theorem for \(J_ 3\)- theories, which is meaningful for \(J_ 3\)-theories and general many- valued and modal logics. Finally, the paper presents some of the main results on Cardinality of \(J_ 3\)-Models and Categoricity. The results and proofs involve specific characteristics of paraconsistent many-valued modal logics, and reflect the existence of more than one distinguished truth-value in the matrix defining \(J_ 3\)-theories.
    0 references
    three-valued logic
    0 references
    paraconsistent logics
    0 references
    three-valued propositional calculus
    0 references
    two distinguished truth-values
    0 references
    modal logics
    0 references
    model theory
    0 references
    Joint Non-Trivialization Theorem
    0 references
    Interpolation
    0 references
    Definability
    0 references
    Quantifier Elimination
    0 references
    Categoricity
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references