The equivalence of theories that characterize ALogTime

A number of theories have been developed to characterize ALogTime (or uniform NC ¹, or just NC ¹), the class of languages accepted by alternating logtime Turing machines, in the same way that Buss’s theory characterizes polytime functions. Among these, ALV′ (by Clote) is particularly interesting because it is developed based on Barrington’s theorem that the word problem for the permutation group S ₅ is complete for ALogTime. On the other hand, ALV (by Clote), T ⁰ NC ⁰ (by Clote and Takeuti) as well as Arai’s theory and its two-sorted version VNC ¹ (by Cook and Morioka) are based on the circuit characterization of ALogTime. While the last three theories have been known to be equivalent, their relationship to ALV′ has been an open problem. Here we show that ALV′ is indeed equivalent to the other theories.      

Ordinal notations and well-orderings in bounded arithmetic

This paper investigates provability and non-provability of well-foundedness of ordinal notations in weak theories of bounded arithmetic. We define a notion of well-foundedness on bounded domains. We show that T₂¹ and S₂² can prove the well-foundedness on bounded domains of the ordinal notations below ₀ and Γ₀. As a corollary, the class of polynomial local search problems, PLS, can be augmented with cost functions that take ordinal values below ₀ and Γ₀ without increasing the class PLS.     

Intuitionistic nonstandard bounded modified realisability and functional interpretation

We present a bounded modified realisability and a bounded functional interpretation of intuitionistic nonstandard arithmetic with nonstandard principles.The functional interpretation is the intuitionistic counterpart of Ferreira and Gaspar's functional interpretation and has similarities with Van den Berg, Briseid and Safarik's functional interpretation but replacing finiteness by majorisability.We give a threefold contribution: constructive content and proof-theoretical properties of nonstandard arithmetic; filling a gap in the literature; being in line with nonstandard methods to analyse compactness arguments.     

On relations between weak approximation properties and their inheritances to subspaces

It is shown that for the separable dual X^∗ of a Banach space X, if X^∗ has the weak approximation property, then X^∗ has the metric weak approximation property. We introduce the properties W^∗D and MW^∗D for Banach spaces. Suppose that M is a closed subspace of a Banach space X such that M^⊥ is complemented in the dual space X^∗, where for all m∈M}. Then it is shown that if a Banach space X has the weak approximation property and W^∗D (respectively, metric weak approximation property and MW^∗D), then M has the weak approximation property (respectively, bounded weak approximation property).     

关于可压液晶方程组的能量有界性

考察可压液晶方程组有关能量的基本性质.证明了只要初始能量有界,此系统的能量就是一个与时间无关的有界量.