ML-1995-05: Generalized Quantification as Substructural Logic

ML-1995-05: Alechina, Natasha and van Lambalgen, Michiel (1995) Generalized Quantification as Substructural Logic. [Report]

[thumbnail of Full Text] Text (Full Text)

Download (163kB)
[thumbnail of Abstract] Text (Abstract)

Download (957B)


We show how sequent calculi for some generalized quantifiers can be
obtained by generalizing the Herbrand approach to ordinary first order
proof theory. Typical of the Herbrand approach, as compared to plain se­
quent calculus, is increased control over relations of dependence between
variables. In the case of generalized quantifiers, explicit attention to re­
lations of dependence becomes indispensible for setting up proof systems.
It is shown that this can be done by turning variables into structured
objects, governed by various types of structural rules. These structured
variables are interpreted semantically by means of a dependence relation.
This relation is an analogue of the accessibility relation in modal logic. We
then isolate a class of axioms for generalized quantifiers which correspond
to first­order conditions on the dependence relation.

Item Type: Report
Report Nr: ML-1995-05
Series Name: Mathematical Logic and Foundations (ML)
Year: 1995
Date Deposited: 12 Oct 2016 14:40
Last Modified: 12 Oct 2016 14:40

Actions (login required)

View Item View Item