We give an elementary proof (in the sense that it is formalizable in Peano arithmetic) of the strong normalization of the atomic polymorphic calculus Fₐₜ (a predicative restriction of Girard’s system F).

We provide simple algebraic proofs of two important facts, due to Zakharyaschev and Esakia, about Grzegorczyk algebras.

This is a spin-off paper to [3, 4] in which we carried out an extensive analysis of Andrzej Grzegorczyk’s point-free topology from [5]. In [1] Loredana Biacino and Giangiacomo Gerla presented an axiomatization which was ...

One of the logic defined by Richard Epstein in a context of an analysis of subject matter relationship is Symmetric Relatedness Logic S. In the monograph [2] we can find some open problems concerning relatedness logic, a ...

This article is a continuation of our promenade along the winding roads of identity, equality, nameability and completeness. We continue looking for a place where all these concepts converge. We assume that identity is a ...

The paper introduces the concept of B-Almost distributive fuzzy lattice (BADFL) in terms of its principal ideal fuzzy lattice. Necessary and sufficient conditions for an ADFL to become a B-ADFL are investigated. We also ...

We prove that there is infinitely many tabular modal logics extending KB.Alt(2) which have interpolation.

Progress in the medical diagnostic is relentlessly pushing the measurement technology as well with its intertwined mathematical models and solutions. Mathematics has applications to many problems that are vital to human ...

The logic BN4 can be considered as the 4-valued logic of the relevant conditional and the logic E4, as the 4-valued logic of (relevant) entailment. The aim of this paper is to endow E4 with a 2-set-up Routley-Meyer semantics. ...

Babenyshev and Martins proved that two hidden multi-sorted deductive systems are deductively equivalent if and only if there exists an isomorphism between their corresponding lattices of theories that commutes with ...