Related papers: A beginner's guide to forcing

In this paper, we propose a model for building natural language explanations for Bayesian Network Reasoning in terms of factor arguments, which are argumentation graphs of flowing evidence, relating the observed evidence to a target…

Proof search has been used to specify a wide range of computation systems. In order to build a framework for reasoning about such specifications, we make use of a sequent calculus involving induction and co-induction. These proof principles…

In a recent paper we introduced a new framework for the study of call by need computations to normal form and root-stable form in term rewriting. Using elementary tree automata techniques and ground tree transducers we obtained simple…

The technique of symmetric extensions is derived from forcing and it is one of the most important tools for studying models without the Axiom of Choice. Despite being incredibly successful since the 1960s, our understanding of the technique…

Following a paper in which the fundamental aspects of probabilistic inference were introduced by means of a toy experiment, details of the analysis of simulated long sequences of extractions are shown here. In fact, the striking performance…

This paper tackles the problem of formulating and proving the completeness of focused-like proof systems in an automated fashion. Focusing is a discipline on proofs which structures them into phases in order to reduce proof search…

Possibility theory offers a framework where both Lehmann's "preferential inference" and the more productive (but less cautious) "rational closure inference" can be represented. However, there are situations where the second inference does…

The chaotic hypothesis discussed in [GC1] is tested experimentally in a simple conduction model. Besides a confirmation of the hypothesis predictions the results suggest the validity of the hypothesis in the much wider context in which, as…

We prove some theorems about self-avoiding walks attached to an impenetrable surface (i.e. positive walks) and subject to a force. Specifically we show the force dependence of the free energy is identical when the force is applied at the…

The aim of the paper is to provide a rather gentle introduction into Donaldson-Thomas theory using quivers with potential. The reader should be familiar with some basic knowledge in algebraic or complex geometry. The text contains many…

This text is meant for analysis students who want to learn more about the effects of the axiom of choice on functional analysis, and the things that may go wrong in its absence. As this is a text aimed for analysis students, we will not…

Several scenarios used in teaching feature a rolling motion with slipping that transitions to one without through friction with the ground. We summarise these transitions by introducing an unknown impulse that is transferred to the ground.…

This paper explores the connection between two central results in the proof theory of classical logic: Gentzen's cut-elimination for the sequent calculus and Herbrands "fundamental theorem". Starting from Miller's expansion-tree-proofs, a…

We introduce a method of constructing a forcing along a simplified $(\kappa,1)$-morass such that the forcing satisfies the $\kappa$-chain condition. Alternatively, this may be seen as a method to thin out a larger forcing to get a chain…

We present an exposition of the *Chain Bounding Lemma*, which is a common generalization of both Zorn's Lemma and the Bourbaki-Witt fixed point theorem. The proofs of these results through the use of Chain Bounding are amongst the simplest…

This manuscript is written for students in introductory physics classes to address some of the common difficulties and misconceptions of the normal force, especially the relationship between normal and friction forces. Accordingly, it is…

This article introduces a Bayesian nonparametric method for quantifying the relative evidence in a dataset in favour of the dependence or independence of two variables conditional on a third. The approach uses Polya tree priors on spaces of…

The purpose of this sophomore-level textbook is twofold: to introduce the student to classical electrodynamics and, at the same time, explain in simple terms the quantum theory of conducting substances (in particular, the solid ones). The…

We prove the following theorem: For a partially ordered set Q such that every countable subset has a strict upper bound, there is a forcing notion satisfying ccc such that, in the forcing model, there is a basis of the null ideal of the…

Assuming the Continuum Hypothesis, there is a compact first countable connected space of weight aleph_1 with no totally disconnected perfect subsets. Each such space, however, may be destroyed by some proper forcing order which does not add…