A content semantics for quantified relevant logics. I (Q1116940)

This paper presents an algebraic style semantics for the quantified relevant logic, BBQ, which is a weak sentential relevant logic with more or less standard quantificational axioms and rules added. (A generalized result for all stronger systems is promised for the sequel forthcoming in Studia Logica.) Model structures in this semantics require three sets, a domain, a set of ``contents'' and a subset of the latter (the ``true contents''), as well as (the generalized union of) sets of functions from n-tuples of the domain into the set of contents. The given semantics does not, however, use an algebraic fusion operator as would be usual for relevant logics. [See \textit{R. K. Meyer} and \textit{R. Routley}, Logique Anal., Nouv. Sér. 15, 407-428 (1972; Zbl 0336.02020), e.g.] Instead, the author utilises a partial ordering and meets and joins as well as the usual * and \(\Rightarrow\). Generalized meets and joins are used for the quantifiers. Consistency and completeness proofs are offered.