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

Mathematical Logic Quarterly 33 (1):19-29 (1987)
  Copy   BIBTEX

Abstract

This paper introduces the notions of perfect quantifiers in general many-valued logics and investigates the problem of quantificational completeness for such logics as well as the problem of characterizing all perfect quantifiers in 3-valued logics using techniques of combinatorial group theory.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,386

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

Analytics

Added to PP
2013-12-01

Downloads
15 (#923,100)

6 months
3 (#992,474)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Walter Carnielli
University of Campinas

Citations of this work

Proof Theory of Finite-valued Logics.Richard Zach - 1993 - Dissertation, Technische Universität Wien

Add more citations

References found in this work

No references found.

Add more references