English
Related papers

Related papers: Constructing the Constructible Universe Constructi…

200 papers

In "Extensional realizability for intuitionistic set theory", we introduced an extensional variant of generic realizability, where realizers act extensionally on realizers, and showed that this form of realizability provides "inner" models…

Logic · Mathematics 2024-12-10 Emanuele Frittaion

This article explores the model-dependent nature of set cardinality, emphasizing that cardinality is not absolute but varies across different axiomatic frameworks. Although Cantor's diagonal argument shows the real numbers are…

Logic · Mathematics 2025-06-10 Slavica Mihaljevic Vlahovic , Branislav Dobrasin Vlahovic

This paper focuses on a constructive treatment of the mathematical formalism of quantum theory and a possible role of constructivist philosophy in resolving the foundational problems of quantum mechanics, particularly, the controversy over…

Quantum Physics · Physics 2016-05-25 Arkady Bolotin

We construct a realizability model of linear dependent type theory from a linear combinatory algebra. Our model motivates a number of additions to the type theory. In particular, we add a universe with two decoding operations: one takes…

Logic in Computer Science · Computer Science 2026-02-10 Sam Speight , Niels van der Weide

An introduction to modern theories for the origin of structure in the Universe is given. After a brief review of the growth of cosmological perturbations in an expanding Universe and a summary of some important observational results, the…

Astrophysics · Physics 2008-02-03 Robert H. Brandenberger

We study subfields of large fields which are generated by infinite existentially definable subsets. We say that such subfields are existentially generated. Let $L$ be a large field of characteristic exponent $p$, and let $E\subseteq L$ be…

Logic · Mathematics 2017-10-11 Sylvy Anscombe

We define a class of higher inductive types that can be constructed in the category of sets under the assumptions of Zermelo-Fraenkel set theory without the axiom of choice or the existence of uncountable regular cardinals. This class…

Logic · Mathematics 2022-02-07 Andrew Swan

We generalize Fitting's work on Intuitionistic Kripke models of Set Theory using Ono and Komori's Residuated Kripke models. Based on these models, we provide a generalization of the von Neumann hierarchy in the context of Modal Residuated…

Logic · Mathematics 2024-05-09 Jose Moncayo , Pedro H. Zambrano

We present constructive provability logic, an intuitionstic modal logic that validates the L\"ob rule of G\"odel and L\"ob's provability logic by permitting logical reflection over provability. Two distinct variants of this logic, CPL and…

Logic in Computer Science · Computer Science 2012-05-30 Robert J. Simmons , Bernardo Toninho

We prove that the theory of the models constructible using finitely many cofinality quantifiers - $C_{\lambda_{1},...,\lambda_{n}}^{*}$ and $C_{<\lambda_{1},...,<\lambda_{n}}^{*}$ for $\lambda_{1},...,\lambda_{n}$ regular cardinals - is…

Logic · Mathematics 2021-12-03 Ur Ya'ar

We define a certain finite set in set theory $\{x\mid\varphi(x)\}$ and prove that it exhibits a universal extension property: it can be any desired particular finite set in the right set-theoretic universe and it can become successively any…

Logic · Mathematics 2018-06-21 Joel David Hamkins , W. Hugh Woodin

We study a new proof principle in the context of constructive Zermelo-Fraenkel set theory based on what we will call "non-deterministic inductive definitions". We give applications to formal topology as well as a predicative justification…

Logic · Mathematics 2012-09-17 Benno van den Berg

We consider the possibility of a past and future eternal universe, constructing geodesically complete inflating, loitering, and bouncing spacetimes. We identify the constraints energy conditions in General Relativity place on the building…

High Energy Physics - Theory · Physics 2025-08-25 Damien A. Easson , Joseph E. Lesnefsky

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…

Logic · Mathematics 2025-03-07 Francesco Parente , Matteo Viale

In two papers we noted that in common practice many algebraic constructions are defined only `up to isomorphism' rather than explicitly. We mentioned some questions raised by this fact, and we gave some partial answers. The present paper…

Logic · Mathematics 2007-05-23 Wilfrid Hodges , Saharon Shelah

It is well known that in Zermelo-Fraenkel (ZF) set theory any finite set is decidable. In this paper we discuss an extension of ZF where this result is no longer valid. Such an extension is quasi-set theory and it has its origin on problems…

Quantum Physics · Physics 2007-05-23 Adonai S. Sant'Anna

Based on the cosmological results of the Planck Mission, we show that all parameters describing our Universe within the \Lambda CDM model can be constructed from a small set of numbers known from conspiracy theory. Our finding is confirmed…

Popular Physics · Physics 2013-11-25 Jörg P. Rachen , Ute G. Gahlings

We propose a natural theory SO axiomatizing the class of sets of ordinals in a model of ZFC set theory. Both theories possess equal logical strength. Constructibility theory in SO corresponds to a natural recursion theory on ordinals.

Logic · Mathematics 2007-05-23 Peter Koepke , Martin Koerwien

The apparent impossibility of extending non-relativistic quantum mechanics to a relativistic quantum theory is shown to be due to the insufficient structural richness of the field of complex numbers over which quantum mechanics is built. A…

General Physics · Physics 2012-04-17 Emile Grgin

Interactive theorem provers based on dependent type theory have the flexibility to support both constructive and classical reasoning. Constructive reasoning is supported natively by dependent type theory and classical reasoning is typically…

Logic in Computer Science · Computer Science 2011-10-18 Russell O'Connor