English
Related papers

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

200 papers

We show that the finite satisfiability problem for the unary negation fragment with arbitrary number of transitive relations is decidable and 2-ExpTime-complete. Our result actually holds for a more general setting in which one can require…

Logic in Computer Science · Computer Science 2019-07-01 Daniel Danielski , Emanuel Kieronski

The usual reading of logical implication "A implies B" as "if A then B" fails in intuitionistic logic: there are formulas A and B such that "A implies B" is not provable, even though B is provable whenever A is provable. Intuitionistic…

Logic in Computer Science · Computer Science 2018-10-18 Andrea Condoluci , Matteo Manighetti

In this paper we generalise the notion of linearity (in the sense of Lawvere) to a category C equipped with a compatible sum structure and product structure. In this context, any morphism f from an n-fold sum to an n-fold product has a…

Category Theory · Mathematics 2026-05-01 Roy Ferguson , Zurab Janelidze

For a fixed finite solvable group $G$ and number field $K$, we prove an upper bound for the number of $G$-extensions $L/K$ with restricted local behavior (at infinitely many places) and ${\rm inv}(L/K)<X$ for a general invariant $"{\rm…

Number Theory · Mathematics 2019-12-13 Brandon Alberts

Fusions are a simple way of combining logics. For normal modal logics, fusions have been investigated in detail. In particular, it is known that, under certain conditions, decidability transfers from the component logics to their fusion.…

Artificial Intelligence · Computer Science 2011-06-10 F. Baader , C. Lutz , H. Sturm , F. Wolter

Unlike in classical modal logic, in non-classical modal logics the box and diamond operators frequently fail to be interdefinable. Instead, these logics impose some compatibility conditions which tie the box and diamond operators together…

Logic · Mathematics 2023-11-17 Adam Přenosil

Hybrid logic extends modal logic with support for reasoning about individual states, designated by so-called nominals. We study hybrid logic in the broad context of coalgebraic semantics, where Kripke frames are replaced with coalgebras for…

Logic in Computer Science · Computer Science 2010-02-03 Lutz Schroeder , Dirk Pattinson

A semantics for quantified modal logic is presented that is based on Kleene's notion of realizability. This semantics generalizes Flagg's 1985 construction of a model of a modal version of Church's Thesis and first-order arithmetic. While…

Logic · Mathematics 2016-04-13 Benjamin G. Rin , Sean Walsh

We study elementary modal logics, i.e. modal logic considered over first-order definable classes of frames. The classical semantics of modal logic allows infinite structures, but often practical applications require to restrict our…

Logic in Computer Science · Computer Science 2012-10-10 Jakub Michaliszyn , Jan Otop , Piotr Witkowski

The uniform one-dimensional fragment of first-order logic was introduced a few years ago as a generalization of the two-variable fragment of first-order logic to contexts involving relations of arity greater than two. Quantifiers in this…

Logic in Computer Science · Computer Science 2023-10-03 Emanuel Kieroński

Let ML(U^+) denote the fragment of modal logic extended with the universal modality in which the universal modality occurs only positively. We characterize the relative definability of ML(U^+) relative to finite transitive frames in the…

Logic · Mathematics 2018-02-23 Katsuhiko Sano , Jonni Virtema

Judgment aggregation studies how to combine individual judgments on logically related propositions into a collective judgment. Classical impossibility results show that sufficiently strong logical interconnections force dictatorship under…

Logic in Computer Science · Computer Science 2026-05-25 Yutaka Nagai , Hirotaka Ono

In all forms of the local Langlands program the abelian category of smooth representations of p-adic groups G in vector spaces over a field k plays a central role. Of particular interest are its finiteness properties. If the field k has…

Representation Theory · Mathematics 2026-03-27 Peter Schneider

Building on the correspondence between finitely axiomatised theories in {\L}ukasieiwcz logic and rational polyhedra, we prove that the unification type of the fragment of {\L}ukasiewicz logic with $n\geq 2$ variables is nullary. This solves…

Logic · Mathematics 2025-07-23 Marco Abbadini , Luca Spada

In this paper we prove: Theorem 1. Let $\mathcal{K}$ be an abstract elementary class which satisfies the joint embedding and amalgamation properties. Suppose $\lambda>\mu\geq LS(\mathcal{K})$ and $\theta$ is a limit ordinal $<\lambda^+$. If…

Logic · Mathematics 2015-12-31 Monica M. VanDieren

The multipullback quantization of complex projective spaces lacks the naive quantum CW-complex structure because the quantization of an embedding of the $n$-skeleton into the $(n+1)$-skeleton does not exist. To overcome this difficulty, we…

K-Theory and Homology · Mathematics 2022-01-03 Francesco D'Andrea , Piotr M. Hajac , Tomasz Maszczyk , Albert Sheu , Bartosz Zielinski

We generalize a recent result of Clausen: For a number field with integers O, we compute the K-theory of locally compact O-modules. For the rational integers this recovers Clausen's result as a special case. Our method of proof is quite…

K-Theory and Homology · Mathematics 2017-10-31 Oliver Braunling

We point out a gap in Shelah's proof of the following result: $\mathbf{Claim}$ Let $K$ be an abstract elementary class categorical in unboundedly many cardinals. Then there exists a cardinal $\lambda$ such that whenever $M, N \in K$ have…

Logic · Mathematics 2015-10-19 Will Boney , Sebastien Vasey

We give an alternative proof for H\"older regularity for weak solutions of nonlocal elliptic quasilinear equations modelled on the fractional p-Laplacian where we replace the discrete De Giorgi iteration on a sequence of concentric balls by…

Analysis of PDEs · Mathematics 2022-10-24 Karthik Adimurthi , Harsh Prasad , Vivek Tewary

Unbounded {\L}ukasiewicz logic is a substructural logic that combines features of infinite-valued {\L}ukasiewicz logic with those of abelian logic. The logic is finitely strongly complete w.r.t.~the additive $\ell$-group on the reals…

Logic · Mathematics 2026-05-28 Zuzana Haniková , Filip Jankovec
‹ Prev 1 4 5 6 7 8 10 Next ›