Related papers: Boolean Algebras and Logic
The regular open subsets of a topological space form a Boolean algebra, where the `join' of two regular open sets is the interior of the closure of their union. A `credence' is a finitely additive probability measure on this Boolean…
The overarching theme of the following pages is that mathematical logic -- centered around the incompleteness theorems -- is first and foremost an investigation of $\textit{computation}$, not arithmetic. Guided by this intuition we will…
Theory of representations of F-algebra is a natural development of the theory of F-algebra. Exploring of morphisms of the representation leads to the concepts of generating set and basis of representation. In the book I considered the…
A description of physical reality in which wholeness is the foundation is discussed along with the motivation for such an attempt. As a possible mathematical framework within which a physical theory based on wholeness may be expressed,…
We show the equivalence between two notions of log moduli stacks which appear in literatures. In particular, we generalize M.Olsson's theorem of representation of log algebraic stacks and answer a question posted by him (\cite{Ol4} 3.5.3).…
Expectation is a central notion in probability theory. The notion of expectation also makes sense for other notions of uncertainty. We introduce a propositional logic for reasoning about expectation, where the semantics depends on the…
We investigate the orthoalgebras of certain non-Boolean models which have a classical realization. Our particular concern will be the partition logics arising from the investigation of the empirical propositional structure of Moore and…
The lower and upper bound of any given algorithm is one of the most crucial pieces of information needed when evaluating the computational effectiveness for said algorithm. Here a novel method of Boolean Algebraic Programming for symbolic…
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…
We propose a graph-based extension of Boolean logic called Boolean Graph Logic (BGL). Construing formula trees as the cotrees of cographs, we may state semantic notions such as evaluation and entailment in purely graph-theoretic terms,…
Given a complete Heyting algebra we construct an algebraic tensor triangulated category whose Bousfield lattice is the Booleanization of the given Heyting algebra. As a consequence we deduce that any complete Boolean algebra is the…
This article fits in the area of research that investigates the application of topological duality methods to problems that appear in theoretical computer science. One of the eventual goals of this approach is to derive results in…
In this article we present and describe a notion of "logical perfection". We extract the notion of "perfection" from the contemporary logical concept of categoricity. Categoricity (in power) has become in the past half century a main driver…
Effectus theory is a new branch of categorical logic that aims to capture the essentials of quantum logic, with probabilistic and Boolean logic as special cases. Predicates in effectus theory are not subobjects having a Heyting algebra…
This article discusses completeness of Boolean Algebra as First Order Theory in Goedel's meaning. If Theory is complete then any possible transformation is equivalent to some transformation using axioms, predicates etc. defined for this…
We study a well-known technique of using absoluteness for giving choice-free proofs to some statements which are known to be provable with the axiom of choice. The idea is to reduce the problem to an inner model where the axiom of choice…
In this paper we investigate two logics from an algebraic point of view. The two logics are: MALL (multiplicative-additive Linear Logic) and LL (classical Linear Logic). Both logics turn out to be strongly algebraizable in the sense of Blok…
This paper proposes a new category theoretic account of equationally axiomatizable classes of algebras. Our approach is well-suited for the treatment of algebras equipped with additional computationally relevant structure, such as ordered…
The aim of the paper is to establish a certain logic corresponding to lattice effect algebras. First, we answer a natural question whether a lattice effect algebra can be represented by means of a groupoid-like structure. We establish a…
We introduce a logic for reasoning about evidence, that essentially views evidence as a function from prior beliefs (before making an observation) to posterior beliefs (after making the observation). We provide a sound and complete…