An integral subresiduated lattice ordered commutative monoid (or integral srl-monoid for short) is a pair \(({\textbf {A}},Q)\) where \({\textbf {A}}=(A,\wedge,\vee,\cdot,1)\) is a lattice ordered commutative monoid, 1 is the greatest element of the lattice \((A,\wedge,\vee )\) and _Q_ is a subalgebra of _A_ such that for each \(a,b\in A\) the set \(\{q \in Q: a \cdot q \le b\}\) has maximum, which will be denoted by \(a\rightarrow b\). The integral srl-monoids can be regarded as algebras \((A,\wedge,\vee,\cdot,\rightarrow,1)\) of type (2, 2, (...) 2, 2, 0). Furthermore, this class of algebras is a variety which properly contains the varieties of integral commutative residuated lattices and subresiduated lattices respectively. In this paper we study the quasivariety of \(\{\wedge,\cdot,\rightarrow,1\}\) -subreducts of integral srl-monoids, which will be denoted by \(\mathsf {SR^s}\). In particular, we show that \(\mathsf {SR^s}\) is a variety. We also characterize simple and subdirectly irreducible algebras of \(\mathsf {SR^s}\) respectively. Finally, through a Hilbert style system, we present a logic which has as algebraic semantics the variety \(\mathsf {SR^s}\) and we apply this result in order to present an expansion of the previous logic which has as algebraic semantics the variety of integral srl-monoids. (shrink)

In the framework of algebras with infinitary operations, the equational theory of \(\bigvee _{\kappa }\) -complete Heyting algebras or Heyting \(\kappa \) -frames is studied. A Hilbert style calculus algebraizable in this class is formulated. Based on the infinitary structure of Heyting \(\kappa \) -frames, an equational type completeness theorem related to the \(\langle \bigvee, \wedge, \rightarrow, 0 \rangle \) -structure of frames is also obtained.

Weak ontic necessity is the ontic necessity expressed by “should” or “ought to”. An example of it is “I should be dead by now”. A feature of this necessity is that whether it holds is irrelevant to whether its underlying proposition holds. This necessity essentially involves time. This paper presents a logic for conditional weak ontic necessity in branching time. The logic’s language includes the next instant operator, the last instant operator, and the operator for conditional weak ontic necessity. Formulas (...) are evaluated at tuples consisting of a tree-based model, a context, a timeline, and an instant. A context is a set of ordered ontic laws determining expected timelines. When evaluating conditional weak ontic necessity, we first update the context with the antecedent, then check whether the consequent holds with respect to the updated context. We discuss some consequences of the formalization and compare it to some related work. We study the logic’s expressivity and axiomatize a special validity of it. (shrink)

Let \(\textbf{K}\) and \(\textbf{M}\) be locally finite quasivarieties of finite type such that \(\textbf{K}\subset \textbf{M}\). If \(\textbf{K}\) is profinite then the filter \([\textbf{K},\textbf{M}]\) in the quasivariety lattice \(\textrm{Lq}(\textbf{M})\) is an atomic lattice and \(\textbf{K}\) has an independent quasi-equational basis relative to \(\textbf{M}\). Applications of these results for lattices, unary algebras, groups, unary algebras, and distributive algebras are presented which concern some well-known problems on standard topological quasivarieties and other problems.

In one of his papers, JC Beall advanced a new and interesting interpretation of Weak Kleene logic, in terms of on-topic/off-topic. In brief, Beall suggests to read the third value as _off-topic_, whereas the two classical values are read as _true and on-topic_ and _false and on-topic_. Building on Beall’s new interpretation, the aim of this paper is threefold. First, we discuss two motivations to enrich Beall’s interpretation, and offer an alternative semantic framework that reflects our motivations. Second, by making (...) use of our new framework, we will offer a new interpretation of the logic of Catuskoti which combines Beall’s proposal of having _FDE_ as the correct logic with the on-topic/off-topic divide. Finally, we will offer a general result that will allow us to make sense of a family of infectious logics in terms of Beall’s on-topic/off-topic reading. (shrink)

