Related papers: An unexpected Boolean connective
The relationship between the properties of a dynamical system and the structure of its defining equations has long been studied in many contexts. Here we study this problem for the class of conjunctive (resp. disjunctive) Boolean networks,…
Sequential propositional logic deviates from ordinary propositional logic by taking into account that during the sequential evaluation of a propositional statement,atomic propositions may yield different Boolean values at repeated…
The prime purpose of this paper is to define the connectivity structure , on a set E, of any multiple relation defined on a family of sets indexed by E, such a relation expressing compatibility between the states of different systems (thus…
In this paper, we consider bounded width circuits and nondeterministic circuits in three somewhat new directions. In the first part of this paper, we mainly consider bounded width circuits. The main purpose of this part is to prove that…
This paper introduces a logical system, called BV, which extends multiplicative linear logic by a non-commutative self-dual logical operator. This extension is particularly challenging for the sequent calculus, and so far it is not achieved…
In this study, we explore the partial identification of nonseparable models with continuous endogenous and binary instrumental variables. We show that the structural function is partially identified when it is monotone or concave in the…
We show how the language of Krivine's classical realizability may be used to specify various forms of nondeterminism and relate them with properties of realizability models. More specifically, we introduce an abstract notion of…
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 classify all apartness relations definable in propositional logics extending intuitionistic logic using Heyting algebra semantics. We show that every Heyting algebra which contains a non-trivial apartness term satisfies the weak law of…
We use the theory of fully matricial, or non-commutative, functions to investigate infinite divisibility and limit theorems in operator-valued non-commutative probability. Our main result is an operator-valued analogue of the Bercovici-Pata…
We study the computational content of the Brouwer Fixed Point Theorem in the Weihrauch lattice. Connected choice is the operation that finds a point in a non-empty connected closed set given by negative information. One of our main results…
An algebraic structure with two constants and one ternary operation, which is not completely commutative, is put forward to accommodate ternary Boolean algebras. When the ternary operation is interpreted as Church's conditioned disjunction,…
A paradefinite logic is a logic that can serve as the underlying logic for theories that are inconsistent or incomplete. A well-known paradefinite logic is Belnap-Dunn logic. Various expansions of Belnap-Dunn logic have been studied in the…
This draft introduces the technical machinery of a semantic framework for potentialist truthmaking based on our innovation of intentic states, which are structured partial models accounting for our distinction between non-hypothetical and…
This paper presents the first in a series of results that allow us to develop a theory providing finer control over the complexity of normalisation, and in particular of cut elimination. By considering atoms as self-dual non-commutative…
We extend classical work by Janusz Czelakowski on the closure properties of the class of matrix models of entailment relations - nowadays more commonly called multiple-conclusion logics - to the setting of non-deterministic matrices…
An inductive logic can be formulated in which the elements are not propositions or probability distributions, but information systems. The logic is complete for information systems with binary hypotheses, i.e., it applies to all such…
In this paper, we study logics of dependence on the propositional level. We prove that several interesting propositional logics of dependence, including propositional dependence logic, propositional intuitionistic dependence logic as well…
In this paper a conditional logic is defined and studied. This conditional logic, DmBL, is constructed as a deterministic counterpart to the Bayesian conditional. The logic is unrestricted, so that any logical operations are allowed. A…
The recently introduced series of description logics under the common moniker DL-Lite has attracted attention of the description logic and semantic web communities due to the low computational complexity of inference, on the one hand, and…