English
Related papers

Related papers: Constructing the Constructible Universe Constructi…

200 papers

The standard axioms of set theory, the Zermelo-Fraenkel axioms (ZFC), do not suffice to answer all questions in mathematics. While this follows abstractly from Kurt G\"odel's famous incompleteness theorems, we nowadays know numerous…

Logic · Mathematics 2024-06-04 Sandra Müller

Cubical type theory provides a constructive justification to certain aspects of homotopy type theory such as Voevodsky's univalence axiom. This makes many extensionality principles, like function and propositional extensionality, directly…

Logic in Computer Science · Computer Science 2018-05-02 Thierry Coquand , Simon Huber , Anders Mörtberg

We present a new coherence theorem for comprehension categories, providing strict models of dependent type theory with all standard constructors, including dependent products, dependent sums, identity types, and other inductive types.…

Logic · Mathematics 2016-04-20 Peter LeFanu Lumsdaine , Michael A. Warren

Does space stretch its contents as the universe expands? Usually we say the answer is no - the stretching of space is not like the stretching of a rubber sheet that might drag things with it. In this paper we explore a potential counter…

Cosmology and Nongalactic Astrophysics · Physics 2020-08-27 Aaron Glanville , Tamara Davis

When can a model of a physical system be regarded as computable? We provide the definition of a computable physical model to answer this question. The connection between our definition and Kreisel's notion of a mechanistic theory is…

Logic · Mathematics 2013-08-09 Matthew P. Szudzik

We study a conservative extension of classical propositional logic distinguishing between four modes of statement: a proposition may be affirmed or denied, and it may be strong or classical. Proofs of strong propositions must be…

Logic in Computer Science · Computer Science 2021-04-19 Pablo Barenbaum , Teodoro Freund

In the constructible universe, we construct a co-analytic maximal family of pairwise eventually different functions from $\mathbb{N}$ to $\mathbb{N}$ which remains maximal after adding arbitrarily many Sacks reals (by a countably supported…

Logic · Mathematics 2022-10-07 Vera Fischer , David Schrittesser

Natural philosophy integrates scientific observation with abstract frameworks, often using a mathematical Ansatz to hypothesise about physical phenomena. Exploring the possibility of other universes, however, challenges assumptions that…

History and Philosophy of Physics · Physics 2026-01-21 Jonathan M. M. Hall

The no-supervenience theorem limits the capacity of physicalist theories to provide a comprehensive account of human consciousness. The proof of the theorem is difficult to formalize because it relies on both alethic and epistemic notions…

Neurons and Cognition · Quantitative Biology 2024-11-13 Cathy M Reason

An inner model M is MINIMAL if there is a class A such that <M,A> is amenable yet has no transitive proper elementary submodel. We study minimal universes in the context of 0#. For example we prove: If 0# exists then there is an inner model…

Logic · Mathematics 2008-02-03 Sy D. Friedman

When we want to predict the future, we compute it from what we know about the present. Specifically, we take a mathematical representation of observed reality, plug it into some dynamical equations, and then map the time-evolved result back…

Quantum Physics · Physics 2015-01-29 Ken Wharton

The formation of structure in the Universe offers some of the most powerful evidence in favour of the existence of dark matter in the Universe. We summarize recent work by ourselves and our collaborators, using linear and quasi-linear…

Astrophysics · Physics 2007-05-23 Andrew R Liddle , Pedro T P Viana

We extend the usual theory of universal C*-algebras from generators and relations in order to allow some relations to be described using the strong operator topology. In particular, we can allow some infinite sum relations. We prove a…

Operator Algebras · Mathematics 2020-08-13 Giuliano Boava , Gilles G. de Castro

Functors with an instance of the Traversable type class can be thought of as data structures which permit a traversal of their elements. This has been made precise by the correspondence between traversable functors and finitary containers…

Logic in Computer Science · Computer Science 2022-07-21 Gershom Bazerman

We present a set-theoretic, proof-irrelevant model for Calculus of Constructions (CC) with predicative induction and judgmental equality in Zermelo-Fraenkel set theory with an axiom for countably many inaccessible cardinals. We use Aczel's…

Logic in Computer Science · Computer Science 2015-07-01 Gyesik Lee , Benjamin Werner

We construct the universal type structure for conditional probability systems without any topological assumption, namely a type structure that is terminal, belief-complete, and non-redundant. In particular, in order to obtain the…

Logic in Computer Science · Computer Science 2017-08-02 Pierfrancesco Guarino

Constructor theory asserts that the laws of physics are expressible as specifications of which transformations of physical systems can or cannot be brought about with unbounded accuracy by devices capable of operating in a cycle…

Quantum Physics · Physics 2025-05-16 David Deutsch , Chiara Marletto

We discuss an unusual consequence of the behaviour of general relativistic cosmological models when they initial value problem is not well-posed because of the lack of the local Lipschitz condition. A new type of 'zero universe' arises with…

General Relativity and Quantum Cosmology · Physics 2020-08-13 John D. Barrow

We discuss the problems of incompleteness and inexpressibility. We introduce almost self-referential formulas, use them to extend set theory, and relate their expressive power to that of infinitary logic. We discuss the nature of proper…

Logic · Mathematics 2016-12-20 Dmytro Taranovsky

Solomonoff's inductive learning model is a powerful, universal and highly elegant theory of sequence prediction. Its critical flaw is that it is incomputable and thus cannot be used in practice. It is sometimes suggested that it may still…

Artificial Intelligence · Computer Science 2007-05-23 Shane Legg