相关论文: The $\Sigma_1$-Provability Logic of HA*

In 1933, G\"odel introduced a provability interpretation of the propositional intuitionistic logic to establish a formalization for the BHK interpretation. He used the modal system, $\mathbf{S4}$, as a formalization of the intuitive concept…

Choose a topos $E$. There are several different "notions of sheafness" on $E$. How do we visualize them? Let's refer to the classifier object of $E$ as $\Omega$, and to its Heyting Algebra of truth-values, $Sub(1_E)$, as $H$; we will…

Heyting-Lewis Logic is the extension of intuitionistic propositional logic with a strict implication connective that satisfies the constructive counterparts of axioms for strict implication provable in classical modal logics. Variants of…

The relationship between Heyting algebras (HA) and semirings is explored. A new class of HAs called Symmetric Heyting algebras (SHAs) is proposed, and a necessary condition on SHAs to be consider semirings is given. We define a new…

For any partial combinatory algebra (PCA for short) A, the class of A-representable partial functions from N to A quotiented by the filter of cofinite sets of N, is a PCA such that the representable partial functions are exactly the…

The article explores the arithmetic of multiplication as a model of many valued projective logic. It is demonstrated that closed numerical intervals within this framework constitute Heyting algebras. The conditions for these algebras to be…

Following Birkhoff and von Neumann, quantum logic has traditionally been based on the lattice of closed linear subspaces of some Hilbert space, or, more generally, on the lattice of projections in a von Neumann algebra A. Unfortunately, the…

ProbLog is a popular probabilistic logic programming language/tool, widely used for applications requiring to deal with inherent uncertainties in structured domains. In this paper we study connections between ProbLog and a variant of…

The collection of open sets of a topological space forms a Heyting algebra, which leads to the idea of a Heyting algebra as a generalized topological space. In fact, a sober topological space may be reconstructed from its locale of open…

Let $n \geq 1$ and assume that there is a Woodin cardinal. For $x \in \mathbb{R}$ let $\alpha_x$ be the least $\beta$ such that \[ L_\beta [x] \models \Sigma_n \text{-KP} + \exists \kappa (``\kappa \text{ is inaccessible and }\kappa^+…

The symmetric homology of a unital associative algebra $A$ over a commutative ground ring $k$, denoted $HS_*(A)$, is defined using derived functors and the symmetric bar construction of Fiedorowicz. In this paper we show that $HS_*(A)$…

Game semantics and winning strategies offer a potential conceptual bridge between semantics and proof systems of logics. We illustrate this link for hybrid logic -- an extension of modal logic that allows for explicit reference to worlds…

The codomain category of a generalized homology theory is the category of modules over a ring. For an abelian category A, an A-valued (generalized) homology theory is defined by formally replacing the category of modules with the category…

Possibilistic logic, an extension of first-order logic, deals with uncertainty that can be estimated in terms of possibility and necessity measures. Syntactically, this means that a first-order formula is equipped with a possibility degree…

The provability logic of a theory $T$ captures the structural behavior of formalized provability in $T$ as provable in $T$ itself. Like provability, one can formalize the notion of relative interpretability giving rise to interpretability…

In this paper, we develop a quantified propositional proof systems that corresponds to logarithmic-space reasoning. We begin by defining a class SigmaCNF(2) of quantified formulas that can be evaluated in log space. Then our new proof…

Let $A$ be a $C^*$-algebra acting on a Hilbert space $H$, $\sigma:A\to B(H)$ be a linear mapping and $d:A\to B(H)$ be a $\sigma$-derivation. Generalizing the celebrated theorem of Sakai, we prove that if $\sigma$ is a continuous $*$-mapping…

The logic of hereditary Harrop formulas (HH) has proven useful for specifying a wide range of formal systems. This logic includes a form of hypothetical judgment that leads to dynamically changing sets of assumptions and that is key to…

The multiplicative theory of a set of numbers (which could be natural, integer, rational, real or complex numbers) is the first-order theory of the structure of that set with (solely) the multiplication operation (that set is taken to be…

A semantics is given to possibilistic logic, a logic that handles weighted classical logic formulae, and where weights are interpreted as lower bounds on degrees of certainty or possibility, in the sense of Zadeh's possibility theory. The…