相关论文: Note on $\Pi^0_{n+1}$-LEM, $\Sigma^0_{n+1}$-LEM an…

We establish a precise relation between M, a subsystem of the formal axiomatic system of intuitionistic analysis FIM of S. C. Kleene, and elementary analysis EL of A. S. Troelstra, two weak formal systems of two-sorted intuitionistic…

In the literature on Kleene algebra (KA), a number of variants have been proposed such as Kleene algebra with tests, commutative KA, bi-KA, and concurrent KA. The equational theories of some of these structures have then been studied in the…

We systematically study conservation theorems on theories of semi-classical arithmetic, which lie in-between classical arithmetic $\mathsf{PA}$ and intuitionistic arithmetic $\mathsf{HA}$. Using a generalized negative translation, we first…

We prove conservativity results for weak K\H{o}nig's lemma that extend the celebrated result of Harrington (for $\Pi^1_1$-statements) and are somewhat orthogonal to the extension by Simpson, Tanaka and Yamazaki (for statements of the form…

Kleene algebra (KA) is an important tool for reasoning about general program equivalences, with a decidable and complete equational theory. However, KA cannot always prove equivalences between specific programs. For this purpose, one adds…

This paper presents a novel proof of the conservativity of the intuitionistic theory of strictly positive fixpoints, $\widehat{\mathrm{ID}}{}_{1}^{\mathrm{i}}$, over Heyting arithmetic (HA), originally proved in full generality by Arai…

There has been a recent interest in hierarchical generalisations of classic incompleteness results. This paper provides evidence that such generalisations are readibly obtainable from suitably hierarchical versions of the principles used in…

Kleene Algebra (KA) is a useful tool for proving that two programs are equivalent. Because KA's equational theory is decidable, it integrates well with interactive theorem provers. This raises the question: which equations can we (not)…

In this paper, we present a systematic way of deriving (1) languages of (generalised) regular expressions, and (2) sound and complete axiomatizations thereof, for a wide variety of systems. This generalizes both the results of Kleene (on…

This paper presents new constructions of models of Hume's Principle and Basic Law V with restricted amounts of comprehension. The techniques used in these constructions are drawn from hyperarithmetic theory and the model theory of fields,…

We establish the decidability of the $\Sigma_2$ theory of both the arithmetic and hyperarithmetic degrees in the language of uppersemilattices i.e. the language with $\leq, 0$ and $\sqcup$. This is achieved by using Kumabe-Slaman forcing -…

We show that no total functional can uniformly transform $\Pi_1$ primality into explicit $\Sigma_1$ witnesses without violating normalization in $\mathsf{HA}$. The argument proceeds through three complementary translations: a geometric…

Concurrent Kleene Algebra (CKA) was introduced by Hoare, Moeller, Struth and Wehrman in 2009 as a framework to reason about concurrent programs. We prove that the axioms for CKA with bounded parallelism are complete for the semantics…

We show that the classical interpretations of Tarski's inductive definitions actually allow us to define the satisfaction and truth of the quantified formulas of the first-order Peano Arithmetic PA over the domain N of the natural numbers…

In 2002 Robert Solovay proved that a subsystem BI of classical second order arithmetic, with bar induction and arithmetical countable choice, can be negatively interpreted in the neutral subsystem BSK of Kleene's intuitionistic analysis FIM…

We propose a proof for conjectures of Langlands, Shelstad and Waldspurger known as the fundamental lemma for Lie algebras and the non-standard fundamental lemma. The proof is based on a study of the decomposition of the l-adic cohomology of…

We proved a KAM theorem on existence of invariant tori in generalized Hamiltonian systems without action-angle variables. It is a generalization of the result of de la Llave et al. [Llave, 2005] that deals with canonical Hamiltonian system.

In this paper we develop some new KAM-technique to prove two general KAM theorems for nearly integrable hamiltonian systems without assuming any non-degeneracy condition. Many of KAM-type results (including the classical KAM theorem) are…

For schemes X over global or local fields, or over their rings of integers, K. Kato stated several conjectures on certain complexes of Gersten-Bloch-Ogus type, generalizing the fundamental exact sequence of Brauer groups for a global field.…

In this note, we investigate iterations of consistency, local and uniform reflection over $\mathbf{HA}$ (Heyting Arithmetic). In the case of uniform reflection, we give a new proof of Dragalin's extension of Feferman's completeness theorem…