On the length of chains of proper subgroups covering a topological group

We prove that if an ultrafilter L is not coherent to a Q-point, then each analytic non-sigma-bounded topological group G admits an increasing chain <G_a : a of its proper subgroups such that: (i) U_{a in b(L)} G_a=G; and $(ii)$ For every sigma-bounded subgroup H of G there exists a such that H is a subset of G_a. In case of the group Sym(w) of all permutations of w with the topology inherited from w^w this improves upon earlier results of S. Thomas

Sub-unit cell layer-by-layer growth of Fe3O4, MgO, and Sr2RuO4 thin films

The use of oxide materials in oxide electronics requires their controlled epitaxial growth. Recently, it was shown that Reflection High Energy Electron Diffraction (RHEED) allows to monitor the growth of oxide thin films even at high oxygen pressure. Here, we report the sub-unit cell molecular or block layer growth of the oxide materials Sr2RuO4, MgO, and magnetite using Pulsed Laser Deposition (PLD) from stoichiometric targets. Whereas for perovskites such as SrTiO3 or doped LaMnO3 a single RHEED intensity oscillation is found to correspond to the growth of a single unit cell, in materials where the unit cell is composed of several molecular layers or blocks with identical stoichiometry, a sub-unit cell molecular or block layer growth is established resulting in several RHEED intensity oscillations during the growth of a single unit-cell

Flow organization and heat transfer in turbulent wall sheared thermal convection

We perform direct numerical simulations of wall sheared Rayleigh-B\'enard (RB) convection for Rayleigh numbers up to $Ra=10^8$, Prandtl number unity, and wall shear Reynolds numbers up to $Re_w=10000$. Using the Monin-Obukhov length $L_{MO}$ we identify three different flow states, a buoyancy dominated regime ($L_{MO} \lesssim \lambda_{\theta}$; with $\lambda_{\theta}$ the thermal boundary layer thickness), a transitional regime ($0.5H \gtrsim L_{MO} \gtrsim \lambda_{\theta}$; with $H$ the height of the domain), and a shear dominated regime ($L_{MO} \gtrsim 0.5H$). In the buoyancy dominated regime the flow dynamics are similar to that of turbulent thermal convection. The transitional regime is characterized by rolls that are increasingly elongated with increasing shear. The flow in the shear dominated regime consists of very large-scale meandering rolls, similar to the ones found in conventional Couette flow. As a consequence of these different flow regimes, for fixed $Ra$ and with increasing shear, the heat transfer first decreases, due to the breakup of the thermal rolls, and then increases at the beginning of the shear dominated regime. For $L_{MO} \gtrsim 0.5H$ the Nusselt number $Nu$ effectively scales as $Nu \sim Ra^{\alpha}$, with $\alpha \ll 1/3$ while we find $\alpha \simeq 0.31$ in the buoyancy dominated regime. In the transitional regime the effective scaling exponent is $\alpha > 1/3$, but the temperature and velocity profiles in this regime are not logarithmic yet, thus indicating transient dynamics and not the ultimate regime of thermal convection

The ultrafilter number for singular cardinals

We prove the consistency of a singular cardinal $\lambda$ with small value of the ultrafilter number $u_\lambda$, and arbitrarily large value of $2^\lambda$.Comment: 8 page

A General Framework for Sound and Complete Floyd-Hoare Logics

This paper presents an abstraction of Hoare logic to traced symmetric monoidal categories, a very general framework for the theory of systems. Our abstraction is based on a traced monoidal functor from an arbitrary traced monoidal category into the category of pre-orders and monotone relations. We give several examples of how our theory generalises usual Hoare logics (partial correctness of while programs, partial correctness of pointer programs), and provide some case studies on how it can be used to develop new Hoare logics (run-time analysis of while programs and stream circuits).Comment: 27 page

Semantics and Proof Theory of the Epsilon Calculus

