Related papers: Unprepared Indestructibility
These are the lecture notes of an introductory course on ordinal analysis. Our selection of topics is guided by the aim to give a complete and direct proof of a mathematical independence result: Kruskal's theorem for binary trees is…
We present a general formal argumentation system for dealing with the detachment of conditional obligations. Given a set of facts, constraints, and conditional obligations, we answer the question whether an unconditional obligation is…
Starting from arbitrary sets of quantum states and measurements, referred to as the prepare-and-measure scenario, an operationally noncontextual ontological model of the quantum statistics associated with the prepare-and-measure scenario is…
In this paper we study the logical foundations of automated inductive theorem proving. To that aim we first develop a theoretical model that is centered around the difficulty of finding induction axioms which are sufficient for proving a…
We introduce finite support iterations of symmetric systems, and use them to provide a strongly modernized proof of David Pincus' classical result that the axiom of dependent choice is independent over ZF with the ordering principle…
We introduce bounded category forcing axioms for well-behaved classes $\Gamma$. These are strong forms of bounded forcing axioms which completely decide the theory of some initial segment of the universe $H_{\lambda_\Gamma^+}$ modulo…
According to mathematical constructivism, a mathematical object can exist only if there is a way to compute (or "construct") it; so, what is non-computable is non-constructive. In the example of the quantum model, whose Fock states are…
We study mechanism which operate on ordinal preference information (i.e., rank ordered lists of alternatives) on the full domain of weak preferences that admits indifferences. We present a novel decomposition of strategyproofness into three…
Makienko's conjecture, a proposed addition to Sullivan's dictionary, can be stated as follows: The Julia set of a rational function R has buried points if and only if no component of the Fatou set is completely invariant under the second…
Two known results on the relationship between conditional and unconditional independence are obtained as a consequence of the main result of this paper, a theorem that uses independence of Markov kernels to obtain a minimal condition which…
Given a cardinal $\lambda$, category forcing axioms for $\lambda$-suitable classes $\Gamma$ are strong forcing axioms which completely decide the theory of the Chang model $\mathcal C_\lambda$, modulo generic extensions via forcing notions…
A structural analysis of construction schemes is developed. That analysis is used to give simple and new constructions of combinatorial objects which have been of interest to set theorists and topologists. We then continue the study of…
We introduce a new topological generalization of the $\sigma$-projective hierarchy, not limited to Polish spaces. Earlier attempts have replaced $^{\omega}\omega$ by $^{\kappa}\kappa$, for $\kappa$ regular uncountable, or replaced countable…
The status of the usual statement of the Fradkin-Vilkovisky theorem, claiming complete independence of the Batalin-Fradkin-Vilkovisky path integral on the gauge fixing "fermion" even within a nonperturbative context, is critically…
Given a module $X$ and a regular cardinal $\kappa$ we study various notions of $(\kappa,\mathrm{Add}(X))$-freeness and $(\kappa,\mathrm{Add}(X))$-separability. Bearing on appropriate set-theoretic assumptions, we construct a non-trivial…
A brief introduction to the theory of ordered sets and lattice theory is given. To illustrate proof techniques in the theory of ordered sets, a generalization of a conjecture of Daykin and Daykin, concerning the structure of posets that can…
In this paper we introduce a tree-like forcing notion extending some properties of the random forcing in the context of the generalised Cantor space and study its associated ideal of null sets and notion of measurability. This issue was…
It is useful to have a criterion for when the predictions of an operational theory should be considered classically explainable. Here we take the criterion to be that the theory admits of a generalized-noncontextual ontological model.…
For certain uncountable cardinals $\kappa$ we produce a group of cardinality $\kappa$ which is freely indecomposable, strongly $\kappa$-free, and whose abelianization is free abelian of rank $\kappa$. The construction takes place in…
I use mechanized verification to examine several first- and higher-order formalizations of Anselm's Ontological Argument against the charge of begging the question. I propose three different but related criteria for a premise to beg the…