English
Related papers

Related papers: The Logics of Individual Medvedev Frames

200 papers

We give Hennessy-Milner classes for intuitionistic, dual-intuitionistic and bi-intuitionistic logic interpreted in intuitionistic Kripke models, and generalise these results to modal (dual- and bi-)intuitionistic logics. Our main technical…

Logic · Mathematics 2021-05-06 Jim de Groot , Dirk Pattinson

Epistemic logics are a primary formalism for multi-agent systems but major reasoning tasks in such epistemic logics are intractable, which impedes applications of multi-agent epistemic logics in automatic planning. Knowledge compilation…

Artificial Intelligence · Computer Science 2018-06-29 Liangda Fang , Kewen Wang , Zhe Wang , Ximing Wen

We extend the main result of (G. Badia and G. Olkhovikov. A Lindstr\"om theorem for intuitionistic propositional logic. Notre Dame Journal of Formal Logic, 61 (1): 11--30 (2020)) to the first-order intuitionistic logic (with and without…

Logic · Mathematics 2021-04-01 Grigory Olkhovikov , Guillermo Badia , Reihane Zoghifard

In this paper, we obtain a non-abelian analogue of Lubkin's embedding theorem for abelian categories. Our theorem faithfully embeds any small regular Mal'tsev category $\mathbb{C}$ in an $n$-th power of a particular locally finitely…

Category Theory · Mathematics 2017-10-10 Pierre-Alain Jacqmin

We introduce a hierarchy of degree structures between the Medvedev and Muchnik lattices which allow varying amounts of non-uniformity. We use these structures to introduce the notion of the uniformity of a Muchnik reduction, which expresses…

Logic · Mathematics 2019-09-18 Rutger Kuyper

The bulk-boundary and a new bulk-defect correspondence principles are formulated using groupoid algebras. The new strategy relies on the observation that the groupoids of lattices with boundaries or defects display spaces of units with…

Operator Algebras · Mathematics 2021-09-24 Emil Prodan

We present a logic for reasoning with if-then formulas which involve constants for rational truth degrees from the unit interval. We introduce graded semantic and syntactic entailment of formulas. We prove the logic is complete in Pavelka…

Logic in Computer Science · Computer Science 2015-02-26 Vilem Vychodil

In this work, the concept of mutually unbiased frames is introduced as the most general notion of unbiasedness for sets composed by linearly independent and normalized vectors. It encompasses the already existing notions of unbiasedness for…

Quantum Physics · Physics 2022-11-09 F. Caro Perez , V. Gonzalez Avella , D. Goyeneche

This paper introduces Logical Credal Networks, an expressive probabilistic logic that generalizes many prior models that combine logic and probability. Given imprecise information represented by probability bounds and conditional…

Artificial Intelligence · Computer Science 2021-09-28 Haifeng Qian , Radu Marinescu , Alexander Gray , Debarun Bhattacharjya , Francisco Barahona , Tian Gao , Ryan Riegel , Pravinda Sahu

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…

Logic · Mathematics 2020-11-11 Guillermo Badia , Grigory Olkhovikov

We propose a novel logic, called Frame Logic (FL), that extends first-order logic (with recursive definitions) using a construct Sp(.) that captures the implicit supports of formulas -- the precise subset of the universe upon which their…

Logic in Computer Science · Computer Science 2022-09-27 Adithya Murali , Lucas Peña , Christof Löding , P. Madhusudan

The aim of this article is to better understand the correspondence between $n$-cubic extensions and $3^n$-diagrams, which may be seen as non-abelian Yoneda extensions, useful in (co)homology of non-abelian algebraic structures. We study a…

Category Theory · Mathematics 2018-07-10 Cyrille Sandry Simeu , Tim Van der Linden

We extend a well-known theorem of Murski\v{\i} to the probability space of finite models of a system $\mathcal{M}$ of identities of a strong idempotent linear Maltsev condition. We characterize the models of $\mathcal{M}$ in a way that can…

Logic · Mathematics 2019-01-21 Clifford Bergman , Agnes Szendrei

We consider logics derived from Euclidean spaces $\mathbb{R}^n$. Each Euclidean space carries relations consisting of those pairs that are, respectively, distance more than 1 apart, distance less than 1 apart, and distance 1 apart. Each…

We define a family of intuitionistic non-normal modal logics; they can bee seen as intuitionistic counterparts of classical ones. We first consider monomodal logics, which contain only one between Necessity and Possibility. We then consider…

Logic in Computer Science · Computer Science 2019-01-30 Tiziano Dalmonte , Charles Grellois , Nicola Olivetti

Kandinsky Figures and Kandinsky Patterns are mathematically describable, simple self-contained hence controllable test data sets for the development, validation and training of explainability in artificial intelligence. Whilst Kandinsky…

Artificial Intelligence · Computer Science 2021-06-11 Heimo Mueller , Andreas Holzinger

The L'vov-Kaplansky conjecture states that the image of a multilinear noncommutative polynomial $f$ in the matrix algebra $M_n(K)$ is a vector space for every $n \in {\mathbb N}$. We prove this conjecture for the case where $f$ has degree…

Rings and Algebras · Mathematics 2026-01-01 Daniel Vitas

Combining the properties of monovariate internal functions as proposed in Kolmogorov superimposition theorem, in tandem with the bounds wielded by the multivariate formulation of Chebyshev inequality, a hybrid model is presented, that…

Computer Vision and Pattern Recognition · Computer Science 2011-06-03 Shriprakash Sinha , Gert J. ter Horst

We prove upper bounds for the number of rational points on non-singular cubic curves defined over the rationals. The bounds are uniform in the curve and involve the rank of the corresponding Jacobian. The method used in the proof is a…

Number Theory · Mathematics 2009-09-24 D. R. Heath-Brown , D. Testa

Many deep, mysterious connections have been observed between collections of mutually unbiased bases (MUBs) and combinatorial designs called $k$-nets (and in particular, between complete collections of MUBs and finite affine - or…

Mathematical Physics · Physics 2019-07-05 Sloan Nietert , Zsombor Szilágyi , Mihály Weiner
‹ Prev 1 3 4 5 6 7 10 Next ›