Logic Journal of the IGPL 8 (1):101-105 (2000)

Abstract
Apostoli and Brown have shown that the class of formulae valid with respect to the class of -ary relational frames is completely axiomatized by Kn: an n-place aggregative system which adjoins [RM], [RN], and a complete axiomatization of propositional logic, with [Kn]:□α1 ∧...∧□αn+1 → □2/ is the disjunction of all pairwise conjunctions αi∧αj )).Their proof exploits the chromatic indices of n-uncolourable hypergraphs, or n-traces. Here, we use the notion of the χ-product of a family of sets to formulate an alternative definition of an n-trace, which in turn enables a new and simpler completeness proof
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.1093/jigpal/8.1.101
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

PhilArchive copy


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 69,066
External links

Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library

References found in this work BETA

Inference and Necessity.P. K. Schotch & R. E. Jennings - 1980 - Journal of Philosophical Logic 9 (3):327-340.
Some Remarks on (Weakly) Weak Modal Logics.R. E. Jennings & P. K. Schotch - 1981 - Notre Dame Journal of Formal Logic 22 (4):309-314.

Add more references

Citations of this work BETA

Model Theoretical Aspects of Weakly Aggregative Modal Logic.Jixin Liu, Yifeng Ding & Yanjing Wang - 2022 - Journal of Logic, Language and Information 31 (2):261-286.

Add more citations

Similar books and articles

Kripke Completeness of Infinitary Predicate Multimodal Logics.Yoshihito Tanaka - 1999 - Notre Dame Journal of Formal Logic 40 (3):326-340.
On the Completeness of First Degree Weakly Aggregative Modal Logics.Peter Apostoli - 1997 - Journal of Philosophical Logic 26 (2):169-180.
Proofs and Countermodels in Non-Classical Logics.Sara Negri - 2014 - Logica Universalis 8 (1):25-60.
Predicate Modal Logics Do Not Mix Very Well.Olivier Gasquet - 1998 - Mathematical Logic Quarterly 44 (1):45-49.
Elementary Definability and Completeness in General and Positive Modal Logic.Ernst Zimmermann - 2003 - Journal of Logic, Language and Information 12 (1):99-117.
Some Proof Systems for Common Knowledge Predicate.Yoshihito Tanaka - 2003 - Reports on Mathematical Logic:79-100.
Approximations of Modal Logics: And Beyond.Guilherme de Souza Rabello & Marcelo Finger - 2008 - Annals of Pure and Applied Logic 152 (1):161-173.

Analytics

Added to PP index
2015-02-04

Total views
8 ( #1,002,575 of 2,498,773 )

Recent downloads (6 months)
1 ( #422,193 of 2,498,773 )

How can I increase my downloads?

Downloads

My notes