Vision during manned booster operation Final report

Retinal images and accomodation control mechanism under conditions of space flight stres

The Small-Is-Very-Small Principle

The central result of this paper is the small-is-very-small principle for restricted sequential theories. The principle says roughly that whenever the given theory shows that a property has a small witness, i.e. a witness in every definable cut, then it shows that the property has a very small witness: i.e. a witness below a given standard number. We draw various consequences from the central result. For example (in rough formulations): (i) Every restricted, recursively enumerable sequential theory has a finitely axiomatized extension that is conservative w.r.t. formulas of complexity $\leq n$. (ii) Every sequential model has, for any $n$, an extension that is elementary for formulas of complexity $\leq n$, in which the intersection of all definable cuts is the natural numbers. (iii) We have reflection for $\Sigma^0_2$-sentences with sufficiently small witness in any consistent restricted theory $U$. (iv) Suppose $U$ is recursively enumerable and sequential. Suppose further that every recursively enumerable and sequential $V$ that locally inteprets $U$, globally interprets $U$. Then, $U$ is mutually globally interpretable with a finitely axiomatized sequential theory. The paper contains some careful groundwork developing partial satisfaction predicates in sequential theories for the complexity measure depth of quantifier alternations

An Intuitionistic Formula Hierarchy Based on High-School Identities

We revisit the notion of intuitionistic equivalence and formal proof representations by adopting the view of formulas as exponential polynomials. After observing that most of the invertible proof rules of intuitionistic (minimal) propositional sequent calculi are formula (i.e. sequent) isomorphisms corresponding to the high-school identities, we show that one can obtain a more compact variant of a proof system, consisting of non-invertible proof rules only, and where the invertible proof rules have been replaced by a formula normalisation procedure. Moreover, for certain proof systems such as the G4ip sequent calculus of Vorob'ev, Hudelmaier, and Dyckhoff, it is even possible to see all of the non-invertible proof rules as strict inequalities between exponential polynomials; a careful combinatorial treatment is given in order to establish this fact. Finally, we extend the exponential polynomial analogy to the first-order quantifiers, showing that it gives rise to an intuitionistic hierarchy of formulas, resembling the classical arithmetical hierarchy, and the first one that classifies formulas while preserving isomorphism

A System of Interaction and Structure

This paper introduces a logical system, called BV, which extends multiplicative linear logic by a non-commutative self-dual logical operator. This extension is particularly challenging for the sequent calculus, and so far it is not achieved therein. It becomes very natural in a new formalism, called the calculus of structures, which is the main contribution of this work. Structures are formulae submitted to certain equational laws typical of sequents. The calculus of structures is obtained by generalising the sequent calculus in such a way that a new top-down symmetry of derivations is observed, and it employs inference rules that rewrite inside structures at any depth. These properties, in addition to allow the design of BV, yield a modular proof of cut elimination.Comment: This is the authoritative version of the article, with readable pictures, in colour, also available at . (The published version contains errors introduced by the editorial processing.) Web site for Deep Inference and the Calculus of Structures at <http://alessio.guglielmi.name/res/cos

From Nonstandard Analysis to various flavours of Computability Theory

