The problem of Quantificational Completeness and the Characterization of All Perfect Quantifiers in 3-Valued Logics

Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 33 (1):19-29 (1987)
  Copy   BIBTEX

Abstract

This paper investigates a problem related to quantifiers which has some analogies to that of propositional completeness I give a definition of quantifier in many-valued logics generalizing the cases which already occur in first order many- valued logics. Though other definitions are possible, this particular one, which I call distribution quantifiers, generalizes the classical quantifiers in a very natural way, and occurs in finite numbers in every m-valued logic. We then call the problem of quantificationa2 completeness in m-valued logic the problem of characterizing which are the quantifiers in a given language which can generate all other quantifiers in this language, using the connectives, as is the case, for example, of the universal and exis- tential quantifiers in classical logic, using negation. We are interested, in particular, in those many-valued quantifiers which closely mimic the behavior of existential an universal quantifiers in generating all other quantifiers using negation: these I call perfect quantifiers, as defined below. The main result of this paper is the characterization of all perfect quantifiers in 3-valued logics, which are complete if the logic is functionally complete. As a byproduct, we obtain the same result for the classical logic, which we include mainly for motivation.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 90,616

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

How to avoid deviance (in logic).Walter Sinnott-Armstrong & Amit Malhotra - 2002 - History and Philosophy of Logic 23 (3):215--36.
Ideal Paraconsistent Logics.O. Arieli, A. Avron & A. Zamansky - 2011 - Studia Logica 99 (1-3):31-60.
Process algebra with four-valued logic.Jan A. Bergstra & Alban Ponse - 2000 - Journal of Applied Non-Classical Logics 10 (1):27-53.
Tableaus for many-valued modal logic.Melvin Fitting - 1995 - Studia Logica 55 (1):63 - 87.
Lewis Dichotomies in Many-Valued Logics.Simone Bova - 2012 - Studia Logica 100 (6):1271-1290.
A Hierarchy of Weak Double Negations.Norihiro Kamide - 2013 - Studia Logica 101 (6):1277-1297.

Analytics

Added to PP
2015-12-02

Downloads
33 (#419,057)

6 months
1 (#1,040,386)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Walter Carnielli
University of Campinas

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references