The Balanced Pseudocomplemented Ockham Algebras with the Strong Endomorphism Kernel Property

Studia Logica - An endomorphism on an algebra $${\mathcal {A}}$$ is said to be strong if it is compatible with every congruence on $${\mathcal {A}}$$ ; and $${\mathcal {A}}$$ is said to have the...     

Simplified Kripke-Style Semantics for Some Normal Modal Logics

Studia Logica - Pietruszczak (Bull Sect Log 38(3/4):163–171, 2009. https://doi.org/10.12775/LLP.2009.013) proved that the normal logics $$\mathrm {K45}$$, $$\mathrm {KB4}$$ ($$=\mathrm...     

Intermediate Logics Admitting a Structural Hypersequent Calculus

Studia Logica - We characterise the intermediate logics which admit a cut-free hypersequent calculus of the form $$\mathbf {HLJ} + \mathscr {R}$$ , where $$\mathbf {HLJ}$$ is the hypersequent...     

Containment Logics: Algebraic Completeness and Axiomatization

Studia Logica - The paper studies the containment companion (or, right variable inclusion companion) of a logic $$\vdash $$ . This consists of the consequence relation $$\vdash ^{r}$$ which...     

A Deterministic Weakening of Belnap–Dunn Logic

Studia Logica - A deterministic weakening $$\mathsf {DW}$$ of the Belnap–Dunn four-valued logic $$\mathsf {BD}$$ is introduced to formalize the acceptance and rejection of a proposition at a...     

Countably Many Weakenings of Belnap–Dunn Logic

Studia Logica - Every Berman’s variety $$\mathbb {K}_p^q$$ which is the subvariety of Ockham algebras defined by the equation $${\sim ^{2p+q}}a = {\sim ^q}a$$ ($$p\ge 1$$ and $$q\ge 0$$)...     

A Propositional Dynamic Logic for Instantial Neighborhood Semantics

Studia Logica - We propose a new perspective on logics of computation by combining instantial neighborhood logic $$\mathsf {INL}$$ with bisimulation safe operations adapted from $$\mathsf {PDL}$$ ....     

Categorical Equivalence Between $$\varvec{PMV}_{\varvec{f}}$$ PMV f -Product Algebras and Semi-Low $$\varvec{f}_{\varvec{u}}$$ f u -Rings

Studia Logica - An explicit categorical equivalence is defined between a proper subvariety of the class of $${ PMV}$$ -algebras, as defined by Di Nola and Dvure?enskij, to be called $${...     

Correction to: The Hahn Embedding Theorem for a Class of Residuated Semigroups

Studia Logica - Let $${\mathcal {O}}$$ be the class of odd involutive $$\hbox {FL}_e$$ -chains which admit finitely many idempotent elements. The price for describing the structure of such a rich...     

Expanding Quasi-MV Algebras by a Quantum Operator

We investigate an expansion of quasi-MV algebras ([10]) by a genuine quantum unary operator. The variety of such quasi-MV algebras has a subquasivariety whose members—called cartesian—can be obtained in an appropriate way out of MV algebras. After showing that cartesian . quasi-MV algebras generate ,we prove a standard completeness theorem for w.r.t. an algebra over the complex numbers. Presented by Heinrich Wansing     

A Propositional Logic with Relative Identity Connective and a Partial Solution to the Paradox of Analysis

We construct a a system PLRI which is the classical propositional logic supplied with a ternary construction , interpreted as the intensional identity of statements and in the context . PLRI is a refinement of Roman Suszko’s sentential calculus with identity (SCI) whose identity connective is a binary one. We provide a Hilbert-style axiomatization of this logic and prove its soundness and completeness with respect to some algebraic models. We also show that PLRI can be used to give a partial solution to the paradox of analysis. Presented by Jacek Malinowski     

Equivalents for a Quasivariety to be Generated by a Single Structure

We present some equivalent conditions for a quasivariety of structures to be generated by a single structure. The first such condition, called the embedding property was found by A.I. Mal′tsev in [6]. It says that if are nontrivial, then there exists such that A and B are embeddable into C. One of our equivalent conditions states that the set of quasi-identities valid in is closed under a certain Gentzen type rule which is due to J. Łoś and R. Suszko [5]. Presented by Jacek Malinowski     

Connectives Stranger than Tonk

Many logical systems are such that the addition of Prior's binary connective to them leads to triviality, see [1, 8]. Since is given by some introduction and elimination rules in natural deduction or sequent rules in Gentzen's sequent calculus, the unwanted effects of adding show that some kind of restriction has to be imposed on the acceptable operational inferences rules, in particular if these rules are regarded as definitions of the operations concerned. In this paper, a number of simple observations is made showing that the unwanted phenomenon exemplified by in some logics also occurs in contexts in which is acceptable. In fact, in any non-trivial context, the acceptance of arbitrary introduction rules for logical operations permits operations leading to triviality. Connectives that in all non-trivial contexts lead to triviality will be called non-trivially trivializing connectives.     

An Abductive Question-Answer System for the Minimal Logic of Formal Inconsistency $$\mathsf {mbC}$$ mbC

Studia Logica - The aim in this paper is to define an Abductive Question-Answer System for the minimal logic of formal inconsistency $$\mathsf {mbC}$$ . As a proof-theoretical basis we employ the...     

DLEAC: A Dialetheic Logic with Exclusive Assumptions and Conclusions

Topoi - This paper proposes a new dialetheic logic, a Dialetheic Logic with Exclusive Assumptions and Conclusions ( $$\mathsf {DLEAC}$$ ), including classical logic as a particular case. In...     

On Blass Translation for Leśniewski’s Propositional Ontology and Modal Logics

Studia Logica - In this paper, we shall give another proof of the faithfulness of Blass translation (for short, B-translation) of the propositional fragment $$\mathbf{L}_1$$ of...     

A Canonical Model for Constant Domain Basic First-Order Logic

Studia Logica - I build a canonical model for constant domain basic first-order logic ( $$\textsf {BQL}_{\textsf {CD}}$$ ), the constant domain first-order extension of Visser’s basic...     

Confluence Proofs of Lambda-Mu-Calculi by Z Theorem

Studia Logica - This paper applies Dehornoy et al.’s Z theorem and its variant, called the compositional Z theorem, to prove confluence of Parigot’s $$\lambda \mu $$ -calculi extended...     

Estimating the Cognitive Diagnosis $$\varvec{Q}$$ Q Matrix with Expert Knowledge: Application to the Fraction-Subtraction Dataset

Psychometrika - Cognitive diagnosis models (CDMs) are an important psychometric framework for classifying students in terms of attribute and/or skill mastery. The $$\varvec{Q}$$ matrix, which...     

Wanting what’s not best

Philosophical Studies - In this paper, we propose a novel account of desire reports, i.e. sentences of the form $$\ulcorner$$ S wants p $$\urcorner$$ . Our theory is partly motivated by...