Related papers: Choice axioms and Postnikov completeness

We extend Kolchin's results on linear dependence over projective varieties in the constants, to linear dependence over arbitrary complete differential varieties. We show that in this more general setting, the notion of linear dependence…

We consider probabilistic automata on infinite words with acceptance defined by safety, reachability, B\"uchi, coB\"uchi, and limit-average conditions. We consider quantitative and qualitative decision problems. We present extensions and…

We compare the classical approach of constructing finite Postnikov systems by k-invariants and the global approach of Dwyer, Kan, and Smith. We concentrate on the case of 3-stage Postnikov pieces and provide examples where a classification…

We study the multiagent epistemic logic CMAELCD with operators for common and distributed knowledge for all coalitions of agents. We introduce Hintikka structures for this logic and prove that satisfiability in such structures is equivalent…

For several computational problems in homotopy theory, we obtain algorithms with running time polynomial in the input size. In particular, for every fixed k>1, there is a polynomial-time algorithm that, for a 1-connected topological space X…

We characterize H-spaces which are p-torsion Postnikov pieces of finite type by a cohomological property together with a necessary acyclicity condition. When the mod p cohomology of an H-space is finitely generated as an algebra over the…

In this article we consider alternative definitions-descriptions of a set being Infinite within the primitive Axiomatic System of Zermelo.

Motivated by the analysis and geometry of metric-measure structures in infinite dimensions, we study the category of extended metric-topological spaces, along with many of its distinguished subcategories (such as the one of compact spaces).…

Bernays introduced a method for proving underivability results in propositional calculi by truth tables. In general, this motivates an investigations of how to find, given a propositional logic, a finite-valued logic which has as few…

The predicate complementary to the well-known Godel's provability predicate is defined. From its recursiveness new consequences concerning the incompleteness argumentation are drawn and extended to new results of consistency, completeness…

The famous G\"odel incompleteness theorem states that for every consistent sufficiently rich formal theory T there exist true statements that are unprovable in T. Such statements would be natural candidates for being added as axioms, but…

We present a unified categorical treatment of completeness theorems for several classical and intuitionistic infinitary logics with a proposed axiomatization. This provides new completeness theorems and subsumes previous ones by G\"odel,…

We introduce the notion of an accessible $\infty$-cosmos and prove that these include the basic examples of $\infty$-cosmoi and are stable under the main constructions. A consequence is that the vast majority of known examples of…

Let $K$ be a perfect field and let $E$ be a homotopy commutative ring spectrum in the Morel-Voevodsky stable motivic homotopy category $\mathcal{SH}(K)$. In this work we investigate the relation between the $E$-homology localization and…

This paper studies the homotopy theory of algebras and homotopy algebras over an operad. It provides an exhaustive description of their higher homotopical properties using the more general notion of morphisms called infinity-morphisms. The…

We provide elementary proofs of several results concerning the possible outcomes arising from a fixed profile within the class of positional voting systems. Our arguments enable a simple and explicit construction of paradoxical profiles,…

Topological models of empirical and formal inquiry are increasingly prevalent. They have emerged in such diverse fields as domain theory [1, 16], formal learning theory [18], epistemology and philosophy of science [10, 15, 8, 9, 2],…

Many of the properties of sectional category, topological complexity and homotopic distance are in fact derived from a small number of basic properties, which, once established, lead to all the others without further recourse to topology.…

We show that the monodromy operator at infinity plus the decomposition of the homology given by the vanishing cycles completely determine the homology monodromy representation of any complex polynomial.

We present a version of G\"odel's Second Incompleteness Theorem for recursively enumerable consistent extensions of a fixed axiomatizable theory, by incorporating some bi-theoretic version of the derivability conditions. We also argue that…