Related papers: Biba's trick, with applications
We lay the ground for an Isabelle/ZF formalization of Cohen's technique of forcing. We formalize the definition of forcing notions as preorders with top, dense subsets, and generic filters. We formalize the definition of forcing notions as…
Lists, multisets, and sets are well-known data structures whose usefulness is widely recognized in various areas of Computer Science. These data structures have been analyzed from an axiomatic point of view with a parametric approach in (*)…
The class of O-metric spaces generalize several existing metric-types in literature including metric spaces, b-metric spaces, and ultra metric spaces. In this paper, we discuss the properties of the topology induced by an O-metric and…
We look for a parallel to the notion of ``proper forcing'' among lambda-complete forcing notions not collapsing lambda^+ . We suggest such a definition and prove that it is preserved by suitable iterations.
We prove metric rigidity for complete manifolds supporting solutions of certain second order differential systems, thus extending classical works on a characterization of space-forms. In the route, we also discover new characterizations of…
Orthogonal array based space-filling designs (Owen [Statist. Sinica 2 (1992a) 439-452]; Tang [J. Amer. Statist. Assoc. 88 (1993) 1392-1397]) have become popular in computer experiments, numerical integration, stochastic optimization and…
We describe a realizability framework for classical first-order logic in which realizers live in (a model of) typed {\lambda}{\mu}-calculus. This allows a direct interpretation of classical proofs, avoiding the usual negative translation to…
Explanations of the replication crisis often emphasize misconduct, questionable research practices, or incentive misalignment, implying that behavioral reform is sufficient. This paper argues that a substantial component is architectural:…
This article continues Roslanowski and Shelah math.LO/9906024 and 1105.6049 We introduce here yet another property of (<lambda)-strategically complete forcing notions which implies that their lambda-support iterations do not collapse…
As already observed by Gabriel, coherent sheaves on schemes obtained by gluing affine open subsets can be described by a simple gluing construction. An example due to Ferrand shows that this fails in general for pushouts along closed…
A local Tb Theorem provides a flexible framework for proving the boundedness of a Calder\'on-Zygmund operator T. One needs only boundedness of the operator T on systems of locally pseudo-accretive functions \{b_Q\}, indexed by cubes. We…
Over the past two decades several fragments of first-order logic have been identified and shown to have good computational and algorithmic properties, to a great extent as a result of appropriately describing the image of the standard…
One of the important ways development takes place in mathematics is via a process of generalization. On the basis of a recent characterization of this process we propose a principle that generalizations of mathematical structures that are…
This survey paper examines the effective model theory obtained with the BSS model of real number computation. It treats the following topics: computable ordinals, satisfaction of computable infinitary formulas, forcing as a construction…
Hara and Yoshida introduced a notion of $\aaa$-tight closure in 2003, and they proved that the test ideals given by this operation correspond to multiplier ideals. However, their operation is not a true closure. The alternative operation…
We give arguments for and prove the consistency of some internal forcing axioms.
A forcing extension may create new isomorphisms between two models of a first order theory. Certain model theoretic constraints on the theory and other constraints on the forcing can prevent this pathology. A countable first order theory is…
We consider $(<\lambda)$-support iterations of a version of $(<\lambda)$-strategically complete $\lambda^+$-c.c. definable forcing notions along partial orders. We show that such iterations can be corrected to yield an analog of a result by…
We consider the problem of formalizing the familiar notion of widening in abstract interpretation in higher-order logic. It turns out that many axioms of widening (e.g. widening sequences are ascending) are not useful for proving…
This paper proposes a totally constructive approach for the proof of Hilbert's theorem on ternary quartic forms. The main contribution is the ladder technique, with which the Hilbert's theorem is proved vividly.