Arrow logic and infinite counting

Studia Logica 65 (2):199-222 (2000)
We consider arrow logics (i.e., propositional multi-modal logics having three -- a dyadic, a monadic, and a constant -- modal operators) augmented with various kinds of infinite counting modalities, such as 'much more', 'of good quantity', 'many times'. It is shown that the addition of these modal operators to weakly associative arrow logic results in finitely axiomatizable and decidable logics, which fail to have the finite base property.
Keywords Philosophy   Logic   Mathematical Logic and Foundations   Computational Linguistics
Categories (categorize this paper)
Reprint years 2004
DOI 10.1023/A:1005215730377
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history
Request removal from index
Download options
Our Archive

Upload a copy of this paper     Check publisher's policy     Papers currently archived: 27,651
Through your library
References found in this work BETA

No references found.

Add more references

Citations of this work BETA
Weakly Associative Relation Algebras with Projections.Agi Kurucz - 2009 - Mathematical Logic Quarterly 55 (2):138-153.

Add more citations

Similar books and articles

Monthly downloads

Added to index


Total downloads

18 ( #270,544 of 2,169,384 )

Recent downloads (6 months)

7 ( #43,058 of 2,169,384 )

How can I increase my downloads?

My notes
Sign in to use this feature

There  are no threads in this forum
Nothing in this forum yet.

Other forums