Related papers: Yablo's paradox and forcing
For half a century, authors have weakened the rule of necessitation in various more or less ad hoc ways in order to make inconsistent systems consistent. More recently, necessitation was weakened in a systematic way, not for the purpose of…
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…
Recently, the educational initiative TED-Ed has published a popular brain teaser coined the 'frog riddle', which illustrates non-intuitive implications of conditional probabilities. In its intended form, the frog riddle is a reformulation…
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…
If T has only countably many complete types, yet has a type of infinite multiplicity then there is a ccc forcing notion Q such that, in any Q --generic extension of the universe, there are non-isomorphic models M_1 and M_2 of T that can be…
The purpose of this paper is to investigate forcing as a tool to construct universal models. In particular, we look at theories of initial segments of the universe and show that any model of a sufficiently rich fragment of those theories…
We show that self-reference can be formalized in Basic logic by means of the new connective @, called "entanglement". In fact, the property of non-idempotence of the connective @ is a metatheorem, which states that a self-entangled sentence…
We apply a general approach for distributions of binary isolating and semi-isolating formulas to the class of strongly minimal theories.
For $\lambda$ inaccessible, we may consider $(< \lambda)$-support iteration of some specific $(<\lambda)$-complete $\lambda^+$-c.c. forcing notion. But this fails a "preservation by restricting to a sub-sequence of the forcing, we "correct"…
The Steprans forcing notion arises as a quotient of Borel sets modulo the ideal of $\sigma$-continuity of a certain Borel not $\sigma$-continuous function. We give a characterization of this forcing in the language of trees and using this…
We study methods to obtain the consistency of forcing axioms, and particularly higher forcing axioms. We first force over a model with a supercompact cardinal $\theta>\kappa$ to get the consistency of the forcing axiom for $\kappa$-strongly…
Russell's paradox is the most easily understandable way to illustrate the inconsistency of na\"ive set theory. This note proposes a direct encoding of Russell's paradox with type-in-type universe, sigma types, and either extensional…
An ultimate universal theory -- a complete theory that accounts, via few and simple first principles, for all the phenomena already observed and that will ever be observed -- has been, and still is, the aspiration of most physicists and…
This paper is motivated by the questions of how to give the concept of probability an adequate real-world meaning, and how to explain a certain type of phenomenon that can be found, for instance, in Ellsberg's paradox. It attempts to answer…
In this paper we present three simple applications of probability and highlight and discuss their paradoxical flavour.
The paradoxes of thermodynamics and statistical physics are unavoidable in the study of physical paradoxes because of their importance at the time they came to be as well as the frequency of their appearance in historical studies of…
Various paradoxes about the relativity theory have been developed since the birth of this theory. Each paradox somewhat shows people's query about the relativity theory, and solving of each paradox demonstrates the correctness of relativity…
Robin's Conjecture is strengthened, deformed, and proved. Nicolas conjecture follows.
Given a Fra\"{i}ss\'{e} class $\mathcal{K}$ and an infinite cardinal $\kappa,$ we define a forcing notion which adds a structure of size $\kappa$ using elements of $\mathcal{K}$, which extends the Fra\"{i}ss\'{e} construction in the case…
We study self-referential sentences of the type related to the Liar paradox. In particular, we consider the problem of assigning consistent fuzzy truth values to collections of self-referential sentences. We show that the problem can be…