We present a formalization of collections that Cornelius Castoriadis calls “magmas”, especially the property which mainly characterizes them and distinguishes them from the usual cantorian sets. It is the property of their elements to _depend_ on other elements, either in a one-way or a two-way manner, so that one cannot occur in a collection without the occurrence of those dependent on it. Such a dependence relation on a set _A_ of atoms (or urelements) can be naturally represented by a pre-order (...) relation \(\preccurlyeq \) of _A_ with the extra condition that it contains no minimal elements. Then, working in a mild strengthening of the theory \(\textrm{ZFA}\), where _A_ is an infinite set of atoms equipped with a primitive pre-ordering \(\preccurlyeq \), the class of magmas over _A_ is represented by the class \(LO(A,\preccurlyeq )\) of nonempty open subsets of _A_ with respect to the lower topology of \(\langle A,\preccurlyeq \rangle \). The non-minimality condition for \(\preccurlyeq \) implies that all sets of \(LO(A,\preccurlyeq )\) are infinite and none of them is \(\subseteq \) -minimal. Next the pre-ordering \(\preccurlyeq \) is shifted (by a kind of simulation) to a pre-ordering \(\preccurlyeq ^+\) on \({{\mathcal {P}}}(A)\), which turns out to satisfy the same non-minimality condition as well, and which, happily, when restricted to \(LO(A,\preccurlyeq )\) coincides with \(\subseteq \). This allows us to define a hierarchy \(M_\alpha (A)\), along all ordinals \(\alpha \ge 1\), the“magmatic hierarchy”, such that \(M_1(A)=LO(A,\preccurlyeq )\), \(M_{\alpha +1}(A)=LO(M_\alpha (A),\subseteq )\), and \(M_\alpha (A)=\bigcup _{\beta, for a limit ordinal \(\alpha \). For every \(\alpha \ge 1\), \(M_\alpha (A)\subseteq V_\alpha (A)\), where \(V_\alpha (A)\) are the levels of the universe _V_(_A_) of \(\textrm{ZFA}\). The class \(M(A)=\bigcup _{\alpha \ge 1}M_\alpha (A)\) is the “magmatic universe above _A_.” The axioms of Powerset and Union (the latter in a restricted version) turn out to be true in \(\langle M(A),\in \rangle \). Besides it is shown that three of the five principles about magmas that Castoriadis proposed in his writings (mildly modified and adapted to the needs of formalization), \(M2^*\), \(M3^*\) and \(M5^*\), are true of _M_(_A_). A selection of excerpts from these writings, in which the concept of magma was first introduced and elaborated, is presented in the Introduction. (shrink)

This paper deals with substructural nuclear (image-based) logics and their algebraic and Kripke-style semantics. More precisely, we first introduce a class of substructural logics with connective _N_ satisfying nucleus property, called here substructural _nuclear_ logics, and its subclass, called here substructural _nuclear image-based_ logics, where _N_ further satisfies homomorphic image property. We then consider their algebraic semantics together with algebraic characterizations of those logics. Finally, we introduce _operational Kripke-style_ semantics for those logics and provide two sorts of completeness results for (...) them, one of which is based on algebraic completeness for all the logics and the other of which is based on set-theoretic one for the nuclear image-based logics. (shrink)

We show that the properties of [relative] semisimplicity and congruence 3-permutability of a [quasi]variety with equationally definable [relative] principal congruences (EDP[R]C) can be characterized syntactically. We prove that a quasivariety with EDPRC is relatively semisimple if and only if it satisfies a finite set of quasi-identities that is effectively constructible from any conjunction of equations defining relative principal congruences in the quasivariety. This in turn allows us to obtain an ‘axiomatization’ of relatively filtral quasivarieties. We also show that a variety (...) is 3-permutable and has EDPC if and only if there is a single pair of quaternary terms satisfying two simple equations, and whose equality defines principal congruences in the variety. Finally, we combine both results to obtain a neat characterization of semisimple, 3-permutable varieties with EDPC, which is applied to solve a problem posed by Blok and Pigozzi in the third paper of their series on varieties with EDPC. (shrink)

Recent research on algebraic models of _quasi-Nelson logic_ has brought new attention to a number of classes of algebras which result from enriching (subreducts of) Heyting algebras with a special modal operator, known in the literature as a _nucleus_. Among these various algebraic structures, for which we employ the umbrella term _intuitionistic modal algebras_, some have been studied since at least the 1970s, usually within the framework of topology and sheaf theory. Others may seem more exotic, for their primitive operations (...) arise from algebraic terms of the intuitionistic modal language which have not been previously considered. We shall for instance investigate the variety of _weak implicative semilattices_, whose members are (non-necessarily distributive) meet semilattices endowed with a nucleus and an implication operation which is not a relative pseudo-complement but satisfies the postulates of Celani and Jansana’s strict implication. For each of these new classes of algebras we establish a representation and a topological duality which generalize the known ones for Heyting algebras enriched with a nucleus. (shrink)

The main aim of this paper is to introduce the logics of evidence and truth $$LET_{K}^+$$ and $$LET_{F}^+$$ together with sound, complete, and decidable six-valued deterministic semantics for them. These logics extend the logics $$LET_{K}$$ and $$LET_{F}^-$$ with rules of propagation of classicality, which are inferences that express how the classicality operator $${\circ }$$ is transmitted from less complex to more complex sentences, and vice-versa. The six-valued semantics here proposed extends the 4 values of Belnap-Dunn logic with 2 more values (...) that intend to represent (positive and negative) reliable information. A six-valued non-deterministic semantics for $$LET_{K}$$ is obtained by means of Nmatrices based on swap structures, and the six-valued semantics for $$LET_{K}^+$$ is then obtained by imposing restrictions on the semantics of $$LET_{K}$$. These restrictions correspond exactly to the rules of propagation of classicality that extend $$LET_{K}$$. The logic $$LET_{F}^+$$ is obtained as the implication-free fragment of $$LET_{K}^+$$. We also show that the 6 values of $$LET_{K}^+$$ and $$LET_{F}^+$$ define a lattice structure that extends the lattice L4 defined by the Belnap-Dunn four-valued logic with the 2 additional values mentioned above, intuitively interpreted as positive and negative reliable information. Finally, we also show that $$LET_{K}^+$$ is Blok-Pigozzi algebraizable and that its implication-free fragment $$LET_{F}^+$$ coincides with the degree-preserving logic of the involutive Stone algebras. (shrink)

We provide an alternative proof of the decidability of the equational theory of lattices. The proof presented here is quite short and elementary.

In the paper we examine the problem of logical systems that are extensions of Classical Propositional Logic with new, intensional connectives of agency: monadic and dyadic _bringing it about that_. These systems are usually studied within the neighbourhood semantics. Here we propose a different strategy. We study all of the accepted laws and rules of logic of agency and define a translation of the agency operators into connectives interpreted in relating semantics. After this translation we can make a reduction to (...) more basic semantic properties that are required by the particular groups of laws and axioms. Finally, we define proper semantic structures and prove that they are complete with respect to all possible logical systems determined by the combinations of the axioms and rules. (shrink)

We develop intuitionistic public announcement logic over intuitionistic \({\textbf{K}}\), \({{\textbf{K}}}{{\textbf{T}}}\), \({{\textbf{K}}}{{\textbf{4}}}\), and \({{\textbf{S}}}{{\textbf{4}}}\) with distributed knowledge. We reveal that a recursion axiom for the distributed knowledge is _not_ valid for a frame class discussed in [ 12 ] but valid for the restricted frame class introduced in [ 20, 26 ]. The semantic completeness of the static logics for this restricted frame class is established via the concept of pseudo-model.

De Rijke introduced a unary interpretability logic $$\textbf{il}$$, and proved that $$\textbf{il}$$ is the unary counterpart of the binary interpretability logic $$\textbf{IL}$$. In this paper, we find the unary counterparts of the sublogics of $$\textbf{IL}$$.

This paper studies proof systems for the logics of super-strict implication \(\textsf{ST2}\) – \(\textsf{ST5}\), which correspond to C.I. Lewis’ systems \(\textsf{S2}\) – \(\textsf{S5}\) freed of paradoxes of strict implication. First, Hilbert-style axiomatic systems are introduced and shown to be sound and complete by simulating \(\textsf{STn}\) in \(\textsf{Sn}\) and backsimulating \(\textsf{Sn}\) in \(\textsf{STn}\), respectively (for \({\textsf{n}} =2, \ldots, 5\) ). Next, \(\textsf{G3}\) -style labelled sequent calculi are investigated. It is shown that these calculi have the good structural properties that are distinctive (...) of \(\textsf{G3}\) -style calculi, that they are sound and complete, and it is shown that the proof search for \(\mathsf {G3.ST2}\) is terminating and therefore the logic is decidable. (shrink)

In this paper, we introduce a new logic, which we call AM3. It is a connexive logic that has several interesting properties, among them being strongly connexive and validating the Converse Boethius Thesis. These two properties are rather characteristic of the difference between, on the one hand, Angell and McCall’s CC1 and, on the other, Wansing’s C. We will show that in other aspects, as well, AM3 combines what are, arguably, the strengths of both CC1 and C. It also allows (...) us an interesting look at how connexivity and the intuitionistic understanding of negation relate to each other. However, some problems remain, and we end by pointing to a large family of weaker logics that AM3 invites us to further explore. (shrink)