Related papers: Bimodal logics with a `weakly connected' component…

We prove that the bisimulation-invariant fragment of weak monadic second-order logic (WMSO) is equivalent to the fragment of the modal $\mu$-calculus where the application of the least fixpoint operator $\mu p.\varphi$ is restricted to…

Propositional term modal logic is interpreted over Kripke structures with unboundedly many accessibility relations and hence the syntax admits variables indexing modalities and quantification over them. This logic is undecidable, and we…

We study new relations of the following statements with weak choice principles in ZF and ZFA. 1. There does not exist an infinite Hausdorff space X such that every infinite subset of X contains an infinite compact subset. 2. If a field has…

The first-order theory of MALL (multiplicative, additive linear logic) over only equalities is an interesting but weak logic since it cannot capture unbounded (infinite) behavior. Instead of accounting for unbounded behavior via the…

While modal extensions of decidable fragments of first-order logic are usually undecidable, their monodic counterparts, in which formulas in the scope of modal operators have at most one free variable, are typically decidable. This only…

This paper initially aimed at proposing a proof that quasi-dense logics have f.m.p, but it contains a major flaw, unfixable.

Calder\'on-Zygmund operators with noncommuting kernels may fail to be Lp-bounded for $p \neq 2$, even for kernels with good size and smoothness properties. Matrix-valued paraproducts, Fourier multipliers on group vNa's or noncommutative…

This article presents three characterizations of the weak factorization systems on finitely complete categories that interpret intensional dependent type theory with Sigma-, Pi-, and Id-types. The first characterization is that the weak…

The continuous modal mu-calculus is a fragment of the modal mu-calculus, where the application of fixpoint operators is restricted to formulas whose functional interpretation is Scott-continuous, rather than merely monotone. By…

We prove several sharp weighted norm inequalities for commutators of classical operators in harmonic analysis. We find sufficient $A_p$-bump conditions on pairs of weights $(u,v)$ such that $[b,T]$, $b\in BMO$ and $T$ a singular integral…

A condition, in two variants, is given such that if a property P satisfies this condition, then every logic which is at least as strong as first-order logic and can express P fails to have the compactness property. The result is used to…

For (finitary) deductive systems, we formulate a signature-independent abstraction of the \emph{weak excluded middle law} (WEML), which strengthens the existing general notion of an inconsistency lemma (IL). Of special interest is the case…

It has been shown in the late 1960s that each formula of first-order logic without constants and function symbols obeys a zero-one law: As the number of elements of finite models increases, every formula holds either in almost all or in…

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…

We study mixed weak type inequalities for the commutator $[b,T]$, where $b$ is a BMO function and $T$ is a Calder\'on-Zygmund operator. More precisely, we prove that for every $t>0$ \begin{equation*}%\label{tesis_teo2.2} uv(\{x\in\R^n:…

A triple of finite von Neumann algebras $B\subseteq N\subseteq M$ is said to have the relative weak asymptotic homomorphism property if there exists a net of unitary operators $\{u_{\lambda}\}_{\lambda\in \Lambda}$ in $B$ such that…

Functorial semi-norms are semi-normed refinements of functors such as singular (co)homology. We investigate how different types of representability affect the (non-)triviality of finite functorial semi-norms on certain functors or classes.…

We describe a general construction of finiteness spaces which subsumes the interpretations of all positive connectors of linear logic. We then show how to apply this construction to prove the existence of least fixpoints for particular…

Reversible systems feature both forward computations and backward computations, where the latter undo the effects of the former in a causally consistent manner. The compositionality properties and equational characterizations of strong and…

We study multimodal logics over universally first-order definable classes of frames. We show that even for bimodal logics, there are universal Horn formulas that define set of frames such that the satisfiability problem is undecidable, even…