Studia Logica 65 (2):199-222 (2000)
| Abstract |
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 |
| Options |
Mark as duplicate
Export citation
Request removal from index
|
Download options
References found in this work BETA
Finite Algebras of Relations Are Representable on Finite Sets.H. Andréka, I. Hodkinson & I. Németi - 1999 - Journal of Symbolic Logic 64 (1):243-267.
Undecidable Relativizations of Algebras of Relations.Szabolcs Mikulás & Maarten Marx - 1999 - Journal of Symbolic Logic 64 (2):747-760.
Translation Methods for Non-Classical Logics: An Overview.Hans Ohlbach - 1993 - Logic Journal of the IGPL 1 (1):69-89.
Citations of this work BETA
Weakly Associative Relation Algebras with Projections.Agi Kurucz - 2009 - Mathematical Logic Quarterly 55 (2):138-153.
Similar books and articles
Computing with Cylindric Modal Logics and Arrow Logics, Lower Bounds.Maarten Marx - 2002 - Studia Logica 72 (2):233-252.
On Modal Logics Between K × K × K and $S5 \times S5 \times S5$.R. Hirsch, I. Hodkinson & A. Kurucz - 2002 - Journal of Symbolic Logic 67 (1):221 - 234.
Modal Counterparts of Medvedev Logic of Finite Problems Are Not Finitely Axiomatizable.Valentin Shehtman - 1990 - Studia Logica 49 (3):365 - 385.
Simulating Polyadic Modal Logics by Monadic Ones.George Goguadze, Carla Piazza & Yde Venema - 2003 - Journal of Symbolic Logic 68 (2):419-462.
Term-Modal Logics.Melvin Fitting, Lars Thalmann & Andrei Voronkov - 2001 - Studia Logica 69 (1):133-169.
Completeness and Decidability Results for Some Propositional Modal Logics Containing “Actually” Operators.Dominic Gregory - 2001 - Journal of Philosophical Logic 30 (1):57-78.
Products of 'Transitive' Modal Logics.David Gabelaia, Agi Kurucz, Frank Wolter & Michael Zakharyaschev - 2005 - Journal of Symbolic Logic 70 (3):993-1021.
On Fork Arrow Logic and its Expressive Power.Paulo A. S. Veloso, Renata P. de Freitas, Petrucio Viana, Mario Benevides & Sheila R. M. Veloso - 2007 - Journal of Philosophical Logic 36 (5):489 - 509.
Analytics
Added to PP index
2009-01-28
Total views
39 ( #293,309 of 2,520,895 )
Recent downloads (6 months)
1 ( #405,457 of 2,520,895 )
2009-01-28
Total views
39 ( #293,309 of 2,520,895 )
Recent downloads (6 months)
1 ( #405,457 of 2,520,895 )
How can I increase my downloads?
Downloads
