Related papers: A beginner's guide to forcing
We introduce a generalized notion of inference system to support more flexible interpretations of recursive definitions. Besides axioms and inference rules with the usual meaning, we allow also coaxioms, which are, intuitively, axioms which…
We derive an effective field theory for a type-II fracton starting from the Haah code on the lattice. The effective topological theory is not given exclusively in terms of an action; it must be supplemented with a condition that selects…
In functional programming, datatypes a la carte provide a convenient modular representation of recursive datatypes, based on their initial algebra semantics. Unfortunately it is highly challenging to implement this technique in proof…
Assume $\kappa = \kappa^{< \kappa}$ (usually $\aleph_0$ or an inaccessible). We shall deal with iterated forcings preserving ${}^{\kappa>}{\rm Ord}$ and not collapsing cardinals along a linear order $L$. A sufficient condition for this,…
In teaching the physical sciences, a significant challenge lies in the student's tendency to consider the scientific world and the "real" world as separate. For example, Newton's 1st Law of Motion states that an object in motion remains in…
This is a short introduction of the exterior form formalism focus on its applications in physics and then mostly aimed to physics students. As a rule of a game played here we never use a coordinate frame neither in the definitions nor in…
This paper is concerned with test of the conditional independence. We first establish an equivalence between the conditional independence and the mutual independence. Based on the equivalence, we propose an index to measure the conditional…
Reinforcement learning is an essential paradigm for solving sequential decision problems under uncertainty. Despite many remarkable achievements in recent decades, applying reinforcement learning methods in the real world remains…
We introduce the notion of implicative algebra, a simple algebraic structure intended to factorize the model constructions underlying forcing and realizability (both in intuitionistic and classical logic). The salient feature of this…
This is the first in a series of two works which study the discrete Gaussian free field on the binary tree when all leaves are conditioned to be positive. In this work, we obtain sharp asymptotics for the probability of this "hard-wall…
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 have developed a web-based pedagogical proof assistant, the Proof Tree Builder, that lets you apply rules upwards from the initial goal in sequent calculus and Hoare logic for a simple imperative language. We equipped our tool with a…
This is an overview about a method of constructing ccc forcings: Suppose first that a continuous, commutative system of complete embeddings between countable forcings indexed along $\omega_1$ is given. Then its direct limit satisfies ccc by…
We consider testing whether a set of Gaussian variables, selected from the data, is independent of the remaining variables. We assume that this set is selected via a very simple approach that is commonly used across scientific disciplines:…
In this paper we propose a hypothesis about how different uses of maintaining dragging, either as a physical tool in a dynamic geometry environment or as a psychological tool for generating conjectures can influence subsequent processes of…
In this paper some proof theory for propositional Lax Logic is developed. A cut free terminating sequent calculus is introduced for the logic, and based on that calculus it is shown that the logic has uniform interpolation. Furthermore, a…
Many innovations are inspired by past ideas in a non-trivial way. Tracing these origins and identifying scientific branches is crucial for research inspirations. In this paper, we use citation relations to identify the descendant chart,…
We present a light formalism for proofs that encodes their inferential structure, along with a system that transforms these representations into flow-chart diagrams. Such diagrams should improve the comprehensibility of proofs. We discuss…
We present a general framework for forcing on $\omega_2$ with finite conditions using countable models as side conditions. This framework is based on a method of comparing countable models as being membership related up to a large initial…
Many versions of the Stokes theorem are known. More advanced of them require complicated mathematical machinery to be formulated which discourages the users. Our theorem is sufficiently simple to suit the handbooks and yet it is pretty…