Non-principal ultrafilters, program extraction and higher order reverse mathematics

We investigate the strength of the existence of a non-principal ultrafilter over fragments of higher order arithmetic. Let U be the statement that a non-principal ultrafilter exists and let ACA_0^{\omega} be the higher order extension of ACA_0. We show that ACA_0^{\omega}+U is \Pi^1_2-conservative over ACA_0^{\omega} and thus that ACA_0^{\omega}+\U is conservative over PA. Moreover, we provide a program extraction method and show that from a proof of a strictly \Pi^1_2 statement \forall f \exists g A(f,g) in ACA_0^{\omega}+U a realizing term in G\"odel's system T can be extracted. This means that one can extract a term t, such that A(f,t(f))

Comparing hierarchies of total functionals

In this paper we consider two hierarchies of hereditarily total and continuous functionals over the reals based on one extensional and one intensional representation of real numbers, and we discuss under which asumptions these hierarchies coincide. This coincidense problem is equivalent to a statement about the topology of the Kleene-Kreisel continuous functionals. As a tool of independent interest, we show that the Kleene-Kreisel functionals may be embedded into both these hierarchies.Comment: 28 page

Two-Sided Derivatives for Regular Expressions and for Hairpin Expressions

The aim of this paper is to design the polynomial construction of a finite recognizer for hairpin completions of regular languages. This is achieved by considering completions as new expression operators and by applying derivation techniques to the associated extended expressions called hairpin expressions. More precisely, we extend partial derivation of regular expressions to two-sided partial derivation of hairpin expressions and we show how to deduce a recognizer for a hairpin expression from its two-sided derived term automaton, providing an alternative proof of the fact that hairpin completions of regular languages are linear context-free.Comment: 28 page

On the Hierarchy of Block Deterministic Languages

A regular language is $k$-lookahead deterministic (resp. $k$-block deterministic) if it is specified by a $k$-lookahead deterministic (resp. $k$-block deterministic) regular expression. These two subclasses of regular languages have been respectively introduced by Han and Wood ($k$-lookahead determinism) and by Giammarresi et al. ($k$-block determinism) as a possible extension of one-unambiguous languages defined and characterized by Br\"uggemann-Klein and Wood. In this paper, we study the hierarchy and the inclusion links of these families. We first show that each $k$-block deterministic language is the alphabetic image of some one-unambiguous language. Moreover, we show that the conversion from a minimal DFA of a $k$-block deterministic regular language to a $k$-block deterministic automaton not only requires state elimination, and that the proof given by Han and Wood of a proper hierarchy in $k$-block deterministic languages based on this result is erroneous. Despite these results, we show by giving a parameterized family that there is a proper hierarchy in $k$-block deterministic regular languages. We also prove that there is a proper hierarchy in $k$-lookahead deterministic regular languages by studying particular properties of unary regular expressions. Finally, using our valid results, we confirm that the family of $k$-block deterministic regular languages is strictly included into the one of $k$-lookahead deterministic regular languages by showing that any $k$-block deterministic unary language is one-unambiguous

Spatial Distribution of Calcium-Gated Chloride Channels in Olfactory Cilia

Background: In vertebrate olfactory receptor neurons, sensory cilia transduce odor stimuli into changes in neuronal membrane potential. The voltage changes are primarily caused by the sequential openings of two types of channel: a cyclic-nucleotide-gated (CNG) cationic channel and a calcium-gated chloride channel. In frog, the cilia are 25 to 200 mm in length, so the spatial distributions of the channels may be an important determinant of odor sensitivity. Principal Findings: To determine the spatial distribution of the chloride channels, we recorded from single cilia as calcium was allowed to diffuse down the length of the cilium and activate the channels. A computational model of this experiment allowed an estimate of the spatial distribution of the chloride channels. On average, the channels were concentrated in a narrow band centered at a distance of 29 % of the ciliary length, measured from the base of the cilium. This matches the location of the CNG channels determined previously. This non-uniform distribution of transduction proteins is consistent with similar findings in other cilia. Conclusions: On average, the two types of olfactory transduction channel are concentrated in the same region of the cilium

Interactive Learning-Based Realizability for Heyting Arithmetic with EM1

We apply to the semantics of Arithmetic the idea of ``finite approximation'' used to provide computational interpretations of Herbrand's Theorem, and we interpret classical proofs as constructive proofs (with constructive rules for $\vee, \exists$) over a suitable structure \StructureN for the language of natural numbers and maps of G\"odel's system \SystemT. We introduce a new Realizability semantics we call ``Interactive learning-based Realizability'', for Heyting Arithmetic plus \EM_1 (Excluded middle axiom restricted to $\Sigma^0_1$ formulas). Individuals of \StructureN evolve with time, and realizers may ``interact'' with them, by influencing their evolution. We build our semantics over Avigad's fixed point result, but the same semantics may be defined over different constructive interpretations of classical arithmetic (Berardi and de' Liguoro use continuations). Our notion of realizability extends intuitionistic realizability and differs from it only in the atomic case: we interpret atomic realizers as ``learning agents''

A Selective PMCA Inhibitor Does Not Prolong the Electroolfactogram in Mouse

Within the cilia of vertebrate olfactory receptor neurons, Ca(2+) accumulates during odor transduction. Termination of the odor response requires removal of this Ca(2+), and prior evidence suggests that both Na(+)/Ca(2+) exchange and plasma membrane Ca(2+)-ATPase (PMCA) contribute to this removal.In intact mouse olfactory epithelium, we measured the time course of termination of the odor-induced field potential. Replacement of mucosal Na(+) with Li(+), which reduces the ability of Na(+)/Ca(2+) exchange to expel Ca(2+), prolonged the termination as expected. However, treating the epithelium with the specific PMCA inhibitor caloxin 1b1 caused no significant increase in the time course of response termination.Under these experimental conditions, PMCA does not contribute detectably to the termination of the odor response

Polarizing Double Negation Translations

Double-negation translations are used to encode and decode classical proofs in intuitionistic logic. We show that, in the cut-free fragment, we can simplify the translations and introduce fewer negations. To achieve this, we consider the polarization of the formul{\ae}{} and adapt those translation to the different connectives and quantifiers. We show that the embedding results still hold, using a customized version of the focused classical sequent calculus. We also prove the latter equivalent to more usual versions of the sequent calculus. This polarization process allows lighter embeddings, and sheds some light on the relationship between intuitionistic and classical connectives