Related papers: On Use of an Explicit Congruence Predicate in Boun…

A natural deduction system for intuitionistic predicate logic with existential \ instantiation rule presented here uses Hilbert's $\e$-symbol. It is conservative over intuitionistic predicate logic. We provide a completeness proof for a…

We present a self-contained account of Woodin's extender algebra and its use in proving absoluteness results, including a proof of the $\Sigma^2_1$-absoluteness theorem. We also include a proof that the existence of an inner model with…

We prove a stability inequality associated to the reverse Sobolev inequality on the sphere $\mathbb S^n$, for the full admissible parameter range $s - \frac{n}{2} \in (0,1) \cup (1,2)$. To implement the classical proof of Bianchi and…

We have published several articles about generalizations and boundary-case exceptions to the Second Incompleteness Theorem during the last 25 years. The current paper will review some of our prior results and also introduce an `enriched'…

In this paper we introduce the notion of $e$-computability as a method of finding the Waring rank of forms. We use this notion to find infinitely many new examples which satisfy Strassen's Conjecture.

We define a new class of languages of $\omega$-words, strictly extending $\omega$-regular languages. One way to present this new class is by a type of regular expressions. The new expressions are an extension of $\omega$-regular expressions…

Inspired by the proof of the Bertrand postulate given by P. Erd\H{o}S, we carefully examine and solve one less usual inequality in positive integers which could help to find an arithmetically pure proof that for every positive integer…

The questions of dense definiteness and boundedness of composition operators in $L^2$-spaces are studied by means of inductive limits of operators. Methods based on projective systems of measure spaces and inductive limits of $L^2$-spaces…

We prove that the theory of the extensional compositional truth predicate for the language of arithmetic with $\Delta_0$-induction scheme for the truth predicate and the full arithmetical induction scheme is not conservative over Peano…

There are presented certain results on extending continuous linear operators defined on spaces of E-valued continuous functions (defined on a compact Hausdorff space X) to linear operators defined on spaces of E-valued measurable functions…

A partial order is called semilinear iff the upper bounds of each element are linearly ordered and any two elements have a common upper bound. There exists, up to isomorphism, a unique countable existentially closed semilinear order, which…

Motivated by Arveson's conjecture, we introduce a notion of hyperrigidity for a partial order on the state space of a $C^*$-algebra $B$. We show how this property is equivalent to the existence of a boundary: a subset of the pure states…

We define a fragment of propositional logic where isomorphic propositions, such as $A\land B$ and $B\land A$, or $A\Rightarrow (B\land C)$ and $(A\Rightarrow B)\land(A\Rightarrow C)$ are identified. We define System I, a proof language for…

We introduce an integrable model for two coupled BCS systems through a solution of the Yang-Baxter equation associated with the Lie algebra $su(4)$. By employing the algebraic Bethe ansatz, we determine the exact solution for the energy…

We address a conjecture (referred to as sur in the literature) in the representation theory of a reductive p-adic Lie group G which has important implications for the relationship between mod-p smooth representations and pro-p Iwahori-Hecke…

We consider first-order logic with monoidal quantifiers over words. We show that all languages with a neutral letter, definable using the addition numerical predicate are also definable with the order predicate as the only numerical…

Terms in arithmetic of the form s in the formula s=t(< s >), with t a term with one free variable and < s > a numeral denoting the G\"odel number of s, are examined by writing the explicit definition of the encoding functions whose…

An automaton is unambiguous if for every input it has at most one accepting computation. An automaton is k-ambiguous (for k > 0) if for every input it has at most k accepting computations. An automaton is boundedly ambiguous if it is…

In the theory of Bose-condensed systems, there exists the well known problem, the Hohenberg-Martin dilemma of conserving versus gapless approximations. This dilemma is analysed and it is shown that it arises because of the internal…

We define coherent states carrying SU(N) charges by exploiting generalized Schwinger boson representation of SU(N) Lie algebra. These coherent states are defined on $2 (2^{N - 1} - 1)$ complex planes. They satisfy continuity property and…