<p>We describe two ways of introducing a universal quantifier in the context of the maximal propositional relevance logic <InlineEquation ID="IEq1"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11225_2025_10176_Article_IEq1.gif" Format="GIF" Height="18" Rendition="HTML" Resolution="72" Type="Linedraw" Width="53" /> </InlineMediaObject> <EquationSource Format="TEX">\(\textbf{RMI}_{{\mathop {\rightarrow }\limits ^{\lnot }}}\)</EquationSource> <EquationSource Format="MATHML"><math> <msub> <mi mathvariant="bold">RMI</mi> <mover> <mo stretchy="false">→</mo> <mo>¬</mo> </mover> </msub> </math></EquationSource> </InlineEquation>. One takes it to be an infinite version of a purely relevant counterpart of the additive conjunction that is usual to add to purely multiplicative relevance logics. The other takes it to be an infinite version of the multiplicative (or ‘intensional’) conjunction of relevance logics. We provide semantics and corresponding (strongly) sound and complete proof systems in both cases (separately), as well as to the logic that is obtained by combining them.</p>

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

On First-Order Pure Relevance Logics

  • Arnon Avron

摘要

We describe two ways of introducing a universal quantifier in the context of the maximal propositional relevance logic \(\textbf{RMI}_{{\mathop {\rightarrow }\limits ^{\lnot }}}\) RMI ¬ . One takes it to be an infinite version of a purely relevant counterpart of the additive conjunction that is usual to add to purely multiplicative relevance logics. The other takes it to be an infinite version of the multiplicative (or ‘intensional’) conjunction of relevance logics. We provide semantics and corresponding (strongly) sound and complete proof systems in both cases (separately), as well as to the logic that is obtained by combining them.