Related papers: Choice axioms and Postnikov completeness
We investigate the topologies of random geometric complexes built over random points sampled on Riemannian manifolds in the so-called "thermodynamic" regime. We prove the existence of universal limit laws for the topologies; namely, the…
We give a definition of finitary type theories that subsumes many examples of dependent type theories, such as variants of Martin-L\"of type theory, simple type theories, first-order and higher-order logics, and homotopy type theory. We…
This tutorial deal with the Axiom of Choice and some of its applications to topics related to Computer Science. We will see that the Axiom of Choice is equivalent to some well-known proof principles like Zorn's Lemma or Tuckey's Maximality…
We consider the question of extending propositional logic to a logic of plausible reasoning, and posit four requirements that any such extension should satisfy. Each is a requirement that some property of classical propositional logic be…
We prove extension-dimensional versions of finite dimensional selection and approximation theorems. As applications, we obtain several results on extension dimension.
Within the framework of Zermelo-Fraenkel set theory without the Axiom of Choice, we establish equivalents to the assertion "the union of a countable collection of finite sets is countable" in the context of metric spaces, probability…
We prove two theorems on cohomologically complete complexes. These theorems are inspired by, and yield an alternative proof of, a recent theorem of P. Schenzel on complete modules.
We define a hierarchy of systems with topological completely positive entropy in the context of continuous countable amenable group actions on compact metric spaces. For each countable ordinal we construct a dynamical system on the…
We investigate Hindman- and Owings-type Ramsey-theoretic statements in Zermelo-Fraenkel set theory without the Axiom of Choice, with some occasional extra assumptions (such as the Axiom of Dependent Choice and/or the Axiom of Determinacy).…
This paper exposes a contradiction in the Zermelo-Fraenkel set theory with the axiom of choice (ZFC). While Godel's incompleteness theorems state that a consistent system cannot prove its consistency, they do not eliminate proofs using a…
We investigate infinite sets that witness the failure of certain Ramsey-theoretic statements, such as Ramsey's or (appropriately phrased) Hindman's theorem; such sets may exist if one does not assume the Axiom of Choice. We obtain very…
We prove level-by-level upper and lower bounds on the strength of determinacy for finite differences of sets in the hyperarithmetical hierarchy in terms of subsystems of finite-and transfinite-order arithmetic, extending the…
It is well known that the resolution method (for propositional logic) is complete. However, completeness proofs found in the literature use an argument by contradiction showing that if a set of clauses is unsatisfiable, then it must have a…
Modern saturation-based Automated Theorem Provers typically implement the superposition calculus for reasoning about first-order logic with or without equality. Practical implementations of this calculus use a variety of literal selections…
We establish a bijection between the set of finite topological $T_0$-spaces (or partially ordered sets) and equivalence classes of square matrices. The absolute value of the determinant or the rank of these matrices serve as simple homotopy…
We extend some results of Carderi and Le Ma\^itre on full groups in the probability context to the infinite measure one: there exists at most one Polish group topology (refining the weak topology and coarser than the uniform topology) on an…
By operations on models we show how to relate completeness with respect to permissive-nominal models to completeness with respect to nominal models with finite support. Models with finite support are a special case of permissive-nominal…
We study propositional and first-order G\"odel logics over infinitary languages which are motivated semantically by corresponding interpretations into the unit interval [0,1]. We provide infinitary Hilbert-style calculi for the particular…
We define unstable $p$-completion in general $\infty$-topoi and the unstable motivic homotopy category, and prove that the $p$-completion of a nilpotent sheaf or motivic space can be computed on its Postnikov tower. We then show that the…
Every $(\infty, n)$-category can be approximated by its tower of homotopy $(m, n)$-categories. In this paper, we prove that the successive stages of this tower are classified by k-invariants, analogously to the classical Postnikov tower for…