Related papers: Deducibility in the full Lambek calculus with weak…

We study the relative complexity of equivalence relations and preorders from computability theory and complexity theory. Given binary relations $R, S$, a componentwise reducibility is defined by $ R\le S \iff \ex f \, \forall x, y \, [xRy…

We study local consequence relations in modal extensions of product logic over Kripke models with either valued (fuzzy) or crisp accessibility relations. In both settings, we consider semantics over the full class of product algebras as…

In this paper we study homological properties of modules over an affine Hecke algebra H. In particular we prove a comparison result for higher extensions of tempered modules when passing to the Schwartz algebra S, a certain topological…

We show that it is consistent relative to a weakly compact cardinal that strong homology is additive and compactly supported within the class of locally compact separable metric spaces. This complements work of Marde\v{s}i\'{c} and Prasolov…

We examine cyclic, non-well-founded and well-founded derivations in the provability logic $\mathsf{GLP}$. While allowing cyclic derivations does not change the system, the non-well-founded and well-founded derivations we consider define the…

If V is a finitely generated variety such that the first-order theory of the finite members of V is decidable, we show that V is residually finite, and in fact has a finite bound on the sizes of subdirectly irreducible algebras. This result…

We study formal languages which are capable of fully expressing quantitative probabilistic reasoning and do-calculus reasoning for causal effects, from a computational complexity perspective. We focus on satisfiability problems whose…

In this work we establish a version of the Bartnik Splitting Conjecture in the context of Lorentzian length spaces. In precise terms, we show that under an appropriate timelike completeness condition, a globally hyperbolic Lorentzian length…

Graded Hecke algebras can be constructed in terms of equivariant cohomology and constructible sheaves on nilpotent cones. In earlier work, their standard modules and their irreducible modules where realized with such geometric methods. We…

The preferential conditional logic PCL, introduced by Burgess, and its extensions are studied. First, a natural semantics based on neighbourhood models, which generalise Lewis' sphere models for counterfactual logics, is proposed. Soundness…

In this preprint we prove that any finite slope modular form fits into a p-adic family of modular forms which is indexed by the weight. Here, the term p-adic family means that p-adic congruences between weights entail certain p-adic…

We revisit the old work of de Paiva on the models of the Lambek Calculus in dialectica models making sure that the syntactic details that were sketchy on the first version got completed and verified. We extend the Lambek Calculus with a…

We study the S5-modal expansion of the logic based on the Lukasiewicz t-norm. We exhibit a finitary propositional calculus and show that it is finitely strongly complete with respect to this logic. This propositional calculus is then…

We investigate a correspondence between the complexity hierarchy of constraint satisfaction problems and a hierarchy of logical compactness hypotheses for finite relational structures. It seems that the harder a constraint satisfaction…

We prove that if $\mathcal{A}$ is a $\sigma$-complete Boolean algebra in a model $V$ of set theory and $\mathbb{P}\in V$ is a proper forcing with the Laver property preserving the ground model reals non-meager, then every pointwise…

We develop some basic results about full amalgamation classes with intrinsic trascendentals. These classes have generics whose models may have finite subsets whose intrinsic closure is not contained in its algebraic closure. We will show…

We extend the theory of unified correspondence to a very broad class of logics with algebraic semantics given by varieties of normal lattice expansions (LEs), also known as `lattices with operators'. Specifically, we introduce a very…

We give sufficent conditions for a derivation of a $k$-algebra $A$ of finite type to be $\infty$-integrable in the sense of Hasse-Schmidt, when $A$ is a complete intersection, or when $A$ is reduced and $k$ is a regular ring. As a…

We provide an exact algorithm to solve the log-linear continuous (fractional) knapsack problem. The algorithm is based on two lemmas that follow from the application of weak duality theorem and complementary slackness theorem to the linear…

G{\"o}del's completeness theorem for classical first-order logic is one of the most basic theorems of logic. Central to any foundational course in logic, it connects the notion of valid formula to the notion of provable formula.We survey a…