Related papers: On propositional logic semirings
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…
Binary semirings such as the tropical, log, and probability semirings form a core algebraic tool in classical and modern neural inference systems, supporting tasks like Viterbi decoding, dynamic programming, and probabilistic reasoning.…
Lawvere showed that generalised metric spaces are categories enriched over $[0, \infty]$, the quantale of the positive extended reals. The statement of enrichment is a quantitative analogue of being a preorder. Towards seeking a logic for…
Theorem proving is a fundamental aspect of mathematics, spanning from informal reasoning in natural language to rigorous derivations in formal systems. In recent years, the advancement of deep learning, especially the emergence of large…
Sub-sub-intuitionistic logic is obtained from intuitionistic logic by weakening the implication and removing distributivity. It can alternatively be viewed as conditional weak positive logic. We provide semantics for sub-sub-intuitionistic…
Argumentation is a non-monotonic process. This reflects the fact that argumentation involves uncertain information, and so new information can cause a change in the conclusions drawn. However, the base logic does not need to be…
We give an introduction to logic tailored for algebraists, explaining how proofs in linear logic can be viewed as algorithms for constructing morphisms in symmetric closed monoidal categories with additional structure. This is made explicit…
In this short note we give an alternative proof of Glivenko's Theorem, stating that a formula $\phi$ is provable in classical propositional logic if and only if $\neg\neg\phi$ is provable in intuitionistic propositional logic. We work in…
Algebras of Logic deal with some algebraic structures, often bounded lattices, considered as models of certain logics, including logic as a domain of order theory. There are well known their importance and applications in social life to…
Rule-based reasoning is an essential part of human intelligence prominently formalized in artificial intelligence research via logic programs. Describing complex objects as the composition of elementary ones is a common strategy in computer…
The fundamental theorem of symmetric polynomials over rings is a classical result which states that every unital commutative ring is fully elementary, i.e. we can express symmetric polynomials with elementary ones in a unique way. The…
Quantum logic aims to capture essential quantum mechanical structure in order-theoretic terms. The Achilles' heel of quantum logic is the absence of a canonical description of composite systems, given descriptions of their components. We…
This paper presents a substructural logic of sequents with very restricted exchange and weakening rules. It is sound with respect to sequences of measurements of a quantic system. A sound and complete semantics is provided. The semantic…
It is shown that propositional intuitionistic logic is the maximal (with respect to expressive power) abstract logic satisfying a certain topological property reminiscent of compactness, the Tarski union property and preservation under…
Our goal is to define an algebraic language for reasoning about non-deterministic computations. Towards this goal, we introduce an algebra of string-to-string transductions. Specifically, it is an algebra of partial functions on words over…
Standard approaches to probabilistic reasoning require that one possesses an explicit model of the distribution in question. But, the empirical learning of models of probability distributions from partial observations is a problem for which…
In this paper we show several similarities among logic systems that deal simultaneously with deductive and quantitative inference. We claim it is appropriate to call the tasks those systems perform as Quantitative Logic Reasoning. Analogous…
Models of complex systems are widely used in the physical and social sciences, and the concept of layering, typically building upon graph-theoretic structure, is a common feature. We describe an intuitionistic substructural logic called…
Rule-based reasoning, a fundamental type of legal reasoning, enables us to draw conclusions by accurately applying a rule to a set of facts. We explore causal language models as rule-based reasoners, specifically with respect to…
We present a systematic approach to logical predicates based on universal coalgebra and higher-order abstract GSOS, thus making a first step towards a unifying theory of logical relations. We first observe that logical predicates are…