As suggested by the title, it has recently become clear that theorems of Nonstandard Analysis (NSA) give rise to theorems in computability theory (no longer involving NSA). Now, the aforementioned discipline divides into classical and higher-order computability theory, where the former (resp. the latter) sub-discipline deals with objects of type zero and one (resp. of all types). The aforementioned results regarding NSA deal exclusively with the higher-order case; we show in this paper that theorems of NSA also give rise to theorems in classical computability theory by considering so-called textbook proofs.Comment: To appear in the proceedings of TAMC2017 (http://tamc2017.unibe.ch/

Algebraic totality, towards completeness

Finiteness spaces constitute a categorical model of Linear Logic (LL) whose objects can be seen as linearly topologised spaces, (a class of topological vector spaces introduced by Lefschetz in 1942) and morphisms as continuous linear maps. First, we recall definitions of finiteness spaces and describe their basic properties deduced from the general theory of linearly topologised spaces. Then we give an interpretation of LL based on linear algebra. Second, thanks to separation properties, we can introduce an algebraic notion of totality candidate in the framework of linearly topologised spaces: a totality candidate is a closed affine subspace which does not contain 0. We show that finiteness spaces with totality candidates constitute a model of classical LL. Finally, we give a barycentric simply typed lambda-calculus, with booleans ${\mathcal{B}}$ and a conditional operator, which can be interpreted in this model. We prove completeness at type ${\mathcal{B}}^n\to{\mathcal{B}}$ for every n by an algebraic method

Subarctic Front migration at the Reykjanes Ridge during the mid- to late Holocene:Evidence from planktic foraminifera

Expansion of fresh and sea-ice loaded surface waters from the Arctic Ocean into the sub-polar North Atlantic is suggested to modulate the northward heat transport within the North Atlantic Current (NAC). The Reykjanes Ridge south of Iceland is a suitable area to reconstruct changes in the mid- to late Holocene fresh and sea-ice loaded surface water expansion, which is marked by the Subarctic Front (SAF). Here, shifts in the location of the SAF result from the interaction of freshwater expansion and inflow of warmer and saline (NAC) waters to the Ridge. Using planktic foraminiferal assemblage and concentration data from a marine sediment core on the eastern Reykjanes Ridge elucidates SAF location changes and thus, changes in the water-mass composition (upper ˜200 m) during the last c. 5.8 ka BP. Our foraminifer data highlight a late Holocene shift (at c. 3.0 ka BP) in water-mass composition at the Reykjanes Ridge, which reflects the occurrence of cooler and fresher surface waters when compared to the mid-Holocene. We document two phases of SAF presence at the study site: from (i) c. 5.5 to 5.0 ka BP and (ii) c. 2.7 to 1.5 ka BP. Both phases are characterized by marked increases in the planktic foraminiferal concentration, which coincides with freshwater expansions and warm subsurface water conditions within the sub-polar North Atlantic. We link the SAF changes, from c. 2.7 to 1.5 ka BP, to a strengthening of the East Greenland Current and a warming in the NAC, as identified by various studies underlying these two currents. From c. 1.5 ka BP onwards, we record a prominent subsurface cooling and continued occurrence of fresh and sea-ice loaded surface waters at the study site. This implies that the SAF migrated to the southeast of our core site during the last millennium

From coinductive proofs to exact real arithmetic: theory and applications

Based on a new coinductive characterization of continuous functions we extract certified programs for exact real number computation from constructive proofs. The extracted programs construct and combine exact real number algorithms with respect to the binary signed digit representation of real numbers. The data type corresponding to the coinductive definition of continuous functions consists of finitely branching non-wellfounded trees describing when the algorithm writes and reads digits. We discuss several examples including the extraction of programs for polynomials up to degree two and the definite integral of continuous maps

A robust semantics hides fewer errors

In this paper we explore how formal models are interpreted and to what degree meaning is captured in the formal semantics and to what degree it remains in the informal interpretation of the semantics. By applying a robust approach to the definition of refinement and semantics, favoured by the event-based community, to state-based theory we are able to move some aspects from the informal interpretation into the formal semantics

Novosti u sprječavanju, dijagnostici i liječenju infektivnih bolesti

Rizični čimbenici za dugoročni mortalitet od bakterijemija koje je uzrokovao Staphylococcus aureus Infekcija virusom Zika u trudnica u Rio de Janeiru – preliminarni izvještaj Fekalni mikrobiom pri pojavi juvenilnog idiopatskog artritisa Treće međunarodne konsenzusne definicije sepse i septičkog šoka (Sepsis-3) Dijagnostička i prognostička korist prokalcitonina u pacijenata koji dolaze u hitne ambulante sa simtomom dispnej