Related papers: Relating forcing relations
The first-order logical environment FOLE [5] provides a rigorous and principled approach to distributed interoperable first-order information systems. FOLE has been developed in two forms: a classification form and an interpretation form.…
Boolean-valued models of set theory were independently introduced by Scott, Solovay and Vop\v{e}nka in 1965, offering a natural and rich alternative for describing forcing. The original method was adapted by Takeuti, Titani, Kozawa and…
The method of realizability was first developed by Kleene and is seen as a way to extract computational content from mathematical proofs. Traditionally, these models only satisfy intuitionistic logic, however this method was extended by…
Relation Extraction (RE) aims to label relations between groups of marked entities in raw text. Most current RE models learn context-aware representations of the target entities that are then used to establish relation between them. This…
We investigate lifted inference on ordered domains with predecessor relations, where the elements of the domain respect a total (cyclic) order, and every element has a distinct (clockwise) predecessor. Previous work has explored this…
In this paper I study the connection between logic and metaphysics in Plato's participation theory, from the structural properties of the latter. Although Plato was the first ever to formulate the contradiction principle explicitly (in the…
We formalize the theory of forcing in the set theory framework of Isabelle/ZF. Under the assumption of the existence of a countable transitive model of ZFC, we construct a proper generic extension and show that the latter also satisfies…
Computing the probability of a formula given the probabilities or weights associated with other formulas is a natural extension of logical inference to the probabilistic setting. Surprisingly, this problem has received little attention in…
The forcing method is a powerful tool to prove the consistency of set-theoretic assertions relative to the consistency of the axioms of set theory. Laver's theorem and Bukovsk\'y's theorem assert that set-generic extensions of a given…
In this thesis (modal) dependence logic is investigated. It was introduced in 2007 by Jouko V\"a\"aan\"anen as an extension of first-order (resp. modal) logic by the dependence operator =(). For first-order (resp. propositional) variables…
Let $\mathcal{N}$ be the $\sigma$-ideal of the null sets of reals. We introduce a new property of forcing notions that enable control of the additivity of $\mathcal{N}$ after finite support iterations. This is applied to answer some open…
We analyze the forcing notion $\mathcal P$ of finite matrices whose rows consists of isomorphic countable elementary submodels of a given structure of the form $H_{\theta}$. We show that forcing with this poset adds a Kurepa tree $T$.…
Boyer and Moore have discussed a recursive function that puts conditional expressions into normal form [1]. It is difficult to prove that this function terminates on all inputs. Three termination proofs are compared: (1) using a measure…
We define typical forcings encompassing many informal forcing arguments in bounded arithmetic and give general conditions for such forcings to produce models of the universal variant of relativized $T^1_2$. We apply this result to study the…
We introduce a new method for building models of CH, together with $\Pi_2$ statements over $H(\omega_2)$, by forcing. Unlike other forcing constructions in the literature, our construction adds new reals, although only $\aleph_1$-many of…
Charles Peirce develops a scheme for classifying different kinds of monadic, dyadic and triadic relations. His account of these different classes of relations figures prominently in the development of his algebraic and diagrammatic systems…
Philosophical analyses of causation take many forms but one major difficulty they all aim to address is that of the spatio-temporal continuity between causes and their effects. Bertrand Russell in 1913 brought the problem to its most…
Computational analysis of time-course data with an underlying causal structure is needed in a variety of domains, including neural spike trains, stock price movements, and gene expression levels. However, it can be challenging to determine…
The classical theory of electrodynamics is built upon Maxwell's equations and the concepts of electromagnetic field, force, energy, and momentum, which are intimately tied together by Poynting's theorem and the Lorentz force law. Whereas…
Category theory provides a means through which many far-ranging fields of mathematics can be related by their similar structure. In a paper by Robinson [2], this interconnectivity afforded by categorical perspectives allowed for the…