Related papers: Finite Vector Spaces as Model of Simply-Typed Lamb…
In this paper, Lusternik-Schinrelmann and geometric category of finite spaces are considered. We define new numerical invariants of these spaces derived from the geometric category and present an algorithmic approach for its effective…
By using the space of fuzzy numbers, in e.g. [5] have been considered several complete metric spaces (called here {\bf FN}-type spaces) endowed with addition and scalar multiplication, such that the metrics have nice properties but the…
Vector spaces over finite fields and Anzahl formulas of subspaces were studied by Wan (Geometry of Classical Groups over Finite Fields, Science Press, 2002). As a generalization, we study vector spaces and singular linear spaces over…
We discuss the concepts of fine and coarse moduli spaces in the context of finite dimensional algebras over algebraically closed fields. In particular, our formulation of a moduli problem and its potential strong or weak solution is adapted…
In this paper we will look at the connection of frames and finite dimensionality. A main focus is to present simple algorithms and make them available online. The main result is a way to 'switch' between different frames, giving an…
We study the topological $\mu$-calculus, based on both Cantor derivative and closure modalities, proving completeness, decidability and FMP over general topological spaces, as well as over $T_0$ and $T_D$ spaces. We also investigate…
We investigate the relationship between finite terms in {\lambda}-letrec, the {\lambda}-calculus with letrec, and the infinite {\lambda}-terms they express. We say that a lambda-letrec term expresses a lambda-term if the latter can be…
In pursuit of a noncommutative spectrum functor, we argue that the Heyneman-Sweedler finite dual coalgebra can be viewed as a quantization of the maximal spectrum of a commutative affine algebra, integrating prior perspectives of Takeuchi,…
A number of models of linear logic are based on or closely related to linear algebra, in the sense that morphisms are "matrices" over appropriate coefficient sets. Examples include models based on coherence spaces, finiteness spaces and…
We consider a simple model of higher order, functional computation over the booleans. Then, we enrich the model in order to encompass non-termination and unrecoverable errors, taken separately or jointly. We show that the models so defined…
We consider grammar-restricted exact learning of formulas and terms in finite variable logics. We propose a novel and versatile automata-theoretic technique for solving such problems. We first show results for learning formulas that…
This article supplements recent work of the authors. (1) A criterion for failure of covariant finiteness of a full subcategory of $\Lambda\text{-mod}$ is given, where $\Lambda$ is a finite dimensional algebra. The criterion is applied to…
We present a linearity theorem for a proof language of intuitionistic multiplicative additive linear logic, incorporating addition and scalar multiplication. The proofs in this language are linear in the algebraic sense. This work is part…
Mathematical notation makes up a large portion of STEM literature, yet finding semantic representations for formulae remains a challenging problem. Because mathematical notation is precise, and its meaning changes significantly with small…
We consider the call-by-value lambda-calculus extended with a may-convergent non-deterministic choice and a must-convergent parallel composition. Inspired by recent works on the relational semantics of linear logic and non-idempotent…
Cosmological models with time dependent $\Lambda$ (read as $\Lambda (t)$) have been investigated widely in the literature. Models that solve background dynamics analytically, are of special interest. Additionally, the allowance of past or…
A non-deterministic call-by-need lambda-calculus \calc with case, constructors, letrec and a (non-deterministic) erratic choice, based on rewriting rules is investigated. A standard reduction is defined as a variant of left-most outermost…
We obtain a complete classification of all finite-dimensional irreducible modules over classical map superalgebras, provide formulas for their (super)characters and a description of their extension groups. Furthermore, we describe the block…
In the past two decades, some major efforts have been made to reduce exact (e.g. integer, rational, polynomial) linear algebra problems to matrix multiplication in order to provide algorithms with optimal asymptotic complexity. To provide…
Let us denote ${\cal V}$, the finite dimensional vector spaces of functions of the form $\psi(x) = p_n(x) + f(x) p_m(x)$ where $p_n(x)$ and $p_m(x)$ are arbitrary polynomials of degree at most $n$ and $m$ in the variable $x$ while $f(x)$…