The finitely axiomatizable complete theories of non-associative arrow frames

DOI10.1016/J.AIM.2019.01.014MaRDI QIDQ1731561zbMATH OpenOpenAlexWikidataFDO

Publication date 13 March 2019

Published in Advances in Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.aim.2019.01.014

arrow logic finite model property finitely axiomatizable theories relation algebras

Modal logic (including the logic of norms) (03B45) Cylindric and polyadic algebras; relation algebras (03G15) Boolean algebras with additional operations (diagonalizable algebras, etc.) (06E25)

Review text

The paper studies the non-associative arrow logic NAL. One of the important notions used for studying NAL is a notion of normal forms. Let \(F_k(X)\) denote a set of normal forms of degree \(k\) in variable from \(X\). Then the following holds: There is an algorithm that, given a formula \(\varphi\), a set of propositional variables \(X \supseteq \mathrm{var}(\phi)\) and a finite ordinal \(k\) bigger than or equal to the maximum depth of modal operators nesting in \(\phi\), generates a finite set \(\Sigma \subseteq F_k(X)\) such that \(\vDash \varphi \leftrightarrow \bigvee\Sigma\). A game theory semantic of NAL has been intensively studied. Using it, an alternative proof [\textit{I. Németi}, Proc. Am. Math. Soc. 100, 340--344 (1987; Zbl 0638.03061)] of the following result is presented: NAL has the finite model property and it is decidable. In addition, the descriptions of all finitely axiomatizable, all complete and all consistent theories of NAL are given. A negative answer to a problem concerning the atomicity of the free non-associative relation algebras is given.

Recommendations

Cites work

Cited in

(7)

This page was built for publication: The finitely axiomatizable complete theories of non-associative arrow frames

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1731561)