English
Related papers

Related papers: Constructing the Constructible Universe Constructi…

200 papers

We study the structure of an idempotent matrix $F$ over a commutative ring. We make explicit the fundamental system of orthogonal idempotents, hidden in this matrix, for each of which the matrix has a well-defined rank. Similarly we find a…

Commutative Algebra · Mathematics 2023-08-21 Henri Lombardi

Universe structure emerges in the unreduced, complex-dynamic interaction process with the simplest initial configuration (two attracting homogeneous fields, quant-ph/9902015). The unreduced interaction analysis gives intrinsically creative…

General Physics · Physics 2007-05-23 Andrei P. Kirilyuk

We present axioms for the real numbers by omitting the field axioms and then derive the field properties of the real numbers. We prove all our theorems constructively.

Logic · Mathematics 2021-09-13 Jean S. Joseph

On the basis of what I call physico-formalist philosophy of mathematics, I will develop an amended account of the Kantian--Reichenbachian conception of constitutive a priori. It will be shown that the features (attributes, qualities,…

History and Philosophy of Physics · Physics 2019-09-04 Laszlo E. Szabo

Is the Universe (a spatial section thereof) finite or infinite? Knowing the global geometry of a Friedmann-Lema\^{\i}tre (FL) universe requires knowing both its curvature and its topology. A flat or hyperbolic (``open'') FL universe is {\em…

Astrophysics · Physics 2009-10-31 Boudewijn F. Roukema

The problem of making predictions from theories that have landscapes of possible low energy parameters is reviewed. Conditions for such a theory to yield falsifiable predictions for doable experiments are given. It is shown that the…

High Energy Physics - Theory · Physics 2007-05-23 Lee Smolin

In this paper we define intensional models for the classical theory of types, thus arriving at an intensional type logic ITL. Intensional models generalize Henkin's general models and have a natural definition. As a class they do not…

Logic · Mathematics 2007-05-23 Reinhard Muskens

We have another look at the construction by Hofmann and Streicher of a universe $(U,{\mathsf{E}l})$ for the interpretation of Martin-L\"of type theory in a presheaf category $\psh{\C}$. It turns out that $(U,{\mathsf{E}l})$ can be described…

Category Theory · Mathematics 2023-07-12 Steve Awodey

Inflationary Cosmology makes the universe ``eternal" and provides for recurrent universe creation, ad infinitum -- making it also plausible to assume that ``our" Big Bang was also preceeded by others, etc.. However, GR tells us that in the…

High Energy Physics - Theory · Physics 2008-11-26 Yuval Ne'eman

We formulate a theory of shape valid for objects of arbitrary dimension whose contours are path connected. We apply this theory to the design and modeling of viable trajectories of complex dynamical systems. Infinite families of…

Numerical Analysis · Mathematics 2021-10-11 Vladimir García-Morales

A closed universe with maximum life-time is constructed using optimal control. Einstein's field equations are used with varying cosmological "constant". The second time derivative of the Hubble parameter acts as the control function in the…

General Relativity and Quantum Cosmology · Physics 2019-05-29 Salah Haggag , Samy A. Abdel-Hafeez , Moutaz Ramadan

We study the theory of a global field k as a k-vector space with a predicate for one of the absolute values on k. For example, we prove that in this language a global field with an ultrametric or real archimedean absolute value has a…

Logic · Mathematics 2026-03-27 Arno Fehm , Pierre Touchard

We prove completeness, interpolation, decidability and an omitting types theorem for certain multi dimensional modal logics where the states are not abstract entities but have an inner structure. The states will be sequences. Our approach…

Logic · Mathematics 2013-02-14 Tarek Sayed Ahmed , Mohammad Assem

We define the notion of ordinal computability by generalizing standard Turing computability on tapes of length $\omega$ to computations on tapes of arbitrary ordinal length. We show that a set of ordinals is ordinal computable from a finite…

Logic · Mathematics 2007-05-23 Peter Koepke

NF set theory using intuitionistic logic is called iNF. We develop the theories of finite sets and their power sets and mappings, finite cardinals and their ordering, cardinal exponentiation, addition, and multiplication. We follow Rosser…

Logic · Mathematics 2025-10-31 Michael Beeson

Exponential-constructible functions are an extension of the class of constructible functions. This extension was formulated by Cluckers-Loeser in the context of semi-algebraic and sub-analytic structures, when they studied stability under…

Logic · Mathematics 2018-02-26 Saskia Chambille , Pablo Cubides Kovacsics , Eva Leenknegt

We develop a constructive theory of continuous domains from the perspective of program extraction. Our goal that programs represent (provably correct) computation without witnesses of correctness is achieved by formulating correctness…

Logic in Computer Science · Computer Science 2023-06-22 Dirk Pattinson , Mina Mohammadian

We introduce the notion of implicative algebra, a simple algebraic structure intended to factorize the model constructions underlying forcing and realizability (both in intuitionistic and classical logic). The salient feature of this…

Logic · Mathematics 2020-07-15 Alexandre Miquel

In this paper, we introduce a foundation for computable model theory of rational Pavelka logic (an extension of {\L}ukasiewicz logic) and continuous logic, and prove effective versions of some theorems in model theory. We show how to reduce…

Logic · Mathematics 2010-06-14 Farzad Didehvar , Kaveh Ghasemloo , Massoud Pourmahdian

We argue that whether the universe is infinite or finite is less crucial than usually supposed. Paradoxes of repeating behaviour in the infinite, or eternal inflationary, universe can be alleviated by a realistic definition of differing…

General Relativity and Quantum Cosmology · Physics 2009-11-10 D. H. Coule