Related papers: On a question of Krajewski's
We show that there exist (continuum many) varieties of bi-Heyting algebras that are not generated by their complete members. It follows that there exist (continuum many) extensions of the Heyting-Brouwer logic $\mathsf{HB}$ that are…
By a well-known result of Kotlarski, Krajewski, and Lachlan (1981), first-order Peano arithmetic $PA$ can be conservatively extended to the theory $CT^{-}[PA]$ of a truth predicate satisfying compositional axioms, i.e., axioms stating that…
By classical results of Hurewicz, Kechris and Saint-Raymond, an analytic subset of a Polish space $X$ is covered by a $K_\sigma$ subset of $X$ if and only if it does not contain a closed-in-$X$ subset homeomorphic to the Baire space…
We construct an extension $E(A,G)$ of a given group $G$ by infinite non-Archimedean words over an discretely ordered abelian group like $Z^n$. This yields an effective and uniform method to study various groups that "behave like $G$". We…
We continue the research of an extension $\widetilde{\mid}$ of the divisibility relation to the Stone-\v Cech compactification $\beta N$. First we prove that ultrafilters we call prime actually possess the algebraic property of primality.…
We present an extension-based approach for computing and verifying preferences in an abstract argumentation system. Although numerous argumentation semantics have been developed previously for identifying acceptable sets of arguments from…
We prove a new selection theorem for multivalued mappings of C-space. Using this theorem we prove extension dimensional version of Hurewicz theorem for a closed mapping $f\colon X\to Y$ of $k$-space $X$ onto paracompact $C$-space $Y$: if…
We prove that in a countable theory $T$ fully stable over a predicate $P$, any $\lam$-complete set $A$ has the $\lam$-existence property. This means that $A$ can be extended to a $\lam$-saturated model of $T$ without changing the $P$-part.…
Two results are presented concerning the entailment problem in Separation Logic with inductively defined predicate symbols and theory reasoning. First, we show that the entailment problem is undecidable for rules with bounded tree-width, if…
In this article, motivated by a problem asked by Allison and Panagiotopoulos, we study a problem concerning the complexity of group extensions within a hierarchy (denoted by $\alpha$-CLI and L-$\alpha$-CLI) on the class of non-archimedean…
In his dissertation, Wadge defined a notion of guessability on subsets of the Baire space and gave two characterizations of guessable sets. A set is guessable iff it is in the second ambiguous class (boldface Delta^0_2), iff it is…
Professor Daniel Anderson informed me, recently, that there is an error in the proof of Theorem 56 of Kaplansky's book on Commutative Rings. His (Dan's) reason was "He (Kaplansky) orders by reverse inclusion but in the last line uses…
We investigate language interpretations of two extensions of the Lambek calculus: with additive conjunction and disjunction and with additive conjunction and the unit constant. For extensions with additive connectives, we show that…
A finite $W$-algebra $U(\g,e)$ is a certain finitely generated algebra that can be viewed as the enveloping algebra of the Slodowy slice to the adjoint orbit of a nilpotent element $e$ of a complex reductive Lie algebra $\g$. It is possible…
We provide syntactic derivative-like operations, defined by recursion on regular expressions, in the styles of both Brzozowski and Antimirov, for trace closures of regular languages. Just as the Brzozowski and Antimirov derivative…
In this short note we show that if we add predicate for a dense complete indiscernible sequence in a dependent theory then the result is still dependent. This answers a question of Baldwin and Benedikt and implies that every unstable…
We present tools for analysing ordinals in realizability models of classical set theory built using Krivine's technique for realizability. This method uses a conservative extension of $ZF$ known as $ZF_{\varepsilon}$, where two membership…
Parikh automata extend finite automata by counters that can be tested for membership in a semilinear set, but only at the end of a run, thereby preserving many of the desirable algorithmic properties of finite automata. Here, we study the…
The $\omega$-power of a finitary language L over a finite alphabet $\Sigma$ is the language of infinite words over $\Sigma$ defined by L $\infty$ := {w 0 w 1. .. $\in$ $\Sigma$ $\omega$ | $\forall$i $\in$ $\omega$ w i $\in$ L}. The…
In this paper, we introduce a foundation for computable model theory of rational Pavelka logic (an extension of {\L}ukasiewicz logic) and continuous logic, and prove effective versions of some theorems in model theory. We show how to reduce…