Related papers: Ordered Models of the Lambda Calculus
This paper studies the relationship between labelled and nested calculi for propositional intuitionistic logic, first-order intuitionistic logic with non-constant domains and first-order intuitionistic logic with constant domains. It is…
The paper concerns the second-order generalized differentiation theory of variational analysis and new applications of this theory to some problems of constrained optimization in finitedimensional spaces. The main attention is paid to the…
Pairwise ordered tree alignment are combinatorial objects that appear in RNA secondary structure comparison. However, the usual representation of tree alignments as supertrees is ambiguous, i.e. two distinct supertrees may induce identical…
In this paper we briefly summarize the contents of Manzonetto's PhD thesis which concerns denotational semantics and equational/order theories of the pure untyped lambda-calculus. The main research achievements include: (i) a general…
We introduce the concept of nested topological order in a class of exact quantum lattice Hamiltonian models with non-abelian discrete gauge symmetry. The topological order present in the models can be partially destroyed by introducing a…
We introduce a notion of residual derivative for elements of a preordered set, a construction that generalizes both the Frattini subgroup in algebra and the Cantor-Bendixson derivative in T1 topological spaces. For dual algebraic coframes…
We sketch a tentative proof of P-completeness for the $\beta$-convertibility problem on untyped planar (a.k.a. ordered or non-commutative) $\lambda$-terms.
A deductive system is structurally complete if its admissible inference rules are derivable. For several important systems, like modal logic S5, failure of structural completeness is caused only by the underivability of passive rules, i.e.…
We give new lower bounds for the (higher) topological complexity of a space, in terms of the Lusternik-Schnirelmann category of a certain auxiliary space. We also give new lower bounds for the rational topological complexity of a space, and…
The main objective of this paper is to study the relationship between a solvable evolution algebra and its subalgebra lattice, emphasizing two of its main properties: distributivity and modularity. First, we will focus on the nilpotent…
We study the complexity of the model checking problem, for fixed model A, over certain fragments L of first-order logic. These are sometimes known as the expression complexities of L. We obtain various complexity classification theorems for…
We classify $n$-representation infinite algebras $\Lambda$ of type \~A. This type is defined by requiring that $\Lambda$ has higher preprojective algebra $\Pi_{n+1}(\Lambda) \simeq k[x_1, \ldots, x_{n+1}] \ast G$, where $G \leq…
Top-down and bottom-up theorem proving approaches each have specific advantages and disadvantages. Bottom-up provers profit from strong redundancy control but suffer from the lack of goal-orientation, whereas top-down provers are…
In a seminal paper from 1985, Sistla and Clarke showed that the model-checking problem for Linear Temporal Logic (LTL) is either NP-complete or PSPACE-complete, depending on the set of temporal operators used. If, in contrast, the set of…
Let E be a locally solid vector lattice. In this paper, we consider two particular vector subspaces of the space of all order bounded operators on E. With the aid of two appropriate topologies, we show that under some conditions, they…
A class of algebras called down-up algebras was introduced by G. Benkart and T. Roby. We classify the finite dimensional simple modules over Noetherian down-up algebras and show that in some cases every finite dimensional module is…
The Lambek calculus is a well-known logical formalism for modelling natural language syntax. The original calculus covered a substantial number of intricate natural language phenomena, but only those restricted to the context-free setting.…
Submodular optimization has received significant attention in both practice and theory, as a wide array of problems in machine learning, auction theory, and combinatorial optimization have submodular structure. In practice, these problems…
Let $\Lambda$ be an artin algebra. We are going to consider full subcategories of $\mod\Lambda$ closed under finite direct sums and under submodules with infinitely many isomorphism classes of indecomposable modules. The main result asserts…
In this paper we study shorted operators relative to two different subspaces, for bounded operators on infinite dimensional Hilbert spaces. We define two notions of complementability in the sense of Ando for operators, and study the…