Related papers: Simple forcing notions and forcing axioms
The momentum of a free massive particle, invariant under translation, thereby realizes a trivial representation of the translation group. By allowing nontrivial reps of translations, momentum changes with translation, a recipe for force.…
The class forcing theorem, which asserts that every class forcing notion $\mathbb{P}$ admits a forcing relation $\Vdash_{\mathbb{P}}$, that is, a relation satisfying the forcing relation recursion -- it follows that statements true in the…
We isolate a combinatorial property of capacities leading to a construction of proper forcings. Then we show that many classical capacities such as the Newtonian capacity satisfy the property.
In these lectures we review the motivation, principles of and (circumstantial) evidence for the program of unification of the fundamental forces. In an appendix, we review the group theory pertinent to the program.
In late 90's G.Takeuti and Y.Yasumoto gave forcing constructions for bounded arithmetic. We will reformulate their constructions using two-sort bounded arithmetic and prove the followings. 1. Generic extensions are related with P=NP…
Fairness assumptions are a valuable tool when reasoning about systems. In this paper, we classify several fairness properties found in the literature and argue that most of them are too restrictive for many applications. As an alternative…
For certain weak versions of the Axiom of Choice (most notably, the Boolean Prime Ideal theorem), we obtain equivalent formulations in terms of partial orders, and filter-like objects within them intersecting certain dense sets or…
We suggest one redefinition of common clusters of questions used to analyze student responses on the Force and Motion Conceptual Evaluation (FMCE). Our goal is to move beyond the expert/novice analysis of student learning based on…
The k-forcing number of a graph is a generalization of the zero forcing number. In this note, we give a greedy algorithm to approximate the k-forcing number of a graph. Using this dynamic approach, we give corollaries which improve upon two…
In this paper we consider first-order logic theorem proving and model building via approximation and instantiation. Given a clause set we propose its approximation into a simplified clause set where satisfiability is decidable. The…
We present a sufficient condition for irreducibility of forcing algebras and study the (non)-reducedness phenomenon. Furthermore, we prove a criterion for normality for forcing algebras over a polynomial base ring with coefficients in a…
Axiom pinpointing refers to the task of finding the specific axioms in an ontology which are responsible for a consequence to follow. This task has been studied, under different names, in many research areas, leading to a reformulation and…
Recent work in set theory indicates that there are many different notions of 'set', each captured by a different collection of axioms, as proposed by J. Hamkins in [Ham11]. In this paper we strive to give one class theory that allows for a…
Recently the second author introduced combinatorial principles that characterize supercompactness for inaccessible cardinals but can also hold true for small cardinals. We prove that the proper forcing axiom PFA implies these principles…
We present three natural combinatorial properties for class forcing notions, which imply the forcing theorem to hold. We then show that all known sufficent conditions for the forcing theorem (except for the forcing theorem itself),…
This is a survey on propositional proof complexity aimed at introducing the basics of the field with a particular focus on a method known as feasible interpolation. This method is used to construct "hard theorems" for several proof systems…
We define a nontrivial version of the square principle $\Box_\omega$, which we then show consistent by means of forcing with finite conditions. This paper has been withdrawn by the author due to the fact that the presented $\Box_\omega$ can…
We give an exposition of an iteration theorem for iterating $(<\lambda)$-closed stationary $\lambda^+$-cc forcing with supports of size $<\lambda$ and preserving these two properties. We discuss the relation of this theorem with other…
An $\aleph_1$-Souslin tree is a complicated combinatorial object whose existence cannot be decided on the grounds of ZFC alone. But 15 years after Tennenbaum and independently Jech devised notions of forcing for introducing such a tree,…
We introduce a framework for ordinal notation systems, present a family of strong yet simple systems, and give many examples of ordinals in these systems. While much of the material is conjectural, we include systems with conjectured…