How far can Nim in disguise be stretched?

A move in the game of nim consists of taking any positive number of tokens from a single pile. Suppose we add the class of moves of taking a nonnegative number of tokens jointly from all the piles. We give a complete answer to the question which moves in the class can be adjoined without changing the winning strategy of nim. The results apply to other combinatorial games with unbounded Sprague-Grundy function values. We formulate two weakened conditions of the notion of nim-sum 0 for proving the results.Comment: To appear in J. Combinatorial Theory (A

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

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 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

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

Assessing Damages: The 1983 Israeli Bank Shares Crisis

In 1983 Israeli bank shares collapsed following several years during which the bank had actively intervened to promote share prices and thereby contributed to a 300% rise in real terms. During the crisis the government assumed control of the banks, which they did not begin to sell back to the public until 1993. We compare 1993 bank share prices after the banks were partially re-listed on the stock market values were$10 billion lower than in 1983, a decline born by pre-crisis shareholders ($4 billion) and by taxpayers ($6 billion). Of this latter amount, two-thirds represent a transfer from the government to the shareholders, while approximately one-third represents an efficiency loss- and hence a direct cost- resulting from government ownership of the banks for 10 years following the crisis. The results highlight the risk inherent in a banking system that is both concentrated and universal and illustrates the costs associated with sustained government ownership

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

Adding many Baumgartner clubs

I define a homogeneous ℵ2–c.c. proper product forcing for adding many clubs of ω1 with finite conditions. I use this forcing to build models of b(ω1)=ℵ2, together with d(ω1) and 2ℵ0 large and with very strong failures of club guessing at ω1