Related papers: Choice axioms and Postnikov completeness
We take a fresh look at the logics of informational dependence and independence of Hintikka and Sandu and Vaananen, and their compositional semantics due to Hodges. We show how Hodges' semantics can be seen as a special case of a general…
A discussion of homotopy limits of (1-)stacks, with an emphasis on fixed point stacks.
We construct the universal type structure for conditional probability systems without any topological assumption, namely a type structure that is terminal, belief-complete, and non-redundant. In particular, in order to obtain the…
This work deals with the definability problem by quantifier-free first-order formulas over a finite algebraic structure. We show the problem to be coNP-complete and present two decision algorithms based on a semantical characterization of…
Recent work by Faizal et al. (2025) claims that G\"odelian undecidability of non-algorithmic truths in our universe imply the impossibility of a formal, algorithmic simulation of the universe. This paper clarifies the distinction between…
Our main result (Theorem A) shows the incompleteness of any consistent sequential theory T formulated in a finite language such that T is axiomatized by a collection of sentences of bounded quantifier-alternation-depth. Our proof employs an…
We provide base change theorems, projection formulae and Verdier duality for both cohomology and homology in the context of finite topological spaces
Systems of orthogonal polynomials whose recurrence coefficients tend to infinity are considered. A summability condition is imposed on the coefficients and the consequences for the measure of orthogonality are discussed. Also discussed are…
A method is given for quantitatively rating the social acceptance of different options which are the matter of a preferential vote. In contrast to a previous article, here the individual votes are allowed to be incomplete, that is, they…
We introduce the concept of topological finite-determinacy for germs of analytic functions within a fixed ideal $I$, which provides a notion of topological finite-determinacy of functions with non-isolated singularities. We prove the…
In this paper, we present a propositional logic (called mixed logic) containing disjoint copies of minimal, intuitionistic and classical logics. We prove a completeness theorem for this logic with respect to a Kripke semantics. We establish…
We give sound and complete Hilbert-style axiomatizations for propositional dependence logic (PD), modal dependence logic (MDL), and extended modal dependence logic (EMDL) by extending existing axiomatizations for propositional logic and…
We discuss an universal bordism invariant obtained from the Atiyah-Patodi-Singer eta-invariant from the analytic and homotopy theoretic point of view. Classical invariants like the Adams e-invariant, $\rho$-invariants and $String$-bordism…
Using recent results in topos theory, two systems of higher-order logic are shown to be complete with respect to sheaf models over topological spaces---so-called ``topological semantics''. The first is classical higher-order logic, with…
By the work of Brodzki-Niblo-Nowak-Wright and Monod, topological amenability of a continuous group action can be characterized using uniformly finite homology groups or bounded cohomology groups associated to this action. We show that…
Cubical type theory provides a constructive justification to certain aspects of homotopy type theory such as Voevodsky's univalence axiom. This makes many extensionality principles, like function and propositional extensionality, directly…
We search for some splitting (resp. finiteness) criteria of a given module $M$ over a local ring $(R,\fm,k)$ in terms of the splitting (resp. finiteness) property of certain cohomological functors evaluated at $M$. In particular, we deal…
This paper is devoted to study the qualitative properties of hybrid measure differential equations (HMDEs, for short). We establish several results on the existence of global solutions, including the existence of regulated, continuous,…
We show that for a gradable finite dimensional algebra the perfect complexes and bounded derived category cannot be distinguished by homotopy invariants.
We use the hook lengths of a partition to define two rectangular tableaux. We prove these tableaux have equal multisets of entries, first by elementary combinatorial arguments, and then using Stanley's Hook Content Formula and symmetric…