Related papers: Deciding dependence in logic and algebra
In functional programming, datatypes a la carte provide a convenient modular representation of recursive datatypes, based on their initial algebra semantics. Unfortunately it is highly challenging to implement this technique in proof…
There is a polymodal provability logic $GLP$. We consider generalizations of this logic: the logics $GLP_{\alpha}$, where $\alpha$ ranges over linear ordered sets and play the role of the set of indexes of modalities. We consider the…
Deduction is the one of the major forms of inferences and commonly used in formal logic. This kind of inference has the feature of monotonicity, which can be problematic. There are different types of inferences that are not monotonic, e.g.…
Based on an analysis of the inference rules used, we provide a characterization of the situations in which classical provability entails intuitionistic provability. We then examine the relationship of these derivability notions to uniform…
The computational properties of modal and propositional dependence logics have been extensively studied over the past few years, starting from a result by Sevenster showing NEXPTIME-completeness of the satisfiability problem for modal…
This work explores the deformation theory of algebraic structures in a very general setting. These structures include commutative, associative algebras, Lie algebras, and the infinity versions of these structures, the strongly homotopy…
Propositional logic serves as a fundamental cornerstone in mathematical logic. This paper delves into a semiring characterization of propositional logic, employing the Gr\"oebner-Shirshov basis theory to furnish an algebraic framework for…
Modern logics of dependence and independence are based on team semantics, which means that formulae are evaluated not on a single assignment of values to variables, but on a set of such assignments, called a team. This leads to high…
We extend Kolchin's results on linear dependence over projective varieties in the constants, to linear dependence over arbitrary complete differential varieties. We show that in this more general setting, the notion of linear dependence…
We generalize and unify the proofs of several results on algebraic in- dependence of arithmetic functions and Dirichlet series by a theorem of Ax on differential Schanuel conjecture. Along the way, we find counter-examples to some results…
MV-algebras are an algebraic semantics for Lukasiewicz logic and MV-algebras generated by a finite chain are Heyting algebras where the Godel implication can be written in terms of De Morgan and Moisil's modal operators. In our work, a…
We propose an extension of Poole's independent choice logic based on a relaxation of the underlying independence assumptions. A credal semantics involving multiple joint probability mass functions over the possible worlds is adopted. This…
Categorial type logics, pioneered by Lambek, seek a proof-theoretic understanding of natural language syntax by identifying categories with formulas and derivations with proofs. We typically observe an intuitionistic bias: a structural…
Probability theory as extended logic is completed such that essentially any probability may be determined. This is done by considering propositional logic (as opposed to predicate logic) as syntactically suffcient and imposing a symmetry…
In this paper, we axiomatize the negatable consequences in dependence and independence logic by extending the systems of natural deduction of the logics given in (Kontinen and Vaananen 2013) and (Hannula 2015). We prove a characterization…
In this thesis (modal) dependence logic is investigated. It was introduced in 2007 by Jouko V\"a\"aan\"anen as an extension of first-order (resp. modal) logic by the dependence operator =(). For first-order (resp. propositional) variables…
We prove that the form of conditional independence at play in database theory and independence logic is reducible to the first-order dividing calculus in the theory of atomless Boolean algebras. This establishes interesting connections…
We present some new methods for logical deduction, based on ideas from ground theory. Roughly speaking, in our calculi a typical deduction will proceed as follows: we first analyse the premiss down to its ultimate grounds; then we discard…
We examine the interplay between projectivity (in the sense that was introduced by S.~Ghilardi) and uniform post-interpolant for the classical and intuitionistic propositional logic. More precisely, we explore whether a projective…
This paper presents preliminary work on a general system for integrating dependent types into substructural type systems such as linear logic and linear type theory. Prior work on this front has generally managed to deliver type systems…