Related papers: On regular reduced products

The generalized *-products, or the $*_N$-products, appear both in the one-loop effective action of noncommutative Yang-Mills theories and in the coupling of a closed string to N open strings on a disk when the D-brane world-volume is…

The \emph{Entscheidungsproblem}, or the classical decision problem, asks whether a given formula of first-order logic is satisfiable. In this work, we consider an extension of this problem to regular first-order \emph{theories}, i.e.,…

Gregory McColm conjectured that positive elementary inductions are bounded in a class K of finite structures if every (FO + LFP) formula is equivalent to a first-order formula in K. Here (FO + LFP) is the extension of first-order logic with…

The lambda calculus is a widely accepted computational model of higher-order functional pro- grams, yet there is not any direct and universally accepted cost model for it. As a consequence, the computational difficulty of reducing lambda…

In this paper, we assume that the filtration $\bb F$ is generated by a $d$-dimensional Brownian motion $W=(W_1,\cdots,W_d)'$ as well as an integer-valued random measure $\mu(du,dy)$. The random variable $\ttau$ is the default time and $L$…

Calculi with control operators have been studied as extensions of simple type theory. Real programming languages contain datatypes, so to really understand control operators, one should also include these in the calculus. As a first step in…

We address a number of problems on Boolean Algebras. For example, we construct, in ZFC, for any BA B, and cardinal kappa BAs B_1,B_2 extending B such that the depth of the free product of B_1,B_2 over B is strictly larger than the depths of…

Perhaps it is not completely superfluous to remind that Clauser-Horne factorability, introduced in [1], is only necessary when \lambda, the hidden variable (HV), is sufficiently deterministic: for {M_i} a set of possible measurements…

We introduce the logics GLP(\Lambda), a generalization of Japaridze's polymodal provability logic GLP(\omega) where \Lambda is any linearly ordered set representing a hierarchy of provability operators of increasing strength. We shall…

Let $(\mathcal{K} ,\subseteq )$ be a universal class with $LS(\mathcal{K})=\lambda$ categorical in regular $\kappa >\lambda^+$ with arbitrarily large models, and let $\mathcal{K}^*$ be the class of all $\mathcal{A}\in\mathcal{K}_{>\lambda}$…

The aim of this work is to characterize three fundamental normalization proprieties in lambda-calculus trough the Taylor expansion of $ \lambda$-terms. The general proof strategy consists in stating the dependence of ordinary reduction…

This paper introduces and studies a notion of \emph{algorithmic randomness} for subgroups of rationals. Given a randomly generated additive subgroup $(G,+)$ of rationals, two main questions are addressed: first, what are the model-theoretic…

Let $\mathfrak{M}(\mathbb{D}, m, n, P)$ be the ring of all $m \times n$ matrices over a division ring $\mathbb{D}$, with the product given by $A \bullet B=A P B$, where $P$ is a fixed $n \times m$ matrix over $\mathbb{D}$. When $2\leq m, n…

This paper investigates the conditions under which a given circular (synchronizing) DFA is \emph{simple} (sometimes referred to as \emph{primitive}) and when it is \emph{irreducible}. Our notion of irreducibility slightly differs from the…

We study several cardinal, and ordinal--valued functions that are relatives of Hanf numbers. Let kappa be an infinite cardinal, and let T subseteq L_{kappa^+, omega} be a theory of cardinality <= kappa, and let gamma be an ordinal >=…

Let $n \geq 1$ and assume that there is a Woodin cardinal. For $x \in \mathbb{R}$ let $\alpha_x$ be the least $\beta$ such that \[ L_\beta [x] \models \Sigma_n \text{-KP} + \exists \kappa (``\kappa \text{ is inaccessible and }\kappa^+…

Vafa and Warner observed that the Landau-Ginzburg model associated to the potential $E_6$ (resp. $E_8$) is a product of two other models, associated to the potentials $A_2$ and $ A_3$ (resp. $A_2 $ and $ A_4$). We translate this along the…

Driven by the interest of reasoning about probabilistic programming languages, we set out to study a notion of unicity of normal forms for them. To provide a tractable proof method for it, we define a property of distribution confluence…

For a proper submodule $N$ of a finitely generated module $M$ over a Noetherian ring, the product of prime ideals which occur in a regular prime extension filtration of $M$ over $N$ is defined as its generalized prime ideal factorization in…

A longstanding open problem is whether there exists a non-syntactical model of untyped lambda-calculus whose theory is exactly the least equational lambda-theory (=Lb). In this paper we make use of the Visser topology for investigating the…