Related papers: The logic with unsharp implication and negation
We involve a certain propositional logic based on ortholattices. We characterize the implicational reduct of such a logic and we show that its algebraic counterpart is the so-called orthosemilattice. Properties of congruences and congruence…
Propositional logics in general, considered as a set of sentences, can be undecidable even if they have "nice" representations, e.g., are given by a calculus. Even decidable propositional logics can be computationally complex (e.g., already…
We devise exact conditions under which a join semilattice with a weak contact relation can be semilattice embedded into a Boolean algebra with an overlap contact relation, equivalently, into a distributive lattice with additive contact…
We characterise non-distributive positive logic as the fragment of a single-sorted first-order language that is preserved by a new notion of simulation called a meet-simulation. Meet-simulations distinguish themselves from simulations…
We prove that the Weihrauch lattice can be transformed into a Brouwer algebra by the consecutive application of two closure operators in the appropriate order: first completion and then parallelization. The closure operator of completion is…
This piece threads substructurality and modality into a negation that activates the downside of equivalence and identity in a fibrational framework. The piece is a working through of negation and contradiction as type-theoretic/categorial…
This paper studies properties of the logic BV, which is an extension of multiplicative linear logic (MLL) with a self-dual non-commutative operator. BV is presented in the calculus of structures, a proof theoretic formalism that supports…
When a physicist performs a quantic measurement, new information about the system at hand is gathered. This paper studies the logical properties of how this new information is combined with previous information. It presents Quantum Logic as…
We study the lattice of extensions of four-valued Belnap--Dunn logic, called super-Belnap logics by analogy with superintuitionistic logics. We describe the global structure of this lattice by splitting it into several subintervals, and…
It is standard to regard the intuitionistic restriction of a classical logic as increasing the expressivity of the logic because the classical logic can be adequately represented in the intuitionistic logic by double-negation, while the…
Concept Bottleneck Models (CBMs) provide a basis for semantic abstractions within a neural network architecture. Such models have primarily been seen through the lens of interpretability so far, wherein they offer transparency by inferring…
The implication relationship between subsystems in Reverse Mathematics has an underlying logic, which can be used to deduce certain new Reverse Mathematics results from existing ones in a routine way. We use techniques of modal logic to…
In this paper, we introduce a novel team semantics of LTL inspired by inquisitive logic. The main features of the resulting logic, we call InqLTL, are the intuitionistic interpretation of implication and the Boolean semantics of…
The paper gives a soundness and completeness proof for the implicative fragment of intuitionistic calculus with respect to the semantics of computability logic, which understands intuitionistic implication as interactive algorithmic…
Deep inference is a proof theoretic methodology that generalizes the standard notion of inference of the sequent calculus, whereby inference rules become applicable at any depth inside logical expressions. Deep inference provides more…
A Rough semiring $(T,\Delta,\nabla)$ is considered to describe a special distributive Rough semiring known as a Rough bi-Heyting algebra. A bi-Heyting algebra is an extension of boolean algebra and it is accomplished by weaker notion of…
I explore the relationships between Prawitz's approach to non-monotonic proof-theoretic validity, which I call reducibility semantics, and some later proof-theoretic approaches, which I call standard base semantics and Sandqvist's base…
We explore a proof language for intuitionistic multiplicative additive linear logic, incorporating the sup connective that introduces additive pairs with a probabilistic elimination, and sum and scalar products within the proof-terms. We…
With help of a compact Prolog-based theorem prover for Intuitionistic Propositional Logic, we synthesize minimal assumptions under which a given formula formula becomes a theorem. After applying our synthesis algorithm to cover basic…
We present a system of relational syllogistic, based on classical propositional logic, having primitives of the following form: Some A are R-related to some B; Some A are R-related to all B; All A are R-related to some B; All A are…