English
Related papers

Related papers: Blending margins: The modal logic K has nullary un…

200 papers

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

Non-classical negations may fail to be contradictory-forming operators in more than one way, and they often fail also to respect fundamental meta-logical properties such as the replacement property. Such drawbacks are witnessed by intricate…

Logic in Computer Science · Computer Science 2017-07-26 Ori Lahav , João Marcos , Yoni Zohar

We investigate non-wellfounded proof systems based on parsimonious logic, a weaker variant of linear logic where the exponential modality ! is interpreted as a constructor for streams over finite data. Logical consistency is maintained at a…

Logic in Computer Science · Computer Science 2025-09-03 Matteo Acclavio , Gianluca Curzi , Giulio Guerrieri

An almost K\"ahler structure is {\it extremal} if the Hermitian scalar curvature is a Killing potential [29]. When the almost complex structure is integrable it coincides with extremal K\"ahler metric in the sense of Calabi [8]. We observe…

Differential Geometry · Mathematics 2018-11-15 Eveline Legendre

We prove a topological completeness theorem for the modal logic GLP containing operators $\langle\lambda\rangle$ for $\lambda \in$ Ord intended to capture progressively stronger notions of consistency in mathematical theories. We show that,…

Logic · Mathematics 2019-05-07 Juan P. Aguilera

In this paper, we introduce two focussed sequent calculi, LKp(T) and LK+(T), that are based on Miller-Liang's LKF system for polarised classical logic. The novelty is that those sequent calculi integrate the possibility to call a decision…

Logic in Computer Science · Computer Science 2013-09-18 Mahfuza Farooque , Stéphane Graham-Lengrand

P-algebras are a non-commutative, non-associative generalization of Boolean algebras that are for quantum logic what Boolean algebras are for classical logic. P-algebras have type <X, 0, ', .> where 0 is a constant, ' is unary and . is…

Quantum Physics · Physics 2024-08-16 Daniel Lehmann

In this article we show that hybrid type-logical grammars are a fragment of first-order linear logic. This embedding result has several important consequences: it not only provides a simple new proof theory for the calculus, thereby…

Logic in Computer Science · Computer Science 2014-05-27 Richard Moot

Let $p$ be a rational prime, let $F$ denote a finite, unramified extension of $\mathbb{Q}_p$, $K$ the maximal unramified extension of $\mathbb{Q}_p$, $\overline{K}$ some fixed algebraic closure of $K$, and $\mathbb{C}_p$ the completion of…

Number Theory · Mathematics 2022-04-27 Adrian Iovita , Jackson S. Morrow , Alexandru Zaharescu

We construct explicit Drinfel'd twists of Jordanian type for the generalized Cartan type K Lie algebras in characteristic 0 and obtain the corresponding quantizations, especially their integral forms. By making modular reductions including…

Quantum Algebra · Mathematics 2015-12-22 Zhaojia Tong , Naihong Hu

Binary classifiers are traditionally studied by propositional logic (PL). PL can only represent them as white boxes, under the assumption that the underlying Boolean function is fully known. Binary classifiers used in practical applications…

Logic in Computer Science · Computer Science 2024-03-04 Xinghan Liu , Emiliano Lorini

We can measure the complexity of a logical formula by counting the number of alternations between existential and universal quantifiers. Suppose that an elementary first-order formula $\varphi$ (in $\mathcal{L}_{\omega,\omega}$) is…

Logic · Mathematics 2025-02-05 Matthew Harrison-Trainor , Miles Kretschmer

The aim of this article is to generalize logics of formal inconsistency ($\textbf{LFI}$s) to systems dealing with the concept of incompatibility, expressed by means of a binary connective. The basic idea is that having two incompatible…

Logic · Mathematics 2022-02-23 Marcelo Esteban Coniglio , Guilherme Vicentin de Toledo

P\l onka sums consist of a general construction that provides structural description for algebras in regularized varieties, whose examples range from Clifford semigroups to many algebras of logic including involutive bisemilattices, Bochvar…

Logic · Mathematics 2026-02-09 S. Bonzio , G. Zecchini

The paper is devoted to modal properties of the ternary strict betweenness relation as used in the development of various systems of geometry. We show that such a relation is non-definable in a basic similarity type with a binary operator…

Logic · Mathematics 2024-10-29 Rafał Gruszczyński , Zhiguang Zhao

We introduce k-quantifier logics -- logics with access to k-tuples of elements and very general quantification patterns for transitions between k-tuples. The framework is very expressive and encompasses e.g. the k-variable fragments of…

Logic · Mathematics 2026-02-03 Janek Härtter , Martin Otto

In this paper we prove the following theorem. Let L/\Q_p be a finite extension with ring of integers O_L and maximal ideal lambda. Theorem 1. Suppose that p >= 5. Suppose also that \rho:G_\Q -> GL_2(O_L) is a continuous representation…

Number Theory · Mathematics 2016-09-07 Kevin Buzzard , Richard Taylor

Let G be a locally compact group, and let 1 < p < \infty. In this paper we investigate the injectivity of the left L^1(G)-module L^p(G). We define a family of amenability type conditions called (p,q)-amenability, for any 1 <= p <= q. For a…

Functional Analysis · Mathematics 2009-09-29 Paul Ramsden

We give a purely syntactical proof of the fixed point theorem for Sacchetti's modal logics ${\bf K} + \Box(\Box^n p \to p) \to \Box p$ ($n \geq 2$) of provability. From our proof, an effective procedure for constructing fixed points in…

Logic · Mathematics 2021-09-14 Taishi Kurahashi , Yuya Okawa

We prove matching direct and inverse theorems for uniform polynomial approximation with $A^*$ weights (a subclass of doubling weights suitable for approximation in the $L_\infty$ norm) having finitely many zeros and not too "rapidly…

Classical Analysis and ODEs · Mathematics 2015-10-27 Kirill A. Kopotun
‹ Prev 1 3 4 5 6 7 10 Next ›