The epsilon operator is a term-forming operator which replaces quantifiers in ordinary predicate logic. The application of this undervalued formalism has been hampered by the absence of well-behaved proof systems on the one hand, and accessible presentations of its theory on the other. One significant early result for the original axiomatic proof system for the epsilon-calculus is the first epsilon theorem, for which a proof is sketched. The system itself is discussed, also relative to possible semantic interpretations. The problems facing the development of proof-theoretically well-behaved systems are outlined.Comment: arXiv admin note: substantial text overlap with arXiv:1411.362

Trustee: Full Privacy Preserving Vickrey Auction on top of Ethereum

The wide deployment of tokens for digital assets on top of Ethereum implies the need for powerful trading platforms. Vickrey auctions have been known to determine the real market price of items as bidders are motivated to submit their own monetary valuations without leaking their information to the competitors. Recent constructions have utilized various cryptographic protocols such as ZKP and MPC, however, these approaches either are partially privacy-preserving or require complex computations with several rounds. In this paper, we overcome these limits by presenting Trustee as a Vickrey auction on Ethereum which fully preserves bids' privacy at relatively much lower fees. Trustee consists of three components: a front-end smart contract deployed on Ethereum, an Intel SGX enclave, and a relay to redirect messages between them. Initially, the enclave generates an Ethereum account and ECDH key-pair. Subsequently, the relay publishes the account's address and ECDH public key on the smart contract. As a prerequisite, bidders are encouraged to verify the authenticity and security of Trustee by using the SGX remote attestation service. To participate in the auction, bidders utilize the ECDH public key to encrypt their bids and submit them to the smart contract. Once the bidding interval is closed, the relay retrieves the encrypted bids and feeds them to the enclave that autonomously generates a signed transaction indicating the auction winner. Finally, the relay submits the transaction to the smart contract which verifies the transaction's authenticity and the parameters' consistency before accepting the claimed auction winner. As part of our contributions, we have made a prototype for Trustee available on Github for the community to review and inspect it. Additionally, we analyze the security features of Trustee and report on the transactions' gas cost incurred on Trustee smart contract.Comment: Presented at Financial Cryptography and Data Security 2019, 3rd Workshop on Trusted Smart Contract

A Vernacular for Coherent Logic

We propose a simple, yet expressive proof representation from which proofs for different proof assistants can easily be generated. The representation uses only a few inference rules and is based on a frag- ment of first-order logic called coherent logic. Coherent logic has been recognized by a number of researchers as a suitable logic for many ev- eryday mathematical developments. The proposed proof representation is accompanied by a corresponding XML format and by a suite of XSL transformations for generating formal proofs for Isabelle/Isar and Coq, as well as proofs expressed in a natural language form (formatted in LATEX or in HTML). Also, our automated theorem prover for coherent logic exports proofs in the proposed XML format. All tools are publicly available, along with a set of sample theorems.Comment: CICM 2014 - Conferences on Intelligent Computer Mathematics (2014

The Epsilon Calculus and Herbrand Complexity

Hilbert's epsilon-calculus is based on an extension of the language of predicate logic by a term-forming operator $\epsilon_{x}$. Two fundamental results about the epsilon-calculus, the first and second epsilon theorem, play a role similar to that which the cut-elimination theorem plays in sequent calculus. In particular, Herbrand's Theorem is a consequence of the epsilon theorems. The paper investigates the epsilon theorems and the complexity of the elimination procedure underlying their proof, as well as the length of Herbrand disjunctions of existential theorems obtained by this elimination procedure.Comment: 23 p

Explicit Evidence Systems with Common Knowledge

Justification logics are epistemic logics that explicitly include justifications for the agents' knowledge. We develop a multi-agent justification logic with evidence terms for individual agents as well as for common knowledge. We define a Kripke-style semantics that is similar to Fitting's semantics for the Logic of Proofs LP. We show the soundness, completeness, and finite model property of our multi-agent justification logic with respect to this Kripke-style semantics. We demonstrate that our logic is a conservative extension of Yavorskaya's minimal bimodal explicit evidence logic, which is a two-agent version of LP. We discuss the relationship of our logic to the multi-agent modal logic S4 with common knowledge. Finally, we give a brief analysis of the coordinated attack problem in the newly developed language of our logic