Related papers: Adding linear orders
We establish a law of the iterated logarithm (LIL) for the set of real numbers whose $n$-th partial quotient is bigger than $\alpha_n$, where $(\alpha_n)$ is a sequence such that $\sum 1/\alpha_n$ is finite. This set is shown to have…
Non-iterative normal modal logics are defined by axioms of modal degree 1. In this paper we use calculations with normal forms to determine the set of all possible non-iterative normal modal logics, unimodal propositional extensions of K.…
We prove that many properties and invariants of definable groups in NIP theories, such as definable amenability, G/G^{00}, etc., are preserved when passing to the theory of the Shelah expansion by externally definable sets, M^{ext}, of a…
We show how categorial deduction can be implemented in higher-order (linear) logic programming, thereby realising parsing as deduction for the associative and non-associative Lambek calculi. This provides a method of solution to the parsing…
As suggested by the title, it has recently become clear that theorems of Nonstandard Analysis (NSA) give rise to theorems in computability theory (no longer involving NSA). Now, the aforementioned discipline divides into classical and…
We define extension maps as maps that extend a system (through adding ancillary systems) without changing the state in the original system. We show, using extension maps, why a completely positive operation on an initially entangled system…
Uniform interpolation is a strengthening of interpolation that holds for certain propositional logics. The starting point of this chapter is a theorem of A. Pitts, which shows that uniform interpolation holds for intuitionistic…
Nominalistic Logic (NL) is a new presentation of Paul Gilmore's Intensional Type Theory (ITT) as a sequent calculus together with a succinct nominalization axiom (N) that permits names of predicates as individuals in certain cases. The…
The classical Clifford correspondence for normal subgroups is considered in the more general setting of semisimple Hopf algebras. We prove that this correspondence still holds if the extension determined by the normal Hopf subalgebra is…
We introduce adequate concepts of expansion of a digraph to obtain a sequential construction of minimal strong digraphs. We characterize the class of minimal strong digraphs whose expansion preserves the property of minimality. We prove…
Recall that Szpilrajn (1930) ([4], [5]) states that on a given set, any partial order can be extended to a total order on the same set. In this work we give, in the context of the IST theory ([2],[3],[6]), a more constructive proof for this…
Fix a weakly minimal (i.e., superstable $U$-rank $1$) structure $\mathcal{M}$. Let $\mathcal{M}^*$ be an expansion by constants for an elementary substructure, and let $A$ be an arbitrary subset of the universe $M$. We show that all…
The maximum extensions of finite-dimensional nilpotent Lie algebras are considered. In particular, it is proved that in the general case such an extension is not unique, which refutes one L. Snoble's assumption.
In this work we present a computation paradigm based on a concurrent and incremental construction of proof nets (de-sequentialized or graphical proofs) of the pure multiplicative and additive fragment of Linear Logic, a resources conscious…
In two earlier papers, two of the present authors (A.G. and U.S.) extended Lai's [Ann. Probab. 2 (1974) 432--440] law of the single logarithm for delayed sums to a multiindex setting in which the edges of the $\mathbf{n}$th window grow like…
Farkas established that a system of linear inequalities has a solution if and only if we cannot obtain a contradiction by taking a linear combination of the inequalities. We state and formally prove several Farkas-like theorems over…
We give a closed formula for the dimension of all linear systems in $\mathbb{P}^n$ with assigned multiplicity at arbitrary collections of points lying on a rational normal curve of degree $n$. In particular we give a purely geometric…
Extended multi-adjoint logic programming arises as an extension of multi-adjoint normal logic programming where constraints and a special type of aggregator operator have been included. The use of this general aggregator operator permits to…
In this note we prove that if a sublinear operator T satisfies a certain weighted estimate in the $L^{p}(w)$ space for all $w\in A_{p}$, $1<p<+\infty$, then the operator norm of T on $L^{p}(w)$ is a continuous function of the weight $w$,…
We present a sequent-style proof system for provability logic GL that admits so-called circular proofs. For these proofs, the graph underlying a proof is not a finite tree but is allowed to contain cycles. As an application, we establish…