Related papers: Well-orders in the transfinite Japaridze algebra
We extend the {\lambda}-calculus with constructs suitable for relational and functional-logic programming: non-deterministic choice, fresh variable introduction, and unification of expressions. In order to be able to unify…
G\"odel logic with the projection operator Delta (G_Delta) is an important many-valued as well as intermediate logic. In contrast to classical logic, the validity and the satisfiability problems of G_Delta are not directly dual to each…
We define a variant of realizability where realizers are pairs of a term and a substitution. This variant allows us to prove the normalization of a simply-typed call-by-need $$\lambda$-$calculus with control due to Ariola et al. Indeed, in…
Partially ordered automata are automata where the transition relation induces a partial order on states. The expressive power of partially ordered automata is closely related to the expressivity of fragments of first-order logic on finite…
Given a finite commutative monoid $M$, we show that submonoids of $M\times [n]$ - where $[n] = \{0,1,\ldots,n\}$ is equipped with the max operation $\vee$ - may be enumerated via the transfer matrix method. When $M$ is also idempotent, we…
This paper explores properties and applications of an ordered subset of the quadratic integer ring $\mathbb{Z}\left[\frac{1+\sqrt{5}}{2}\right]$. The numbers are shown to exhibit a parity triplet, as opposed to the familiar even/odd doublet…
We show that the ordering of the Hanf number of L_{omega, omega}(wo) (well ordering), L^c_{omega, omega} (quantification on countable sets), L_{omega, omega}(aa) (stationary logic) and second order logic, have no more restraints provable in…
Inspired by Leivant's work on absolute predicativism, Bellantoni and Cook in 1992 introduced a structurally restricted form of recursion called predicative recursion. Using this recursion scheme on the inductive structures of natural…
We show a model construction for a system of higher-order illative combinatory logic $\mathcal{I}_\omega$, thus establishing its strong consistency. We also use a variant of this construction to provide a complete embedding of first-order…
The class of abelian $p$-groups are an example of some very interesting phenomena in computable structure theory. We will give an elementary first-order theory $T_p$ whose models are each bi-interpretable with the disjoint union of an…
We deal with the boundedness properties of higher order commutators related to some generalizations of the multilinear fractional integral operator of order $m$, $I_\alpha ^m$, from a product of weighted Lebesgue spaces into adequate…
This is the first part of a series of four articles. In this work, we are interested in weighted norm estimates. We put the emphasis on two results of different nature: one is based on a good-$\lambda$ inequality with two-parameters and the…
In this paper we consider the normal modal logics of elementary classes defined by first-order formulas of the form $\forall x_0 \exists x_1 \dots \exists x_n \bigwedge x_i R_\lambda x_j$. We prove that many properties of these logics, such…
We extend the $\lambda$-theory of operator spaces given by Defant and Wiesner (2014), that generalizes the notion of the projective, Haagerup and Schur tensor norm for operator spaces to matrix ordered spaces and Banach $*$-algebras. Given…
We propose a general theory for surface patterning in many different biological systems, including mite and insect cuticles, pollen grains, fungal spores, and insect eggs. The patterns of interest are often intricate and diverse, yet an…
This paper aims to study a new stochastic order based upon discrete Laplace transforms. By this order, in a setup where the sample size is random, having discrete delta and nabla distributions, we obtain some ordering results involving…
This thesis comes within the scope of algebraic combinatorics and studies problems related to three orders on permutations: the two said weak orders (right and left) and the strong order or Bruhat order. The first part deals with bases of…
This paper develops a simple calculus for order of magnitude reasoning. A semantics is given with soundness and completeness results. Order of magnitude probability functions are easily defined and turn out to be equivalent to kappa…
Complexity and decidability of logics is a major research area involving a huge range of different logical systems. This calls for a unified and systematic approach for the field. We introduce a research program based on an algebraic…
We look for a parallel to the notion of ``proper forcing'' among lambda-complete forcing notions not collapsing lambda^+ . We suggest such a definition and prove that it is preserved by suitable iterations.